1 /* Structure for saving state for a nested function.
2 Copyright (C) 1989, 1992 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
31 enum machine_mode promoted_mode;
33 struct var_refs_queue *next;
36 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
37 Each element describes one pending sequence.
38 The main insn-chain is saved in the last element of the chain,
39 unless the chain is empty. */
43 /* First and last insns in the chain of the saved sequence. */
45 struct sequence_stack *next;
48 extern struct sequence_stack *sequence_stack;
50 /* This structure can save all the important global and static variables
51 describing the status of the current function. */
55 struct function *next;
62 int returns_pcc_struct;
67 int has_nonlocal_label;
68 rtx nonlocal_goto_handler_slot;
69 rtx nonlocal_goto_stack_level;
72 int pretend_args_size;
75 rtx *parm_reg_stack_loc;
76 int outgoing_args_size;
84 rtx tail_recursion_label;
85 rtx tail_recursion_reentry;
86 rtx internal_arg_pointer;
87 rtx arg_pointer_save_area;
92 int function_call_count;
93 struct temp_slot *temp_slots;
95 /* This slot is initialized as 0 and is added to
96 during the nested function. */
97 struct var_refs_queue *fixup_var_refs_queue;
100 struct nesting *block_stack;
101 struct nesting *stack_block_stack;
102 struct nesting *cond_stack;
103 struct nesting *loop_stack;
104 struct nesting *case_stack;
105 struct nesting *nesting_stack;
107 int block_start_count;
110 int expr_stmts_for_value;
113 struct goto_fixup *goto_fixup_chain;
116 int pending_stack_adjust;
117 int inhibit_defer_pop;
118 tree cleanups_this_call;
120 rtx apply_args_value;
123 /* For emit-rtl.c. */
128 struct sequence_stack *sequence_stack;
132 char *regno_pointer_flag;
133 int regno_pointer_flag_length;
136 /* For stor-layout.c. */
137 tree permanent_type_chain;
138 tree temporary_type_chain;
139 tree permanent_type_end;
140 tree temporary_type_end;
142 int immediate_size_expand;
145 int all_types_permanent;
146 struct momentary_level *momentary_stack;
147 char *maybepermanent_firstobj;
148 char *temporary_firstobj;
149 char *momentary_firstobj;
150 struct obstack *current_obstack;
151 struct obstack *function_obstack;
152 struct obstack *function_maybepermanent_obstack;
153 struct obstack *expression_obstack;
154 struct obstack *saveable_obstack;
155 struct obstack *rtl_obstack;
157 /* For integrate.c. */
161 int uses_pic_offset_table;
164 rtx epilogue_delay_list;
167 struct constant_descriptor **const_rtx_hash_table;
168 struct pool_sym **const_rtx_sym_hash_table;
169 struct pool_constant *first_pool, *last_pool;
173 /* The FUNCTION_DECL for an inline function currently being expanded. */
174 extern tree inline_function_decl;
176 /* Label that will go on function epilogue.
177 Jumping to this label serves as a "return" instruction
178 on machines which require execution of the epilogue on all returns. */
179 extern rtx return_label;
181 /* List (chain of EXPR_LISTs) of all stack slots in this function.
182 Made for the sake of unshare_all_rtl. */
183 extern rtx stack_slot_list;
185 /* Given a function decl for a containing function,
186 return the `struct function' for it. */
187 struct function *find_function_data PROTO((tree));
189 /* Pointer to chain of `struct function' for containing functions. */
190 extern struct function *outer_function_chain;
192 /* Put all this function's BLOCK nodes into a vector and return it.
193 Also store in each NOTE for the beginning or end of a block
194 the index of that block in the vector. */
195 tree *identify_blocks PROTO((tree, rtx));