1 /* Structure for saving state for a nested function.
2 Copyright (C) 1989, 92-97, 1998 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 #if !defined(NULL_TREE) && !defined(tree)
23 typedef union union_node
*_function_tree
;
24 #define tree _function_tree
26 #if !defined(NULL_RTX) && !defined(rtx)
27 typedef struct rtx_def
*_function_rtx
;
28 #define rtx _function_rtx
34 enum machine_mode promoted_mode
;
36 struct var_refs_queue
*next
;
39 /* Stack of pending (incomplete) sequences saved by `start_sequence'.
40 Each element describes one pending sequence.
41 The main insn-chain is saved in the last element of the chain,
42 unless the chain is empty. */
46 /* First and last insns in the chain of the saved sequence. */
48 tree sequence_rtl_expr
;
49 struct sequence_stack
*next
;
52 extern struct sequence_stack
*sequence_stack
;
54 /* Stack of single obstacks. */
56 struct simple_obstack_stack
58 struct obstack
*obstack
;
59 struct simple_obstack_stack
*next
;
62 /* This structure can save all the important global and static variables
63 describing the status of the current function. */
67 struct function
*next_global
;
68 struct function
*next
;
77 int returns_pcc_struct
;
83 int has_nonlocal_label
;
84 int has_nonlocal_goto
;
85 int contains_functions
;
86 int has_computed_jump
;
88 rtx nonlocal_goto_handler_slots
;
89 rtx nonlocal_goto_handler_labels
;
90 rtx nonlocal_goto_stack_level
;
93 int pretend_args_size
;
98 rtx
*parm_reg_stack_loc
;
99 int outgoing_args_size
;
106 HOST_WIDE_INT frame_offset
;
107 rtx tail_recursion_label
;
108 rtx tail_recursion_reentry
;
109 rtx internal_arg_pointer
;
111 rtx arg_pointer_save_area
;
114 tree context_display
;
115 tree trampoline_list
;
116 int function_call_count
;
117 struct temp_slot
*temp_slots
;
119 int target_temp_slot_level
;
120 int var_temp_slot_level
;
121 int instrument_entry_exit
;
122 /* This slot is initialized as 0 and is added to
123 during the nested function. */
124 struct var_refs_queue
*fixup_var_refs_queue
;
125 CUMULATIVE_ARGS args_info
;
128 struct nesting
*block_stack
;
129 struct nesting
*stack_block_stack
;
130 struct nesting
*cond_stack
;
131 struct nesting
*loop_stack
;
132 struct nesting
*case_stack
;
133 struct nesting
*nesting_stack
;
135 int block_start_count
;
138 int expr_stmts_for_value
;
141 struct goto_fixup
*goto_fixup_chain
;
145 int pending_stack_adjust
;
146 int inhibit_defer_pop
;
148 rtx apply_args_value
;
150 int check_memory_usage
;
152 /* For emit-rtl.c. */
157 tree sequence_rtl_expr
;
158 struct sequence_stack
*sequence_stack
;
162 char *regno_pointer_flag
;
163 char *regno_pointer_align
;
164 int regno_pointer_flag_length
;
167 /* For stor-layout.c. */
168 tree permanent_type_chain
;
169 tree temporary_type_chain
;
170 tree permanent_type_end
;
171 tree temporary_type_end
;
173 int immediate_size_expand
;
176 int all_types_permanent
;
177 struct momentary_level
*momentary_stack
;
178 char *maybepermanent_firstobj
;
179 char *temporary_firstobj
;
180 char *momentary_firstobj
;
181 char *momentary_function_firstobj
;
182 struct obstack
*current_obstack
;
183 struct obstack
*function_obstack
;
184 struct obstack
*function_maybepermanent_obstack
;
185 struct obstack
*expression_obstack
;
186 struct obstack
*saveable_obstack
;
187 struct obstack
*rtl_obstack
;
188 struct simple_obstack_stack
*inline_obstacks
;
190 /* For integrate.c. */
194 int uses_pic_offset_table
;
195 /* tm.h can use this to store whatever it likes. */
196 struct machine_function
*machine
;
199 rtx epilogue_delay_list
;
202 struct constant_descriptor
**const_rtx_hash_table
;
203 struct pool_sym
**const_rtx_sym_hash_table
;
204 struct pool_constant
*first_pool
, *last_pool
;
206 rtx const_double_chain
;
209 extern struct function
*current_function
;
210 extern struct function
*all_functions
;
212 /* The FUNCTION_DECL for an inline function currently being expanded. */
213 extern tree inline_function_decl
;
215 /* Label that will go on parm cleanup code, if any.
216 Jumping to this label runs cleanup code for parameters, if
217 such code must be run. Following this code is the logical return label. */
219 extern rtx cleanup_label
;
221 /* Label that will go on function epilogue.
222 Jumping to this label serves as a "return" instruction
223 on machines which require execution of the epilogue on all returns. */
225 extern rtx return_label
;
227 /* Offset to end of allocated area of stack frame.
228 If stack grows down, this is the address of the last stack slot allocated.
229 If stack grows up, this is the address for the next slot. */
230 extern HOST_WIDE_INT frame_offset
;
232 /* Label to jump back to for tail recursion, or 0 if we have
233 not yet needed one for this function. */
234 extern rtx tail_recursion_label
;
236 /* Place after which to insert the tail_recursion_label if we need one. */
237 extern rtx tail_recursion_reentry
;
239 /* Location at which to save the argument pointer if it will need to be
240 referenced. There are two cases where this is done: if nonlocal gotos
241 exist, or if vars whose is an offset from the argument pointer will be
242 needed by inner routines. */
244 extern rtx arg_pointer_save_area
;
246 /* Chain of all RTL_EXPRs that have insns in them. */
247 extern tree rtl_expr_chain
;
249 /* List (chain of EXPR_LISTs) of all stack slots in this function.
250 Made for the sake of unshare_all_rtl. */
251 extern rtx stack_slot_list
;
253 /* Given a function decl for a containing function,
254 return the `struct function' for it. */
255 struct function
*find_function_data
PROTO((tree
));
257 /* Pointer to chain of `struct function' for containing functions. */
258 extern struct function
*outer_function_chain
;
260 /* Put all this function's BLOCK nodes into a vector and return it.
261 Also store in each NOTE for the beginning or end of a block
262 the index of that block in the vector. */
263 extern tree
*identify_blocks
PROTO((tree
, rtx
));
265 /* Return size needed for stack frame based on slots so far allocated.
266 This size counts from zero. It is not rounded to STACK_BOUNDARY;
267 the caller may have to do that. */
268 extern HOST_WIDE_INT get_frame_size
PROTO((void));
270 /* These variables hold pointers to functions to
271 save and restore machine-specific data,
272 in push_function_context and pop_function_context. */
273 extern void (*save_machine_status
) PROTO((struct function
*));
274 extern void (*restore_machine_status
) PROTO((struct function
*));
276 /* Save and restore status information for a nested function. */
277 extern void save_tree_status
PROTO((struct function
*, tree
));
278 extern void restore_tree_status
PROTO((struct function
*, tree
));
279 extern void save_varasm_status
PROTO((struct function
*, tree
));
280 extern void restore_varasm_status
PROTO((struct function
*));
281 extern void save_eh_status
PROTO((struct function
*));
282 extern void restore_eh_status
PROTO((struct function
*));
283 extern void save_stmt_status
PROTO((struct function
*));
284 extern void restore_stmt_status
PROTO((struct function
*));
285 extern void save_expr_status
PROTO((struct function
*));
286 extern void restore_expr_status
PROTO((struct function
*));
287 extern void save_emit_status
PROTO((struct function
*));
288 extern void restore_emit_status
PROTO((struct function
*));
289 extern void save_storage_status
PROTO((struct function
*));
290 extern void restore_storage_status
PROTO((struct function
*));
292 extern rtx get_first_block_beg
PROTO((void));