1 /* Expands front end tree to back end RTL for GNU C-Compiler
2 Copyright (C) 1987, 88, 89, 91-96, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles the generation of rtl code from tree structure
23 at the level of the function as a whole.
24 It creates the rtl expressions for parameters and auto variables
25 and has full responsibility for allocating stack slots.
27 `expand_function_start' is called at the beginning of a function,
28 before the function body is parsed, and `expand_function_end' is
29 called after parsing the body.
31 Call `assign_stack_local' to allocate a stack slot for a local variable.
32 This is usually done during the RTL generation for the function body,
33 but it can also be done in the reload pass when a pseudo-register does
34 not get a hard register.
36 Call `put_var_into_stack' when you learn, belatedly, that a variable
37 previously given a pseudo-register must in fact go in the stack.
38 This function changes the DECL_RTL to be a stack slot instead of a reg
39 then scans all the RTL instructions so far generated to correct them. */
48 #include "insn-flags.h"
50 #include "insn-codes.h"
52 #include "hard-reg-set.h"
53 #include "insn-config.h"
56 #include "basic-block.h"
61 /* Some systems use __main in a way incompatible with its use in gcc, in these
62 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
63 give the same symbol without quotes for an alternative entry point. You
64 must define both, or neither. */
66 #define NAME__MAIN "__main"
67 #define SYMBOL__MAIN __main
70 /* Round a value to the lowest integer less than it that is a multiple of
71 the required alignment. Avoid using division in case the value is
72 negative. Assume the alignment is a power of two. */
73 #define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
75 /* Similar, but round to the next highest integer that meets the
77 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
79 /* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
80 during rtl generation. If they are different register numbers, this is
81 always true. It may also be true if
82 FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
83 generation. See fix_lexical_addr for details. */
85 #if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
86 #define NEED_SEPARATE_AP
89 /* Number of bytes of args popped by function being compiled on its return.
90 Zero if no bytes are to be popped.
91 May affect compilation of return insn or of function epilogue. */
93 int current_function_pops_args
;
95 /* Nonzero if function being compiled needs to be given an address
96 where the value should be stored. */
98 int current_function_returns_struct
;
100 /* Nonzero if function being compiled needs to
101 return the address of where it has put a structure value. */
103 int current_function_returns_pcc_struct
;
105 /* Nonzero if function being compiled needs to be passed a static chain. */
107 int current_function_needs_context
;
109 /* Nonzero if function being compiled can call setjmp. */
111 int current_function_calls_setjmp
;
113 /* Nonzero if function being compiled can call longjmp. */
115 int current_function_calls_longjmp
;
117 /* Nonzero if function being compiled receives nonlocal gotos
118 from nested functions. */
120 int current_function_has_nonlocal_label
;
122 /* Nonzero if function being compiled has nonlocal gotos to parent
125 int current_function_has_nonlocal_goto
;
127 /* Nonzero if function being compiled contains nested functions. */
129 int current_function_contains_functions
;
131 /* Nonzero if function being compiled can call alloca,
132 either as a subroutine or builtin. */
134 int current_function_calls_alloca
;
136 /* Nonzero if the current function returns a pointer type */
138 int current_function_returns_pointer
;
140 /* If some insns can be deferred to the delay slots of the epilogue, the
141 delay list for them is recorded here. */
143 rtx current_function_epilogue_delay_list
;
145 /* If function's args have a fixed size, this is that size, in bytes.
147 May affect compilation of return insn or of function epilogue. */
149 int current_function_args_size
;
151 /* # bytes the prologue should push and pretend that the caller pushed them.
152 The prologue must do this, but only if parms can be passed in registers. */
154 int current_function_pretend_args_size
;
156 /* # of bytes of outgoing arguments. If ACCUMULATE_OUTGOING_ARGS is
157 defined, the needed space is pushed by the prologue. */
159 int current_function_outgoing_args_size
;
161 /* This is the offset from the arg pointer to the place where the first
162 anonymous arg can be found, if there is one. */
164 rtx current_function_arg_offset_rtx
;
166 /* Nonzero if current function uses varargs.h or equivalent.
167 Zero for functions that use stdarg.h. */
169 int current_function_varargs
;
171 /* Nonzero if current function uses stdarg.h or equivalent.
172 Zero for functions that use varargs.h. */
174 int current_function_stdarg
;
176 /* Quantities of various kinds of registers
177 used for the current function's args. */
179 CUMULATIVE_ARGS current_function_args_info
;
181 /* Name of function now being compiled. */
183 char *current_function_name
;
185 /* If non-zero, an RTL expression for that location at which the current
186 function returns its result. Always equal to
187 DECL_RTL (DECL_RESULT (current_function_decl)), but provided
188 independently of the tree structures. */
190 rtx current_function_return_rtx
;
192 /* Nonzero if the current function uses the constant pool. */
194 int current_function_uses_const_pool
;
196 /* Nonzero if the current function uses pic_offset_table_rtx. */
197 int current_function_uses_pic_offset_table
;
199 /* The arg pointer hard register, or the pseudo into which it was copied. */
200 rtx current_function_internal_arg_pointer
;
202 /* The FUNCTION_DECL for an inline function currently being expanded. */
203 tree inline_function_decl
;
205 /* Number of function calls seen so far in current function. */
207 int function_call_count
;
209 /* List (chain of TREE_LIST) of LABEL_DECLs for all nonlocal labels
210 (labels to which there can be nonlocal gotos from nested functions)
213 tree nonlocal_labels
;
215 /* RTX for stack slot that holds the current handler for nonlocal gotos.
216 Zero when function does not have nonlocal labels. */
218 rtx nonlocal_goto_handler_slot
;
220 /* RTX for stack slot that holds the stack pointer value to restore
222 Zero when function does not have nonlocal labels. */
224 rtx nonlocal_goto_stack_level
;
226 /* Label that will go on parm cleanup code, if any.
227 Jumping to this label runs cleanup code for parameters, if
228 such code must be run. Following this code is the logical return label. */
232 /* Label that will go on function epilogue.
233 Jumping to this label serves as a "return" instruction
234 on machines which require execution of the epilogue on all returns. */
238 /* List (chain of EXPR_LISTs) of pseudo-regs of SAVE_EXPRs.
239 So we can mark them all live at the end of the function, if nonopt. */
242 /* List (chain of EXPR_LISTs) of all stack slots in this function.
243 Made for the sake of unshare_all_rtl. */
246 /* Chain of all RTL_EXPRs that have insns in them. */
249 /* Label to jump back to for tail recursion, or 0 if we have
250 not yet needed one for this function. */
251 rtx tail_recursion_label
;
253 /* Place after which to insert the tail_recursion_label if we need one. */
254 rtx tail_recursion_reentry
;
256 /* Location at which to save the argument pointer if it will need to be
257 referenced. There are two cases where this is done: if nonlocal gotos
258 exist, or if vars stored at an offset from the argument pointer will be
259 needed by inner routines. */
261 rtx arg_pointer_save_area
;
263 /* Offset to end of allocated area of stack frame.
264 If stack grows down, this is the address of the last stack slot allocated.
265 If stack grows up, this is the address for the next slot. */
266 HOST_WIDE_INT frame_offset
;
268 /* List (chain of TREE_LISTs) of static chains for containing functions.
269 Each link has a FUNCTION_DECL in the TREE_PURPOSE and a reg rtx
270 in an RTL_EXPR in the TREE_VALUE. */
271 static tree context_display
;
273 /* List (chain of TREE_LISTs) of trampolines for nested functions.
274 The trampoline sets up the static chain and jumps to the function.
275 We supply the trampoline's address when the function's address is requested.
277 Each link has a FUNCTION_DECL in the TREE_PURPOSE and a reg rtx
278 in an RTL_EXPR in the TREE_VALUE. */
279 static tree trampoline_list
;
281 /* Insn after which register parms and SAVE_EXPRs are born, if nonopt. */
282 static rtx parm_birth_insn
;
285 /* Nonzero if a stack slot has been generated whose address is not
286 actually valid. It means that the generated rtl must all be scanned
287 to detect and correct the invalid addresses where they occur. */
288 static int invalid_stack_slot
;
291 /* Last insn of those whose job was to put parms into their nominal homes. */
292 static rtx last_parm_insn
;
294 /* 1 + last pseudo register number used for loading a copy
295 of a parameter of this function. */
296 static int max_parm_reg
;
298 /* Vector indexed by REGNO, containing location on stack in which
299 to put the parm which is nominally in pseudo register REGNO,
300 if we discover that that parm must go in the stack. */
301 static rtx
*parm_reg_stack_loc
;
303 /* Nonzero once virtual register instantiation has been done.
304 assign_stack_local uses frame_pointer_rtx when this is nonzero. */
305 static int virtuals_instantiated
;
307 /* These variables hold pointers to functions to
308 save and restore machine-specific data,
309 in push_function_context and pop_function_context. */
310 void (*save_machine_status
) PROTO((struct function
*));
311 void (*restore_machine_status
) PROTO((struct function
*));
313 /* Nonzero if we need to distinguish between the return value of this function
314 and the return value of a function called by this function. This helps
317 extern int rtx_equal_function_value_matters
;
318 extern tree sequence_rtl_expr
;
320 /* In order to evaluate some expressions, such as function calls returning
321 structures in memory, we need to temporarily allocate stack locations.
322 We record each allocated temporary in the following structure.
324 Associated with each temporary slot is a nesting level. When we pop up
325 one level, all temporaries associated with the previous level are freed.
326 Normally, all temporaries are freed after the execution of the statement
327 in which they were created. However, if we are inside a ({...}) grouping,
328 the result may be in a temporary and hence must be preserved. If the
329 result could be in a temporary, we preserve it if we can determine which
330 one it is in. If we cannot determine which temporary may contain the
331 result, all temporaries are preserved. A temporary is preserved by
332 pretending it was allocated at the previous nesting level.
334 Automatic variables are also assigned temporary slots, at the nesting
335 level where they are defined. They are marked a "kept" so that
336 free_temp_slots will not free them. */
340 /* Points to next temporary slot. */
341 struct temp_slot
*next
;
342 /* The rtx to used to reference the slot. */
344 /* The rtx used to represent the address if not the address of the
345 slot above. May be an EXPR_LIST if multiple addresses exist. */
347 /* The size, in units, of the slot. */
349 /* The value of `sequence_rtl_expr' when this temporary is allocated. */
351 /* Non-zero if this temporary is currently in use. */
353 /* Non-zero if this temporary has its address taken. */
355 /* Nesting level at which this slot is being used. */
357 /* Non-zero if this should survive a call to free_temp_slots. */
359 /* The offset of the slot from the frame_pointer, including extra space
360 for alignment. This info is for combine_temp_slots. */
362 /* The size of the slot, including extra space for alignment. This
363 info is for combine_temp_slots. */
367 /* List of all temporaries allocated, both available and in use. */
369 struct temp_slot
*temp_slots
;
371 /* Current nesting level for temporaries. */
375 /* The FUNCTION_DECL node for the current function. */
376 static tree this_function_decl
;
378 /* Callinfo pointer for the current function. */
379 static rtx this_function_callinfo
;
381 /* The label in the bytecode file of this function's actual bytecode.
383 static char *this_function_bytecode
;
385 /* The call description vector for the current function. */
386 static rtx this_function_calldesc
;
388 /* Size of the local variables allocated for the current function. */
391 /* Current depth of the bytecode evaluation stack. */
394 /* Maximum depth of the evaluation stack in this function. */
397 /* Current depth in statement expressions. */
398 static int stmt_expr_depth
;
400 /* This structure is used to record MEMs or pseudos used to replace VAR, any
401 SUBREGs of VAR, and any MEMs containing VAR as an address. We need to
402 maintain this list in case two operands of an insn were required to match;
403 in that case we must ensure we use the same replacement. */
405 struct fixup_replacement
409 struct fixup_replacement
*next
;
412 /* Forward declarations. */
414 static struct temp_slot
*find_temp_slot_from_address
PROTO((rtx
));
415 static void put_reg_into_stack
PROTO((struct function
*, rtx
, tree
,
416 enum machine_mode
, enum machine_mode
,
418 static void fixup_var_refs
PROTO((rtx
, enum machine_mode
, int));
419 static struct fixup_replacement
420 *find_fixup_replacement
PROTO((struct fixup_replacement
**, rtx
));
421 static void fixup_var_refs_insns
PROTO((rtx
, enum machine_mode
, int,
423 static void fixup_var_refs_1
PROTO((rtx
, enum machine_mode
, rtx
*, rtx
,
424 struct fixup_replacement
**));
425 static rtx fixup_memory_subreg
PROTO((rtx
, rtx
, int));
426 static rtx walk_fixup_memory_subreg
PROTO((rtx
, rtx
, int));
427 static rtx fixup_stack_1
PROTO((rtx
, rtx
));
428 static void optimize_bit_field
PROTO((rtx
, rtx
, rtx
*));
429 static void instantiate_decls
PROTO((tree
, int));
430 static void instantiate_decls_1
PROTO((tree
, int));
431 static void instantiate_decl
PROTO((rtx
, int, int));
432 static int instantiate_virtual_regs_1
PROTO((rtx
*, rtx
, int));
433 static void delete_handlers
PROTO((void));
434 static void pad_to_arg_alignment
PROTO((struct args_size
*, int));
435 static void pad_below
PROTO((struct args_size
*, enum machine_mode
,
437 static tree round_down
PROTO((tree
, int));
438 static rtx round_trampoline_addr
PROTO((rtx
));
439 static tree blocks_nreverse
PROTO((tree
));
440 static int all_blocks
PROTO((tree
, tree
*));
441 static int *record_insns
PROTO((rtx
));
442 static int contains
PROTO((rtx
, int *));
444 /* Pointer to chain of `struct function' for containing functions. */
445 struct function
*outer_function_chain
;
447 /* Given a function decl for a containing function,
448 return the `struct function' for it. */
451 find_function_data (decl
)
455 for (p
= outer_function_chain
; p
; p
= p
->next
)
461 /* Save the current context for compilation of a nested function.
462 This is called from language-specific code.
463 The caller is responsible for saving any language-specific status,
464 since this function knows only about language-independent variables. */
467 push_function_context_to (context
)
470 struct function
*p
= (struct function
*) xmalloc (sizeof (struct function
));
472 p
->next
= outer_function_chain
;
473 outer_function_chain
= p
;
475 p
->name
= current_function_name
;
476 p
->decl
= current_function_decl
;
477 p
->pops_args
= current_function_pops_args
;
478 p
->returns_struct
= current_function_returns_struct
;
479 p
->returns_pcc_struct
= current_function_returns_pcc_struct
;
480 p
->returns_pointer
= current_function_returns_pointer
;
481 p
->needs_context
= current_function_needs_context
;
482 p
->calls_setjmp
= current_function_calls_setjmp
;
483 p
->calls_longjmp
= current_function_calls_longjmp
;
484 p
->calls_alloca
= current_function_calls_alloca
;
485 p
->has_nonlocal_label
= current_function_has_nonlocal_label
;
486 p
->has_nonlocal_goto
= current_function_has_nonlocal_goto
;
487 p
->contains_functions
= current_function_contains_functions
;
488 p
->args_size
= current_function_args_size
;
489 p
->pretend_args_size
= current_function_pretend_args_size
;
490 p
->arg_offset_rtx
= current_function_arg_offset_rtx
;
491 p
->varargs
= current_function_varargs
;
492 p
->stdarg
= current_function_stdarg
;
493 p
->uses_const_pool
= current_function_uses_const_pool
;
494 p
->uses_pic_offset_table
= current_function_uses_pic_offset_table
;
495 p
->internal_arg_pointer
= current_function_internal_arg_pointer
;
496 p
->max_parm_reg
= max_parm_reg
;
497 p
->parm_reg_stack_loc
= parm_reg_stack_loc
;
498 p
->outgoing_args_size
= current_function_outgoing_args_size
;
499 p
->return_rtx
= current_function_return_rtx
;
500 p
->nonlocal_goto_handler_slot
= nonlocal_goto_handler_slot
;
501 p
->nonlocal_goto_stack_level
= nonlocal_goto_stack_level
;
502 p
->nonlocal_labels
= nonlocal_labels
;
503 p
->cleanup_label
= cleanup_label
;
504 p
->return_label
= return_label
;
505 p
->save_expr_regs
= save_expr_regs
;
506 p
->stack_slot_list
= stack_slot_list
;
507 p
->parm_birth_insn
= parm_birth_insn
;
508 p
->frame_offset
= frame_offset
;
509 p
->tail_recursion_label
= tail_recursion_label
;
510 p
->tail_recursion_reentry
= tail_recursion_reentry
;
511 p
->arg_pointer_save_area
= arg_pointer_save_area
;
512 p
->rtl_expr_chain
= rtl_expr_chain
;
513 p
->last_parm_insn
= last_parm_insn
;
514 p
->context_display
= context_display
;
515 p
->trampoline_list
= trampoline_list
;
516 p
->function_call_count
= function_call_count
;
517 p
->temp_slots
= temp_slots
;
518 p
->temp_slot_level
= temp_slot_level
;
519 p
->fixup_var_refs_queue
= 0;
520 p
->epilogue_delay_list
= current_function_epilogue_delay_list
;
521 p
->args_info
= current_function_args_info
;
523 save_tree_status (p
, context
);
524 save_storage_status (p
);
525 save_emit_status (p
);
527 save_expr_status (p
);
528 save_stmt_status (p
);
529 save_varasm_status (p
);
531 if (save_machine_status
)
532 (*save_machine_status
) (p
);
536 push_function_context ()
538 push_function_context_to (current_function_decl
);
541 /* Restore the last saved context, at the end of a nested function.
542 This function is called from language-specific code. */
545 pop_function_context_from (context
)
548 struct function
*p
= outer_function_chain
;
550 outer_function_chain
= p
->next
;
552 current_function_contains_functions
553 = p
->contains_functions
|| p
->inline_obstacks
554 || context
== current_function_decl
;
555 current_function_name
= p
->name
;
556 current_function_decl
= p
->decl
;
557 current_function_pops_args
= p
->pops_args
;
558 current_function_returns_struct
= p
->returns_struct
;
559 current_function_returns_pcc_struct
= p
->returns_pcc_struct
;
560 current_function_returns_pointer
= p
->returns_pointer
;
561 current_function_needs_context
= p
->needs_context
;
562 current_function_calls_setjmp
= p
->calls_setjmp
;
563 current_function_calls_longjmp
= p
->calls_longjmp
;
564 current_function_calls_alloca
= p
->calls_alloca
;
565 current_function_has_nonlocal_label
= p
->has_nonlocal_label
;
566 current_function_has_nonlocal_goto
= p
->has_nonlocal_goto
;
567 current_function_args_size
= p
->args_size
;
568 current_function_pretend_args_size
= p
->pretend_args_size
;
569 current_function_arg_offset_rtx
= p
->arg_offset_rtx
;
570 current_function_varargs
= p
->varargs
;
571 current_function_stdarg
= p
->stdarg
;
572 current_function_uses_const_pool
= p
->uses_const_pool
;
573 current_function_uses_pic_offset_table
= p
->uses_pic_offset_table
;
574 current_function_internal_arg_pointer
= p
->internal_arg_pointer
;
575 max_parm_reg
= p
->max_parm_reg
;
576 parm_reg_stack_loc
= p
->parm_reg_stack_loc
;
577 current_function_outgoing_args_size
= p
->outgoing_args_size
;
578 current_function_return_rtx
= p
->return_rtx
;
579 nonlocal_goto_handler_slot
= p
->nonlocal_goto_handler_slot
;
580 nonlocal_goto_stack_level
= p
->nonlocal_goto_stack_level
;
581 nonlocal_labels
= p
->nonlocal_labels
;
582 cleanup_label
= p
->cleanup_label
;
583 return_label
= p
->return_label
;
584 save_expr_regs
= p
->save_expr_regs
;
585 stack_slot_list
= p
->stack_slot_list
;
586 parm_birth_insn
= p
->parm_birth_insn
;
587 frame_offset
= p
->frame_offset
;
588 tail_recursion_label
= p
->tail_recursion_label
;
589 tail_recursion_reentry
= p
->tail_recursion_reentry
;
590 arg_pointer_save_area
= p
->arg_pointer_save_area
;
591 rtl_expr_chain
= p
->rtl_expr_chain
;
592 last_parm_insn
= p
->last_parm_insn
;
593 context_display
= p
->context_display
;
594 trampoline_list
= p
->trampoline_list
;
595 function_call_count
= p
->function_call_count
;
596 temp_slots
= p
->temp_slots
;
597 temp_slot_level
= p
->temp_slot_level
;
598 current_function_epilogue_delay_list
= p
->epilogue_delay_list
;
600 current_function_args_info
= p
->args_info
;
602 restore_tree_status (p
);
603 restore_storage_status (p
);
604 restore_expr_status (p
);
605 restore_emit_status (p
);
606 restore_stmt_status (p
);
607 restore_varasm_status (p
);
609 if (restore_machine_status
)
610 (*restore_machine_status
) (p
);
612 /* Finish doing put_var_into_stack for any of our variables
613 which became addressable during the nested function. */
615 struct var_refs_queue
*queue
= p
->fixup_var_refs_queue
;
616 for (; queue
; queue
= queue
->next
)
617 fixup_var_refs (queue
->modified
, queue
->promoted_mode
, queue
->unsignedp
);
622 /* Reset variables that have known state during rtx generation. */
623 rtx_equal_function_value_matters
= 1;
624 virtuals_instantiated
= 0;
627 void pop_function_context ()
629 pop_function_context_from (current_function_decl
);
632 /* Allocate fixed slots in the stack frame of the current function. */
634 /* Return size needed for stack frame based on slots so far allocated.
635 This size counts from zero. It is not rounded to STACK_BOUNDARY;
636 the caller may have to do that. */
641 #ifdef FRAME_GROWS_DOWNWARD
642 return -frame_offset
;
648 /* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
649 with machine mode MODE.
651 ALIGN controls the amount of alignment for the address of the slot:
652 0 means according to MODE,
653 -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
654 positive specifies alignment boundary in bits.
656 We do not round to stack_boundary here. */
659 assign_stack_local (mode
, size
, align
)
660 enum machine_mode mode
;
664 register rtx x
, addr
;
665 int bigend_correction
= 0;
670 alignment
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
672 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
674 else if (align
== -1)
676 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
677 size
= CEIL_ROUND (size
, alignment
);
680 alignment
= align
/ BITS_PER_UNIT
;
682 /* Round frame offset to that alignment.
683 We must be careful here, since FRAME_OFFSET might be negative and
684 division with a negative dividend isn't as well defined as we might
685 like. So we instead assume that ALIGNMENT is a power of two and
686 use logical operations which are unambiguous. */
687 #ifdef FRAME_GROWS_DOWNWARD
688 frame_offset
= FLOOR_ROUND (frame_offset
, alignment
);
690 frame_offset
= CEIL_ROUND (frame_offset
, alignment
);
693 /* On a big-endian machine, if we are allocating more space than we will use,
694 use the least significant bytes of those that are allocated. */
695 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
)
696 bigend_correction
= size
- GET_MODE_SIZE (mode
);
698 #ifdef FRAME_GROWS_DOWNWARD
699 frame_offset
-= size
;
702 /* If we have already instantiated virtual registers, return the actual
703 address relative to the frame pointer. */
704 if (virtuals_instantiated
)
705 addr
= plus_constant (frame_pointer_rtx
,
706 (frame_offset
+ bigend_correction
707 + STARTING_FRAME_OFFSET
));
709 addr
= plus_constant (virtual_stack_vars_rtx
,
710 frame_offset
+ bigend_correction
);
712 #ifndef FRAME_GROWS_DOWNWARD
713 frame_offset
+= size
;
716 x
= gen_rtx (MEM
, mode
, addr
);
718 stack_slot_list
= gen_rtx (EXPR_LIST
, VOIDmode
, x
, stack_slot_list
);
723 /* Assign a stack slot in a containing function.
724 First three arguments are same as in preceding function.
725 The last argument specifies the function to allocate in. */
728 assign_outer_stack_local (mode
, size
, align
, function
)
729 enum machine_mode mode
;
732 struct function
*function
;
734 register rtx x
, addr
;
735 int bigend_correction
= 0;
738 /* Allocate in the memory associated with the function in whose frame
740 push_obstacks (function
->function_obstack
,
741 function
->function_maybepermanent_obstack
);
745 alignment
= GET_MODE_ALIGNMENT (mode
) / BITS_PER_UNIT
;
747 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
749 else if (align
== -1)
751 alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
752 size
= CEIL_ROUND (size
, alignment
);
755 alignment
= align
/ BITS_PER_UNIT
;
757 /* Round frame offset to that alignment. */
758 #ifdef FRAME_GROWS_DOWNWARD
759 function
->frame_offset
= FLOOR_ROUND (function
->frame_offset
, alignment
);
761 function
->frame_offset
= CEIL_ROUND (function
->frame_offset
, alignment
);
764 /* On a big-endian machine, if we are allocating more space than we will use,
765 use the least significant bytes of those that are allocated. */
766 if (BYTES_BIG_ENDIAN
&& mode
!= BLKmode
)
767 bigend_correction
= size
- GET_MODE_SIZE (mode
);
769 #ifdef FRAME_GROWS_DOWNWARD
770 function
->frame_offset
-= size
;
772 addr
= plus_constant (virtual_stack_vars_rtx
,
773 function
->frame_offset
+ bigend_correction
);
774 #ifndef FRAME_GROWS_DOWNWARD
775 function
->frame_offset
+= size
;
778 x
= gen_rtx (MEM
, mode
, addr
);
780 function
->stack_slot_list
781 = gen_rtx (EXPR_LIST
, VOIDmode
, x
, function
->stack_slot_list
);
788 /* Allocate a temporary stack slot and record it for possible later
791 MODE is the machine mode to be given to the returned rtx.
793 SIZE is the size in units of the space required. We do no rounding here
794 since assign_stack_local will do any required rounding.
796 KEEP is 1 if this slot is to be retained after a call to
797 free_temp_slots. Automatic variables for a block are allocated
798 with this flag. KEEP is 2, if we allocate a longer term temporary,
799 whose lifetime is controlled by CLEANUP_POINT_EXPRs. */
802 assign_stack_temp (mode
, size
, keep
)
803 enum machine_mode mode
;
807 struct temp_slot
*p
, *best_p
= 0;
809 /* If SIZE is -1 it means that somebody tried to allocate a temporary
810 of a variable size. */
814 /* First try to find an available, already-allocated temporary that is the
815 exact size we require. */
816 for (p
= temp_slots
; p
; p
= p
->next
)
817 if (p
->size
== size
&& GET_MODE (p
->slot
) == mode
&& ! p
->in_use
)
820 /* If we didn't find, one, try one that is larger than what we want. We
821 find the smallest such. */
823 for (p
= temp_slots
; p
; p
= p
->next
)
824 if (p
->size
> size
&& GET_MODE (p
->slot
) == mode
&& ! p
->in_use
825 && (best_p
== 0 || best_p
->size
> p
->size
))
828 /* Make our best, if any, the one to use. */
831 /* If there are enough aligned bytes left over, make them into a new
832 temp_slot so that the extra bytes don't get wasted. Do this only
833 for BLKmode slots, so that we can be sure of the alignment. */
834 if (GET_MODE (best_p
->slot
) == BLKmode
)
836 int alignment
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
837 int rounded_size
= CEIL_ROUND (size
, alignment
);
839 if (best_p
->size
- rounded_size
>= alignment
)
841 p
= (struct temp_slot
*) oballoc (sizeof (struct temp_slot
));
842 p
->in_use
= p
->addr_taken
= 0;
843 p
->size
= best_p
->size
- rounded_size
;
844 p
->base_offset
= best_p
->base_offset
+ rounded_size
;
845 p
->full_size
= best_p
->full_size
- rounded_size
;
846 p
->slot
= gen_rtx (MEM
, BLKmode
,
847 plus_constant (XEXP (best_p
->slot
, 0),
851 p
->next
= temp_slots
;
854 stack_slot_list
= gen_rtx (EXPR_LIST
, VOIDmode
, p
->slot
,
857 best_p
->size
= rounded_size
;
858 best_p
->full_size
= rounded_size
;
865 /* If we still didn't find one, make a new temporary. */
868 int frame_offset_old
= frame_offset
;
869 p
= (struct temp_slot
*) oballoc (sizeof (struct temp_slot
));
870 /* If the temp slot mode doesn't indicate the alignment,
871 use the largest possible, so no one will be disappointed. */
872 p
->slot
= assign_stack_local (mode
, size
, mode
== BLKmode
? -1 : 0);
873 /* The following slot size computation is necessary because we don't
874 know the actual size of the temporary slot until assign_stack_local
875 has performed all the frame alignment and size rounding for the
876 requested temporary. Note that extra space added for alignment
877 can be either above or below this stack slot depending on which
878 way the frame grows. We include the extra space if and only if it
879 is above this slot. */
880 #ifdef FRAME_GROWS_DOWNWARD
881 p
->size
= frame_offset_old
- frame_offset
;
885 /* Now define the fields used by combine_temp_slots. */
886 #ifdef FRAME_GROWS_DOWNWARD
887 p
->base_offset
= frame_offset
;
888 p
->full_size
= frame_offset_old
- frame_offset
;
890 p
->base_offset
= frame_offset_old
;
891 p
->full_size
= frame_offset
- frame_offset_old
;
894 p
->next
= temp_slots
;
900 p
->rtl_expr
= sequence_rtl_expr
;
904 p
->level
= target_temp_slot_level
;
909 p
->level
= temp_slot_level
;
915 /* Assign a temporary of given TYPE.
916 KEEP is as for assign_stack_temp.
917 MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
918 it is 0 if a register is OK.
919 DONT_PROMOTE is 1 if we should not promote values in register
923 assign_temp (type
, keep
, memory_required
, dont_promote
)
929 enum machine_mode mode
= TYPE_MODE (type
);
930 int unsignedp
= TREE_UNSIGNED (type
);
932 if (mode
== BLKmode
|| memory_required
)
934 int size
= int_size_in_bytes (type
);
937 /* Unfortunately, we don't yet know how to allocate variable-sized
938 temporaries. However, sometimes we have a fixed upper limit on
939 the size (which is stored in TYPE_ARRAY_MAX_SIZE) and can use that
940 instead. This is the case for Chill variable-sized strings. */
941 if (size
== -1 && TREE_CODE (type
) == ARRAY_TYPE
942 && TYPE_ARRAY_MAX_SIZE (type
) != NULL_TREE
943 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (type
)) == INTEGER_CST
)
944 size
= TREE_INT_CST_LOW (TYPE_ARRAY_MAX_SIZE (type
));
946 tmp
= assign_stack_temp (mode
, size
, keep
);
947 MEM_IN_STRUCT_P (tmp
) = AGGREGATE_TYPE_P (type
);
951 #ifndef PROMOTE_FOR_CALL_ONLY
953 mode
= promote_mode (type
, mode
, &unsignedp
, 0);
956 return gen_reg_rtx (mode
);
959 /* Combine temporary stack slots which are adjacent on the stack.
961 This allows for better use of already allocated stack space. This is only
962 done for BLKmode slots because we can be sure that we won't have alignment
963 problems in this case. */
966 combine_temp_slots ()
968 struct temp_slot
*p
, *q
;
969 struct temp_slot
*prev_p
, *prev_q
;
970 /* Determine where to free back to after this function. */
971 rtx free_pointer
= rtx_alloc (CONST_INT
);
973 for (p
= temp_slots
, prev_p
= 0; p
; p
= prev_p
? prev_p
->next
: temp_slots
)
976 if (! p
->in_use
&& GET_MODE (p
->slot
) == BLKmode
)
977 for (q
= p
->next
, prev_q
= p
; q
; q
= prev_q
->next
)
980 if (! q
->in_use
&& GET_MODE (q
->slot
) == BLKmode
)
982 if (p
->base_offset
+ p
->full_size
== q
->base_offset
)
984 /* Q comes after P; combine Q into P. */
986 p
->full_size
+= q
->full_size
;
989 else if (q
->base_offset
+ q
->full_size
== p
->base_offset
)
991 /* P comes after Q; combine P into Q. */
993 q
->full_size
+= p
->full_size
;
998 /* Either delete Q or advance past it. */
1000 prev_q
->next
= q
->next
;
1004 /* Either delete P or advance past it. */
1008 prev_p
->next
= p
->next
;
1010 temp_slots
= p
->next
;
1016 /* Free all the RTL made by plus_constant. */
1017 rtx_free (free_pointer
);
1020 /* Find the temp slot corresponding to the object at address X. */
1022 static struct temp_slot
*
1023 find_temp_slot_from_address (x
)
1026 struct temp_slot
*p
;
1029 for (p
= temp_slots
; p
; p
= p
->next
)
1033 else if (XEXP (p
->slot
, 0) == x
1035 || (GET_CODE (x
) == PLUS
1036 && XEXP (x
, 0) == virtual_stack_vars_rtx
1037 && GET_CODE (XEXP (x
, 1)) == CONST_INT
1038 && INTVAL (XEXP (x
, 1)) >= p
->base_offset
1039 && INTVAL (XEXP (x
, 1)) < p
->base_offset
+ p
->full_size
))
1042 else if (p
->address
!= 0 && GET_CODE (p
->address
) == EXPR_LIST
)
1043 for (next
= p
->address
; next
; next
= XEXP (next
, 1))
1044 if (XEXP (next
, 0) == x
)
1051 /* Indicate that NEW is an alternate way of referring to the temp slot
1052 that previous was known by OLD. */
1055 update_temp_slot_address (old
, new)
1058 struct temp_slot
*p
= find_temp_slot_from_address (old
);
1060 /* If none, return. Else add NEW as an alias. */
1063 else if (p
->address
== 0)
1067 if (GET_CODE (p
->address
) != EXPR_LIST
)
1068 p
->address
= gen_rtx (EXPR_LIST
, VOIDmode
, p
->address
, NULL_RTX
);
1070 p
->address
= gen_rtx (EXPR_LIST
, VOIDmode
, new, p
->address
);
1074 /* If X could be a reference to a temporary slot, mark the fact that its
1075 address was taken. */
1078 mark_temp_addr_taken (x
)
1081 struct temp_slot
*p
;
1086 /* If X is not in memory or is at a constant address, it cannot be in
1087 a temporary slot. */
1088 if (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1091 p
= find_temp_slot_from_address (XEXP (x
, 0));
1096 /* If X could be a reference to a temporary slot, mark that slot as
1097 belonging to the to one level higher than the current level. If X
1098 matched one of our slots, just mark that one. Otherwise, we can't
1099 easily predict which it is, so upgrade all of them. Kept slots
1100 need not be touched.
1102 This is called when an ({...}) construct occurs and a statement
1103 returns a value in memory. */
1106 preserve_temp_slots (x
)
1109 struct temp_slot
*p
= 0;
1111 /* If there is no result, we still might have some objects whose address
1112 were taken, so we need to make sure they stay around. */
1115 for (p
= temp_slots
; p
; p
= p
->next
)
1116 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1122 /* If X is a register that is being used as a pointer, see if we have
1123 a temporary slot we know it points to. To be consistent with
1124 the code below, we really should preserve all non-kept slots
1125 if we can't find a match, but that seems to be much too costly. */
1126 if (GET_CODE (x
) == REG
&& REGNO_POINTER_FLAG (REGNO (x
)))
1127 p
= find_temp_slot_from_address (x
);
1129 /* If X is not in memory or is at a constant address, it cannot be in
1130 a temporary slot, but it can contain something whose address was
1132 if (p
== 0 && (GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0))))
1134 for (p
= temp_slots
; p
; p
= p
->next
)
1135 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->addr_taken
)
1141 /* First see if we can find a match. */
1143 p
= find_temp_slot_from_address (XEXP (x
, 0));
1147 /* Move everything at our level whose address was taken to our new
1148 level in case we used its address. */
1149 struct temp_slot
*q
;
1151 if (p
->level
== temp_slot_level
)
1153 for (q
= temp_slots
; q
; q
= q
->next
)
1154 if (q
!= p
&& q
->addr_taken
&& q
->level
== p
->level
)
1163 /* Otherwise, preserve all non-kept slots at this level. */
1164 for (p
= temp_slots
; p
; p
= p
->next
)
1165 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
)
1169 /* X is the result of an RTL_EXPR. If it is a temporary slot associated
1170 with that RTL_EXPR, promote it into a temporary slot at the present
1171 level so it will not be freed when we free slots made in the
1175 preserve_rtl_expr_result (x
)
1178 struct temp_slot
*p
;
1180 /* If X is not in memory or is at a constant address, it cannot be in
1181 a temporary slot. */
1182 if (x
== 0 || GET_CODE (x
) != MEM
|| CONSTANT_P (XEXP (x
, 0)))
1185 /* If we can find a match, move it to our level unless it is already at
1187 p
= find_temp_slot_from_address (XEXP (x
, 0));
1190 p
->level
= MIN (p
->level
, temp_slot_level
);
1197 /* Free all temporaries used so far. This is normally called at the end
1198 of generating code for a statement. Don't free any temporaries
1199 currently in use for an RTL_EXPR that hasn't yet been emitted.
1200 We could eventually do better than this since it can be reused while
1201 generating the same RTL_EXPR, but this is complex and probably not
1207 struct temp_slot
*p
;
1209 for (p
= temp_slots
; p
; p
= p
->next
)
1210 if (p
->in_use
&& p
->level
== temp_slot_level
&& ! p
->keep
1211 && p
->rtl_expr
== 0)
1214 combine_temp_slots ();
1217 /* Free all temporary slots used in T, an RTL_EXPR node. */
1220 free_temps_for_rtl_expr (t
)
1223 struct temp_slot
*p
;
1225 for (p
= temp_slots
; p
; p
= p
->next
)
1226 if (p
->rtl_expr
== t
)
1229 combine_temp_slots ();
1232 /* Mark all temporaries ever allocated in this functon as not suitable
1233 for reuse until the current level is exited. */
1236 mark_all_temps_used ()
1238 struct temp_slot
*p
;
1240 for (p
= temp_slots
; p
; p
= p
->next
)
1243 p
->level
= MIN (p
->level
, temp_slot_level
);
1247 /* Push deeper into the nesting level for stack temporaries. */
1255 /* Pop a temporary nesting level. All slots in use in the current level
1261 struct temp_slot
*p
;
1263 for (p
= temp_slots
; p
; p
= p
->next
)
1264 if (p
->in_use
&& p
->level
== temp_slot_level
&& p
->rtl_expr
== 0)
1267 combine_temp_slots ();
1272 /* Initialize temporary slots. */
1277 /* We have not allocated any temporaries yet. */
1279 temp_slot_level
= 0;
1280 target_temp_slot_level
= 0;
1283 /* Retroactively move an auto variable from a register to a stack slot.
1284 This is done when an address-reference to the variable is seen. */
1287 put_var_into_stack (decl
)
1291 enum machine_mode promoted_mode
, decl_mode
;
1292 struct function
*function
= 0;
1295 if (output_bytecode
)
1298 context
= decl_function_context (decl
);
1300 /* Get the current rtl used for this object and it's original mode. */
1301 reg
= TREE_CODE (decl
) == SAVE_EXPR
? SAVE_EXPR_RTL (decl
) : DECL_RTL (decl
);
1303 /* No need to do anything if decl has no rtx yet
1304 since in that case caller is setting TREE_ADDRESSABLE
1305 and a stack slot will be assigned when the rtl is made. */
1309 /* Get the declared mode for this object. */
1310 decl_mode
= (TREE_CODE (decl
) == SAVE_EXPR
? TYPE_MODE (TREE_TYPE (decl
))
1311 : DECL_MODE (decl
));
1312 /* Get the mode it's actually stored in. */
1313 promoted_mode
= GET_MODE (reg
);
1315 /* If this variable comes from an outer function,
1316 find that function's saved context. */
1317 if (context
!= current_function_decl
)
1318 for (function
= outer_function_chain
; function
; function
= function
->next
)
1319 if (function
->decl
== context
)
1322 /* If this is a variable-size object with a pseudo to address it,
1323 put that pseudo into the stack, if the var is nonlocal. */
1324 if (DECL_NONLOCAL (decl
)
1325 && GET_CODE (reg
) == MEM
1326 && GET_CODE (XEXP (reg
, 0)) == REG
1327 && REGNO (XEXP (reg
, 0)) > LAST_VIRTUAL_REGISTER
)
1329 reg
= XEXP (reg
, 0);
1330 decl_mode
= promoted_mode
= GET_MODE (reg
);
1333 /* Now we should have a value that resides in one or more pseudo regs. */
1335 if (GET_CODE (reg
) == REG
)
1336 put_reg_into_stack (function
, reg
, TREE_TYPE (decl
),
1337 promoted_mode
, decl_mode
, TREE_SIDE_EFFECTS (decl
));
1338 else if (GET_CODE (reg
) == CONCAT
)
1340 /* A CONCAT contains two pseudos; put them both in the stack.
1341 We do it so they end up consecutive. */
1342 enum machine_mode part_mode
= GET_MODE (XEXP (reg
, 0));
1343 tree part_type
= TREE_TYPE (TREE_TYPE (decl
));
1344 #ifdef FRAME_GROWS_DOWNWARD
1345 /* Since part 0 should have a lower address, do it second. */
1346 put_reg_into_stack (function
, XEXP (reg
, 1), part_type
, part_mode
,
1347 part_mode
, TREE_SIDE_EFFECTS (decl
));
1348 put_reg_into_stack (function
, XEXP (reg
, 0), part_type
, part_mode
,
1349 part_mode
, TREE_SIDE_EFFECTS (decl
));
1351 put_reg_into_stack (function
, XEXP (reg
, 0), part_type
, part_mode
,
1352 part_mode
, TREE_SIDE_EFFECTS (decl
));
1353 put_reg_into_stack (function
, XEXP (reg
, 1), part_type
, part_mode
,
1354 part_mode
, TREE_SIDE_EFFECTS (decl
));
1357 /* Change the CONCAT into a combined MEM for both parts. */
1358 PUT_CODE (reg
, MEM
);
1359 MEM_VOLATILE_P (reg
) = MEM_VOLATILE_P (XEXP (reg
, 0));
1361 /* The two parts are in memory order already.
1362 Use the lower parts address as ours. */
1363 XEXP (reg
, 0) = XEXP (XEXP (reg
, 0), 0);
1364 /* Prevent sharing of rtl that might lose. */
1365 if (GET_CODE (XEXP (reg
, 0)) == PLUS
)
1366 XEXP (reg
, 0) = copy_rtx (XEXP (reg
, 0));
1370 /* Subroutine of put_var_into_stack. This puts a single pseudo reg REG
1371 into the stack frame of FUNCTION (0 means the current function).
1372 DECL_MODE is the machine mode of the user-level data type.
1373 PROMOTED_MODE is the machine mode of the register.
1374 VOLATILE_P is nonzero if this is for a "volatile" decl. */
1377 put_reg_into_stack (function
, reg
, type
, promoted_mode
, decl_mode
, volatile_p
)
1378 struct function
*function
;
1381 enum machine_mode promoted_mode
, decl_mode
;
1388 if (REGNO (reg
) < function
->max_parm_reg
)
1389 new = function
->parm_reg_stack_loc
[REGNO (reg
)];
1391 new = assign_outer_stack_local (decl_mode
, GET_MODE_SIZE (decl_mode
),
1396 if (REGNO (reg
) < max_parm_reg
)
1397 new = parm_reg_stack_loc
[REGNO (reg
)];
1399 new = assign_stack_local (decl_mode
, GET_MODE_SIZE (decl_mode
), 0);
1402 PUT_MODE (reg
, decl_mode
);
1403 XEXP (reg
, 0) = XEXP (new, 0);
1404 /* `volatil' bit means one thing for MEMs, another entirely for REGs. */
1405 MEM_VOLATILE_P (reg
) = volatile_p
;
1406 PUT_CODE (reg
, MEM
);
1408 /* If this is a memory ref that contains aggregate components,
1409 mark it as such for cse and loop optimize. */
1410 MEM_IN_STRUCT_P (reg
) = AGGREGATE_TYPE_P (type
);
1412 /* Now make sure that all refs to the variable, previously made
1413 when it was a register, are fixed up to be valid again. */
1416 struct var_refs_queue
*temp
;
1418 /* Variable is inherited; fix it up when we get back to its function. */
1419 push_obstacks (function
->function_obstack
,
1420 function
->function_maybepermanent_obstack
);
1422 /* See comment in restore_tree_status in tree.c for why this needs to be
1423 on saveable obstack. */
1425 = (struct var_refs_queue
*) savealloc (sizeof (struct var_refs_queue
));
1426 temp
->modified
= reg
;
1427 temp
->promoted_mode
= promoted_mode
;
1428 temp
->unsignedp
= TREE_UNSIGNED (type
);
1429 temp
->next
= function
->fixup_var_refs_queue
;
1430 function
->fixup_var_refs_queue
= temp
;
1434 /* Variable is local; fix it up now. */
1435 fixup_var_refs (reg
, promoted_mode
, TREE_UNSIGNED (type
));
1439 fixup_var_refs (var
, promoted_mode
, unsignedp
)
1441 enum machine_mode promoted_mode
;
1445 rtx first_insn
= get_insns ();
1446 struct sequence_stack
*stack
= sequence_stack
;
1447 tree rtl_exps
= rtl_expr_chain
;
1449 /* Must scan all insns for stack-refs that exceed the limit. */
1450 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, first_insn
, stack
== 0);
1452 /* Scan all pending sequences too. */
1453 for (; stack
; stack
= stack
->next
)
1455 push_to_sequence (stack
->first
);
1456 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
,
1457 stack
->first
, stack
->next
!= 0);
1458 /* Update remembered end of sequence
1459 in case we added an insn at the end. */
1460 stack
->last
= get_last_insn ();
1464 /* Scan all waiting RTL_EXPRs too. */
1465 for (pending
= rtl_exps
; pending
; pending
= TREE_CHAIN (pending
))
1467 rtx seq
= RTL_EXPR_SEQUENCE (TREE_VALUE (pending
));
1468 if (seq
!= const0_rtx
&& seq
!= 0)
1470 push_to_sequence (seq
);
1471 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, seq
, 0);
1477 /* REPLACEMENTS is a pointer to a list of the struct fixup_replacement and X is
1478 some part of an insn. Return a struct fixup_replacement whose OLD
1479 value is equal to X. Allocate a new structure if no such entry exists. */
1481 static struct fixup_replacement
*
1482 find_fixup_replacement (replacements
, x
)
1483 struct fixup_replacement
**replacements
;
1486 struct fixup_replacement
*p
;
1488 /* See if we have already replaced this. */
1489 for (p
= *replacements
; p
&& p
->old
!= x
; p
= p
->next
)
1494 p
= (struct fixup_replacement
*) oballoc (sizeof (struct fixup_replacement
));
1497 p
->next
= *replacements
;
1504 /* Scan the insn-chain starting with INSN for refs to VAR
1505 and fix them up. TOPLEVEL is nonzero if this chain is the
1506 main chain of insns for the current function. */
1509 fixup_var_refs_insns (var
, promoted_mode
, unsignedp
, insn
, toplevel
)
1511 enum machine_mode promoted_mode
;
1520 rtx next
= NEXT_INSN (insn
);
1522 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
1524 /* If this is a CLOBBER of VAR, delete it.
1526 If it has a REG_LIBCALL note, delete the REG_LIBCALL
1527 and REG_RETVAL notes too. */
1528 if (GET_CODE (PATTERN (insn
)) == CLOBBER
1529 && XEXP (PATTERN (insn
), 0) == var
)
1531 if ((note
= find_reg_note (insn
, REG_LIBCALL
, NULL_RTX
)) != 0)
1532 /* The REG_LIBCALL note will go away since we are going to
1533 turn INSN into a NOTE, so just delete the
1534 corresponding REG_RETVAL note. */
1535 remove_note (XEXP (note
, 0),
1536 find_reg_note (XEXP (note
, 0), REG_RETVAL
,
1539 /* In unoptimized compilation, we shouldn't call delete_insn
1540 except in jump.c doing warnings. */
1541 PUT_CODE (insn
, NOTE
);
1542 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1543 NOTE_SOURCE_FILE (insn
) = 0;
1546 /* The insn to load VAR from a home in the arglist
1547 is now a no-op. When we see it, just delete it. */
1549 && GET_CODE (PATTERN (insn
)) == SET
1550 && SET_DEST (PATTERN (insn
)) == var
1551 /* If this represents the result of an insn group,
1552 don't delete the insn. */
1553 && find_reg_note (insn
, REG_RETVAL
, NULL_RTX
) == 0
1554 && rtx_equal_p (SET_SRC (PATTERN (insn
)), var
))
1556 /* In unoptimized compilation, we shouldn't call delete_insn
1557 except in jump.c doing warnings. */
1558 PUT_CODE (insn
, NOTE
);
1559 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1560 NOTE_SOURCE_FILE (insn
) = 0;
1561 if (insn
== last_parm_insn
)
1562 last_parm_insn
= PREV_INSN (next
);
1566 struct fixup_replacement
*replacements
= 0;
1567 rtx next_insn
= NEXT_INSN (insn
);
1569 #ifdef SMALL_REGISTER_CLASSES
1570 /* If the insn that copies the results of a CALL_INSN
1571 into a pseudo now references VAR, we have to use an
1572 intermediate pseudo since we want the life of the
1573 return value register to be only a single insn.
1575 If we don't use an intermediate pseudo, such things as
1576 address computations to make the address of VAR valid
1577 if it is not can be placed between the CALL_INSN and INSN.
1579 To make sure this doesn't happen, we record the destination
1580 of the CALL_INSN and see if the next insn uses both that
1583 if (SMALL_REGISTER_CLASSES
)
1585 if (call_dest
!= 0 && GET_CODE (insn
) == INSN
1586 && reg_mentioned_p (var
, PATTERN (insn
))
1587 && reg_mentioned_p (call_dest
, PATTERN (insn
)))
1589 rtx temp
= gen_reg_rtx (GET_MODE (call_dest
));
1591 emit_insn_before (gen_move_insn (temp
, call_dest
), insn
);
1593 PATTERN (insn
) = replace_rtx (PATTERN (insn
),
1597 if (GET_CODE (insn
) == CALL_INSN
1598 && GET_CODE (PATTERN (insn
)) == SET
)
1599 call_dest
= SET_DEST (PATTERN (insn
));
1600 else if (GET_CODE (insn
) == CALL_INSN
1601 && GET_CODE (PATTERN (insn
)) == PARALLEL
1602 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1603 call_dest
= SET_DEST (XVECEXP (PATTERN (insn
), 0, 0));
1609 /* See if we have to do anything to INSN now that VAR is in
1610 memory. If it needs to be loaded into a pseudo, use a single
1611 pseudo for the entire insn in case there is a MATCH_DUP
1612 between two operands. We pass a pointer to the head of
1613 a list of struct fixup_replacements. If fixup_var_refs_1
1614 needs to allocate pseudos or replacement MEMs (for SUBREGs),
1615 it will record them in this list.
1617 If it allocated a pseudo for any replacement, we copy into
1620 fixup_var_refs_1 (var
, promoted_mode
, &PATTERN (insn
), insn
,
1623 /* If this is last_parm_insn, and any instructions were output
1624 after it to fix it up, then we must set last_parm_insn to
1625 the last such instruction emitted. */
1626 if (insn
== last_parm_insn
)
1627 last_parm_insn
= PREV_INSN (next_insn
);
1629 while (replacements
)
1631 if (GET_CODE (replacements
->new) == REG
)
1636 /* OLD might be a (subreg (mem)). */
1637 if (GET_CODE (replacements
->old
) == SUBREG
)
1639 = fixup_memory_subreg (replacements
->old
, insn
, 0);
1642 = fixup_stack_1 (replacements
->old
, insn
);
1644 insert_before
= insn
;
1646 /* If we are changing the mode, do a conversion.
1647 This might be wasteful, but combine.c will
1648 eliminate much of the waste. */
1650 if (GET_MODE (replacements
->new)
1651 != GET_MODE (replacements
->old
))
1654 convert_move (replacements
->new,
1655 replacements
->old
, unsignedp
);
1656 seq
= gen_sequence ();
1660 seq
= gen_move_insn (replacements
->new,
1663 emit_insn_before (seq
, insert_before
);
1666 replacements
= replacements
->next
;
1670 /* Also fix up any invalid exprs in the REG_NOTES of this insn.
1671 But don't touch other insns referred to by reg-notes;
1672 we will get them elsewhere. */
1673 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
1674 if (GET_CODE (note
) != INSN_LIST
)
1676 = walk_fixup_memory_subreg (XEXP (note
, 0), insn
, 1);
1682 /* VAR is a MEM that used to be a pseudo register with mode PROMOTED_MODE.
1683 See if the rtx expression at *LOC in INSN needs to be changed.
1685 REPLACEMENTS is a pointer to a list head that starts out zero, but may
1686 contain a list of original rtx's and replacements. If we find that we need
1687 to modify this insn by replacing a memory reference with a pseudo or by
1688 making a new MEM to implement a SUBREG, we consult that list to see if
1689 we have already chosen a replacement. If none has already been allocated,
1690 we allocate it and update the list. fixup_var_refs_insns will copy VAR
1691 or the SUBREG, as appropriate, to the pseudo. */
1694 fixup_var_refs_1 (var
, promoted_mode
, loc
, insn
, replacements
)
1696 enum machine_mode promoted_mode
;
1699 struct fixup_replacement
**replacements
;
1702 register rtx x
= *loc
;
1703 RTX_CODE code
= GET_CODE (x
);
1705 register rtx tem
, tem1
;
1706 struct fixup_replacement
*replacement
;
1713 /* If we already have a replacement, use it. Otherwise,
1714 try to fix up this address in case it is invalid. */
1716 replacement
= find_fixup_replacement (replacements
, var
);
1717 if (replacement
->new)
1719 *loc
= replacement
->new;
1723 *loc
= replacement
->new = x
= fixup_stack_1 (x
, insn
);
1725 /* Unless we are forcing memory to register or we changed the mode,
1726 we can leave things the way they are if the insn is valid. */
1728 INSN_CODE (insn
) = -1;
1729 if (! flag_force_mem
&& GET_MODE (x
) == promoted_mode
1730 && recog_memoized (insn
) >= 0)
1733 *loc
= replacement
->new = gen_reg_rtx (promoted_mode
);
1737 /* If X contains VAR, we need to unshare it here so that we update
1738 each occurrence separately. But all identical MEMs in one insn
1739 must be replaced with the same rtx because of the possibility of
1742 if (reg_mentioned_p (var
, x
))
1744 replacement
= find_fixup_replacement (replacements
, x
);
1745 if (replacement
->new == 0)
1746 replacement
->new = copy_most_rtx (x
, var
);
1748 *loc
= x
= replacement
->new;
1764 /* Note that in some cases those types of expressions are altered
1765 by optimize_bit_field, and do not survive to get here. */
1766 if (XEXP (x
, 0) == var
1767 || (GET_CODE (XEXP (x
, 0)) == SUBREG
1768 && SUBREG_REG (XEXP (x
, 0)) == var
))
1770 /* Get TEM as a valid MEM in the mode presently in the insn.
1772 We don't worry about the possibility of MATCH_DUP here; it
1773 is highly unlikely and would be tricky to handle. */
1776 if (GET_CODE (tem
) == SUBREG
)
1778 if (GET_MODE_BITSIZE (GET_MODE (tem
))
1779 > GET_MODE_BITSIZE (GET_MODE (var
)))
1781 replacement
= find_fixup_replacement (replacements
, var
);
1782 if (replacement
->new == 0)
1783 replacement
->new = gen_reg_rtx (GET_MODE (var
));
1784 SUBREG_REG (tem
) = replacement
->new;
1787 tem
= fixup_memory_subreg (tem
, insn
, 0);
1790 tem
= fixup_stack_1 (tem
, insn
);
1792 /* Unless we want to load from memory, get TEM into the proper mode
1793 for an extract from memory. This can only be done if the
1794 extract is at a constant position and length. */
1796 if (! flag_force_mem
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
1797 && GET_CODE (XEXP (x
, 2)) == CONST_INT
1798 && ! mode_dependent_address_p (XEXP (tem
, 0))
1799 && ! MEM_VOLATILE_P (tem
))
1801 enum machine_mode wanted_mode
= VOIDmode
;
1802 enum machine_mode is_mode
= GET_MODE (tem
);
1803 int width
= INTVAL (XEXP (x
, 1));
1804 int pos
= INTVAL (XEXP (x
, 2));
1807 if (GET_CODE (x
) == ZERO_EXTRACT
)
1808 wanted_mode
= insn_operand_mode
[(int) CODE_FOR_extzv
][1];
1811 if (GET_CODE (x
) == SIGN_EXTRACT
)
1812 wanted_mode
= insn_operand_mode
[(int) CODE_FOR_extv
][1];
1814 /* If we have a narrower mode, we can do something. */
1815 if (wanted_mode
!= VOIDmode
1816 && GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
1818 int offset
= pos
/ BITS_PER_UNIT
;
1819 rtx old_pos
= XEXP (x
, 2);
1822 /* If the bytes and bits are counted differently, we
1823 must adjust the offset. */
1824 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
1825 offset
= (GET_MODE_SIZE (is_mode
)
1826 - GET_MODE_SIZE (wanted_mode
) - offset
);
1828 pos
%= GET_MODE_BITSIZE (wanted_mode
);
1830 newmem
= gen_rtx (MEM
, wanted_mode
,
1831 plus_constant (XEXP (tem
, 0), offset
));
1832 RTX_UNCHANGING_P (newmem
) = RTX_UNCHANGING_P (tem
);
1833 MEM_VOLATILE_P (newmem
) = MEM_VOLATILE_P (tem
);
1834 MEM_IN_STRUCT_P (newmem
) = MEM_IN_STRUCT_P (tem
);
1836 /* Make the change and see if the insn remains valid. */
1837 INSN_CODE (insn
) = -1;
1838 XEXP (x
, 0) = newmem
;
1839 XEXP (x
, 2) = GEN_INT (pos
);
1841 if (recog_memoized (insn
) >= 0)
1844 /* Otherwise, restore old position. XEXP (x, 0) will be
1846 XEXP (x
, 2) = old_pos
;
1850 /* If we get here, the bitfield extract insn can't accept a memory
1851 reference. Copy the input into a register. */
1853 tem1
= gen_reg_rtx (GET_MODE (tem
));
1854 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
1861 if (SUBREG_REG (x
) == var
)
1863 /* If this is a special SUBREG made because VAR was promoted
1864 from a wider mode, replace it with VAR and call ourself
1865 recursively, this time saying that the object previously
1866 had its current mode (by virtue of the SUBREG). */
1868 if (SUBREG_PROMOTED_VAR_P (x
))
1871 fixup_var_refs_1 (var
, GET_MODE (var
), loc
, insn
, replacements
);
1875 /* If this SUBREG makes VAR wider, it has become a paradoxical
1876 SUBREG with VAR in memory, but these aren't allowed at this
1877 stage of the compilation. So load VAR into a pseudo and take
1878 a SUBREG of that pseudo. */
1879 if (GET_MODE_SIZE (GET_MODE (x
)) > GET_MODE_SIZE (GET_MODE (var
)))
1881 replacement
= find_fixup_replacement (replacements
, var
);
1882 if (replacement
->new == 0)
1883 replacement
->new = gen_reg_rtx (GET_MODE (var
));
1884 SUBREG_REG (x
) = replacement
->new;
1888 /* See if we have already found a replacement for this SUBREG.
1889 If so, use it. Otherwise, make a MEM and see if the insn
1890 is recognized. If not, or if we should force MEM into a register,
1891 make a pseudo for this SUBREG. */
1892 replacement
= find_fixup_replacement (replacements
, x
);
1893 if (replacement
->new)
1895 *loc
= replacement
->new;
1899 replacement
->new = *loc
= fixup_memory_subreg (x
, insn
, 0);
1901 INSN_CODE (insn
) = -1;
1902 if (! flag_force_mem
&& recog_memoized (insn
) >= 0)
1905 *loc
= replacement
->new = gen_reg_rtx (GET_MODE (x
));
1911 /* First do special simplification of bit-field references. */
1912 if (GET_CODE (SET_DEST (x
)) == SIGN_EXTRACT
1913 || GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
)
1914 optimize_bit_field (x
, insn
, 0);
1915 if (GET_CODE (SET_SRC (x
)) == SIGN_EXTRACT
1916 || GET_CODE (SET_SRC (x
)) == ZERO_EXTRACT
)
1917 optimize_bit_field (x
, insn
, NULL_PTR
);
1919 /* For a paradoxical SUBREG inside a ZERO_EXTRACT, load the object
1920 into a register and then store it back out. */
1921 if (GET_CODE (SET_DEST (x
)) == ZERO_EXTRACT
1922 && GET_CODE (XEXP (SET_DEST (x
), 0)) == SUBREG
1923 && SUBREG_REG (XEXP (SET_DEST (x
), 0)) == var
1924 && (GET_MODE_SIZE (GET_MODE (XEXP (SET_DEST (x
), 0)))
1925 > GET_MODE_SIZE (GET_MODE (var
))))
1927 replacement
= find_fixup_replacement (replacements
, var
);
1928 if (replacement
->new == 0)
1929 replacement
->new = gen_reg_rtx (GET_MODE (var
));
1931 SUBREG_REG (XEXP (SET_DEST (x
), 0)) = replacement
->new;
1932 emit_insn_after (gen_move_insn (var
, replacement
->new), insn
);
1935 /* If SET_DEST is now a paradoxical SUBREG, put the result of this
1936 insn into a pseudo and store the low part of the pseudo into VAR. */
1937 if (GET_CODE (SET_DEST (x
)) == SUBREG
1938 && SUBREG_REG (SET_DEST (x
)) == var
1939 && (GET_MODE_SIZE (GET_MODE (SET_DEST (x
)))
1940 > GET_MODE_SIZE (GET_MODE (var
))))
1942 SET_DEST (x
) = tem
= gen_reg_rtx (GET_MODE (SET_DEST (x
)));
1943 emit_insn_after (gen_move_insn (var
, gen_lowpart (GET_MODE (var
),
1950 rtx dest
= SET_DEST (x
);
1951 rtx src
= SET_SRC (x
);
1952 rtx outerdest
= dest
;
1954 while (GET_CODE (dest
) == SUBREG
|| GET_CODE (dest
) == STRICT_LOW_PART
1955 || GET_CODE (dest
) == SIGN_EXTRACT
1956 || GET_CODE (dest
) == ZERO_EXTRACT
)
1957 dest
= XEXP (dest
, 0);
1959 if (GET_CODE (src
) == SUBREG
)
1960 src
= XEXP (src
, 0);
1962 /* If VAR does not appear at the top level of the SET
1963 just scan the lower levels of the tree. */
1965 if (src
!= var
&& dest
!= var
)
1968 /* We will need to rerecognize this insn. */
1969 INSN_CODE (insn
) = -1;
1972 if (GET_CODE (outerdest
) == ZERO_EXTRACT
&& dest
== var
)
1974 /* Since this case will return, ensure we fixup all the
1976 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 1),
1977 insn
, replacements
);
1978 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (outerdest
, 2),
1979 insn
, replacements
);
1980 fixup_var_refs_1 (var
, promoted_mode
, &SET_SRC (x
),
1981 insn
, replacements
);
1983 tem
= XEXP (outerdest
, 0);
1985 /* Clean up (SUBREG:SI (MEM:mode ...) 0)
1986 that may appear inside a ZERO_EXTRACT.
1987 This was legitimate when the MEM was a REG. */
1988 if (GET_CODE (tem
) == SUBREG
1989 && SUBREG_REG (tem
) == var
)
1990 tem
= fixup_memory_subreg (tem
, insn
, 0);
1992 tem
= fixup_stack_1 (tem
, insn
);
1994 if (GET_CODE (XEXP (outerdest
, 1)) == CONST_INT
1995 && GET_CODE (XEXP (outerdest
, 2)) == CONST_INT
1996 && ! mode_dependent_address_p (XEXP (tem
, 0))
1997 && ! MEM_VOLATILE_P (tem
))
1999 enum machine_mode wanted_mode
2000 = insn_operand_mode
[(int) CODE_FOR_insv
][0];
2001 enum machine_mode is_mode
= GET_MODE (tem
);
2002 int width
= INTVAL (XEXP (outerdest
, 1));
2003 int pos
= INTVAL (XEXP (outerdest
, 2));
2005 /* If we have a narrower mode, we can do something. */
2006 if (GET_MODE_SIZE (wanted_mode
) < GET_MODE_SIZE (is_mode
))
2008 int offset
= pos
/ BITS_PER_UNIT
;
2009 rtx old_pos
= XEXP (outerdest
, 2);
2012 if (BYTES_BIG_ENDIAN
!= BITS_BIG_ENDIAN
)
2013 offset
= (GET_MODE_SIZE (is_mode
)
2014 - GET_MODE_SIZE (wanted_mode
) - offset
);
2016 pos
%= GET_MODE_BITSIZE (wanted_mode
);
2018 newmem
= gen_rtx (MEM
, wanted_mode
,
2019 plus_constant (XEXP (tem
, 0), offset
));
2020 RTX_UNCHANGING_P (newmem
) = RTX_UNCHANGING_P (tem
);
2021 MEM_VOLATILE_P (newmem
) = MEM_VOLATILE_P (tem
);
2022 MEM_IN_STRUCT_P (newmem
) = MEM_IN_STRUCT_P (tem
);
2024 /* Make the change and see if the insn remains valid. */
2025 INSN_CODE (insn
) = -1;
2026 XEXP (outerdest
, 0) = newmem
;
2027 XEXP (outerdest
, 2) = GEN_INT (pos
);
2029 if (recog_memoized (insn
) >= 0)
2032 /* Otherwise, restore old position. XEXP (x, 0) will be
2034 XEXP (outerdest
, 2) = old_pos
;
2038 /* If we get here, the bit-field store doesn't allow memory
2039 or isn't located at a constant position. Load the value into
2040 a register, do the store, and put it back into memory. */
2042 tem1
= gen_reg_rtx (GET_MODE (tem
));
2043 emit_insn_before (gen_move_insn (tem1
, tem
), insn
);
2044 emit_insn_after (gen_move_insn (tem
, tem1
), insn
);
2045 XEXP (outerdest
, 0) = tem1
;
2050 /* STRICT_LOW_PART is a no-op on memory references
2051 and it can cause combinations to be unrecognizable,
2054 if (dest
== var
&& GET_CODE (SET_DEST (x
)) == STRICT_LOW_PART
)
2055 SET_DEST (x
) = XEXP (SET_DEST (x
), 0);
2057 /* A valid insn to copy VAR into or out of a register
2058 must be left alone, to avoid an infinite loop here.
2059 If the reference to VAR is by a subreg, fix that up,
2060 since SUBREG is not valid for a memref.
2061 Also fix up the address of the stack slot.
2063 Note that we must not try to recognize the insn until
2064 after we know that we have valid addresses and no
2065 (subreg (mem ...) ...) constructs, since these interfere
2066 with determining the validity of the insn. */
2068 if ((SET_SRC (x
) == var
2069 || (GET_CODE (SET_SRC (x
)) == SUBREG
2070 && SUBREG_REG (SET_SRC (x
)) == var
))
2071 && (GET_CODE (SET_DEST (x
)) == REG
2072 || (GET_CODE (SET_DEST (x
)) == SUBREG
2073 && GET_CODE (SUBREG_REG (SET_DEST (x
))) == REG
))
2074 && GET_MODE (var
) == promoted_mode
2075 && x
== single_set (insn
))
2079 replacement
= find_fixup_replacement (replacements
, SET_SRC (x
));
2080 if (replacement
->new)
2081 SET_SRC (x
) = replacement
->new;
2082 else if (GET_CODE (SET_SRC (x
)) == SUBREG
)
2083 SET_SRC (x
) = replacement
->new
2084 = fixup_memory_subreg (SET_SRC (x
), insn
, 0);
2086 SET_SRC (x
) = replacement
->new
2087 = fixup_stack_1 (SET_SRC (x
), insn
);
2089 if (recog_memoized (insn
) >= 0)
2092 /* INSN is not valid, but we know that we want to
2093 copy SET_SRC (x) to SET_DEST (x) in some way. So
2094 we generate the move and see whether it requires more
2095 than one insn. If it does, we emit those insns and
2096 delete INSN. Otherwise, we an just replace the pattern
2097 of INSN; we have already verified above that INSN has
2098 no other function that to do X. */
2100 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2101 if (GET_CODE (pat
) == SEQUENCE
)
2103 emit_insn_after (pat
, insn
);
2104 PUT_CODE (insn
, NOTE
);
2105 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2106 NOTE_SOURCE_FILE (insn
) = 0;
2109 PATTERN (insn
) = pat
;
2114 if ((SET_DEST (x
) == var
2115 || (GET_CODE (SET_DEST (x
)) == SUBREG
2116 && SUBREG_REG (SET_DEST (x
)) == var
))
2117 && (GET_CODE (SET_SRC (x
)) == REG
2118 || (GET_CODE (SET_SRC (x
)) == SUBREG
2119 && GET_CODE (SUBREG_REG (SET_SRC (x
))) == REG
))
2120 && GET_MODE (var
) == promoted_mode
2121 && x
== single_set (insn
))
2125 if (GET_CODE (SET_DEST (x
)) == SUBREG
)
2126 SET_DEST (x
) = fixup_memory_subreg (SET_DEST (x
), insn
, 0);
2128 SET_DEST (x
) = fixup_stack_1 (SET_DEST (x
), insn
);
2130 if (recog_memoized (insn
) >= 0)
2133 pat
= gen_move_insn (SET_DEST (x
), SET_SRC (x
));
2134 if (GET_CODE (pat
) == SEQUENCE
)
2136 emit_insn_after (pat
, insn
);
2137 PUT_CODE (insn
, NOTE
);
2138 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2139 NOTE_SOURCE_FILE (insn
) = 0;
2142 PATTERN (insn
) = pat
;
2147 /* Otherwise, storing into VAR must be handled specially
2148 by storing into a temporary and copying that into VAR
2149 with a new insn after this one. Note that this case
2150 will be used when storing into a promoted scalar since
2151 the insn will now have different modes on the input
2152 and output and hence will be invalid (except for the case
2153 of setting it to a constant, which does not need any
2154 change if it is valid). We generate extra code in that case,
2155 but combine.c will eliminate it. */
2160 rtx fixeddest
= SET_DEST (x
);
2162 /* STRICT_LOW_PART can be discarded, around a MEM. */
2163 if (GET_CODE (fixeddest
) == STRICT_LOW_PART
)
2164 fixeddest
= XEXP (fixeddest
, 0);
2165 /* Convert (SUBREG (MEM)) to a MEM in a changed mode. */
2166 if (GET_CODE (fixeddest
) == SUBREG
)
2168 fixeddest
= fixup_memory_subreg (fixeddest
, insn
, 0);
2169 promoted_mode
= GET_MODE (fixeddest
);
2172 fixeddest
= fixup_stack_1 (fixeddest
, insn
);
2174 temp
= gen_reg_rtx (promoted_mode
);
2176 emit_insn_after (gen_move_insn (fixeddest
,
2177 gen_lowpart (GET_MODE (fixeddest
),
2181 SET_DEST (x
) = temp
;
2186 /* Nothing special about this RTX; fix its operands. */
2188 fmt
= GET_RTX_FORMAT (code
);
2189 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2192 fixup_var_refs_1 (var
, promoted_mode
, &XEXP (x
, i
), insn
, replacements
);
2196 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2197 fixup_var_refs_1 (var
, promoted_mode
, &XVECEXP (x
, i
, j
),
2198 insn
, replacements
);
2203 /* Given X, an rtx of the form (SUBREG:m1 (MEM:m2 addr)),
2204 return an rtx (MEM:m1 newaddr) which is equivalent.
2205 If any insns must be emitted to compute NEWADDR, put them before INSN.
2207 UNCRITICAL nonzero means accept paradoxical subregs.
2208 This is used for subregs found inside REG_NOTES. */
2211 fixup_memory_subreg (x
, insn
, uncritical
)
2216 int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2217 rtx addr
= XEXP (SUBREG_REG (x
), 0);
2218 enum machine_mode mode
= GET_MODE (x
);
2221 /* Paradoxical SUBREGs are usually invalid during RTL generation. */
2222 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
)))
2226 if (BYTES_BIG_ENDIAN
)
2227 offset
+= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))))
2228 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (mode
)));
2229 addr
= plus_constant (addr
, offset
);
2230 if (!flag_force_addr
&& memory_address_p (mode
, addr
))
2231 /* Shortcut if no insns need be emitted. */
2232 return change_address (SUBREG_REG (x
), mode
, addr
);
2234 result
= change_address (SUBREG_REG (x
), mode
, addr
);
2235 emit_insn_before (gen_sequence (), insn
);
2240 /* Do fixup_memory_subreg on all (SUBREG (MEM ...) ...) contained in X.
2241 Replace subexpressions of X in place.
2242 If X itself is a (SUBREG (MEM ...) ...), return the replacement expression.
2243 Otherwise return X, with its contents possibly altered.
2245 If any insns must be emitted to compute NEWADDR, put them before INSN.
2247 UNCRITICAL is as in fixup_memory_subreg. */
2250 walk_fixup_memory_subreg (x
, insn
, uncritical
)
2255 register enum rtx_code code
;
2262 code
= GET_CODE (x
);
2264 if (code
== SUBREG
&& GET_CODE (SUBREG_REG (x
)) == MEM
)
2265 return fixup_memory_subreg (x
, insn
, uncritical
);
2267 /* Nothing special about this RTX; fix its operands. */
2269 fmt
= GET_RTX_FORMAT (code
);
2270 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2273 XEXP (x
, i
) = walk_fixup_memory_subreg (XEXP (x
, i
), insn
, uncritical
);
2277 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2279 = walk_fixup_memory_subreg (XVECEXP (x
, i
, j
), insn
, uncritical
);
2285 /* For each memory ref within X, if it refers to a stack slot
2286 with an out of range displacement, put the address in a temp register
2287 (emitting new insns before INSN to load these registers)
2288 and alter the memory ref to use that register.
2289 Replace each such MEM rtx with a copy, to avoid clobberage. */
2292 fixup_stack_1 (x
, insn
)
2297 register RTX_CODE code
= GET_CODE (x
);
2302 register rtx ad
= XEXP (x
, 0);
2303 /* If we have address of a stack slot but it's not valid
2304 (displacement is too large), compute the sum in a register. */
2305 if (GET_CODE (ad
) == PLUS
2306 && GET_CODE (XEXP (ad
, 0)) == REG
2307 && ((REGNO (XEXP (ad
, 0)) >= FIRST_VIRTUAL_REGISTER
2308 && REGNO (XEXP (ad
, 0)) <= LAST_VIRTUAL_REGISTER
)
2309 || XEXP (ad
, 0) == current_function_internal_arg_pointer
)
2310 && GET_CODE (XEXP (ad
, 1)) == CONST_INT
)
2313 if (memory_address_p (GET_MODE (x
), ad
))
2317 temp
= copy_to_reg (ad
);
2318 seq
= gen_sequence ();
2320 emit_insn_before (seq
, insn
);
2321 return change_address (x
, VOIDmode
, temp
);
2326 fmt
= GET_RTX_FORMAT (code
);
2327 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
2330 XEXP (x
, i
) = fixup_stack_1 (XEXP (x
, i
), insn
);
2334 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2335 XVECEXP (x
, i
, j
) = fixup_stack_1 (XVECEXP (x
, i
, j
), insn
);
2341 /* Optimization: a bit-field instruction whose field
2342 happens to be a byte or halfword in memory
2343 can be changed to a move instruction.
2345 We call here when INSN is an insn to examine or store into a bit-field.
2346 BODY is the SET-rtx to be altered.
2348 EQUIV_MEM is the table `reg_equiv_mem' if that is available; else 0.
2349 (Currently this is called only from function.c, and EQUIV_MEM
2353 optimize_bit_field (body
, insn
, equiv_mem
)
2358 register rtx bitfield
;
2361 enum machine_mode mode
;
2363 if (GET_CODE (SET_DEST (body
)) == SIGN_EXTRACT
2364 || GET_CODE (SET_DEST (body
)) == ZERO_EXTRACT
)
2365 bitfield
= SET_DEST (body
), destflag
= 1;
2367 bitfield
= SET_SRC (body
), destflag
= 0;
2369 /* First check that the field being stored has constant size and position
2370 and is in fact a byte or halfword suitably aligned. */
2372 if (GET_CODE (XEXP (bitfield
, 1)) == CONST_INT
2373 && GET_CODE (XEXP (bitfield
, 2)) == CONST_INT
2374 && ((mode
= mode_for_size (INTVAL (XEXP (bitfield
, 1)), MODE_INT
, 1))
2376 && INTVAL (XEXP (bitfield
, 2)) % INTVAL (XEXP (bitfield
, 1)) == 0)
2378 register rtx memref
= 0;
2380 /* Now check that the containing word is memory, not a register,
2381 and that it is safe to change the machine mode. */
2383 if (GET_CODE (XEXP (bitfield
, 0)) == MEM
)
2384 memref
= XEXP (bitfield
, 0);
2385 else if (GET_CODE (XEXP (bitfield
, 0)) == REG
2387 memref
= equiv_mem
[REGNO (XEXP (bitfield
, 0))];
2388 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2389 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == MEM
)
2390 memref
= SUBREG_REG (XEXP (bitfield
, 0));
2391 else if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
2393 && GET_CODE (SUBREG_REG (XEXP (bitfield
, 0))) == REG
)
2394 memref
= equiv_mem
[REGNO (SUBREG_REG (XEXP (bitfield
, 0)))];
2397 && ! mode_dependent_address_p (XEXP (memref
, 0))
2398 && ! MEM_VOLATILE_P (memref
))
2400 /* Now adjust the address, first for any subreg'ing
2401 that we are now getting rid of,
2402 and then for which byte of the word is wanted. */
2404 register int offset
= INTVAL (XEXP (bitfield
, 2));
2407 /* Adjust OFFSET to count bits from low-address byte. */
2408 if (BITS_BIG_ENDIAN
!= BYTES_BIG_ENDIAN
)
2409 offset
= (GET_MODE_BITSIZE (GET_MODE (XEXP (bitfield
, 0)))
2410 - offset
- INTVAL (XEXP (bitfield
, 1)));
2412 /* Adjust OFFSET to count bytes from low-address byte. */
2413 offset
/= BITS_PER_UNIT
;
2414 if (GET_CODE (XEXP (bitfield
, 0)) == SUBREG
)
2416 offset
+= SUBREG_WORD (XEXP (bitfield
, 0)) * UNITS_PER_WORD
;
2417 if (BYTES_BIG_ENDIAN
)
2418 offset
-= (MIN (UNITS_PER_WORD
,
2419 GET_MODE_SIZE (GET_MODE (XEXP (bitfield
, 0))))
2420 - MIN (UNITS_PER_WORD
,
2421 GET_MODE_SIZE (GET_MODE (memref
))));
2425 memref
= change_address (memref
, mode
,
2426 plus_constant (XEXP (memref
, 0), offset
));
2427 insns
= get_insns ();
2429 emit_insns_before (insns
, insn
);
2431 /* Store this memory reference where
2432 we found the bit field reference. */
2436 validate_change (insn
, &SET_DEST (body
), memref
, 1);
2437 if (! CONSTANT_ADDRESS_P (SET_SRC (body
)))
2439 rtx src
= SET_SRC (body
);
2440 while (GET_CODE (src
) == SUBREG
2441 && SUBREG_WORD (src
) == 0)
2442 src
= SUBREG_REG (src
);
2443 if (GET_MODE (src
) != GET_MODE (memref
))
2444 src
= gen_lowpart (GET_MODE (memref
), SET_SRC (body
));
2445 validate_change (insn
, &SET_SRC (body
), src
, 1);
2447 else if (GET_MODE (SET_SRC (body
)) != VOIDmode
2448 && GET_MODE (SET_SRC (body
)) != GET_MODE (memref
))
2449 /* This shouldn't happen because anything that didn't have
2450 one of these modes should have got converted explicitly
2451 and then referenced through a subreg.
2452 This is so because the original bit-field was
2453 handled by agg_mode and so its tree structure had
2454 the same mode that memref now has. */
2459 rtx dest
= SET_DEST (body
);
2461 while (GET_CODE (dest
) == SUBREG
2462 && SUBREG_WORD (dest
) == 0
2463 && (GET_MODE_CLASS (GET_MODE (dest
))
2464 == GET_MODE_CLASS (GET_MODE (SUBREG_REG (dest
)))))
2465 dest
= SUBREG_REG (dest
);
2467 validate_change (insn
, &SET_DEST (body
), dest
, 1);
2469 if (GET_MODE (dest
) == GET_MODE (memref
))
2470 validate_change (insn
, &SET_SRC (body
), memref
, 1);
2473 /* Convert the mem ref to the destination mode. */
2474 rtx newreg
= gen_reg_rtx (GET_MODE (dest
));
2477 convert_move (newreg
, memref
,
2478 GET_CODE (SET_SRC (body
)) == ZERO_EXTRACT
);
2482 validate_change (insn
, &SET_SRC (body
), newreg
, 1);
2486 /* See if we can convert this extraction or insertion into
2487 a simple move insn. We might not be able to do so if this
2488 was, for example, part of a PARALLEL.
2490 If we succeed, write out any needed conversions. If we fail,
2491 it is hard to guess why we failed, so don't do anything
2492 special; just let the optimization be suppressed. */
2494 if (apply_change_group () && seq
)
2495 emit_insns_before (seq
, insn
);
2500 /* These routines are responsible for converting virtual register references
2501 to the actual hard register references once RTL generation is complete.
2503 The following four variables are used for communication between the
2504 routines. They contain the offsets of the virtual registers from their
2505 respective hard registers. */
2507 static int in_arg_offset
;
2508 static int var_offset
;
2509 static int dynamic_offset
;
2510 static int out_arg_offset
;
2512 /* In most machines, the stack pointer register is equivalent to the bottom
2515 #ifndef STACK_POINTER_OFFSET
2516 #define STACK_POINTER_OFFSET 0
2519 /* If not defined, pick an appropriate default for the offset of dynamically
2520 allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
2521 REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
2523 #ifndef STACK_DYNAMIC_OFFSET
2525 #ifdef ACCUMULATE_OUTGOING_ARGS
2526 /* The bottom of the stack points to the actual arguments. If
2527 REG_PARM_STACK_SPACE is defined, this includes the space for the register
2528 parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
2529 stack space for register parameters is not pushed by the caller, but
2530 rather part of the fixed stack areas and hence not included in
2531 `current_function_outgoing_args_size'. Nevertheless, we must allow
2532 for it when allocating stack dynamic objects. */
2534 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2535 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2536 (current_function_outgoing_args_size \
2537 + REG_PARM_STACK_SPACE (FNDECL) + (STACK_POINTER_OFFSET))
2540 #define STACK_DYNAMIC_OFFSET(FNDECL) \
2541 (current_function_outgoing_args_size + (STACK_POINTER_OFFSET))
2545 #define STACK_DYNAMIC_OFFSET(FNDECL) STACK_POINTER_OFFSET
2549 /* Pass through the INSNS of function FNDECL and convert virtual register
2550 references to hard register references. */
2553 instantiate_virtual_regs (fndecl
, insns
)
2559 /* Compute the offsets to use for this function. */
2560 in_arg_offset
= FIRST_PARM_OFFSET (fndecl
);
2561 var_offset
= STARTING_FRAME_OFFSET
;
2562 dynamic_offset
= STACK_DYNAMIC_OFFSET (fndecl
);
2563 out_arg_offset
= STACK_POINTER_OFFSET
;
2565 /* Scan all variables and parameters of this function. For each that is
2566 in memory, instantiate all virtual registers if the result is a valid
2567 address. If not, we do it later. That will handle most uses of virtual
2568 regs on many machines. */
2569 instantiate_decls (fndecl
, 1);
2571 /* Initialize recognition, indicating that volatile is OK. */
2574 /* Scan through all the insns, instantiating every virtual register still
2576 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
2577 if (GET_CODE (insn
) == INSN
|| GET_CODE (insn
) == JUMP_INSN
2578 || GET_CODE (insn
) == CALL_INSN
)
2580 instantiate_virtual_regs_1 (&PATTERN (insn
), insn
, 1);
2581 instantiate_virtual_regs_1 (®_NOTES (insn
), NULL_RTX
, 0);
2584 /* Now instantiate the remaining register equivalences for debugging info.
2585 These will not be valid addresses. */
2586 instantiate_decls (fndecl
, 0);
2588 /* Indicate that, from now on, assign_stack_local should use
2589 frame_pointer_rtx. */
2590 virtuals_instantiated
= 1;
2593 /* Scan all decls in FNDECL (both variables and parameters) and instantiate
2594 all virtual registers in their DECL_RTL's.
2596 If VALID_ONLY, do this only if the resulting address is still valid.
2597 Otherwise, always do it. */
2600 instantiate_decls (fndecl
, valid_only
)
2606 if (DECL_SAVED_INSNS (fndecl
))
2607 /* When compiling an inline function, the obstack used for
2608 rtl allocation is the maybepermanent_obstack. Calling
2609 `resume_temporary_allocation' switches us back to that
2610 obstack while we process this function's parameters. */
2611 resume_temporary_allocation ();
2613 /* Process all parameters of the function. */
2614 for (decl
= DECL_ARGUMENTS (fndecl
); decl
; decl
= TREE_CHAIN (decl
))
2616 instantiate_decl (DECL_RTL (decl
), int_size_in_bytes (TREE_TYPE (decl
)),
2618 instantiate_decl (DECL_INCOMING_RTL (decl
),
2619 int_size_in_bytes (TREE_TYPE (decl
)), valid_only
);
2622 /* Now process all variables defined in the function or its subblocks. */
2623 instantiate_decls_1 (DECL_INITIAL (fndecl
), valid_only
);
2625 if (DECL_INLINE (fndecl
) || DECL_DEFER_OUTPUT (fndecl
))
2627 /* Save all rtl allocated for this function by raising the
2628 high-water mark on the maybepermanent_obstack. */
2630 /* All further rtl allocation is now done in the current_obstack. */
2631 rtl_in_current_obstack ();
2635 /* Subroutine of instantiate_decls: Process all decls in the given
2636 BLOCK node and all its subblocks. */
2639 instantiate_decls_1 (let
, valid_only
)
2645 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
2646 instantiate_decl (DECL_RTL (t
), int_size_in_bytes (TREE_TYPE (t
)),
2649 /* Process all subblocks. */
2650 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= TREE_CHAIN (t
))
2651 instantiate_decls_1 (t
, valid_only
);
2654 /* Subroutine of the preceding procedures: Given RTL representing a
2655 decl and the size of the object, do any instantiation required.
2657 If VALID_ONLY is non-zero, it means that the RTL should only be
2658 changed if the new address is valid. */
2661 instantiate_decl (x
, size
, valid_only
)
2666 enum machine_mode mode
;
2669 /* If this is not a MEM, no need to do anything. Similarly if the
2670 address is a constant or a register that is not a virtual register. */
2672 if (x
== 0 || GET_CODE (x
) != MEM
)
2676 if (CONSTANT_P (addr
)
2677 || (GET_CODE (addr
) == REG
2678 && (REGNO (addr
) < FIRST_VIRTUAL_REGISTER
2679 || REGNO (addr
) > LAST_VIRTUAL_REGISTER
)))
2682 /* If we should only do this if the address is valid, copy the address.
2683 We need to do this so we can undo any changes that might make the
2684 address invalid. This copy is unfortunate, but probably can't be
2688 addr
= copy_rtx (addr
);
2690 instantiate_virtual_regs_1 (&addr
, NULL_RTX
, 0);
2694 /* Now verify that the resulting address is valid for every integer or
2695 floating-point mode up to and including SIZE bytes long. We do this
2696 since the object might be accessed in any mode and frame addresses
2699 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2700 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= size
;
2701 mode
= GET_MODE_WIDER_MODE (mode
))
2702 if (! memory_address_p (mode
, addr
))
2705 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
);
2706 mode
!= VOIDmode
&& GET_MODE_SIZE (mode
) <= size
;
2707 mode
= GET_MODE_WIDER_MODE (mode
))
2708 if (! memory_address_p (mode
, addr
))
2712 /* Put back the address now that we have updated it and we either know
2713 it is valid or we don't care whether it is valid. */
2718 /* Given a pointer to a piece of rtx and an optional pointer to the
2719 containing object, instantiate any virtual registers present in it.
2721 If EXTRA_INSNS, we always do the replacement and generate
2722 any extra insns before OBJECT. If it zero, we do nothing if replacement
2725 Return 1 if we either had nothing to do or if we were able to do the
2726 needed replacement. Return 0 otherwise; we only return zero if
2727 EXTRA_INSNS is zero.
2729 We first try some simple transformations to avoid the creation of extra
2733 instantiate_virtual_regs_1 (loc
, object
, extra_insns
)
2747 /* Re-start here to avoid recursion in common cases. */
2754 code
= GET_CODE (x
);
2756 /* Check for some special cases. */
2773 /* We are allowed to set the virtual registers. This means that
2774 that the actual register should receive the source minus the
2775 appropriate offset. This is used, for example, in the handling
2776 of non-local gotos. */
2777 if (SET_DEST (x
) == virtual_incoming_args_rtx
)
2778 new = arg_pointer_rtx
, offset
= - in_arg_offset
;
2779 else if (SET_DEST (x
) == virtual_stack_vars_rtx
)
2780 new = frame_pointer_rtx
, offset
= - var_offset
;
2781 else if (SET_DEST (x
) == virtual_stack_dynamic_rtx
)
2782 new = stack_pointer_rtx
, offset
= - dynamic_offset
;
2783 else if (SET_DEST (x
) == virtual_outgoing_args_rtx
)
2784 new = stack_pointer_rtx
, offset
= - out_arg_offset
;
2788 /* The only valid sources here are PLUS or REG. Just do
2789 the simplest possible thing to handle them. */
2790 if (GET_CODE (SET_SRC (x
)) != REG
2791 && GET_CODE (SET_SRC (x
)) != PLUS
)
2795 if (GET_CODE (SET_SRC (x
)) != REG
)
2796 temp
= force_operand (SET_SRC (x
), NULL_RTX
);
2799 temp
= force_operand (plus_constant (temp
, offset
), NULL_RTX
);
2803 emit_insns_before (seq
, object
);
2806 if (!validate_change (object
, &SET_SRC (x
), temp
, 0)
2813 instantiate_virtual_regs_1 (&SET_DEST (x
), object
, extra_insns
);
2818 /* Handle special case of virtual register plus constant. */
2819 if (CONSTANT_P (XEXP (x
, 1)))
2821 rtx old
, new_offset
;
2823 /* Check for (plus (plus VIRT foo) (const_int)) first. */
2824 if (GET_CODE (XEXP (x
, 0)) == PLUS
)
2826 rtx inner
= XEXP (XEXP (x
, 0), 0);
2828 if (inner
== virtual_incoming_args_rtx
)
2829 new = arg_pointer_rtx
, offset
= in_arg_offset
;
2830 else if (inner
== virtual_stack_vars_rtx
)
2831 new = frame_pointer_rtx
, offset
= var_offset
;
2832 else if (inner
== virtual_stack_dynamic_rtx
)
2833 new = stack_pointer_rtx
, offset
= dynamic_offset
;
2834 else if (inner
== virtual_outgoing_args_rtx
)
2835 new = stack_pointer_rtx
, offset
= out_arg_offset
;
2842 instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 1), object
,
2844 new = gen_rtx (PLUS
, Pmode
, new, XEXP (XEXP (x
, 0), 1));
2847 else if (XEXP (x
, 0) == virtual_incoming_args_rtx
)
2848 new = arg_pointer_rtx
, offset
= in_arg_offset
;
2849 else if (XEXP (x
, 0) == virtual_stack_vars_rtx
)
2850 new = frame_pointer_rtx
, offset
= var_offset
;
2851 else if (XEXP (x
, 0) == virtual_stack_dynamic_rtx
)
2852 new = stack_pointer_rtx
, offset
= dynamic_offset
;
2853 else if (XEXP (x
, 0) == virtual_outgoing_args_rtx
)
2854 new = stack_pointer_rtx
, offset
= out_arg_offset
;
2857 /* We know the second operand is a constant. Unless the
2858 first operand is a REG (which has been already checked),
2859 it needs to be checked. */
2860 if (GET_CODE (XEXP (x
, 0)) != REG
)
2868 new_offset
= plus_constant (XEXP (x
, 1), offset
);
2870 /* If the new constant is zero, try to replace the sum with just
2872 if (new_offset
== const0_rtx
2873 && validate_change (object
, loc
, new, 0))
2876 /* Next try to replace the register and new offset.
2877 There are two changes to validate here and we can't assume that
2878 in the case of old offset equals new just changing the register
2879 will yield a valid insn. In the interests of a little efficiency,
2880 however, we only call validate change once (we don't queue up the
2881 changes and then call apply_change_group). */
2885 ? ! validate_change (object
, &XEXP (x
, 0), new, 0)
2886 : (XEXP (x
, 0) = new,
2887 ! validate_change (object
, &XEXP (x
, 1), new_offset
, 0)))
2895 /* Otherwise copy the new constant into a register and replace
2896 constant with that register. */
2897 temp
= gen_reg_rtx (Pmode
);
2899 if (validate_change (object
, &XEXP (x
, 1), temp
, 0))
2900 emit_insn_before (gen_move_insn (temp
, new_offset
), object
);
2903 /* If that didn't work, replace this expression with a
2904 register containing the sum. */
2907 new = gen_rtx (PLUS
, Pmode
, new, new_offset
);
2910 temp
= force_operand (new, NULL_RTX
);
2914 emit_insns_before (seq
, object
);
2915 if (! validate_change (object
, loc
, temp
, 0)
2916 && ! validate_replace_rtx (x
, temp
, object
))
2924 /* Fall through to generic two-operand expression case. */
2930 case DIV
: case UDIV
:
2931 case MOD
: case UMOD
:
2932 case AND
: case IOR
: case XOR
:
2933 case ROTATERT
: case ROTATE
:
2934 case ASHIFTRT
: case LSHIFTRT
: case ASHIFT
:
2936 case GE
: case GT
: case GEU
: case GTU
:
2937 case LE
: case LT
: case LEU
: case LTU
:
2938 if (XEXP (x
, 1) && ! CONSTANT_P (XEXP (x
, 1)))
2939 instantiate_virtual_regs_1 (&XEXP (x
, 1), object
, extra_insns
);
2944 /* Most cases of MEM that convert to valid addresses have already been
2945 handled by our scan of decls. The only special handling we
2946 need here is to make a copy of the rtx to ensure it isn't being
2947 shared if we have to change it to a pseudo.
2949 If the rtx is a simple reference to an address via a virtual register,
2950 it can potentially be shared. In such cases, first try to make it
2951 a valid address, which can also be shared. Otherwise, copy it and
2954 First check for common cases that need no processing. These are
2955 usually due to instantiation already being done on a previous instance
2959 if (CONSTANT_ADDRESS_P (temp
)
2960 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
2961 || temp
== arg_pointer_rtx
2963 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2964 || temp
== hard_frame_pointer_rtx
2966 || temp
== frame_pointer_rtx
)
2969 if (GET_CODE (temp
) == PLUS
2970 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
2971 && (XEXP (temp
, 0) == frame_pointer_rtx
2972 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
2973 || XEXP (temp
, 0) == hard_frame_pointer_rtx
2975 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
2976 || XEXP (temp
, 0) == arg_pointer_rtx
2981 if (temp
== virtual_stack_vars_rtx
2982 || temp
== virtual_incoming_args_rtx
2983 || (GET_CODE (temp
) == PLUS
2984 && CONSTANT_ADDRESS_P (XEXP (temp
, 1))
2985 && (XEXP (temp
, 0) == virtual_stack_vars_rtx
2986 || XEXP (temp
, 0) == virtual_incoming_args_rtx
)))
2988 /* This MEM may be shared. If the substitution can be done without
2989 the need to generate new pseudos, we want to do it in place
2990 so all copies of the shared rtx benefit. The call below will
2991 only make substitutions if the resulting address is still
2994 Note that we cannot pass X as the object in the recursive call
2995 since the insn being processed may not allow all valid
2996 addresses. However, if we were not passed on object, we can
2997 only modify X without copying it if X will have a valid
3000 ??? Also note that this can still lose if OBJECT is an insn that
3001 has less restrictions on an address that some other insn.
3002 In that case, we will modify the shared address. This case
3003 doesn't seem very likely, though. One case where this could
3004 happen is in the case of a USE or CLOBBER reference, but we
3005 take care of that below. */
3007 if (instantiate_virtual_regs_1 (&XEXP (x
, 0),
3008 object
? object
: x
, 0))
3011 /* Otherwise make a copy and process that copy. We copy the entire
3012 RTL expression since it might be a PLUS which could also be
3014 *loc
= x
= copy_rtx (x
);
3017 /* Fall through to generic unary operation case. */
3019 case STRICT_LOW_PART
:
3021 case PRE_DEC
: case PRE_INC
: case POST_DEC
: case POST_INC
:
3022 case SIGN_EXTEND
: case ZERO_EXTEND
:
3023 case TRUNCATE
: case FLOAT_EXTEND
: case FLOAT_TRUNCATE
:
3024 case FLOAT
: case FIX
:
3025 case UNSIGNED_FIX
: case UNSIGNED_FLOAT
:
3029 /* These case either have just one operand or we know that we need not
3030 check the rest of the operands. */
3036 /* If the operand is a MEM, see if the change is a valid MEM. If not,
3037 go ahead and make the invalid one, but do it to a copy. For a REG,
3038 just make the recursive call, since there's no chance of a problem. */
3040 if ((GET_CODE (XEXP (x
, 0)) == MEM
3041 && instantiate_virtual_regs_1 (&XEXP (XEXP (x
, 0), 0), XEXP (x
, 0),
3043 || (GET_CODE (XEXP (x
, 0)) == REG
3044 && instantiate_virtual_regs_1 (&XEXP (x
, 0), 0, 0)))
3047 XEXP (x
, 0) = copy_rtx (XEXP (x
, 0));
3052 /* Try to replace with a PLUS. If that doesn't work, compute the sum
3053 in front of this insn and substitute the temporary. */
3054 if (x
== virtual_incoming_args_rtx
)
3055 new = arg_pointer_rtx
, offset
= in_arg_offset
;
3056 else if (x
== virtual_stack_vars_rtx
)
3057 new = frame_pointer_rtx
, offset
= var_offset
;
3058 else if (x
== virtual_stack_dynamic_rtx
)
3059 new = stack_pointer_rtx
, offset
= dynamic_offset
;
3060 else if (x
== virtual_outgoing_args_rtx
)
3061 new = stack_pointer_rtx
, offset
= out_arg_offset
;
3065 temp
= plus_constant (new, offset
);
3066 if (!validate_change (object
, loc
, temp
, 0))
3072 temp
= force_operand (temp
, NULL_RTX
);
3076 emit_insns_before (seq
, object
);
3077 if (! validate_change (object
, loc
, temp
, 0)
3078 && ! validate_replace_rtx (x
, temp
, object
))
3086 /* Scan all subexpressions. */
3087 fmt
= GET_RTX_FORMAT (code
);
3088 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
3091 if (!instantiate_virtual_regs_1 (&XEXP (x
, i
), object
, extra_insns
))
3094 else if (*fmt
== 'E')
3095 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3096 if (! instantiate_virtual_regs_1 (&XVECEXP (x
, i
, j
), object
,
3103 /* Optimization: assuming this function does not receive nonlocal gotos,
3104 delete the handlers for such, as well as the insns to establish
3105 and disestablish them. */
3111 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3113 /* Delete the handler by turning off the flag that would
3114 prevent jump_optimize from deleting it.
3115 Also permit deletion of the nonlocal labels themselves
3116 if nothing local refers to them. */
3117 if (GET_CODE (insn
) == CODE_LABEL
)
3121 LABEL_PRESERVE_P (insn
) = 0;
3123 /* Remove it from the nonlocal_label list, to avoid confusing
3125 for (t
= nonlocal_labels
, last_t
= 0; t
;
3126 last_t
= t
, t
= TREE_CHAIN (t
))
3127 if (DECL_RTL (TREE_VALUE (t
)) == insn
)
3132 nonlocal_labels
= TREE_CHAIN (nonlocal_labels
);
3134 TREE_CHAIN (last_t
) = TREE_CHAIN (t
);
3137 if (GET_CODE (insn
) == INSN
3138 && ((nonlocal_goto_handler_slot
!= 0
3139 && reg_mentioned_p (nonlocal_goto_handler_slot
, PATTERN (insn
)))
3140 || (nonlocal_goto_stack_level
!= 0
3141 && reg_mentioned_p (nonlocal_goto_stack_level
,
3147 /* Return a list (chain of EXPR_LIST nodes) for the nonlocal labels
3148 of the current function. */
3151 nonlocal_label_rtx_list ()
3156 for (t
= nonlocal_labels
; t
; t
= TREE_CHAIN (t
))
3157 x
= gen_rtx (EXPR_LIST
, VOIDmode
, label_rtx (TREE_VALUE (t
)), x
);
3162 /* Output a USE for any register use in RTL.
3163 This is used with -noreg to mark the extent of lifespan
3164 of any registers used in a user-visible variable's DECL_RTL. */
3170 if (GET_CODE (rtl
) == REG
)
3171 /* This is a register variable. */
3172 emit_insn (gen_rtx (USE
, VOIDmode
, rtl
));
3173 else if (GET_CODE (rtl
) == MEM
3174 && GET_CODE (XEXP (rtl
, 0)) == REG
3175 && (REGNO (XEXP (rtl
, 0)) < FIRST_VIRTUAL_REGISTER
3176 || REGNO (XEXP (rtl
, 0)) > LAST_VIRTUAL_REGISTER
)
3177 && XEXP (rtl
, 0) != current_function_internal_arg_pointer
)
3178 /* This is a variable-sized structure. */
3179 emit_insn (gen_rtx (USE
, VOIDmode
, XEXP (rtl
, 0)));
3182 /* Like use_variable except that it outputs the USEs after INSN
3183 instead of at the end of the insn-chain. */
3186 use_variable_after (rtl
, insn
)
3189 if (GET_CODE (rtl
) == REG
)
3190 /* This is a register variable. */
3191 emit_insn_after (gen_rtx (USE
, VOIDmode
, rtl
), insn
);
3192 else if (GET_CODE (rtl
) == MEM
3193 && GET_CODE (XEXP (rtl
, 0)) == REG
3194 && (REGNO (XEXP (rtl
, 0)) < FIRST_VIRTUAL_REGISTER
3195 || REGNO (XEXP (rtl
, 0)) > LAST_VIRTUAL_REGISTER
)
3196 && XEXP (rtl
, 0) != current_function_internal_arg_pointer
)
3197 /* This is a variable-sized structure. */
3198 emit_insn_after (gen_rtx (USE
, VOIDmode
, XEXP (rtl
, 0)), insn
);
3204 return max_parm_reg
;
3207 /* Return the first insn following those generated by `assign_parms'. */
3210 get_first_nonparm_insn ()
3213 return NEXT_INSN (last_parm_insn
);
3214 return get_insns ();
3217 /* Return the first NOTE_INSN_BLOCK_BEG note in the function.
3218 Crash if there is none. */
3221 get_first_block_beg ()
3223 register rtx searcher
;
3224 register rtx insn
= get_first_nonparm_insn ();
3226 for (searcher
= insn
; searcher
; searcher
= NEXT_INSN (searcher
))
3227 if (GET_CODE (searcher
) == NOTE
3228 && NOTE_LINE_NUMBER (searcher
) == NOTE_INSN_BLOCK_BEG
)
3231 abort (); /* Invalid call to this function. (See comments above.) */
3235 /* Return 1 if EXP is an aggregate type (or a value with aggregate type).
3236 This means a type for which function calls must pass an address to the
3237 function or get an address back from the function.
3238 EXP may be a type node or an expression (whose type is tested). */
3241 aggregate_value_p (exp
)
3244 int i
, regno
, nregs
;
3247 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 't')
3250 type
= TREE_TYPE (exp
);
3252 if (RETURN_IN_MEMORY (type
))
3254 /* Types that are TREE_ADDRESSABLE must be contructed in memory,
3255 and thus can't be returned in registers. */
3256 if (TREE_ADDRESSABLE (type
))
3258 if (flag_pcc_struct_return
&& AGGREGATE_TYPE_P (type
))
3260 /* Make sure we have suitable call-clobbered regs to return
3261 the value in; if not, we must return it in memory. */
3262 reg
= hard_function_value (type
, 0);
3264 /* If we have something other than a REG (e.g. a PARALLEL), then assume
3266 if (GET_CODE (reg
) != REG
)
3269 regno
= REGNO (reg
);
3270 nregs
= HARD_REGNO_NREGS (regno
, TYPE_MODE (type
));
3271 for (i
= 0; i
< nregs
; i
++)
3272 if (! call_used_regs
[regno
+ i
])
3277 /* Assign RTL expressions to the function's parameters.
3278 This may involve copying them into registers and using
3279 those registers as the RTL for them.
3281 If SECOND_TIME is non-zero it means that this function is being
3282 called a second time. This is done by integrate.c when a function's
3283 compilation is deferred. We need to come back here in case the
3284 FUNCTION_ARG macro computes items needed for the rest of the compilation
3285 (such as changing which registers are fixed or caller-saved). But suppress
3286 writing any insns or setting DECL_RTL of anything in this case. */
3289 assign_parms (fndecl
, second_time
)
3294 register rtx entry_parm
= 0;
3295 register rtx stack_parm
= 0;
3296 CUMULATIVE_ARGS args_so_far
;
3297 enum machine_mode promoted_mode
, passed_mode
;
3298 enum machine_mode nominal_mode
, promoted_nominal_mode
;
3300 /* Total space needed so far for args on the stack,
3301 given as a constant and a tree-expression. */
3302 struct args_size stack_args_size
;
3303 tree fntype
= TREE_TYPE (fndecl
);
3304 tree fnargs
= DECL_ARGUMENTS (fndecl
);
3305 /* This is used for the arg pointer when referring to stack args. */
3306 rtx internal_arg_pointer
;
3307 /* This is a dummy PARM_DECL that we used for the function result if
3308 the function returns a structure. */
3309 tree function_result_decl
= 0;
3310 int nparmregs
= list_length (fnargs
) + LAST_VIRTUAL_REGISTER
+ 1;
3311 int varargs_setup
= 0;
3312 rtx conversion_insns
= 0;
3314 /* Nonzero if the last arg is named `__builtin_va_alist',
3315 which is used on some machines for old-fashioned non-ANSI varargs.h;
3316 this should be stuck onto the stack as if it had arrived there. */
3318 = (current_function_varargs
3320 && (parm
= tree_last (fnargs
)) != 0
3322 && (! strcmp (IDENTIFIER_POINTER (DECL_NAME (parm
)),
3323 "__builtin_va_alist")));
3325 /* Nonzero if function takes extra anonymous args.
3326 This means the last named arg must be on the stack
3327 right before the anonymous ones. */
3329 = (TYPE_ARG_TYPES (fntype
) != 0
3330 && (TREE_VALUE (tree_last (TYPE_ARG_TYPES (fntype
)))
3331 != void_type_node
));
3333 current_function_stdarg
= stdarg
;
3335 /* If the reg that the virtual arg pointer will be translated into is
3336 not a fixed reg or is the stack pointer, make a copy of the virtual
3337 arg pointer, and address parms via the copy. The frame pointer is
3338 considered fixed even though it is not marked as such.
3340 The second time through, simply use ap to avoid generating rtx. */
3342 if ((ARG_POINTER_REGNUM
== STACK_POINTER_REGNUM
3343 || ! (fixed_regs
[ARG_POINTER_REGNUM
]
3344 || ARG_POINTER_REGNUM
== FRAME_POINTER_REGNUM
))
3346 internal_arg_pointer
= copy_to_reg (virtual_incoming_args_rtx
);
3348 internal_arg_pointer
= virtual_incoming_args_rtx
;
3349 current_function_internal_arg_pointer
= internal_arg_pointer
;
3351 stack_args_size
.constant
= 0;
3352 stack_args_size
.var
= 0;
3354 /* If struct value address is treated as the first argument, make it so. */
3355 if (aggregate_value_p (DECL_RESULT (fndecl
))
3356 && ! current_function_returns_pcc_struct
3357 && struct_value_incoming_rtx
== 0)
3359 tree type
= build_pointer_type (TREE_TYPE (fntype
));
3361 function_result_decl
= build_decl (PARM_DECL
, NULL_TREE
, type
);
3363 DECL_ARG_TYPE (function_result_decl
) = type
;
3364 TREE_CHAIN (function_result_decl
) = fnargs
;
3365 fnargs
= function_result_decl
;
3368 parm_reg_stack_loc
= (rtx
*) oballoc (nparmregs
* sizeof (rtx
));
3369 bzero ((char *) parm_reg_stack_loc
, nparmregs
* sizeof (rtx
));
3371 #ifdef INIT_CUMULATIVE_INCOMING_ARGS
3372 INIT_CUMULATIVE_INCOMING_ARGS (args_so_far
, fntype
, NULL_RTX
);
3374 INIT_CUMULATIVE_ARGS (args_so_far
, fntype
, NULL_RTX
, 0);
3377 /* We haven't yet found an argument that we must push and pretend the
3379 current_function_pretend_args_size
= 0;
3381 for (parm
= fnargs
; parm
; parm
= TREE_CHAIN (parm
))
3383 int aggregate
= AGGREGATE_TYPE_P (TREE_TYPE (parm
));
3384 struct args_size stack_offset
;
3385 struct args_size arg_size
;
3386 int passed_pointer
= 0;
3387 int did_conversion
= 0;
3388 tree passed_type
= DECL_ARG_TYPE (parm
);
3389 tree nominal_type
= TREE_TYPE (parm
);
3391 /* Set LAST_NAMED if this is last named arg before some
3392 anonymous args. We treat it as if it were anonymous too. */
3393 int last_named
= ((TREE_CHAIN (parm
) == 0
3394 || DECL_NAME (TREE_CHAIN (parm
)) == 0)
3395 && (stdarg
|| current_function_varargs
));
3397 if (TREE_TYPE (parm
) == error_mark_node
3398 /* This can happen after weird syntax errors
3399 or if an enum type is defined among the parms. */
3400 || TREE_CODE (parm
) != PARM_DECL
3401 || passed_type
== NULL
)
3403 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
) = gen_rtx (MEM
, BLKmode
,
3405 TREE_USED (parm
) = 1;
3409 /* For varargs.h function, save info about regs and stack space
3410 used by the individual args, not including the va_alist arg. */
3411 if (hide_last_arg
&& last_named
)
3412 current_function_args_info
= args_so_far
;
3414 /* Find mode of arg as it is passed, and mode of arg
3415 as it should be during execution of this function. */
3416 passed_mode
= TYPE_MODE (passed_type
);
3417 nominal_mode
= TYPE_MODE (nominal_type
);
3419 /* If the parm's mode is VOID, its value doesn't matter,
3420 and avoid the usual things like emit_move_insn that could crash. */
3421 if (nominal_mode
== VOIDmode
)
3423 DECL_INCOMING_RTL (parm
) = DECL_RTL (parm
) = const0_rtx
;
3427 /* If the parm is to be passed as a transparent union, use the
3428 type of the first field for the tests below. We have already
3429 verified that the modes are the same. */
3430 if (DECL_TRANSPARENT_UNION (parm
)
3431 || TYPE_TRANSPARENT_UNION (passed_type
))
3432 passed_type
= TREE_TYPE (TYPE_FIELDS (passed_type
));
3434 /* See if this arg was passed by invisible reference. It is if
3435 it is an object whose size depends on the contents of the
3436 object itself or if the machine requires these objects be passed
3439 if ((TREE_CODE (TYPE_SIZE (passed_type
)) != INTEGER_CST
3440 && contains_placeholder_p (TYPE_SIZE (passed_type
)))
3441 || TREE_ADDRESSABLE (passed_type
)
3442 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3443 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, passed_mode
,
3444 passed_type
, ! last_named
)
3448 passed_type
= nominal_type
= build_pointer_type (passed_type
);
3450 passed_mode
= nominal_mode
= Pmode
;
3453 promoted_mode
= passed_mode
;
3455 #ifdef PROMOTE_FUNCTION_ARGS
3456 /* Compute the mode in which the arg is actually extended to. */
3457 promoted_mode
= promote_mode (passed_type
, promoted_mode
, &unsignedp
, 1);
3460 /* Let machine desc say which reg (if any) the parm arrives in.
3461 0 means it arrives on the stack. */
3462 #ifdef FUNCTION_INCOMING_ARG
3463 entry_parm
= FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
3464 passed_type
, ! last_named
);
3466 entry_parm
= FUNCTION_ARG (args_so_far
, promoted_mode
,
3467 passed_type
, ! last_named
);
3470 if (entry_parm
== 0)
3471 promoted_mode
= passed_mode
;
3473 #ifdef SETUP_INCOMING_VARARGS
3474 /* If this is the last named parameter, do any required setup for
3475 varargs or stdargs. We need to know about the case of this being an
3476 addressable type, in which case we skip the registers it
3477 would have arrived in.
3479 For stdargs, LAST_NAMED will be set for two parameters, the one that
3480 is actually the last named, and the dummy parameter. We only
3481 want to do this action once.
3483 Also, indicate when RTL generation is to be suppressed. */
3484 if (last_named
&& !varargs_setup
)
3486 SETUP_INCOMING_VARARGS (args_so_far
, promoted_mode
, passed_type
,
3487 current_function_pretend_args_size
,
3493 /* Determine parm's home in the stack,
3494 in case it arrives in the stack or we should pretend it did.
3496 Compute the stack position and rtx where the argument arrives
3499 There is one complexity here: If this was a parameter that would
3500 have been passed in registers, but wasn't only because it is
3501 __builtin_va_alist, we want locate_and_pad_parm to treat it as if
3502 it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
3503 In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
3504 0 as it was the previous time. */
3506 locate_and_pad_parm (promoted_mode
, passed_type
,
3507 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3510 #ifdef FUNCTION_INCOMING_ARG
3511 FUNCTION_INCOMING_ARG (args_so_far
, promoted_mode
,
3514 || varargs_setup
)) != 0,
3516 FUNCTION_ARG (args_so_far
, promoted_mode
,
3518 ! last_named
|| varargs_setup
) != 0,
3521 fndecl
, &stack_args_size
, &stack_offset
, &arg_size
);
3525 rtx offset_rtx
= ARGS_SIZE_RTX (stack_offset
);
3527 if (offset_rtx
== const0_rtx
)
3528 stack_parm
= gen_rtx (MEM
, promoted_mode
, internal_arg_pointer
);
3530 stack_parm
= gen_rtx (MEM
, promoted_mode
,
3531 gen_rtx (PLUS
, Pmode
,
3532 internal_arg_pointer
, offset_rtx
));
3534 /* If this is a memory ref that contains aggregate components,
3535 mark it as such for cse and loop optimize. Likewise if it
3537 MEM_IN_STRUCT_P (stack_parm
) = aggregate
;
3538 RTX_UNCHANGING_P (stack_parm
) = TREE_READONLY (parm
);
3541 /* If this parameter was passed both in registers and in the stack,
3542 use the copy on the stack. */
3543 if (MUST_PASS_IN_STACK (promoted_mode
, passed_type
))
3546 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3547 /* If this parm was passed part in regs and part in memory,
3548 pretend it arrived entirely in memory
3549 by pushing the register-part onto the stack.
3551 In the special case of a DImode or DFmode that is split,
3552 we could put it together in a pseudoreg directly,
3553 but for now that's not worth bothering with. */
3557 int nregs
= FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, promoted_mode
,
3558 passed_type
, ! last_named
);
3562 current_function_pretend_args_size
3563 = (((nregs
* UNITS_PER_WORD
) + (PARM_BOUNDARY
/ BITS_PER_UNIT
) - 1)
3564 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
3565 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
3569 /* Handle calls that pass values in multiple non-contiguous
3570 locations. The Irix 6 ABI has examples of this. */
3571 if (GET_CODE (entry_parm
) == PARALLEL
)
3572 emit_group_store (validize_mem (stack_parm
),
3575 move_block_from_reg (REGNO (entry_parm
),
3576 validize_mem (stack_parm
), nregs
,
3577 int_size_in_bytes (TREE_TYPE (parm
)));
3579 entry_parm
= stack_parm
;
3584 /* If we didn't decide this parm came in a register,
3585 by default it came on the stack. */
3586 if (entry_parm
== 0)
3587 entry_parm
= stack_parm
;
3589 /* Record permanently how this parm was passed. */
3591 DECL_INCOMING_RTL (parm
) = entry_parm
;
3593 /* If there is actually space on the stack for this parm,
3594 count it in stack_args_size; otherwise set stack_parm to 0
3595 to indicate there is no preallocated stack slot for the parm. */
3597 if (entry_parm
== stack_parm
3598 #if defined (REG_PARM_STACK_SPACE) && ! defined (MAYBE_REG_PARM_STACK_SPACE)
3599 /* On some machines, even if a parm value arrives in a register
3600 there is still an (uninitialized) stack slot allocated for it.
3602 ??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
3603 whether this parameter already has a stack slot allocated,
3604 because an arg block exists only if current_function_args_size
3605 is larger than some threshold, and we haven't calculated that
3606 yet. So, for now, we just assume that stack slots never exist
3608 || REG_PARM_STACK_SPACE (fndecl
) > 0
3612 stack_args_size
.constant
+= arg_size
.constant
;
3614 ADD_PARM_SIZE (stack_args_size
, arg_size
.var
);
3617 /* No stack slot was pushed for this parm. */
3620 /* Update info on where next arg arrives in registers. */
3622 FUNCTION_ARG_ADVANCE (args_so_far
, promoted_mode
,
3623 passed_type
, ! last_named
);
3625 /* If this is our second time through, we are done with this parm. */
3629 /* If we can't trust the parm stack slot to be aligned enough
3630 for its ultimate type, don't use that slot after entry.
3631 We'll make another stack slot, if we need one. */
3633 int thisparm_boundary
3634 = FUNCTION_ARG_BOUNDARY (promoted_mode
, passed_type
);
3636 if (GET_MODE_ALIGNMENT (nominal_mode
) > thisparm_boundary
)
3640 /* If parm was passed in memory, and we need to convert it on entry,
3641 don't store it back in that same slot. */
3643 && nominal_mode
!= BLKmode
&& nominal_mode
!= passed_mode
)
3647 /* Now adjust STACK_PARM to the mode and precise location
3648 where this parameter should live during execution,
3649 if we discover that it must live in the stack during execution.
3650 To make debuggers happier on big-endian machines, we store
3651 the value in the last bytes of the space available. */
3653 if (nominal_mode
!= BLKmode
&& nominal_mode
!= passed_mode
3658 if (BYTES_BIG_ENDIAN
3659 && GET_MODE_SIZE (nominal_mode
) < UNITS_PER_WORD
)
3660 stack_offset
.constant
+= (GET_MODE_SIZE (passed_mode
)
3661 - GET_MODE_SIZE (nominal_mode
));
3663 offset_rtx
= ARGS_SIZE_RTX (stack_offset
);
3664 if (offset_rtx
== const0_rtx
)
3665 stack_parm
= gen_rtx (MEM
, nominal_mode
, internal_arg_pointer
);
3667 stack_parm
= gen_rtx (MEM
, nominal_mode
,
3668 gen_rtx (PLUS
, Pmode
,
3669 internal_arg_pointer
, offset_rtx
));
3671 /* If this is a memory ref that contains aggregate components,
3672 mark it as such for cse and loop optimize. */
3673 MEM_IN_STRUCT_P (stack_parm
) = aggregate
;
3678 /* We need this "use" info, because the gcc-register->stack-register
3679 converter in reg-stack.c needs to know which registers are active
3680 at the start of the function call. The actual parameter loading
3681 instructions are not always available then anymore, since they might
3682 have been optimised away. */
3684 if (GET_CODE (entry_parm
) == REG
&& !(hide_last_arg
&& last_named
))
3685 emit_insn (gen_rtx (USE
, GET_MODE (entry_parm
), entry_parm
));
3688 /* ENTRY_PARM is an RTX for the parameter as it arrives,
3689 in the mode in which it arrives.
3690 STACK_PARM is an RTX for a stack slot where the parameter can live
3691 during the function (in case we want to put it there).
3692 STACK_PARM is 0 if no stack slot was pushed for it.
3694 Now output code if necessary to convert ENTRY_PARM to
3695 the type in which this function declares it,
3696 and store that result in an appropriate place,
3697 which may be a pseudo reg, may be STACK_PARM,
3698 or may be a local stack slot if STACK_PARM is 0.
3700 Set DECL_RTL to that place. */
3702 if (nominal_mode
== BLKmode
|| GET_CODE (entry_parm
) == PARALLEL
)
3704 /* If a BLKmode arrives in registers, copy it to a stack slot.
3705 Handle calls that pass values in multiple non-contiguous
3706 locations. The Irix 6 ABI has examples of this. */
3707 if (GET_CODE (entry_parm
) == REG
3708 || GET_CODE (entry_parm
) == PARALLEL
)
3711 = CEIL_ROUND (int_size_in_bytes (TREE_TYPE (parm
)),
3714 /* Note that we will be storing an integral number of words.
3715 So we have to be careful to ensure that we allocate an
3716 integral number of words. We do this below in the
3717 assign_stack_local if space was not allocated in the argument
3718 list. If it was, this will not work if PARM_BOUNDARY is not
3719 a multiple of BITS_PER_WORD. It isn't clear how to fix this
3720 if it becomes a problem. */
3722 if (stack_parm
== 0)
3725 = assign_stack_local (GET_MODE (entry_parm
),
3728 /* If this is a memory ref that contains aggregate
3729 components, mark it as such for cse and loop optimize. */
3730 MEM_IN_STRUCT_P (stack_parm
) = aggregate
;
3733 else if (PARM_BOUNDARY
% BITS_PER_WORD
!= 0)
3736 if (TREE_READONLY (parm
))
3737 RTX_UNCHANGING_P (stack_parm
) = 1;
3739 /* Handle calls that pass values in multiple non-contiguous
3740 locations. The Irix 6 ABI has examples of this. */
3741 if (GET_CODE (entry_parm
) == PARALLEL
)
3742 emit_group_store (validize_mem (stack_parm
), entry_parm
);
3744 move_block_from_reg (REGNO (entry_parm
),
3745 validize_mem (stack_parm
),
3746 size_stored
/ UNITS_PER_WORD
,
3747 int_size_in_bytes (TREE_TYPE (parm
)));
3749 DECL_RTL (parm
) = stack_parm
;
3751 else if (! ((obey_regdecls
&& ! DECL_REGISTER (parm
)
3752 && ! DECL_INLINE (fndecl
))
3753 /* layout_decl may set this. */
3754 || TREE_ADDRESSABLE (parm
)
3755 || TREE_SIDE_EFFECTS (parm
)
3756 /* If -ffloat-store specified, don't put explicit
3757 float variables into registers. */
3758 || (flag_float_store
3759 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
))
3760 /* Always assign pseudo to structure return or item passed
3761 by invisible reference. */
3762 || passed_pointer
|| parm
== function_result_decl
)
3764 /* Store the parm in a pseudoregister during the function, but we
3765 may need to do it in a wider mode. */
3767 register rtx parmreg
;
3768 int regno
, regnoi
, regnor
;
3770 unsignedp
= TREE_UNSIGNED (TREE_TYPE (parm
));
3772 promoted_nominal_mode
3773 = promote_mode (TREE_TYPE (parm
), nominal_mode
, &unsignedp
, 0);
3775 parmreg
= gen_reg_rtx (promoted_nominal_mode
);
3776 mark_user_reg (parmreg
);
3778 /* If this was an item that we received a pointer to, set DECL_RTL
3783 = gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (passed_type
)), parmreg
);
3784 MEM_IN_STRUCT_P (DECL_RTL (parm
)) = aggregate
;
3787 DECL_RTL (parm
) = parmreg
;
3789 /* Copy the value into the register. */
3790 if (nominal_mode
!= passed_mode
3791 || promoted_nominal_mode
!= promoted_mode
)
3793 /* ENTRY_PARM has been converted to PROMOTED_MODE, its
3794 mode, by the caller. We now have to convert it to
3795 NOMINAL_MODE, if different. However, PARMREG may be in
3796 a diffent mode than NOMINAL_MODE if it is being stored
3799 If ENTRY_PARM is a hard register, it might be in a register
3800 not valid for operating in its mode (e.g., an odd-numbered
3801 register for a DFmode). In that case, moves are the only
3802 thing valid, so we can't do a convert from there. This
3803 occurs when the calling sequence allow such misaligned
3806 In addition, the conversion may involve a call, which could
3807 clobber parameters which haven't been copied to pseudo
3808 registers yet. Therefore, we must first copy the parm to
3809 a pseudo reg here, and save the conversion until after all
3810 parameters have been moved. */
3812 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
3814 emit_move_insn (tempreg
, validize_mem (entry_parm
));
3816 push_to_sequence (conversion_insns
);
3817 tempreg
= convert_to_mode (nominal_mode
, tempreg
, unsignedp
);
3819 expand_assignment (parm
,
3820 make_tree (nominal_type
, tempreg
), 0, 0);
3821 conversion_insns
= get_insns ();
3826 emit_move_insn (parmreg
, validize_mem (entry_parm
));
3828 /* If we were passed a pointer but the actual value
3829 can safely live in a register, put it in one. */
3830 if (passed_pointer
&& TYPE_MODE (TREE_TYPE (parm
)) != BLKmode
3831 && ! ((obey_regdecls
&& ! DECL_REGISTER (parm
)
3832 && ! DECL_INLINE (fndecl
))
3833 /* layout_decl may set this. */
3834 || TREE_ADDRESSABLE (parm
)
3835 || TREE_SIDE_EFFECTS (parm
)
3836 /* If -ffloat-store specified, don't put explicit
3837 float variables into registers. */
3838 || (flag_float_store
3839 && TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
)))
3841 /* We can't use nominal_mode, because it will have been set to
3842 Pmode above. We must use the actual mode of the parm. */
3843 parmreg
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm
)));
3844 mark_user_reg (parmreg
);
3845 emit_move_insn (parmreg
, DECL_RTL (parm
));
3846 DECL_RTL (parm
) = parmreg
;
3847 /* STACK_PARM is the pointer, not the parm, and PARMREG is
3851 #ifdef FUNCTION_ARG_CALLEE_COPIES
3852 /* If we are passed an arg by reference and it is our responsibility
3853 to make a copy, do it now.
3854 PASSED_TYPE and PASSED mode now refer to the pointer, not the
3855 original argument, so we must recreate them in the call to
3856 FUNCTION_ARG_CALLEE_COPIES. */
3857 /* ??? Later add code to handle the case that if the argument isn't
3858 modified, don't do the copy. */
3860 else if (passed_pointer
3861 && FUNCTION_ARG_CALLEE_COPIES (args_so_far
,
3862 TYPE_MODE (DECL_ARG_TYPE (parm
)),
3863 DECL_ARG_TYPE (parm
),
3865 && ! TREE_ADDRESSABLE (DECL_ARG_TYPE (parm
)))
3868 tree type
= DECL_ARG_TYPE (parm
);
3870 /* This sequence may involve a library call perhaps clobbering
3871 registers that haven't been copied to pseudos yet. */
3873 push_to_sequence (conversion_insns
);
3875 if (TYPE_SIZE (type
) == 0
3876 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
3877 /* This is a variable sized object. */
3878 copy
= gen_rtx (MEM
, BLKmode
,
3879 allocate_dynamic_stack_space
3880 (expr_size (parm
), NULL_RTX
,
3881 TYPE_ALIGN (type
)));
3883 copy
= assign_stack_temp (TYPE_MODE (type
),
3884 int_size_in_bytes (type
), 1);
3885 MEM_IN_STRUCT_P (copy
) = AGGREGATE_TYPE_P (type
);
3887 store_expr (parm
, copy
, 0);
3888 emit_move_insn (parmreg
, XEXP (copy
, 0));
3889 conversion_insns
= get_insns ();
3893 #endif /* FUNCTION_ARG_CALLEE_COPIES */
3895 /* In any case, record the parm's desired stack location
3896 in case we later discover it must live in the stack.
3898 If it is a COMPLEX value, store the stack location for both
3901 if (GET_CODE (parmreg
) == CONCAT
)
3902 regno
= MAX (REGNO (XEXP (parmreg
, 0)), REGNO (XEXP (parmreg
, 1)));
3904 regno
= REGNO (parmreg
);
3906 if (regno
>= nparmregs
)
3909 int old_nparmregs
= nparmregs
;
3911 nparmregs
= regno
+ 5;
3912 new = (rtx
*) oballoc (nparmregs
* sizeof (rtx
));
3913 bcopy ((char *) parm_reg_stack_loc
, (char *) new,
3914 old_nparmregs
* sizeof (rtx
));
3915 bzero ((char *) (new + old_nparmregs
),
3916 (nparmregs
- old_nparmregs
) * sizeof (rtx
));
3917 parm_reg_stack_loc
= new;
3920 if (GET_CODE (parmreg
) == CONCAT
)
3922 enum machine_mode submode
= GET_MODE (XEXP (parmreg
, 0));
3924 regnor
= REGNO (gen_realpart (submode
, parmreg
));
3925 regnoi
= REGNO (gen_imagpart (submode
, parmreg
));
3927 if (stack_parm
!= 0)
3929 parm_reg_stack_loc
[regnor
]
3930 = gen_realpart (submode
, stack_parm
);
3931 parm_reg_stack_loc
[regnoi
]
3932 = gen_imagpart (submode
, stack_parm
);
3936 parm_reg_stack_loc
[regnor
] = 0;
3937 parm_reg_stack_loc
[regnoi
] = 0;
3941 parm_reg_stack_loc
[REGNO (parmreg
)] = stack_parm
;
3943 /* Mark the register as eliminable if we did no conversion
3944 and it was copied from memory at a fixed offset,
3945 and the arg pointer was not copied to a pseudo-reg.
3946 If the arg pointer is a pseudo reg or the offset formed
3947 an invalid address, such memory-equivalences
3948 as we make here would screw up life analysis for it. */
3949 if (nominal_mode
== passed_mode
3951 && GET_CODE (entry_parm
) == MEM
3952 && entry_parm
== stack_parm
3953 && stack_offset
.var
== 0
3954 && reg_mentioned_p (virtual_incoming_args_rtx
,
3955 XEXP (entry_parm
, 0)))
3957 rtx linsn
= get_last_insn ();
3960 /* Mark complex types separately. */
3961 if (GET_CODE (parmreg
) == CONCAT
)
3962 /* Scan backwards for the set of the real and
3964 for (sinsn
= linsn
; sinsn
!= 0;
3965 sinsn
= prev_nonnote_insn (sinsn
))
3967 set
= single_set (sinsn
);
3969 && SET_DEST (set
) == regno_reg_rtx
[regnoi
])
3971 = gen_rtx (EXPR_LIST
, REG_EQUIV
,
3972 parm_reg_stack_loc
[regnoi
],
3975 && SET_DEST (set
) == regno_reg_rtx
[regnor
])
3977 = gen_rtx (EXPR_LIST
, REG_EQUIV
,
3978 parm_reg_stack_loc
[regnor
],
3981 else if ((set
= single_set (linsn
)) != 0
3982 && SET_DEST (set
) == parmreg
)
3984 = gen_rtx (EXPR_LIST
, REG_EQUIV
,
3985 entry_parm
, REG_NOTES (linsn
));
3988 /* For pointer data type, suggest pointer register. */
3989 if (TREE_CODE (TREE_TYPE (parm
)) == POINTER_TYPE
)
3990 mark_reg_pointer (parmreg
,
3991 (TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm
)))
3996 /* Value must be stored in the stack slot STACK_PARM
3997 during function execution. */
3999 if (promoted_mode
!= nominal_mode
)
4001 /* Conversion is required. */
4002 rtx tempreg
= gen_reg_rtx (GET_MODE (entry_parm
));
4004 emit_move_insn (tempreg
, validize_mem (entry_parm
));
4006 push_to_sequence (conversion_insns
);
4007 entry_parm
= convert_to_mode (nominal_mode
, tempreg
,
4008 TREE_UNSIGNED (TREE_TYPE (parm
)));
4009 conversion_insns
= get_insns ();
4014 if (entry_parm
!= stack_parm
)
4016 if (stack_parm
== 0)
4019 = assign_stack_local (GET_MODE (entry_parm
),
4020 GET_MODE_SIZE (GET_MODE (entry_parm
)), 0);
4021 /* If this is a memory ref that contains aggregate components,
4022 mark it as such for cse and loop optimize. */
4023 MEM_IN_STRUCT_P (stack_parm
) = aggregate
;
4026 if (promoted_mode
!= nominal_mode
)
4028 push_to_sequence (conversion_insns
);
4029 emit_move_insn (validize_mem (stack_parm
),
4030 validize_mem (entry_parm
));
4031 conversion_insns
= get_insns ();
4035 emit_move_insn (validize_mem (stack_parm
),
4036 validize_mem (entry_parm
));
4039 DECL_RTL (parm
) = stack_parm
;
4042 /* If this "parameter" was the place where we are receiving the
4043 function's incoming structure pointer, set up the result. */
4044 if (parm
== function_result_decl
)
4046 tree result
= DECL_RESULT (fndecl
);
4047 tree restype
= TREE_TYPE (result
);
4050 = gen_rtx (MEM
, DECL_MODE (result
), DECL_RTL (parm
));
4052 MEM_IN_STRUCT_P (DECL_RTL (result
)) = AGGREGATE_TYPE_P (restype
);
4055 if (TREE_THIS_VOLATILE (parm
))
4056 MEM_VOLATILE_P (DECL_RTL (parm
)) = 1;
4057 if (TREE_READONLY (parm
))
4058 RTX_UNCHANGING_P (DECL_RTL (parm
)) = 1;
4061 /* Output all parameter conversion instructions (possibly including calls)
4062 now that all parameters have been copied out of hard registers. */
4063 emit_insns (conversion_insns
);
4065 max_parm_reg
= max_reg_num ();
4066 last_parm_insn
= get_last_insn ();
4068 current_function_args_size
= stack_args_size
.constant
;
4070 /* Adjust function incoming argument size for alignment and
4073 #ifdef REG_PARM_STACK_SPACE
4074 #ifndef MAYBE_REG_PARM_STACK_SPACE
4075 current_function_args_size
= MAX (current_function_args_size
,
4076 REG_PARM_STACK_SPACE (fndecl
));
4080 #ifdef STACK_BOUNDARY
4081 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
4083 current_function_args_size
4084 = ((current_function_args_size
+ STACK_BYTES
- 1)
4085 / STACK_BYTES
) * STACK_BYTES
;
4088 #ifdef ARGS_GROW_DOWNWARD
4089 current_function_arg_offset_rtx
4090 = (stack_args_size
.var
== 0 ? GEN_INT (-stack_args_size
.constant
)
4091 : expand_expr (size_binop (MINUS_EXPR
, stack_args_size
.var
,
4092 size_int (-stack_args_size
.constant
)),
4093 NULL_RTX
, VOIDmode
, 0));
4095 current_function_arg_offset_rtx
= ARGS_SIZE_RTX (stack_args_size
);
4098 /* See how many bytes, if any, of its args a function should try to pop
4101 current_function_pops_args
= RETURN_POPS_ARGS (fndecl
, TREE_TYPE (fndecl
),
4102 current_function_args_size
);
4104 /* For stdarg.h function, save info about
4105 regs and stack space used by the named args. */
4108 current_function_args_info
= args_so_far
;
4110 /* Set the rtx used for the function return value. Put this in its
4111 own variable so any optimizers that need this information don't have
4112 to include tree.h. Do this here so it gets done when an inlined
4113 function gets output. */
4115 current_function_return_rtx
= DECL_RTL (DECL_RESULT (fndecl
));
4118 /* Indicate whether REGNO is an incoming argument to the current function
4119 that was promoted to a wider mode. If so, return the RTX for the
4120 register (to get its mode). PMODE and PUNSIGNEDP are set to the mode
4121 that REGNO is promoted from and whether the promotion was signed or
4124 #ifdef PROMOTE_FUNCTION_ARGS
4127 promoted_input_arg (regno
, pmode
, punsignedp
)
4129 enum machine_mode
*pmode
;
4134 for (arg
= DECL_ARGUMENTS (current_function_decl
); arg
;
4135 arg
= TREE_CHAIN (arg
))
4136 if (GET_CODE (DECL_INCOMING_RTL (arg
)) == REG
4137 && REGNO (DECL_INCOMING_RTL (arg
)) == regno
4138 && TYPE_MODE (DECL_ARG_TYPE (arg
)) == TYPE_MODE (TREE_TYPE (arg
)))
4140 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (arg
));
4141 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (arg
));
4143 mode
= promote_mode (TREE_TYPE (arg
), mode
, &unsignedp
, 1);
4144 if (mode
== GET_MODE (DECL_INCOMING_RTL (arg
))
4145 && mode
!= DECL_MODE (arg
))
4147 *pmode
= DECL_MODE (arg
);
4148 *punsignedp
= unsignedp
;
4149 return DECL_INCOMING_RTL (arg
);
4158 /* Compute the size and offset from the start of the stacked arguments for a
4159 parm passed in mode PASSED_MODE and with type TYPE.
4161 INITIAL_OFFSET_PTR points to the current offset into the stacked
4164 The starting offset and size for this parm are returned in *OFFSET_PTR
4165 and *ARG_SIZE_PTR, respectively.
4167 IN_REGS is non-zero if the argument will be passed in registers. It will
4168 never be set if REG_PARM_STACK_SPACE is not defined.
4170 FNDECL is the function in which the argument was defined.
4172 There are two types of rounding that are done. The first, controlled by
4173 FUNCTION_ARG_BOUNDARY, forces the offset from the start of the argument
4174 list to be aligned to the specific boundary (in bits). This rounding
4175 affects the initial and starting offsets, but not the argument size.
4177 The second, controlled by FUNCTION_ARG_PADDING and PARM_BOUNDARY,
4178 optionally rounds the size of the parm to PARM_BOUNDARY. The
4179 initial offset is not affected by this rounding, while the size always
4180 is and the starting offset may be. */
4182 /* offset_ptr will be negative for ARGS_GROW_DOWNWARD case;
4183 initial_offset_ptr is positive because locate_and_pad_parm's
4184 callers pass in the total size of args so far as
4185 initial_offset_ptr. arg_size_ptr is always positive.*/
4188 locate_and_pad_parm (passed_mode
, type
, in_regs
, fndecl
,
4189 initial_offset_ptr
, offset_ptr
, arg_size_ptr
)
4190 enum machine_mode passed_mode
;
4194 struct args_size
*initial_offset_ptr
;
4195 struct args_size
*offset_ptr
;
4196 struct args_size
*arg_size_ptr
;
4199 = type
? size_in_bytes (type
) : size_int (GET_MODE_SIZE (passed_mode
));
4200 enum direction where_pad
= FUNCTION_ARG_PADDING (passed_mode
, type
);
4201 int boundary
= FUNCTION_ARG_BOUNDARY (passed_mode
, type
);
4202 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
4203 int reg_parm_stack_space
= 0;
4205 #ifdef REG_PARM_STACK_SPACE
4206 /* If we have found a stack parm before we reach the end of the
4207 area reserved for registers, skip that area. */
4210 #ifdef MAYBE_REG_PARM_STACK_SPACE
4211 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
4213 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
4215 if (reg_parm_stack_space
> 0)
4217 if (initial_offset_ptr
->var
)
4219 initial_offset_ptr
->var
4220 = size_binop (MAX_EXPR
, ARGS_SIZE_TREE (*initial_offset_ptr
),
4221 size_int (reg_parm_stack_space
));
4222 initial_offset_ptr
->constant
= 0;
4224 else if (initial_offset_ptr
->constant
< reg_parm_stack_space
)
4225 initial_offset_ptr
->constant
= reg_parm_stack_space
;
4228 #endif /* REG_PARM_STACK_SPACE */
4230 arg_size_ptr
->var
= 0;
4231 arg_size_ptr
->constant
= 0;
4233 #ifdef ARGS_GROW_DOWNWARD
4234 if (initial_offset_ptr
->var
)
4236 offset_ptr
->constant
= 0;
4237 offset_ptr
->var
= size_binop (MINUS_EXPR
, integer_zero_node
,
4238 initial_offset_ptr
->var
);
4242 offset_ptr
->constant
= - initial_offset_ptr
->constant
;
4243 offset_ptr
->var
= 0;
4245 if (where_pad
!= none
4246 && (TREE_CODE (sizetree
) != INTEGER_CST
4247 || ((TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)))
4248 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
4249 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
4250 if (where_pad
!= downward
)
4251 pad_to_arg_alignment (offset_ptr
, boundary
);
4252 if (initial_offset_ptr
->var
)
4254 arg_size_ptr
->var
= size_binop (MINUS_EXPR
,
4255 size_binop (MINUS_EXPR
,
4257 initial_offset_ptr
->var
),
4262 arg_size_ptr
->constant
= (- initial_offset_ptr
->constant
-
4263 offset_ptr
->constant
);
4265 #else /* !ARGS_GROW_DOWNWARD */
4266 pad_to_arg_alignment (initial_offset_ptr
, boundary
);
4267 *offset_ptr
= *initial_offset_ptr
;
4269 #ifdef PUSH_ROUNDING
4270 if (passed_mode
!= BLKmode
)
4271 sizetree
= size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree
)));
4274 /* Pad_below needs the pre-rounded size to know how much to pad below
4275 so this must be done before rounding up. */
4276 if (where_pad
== downward
4277 /* However, BLKmode args passed in regs have their padding done elsewhere.
4278 The stack slot must be able to hold the entire register. */
4279 && !(in_regs
&& passed_mode
== BLKmode
))
4280 pad_below (offset_ptr
, passed_mode
, sizetree
);
4282 if (where_pad
!= none
4283 && (TREE_CODE (sizetree
) != INTEGER_CST
4284 || ((TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)))
4285 sizetree
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
4287 ADD_PARM_SIZE (*arg_size_ptr
, sizetree
);
4288 #endif /* ARGS_GROW_DOWNWARD */
4291 /* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
4292 BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
4295 pad_to_arg_alignment (offset_ptr
, boundary
)
4296 struct args_size
*offset_ptr
;
4299 int boundary_in_bytes
= boundary
/ BITS_PER_UNIT
;
4301 if (boundary
> BITS_PER_UNIT
)
4303 if (offset_ptr
->var
)
4306 #ifdef ARGS_GROW_DOWNWARD
4311 (ARGS_SIZE_TREE (*offset_ptr
),
4312 boundary
/ BITS_PER_UNIT
);
4313 offset_ptr
->constant
= 0; /*?*/
4316 offset_ptr
->constant
=
4317 #ifdef ARGS_GROW_DOWNWARD
4318 FLOOR_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
4320 CEIL_ROUND (offset_ptr
->constant
, boundary_in_bytes
);
4326 pad_below (offset_ptr
, passed_mode
, sizetree
)
4327 struct args_size
*offset_ptr
;
4328 enum machine_mode passed_mode
;
4331 if (passed_mode
!= BLKmode
)
4333 if (GET_MODE_BITSIZE (passed_mode
) % PARM_BOUNDARY
)
4334 offset_ptr
->constant
4335 += (((GET_MODE_BITSIZE (passed_mode
) + PARM_BOUNDARY
- 1)
4336 / PARM_BOUNDARY
* PARM_BOUNDARY
/ BITS_PER_UNIT
)
4337 - GET_MODE_SIZE (passed_mode
));
4341 if (TREE_CODE (sizetree
) != INTEGER_CST
4342 || (TREE_INT_CST_LOW (sizetree
) * BITS_PER_UNIT
) % PARM_BOUNDARY
)
4344 /* Round the size up to multiple of PARM_BOUNDARY bits. */
4345 tree s2
= round_up (sizetree
, PARM_BOUNDARY
/ BITS_PER_UNIT
);
4347 ADD_PARM_SIZE (*offset_ptr
, s2
);
4348 SUB_PARM_SIZE (*offset_ptr
, sizetree
);
4354 round_down (value
, divisor
)
4358 return size_binop (MULT_EXPR
,
4359 size_binop (FLOOR_DIV_EXPR
, value
, size_int (divisor
)),
4360 size_int (divisor
));
4363 /* Walk the tree of blocks describing the binding levels within a function
4364 and warn about uninitialized variables.
4365 This is done after calling flow_analysis and before global_alloc
4366 clobbers the pseudo-regs to hard regs. */
4369 uninitialized_vars_warning (block
)
4372 register tree decl
, sub
;
4373 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
4375 if (TREE_CODE (decl
) == VAR_DECL
4376 /* These warnings are unreliable for and aggregates
4377 because assigning the fields one by one can fail to convince
4378 flow.c that the entire aggregate was initialized.
4379 Unions are troublesome because members may be shorter. */
4380 && ! AGGREGATE_TYPE_P (TREE_TYPE (decl
))
4381 && DECL_RTL (decl
) != 0
4382 && GET_CODE (DECL_RTL (decl
)) == REG
4383 && regno_uninitialized (REGNO (DECL_RTL (decl
))))
4384 warning_with_decl (decl
,
4385 "`%s' might be used uninitialized in this function");
4386 if (TREE_CODE (decl
) == VAR_DECL
4387 && DECL_RTL (decl
) != 0
4388 && GET_CODE (DECL_RTL (decl
)) == REG
4389 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
4390 warning_with_decl (decl
,
4391 "variable `%s' might be clobbered by `longjmp' or `vfork'");
4393 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
4394 uninitialized_vars_warning (sub
);
4397 /* Do the appropriate part of uninitialized_vars_warning
4398 but for arguments instead of local variables. */
4401 setjmp_args_warning ()
4404 for (decl
= DECL_ARGUMENTS (current_function_decl
);
4405 decl
; decl
= TREE_CHAIN (decl
))
4406 if (DECL_RTL (decl
) != 0
4407 && GET_CODE (DECL_RTL (decl
)) == REG
4408 && regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl
))))
4409 warning_with_decl (decl
, "argument `%s' might be clobbered by `longjmp' or `vfork'");
4412 /* If this function call setjmp, put all vars into the stack
4413 unless they were declared `register'. */
4416 setjmp_protect (block
)
4419 register tree decl
, sub
;
4420 for (decl
= BLOCK_VARS (block
); decl
; decl
= TREE_CHAIN (decl
))
4421 if ((TREE_CODE (decl
) == VAR_DECL
4422 || TREE_CODE (decl
) == PARM_DECL
)
4423 && DECL_RTL (decl
) != 0
4424 && GET_CODE (DECL_RTL (decl
)) == REG
4425 /* If this variable came from an inline function, it must be
4426 that it's life doesn't overlap the setjmp. If there was a
4427 setjmp in the function, it would already be in memory. We
4428 must exclude such variable because their DECL_RTL might be
4429 set to strange things such as virtual_stack_vars_rtx. */
4430 && ! DECL_FROM_INLINE (decl
)
4432 #ifdef NON_SAVING_SETJMP
4433 /* If longjmp doesn't restore the registers,
4434 don't put anything in them. */
4438 ! DECL_REGISTER (decl
)))
4439 put_var_into_stack (decl
);
4440 for (sub
= BLOCK_SUBBLOCKS (block
); sub
; sub
= TREE_CHAIN (sub
))
4441 setjmp_protect (sub
);
4444 /* Like the previous function, but for args instead of local variables. */
4447 setjmp_protect_args ()
4449 register tree decl
, sub
;
4450 for (decl
= DECL_ARGUMENTS (current_function_decl
);
4451 decl
; decl
= TREE_CHAIN (decl
))
4452 if ((TREE_CODE (decl
) == VAR_DECL
4453 || TREE_CODE (decl
) == PARM_DECL
)
4454 && DECL_RTL (decl
) != 0
4455 && GET_CODE (DECL_RTL (decl
)) == REG
4457 /* If longjmp doesn't restore the registers,
4458 don't put anything in them. */
4459 #ifdef NON_SAVING_SETJMP
4463 ! DECL_REGISTER (decl
)))
4464 put_var_into_stack (decl
);
4467 /* Return the context-pointer register corresponding to DECL,
4468 or 0 if it does not need one. */
4471 lookup_static_chain (decl
)
4474 tree context
= decl_function_context (decl
);
4478 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_NO_STATIC_CHAIN (decl
)))
4481 /* We treat inline_function_decl as an alias for the current function
4482 because that is the inline function whose vars, types, etc.
4483 are being merged into the current function.
4484 See expand_inline_function. */
4485 if (context
== current_function_decl
|| context
== inline_function_decl
)
4486 return virtual_stack_vars_rtx
;
4488 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
4489 if (TREE_PURPOSE (link
) == context
)
4490 return RTL_EXPR_RTL (TREE_VALUE (link
));
4495 /* Convert a stack slot address ADDR for variable VAR
4496 (from a containing function)
4497 into an address valid in this function (using a static chain). */
4500 fix_lexical_addr (addr
, var
)
4506 tree context
= decl_function_context (var
);
4507 struct function
*fp
;
4510 /* If this is the present function, we need not do anything. */
4511 if (context
== current_function_decl
|| context
== inline_function_decl
)
4514 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
4515 if (fp
->decl
== context
)
4521 /* Decode given address as base reg plus displacement. */
4522 if (GET_CODE (addr
) == REG
)
4523 basereg
= addr
, displacement
= 0;
4524 else if (GET_CODE (addr
) == PLUS
&& GET_CODE (XEXP (addr
, 1)) == CONST_INT
)
4525 basereg
= XEXP (addr
, 0), displacement
= INTVAL (XEXP (addr
, 1));
4529 /* We accept vars reached via the containing function's
4530 incoming arg pointer and via its stack variables pointer. */
4531 if (basereg
== fp
->internal_arg_pointer
)
4533 /* If reached via arg pointer, get the arg pointer value
4534 out of that function's stack frame.
4536 There are two cases: If a separate ap is needed, allocate a
4537 slot in the outer function for it and dereference it that way.
4538 This is correct even if the real ap is actually a pseudo.
4539 Otherwise, just adjust the offset from the frame pointer to
4542 #ifdef NEED_SEPARATE_AP
4545 if (fp
->arg_pointer_save_area
== 0)
4546 fp
->arg_pointer_save_area
4547 = assign_outer_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0, fp
);
4549 addr
= fix_lexical_addr (XEXP (fp
->arg_pointer_save_area
, 0), var
);
4550 addr
= memory_address (Pmode
, addr
);
4552 base
= copy_to_reg (gen_rtx (MEM
, Pmode
, addr
));
4554 displacement
+= (FIRST_PARM_OFFSET (context
) - STARTING_FRAME_OFFSET
);
4555 base
= lookup_static_chain (var
);
4559 else if (basereg
== virtual_stack_vars_rtx
)
4561 /* This is the same code as lookup_static_chain, duplicated here to
4562 avoid an extra call to decl_function_context. */
4565 for (link
= context_display
; link
; link
= TREE_CHAIN (link
))
4566 if (TREE_PURPOSE (link
) == context
)
4568 base
= RTL_EXPR_RTL (TREE_VALUE (link
));
4576 /* Use same offset, relative to appropriate static chain or argument
4578 return plus_constant (base
, displacement
);
4581 /* Return the address of the trampoline for entering nested fn FUNCTION.
4582 If necessary, allocate a trampoline (in the stack frame)
4583 and emit rtl to initialize its contents (at entry to this function). */
4586 trampoline_address (function
)
4592 struct function
*fp
;
4595 /* Find an existing trampoline and return it. */
4596 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
4597 if (TREE_PURPOSE (link
) == function
)
4599 round_trampoline_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0));
4601 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
4602 for (link
= fp
->trampoline_list
; link
; link
= TREE_CHAIN (link
))
4603 if (TREE_PURPOSE (link
) == function
)
4605 tramp
= fix_lexical_addr (XEXP (RTL_EXPR_RTL (TREE_VALUE (link
)), 0),
4607 return round_trampoline_addr (tramp
);
4610 /* None exists; we must make one. */
4612 /* Find the `struct function' for the function containing FUNCTION. */
4614 fn_context
= decl_function_context (function
);
4615 if (fn_context
!= current_function_decl
)
4616 for (fp
= outer_function_chain
; fp
; fp
= fp
->next
)
4617 if (fp
->decl
== fn_context
)
4620 /* Allocate run-time space for this trampoline
4621 (usually in the defining function's stack frame). */
4622 #ifdef ALLOCATE_TRAMPOLINE
4623 tramp
= ALLOCATE_TRAMPOLINE (fp
);
4625 /* If rounding needed, allocate extra space
4626 to ensure we have TRAMPOLINE_SIZE bytes left after rounding up. */
4627 #ifdef TRAMPOLINE_ALIGNMENT
4628 #define TRAMPOLINE_REAL_SIZE \
4629 (TRAMPOLINE_SIZE + (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT) - 1)
4631 #define TRAMPOLINE_REAL_SIZE (TRAMPOLINE_SIZE)
4634 tramp
= assign_outer_stack_local (BLKmode
, TRAMPOLINE_REAL_SIZE
, 0, fp
);
4636 tramp
= assign_stack_local (BLKmode
, TRAMPOLINE_REAL_SIZE
, 0);
4639 /* Record the trampoline for reuse and note it for later initialization
4640 by expand_function_end. */
4643 push_obstacks (fp
->function_maybepermanent_obstack
,
4644 fp
->function_maybepermanent_obstack
);
4645 rtlexp
= make_node (RTL_EXPR
);
4646 RTL_EXPR_RTL (rtlexp
) = tramp
;
4647 fp
->trampoline_list
= tree_cons (function
, rtlexp
, fp
->trampoline_list
);
4652 /* Make the RTL_EXPR node temporary, not momentary, so that the
4653 trampoline_list doesn't become garbage. */
4654 int momentary
= suspend_momentary ();
4655 rtlexp
= make_node (RTL_EXPR
);
4656 resume_momentary (momentary
);
4658 RTL_EXPR_RTL (rtlexp
) = tramp
;
4659 trampoline_list
= tree_cons (function
, rtlexp
, trampoline_list
);
4662 tramp
= fix_lexical_addr (XEXP (tramp
, 0), function
);
4663 return round_trampoline_addr (tramp
);
4666 /* Given a trampoline address,
4667 round it to multiple of TRAMPOLINE_ALIGNMENT. */
4670 round_trampoline_addr (tramp
)
4673 #ifdef TRAMPOLINE_ALIGNMENT
4674 /* Round address up to desired boundary. */
4675 rtx temp
= gen_reg_rtx (Pmode
);
4676 temp
= expand_binop (Pmode
, add_optab
, tramp
,
4677 GEN_INT (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
- 1),
4678 temp
, 0, OPTAB_LIB_WIDEN
);
4679 tramp
= expand_binop (Pmode
, and_optab
, temp
,
4680 GEN_INT (- TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
),
4681 temp
, 0, OPTAB_LIB_WIDEN
);
4686 /* The functions identify_blocks and reorder_blocks provide a way to
4687 reorder the tree of BLOCK nodes, for optimizers that reshuffle or
4688 duplicate portions of the RTL code. Call identify_blocks before
4689 changing the RTL, and call reorder_blocks after. */
4691 /* Put all this function's BLOCK nodes including those that are chained
4692 onto the first block into a vector, and return it.
4693 Also store in each NOTE for the beginning or end of a block
4694 the index of that block in the vector.
4695 The arguments are BLOCK, the chain of top-level blocks of the function,
4696 and INSNS, the insn chain of the function. */
4699 identify_blocks (block
, insns
)
4707 int next_block_number
= 1;
4708 int current_block_number
= 1;
4714 n_blocks
= all_blocks (block
, 0);
4715 block_vector
= (tree
*) xmalloc (n_blocks
* sizeof (tree
));
4716 block_stack
= (int *) alloca (n_blocks
* sizeof (int));
4718 all_blocks (block
, block_vector
);
4720 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
4721 if (GET_CODE (insn
) == NOTE
)
4723 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
4725 block_stack
[depth
++] = current_block_number
;
4726 current_block_number
= next_block_number
;
4727 NOTE_BLOCK_NUMBER (insn
) = next_block_number
++;
4729 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
4731 current_block_number
= block_stack
[--depth
];
4732 NOTE_BLOCK_NUMBER (insn
) = current_block_number
;
4736 if (n_blocks
!= next_block_number
)
4739 return block_vector
;
4742 /* Given BLOCK_VECTOR which was returned by identify_blocks,
4743 and a revised instruction chain, rebuild the tree structure
4744 of BLOCK nodes to correspond to the new order of RTL.
4745 The new block tree is inserted below TOP_BLOCK.
4746 Returns the current top-level block. */
4749 reorder_blocks (block_vector
, block
, insns
)
4754 tree current_block
= block
;
4757 if (block_vector
== 0)
4760 /* Prune the old trees away, so that it doesn't get in the way. */
4761 BLOCK_SUBBLOCKS (current_block
) = 0;
4762 BLOCK_CHAIN (current_block
) = 0;
4764 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
4765 if (GET_CODE (insn
) == NOTE
)
4767 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
)
4769 tree block
= block_vector
[NOTE_BLOCK_NUMBER (insn
)];
4770 /* If we have seen this block before, copy it. */
4771 if (TREE_ASM_WRITTEN (block
))
4772 block
= copy_node (block
);
4773 BLOCK_SUBBLOCKS (block
) = 0;
4774 TREE_ASM_WRITTEN (block
) = 1;
4775 BLOCK_SUPERCONTEXT (block
) = current_block
;
4776 BLOCK_CHAIN (block
) = BLOCK_SUBBLOCKS (current_block
);
4777 BLOCK_SUBBLOCKS (current_block
) = block
;
4778 current_block
= block
;
4779 NOTE_SOURCE_FILE (insn
) = 0;
4781 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
)
4783 BLOCK_SUBBLOCKS (current_block
)
4784 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
4785 current_block
= BLOCK_SUPERCONTEXT (current_block
);
4786 NOTE_SOURCE_FILE (insn
) = 0;
4790 BLOCK_SUBBLOCKS (current_block
)
4791 = blocks_nreverse (BLOCK_SUBBLOCKS (current_block
));
4792 return current_block
;
4795 /* Reverse the order of elements in the chain T of blocks,
4796 and return the new head of the chain (old last element). */
4802 register tree prev
= 0, decl
, next
;
4803 for (decl
= t
; decl
; decl
= next
)
4805 next
= BLOCK_CHAIN (decl
);
4806 BLOCK_CHAIN (decl
) = prev
;
4812 /* Count the subblocks of the list starting with BLOCK, and list them
4813 all into the vector VECTOR. Also clear TREE_ASM_WRITTEN in all
4817 all_blocks (block
, vector
)
4825 TREE_ASM_WRITTEN (block
) = 0;
4827 /* Record this block. */
4829 vector
[n_blocks
] = block
;
4833 /* Record the subblocks, and their subblocks... */
4834 n_blocks
+= all_blocks (BLOCK_SUBBLOCKS (block
),
4835 vector
? vector
+ n_blocks
: 0);
4836 block
= BLOCK_CHAIN (block
);
4842 /* Build bytecode call descriptor for function SUBR. */
4845 bc_build_calldesc (subr
)
4848 tree calldesc
= 0, arg
;
4851 /* Build the argument description vector in reverse order. */
4852 DECL_ARGUMENTS (subr
) = nreverse (DECL_ARGUMENTS (subr
));
4855 for (arg
= DECL_ARGUMENTS (subr
); arg
; arg
= TREE_CHAIN (arg
))
4859 calldesc
= tree_cons ((tree
) 0, size_in_bytes (TREE_TYPE (arg
)), calldesc
);
4860 calldesc
= tree_cons ((tree
) 0, bc_runtime_type_code (TREE_TYPE (arg
)), calldesc
);
4863 DECL_ARGUMENTS (subr
) = nreverse (DECL_ARGUMENTS (subr
));
4865 /* Prepend the function's return type. */
4866 calldesc
= tree_cons ((tree
) 0,
4867 size_in_bytes (TREE_TYPE (TREE_TYPE (subr
))),
4870 calldesc
= tree_cons ((tree
) 0,
4871 bc_runtime_type_code (TREE_TYPE (TREE_TYPE (subr
))),
4874 /* Prepend the arg count. */
4875 calldesc
= tree_cons ((tree
) 0, build_int_2 (nargs
, 0), calldesc
);
4877 /* Output the call description vector and get its address. */
4878 calldesc
= build_nt (CONSTRUCTOR
, (tree
) 0, calldesc
);
4879 TREE_TYPE (calldesc
) = build_array_type (integer_type_node
,
4880 build_index_type (build_int_2 (nargs
* 2, 0)));
4882 return output_constant_def (calldesc
);
4886 /* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
4887 and initialize static variables for generating RTL for the statements
4891 init_function_start (subr
, filename
, line
)
4898 if (output_bytecode
)
4900 this_function_decl
= subr
;
4901 this_function_calldesc
= bc_build_calldesc (subr
);
4902 local_vars_size
= 0;
4904 max_stack_depth
= 0;
4905 stmt_expr_depth
= 0;
4909 init_stmt_for_function ();
4911 cse_not_expected
= ! optimize
;
4913 /* Caller save not needed yet. */
4914 caller_save_needed
= 0;
4916 /* No stack slots have been made yet. */
4917 stack_slot_list
= 0;
4919 /* There is no stack slot for handling nonlocal gotos. */
4920 nonlocal_goto_handler_slot
= 0;
4921 nonlocal_goto_stack_level
= 0;
4923 /* No labels have been declared for nonlocal use. */
4924 nonlocal_labels
= 0;
4926 /* No function calls so far in this function. */
4927 function_call_count
= 0;
4929 /* No parm regs have been allocated.
4930 (This is important for output_inline_function.) */
4931 max_parm_reg
= LAST_VIRTUAL_REGISTER
+ 1;
4933 /* Initialize the RTL mechanism. */
4936 /* Initialize the queue of pending postincrement and postdecrements,
4937 and some other info in expr.c. */
4940 /* We haven't done register allocation yet. */
4943 init_const_rtx_hash_table ();
4945 current_function_name
= (*decl_printable_name
) (subr
, &junk
);
4947 /* Nonzero if this is a nested function that uses a static chain. */
4949 current_function_needs_context
4950 = (decl_function_context (current_function_decl
) != 0
4951 && ! DECL_NO_STATIC_CHAIN (current_function_decl
));
4953 /* Set if a call to setjmp is seen. */
4954 current_function_calls_setjmp
= 0;
4956 /* Set if a call to longjmp is seen. */
4957 current_function_calls_longjmp
= 0;
4959 current_function_calls_alloca
= 0;
4960 current_function_has_nonlocal_label
= 0;
4961 current_function_has_nonlocal_goto
= 0;
4962 current_function_contains_functions
= 0;
4964 current_function_returns_pcc_struct
= 0;
4965 current_function_returns_struct
= 0;
4966 current_function_epilogue_delay_list
= 0;
4967 current_function_uses_const_pool
= 0;
4968 current_function_uses_pic_offset_table
= 0;
4970 /* We have not yet needed to make a label to jump to for tail-recursion. */
4971 tail_recursion_label
= 0;
4973 /* We haven't had a need to make a save area for ap yet. */
4975 arg_pointer_save_area
= 0;
4977 /* No stack slots allocated yet. */
4980 /* No SAVE_EXPRs in this function yet. */
4983 /* No RTL_EXPRs in this function yet. */
4986 /* Set up to allocate temporaries. */
4989 /* Within function body, compute a type's size as soon it is laid out. */
4990 immediate_size_expand
++;
4992 /* We haven't made any trampolines for this function yet. */
4993 trampoline_list
= 0;
4995 init_pending_stack_adjust ();
4996 inhibit_defer_pop
= 0;
4998 current_function_outgoing_args_size
= 0;
5000 /* Prevent ever trying to delete the first instruction of a function.
5001 Also tell final how to output a linenum before the function prologue. */
5002 emit_line_note (filename
, line
);
5004 /* Make sure first insn is a note even if we don't want linenums.
5005 This makes sure the first insn will never be deleted.
5006 Also, final expects a note to appear there. */
5007 emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
5009 /* Set flags used by final.c. */
5010 if (aggregate_value_p (DECL_RESULT (subr
)))
5012 #ifdef PCC_STATIC_STRUCT_RETURN
5013 current_function_returns_pcc_struct
= 1;
5015 current_function_returns_struct
= 1;
5018 /* Warn if this value is an aggregate type,
5019 regardless of which calling convention we are using for it. */
5020 if (warn_aggregate_return
5021 && AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
))))
5022 warning ("function returns an aggregate");
5024 current_function_returns_pointer
5025 = POINTER_TYPE_P (TREE_TYPE (DECL_RESULT (subr
)));
5027 /* Indicate that we need to distinguish between the return value of the
5028 present function and the return value of a function being called. */
5029 rtx_equal_function_value_matters
= 1;
5031 /* Indicate that we have not instantiated virtual registers yet. */
5032 virtuals_instantiated
= 0;
5034 /* Indicate we have no need of a frame pointer yet. */
5035 frame_pointer_needed
= 0;
5037 /* By default assume not varargs or stdarg. */
5038 current_function_varargs
= 0;
5039 current_function_stdarg
= 0;
5042 /* Indicate that the current function uses extra args
5043 not explicitly mentioned in the argument list in any fashion. */
5048 current_function_varargs
= 1;
5051 /* Expand a call to __main at the beginning of a possible main function. */
5053 #if defined(INIT_SECTION_ASM_OP) && !defined(INVOKE__main)
5054 #undef HAS_INIT_SECTION
5055 #define HAS_INIT_SECTION
5059 expand_main_function ()
5061 if (!output_bytecode
)
5063 /* The zero below avoids a possible parse error */
5065 #if !defined (HAS_INIT_SECTION)
5066 emit_library_call (gen_rtx (SYMBOL_REF
, Pmode
, NAME__MAIN
), 0,
5068 #endif /* not HAS_INIT_SECTION */
5072 extern struct obstack permanent_obstack
;
5074 /* Expand start of bytecode function. See comment at
5075 expand_function_start below for details. */
5078 bc_expand_function_start (subr
, parms_have_cleanups
)
5080 int parms_have_cleanups
;
5082 char label
[20], *name
;
5087 if (TREE_PUBLIC (subr
))
5088 bc_globalize_label (IDENTIFIER_POINTER (DECL_NAME (subr
)));
5090 #ifdef DEBUG_PRINT_CODE
5091 fprintf (stderr
, "\n<func %s>\n", IDENTIFIER_POINTER (DECL_NAME (subr
)));
5094 for (argsz
= 0, thisarg
= DECL_ARGUMENTS (subr
); thisarg
; thisarg
= TREE_CHAIN (thisarg
))
5096 if (DECL_RTL (thisarg
))
5097 abort (); /* Should be NULL here I think. */
5098 else if (TREE_CONSTANT (DECL_SIZE (thisarg
)))
5100 DECL_RTL (thisarg
) = bc_gen_rtx ((char *) 0, argsz
, (struct bc_label
*) 0);
5101 argsz
+= TREE_INT_CST_LOW (DECL_SIZE (thisarg
));
5105 /* Variable-sized objects are pointers to their storage. */
5106 DECL_RTL (thisarg
) = bc_gen_rtx ((char *) 0, argsz
, (struct bc_label
*) 0);
5107 argsz
+= POINTER_SIZE
;
5111 bc_begin_function (xstrdup (IDENTIFIER_POINTER (DECL_NAME (subr
))));
5113 ASM_GENERATE_INTERNAL_LABEL (label
, "LX", nlab
);
5116 name
= (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
5117 this_function_callinfo
= bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
5118 this_function_bytecode
=
5119 bc_emit_trampoline (BYTECODE_LABEL (this_function_callinfo
));
5123 /* Expand end of bytecode function. See details the comment of
5124 expand_function_end(), below. */
5127 bc_expand_function_end ()
5131 expand_null_return ();
5133 /* Emit any fixup code. This must be done before the call to
5134 to BC_END_FUNCTION (), since that will cause the bytecode
5135 segment to be finished off and closed. */
5137 expand_fixups (NULL_RTX
);
5139 ptrconsts
= bc_end_function ();
5141 bc_align_const (2 /* INT_ALIGN */);
5143 /* If this changes also make sure to change bc-interp.h! */
5145 bc_emit_const_labeldef (BYTECODE_LABEL (this_function_callinfo
));
5146 bc_emit_const ((char *) &max_stack_depth
, sizeof max_stack_depth
);
5147 bc_emit_const ((char *) &local_vars_size
, sizeof local_vars_size
);
5148 bc_emit_const_labelref (this_function_bytecode
, 0);
5149 bc_emit_const_labelref (ptrconsts
, 0);
5150 bc_emit_const_labelref (BYTECODE_LABEL (this_function_calldesc
), 0);
5154 /* Start the RTL for a new function, and set variables used for
5156 SUBR is the FUNCTION_DECL node.
5157 PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
5158 the function's parameters, which must be run at any return statement. */
5161 expand_function_start (subr
, parms_have_cleanups
)
5163 int parms_have_cleanups
;
5169 if (output_bytecode
)
5171 bc_expand_function_start (subr
, parms_have_cleanups
);
5175 /* Make sure volatile mem refs aren't considered
5176 valid operands of arithmetic insns. */
5177 init_recog_no_volatile ();
5179 /* If function gets a static chain arg, store it in the stack frame.
5180 Do this first, so it gets the first stack slot offset. */
5181 if (current_function_needs_context
)
5183 last_ptr
= assign_stack_local (Pmode
, GET_MODE_SIZE (Pmode
), 0);
5185 #ifdef SMALL_REGISTER_CLASSES
5186 /* Delay copying static chain if it is not a register to avoid
5187 conflicts with regs used for parameters. */
5188 if (! SMALL_REGISTER_CLASSES
5189 || GET_CODE (static_chain_incoming_rtx
) == REG
)
5191 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
5194 /* If the parameters of this function need cleaning up, get a label
5195 for the beginning of the code which executes those cleanups. This must
5196 be done before doing anything with return_label. */
5197 if (parms_have_cleanups
)
5198 cleanup_label
= gen_label_rtx ();
5202 /* Make the label for return statements to jump to, if this machine
5203 does not have a one-instruction return and uses an epilogue,
5204 or if it returns a structure, or if it has parm cleanups. */
5206 if (cleanup_label
== 0 && HAVE_return
5207 && ! current_function_returns_pcc_struct
5208 && ! (current_function_returns_struct
&& ! optimize
))
5211 return_label
= gen_label_rtx ();
5213 return_label
= gen_label_rtx ();
5216 /* Initialize rtx used to return the value. */
5217 /* Do this before assign_parms so that we copy the struct value address
5218 before any library calls that assign parms might generate. */
5220 /* Decide whether to return the value in memory or in a register. */
5221 if (aggregate_value_p (DECL_RESULT (subr
)))
5223 /* Returning something that won't go in a register. */
5224 register rtx value_address
= 0;
5226 #ifdef PCC_STATIC_STRUCT_RETURN
5227 if (current_function_returns_pcc_struct
)
5229 int size
= int_size_in_bytes (TREE_TYPE (DECL_RESULT (subr
)));
5230 value_address
= assemble_static_space (size
);
5235 /* Expect to be passed the address of a place to store the value.
5236 If it is passed as an argument, assign_parms will take care of
5238 if (struct_value_incoming_rtx
)
5240 value_address
= gen_reg_rtx (Pmode
);
5241 emit_move_insn (value_address
, struct_value_incoming_rtx
);
5246 DECL_RTL (DECL_RESULT (subr
))
5247 = gen_rtx (MEM
, DECL_MODE (DECL_RESULT (subr
)), value_address
);
5248 MEM_IN_STRUCT_P (DECL_RTL (DECL_RESULT (subr
)))
5249 = AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr
)));
5252 else if (DECL_MODE (DECL_RESULT (subr
)) == VOIDmode
)
5253 /* If return mode is void, this decl rtl should not be used. */
5254 DECL_RTL (DECL_RESULT (subr
)) = 0;
5255 else if (parms_have_cleanups
)
5257 /* If function will end with cleanup code for parms,
5258 compute the return values into a pseudo reg,
5259 which we will copy into the true return register
5260 after the cleanups are done. */
5262 enum machine_mode mode
= DECL_MODE (DECL_RESULT (subr
));
5264 #ifdef PROMOTE_FUNCTION_RETURN
5265 tree type
= TREE_TYPE (DECL_RESULT (subr
));
5266 int unsignedp
= TREE_UNSIGNED (type
);
5268 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
5271 DECL_RTL (DECL_RESULT (subr
)) = gen_reg_rtx (mode
);
5274 /* Scalar, returned in a register. */
5276 #ifdef FUNCTION_OUTGOING_VALUE
5277 DECL_RTL (DECL_RESULT (subr
))
5278 = FUNCTION_OUTGOING_VALUE (TREE_TYPE (DECL_RESULT (subr
)), subr
);
5280 DECL_RTL (DECL_RESULT (subr
))
5281 = FUNCTION_VALUE (TREE_TYPE (DECL_RESULT (subr
)), subr
);
5284 /* Mark this reg as the function's return value. */
5285 if (GET_CODE (DECL_RTL (DECL_RESULT (subr
))) == REG
)
5287 REG_FUNCTION_VALUE_P (DECL_RTL (DECL_RESULT (subr
))) = 1;
5288 /* Needed because we may need to move this to memory
5289 in case it's a named return value whose address is taken. */
5290 DECL_REGISTER (DECL_RESULT (subr
)) = 1;
5294 /* Initialize rtx for parameters and local variables.
5295 In some cases this requires emitting insns. */
5297 assign_parms (subr
, 0);
5299 #ifdef SMALL_REGISTER_CLASSES
5300 /* Copy the static chain now if it wasn't a register. The delay is to
5301 avoid conflicts with the parameter passing registers. */
5303 if (SMALL_REGISTER_CLASSES
&& current_function_needs_context
)
5304 if (GET_CODE (static_chain_incoming_rtx
) != REG
)
5305 emit_move_insn (last_ptr
, static_chain_incoming_rtx
);
5308 /* The following was moved from init_function_start.
5309 The move is supposed to make sdb output more accurate. */
5310 /* Indicate the beginning of the function body,
5311 as opposed to parm setup. */
5312 emit_note (NULL_PTR
, NOTE_INSN_FUNCTION_BEG
);
5314 /* If doing stupid allocation, mark parms as born here. */
5316 if (GET_CODE (get_last_insn ()) != NOTE
)
5317 emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
5318 parm_birth_insn
= get_last_insn ();
5322 for (i
= LAST_VIRTUAL_REGISTER
+ 1; i
< max_parm_reg
; i
++)
5323 use_variable (regno_reg_rtx
[i
]);
5325 if (current_function_internal_arg_pointer
!= virtual_incoming_args_rtx
)
5326 use_variable (current_function_internal_arg_pointer
);
5329 context_display
= 0;
5330 if (current_function_needs_context
)
5332 /* Fetch static chain values for containing functions. */
5333 tem
= decl_function_context (current_function_decl
);
5334 /* If not doing stupid register allocation copy the static chain
5335 pointer into a pseudo. If we have small register classes, copy
5336 the value from memory if static_chain_incoming_rtx is a REG. If
5337 we do stupid register allocation, we use the stack address
5339 if (tem
&& ! obey_regdecls
)
5341 #ifdef SMALL_REGISTER_CLASSES
5342 /* If the static chain originally came in a register, put it back
5343 there, then move it out in the next insn. The reason for
5344 this peculiar code is to satisfy function integration. */
5345 if (SMALL_REGISTER_CLASSES
5346 && GET_CODE (static_chain_incoming_rtx
) == REG
)
5347 emit_move_insn (static_chain_incoming_rtx
, last_ptr
);
5350 last_ptr
= copy_to_reg (static_chain_incoming_rtx
);
5355 tree rtlexp
= make_node (RTL_EXPR
);
5357 RTL_EXPR_RTL (rtlexp
) = last_ptr
;
5358 context_display
= tree_cons (tem
, rtlexp
, context_display
);
5359 tem
= decl_function_context (tem
);
5362 /* Chain thru stack frames, assuming pointer to next lexical frame
5363 is found at the place we always store it. */
5364 #ifdef FRAME_GROWS_DOWNWARD
5365 last_ptr
= plus_constant (last_ptr
, - GET_MODE_SIZE (Pmode
));
5367 last_ptr
= copy_to_reg (gen_rtx (MEM
, Pmode
,
5368 memory_address (Pmode
, last_ptr
)));
5370 /* If we are not optimizing, ensure that we know that this
5371 piece of context is live over the entire function. */
5373 save_expr_regs
= gen_rtx (EXPR_LIST
, VOIDmode
, last_ptr
,
5378 /* After the display initializations is where the tail-recursion label
5379 should go, if we end up needing one. Ensure we have a NOTE here
5380 since some things (like trampolines) get placed before this. */
5381 tail_recursion_reentry
= emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
5383 /* Evaluate now the sizes of any types declared among the arguments. */
5384 for (tem
= nreverse (get_pending_sizes ()); tem
; tem
= TREE_CHAIN (tem
))
5385 expand_expr (TREE_VALUE (tem
), const0_rtx
, VOIDmode
, 0);
5387 /* Make sure there is a line number after the function entry setup code. */
5388 force_next_line_note ();
5391 /* Generate RTL for the end of the current function.
5392 FILENAME and LINE are the current position in the source file.
5394 It is up to language-specific callers to do cleanups for parameters--
5395 or else, supply 1 for END_BINDINGS and we will call expand_end_bindings. */
5398 expand_function_end (filename
, line
, end_bindings
)
5406 #ifdef TRAMPOLINE_TEMPLATE
5407 static rtx initial_trampoline
;
5410 if (output_bytecode
)
5412 bc_expand_function_end ();
5416 #ifdef NON_SAVING_SETJMP
5417 /* Don't put any variables in registers if we call setjmp
5418 on a machine that fails to restore the registers. */
5419 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
5421 if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
5422 setjmp_protect (DECL_INITIAL (current_function_decl
));
5424 setjmp_protect_args ();
5428 /* Save the argument pointer if a save area was made for it. */
5429 if (arg_pointer_save_area
)
5431 rtx x
= gen_move_insn (arg_pointer_save_area
, virtual_incoming_args_rtx
);
5432 emit_insn_before (x
, tail_recursion_reentry
);
5435 /* Initialize any trampolines required by this function. */
5436 for (link
= trampoline_list
; link
; link
= TREE_CHAIN (link
))
5438 tree function
= TREE_PURPOSE (link
);
5439 rtx context
= lookup_static_chain (function
);
5440 rtx tramp
= RTL_EXPR_RTL (TREE_VALUE (link
));
5444 #ifdef TRAMPOLINE_TEMPLATE
5445 /* First make sure this compilation has a template for
5446 initializing trampolines. */
5447 if (initial_trampoline
== 0)
5449 end_temporary_allocation ();
5451 = gen_rtx (MEM
, BLKmode
, assemble_trampoline_template ());
5452 resume_temporary_allocation ();
5456 /* Generate insns to initialize the trampoline. */
5458 tramp
= round_trampoline_addr (XEXP (tramp
, 0));
5459 #ifdef TRAMPOLINE_TEMPLATE
5460 blktramp
= change_address (initial_trampoline
, BLKmode
, tramp
);
5461 emit_block_move (blktramp
, initial_trampoline
,
5462 GEN_INT (TRAMPOLINE_SIZE
),
5463 FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
5465 INITIALIZE_TRAMPOLINE (tramp
, XEXP (DECL_RTL (function
), 0), context
);
5469 /* Put those insns at entry to the containing function (this one). */
5470 emit_insns_before (seq
, tail_recursion_reentry
);
5473 /* Warn about unused parms if extra warnings were specified. */
5474 if (warn_unused
&& extra_warnings
)
5478 for (decl
= DECL_ARGUMENTS (current_function_decl
);
5479 decl
; decl
= TREE_CHAIN (decl
))
5480 if (! TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
5481 && DECL_NAME (decl
) && ! DECL_ARTIFICIAL (decl
))
5482 warning_with_decl (decl
, "unused parameter `%s'");
5485 /* Delete handlers for nonlocal gotos if nothing uses them. */
5486 if (nonlocal_goto_handler_slot
!= 0 && !current_function_has_nonlocal_label
)
5489 /* End any sequences that failed to be closed due to syntax errors. */
5490 while (in_sequence_p ())
5493 /* Outside function body, can't compute type's actual size
5494 until next function's body starts. */
5495 immediate_size_expand
--;
5497 /* If doing stupid register allocation,
5498 mark register parms as dying here. */
5503 for (i
= LAST_VIRTUAL_REGISTER
+ 1; i
< max_parm_reg
; i
++)
5504 use_variable (regno_reg_rtx
[i
]);
5506 /* Likewise for the regs of all the SAVE_EXPRs in the function. */
5508 for (tem
= save_expr_regs
; tem
; tem
= XEXP (tem
, 1))
5510 use_variable (XEXP (tem
, 0));
5511 use_variable_after (XEXP (tem
, 0), parm_birth_insn
);
5514 if (current_function_internal_arg_pointer
!= virtual_incoming_args_rtx
)
5515 use_variable (current_function_internal_arg_pointer
);
5518 clear_pending_stack_adjust ();
5519 do_pending_stack_adjust ();
5521 /* Mark the end of the function body.
5522 If control reaches this insn, the function can drop through
5523 without returning a value. */
5524 emit_note (NULL_PTR
, NOTE_INSN_FUNCTION_END
);
5526 /* Output a linenumber for the end of the function.
5527 SDB depends on this. */
5528 emit_line_note_force (filename
, line
);
5530 /* Output the label for the actual return from the function,
5531 if one is expected. This happens either because a function epilogue
5532 is used instead of a return instruction, or because a return was done
5533 with a goto in order to run local cleanups, or because of pcc-style
5534 structure returning. */
5537 emit_label (return_label
);
5539 /* C++ uses this. */
5541 expand_end_bindings (0, 0, 0);
5543 /* If we had calls to alloca, and this machine needs
5544 an accurate stack pointer to exit the function,
5545 insert some code to save and restore the stack pointer. */
5546 #ifdef EXIT_IGNORE_STACK
5547 if (! EXIT_IGNORE_STACK
)
5549 if (current_function_calls_alloca
)
5553 emit_stack_save (SAVE_FUNCTION
, &tem
, parm_birth_insn
);
5554 emit_stack_restore (SAVE_FUNCTION
, tem
, NULL_RTX
);
5557 /* If scalar return value was computed in a pseudo-reg,
5558 copy that to the hard return register. */
5559 if (DECL_RTL (DECL_RESULT (current_function_decl
)) != 0
5560 && GET_CODE (DECL_RTL (DECL_RESULT (current_function_decl
))) == REG
5561 && (REGNO (DECL_RTL (DECL_RESULT (current_function_decl
)))
5562 >= FIRST_PSEUDO_REGISTER
))
5564 rtx real_decl_result
;
5566 #ifdef FUNCTION_OUTGOING_VALUE
5568 = FUNCTION_OUTGOING_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl
)),
5569 current_function_decl
);
5572 = FUNCTION_VALUE (TREE_TYPE (DECL_RESULT (current_function_decl
)),
5573 current_function_decl
);
5575 REG_FUNCTION_VALUE_P (real_decl_result
) = 1;
5576 /* If this is a BLKmode structure being returned in registers, then use
5577 the mode computed in expand_return. */
5578 if (GET_MODE (real_decl_result
) == BLKmode
)
5579 PUT_MODE (real_decl_result
,
5580 GET_MODE (DECL_RTL (DECL_RESULT (current_function_decl
))));
5581 emit_move_insn (real_decl_result
,
5582 DECL_RTL (DECL_RESULT (current_function_decl
)));
5583 emit_insn (gen_rtx (USE
, VOIDmode
, real_decl_result
));
5586 /* If returning a structure, arrange to return the address of the value
5587 in a place where debuggers expect to find it.
5589 If returning a structure PCC style,
5590 the caller also depends on this value.
5591 And current_function_returns_pcc_struct is not necessarily set. */
5592 if (current_function_returns_struct
5593 || current_function_returns_pcc_struct
)
5595 rtx value_address
= XEXP (DECL_RTL (DECL_RESULT (current_function_decl
)), 0);
5596 tree type
= TREE_TYPE (DECL_RESULT (current_function_decl
));
5597 #ifdef FUNCTION_OUTGOING_VALUE
5599 = FUNCTION_OUTGOING_VALUE (build_pointer_type (type
),
5600 current_function_decl
);
5603 = FUNCTION_VALUE (build_pointer_type (type
),
5604 current_function_decl
);
5607 /* Mark this as a function return value so integrate will delete the
5608 assignment and USE below when inlining this function. */
5609 REG_FUNCTION_VALUE_P (outgoing
) = 1;
5611 emit_move_insn (outgoing
, value_address
);
5612 use_variable (outgoing
);
5615 /* Output a return insn if we are using one.
5616 Otherwise, let the rtl chain end here, to drop through
5617 into the epilogue. */
5622 emit_jump_insn (gen_return ());
5627 /* Fix up any gotos that jumped out to the outermost
5628 binding level of the function.
5629 Must follow emitting RETURN_LABEL. */
5631 /* If you have any cleanups to do at this point,
5632 and they need to create temporary variables,
5633 then you will lose. */
5634 expand_fixups (get_insns ());
5637 /* These arrays record the INSN_UIDs of the prologue and epilogue insns. */
5639 static int *prologue
;
5640 static int *epilogue
;
5642 /* Create an array that records the INSN_UIDs of INSNS (either a sequence
5643 or a single insn). */
5646 record_insns (insns
)
5651 if (GET_CODE (insns
) == SEQUENCE
)
5653 int len
= XVECLEN (insns
, 0);
5654 vec
= (int *) oballoc ((len
+ 1) * sizeof (int));
5657 vec
[len
] = INSN_UID (XVECEXP (insns
, 0, len
));
5661 vec
= (int *) oballoc (2 * sizeof (int));
5662 vec
[0] = INSN_UID (insns
);
5668 /* Determine how many INSN_UIDs in VEC are part of INSN. */
5671 contains (insn
, vec
)
5677 if (GET_CODE (insn
) == INSN
5678 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
5681 for (i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
5682 for (j
= 0; vec
[j
]; j
++)
5683 if (INSN_UID (XVECEXP (PATTERN (insn
), 0, i
)) == vec
[j
])
5689 for (j
= 0; vec
[j
]; j
++)
5690 if (INSN_UID (insn
) == vec
[j
])
5696 /* Generate the prologue and epilogue RTL if the machine supports it. Thread
5697 this into place with notes indicating where the prologue ends and where
5698 the epilogue begins. Update the basic block information when possible. */
5701 thread_prologue_and_epilogue_insns (f
)
5704 #ifdef HAVE_prologue
5707 rtx head
, seq
, insn
;
5709 /* The first insn (a NOTE_INSN_DELETED) is followed by zero or more
5710 prologue insns and a NOTE_INSN_PROLOGUE_END. */
5711 emit_note_after (NOTE_INSN_PROLOGUE_END
, f
);
5712 seq
= gen_prologue ();
5713 head
= emit_insn_after (seq
, f
);
5715 /* Include the new prologue insns in the first block. Ignore them
5716 if they form a basic block unto themselves. */
5717 if (basic_block_head
&& n_basic_blocks
5718 && GET_CODE (basic_block_head
[0]) != CODE_LABEL
)
5719 basic_block_head
[0] = NEXT_INSN (f
);
5721 /* Retain a map of the prologue insns. */
5722 prologue
= record_insns (GET_CODE (seq
) == SEQUENCE
? seq
: head
);
5728 #ifdef HAVE_epilogue
5731 rtx insn
= get_last_insn ();
5732 rtx prev
= prev_nonnote_insn (insn
);
5734 /* If we end with a BARRIER, we don't need an epilogue. */
5735 if (! (prev
&& GET_CODE (prev
) == BARRIER
))
5741 /* The last basic block ends with a NOTE_INSN_EPILOGUE_BEG, the
5742 epilogue insns, the USE insns at the end of a function,
5743 the jump insn that returns, and then a BARRIER. */
5745 /* Move the USE insns at the end of a function onto a list. */
5747 && GET_CODE (prev
) == INSN
5748 && GET_CODE (PATTERN (prev
)) == USE
)
5751 prev
= prev_nonnote_insn (prev
);
5753 NEXT_INSN (PREV_INSN (tem
)) = NEXT_INSN (tem
);
5754 PREV_INSN (NEXT_INSN (tem
)) = PREV_INSN (tem
);
5757 NEXT_INSN (tem
) = first_use
;
5758 PREV_INSN (first_use
) = tem
;
5765 emit_barrier_after (insn
);
5767 seq
= gen_epilogue ();
5768 tail
= emit_jump_insn_after (seq
, insn
);
5770 /* Insert the USE insns immediately before the return insn, which
5771 must be the first instruction before the final barrier. */
5774 tem
= prev_nonnote_insn (get_last_insn ());
5775 NEXT_INSN (PREV_INSN (tem
)) = first_use
;
5776 PREV_INSN (first_use
) = PREV_INSN (tem
);
5777 PREV_INSN (tem
) = last_use
;
5778 NEXT_INSN (last_use
) = tem
;
5781 emit_note_after (NOTE_INSN_EPILOGUE_BEG
, insn
);
5783 /* Include the new epilogue insns in the last block. Ignore
5784 them if they form a basic block unto themselves. */
5785 if (basic_block_end
&& n_basic_blocks
5786 && GET_CODE (basic_block_end
[n_basic_blocks
- 1]) != JUMP_INSN
)
5787 basic_block_end
[n_basic_blocks
- 1] = tail
;
5789 /* Retain a map of the epilogue insns. */
5790 epilogue
= record_insns (GET_CODE (seq
) == SEQUENCE
? seq
: tail
);
5798 /* Reposition the prologue-end and epilogue-begin notes after instruction
5799 scheduling and delayed branch scheduling. */
5802 reposition_prologue_and_epilogue_notes (f
)
5805 #if defined (HAVE_prologue) || defined (HAVE_epilogue)
5806 /* Reposition the prologue and epilogue notes. */
5814 register rtx insn
, note
= 0;
5816 /* Scan from the beginning until we reach the last prologue insn.
5817 We apparently can't depend on basic_block_{head,end} after
5819 for (len
= 0; prologue
[len
]; len
++)
5821 for (insn
= f
; len
&& insn
; insn
= NEXT_INSN (insn
))
5823 if (GET_CODE (insn
) == NOTE
)
5825 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
5828 else if ((len
-= contains (insn
, prologue
)) == 0)
5830 /* Find the prologue-end note if we haven't already, and
5831 move it to just after the last prologue insn. */
5834 for (note
= insn
; note
= NEXT_INSN (note
);)
5835 if (GET_CODE (note
) == NOTE
5836 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_PROLOGUE_END
)
5839 next
= NEXT_INSN (note
);
5840 prev
= PREV_INSN (note
);
5842 NEXT_INSN (prev
) = next
;
5844 PREV_INSN (next
) = prev
;
5845 add_insn_after (note
, insn
);
5852 register rtx insn
, note
= 0;
5854 /* Scan from the end until we reach the first epilogue insn.
5855 We apparently can't depend on basic_block_{head,end} after
5857 for (len
= 0; epilogue
[len
]; len
++)
5859 for (insn
= get_last_insn (); len
&& insn
; insn
= PREV_INSN (insn
))
5861 if (GET_CODE (insn
) == NOTE
)
5863 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
5866 else if ((len
-= contains (insn
, epilogue
)) == 0)
5868 /* Find the epilogue-begin note if we haven't already, and
5869 move it to just before the first epilogue insn. */
5872 for (note
= insn
; note
= PREV_INSN (note
);)
5873 if (GET_CODE (note
) == NOTE
5874 && NOTE_LINE_NUMBER (note
) == NOTE_INSN_EPILOGUE_BEG
)
5877 next
= NEXT_INSN (note
);
5878 prev
= PREV_INSN (note
);
5880 NEXT_INSN (prev
) = next
;
5882 PREV_INSN (next
) = prev
;
5883 add_insn_after (note
, PREV_INSN (insn
));
5888 #endif /* HAVE_prologue or HAVE_epilogue */