]> gcc.gnu.org Git - gcc.git/blame - gcc/function.h
(expand_call): In target code, move PARALLEL case above
[gcc.git] / gcc / function.h
CommitLineData
bf6beae5 1/* Structure for saving state for a nested function.
04aa3b9c 2 Copyright (C) 1989, 92, 93, 94, 95, 1996 Free Software Foundation, Inc.
bf6beae5
CH
3
4This file is part of GNU CC.
5
6GNU CC is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2, or (at your option)
9any later version.
10
11GNU CC is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with GNU CC; see the file COPYING. If not, write to
a35311b0
RK
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
bf6beae5
CH
20
21
22#ifndef NULL_TREE
23#define tree int *
24#endif
25#ifndef GET_CODE
26#define rtx int *
27#endif
28
29struct var_refs_queue
a00b8dfa
RK
30{
31 rtx modified;
32 enum machine_mode promoted_mode;
33 int unsignedp;
34 struct var_refs_queue *next;
35};
bf6beae5
CH
36
37/* Stack of pending (incomplete) sequences saved by `start_sequence'.
38 Each element describes one pending sequence.
39 The main insn-chain is saved in the last element of the chain,
40 unless the chain is empty. */
41
42struct sequence_stack
43{
44 /* First and last insns in the chain of the saved sequence. */
45 rtx first, last;
f55eed99 46 tree sequence_rtl_expr;
bf6beae5
CH
47 struct sequence_stack *next;
48};
49
50extern struct sequence_stack *sequence_stack;
a0dabda5
JM
51
52/* Stack of single obstacks. */
53
54struct simple_obstack_stack
55{
56 struct obstack *obstack;
57 struct simple_obstack_stack *next;
58};
bf6beae5
CH
59\f
60/* This structure can save all the important global and static variables
61 describing the status of the current function. */
62
63struct function
64{
65 struct function *next;
66
67 /* For function.c. */
68 char *name;
69 tree decl;
70 int pops_args;
71 int returns_struct;
72 int returns_pcc_struct;
04aa3b9c 73 int returns_pointer;
bf6beae5
CH
74 int needs_context;
75 int calls_setjmp;
76 int calls_longjmp;
77 int calls_alloca;
78 int has_nonlocal_label;
67664664 79 int has_nonlocal_goto;
a0dabda5 80 int contains_functions;
bf6beae5
CH
81 rtx nonlocal_goto_handler_slot;
82 rtx nonlocal_goto_stack_level;
83 tree nonlocal_labels;
84 int args_size;
85 int pretend_args_size;
86 rtx arg_offset_rtx;
91ab952c 87 int varargs;
7da7e611 88 int stdarg;
bf6beae5
CH
89 int max_parm_reg;
90 rtx *parm_reg_stack_loc;
91 int outgoing_args_size;
92 rtx return_rtx;
93 rtx cleanup_label;
94 rtx return_label;
95 rtx save_expr_regs;
96 rtx stack_slot_list;
97 rtx parm_birth_insn;
98 int frame_offset;
99 rtx tail_recursion_label;
100 rtx tail_recursion_reentry;
101 rtx internal_arg_pointer;
102 rtx arg_pointer_save_area;
103 tree rtl_expr_chain;
104 rtx last_parm_insn;
105 tree context_display;
106 tree trampoline_list;
107 int function_call_count;
108 struct temp_slot *temp_slots;
109 int temp_slot_level;
110 /* This slot is initialized as 0 and is added to
111 during the nested function. */
112 struct var_refs_queue *fixup_var_refs_queue;
113
114 /* For stmt.c */
115 struct nesting *block_stack;
116 struct nesting *stack_block_stack;
117 struct nesting *cond_stack;
118 struct nesting *loop_stack;
119 struct nesting *case_stack;
120 struct nesting *nesting_stack;
121 int nesting_depth;
122 int block_start_count;
123 tree last_expr_type;
124 rtx last_expr_value;
125 int expr_stmts_for_value;
126 char *emit_filename;
127 int emit_lineno;
128 struct goto_fixup *goto_fixup_chain;
129
6adb4e3a
MS
130 /* For exception handling information. */
131 struct eh_stack ehstack;
132 struct eh_queue ehqueue;
133 rtx catch_clauses;
134 struct label_node *false_label_stack;
135 struct label_node *caught_return_label_stack;
136 tree protect_list;
137
bf6beae5
CH
138 /* For expr.c. */
139 int pending_stack_adjust;
140 int inhibit_defer_pop;
141 tree cleanups_this_call;
142 rtx saveregs_value;
d12b5382 143 rtx apply_args_value;
bf6beae5
CH
144 rtx forced_labels;
145
146 /* For emit-rtl.c. */
147 int reg_rtx_no;
148 int first_label_num;
149 rtx first_insn;
150 rtx last_insn;
f55eed99 151 tree sequence_rtl_expr;
bf6beae5
CH
152 struct sequence_stack *sequence_stack;
153 int cur_insn_uid;
154 int last_linenum;
155 char *last_filename;
156 char *regno_pointer_flag;
f30d95d2 157 char *regno_pointer_align;
bf6beae5
CH
158 int regno_pointer_flag_length;
159 rtx *regno_reg_rtx;
160
161 /* For stor-layout.c. */
162 tree permanent_type_chain;
163 tree temporary_type_chain;
164 tree permanent_type_end;
165 tree temporary_type_end;
166 tree pending_sizes;
167 int immediate_size_expand;
168
169 /* For tree.c. */
170 int all_types_permanent;
171 struct momentary_level *momentary_stack;
172 char *maybepermanent_firstobj;
173 char *temporary_firstobj;
174 char *momentary_firstobj;
b8100453 175 char *momentary_function_firstobj;
bf6beae5
CH
176 struct obstack *current_obstack;
177 struct obstack *function_obstack;
178 struct obstack *function_maybepermanent_obstack;
179 struct obstack *expression_obstack;
180 struct obstack *saveable_obstack;
181 struct obstack *rtl_obstack;
a0dabda5 182 struct simple_obstack_stack *inline_obstacks;
bf6beae5
CH
183
184 /* For integrate.c. */
185 int uses_const_pool;
186
187 /* For md files. */
188 int uses_pic_offset_table;
d6e1b011
RS
189 /* tm.h can use this to store whatever it likes. */
190 struct machine_function *machine;
bd231550
JW
191
192 /* For reorg. */
193 rtx epilogue_delay_list;
b76227ea
RS
194
195 /* For varasm. */
196 struct constant_descriptor **const_rtx_hash_table;
197 struct pool_sym **const_rtx_sym_hash_table;
198 struct pool_constant *first_pool, *last_pool;
199 int pool_offset;
bf6beae5
CH
200};
201
202/* The FUNCTION_DECL for an inline function currently being expanded. */
203extern tree inline_function_decl;
204
205/* Label that will go on function epilogue.
206 Jumping to this label serves as a "return" instruction
207 on machines which require execution of the epilogue on all returns. */
208extern rtx return_label;
209
210/* List (chain of EXPR_LISTs) of all stack slots in this function.
211 Made for the sake of unshare_all_rtl. */
212extern rtx stack_slot_list;
213
ba534a45
JW
214/* Given a function decl for a containing function,
215 return the `struct function' for it. */
521f2d6f 216struct function *find_function_data PROTO((tree));
ba534a45
JW
217
218/* Pointer to chain of `struct function' for containing functions. */
219extern struct function *outer_function_chain;
220
221/* Put all this function's BLOCK nodes into a vector and return it.
222 Also store in each NOTE for the beginning or end of a block
223 the index of that block in the vector. */
d6e1b011
RS
224extern tree *identify_blocks PROTO((tree, rtx));
225
226/* These variables hold pointers to functions to
227 save and restore machine-specific data,
228 in push_function_context and pop_function_context. */
229extern void (*save_machine_status) ();
230extern void (*restore_machine_status) ();
ba534a45 231
a00b8dfa
RK
232/* Save and restore varasm.c status for a nested function. */
233extern void save_varasm_status PROTO((struct function *));
234extern void restore_varasm_status PROTO((struct function *));
235
bf6beae5
CH
236#ifdef rtx
237#undef rtx
238#endif
239
240#ifdef tree
241#undef tree
242#endif
This page took 0.334324 seconds and 5 git commands to generate.