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, 2004 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 it's 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 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->x_naked_return_label = NULL;
456 f->computed_goto_common_label = NULL;
457 f->computed_goto_common_reg = NULL;
458 f->x_save_expr_regs = NULL;
459 f->x_stack_slot_list = NULL;
460 f->x_rtl_expr_chain = NULL;
461 f->x_tail_recursion_label = NULL;
462 f->x_tail_recursion_reentry = NULL;
463 f->x_arg_pointer_save_area = NULL;
464 f->x_clobber_return_insn = NULL;
465 f->x_context_display = NULL;
466 f->x_trampoline_list = NULL;
467 f->x_parm_birth_insn = NULL;
468 f->x_last_parm_insn = NULL;
469 f->x_parm_reg_stack_loc = NULL;
470 f->fixup_var_refs_queue = NULL;
471 f->original_arg_vector = NULL;
472 f->original_decl_initial = NULL;
473 f->inl_last_parm_insn = NULL;
474 f->epilogue_delay_list = NULL;
477 /* Allocate fixed slots in the stack frame of the current function. */
479 /* Return size needed for stack frame based on slots so far allocated in
481 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
482 the caller may have to do that. */
485 get_func_frame_size (struct function *f)
487 #ifdef FRAME_GROWS_DOWNWARD
488 return -f->x_frame_offset;
490 return f->x_frame_offset;
494 /* Return size needed for stack frame based on slots so far allocated.
495 This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
496 the caller may have to do that. */
498 get_frame_size (void)
500 return get_func_frame_size (cfun);
503 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
504 with machine mode MODE.
506 ALIGN controls the amount of alignment for the address of the slot:
507 0 means according to MODE,
508 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
509 positive specifies alignment boundary in bits.
511 We do not round to stack_boundary here.
513 FUNCTION specifies the function to allocate in. */
516 assign_stack_local_1 (enum machine_mode mode, HOST_WIDE_INT size, int align,
517 struct function *function)
520 int bigend_correction = 0;
522 int frame_off, frame_alignment, frame_phase;
529 alignment = BIGGEST_ALIGNMENT;
531 alignment = GET_MODE_ALIGNMENT (mode);
533 /* Allow the target to (possibly) increase the alignment of this
535 type = lang_hooks.types.type_for_mode (mode, 0);
537 alignment = LOCAL_ALIGNMENT (type, alignment);
539 alignment /= BITS_PER_UNIT;
541 else if (align == -1)
543 alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
544 size = CEIL_ROUND (size, alignment);
547 alignment = align / BITS_PER_UNIT;
549 #ifdef FRAME_GROWS_DOWNWARD
550 function->x_frame_offset -= size;
553 /* Ignore alignment we can't do with expected alignment of the boundary. */
554 if (alignment * BITS_PER_UNIT > PREFERRED_STACK_BOUNDARY)
555 alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
557 if (function->stack_alignment_needed < alignment * BITS_PER_UNIT)
558 function->stack_alignment_needed = alignment * BITS_PER_UNIT;
560 /* Calculate how many bytes the start of local variables is off from
562 frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
563 frame_off = STARTING_FRAME_OFFSET % frame_alignment;
564 frame_phase = frame_off ? frame_alignment - frame_off : 0;
566 /* Round the frame offset to the specified alignment. The default is
567 to always honor requests to align the stack but a port may choose to
568 do its own stack alignment by defining STACK_ALIGNMENT_NEEDED. */
569 if (STACK_ALIGNMENT_NEEDED
573 /* We must be careful here, since FRAME_OFFSET might be negative and
574 division with a negative dividend isn't as well defined as we might
575 like. So we instead assume that ALIGNMENT is a power of two and
576 use logical operations which are unambiguous. */
577 #ifdef FRAME_GROWS_DOWNWARD
578 function->x_frame_offset
579 = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
582 function->x_frame_offset
583 = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
588 /* On a big-endian machine, if we are allocating more space than we will use,
589 use the least significant bytes of those that are allocated. */
590 if (BYTES_BIG_ENDIAN && mode != BLKmode)
591 bigend_correction = size - GET_MODE_SIZE (mode);
593 /* If we have already instantiated virtual registers, return the actual
594 address relative to the frame pointer. */
595 if (function == cfun && virtuals_instantiated)
596 addr = plus_constant (frame_pointer_rtx,
598 (frame_offset + bigend_correction
599 + STARTING_FRAME_OFFSET, Pmode));
601 addr = plus_constant (virtual_stack_vars_rtx,
603 (function->x_frame_offset + bigend_correction,
606 #ifndef FRAME_GROWS_DOWNWARD
607 function->x_frame_offset += size;
610 x = gen_rtx_MEM (mode, addr);
612 function->x_stack_slot_list
613 = gen_rtx_EXPR_LIST (VOIDmode, x, function->x_stack_slot_list);
618 /* Wrapper around assign_stack_local_1; assign a local stack slot for the
622 assign_stack_local (enum machine_mode mode, HOST_WIDE_INT size, int align)
624 return assign_stack_local_1 (mode, size, align, cfun);
627 /* Allocate a temporary stack slot and record it for possible later
630 MODE is the machine mode to be given to the returned rtx.
632 SIZE is the size in units of the space required. We do no rounding here
633 since assign_stack_local will do any required rounding.
635 KEEP is 1 if this slot is to be retained after a call to
636 free_temp_slots. Automatic variables for a block are allocated
637 with this flag. KEEP is 2 if we allocate a longer term temporary,
638 whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
639 if we are to allocate something at an inner level to be treated as
640 a variable in the block (e.g., a SAVE_EXPR).
642 TYPE is the type that will be used for the stack slot. */
645 assign_stack_temp_for_type (enum machine_mode mode, HOST_WIDE_INT size, int keep,
649 struct temp_slot *p, *best_p = 0;
652 /* If SIZE is -1 it means that somebody tried to allocate a temporary
653 of a variable size. */
658 align = BIGGEST_ALIGNMENT;
660 align = GET_MODE_ALIGNMENT (mode);
663 type = lang_hooks.types.type_for_mode (mode, 0);
666 align = LOCAL_ALIGNMENT (type, align);
668 /* Try to find an available, already-allocated temporary of the proper
669 mode which meets the size and alignment requirements. Choose the
670 smallest one with the closest alignment. */
671 for (p = temp_slots; p; p = p->next)
672 if (p->align >= align && p->size >= size && GET_MODE (p->slot) == mode
674 && objects_must_conflict_p (p->type, type)
675 && (best_p == 0 || best_p->size > p->size
676 || (best_p->size == p->size && best_p->align > p->align)))
678 if (p->align == align && p->size == size)
686 /* Make our best, if any, the one to use. */
689 /* If there are enough aligned bytes left over, make them into a new
690 temp_slot so that the extra bytes don't get wasted. Do this only
691 for BLKmode slots, so that we can be sure of the alignment. */
692 if (GET_MODE (best_p->slot) == BLKmode)
694 int alignment = best_p->align / BITS_PER_UNIT;
695 HOST_WIDE_INT rounded_size = CEIL_ROUND (size, alignment);
697 if (best_p->size - rounded_size >= alignment)
699 p = ggc_alloc (sizeof (struct temp_slot));
700 p->in_use = p->addr_taken = 0;
701 p->size = best_p->size - rounded_size;
702 p->base_offset = best_p->base_offset + rounded_size;
703 p->full_size = best_p->full_size - rounded_size;
704 p->slot = gen_rtx_MEM (BLKmode,
705 plus_constant (XEXP (best_p->slot, 0),
707 p->align = best_p->align;
710 p->type = best_p->type;
711 p->next = temp_slots;
714 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, p->slot,
717 best_p->size = rounded_size;
718 best_p->full_size = rounded_size;
725 /* If we still didn't find one, make a new temporary. */
728 HOST_WIDE_INT frame_offset_old = frame_offset;
730 p = ggc_alloc (sizeof (struct temp_slot));
732 /* We are passing an explicit alignment request to assign_stack_local.
733 One side effect of that is assign_stack_local will not round SIZE
734 to ensure the frame offset remains suitably aligned.
736 So for requests which depended on the rounding of SIZE, we go ahead
737 and round it now. We also make sure ALIGNMENT is at least
738 BIGGEST_ALIGNMENT. */
739 if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
741 p->slot = assign_stack_local (mode,
743 ? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
749 /* The following slot size computation is necessary because we don't
750 know the actual size of the temporary slot until assign_stack_local
751 has performed all the frame alignment and size rounding for the
752 requested temporary. Note that extra space added for alignment
753 can be either above or below this stack slot depending on which
754 way the frame grows. We include the extra space if and only if it
755 is above this slot. */
756 #ifdef FRAME_GROWS_DOWNWARD
757 p->size = frame_offset_old - frame_offset;
762 /* Now define the fields used by combine_temp_slots. */
763 #ifdef FRAME_GROWS_DOWNWARD
764 p->base_offset = frame_offset;
765 p->full_size = frame_offset_old - frame_offset;
767 p->base_offset = frame_offset_old;
768 p->full_size = frame_offset - frame_offset_old;
771 p->next = temp_slots;
777 p->rtl_expr = seq_rtl_expr;
782 p->level = target_temp_slot_level;
787 p->level = var_temp_slot_level;
792 p->level = temp_slot_level;
797 /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
798 slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
799 stack_slot_list = gen_rtx_EXPR_LIST (VOIDmode, slot, stack_slot_list);
801 /* If we know the alias set for the memory that will be used, use
802 it. If there's no TYPE, then we don't know anything about the
803 alias set for the memory. */
804 set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
805 set_mem_align (slot, align);
807 /* If a type is specified, set the relevant flags. */
810 RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
811 && TYPE_READONLY (type));
812 MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
813 MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
819 /* Allocate a temporary stack slot and record it for possible later
820 reuse. First three arguments are same as in preceding function. */
823 assign_stack_temp (enum machine_mode mode, HOST_WIDE_INT size, int keep)
825 return assign_stack_temp_for_type (mode, size, keep, NULL_TREE);
828 /* Assign a temporary.
829 If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
830 and so that should be used in error messages. In either case, we
831 allocate of the given type.
832 KEEP is as for assign_stack_temp.
833 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
834 it is 0 if a register is OK.
835 DONT_PROMOTE is 1 if we should not promote values in register
839 assign_temp (tree type_or_decl, int keep, int memory_required,
840 int dont_promote ATTRIBUTE_UNUSED)
843 enum machine_mode mode;
844 #ifndef PROMOTE_FOR_CALL_ONLY
848 if (DECL_P (type_or_decl))
849 decl = type_or_decl, type = TREE_TYPE (decl);
851 decl = NULL, type = type_or_decl;
853 mode = TYPE_MODE (type);
854 #ifndef PROMOTE_FOR_CALL_ONLY
855 unsignedp = TYPE_UNSIGNED (type);
858 if (mode == BLKmode || memory_required)
860 HOST_WIDE_INT size = int_size_in_bytes (type);
863 /* Zero sized arrays are GNU C extension. Set size to 1 to avoid
864 problems with allocating the stack space. */
868 /* Unfortunately, we don't yet know how to allocate variable-sized
869 temporaries. However, sometimes we have a fixed upper limit on
870 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
871 instead. This is the case for Chill variable-sized strings. */
872 if (size == -1 && TREE_CODE (type) == ARRAY_TYPE
873 && TYPE_ARRAY_MAX_SIZE (type) != NULL_TREE
874 && host_integerp (TYPE_ARRAY_MAX_SIZE (type), 1))
875 size = tree_low_cst (TYPE_ARRAY_MAX_SIZE (type), 1);
877 /* The size of the temporary may be too large to fit into an integer. */
878 /* ??? Not sure this should happen except for user silliness, so limit
879 this to things that aren't compiler-generated temporaries. The
880 rest of the time we'll abort in assign_stack_temp_for_type. */
881 if (decl && size == -1
882 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
884 error ("%Jsize of variable '%D' is too large", decl, decl);
888 tmp = assign_stack_temp_for_type (mode, size, keep, type);
892 #ifndef PROMOTE_FOR_CALL_ONLY
894 mode = promote_mode (type, mode, &unsignedp, 0);
897 return gen_reg_rtx (mode);
900 /* Combine temporary stack slots which are adjacent on the stack.
902 This allows for better use of already allocated stack space. This is only
903 done for BLKmode slots because we can be sure that we won't have alignment
904 problems in this case. */
907 combine_temp_slots (void)
909 struct temp_slot *p, *q;
910 struct temp_slot *prev_p, *prev_q;
913 /* We can't combine slots, because the information about which slot
914 is in which alias set will be lost. */
915 if (flag_strict_aliasing)
918 /* If there are a lot of temp slots, don't do anything unless
919 high levels of optimization. */
920 if (! flag_expensive_optimizations)
921 for (p = temp_slots, num_slots = 0; p; p = p->next, num_slots++)
922 if (num_slots > 100 || (num_slots > 10 && optimize == 0))
925 for (p = temp_slots, prev_p = 0; p; p = prev_p ? prev_p->next : temp_slots)
929 if (! p->in_use && GET_MODE (p->slot) == BLKmode)
930 for (q = p->next, prev_q = p; q; q = prev_q->next)
933 if (! q->in_use && GET_MODE (q->slot) == BLKmode)
935 if (p->base_offset + p->full_size == q->base_offset)
937 /* Q comes after P; combine Q into P. */
939 p->full_size += q->full_size;
942 else if (q->base_offset + q->full_size == p->base_offset)
944 /* P comes after Q; combine P into Q. */
946 q->full_size += p->full_size;
951 /* Either delete Q or advance past it. */
953 prev_q->next = q->next;
957 /* Either delete P or advance past it. */
961 prev_p->next = p->next;
963 temp_slots = p->next;
970 /* Find the temp slot corresponding to the object at address X. */
972 static struct temp_slot *
973 find_temp_slot_from_address (rtx x)
978 for (p = temp_slots; p; p = p->next)
983 else if (XEXP (p->slot, 0) == x
985 || (GET_CODE (x) == PLUS
986 && XEXP (x, 0) == virtual_stack_vars_rtx
987 && GET_CODE (XEXP (x, 1)) == CONST_INT
988 && INTVAL (XEXP (x, 1)) >= p->base_offset
989 && INTVAL (XEXP (x, 1)) < p->base_offset + p->full_size))
992 else if (p->address != 0 && GET_CODE (p->address) == EXPR_LIST)
993 for (next = p->address; next; next = XEXP (next, 1))
994 if (XEXP (next, 0) == x)
998 /* If we have a sum involving a register, see if it points to a temp
1000 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 0)) == REG
1001 && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
1003 else if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == REG
1004 && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
1010 /* Indicate that NEW is an alternate way of referring to the temp slot
1011 that previously was known by OLD. */
1014 update_temp_slot_address (rtx old, rtx new)
1016 struct temp_slot *p;
1018 if (rtx_equal_p (old, new))
1021 p = find_temp_slot_from_address (old);
1023 /* If we didn't find one, see if both OLD is a PLUS. If so, and NEW
1024 is a register, see if one operand of the PLUS is a temporary
1025 location. If so, NEW points into it. Otherwise, if both OLD and
1026 NEW are a PLUS and if there is a register in common between them.
1027 If so, try a recursive call on those values. */
1030 if (GET_CODE (old) != PLUS)
1033 if (GET_CODE (new) == REG)
1035 update_temp_slot_address (XEXP (old, 0), new);
1036 update_temp_slot_address (XEXP (old, 1), new);
1039 else if (GET_CODE (new) != PLUS)
1042 if (rtx_equal_p (XEXP (old, 0), XEXP (new, 0)))
1043 update_temp_slot_address (XEXP (old, 1), XEXP (new, 1));
1044 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 0)))
1045 update_temp_slot_address (XEXP (old, 0), XEXP (new, 1));
1046 else if (rtx_equal_p (XEXP (old, 0), XEXP (new, 1)))
1047 update_temp_slot_address (XEXP (old, 1), XEXP (new, 0));
1048 else if (rtx_equal_p (XEXP (old, 1), XEXP (new, 1)))
1049 update_temp_slot_address (XEXP (old, 0), XEXP (new, 0));
1054 /* Otherwise add an alias for the temp's address. */
1055 else if (p->address == 0)
1059 if (GET_CODE (p->address) != EXPR_LIST)
1060 p->address = gen_rtx_EXPR_LIST (VOIDmode, p->address, NULL_RTX);
1062 p->address = gen_rtx_EXPR_LIST (VOIDmode, new, p->address);
1066 /* If X could be a reference to a temporary slot, mark the fact that its
1067 address was taken. */
1070 mark_temp_addr_taken (rtx x)
1072 struct temp_slot *p;
1077 /* If X is not in memory or is at a constant address, it cannot be in
1078 a temporary slot. */
1079 if (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1082 p = find_temp_slot_from_address (XEXP (x, 0));
1087 /* If X could be a reference to a temporary slot, mark that slot as
1088 belonging to the to one level higher than the current level. If X
1089 matched one of our slots, just mark that one. Otherwise, we can't
1090 easily predict which it is, so upgrade all of them. Kept slots
1091 need not be touched.
1093 This is called when an ({...}) construct occurs and a statement
1094 returns a value in memory. */
1097 preserve_temp_slots (rtx x)
1099 struct temp_slot *p = 0;
1101 /* If there is no result, we still might have some objects whose address
1102 were taken, so we need to make sure they stay around. */
1105 for (p = temp_slots; p; p = p->next)
1106 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1112 /* If X is a register that is being used as a pointer, see if we have
1113 a temporary slot we know it points to. To be consistent with
1114 the code below, we really should preserve all non-kept slots
1115 if we can't find a match, but that seems to be much too costly. */
1116 if (GET_CODE (x) == REG && REG_POINTER (x))
1117 p = find_temp_slot_from_address (x);
1119 /* If X is not in memory or is at a constant address, it cannot be in
1120 a temporary slot, but it can contain something whose address was
1122 if (p == 0 && (GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0))))
1124 for (p = temp_slots; p; p = p->next)
1125 if (p->in_use && p->level == temp_slot_level && p->addr_taken)
1131 /* First see if we can find a match. */
1133 p = find_temp_slot_from_address (XEXP (x, 0));
1137 /* Move everything at our level whose address was taken to our new
1138 level in case we used its address. */
1139 struct temp_slot *q;
1141 if (p->level == temp_slot_level)
1143 for (q = temp_slots; q; q = q->next)
1144 if (q != p && q->addr_taken && q->level == p->level)
1153 /* Otherwise, preserve all non-kept slots at this level. */
1154 for (p = temp_slots; p; p = p->next)
1155 if (p->in_use && p->level == temp_slot_level && ! p->keep)
1159 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1160 with that RTL_EXPR, promote it into a temporary slot at the present
1161 level so it will not be freed when we free slots made in the
1165 preserve_rtl_expr_result (rtx x)
1167 struct temp_slot *p;
1169 /* If X is not in memory or is at a constant address, it cannot be in
1170 a temporary slot. */
1171 if (x == 0 || GET_CODE (x) != MEM || CONSTANT_P (XEXP (x, 0)))
1174 /* If we can find a match, move it to our level unless it is already at
1176 p = find_temp_slot_from_address (XEXP (x, 0));
1179 p->level = MIN (p->level, temp_slot_level);
1186 /* Free all temporaries used so far. This is normally called at the end
1187 of generating code for a statement. Don't free any temporaries
1188 currently in use for an RTL_EXPR that hasn't yet been emitted.
1189 We could eventually do better than this since it can be reused while
1190 generating the same RTL_EXPR, but this is complex and probably not
1194 free_temp_slots (void)
1196 struct temp_slot *p;
1198 for (p = temp_slots; p; p = p->next)
1199 if (p->in_use && p->level == temp_slot_level && ! p->keep
1200 && p->rtl_expr == 0)
1203 combine_temp_slots ();
1206 /* Free all temporary slots used in T, an RTL_EXPR node. */
1209 free_temps_for_rtl_expr (tree t)
1211 struct temp_slot *p;
1213 for (p = temp_slots; p; p = p->next)
1214 if (p->rtl_expr == t)
1216 /* If this slot is below the current TEMP_SLOT_LEVEL, then it
1217 needs to be preserved. This can happen if a temporary in
1218 the RTL_EXPR was addressed; preserve_temp_slots will move
1219 the temporary into a higher level. */
1220 if (temp_slot_level <= p->level)
1223 p->rtl_expr = NULL_TREE;
1226 combine_temp_slots ();
1229 /* Mark all temporaries ever allocated in this function as not suitable
1230 for reuse until the current level is exited. */
1233 mark_all_temps_used (void)
1235 struct temp_slot *p;
1237 for (p = temp_slots; p; p = p->next)
1239 p->in_use = p->keep = 1;
1240 p->level = MIN (p->level, temp_slot_level);
1244 /* Push deeper into the nesting level for stack temporaries. */
1247 push_temp_slots (void)
1252 /* Pop a temporary nesting level. All slots in use in the current level
1256 pop_temp_slots (void)
1258 struct temp_slot *p;
1260 for (p = temp_slots; p; p = p->next)
1261 if (p->in_use && p->level == temp_slot_level && p->rtl_expr == 0)
1264 combine_temp_slots ();
1269 /* Initialize temporary slots. */
1272 init_temp_slots (void)
1274 /* We have not allocated any temporaries yet. */
1276 temp_slot_level = 0;
1277 var_temp_slot_level = 0;
1278 target_temp_slot_level = 0;
1281 /* Retroactively move an auto variable from a register to a stack
1282 slot. This is done when an address-reference to the variable is
1283 seen. If RESCAN is true, all previously emitted instructions are
1284 examined and modified to handle the fact that DECL is now
1288 put_var_into_stack (tree decl, int rescan)
1291 enum machine_mode promoted_mode, decl_mode;
1292 struct function *function = 0;
1294 int can_use_addressof;
1295 int volatilep = TREE_CODE (decl) != SAVE_EXPR && TREE_THIS_VOLATILE (decl);
1296 int usedp = (TREE_USED (decl)
1297 || (TREE_CODE (decl) != SAVE_EXPR && DECL_INITIAL (decl) != 0));
1299 context = decl_function_context (decl);
1301 /* Get the current rtl used for this object and its original mode. */
1302 orig_reg = reg = (TREE_CODE (decl) == SAVE_EXPR
1303 ? SAVE_EXPR_RTL (decl)
1304 : DECL_RTL_IF_SET (decl));
1306 /* No need to do anything if decl has no rtx yet
1307 since in that case caller is setting TREE_ADDRESSABLE
1308 and a stack slot will be assigned when the rtl is made. */
1312 /* Get the declared mode for this object. */
1313 decl_mode = (TREE_CODE (decl) == SAVE_EXPR ? TYPE_MODE (TREE_TYPE (decl))
1314 : DECL_MODE (decl));
1315 /* Get the mode it's actually stored in. */
1316 promoted_mode = GET_MODE (reg);
1318 /* If this variable comes from an outer function, find that
1319 function's saved context. Don't use find_function_data here,
1320 because it might not be in any active function.
1321 FIXME: Is that really supposed to happen?
1322 It does in ObjC at least. */
1323 if (context != current_function_decl && context != inline_function_decl)
1324 for (function = outer_function_chain; function; function = function->outer)
1325 if (function->decl == context)
1328 /* If this is a variable-sized object or a structure passed by invisible
1329 reference, with a pseudo to address it, put that pseudo into the stack
1330 if the var is non-local. */
1331 if (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl)
1332 && GET_CODE (reg) == MEM
1333 && GET_CODE (XEXP (reg, 0)) == REG
1334 && REGNO (XEXP (reg, 0)) > LAST_VIRTUAL_REGISTER)
1336 orig_reg = reg = XEXP (reg, 0);
1337 decl_mode = promoted_mode = GET_MODE (reg);
1340 /* If this variable lives in the current function and we don't need to put it
1341 in the stack for the sake of setjmp or the non-locality, try to keep it in
1342 a register until we know we actually need the address. */
1345 && ! (TREE_CODE (decl) != SAVE_EXPR && DECL_NONLOCAL (decl))
1347 /* FIXME make it work for promoted modes too */
1348 && decl_mode == promoted_mode
1349 #ifdef NON_SAVING_SETJMP
1350 && ! (NON_SAVING_SETJMP && current_function_calls_setjmp)
1354 /* If we can't use ADDRESSOF, make sure we see through one we already
1356 if (! can_use_addressof && GET_CODE (reg) == MEM
1357 && GET_CODE (XEXP (reg, 0)) == ADDRESSOF)
1358 reg = XEXP (XEXP (reg, 0), 0);
1360 /* Now we should have a value that resides in one or more pseudo regs. */
1362 if (GET_CODE (reg) == REG)
1364 if (can_use_addressof)
1365 gen_mem_addressof (reg, decl, rescan);
1367 put_reg_into_stack (function, reg, TREE_TYPE (decl), promoted_mode,
1368 decl_mode, volatilep, 0, usedp, 0);
1370 /* If this was previously a MEM but we've removed the ADDRESSOF,
1371 set this address into that MEM so we always use the same
1372 rtx for this variable. */
1373 if (orig_reg != reg && GET_CODE (orig_reg) == MEM)
1374 XEXP (orig_reg, 0) = XEXP (reg, 0);
1376 else if (GET_CODE (reg) == CONCAT)
1378 /* A CONCAT contains two pseudos; put them both in the stack.
1379 We do it so they end up consecutive.
1380 We fixup references to the parts only after we fixup references
1381 to the whole CONCAT, lest we do double fixups for the latter
1383 enum machine_mode part_mode = GET_MODE (XEXP (reg, 0));
1384 tree part_type = lang_hooks.types.type_for_mode (part_mode, 0);
1385 rtx lopart = XEXP (reg, 0);
1386 rtx hipart = XEXP (reg, 1);
1387 #ifdef FRAME_GROWS_DOWNWARD
1388 /* Since part 0 should have a lower address, do it second. */
1389 put_reg_into_stack (function, hipart, part_type, part_mode,
1390 part_mode, volatilep, 0, 0, 0);
1391 put_reg_into_stack (function, lopart, part_type, part_mode,
1392 part_mode, volatilep, 0, 0, 0);
1394 put_reg_into_stack (function, lopart, part_type, part_mode,
1395 part_mode, volatilep, 0, 0, 0);
1396 put_reg_into_stack (function, hipart, part_type, part_mode,
1397 part_mode, volatilep, 0, 0, 0);
1400 /* Change the CONCAT into a combined MEM for both parts. */
1401 PUT_CODE (reg, MEM);
1402 MEM_ATTRS (reg) = 0;
1404 /* set_mem_attributes uses DECL_RTL to avoid re-generating of
1405 already computed alias sets. Here we want to re-generate. */
1407 SET_DECL_RTL (decl, NULL);
1408 set_mem_attributes (reg, decl, 1);
1410 SET_DECL_RTL (decl, reg);
1412 /* The two parts are in memory order already.
1413 Use the lower parts address as ours. */
1414 XEXP (reg, 0) = XEXP (XEXP (reg, 0), 0);
1415 /* Prevent sharing of rtl that might lose. */
1416 if (GET_CODE (XEXP (reg, 0)) == PLUS)
1417 XEXP (reg, 0) = copy_rtx (XEXP (reg, 0));
1418 if (usedp && rescan)
1420 schedule_fixup_var_refs (function, reg, TREE_TYPE (decl),
1422 schedule_fixup_var_refs (function, lopart, part_type, part_mode, 0);
1423 schedule_fixup_var_refs (function, hipart, part_type, part_mode, 0);
1430 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1431 into the stack frame of FUNCTION (0 means the current function).
1432 DECL_MODE is the machine mode of the user-level data type.
1433 PROMOTED_MODE is the machine mode of the register.
1434 VOLATILE_P is nonzero if this is for a "volatile" decl.
1435 USED_P is nonzero if this reg might have already been used in an insn. */
1438 put_reg_into_stack (struct function *function, rtx reg, tree type,
1439 enum machine_mode promoted_mode,
1440 enum machine_mode decl_mode, int volatile_p,
1441 unsigned int original_regno, int used_p, htab_t ht)
1443 struct function *func = function ? function : cfun;
1445 unsigned int regno = original_regno;
1448 regno = REGNO (reg);
1450 if (regno < func->x_max_parm_reg)
1452 if (!func->x_parm_reg_stack_loc)
1454 new = func->x_parm_reg_stack_loc[regno];
1458 new = assign_stack_local_1 (decl_mode, GET_MODE_SIZE (decl_mode), 0, func);
1460 PUT_CODE (reg, MEM);
1461 PUT_MODE (reg, decl_mode);
1462 XEXP (reg, 0) = XEXP (new, 0);
1463 MEM_ATTRS (reg) = 0;
1464 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1465 MEM_VOLATILE_P (reg) = volatile_p;
1467 /* If this is a memory ref that contains aggregate components,
1468 mark it as such for cse and loop optimize. If we are reusing a
1469 previously generated stack slot, then we need to copy the bit in
1470 case it was set for other reasons. For instance, it is set for
1471 __builtin_va_alist. */
1474 MEM_SET_IN_STRUCT_P (reg,
1475 AGGREGATE_TYPE_P (type) || MEM_IN_STRUCT_P (new));
1476 set_mem_alias_set (reg, get_alias_set (type));
1480 schedule_fixup_var_refs (function, reg, type, promoted_mode, ht);
1483 /* Make sure that all refs to the variable, previously made
1484 when it was a register, are fixed up to be valid again.
1485 See function above for meaning of arguments. */
1488 schedule_fixup_var_refs (struct function *function, rtx reg, tree type,
1489 enum machine_mode promoted_mode, htab_t ht)
1491 int unsigned_p = type ? TYPE_UNSIGNED (type) : 0;
1495 struct var_refs_queue *temp;
1497 temp = ggc_alloc (sizeof (struct var_refs_queue));
1498 temp->modified = reg;
1499 temp->promoted_mode = promoted_mode;
1500 temp->unsignedp = unsigned_p;
1501 temp->next = function->fixup_var_refs_queue;
1502 function->fixup_var_refs_queue = temp;
1505 /* Variable is local; fix it up now. */
1506 fixup_var_refs (reg, promoted_mode, unsigned_p, reg, ht);
1510 fixup_var_refs (rtx var, enum machine_mode promoted_mode, int unsignedp,
1511 rtx may_share, htab_t ht)
1514 rtx first_insn = get_insns ();
1515 struct sequence_stack *stack = seq_stack;
1516 tree rtl_exps = rtl_expr_chain;
1517 int save_volatile_ok = volatile_ok;
1519 /* If there's a hash table, it must record all uses of VAR. */
1524 fixup_var_refs_insns_with_hash (ht, var, promoted_mode, unsignedp,
1529 /* Volatile is valid in MEMs because all we're doing in changing the
1532 fixup_var_refs_insns (first_insn, var, promoted_mode, unsignedp,
1533 stack == 0, may_share);
1535 /* Scan all pending sequences too. */
1536 for (; stack; stack = stack->next)
1538 push_to_full_sequence (stack->first, stack->last);
1539 fixup_var_refs_insns (stack->first, var, promoted_mode, unsignedp,
1540 stack->next != 0, may_share);
1541 /* Update remembered end of sequence
1542 in case we added an insn at the end. */
1543 stack->last = get_last_insn ();
1547 /* Scan all waiting RTL_EXPRs too. */
1548 for (pending = rtl_exps; pending; pending = TREE_CHAIN (pending))
1550 rtx seq = RTL_EXPR_SEQUENCE (TREE_VALUE (pending));
1551 if (seq != const0_rtx && seq != 0)
1553 push_to_sequence (seq);
1554 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1560 volatile_ok = save_volatile_ok;
1563 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1564 some part of an insn. Return a struct fixup_replacement whose OLD
1565 value is equal to X. Allocate a new structure if no such entry exists. */
1567 static struct fixup_replacement *
1568 find_fixup_replacement (struct fixup_replacement **replacements, rtx x)
1570 struct fixup_replacement *p;
1572 /* See if we have already replaced this. */
1573 for (p = *replacements; p != 0 && ! rtx_equal_p (p->old, x); p = p->next)
1578 p = xmalloc (sizeof (struct fixup_replacement));
1581 p->next = *replacements;
1588 /* Scan the insn-chain starting with INSN for refs to VAR and fix them
1589 up. TOPLEVEL is nonzero if this chain is the main chain of insns
1590 for the current function. MAY_SHARE is either a MEM that is not
1591 to be unshared or a list of them. */
1594 fixup_var_refs_insns (rtx insn, rtx var, enum machine_mode promoted_mode,
1595 int unsignedp, int toplevel, rtx may_share)
1599 /* fixup_var_refs_insn might modify insn, so save its next
1601 rtx next = NEXT_INSN (insn);
1603 /* CALL_PLACEHOLDERs are special; we have to switch into each of
1604 the three sequences they (potentially) contain, and process
1605 them recursively. The CALL_INSN itself is not interesting. */
1607 if (GET_CODE (insn) == CALL_INSN
1608 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1612 /* Look at the Normal call, sibling call and tail recursion
1613 sequences attached to the CALL_PLACEHOLDER. */
1614 for (i = 0; i < 3; i++)
1616 rtx seq = XEXP (PATTERN (insn), i);
1619 push_to_sequence (seq);
1620 fixup_var_refs_insns (seq, var, promoted_mode, unsignedp, 0,
1622 XEXP (PATTERN (insn), i) = get_insns ();
1628 else if (INSN_P (insn))
1629 fixup_var_refs_insn (insn, var, promoted_mode, unsignedp, toplevel,
1636 /* Look up the insns which reference VAR in HT and fix them up. Other
1637 arguments are the same as fixup_var_refs_insns.
1639 N.B. No need for special processing of CALL_PLACEHOLDERs here,
1640 because the hash table will point straight to the interesting insn
1641 (inside the CALL_PLACEHOLDER). */
1644 fixup_var_refs_insns_with_hash (htab_t ht, rtx var, enum machine_mode promoted_mode,
1645 int unsignedp, rtx may_share)
1647 struct insns_for_mem_entry tmp;
1648 struct insns_for_mem_entry *ime;
1652 ime = htab_find (ht, &tmp);
1653 for (insn_list = ime->insns; insn_list != 0; insn_list = XEXP (insn_list, 1))
1654 if (INSN_P (XEXP (insn_list, 0)))
1655 fixup_var_refs_insn (XEXP (insn_list, 0), var, promoted_mode,
1656 unsignedp, 1, may_share);
1660 /* Per-insn processing by fixup_var_refs_insns(_with_hash). INSN is
1661 the insn under examination, VAR is the variable to fix up
1662 references to, PROMOTED_MODE and UNSIGNEDP describe VAR, and
1663 TOPLEVEL is nonzero if this is the main insn chain for this
1667 fixup_var_refs_insn (rtx insn, rtx var, enum machine_mode promoted_mode,
1668 int unsignedp, int toplevel, rtx no_share)
1671 rtx set, prev, prev_set;
1674 /* Remember the notes in case we delete the insn. */
1675 note = REG_NOTES (insn);
1677 /* If this is a CLOBBER of VAR, delete it.
1679 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1680 and REG_RETVAL notes too. */
1681 if (GET_CODE (PATTERN (insn)) == CLOBBER
1682 && (XEXP (PATTERN (insn), 0) == var
1683 || (GET_CODE (XEXP (PATTERN (insn), 0)) == CONCAT
1684 && (XEXP (XEXP (PATTERN (insn), 0), 0) == var
1685 || XEXP (XEXP (PATTERN (insn), 0), 1) == var))))
1687 if ((note = find_reg_note (insn, REG_LIBCALL, NULL_RTX)) != 0)
1688 /* The REG_LIBCALL note will go away since we are going to
1689 turn INSN into a NOTE, so just delete the
1690 corresponding REG_RETVAL note. */
1691 remove_note (XEXP (note, 0),
1692 find_reg_note (XEXP (note, 0), REG_RETVAL,
1698 /* The insn to load VAR from a home in the arglist
1699 is now a no-op. When we see it, just delete it.
1700 Similarly if this is storing VAR from a register from which
1701 it was loaded in the previous insn. This will occur
1702 when an ADDRESSOF was made for an arglist slot. */
1704 && (set = single_set (insn)) != 0
1705 && SET_DEST (set) == var
1706 /* If this represents the result of an insn group,
1707 don't delete the insn. */
1708 && find_reg_note (insn, REG_RETVAL, NULL_RTX) == 0
1709 && (rtx_equal_p (SET_SRC (set), var)
1710 || (GET_CODE (SET_SRC (set)) == REG
1711 && (prev = prev_nonnote_insn (insn)) != 0
1712 && (prev_set = single_set (prev)) != 0
1713 && SET_DEST (prev_set) == SET_SRC (set)
1714 && rtx_equal_p (SET_SRC (prev_set), var))))
1720 struct fixup_replacement *replacements = 0;
1721 rtx next_insn = NEXT_INSN (insn);
1723 if (SMALL_REGISTER_CLASSES)
1725 /* If the insn that copies the results of a CALL_INSN
1726 into a pseudo now references VAR, we have to use an
1727 intermediate pseudo since we want the life of the
1728 return value register to be only a single insn.
1730 If we don't use an intermediate pseudo, such things as
1731 address computations to make the address of VAR valid
1732 if it is not can be placed between the CALL_INSN and INSN.
1734 To make sure this doesn't happen, we record the destination
1735 of the CALL_INSN and see if the next insn uses both that
1738 if (call_dest != 0 && GET_CODE (insn) == INSN
1739 && reg_mentioned_p (var, PATTERN (insn))
1740 && reg_mentioned_p (call_dest, PATTERN (insn)))
1742 rtx temp = gen_reg_rtx (GET_MODE (call_dest));
1744 emit_insn_before (gen_move_insn (temp, call_dest), insn);
1746 PATTERN (insn) = replace_rtx (PATTERN (insn),
1750 if (GET_CODE (insn) == CALL_INSN
1751 && GET_CODE (PATTERN (insn)) == SET)
1752 call_dest = SET_DEST (PATTERN (insn));
1753 else if (GET_CODE (insn) == CALL_INSN
1754 && GET_CODE (PATTERN (insn)) == PARALLEL
1755 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1756 call_dest = SET_DEST (XVECEXP (PATTERN (insn), 0, 0));
1761 /* See if we have to do anything to INSN now that VAR is in
1762 memory. If it needs to be loaded into a pseudo, use a single
1763 pseudo for the entire insn in case there is a MATCH_DUP
1764 between two operands. We pass a pointer to the head of
1765 a list of struct fixup_replacements. If fixup_var_refs_1
1766 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1767 it will record them in this list.
1769 If it allocated a pseudo for any replacement, we copy into
1772 fixup_var_refs_1 (var, promoted_mode, &PATTERN (insn), insn,
1773 &replacements, no_share);
1775 /* If this is last_parm_insn, and any instructions were output
1776 after it to fix it up, then we must set last_parm_insn to
1777 the last such instruction emitted. */
1778 if (insn == last_parm_insn)
1779 last_parm_insn = PREV_INSN (next_insn);
1781 while (replacements)
1783 struct fixup_replacement *next;
1785 if (GET_CODE (replacements->new) == REG)
1790 /* OLD might be a (subreg (mem)). */
1791 if (GET_CODE (replacements->old) == SUBREG)
1793 = fixup_memory_subreg (replacements->old, insn,
1797 = fixup_stack_1 (replacements->old, insn);
1799 insert_before = insn;
1801 /* If we are changing the mode, do a conversion.
1802 This might be wasteful, but combine.c will
1803 eliminate much of the waste. */
1805 if (GET_MODE (replacements->new)
1806 != GET_MODE (replacements->old))
1809 convert_move (replacements->new,
1810 replacements->old, unsignedp);
1815 seq = gen_move_insn (replacements->new,
1818 emit_insn_before (seq, insert_before);
1821 next = replacements->next;
1822 free (replacements);
1823 replacements = next;
1827 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1828 But don't touch other insns referred to by reg-notes;
1829 we will get them elsewhere. */
1832 if (GET_CODE (note) != INSN_LIST)
1834 = walk_fixup_memory_subreg (XEXP (note, 0), insn,
1836 note = XEXP (note, 1);
1840 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1841 See if the rtx expression at *LOC in INSN needs to be changed.
1843 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1844 contain a list of original rtx's and replacements. If we find that we need
1845 to modify this insn by replacing a memory reference with a pseudo or by
1846 making a new MEM to implement a SUBREG, we consult that list to see if
1847 we have already chosen a replacement. If none has already been allocated,
1848 we allocate it and update the list. fixup_var_refs_insn will copy VAR
1849 or the SUBREG, as appropriate, to the pseudo. */
1852 fixup_var_refs_1 (rtx var, enum machine_mode promoted_mode, rtx *loc, rtx insn,
1853 struct fixup_replacement **replacements, rtx no_share)
1857 RTX_CODE code = GET_CODE (x);
1860 struct fixup_replacement *replacement;
1865 if (XEXP (x, 0) == var)
1867 /* Prevent sharing of rtl that might lose. */
1868 rtx sub = copy_rtx (XEXP (var, 0));
1870 if (! validate_change (insn, loc, sub, 0))
1872 rtx y = gen_reg_rtx (GET_MODE (sub));
1875 /* We should be able to replace with a register or all is lost.
1876 Note that we can't use validate_change to verify this, since
1877 we're not caring for replacing all dups simultaneously. */
1878 if (! validate_replace_rtx (*loc, y, insn))
1881 /* Careful! First try to recognize a direct move of the
1882 value, mimicking how things are done in gen_reload wrt
1883 PLUS. Consider what happens when insn is a conditional
1884 move instruction and addsi3 clobbers flags. */
1887 new_insn = emit_insn (gen_rtx_SET (VOIDmode, y, sub));
1891 if (recog_memoized (new_insn) < 0)
1893 /* That failed. Fall back on force_operand and hope. */
1896 sub = force_operand (sub, y);
1898 emit_insn (gen_move_insn (y, sub));
1904 /* Don't separate setter from user. */
1905 if (PREV_INSN (insn) && sets_cc0_p (PREV_INSN (insn)))
1906 insn = PREV_INSN (insn);
1909 emit_insn_before (seq, insn);
1917 /* If we already have a replacement, use it. Otherwise,
1918 try to fix up this address in case it is invalid. */
1920 replacement = find_fixup_replacement (replacements, var);
1921 if (replacement->new)
1923 *loc = replacement->new;
1927 *loc = replacement->new = x = fixup_stack_1 (x, insn);
1929 /* Unless we are forcing memory to register or we changed the mode,
1930 we can leave things the way they are if the insn is valid. */
1932 INSN_CODE (insn) = -1;
1933 if (! flag_force_mem && GET_MODE (x) == promoted_mode
1934 && recog_memoized (insn) >= 0)
1937 *loc = replacement->new = gen_reg_rtx (promoted_mode);
1941 /* If X contains VAR, we need to unshare it here so that we update
1942 each occurrence separately. But all identical MEMs in one insn
1943 must be replaced with the same rtx because of the possibility of
1946 if (reg_mentioned_p (var, x))
1948 replacement = find_fixup_replacement (replacements, x);
1949 if (replacement->new == 0)
1950 replacement->new = copy_most_rtx (x, no_share);
1952 *loc = x = replacement->new;
1953 code = GET_CODE (x);
1970 /* Note that in some cases those types of expressions are altered
1971 by optimize_bit_field, and do not survive to get here. */
1972 if (XEXP (x, 0) == var
1973 || (GET_CODE (XEXP (x, 0)) == SUBREG
1974 && SUBREG_REG (XEXP (x, 0)) == var))
1976 /* Get TEM as a valid MEM in the mode presently in the insn.
1978 We don't worry about the possibility of MATCH_DUP here; it
1979 is highly unlikely and would be tricky to handle. */
1982 if (GET_CODE (tem) == SUBREG)
1984 if (GET_MODE_BITSIZE (GET_MODE (tem))
1985 > GET_MODE_BITSIZE (GET_MODE (var)))
1987 replacement = find_fixup_replacement (replacements, var);
1988 if (replacement->new == 0)
1989 replacement->new = gen_reg_rtx (GET_MODE (var));
1990 SUBREG_REG (tem) = replacement->new;
1992 /* The following code works only if we have a MEM, so we
1993 need to handle the subreg here. We directly substitute
1994 it assuming that a subreg must be OK here. We already
1995 scheduled a replacement to copy the mem into the
2001 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2004 tem = fixup_stack_1 (tem, insn);
2006 /* Unless we want to load from memory, get TEM into the proper mode
2007 for an extract from memory. This can only be done if the
2008 extract is at a constant position and length. */
2010 if (! flag_force_mem && GET_CODE (XEXP (x, 1)) == CONST_INT
2011 && GET_CODE (XEXP (x, 2)) == CONST_INT
2012 && ! mode_dependent_address_p (XEXP (tem, 0))
2013 && ! MEM_VOLATILE_P (tem))
2015 enum machine_mode wanted_mode = VOIDmode;
2016 enum machine_mode is_mode = GET_MODE (tem);
2017 HOST_WIDE_INT pos = INTVAL (XEXP (x, 2));
2019 if (GET_CODE (x) == ZERO_EXTRACT)
2021 enum machine_mode new_mode
2022 = mode_for_extraction (EP_extzv, 1);
2023 if (new_mode != MAX_MACHINE_MODE)
2024 wanted_mode = new_mode;
2026 else if (GET_CODE (x) == SIGN_EXTRACT)
2028 enum machine_mode new_mode
2029 = mode_for_extraction (EP_extv, 1);
2030 if (new_mode != MAX_MACHINE_MODE)
2031 wanted_mode = new_mode;
2034 /* If we have a narrower mode, we can do something. */
2035 if (wanted_mode != VOIDmode
2036 && GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2038 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2039 rtx old_pos = XEXP (x, 2);
2042 /* If the bytes and bits are counted differently, we
2043 must adjust the offset. */
2044 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2045 offset = (GET_MODE_SIZE (is_mode)
2046 - GET_MODE_SIZE (wanted_mode) - offset);
2048 pos %= GET_MODE_BITSIZE (wanted_mode);
2050 newmem = adjust_address_nv (tem, wanted_mode, offset);
2052 /* Make the change and see if the insn remains valid. */
2053 INSN_CODE (insn) = -1;
2054 XEXP (x, 0) = newmem;
2055 XEXP (x, 2) = GEN_INT (pos);
2057 if (recog_memoized (insn) >= 0)
2060 /* Otherwise, restore old position. XEXP (x, 0) will be
2062 XEXP (x, 2) = old_pos;
2066 /* If we get here, the bitfield extract insn can't accept a memory
2067 reference. Copy the input into a register. */
2069 tem1 = gen_reg_rtx (GET_MODE (tem));
2070 emit_insn_before (gen_move_insn (tem1, tem), insn);
2077 if (SUBREG_REG (x) == var)
2079 /* If this is a special SUBREG made because VAR was promoted
2080 from a wider mode, replace it with VAR and call ourself
2081 recursively, this time saying that the object previously
2082 had its current mode (by virtue of the SUBREG). */
2084 if (SUBREG_PROMOTED_VAR_P (x))
2087 fixup_var_refs_1 (var, GET_MODE (var), loc, insn, replacements,
2092 /* If this SUBREG makes VAR wider, it has become a paradoxical
2093 SUBREG with VAR in memory, but these aren't allowed at this
2094 stage of the compilation. So load VAR into a pseudo and take
2095 a SUBREG of that pseudo. */
2096 if (GET_MODE_SIZE (GET_MODE (x)) > GET_MODE_SIZE (GET_MODE (var)))
2098 replacement = find_fixup_replacement (replacements, var);
2099 if (replacement->new == 0)
2100 replacement->new = gen_reg_rtx (promoted_mode);
2101 SUBREG_REG (x) = replacement->new;
2105 /* See if we have already found a replacement for this SUBREG.
2106 If so, use it. Otherwise, make a MEM and see if the insn
2107 is recognized. If not, or if we should force MEM into a register,
2108 make a pseudo for this SUBREG. */
2109 replacement = find_fixup_replacement (replacements, x);
2110 if (replacement->new)
2112 enum machine_mode mode = GET_MODE (x);
2113 *loc = replacement->new;
2115 /* Careful! We may have just replaced a SUBREG by a MEM, which
2116 means that the insn may have become invalid again. We can't
2117 in this case make a new replacement since we already have one
2118 and we must deal with MATCH_DUPs. */
2119 if (GET_CODE (replacement->new) == MEM)
2121 INSN_CODE (insn) = -1;
2122 if (recog_memoized (insn) >= 0)
2125 fixup_var_refs_1 (replacement->new, mode, &PATTERN (insn),
2126 insn, replacements, no_share);
2132 replacement->new = *loc = fixup_memory_subreg (x, insn,
2135 INSN_CODE (insn) = -1;
2136 if (! flag_force_mem && recog_memoized (insn) >= 0)
2139 *loc = replacement->new = gen_reg_rtx (GET_MODE (x));
2145 /* First do special simplification of bit-field references. */
2146 if (GET_CODE (SET_DEST (x)) == SIGN_EXTRACT
2147 || GET_CODE (SET_DEST (x)) == ZERO_EXTRACT)
2148 optimize_bit_field (x, insn, 0);
2149 if (GET_CODE (SET_SRC (x)) == SIGN_EXTRACT
2150 || GET_CODE (SET_SRC (x)) == ZERO_EXTRACT)
2151 optimize_bit_field (x, insn, 0);
2153 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
2154 into a register and then store it back out. */
2155 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2156 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG
2157 && SUBREG_REG (XEXP (SET_DEST (x), 0)) == var
2158 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2159 > GET_MODE_SIZE (GET_MODE (var))))
2161 replacement = find_fixup_replacement (replacements, var);
2162 if (replacement->new == 0)
2163 replacement->new = gen_reg_rtx (GET_MODE (var));
2165 SUBREG_REG (XEXP (SET_DEST (x), 0)) = replacement->new;
2166 emit_insn_after (gen_move_insn (var, replacement->new), insn);
2169 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
2170 insn into a pseudo and store the low part of the pseudo into VAR. */
2171 if (GET_CODE (SET_DEST (x)) == SUBREG
2172 && SUBREG_REG (SET_DEST (x)) == var
2173 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
2174 > GET_MODE_SIZE (GET_MODE (var))))
2176 SET_DEST (x) = tem = gen_reg_rtx (GET_MODE (SET_DEST (x)));
2177 emit_insn_after (gen_move_insn (var, gen_lowpart (GET_MODE (var),
2184 rtx dest = SET_DEST (x);
2185 rtx src = SET_SRC (x);
2186 rtx outerdest = dest;
2188 while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART
2189 || GET_CODE (dest) == SIGN_EXTRACT
2190 || GET_CODE (dest) == ZERO_EXTRACT)
2191 dest = XEXP (dest, 0);
2193 if (GET_CODE (src) == SUBREG)
2194 src = SUBREG_REG (src);
2196 /* If VAR does not appear at the top level of the SET
2197 just scan the lower levels of the tree. */
2199 if (src != var && dest != var)
2202 /* We will need to rerecognize this insn. */
2203 INSN_CODE (insn) = -1;
2205 if (GET_CODE (outerdest) == ZERO_EXTRACT && dest == var
2206 && mode_for_extraction (EP_insv, -1) != MAX_MACHINE_MODE)
2208 /* Since this case will return, ensure we fixup all the
2210 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 1),
2211 insn, replacements, no_share);
2212 fixup_var_refs_1 (var, promoted_mode, &XEXP (outerdest, 2),
2213 insn, replacements, no_share);
2214 fixup_var_refs_1 (var, promoted_mode, &SET_SRC (x),
2215 insn, replacements, no_share);
2217 tem = XEXP (outerdest, 0);
2219 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
2220 that may appear inside a ZERO_EXTRACT.
2221 This was legitimate when the MEM was a REG. */
2222 if (GET_CODE (tem) == SUBREG
2223 && SUBREG_REG (tem) == var)
2224 tem = fixup_memory_subreg (tem, insn, promoted_mode, 0);
2226 tem = fixup_stack_1 (tem, insn);
2228 if (GET_CODE (XEXP (outerdest, 1)) == CONST_INT
2229 && GET_CODE (XEXP (outerdest, 2)) == CONST_INT
2230 && ! mode_dependent_address_p (XEXP (tem, 0))
2231 && ! MEM_VOLATILE_P (tem))
2233 enum machine_mode wanted_mode;
2234 enum machine_mode is_mode = GET_MODE (tem);
2235 HOST_WIDE_INT pos = INTVAL (XEXP (outerdest, 2));
2237 wanted_mode = mode_for_extraction (EP_insv, 0);
2239 /* If we have a narrower mode, we can do something. */
2240 if (GET_MODE_SIZE (wanted_mode) < GET_MODE_SIZE (is_mode))
2242 HOST_WIDE_INT offset = pos / BITS_PER_UNIT;
2243 rtx old_pos = XEXP (outerdest, 2);
2246 if (BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN)
2247 offset = (GET_MODE_SIZE (is_mode)
2248 - GET_MODE_SIZE (wanted_mode) - offset);
2250 pos %= GET_MODE_BITSIZE (wanted_mode);
2252 newmem = adjust_address_nv (tem, wanted_mode, offset);
2254 /* Make the change and see if the insn remains valid. */
2255 INSN_CODE (insn) = -1;
2256 XEXP (outerdest, 0) = newmem;
2257 XEXP (outerdest, 2) = GEN_INT (pos);
2259 if (recog_memoized (insn) >= 0)
2262 /* Otherwise, restore old position. XEXP (x, 0) will be
2264 XEXP (outerdest, 2) = old_pos;
2268 /* If we get here, the bit-field store doesn't allow memory
2269 or isn't located at a constant position. Load the value into
2270 a register, do the store, and put it back into memory. */
2272 tem1 = gen_reg_rtx (GET_MODE (tem));
2273 emit_insn_before (gen_move_insn (tem1, tem), insn);
2274 emit_insn_after (gen_move_insn (tem, tem1), insn);
2275 XEXP (outerdest, 0) = tem1;
2279 /* STRICT_LOW_PART is a no-op on memory references
2280 and it can cause combinations to be unrecognizable,
2283 if (dest == var && GET_CODE (SET_DEST (x)) == STRICT_LOW_PART)
2284 SET_DEST (x) = XEXP (SET_DEST (x), 0);
2286 /* A valid insn to copy VAR into or out of a register
2287 must be left alone, to avoid an infinite loop here.
2288 If the reference to VAR is by a subreg, fix that up,
2289 since SUBREG is not valid for a memref.
2290 Also fix up the address of the stack slot.
2292 Note that we must not try to recognize the insn until
2293 after we know that we have valid addresses and no
2294 (subreg (mem ...) ...) constructs, since these interfere
2295 with determining the validity of the insn. */
2297 if ((SET_SRC (x) == var
2298 || (GET_CODE (SET_SRC (x)) == SUBREG
2299 && SUBREG_REG (SET_SRC (x)) == var))
2300 && (GET_CODE (SET_DEST (x)) == REG
2301 || (GET_CODE (SET_DEST (x)) == SUBREG
2302 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG))
2303 && GET_MODE (var) == promoted_mode
2304 && x == single_set (insn))
2308 if (GET_CODE (SET_SRC (x)) == SUBREG
2309 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
2310 > GET_MODE_SIZE (GET_MODE (var))))
2312 /* This (subreg VAR) is now a paradoxical subreg. We need
2313 to replace VAR instead of the subreg. */
2314 replacement = find_fixup_replacement (replacements, var);
2315 if (replacement->new == NULL_RTX)
2316 replacement->new = gen_reg_rtx (GET_MODE (var));
2317 SUBREG_REG (SET_SRC (x)) = replacement->new;
2321 replacement = find_fixup_replacement (replacements, SET_SRC (x));
2322 if (replacement->new)
2323 SET_SRC (x) = replacement->new;
2324 else if (GET_CODE (SET_SRC (x)) == SUBREG)
2325 SET_SRC (x) = replacement->new
2326 = fixup_memory_subreg (SET_SRC (x), insn, promoted_mode,
2329 SET_SRC (x) = replacement->new
2330 = fixup_stack_1 (SET_SRC (x), insn);
2333 if (recog_memoized (insn) >= 0)
2336 /* INSN is not valid, but we know that we want to
2337 copy SET_SRC (x) to SET_DEST (x) in some way. So
2338 we generate the move and see whether it requires more
2339 than one insn. If it does, we emit those insns and
2340 delete INSN. Otherwise, we can just replace the pattern
2341 of INSN; we have already verified above that INSN has
2342 no other function that to do X. */
2344 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2345 if (NEXT_INSN (pat) != NULL_RTX)
2347 last = emit_insn_before (pat, insn);
2349 /* INSN might have REG_RETVAL or other important notes, so
2350 we need to store the pattern of the last insn in the
2351 sequence into INSN similarly to the normal case. LAST
2352 should not have REG_NOTES, but we allow them if INSN has
2354 if (REG_NOTES (last) && REG_NOTES (insn))
2356 if (REG_NOTES (last))
2357 REG_NOTES (insn) = REG_NOTES (last);
2358 PATTERN (insn) = PATTERN (last);
2363 PATTERN (insn) = PATTERN (pat);
2368 if ((SET_DEST (x) == var
2369 || (GET_CODE (SET_DEST (x)) == SUBREG
2370 && SUBREG_REG (SET_DEST (x)) == var))
2371 && (GET_CODE (SET_SRC (x)) == REG
2372 || (GET_CODE (SET_SRC (x)) == SUBREG
2373 && GET_CODE (SUBREG_REG (SET_SRC (x))) == REG))
2374 && GET_MODE (var) == promoted_mode
2375 && x == single_set (insn))
2379 if (GET_CODE (SET_DEST (x)) == SUBREG)
2380 SET_DEST (x) = fixup_memory_subreg (SET_DEST (x), insn,
2383 SET_DEST (x) = fixup_stack_1 (SET_DEST (x), insn);
2385 if (recog_memoized (insn) >= 0)
2388 pat = gen_move_insn (SET_DEST (x), SET_SRC (x));
2389 if (NEXT_INSN (pat) != NULL_RTX)
2391 last = emit_insn_before (pat, insn);
2393 /* INSN might have REG_RETVAL or other important notes, so
2394 we need to store the pattern of the last insn in the
2395 sequence into INSN similarly to the normal case. LAST
2396 should not have REG_NOTES, but we allow them if INSN has
2398 if (REG_NOTES (last) && REG_NOTES (insn))
2400 if (REG_NOTES (last))
2401 REG_NOTES (insn) = REG_NOTES (last);
2402 PATTERN (insn) = PATTERN (last);
2407 PATTERN (insn) = PATTERN (pat);
2412 /* Otherwise, storing into VAR must be handled specially
2413 by storing into a temporary and copying that into VAR
2414 with a new insn after this one. Note that this case
2415 will be used when storing into a promoted scalar since
2416 the insn will now have different modes on the input
2417 and output and hence will be invalid (except for the case
2418 of setting it to a constant, which does not need any
2419 change if it is valid). We generate extra code in that case,
2420 but combine.c will eliminate it. */
2425 rtx fixeddest = SET_DEST (x);
2426 enum machine_mode temp_mode;
2428 /* STRICT_LOW_PART can be discarded, around a MEM. */
2429 if (GET_CODE (fixeddest) == STRICT_LOW_PART)
2430 fixeddest = XEXP (fixeddest, 0);
2431 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2432 if (GET_CODE (fixeddest) == SUBREG)
2434 fixeddest = fixup_memory_subreg (fixeddest, insn,
2436 temp_mode = GET_MODE (fixeddest);
2440 fixeddest = fixup_stack_1 (fixeddest, insn);
2441 temp_mode = promoted_mode;
2444 temp = gen_reg_rtx (temp_mode);
2446 emit_insn_after (gen_move_insn (fixeddest,
2447 gen_lowpart (GET_MODE (fixeddest),
2451 SET_DEST (x) = temp;
2459 /* Nothing special about this RTX; fix its operands. */
2461 fmt = GET_RTX_FORMAT (code);
2462 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2465 fixup_var_refs_1 (var, promoted_mode, &XEXP (x, i), insn, replacements,
2467 else if (fmt[i] == 'E')
2470 for (j = 0; j < XVECLEN (x, i); j++)
2471 fixup_var_refs_1 (var, promoted_mode, &XVECEXP (x, i, j),
2472 insn, replacements, no_share);
2477 /* Previously, X had the form (SUBREG:m1 (REG:PROMOTED_MODE ...)).
2478 The REG was placed on the stack, so X now has the form (SUBREG:m1
2481 Return an rtx (MEM:m1 newaddr) which is equivalent. If any insns
2482 must be emitted to compute NEWADDR, put them before INSN.
2484 UNCRITICAL nonzero means accept paradoxical subregs.
2485 This is used for subregs found inside REG_NOTES. */
2488 fixup_memory_subreg (rtx x, rtx insn, enum machine_mode promoted_mode, int uncritical)
2491 rtx mem = SUBREG_REG (x);
2492 rtx addr = XEXP (mem, 0);
2493 enum machine_mode mode = GET_MODE (x);
2496 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2497 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (GET_MODE (mem)) && ! uncritical)
2500 offset = SUBREG_BYTE (x);
2501 if (BYTES_BIG_ENDIAN)
2502 /* If the PROMOTED_MODE is wider than the mode of the MEM, adjust
2503 the offset so that it points to the right location within the
2505 offset -= (GET_MODE_SIZE (promoted_mode) - GET_MODE_SIZE (GET_MODE (mem)));
2507 if (!flag_force_addr
2508 && memory_address_p (mode, plus_constant (addr, offset)))
2509 /* Shortcut if no insns need be emitted. */
2510 return adjust_address (mem, mode, offset);
2513 result = adjust_address (mem, mode, offset);
2517 emit_insn_before (seq, insn);
2521 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2522 Replace subexpressions of X in place.
2523 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2524 Otherwise return X, with its contents possibly altered.
2526 INSN, PROMOTED_MODE and UNCRITICAL are as for
2527 fixup_memory_subreg. */
2530 walk_fixup_memory_subreg (rtx x, rtx insn, enum machine_mode promoted_mode,
2540 code = GET_CODE (x);
2542 if (code == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
2543 return fixup_memory_subreg (x, insn, promoted_mode, uncritical);
2545 /* Nothing special about this RTX; fix its operands. */
2547 fmt = GET_RTX_FORMAT (code);
2548 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2551 XEXP (x, i) = walk_fixup_memory_subreg (XEXP (x, i), insn,
2552 promoted_mode, uncritical);
2553 else if (fmt[i] == 'E')
2556 for (j = 0; j < XVECLEN (x, i); j++)
2558 = walk_fixup_memory_subreg (XVECEXP (x, i, j), insn,
2559 promoted_mode, uncritical);
2565 /* For each memory ref within X, if it refers to a stack slot
2566 with an out of range displacement, put the address in a temp register
2567 (emitting new insns before INSN to load these registers)
2568 and alter the memory ref to use that register.
2569 Replace each such MEM rtx with a copy, to avoid clobberage. */
2572 fixup_stack_1 (rtx x, rtx insn)
2575 RTX_CODE code = GET_CODE (x);
2580 rtx ad = XEXP (x, 0);
2581 /* If we have address of a stack slot but it's not valid
2582 (displacement is too large), compute the sum in a register. */
2583 if (GET_CODE (ad) == PLUS
2584 && GET_CODE (XEXP (ad, 0)) == REG
2585 && ((REGNO (XEXP (ad, 0)) >= FIRST_VIRTUAL_REGISTER
2586 && REGNO (XEXP (ad, 0)) <= LAST_VIRTUAL_REGISTER)
2587 || REGNO (XEXP (ad, 0)) == FRAME_POINTER_REGNUM
2588 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2589 || REGNO (XEXP (ad, 0)) == HARD_FRAME_POINTER_REGNUM
2591 || REGNO (XEXP (ad, 0)) == STACK_POINTER_REGNUM
2592 || REGNO (XEXP (ad, 0)) == ARG_POINTER_REGNUM
2593 || XEXP (ad, 0) == current_function_internal_arg_pointer)
2594 && GET_CODE (XEXP (ad, 1)) == CONST_INT)
2597 if (memory_address_p (GET_MODE (x), ad))
2601 temp = copy_to_reg (ad);
2604 emit_insn_before (seq, insn);
2605 return replace_equiv_address (x, temp);
2610 fmt = GET_RTX_FORMAT (code);
2611 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2614 XEXP (x, i) = fixup_stack_1 (XEXP (x, i), insn);
2615 else if (fmt[i] == 'E')
2618 for (j = 0; j < XVECLEN (x, i); j++)
2619 XVECEXP (x, i, j) = fixup_stack_1 (XVECEXP (x, i, j), insn);
2625 /* Optimization: a bit-field instruction whose field
2626 happens to be a byte or halfword in memory
2627 can be changed to a move instruction.
2629 We call here when INSN is an insn to examine or store into a bit-field.
2630 BODY is the SET-rtx to be altered.
2632 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2633 (Currently this is called only from function.c, and EQUIV_MEM
2637 optimize_bit_field (rtx body, rtx insn, rtx *equiv_mem)
2642 enum machine_mode mode;
2644 if (GET_CODE (SET_DEST (body)) == SIGN_EXTRACT
2645 || GET_CODE (SET_DEST (body)) == ZERO_EXTRACT)
2646 bitfield = SET_DEST (body), destflag = 1;
2648 bitfield = SET_SRC (body), destflag = 0;
2650 /* First check that the field being stored has constant size and position
2651 and is in fact a byte or halfword suitably aligned. */
2653 if (GET_CODE (XEXP (bitfield, 1)) == CONST_INT
2654 && GET_CODE (XEXP (bitfield, 2)) == CONST_INT
2655 && ((mode = mode_for_size (INTVAL (XEXP (bitfield, 1)), MODE_INT, 1))
2657 && INTVAL (XEXP (bitfield, 2)) % INTVAL (XEXP (bitfield, 1)) == 0)
2661 /* Now check that the containing word is memory, not a register,
2662 and that it is safe to change the machine mode. */
2664 if (GET_CODE (XEXP (bitfield, 0)) == MEM)
2665 memref = XEXP (bitfield, 0);
2666 else if (GET_CODE (XEXP (bitfield, 0)) == REG
2668 memref = equiv_mem[REGNO (XEXP (bitfield, 0))];
2669 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2670 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == MEM)
2671 memref = SUBREG_REG (XEXP (bitfield, 0));
2672 else if (GET_CODE (XEXP (bitfield, 0)) == SUBREG
2674 && GET_CODE (SUBREG_REG (XEXP (bitfield, 0))) == REG)
2675 memref = equiv_mem[REGNO (SUBREG_REG (XEXP (bitfield, 0)))];
2678 && ! mode_dependent_address_p (XEXP (memref, 0))
2679 && ! MEM_VOLATILE_P (memref))
2681 /* Now adjust the address, first for any subreg'ing
2682 that we are now getting rid of,
2683 and then for which byte of the word is wanted. */
2685 HOST_WIDE_INT offset = INTVAL (XEXP (bitfield, 2));
2688 /* Adjust OFFSET to count bits from low-address byte. */
2689 if (BITS_BIG_ENDIAN != BYTES_BIG_ENDIAN)
2690 offset = (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield, 0)))
2691 - offset - INTVAL (XEXP (bitfield, 1)));
2693 /* Adjust OFFSET to count bytes from low-address byte. */
2694 offset /= BITS_PER_UNIT;
2695 if (GET_CODE (XEXP (bitfield, 0)) == SUBREG)
2697 offset += (SUBREG_BYTE (XEXP (bitfield, 0))
2698 / UNITS_PER_WORD) * UNITS_PER_WORD;
2699 if (BYTES_BIG_ENDIAN)
2700 offset -= (MIN (UNITS_PER_WORD,
2701 GET_MODE_SIZE (GET_MODE (XEXP (bitfield, 0))))
2702 - MIN (UNITS_PER_WORD,
2703 GET_MODE_SIZE (GET_MODE (memref))));
2707 memref = adjust_address (memref, mode, offset);
2708 insns = get_insns ();
2710 emit_insn_before (insns, insn);
2712 /* Store this memory reference where
2713 we found the bit field reference. */
2717 validate_change (insn, &SET_DEST (body), memref, 1);
2718 if (! CONSTANT_ADDRESS_P (SET_SRC (body)))
2720 rtx src = SET_SRC (body);
2721 while (GET_CODE (src) == SUBREG
2722 && SUBREG_BYTE (src) == 0)
2723 src = SUBREG_REG (src);
2724 if (GET_MODE (src) != GET_MODE (memref))
2725 src = gen_lowpart (GET_MODE (memref), SET_SRC (body));
2726 validate_change (insn, &SET_SRC (body), src, 1);
2728 else if (GET_MODE (SET_SRC (body)) != VOIDmode
2729 && GET_MODE (SET_SRC (body)) != GET_MODE (memref))
2730 /* This shouldn't happen because anything that didn't have
2731 one of these modes should have got converted explicitly
2732 and then referenced through a subreg.
2733 This is so because the original bit-field was
2734 handled by agg_mode and so its tree structure had
2735 the same mode that memref now has. */
2740 rtx dest = SET_DEST (body);
2742 while (GET_CODE (dest) == SUBREG
2743 && SUBREG_BYTE (dest) == 0
2744 && (GET_MODE_CLASS (GET_MODE (dest))
2745 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest))))
2746 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2748 dest = SUBREG_REG (dest);
2750 validate_change (insn, &SET_DEST (body), dest, 1);
2752 if (GET_MODE (dest) == GET_MODE (memref))
2753 validate_change (insn, &SET_SRC (body), memref, 1);
2756 /* Convert the mem ref to the destination mode. */
2757 rtx newreg = gen_reg_rtx (GET_MODE (dest));
2760 convert_move (newreg, memref,
2761 GET_CODE (SET_SRC (body)) == ZERO_EXTRACT);
2765 validate_change (insn, &SET_SRC (body), newreg, 1);
2769 /* See if we can convert this extraction or insertion into
2770 a simple move insn. We might not be able to do so if this
2771 was, for example, part of a PARALLEL.
2773 If we succeed, write out any needed conversions. If we fail,
2774 it is hard to guess why we failed, so don't do anything
2775 special; just let the optimization be suppressed. */
2777 if (apply_change_group () && seq)
2778 emit_insn_before (seq, insn);
2783 /* These routines are responsible for converting virtual register references
2784 to the actual hard register references once RTL generation is complete.
2786 The following four variables are used for communication between the
2787 routines. They contain the offsets of the virtual registers from their
2788 respective hard registers. */
2790 static int in_arg_offset;
2791 static int var_offset;
2792 static int dynamic_offset;
2793 static int out_arg_offset;
2794 static int cfa_offset;
2796 /* In most machines, the stack pointer register is equivalent to the bottom
2799 #ifndef STACK_POINTER_OFFSET
2800 #define STACK_POINTER_OFFSET 0
2803 /* If not defined, pick an appropriate default for the offset of dynamically
2804 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2805 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2807 #ifndef STACK_DYNAMIC_OFFSET
2809 /* The bottom of the stack points to the actual arguments. If
2810 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2811 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2812 stack space for register parameters is not pushed by the caller, but
2813 rather part of the fixed stack areas and hence not included in
2814 `current_function_outgoing_args_size'. Nevertheless, we must allow
2815 for it when allocating stack dynamic objects. */
2817 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2818 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2819 ((ACCUMULATE_OUTGOING_ARGS \
2820 ? (current_function_outgoing_args_size + REG_PARM_STACK_SPACE (FNDECL)) : 0)\
2821 + (STACK_POINTER_OFFSET)) \
2824 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2825 ((ACCUMULATE_OUTGOING_ARGS ? current_function_outgoing_args_size : 0) \
2826 + (STACK_POINTER_OFFSET))
2830 /* On most machines, the CFA coincides with the first incoming parm. */
2832 #ifndef ARG_POINTER_CFA_OFFSET
2833 #define ARG_POINTER_CFA_OFFSET(FNDECL) FIRST_PARM_OFFSET (FNDECL)
2836 /* Build up a (MEM (ADDRESSOF (REG))) rtx for a register REG that just
2837 had its address taken. DECL is the decl or SAVE_EXPR for the
2838 object stored in the register, for later use if we do need to force
2839 REG into the stack. REG is overwritten by the MEM like in
2840 put_reg_into_stack. RESCAN is true if previously emitted
2841 instructions must be rescanned and modified now that the REG has
2842 been transformed. */
2845 gen_mem_addressof (rtx reg, tree decl, int rescan)
2847 rtx r = gen_rtx_ADDRESSOF (Pmode, gen_reg_rtx (GET_MODE (reg)),
2850 /* Calculate this before we start messing with decl's RTL. */
2851 HOST_WIDE_INT set = decl ? get_alias_set (decl) : 0;
2853 /* If the original REG was a user-variable, then so is the REG whose
2854 address is being taken. Likewise for unchanging. */
2855 REG_USERVAR_P (XEXP (r, 0)) = REG_USERVAR_P (reg);
2856 RTX_UNCHANGING_P (XEXP (r, 0)) = RTX_UNCHANGING_P (reg);
2858 PUT_CODE (reg, MEM);
2859 MEM_ATTRS (reg) = 0;
2864 tree type = TREE_TYPE (decl);
2865 enum machine_mode decl_mode
2866 = (DECL_P (decl) ? DECL_MODE (decl) : TYPE_MODE (TREE_TYPE (decl)));
2867 rtx decl_rtl = (TREE_CODE (decl) == SAVE_EXPR ? SAVE_EXPR_RTL (decl)
2868 : DECL_RTL_IF_SET (decl));
2870 PUT_MODE (reg, decl_mode);
2872 /* Clear DECL_RTL momentarily so functions below will work
2873 properly, then set it again. */
2874 if (DECL_P (decl) && decl_rtl == reg)
2875 SET_DECL_RTL (decl, 0);
2877 set_mem_attributes (reg, decl, 1);
2878 set_mem_alias_set (reg, set);
2880 if (DECL_P (decl) && decl_rtl == reg)
2881 SET_DECL_RTL (decl, reg);
2884 && (TREE_USED (decl) || (DECL_P (decl) && DECL_INITIAL (decl) != 0)))
2885 fixup_var_refs (reg, GET_MODE (reg), TYPE_UNSIGNED (type), reg, 0);
2889 /* This can only happen during reload. Clear the same flag bits as
2891 MEM_VOLATILE_P (reg) = 0;
2892 RTX_UNCHANGING_P (reg) = 0;
2893 MEM_IN_STRUCT_P (reg) = 0;
2894 MEM_SCALAR_P (reg) = 0;
2895 MEM_ATTRS (reg) = 0;
2897 fixup_var_refs (reg, GET_MODE (reg), 0, reg, 0);
2903 /* If DECL has an RTL that is an ADDRESSOF rtx, put it into the stack. */
2906 flush_addressof (tree decl)
2908 if ((TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == VAR_DECL)
2909 && DECL_RTL (decl) != 0
2910 && GET_CODE (DECL_RTL (decl)) == MEM
2911 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF
2912 && GET_CODE (XEXP (XEXP (DECL_RTL (decl), 0), 0)) == REG)
2913 put_addressof_into_stack (XEXP (DECL_RTL (decl), 0), 0);
2916 /* Force the register pointed to by R, an ADDRESSOF rtx, into the stack. */
2919 put_addressof_into_stack (rtx r, htab_t ht)
2922 int volatile_p, used_p;
2924 rtx reg = XEXP (r, 0);
2926 if (GET_CODE (reg) != REG)
2929 decl = ADDRESSOF_DECL (r);
2932 type = TREE_TYPE (decl);
2933 volatile_p = (TREE_CODE (decl) != SAVE_EXPR
2934 && TREE_THIS_VOLATILE (decl));
2935 used_p = (TREE_USED (decl)
2936 || (DECL_P (decl) && DECL_INITIAL (decl) != 0));
2945 put_reg_into_stack (0, reg, type, GET_MODE (reg), GET_MODE (reg),
2946 volatile_p, ADDRESSOF_REGNO (r), used_p, ht);
2949 /* List of replacements made below in purge_addressof_1 when creating
2950 bitfield insertions. */
2951 static rtx purge_bitfield_addressof_replacements;
2953 /* List of replacements made below in purge_addressof_1 for patterns
2954 (MEM (ADDRESSOF (REG ...))). The key of the list entry is the
2955 corresponding (ADDRESSOF (REG ...)) and value is a substitution for
2956 the all pattern. List PURGE_BITFIELD_ADDRESSOF_REPLACEMENTS is not
2957 enough in complex cases, e.g. when some field values can be
2958 extracted by usage MEM with narrower mode. */
2959 static rtx purge_addressof_replacements;
2961 /* Helper function for purge_addressof. See if the rtx expression at *LOC
2962 in INSN needs to be changed. If FORCE, always put any ADDRESSOFs into
2963 the stack. If the function returns FALSE then the replacement could not
2964 be made. If MAY_POSTPONE is true and we would not put the addressof
2965 to stack, postpone processing of the insn. */
2968 purge_addressof_1 (rtx *loc, rtx insn, int force, int store, int may_postpone,
2976 bool libcall = false;
2978 /* Re-start here to avoid recursion in common cases. */
2985 /* Is this a libcall? */
2987 libcall = REG_NOTE_KIND (*loc) == REG_RETVAL;
2989 code = GET_CODE (x);
2991 /* If we don't return in any of the cases below, we will recurse inside
2992 the RTX, which will normally result in any ADDRESSOF being forced into
2996 result = purge_addressof_1 (&SET_DEST (x), insn, force, 1,
2998 result &= purge_addressof_1 (&SET_SRC (x), insn, force, 0,
3002 else if (code == ADDRESSOF)
3006 if (GET_CODE (XEXP (x, 0)) != MEM)
3007 put_addressof_into_stack (x, ht);
3009 /* We must create a copy of the rtx because it was created by
3010 overwriting a REG rtx which is always shared. */
3011 sub = copy_rtx (XEXP (XEXP (x, 0), 0));
3012 if (validate_change (insn, loc, sub, 0)
3013 || validate_replace_rtx (x, sub, insn))
3018 /* If SUB is a hard or virtual register, try it as a pseudo-register.
3019 Otherwise, perhaps SUB is an expression, so generate code to compute
3021 if (GET_CODE (sub) == REG && REGNO (sub) <= LAST_VIRTUAL_REGISTER)
3022 sub = copy_to_reg (sub);
3024 sub = force_operand (sub, NULL_RTX);
3026 if (! validate_change (insn, loc, sub, 0)
3027 && ! validate_replace_rtx (x, sub, insn))
3030 insns = get_insns ();
3032 emit_insn_before (insns, insn);
3036 else if (code == MEM && GET_CODE (XEXP (x, 0)) == ADDRESSOF && ! force)
3038 rtx sub = XEXP (XEXP (x, 0), 0);
3040 if (GET_CODE (sub) == MEM)
3041 sub = adjust_address_nv (sub, GET_MODE (x), 0);
3042 else if (GET_CODE (sub) == REG
3043 && (MEM_VOLATILE_P (x) || GET_MODE (x) == BLKmode))
3045 else if (GET_CODE (sub) == REG && GET_MODE (x) != GET_MODE (sub))
3047 int size_x, size_sub;
3051 /* Postpone for now, so that we do not emit bitfield arithmetics
3052 unless there is some benefit from it. */
3053 if (!postponed_insns || XEXP (postponed_insns, 0) != insn)
3054 postponed_insns = alloc_INSN_LIST (insn, postponed_insns);
3060 /* When processing REG_NOTES look at the list of
3061 replacements done on the insn to find the register that X
3065 for (tem = purge_bitfield_addressof_replacements;
3067 tem = XEXP (XEXP (tem, 1), 1))
3068 if (rtx_equal_p (x, XEXP (tem, 0)))
3070 *loc = XEXP (XEXP (tem, 1), 0);
3074 /* See comment for purge_addressof_replacements. */
3075 for (tem = purge_addressof_replacements;
3077 tem = XEXP (XEXP (tem, 1), 1))
3078 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3080 rtx z = XEXP (XEXP (tem, 1), 0);
3082 if (GET_MODE (x) == GET_MODE (z)
3083 || (GET_CODE (XEXP (XEXP (tem, 1), 0)) != REG
3084 && GET_CODE (XEXP (XEXP (tem, 1), 0)) != SUBREG))
3087 /* It can happen that the note may speak of things
3088 in a wider (or just different) mode than the
3089 code did. This is especially true of
3092 if (GET_CODE (z) == SUBREG && SUBREG_BYTE (z) == 0)
3095 if (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3096 && (GET_MODE_SIZE (GET_MODE (x))
3097 > GET_MODE_SIZE (GET_MODE (z))))
3099 /* This can occur as a result in invalid
3100 pointer casts, e.g. float f; ...
3101 *(long long int *)&f.
3102 ??? We could emit a warning here, but
3103 without a line number that wouldn't be
3105 z = gen_rtx_SUBREG (GET_MODE (x), z, 0);
3108 z = gen_lowpart (GET_MODE (x), z);
3114 /* When we are processing the REG_NOTES of the last instruction
3115 of a libcall, there will be typically no replacements
3116 for that insn; the replacements happened before, piecemeal
3117 fashion. OTOH we are not interested in the details of
3118 this for the REG_EQUAL note, we want to know the big picture,
3119 which can be succinctly described with a simple SUBREG.
3120 Note that removing the REG_EQUAL note is not an option
3121 on the last insn of a libcall, so we must do a replacement. */
3123 /* In compile/990107-1.c:7 compiled at -O1 -m1 for sh-elf,
3125 (mem:DI (addressof:SI (reg/v:DF 160) 159 0x401c8510)
3126 [0 S8 A32]), which can be expressed with a simple
3128 if ((GET_MODE_SIZE (GET_MODE (x))
3129 <= GET_MODE_SIZE (GET_MODE (sub)))
3130 /* Again, invalid pointer casts (as in
3131 compile/990203-1.c) can require paradoxical
3133 || (GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD
3134 && (GET_MODE_SIZE (GET_MODE (x))
3135 > GET_MODE_SIZE (GET_MODE (sub)))
3138 *loc = gen_rtx_SUBREG (GET_MODE (x), sub, 0);
3141 /* ??? Are there other cases we should handle? */
3143 /* Sometimes we may not be able to find the replacement. For
3144 example when the original insn was a MEM in a wider mode,
3145 and the note is part of a sign extension of a narrowed
3146 version of that MEM. Gcc testcase compile/990829-1.c can
3147 generate an example of this situation. Rather than complain
3148 we return false, which will prompt our caller to remove the
3153 size_x = GET_MODE_BITSIZE (GET_MODE (x));
3154 size_sub = GET_MODE_BITSIZE (GET_MODE (sub));
3156 /* Do not frob unchanging MEMs. If a later reference forces the
3157 pseudo to the stack, we can wind up with multiple writes to
3158 an unchanging memory, which is invalid. */
3159 if (RTX_UNCHANGING_P (x) && size_x != size_sub)
3162 /* Don't even consider working with paradoxical subregs,
3163 or the moral equivalent seen here. */
3164 else if (size_x <= size_sub
3165 && int_mode_for_mode (GET_MODE (sub)) != BLKmode)
3167 /* Do a bitfield insertion to mirror what would happen
3174 rtx p = PREV_INSN (insn);
3177 val = gen_reg_rtx (GET_MODE (x));
3178 if (! validate_change (insn, loc, val, 0))
3180 /* Discard the current sequence and put the
3181 ADDRESSOF on stack. */
3187 emit_insn_before (seq, insn);
3188 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3192 store_bit_field (sub, size_x, 0, GET_MODE (x),
3193 val, GET_MODE_SIZE (GET_MODE (sub)));
3195 /* Make sure to unshare any shared rtl that store_bit_field
3196 might have created. */
3197 unshare_all_rtl_again (get_insns ());
3201 p = emit_insn_after (seq, insn);
3202 if (NEXT_INSN (insn))
3203 compute_insns_for_mem (NEXT_INSN (insn),
3204 p ? NEXT_INSN (p) : NULL_RTX,
3209 rtx p = PREV_INSN (insn);
3212 val = extract_bit_field (sub, size_x, 0, 1, NULL_RTX,
3213 GET_MODE (x), GET_MODE (x),
3214 GET_MODE_SIZE (GET_MODE (sub)));
3216 if (! validate_change (insn, loc, val, 0))
3218 /* Discard the current sequence and put the
3219 ADDRESSOF on stack. */
3226 emit_insn_before (seq, insn);
3227 compute_insns_for_mem (p ? NEXT_INSN (p) : get_insns (),
3231 /* Remember the replacement so that the same one can be done
3232 on the REG_NOTES. */
3233 purge_bitfield_addressof_replacements
3234 = gen_rtx_EXPR_LIST (VOIDmode, x,
3237 purge_bitfield_addressof_replacements));
3239 /* We replaced with a reg -- all done. */
3244 else if (validate_change (insn, loc, sub, 0))
3246 /* Remember the replacement so that the same one can be done
3247 on the REG_NOTES. */
3248 if (GET_CODE (sub) == REG || GET_CODE (sub) == SUBREG)
3252 for (tem = purge_addressof_replacements;
3254 tem = XEXP (XEXP (tem, 1), 1))
3255 if (rtx_equal_p (XEXP (x, 0), XEXP (tem, 0)))
3257 XEXP (XEXP (tem, 1), 0) = sub;
3260 purge_addressof_replacements
3261 = gen_rtx_EXPR_LIST (VOIDmode, XEXP (x, 0),
3262 gen_rtx_EXPR_LIST (VOIDmode, sub,
3263 purge_addressof_replacements));
3271 /* Scan all subexpressions. */
3272 fmt = GET_RTX_FORMAT (code);
3273 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
3276 result &= purge_addressof_1 (&XEXP (x, i), insn, force, 0,
3278 else if (*fmt == 'E')
3279 for (j = 0; j < XVECLEN (x, i); j++)
3280 result &= purge_addressof_1 (&XVECEXP (x, i, j), insn, force, 0,
3287 /* Return a hash value for K, a REG. */
3290 insns_for_mem_hash (const void *k)
3292 /* Use the address of the key for the hash value. */
3293 struct insns_for_mem_entry *m = (struct insns_for_mem_entry *) k;
3294 return htab_hash_pointer (m->key);
3297 /* Return nonzero if K1 and K2 (two REGs) are the same. */
3300 insns_for_mem_comp (const void *k1, const void *k2)
3302 struct insns_for_mem_entry *m1 = (struct insns_for_mem_entry *) k1;
3303 struct insns_for_mem_entry *m2 = (struct insns_for_mem_entry *) k2;
3304 return m1->key == m2->key;
3307 struct insns_for_mem_walk_info
3309 /* The hash table that we are using to record which INSNs use which
3313 /* The INSN we are currently processing. */
3316 /* Zero if we are walking to find ADDRESSOFs, one if we are walking
3317 to find the insns that use the REGs in the ADDRESSOFs. */
3321 /* Called from compute_insns_for_mem via for_each_rtx. If R is a REG
3322 that might be used in an ADDRESSOF expression, record this INSN in
3323 the hash table given by DATA (which is really a pointer to an
3324 insns_for_mem_walk_info structure). */
3327 insns_for_mem_walk (rtx *r, void *data)
3329 struct insns_for_mem_walk_info *ifmwi
3330 = (struct insns_for_mem_walk_info *) data;
3331 struct insns_for_mem_entry tmp;
3332 tmp.insns = NULL_RTX;
3334 if (ifmwi->pass == 0 && *r && GET_CODE (*r) == ADDRESSOF
3335 && GET_CODE (XEXP (*r, 0)) == REG)
3338 tmp.key = XEXP (*r, 0);
3339 e = htab_find_slot (ifmwi->ht, &tmp, INSERT);
3342 *e = ggc_alloc (sizeof (tmp));
3343 memcpy (*e, &tmp, sizeof (tmp));
3346 else if (ifmwi->pass == 1 && *r && GET_CODE (*r) == REG)
3348 struct insns_for_mem_entry *ifme;
3350 ifme = htab_find (ifmwi->ht, &tmp);
3352 /* If we have not already recorded this INSN, do so now. Since
3353 we process the INSNs in order, we know that if we have
3354 recorded it it must be at the front of the list. */
3355 if (ifme && (!ifme->insns || XEXP (ifme->insns, 0) != ifmwi->insn))
3356 ifme->insns = gen_rtx_EXPR_LIST (VOIDmode, ifmwi->insn,
3363 /* Walk the INSNS, until we reach LAST_INSN, recording which INSNs use
3364 which REGs in HT. */
3367 compute_insns_for_mem (rtx insns, rtx last_insn, htab_t ht)
3370 struct insns_for_mem_walk_info ifmwi;
3373 for (ifmwi.pass = 0; ifmwi.pass < 2; ++ifmwi.pass)
3374 for (insn = insns; insn != last_insn; insn = NEXT_INSN (insn))
3378 for_each_rtx (&insn, insns_for_mem_walk, &ifmwi);
3382 /* Helper function for purge_addressof called through for_each_rtx.
3383 Returns true iff the rtl is an ADDRESSOF. */
3386 is_addressof (rtx *rtl, void *data ATTRIBUTE_UNUSED)
3388 return GET_CODE (*rtl) == ADDRESSOF;
3391 /* Eliminate all occurrences of ADDRESSOF from INSNS. Elide any remaining
3392 (MEM (ADDRESSOF)) patterns, and force any needed registers into the
3396 purge_addressof (rtx insns)
3401 /* When we actually purge ADDRESSOFs, we turn REGs into MEMs. That
3402 requires a fixup pass over the instruction stream to correct
3403 INSNs that depended on the REG being a REG, and not a MEM. But,
3404 these fixup passes are slow. Furthermore, most MEMs are not
3405 mentioned in very many instructions. So, we speed up the process
3406 by pre-calculating which REGs occur in which INSNs; that allows
3407 us to perform the fixup passes much more quickly. */
3408 ht = htab_create_ggc (1000, insns_for_mem_hash, insns_for_mem_comp, NULL);
3409 compute_insns_for_mem (insns, NULL_RTX, ht);
3411 postponed_insns = NULL;
3413 for (insn = insns; insn; insn = NEXT_INSN (insn))
3416 if (! purge_addressof_1 (&PATTERN (insn), insn,
3417 asm_noperands (PATTERN (insn)) > 0, 0, 1, ht))
3418 /* If we could not replace the ADDRESSOFs in the insn,
3419 something is wrong. */
3422 if (! purge_addressof_1 (®_NOTES (insn), NULL_RTX, 0, 0, 0, ht))
3424 /* If we could not replace the ADDRESSOFs in the insn's notes,
3425 we can just remove the offending notes instead. */
3428 for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
3430 /* If we find a REG_RETVAL note then the insn is a libcall.
3431 Such insns must have REG_EQUAL notes as well, in order
3432 for later passes of the compiler to work. So it is not
3433 safe to delete the notes here, and instead we abort. */
3434 if (REG_NOTE_KIND (note) == REG_RETVAL)
3436 if (for_each_rtx (¬e, is_addressof, NULL))
3437 remove_note (insn, note);
3442 /* Process the postponed insns. */
3443 while (postponed_insns)
3445 insn = XEXP (postponed_insns, 0);
3446 tmp = postponed_insns;
3447 postponed_insns = XEXP (postponed_insns, 1);
3448 free_INSN_LIST_node (tmp);
3450 if (! purge_addressof_1 (&PATTERN (insn), insn,
3451 asm_noperands (PATTERN (insn)) > 0, 0, 0, ht))
3456 purge_bitfield_addressof_replacements = 0;
3457 purge_addressof_replacements = 0;
3459 /* REGs are shared. purge_addressof will destructively replace a REG
3460 with a MEM, which creates shared MEMs.
3462 Unfortunately, the children of put_reg_into_stack assume that MEMs
3463 referring to the same stack slot are shared (fixup_var_refs and
3464 the associated hash table code).
3466 So, we have to do another unsharing pass after we have flushed any
3467 REGs that had their address taken into the stack.
3469 It may be worth tracking whether or not we converted any REGs into
3470 MEMs to avoid this overhead when it is not needed. */
3471 unshare_all_rtl_again (get_insns ());
3474 /* Convert a SET of a hard subreg to a set of the appropriate hard
3475 register. A subroutine of purge_hard_subreg_sets. */
3478 purge_single_hard_subreg_set (rtx pattern)
3480 rtx reg = SET_DEST (pattern);
3481 enum machine_mode mode = GET_MODE (SET_DEST (pattern));
3484 if (GET_CODE (reg) == SUBREG && GET_CODE (SUBREG_REG (reg)) == REG
3485 && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
3487 offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
3488 GET_MODE (SUBREG_REG (reg)),
3491 reg = SUBREG_REG (reg);
3495 if (GET_CODE (reg) == REG && REGNO (reg) < FIRST_PSEUDO_REGISTER)
3497 reg = gen_rtx_REG (mode, REGNO (reg) + offset);
3498 SET_DEST (pattern) = reg;
3502 /* Eliminate all occurrences of SETs of hard subregs from INSNS. The
3503 only such SETs that we expect to see are those left in because
3504 integrate can't handle sets of parts of a return value register.
3506 We don't use alter_subreg because we only want to eliminate subregs
3507 of hard registers. */
3510 purge_hard_subreg_sets (rtx insn)
3512 for (; insn; insn = NEXT_INSN (insn))
3516 rtx pattern = PATTERN (insn);
3517 switch (GET_CODE (pattern))
3520 if (GET_CODE (SET_DEST (pattern)) == SUBREG)
3521 purge_single_hard_subreg_set (pattern);
3526 for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
3528 rtx inner_pattern = XVECEXP (pattern, 0, j);
3529 if (GET_CODE (inner_pattern) == SET
3530 && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
3531 purge_single_hard_subreg_set (inner_pattern);
3542 /* Pass through the INSNS of function FNDECL and convert virtual register
3543 references to hard register references. */
3546 instantiate_virtual_regs (tree fndecl, rtx insns)
3551 /* Compute the offsets to use for this function. */
3552 in_arg_offset = FIRST_PARM_OFFSET (fndecl);
3553 var_offset = STARTING_FRAME_OFFSET;
3554 dynamic_offset = STACK_DYNAMIC_OFFSET (fndecl);
3555 out_arg_offset = STACK_POINTER_OFFSET;
3556 cfa_offset = ARG_POINTER_CFA_OFFSET (fndecl);
3558 /* Scan all variables and parameters of this function. For each that is
3559 in memory, instantiate all virtual registers if the result is a valid
3560 address. If not, we do it later. That will handle most uses of virtual
3561 regs on many machines. */
3562 instantiate_decls (fndecl, 1);
3564 /* Initialize recognition, indicating that volatile is OK. */
3567 /* Scan through all the insns, instantiating every virtual register still
3569 for (insn = insns; insn; insn = NEXT_INSN (insn))
3570 if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN
3571 || GET_CODE (insn) == CALL_INSN)
3573 instantiate_virtual_regs_1 (&PATTERN (insn), insn, 1);
3574 if (INSN_DELETED_P (insn))
3576 instantiate_virtual_regs_1 (®_NOTES (insn), NULL_RTX, 0);
3577 /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
3578 if (GET_CODE (insn) == CALL_INSN)
3579 instantiate_virtual_regs_1 (&CALL_INSN_FUNCTION_USAGE (insn),
3582 /* Past this point all ASM statements should match. Verify that
3583 to avoid failures later in the compilation process. */
3584 if (asm_noperands (PATTERN (insn)) >= 0
3585 && ! check_asm_operands (PATTERN (insn)))
3586 instantiate_virtual_regs_lossage (insn);
3589 /* Instantiate the stack slots for the parm registers, for later use in
3590 addressof elimination. */
3591 for (i = 0; i < max_parm_reg; ++i)
3592 if (parm_reg_stack_loc[i])
3593 instantiate_virtual_regs_1 (&parm_reg_stack_loc[i], NULL_RTX, 0);
3595 /* Now instantiate the remaining register equivalences for debugging info.
3596 These will not be valid addresses. */
3597 instantiate_decls (fndecl, 0);
3599 /* Indicate that, from now on, assign_stack_local should use
3600 frame_pointer_rtx. */
3601 virtuals_instantiated = 1;
3604 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
3605 all virtual registers in their DECL_RTL's.
3607 If VALID_ONLY, do this only if the resulting address is still valid.
3608 Otherwise, always do it. */
3611 instantiate_decls (tree fndecl, int valid_only)
3615 /* Process all parameters of the function. */
3616 for (decl = DECL_ARGUMENTS (fndecl); decl; decl = TREE_CHAIN (decl))
3618 HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (decl));
3619 HOST_WIDE_INT size_rtl;
3621 instantiate_decl (DECL_RTL (decl), size, valid_only);
3623 /* If the parameter was promoted, then the incoming RTL mode may be
3624 larger than the declared type size. We must use the larger of
3626 size_rtl = GET_MODE_SIZE (GET_MODE (DECL_INCOMING_RTL (decl)));
3627 size = MAX (size_rtl, size);
3628 instantiate_decl (DECL_INCOMING_RTL (decl), size, valid_only);
3631 /* Now process all variables defined in the function or its subblocks. */
3632 instantiate_decls_1 (DECL_INITIAL (fndecl), valid_only);
3635 /* Subroutine of instantiate_decls: Process all decls in the given
3636 BLOCK node and all its subblocks. */
3639 instantiate_decls_1 (tree let, int valid_only)
3643 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
3644 if (DECL_RTL_SET_P (t))
3645 instantiate_decl (DECL_RTL (t),
3646 int_size_in_bytes (TREE_TYPE (t)),
3649 /* Process all subblocks. */
3650 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
3651 instantiate_decls_1 (t, valid_only);
3654 /* Subroutine of the preceding procedures: Given RTL representing a
3655 decl and the size of the object, do any instantiation required.
3657 If VALID_ONLY is nonzero, it means that the RTL should only be
3658 changed if the new address is valid. */
3661 instantiate_decl (rtx x, HOST_WIDE_INT size, int valid_only)
3663 enum machine_mode mode;
3666 /* If this is not a MEM, no need to do anything. Similarly if the
3667 address is a constant or a register that is not a virtual register. */
3669 if (x == 0 || GET_CODE (x) != MEM)
3673 if (CONSTANT_P (addr)
3674 || (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == REG)
3675 || (GET_CODE (addr) == REG
3676 && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
3677 || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
3680 /* If we should only do this if the address is valid, copy the address.
3681 We need to do this so we can undo any changes that might make the
3682 address invalid. This copy is unfortunate, but probably can't be
3686 addr = copy_rtx (addr);
3688 instantiate_virtual_regs_1 (&addr, NULL_RTX, 0);
3690 if (valid_only && size >= 0)
3692 unsigned HOST_WIDE_INT decl_size = size;
3694 /* Now verify that the resulting address is valid for every integer or
3695 floating-point mode up to and including SIZE bytes long. We do this
3696 since the object might be accessed in any mode and frame addresses
3699 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3700 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3701 mode = GET_MODE_WIDER_MODE (mode))
3702 if (! memory_address_p (mode, addr))
3705 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT);
3706 mode != VOIDmode && GET_MODE_SIZE (mode) <= decl_size;
3707 mode = GET_MODE_WIDER_MODE (mode))
3708 if (! memory_address_p (mode, addr))
3712 /* Put back the address now that we have updated it and we either know
3713 it is valid or we don't care whether it is valid. */
3718 /* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
3719 is a virtual register, return the equivalent hard register and set the
3720 offset indirectly through the pointer. Otherwise, return 0. */
3723 instantiate_new_reg (rtx x, HOST_WIDE_INT *poffset)
3726 HOST_WIDE_INT offset;
3728 if (x == virtual_incoming_args_rtx)
3729 new = arg_pointer_rtx, offset = in_arg_offset;
3730 else if (x == virtual_stack_vars_rtx)
3731 new = frame_pointer_rtx, offset = var_offset;
3732 else if (x == virtual_stack_dynamic_rtx)
3733 new = stack_pointer_rtx, offset = dynamic_offset;
3734 else if (x == virtual_outgoing_args_rtx)
3735 new = stack_pointer_rtx, offset = out_arg_offset;
3736 else if (x == virtual_cfa_rtx)
3737 new = arg_pointer_rtx, offset = cfa_offset;
3746 /* Called when instantiate_virtual_regs has failed to update the instruction.
3747 Usually this means that non-matching instruction has been emit, however for
3748 asm statements it may be the problem in the constraints. */
3750 instantiate_virtual_regs_lossage (rtx insn)
3752 if (asm_noperands (PATTERN (insn)) >= 0)
3754 error_for_asm (insn, "impossible constraint in `asm'");
3760 /* Given a pointer to a piece of rtx and an optional pointer to the
3761 containing object, instantiate any virtual registers present in it.
3763 If EXTRA_INSNS, we always do the replacement and generate
3764 any extra insns before OBJECT. If it zero, we do nothing if replacement
3767 Return 1 if we either had nothing to do or if we were able to do the
3768 needed replacement. Return 0 otherwise; we only return zero if
3769 EXTRA_INSNS is zero.
3771 We first try some simple transformations to avoid the creation of extra
3775 instantiate_virtual_regs_1 (rtx *loc, rtx object, int extra_insns)
3780 HOST_WIDE_INT offset = 0;
3786 /* Re-start here to avoid recursion in common cases. */
3793 /* We may have detected and deleted invalid asm statements. */
3794 if (object && INSN_P (object) && INSN_DELETED_P (object))
3797 code = GET_CODE (x);
3799 /* Check for some special cases. */
3817 /* We are allowed to set the virtual registers. This means that
3818 the actual register should receive the source minus the
3819 appropriate offset. This is used, for example, in the handling
3820 of non-local gotos. */
3821 if ((new = instantiate_new_reg (SET_DEST (x), &offset)) != 0)
3823 rtx src = SET_SRC (x);
3825 /* We are setting the register, not using it, so the relevant
3826 offset is the negative of the offset to use were we using
3829 instantiate_virtual_regs_1 (&src, NULL_RTX, 0);
3831 /* The only valid sources here are PLUS or REG. Just do
3832 the simplest possible thing to handle them. */
3833 if (GET_CODE (src) != REG && GET_CODE (src) != PLUS)
3835 instantiate_virtual_regs_lossage (object);
3840 if (GET_CODE (src) != REG)
3841 temp = force_operand (src, NULL_RTX);
3844 temp = force_operand (plus_constant (temp, offset), NULL_RTX);
3848 emit_insn_before (seq, object);
3851 if (! validate_change (object, &SET_SRC (x), temp, 0)
3853 instantiate_virtual_regs_lossage (object);
3858 instantiate_virtual_regs_1 (&SET_DEST (x), object, extra_insns);
3863 /* Handle special case of virtual register plus constant. */
3864 if (CONSTANT_P (XEXP (x, 1)))
3866 rtx old, new_offset;
3868 /* Check for (plus (plus VIRT foo) (const_int)) first. */
3869 if (GET_CODE (XEXP (x, 0)) == PLUS)
3871 if ((new = instantiate_new_reg (XEXP (XEXP (x, 0), 0), &offset)))
3873 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 1), object,
3875 new = gen_rtx_PLUS (Pmode, new, XEXP (XEXP (x, 0), 1));
3884 #ifdef POINTERS_EXTEND_UNSIGNED
3885 /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
3886 we can commute the PLUS and SUBREG because pointers into the
3887 frame are well-behaved. */
3888 else if (GET_CODE (XEXP (x, 0)) == SUBREG && GET_MODE (x) == ptr_mode
3889 && GET_CODE (XEXP (x, 1)) == CONST_INT
3891 = instantiate_new_reg (SUBREG_REG (XEXP (x, 0)),
3893 && validate_change (object, loc,
3894 plus_constant (gen_lowpart (ptr_mode,
3897 + INTVAL (XEXP (x, 1))),
3901 else if ((new = instantiate_new_reg (XEXP (x, 0), &offset)) == 0)
3903 /* We know the second operand is a constant. Unless the
3904 first operand is a REG (which has been already checked),
3905 it needs to be checked. */
3906 if (GET_CODE (XEXP (x, 0)) != REG)
3914 new_offset = plus_constant (XEXP (x, 1), offset);
3916 /* If the new constant is zero, try to replace the sum with just
3918 if (new_offset == const0_rtx
3919 && validate_change (object, loc, new, 0))
3922 /* Next try to replace the register and new offset.
3923 There are two changes to validate here and we can't assume that
3924 in the case of old offset equals new just changing the register
3925 will yield a valid insn. In the interests of a little efficiency,
3926 however, we only call validate change once (we don't queue up the
3927 changes and then call apply_change_group). */
3931 ? ! validate_change (object, &XEXP (x, 0), new, 0)
3932 : (XEXP (x, 0) = new,
3933 ! validate_change (object, &XEXP (x, 1), new_offset, 0)))
3941 /* Otherwise copy the new constant into a register and replace
3942 constant with that register. */
3943 temp = gen_reg_rtx (Pmode);
3945 if (validate_change (object, &XEXP (x, 1), temp, 0))
3946 emit_insn_before (gen_move_insn (temp, new_offset), object);
3949 /* If that didn't work, replace this expression with a
3950 register containing the sum. */
3953 new = gen_rtx_PLUS (Pmode, new, new_offset);
3956 temp = force_operand (new, NULL_RTX);
3960 emit_insn_before (seq, object);
3961 if (! validate_change (object, loc, temp, 0)
3962 && ! validate_replace_rtx (x, temp, object))
3964 instantiate_virtual_regs_lossage (object);
3973 /* Fall through to generic two-operand expression case. */
3979 case DIV: case UDIV:
3980 case MOD: case UMOD:
3981 case AND: case IOR: case XOR:
3982 case ROTATERT: case ROTATE:
3983 case ASHIFTRT: case LSHIFTRT: case ASHIFT:
3985 case GE: case GT: case GEU: case GTU:
3986 case LE: case LT: case LEU: case LTU:
3987 if (XEXP (x, 1) && ! CONSTANT_P (XEXP (x, 1)))
3988 instantiate_virtual_regs_1 (&XEXP (x, 1), object, extra_insns);
3993 /* Most cases of MEM that convert to valid addresses have already been
3994 handled by our scan of decls. The only special handling we
3995 need here is to make a copy of the rtx to ensure it isn't being
3996 shared if we have to change it to a pseudo.
3998 If the rtx is a simple reference to an address via a virtual register,
3999 it can potentially be shared. In such cases, first try to make it
4000 a valid address, which can also be shared. Otherwise, copy it and
4003 First check for common cases that need no processing. These are
4004 usually due to instantiation already being done on a previous instance
4008 if (CONSTANT_ADDRESS_P (temp)
4009 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
4010 || temp == arg_pointer_rtx
4012 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
4013 || temp == hard_frame_pointer_rtx
4015 || temp == frame_pointer_rtx)
4018 if (GET_CODE (temp) == PLUS
4019 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
4020 && (XEXP (temp, 0) == frame_pointer_rtx
4021 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
4022 || XEXP (temp, 0) == hard_frame_pointer_rtx
4024 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
4025 || XEXP (temp, 0) == arg_pointer_rtx
4030 if (temp == virtual_stack_vars_rtx
4031 || temp == virtual_incoming_args_rtx
4032 || (GET_CODE (temp) == PLUS
4033 && CONSTANT_ADDRESS_P (XEXP (temp, 1))
4034 && (XEXP (temp, 0) == virtual_stack_vars_rtx
4035 || XEXP (temp, 0) == virtual_incoming_args_rtx)))
4037 /* This MEM may be shared. If the substitution can be done without
4038 the need to generate new pseudos, we want to do it in place
4039 so all copies of the shared rtx benefit. The call below will
4040 only make substitutions if the resulting address is still
4043 Note that we cannot pass X as the object in the recursive call
4044 since the insn being processed may not allow all valid
4045 addresses. However, if we were not passed on object, we can
4046 only modify X without copying it if X will have a valid
4049 ??? Also note that this can still lose if OBJECT is an insn that
4050 has less restrictions on an address that some other insn.
4051 In that case, we will modify the shared address. This case
4052 doesn't seem very likely, though. One case where this could
4053 happen is in the case of a USE or CLOBBER reference, but we
4054 take care of that below. */
4056 if (instantiate_virtual_regs_1 (&XEXP (x, 0),
4057 object ? object : x, 0))
4060 /* Otherwise make a copy and process that copy. We copy the entire
4061 RTL expression since it might be a PLUS which could also be
4063 *loc = x = copy_rtx (x);
4066 /* Fall through to generic unary operation case. */
4069 case STRICT_LOW_PART:
4071 case PRE_DEC: case PRE_INC: case POST_DEC: case POST_INC:
4072 case SIGN_EXTEND: case ZERO_EXTEND:
4073 case TRUNCATE: case FLOAT_EXTEND: case FLOAT_TRUNCATE:
4074 case FLOAT: case FIX:
4075 case UNSIGNED_FIX: case UNSIGNED_FLOAT:
4080 case POPCOUNT: case PARITY:
4081 /* These case either have just one operand or we know that we need not
4082 check the rest of the operands. */
4088 /* If the operand is a MEM, see if the change is a valid MEM. If not,
4089 go ahead and make the invalid one, but do it to a copy. For a REG,
4090 just make the recursive call, since there's no chance of a problem. */
4092 if ((GET_CODE (XEXP (x, 0)) == MEM
4093 && instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), XEXP (x, 0),
4095 || (GET_CODE (XEXP (x, 0)) == REG
4096 && instantiate_virtual_regs_1 (&XEXP (x, 0), object, 0)))
4099 XEXP (x, 0) = copy_rtx (XEXP (x, 0));
4104 /* Try to replace with a PLUS. If that doesn't work, compute the sum
4105 in front of this insn and substitute the temporary. */
4106 if ((new = instantiate_new_reg (x, &offset)) != 0)
4108 temp = plus_constant (new, offset);
4109 if (!validate_change (object, loc, temp, 0))
4115 temp = force_operand (temp, NULL_RTX);
4119 emit_insn_before (seq, object);
4120 if (! validate_change (object, loc, temp, 0)
4121 && ! validate_replace_rtx (x, temp, object))
4122 instantiate_virtual_regs_lossage (object);
4129 if (GET_CODE (XEXP (x, 0)) == REG)
4132 else if (GET_CODE (XEXP (x, 0)) == MEM)
4134 /* If we have a (addressof (mem ..)), do any instantiation inside
4135 since we know we'll be making the inside valid when we finally
4136 remove the ADDRESSOF. */
4137 instantiate_virtual_regs_1 (&XEXP (XEXP (x, 0), 0), NULL_RTX, 0);
4146 /* Scan all subexpressions. */
4147 fmt = GET_RTX_FORMAT (code);
4148 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
4151 if (!instantiate_virtual_regs_1 (&XEXP (x, i), object, extra_insns))
4154 else if (*fmt == 'E')
4155 for (j = 0; j < XVECLEN (x, i); j++)
4156 if (! instantiate_virtual_regs_1 (&XVECEXP (x, i, j), object,
4163 /* Optimization: assuming this function does not receive nonlocal gotos,
4164 delete the handlers for such, as well as the insns to establish
4165 and disestablish them. */
4168 delete_handlers (void)
4171 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4173 /* Delete the handler by turning off the flag that would
4174 prevent jump_optimize from deleting it.
4175 Also permit deletion of the nonlocal labels themselves
4176 if nothing local refers to them. */
4177 if (GET_CODE (insn) == CODE_LABEL)
4181 LABEL_PRESERVE_P (insn) = 0;
4183 /* Remove it from the nonlocal_label list, to avoid confusing
4185 for (t = nonlocal_labels, last_t = 0; t;
4186 last_t = t, t = TREE_CHAIN (t))
4187 if (DECL_RTL (TREE_VALUE (t)) == insn)
4192 nonlocal_labels = TREE_CHAIN (nonlocal_labels);
4194 TREE_CHAIN (last_t) = TREE_CHAIN (t);
4197 if (GET_CODE (insn) == INSN)
4201 for (t = nonlocal_goto_handler_slots; t != 0; t = XEXP (t, 1))
4202 if (reg_mentioned_p (t, PATTERN (insn)))
4208 || (nonlocal_goto_stack_level != 0
4209 && reg_mentioned_p (nonlocal_goto_stack_level,
4211 delete_related_insns (insn);
4216 /* Return the first insn following those generated by `assign_parms'. */
4219 get_first_nonparm_insn (void)
4222 return NEXT_INSN (last_parm_insn);
4223 return get_insns ();
4226 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
4227 This means a type for which function calls must pass an address to the
4228 function or get an address back from the function.
4229 EXP may be a type node or an expression (whose type is tested). */
4232 aggregate_value_p (tree exp, tree fntype)
4234 int i, regno, nregs;
4237 tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
4240 switch (TREE_CODE (fntype))
4243 fntype = get_callee_fndecl (fntype);
4244 fntype = fntype ? TREE_TYPE (fntype) : 0;
4247 fntype = TREE_TYPE (fntype);
4252 case IDENTIFIER_NODE:
4256 /* We don't expect other rtl types here. */
4260 if (TREE_CODE (type) == VOID_TYPE)
4262 if (targetm.calls.return_in_memory (type, fntype))
4264 /* Types that are TREE_ADDRESSABLE must be constructed in memory,
4265 and thus can't be returned in registers. */
4266 if (TREE_ADDRESSABLE (type))
4268 if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
4270 /* Make sure we have suitable call-clobbered regs to return
4271 the value in; if not, we must return it in memory. */
4272 reg = hard_function_value (type, 0, 0);
4274 /* If we have something other than a REG (e.g. a PARALLEL), then assume
4276 if (GET_CODE (reg) != REG)
4279 regno = REGNO (reg);
4280 nregs = hard_regno_nregs[regno][TYPE_MODE (type)];
4281 for (i = 0; i < nregs; i++)
4282 if (! call_used_regs[regno + i])
4287 /* Assign RTL expressions to the function's parameters.
4288 This may involve copying them into registers and using
4289 those registers as the RTL for them. */
4292 assign_parms (tree fndecl)
4295 CUMULATIVE_ARGS args_so_far;
4296 /* Total space needed so far for args on the stack,
4297 given as a constant and a tree-expression. */
4298 struct args_size stack_args_size;
4299 HOST_WIDE_INT extra_pretend_bytes = 0;
4300 tree fntype = TREE_TYPE (fndecl);
4301 tree fnargs = DECL_ARGUMENTS (fndecl), orig_fnargs;
4302 /* This is used for the arg pointer when referring to stack args. */
4303 rtx internal_arg_pointer;
4304 /* This is a dummy PARM_DECL that we used for the function result if
4305 the function returns a structure. */
4306 tree function_result_decl = 0;
4307 int varargs_setup = 0;
4308 int reg_parm_stack_space ATTRIBUTE_UNUSED = 0;
4309 rtx conversion_insns = 0;
4311 /* Nonzero if function takes extra anonymous args.
4312 This means the last named arg must be on the stack
4313 right before the anonymous ones. */
4315 = (TYPE_ARG_TYPES (fntype) != 0
4316 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype)))
4317 != void_type_node));
4319 current_function_stdarg = stdarg;
4321 /* If the reg that the virtual arg pointer will be translated into is
4322 not a fixed reg or is the stack pointer, make a copy of the virtual
4323 arg pointer, and address parms via the copy. The frame pointer is
4324 considered fixed even though it is not marked as such.
4326 The second time through, simply use ap to avoid generating rtx. */
4328 if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
4329 || ! (fixed_regs[ARG_POINTER_REGNUM]
4330 || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
4331 internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
4333 internal_arg_pointer = virtual_incoming_args_rtx;
4334 current_function_internal_arg_pointer = internal_arg_pointer;
4336 stack_args_size.constant = 0;
4337 stack_args_size.var = 0;
4339 /* If struct value address is treated as the first argument, make it so. */
4340 if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
4341 && ! current_function_returns_pcc_struct
4342 && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
4344 tree type = build_pointer_type (TREE_TYPE (fntype));
4346 function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
4348 DECL_ARG_TYPE (function_result_decl) = type;
4349 TREE_CHAIN (function_result_decl) = fnargs;
4350 fnargs = function_result_decl;
4353 orig_fnargs = fnargs;
4355 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
4356 parm_reg_stack_loc = ggc_alloc_cleared (max_parm_reg * sizeof (rtx));
4358 /* If the target wants to split complex arguments into scalars, do so. */
4359 if (targetm.calls.split_complex_arg)
4360 fnargs = split_complex_args (fnargs);
4362 #ifdef REG_PARM_STACK_SPACE
4363 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
4366 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
4367 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
4369 INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, fndecl, -1);
4372 /* We haven't yet found an argument that we must push and pretend the
4374 current_function_pretend_args_size = 0;
4376 for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
4380 enum machine_mode promoted_mode, passed_mode;
4381 enum machine_mode nominal_mode, promoted_nominal_mode;
4383 struct locate_and_pad_arg_data locate;
4384 int passed_pointer = 0;
4385 int did_conversion = 0;
4386 tree passed_type = DECL_ARG_TYPE (parm);
4387 tree nominal_type = TREE_TYPE (parm);
4388 int last_named = 0, named_arg;
4391 int pretend_bytes = 0;
4392 int loaded_in_reg = 0;
4394 /* Set LAST_NAMED if this is last named arg before last
4400 for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
4401 if (DECL_NAME (tem))
4407 /* Set NAMED_ARG if this arg should be treated as a named arg. For
4408 most machines, if this is a varargs/stdarg function, then we treat
4409 the last named arg as if it were anonymous too. */
4410 named_arg = (targetm.calls.strict_argument_naming (&args_so_far)
4413 if (TREE_TYPE (parm) == error_mark_node
4414 /* This can happen after weird syntax errors
4415 or if an enum type is defined among the parms. */
4416 || TREE_CODE (parm) != PARM_DECL
4417 || passed_type == NULL)
4419 SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
4420 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4421 TREE_USED (parm) = 1;
4425 /* Find mode of arg as it is passed, and mode of arg
4426 as it should be during execution of this function. */
4427 passed_mode = TYPE_MODE (passed_type);
4428 nominal_mode = TYPE_MODE (nominal_type);
4430 /* If the parm's mode is VOID, its value doesn't matter,
4431 and avoid the usual things like emit_move_insn that could crash. */
4432 if (nominal_mode == VOIDmode)
4434 SET_DECL_RTL (parm, const0_rtx);
4435 DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
4439 /* If the parm is to be passed as a transparent union, use the
4440 type of the first field for the tests below. We have already
4441 verified that the modes are the same. */
4442 if (DECL_TRANSPARENT_UNION (parm)
4443 || (TREE_CODE (passed_type) == UNION_TYPE
4444 && TYPE_TRANSPARENT_UNION (passed_type)))
4445 passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
4447 /* See if this arg was passed by invisible reference. It is if
4448 it is an object whose size depends on the contents of the
4449 object itself or if the machine requires these objects be passed
4452 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (passed_type))
4453 || TREE_ADDRESSABLE (passed_type)
4454 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
4455 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
4456 passed_type, named_arg)
4460 passed_type = nominal_type = build_pointer_type (passed_type);
4462 passed_mode = nominal_mode = Pmode;
4464 /* See if the frontend wants to pass this by invisible reference. */
4465 else if (passed_type != nominal_type
4466 && POINTER_TYPE_P (passed_type)
4467 && TREE_TYPE (passed_type) == nominal_type)
4469 nominal_type = passed_type;
4471 passed_mode = nominal_mode = Pmode;
4474 promoted_mode = passed_mode;
4476 if (targetm.calls.promote_function_args (TREE_TYPE (fndecl)))
4478 /* Compute the mode in which the arg is actually extended to. */
4479 unsignedp = TYPE_UNSIGNED (passed_type);
4480 promoted_mode = promote_mode (passed_type, promoted_mode,
4484 /* Let machine desc say which reg (if any) the parm arrives in.
4485 0 means it arrives on the stack. */
4486 #ifdef FUNCTION_INCOMING_ARG
4487 entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4488 passed_type, named_arg);
4490 entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
4491 passed_type, named_arg);
4494 if (entry_parm == 0)
4495 promoted_mode = passed_mode;
4497 /* If this is the last named parameter, do any required setup for
4498 varargs or stdargs. We need to know about the case of this being an
4499 addressable type, in which case we skip the registers it
4500 would have arrived in.
4502 For stdargs, LAST_NAMED will be set for two parameters, the one that
4503 is actually the last named, and the dummy parameter. We only
4504 want to do this action once.
4506 Also, indicate when RTL generation is to be suppressed. */
4507 if (last_named && !varargs_setup)
4509 int varargs_pretend_bytes = 0;
4510 targetm.calls.setup_incoming_varargs (&args_so_far, promoted_mode,
4512 &varargs_pretend_bytes, 0);
4515 /* If the back-end has requested extra stack space, record how
4516 much is needed. Do not change pretend_args_size otherwise
4517 since it may be nonzero from an earlier partial argument. */
4518 if (varargs_pretend_bytes > 0)
4519 current_function_pretend_args_size = varargs_pretend_bytes;
4522 /* Determine parm's home in the stack,
4523 in case it arrives in the stack or we should pretend it did.
4525 Compute the stack position and rtx where the argument arrives
4528 There is one complexity here: If this was a parameter that would
4529 have been passed in registers, but wasn't only because it is
4530 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
4531 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
4532 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
4533 0 as it was the previous time. */
4534 in_regs = entry_parm != 0;
4535 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4538 if (!in_regs && !named_arg)
4541 targetm.calls.pretend_outgoing_varargs_named (&args_so_far);
4544 #ifdef FUNCTION_INCOMING_ARG
4545 in_regs = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
4547 pretend_named) != 0;
4549 in_regs = FUNCTION_ARG (args_so_far, promoted_mode,
4551 pretend_named) != 0;
4556 /* If this parameter was passed both in registers and in the stack,
4557 use the copy on the stack. */
4558 if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
4561 #ifdef FUNCTION_ARG_PARTIAL_NREGS
4564 partial = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
4565 passed_type, named_arg);
4567 /* The caller might already have allocated stack space
4568 for the register parameters. */
4569 && reg_parm_stack_space == 0)
4571 /* Part of this argument is passed in registers and part
4572 is passed on the stack. Ask the prologue code to extend
4573 the stack part so that we can recreate the full value.
4575 PRETEND_BYTES is the size of the registers we need to store.
4576 CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
4577 stack space that the prologue should allocate.
4579 Internally, gcc assumes that the argument pointer is
4580 aligned to STACK_BOUNDARY bits. This is used both for
4581 alignment optimizations (see init_emit) and to locate
4582 arguments that are aligned to more than PARM_BOUNDARY
4583 bits. We must preserve this invariant by rounding
4584 CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to a stack
4587 /* We assume at most one partial arg, and it must be the first
4588 argument on the stack. */
4589 if (extra_pretend_bytes || current_function_pretend_args_size)
4592 pretend_bytes = partial * UNITS_PER_WORD;
4593 current_function_pretend_args_size
4594 = CEIL_ROUND (pretend_bytes, STACK_BYTES);
4596 /* We want to align relative to the actual stack pointer, so
4597 don't include this in the stack size until later. */
4598 extra_pretend_bytes = current_function_pretend_args_size;
4603 memset (&locate, 0, sizeof (locate));
4604 locate_and_pad_parm (promoted_mode, passed_type, in_regs,
4605 entry_parm ? partial : 0, fndecl,
4606 &stack_args_size, &locate);
4607 /* Adjust offsets to include the pretend args. */
4608 locate.slot_offset.constant += extra_pretend_bytes - pretend_bytes;
4609 locate.offset.constant += extra_pretend_bytes - pretend_bytes;
4614 /* If we're passing this arg using a reg, make its stack home
4615 the aligned stack slot. */
4617 offset_rtx = ARGS_SIZE_RTX (locate.slot_offset);
4619 offset_rtx = ARGS_SIZE_RTX (locate.offset);
4621 if (offset_rtx == const0_rtx)
4622 stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
4624 stack_parm = gen_rtx_MEM (promoted_mode,
4625 gen_rtx_PLUS (Pmode,
4626 internal_arg_pointer,
4629 set_mem_attributes (stack_parm, parm, 1);
4630 if (entry_parm && MEM_ATTRS (stack_parm)->align < PARM_BOUNDARY)
4631 set_mem_align (stack_parm, PARM_BOUNDARY);
4633 /* Set also REG_ATTRS if parameter was passed in a register. */
4635 set_reg_attrs_for_parm (entry_parm, stack_parm);
4638 /* If this parm was passed part in regs and part in memory,
4639 pretend it arrived entirely in memory
4640 by pushing the register-part onto the stack.
4642 In the special case of a DImode or DFmode that is split,
4643 we could put it together in a pseudoreg directly,
4644 but for now that's not worth bothering with. */
4648 /* Handle calls that pass values in multiple non-contiguous
4649 locations. The Irix 6 ABI has examples of this. */
4650 if (GET_CODE (entry_parm) == PARALLEL)
4651 emit_group_store (validize_mem (stack_parm), entry_parm,
4653 int_size_in_bytes (TREE_TYPE (parm)));
4656 move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
4659 entry_parm = stack_parm;
4662 /* If we didn't decide this parm came in a register,
4663 by default it came on the stack. */
4664 if (entry_parm == 0)
4665 entry_parm = stack_parm;
4667 /* Record permanently how this parm was passed. */
4668 set_decl_incoming_rtl (parm, entry_parm);
4670 /* If there is actually space on the stack for this parm,
4671 count it in stack_args_size; otherwise set stack_parm to 0
4672 to indicate there is no preallocated stack slot for the parm. */
4674 if (entry_parm == stack_parm
4675 || (GET_CODE (entry_parm) == PARALLEL
4676 && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
4677 #if defined (REG_PARM_STACK_SPACE)
4678 /* On some machines, even if a parm value arrives in a register
4679 there is still an (uninitialized) stack slot allocated
4681 || REG_PARM_STACK_SPACE (fndecl) > 0
4685 stack_args_size.constant += locate.size.constant;
4686 if (locate.size.var)
4687 ADD_PARM_SIZE (stack_args_size, locate.size.var);
4690 /* No stack slot was pushed for this parm. */
4693 /* Update info on where next arg arrives in registers. */
4695 FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
4696 passed_type, named_arg);
4698 /* If we can't trust the parm stack slot to be aligned enough
4699 for its ultimate type, don't use that slot after entry.
4700 We'll make another stack slot, if we need one. */
4702 unsigned int thisparm_boundary
4703 = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
4705 if (GET_MODE_ALIGNMENT (nominal_mode) > thisparm_boundary)
4709 /* If parm was passed in memory, and we need to convert it on entry,
4710 don't store it back in that same slot. */
4711 if (entry_parm == stack_parm
4712 && nominal_mode != BLKmode && nominal_mode != passed_mode)
4715 /* When an argument is passed in multiple locations, we can't
4716 make use of this information, but we can save some copying if
4717 the whole argument is passed in a single register. */
4718 if (GET_CODE (entry_parm) == PARALLEL
4719 && nominal_mode != BLKmode && passed_mode != BLKmode)
4721 int i, len = XVECLEN (entry_parm, 0);
4723 for (i = 0; i < len; i++)
4724 if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
4725 && GET_CODE (XEXP (XVECEXP (entry_parm, 0, i), 0)) == REG
4726 && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
4728 && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
4730 entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
4731 set_decl_incoming_rtl (parm, entry_parm);
4736 /* ENTRY_PARM is an RTX for the parameter as it arrives,
4737 in the mode in which it arrives.
4738 STACK_PARM is an RTX for a stack slot where the parameter can live
4739 during the function (in case we want to put it there).
4740 STACK_PARM is 0 if no stack slot was pushed for it.
4742 Now output code if necessary to convert ENTRY_PARM to
4743 the type in which this function declares it,
4744 and store that result in an appropriate place,
4745 which may be a pseudo reg, may be STACK_PARM,
4746 or may be a local stack slot if STACK_PARM is 0.
4748 Set DECL_RTL to that place. */
4750 if (GET_CODE (entry_parm) == PARALLEL && nominal_mode != BLKmode
4751 && XVECLEN (entry_parm, 0) > 1)
4753 /* Reconstitute objects the size of a register or larger using
4754 register operations instead of the stack. */
4755 rtx parmreg = gen_reg_rtx (nominal_mode);
4757 if (REG_P (parmreg))
4759 unsigned int regno = REGNO (parmreg);
4761 emit_group_store (parmreg, entry_parm, TREE_TYPE (parm),
4762 int_size_in_bytes (TREE_TYPE (parm)));
4763 SET_DECL_RTL (parm, parmreg);
4766 if (regno >= max_parm_reg)
4769 int old_max_parm_reg = max_parm_reg;
4771 /* It's slow to expand this one register at a time,
4772 but it's also rare and we need max_parm_reg to be
4773 precisely correct. */
4774 max_parm_reg = regno + 1;
4775 new = ggc_realloc (parm_reg_stack_loc,
4776 max_parm_reg * sizeof (rtx));
4777 memset (new + old_max_parm_reg, 0,
4778 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
4779 parm_reg_stack_loc = new;
4780 parm_reg_stack_loc[regno] = stack_parm;
4785 if (nominal_mode == BLKmode
4786 #ifdef BLOCK_REG_PADDING
4787 || (locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
4788 && GET_MODE_SIZE (promoted_mode) < UNITS_PER_WORD)
4790 || GET_CODE (entry_parm) == PARALLEL)
4792 /* If a BLKmode arrives in registers, copy it to a stack slot.
4793 Handle calls that pass values in multiple non-contiguous
4794 locations. The Irix 6 ABI has examples of this. */
4795 if (GET_CODE (entry_parm) == REG
4796 || (GET_CODE (entry_parm) == PARALLEL
4797 && (!loaded_in_reg || !optimize)))
4799 int size = int_size_in_bytes (TREE_TYPE (parm));
4800 int size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
4803 /* Note that we will be storing an integral number of words.
4804 So we have to be careful to ensure that we allocate an
4805 integral number of words. We do this below in the
4806 assign_stack_local if space was not allocated in the argument
4807 list. If it was, this will not work if PARM_BOUNDARY is not
4808 a multiple of BITS_PER_WORD. It isn't clear how to fix this
4809 if it becomes a problem. Exception is when BLKmode arrives
4810 with arguments not conforming to word_mode. */
4812 if (stack_parm == 0)
4814 stack_parm = assign_stack_local (BLKmode, size_stored, 0);
4815 PUT_MODE (stack_parm, GET_MODE (entry_parm));
4816 set_mem_attributes (stack_parm, parm, 1);
4818 else if (GET_CODE (entry_parm) == PARALLEL
4819 && GET_MODE(entry_parm) == BLKmode)
4821 else if (PARM_BOUNDARY % BITS_PER_WORD != 0)
4824 mem = validize_mem (stack_parm);
4826 /* Handle calls that pass values in multiple non-contiguous
4827 locations. The Irix 6 ABI has examples of this. */
4828 if (GET_CODE (entry_parm) == PARALLEL)
4829 emit_group_store (mem, entry_parm, TREE_TYPE (parm), size);
4834 /* If SIZE is that of a mode no bigger than a word, just use
4835 that mode's store operation. */
4836 else if (size <= UNITS_PER_WORD)
4838 enum machine_mode mode
4839 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
4842 #ifdef BLOCK_REG_PADDING
4843 && (size == UNITS_PER_WORD
4844 || (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4845 != (BYTES_BIG_ENDIAN ? upward : downward)))
4849 rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
4850 emit_move_insn (change_address (mem, mode, 0), reg);
4853 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
4854 machine must be aligned to the left before storing
4855 to memory. Note that the previous test doesn't
4856 handle all cases (e.g. SIZE == 3). */
4857 else if (size != UNITS_PER_WORD
4858 #ifdef BLOCK_REG_PADDING
4859 && (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
4867 int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
4868 rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
4870 x = expand_binop (word_mode, ashl_optab, reg,
4871 GEN_INT (by), 0, 1, OPTAB_WIDEN);
4872 tem = change_address (mem, word_mode, 0);
4873 emit_move_insn (tem, x);
4876 move_block_from_reg (REGNO (entry_parm), mem,
4877 size_stored / UNITS_PER_WORD);
4880 move_block_from_reg (REGNO (entry_parm), mem,
4881 size_stored / UNITS_PER_WORD);
4883 /* If parm is already bound to register pair, don't change
4885 if (! DECL_RTL_SET_P (parm))
4886 SET_DECL_RTL (parm, stack_parm);
4888 else if (! ((! optimize
4889 && ! DECL_REGISTER (parm))
4890 || TREE_SIDE_EFFECTS (parm)
4891 /* If -ffloat-store specified, don't put explicit
4892 float variables into registers. */
4893 || (flag_float_store
4894 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))
4895 /* Always assign pseudo to structure return or item passed
4896 by invisible reference. */
4897 || passed_pointer || parm == function_result_decl)
4899 /* Store the parm in a pseudoregister during the function, but we
4900 may need to do it in a wider mode. */
4903 unsigned int regno, regnoi = 0, regnor = 0;
4905 unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
4907 promoted_nominal_mode
4908 = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
4910 parmreg = gen_reg_rtx (promoted_nominal_mode);
4911 mark_user_reg (parmreg);
4913 /* If this was an item that we received a pointer to, set DECL_RTL
4917 rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
4919 set_mem_attributes (x, parm, 1);
4920 SET_DECL_RTL (parm, x);
4924 SET_DECL_RTL (parm, parmreg);
4925 maybe_set_unchanging (DECL_RTL (parm), parm);
4928 /* Copy the value into the register. */
4929 if (nominal_mode != passed_mode
4930 || promoted_nominal_mode != promoted_mode)
4933 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
4934 mode, by the caller. We now have to convert it to
4935 NOMINAL_MODE, if different. However, PARMREG may be in
4936 a different mode than NOMINAL_MODE if it is being stored
4939 If ENTRY_PARM is a hard register, it might be in a register
4940 not valid for operating in its mode (e.g., an odd-numbered
4941 register for a DFmode). In that case, moves are the only
4942 thing valid, so we can't do a convert from there. This
4943 occurs when the calling sequence allow such misaligned
4946 In addition, the conversion may involve a call, which could
4947 clobber parameters which haven't been copied to pseudo
4948 registers yet. Therefore, we must first copy the parm to
4949 a pseudo reg here, and save the conversion until after all
4950 parameters have been moved. */
4952 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
4954 emit_move_insn (tempreg, validize_mem (entry_parm));
4956 push_to_sequence (conversion_insns);
4957 tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
4959 if (GET_CODE (tempreg) == SUBREG
4960 && GET_MODE (tempreg) == nominal_mode
4961 && GET_CODE (SUBREG_REG (tempreg)) == REG
4962 && nominal_mode == passed_mode
4963 && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
4964 && GET_MODE_SIZE (GET_MODE (tempreg))
4965 < GET_MODE_SIZE (GET_MODE (entry_parm)))
4967 /* The argument is already sign/zero extended, so note it
4969 SUBREG_PROMOTED_VAR_P (tempreg) = 1;
4970 SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
4973 /* TREE_USED gets set erroneously during expand_assignment. */
4974 save_tree_used = TREE_USED (parm);
4975 expand_assignment (parm,
4976 make_tree (nominal_type, tempreg), 0);
4977 TREE_USED (parm) = save_tree_used;
4978 conversion_insns = get_insns ();
4983 emit_move_insn (parmreg, validize_mem (entry_parm));
4985 /* If we were passed a pointer but the actual value
4986 can safely live in a register, put it in one. */
4987 if (passed_pointer && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
4988 /* If by-reference argument was promoted, demote it. */
4989 && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
4991 && ! DECL_REGISTER (parm))
4992 || TREE_SIDE_EFFECTS (parm)
4993 /* If -ffloat-store specified, don't put explicit
4994 float variables into registers. */
4995 || (flag_float_store
4996 && TREE_CODE (TREE_TYPE (parm)) == REAL_TYPE))))
4998 /* We can't use nominal_mode, because it will have been set to
4999 Pmode above. We must use the actual mode of the parm. */
5000 parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
5001 mark_user_reg (parmreg);
5002 if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
5004 rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
5005 int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
5006 push_to_sequence (conversion_insns);
5007 emit_move_insn (tempreg, DECL_RTL (parm));
5009 convert_to_mode (GET_MODE (parmreg),
5012 emit_move_insn (parmreg, DECL_RTL (parm));
5013 conversion_insns = get_insns();
5018 emit_move_insn (parmreg, DECL_RTL (parm));
5019 SET_DECL_RTL (parm, parmreg);
5020 /* STACK_PARM is the pointer, not the parm, and PARMREG is
5024 #ifdef FUNCTION_ARG_CALLEE_COPIES
5025 /* If we are passed an arg by reference and it is our responsibility
5026 to make a copy, do it now.
5027 PASSED_TYPE and PASSED mode now refer to the pointer, not the
5028 original argument, so we must recreate them in the call to
5029 FUNCTION_ARG_CALLEE_COPIES. */
5030 /* ??? Later add code to handle the case that if the argument isn't
5031 modified, don't do the copy. */
5033 else if (passed_pointer
5034 && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
5035 TYPE_MODE (TREE_TYPE (passed_type)),
5036 TREE_TYPE (passed_type),
5038 && ! TREE_ADDRESSABLE (TREE_TYPE (passed_type)))
5041 tree type = TREE_TYPE (passed_type);
5043 /* This sequence may involve a library call perhaps clobbering
5044 registers that haven't been copied to pseudos yet. */
5046 push_to_sequence (conversion_insns);
5048 if (!COMPLETE_TYPE_P (type)
5049 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5050 /* This is a variable sized object. */
5051 copy = gen_rtx_MEM (BLKmode,
5052 allocate_dynamic_stack_space
5053 (expr_size (parm), NULL_RTX,
5054 TYPE_ALIGN (type)));
5056 copy = assign_stack_temp (TYPE_MODE (type),
5057 int_size_in_bytes (type), 1);
5058 set_mem_attributes (copy, parm, 1);
5060 store_expr (parm, copy, 0);
5061 emit_move_insn (parmreg, XEXP (copy, 0));
5062 conversion_insns = get_insns ();
5066 #endif /* FUNCTION_ARG_CALLEE_COPIES */
5068 /* In any case, record the parm's desired stack location
5069 in case we later discover it must live in the stack.
5071 If it is a COMPLEX value, store the stack location for both
5074 if (GET_CODE (parmreg) == CONCAT)
5075 regno = MAX (REGNO (XEXP (parmreg, 0)), REGNO (XEXP (parmreg, 1)));
5077 regno = REGNO (parmreg);
5079 if (regno >= max_parm_reg)
5082 int old_max_parm_reg = max_parm_reg;
5084 /* It's slow to expand this one register at a time,
5085 but it's also rare and we need max_parm_reg to be
5086 precisely correct. */
5087 max_parm_reg = regno + 1;
5088 new = ggc_realloc (parm_reg_stack_loc,
5089 max_parm_reg * sizeof (rtx));
5090 memset (new + old_max_parm_reg, 0,
5091 (max_parm_reg - old_max_parm_reg) * sizeof (rtx));
5092 parm_reg_stack_loc = new;
5095 if (GET_CODE (parmreg) == CONCAT)
5097 enum machine_mode submode = GET_MODE (XEXP (parmreg, 0));
5099 regnor = REGNO (gen_realpart (submode, parmreg));
5100 regnoi = REGNO (gen_imagpart (submode, parmreg));
5102 if (stack_parm != 0)
5104 parm_reg_stack_loc[regnor]
5105 = gen_realpart (submode, stack_parm);
5106 parm_reg_stack_loc[regnoi]
5107 = gen_imagpart (submode, stack_parm);
5111 parm_reg_stack_loc[regnor] = 0;
5112 parm_reg_stack_loc[regnoi] = 0;
5116 parm_reg_stack_loc[REGNO (parmreg)] = stack_parm;
5118 /* Mark the register as eliminable if we did no conversion
5119 and it was copied from memory at a fixed offset,
5120 and the arg pointer was not copied to a pseudo-reg.
5121 If the arg pointer is a pseudo reg or the offset formed
5122 an invalid address, such memory-equivalences
5123 as we make here would screw up life analysis for it. */
5124 if (nominal_mode == passed_mode
5127 && GET_CODE (stack_parm) == MEM
5128 && locate.offset.var == 0
5129 && reg_mentioned_p (virtual_incoming_args_rtx,
5130 XEXP (stack_parm, 0)))
5132 rtx linsn = get_last_insn ();
5135 /* Mark complex types separately. */
5136 if (GET_CODE (parmreg) == CONCAT)
5137 /* Scan backwards for the set of the real and
5139 for (sinsn = linsn; sinsn != 0;
5140 sinsn = prev_nonnote_insn (sinsn))
5142 set = single_set (sinsn);
5144 && SET_DEST (set) == regno_reg_rtx [regnoi])
5146 = gen_rtx_EXPR_LIST (REG_EQUIV,
5147 parm_reg_stack_loc[regnoi],
5150 && SET_DEST (set) == regno_reg_rtx [regnor])
5152 = gen_rtx_EXPR_LIST (REG_EQUIV,
5153 parm_reg_stack_loc[regnor],
5156 else if ((set = single_set (linsn)) != 0
5157 && SET_DEST (set) == parmreg)
5159 = gen_rtx_EXPR_LIST (REG_EQUIV,
5160 stack_parm, REG_NOTES (linsn));
5163 /* For pointer data type, suggest pointer register. */
5164 if (POINTER_TYPE_P (TREE_TYPE (parm)))
5165 mark_reg_pointer (parmreg,
5166 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
5168 /* If something wants our address, try to use ADDRESSOF. */
5169 if (TREE_ADDRESSABLE (parm))
5171 /* If we end up putting something into the stack,
5172 fixup_var_refs_insns will need to make a pass over
5173 all the instructions. It looks through the pending
5174 sequences -- but it can't see the ones in the
5175 CONVERSION_INSNS, if they're not on the sequence
5176 stack. So, we go back to that sequence, just so that
5177 the fixups will happen. */
5178 push_to_sequence (conversion_insns);
5179 put_var_into_stack (parm, /*rescan=*/true);
5180 conversion_insns = get_insns ();
5186 /* Value must be stored in the stack slot STACK_PARM
5187 during function execution. */
5189 if (promoted_mode != nominal_mode)
5191 /* Conversion is required. */
5192 rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
5194 emit_move_insn (tempreg, validize_mem (entry_parm));
5196 push_to_sequence (conversion_insns);
5197 entry_parm = convert_to_mode (nominal_mode, tempreg,
5198 TYPE_UNSIGNED (TREE_TYPE (parm)));
5200 /* ??? This may need a big-endian conversion on sparc64. */
5201 stack_parm = adjust_address (stack_parm, nominal_mode, 0);
5203 conversion_insns = get_insns ();
5208 if (entry_parm != stack_parm)
5210 if (stack_parm == 0)
5213 = assign_stack_local (GET_MODE (entry_parm),
5214 GET_MODE_SIZE (GET_MODE (entry_parm)),
5216 set_mem_attributes (stack_parm, parm, 1);
5219 if (promoted_mode != nominal_mode)
5221 push_to_sequence (conversion_insns);
5222 emit_move_insn (validize_mem (stack_parm),
5223 validize_mem (entry_parm));
5224 conversion_insns = get_insns ();
5228 emit_move_insn (validize_mem (stack_parm),
5229 validize_mem (entry_parm));
5232 SET_DECL_RTL (parm, stack_parm);
5236 if (targetm.calls.split_complex_arg && fnargs != orig_fnargs)
5238 for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
5240 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
5241 && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
5243 rtx tmp, real, imag;
5244 enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
5246 real = DECL_RTL (fnargs);
5247 imag = DECL_RTL (TREE_CHAIN (fnargs));
5248 if (inner != GET_MODE (real))
5250 real = gen_lowpart_SUBREG (inner, real);
5251 imag = gen_lowpart_SUBREG (inner, imag);
5253 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
5254 SET_DECL_RTL (parm, tmp);
5256 real = DECL_INCOMING_RTL (fnargs);
5257 imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
5258 if (inner != GET_MODE (real))
5260 real = gen_lowpart_SUBREG (inner, real);
5261 imag = gen_lowpart_SUBREG (inner, imag);
5263 tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
5264 set_decl_incoming_rtl (parm, tmp);
5265 fnargs = TREE_CHAIN (fnargs);
5269 SET_DECL_RTL (parm, DECL_RTL (fnargs));
5270 set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
5272 fnargs = TREE_CHAIN (fnargs);
5276 /* Output all parameter conversion instructions (possibly including calls)
5277 now that all parameters have been copied out of hard registers. */
5278 emit_insn (conversion_insns);
5280 /* If we are receiving a struct value address as the first argument, set up
5281 the RTL for the function result. As this might require code to convert
5282 the transmitted address to Pmode, we do this here to ensure that possible
5283 preliminary conversions of the address have been emitted already. */
5284 if (function_result_decl)
5286 tree result = DECL_RESULT (fndecl);
5287 rtx addr = DECL_RTL (function_result_decl);
5290 addr = convert_memory_address (Pmode, addr);
5291 x = gen_rtx_MEM (DECL_MODE (result), addr);
5292 set_mem_attributes (x, result, 1);
5293 SET_DECL_RTL (result, x);
5296 last_parm_insn = get_last_insn ();
5298 /* We have aligned all the args, so add space for the pretend args. */
5299 stack_args_size.constant += extra_pretend_bytes;
5300 current_function_args_size = stack_args_size.constant;
5302 /* Adjust function incoming argument size for alignment and
5305 #ifdef REG_PARM_STACK_SPACE
5306 current_function_args_size = MAX (current_function_args_size,
5307 REG_PARM_STACK_SPACE (fndecl));
5310 current_function_args_size
5311 = ((current_function_args_size + STACK_BYTES - 1)
5312 / STACK_BYTES) * STACK_BYTES;
5314 #ifdef ARGS_GROW_DOWNWARD
5315 current_function_arg_offset_rtx
5316 = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
5317 : expand_expr (size_diffop (stack_args_size.var,
5318 size_int (-stack_args_size.constant)),
5319 NULL_RTX, VOIDmode, 0));
5321 current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
5324 /* See how many bytes, if any, of its args a function should try to pop
5327 current_function_pops_args = RETURN_POPS_ARGS (fndecl, TREE_TYPE (fndecl),
5328 current_function_args_size);
5330 /* For stdarg.h function, save info about
5331 regs and stack space used by the named args. */
5333 current_function_args_info = args_so_far;
5335 /* Set the rtx used for the function return value. Put this in its
5336 own variable so any optimizers that need this information don't have
5337 to include tree.h. Do this here so it gets done when an inlined
5338 function gets output. */
5340 current_function_return_rtx
5341 = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
5342 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
5344 /* If scalar return value was computed in a pseudo-reg, or was a named
5345 return value that got dumped to the stack, copy that to the hard
5347 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
5349 tree decl_result = DECL_RESULT (fndecl);
5350 rtx decl_rtl = DECL_RTL (decl_result);
5352 if (REG_P (decl_rtl)
5353 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
5354 : DECL_REGISTER (decl_result))
5358 #ifdef FUNCTION_OUTGOING_VALUE
5359 real_decl_rtl = FUNCTION_OUTGOING_VALUE (TREE_TYPE (decl_result),
5362 real_decl_rtl = FUNCTION_VALUE (TREE_TYPE (decl_result),
5365 REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
5366 /* The delay slot scheduler assumes that current_function_return_rtx
5367 holds the hard register containing the return value, not a
5368 temporary pseudo. */
5369 current_function_return_rtx = real_decl_rtl;
5374 /* If ARGS contains entries with complex types, split the entry into two
5375 entries of the component type. Return a new list of substitutions are
5376 needed, else the old list. */
5379 split_complex_args (tree args)
5383 /* Before allocating memory, check for the common case of no complex. */
5384 for (p = args; p; p = TREE_CHAIN (p))
5386 tree type = TREE_TYPE (p);
5387 if (TREE_CODE (type) == COMPLEX_TYPE
5388 && targetm.calls.split_complex_arg (type))
5394 args = copy_list (args);
5396 for (p = args; p; p = TREE_CHAIN (p))
5398 tree type = TREE_TYPE (p);
5399 if (TREE_CODE (type) == COMPLEX_TYPE
5400 && targetm.calls.split_complex_arg (type))
5403 tree subtype = TREE_TYPE (type);
5405 /* Rewrite the PARM_DECL's type with its component. */
5406 TREE_TYPE (p) = subtype;
5407 DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
5408 DECL_MODE (p) = VOIDmode;
5409 DECL_SIZE (p) = NULL;
5410 DECL_SIZE_UNIT (p) = NULL;
5413 /* Build a second synthetic decl. */
5414 decl = build_decl (PARM_DECL, NULL_TREE, subtype);
5415 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
5416 layout_decl (decl, 0);
5418 /* Splice it in; skip the new decl. */
5419 TREE_CHAIN (decl) = TREE_CHAIN (p);
5420 TREE_CHAIN (p) = decl;
5428 /* Indicate whether REGNO is an incoming argument to the current function
5429 that was promoted to a wider mode. If so, return the RTX for the
5430 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
5431 that REGNO is promoted from and whether the promotion was signed or
5435 promoted_input_arg (unsigned int regno, enum machine_mode *pmode, int *punsignedp)
5439 for (arg = DECL_ARGUMENTS (current_function_decl); arg;
5440 arg = TREE_CHAIN (arg))
5441 if (GET_CODE (DECL_INCOMING_RTL (arg)) == REG
5442 && REGNO (DECL_INCOMING_RTL (arg)) == regno
5443 && TYPE_MODE (DECL_ARG_TYPE (arg)) == TYPE_MODE (TREE_TYPE (arg)))
5445 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg));
5446 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (arg));
5448 mode = promote_mode (TREE_TYPE (arg), mode, &unsignedp, 1);
5449 if (mode == GET_MODE (DECL_INCOMING_RTL (arg))
5450 && mode != DECL_MODE (arg))
5452 *pmode = DECL_MODE (arg);
5453 *punsignedp = unsignedp;
5454 return DECL_INCOMING_RTL (arg);
5462 /* Compute the size and offset from the start of the stacked arguments for a
5463 parm passed in mode PASSED_MODE and with type TYPE.
5465 INITIAL_OFFSET_PTR points to the current offset into the stacked
5468 The starting offset and size for this parm are returned in
5469 LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
5470 nonzero, the offset is that of stack slot, which is returned in
5471 LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
5472 padding required from the initial offset ptr to the stack slot.
5474 IN_REGS is nonzero if the argument will be passed in registers. It will
5475 never be set if REG_PARM_STACK_SPACE is not defined.
5477 FNDECL is the function in which the argument was defined.
5479 There are two types of rounding that are done. The first, controlled by
5480 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
5481 list to be aligned to the specific boundary (in bits). This rounding
5482 affects the initial and starting offsets, but not the argument size.
5484 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
5485 optionally rounds the size of the parm to PARM_BOUNDARY. The
5486 initial offset is not affected by this rounding, while the size always
5487 is and the starting offset may be. */
5489 /* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
5490 INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
5491 callers pass in the total size of args so far as
5492 INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
5495 locate_and_pad_parm (enum machine_mode passed_mode, tree type, int in_regs,
5496 int partial, tree fndecl ATTRIBUTE_UNUSED,
5497 struct args_size *initial_offset_ptr,
5498 struct locate_and_pad_arg_data *locate)
5501 enum direction where_pad;
5503 int reg_parm_stack_space = 0;
5504 int part_size_in_regs;
5506 #ifdef REG_PARM_STACK_SPACE
5507 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
5509 /* If we have found a stack parm before we reach the end of the
5510 area reserved for registers, skip that area. */
5513 if (reg_parm_stack_space > 0)
5515 if (initial_offset_ptr->var)
5517 initial_offset_ptr->var
5518 = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
5519 ssize_int (reg_parm_stack_space));
5520 initial_offset_ptr->constant = 0;
5522 else if (initial_offset_ptr->constant < reg_parm_stack_space)
5523 initial_offset_ptr->constant = reg_parm_stack_space;
5526 #endif /* REG_PARM_STACK_SPACE */
5528 part_size_in_regs = 0;
5529 if (reg_parm_stack_space == 0)
5530 part_size_in_regs = ((partial * UNITS_PER_WORD)
5531 / (PARM_BOUNDARY / BITS_PER_UNIT)
5532 * (PARM_BOUNDARY / BITS_PER_UNIT));
5535 = type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
5536 where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
5537 boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
5538 locate->where_pad = where_pad;
5540 #ifdef ARGS_GROW_DOWNWARD
5541 locate->slot_offset.constant = -initial_offset_ptr->constant;
5542 if (initial_offset_ptr->var)
5543 locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
5544 initial_offset_ptr->var);
5548 if (where_pad != none
5549 && (!host_integerp (sizetree, 1)
5550 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5551 s2 = round_up (s2, PARM_BOUNDARY / BITS_PER_UNIT);
5552 SUB_PARM_SIZE (locate->slot_offset, s2);
5555 locate->slot_offset.constant += part_size_in_regs;
5558 #ifdef REG_PARM_STACK_SPACE
5559 || REG_PARM_STACK_SPACE (fndecl) > 0
5562 pad_to_arg_alignment (&locate->slot_offset, boundary,
5563 &locate->alignment_pad);
5565 locate->size.constant = (-initial_offset_ptr->constant
5566 - locate->slot_offset.constant);
5567 if (initial_offset_ptr->var)
5568 locate->size.var = size_binop (MINUS_EXPR,
5569 size_binop (MINUS_EXPR,
5571 initial_offset_ptr->var),
5572 locate->slot_offset.var);
5574 /* Pad_below needs the pre-rounded size to know how much to pad
5576 locate->offset = locate->slot_offset;
5577 if (where_pad == downward)
5578 pad_below (&locate->offset, passed_mode, sizetree);
5580 #else /* !ARGS_GROW_DOWNWARD */
5582 #ifdef REG_PARM_STACK_SPACE
5583 || REG_PARM_STACK_SPACE (fndecl) > 0
5586 pad_to_arg_alignment (initial_offset_ptr, boundary,
5587 &locate->alignment_pad);
5588 locate->slot_offset = *initial_offset_ptr;
5590 #ifdef PUSH_ROUNDING
5591 if (passed_mode != BLKmode)
5592 sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
5595 /* Pad_below needs the pre-rounded size to know how much to pad below
5596 so this must be done before rounding up. */
5597 locate->offset = locate->slot_offset;
5598 if (where_pad == downward)
5599 pad_below (&locate->offset, passed_mode, sizetree);
5601 if (where_pad != none
5602 && (!host_integerp (sizetree, 1)
5603 || (tree_low_cst (sizetree, 1) * BITS_PER_UNIT) % PARM_BOUNDARY))
5604 sizetree = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5606 ADD_PARM_SIZE (locate->size, sizetree);
5608 locate->size.constant -= part_size_in_regs;
5609 #endif /* ARGS_GROW_DOWNWARD */
5612 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
5613 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
5616 pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
5617 struct args_size *alignment_pad)
5619 tree save_var = NULL_TREE;
5620 HOST_WIDE_INT save_constant = 0;
5621 int boundary_in_bytes = boundary / BITS_PER_UNIT;
5622 HOST_WIDE_INT sp_offset = STACK_POINTER_OFFSET;
5624 #ifdef SPARC_STACK_BOUNDARY_HACK
5625 /* The sparc port has a bug. It sometimes claims a STACK_BOUNDARY
5626 higher than the real alignment of %sp. However, when it does this,
5627 the alignment of %sp+STACK_POINTER_OFFSET will be STACK_BOUNDARY.
5628 This is a temporary hack while the sparc port is fixed. */
5629 if (SPARC_STACK_BOUNDARY_HACK)
5633 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5635 save_var = offset_ptr->var;
5636 save_constant = offset_ptr->constant;
5639 alignment_pad->var = NULL_TREE;
5640 alignment_pad->constant = 0;
5642 if (boundary > BITS_PER_UNIT)
5644 if (offset_ptr->var)
5646 tree sp_offset_tree = ssize_int (sp_offset);
5647 tree offset = size_binop (PLUS_EXPR,
5648 ARGS_SIZE_TREE (*offset_ptr),
5650 #ifdef ARGS_GROW_DOWNWARD
5651 tree rounded = round_down (offset, boundary / BITS_PER_UNIT);
5653 tree rounded = round_up (offset, boundary / BITS_PER_UNIT);
5656 offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
5657 /* ARGS_SIZE_TREE includes constant term. */
5658 offset_ptr->constant = 0;
5659 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5660 alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
5665 offset_ptr->constant = -sp_offset +
5666 #ifdef ARGS_GROW_DOWNWARD
5667 FLOOR_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5669 CEIL_ROUND (offset_ptr->constant + sp_offset, boundary_in_bytes);
5671 if (boundary > PARM_BOUNDARY && boundary > STACK_BOUNDARY)
5672 alignment_pad->constant = offset_ptr->constant - save_constant;
5678 pad_below (struct args_size *offset_ptr, enum machine_mode passed_mode, tree sizetree)
5680 if (passed_mode != BLKmode)
5682 if (GET_MODE_BITSIZE (passed_mode) % PARM_BOUNDARY)
5683 offset_ptr->constant
5684 += (((GET_MODE_BITSIZE (passed_mode) + PARM_BOUNDARY - 1)
5685 / PARM_BOUNDARY * PARM_BOUNDARY / BITS_PER_UNIT)
5686 - GET_MODE_SIZE (passed_mode));
5690 if (TREE_CODE (sizetree) != INTEGER_CST
5691 || (TREE_INT_CST_LOW (sizetree) * BITS_PER_UNIT) % PARM_BOUNDARY)
5693 /* Round the size up to multiple of PARM_BOUNDARY bits. */
5694 tree s2 = round_up (sizetree, PARM_BOUNDARY / BITS_PER_UNIT);
5696 ADD_PARM_SIZE (*offset_ptr, s2);
5697 SUB_PARM_SIZE (*offset_ptr, sizetree);
5702 /* Walk the tree of blocks describing the binding levels within a function
5703 and warn about uninitialized variables.
5704 This is done after calling flow_analysis and before global_alloc
5705 clobbers the pseudo-regs to hard regs. */
5708 uninitialized_vars_warning (tree block)
5711 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5713 if (warn_uninitialized
5714 && TREE_CODE (decl) == VAR_DECL
5715 /* These warnings are unreliable for and aggregates
5716 because assigning the fields one by one can fail to convince
5717 flow.c that the entire aggregate was initialized.
5718 Unions are troublesome because members may be shorter. */
5719 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl))
5720 && DECL_RTL_SET_P (decl)
5721 && GET_CODE (DECL_RTL (decl)) == REG
5722 /* Global optimizations can make it difficult to determine if a
5723 particular variable has been initialized. However, a VAR_DECL
5724 with a nonzero DECL_INITIAL had an initializer, so do not
5725 claim it is potentially uninitialized.
5727 When the DECL_INITIAL is NULL call the language hook to tell us
5728 if we want to warn. */
5729 && (DECL_INITIAL (decl) == NULL_TREE || lang_hooks.decl_uninit (decl))
5730 && regno_uninitialized (REGNO (DECL_RTL (decl))))
5731 warning ("%J'%D' might be used uninitialized in this function",
5734 && TREE_CODE (decl) == VAR_DECL
5735 && DECL_RTL_SET_P (decl)
5736 && GET_CODE (DECL_RTL (decl)) == REG
5737 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5738 warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
5741 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5742 uninitialized_vars_warning (sub);
5745 /* Do the appropriate part of uninitialized_vars_warning
5746 but for arguments instead of local variables. */
5749 setjmp_args_warning (void)
5752 for (decl = DECL_ARGUMENTS (current_function_decl);
5753 decl; decl = TREE_CHAIN (decl))
5754 if (DECL_RTL (decl) != 0
5755 && GET_CODE (DECL_RTL (decl)) == REG
5756 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
5757 warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
5761 /* If this function call setjmp, put all vars into the stack
5762 unless they were declared `register'. */
5765 setjmp_protect (tree block)
5768 for (decl = BLOCK_VARS (block); decl; decl = TREE_CHAIN (decl))
5769 if ((TREE_CODE (decl) == VAR_DECL
5770 || TREE_CODE (decl) == PARM_DECL)
5771 && DECL_RTL (decl) != 0
5772 && (GET_CODE (DECL_RTL (decl)) == REG
5773 || (GET_CODE (DECL_RTL (decl)) == MEM
5774 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5775 /* If this variable came from an inline function, it must be
5776 that its life doesn't overlap the setjmp. If there was a
5777 setjmp in the function, it would already be in memory. We
5778 must exclude such variable because their DECL_RTL might be
5779 set to strange things such as virtual_stack_vars_rtx. */
5780 && ! DECL_FROM_INLINE (decl)
5782 #ifdef NON_SAVING_SETJMP
5783 /* If longjmp doesn't restore the registers,
5784 don't put anything in them. */
5788 ! DECL_REGISTER (decl)))
5789 put_var_into_stack (decl, /*rescan=*/true);
5790 for (sub = BLOCK_SUBBLOCKS (block); sub; sub = TREE_CHAIN (sub))
5791 setjmp_protect (sub);
5794 /* Like the previous function, but for args instead of local variables. */
5797 setjmp_protect_args (void)
5800 for (decl = DECL_ARGUMENTS (current_function_decl);
5801 decl; decl = TREE_CHAIN (decl))
5802 if ((TREE_CODE (decl) == VAR_DECL
5803 || TREE_CODE (decl) == PARM_DECL)
5804 && DECL_RTL (decl) != 0
5805 && (GET_CODE (DECL_RTL (decl)) == REG
5806 || (GET_CODE (DECL_RTL (decl)) == MEM
5807 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == ADDRESSOF))
5809 /* If longjmp doesn't restore the registers,
5810 don't put anything in them. */
5811 #ifdef NON_SAVING_SETJMP
5815 ! DECL_REGISTER (decl)))
5816 put_var_into_stack (decl, /*rescan=*/true);
5819 /* Return the context-pointer register corresponding to DECL,
5820 or 0 if it does not need one. */
5823 lookup_static_chain (tree decl)
5825 tree context = decl_function_context (decl);
5829 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_NO_STATIC_CHAIN (decl)))
5832 /* We treat inline_function_decl as an alias for the current function
5833 because that is the inline function whose vars, types, etc.
5834 are being merged into the current function.
5835 See expand_inline_function. */
5836 if (context == current_function_decl || context == inline_function_decl)
5837 return virtual_stack_vars_rtx;
5839 for (link = context_display; link; link = TREE_CHAIN (link))
5840 if (TREE_PURPOSE (link) == context)
5841 return RTL_EXPR_RTL (TREE_VALUE (link));
5846 /* Convert a stack slot address ADDR for variable VAR
5847 (from a containing function)
5848 into an address valid in this function (using a static chain). */
5851 fix_lexical_addr (rtx addr, tree var)
5854 HOST_WIDE_INT displacement;
5855 tree context = decl_function_context (var);
5856 struct function *fp;
5859 /* If this is the present function, we need not do anything. */
5860 if (context == current_function_decl || context == inline_function_decl)
5863 fp = find_function_data (context);
5865 if (GET_CODE (addr) == ADDRESSOF && GET_CODE (XEXP (addr, 0)) == MEM)
5866 addr = XEXP (XEXP (addr, 0), 0);
5868 /* Decode given address as base reg plus displacement. */
5869 if (GET_CODE (addr) == REG)
5870 basereg = addr, displacement = 0;
5871 else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
5872 basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
5876 /* We accept vars reached via the containing function's
5877 incoming arg pointer and via its stack variables pointer. */
5878 if (basereg == fp->internal_arg_pointer)
5880 /* If reached via arg pointer, get the arg pointer value
5881 out of that function's stack frame.
5883 There are two cases: If a separate ap is needed, allocate a
5884 slot in the outer function for it and dereference it that way.
5885 This is correct even if the real ap is actually a pseudo.
5886 Otherwise, just adjust the offset from the frame pointer to
5889 #ifdef NEED_SEPARATE_AP
5892 addr = get_arg_pointer_save_area (fp);
5893 addr = fix_lexical_addr (XEXP (addr, 0), var);
5894 addr = memory_address (Pmode, addr);
5896 base = gen_rtx_MEM (Pmode, addr);
5897 set_mem_alias_set (base, get_frame_alias_set ());
5898 base = copy_to_reg (base);
5900 displacement += (FIRST_PARM_OFFSET (context) - STARTING_FRAME_OFFSET);
5901 base = lookup_static_chain (var);
5905 else if (basereg == virtual_stack_vars_rtx)
5907 /* This is the same code as lookup_static_chain, duplicated here to
5908 avoid an extra call to decl_function_context. */
5911 for (link = context_display; link; link = TREE_CHAIN (link))
5912 if (TREE_PURPOSE (link) == context)
5914 base = RTL_EXPR_RTL (TREE_VALUE (link));
5922 /* Use same offset, relative to appropriate static chain or argument
5924 return plus_constant (base, displacement);
5927 /* Return the address of the trampoline for entering nested fn FUNCTION.
5928 If necessary, allocate a trampoline (in the stack frame)
5929 and emit rtl to initialize its contents (at entry to this function). */
5932 trampoline_address (tree function)
5937 struct function *fp;
5940 /* Find an existing trampoline and return it. */
5941 for (link = trampoline_list; link; link = TREE_CHAIN (link))
5942 if (TREE_PURPOSE (link) == function)
5944 adjust_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0));
5946 for (fp = outer_function_chain; fp; fp = fp->outer)
5947 for (link = fp->x_trampoline_list; link; link = TREE_CHAIN (link))
5948 if (TREE_PURPOSE (link) == function)
5950 tramp = fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link)), 0),
5952 return adjust_trampoline_addr (tramp);
5955 /* None exists; we must make one. */
5957 /* Find the `struct function' for the function containing FUNCTION. */
5959 fn_context = decl_function_context (function);
5960 if (fn_context != current_function_decl
5961 && fn_context != inline_function_decl)
5962 fp = find_function_data (fn_context);
5964 /* Allocate run-time space for this trampoline. */
5965 /* If rounding needed, allocate extra space
5966 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
5967 #define TRAMPOLINE_REAL_SIZE \
5968 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
5969 tramp = assign_stack_local_1 (BLKmode, TRAMPOLINE_REAL_SIZE, 0,
5971 /* Record the trampoline for reuse and note it for later initialization
5972 by expand_function_end. */
5975 rtlexp = make_node (RTL_EXPR);
5976 RTL_EXPR_RTL (rtlexp) = tramp;
5977 fp->x_trampoline_list = tree_cons (function, rtlexp,
5978 fp->x_trampoline_list);
5982 /* Make the RTL_EXPR node temporary, not momentary, so that the
5983 trampoline_list doesn't become garbage. */
5984 rtlexp = make_node (RTL_EXPR);
5986 RTL_EXPR_RTL (rtlexp) = tramp;
5987 trampoline_list = tree_cons (function, rtlexp, trampoline_list);
5990 tramp = fix_lexical_addr (XEXP (tramp, 0), function);
5991 return adjust_trampoline_addr (tramp);
5994 /* Given a trampoline address,
5995 round it to multiple of TRAMPOLINE_ALIGNMENT. */
5998 round_trampoline_addr (rtx tramp)
6000 /* Round address up to desired boundary. */
6001 rtx temp = gen_reg_rtx (Pmode);
6002 rtx addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1);
6003 rtx mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
6005 temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
6006 temp, 0, OPTAB_LIB_WIDEN);
6007 tramp = expand_simple_binop (Pmode, AND, temp, mask,
6008 temp, 0, OPTAB_LIB_WIDEN);
6013 /* Given a trampoline address, round it then apply any
6014 platform-specific adjustments so that the result can be used for a
6018 adjust_trampoline_addr (rtx tramp)
6020 tramp = round_trampoline_addr (tramp);
6021 #ifdef TRAMPOLINE_ADJUST_ADDRESS
6022 TRAMPOLINE_ADJUST_ADDRESS (tramp);
6027 /* Put all this function's BLOCK nodes including those that are chained
6028 onto the first block into a vector, and return it.
6029 Also store in each NOTE for the beginning or end of a block
6030 the index of that block in the vector.
6031 The arguments are BLOCK, the chain of top-level blocks of the function,
6032 and INSNS, the insn chain of the function. */
6035 identify_blocks (void)
6038 tree *block_vector, *last_block_vector;
6040 tree block = DECL_INITIAL (current_function_decl);
6045 /* Fill the BLOCK_VECTOR with all of the BLOCKs in this function, in
6046 depth-first order. */
6047 block_vector = get_block_vector (block, &n_blocks);
6048 block_stack = xmalloc (n_blocks * sizeof (tree));
6050 last_block_vector = identify_blocks_1 (get_insns (),
6052 block_vector + n_blocks,
6055 /* If we didn't use all of the subblocks, we've misplaced block notes. */
6056 /* ??? This appears to happen all the time. Latent bugs elsewhere? */
6057 if (0 && last_block_vector != block_vector + n_blocks)
6060 free (block_vector);
6064 /* Subroutine of identify_blocks. Do the block substitution on the
6065 insn chain beginning with INSNS. Recurse for CALL_PLACEHOLDER chains.
6067 BLOCK_STACK is pushed and popped for each BLOCK_BEGIN/BLOCK_END pair.
6068 BLOCK_VECTOR is incremented for each block seen. */
6071 identify_blocks_1 (rtx insns, tree *block_vector, tree *end_block_vector,
6072 tree *orig_block_stack)
6075 tree *block_stack = orig_block_stack;
6077 for (insn = insns; insn; insn = NEXT_INSN (insn))
6079 if (GET_CODE (insn) == NOTE)
6081 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
6085 /* If there are more block notes than BLOCKs, something
6087 if (block_vector == end_block_vector)
6090 b = *block_vector++;
6091 NOTE_BLOCK (insn) = b;
6094 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
6096 /* If there are more NOTE_INSN_BLOCK_ENDs than
6097 NOTE_INSN_BLOCK_BEGs, something is badly wrong. */
6098 if (block_stack == orig_block_stack)
6101 NOTE_BLOCK (insn) = *--block_stack;
6104 else if (GET_CODE (insn) == CALL_INSN
6105 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
6107 rtx cp = PATTERN (insn);
6109 block_vector = identify_blocks_1 (XEXP (cp, 0), block_vector,
6110 end_block_vector, block_stack);
6112 block_vector = identify_blocks_1 (XEXP (cp, 1), block_vector,
6113 end_block_vector, block_stack);
6115 block_vector = identify_blocks_1 (XEXP (cp, 2), block_vector,
6116 end_block_vector, block_stack);
6120 /* If there are more NOTE_INSN_BLOCK_BEGINs than NOTE_INSN_BLOCK_ENDs,
6121 something is badly wrong. */
6122 if (block_stack != orig_block_stack)
6125 return block_vector;
6128 /* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
6129 and create duplicate blocks. */
6130 /* ??? Need an option to either create block fragments or to create
6131 abstract origin duplicates of a source block. It really depends
6132 on what optimization has been performed. */
6135 reorder_blocks (void)
6137 tree block = DECL_INITIAL (current_function_decl);
6138 varray_type block_stack;
6140 if (block == NULL_TREE)
6143 VARRAY_TREE_INIT (block_stack, 10, "block_stack");
6145 /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
6146 reorder_blocks_0 (block);
6148 /* Prune the old trees away, so that they don't get in the way. */
6149 BLOCK_SUBBLOCKS (block) = NULL_TREE;
6150 BLOCK_CHAIN (block) = NULL_TREE;
6152 /* Recreate the block tree from the note nesting. */
6153 reorder_blocks_1 (get_insns (), block, &block_stack);
6154 BLOCK_SUBBLOCKS (block) = blocks_nreverse (BLOCK_SUBBLOCKS (block));
6156 /* Remove deleted blocks from the block fragment chains. */
6157 reorder_fix_fragments (block);
6160 /* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
6163 reorder_blocks_0 (tree block)
6167 TREE_ASM_WRITTEN (block) = 0;
6168 reorder_blocks_0 (BLOCK_SUBBLOCKS (block));
6169 block = BLOCK_CHAIN (block);
6174 reorder_blocks_1 (rtx insns, tree current_block, varray_type *p_block_stack)
6178 for (insn = insns; insn; insn = NEXT_INSN (insn))
6180 if (GET_CODE (insn) == NOTE)
6182 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
6184 tree block = NOTE_BLOCK (insn);
6186 /* If we have seen this block before, that means it now
6187 spans multiple address regions. Create a new fragment. */
6188 if (TREE_ASM_WRITTEN (block))
6190 tree new_block = copy_node (block);
6193 origin = (BLOCK_FRAGMENT_ORIGIN (block)
6194 ? BLOCK_FRAGMENT_ORIGIN (block)
6196 BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
6197 BLOCK_FRAGMENT_CHAIN (new_block)
6198 = BLOCK_FRAGMENT_CHAIN (origin);
6199 BLOCK_FRAGMENT_CHAIN (origin) = new_block;
6201 NOTE_BLOCK (insn) = new_block;
6205 BLOCK_SUBBLOCKS (block) = 0;
6206 TREE_ASM_WRITTEN (block) = 1;
6207 /* When there's only one block for the entire function,
6208 current_block == block and we mustn't do this, it
6209 will cause infinite recursion. */
6210 if (block != current_block)
6212 BLOCK_SUPERCONTEXT (block) = current_block;
6213 BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
6214 BLOCK_SUBBLOCKS (current_block) = block;
6215 current_block = block;
6217 VARRAY_PUSH_TREE (*p_block_stack, block);
6219 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)
6221 NOTE_BLOCK (insn) = VARRAY_TOP_TREE (*p_block_stack);
6222 VARRAY_POP (*p_block_stack);
6223 BLOCK_SUBBLOCKS (current_block)
6224 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block));
6225 current_block = BLOCK_SUPERCONTEXT (current_block);
6228 else if (GET_CODE (insn) == CALL_INSN
6229 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
6231 rtx cp = PATTERN (insn);
6232 reorder_blocks_1 (XEXP (cp, 0), current_block, p_block_stack);
6234 reorder_blocks_1 (XEXP (cp, 1), current_block, p_block_stack);
6236 reorder_blocks_1 (XEXP (cp, 2), current_block, p_block_stack);
6241 /* Rationalize BLOCK_FRAGMENT_ORIGIN. If an origin block no longer
6242 appears in the block tree, select one of the fragments to become
6243 the new origin block. */
6246 reorder_fix_fragments (tree block)
6250 tree dup_origin = BLOCK_FRAGMENT_ORIGIN (block);
6251 tree new_origin = NULL_TREE;
6255 if (! TREE_ASM_WRITTEN (dup_origin))
6257 new_origin = BLOCK_FRAGMENT_CHAIN (dup_origin);
6259 /* Find the first of the remaining fragments. There must
6260 be at least one -- the current block. */
6261 while (! TREE_ASM_WRITTEN (new_origin))
6262 new_origin = BLOCK_FRAGMENT_CHAIN (new_origin);
6263 BLOCK_FRAGMENT_ORIGIN (new_origin) = NULL_TREE;
6266 else if (! dup_origin)
6269 /* Re-root the rest of the fragments to the new origin. In the
6270 case that DUP_ORIGIN was null, that means BLOCK was the origin
6271 of a chain of fragments and we want to remove those fragments
6272 that didn't make it to the output. */
6275 tree *pp = &BLOCK_FRAGMENT_CHAIN (new_origin);
6280 if (TREE_ASM_WRITTEN (chain))
6282 BLOCK_FRAGMENT_ORIGIN (chain) = new_origin;
6284 pp = &BLOCK_FRAGMENT_CHAIN (chain);
6286 chain = BLOCK_FRAGMENT_CHAIN (chain);
6291 reorder_fix_fragments (BLOCK_SUBBLOCKS (block));
6292 block = BLOCK_CHAIN (block);
6296 /* Reverse the order of elements in the chain T of blocks,
6297 and return the new head of the chain (old last element). */
6300 blocks_nreverse (tree t)
6302 tree prev = 0, decl, next;
6303 for (decl = t; decl; decl = next)
6305 next = BLOCK_CHAIN (decl);
6306 BLOCK_CHAIN (decl) = prev;
6312 /* Count the subblocks of the list starting with BLOCK. If VECTOR is
6313 non-NULL, list them all into VECTOR, in a depth-first preorder
6314 traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
6318 all_blocks (tree block, tree *vector)
6324 TREE_ASM_WRITTEN (block) = 0;
6326 /* Record this block. */
6328 vector[n_blocks] = block;
6332 /* Record the subblocks, and their subblocks... */
6333 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
6334 vector ? vector + n_blocks : 0);
6335 block = BLOCK_CHAIN (block);
6341 /* Return a vector containing all the blocks rooted at BLOCK. The
6342 number of elements in the vector is stored in N_BLOCKS_P. The
6343 vector is dynamically allocated; it is the caller's responsibility
6344 to call `free' on the pointer returned. */
6347 get_block_vector (tree block, int *n_blocks_p)
6351 *n_blocks_p = all_blocks (block, NULL);
6352 block_vector = xmalloc (*n_blocks_p * sizeof (tree));
6353 all_blocks (block, block_vector);
6355 return block_vector;
6358 static GTY(()) int next_block_index = 2;
6360 /* Set BLOCK_NUMBER for all the blocks in FN. */
6363 number_blocks (tree fn)
6369 /* For SDB and XCOFF debugging output, we start numbering the blocks
6370 from 1 within each function, rather than keeping a running
6372 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
6373 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
6374 next_block_index = 1;
6377 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
6379 /* The top-level BLOCK isn't numbered at all. */
6380 for (i = 1; i < n_blocks; ++i)
6381 /* We number the blocks from two. */
6382 BLOCK_NUMBER (block_vector[i]) = next_block_index++;
6384 free (block_vector);
6389 /* If VAR is present in a subblock of BLOCK, return the subblock. */
6392 debug_find_var_in_block_tree (tree var, tree block)
6396 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
6400 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
6402 tree ret = debug_find_var_in_block_tree (var, t);
6410 /* Allocate a function structure for FNDECL and set its contents
6414 allocate_struct_function (tree fndecl)
6418 cfun = ggc_alloc_cleared (sizeof (struct function));
6420 max_parm_reg = LAST_VIRTUAL_REGISTER + 1;
6422 cfun->stack_alignment_needed = STACK_BOUNDARY;
6423 cfun->preferred_stack_boundary = STACK_BOUNDARY;
6425 current_function_funcdef_no = funcdef_no++;
6427 cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
6429 init_stmt_for_function ();
6430 init_eh_for_function ();
6432 lang_hooks.function.init (cfun);
6433 if (init_machine_status)
6434 cfun->machine = (*init_machine_status) ();
6439 DECL_STRUCT_FUNCTION (fndecl) = cfun;
6440 cfun->decl = fndecl;
6442 result = DECL_RESULT (fndecl);
6443 if (aggregate_value_p (result, fndecl))
6445 #ifdef PCC_STATIC_STRUCT_RETURN
6446 current_function_returns_pcc_struct = 1;
6448 current_function_returns_struct = 1;
6451 current_function_returns_pointer = POINTER_TYPE_P (TREE_TYPE (result));
6453 current_function_needs_context
6454 = (decl_function_context (current_function_decl) != 0
6455 && ! DECL_NO_STATIC_CHAIN (current_function_decl));
6458 /* Reset cfun, and other non-struct-function variables to defaults as
6459 appropriate for emitting rtl at the start of a function. */
6462 prepare_function_start (tree fndecl)
6464 if (fndecl && DECL_STRUCT_FUNCTION (fndecl))
6465 cfun = DECL_STRUCT_FUNCTION (fndecl);
6467 allocate_struct_function (fndecl);
6469 init_varasm_status (cfun);
6472 cse_not_expected = ! optimize;
6474 /* Caller save not needed yet. */
6475 caller_save_needed = 0;
6477 /* We haven't done register allocation yet. */
6480 /* Indicate that we need to distinguish between the return value of the
6481 present function and the return value of a function being called. */
6482 rtx_equal_function_value_matters = 1;
6484 /* Indicate that we have not instantiated virtual registers yet. */
6485 virtuals_instantiated = 0;
6487 /* Indicate that we want CONCATs now. */
6488 generating_concat_p = 1;
6490 /* Indicate we have no need of a frame pointer yet. */
6491 frame_pointer_needed = 0;
6494 /* Initialize the rtl expansion mechanism so that we can do simple things
6495 like generate sequences. This is used to provide a context during global
6496 initialization of some passes. */
6498 init_dummy_function_start (void)
6500 prepare_function_start (NULL);
6503 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
6504 and initialize static variables for generating RTL for the statements
6508 init_function_start (tree subr)
6510 prepare_function_start (subr);
6512 /* Within function body, compute a type's size as soon it is laid out. */
6513 immediate_size_expand++;
6515 /* Prevent ever trying to delete the first instruction of a
6516 function. Also tell final how to output a linenum before the
6517 function prologue. Note linenums could be missing, e.g. when
6518 compiling a Java .class file. */
6519 if (DECL_SOURCE_LINE (subr))
6520 emit_line_note (DECL_SOURCE_LOCATION (subr));
6522 /* Make sure first insn is a note even if we don't want linenums.
6523 This makes sure the first insn will never be deleted.
6524 Also, final expects a note to appear there. */
6525 emit_note (NOTE_INSN_DELETED);
6527 /* Warn if this value is an aggregate type,
6528 regardless of which calling convention we are using for it. */
6529 if (warn_aggregate_return
6530 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
6531 warning ("function returns an aggregate");
6534 /* Make sure all values used by the optimization passes have sane
6537 init_function_for_compilation (void)
6541 /* No prologue/epilogue insns yet. */
6542 VARRAY_GROW (prologue, 0);
6543 VARRAY_GROW (epilogue, 0);
6544 VARRAY_GROW (sibcall_epilogue, 0);
6547 /* Expand a call to __main at the beginning of a possible main function. */
6549 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
6550 #undef HAS_INIT_SECTION
6551 #define HAS_INIT_SECTION
6555 expand_main_function (void)
6557 #ifdef FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN
6558 if (FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN)
6560 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
6564 /* Forcibly align the stack. */
6565 #ifdef STACK_GROWS_DOWNWARD
6566 tmp = expand_simple_binop (Pmode, AND, stack_pointer_rtx, GEN_INT(-align),
6567 stack_pointer_rtx, 1, OPTAB_WIDEN);
6569 tmp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
6570 GEN_INT (align - 1), NULL_RTX, 1, OPTAB_WIDEN);
6571 tmp = expand_simple_binop (Pmode, AND, tmp, GEN_INT (-align),
6572 stack_pointer_rtx, 1, OPTAB_WIDEN);
6574 if (tmp != stack_pointer_rtx)
6575 emit_move_insn (stack_pointer_rtx, tmp);
6577 /* Enlist allocate_dynamic_stack_space to pick up the pieces. */
6578 tmp = force_reg (Pmode, const0_rtx);
6579 allocate_dynamic_stack_space (tmp, NULL_RTX, BIGGEST_ALIGNMENT);
6583 for (tmp = get_last_insn (); tmp; tmp = PREV_INSN (tmp))
6584 if (NOTE_P (tmp) && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_FUNCTION_BEG)
6587 emit_insn_before (seq, tmp);
6593 #ifndef HAS_INIT_SECTION
6594 emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0);
6598 /* The PENDING_SIZES represent the sizes of variable-sized types.
6599 Create RTL for the various sizes now (using temporary variables),
6600 so that we can refer to the sizes from the RTL we are generating
6601 for the current function. The PENDING_SIZES are a TREE_LIST. The
6602 TREE_VALUE of each node is a SAVE_EXPR. */
6605 expand_pending_sizes (tree pending_sizes)
6609 /* Evaluate now the sizes of any types declared among the arguments. */
6610 for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
6612 expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
6613 /* Flush the queue in case this parameter declaration has
6619 /* Start the RTL for a new function, and set variables used for
6621 SUBR is the FUNCTION_DECL node.
6622 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
6623 the function's parameters, which must be run at any return statement. */
6626 expand_function_start (tree subr, int parms_have_cleanups)
6629 rtx last_ptr = NULL_RTX;
6631 /* Make sure volatile mem refs aren't considered
6632 valid operands of arithmetic insns. */
6633 init_recog_no_volatile ();
6635 current_function_instrument_entry_exit
6636 = (flag_instrument_function_entry_exit
6637 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6639 current_function_profile
6641 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
6643 current_function_limit_stack
6644 = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
6646 /* If function gets a static chain arg, store it in the stack frame.
6647 Do this first, so it gets the first stack slot offset. */
6648 if (current_function_needs_context)
6650 last_ptr = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
6652 /* Delay copying static chain if it is not a register to avoid
6653 conflicts with regs used for parameters. */
6654 if (! SMALL_REGISTER_CLASSES
6655 || GET_CODE (static_chain_incoming_rtx) == REG)
6656 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6659 /* If the parameters of this function need cleaning up, get a label
6660 for the beginning of the code which executes those cleanups. This must
6661 be done before doing anything with return_label. */
6662 if (parms_have_cleanups)
6663 cleanup_label = gen_label_rtx ();
6667 /* Make the label for return statements to jump to. Do not special
6668 case machines with special return instructions -- they will be
6669 handled later during jump, ifcvt, or epilogue creation. */
6670 return_label = gen_label_rtx ();
6672 /* Initialize rtx used to return the value. */
6673 /* Do this before assign_parms so that we copy the struct value address
6674 before any library calls that assign parms might generate. */
6676 /* Decide whether to return the value in memory or in a register. */
6677 if (aggregate_value_p (DECL_RESULT (subr), subr))
6679 /* Returning something that won't go in a register. */
6680 rtx value_address = 0;
6682 #ifdef PCC_STATIC_STRUCT_RETURN
6683 if (current_function_returns_pcc_struct)
6685 int size = int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr)));
6686 value_address = assemble_static_space (size);
6691 rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 1);
6692 /* Expect to be passed the address of a place to store the value.
6693 If it is passed as an argument, assign_parms will take care of
6697 value_address = gen_reg_rtx (Pmode);
6698 emit_move_insn (value_address, sv);
6703 rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
6704 set_mem_attributes (x, DECL_RESULT (subr), 1);
6705 SET_DECL_RTL (DECL_RESULT (subr), x);
6708 else if (DECL_MODE (DECL_RESULT (subr)) == VOIDmode)
6709 /* If return mode is void, this decl rtl should not be used. */
6710 SET_DECL_RTL (DECL_RESULT (subr), NULL_RTX);
6713 /* Compute the return values into a pseudo reg, which we will copy
6714 into the true return register after the cleanups are done. */
6716 /* In order to figure out what mode to use for the pseudo, we
6717 figure out what the mode of the eventual return register will
6718 actually be, and use that. */
6720 = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
6723 /* Structures that are returned in registers are not aggregate_value_p,
6724 so we may see a PARALLEL or a REG. */
6725 if (REG_P (hard_reg))
6726 SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
6727 else if (GET_CODE (hard_reg) == PARALLEL)
6728 SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
6732 /* Set DECL_REGISTER flag so that expand_function_end will copy the
6733 result to the real return register(s). */
6734 DECL_REGISTER (DECL_RESULT (subr)) = 1;
6737 /* Initialize rtx for parameters and local variables.
6738 In some cases this requires emitting insns. */
6740 assign_parms (subr);
6742 /* Copy the static chain now if it wasn't a register. The delay is to
6743 avoid conflicts with the parameter passing registers. */
6745 if (SMALL_REGISTER_CLASSES && current_function_needs_context)
6746 if (GET_CODE (static_chain_incoming_rtx) != REG)
6747 emit_move_insn (last_ptr, static_chain_incoming_rtx);
6749 /* The following was moved from init_function_start.
6750 The move is supposed to make sdb output more accurate. */
6751 /* Indicate the beginning of the function body,
6752 as opposed to parm setup. */
6753 emit_note (NOTE_INSN_FUNCTION_BEG);
6755 if (GET_CODE (get_last_insn ()) != NOTE)
6756 emit_note (NOTE_INSN_DELETED);
6757 parm_birth_insn = get_last_insn ();
6759 context_display = 0;
6760 if (current_function_needs_context)
6762 /* Fetch static chain values for containing functions. */
6763 tem = decl_function_context (current_function_decl);
6764 /* Copy the static chain pointer into a pseudo. If we have
6765 small register classes, copy the value from memory if
6766 static_chain_incoming_rtx is a REG. */
6769 /* If the static chain originally came in a register, put it back
6770 there, then move it out in the next insn. The reason for
6771 this peculiar code is to satisfy function integration. */
6772 if (SMALL_REGISTER_CLASSES
6773 && GET_CODE (static_chain_incoming_rtx) == REG)
6774 emit_move_insn (static_chain_incoming_rtx, last_ptr);
6775 last_ptr = copy_to_reg (static_chain_incoming_rtx);
6780 tree rtlexp = make_node (RTL_EXPR);
6782 RTL_EXPR_RTL (rtlexp) = last_ptr;
6783 context_display = tree_cons (tem, rtlexp, context_display);
6784 tem = decl_function_context (tem);
6787 /* Chain through stack frames, assuming pointer to next lexical frame
6788 is found at the place we always store it. */
6789 #ifdef FRAME_GROWS_DOWNWARD
6790 last_ptr = plus_constant (last_ptr,
6791 -(HOST_WIDE_INT) GET_MODE_SIZE (Pmode));
6793 last_ptr = gen_rtx_MEM (Pmode, memory_address (Pmode, last_ptr));
6794 set_mem_alias_set (last_ptr, get_frame_alias_set ());
6795 last_ptr = copy_to_reg (last_ptr);
6797 /* If we are not optimizing, ensure that we know that this
6798 piece of context is live over the entire function. */
6800 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, last_ptr,
6805 if (current_function_instrument_entry_exit)
6807 rtx fun = DECL_RTL (current_function_decl);
6808 if (GET_CODE (fun) == MEM)
6809 fun = XEXP (fun, 0);
6812 emit_library_call (profile_function_entry_libfunc, LCT_NORMAL, VOIDmode,
6814 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
6816 hard_frame_pointer_rtx),
6820 if (current_function_profile)
6823 PROFILE_HOOK (current_function_funcdef_no);
6827 /* After the display initializations is where the tail-recursion label
6828 should go, if we end up needing one. Ensure we have a NOTE here
6829 since some things (like trampolines) get placed before this. */
6830 tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
6832 /* Evaluate now the sizes of any types declared among the arguments. */
6833 expand_pending_sizes (nreverse (get_pending_sizes ()));
6835 /* Make sure there is a line number after the function entry setup code. */
6836 force_next_line_note ();
6839 /* Undo the effects of init_dummy_function_start. */
6841 expand_dummy_function_end (void)
6843 /* End any sequences that failed to be closed due to syntax errors. */
6844 while (in_sequence_p ())
6847 /* Outside function body, can't compute type's actual size
6848 until next function's body starts. */
6850 free_after_parsing (cfun);
6851 free_after_compilation (cfun);
6855 /* Call DOIT for each hard register used as a return value from
6856 the current function. */
6859 diddle_return_value (void (*doit) (rtx, void *), void *arg)
6861 rtx outgoing = current_function_return_rtx;
6866 if (GET_CODE (outgoing) == REG)
6867 (*doit) (outgoing, arg);
6868 else if (GET_CODE (outgoing) == PARALLEL)
6872 for (i = 0; i < XVECLEN (outgoing, 0); i++)
6874 rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
6876 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6883 do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6885 emit_insn (gen_rtx_CLOBBER (VOIDmode, reg));
6889 clobber_return_register (void)
6891 diddle_return_value (do_clobber_return_reg, NULL);
6893 /* In case we do use pseudo to return value, clobber it too. */
6894 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
6896 tree decl_result = DECL_RESULT (current_function_decl);
6897 rtx decl_rtl = DECL_RTL (decl_result);
6898 if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
6900 do_clobber_return_reg (decl_rtl, NULL);
6906 do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
6908 emit_insn (gen_rtx_USE (VOIDmode, reg));
6912 use_return_register (void)
6914 diddle_return_value (do_use_return_reg, NULL);
6917 static GTY(()) rtx initial_trampoline;
6919 /* Generate RTL for the end of the current function. */
6922 expand_function_end (void)
6927 finish_expr_for_function ();
6929 /* If arg_pointer_save_area was referenced only from a nested
6930 function, we will not have initialized it yet. Do that now. */
6931 if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
6932 get_arg_pointer_save_area (cfun);
6934 #ifdef NON_SAVING_SETJMP
6935 /* Don't put any variables in registers if we call setjmp
6936 on a machine that fails to restore the registers. */
6937 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
6939 if (DECL_INITIAL (current_function_decl) != error_mark_node)
6940 setjmp_protect (DECL_INITIAL (current_function_decl));
6942 setjmp_protect_args ();
6946 /* Initialize any trampolines required by this function. */
6947 for (link = trampoline_list; link; link = TREE_CHAIN (link))
6949 tree function = TREE_PURPOSE (link);
6950 rtx context ATTRIBUTE_UNUSED = lookup_static_chain (function);
6951 rtx tramp = RTL_EXPR_RTL (TREE_VALUE (link));
6952 #ifdef TRAMPOLINE_TEMPLATE
6957 #ifdef TRAMPOLINE_TEMPLATE
6958 /* First make sure this compilation has a template for
6959 initializing trampolines. */
6960 if (initial_trampoline == 0)
6963 = gen_rtx_MEM (BLKmode, assemble_trampoline_template ());
6964 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
6968 /* Generate insns to initialize the trampoline. */
6970 tramp = round_trampoline_addr (XEXP (tramp, 0));
6971 #ifdef TRAMPOLINE_TEMPLATE
6972 blktramp = replace_equiv_address (initial_trampoline, tramp);
6973 emit_block_move (blktramp, initial_trampoline,
6974 GEN_INT (TRAMPOLINE_SIZE), BLOCK_OP_NORMAL);
6976 trampolines_created = 1;
6977 INITIALIZE_TRAMPOLINE (tramp, XEXP (DECL_RTL (function), 0), context);
6981 /* Put those insns at entry to the containing function (this one). */
6982 emit_insn_before (seq, tail_recursion_reentry);
6985 /* If we are doing stack checking and this function makes calls,
6986 do a stack probe at the start of the function to ensure we have enough
6987 space for another stack frame. */
6988 if (flag_stack_check && ! STACK_CHECK_BUILTIN)
6992 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
6993 if (GET_CODE (insn) == CALL_INSN)
6996 probe_stack_range (STACK_CHECK_PROTECT,
6997 GEN_INT (STACK_CHECK_MAX_FRAME_SIZE));
7000 emit_insn_before (seq, tail_recursion_reentry);
7005 /* Possibly warn about unused parameters. */
7006 if (warn_unused_parameter)
7010 for (decl = DECL_ARGUMENTS (current_function_decl);
7011 decl; decl = TREE_CHAIN (decl))
7012 if (! TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
7013 && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
7014 warning ("%Junused parameter '%D'", decl, decl);
7017 /* Delete handlers for nonlocal gotos if nothing uses them. */
7018 if (nonlocal_goto_handler_slots != 0
7019 && ! current_function_has_nonlocal_label)
7022 /* End any sequences that failed to be closed due to syntax errors. */
7023 while (in_sequence_p ())
7026 /* Outside function body, can't compute type's actual size
7027 until next function's body starts. */
7028 immediate_size_expand--;
7030 clear_pending_stack_adjust ();
7031 do_pending_stack_adjust ();
7033 /* @@@ This is a kludge. We want to ensure that instructions that
7034 may trap are not moved into the epilogue by scheduling, because
7035 we don't always emit unwind information for the epilogue.
7036 However, not all machine descriptions define a blockage insn, so
7037 emit an ASM_INPUT to act as one. */
7038 if (flag_non_call_exceptions)
7039 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, ""));
7041 /* Mark the end of the function body.
7042 If control reaches this insn, the function can drop through
7043 without returning a value. */
7044 emit_note (NOTE_INSN_FUNCTION_END);
7046 /* Must mark the last line number note in the function, so that the test
7047 coverage code can avoid counting the last line twice. This just tells
7048 the code to ignore the immediately following line note, since there
7049 already exists a copy of this note somewhere above. This line number
7050 note is still needed for debugging though, so we can't delete it. */
7051 if (flag_test_coverage)
7052 emit_note (NOTE_INSN_REPEATED_LINE_NUMBER);
7054 /* Output a linenumber for the end of the function.
7055 SDB depends on this. */
7056 force_next_line_note ();
7057 emit_line_note (input_location);
7059 /* Before the return label (if any), clobber the return
7060 registers so that they are not propagated live to the rest of
7061 the function. This can only happen with functions that drop
7062 through; if there had been a return statement, there would
7063 have either been a return rtx, or a jump to the return label.
7065 We delay actual code generation after the current_function_value_rtx
7067 clobber_after = get_last_insn ();
7069 /* Output the label for the actual return from the function,
7070 if one is expected. This happens either because a function epilogue
7071 is used instead of a return instruction, or because a return was done
7072 with a goto in order to run local cleanups, or because of pcc-style
7073 structure returning. */
7075 emit_label (return_label);
7077 if (current_function_instrument_entry_exit)
7079 rtx fun = DECL_RTL (current_function_decl);
7080 if (GET_CODE (fun) == MEM)
7081 fun = XEXP (fun, 0);
7084 emit_library_call (profile_function_exit_libfunc, LCT_NORMAL, VOIDmode,
7086 expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS,
7088 hard_frame_pointer_rtx),
7092 /* Let except.c know where it should emit the call to unregister
7093 the function context for sjlj exceptions. */
7094 if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
7095 sjlj_emit_function_exit_after (get_last_insn ());
7097 /* If we had calls to alloca, and this machine needs
7098 an accurate stack pointer to exit the function,
7099 insert some code to save and restore the stack pointer. */
7100 if (! EXIT_IGNORE_STACK
7101 && current_function_calls_alloca)
7105 emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
7106 emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
7109 /* If scalar return value was computed in a pseudo-reg, or was a named
7110 return value that got dumped to the stack, copy that to the hard
7112 if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
7114 tree decl_result = DECL_RESULT (current_function_decl);
7115 rtx decl_rtl = DECL_RTL (decl_result);
7117 if (REG_P (decl_rtl)
7118 ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
7119 : DECL_REGISTER (decl_result))
7121 rtx real_decl_rtl = current_function_return_rtx;
7123 /* This should be set in assign_parms. */
7124 if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
7127 /* If this is a BLKmode structure being returned in registers,
7128 then use the mode computed in expand_return. Note that if
7129 decl_rtl is memory, then its mode may have been changed,
7130 but that current_function_return_rtx has not. */
7131 if (GET_MODE (real_decl_rtl) == BLKmode)
7132 PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
7134 /* If a named return value dumped decl_return to memory, then
7135 we may need to re-do the PROMOTE_MODE signed/unsigned
7137 if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
7139 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
7141 if (targetm.calls.promote_function_return (TREE_TYPE (current_function_decl)))
7142 promote_mode (TREE_TYPE (decl_result), GET_MODE (decl_rtl),
7145 convert_move (real_decl_rtl, decl_rtl, unsignedp);
7147 else if (GET_CODE (real_decl_rtl) == PARALLEL)
7149 /* If expand_function_start has created a PARALLEL for decl_rtl,
7150 move the result to the real return registers. Otherwise, do
7151 a group load from decl_rtl for a named return. */
7152 if (GET_CODE (decl_rtl) == PARALLEL)
7153 emit_group_move (real_decl_rtl, decl_rtl);
7155 emit_group_load (real_decl_rtl, decl_rtl,
7156 TREE_TYPE (decl_result),
7157 int_size_in_bytes (TREE_TYPE (decl_result)));
7160 emit_move_insn (real_decl_rtl, decl_rtl);
7164 /* If returning a structure, arrange to return the address of the value
7165 in a place where debuggers expect to find it.
7167 If returning a structure PCC style,
7168 the caller also depends on this value.
7169 And current_function_returns_pcc_struct is not necessarily set. */
7170 if (current_function_returns_struct
7171 || current_function_returns_pcc_struct)
7174 = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
7175 tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
7176 #ifdef FUNCTION_OUTGOING_VALUE
7178 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
7179 current_function_decl);
7182 = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
7185 /* Mark this as a function return value so integrate will delete the
7186 assignment and USE below when inlining this function. */
7187 REG_FUNCTION_VALUE_P (outgoing) = 1;
7189 /* The address may be ptr_mode and OUTGOING may be Pmode. */
7190 value_address = convert_memory_address (GET_MODE (outgoing),
7193 emit_move_insn (outgoing, value_address);
7195 /* Show return register used to hold result (in this case the address
7197 current_function_return_rtx = outgoing;
7200 /* If this is an implementation of throw, do what's necessary to
7201 communicate between __builtin_eh_return and the epilogue. */
7202 expand_eh_return ();
7204 /* Emit the actual code to clobber return register. */
7209 clobber_return_register ();
7213 after = emit_insn_after (seq, clobber_after);
7215 if (clobber_after != after)
7216 cfun->x_clobber_return_insn = after;
7219 /* Output the label for the naked return from the function, if one is
7220 expected. This is currently used only by __builtin_return. */
7221 if (naked_return_label)
7222 emit_label (naked_return_label);
7224 /* ??? This should no longer be necessary since stupid is no longer with
7225 us, but there are some parts of the compiler (eg reload_combine, and
7226 sh mach_dep_reorg) that still try and compute their own lifetime info
7227 instead of using the general framework. */
7228 use_return_register ();
7230 /* Fix up any gotos that jumped out to the outermost
7231 binding level of the function.
7232 Must follow emitting RETURN_LABEL. */
7234 /* If you have any cleanups to do at this point,
7235 and they need to create temporary variables,
7236 then you will lose. */
7237 expand_fixups (get_insns ());
7241 get_arg_pointer_save_area (struct function *f)
7243 rtx ret = f->x_arg_pointer_save_area;
7247 ret = assign_stack_local_1 (Pmode, GET_MODE_SIZE (Pmode), 0, f);
7248 f->x_arg_pointer_save_area = ret;
7251 if (f == cfun && ! f->arg_pointer_save_area_init)
7255 /* Save the arg pointer at the beginning of the function. The
7256 generated stack slot may not be a valid memory address, so we
7257 have to check it and fix it if necessary. */
7259 emit_move_insn (validize_mem (ret), virtual_incoming_args_rtx);
7263 push_topmost_sequence ();
7264 emit_insn_after (seq, get_insns ());
7265 pop_topmost_sequence ();
7271 /* Extend a vector that records the INSN_UIDs of INSNS
7272 (a list of one or more insns). */
7275 record_insns (rtx insns, varray_type *vecp)
7282 while (tmp != NULL_RTX)
7285 tmp = NEXT_INSN (tmp);
7288 i = VARRAY_SIZE (*vecp);
7289 VARRAY_GROW (*vecp, i + len);
7291 while (tmp != NULL_RTX)
7293 VARRAY_INT (*vecp, i) = INSN_UID (tmp);
7295 tmp = NEXT_INSN (tmp);
7299 /* Set the locator of the insn chain starting at INSN to LOC. */
7301 set_insn_locators (rtx insn, int loc)
7303 while (insn != NULL_RTX)
7306 INSN_LOCATOR (insn) = loc;
7307 insn = NEXT_INSN (insn);
7311 /* Determine how many INSN_UIDs in VEC are part of INSN. Because we can
7312 be running after reorg, SEQUENCE rtl is possible. */
7315 contains (rtx insn, varray_type vec)
7319 if (GET_CODE (insn) == INSN
7320 && GET_CODE (PATTERN (insn)) == SEQUENCE)
7323 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
7324 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7325 if (INSN_UID (XVECEXP (PATTERN (insn), 0, i)) == VARRAY_INT (vec, j))
7331 for (j = VARRAY_SIZE (vec) - 1; j >= 0; --j)
7332 if (INSN_UID (insn) == VARRAY_INT (vec, j))
7339 prologue_epilogue_contains (rtx insn)
7341 if (contains (insn, prologue))
7343 if (contains (insn, epilogue))
7349 sibcall_epilogue_contains (rtx insn)
7351 if (sibcall_epilogue)
7352 return contains (insn, sibcall_epilogue);
7357 /* Insert gen_return at the end of block BB. This also means updating
7358 block_for_insn appropriately. */
7361 emit_return_into_block (basic_block bb, rtx line_note)
7363 emit_jump_insn_after (gen_return (), BB_END (bb));
7365 emit_note_copy_after (line_note, PREV_INSN (BB_END (bb)));
7367 #endif /* HAVE_return */
7369 #if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
7371 /* These functions convert the epilogue into a variant that does not modify the
7372 stack pointer. This is used in cases where a function returns an object
7373 whose size is not known until it is computed. The called function leaves the
7374 object on the stack, leaves the stack depressed, and returns a pointer to
7377 What we need to do is track all modifications and references to the stack
7378 pointer, deleting the modifications and changing the references to point to
7379 the location the stack pointer would have pointed to had the modifications
7382 These functions need to be portable so we need to make as few assumptions
7383 about the epilogue as we can. However, the epilogue basically contains
7384 three things: instructions to reset the stack pointer, instructions to
7385 reload registers, possibly including the frame pointer, and an
7386 instruction to return to the caller.
7388 If we can't be sure of what a relevant epilogue insn is doing, we abort.
7389 We also make no attempt to validate the insns we make since if they are
7390 invalid, we probably can't do anything valid. The intent is that these
7391 routines get "smarter" as more and more machines start to use them and
7392 they try operating on different epilogues.
7394 We use the following structure to track what the part of the epilogue that
7395 we've already processed has done. We keep two copies of the SP equivalence,
7396 one for use during the insn we are processing and one for use in the next
7397 insn. The difference is because one part of a PARALLEL may adjust SP
7398 and the other may use it. */
7402 rtx sp_equiv_reg; /* REG that SP is set from, perhaps SP. */
7403 HOST_WIDE_INT sp_offset; /* Offset from SP_EQUIV_REG of present SP. */
7404 rtx new_sp_equiv_reg; /* REG to be used at end of insn. */
7405 HOST_WIDE_INT new_sp_offset; /* Offset to be used at end of insn. */
7406 rtx equiv_reg_src; /* If nonzero, the value that SP_EQUIV_REG
7407 should be set to once we no longer need
7409 rtx const_equiv[FIRST_PSEUDO_REGISTER]; /* Any known constant equivalences
7413 static void handle_epilogue_set (rtx, struct epi_info *);
7414 static void update_epilogue_consts (rtx, rtx, void *);
7415 static void emit_equiv_load (struct epi_info *);
7417 /* Modify INSN, a list of one or more insns that is part of the epilogue, to
7418 no modifications to the stack pointer. Return the new list of insns. */
7421 keep_stack_depressed (rtx insns)
7424 struct epi_info info;
7427 /* If the epilogue is just a single instruction, it must be OK as is. */
7428 if (NEXT_INSN (insns) == NULL_RTX)
7431 /* Otherwise, start a sequence, initialize the information we have, and
7432 process all the insns we were given. */
7435 info.sp_equiv_reg = stack_pointer_rtx;
7437 info.equiv_reg_src = 0;
7439 for (j = 0; j < FIRST_PSEUDO_REGISTER; j++)
7440 info.const_equiv[j] = 0;
7444 while (insn != NULL_RTX)
7446 next = NEXT_INSN (insn);
7455 /* If this insn references the register that SP is equivalent to and
7456 we have a pending load to that register, we must force out the load
7457 first and then indicate we no longer know what SP's equivalent is. */
7458 if (info.equiv_reg_src != 0
7459 && reg_referenced_p (info.sp_equiv_reg, PATTERN (insn)))
7461 emit_equiv_load (&info);
7462 info.sp_equiv_reg = 0;
7465 info.new_sp_equiv_reg = info.sp_equiv_reg;
7466 info.new_sp_offset = info.sp_offset;
7468 /* If this is a (RETURN) and the return address is on the stack,
7469 update the address and change to an indirect jump. */
7470 if (GET_CODE (PATTERN (insn)) == RETURN
7471 || (GET_CODE (PATTERN (insn)) == PARALLEL
7472 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
7474 rtx retaddr = INCOMING_RETURN_ADDR_RTX;
7476 HOST_WIDE_INT offset = 0;
7477 rtx jump_insn, jump_set;
7479 /* If the return address is in a register, we can emit the insn
7480 unchanged. Otherwise, it must be a MEM and we see what the
7481 base register and offset are. In any case, we have to emit any
7482 pending load to the equivalent reg of SP, if any. */
7483 if (GET_CODE (retaddr) == REG)
7485 emit_equiv_load (&info);
7490 else if (GET_CODE (retaddr) == MEM
7491 && GET_CODE (XEXP (retaddr, 0)) == REG)
7492 base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
7493 else if (GET_CODE (retaddr) == MEM
7494 && GET_CODE (XEXP (retaddr, 0)) == PLUS
7495 && GET_CODE (XEXP (XEXP (retaddr, 0), 0)) == REG
7496 && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
7498 base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
7499 offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
7504 /* If the base of the location containing the return pointer
7505 is SP, we must update it with the replacement address. Otherwise,
7506 just build the necessary MEM. */
7507 retaddr = plus_constant (base, offset);
7508 if (base == stack_pointer_rtx)
7509 retaddr = simplify_replace_rtx (retaddr, stack_pointer_rtx,
7510 plus_constant (info.sp_equiv_reg,
7513 retaddr = gen_rtx_MEM (Pmode, retaddr);
7515 /* If there is a pending load to the equivalent register for SP
7516 and we reference that register, we must load our address into
7517 a scratch register and then do that load. */
7518 if (info.equiv_reg_src
7519 && reg_overlap_mentioned_p (info.equiv_reg_src, retaddr))
7524 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
7525 if (HARD_REGNO_MODE_OK (regno, Pmode)
7526 && !fixed_regs[regno]
7527 && TEST_HARD_REG_BIT (regs_invalidated_by_call, regno)
7528 && !REGNO_REG_SET_P (EXIT_BLOCK_PTR->global_live_at_start,
7530 && !refers_to_regno_p (regno,
7531 regno + hard_regno_nregs[regno]
7533 info.equiv_reg_src, NULL)
7534 && info.const_equiv[regno] == 0)
7537 if (regno == FIRST_PSEUDO_REGISTER)
7540 reg = gen_rtx_REG (Pmode, regno);
7541 emit_move_insn (reg, retaddr);
7545 emit_equiv_load (&info);
7546 jump_insn = emit_jump_insn (gen_indirect_jump (retaddr));
7548 /* Show the SET in the above insn is a RETURN. */
7549 jump_set = single_set (jump_insn);
7553 SET_IS_RETURN_P (jump_set) = 1;
7556 /* If SP is not mentioned in the pattern and its equivalent register, if
7557 any, is not modified, just emit it. Otherwise, if neither is set,
7558 replace the reference to SP and emit the insn. If none of those are
7559 true, handle each SET individually. */
7560 else if (!reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))
7561 && (info.sp_equiv_reg == stack_pointer_rtx
7562 || !reg_set_p (info.sp_equiv_reg, insn)))
7564 else if (! reg_set_p (stack_pointer_rtx, insn)
7565 && (info.sp_equiv_reg == stack_pointer_rtx
7566 || !reg_set_p (info.sp_equiv_reg, insn)))
7568 if (! validate_replace_rtx (stack_pointer_rtx,
7569 plus_constant (info.sp_equiv_reg,
7576 else if (GET_CODE (PATTERN (insn)) == SET)
7577 handle_epilogue_set (PATTERN (insn), &info);
7578 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
7580 for (j = 0; j < XVECLEN (PATTERN (insn), 0); j++)
7581 if (GET_CODE (XVECEXP (PATTERN (insn), 0, j)) == SET)
7582 handle_epilogue_set (XVECEXP (PATTERN (insn), 0, j), &info);
7587 info.sp_equiv_reg = info.new_sp_equiv_reg;
7588 info.sp_offset = info.new_sp_offset;
7590 /* Now update any constants this insn sets. */
7591 note_stores (PATTERN (insn), update_epilogue_consts, &info);
7595 insns = get_insns ();
7600 /* SET is a SET from an insn in the epilogue. P is a pointer to the epi_info
7601 structure that contains information about what we've seen so far. We
7602 process this SET by either updating that data or by emitting one or
7606 handle_epilogue_set (rtx set, struct epi_info *p)
7608 /* First handle the case where we are setting SP. Record what it is being
7609 set from. If unknown, abort. */
7610 if (reg_set_p (stack_pointer_rtx, set))
7612 if (SET_DEST (set) != stack_pointer_rtx)
7615 if (GET_CODE (SET_SRC (set)) == PLUS)
7617 p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
7618 if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
7619 p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
7620 else if (GET_CODE (XEXP (SET_SRC (set), 1)) == REG
7621 && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
7622 && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
7624 = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
7629 p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
7631 /* If we are adjusting SP, we adjust from the old data. */
7632 if (p->new_sp_equiv_reg == stack_pointer_rtx)
7634 p->new_sp_equiv_reg = p->sp_equiv_reg;
7635 p->new_sp_offset += p->sp_offset;
7638 if (p->new_sp_equiv_reg == 0 || GET_CODE (p->new_sp_equiv_reg) != REG)
7644 /* Next handle the case where we are setting SP's equivalent register.
7645 If we already have a value to set it to, abort. We could update, but
7646 there seems little point in handling that case. Note that we have
7647 to allow for the case where we are setting the register set in
7648 the previous part of a PARALLEL inside a single insn. But use the
7649 old offset for any updates within this insn. We must allow for the case
7650 where the register is being set in a different (usually wider) mode than
7652 else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
7654 if (p->equiv_reg_src != 0
7655 || GET_CODE (p->new_sp_equiv_reg) != REG
7656 || GET_CODE (SET_DEST (set)) != REG
7657 || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
7658 || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
7662 = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7663 plus_constant (p->sp_equiv_reg,
7667 /* Otherwise, replace any references to SP in the insn to its new value
7668 and emit the insn. */
7671 SET_SRC (set) = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
7672 plus_constant (p->sp_equiv_reg,
7674 SET_DEST (set) = simplify_replace_rtx (SET_DEST (set), stack_pointer_rtx,
7675 plus_constant (p->sp_equiv_reg,
7681 /* Update the tracking information for registers set to constants. */
7684 update_epilogue_consts (rtx dest, rtx x, void *data)
7686 struct epi_info *p = (struct epi_info *) data;
7689 if (GET_CODE (dest) != REG || REGNO (dest) >= FIRST_PSEUDO_REGISTER)
7692 /* If we are either clobbering a register or doing a partial set,
7693 show we don't know the value. */
7694 else if (GET_CODE (x) == CLOBBER || ! rtx_equal_p (dest, SET_DEST (x)))
7695 p->const_equiv[REGNO (dest)] = 0;
7697 /* If we are setting it to a constant, record that constant. */
7698 else if (GET_CODE (SET_SRC (x)) == CONST_INT)
7699 p->const_equiv[REGNO (dest)] = SET_SRC (x);
7701 /* If this is a binary operation between a register we have been tracking
7702 and a constant, see if we can compute a new constant value. */
7703 else if (ARITHMETIC_P (SET_SRC (x))
7704 && GET_CODE (XEXP (SET_SRC (x), 0)) == REG
7705 && REGNO (XEXP (SET_SRC (x), 0)) < FIRST_PSEUDO_REGISTER
7706 && p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))] != 0
7707 && GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
7708 && 0 != (new = simplify_binary_operation
7709 (GET_CODE (SET_SRC (x)), GET_MODE (dest),
7710 p->const_equiv[REGNO (XEXP (SET_SRC (x), 0))],
7711 XEXP (SET_SRC (x), 1)))
7712 && GET_CODE (new) == CONST_INT)
7713 p->const_equiv[REGNO (dest)] = new;
7715 /* Otherwise, we can't do anything with this value. */
7717 p->const_equiv[REGNO (dest)] = 0;
7720 /* Emit an insn to do the load shown in p->equiv_reg_src, if needed. */
7723 emit_equiv_load (struct epi_info *p)
7725 if (p->equiv_reg_src != 0)
7727 rtx dest = p->sp_equiv_reg;
7729 if (GET_MODE (p->equiv_reg_src) != GET_MODE (dest))
7730 dest = gen_rtx_REG (GET_MODE (p->equiv_reg_src),
7731 REGNO (p->sp_equiv_reg));
7733 emit_move_insn (dest, p->equiv_reg_src);
7734 p->equiv_reg_src = 0;
7739 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
7740 this into place with notes indicating where the prologue ends and where
7741 the epilogue begins. Update the basic block information when possible. */
7744 thread_prologue_and_epilogue_insns (rtx f ATTRIBUTE_UNUSED)
7748 #if defined (HAVE_sibcall_epilogue) || defined (HAVE_epilogue) || defined (HAVE_return) || defined (HAVE_prologue)
7751 #ifdef HAVE_prologue
7752 rtx prologue_end = NULL_RTX;
7754 #if defined (HAVE_epilogue) || defined(HAVE_return)
7755 rtx epilogue_end = NULL_RTX;
7758 #ifdef HAVE_prologue
7762 seq = gen_prologue ();
7765 /* Retain a map of the prologue insns. */
7766 record_insns (seq, &prologue);
7767 prologue_end = emit_note (NOTE_INSN_PROLOGUE_END);
7771 set_insn_locators (seq, prologue_locator);
7773 /* Can't deal with multiple successors of the entry block
7774 at the moment. Function should always have at least one
7776 if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
7779 insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
7784 /* If the exit block has no non-fake predecessors, we don't need
7786 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7787 if ((e->flags & EDGE_FAKE) == 0)
7793 if (optimize && HAVE_return)
7795 /* If we're allowed to generate a simple return instruction,
7796 then by definition we don't need a full epilogue. Examine
7797 the block that falls through to EXIT. If it does not
7798 contain any code, examine its predecessors and try to
7799 emit (conditional) return instructions. */
7805 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7806 if (e->flags & EDGE_FALLTHRU)
7812 /* Verify that there are no active instructions in the last block. */
7813 label = BB_END (last);
7814 while (label && GET_CODE (label) != CODE_LABEL)
7816 if (active_insn_p (label))
7818 label = PREV_INSN (label);
7821 if (BB_HEAD (last) == label && GET_CODE (label) == CODE_LABEL)
7823 rtx epilogue_line_note = NULL_RTX;
7825 /* Locate the line number associated with the closing brace,
7826 if we can find one. */
7827 for (seq = get_last_insn ();
7828 seq && ! active_insn_p (seq);
7829 seq = PREV_INSN (seq))
7830 if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
7832 epilogue_line_note = seq;
7836 for (e = last->pred; e; e = e_next)
7838 basic_block bb = e->src;
7841 e_next = e->pred_next;
7842 if (bb == ENTRY_BLOCK_PTR)
7846 if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
7849 /* If we have an unconditional jump, we can replace that
7850 with a simple return instruction. */
7851 if (simplejump_p (jump))
7853 emit_return_into_block (bb, epilogue_line_note);
7857 /* If we have a conditional jump, we can try to replace
7858 that with a conditional return instruction. */
7859 else if (condjump_p (jump))
7861 if (! redirect_jump (jump, 0, 0))
7864 /* If this block has only one successor, it both jumps
7865 and falls through to the fallthru block, so we can't
7867 if (bb->succ->succ_next == NULL)
7873 /* Fix up the CFG for the successful change we just made. */
7874 redirect_edge_succ (e, EXIT_BLOCK_PTR);
7877 /* Emit a return insn for the exit fallthru block. Whether
7878 this is still reachable will be determined later. */
7880 emit_barrier_after (BB_END (last));
7881 emit_return_into_block (last, epilogue_line_note);
7882 epilogue_end = BB_END (last);
7883 last->succ->flags &= ~EDGE_FALLTHRU;
7888 #ifdef HAVE_epilogue
7891 /* Find the edge that falls through to EXIT. Other edges may exist
7892 due to RETURN instructions, but those don't need epilogues.
7893 There really shouldn't be a mixture -- either all should have
7894 been converted or none, however... */
7896 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7897 if (e->flags & EDGE_FALLTHRU)
7903 epilogue_end = emit_note (NOTE_INSN_EPILOGUE_BEG);
7905 seq = gen_epilogue ();
7907 #ifdef INCOMING_RETURN_ADDR_RTX
7908 /* If this function returns with the stack depressed and we can support
7909 it, massage the epilogue to actually do that. */
7910 if (TREE_CODE (TREE_TYPE (current_function_decl)) == FUNCTION_TYPE
7911 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (current_function_decl)))
7912 seq = keep_stack_depressed (seq);
7915 emit_jump_insn (seq);
7917 /* Retain a map of the epilogue insns. */
7918 record_insns (seq, &epilogue);
7919 set_insn_locators (seq, epilogue_locator);
7924 insert_insn_on_edge (seq, e);
7931 commit_edge_insertions ();
7933 #ifdef HAVE_sibcall_epilogue
7934 /* Emit sibling epilogues before any sibling call sites. */
7935 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
7937 basic_block bb = e->src;
7938 rtx insn = BB_END (bb);
7942 if (GET_CODE (insn) != CALL_INSN
7943 || ! SIBLING_CALL_P (insn))
7947 emit_insn (gen_sibcall_epilogue ());
7951 /* Retain a map of the epilogue insns. Used in life analysis to
7952 avoid getting rid of sibcall epilogue insns. Do this before we
7953 actually emit the sequence. */
7954 record_insns (seq, &sibcall_epilogue);
7955 set_insn_locators (seq, epilogue_locator);
7957 i = PREV_INSN (insn);
7958 newinsn = emit_insn_before (seq, insn);
7962 #ifdef HAVE_prologue
7963 /* This is probably all useless now that we use locators. */
7968 /* GDB handles `break f' by setting a breakpoint on the first
7969 line note after the prologue. Which means (1) that if
7970 there are line number notes before where we inserted the
7971 prologue we should move them, and (2) we should generate a
7972 note before the end of the first basic block, if there isn't
7975 ??? This behavior is completely broken when dealing with
7976 multiple entry functions. We simply place the note always
7977 into first basic block and let alternate entry points
7981 for (insn = prologue_end; insn; insn = prev)
7983 prev = PREV_INSN (insn);
7984 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
7986 /* Note that we cannot reorder the first insn in the
7987 chain, since rest_of_compilation relies on that
7988 remaining constant. */
7991 reorder_insns (insn, insn, prologue_end);
7995 /* Find the last line number note in the first block. */
7996 for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
7997 insn != prologue_end && insn;
7998 insn = PREV_INSN (insn))
7999 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
8002 /* If we didn't find one, make a copy of the first line number
8006 for (insn = next_active_insn (prologue_end);
8008 insn = PREV_INSN (insn))
8009 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
8011 emit_note_copy_after (insn, prologue_end);
8017 #ifdef HAVE_epilogue
8022 /* Similarly, move any line notes that appear after the epilogue.
8023 There is no need, however, to be quite so anal about the existence
8024 of such a note. Also move the NOTE_INSN_FUNCTION_END and (possibly)
8025 NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
8027 for (insn = epilogue_end; insn; insn = next)
8029 next = NEXT_INSN (insn);
8030 if (GET_CODE (insn) == NOTE
8031 && (NOTE_LINE_NUMBER (insn) > 0
8032 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
8033 || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
8034 reorder_insns (insn, insn, PREV_INSN (epilogue_end));
8040 /* Reposition the prologue-end and epilogue-begin notes after instruction
8041 scheduling and delayed branch scheduling. */
8044 reposition_prologue_and_epilogue_notes (rtx f ATTRIBUTE_UNUSED)
8046 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
8047 rtx insn, last, note;
8050 if ((len = VARRAY_SIZE (prologue)) > 0)
8054 /* Scan from the beginning until we reach the last prologue insn.
8055 We apparently can't depend on basic_block_{head,end} after
8057 for (insn = f; insn; insn = NEXT_INSN (insn))
8059 if (GET_CODE (insn) == NOTE)
8061 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
8064 else if (contains (insn, prologue))
8074 /* Find the prologue-end note if we haven't already, and
8075 move it to just after the last prologue insn. */
8078 for (note = last; (note = NEXT_INSN (note));)
8079 if (GET_CODE (note) == NOTE
8080 && NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
8084 /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
8085 if (GET_CODE (last) == CODE_LABEL)
8086 last = NEXT_INSN (last);
8087 reorder_insns (note, note, last);
8091 if ((len = VARRAY_SIZE (epilogue)) > 0)
8095 /* Scan from the end until we reach the first epilogue insn.
8096 We apparently can't depend on basic_block_{head,end} after
8098 for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
8100 if (GET_CODE (insn) == NOTE)
8102 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
8105 else if (contains (insn, epilogue))
8115 /* Find the epilogue-begin note if we haven't already, and
8116 move it to just before the first epilogue insn. */
8119 for (note = insn; (note = PREV_INSN (note));)
8120 if (GET_CODE (note) == NOTE
8121 && NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
8125 if (PREV_INSN (last) != note)
8126 reorder_insns (note, note, PREV_INSN (last));
8129 #endif /* HAVE_prologue or HAVE_epilogue */
8132 /* Called once, at initialization, to initialize function.c. */
8135 init_function_once (void)
8137 VARRAY_INT_INIT (prologue, 0, "prologue");
8138 VARRAY_INT_INIT (epilogue, 0, "epilogue");
8139 VARRAY_INT_INIT (sibcall_epilogue, 0, "sibcall_epilogue");
8142 /* Returns the name of the current function. */
8144 current_function_name (void)
8146 return lang_hooks.decl_printable_name (cfun->decl, 2);
8149 #include "gt-function.h"