/* Structure for saving state for a nested function.
Copyright (C) 1989, 1992 Free Software Foundation, Inc.
This file is part of GNU CC.
GNU CC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
enum machine_mode promoted_mode
;
struct var_refs_queue
*next
;
/* Stack of pending (incomplete) sequences saved by `start_sequence'.
Each element describes one pending sequence.
The main insn-chain is saved in the last element of the chain,
unless the chain is empty. */
/* First and last insns in the chain of the saved sequence. */
struct sequence_stack
*next
;
extern struct sequence_stack
*sequence_stack
;
/* This structure can save all the important global and static variables
describing the status of the current function. */
rtx nonlocal_goto_handler_slot
;
rtx nonlocal_goto_stack_level
;
rtx tail_recursion_label
;
rtx tail_recursion_reentry
;
rtx internal_arg_pointer
;
rtx arg_pointer_save_area
;
struct temp_slot
*temp_slots
;
/* This slot is initialized as 0 and is added to
during the nested function. */
struct var_refs_queue
*fixup_var_refs_queue
;
struct nesting
*block_stack
;
struct nesting
*stack_block_stack
;
struct nesting
*cond_stack
;
struct nesting
*loop_stack
;
struct nesting
*case_stack
;
struct nesting
*nesting_stack
;
int expr_stmts_for_value
;
struct goto_fixup
*goto_fixup_chain
;
int pending_stack_adjust
;
struct sequence_stack
*sequence_stack
;
char *regno_pointer_flag
;
int regno_pointer_flag_length
;
tree permanent_type_chain
;
tree temporary_type_chain
;
int immediate_size_expand
;
struct momentary_level
*momentary_stack
;
char *maybepermanent_firstobj
;
char *temporary_firstobj
;
char *momentary_firstobj
;
struct obstack
*current_obstack
;
struct obstack
*function_obstack
;
struct obstack
*function_maybepermanent_obstack
;
struct obstack
*expression_obstack
;
struct obstack
*saveable_obstack
;
struct obstack
*rtl_obstack
;
int uses_pic_offset_table
;
struct constant_descriptor
**const_rtx_hash_table
;
struct pool_sym
**const_rtx_sym_hash_table
;
struct pool_constant
*first_pool
, *last_pool
;
/* The FUNCTION_DECL for an inline function currently being expanded. */
extern tree inline_function_decl
;
/* Label that will go on function epilogue.
Jumping to this label serves as a "return" instruction
on machines which require execution of the epilogue on all returns. */
/* List (chain of EXPR_LISTs) of all stack slots in this function.
Made for the sake of unshare_all_rtl. */
extern rtx stack_slot_list
;
/* Given a function decl for a containing function,
return the `struct function' for it. */
struct function
*find_function_data
PROTO((tree
));
/* Pointer to chain of `struct function' for containing functions. */
extern struct function
*outer_function_chain
;
/* Put all this function's BLOCK nodes into a vector and return it.
Also store in each NOTE for the beginning or end of a block
the index of that block in the vector. */
tree
*identify_blocks
PROTO((tree
, rtx
));