1/* Front-end tree definitions for GNU compiler.
| 1/* Front-end tree definitions for GNU compiler.
|
2 Copyright (C) 1989, 93, 94, 95, 96, 97, 1998 Free Software Foundation, Inc.
| 2 Copyright (C) 1989, 93-98, 1999 Free Software Foundation, Inc.
|
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
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
20
21#include "machmode.h"
22
23#ifndef RTX_CODE
24struct rtx_def;
25#endif
26
27/* Codes of tree nodes */
28
29#define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
30
31enum tree_code {
32#include "tree.def"
33
34 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
35 NUM_TREE_CODE. */
36};
37
38#undef DEFTREECODE
39
40/* Number of tree codes. */
41#define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
42
43/* Indexed by enum tree_code, contains a character which is
44 `<' for a comparison expression, `1', for a unary arithmetic
45 expression, `2' for a binary arithmetic expression, `e' for
46 other types of expressions, `r' for a reference, `c' for a
47 constant, `d' for a decl, `t' for a type, `s' for a statement,
48 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
49
50#define MAX_TREE_CODES 256
51extern char tree_code_type[MAX_TREE_CODES];
52#define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
53
54/* Returns non-zero iff CLASS is the tree-code class of an
55 expression. */
56
57#define IS_EXPR_CODE_CLASS(CLASS) \
58 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
59
60/* Number of argument-words in each kind of tree-node. */
61
62extern int tree_code_length[MAX_TREE_CODES];
63
64/* Names of tree components. */
65
66extern char *tree_code_name[MAX_TREE_CODES];
67
68/* Codes that identify the various built in functions
69 so that expand_call can identify them quickly. */
70
71enum built_in_function
72{
73 NOT_BUILT_IN,
74 BUILT_IN_ALLOCA,
75 BUILT_IN_ABS,
76 BUILT_IN_FABS,
77 BUILT_IN_LABS,
78 BUILT_IN_FFS,
79 BUILT_IN_DIV,
80 BUILT_IN_LDIV,
81 BUILT_IN_FFLOOR,
82 BUILT_IN_FCEIL,
83 BUILT_IN_FMOD,
84 BUILT_IN_FREM,
85 BUILT_IN_MEMCPY,
86 BUILT_IN_MEMCMP,
87 BUILT_IN_MEMSET,
88 BUILT_IN_STRCPY,
89 BUILT_IN_STRCMP,
90 BUILT_IN_STRLEN,
91 BUILT_IN_FSQRT,
92 BUILT_IN_SIN,
93 BUILT_IN_COS,
94 BUILT_IN_GETEXP,
95 BUILT_IN_GETMAN,
96 BUILT_IN_SAVEREGS,
97 BUILT_IN_CLASSIFY_TYPE,
98 BUILT_IN_NEXT_ARG,
99 BUILT_IN_ARGS_INFO,
100 BUILT_IN_CONSTANT_P,
101 BUILT_IN_FRAME_ADDRESS,
102 BUILT_IN_RETURN_ADDRESS,
103 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
| 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
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
20
21#include "machmode.h"
22
23#ifndef RTX_CODE
24struct rtx_def;
25#endif
26
27/* Codes of tree nodes */
28
29#define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
30
31enum tree_code {
32#include "tree.def"
33
34 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
35 NUM_TREE_CODE. */
36};
37
38#undef DEFTREECODE
39
40/* Number of tree codes. */
41#define NUM_TREE_CODES ((int)LAST_AND_UNUSED_TREE_CODE)
42
43/* Indexed by enum tree_code, contains a character which is
44 `<' for a comparison expression, `1', for a unary arithmetic
45 expression, `2' for a binary arithmetic expression, `e' for
46 other types of expressions, `r' for a reference, `c' for a
47 constant, `d' for a decl, `t' for a type, `s' for a statement,
48 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */
49
50#define MAX_TREE_CODES 256
51extern char tree_code_type[MAX_TREE_CODES];
52#define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
53
54/* Returns non-zero iff CLASS is the tree-code class of an
55 expression. */
56
57#define IS_EXPR_CODE_CLASS(CLASS) \
58 (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e')
59
60/* Number of argument-words in each kind of tree-node. */
61
62extern int tree_code_length[MAX_TREE_CODES];
63
64/* Names of tree components. */
65
66extern char *tree_code_name[MAX_TREE_CODES];
67
68/* Codes that identify the various built in functions
69 so that expand_call can identify them quickly. */
70
71enum built_in_function
72{
73 NOT_BUILT_IN,
74 BUILT_IN_ALLOCA,
75 BUILT_IN_ABS,
76 BUILT_IN_FABS,
77 BUILT_IN_LABS,
78 BUILT_IN_FFS,
79 BUILT_IN_DIV,
80 BUILT_IN_LDIV,
81 BUILT_IN_FFLOOR,
82 BUILT_IN_FCEIL,
83 BUILT_IN_FMOD,
84 BUILT_IN_FREM,
85 BUILT_IN_MEMCPY,
86 BUILT_IN_MEMCMP,
87 BUILT_IN_MEMSET,
88 BUILT_IN_STRCPY,
89 BUILT_IN_STRCMP,
90 BUILT_IN_STRLEN,
91 BUILT_IN_FSQRT,
92 BUILT_IN_SIN,
93 BUILT_IN_COS,
94 BUILT_IN_GETEXP,
95 BUILT_IN_GETMAN,
96 BUILT_IN_SAVEREGS,
97 BUILT_IN_CLASSIFY_TYPE,
98 BUILT_IN_NEXT_ARG,
99 BUILT_IN_ARGS_INFO,
100 BUILT_IN_CONSTANT_P,
101 BUILT_IN_FRAME_ADDRESS,
102 BUILT_IN_RETURN_ADDRESS,
103 BUILT_IN_AGGREGATE_INCOMING_ADDRESS,
|
104 BUILT_IN_CALLER_RETURN_ADDRESS,
| |
105 BUILT_IN_APPLY_ARGS,
106 BUILT_IN_APPLY,
107 BUILT_IN_RETURN,
108 BUILT_IN_SETJMP,
109 BUILT_IN_LONGJMP,
110 BUILT_IN_TRAP,
111
112 /* Various hooks for the DWARF 2 __throw routine. */
| 104 BUILT_IN_APPLY_ARGS,
105 BUILT_IN_APPLY,
106 BUILT_IN_RETURN,
107 BUILT_IN_SETJMP,
108 BUILT_IN_LONGJMP,
109 BUILT_IN_TRAP,
110
111 /* Various hooks for the DWARF 2 __throw routine. */
|
113 BUILT_IN_FP, BUILT_IN_SP,
| |
114 BUILT_IN_UNWIND_INIT,
| 112 BUILT_IN_UNWIND_INIT,
|
| 113 BUILT_IN_DWARF_CFA,
|
115 BUILT_IN_DWARF_FP_REGNUM,
116 BUILT_IN_DWARF_REG_SIZE,
117 BUILT_IN_FROB_RETURN_ADDR,
118 BUILT_IN_EXTRACT_RETURN_ADDR,
| 114 BUILT_IN_DWARF_FP_REGNUM,
115 BUILT_IN_DWARF_REG_SIZE,
116 BUILT_IN_FROB_RETURN_ADDR,
117 BUILT_IN_EXTRACT_RETURN_ADDR,
|
119 BUILT_IN_SET_RETURN_ADDR_REG,
120 BUILT_IN_EH_STUB_OLD,
121 BUILT_IN_EH_STUB,
122 BUILT_IN_SET_EH_REGS,
| 118 BUILT_IN_EH_RETURN,
|
123
124 /* C++ extensions */
125 BUILT_IN_NEW,
126 BUILT_IN_VEC_NEW,
127 BUILT_IN_DELETE,
128 BUILT_IN_VEC_DELETE,
129
130 /* Upper bound on non-language-specific builtins. */
131 END_BUILTINS
132};
133
134/* The definition of tree nodes fills the next several pages. */
135
136/* A tree node can represent a data type, a variable, an expression
137 or a statement. Each node has a TREE_CODE which says what kind of
138 thing it represents. Some common codes are:
139 INTEGER_TYPE -- represents a type of integers.
140 ARRAY_TYPE -- represents a type of pointer.
141 VAR_DECL -- represents a declared variable.
142 INTEGER_CST -- represents a constant integer value.
143 PLUS_EXPR -- represents a sum (an expression).
144
145 As for the contents of a tree node: there are some fields
146 that all nodes share. Each TREE_CODE has various special-purpose
147 fields as well. The fields of a node are never accessed directly,
148 always through accessor macros. */
149
150/* This type is used everywhere to refer to a tree node. */
151
152typedef union tree_node *tree;
153
154/* Every kind of tree node starts with this structure,
155 so all nodes have these fields.
156
157 See the accessor macros, defined below, for documentation of the fields.
158
159 DO NOT change the layout of tree_common unless absolutely necessary. Some
160 front-ends (namely g++) depend on the internal layout of this tructure.
161 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
162
163struct tree_common
164{
165 union tree_node *chain;
166 union tree_node *type;
167#ifdef ONLY_INT_FIELDS
168 unsigned int code : 8;
169#else
170 enum tree_code code : 8;
171#endif
172
173 unsigned side_effects_flag : 1;
174 unsigned constant_flag : 1;
175 unsigned permanent_flag : 1;
176 unsigned addressable_flag : 1;
177 unsigned volatile_flag : 1;
178 unsigned readonly_flag : 1;
179 unsigned unsigned_flag : 1;
180 unsigned asm_written_flag: 1;
181
182 unsigned used_flag : 1;
183 unsigned raises_flag : 1;
184 unsigned static_flag : 1;
185 unsigned public_flag : 1;
186 unsigned private_flag : 1;
187 unsigned protected_flag : 1;
188
189 unsigned lang_flag_0 : 1;
190 unsigned lang_flag_1 : 1;
191 unsigned lang_flag_2 : 1;
192 unsigned lang_flag_3 : 1;
193 unsigned lang_flag_4 : 1;
194 unsigned lang_flag_5 : 1;
195 unsigned lang_flag_6 : 1;
196 /* There is room for three more flags. */
197};
198
199/* The following table lists the uses of each of the above flags and
200 for which types of nodes they are defined. Note that expressions
201 include decls.
202
203 addressable_flag:
204
205 TREE_ADDRESSABLE in
206 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
207 IDENTIFIER_NODE
208
209 static_flag:
210
211 TREE_STATIC in
212 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
213 TREE_NO_UNUSED_WARNING in
214 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
215 TREE_VIA_VIRTUAL in
216 TREE_LIST or TREE_VEC
217 TREE_CONSTANT_OVERFLOW in
218 INTEGER_CST, REAL_CST, COMPLEX_CST
219 TREE_SYMBOL_REFERENCED in
220 IDENTIFIER_NODE
221
222 public_flag:
223
224 TREE_OVERFLOW in
225 INTEGER_CST, REAL_CST, COMPLEX_CST
226 TREE_PUBLIC in
227 VAR_DECL or FUNCTION_DECL
228 TREE_VIA_PUBLIC in
229 TREE_LIST or TREE_VEC
| 119
120 /* C++ extensions */
121 BUILT_IN_NEW,
122 BUILT_IN_VEC_NEW,
123 BUILT_IN_DELETE,
124 BUILT_IN_VEC_DELETE,
125
126 /* Upper bound on non-language-specific builtins. */
127 END_BUILTINS
128};
129
130/* The definition of tree nodes fills the next several pages. */
131
132/* A tree node can represent a data type, a variable, an expression
133 or a statement. Each node has a TREE_CODE which says what kind of
134 thing it represents. Some common codes are:
135 INTEGER_TYPE -- represents a type of integers.
136 ARRAY_TYPE -- represents a type of pointer.
137 VAR_DECL -- represents a declared variable.
138 INTEGER_CST -- represents a constant integer value.
139 PLUS_EXPR -- represents a sum (an expression).
140
141 As for the contents of a tree node: there are some fields
142 that all nodes share. Each TREE_CODE has various special-purpose
143 fields as well. The fields of a node are never accessed directly,
144 always through accessor macros. */
145
146/* This type is used everywhere to refer to a tree node. */
147
148typedef union tree_node *tree;
149
150/* Every kind of tree node starts with this structure,
151 so all nodes have these fields.
152
153 See the accessor macros, defined below, for documentation of the fields.
154
155 DO NOT change the layout of tree_common unless absolutely necessary. Some
156 front-ends (namely g++) depend on the internal layout of this tructure.
157 See my_tree_cons in the cp subdir for such uglyness. Ugh. */
158
159struct tree_common
160{
161 union tree_node *chain;
162 union tree_node *type;
163#ifdef ONLY_INT_FIELDS
164 unsigned int code : 8;
165#else
166 enum tree_code code : 8;
167#endif
168
169 unsigned side_effects_flag : 1;
170 unsigned constant_flag : 1;
171 unsigned permanent_flag : 1;
172 unsigned addressable_flag : 1;
173 unsigned volatile_flag : 1;
174 unsigned readonly_flag : 1;
175 unsigned unsigned_flag : 1;
176 unsigned asm_written_flag: 1;
177
178 unsigned used_flag : 1;
179 unsigned raises_flag : 1;
180 unsigned static_flag : 1;
181 unsigned public_flag : 1;
182 unsigned private_flag : 1;
183 unsigned protected_flag : 1;
184
185 unsigned lang_flag_0 : 1;
186 unsigned lang_flag_1 : 1;
187 unsigned lang_flag_2 : 1;
188 unsigned lang_flag_3 : 1;
189 unsigned lang_flag_4 : 1;
190 unsigned lang_flag_5 : 1;
191 unsigned lang_flag_6 : 1;
192 /* There is room for three more flags. */
193};
194
195/* The following table lists the uses of each of the above flags and
196 for which types of nodes they are defined. Note that expressions
197 include decls.
198
199 addressable_flag:
200
201 TREE_ADDRESSABLE in
202 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, LABEL_DECL, ..._TYPE
203 IDENTIFIER_NODE
204
205 static_flag:
206
207 TREE_STATIC in
208 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
209 TREE_NO_UNUSED_WARNING in
210 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR
211 TREE_VIA_VIRTUAL in
212 TREE_LIST or TREE_VEC
213 TREE_CONSTANT_OVERFLOW in
214 INTEGER_CST, REAL_CST, COMPLEX_CST
215 TREE_SYMBOL_REFERENCED in
216 IDENTIFIER_NODE
217
218 public_flag:
219
220 TREE_OVERFLOW in
221 INTEGER_CST, REAL_CST, COMPLEX_CST
222 TREE_PUBLIC in
223 VAR_DECL or FUNCTION_DECL
224 TREE_VIA_PUBLIC in
225 TREE_LIST or TREE_VEC
|
| 226 EXPR_WFL_EMIT_LINE_NOTE in
227 EXPR_WITH_FILE_LOCATION
|
230
231 private_flag:
232
233 TREE_VIA_PRIVATE in
234 TREE_LIST or TREE_VEC
235 TREE_PRIVATE in
236 ??? unspecified nodes
237
238 protected_flag:
239
240 TREE_VIA_PROTECTED in
241 TREE_LIST
242 TREE_PROTECTED in
243 BLOCK
244 ??? unspecified nodes
245
246 side_effects_flag:
247
248 TREE_SIDE_EFFECTS in
249 all expressions
250
251 volatile_flag:
252
253 TREE_THIS_VOLATILE in
254 all expressions
255 TYPE_VOLATILE in
256 ..._TYPE
257
258 readonly_flag:
259
260 TREE_READONLY in
261 all expressions
262 ITERATOR_BOUND_P in
263 VAR_DECL if iterator (C)
264 TYPE_READONLY in
265 ..._TYPE
266
267 constant_flag:
268
269 TREE_CONSTANT in
270 all expressions
271
272 permanent_flag: TREE_PERMANENT in all nodes
273
274 unsigned_flag:
275
276 TREE_UNSIGNED in
277 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
278 DECL_BUILT_IN_NONANSI in
279 FUNCTION_DECL
280 TREE_PARMLIST in
281 TREE_PARMLIST (C++)
282 SAVE_EXPR_NOPLACEHOLDER in
283 SAVE_EXPR
284
285 asm_written_flag:
286
287 TREE_ASM_WRITTEN in
288 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
289 BLOCK
290
291 used_flag:
292
293 TREE_USED in
294 expressions, IDENTIFIER_NODE
295
296 raises_flag:
297
298 TREE_RAISES in
299 expressions
300
301 */
302/* Define accessors for the fields that all tree nodes have
303 (though some fields are not used for all kinds of nodes). */
304
305/* The tree-code says what kind of node it is.
306 Codes are defined in tree.def. */
307#define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
308#define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
309
310/* When checking is enabled, errors will be generated if a tree node
311 is accessed incorrectly. The macros abort with a fatal error,
312 except for the *1 variants, which just return 0 on failure. The
313 latter variants should only be used for combination checks, which
314 succeed when one of the checks succeed. The CHAIN_CHECK macro helps
315 defining such checks. */
316
317#ifdef ENABLE_CHECKING
318#define DO_CHECK(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 0)
319#define DO_CHECK1(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 1)
320#define CHAIN_CHECK(t, c1, c2) (c1 (t) ? t : c2 (t))
321#else
322#define DO_CHECK(FUNC, t, param) (t)
323#define DO_CHECK1(FUNC, t, param) (t)
324#define CHAIN_CHECK(t, c1, c2) (t)
325#endif
326
327#define TREE_CHECK(t, code) DO_CHECK (tree_check, t, code)
328#define TREE_CHECK1(t, code) DO_CHECK1 (tree_check, t, code)
329
330#include "tree-check.h"
331
| 228
229 private_flag:
230
231 TREE_VIA_PRIVATE in
232 TREE_LIST or TREE_VEC
233 TREE_PRIVATE in
234 ??? unspecified nodes
235
236 protected_flag:
237
238 TREE_VIA_PROTECTED in
239 TREE_LIST
240 TREE_PROTECTED in
241 BLOCK
242 ??? unspecified nodes
243
244 side_effects_flag:
245
246 TREE_SIDE_EFFECTS in
247 all expressions
248
249 volatile_flag:
250
251 TREE_THIS_VOLATILE in
252 all expressions
253 TYPE_VOLATILE in
254 ..._TYPE
255
256 readonly_flag:
257
258 TREE_READONLY in
259 all expressions
260 ITERATOR_BOUND_P in
261 VAR_DECL if iterator (C)
262 TYPE_READONLY in
263 ..._TYPE
264
265 constant_flag:
266
267 TREE_CONSTANT in
268 all expressions
269
270 permanent_flag: TREE_PERMANENT in all nodes
271
272 unsigned_flag:
273
274 TREE_UNSIGNED in
275 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL
276 DECL_BUILT_IN_NONANSI in
277 FUNCTION_DECL
278 TREE_PARMLIST in
279 TREE_PARMLIST (C++)
280 SAVE_EXPR_NOPLACEHOLDER in
281 SAVE_EXPR
282
283 asm_written_flag:
284
285 TREE_ASM_WRITTEN in
286 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
287 BLOCK
288
289 used_flag:
290
291 TREE_USED in
292 expressions, IDENTIFIER_NODE
293
294 raises_flag:
295
296 TREE_RAISES in
297 expressions
298
299 */
300/* Define accessors for the fields that all tree nodes have
301 (though some fields are not used for all kinds of nodes). */
302
303/* The tree-code says what kind of node it is.
304 Codes are defined in tree.def. */
305#define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
306#define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (int) (VALUE))
307
308/* When checking is enabled, errors will be generated if a tree node
309 is accessed incorrectly. The macros abort with a fatal error,
310 except for the *1 variants, which just return 0 on failure. The
311 latter variants should only be used for combination checks, which
312 succeed when one of the checks succeed. The CHAIN_CHECK macro helps
313 defining such checks. */
314
315#ifdef ENABLE_CHECKING
316#define DO_CHECK(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 0)
317#define DO_CHECK1(FUNC, t, param) FUNC (t, param, __FILE__, __LINE__, 1)
318#define CHAIN_CHECK(t, c1, c2) (c1 (t) ? t : c2 (t))
319#else
320#define DO_CHECK(FUNC, t, param) (t)
321#define DO_CHECK1(FUNC, t, param) (t)
322#define CHAIN_CHECK(t, c1, c2) (t)
323#endif
324
325#define TREE_CHECK(t, code) DO_CHECK (tree_check, t, code)
326#define TREE_CHECK1(t, code) DO_CHECK1 (tree_check, t, code)
327
328#include "tree-check.h"
329
|
332#define TYPE_CHECK(t) DO_CHECK (tree_class_check, t, 't')
333#define TYPE_CHECK1(t) DO_CHECK1 (tree_class_check, t, 't')
| 330#define TYPE_CHECK(tree) DO_CHECK (tree_class_check, tree, 't')
331#define TYPE_CHECK1(tree) DO_CHECK1 (tree_class_check, tree, 't')
|
334#define DECL_CHECK(t) DO_CHECK (tree_class_check, t, 'd')
335#define DECL_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'd')
336#define CST_CHECK(t) DO_CHECK (tree_class_check, t, 'c')
337#define CST_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'c')
338#define EXPR_CHECK(t) DO_CHECK (expr_check, t, 0)
339
340/* Chained checks. The last check has to succeed, the others may fail. */
341#define CST_OR_CONSTRUCTOR_CHECK(t) \
342 CHAIN_CHECK (t, CST_CHECK1, CONSTRUCTOR_CHECK)
343
344/* In all nodes that are expressions, this is the data type of the expression.
345 In POINTER_TYPE nodes, this is the type that the pointer points to.
346 In ARRAY_TYPE nodes, this is the type of the elements. */
347#define TREE_TYPE(NODE) ((NODE)->common.type)
348
349/* Nodes are chained together for many purposes.
350 Types are chained together to record them for being output to the debugger
351 (see the function `chain_type').
352 Decls in the same scope are chained together to record the contents
353 of the scope.
354 Statement nodes for successive statements used to be chained together.
355 Often lists of things are represented by TREE_LIST nodes that
356 are chained together. */
357
358#define TREE_CHAIN(NODE) ((NODE)->common.chain)
359
360/* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
361 that don't change the machine mode. */
362
363#define STRIP_NOPS(EXP) \
364 while ((TREE_CODE (EXP) == NOP_EXPR \
365 || TREE_CODE (EXP) == CONVERT_EXPR \
366 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
367 && (TYPE_MODE (TREE_TYPE (EXP)) \
368 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
369 (EXP) = TREE_OPERAND (EXP, 0);
370
371/* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
372
373#define STRIP_TYPE_NOPS(EXP) \
374 while ((TREE_CODE (EXP) == NOP_EXPR \
375 || TREE_CODE (EXP) == CONVERT_EXPR \
376 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
377 && (TREE_TYPE (EXP) \
378 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
379 (EXP) = TREE_OPERAND (EXP, 0);
380
381/* Nonzero if TYPE represents an integral type. Note that we do not
382 include COMPLEX types here. */
383
384#define INTEGRAL_TYPE_P(TYPE) \
385 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
386 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
387
388/* Nonzero if TYPE represents a floating-point type, including complex
389 floating-point types. */
390
391#define FLOAT_TYPE_P(TYPE) \
392 (TREE_CODE (TYPE) == REAL_TYPE \
393 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
394 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
395
396/* Nonzero if TYPE represents an aggregate (multi-component) type. */
397
398#define AGGREGATE_TYPE_P(TYPE) \
399 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
400 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
401 || TREE_CODE (TYPE) == SET_TYPE)
402
403/* Nonzero if TYPE represents a pointer type. */
404
405#define POINTER_TYPE_P(TYPE) \
406 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
407
408/* Nonzero if TYPE represents a type. */
409
410#define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
411
412/* Define many boolean fields that all tree nodes have. */
413
414/* In VAR_DECL nodes, nonzero means address of this is needed.
415 So it cannot be in a register.
416 In a FUNCTION_DECL, nonzero means its address is needed.
417 So it must be compiled even if it is an inline function.
418 In CONSTRUCTOR nodes, it means object constructed must be in memory.
419 In LABEL_DECL nodes, it means a goto for this label has been seen
420 from a place outside all binding contours that restore stack levels.
421 In ..._TYPE nodes, it means that objects of this type must
422 be fully addressable. This means that pieces of this
423 object cannot go into register parameters, for example.
424 In IDENTIFIER_NODEs, this means that some extern decl for this name
425 had its address taken. That matters for inline functions. */
426#define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
427
428/* In a VAR_DECL, nonzero means allocate static storage.
429 In a FUNCTION_DECL, nonzero if function has been defined.
430 In a CONSTRUCTOR, nonzero means allocate static storage. */
431#define TREE_STATIC(NODE) ((NODE)->common.static_flag)
432
433/* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
434 made implicitly and should not lead to an "unused value" warning. */
435#define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
436
437/* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
438 chain is via a `virtual' declaration. */
439#define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
440
441/* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
442 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
443 requires a diagnostic when overflows occur in constant expressions. */
444#define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
445
446/* In an IDENTIFIER_NODE, this means that assemble_name was called with
447 this string as an argument. */
448#define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
449
450/* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
451 overflow in folding, and no warning has been issued for this subexpression.
452 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
453#define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
454
455/* In a VAR_DECL or FUNCTION_DECL,
456 nonzero means name is to be accessible from outside this module.
457 In an identifier node, nonzero means an external declaration
458 accessible from outside this module was previously seen
459 for this name in an inner scope. */
460#define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
461
462/* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
463 base class is via a `public' declaration, which preserves public
464 fields from the base class as public. */
465#define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
466
467/* Ditto, for `private' declarations. */
468#define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
469
470/* Nonzero for TREE_LIST node means that the path to the
471 base class is via a `protected' declaration, which preserves
472 protected fields from the base class as protected.
473 OVERLOADED. */
474#define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
475
476/* In any expression, nonzero means it has side effects or reevaluation
477 of the whole expression could produce a different value.
478 This is set if any subexpression is a function call, a side effect
479 or a reference to a volatile variable.
480 In a ..._DECL, this is set only if the declaration said `volatile'. */
481#define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
482
483/* Nonzero means this expression is volatile in the C sense:
484 its address should be of type `volatile WHATEVER *'.
485 In other words, the declared item is volatile qualified.
486 This is used in _DECL nodes and _REF nodes.
487
488 In a ..._TYPE node, means this type is volatile-qualified.
489 But use TYPE_VOLATILE instead of this macro when the node is a type,
490 because eventually we may make that a different bit.
491
492 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
493#define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
494
495/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
496 nonzero means it may not be the lhs of an assignment.
497 In a ..._TYPE node, means this type is const-qualified
498 (but the macro TYPE_READONLY should be used instead of this macro
499 when the node is a type). */
500#define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
501
502/* Value of expression is constant.
503 Always appears in all ..._CST nodes.
504 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
505 if the value is constant. */
506#define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
507
508/* Nonzero means permanent node;
509 node will continue to exist for the entire compiler run.
510 Otherwise it will be recycled at the end of the function. */
511#define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
512
513/* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
514 In FIELD_DECL nodes, means an unsigned bit field.
515 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
516#define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
517
518/* Nonzero in a VAR_DECL means assembler code has been written.
519 Nonzero in a FUNCTION_DECL means that the function has been compiled.
520 This is interesting in an inline function, since it might not need
521 to be compiled separately.
522 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
523 if the sdb debugging info for the type has been written.
524 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
525#define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
526
527/* Nonzero in a _DECL if the name is used in its scope.
528 Nonzero in an expr node means inhibit warning if value is unused.
529 In IDENTIFIER_NODEs, this means that some extern decl for this name
530 was used. */
531#define TREE_USED(NODE) ((NODE)->common.used_flag)
532
533/* Nonzero for a tree node whose evaluation could result
534 in the raising of an exception. Not implemented yet. */
535#define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
536
537/* Used in classes in C++. */
538#define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
539/* Used in classes in C++.
540 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
541#define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
542
543/* These flags are available for each language front end to use internally. */
544#define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
545#define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
546#define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
547#define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
548#define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
549#define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
550#define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
551
552/* Define additional fields and accessors for nodes representing constants. */
553
554/* In an INTEGER_CST node. These two together make a 2-word integer.
555 If the data type is signed, the value is sign-extended to 2 words
556 even though not all of them may really be in use.
557 In an unsigned constant shorter than 2 words, the extra bits are 0. */
558#define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
559#define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
560
561#define INT_CST_LT(A, B) \
562(TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
563 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
564 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
565 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
566
567#define INT_CST_LT_UNSIGNED(A, B) \
568(((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
569 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
570 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
571 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
572 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
573 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
574
575struct tree_int_cst
576{
577 char common[sizeof (struct tree_common)];
578 struct rtx_def *rtl; /* acts as link to register transfer language
579 (rtl) info */
580 HOST_WIDE_INT int_cst_low;
581 HOST_WIDE_INT int_cst_high;
582};
583
584/* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
585 and generally in all kinds of constants that could
586 be given labels (rather than being immediate). */
587
588#define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
589
590/* In a REAL_CST node. */
591/* We can represent a real value as either a `double' or a string.
592 Strings don't allow for any optimization, but they do allow
593 for cross-compilation. */
594
595#define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
596
597#include "real.h"
598
599struct tree_real_cst
600{
601 char common[sizeof (struct tree_common)];
602 struct rtx_def *rtl; /* acts as link to register transfer language
603 (rtl) info */
604 REAL_VALUE_TYPE real_cst;
605};
606
607/* In a STRING_CST */
608#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
609#define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
610
611struct tree_string
612{
613 char common[sizeof (struct tree_common)];
614 struct rtx_def *rtl; /* acts as link to register transfer language
615 (rtl) info */
616 int length;
617 char *pointer;
618};
619
620/* In a COMPLEX_CST node. */
621#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
622#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
623
624struct tree_complex
625{
626 char common[sizeof (struct tree_common)];
627 struct rtx_def *rtl; /* acts as link to register transfer language
628 (rtl) info */
629 union tree_node *real;
630 union tree_node *imag;
631};
632
633/* Define fields and accessors for some special-purpose tree nodes. */
634
635#define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
636#define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
637
638struct tree_identifier
639{
640 char common[sizeof (struct tree_common)];
641 int length;
642 char *pointer;
643};
644
645/* In a TREE_LIST node. */
646#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
647#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
648
649struct tree_list
650{
651 char common[sizeof (struct tree_common)];
652 union tree_node *purpose;
653 union tree_node *value;
654};
655
656/* In a TREE_VEC node. */
657#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
658#define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
659#define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
660
661struct tree_vec
662{
663 char common[sizeof (struct tree_common)];
664 int length;
665 union tree_node *a[1];
666};
667
668/* Define fields and accessors for some nodes that represent expressions. */
669
670/* In a SAVE_EXPR node. */
671#define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
672#define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
673#define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
674
675/* In a RTL_EXPR node. */
676#define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
677#define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
678
679/* In a CALL_EXPR node. */
680#define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
681
682/* In a CONSTRUCTOR node. */
683#define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
684
685/* In ordinary expression nodes. */
686#define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
687#define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
688
| 332#define DECL_CHECK(t) DO_CHECK (tree_class_check, t, 'd')
333#define DECL_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'd')
334#define CST_CHECK(t) DO_CHECK (tree_class_check, t, 'c')
335#define CST_CHECK1(t) DO_CHECK1 (tree_class_check, t, 'c')
336#define EXPR_CHECK(t) DO_CHECK (expr_check, t, 0)
337
338/* Chained checks. The last check has to succeed, the others may fail. */
339#define CST_OR_CONSTRUCTOR_CHECK(t) \
340 CHAIN_CHECK (t, CST_CHECK1, CONSTRUCTOR_CHECK)
341
342/* In all nodes that are expressions, this is the data type of the expression.
343 In POINTER_TYPE nodes, this is the type that the pointer points to.
344 In ARRAY_TYPE nodes, this is the type of the elements. */
345#define TREE_TYPE(NODE) ((NODE)->common.type)
346
347/* Nodes are chained together for many purposes.
348 Types are chained together to record them for being output to the debugger
349 (see the function `chain_type').
350 Decls in the same scope are chained together to record the contents
351 of the scope.
352 Statement nodes for successive statements used to be chained together.
353 Often lists of things are represented by TREE_LIST nodes that
354 are chained together. */
355
356#define TREE_CHAIN(NODE) ((NODE)->common.chain)
357
358/* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
359 that don't change the machine mode. */
360
361#define STRIP_NOPS(EXP) \
362 while ((TREE_CODE (EXP) == NOP_EXPR \
363 || TREE_CODE (EXP) == CONVERT_EXPR \
364 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
365 && (TYPE_MODE (TREE_TYPE (EXP)) \
366 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
367 (EXP) = TREE_OPERAND (EXP, 0);
368
369/* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
370
371#define STRIP_TYPE_NOPS(EXP) \
372 while ((TREE_CODE (EXP) == NOP_EXPR \
373 || TREE_CODE (EXP) == CONVERT_EXPR \
374 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
375 && (TREE_TYPE (EXP) \
376 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
377 (EXP) = TREE_OPERAND (EXP, 0);
378
379/* Nonzero if TYPE represents an integral type. Note that we do not
380 include COMPLEX types here. */
381
382#define INTEGRAL_TYPE_P(TYPE) \
383 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \
384 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE)
385
386/* Nonzero if TYPE represents a floating-point type, including complex
387 floating-point types. */
388
389#define FLOAT_TYPE_P(TYPE) \
390 (TREE_CODE (TYPE) == REAL_TYPE \
391 || (TREE_CODE (TYPE) == COMPLEX_TYPE \
392 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE))
393
394/* Nonzero if TYPE represents an aggregate (multi-component) type. */
395
396#define AGGREGATE_TYPE_P(TYPE) \
397 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
398 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \
399 || TREE_CODE (TYPE) == SET_TYPE)
400
401/* Nonzero if TYPE represents a pointer type. */
402
403#define POINTER_TYPE_P(TYPE) \
404 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
405
406/* Nonzero if TYPE represents a type. */
407
408#define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't')
409
410/* Define many boolean fields that all tree nodes have. */
411
412/* In VAR_DECL nodes, nonzero means address of this is needed.
413 So it cannot be in a register.
414 In a FUNCTION_DECL, nonzero means its address is needed.
415 So it must be compiled even if it is an inline function.
416 In CONSTRUCTOR nodes, it means object constructed must be in memory.
417 In LABEL_DECL nodes, it means a goto for this label has been seen
418 from a place outside all binding contours that restore stack levels.
419 In ..._TYPE nodes, it means that objects of this type must
420 be fully addressable. This means that pieces of this
421 object cannot go into register parameters, for example.
422 In IDENTIFIER_NODEs, this means that some extern decl for this name
423 had its address taken. That matters for inline functions. */
424#define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
425
426/* In a VAR_DECL, nonzero means allocate static storage.
427 In a FUNCTION_DECL, nonzero if function has been defined.
428 In a CONSTRUCTOR, nonzero means allocate static storage. */
429#define TREE_STATIC(NODE) ((NODE)->common.static_flag)
430
431/* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was
432 made implicitly and should not lead to an "unused value" warning. */
433#define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag)
434
435/* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation
436 chain is via a `virtual' declaration. */
437#define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag)
438
439/* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an
440 overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C
441 requires a diagnostic when overflows occur in constant expressions. */
442#define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag)
443
444/* In an IDENTIFIER_NODE, this means that assemble_name was called with
445 this string as an argument. */
446#define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag)
447
448/* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an
449 overflow in folding, and no warning has been issued for this subexpression.
450 TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */
451#define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag)
452
453/* In a VAR_DECL or FUNCTION_DECL,
454 nonzero means name is to be accessible from outside this module.
455 In an identifier node, nonzero means an external declaration
456 accessible from outside this module was previously seen
457 for this name in an inner scope. */
458#define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
459
460/* Nonzero for TREE_LIST or TREE_VEC node means that the path to the
461 base class is via a `public' declaration, which preserves public
462 fields from the base class as public. */
463#define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag)
464
465/* Ditto, for `private' declarations. */
466#define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag)
467
468/* Nonzero for TREE_LIST node means that the path to the
469 base class is via a `protected' declaration, which preserves
470 protected fields from the base class as protected.
471 OVERLOADED. */
472#define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag)
473
474/* In any expression, nonzero means it has side effects or reevaluation
475 of the whole expression could produce a different value.
476 This is set if any subexpression is a function call, a side effect
477 or a reference to a volatile variable.
478 In a ..._DECL, this is set only if the declaration said `volatile'. */
479#define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag)
480
481/* Nonzero means this expression is volatile in the C sense:
482 its address should be of type `volatile WHATEVER *'.
483 In other words, the declared item is volatile qualified.
484 This is used in _DECL nodes and _REF nodes.
485
486 In a ..._TYPE node, means this type is volatile-qualified.
487 But use TYPE_VOLATILE instead of this macro when the node is a type,
488 because eventually we may make that a different bit.
489
490 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
491#define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
492
493/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
494 nonzero means it may not be the lhs of an assignment.
495 In a ..._TYPE node, means this type is const-qualified
496 (but the macro TYPE_READONLY should be used instead of this macro
497 when the node is a type). */
498#define TREE_READONLY(NODE) ((NODE)->common.readonly_flag)
499
500/* Value of expression is constant.
501 Always appears in all ..._CST nodes.
502 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR
503 if the value is constant. */
504#define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag)
505
506/* Nonzero means permanent node;
507 node will continue to exist for the entire compiler run.
508 Otherwise it will be recycled at the end of the function. */
509#define TREE_PERMANENT(NODE) ((NODE)->common.permanent_flag)
510
511/* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type.
512 In FIELD_DECL nodes, means an unsigned bit field.
513 The same bit is used in functions as DECL_BUILT_IN_NONANSI. */
514#define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag)
515
516/* Nonzero in a VAR_DECL means assembler code has been written.
517 Nonzero in a FUNCTION_DECL means that the function has been compiled.
518 This is interesting in an inline function, since it might not need
519 to be compiled separately.
520 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
521 if the sdb debugging info for the type has been written.
522 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */
523#define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
524
525/* Nonzero in a _DECL if the name is used in its scope.
526 Nonzero in an expr node means inhibit warning if value is unused.
527 In IDENTIFIER_NODEs, this means that some extern decl for this name
528 was used. */
529#define TREE_USED(NODE) ((NODE)->common.used_flag)
530
531/* Nonzero for a tree node whose evaluation could result
532 in the raising of an exception. Not implemented yet. */
533#define TREE_RAISES(NODE) ((NODE)->common.raises_flag)
534
535/* Used in classes in C++. */
536#define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
537/* Used in classes in C++.
538 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
539#define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
540
541/* These flags are available for each language front end to use internally. */
542#define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
543#define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
544#define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
545#define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
546#define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
547#define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
548#define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
549
550/* Define additional fields and accessors for nodes representing constants. */
551
552/* In an INTEGER_CST node. These two together make a 2-word integer.
553 If the data type is signed, the value is sign-extended to 2 words
554 even though not all of them may really be in use.
555 In an unsigned constant shorter than 2 words, the extra bits are 0. */
556#define TREE_INT_CST_LOW(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_low)
557#define TREE_INT_CST_HIGH(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst_high)
558
559#define INT_CST_LT(A, B) \
560(TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
561 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
562 && ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
563 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B))))
564
565#define INT_CST_LT_UNSIGNED(A, B) \
566(((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
567 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
568 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
569 == (unsigned HOST_WIDE_INT ) TREE_INT_CST_HIGH (B)) \
570 && (((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (A) \
571 < (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (B)))))
572
573struct tree_int_cst
574{
575 char common[sizeof (struct tree_common)];
576 struct rtx_def *rtl; /* acts as link to register transfer language
577 (rtl) info */
578 HOST_WIDE_INT int_cst_low;
579 HOST_WIDE_INT int_cst_high;
580};
581
582/* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes,
583 and generally in all kinds of constants that could
584 be given labels (rather than being immediate). */
585
586#define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl)
587
588/* In a REAL_CST node. */
589/* We can represent a real value as either a `double' or a string.
590 Strings don't allow for any optimization, but they do allow
591 for cross-compilation. */
592
593#define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst)
594
595#include "real.h"
596
597struct tree_real_cst
598{
599 char common[sizeof (struct tree_common)];
600 struct rtx_def *rtl; /* acts as link to register transfer language
601 (rtl) info */
602 REAL_VALUE_TYPE real_cst;
603};
604
605/* In a STRING_CST */
606#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
607#define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer)
608
609struct tree_string
610{
611 char common[sizeof (struct tree_common)];
612 struct rtx_def *rtl; /* acts as link to register transfer language
613 (rtl) info */
614 int length;
615 char *pointer;
616};
617
618/* In a COMPLEX_CST node. */
619#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
620#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
621
622struct tree_complex
623{
624 char common[sizeof (struct tree_common)];
625 struct rtx_def *rtl; /* acts as link to register transfer language
626 (rtl) info */
627 union tree_node *real;
628 union tree_node *imag;
629};
630
631/* Define fields and accessors for some special-purpose tree nodes. */
632
633#define IDENTIFIER_LENGTH(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.length)
634#define IDENTIFIER_POINTER(NODE) (IDENTIFIER_NODE_CHECK (NODE)->identifier.pointer)
635
636struct tree_identifier
637{
638 char common[sizeof (struct tree_common)];
639 int length;
640 char *pointer;
641};
642
643/* In a TREE_LIST node. */
644#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
645#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
646
647struct tree_list
648{
649 char common[sizeof (struct tree_common)];
650 union tree_node *purpose;
651 union tree_node *value;
652};
653
654/* In a TREE_VEC node. */
655#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
656#define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I])
657#define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length]))
658
659struct tree_vec
660{
661 char common[sizeof (struct tree_common)];
662 int length;
663 union tree_node *a[1];
664};
665
666/* Define fields and accessors for some nodes that represent expressions. */
667
668/* In a SAVE_EXPR node. */
669#define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1)
670#define SAVE_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
671#define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE)
672
673/* In a RTL_EXPR node. */
674#define RTL_EXPR_SEQUENCE(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[0])
675#define RTL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[1])
676
677/* In a CALL_EXPR node. */
678#define CALL_EXPR_RTL(NODE) (*(struct rtx_def **) &EXPR_CHECK (NODE)->exp.operands[2])
679
680/* In a CONSTRUCTOR node. */
681#define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1)
682
683/* In ordinary expression nodes. */
684#define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I])
685#define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
686
|
689/* In expression with file location information. */
| 687/* In a LABELED_BLOCK_EXPR node. */
688#define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0)
689#define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1)
690
691/* In a EXIT_BLOCK_EXPR node. */
692#define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0)
693#define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1)
694
695/* In a LOOP_EXPR node. */
696#define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0)
697
698/* In a EXPR_WITH_FILE_LOCATION node. */
|
690#define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
691#define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
692#define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
693#define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
694#define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
695#define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
696#define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
697 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
| 699#define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0)
700#define EXPR_WFL_FILENAME(NODE) (IDENTIFIER_POINTER ((NODE)->common.chain))
701#define EXPR_WFL_FILENAME_NODE(NODE) ((NODE)->common.chain)
702#define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12)
703#define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff)
704#define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
705#define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \
706 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff))
|
698#define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.lang_flag_0)
| 707#define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag)
|
699
700struct tree_exp
701{
702 char common[sizeof (struct tree_common)];
703 int complexity;
704 union tree_node *operands[1];
705};
706
707/* In a BLOCK node. */
708#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
709#define BLOCK_TYPE_TAGS(NODE) (BLOCK_CHECK (NODE)->block.type_tags)
710#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
711#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
712/* Note: when changing this, make sure to find the places
713 that use chainon or nreverse. */
714#define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
715#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
716#define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
717#define BLOCK_END_NOTE(NODE) (BLOCK_CHECK (NODE)->block.end_note)
718/* Nonzero means that this block has separate live range regions */
719#define BLOCK_LIVE_RANGE_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_flag)
720
721/* Nonzero means that this block has a variable declared in it
722 that is split into separate live ranges. */
723#define BLOCK_LIVE_RANGE_VAR_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_var_flag)
724
725/* Index for marking the start of the block for live ranges. */
726#define BLOCK_LIVE_RANGE_START(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_start)
727
728/* Index for marking the end of the block for live ranges. */
729#define BLOCK_LIVE_RANGE_END(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_end)
730
731/* Nonzero means that this block is prepared to handle exceptions
732 listed in the BLOCK_VARS slot. */
733#define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
734
735struct tree_block
736{
737 char common[sizeof (struct tree_common)];
738
739 unsigned handler_block_flag : 1;
740 unsigned abstract_flag : 1;
741 unsigned live_range_flag : 1;
742 unsigned live_range_var_flag : 1;
743
744 union tree_node *vars;
745 union tree_node *type_tags;
746 union tree_node *subblocks;
747 union tree_node *supercontext;
748 union tree_node *abstract_origin;
749 struct rtx_def *end_note;
750 int live_range_start;
751 int live_range_end;
752};
753
754/* Define fields and accessors for nodes representing data types. */
755
756/* See tree.def for documentation of the use of these fields.
757 Look at the documentation of the various ..._TYPE tree codes. */
758
759#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
760#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
761#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
762#define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
763#define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
764#define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
765#define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
766#define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
767#define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
768#define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
769#define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
770#define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
771#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
772#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
773#define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
774#define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
775#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
776#define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
777#define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
778#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
779#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
780#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
| 708
709struct tree_exp
710{
711 char common[sizeof (struct tree_common)];
712 int complexity;
713 union tree_node *operands[1];
714};
715
716/* In a BLOCK node. */
717#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
718#define BLOCK_TYPE_TAGS(NODE) (BLOCK_CHECK (NODE)->block.type_tags)
719#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
720#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
721/* Note: when changing this, make sure to find the places
722 that use chainon or nreverse. */
723#define BLOCK_CHAIN(NODE) TREE_CHAIN (NODE)
724#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
725#define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
726#define BLOCK_END_NOTE(NODE) (BLOCK_CHECK (NODE)->block.end_note)
727/* Nonzero means that this block has separate live range regions */
728#define BLOCK_LIVE_RANGE_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_flag)
729
730/* Nonzero means that this block has a variable declared in it
731 that is split into separate live ranges. */
732#define BLOCK_LIVE_RANGE_VAR_FLAG(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_var_flag)
733
734/* Index for marking the start of the block for live ranges. */
735#define BLOCK_LIVE_RANGE_START(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_start)
736
737/* Index for marking the end of the block for live ranges. */
738#define BLOCK_LIVE_RANGE_END(NOTE) (BLOCK_CHECK (NOTE)->block.live_range_end)
739
740/* Nonzero means that this block is prepared to handle exceptions
741 listed in the BLOCK_VARS slot. */
742#define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag)
743
744struct tree_block
745{
746 char common[sizeof (struct tree_common)];
747
748 unsigned handler_block_flag : 1;
749 unsigned abstract_flag : 1;
750 unsigned live_range_flag : 1;
751 unsigned live_range_var_flag : 1;
752
753 union tree_node *vars;
754 union tree_node *type_tags;
755 union tree_node *subblocks;
756 union tree_node *supercontext;
757 union tree_node *abstract_origin;
758 struct rtx_def *end_note;
759 int live_range_start;
760 int live_range_end;
761};
762
763/* Define fields and accessors for nodes representing data types. */
764
765/* See tree.def for documentation of the use of these fields.
766 Look at the documentation of the various ..._TYPE tree codes. */
767
768#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
769#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
770#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
771#define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
772#define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values)
773#define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values)
774#define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values)
775#define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval)
776#define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval)
777#define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values)
778#define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
779#define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval)
780#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
781#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
782#define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval)
783#define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval)
784#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
785#define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
786#define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
787#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
788#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
789#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
|
781#define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
| |
782#define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
783#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
784#define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
785#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
786
| 790#define TYPE_NONCOPIED_PARTS(NODE) (TYPE_CHECK (NODE)->type.noncopied_parts)
791#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
792#define TYPE_OBSTACK(NODE) (TYPE_CHECK (NODE)->type.obstack)
793#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
794
|
| 795/* For aggregate types, information about this type, as a base type
796 for itself. Used in a language-dependent way for types that are
797 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */
798#define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo)
799
|
787/* The (language-specific) typed-based alias set for this type.
788 Objects whose TYPE_ALIAS_SETs are different cannot alias each
789 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
790 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
791 type can alias objects of any type. */
792#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
793
794/* Nonzero iff the typed-based alias set for this type has been
795 calculated. */
796#define TYPE_ALIAS_SET_KNOWN_P(NODE) \
797 (TYPE_CHECK (NODE)->type.alias_set != -1)
798
799/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
800 to this type. */
801#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
802
803/* The alignment necessary for objects of this type.
804 The value is an int, measured in bits. */
805#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
806
807#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
808
809/* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
810 has BLKmode only because it lacks the alignment requirement for
811 its size. */
812#define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
813
814/* Nonzero in a type considered volatile as a whole. */
815#define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
816
817/* Means this type is const-qualified. */
818#define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
819
| 800/* The (language-specific) typed-based alias set for this type.
801 Objects whose TYPE_ALIAS_SETs are different cannot alias each
802 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
803 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
804 type can alias objects of any type. */
805#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
806
807/* Nonzero iff the typed-based alias set for this type has been
808 calculated. */
809#define TYPE_ALIAS_SET_KNOWN_P(NODE) \
810 (TYPE_CHECK (NODE)->type.alias_set != -1)
811
812/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
813 to this type. */
814#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
815
816/* The alignment necessary for objects of this type.
817 The value is an int, measured in bits. */
818#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
819
820#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE))
821
822/* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
823 has BLKmode only because it lacks the alignment requirement for
824 its size. */
825#define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
826
827/* Nonzero in a type considered volatile as a whole. */
828#define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag)
829
830/* Means this type is const-qualified. */
831#define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag)
832
|
| 833/* If nonzero, this type is `restrict'-qualified, in the C sense of
834 the term. */
835#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
836
837/* There is a TYPE_QUAL value for each type qualifier. They can be
838 combined by bitwise-or to form the complete set of qualifiers for a
839 type. */
840
841#define TYPE_UNQUALIFIED 0x0
842#define TYPE_QUAL_CONST 0x1
843#define TYPE_QUAL_VOLATILE 0x2
844#define TYPE_QUAL_RESTRICT 0x4
845
846/* The set of type qualifiers for this type. */
847#define TYPE_QUALS(NODE) \
848 ((TYPE_READONLY(NODE) * TYPE_QUAL_CONST) | \
849 (TYPE_VOLATILE(NODE) * TYPE_QUAL_VOLATILE) | \
850 (TYPE_RESTRICT(NODE) * TYPE_QUAL_RESTRICT))
851
|
820/* These flags are available for each language front end to use internally. */
821#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
822#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
823#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
824#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
825#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
826#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
827#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
828
829/* If set in an ARRAY_TYPE, indicates a string type (for languages
830 that distinguish string from array of char).
831 If set in a SET_TYPE, indicates a bitstring type. */
832#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
833
834/* If non-NULL, this is a upper bound of the size (in bytes) of an
835 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
836#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
837
838/* Indicates that objects of this type must be initialized by calling a
839 function when they are created. */
840#define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
841
842/* Indicates that objects of this type (a UNION_TYPE), should be passed
843 the same way that the first union alternative would be passed. */
844#define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
845
846/* Indicated that objects of this type should be laid out in as
847 compact a way as possible. */
848#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
849
850struct tree_type
851{
852 char common[sizeof (struct tree_common)];
853 union tree_node *values;
854 union tree_node *size;
855 union tree_node *size_unit;
856 union tree_node *attributes;
857 unsigned uid;
858
859 unsigned char precision;
860#ifdef ONLY_INT_FIELDS
861 int mode : 8;
862#else
863 enum machine_mode mode : 8;
864#endif
865
866 unsigned string_flag : 1;
867 unsigned no_force_blk_flag : 1;
868 unsigned needs_constructing_flag : 1;
869 unsigned transparent_union_flag : 1;
870 unsigned packed_flag : 1;
| 852/* These flags are available for each language front end to use internally. */
853#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
854#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
855#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
856#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
857#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
858#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
859#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
860
861/* If set in an ARRAY_TYPE, indicates a string type (for languages
862 that distinguish string from array of char).
863 If set in a SET_TYPE, indicates a bitstring type. */
864#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
865
866/* If non-NULL, this is a upper bound of the size (in bytes) of an
867 object of the given ARRAY_TYPE. This allows temporaries to be allocated. */
868#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE)
869
870/* Indicates that objects of this type must be initialized by calling a
871 function when they are created. */
872#define TYPE_NEEDS_CONSTRUCTING(NODE) (TYPE_CHECK (NODE)->type.needs_constructing_flag)
873
874/* Indicates that objects of this type (a UNION_TYPE), should be passed
875 the same way that the first union alternative would be passed. */
876#define TYPE_TRANSPARENT_UNION(NODE) (TYPE_CHECK (NODE)->type.transparent_union_flag)
877
878/* Indicated that objects of this type should be laid out in as
879 compact a way as possible. */
880#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
881
882struct tree_type
883{
884 char common[sizeof (struct tree_common)];
885 union tree_node *values;
886 union tree_node *size;
887 union tree_node *size_unit;
888 union tree_node *attributes;
889 unsigned uid;
890
891 unsigned char precision;
892#ifdef ONLY_INT_FIELDS
893 int mode : 8;
894#else
895 enum machine_mode mode : 8;
896#endif
897
898 unsigned string_flag : 1;
899 unsigned no_force_blk_flag : 1;
900 unsigned needs_constructing_flag : 1;
901 unsigned transparent_union_flag : 1;
902 unsigned packed_flag : 1;
|
| 903 unsigned restrict_flag : 1;
904
|
871 unsigned lang_flag_0 : 1;
872 unsigned lang_flag_1 : 1;
873 unsigned lang_flag_2 : 1;
874 unsigned lang_flag_3 : 1;
875 unsigned lang_flag_4 : 1;
876 unsigned lang_flag_5 : 1;
877 unsigned lang_flag_6 : 1;
| 905 unsigned lang_flag_0 : 1;
906 unsigned lang_flag_1 : 1;
907 unsigned lang_flag_2 : 1;
908 unsigned lang_flag_3 : 1;
909 unsigned lang_flag_4 : 1;
910 unsigned lang_flag_5 : 1;
911 unsigned lang_flag_6 : 1;
|
878 /* room for 4 more bits */
| 912 /* room for 3 more bits */
|
879
880 unsigned int align;
881 union tree_node *pointer_to;
882 union tree_node *reference_to;
883 union {int address; char *pointer; } symtab;
884 union tree_node *name;
885 union tree_node *minval;
886 union tree_node *maxval;
887 union tree_node *next_variant;
888 union tree_node *main_variant;
889 union tree_node *binfo;
890 union tree_node *noncopied_parts;
891 union tree_node *context;
892 struct obstack *obstack;
893 int alias_set;
894 /* Points to a structure whose details depend on the language in use. */
895 struct lang_type *lang_specific;
896};
897
898/* Define accessor macros for information about type inheritance
899 and basetypes.
900
901 A "basetype" means a particular usage of a data type for inheritance
902 in another type. Each such basetype usage has its own "binfo"
903 object to describe it. The binfo object is a TREE_VEC node.
904
905 Inheritance is represented by the binfo nodes allocated for a
906 given type. For example, given types C and D, such that D is
907 inherited by C, 3 binfo nodes will be allocated: one for describing
908 the binfo properties of C, similarly one for D, and one for
909 describing the binfo properties of D as a base type for C.
910 Thus, given a pointer to class C, one can get a pointer to the binfo
911 of D acting as a basetype for C by looking at C's binfo's basetypes. */
912
913/* The actual data type node being inherited in this basetype. */
914#define BINFO_TYPE(NODE) TREE_TYPE (NODE)
915
916/* The offset where this basetype appears in its containing type.
917 BINFO_OFFSET slot holds the offset (in bytes)
918 from the base of the complete object to the base of the part of the
919 object that is allocated on behalf of this `type'.
920 This is always 0 except when there is multiple inheritance. */
921
922#define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
923#define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
924#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
925
926/* The virtual function table belonging to this basetype. Virtual
927 function tables provide a mechanism for run-time method dispatching.
928 The entries of a virtual function table are language-dependent. */
929
930#define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
931#define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
932
933/* The virtual functions in the virtual function table. This is
934 a TREE_LIST that is used as an initial approximation for building
935 a virtual function table for this basetype. */
936#define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
937#define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
938
939/* A vector of additional binfos for the types inherited by this basetype.
940
941 If this basetype describes type D as inherited in C,
942 and if the basetypes of D are E anf F,
943 then this vector contains binfos for inheritance of E and F by C.
944
945 ??? This could probably be done by just allocating the
946 base types at the end of this TREE_VEC (instead of using
947 another TREE_VEC). This would simplify the calculation
948 of how many basetypes a given type had. */
949#define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
950#define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
951
952/* Accessor macro to get to the Nth basetype of this basetype. */
953#define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
954#define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
955
956/* For a BINFO record describing an inheritance, this yields a pointer
957 to the artificial FIELD_DECL node which contains the "virtual base
958 class pointer" for the given inheritance. */
959#define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
960
961/* The size of a base class subobject of this type. Not all frontends
962 currently allocate the space for this field. */
963#define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
964#define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
965
966/* Slot used to build a chain that represents a use of inheritance.
967 For example, if X is derived from Y, and Y is derived from Z,
968 then this field can be used to link the binfo node for X to
969 the binfo node for X's Y to represent the use of inheritance
970 from X to Y. Similarly, this slot of the binfo node for X's Y
971 can point to the Z from which Y is inherited (in X's inheritance
972 hierarchy). In this fashion, one can represent and traverse specific
973 uses of inheritance using the binfo nodes themselves (instead of
974 consing new space pointing to binfo nodes).
975 It is up to the language-dependent front-ends to maintain
976 this information as necessary. */
977#define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
978
979/* Define fields and accessors for nodes representing declared names. */
980
| 913
914 unsigned int align;
915 union tree_node *pointer_to;
916 union tree_node *reference_to;
917 union {int address; char *pointer; } symtab;
918 union tree_node *name;
919 union tree_node *minval;
920 union tree_node *maxval;
921 union tree_node *next_variant;
922 union tree_node *main_variant;
923 union tree_node *binfo;
924 union tree_node *noncopied_parts;
925 union tree_node *context;
926 struct obstack *obstack;
927 int alias_set;
928 /* Points to a structure whose details depend on the language in use. */
929 struct lang_type *lang_specific;
930};
931
932/* Define accessor macros for information about type inheritance
933 and basetypes.
934
935 A "basetype" means a particular usage of a data type for inheritance
936 in another type. Each such basetype usage has its own "binfo"
937 object to describe it. The binfo object is a TREE_VEC node.
938
939 Inheritance is represented by the binfo nodes allocated for a
940 given type. For example, given types C and D, such that D is
941 inherited by C, 3 binfo nodes will be allocated: one for describing
942 the binfo properties of C, similarly one for D, and one for
943 describing the binfo properties of D as a base type for C.
944 Thus, given a pointer to class C, one can get a pointer to the binfo
945 of D acting as a basetype for C by looking at C's binfo's basetypes. */
946
947/* The actual data type node being inherited in this basetype. */
948#define BINFO_TYPE(NODE) TREE_TYPE (NODE)
949
950/* The offset where this basetype appears in its containing type.
951 BINFO_OFFSET slot holds the offset (in bytes)
952 from the base of the complete object to the base of the part of the
953 object that is allocated on behalf of this `type'.
954 This is always 0 except when there is multiple inheritance. */
955
956#define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1)
957#define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE))
958#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
959
960/* The virtual function table belonging to this basetype. Virtual
961 function tables provide a mechanism for run-time method dispatching.
962 The entries of a virtual function table are language-dependent. */
963
964#define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2)
965#define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE))
966
967/* The virtual functions in the virtual function table. This is
968 a TREE_LIST that is used as an initial approximation for building
969 a virtual function table for this basetype. */
970#define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3)
971#define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE))
972
973/* A vector of additional binfos for the types inherited by this basetype.
974
975 If this basetype describes type D as inherited in C,
976 and if the basetypes of D are E anf F,
977 then this vector contains binfos for inheritance of E and F by C.
978
979 ??? This could probably be done by just allocating the
980 base types at the end of this TREE_VEC (instead of using
981 another TREE_VEC). This would simplify the calculation
982 of how many basetypes a given type had. */
983#define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4)
984#define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4)
985
986/* Accessor macro to get to the Nth basetype of this basetype. */
987#define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N))
988#define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N)))
989
990/* For a BINFO record describing an inheritance, this yields a pointer
991 to the artificial FIELD_DECL node which contains the "virtual base
992 class pointer" for the given inheritance. */
993#define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5)
994
995/* The size of a base class subobject of this type. Not all frontends
996 currently allocate the space for this field. */
997#define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6)
998#define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE))
999
1000/* Slot used to build a chain that represents a use of inheritance.
1001 For example, if X is derived from Y, and Y is derived from Z,
1002 then this field can be used to link the binfo node for X to
1003 the binfo node for X's Y to represent the use of inheritance
1004 from X to Y. Similarly, this slot of the binfo node for X's Y
1005 can point to the Z from which Y is inherited (in X's inheritance
1006 hierarchy). In this fashion, one can represent and traverse specific
1007 uses of inheritance using the binfo nodes themselves (instead of
1008 consing new space pointing to binfo nodes).
1009 It is up to the language-dependent front-ends to maintain
1010 this information as necessary. */
1011#define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0)
1012
1013/* Define fields and accessors for nodes representing declared names. */
1014
|
| 1015/* Nonzero if DECL represents a decl. */
1016#define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd')
|
981/* This is the name of the object as written by the user.
982 It is an IDENTIFIER_NODE. */
983#define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
984/* This is the name of the object as the assembler will see it
985 (but before any translations made by ASM_OUTPUT_LABELREF).
986 Often this is the same as DECL_NAME.
987 It is an IDENTIFIER_NODE. */
988#define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
989/* Records the section name in a section attribute. Used to pass
990 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
991#define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
992/* For FIELD_DECLs, this is the
993 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
994 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
995 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
996 containing function, the RECORD_TYPE or UNION_TYPE for the containing
997 type, or NULL_TREE if the given decl has "file scope". */
998#define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
999#define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1000/* In a DECL this is the field where configuration dependent machine
1001 attributes are store */
1002#define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1003/* In a FIELD_DECL, this is the field position, counting in bits,
1004 of the bit closest to the beginning of the structure. */
1005#define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1006/* In a FIELD_DECL, this indicates whether the field was a bit-field and
1007 if so, the type that was originally specified for it.
1008 TREE_TYPE may have been modified (in finish_struct). */
1009#define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1010/* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1011/* VAR_DECL and PARM_DECL reserve the arguments slot
1012 for language-specific uses. */
1013#define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1014/* In FUNCTION_DECL, holds the decl for the return value. */
1015#define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1016/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1017#define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1018/* In PARM_DECL, holds the type as written (perhaps a function or array). */
1019#define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1020/* For a FUNCTION_DECL, holds the tree of BINDINGs.
1021 For a VAR_DECL, holds the initial value.
1022 For a PARM_DECL, not used--default
1023 values for parameters are encoded in the type of the function,
1024 not in the PARM_DECL slot. */
1025#define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1026/* For a PARM_DECL, records the data type used to pass the argument,
1027 which may be different from the type seen in the program. */
1028#define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1029/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1030 if nonzero, indicates that the field occupies the type. */
1031#define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1032/* These two fields describe where in the source code the declaration was. */
1033#define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1034#define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1035/* Holds the size of the datum, as a tree expression.
1036 Need not be constant. */
1037#define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1038/* Holds the alignment required for the datum. */
1039#define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1040/* Holds the machine mode corresponding to the declaration of a variable or
1041 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1042 FIELD_DECL. */
1043#define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1044/* Holds the RTL expression for the value of a variable or function. If
1045 PROMOTED_MODE is defined, the mode of this expression may not be same
1046 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1047 to the variable's data type, while the mode
1048 of DECL_RTL is the mode actually used to contain the data. */
1049#define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1050/* Holds an INSN_LIST of all of the live ranges in which the variable
1051 has been moved to a possibly different register. */
1052#define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1053/* For PARM_DECL, holds an RTL for the stack slot or register
1054 where the data was actually passed. */
1055#define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1056/* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1057#define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1058/* For FUNCTION_DECL, if it is inline,
1059 holds the size of the stack frame, as an integer. */
1060#define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1061/* For FUNCTION_DECL, if it is built-in,
1062 this identifies which built-in operation it is. */
1063#define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f)
1064#define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f = (VAL))
1065/* For a FIELD_DECL, holds the size of the member as an integer. */
1066#define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1067
1068/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1069 Before the struct containing the FUNCTION_DECL is laid out,
1070 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1071 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1072 function. When the class is laid out, this pointer is changed
1073 to an INTEGER_CST node which is suitable for use as an index
1074 into the virtual function table. */
1075#define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1076/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1077 which this FIELD_DECL is defined. This information is needed when
1078 writing debugging information about vfield and vbase decls for C++. */
1079#define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1080
1081/* Every ..._DECL node gets a unique number. */
1082#define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1083
1084/* For any sort of a ..._DECL node, this points to the original (abstract)
1085 decl node which this decl is an instance of, or else it is NULL indicating
1086 that this decl is not an instance of some other decl. For example,
1087 in a nested declaration of an inline function, this points back to the
1088 definition. */
1089#define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1090
| 1017/* This is the name of the object as written by the user.
1018 It is an IDENTIFIER_NODE. */
1019#define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name)
1020/* This is the name of the object as the assembler will see it
1021 (but before any translations made by ASM_OUTPUT_LABELREF).
1022 Often this is the same as DECL_NAME.
1023 It is an IDENTIFIER_NODE. */
1024#define DECL_ASSEMBLER_NAME(NODE) (DECL_CHECK (NODE)->decl.assembler_name)
1025/* Records the section name in a section attribute. Used to pass
1026 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
1027#define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name)
1028/* For FIELD_DECLs, this is the
1029 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is
1030 a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL,
1031 and CONST_DECL nodes, this points to either the FUNCTION_DECL for the
1032 containing function, the RECORD_TYPE or UNION_TYPE for the containing
1033 type, or NULL_TREE if the given decl has "file scope". */
1034#define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1035#define DECL_FIELD_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context)
1036/* In a DECL this is the field where configuration dependent machine
1037 attributes are store */
1038#define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes)
1039/* In a FIELD_DECL, this is the field position, counting in bits,
1040 of the bit closest to the beginning of the structure. */
1041#define DECL_FIELD_BITPOS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1042/* In a FIELD_DECL, this indicates whether the field was a bit-field and
1043 if so, the type that was originally specified for it.
1044 TREE_TYPE may have been modified (in finish_struct). */
1045#define DECL_BIT_FIELD_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1046/* In FUNCTION_DECL, a chain of ..._DECL nodes. */
1047/* VAR_DECL and PARM_DECL reserve the arguments slot
1048 for language-specific uses. */
1049#define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments)
1050/* In FUNCTION_DECL, holds the decl for the return value. */
1051#define DECL_RESULT(NODE) (DECL_CHECK (NODE)->decl.result)
1052/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
1053#define DECL_ORIGINAL_TYPE(NODE) (DECL_CHECK (NODE)->decl.result)
1054/* In PARM_DECL, holds the type as written (perhaps a function or array). */
1055#define DECL_ARG_TYPE_AS_WRITTEN(NODE) (DECL_CHECK (NODE)->decl.result)
1056/* For a FUNCTION_DECL, holds the tree of BINDINGs.
1057 For a VAR_DECL, holds the initial value.
1058 For a PARM_DECL, not used--default
1059 values for parameters are encoded in the type of the function,
1060 not in the PARM_DECL slot. */
1061#define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial)
1062/* For a PARM_DECL, records the data type used to pass the argument,
1063 which may be different from the type seen in the program. */
1064#define DECL_ARG_TYPE(NODE) (DECL_CHECK (NODE)->decl.initial) /* In PARM_DECL. */
1065/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
1066 if nonzero, indicates that the field occupies the type. */
1067#define DECL_QUALIFIER(NODE) (DECL_CHECK (NODE)->decl.initial)
1068/* These two fields describe where in the source code the declaration was. */
1069#define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename)
1070#define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum)
1071/* Holds the size of the datum, as a tree expression.
1072 Need not be constant. */
1073#define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size)
1074/* Holds the alignment required for the datum. */
1075#define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.frame_size.u)
1076/* Holds the machine mode corresponding to the declaration of a variable or
1077 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1078 FIELD_DECL. */
1079#define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode)
1080/* Holds the RTL expression for the value of a variable or function. If
1081 PROMOTED_MODE is defined, the mode of this expression may not be same
1082 as DECL_MODE. In that case, DECL_MODE contains the mode corresponding
1083 to the variable's data type, while the mode
1084 of DECL_RTL is the mode actually used to contain the data. */
1085#define DECL_RTL(NODE) (DECL_CHECK (NODE)->decl.rtl)
1086/* Holds an INSN_LIST of all of the live ranges in which the variable
1087 has been moved to a possibly different register. */
1088#define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl)
1089/* For PARM_DECL, holds an RTL for the stack slot or register
1090 where the data was actually passed. */
1091#define DECL_INCOMING_RTL(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1092/* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */
1093#define DECL_SAVED_INSNS(NODE) (DECL_CHECK (NODE)->decl.saved_insns.r)
1094/* For FUNCTION_DECL, if it is inline,
1095 holds the size of the stack frame, as an integer. */
1096#define DECL_FRAME_SIZE(NODE) (DECL_CHECK (NODE)->decl.frame_size.i)
1097/* For FUNCTION_DECL, if it is built-in,
1098 this identifies which built-in operation it is. */
1099#define DECL_FUNCTION_CODE(NODE) (DECL_CHECK (NODE)->decl.frame_size.f)
1100#define DECL_SET_FUNCTION_CODE(NODE,VAL) (DECL_CHECK (NODE)->decl.frame_size.f = (VAL))
1101/* For a FIELD_DECL, holds the size of the member as an integer. */
1102#define DECL_FIELD_SIZE(NODE) (DECL_CHECK (NODE)->decl.saved_insns.i)
1103
1104/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
1105 Before the struct containing the FUNCTION_DECL is laid out,
1106 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
1107 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
1108 function. When the class is laid out, this pointer is changed
1109 to an INTEGER_CST node which is suitable for use as an index
1110 into the virtual function table. */
1111#define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex)
1112/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
1113 which this FIELD_DECL is defined. This information is needed when
1114 writing debugging information about vfield and vbase decls for C++. */
1115#define DECL_FCONTEXT(NODE) (DECL_CHECK (NODE)->decl.vindex)
1116
1117/* Every ..._DECL node gets a unique number. */
1118#define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid)
1119
1120/* For any sort of a ..._DECL node, this points to the original (abstract)
1121 decl node which this decl is an instance of, or else it is NULL indicating
1122 that this decl is not an instance of some other decl. For example,
1123 in a nested declaration of an inline function, this points back to the
1124 definition. */
1125#define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin)
1126
|
| 1127/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1128 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1129#define DECL_ORIGIN(NODE) \
1130 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE)
1131
|
1091/* Nonzero for any sort of ..._DECL node means this decl node represents
1092 an inline instance of some original (abstract) decl from an inline function;
1093 suppress any warnings about shadowing some other variable. */
1094#define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1095
1096/* Nonzero if a _DECL means that the name of this decl should be ignored
1097 for symbolic debug purposes. */
1098#define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1099
1100/* Nonzero for a given ..._DECL node means that this node represents an
1101 "abstract instance" of the given declaration (e.g. in the original
1102 declaration of an inline function). When generating symbolic debugging
1103 information, we mustn't try to generate any address information for nodes
1104 marked as "abstract instances" because we don't actually generate
1105 any code or allocate any data space for such instances. */
1106#define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1107
1108/* Nonzero if a _DECL means that no warnings should be generated just
1109 because this decl is unused. */
1110#define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1111
1112/* Nonzero for a given ..._DECL node means that this node should be
1113 put in .common, if possible. If a DECL_INITIAL is given, and it
1114 is not error_mark_node, then the decl cannot be put in .common. */
1115#define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1116
1117/* Language-specific decl information. */
1118#define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1119
1120/* In a VAR_DECL or FUNCTION_DECL,
1121 nonzero means external reference:
1122 do not allocate storage, and refer to a definition elsewhere. */
1123#define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1124
| 1132/* Nonzero for any sort of ..._DECL node means this decl node represents
1133 an inline instance of some original (abstract) decl from an inline function;
1134 suppress any warnings about shadowing some other variable. */
1135#define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0)
1136
1137/* Nonzero if a _DECL means that the name of this decl should be ignored
1138 for symbolic debug purposes. */
1139#define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag)
1140
1141/* Nonzero for a given ..._DECL node means that this node represents an
1142 "abstract instance" of the given declaration (e.g. in the original
1143 declaration of an inline function). When generating symbolic debugging
1144 information, we mustn't try to generate any address information for nodes
1145 marked as "abstract instances" because we don't actually generate
1146 any code or allocate any data space for such instances. */
1147#define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag)
1148
1149/* Nonzero if a _DECL means that no warnings should be generated just
1150 because this decl is unused. */
1151#define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag)
1152
1153/* Nonzero for a given ..._DECL node means that this node should be
1154 put in .common, if possible. If a DECL_INITIAL is given, and it
1155 is not error_mark_node, then the decl cannot be put in .common. */
1156#define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag)
1157
1158/* Language-specific decl information. */
1159#define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific)
1160
1161/* In a VAR_DECL or FUNCTION_DECL,
1162 nonzero means external reference:
1163 do not allocate storage, and refer to a definition elsewhere. */
1164#define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1165
|
| 1166/* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
1167 initializatons. */
1168#define DEFAULT_INIT_PRIORITY 65535
1169#define MAX_INIT_PRIORITY 65535
1170#define MAX_RESERVED_INIT_PRIORITY 100
1171
|
1125/* In a TYPE_DECL
1126 nonzero means the detail info about this type is not dumped into stabs.
1127 Instead it will generate cross reference ('x') of names.
1128 This uses the same flag as DECL_EXTERNAL. */
1129#define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1130
1131
1132/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1133#define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1134/* In LABEL_DECL nodes, nonzero means that an error message about
1135 jumping into such a binding contour has been printed for this label. */
1136#define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1137/* In a FIELD_DECL, indicates this field should be bit-packed. */
1138#define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1139/* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1140 static chain is not needed. */
1141#define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1142
1143/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1144 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1145
1146 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1147
1148 Also set in some languages for variables, etc., outside the normal
1149 lexical scope, such as class instance variables. */
1150#define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1151
1152/* Nonzero in a FUNCTION_DECL means this function can be substituted
1153 where it is called. */
1154#define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1155
1156/* Nonzero in a FUNCTION_DECL means this is a built-in function
1157 that is not specified by ansi C and that users are supposed to be allowed
1158 to redefine for any purpose whatever. */
1159#define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1160
1161/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1162 specially. */
1163#define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1164/* In a LABEL_DECL, nonzero means label was defined inside a binding
1165 contour that restored a stack level and which is now exited. */
1166#define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1167/* In a FUNCTION_DECL, nonzero means a built in function. */
1168#define DECL_BUILT_IN(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1169/* In a VAR_DECL that's static,
1170 nonzero if the space is in the text section. */
1171#define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1172
1173/* Used in VAR_DECLs to indicate that the variable is a vtable.
1174 Used in FIELD_DECLs for vtable pointers.
1175 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1176#define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1177
1178/* Used to indicate that the linkage status of this DECL is not yet known,
1179 so it should not be output now. */
1180#define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1181
1182/* Used in PARM_DECLs whose type are unions to indicate that the
1183 argument should be passed in the same way that the first union
1184 alternative would be passed. */
1185#define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1186
1187/* Used in FUNCTION_DECLs to indicate that they should be run automatically
1188 at the beginning or end of execution. */
1189#define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1190#define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1191
1192/* Used to indicate that this DECL represents a compiler-generated entity. */
1193#define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1194
1195/* Used to indicate that this DECL has weak linkage. */
1196#define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1197
1198/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1199 multiple translation units should be merged. */
1200#define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1201
| 1172/* In a TYPE_DECL
1173 nonzero means the detail info about this type is not dumped into stabs.
1174 Instead it will generate cross reference ('x') of names.
1175 This uses the same flag as DECL_EXTERNAL. */
1176#define TYPE_DECL_SUPPRESS_DEBUG(NODE) (DECL_CHECK (NODE)->decl.external_flag)
1177
1178
1179/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
1180#define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1181/* In LABEL_DECL nodes, nonzero means that an error message about
1182 jumping into such a binding contour has been printed for this label. */
1183#define DECL_ERROR_ISSUED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1184/* In a FIELD_DECL, indicates this field should be bit-packed. */
1185#define DECL_PACKED(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1186/* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a
1187 static chain is not needed. */
1188#define DECL_NO_STATIC_CHAIN(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag)
1189
1190/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
1191 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
1192
1193 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
1194
1195 Also set in some languages for variables, etc., outside the normal
1196 lexical scope, such as class instance variables. */
1197#define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag)
1198
1199/* Nonzero in a FUNCTION_DECL means this function can be substituted
1200 where it is called. */
1201#define DECL_INLINE(NODE) (DECL_CHECK (NODE)->decl.inline_flag)
1202
1203/* Nonzero in a FUNCTION_DECL means this is a built-in function
1204 that is not specified by ansi C and that users are supposed to be allowed
1205 to redefine for any purpose whatever. */
1206#define DECL_BUILT_IN_NONANSI(NODE) ((NODE)->common.unsigned_flag)
1207
1208/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
1209 specially. */
1210#define DECL_BIT_FIELD(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1211/* In a LABEL_DECL, nonzero means label was defined inside a binding
1212 contour that restored a stack level and which is now exited. */
1213#define DECL_TOO_LATE(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1214/* In a FUNCTION_DECL, nonzero means a built in function. */
1215#define DECL_BUILT_IN(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1216/* In a VAR_DECL that's static,
1217 nonzero if the space is in the text section. */
1218#define DECL_IN_TEXT_SECTION(NODE) (DECL_CHECK (NODE)->decl.bit_field_flag)
1219
1220/* Used in VAR_DECLs to indicate that the variable is a vtable.
1221 Used in FIELD_DECLs for vtable pointers.
1222 Used in FUNCTION_DECLs to indicate that the function is virtual. */
1223#define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag)
1224
1225/* Used to indicate that the linkage status of this DECL is not yet known,
1226 so it should not be output now. */
1227#define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output)
1228
1229/* Used in PARM_DECLs whose type are unions to indicate that the
1230 argument should be passed in the same way that the first union
1231 alternative would be passed. */
1232#define DECL_TRANSPARENT_UNION(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1233
1234/* Used in FUNCTION_DECLs to indicate that they should be run automatically
1235 at the beginning or end of execution. */
1236#define DECL_STATIC_CONSTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_ctor_flag)
1237#define DECL_STATIC_DESTRUCTOR(NODE) (DECL_CHECK (NODE)->decl.static_dtor_flag)
1238
1239/* Used to indicate that this DECL represents a compiler-generated entity. */
1240#define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag)
1241
1242/* Used to indicate that this DECL has weak linkage. */
1243#define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag)
1244
1245/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
1246 multiple translation units should be merged. */
1247#define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union)
1248
|
| 1249/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
1250 not be put out unless it is needed in this translation unit.
1251 Entities like this are shared across translation units (like weak
1252 entities), but are guaranteed to be generated by any translation
1253 unit that needs them, and therefore need not be put out anywhere
1254 where they are not needed. DECL_COMDAT is just a hint to the
1255 back-end; it is up to front-ends which set this flag to ensure
1256 that there will never be any harm, other than bloat, in putting out
1257 something which is DECL_COMDAT. */
1258#define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag)
1259
1260/* Used in FUNCTION_DECLs to indicate that function entry and exit should
1261 be instrumented with calls to support routines. */
1262#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) ((NODE)->decl.no_instrument_function_entry_exit)
1263
1264/* Used in FUNCTION_DECLs to indicate that in this function,
1265 check-memory-usage should be disabled. */
1266#define DECL_NO_CHECK_MEMORY_USAGE(NODE) ((NODE)->decl.no_check_memory_usage)
1267
|
1202/* Additional flags for language-specific uses. */
1203#define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1204#define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1205#define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1206#define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1207#define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1208#define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1209#define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1210#define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1211
1212/* Used to indicate that the pointer to this DECL cannot be treated as
1213 an address constant. */
1214#define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1215
| 1268/* Additional flags for language-specific uses. */
1269#define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0)
1270#define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1)
1271#define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2)
1272#define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3)
1273#define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4)
1274#define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5)
1275#define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6)
1276#define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7)
1277
1278/* Used to indicate that the pointer to this DECL cannot be treated as
1279 an address constant. */
1280#define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p)
1281
|
| 1282/* Used to indicate an alias set for the memory pointed to by this
1283 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
1284 pointer (or reference) type. */
1285#define DECL_POINTER_ALIAS_SET(NODE) \
1286 (DECL_CHECK (NODE)->decl.pointer_alias_set)
1287
1288/* Nonzero if an alias set has been assigned to this declaration. */
1289#define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
1290 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
1291
|
1216struct tree_decl
1217{
1218 char common[sizeof (struct tree_common)];
1219 char *filename;
1220 int linenum;
1221 unsigned int uid;
1222 union tree_node *size;
1223#ifdef ONLY_INT_FIELDS
1224 int mode : 8;
1225#else
1226 enum machine_mode mode : 8;
1227#endif
1228
1229 unsigned external_flag : 1;
1230 unsigned nonlocal_flag : 1;
1231 unsigned regdecl_flag : 1;
1232 unsigned inline_flag : 1;
1233 unsigned bit_field_flag : 1;
1234 unsigned virtual_flag : 1;
1235 unsigned ignored_flag : 1;
1236 unsigned abstract_flag : 1;
1237
1238 unsigned in_system_header_flag : 1;
1239 unsigned common_flag : 1;
1240 unsigned defer_output : 1;
1241 unsigned transparent_union : 1;
1242 unsigned static_ctor_flag : 1;
1243 unsigned static_dtor_flag : 1;
1244 unsigned artificial_flag : 1;
1245 unsigned weak_flag : 1;
| 1292struct tree_decl
1293{
1294 char common[sizeof (struct tree_common)];
1295 char *filename;
1296 int linenum;
1297 unsigned int uid;
1298 union tree_node *size;
1299#ifdef ONLY_INT_FIELDS
1300 int mode : 8;
1301#else
1302 enum machine_mode mode : 8;
1303#endif
1304
1305 unsigned external_flag : 1;
1306 unsigned nonlocal_flag : 1;
1307 unsigned regdecl_flag : 1;
1308 unsigned inline_flag : 1;
1309 unsigned bit_field_flag : 1;
1310 unsigned virtual_flag : 1;
1311 unsigned ignored_flag : 1;
1312 unsigned abstract_flag : 1;
1313
1314 unsigned in_system_header_flag : 1;
1315 unsigned common_flag : 1;
1316 unsigned defer_output : 1;
1317 unsigned transparent_union : 1;
1318 unsigned static_ctor_flag : 1;
1319 unsigned static_dtor_flag : 1;
1320 unsigned artificial_flag : 1;
1321 unsigned weak_flag : 1;
|
1246 /* room for no more */
| |
1247
1248 unsigned lang_flag_0 : 1;
1249 unsigned lang_flag_1 : 1;
1250 unsigned lang_flag_2 : 1;
1251 unsigned lang_flag_3 : 1;
1252 unsigned lang_flag_4 : 1;
1253 unsigned lang_flag_5 : 1;
1254 unsigned lang_flag_6 : 1;
1255 unsigned lang_flag_7 : 1;
1256
1257 unsigned non_addr_const_p : 1;
| 1322
1323 unsigned lang_flag_0 : 1;
1324 unsigned lang_flag_1 : 1;
1325 unsigned lang_flag_2 : 1;
1326 unsigned lang_flag_3 : 1;
1327 unsigned lang_flag_4 : 1;
1328 unsigned lang_flag_5 : 1;
1329 unsigned lang_flag_6 : 1;
1330 unsigned lang_flag_7 : 1;
1331
1332 unsigned non_addr_const_p : 1;
|
| 1333 unsigned no_instrument_function_entry_exit : 1;
1334 unsigned no_check_memory_usage : 1;
1335 unsigned comdat_flag : 1;
|
1258
1259 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1260 If built-in, this is the code for which built-in function.
1261 For other kinds of decls, this is DECL_ALIGN. */
1262 union {
1263 int i;
1264 unsigned int u;
1265 enum built_in_function f;
1266 } frame_size;
1267
1268 union tree_node *name;
1269 union tree_node *context;
1270 union tree_node *arguments;
1271 union tree_node *result;
1272 union tree_node *initial;
1273 union tree_node *abstract_origin;
1274 union tree_node *assembler_name;
1275 union tree_node *section_name;
1276 union tree_node *machine_attributes;
1277 struct rtx_def *rtl; /* acts as link to register transfer language
1278 (rtl) info */
1279 struct rtx_def *live_range_rtl;
1280 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1281 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1282 union {
1283 struct rtx_def *r;
1284 HOST_WIDE_INT i;
1285 } saved_insns;
1286 union tree_node *vindex;
| 1336
1337 /* For a FUNCTION_DECL, if inline, this is the size of frame needed.
1338 If built-in, this is the code for which built-in function.
1339 For other kinds of decls, this is DECL_ALIGN. */
1340 union {
1341 int i;
1342 unsigned int u;
1343 enum built_in_function f;
1344 } frame_size;
1345
1346 union tree_node *name;
1347 union tree_node *context;
1348 union tree_node *arguments;
1349 union tree_node *result;
1350 union tree_node *initial;
1351 union tree_node *abstract_origin;
1352 union tree_node *assembler_name;
1353 union tree_node *section_name;
1354 union tree_node *machine_attributes;
1355 struct rtx_def *rtl; /* acts as link to register transfer language
1356 (rtl) info */
1357 struct rtx_def *live_range_rtl;
1358 /* For FUNCTION_DECLs: points to insn that constitutes its definition
1359 on the permanent obstack. For FIELD_DECL, this is DECL_FIELD_SIZE. */
1360 union {
1361 struct rtx_def *r;
1362 HOST_WIDE_INT i;
1363 } saved_insns;
1364 union tree_node *vindex;
|
| 1365 int pointer_alias_set;
|
1287 /* Points to a structure whose details depend on the language in use. */
1288 struct lang_decl *lang_specific;
1289};
1290
1291/* Define the overall contents of a tree node.
1292 It may be any of the structures declared above
1293 for various types of node. */
1294
1295union tree_node
1296{
1297 struct tree_common common;
1298 struct tree_int_cst int_cst;
1299 struct tree_real_cst real_cst;
1300 struct tree_string string;
1301 struct tree_complex complex;
1302 struct tree_identifier identifier;
1303 struct tree_decl decl;
1304 struct tree_type type;
1305 struct tree_list list;
1306 struct tree_vec vec;
1307 struct tree_exp exp;
1308 struct tree_block block;
1309 };
1310
| 1366 /* Points to a structure whose details depend on the language in use. */
1367 struct lang_decl *lang_specific;
1368};
1369
1370/* Define the overall contents of a tree node.
1371 It may be any of the structures declared above
1372 for various types of node. */
1373
1374union tree_node
1375{
1376 struct tree_common common;
1377 struct tree_int_cst int_cst;
1378 struct tree_real_cst real_cst;
1379 struct tree_string string;
1380 struct tree_complex complex;
1381 struct tree_identifier identifier;
1382 struct tree_decl decl;
1383 struct tree_type type;
1384 struct tree_list list;
1385 struct tree_vec vec;
1386 struct tree_exp exp;
1387 struct tree_block block;
1388 };
1389
|
1311#include "gansidecl.h"
1312
| |
1313#define NULL_TREE (tree) NULL
1314
1315/* The following functions accept a wide integer argument. Rather than
1316 having to cast on every function call, we use a macro instead, that is
1317 defined here and in rtl.h. */
1318
1319#ifndef exact_log2
1320#define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1321#define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1322#endif
1323extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1324extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1325
| 1390#define NULL_TREE (tree) NULL
1391
1392/* The following functions accept a wide integer argument. Rather than
1393 having to cast on every function call, we use a macro instead, that is
1394 defined here and in rtl.h. */
1395
1396#ifndef exact_log2
1397#define exact_log2(N) exact_log2_wide ((unsigned HOST_WIDE_INT) (N))
1398#define floor_log2(N) floor_log2_wide ((unsigned HOST_WIDE_INT) (N))
1399#endif
1400extern int exact_log2_wide PROTO((unsigned HOST_WIDE_INT));
1401extern int floor_log2_wide PROTO((unsigned HOST_WIDE_INT));
1402
|
1326#if 0
1327/* At present, don't prototype xrealloc, since all of the callers don't
1328 cast their pointers to char *, and all of the xrealloc's don't use
1329 void * yet. */
1330extern char *xmalloc PROTO((size_t));
1331extern char *xcalloc PROTO((size_t, size_t));
1332extern char *xrealloc PROTO((void *, size_t));
1333#else
1334extern char *xmalloc ();
1335extern char *xcalloc ();
1336extern char *xrealloc ();
1337#endif
1338
1339extern char *xstrdup PROTO((char *));
1340
| |
1341extern char *oballoc PROTO((int));
1342extern char *permalloc PROTO((int));
1343extern char *savealloc PROTO((int));
1344extern char *expralloc PROTO((int));
1345
1346/* Lowest level primitive for allocating a node.
1347 The TREE_CODE is the only argument. Contents are initialized
1348 to zero except for a few of the common fields. */
1349
1350extern tree make_node PROTO((enum tree_code));
1351
1352/* Make a copy of a node, with all the same contents except
1353 for TREE_PERMANENT. (The copy is permanent
1354 iff nodes being made now are permanent.) */
1355
1356extern tree copy_node PROTO((tree));
1357
1358/* Make a copy of a chain of TREE_LIST nodes. */
1359
1360extern tree copy_list PROTO((tree));
1361
1362/* Make a TREE_VEC. */
1363
1364extern tree make_tree_vec PROTO((int));
1365
1366/* Return the (unique) IDENTIFIER_NODE node for a given name.
1367 The name is supplied as a char *. */
1368
| 1403extern char *oballoc PROTO((int));
1404extern char *permalloc PROTO((int));
1405extern char *savealloc PROTO((int));
1406extern char *expralloc PROTO((int));
1407
1408/* Lowest level primitive for allocating a node.
1409 The TREE_CODE is the only argument. Contents are initialized
1410 to zero except for a few of the common fields. */
1411
1412extern tree make_node PROTO((enum tree_code));
1413
1414/* Make a copy of a node, with all the same contents except
1415 for TREE_PERMANENT. (The copy is permanent
1416 iff nodes being made now are permanent.) */
1417
1418extern tree copy_node PROTO((tree));
1419
1420/* Make a copy of a chain of TREE_LIST nodes. */
1421
1422extern tree copy_list PROTO((tree));
1423
1424/* Make a TREE_VEC. */
1425
1426extern tree make_tree_vec PROTO((int));
1427
1428/* Return the (unique) IDENTIFIER_NODE node for a given name.
1429 The name is supplied as a char *. */
1430
|
1369extern tree get_identifier PROTO((char *));
| 1431extern tree get_identifier PROTO((const char *));
|
1370
1371/* If an identifier with the name TEXT (a null-terminated string) has
1372 previously been referred to, return that node; otherwise return
1373 NULL_TREE. */
1374
| 1432
1433/* If an identifier with the name TEXT (a null-terminated string) has
1434 previously been referred to, return that node; otherwise return
1435 NULL_TREE. */
1436
|
1375extern tree maybe_get_identifier PROTO((char *));
| 1437extern tree maybe_get_identifier PROTO((const char *));
|
1376
1377/* Construct various types of nodes. */
1378
1379#define build_int_2(LO,HI) \
1380 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1381
1382extern tree build PVPROTO((enum tree_code, tree, ...));
1383extern tree build_nt PVPROTO((enum tree_code, ...));
1384extern tree build_parse_node PVPROTO((enum tree_code, ...));
1385
1386extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1387extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1388extern tree build_real_from_int_cst PROTO((tree, tree));
1389extern tree build_complex PROTO((tree, tree, tree));
| 1438
1439/* Construct various types of nodes. */
1440
1441#define build_int_2(LO,HI) \
1442 build_int_2_wide ((HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI))
1443
1444extern tree build PVPROTO((enum tree_code, tree, ...));
1445extern tree build_nt PVPROTO((enum tree_code, ...));
1446extern tree build_parse_node PVPROTO((enum tree_code, ...));
1447
1448extern tree build_int_2_wide PROTO((HOST_WIDE_INT, HOST_WIDE_INT));
1449extern tree build_real PROTO((tree, REAL_VALUE_TYPE));
1450extern tree build_real_from_int_cst PROTO((tree, tree));
1451extern tree build_complex PROTO((tree, tree, tree));
|
1390extern tree build_string PROTO((int, char *));
| 1452extern tree build_string PROTO((int, const char *));
|
1391extern tree build1 PROTO((enum tree_code, tree, tree));
1392extern tree build_tree_list PROTO((tree, tree));
1393extern tree build_decl_list PROTO((tree, tree));
1394extern tree build_expr_list PROTO((tree, tree));
1395extern tree build_decl PROTO((enum tree_code, tree, tree));
1396extern tree build_block PROTO((tree, tree, tree, tree, tree));
| 1453extern tree build1 PROTO((enum tree_code, tree, tree));
1454extern tree build_tree_list PROTO((tree, tree));
1455extern tree build_decl_list PROTO((tree, tree));
1456extern tree build_expr_list PROTO((tree, tree));
1457extern tree build_decl PROTO((enum tree_code, tree, tree));
1458extern tree build_block PROTO((tree, tree, tree, tree, tree));
|
1397extern tree build_expr_wfl PROTO((tree, char *, int, int));
| 1459extern tree build_expr_wfl PROTO((tree, const char *, int, int));
|
1398
1399/* Construct various nodes representing data types. */
1400
1401extern tree make_signed_type PROTO((int));
1402extern tree make_unsigned_type PROTO((int));
1403extern void set_sizetype PROTO((tree));
1404extern tree signed_or_unsigned_type PROTO((int, tree));
1405extern void fixup_unsigned_type PROTO((tree));
1406extern tree build_pointer_type PROTO((tree));
1407extern tree build_reference_type PROTO((tree));
1408extern tree build_index_type PROTO((tree));
1409extern tree build_index_2_type PROTO((tree, tree));
1410extern tree build_array_type PROTO((tree, tree));
1411extern tree build_function_type PROTO((tree, tree));
1412extern tree build_method_type PROTO((tree, tree));
1413extern tree build_offset_type PROTO((tree, tree));
1414extern tree build_complex_type PROTO((tree));
1415extern tree array_type_nelts PROTO((tree));
1416
1417extern tree value_member PROTO((tree, tree));
1418extern tree purpose_member PROTO((tree, tree));
1419extern tree binfo_member PROTO((tree, tree));
1420extern int attribute_hash_list PROTO((tree));
1421extern int attribute_list_equal PROTO((tree, tree));
1422extern int attribute_list_contained PROTO((tree, tree));
1423extern int tree_int_cst_equal PROTO((tree, tree));
1424extern int tree_int_cst_lt PROTO((tree, tree));
1425extern int tree_int_cst_sgn PROTO((tree));
1426extern int index_type_equal PROTO((tree, tree));
1427extern tree get_inner_array_type PROTO((tree));
1428
1429/* From expmed.c. Since rtl.h is included after tree.h, we can't
1430 put the prototype here. Rtl.h does declare the prototype if
1431 tree.h had been included. */
1432
1433extern tree make_tree PROTO((tree, struct rtx_def *));
1434
1435/* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1436 is ATTRIBUTE.
1437
1438 Such modified types already made are recorded so that duplicates
1439 are not made. */
1440
1441extern tree build_type_attribute_variant PROTO((tree, tree));
1442extern tree build_decl_attribute_variant PROTO((tree, tree));
1443
1444extern tree merge_machine_decl_attributes PROTO((tree, tree));
1445extern tree merge_machine_type_attributes PROTO((tree, tree));
1446
1447/* Split a list of declspecs and attributes into two. */
1448
1449extern void split_specs_attrs PROTO((tree, tree *, tree *));
1450
1451/* Strip attributes from a list of combined specs and attrs. */
1452
1453extern tree strip_attrs PROTO((tree));
1454
1455/* Return 1 if an attribute and its arguments are valid for a decl or type. */
1456
1457extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1458
1459/* Given a tree node and a string, return non-zero if the tree node is
1460 a valid attribute name for the string. */
1461
| 1460
1461/* Construct various nodes representing data types. */
1462
1463extern tree make_signed_type PROTO((int));
1464extern tree make_unsigned_type PROTO((int));
1465extern void set_sizetype PROTO((tree));
1466extern tree signed_or_unsigned_type PROTO((int, tree));
1467extern void fixup_unsigned_type PROTO((tree));
1468extern tree build_pointer_type PROTO((tree));
1469extern tree build_reference_type PROTO((tree));
1470extern tree build_index_type PROTO((tree));
1471extern tree build_index_2_type PROTO((tree, tree));
1472extern tree build_array_type PROTO((tree, tree));
1473extern tree build_function_type PROTO((tree, tree));
1474extern tree build_method_type PROTO((tree, tree));
1475extern tree build_offset_type PROTO((tree, tree));
1476extern tree build_complex_type PROTO((tree));
1477extern tree array_type_nelts PROTO((tree));
1478
1479extern tree value_member PROTO((tree, tree));
1480extern tree purpose_member PROTO((tree, tree));
1481extern tree binfo_member PROTO((tree, tree));
1482extern int attribute_hash_list PROTO((tree));
1483extern int attribute_list_equal PROTO((tree, tree));
1484extern int attribute_list_contained PROTO((tree, tree));
1485extern int tree_int_cst_equal PROTO((tree, tree));
1486extern int tree_int_cst_lt PROTO((tree, tree));
1487extern int tree_int_cst_sgn PROTO((tree));
1488extern int index_type_equal PROTO((tree, tree));
1489extern tree get_inner_array_type PROTO((tree));
1490
1491/* From expmed.c. Since rtl.h is included after tree.h, we can't
1492 put the prototype here. Rtl.h does declare the prototype if
1493 tree.h had been included. */
1494
1495extern tree make_tree PROTO((tree, struct rtx_def *));
1496
1497/* Return a type like TTYPE except that its TYPE_ATTRIBUTES
1498 is ATTRIBUTE.
1499
1500 Such modified types already made are recorded so that duplicates
1501 are not made. */
1502
1503extern tree build_type_attribute_variant PROTO((tree, tree));
1504extern tree build_decl_attribute_variant PROTO((tree, tree));
1505
1506extern tree merge_machine_decl_attributes PROTO((tree, tree));
1507extern tree merge_machine_type_attributes PROTO((tree, tree));
1508
1509/* Split a list of declspecs and attributes into two. */
1510
1511extern void split_specs_attrs PROTO((tree, tree *, tree *));
1512
1513/* Strip attributes from a list of combined specs and attrs. */
1514
1515extern tree strip_attrs PROTO((tree));
1516
1517/* Return 1 if an attribute and its arguments are valid for a decl or type. */
1518
1519extern int valid_machine_attribute PROTO((tree, tree, tree, tree));
1520
1521/* Given a tree node and a string, return non-zero if the tree node is
1522 a valid attribute name for the string. */
1523
|
1462extern int is_attribute_p PROTO((char *, tree));
| 1524extern int is_attribute_p PROTO((const char *, tree));
|
1463
1464/* Given an attribute name and a list of attributes, return the list element
1465 of the attribute or NULL_TREE if not found. */
1466
| 1525
1526/* Given an attribute name and a list of attributes, return the list element
1527 of the attribute or NULL_TREE if not found. */
1528
|
1467extern tree lookup_attribute PROTO((char *, tree));
| 1529extern tree lookup_attribute PROTO((const char *, tree));
|
1468
1469/* Given two attributes lists, return a list of their union. */
1470
1471extern tree merge_attributes PROTO((tree, tree));
1472
| 1530
1531/* Given two attributes lists, return a list of their union. */
1532
1533extern tree merge_attributes PROTO((tree, tree));
1534
|
1473/* Given a type node TYPE, and CONSTP and VOLATILEP, return a type
1474 for the same kind of data as TYPE describes.
1475 Variants point to the "main variant" (which has neither CONST nor VOLATILE)
1476 via TYPE_MAIN_VARIANT, and it points to a chain of other variants
1477 so that duplicate variants are never made.
1478 Only main variants should ever appear as types of expressions. */
| 1535/* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
1536 the same kind of data as TYPE describes. Variants point to the
1537 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
1538 and it points to a chain of other variants so that duplicate
1539 variants are never made. Only main variants should ever appear as
1540 types of expressions. */
|
1479
| 1541
|
1480extern tree build_type_variant PROTO((tree, int, int));
| 1542extern tree build_qualified_type PROTO((tree, int));
|
1481
| 1543
|
| 1544/* Like build_qualified_type, but only deals with the `const' and
1545 `volatile' qualifiers. This interface is retained for backwards
1546 compatiblity with the various front-ends; new code should use
1547 build_qualified_type instead. */
1548
1549#define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
1550 build_qualified_type (TYPE, \
1551 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
1552 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
1553
|
1482/* Make a copy of a type node. */
1483
1484extern tree build_type_copy PROTO((tree));
1485
1486/* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1487 TYPE_ALIGN and TYPE_MODE fields.
1488 If called more than once on one node, does nothing except
1489 for the first time. */
1490
1491extern void layout_type PROTO((tree));
1492
1493/* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1494 return a canonicalized ..._TYPE node, so that duplicates are not made.
1495 How the hash code is computed is up to the caller, as long as any two
1496 callers that could hash identical-looking type nodes agree. */
1497
1498extern tree type_hash_canon PROTO((int, tree));
1499
1500/* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1501 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1502 fields. Call this only once for any given decl node.
1503
1504 Second argument is the boundary that this field can be assumed to
1505 be starting at (in bits). Zero means it can be assumed aligned
1506 on any boundary that may be needed. */
1507
1508extern void layout_decl PROTO((tree, unsigned));
1509
1510/* Return an expr equal to X but certainly not valid as an lvalue. */
1511
1512extern tree non_lvalue PROTO((tree));
1513extern tree pedantic_non_lvalue PROTO((tree));
1514
1515extern tree convert PROTO((tree, tree));
1516extern tree size_in_bytes PROTO((tree));
1517extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1518extern tree size_binop PROTO((enum tree_code, tree, tree));
1519extern tree ssize_binop PROTO((enum tree_code, tree, tree));
1520extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1521 unsigned HOST_WIDE_INT, int));
1522#define size_int(L) size_int_2 ((L), 0, 0)
1523#define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1524#define size_int_2(L, H, T) \
1525 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1526 (unsigned HOST_WIDE_INT) (H), (T))
1527
1528extern tree round_up PROTO((tree, int));
1529extern tree get_pending_sizes PROTO((void));
1530extern void put_pending_sizes PROTO((tree));
1531
1532/* Type for sizes of data-type. */
1533
1534#define BITS_PER_UNIT_LOG \
1535 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1536 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1537 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1538
1539struct sizetype_tab
1540{
1541 tree xsizetype, xbitsizetype;
1542 tree xssizetype, xusizetype;
1543 tree xsbitsizetype, xubitsizetype;
1544};
1545
1546extern struct sizetype_tab sizetype_tab;
1547
1548#define sizetype sizetype_tab.xsizetype
1549#define bitsizetype sizetype_tab.xbitsizetype
1550#define ssizetype sizetype_tab.xssizetype
1551#define usizetype sizetype_tab.xusizetype
1552#define sbitsizetype sizetype_tab.xsbitsizetype
1553#define ubitsizetype sizetype_tab.xubitsizetype
1554
1555/* If nonzero, an upper limit on alignment of structure fields, in bits. */
1556extern int maximum_field_alignment;
1557
1558/* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1559extern int set_alignment;
1560
1561/* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1562 by making the last node in X point to Y.
1563 Returns X, except if X is 0 returns Y. */
1564
1565extern tree chainon PROTO((tree, tree));
1566
1567/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1568
1569extern tree tree_cons PROTO((tree, tree, tree));
1570extern tree perm_tree_cons PROTO((tree, tree, tree));
1571extern tree temp_tree_cons PROTO((tree, tree, tree));
1572extern tree saveable_tree_cons PROTO((tree, tree, tree));
1573extern tree decl_tree_cons PROTO((tree, tree, tree));
1574extern tree expr_tree_cons PROTO((tree, tree, tree));
1575
1576/* Return the last tree node in a chain. */
1577
1578extern tree tree_last PROTO((tree));
1579
1580/* Reverse the order of elements in a chain, and return the new head. */
1581
1582extern tree nreverse PROTO((tree));
1583
1584/* Returns the length of a chain of nodes
1585 (number of chain pointers to follow before reaching a null pointer). */
1586
1587extern int list_length PROTO((tree));
1588
1589/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1590
1591extern int integer_zerop PROTO((tree));
1592
1593/* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1594
1595extern int integer_onep PROTO((tree));
1596
1597/* integer_all_onesp (tree x) is nonzero if X is an integer constant
1598 all of whose significant bits are 1. */
1599
1600extern int integer_all_onesp PROTO((tree));
1601
1602/* integer_pow2p (tree x) is nonzero is X is an integer constant with
1603 exactly one bit 1. */
1604
1605extern int integer_pow2p PROTO((tree));
1606
1607/* staticp (tree x) is nonzero if X is a reference to data allocated
1608 at a fixed address in memory. */
1609
1610extern int staticp PROTO((tree));
1611
1612/* Gets an error if argument X is not an lvalue.
1613 Also returns 1 if X is an lvalue, 0 if not. */
1614
| 1554/* Make a copy of a type node. */
1555
1556extern tree build_type_copy PROTO((tree));
1557
1558/* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
1559 TYPE_ALIGN and TYPE_MODE fields.
1560 If called more than once on one node, does nothing except
1561 for the first time. */
1562
1563extern void layout_type PROTO((tree));
1564
1565/* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
1566 return a canonicalized ..._TYPE node, so that duplicates are not made.
1567 How the hash code is computed is up to the caller, as long as any two
1568 callers that could hash identical-looking type nodes agree. */
1569
1570extern tree type_hash_canon PROTO((int, tree));
1571
1572/* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
1573 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
1574 fields. Call this only once for any given decl node.
1575
1576 Second argument is the boundary that this field can be assumed to
1577 be starting at (in bits). Zero means it can be assumed aligned
1578 on any boundary that may be needed. */
1579
1580extern void layout_decl PROTO((tree, unsigned));
1581
1582/* Return an expr equal to X but certainly not valid as an lvalue. */
1583
1584extern tree non_lvalue PROTO((tree));
1585extern tree pedantic_non_lvalue PROTO((tree));
1586
1587extern tree convert PROTO((tree, tree));
1588extern tree size_in_bytes PROTO((tree));
1589extern HOST_WIDE_INT int_size_in_bytes PROTO((tree));
1590extern tree size_binop PROTO((enum tree_code, tree, tree));
1591extern tree ssize_binop PROTO((enum tree_code, tree, tree));
1592extern tree size_int_wide PROTO((unsigned HOST_WIDE_INT,
1593 unsigned HOST_WIDE_INT, int));
1594#define size_int(L) size_int_2 ((L), 0, 0)
1595#define bitsize_int(L, H) size_int_2 ((L), (H), 1)
1596#define size_int_2(L, H, T) \
1597 size_int_wide ((unsigned HOST_WIDE_INT) (L), \
1598 (unsigned HOST_WIDE_INT) (H), (T))
1599
1600extern tree round_up PROTO((tree, int));
1601extern tree get_pending_sizes PROTO((void));
1602extern void put_pending_sizes PROTO((tree));
1603
1604/* Type for sizes of data-type. */
1605
1606#define BITS_PER_UNIT_LOG \
1607 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
1608 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
1609 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
1610
1611struct sizetype_tab
1612{
1613 tree xsizetype, xbitsizetype;
1614 tree xssizetype, xusizetype;
1615 tree xsbitsizetype, xubitsizetype;
1616};
1617
1618extern struct sizetype_tab sizetype_tab;
1619
1620#define sizetype sizetype_tab.xsizetype
1621#define bitsizetype sizetype_tab.xbitsizetype
1622#define ssizetype sizetype_tab.xssizetype
1623#define usizetype sizetype_tab.xusizetype
1624#define sbitsizetype sizetype_tab.xsbitsizetype
1625#define ubitsizetype sizetype_tab.xubitsizetype
1626
1627/* If nonzero, an upper limit on alignment of structure fields, in bits. */
1628extern int maximum_field_alignment;
1629
1630/* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
1631extern int set_alignment;
1632
1633/* Concatenate two lists (chains of TREE_LIST nodes) X and Y
1634 by making the last node in X point to Y.
1635 Returns X, except if X is 0 returns Y. */
1636
1637extern tree chainon PROTO((tree, tree));
1638
1639/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
1640
1641extern tree tree_cons PROTO((tree, tree, tree));
1642extern tree perm_tree_cons PROTO((tree, tree, tree));
1643extern tree temp_tree_cons PROTO((tree, tree, tree));
1644extern tree saveable_tree_cons PROTO((tree, tree, tree));
1645extern tree decl_tree_cons PROTO((tree, tree, tree));
1646extern tree expr_tree_cons PROTO((tree, tree, tree));
1647
1648/* Return the last tree node in a chain. */
1649
1650extern tree tree_last PROTO((tree));
1651
1652/* Reverse the order of elements in a chain, and return the new head. */
1653
1654extern tree nreverse PROTO((tree));
1655
1656/* Returns the length of a chain of nodes
1657 (number of chain pointers to follow before reaching a null pointer). */
1658
1659extern int list_length PROTO((tree));
1660
1661/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
1662
1663extern int integer_zerop PROTO((tree));
1664
1665/* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
1666
1667extern int integer_onep PROTO((tree));
1668
1669/* integer_all_onesp (tree x) is nonzero if X is an integer constant
1670 all of whose significant bits are 1. */
1671
1672extern int integer_all_onesp PROTO((tree));
1673
1674/* integer_pow2p (tree x) is nonzero is X is an integer constant with
1675 exactly one bit 1. */
1676
1677extern int integer_pow2p PROTO((tree));
1678
1679/* staticp (tree x) is nonzero if X is a reference to data allocated
1680 at a fixed address in memory. */
1681
1682extern int staticp PROTO((tree));
1683
1684/* Gets an error if argument X is not an lvalue.
1685 Also returns 1 if X is an lvalue, 0 if not. */
1686
|
1615extern int lvalue_or_else PROTO((tree, char *));
| 1687extern int lvalue_or_else PROTO((tree, const char *));
|
1616
1617/* save_expr (EXP) returns an expression equivalent to EXP
1618 but it can be used multiple times within context CTX
1619 and only evaluate EXP once. */
1620
1621extern tree save_expr PROTO((tree));
1622
1623/* Returns the index of the first non-tree operand for CODE, or the number
1624 of operands if all are trees. */
1625
1626extern int first_rtl_op PROTO((enum tree_code));
1627
1628/* unsave_expr (EXP) returns an expression equivalent to EXP but it
1629 can be used multiple times and will evaluate EXP, in its entirety
1630 each time. */
1631
1632extern tree unsave_expr PROTO((tree));
1633
1634/* unsave_expr_now (EXP) resets EXP in place, so that it can be
1635 expanded again. */
1636
1637extern tree unsave_expr_now PROTO((tree));
1638
1639/* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1640 or offset that depends on a field within a record.
1641
1642 Note that we only allow such expressions within simple arithmetic
1643 or a COND_EXPR. */
1644
1645extern int contains_placeholder_p PROTO((tree));
1646
1647/* Return 1 if EXP contains any expressions that produce cleanups for an
1648 outer scope to deal with. Used by fold. */
1649
1650extern int has_cleanups PROTO((tree));
1651
1652/* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1653 return a tree with all occurrences of references to F in a
1654 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1655 contains only arithmetic expressions. */
1656
1657extern tree substitute_in_expr PROTO((tree, tree, tree));
1658
1659/* variable_size (EXP) is like save_expr (EXP) except that it
1660 is for the special case of something that is part of a
1661 variable size for a data type. It makes special arrangements
1662 to compute the value at the right time when the data type
1663 belongs to a function parameter. */
1664
1665extern tree variable_size PROTO((tree));
1666
1667/* stabilize_reference (EXP) returns an reference equivalent to EXP
1668 but it can be used multiple times
1669 and only evaluate the subexpressions once. */
1670
1671extern tree stabilize_reference PROTO((tree));
1672
1673/* Subroutine of stabilize_reference; this is called for subtrees of
1674 references. Any expression with side-effects must be put in a SAVE_EXPR
1675 to ensure that it is only evaluated once. */
1676
1677extern tree stabilize_reference_1 PROTO((tree));
1678
1679/* Return EXP, stripped of any conversions to wider types
1680 in such a way that the result of converting to type FOR_TYPE
1681 is the same as if EXP were converted to FOR_TYPE.
1682 If FOR_TYPE is 0, it signifies EXP's type. */
1683
1684extern tree get_unwidened PROTO((tree, tree));
1685
1686/* Return OP or a simpler expression for a narrower value
1687 which can be sign-extended or zero-extended to give back OP.
1688 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1689 or 0 if the value should be sign-extended. */
1690
1691extern tree get_narrower PROTO((tree, int *));
1692
1693/* Given MODE and UNSIGNEDP, return a suitable type-tree
1694 with that mode.
1695 The definition of this resides in language-specific code
1696 as the repertoire of available types may vary. */
1697
1698extern tree type_for_mode PROTO((enum machine_mode, int));
1699
1700/* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1701 for an integer type with at least that precision.
1702 The definition of this resides in language-specific code
1703 as the repertoire of available types may vary. */
1704
1705extern tree type_for_size PROTO((unsigned, int));
1706
1707/* Given an integer type T, return a type like T but unsigned.
1708 If T is unsigned, the value is T.
1709 The definition of this resides in language-specific code
1710 as the repertoire of available types may vary. */
1711
1712extern tree unsigned_type PROTO((tree));
1713
1714/* Given an integer type T, return a type like T but signed.
1715 If T is signed, the value is T.
1716 The definition of this resides in language-specific code
1717 as the repertoire of available types may vary. */
1718
1719extern tree signed_type PROTO((tree));
1720
1721/* This function must be defined in the language-specific files.
1722 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1723 This is defined in a language-specific file. */
1724
1725extern tree maybe_build_cleanup PROTO((tree));
1726
1727/* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1728 look for nested component-refs or array-refs at constant positions
1729 and find the ultimate containing object, which is returned. */
1730
1731extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1732 enum machine_mode *, int *,
1733 int *, int *));
1734
1735/* Return the FUNCTION_DECL which provides this _DECL with its context,
1736 or zero if none. */
1737extern tree decl_function_context PROTO((tree));
1738
1739/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1740 this _DECL with its context, or zero if none. */
1741extern tree decl_type_context PROTO((tree));
1742
1743/* Given the FUNCTION_DECL for the current function,
1744 return zero if it is ok for this function to be inline.
1745 Otherwise return a warning message with a single %s
1746 for the function's name. */
1747
| 1688
1689/* save_expr (EXP) returns an expression equivalent to EXP
1690 but it can be used multiple times within context CTX
1691 and only evaluate EXP once. */
1692
1693extern tree save_expr PROTO((tree));
1694
1695/* Returns the index of the first non-tree operand for CODE, or the number
1696 of operands if all are trees. */
1697
1698extern int first_rtl_op PROTO((enum tree_code));
1699
1700/* unsave_expr (EXP) returns an expression equivalent to EXP but it
1701 can be used multiple times and will evaluate EXP, in its entirety
1702 each time. */
1703
1704extern tree unsave_expr PROTO((tree));
1705
1706/* unsave_expr_now (EXP) resets EXP in place, so that it can be
1707 expanded again. */
1708
1709extern tree unsave_expr_now PROTO((tree));
1710
1711/* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1712 or offset that depends on a field within a record.
1713
1714 Note that we only allow such expressions within simple arithmetic
1715 or a COND_EXPR. */
1716
1717extern int contains_placeholder_p PROTO((tree));
1718
1719/* Return 1 if EXP contains any expressions that produce cleanups for an
1720 outer scope to deal with. Used by fold. */
1721
1722extern int has_cleanups PROTO((tree));
1723
1724/* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1725 return a tree with all occurrences of references to F in a
1726 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1727 contains only arithmetic expressions. */
1728
1729extern tree substitute_in_expr PROTO((tree, tree, tree));
1730
1731/* variable_size (EXP) is like save_expr (EXP) except that it
1732 is for the special case of something that is part of a
1733 variable size for a data type. It makes special arrangements
1734 to compute the value at the right time when the data type
1735 belongs to a function parameter. */
1736
1737extern tree variable_size PROTO((tree));
1738
1739/* stabilize_reference (EXP) returns an reference equivalent to EXP
1740 but it can be used multiple times
1741 and only evaluate the subexpressions once. */
1742
1743extern tree stabilize_reference PROTO((tree));
1744
1745/* Subroutine of stabilize_reference; this is called for subtrees of
1746 references. Any expression with side-effects must be put in a SAVE_EXPR
1747 to ensure that it is only evaluated once. */
1748
1749extern tree stabilize_reference_1 PROTO((tree));
1750
1751/* Return EXP, stripped of any conversions to wider types
1752 in such a way that the result of converting to type FOR_TYPE
1753 is the same as if EXP were converted to FOR_TYPE.
1754 If FOR_TYPE is 0, it signifies EXP's type. */
1755
1756extern tree get_unwidened PROTO((tree, tree));
1757
1758/* Return OP or a simpler expression for a narrower value
1759 which can be sign-extended or zero-extended to give back OP.
1760 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
1761 or 0 if the value should be sign-extended. */
1762
1763extern tree get_narrower PROTO((tree, int *));
1764
1765/* Given MODE and UNSIGNEDP, return a suitable type-tree
1766 with that mode.
1767 The definition of this resides in language-specific code
1768 as the repertoire of available types may vary. */
1769
1770extern tree type_for_mode PROTO((enum machine_mode, int));
1771
1772/* Given PRECISION and UNSIGNEDP, return a suitable type-tree
1773 for an integer type with at least that precision.
1774 The definition of this resides in language-specific code
1775 as the repertoire of available types may vary. */
1776
1777extern tree type_for_size PROTO((unsigned, int));
1778
1779/* Given an integer type T, return a type like T but unsigned.
1780 If T is unsigned, the value is T.
1781 The definition of this resides in language-specific code
1782 as the repertoire of available types may vary. */
1783
1784extern tree unsigned_type PROTO((tree));
1785
1786/* Given an integer type T, return a type like T but signed.
1787 If T is signed, the value is T.
1788 The definition of this resides in language-specific code
1789 as the repertoire of available types may vary. */
1790
1791extern tree signed_type PROTO((tree));
1792
1793/* This function must be defined in the language-specific files.
1794 expand_expr calls it to build the cleanup-expression for a TARGET_EXPR.
1795 This is defined in a language-specific file. */
1796
1797extern tree maybe_build_cleanup PROTO((tree));
1798
1799/* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
1800 look for nested component-refs or array-refs at constant positions
1801 and find the ultimate containing object, which is returned. */
1802
1803extern tree get_inner_reference PROTO((tree, int *, int *, tree *,
1804 enum machine_mode *, int *,
1805 int *, int *));
1806
1807/* Return the FUNCTION_DECL which provides this _DECL with its context,
1808 or zero if none. */
1809extern tree decl_function_context PROTO((tree));
1810
1811/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
1812 this _DECL with its context, or zero if none. */
1813extern tree decl_type_context PROTO((tree));
1814
1815/* Given the FUNCTION_DECL for the current function,
1816 return zero if it is ok for this function to be inline.
1817 Otherwise return a warning message with a single %s
1818 for the function's name. */
1819
|
1748extern char *function_cannot_inline_p PROTO((tree));
| 1820extern const char *function_cannot_inline_p PROTO((tree));
|
1749
1750/* Return 1 if EXPR is the real constant zero. */
1751extern int real_zerop PROTO((tree));
1752
1753/* Declare commonly used variables for tree structure. */
1754
1755/* An integer constant with value 0 */
1756extern tree integer_zero_node;
1757
1758/* An integer constant with value 1 */
1759extern tree integer_one_node;
1760
1761/* An integer constant with value 0 whose type is sizetype. */
1762extern tree size_zero_node;
1763
1764/* An integer constant with value 1 whose type is sizetype. */
1765extern tree size_one_node;
1766
1767/* A constant of type pointer-to-int and value 0 */
1768extern tree null_pointer_node;
1769
1770/* A node of type ERROR_MARK. */
1771extern tree error_mark_node;
1772
1773/* The type node for the void type. */
1774extern tree void_type_node;
1775
1776/* The type node for the ordinary (signed) integer type. */
1777extern tree integer_type_node;
1778
1779/* The type node for the unsigned integer type. */
1780extern tree unsigned_type_node;
1781
1782/* The type node for the ordinary character type. */
1783extern tree char_type_node;
1784
1785/* Points to the name of the input file from which the current input
1786 being parsed originally came (before it went into cpp). */
1787extern char *input_filename;
1788
1789/* Current line number in input file. */
1790extern int lineno;
1791
1792/* Nonzero for -pedantic switch: warn about anything
1793 that standard C forbids. */
1794extern int pedantic;
1795
1796/* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1797 Zero means allow extended lvalues. */
1798
1799extern int pedantic_lvalues;
1800
1801/* Nonzero means can safely call expand_expr now;
1802 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1803
1804extern int immediate_size_expand;
1805
1806/* Points to the FUNCTION_DECL of the function whose body we are reading. */
1807
1808extern tree current_function_decl;
1809
1810/* Nonzero if function being compiled can call setjmp. */
1811
1812extern int current_function_calls_setjmp;
1813
1814/* Nonzero if function being compiled can call longjmp. */
1815
1816extern int current_function_calls_longjmp;
1817
1818/* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1819
1820extern int all_types_permanent;
1821
1822/* Pointer to function to compute the name to use to print a declaration.
1823 DECL is the declaration in question.
1824 VERBOSITY determines what information will be printed:
1825 0: DECL_NAME, demangled as necessary.
1826 1: and scope information.
1827 2: and any other information that might be interesting, such as function
1828 parameter types in C++. */
1829
1830extern char *(*decl_printable_name) PROTO((tree, int));
1831
1832/* Pointer to function to finish handling an incomplete decl at the
1833 end of compilation. */
1834
1835extern void (*incomplete_decl_finalize_hook) PROTO((tree));
1836
1837/* In tree.c */
1838extern char *perm_calloc PROTO((int, long));
1839extern tree get_file_function_name PROTO((int));
| 1821
1822/* Return 1 if EXPR is the real constant zero. */
1823extern int real_zerop PROTO((tree));
1824
1825/* Declare commonly used variables for tree structure. */
1826
1827/* An integer constant with value 0 */
1828extern tree integer_zero_node;
1829
1830/* An integer constant with value 1 */
1831extern tree integer_one_node;
1832
1833/* An integer constant with value 0 whose type is sizetype. */
1834extern tree size_zero_node;
1835
1836/* An integer constant with value 1 whose type is sizetype. */
1837extern tree size_one_node;
1838
1839/* A constant of type pointer-to-int and value 0 */
1840extern tree null_pointer_node;
1841
1842/* A node of type ERROR_MARK. */
1843extern tree error_mark_node;
1844
1845/* The type node for the void type. */
1846extern tree void_type_node;
1847
1848/* The type node for the ordinary (signed) integer type. */
1849extern tree integer_type_node;
1850
1851/* The type node for the unsigned integer type. */
1852extern tree unsigned_type_node;
1853
1854/* The type node for the ordinary character type. */
1855extern tree char_type_node;
1856
1857/* Points to the name of the input file from which the current input
1858 being parsed originally came (before it went into cpp). */
1859extern char *input_filename;
1860
1861/* Current line number in input file. */
1862extern int lineno;
1863
1864/* Nonzero for -pedantic switch: warn about anything
1865 that standard C forbids. */
1866extern int pedantic;
1867
1868/* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1869 Zero means allow extended lvalues. */
1870
1871extern int pedantic_lvalues;
1872
1873/* Nonzero means can safely call expand_expr now;
1874 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */
1875
1876extern int immediate_size_expand;
1877
1878/* Points to the FUNCTION_DECL of the function whose body we are reading. */
1879
1880extern tree current_function_decl;
1881
1882/* Nonzero if function being compiled can call setjmp. */
1883
1884extern int current_function_calls_setjmp;
1885
1886/* Nonzero if function being compiled can call longjmp. */
1887
1888extern int current_function_calls_longjmp;
1889
1890/* Nonzero means all ..._TYPE nodes should be allocated permanently. */
1891
1892extern int all_types_permanent;
1893
1894/* Pointer to function to compute the name to use to print a declaration.
1895 DECL is the declaration in question.
1896 VERBOSITY determines what information will be printed:
1897 0: DECL_NAME, demangled as necessary.
1898 1: and scope information.
1899 2: and any other information that might be interesting, such as function
1900 parameter types in C++. */
1901
1902extern char *(*decl_printable_name) PROTO((tree, int));
1903
1904/* Pointer to function to finish handling an incomplete decl at the
1905 end of compilation. */
1906
1907extern void (*incomplete_decl_finalize_hook) PROTO((tree));
1908
1909/* In tree.c */
1910extern char *perm_calloc PROTO((int, long));
1911extern tree get_file_function_name PROTO((int));
|
| 1912extern tree get_file_function_name_long PROTO((const char *));
|
1840extern tree get_set_constructor_bits PROTO((tree, char *, int));
1841extern tree get_set_constructor_bytes PROTO((tree,
1842 unsigned char *, int));
1843extern int get_alias_set PROTO((tree));
| 1913extern tree get_set_constructor_bits PROTO((tree, char *, int));
1914extern tree get_set_constructor_bytes PROTO((tree,
1915 unsigned char *, int));
1916extern int get_alias_set PROTO((tree));
|
| 1917extern int new_alias_set PROTO((void));
|
1844extern int (*lang_get_alias_set) PROTO((tree));
1845
1846/* In stmt.c */
1847
1848extern void expand_fixups PROTO((struct rtx_def *));
1849extern tree expand_start_stmt_expr PROTO((void));
1850extern tree expand_end_stmt_expr PROTO((tree));
1851extern void expand_expr_stmt PROTO((tree));
1852extern int warn_if_unused_value PROTO((tree));
1853extern void expand_decl_init PROTO((tree));
1854extern void clear_last_expr PROTO((void));
1855extern void expand_label PROTO((tree));
1856extern void expand_goto PROTO((tree));
1857extern void expand_asm PROTO((tree));
1858extern void expand_start_cond PROTO((tree, int));
1859extern void expand_end_cond PROTO((void));
1860extern void expand_start_else PROTO((void));
1861extern void expand_start_elseif PROTO((tree));
1862extern struct nesting *expand_start_loop PROTO((int));
1863extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1864extern void expand_loop_continue_here PROTO((void));
1865extern void expand_end_loop PROTO((void));
1866extern int expand_continue_loop PROTO((struct nesting *));
1867extern int expand_exit_loop PROTO((struct nesting *));
1868extern int expand_exit_loop_if_false PROTO((struct nesting *,
1869 tree));
1870extern int expand_exit_something PROTO((void));
1871
1872extern void expand_null_return PROTO((void));
1873extern void expand_return PROTO((tree));
| 1918extern int (*lang_get_alias_set) PROTO((tree));
1919
1920/* In stmt.c */
1921
1922extern void expand_fixups PROTO((struct rtx_def *));
1923extern tree expand_start_stmt_expr PROTO((void));
1924extern tree expand_end_stmt_expr PROTO((tree));
1925extern void expand_expr_stmt PROTO((tree));
1926extern int warn_if_unused_value PROTO((tree));
1927extern void expand_decl_init PROTO((tree));
1928extern void clear_last_expr PROTO((void));
1929extern void expand_label PROTO((tree));
1930extern void expand_goto PROTO((tree));
1931extern void expand_asm PROTO((tree));
1932extern void expand_start_cond PROTO((tree, int));
1933extern void expand_end_cond PROTO((void));
1934extern void expand_start_else PROTO((void));
1935extern void expand_start_elseif PROTO((tree));
1936extern struct nesting *expand_start_loop PROTO((int));
1937extern struct nesting *expand_start_loop_continue_elsewhere PROTO((int));
1938extern void expand_loop_continue_here PROTO((void));
1939extern void expand_end_loop PROTO((void));
1940extern int expand_continue_loop PROTO((struct nesting *));
1941extern int expand_exit_loop PROTO((struct nesting *));
1942extern int expand_exit_loop_if_false PROTO((struct nesting *,
1943 tree));
1944extern int expand_exit_something PROTO((void));
1945
1946extern void expand_null_return PROTO((void));
1947extern void expand_return PROTO((tree));
|
| 1948extern int optimize_tail_recursion PROTO((tree, struct rtx_def *));
|
1874extern void expand_start_bindings PROTO((int));
1875extern void expand_end_bindings PROTO((tree, int, int));
1876extern void start_cleanup_deferral PROTO((void));
1877extern void end_cleanup_deferral PROTO((void));
1878extern void mark_block_as_eh_region PROTO((void));
1879extern void mark_block_as_not_eh_region PROTO((void));
1880extern int is_eh_region PROTO((void));
1881extern int conditional_context PROTO((void));
1882extern tree last_cleanup_this_contour PROTO((void));
1883extern int expand_dhc_cleanup PROTO((tree));
1884extern int expand_dcc_cleanup PROTO((tree));
1885extern void expand_start_case PROTO((int, tree, tree,
| 1949extern void expand_start_bindings PROTO((int));
1950extern void expand_end_bindings PROTO((tree, int, int));
1951extern void start_cleanup_deferral PROTO((void));
1952extern void end_cleanup_deferral PROTO((void));
1953extern void mark_block_as_eh_region PROTO((void));
1954extern void mark_block_as_not_eh_region PROTO((void));
1955extern int is_eh_region PROTO((void));
1956extern int conditional_context PROTO((void));
1957extern tree last_cleanup_this_contour PROTO((void));
1958extern int expand_dhc_cleanup PROTO((tree));
1959extern int expand_dcc_cleanup PROTO((tree));
1960extern void expand_start_case PROTO((int, tree, tree,
|
1886 char *));
| 1961 const char *));
|
1887extern void expand_end_case PROTO((tree));
1888extern int pushcase PROTO((tree,
1889 tree (*) (tree, tree),
1890 tree, tree *));
1891extern int pushcase_range PROTO((tree, tree,
1892 tree (*) (tree, tree),
1893 tree, tree *));
1894extern void using_eh_for_cleanups PROTO((void));
| 1962extern void expand_end_case PROTO((tree));
1963extern int pushcase PROTO((tree,
1964 tree (*) (tree, tree),
1965 tree, tree *));
1966extern int pushcase_range PROTO((tree, tree,
1967 tree (*) (tree, tree),
1968 tree, tree *));
1969extern void using_eh_for_cleanups PROTO((void));
|
| 1970extern int stmt_loop_nest_empty PROTO((void));
|
1895
1896/* In fold-const.c */
1897
1898/* Fold constants as much as possible in an expression.
1899 Returns the simplified expression.
1900 Acts only on the top level of the expression;
1901 if the argument itself cannot be simplified, its
1902 subexpressions are not changed. */
1903
1904extern tree fold PROTO((tree));
1905
1906extern int force_fit_type PROTO((tree, int));
1907extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1908 HOST_WIDE_INT, HOST_WIDE_INT,
1909 HOST_WIDE_INT *, HOST_WIDE_INT *));
1910extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1911 HOST_WIDE_INT *, HOST_WIDE_INT *));
1912extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1913 HOST_WIDE_INT, HOST_WIDE_INT,
1914 HOST_WIDE_INT *, HOST_WIDE_INT *));
1915extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1916 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1917 HOST_WIDE_INT *, int));
1918extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1919 HOST_WIDE_INT, int,
1920 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1921extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1922 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1923 HOST_WIDE_INT *));
1924extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1925 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1926 HOST_WIDE_INT *));
1927extern int operand_equal_p PROTO((tree, tree, int));
1928extern tree invert_truthvalue PROTO((tree));
1929
1930/* Interface of the DWARF2 unwind info support. */
1931
1932/* Decide whether we want to emit frame unwind information for the current
1933 translation unit. */
1934
1935extern int dwarf2out_do_frame PROTO((void));
1936
1937/* Generate a new label for the CFI info to refer to. */
1938
1939extern char *dwarf2out_cfi_label PROTO((void));
1940
1941/* Entry point to update the canonical frame address (CFA). */
1942
1943extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
1944
1945/* Add the CFI for saving a register window. */
1946
1947extern void dwarf2out_window_save PROTO((char *));
1948
1949/* Add a CFI to update the running total of the size of arguments pushed
1950 onto the stack. */
1951
1952extern void dwarf2out_args_size PROTO((char *, long));
1953
1954/* Entry point for saving a register to the stack. */
1955
1956extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
1957
1958/* Entry point for saving the return address in the stack. */
1959
1960extern void dwarf2out_return_save PROTO((char *, long));
1961
1962/* Entry point for saving the return address in a register. */
1963
1964extern void dwarf2out_return_reg PROTO((char *, unsigned));
1965
1966/* Output a marker (i.e. a label) for the beginning of a function, before
1967 the prologue. */
1968
1969extern void dwarf2out_begin_prologue PROTO((void));
1970
1971/* Output a marker (i.e. a label) for the absolute end of the generated
1972 code for a function definition. */
1973
1974extern void dwarf2out_end_epilogue PROTO((void));
1975
1976/* The language front-end must define these functions. */
1977
1978/* Function of no arguments for initializing options. */
1979extern void lang_init_options PROTO((void));
1980
1981/* Function of no arguments for initializing lexical scanning. */
1982extern void init_lex PROTO((void));
1983/* Function of no arguments for initializing the symbol table. */
1984extern void init_decl_processing PROTO((void));
1985
1986/* Functions called with no arguments at the beginning and end or processing
1987 the input source file. */
1988extern void lang_init PROTO((void));
1989extern void lang_finish PROTO((void));
1990
1991/* Function to identify which front-end produced the output file. */
1992extern char *lang_identify PROTO((void));
1993
1994/* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
1995extern void copy_lang_decl PROTO((tree));
1996
1997/* Function called with no arguments to parse and compile the input. */
1998extern int yyparse PROTO((void));
1999/* Function called with option as argument
2000 to decode options starting with -f or -W or +.
2001 It should return nonzero if it handles the option. */
2002extern int lang_decode_option PROTO((int, char **));
2003
2004/* Functions for processing symbol declarations. */
2005/* Function to enter a new lexical scope.
2006 Takes one argument: always zero when called from outside the front end. */
2007extern void pushlevel PROTO((int));
2008/* Function to exit a lexical scope. It returns a BINDING for that scope.
2009 Takes three arguments:
2010 KEEP -- nonzero if there were declarations in this scope.
2011 REVERSE -- reverse the order of decls before returning them.
2012 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2013extern tree poplevel PROTO((int, int, int));
2014/* Set the BLOCK node for the current scope level. */
2015extern void set_block PROTO((tree));
2016/* Function to add a decl to the current scope level.
2017 Takes one argument, a decl to add.
2018 Returns that decl, or, if the same symbol is already declared, may
2019 return a different decl for that name. */
2020extern tree pushdecl PROTO((tree));
2021/* Function to return the chain of decls so far in the current scope level. */
2022extern tree getdecls PROTO((void));
2023/* Function to return the chain of structure tags in the current scope level. */
2024extern tree gettags PROTO((void));
2025
2026extern tree build_range_type PROTO((tree, tree, tree));
2027
2028/* Call when starting to parse a declaration:
2029 make expressions in the declaration last the length of the function.
2030 Returns an argument that should be passed to resume_momentary later. */
2031extern int suspend_momentary PROTO((void));
2032
2033extern int allocation_temporary_p PROTO((void));
2034
2035/* Call when finished parsing a declaration:
2036 restore the treatment of node-allocation that was
2037 in effect before the suspension.
2038 YES should be the value previously returned by suspend_momentary. */
2039extern void resume_momentary PROTO((int));
2040
2041/* Called after finishing a record, union or enumeral type. */
2042extern void rest_of_type_compilation PROTO((tree, int));
2043
2044/* Save the current set of obstacks, but don't change them. */
2045extern void push_obstacks_nochange PROTO((void));
2046
2047extern void permanent_allocation PROTO((int));
2048
2049extern void push_momentary PROTO((void));
2050
2051extern void clear_momentary PROTO((void));
2052
2053extern void pop_momentary PROTO((void));
2054
2055extern void end_temporary_allocation PROTO((void));
2056
2057/* Pop the obstack selection stack. */
2058extern void pop_obstacks PROTO((void));
2059
2060/* In tree.c */
2061extern int really_constant_p PROTO ((tree));
2062extern void push_obstacks PROTO ((struct obstack *,
2063 struct obstack *));
2064extern void pop_momentary_nofree PROTO ((void));
2065extern void preserve_momentary PROTO ((void));
2066extern void saveable_allocation PROTO ((void));
2067extern void temporary_allocation PROTO ((void));
2068extern void resume_temporary_allocation PROTO ((void));
2069extern tree get_file_function_name PROTO ((int));
2070extern void set_identifier_size PROTO ((int));
2071extern int int_fits_type_p PROTO ((tree, tree));
2072extern int tree_log2 PROTO ((tree));
2073extern void preserve_initializer PROTO ((void));
2074extern void preserve_data PROTO ((void));
2075extern int object_permanent_p PROTO ((tree));
2076extern int type_precision PROTO ((tree));
2077extern int simple_cst_equal PROTO ((tree, tree));
2078extern int type_list_equal PROTO ((tree, tree));
2079extern int chain_member PROTO ((tree, tree));
2080extern int chain_member_purpose PROTO ((tree, tree));
2081extern int chain_member_value PROTO ((tree, tree));
2082extern tree listify PROTO ((tree));
2083extern tree type_hash_lookup PROTO ((int, tree));
2084extern void type_hash_add PROTO ((int, tree));
2085extern int type_hash_list PROTO ((tree));
2086extern int simple_cst_list_equal PROTO ((tree, tree));
2087extern void debug_obstack PROTO ((char *));
2088extern void rtl_in_current_obstack PROTO ((void));
2089extern void rtl_in_saveable_obstack PROTO ((void));
2090extern void init_tree_codes PROTO ((void));
2091extern void dump_tree_statistics PROTO ((void));
| 1971
1972/* In fold-const.c */
1973
1974/* Fold constants as much as possible in an expression.
1975 Returns the simplified expression.
1976 Acts only on the top level of the expression;
1977 if the argument itself cannot be simplified, its
1978 subexpressions are not changed. */
1979
1980extern tree fold PROTO((tree));
1981
1982extern int force_fit_type PROTO((tree, int));
1983extern int add_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1984 HOST_WIDE_INT, HOST_WIDE_INT,
1985 HOST_WIDE_INT *, HOST_WIDE_INT *));
1986extern int neg_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1987 HOST_WIDE_INT *, HOST_WIDE_INT *));
1988extern int mul_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1989 HOST_WIDE_INT, HOST_WIDE_INT,
1990 HOST_WIDE_INT *, HOST_WIDE_INT *));
1991extern void lshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1992 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1993 HOST_WIDE_INT *, int));
1994extern void rshift_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1995 HOST_WIDE_INT, int,
1996 HOST_WIDE_INT *, HOST_WIDE_INT *, int));
1997extern void lrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
1998 HOST_WIDE_INT, int, HOST_WIDE_INT *,
1999 HOST_WIDE_INT *));
2000extern void rrotate_double PROTO((HOST_WIDE_INT, HOST_WIDE_INT,
2001 HOST_WIDE_INT, int, HOST_WIDE_INT *,
2002 HOST_WIDE_INT *));
2003extern int operand_equal_p PROTO((tree, tree, int));
2004extern tree invert_truthvalue PROTO((tree));
2005
2006/* Interface of the DWARF2 unwind info support. */
2007
2008/* Decide whether we want to emit frame unwind information for the current
2009 translation unit. */
2010
2011extern int dwarf2out_do_frame PROTO((void));
2012
2013/* Generate a new label for the CFI info to refer to. */
2014
2015extern char *dwarf2out_cfi_label PROTO((void));
2016
2017/* Entry point to update the canonical frame address (CFA). */
2018
2019extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2020
2021/* Add the CFI for saving a register window. */
2022
2023extern void dwarf2out_window_save PROTO((char *));
2024
2025/* Add a CFI to update the running total of the size of arguments pushed
2026 onto the stack. */
2027
2028extern void dwarf2out_args_size PROTO((char *, long));
2029
2030/* Entry point for saving a register to the stack. */
2031
2032extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2033
2034/* Entry point for saving the return address in the stack. */
2035
2036extern void dwarf2out_return_save PROTO((char *, long));
2037
2038/* Entry point for saving the return address in a register. */
2039
2040extern void dwarf2out_return_reg PROTO((char *, unsigned));
2041
2042/* Output a marker (i.e. a label) for the beginning of a function, before
2043 the prologue. */
2044
2045extern void dwarf2out_begin_prologue PROTO((void));
2046
2047/* Output a marker (i.e. a label) for the absolute end of the generated
2048 code for a function definition. */
2049
2050extern void dwarf2out_end_epilogue PROTO((void));
2051
2052/* The language front-end must define these functions. */
2053
2054/* Function of no arguments for initializing options. */
2055extern void lang_init_options PROTO((void));
2056
2057/* Function of no arguments for initializing lexical scanning. */
2058extern void init_lex PROTO((void));
2059/* Function of no arguments for initializing the symbol table. */
2060extern void init_decl_processing PROTO((void));
2061
2062/* Functions called with no arguments at the beginning and end or processing
2063 the input source file. */
2064extern void lang_init PROTO((void));
2065extern void lang_finish PROTO((void));
2066
2067/* Function to identify which front-end produced the output file. */
2068extern char *lang_identify PROTO((void));
2069
2070/* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */
2071extern void copy_lang_decl PROTO((tree));
2072
2073/* Function called with no arguments to parse and compile the input. */
2074extern int yyparse PROTO((void));
2075/* Function called with option as argument
2076 to decode options starting with -f or -W or +.
2077 It should return nonzero if it handles the option. */
2078extern int lang_decode_option PROTO((int, char **));
2079
2080/* Functions for processing symbol declarations. */
2081/* Function to enter a new lexical scope.
2082 Takes one argument: always zero when called from outside the front end. */
2083extern void pushlevel PROTO((int));
2084/* Function to exit a lexical scope. It returns a BINDING for that scope.
2085 Takes three arguments:
2086 KEEP -- nonzero if there were declarations in this scope.
2087 REVERSE -- reverse the order of decls before returning them.
2088 FUNCTIONBODY -- nonzero if this level is the body of a function. */
2089extern tree poplevel PROTO((int, int, int));
2090/* Set the BLOCK node for the current scope level. */
2091extern void set_block PROTO((tree));
2092/* Function to add a decl to the current scope level.
2093 Takes one argument, a decl to add.
2094 Returns that decl, or, if the same symbol is already declared, may
2095 return a different decl for that name. */
2096extern tree pushdecl PROTO((tree));
2097/* Function to return the chain of decls so far in the current scope level. */
2098extern tree getdecls PROTO((void));
2099/* Function to return the chain of structure tags in the current scope level. */
2100extern tree gettags PROTO((void));
2101
2102extern tree build_range_type PROTO((tree, tree, tree));
2103
2104/* Call when starting to parse a declaration:
2105 make expressions in the declaration last the length of the function.
2106 Returns an argument that should be passed to resume_momentary later. */
2107extern int suspend_momentary PROTO((void));
2108
2109extern int allocation_temporary_p PROTO((void));
2110
2111/* Call when finished parsing a declaration:
2112 restore the treatment of node-allocation that was
2113 in effect before the suspension.
2114 YES should be the value previously returned by suspend_momentary. */
2115extern void resume_momentary PROTO((int));
2116
2117/* Called after finishing a record, union or enumeral type. */
2118extern void rest_of_type_compilation PROTO((tree, int));
2119
2120/* Save the current set of obstacks, but don't change them. */
2121extern void push_obstacks_nochange PROTO((void));
2122
2123extern void permanent_allocation PROTO((int));
2124
2125extern void push_momentary PROTO((void));
2126
2127extern void clear_momentary PROTO((void));
2128
2129extern void pop_momentary PROTO((void));
2130
2131extern void end_temporary_allocation PROTO((void));
2132
2133/* Pop the obstack selection stack. */
2134extern void pop_obstacks PROTO((void));
2135
2136/* In tree.c */
2137extern int really_constant_p PROTO ((tree));
2138extern void push_obstacks PROTO ((struct obstack *,
2139 struct obstack *));
2140extern void pop_momentary_nofree PROTO ((void));
2141extern void preserve_momentary PROTO ((void));
2142extern void saveable_allocation PROTO ((void));
2143extern void temporary_allocation PROTO ((void));
2144extern void resume_temporary_allocation PROTO ((void));
2145extern tree get_file_function_name PROTO ((int));
2146extern void set_identifier_size PROTO ((int));
2147extern int int_fits_type_p PROTO ((tree, tree));
2148extern int tree_log2 PROTO ((tree));
2149extern void preserve_initializer PROTO ((void));
2150extern void preserve_data PROTO ((void));
2151extern int object_permanent_p PROTO ((tree));
2152extern int type_precision PROTO ((tree));
2153extern int simple_cst_equal PROTO ((tree, tree));
2154extern int type_list_equal PROTO ((tree, tree));
2155extern int chain_member PROTO ((tree, tree));
2156extern int chain_member_purpose PROTO ((tree, tree));
2157extern int chain_member_value PROTO ((tree, tree));
2158extern tree listify PROTO ((tree));
2159extern tree type_hash_lookup PROTO ((int, tree));
2160extern void type_hash_add PROTO ((int, tree));
2161extern int type_hash_list PROTO ((tree));
2162extern int simple_cst_list_equal PROTO ((tree, tree));
2163extern void debug_obstack PROTO ((char *));
2164extern void rtl_in_current_obstack PROTO ((void));
2165extern void rtl_in_saveable_obstack PROTO ((void));
2166extern void init_tree_codes PROTO ((void));
2167extern void dump_tree_statistics PROTO ((void));
|
2092extern void print_obstack_statistics PROTO ((char *, struct obstack *));
| 2168extern void print_obstack_statistics PROTO ((const char *,
2169 struct obstack *));
|
2093#ifdef BUFSIZ
| 2170#ifdef BUFSIZ
|
2094extern void print_obstack_name PROTO ((char *, FILE *, char *));
| 2171extern void print_obstack_name PROTO ((char *, FILE *, const char *));
|
2095#endif
2096extern void expand_function_end PROTO ((char *, int, int));
2097extern void expand_function_start PROTO ((tree, int));
2098extern int real_onep PROTO ((tree));
2099extern int real_twop PROTO ((tree));
2100extern void start_identifier_warnings PROTO ((void));
2101extern void gcc_obstack_init PROTO ((struct obstack *));
2102extern void init_obstacks PROTO ((void));
2103extern void obfree PROTO ((char *));
| 2172#endif
2173extern void expand_function_end PROTO ((char *, int, int));
2174extern void expand_function_start PROTO ((tree, int));
2175extern int real_onep PROTO ((tree));
2176extern int real_twop PROTO ((tree));
2177extern void start_identifier_warnings PROTO ((void));
2178extern void gcc_obstack_init PROTO ((struct obstack *));
2179extern void init_obstacks PROTO ((void));
2180extern void obfree PROTO ((char *));
|
2104extern tree tree_check PROTO ((tree, enum tree_code, char*, int, int));
2105extern tree tree_class_check PROTO ((tree, char, char*, int, int));
2106extern tree expr_check PROTO ((tree, int, char*, int, int));
| 2181extern tree tree_check PROTO ((tree, enum tree_code,
2182 const char *, int, int));
2183extern tree tree_class_check PROTO ((tree, char, const char *,
2184 int, int));
2185extern tree expr_check PROTO ((tree, int, const char *,
2186 int, int));
|
2107
2108/* In function.c */
2109extern void setjmp_protect_args PROTO ((void));
2110extern void setjmp_protect PROTO ((tree));
2111extern void expand_main_function PROTO ((void));
2112extern void mark_varargs PROTO ((void));
2113extern void init_function_start PROTO ((tree, char *, int));
2114extern void assign_parms PROTO ((tree, int));
2115extern void put_var_into_stack PROTO ((tree));
2116extern void uninitialized_vars_warning PROTO ((tree));
2117extern void setjmp_args_warning PROTO ((void));
2118extern void mark_all_temps_used PROTO ((void));
2119extern void init_temp_slots PROTO ((void));
2120extern void combine_temp_slots PROTO ((void));
2121extern void free_temp_slots PROTO ((void));
2122extern void pop_temp_slots PROTO ((void));
2123extern void push_temp_slots PROTO ((void));
2124extern void preserve_temp_slots PROTO ((struct rtx_def *));
2125extern int aggregate_value_p PROTO ((tree));
2126extern tree reorder_blocks PROTO ((tree *, tree,
2127 struct rtx_def *));
2128extern void free_temps_for_rtl_expr PROTO ((tree));
2129extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2130extern int max_parm_reg_num PROTO ((void));
2131extern void push_function_context PROTO ((void));
2132extern void pop_function_context PROTO ((void));
2133extern void push_function_context_to PROTO ((tree));
2134extern void pop_function_context_from PROTO ((tree));
2135
2136/* In print-rtl.c */
2137#ifdef BUFSIZ
2138extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2139#endif
2140
2141/* In print-tree.c */
2142extern void debug_tree PROTO ((tree));
2143#ifdef BUFSIZ
| 2187
2188/* In function.c */
2189extern void setjmp_protect_args PROTO ((void));
2190extern void setjmp_protect PROTO ((tree));
2191extern void expand_main_function PROTO ((void));
2192extern void mark_varargs PROTO ((void));
2193extern void init_function_start PROTO ((tree, char *, int));
2194extern void assign_parms PROTO ((tree, int));
2195extern void put_var_into_stack PROTO ((tree));
2196extern void uninitialized_vars_warning PROTO ((tree));
2197extern void setjmp_args_warning PROTO ((void));
2198extern void mark_all_temps_used PROTO ((void));
2199extern void init_temp_slots PROTO ((void));
2200extern void combine_temp_slots PROTO ((void));
2201extern void free_temp_slots PROTO ((void));
2202extern void pop_temp_slots PROTO ((void));
2203extern void push_temp_slots PROTO ((void));
2204extern void preserve_temp_slots PROTO ((struct rtx_def *));
2205extern int aggregate_value_p PROTO ((tree));
2206extern tree reorder_blocks PROTO ((tree *, tree,
2207 struct rtx_def *));
2208extern void free_temps_for_rtl_expr PROTO ((tree));
2209extern void instantiate_virtual_regs PROTO ((tree, struct rtx_def *));
2210extern int max_parm_reg_num PROTO ((void));
2211extern void push_function_context PROTO ((void));
2212extern void pop_function_context PROTO ((void));
2213extern void push_function_context_to PROTO ((tree));
2214extern void pop_function_context_from PROTO ((tree));
2215
2216/* In print-rtl.c */
2217#ifdef BUFSIZ
2218extern void print_rtl PROTO ((FILE *, struct rtx_def *));
2219#endif
2220
2221/* In print-tree.c */
2222extern void debug_tree PROTO ((tree));
2223#ifdef BUFSIZ
|
2144extern void print_node PROTO ((FILE *, char *, tree, int));
2145extern void print_node_brief PROTO ((FILE *, char *, tree, int));
| 2224extern void print_node PROTO ((FILE *, const char *, tree, int));
2225extern void print_node_brief PROTO ((FILE *, const char *, tree, int));
|
2146extern void indent_to PROTO ((FILE *, int));
2147#endif
2148
2149/* In expr.c */
2150extern void emit_queue PROTO ((void));
2151extern int apply_args_register_offset PROTO ((int));
2152extern struct rtx_def *expand_builtin_return_addr
2153 PROTO ((enum built_in_function, int, struct rtx_def *));
2154extern void do_pending_stack_adjust PROTO ((void));
2155extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2156extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2157 int));
2158extern void check_max_integer_computation_mode PROTO ((tree));
2159
2160/* In emit-rtl.c */
2161extern void start_sequence_for_rtl_expr PROTO ((tree));
2162extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2163 struct rtx_def *));
2164extern struct rtx_def *emit_line_note PROTO ((char *, int));
2165extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2166
2167/* In c-typeck.c */
2168extern int mark_addressable PROTO ((tree));
2169extern void incomplete_type_error PROTO ((tree, tree));
2170
2171/* In c-lang.c */
2172extern void print_lang_statistics PROTO ((void));
2173
2174/* In c-common.c */
2175extern tree truthvalue_conversion PROTO ((tree));
2176extern int min_precision PROTO ((tree, int));
2177extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2178
2179/* In c-decl.c */
2180#ifdef BUFSIZ
2181extern void print_lang_decl PROTO ((FILE *, tree, int));
2182extern void print_lang_type PROTO ((FILE *, tree, int));
2183extern void print_lang_identifier PROTO ((FILE *, tree, int));
2184#endif
2185extern int global_bindings_p PROTO ((void));
2186extern void insert_block PROTO ((tree));
2187
2188/* In integrate.c */
2189extern void save_for_inline_nocopy PROTO ((tree));
2190extern void save_for_inline_copying PROTO ((tree));
2191extern void set_decl_abstract_flags PROTO ((tree, int));
2192extern void output_inline_function PROTO ((tree));
2193
2194/* In c-lex.c */
2195extern void set_yydebug PROTO ((int));
2196
2197/* In stor-layout.c */
2198extern void fixup_signed_type PROTO ((tree));
2199
2200/* varasm.c */
| 2226extern void indent_to PROTO ((FILE *, int));
2227#endif
2228
2229/* In expr.c */
2230extern void emit_queue PROTO ((void));
2231extern int apply_args_register_offset PROTO ((int));
2232extern struct rtx_def *expand_builtin_return_addr
2233 PROTO ((enum built_in_function, int, struct rtx_def *));
2234extern void do_pending_stack_adjust PROTO ((void));
2235extern struct rtx_def *expand_assignment PROTO ((tree, tree, int, int));
2236extern struct rtx_def *store_expr PROTO ((tree, struct rtx_def *,
2237 int));
2238extern void check_max_integer_computation_mode PROTO ((tree));
2239
2240/* In emit-rtl.c */
2241extern void start_sequence_for_rtl_expr PROTO ((tree));
2242extern struct rtx_def *emit_line_note_after PROTO ((char *, int,
2243 struct rtx_def *));
2244extern struct rtx_def *emit_line_note PROTO ((char *, int));
2245extern struct rtx_def *emit_line_note_force PROTO ((char *, int));
2246
2247/* In c-typeck.c */
2248extern int mark_addressable PROTO ((tree));
2249extern void incomplete_type_error PROTO ((tree, tree));
2250
2251/* In c-lang.c */
2252extern void print_lang_statistics PROTO ((void));
2253
2254/* In c-common.c */
2255extern tree truthvalue_conversion PROTO ((tree));
2256extern int min_precision PROTO ((tree, int));
2257extern void split_specs_attrs PROTO ((tree, tree *, tree *));
2258
2259/* In c-decl.c */
2260#ifdef BUFSIZ
2261extern void print_lang_decl PROTO ((FILE *, tree, int));
2262extern void print_lang_type PROTO ((FILE *, tree, int));
2263extern void print_lang_identifier PROTO ((FILE *, tree, int));
2264#endif
2265extern int global_bindings_p PROTO ((void));
2266extern void insert_block PROTO ((tree));
2267
2268/* In integrate.c */
2269extern void save_for_inline_nocopy PROTO ((tree));
2270extern void save_for_inline_copying PROTO ((tree));
2271extern void set_decl_abstract_flags PROTO ((tree, int));
2272extern void output_inline_function PROTO ((tree));
2273
2274/* In c-lex.c */
2275extern void set_yydebug PROTO ((int));
2276
2277/* In stor-layout.c */
2278extern void fixup_signed_type PROTO ((tree));
2279
2280/* varasm.c */
|
2201extern void make_decl_rtl PROTO ((tree, char *, int));
| 2281extern void make_decl_rtl PROTO ((tree, const char *, int));
|
2202extern void make_decl_one_only PROTO ((tree));
2203extern int supports_one_only PROTO ((void));
2204extern void variable_section PROTO ((tree, int));
2205
2206/* In fold-const.c */
2207extern int div_and_round_double PROTO ((enum tree_code, int,
2208 HOST_WIDE_INT, HOST_WIDE_INT,
2209 HOST_WIDE_INT, HOST_WIDE_INT,
2210 HOST_WIDE_INT *,
2211 HOST_WIDE_INT *,
2212 HOST_WIDE_INT *,
2213 HOST_WIDE_INT *));
2214
2215/* In stmt.c */
2216extern void emit_nop PROTO ((void));
2217extern void expand_computed_goto PROTO ((tree));
2218extern struct rtx_def *label_rtx PROTO ((tree));
2219extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2220 char *, int));
2221extern int any_pending_cleanups PROTO ((int));
2222extern void init_stmt PROTO ((void));
2223extern void init_stmt_for_function PROTO ((void));
2224extern void remember_end_note PROTO ((tree));
2225extern int drop_through_at_end_p PROTO ((void));
2226extern void expand_start_target_temps PROTO ((void));
2227extern void expand_end_target_temps PROTO ((void));
2228extern void expand_elseif PROTO ((tree));
2229extern void expand_decl PROTO ((tree));
2230extern int expand_decl_cleanup PROTO ((tree, tree));
2231extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2232extern void move_cleanups_up PROTO ((void));
2233extern void expand_start_case_dummy PROTO ((void));
2234extern void expand_end_case_dummy PROTO ((void));
2235extern tree case_index_expr_type PROTO ((void));
2236extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2237extern void check_for_full_enumeration_handling PROTO ((tree));
2238extern void declare_nonlocal_label PROTO ((tree));
2239#ifdef BUFSIZ
2240extern void lang_print_xnode PROTO ((FILE *, tree, int));
2241#endif
2242
2243
2244/* If KIND=='I', return a suitable global initializer (constructor) name.
2245 If KIND=='D', return a suitable global clean-up (destructor) name. */
2246extern tree get_file_function_name PROTO((int));
2247
2248/* Interface of the DWARF2 unwind info support. */
2249
2250/* Decide whether we want to emit frame unwind information for the current
2251 translation unit. */
2252
2253extern int dwarf2out_do_frame PROTO((void));
2254
2255/* Generate a new label for the CFI info to refer to. */
2256
2257extern char *dwarf2out_cfi_label PROTO((void));
2258
2259/* Entry point to update the canonical frame address (CFA). */
2260
2261extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2262
2263/* Add the CFI for saving a register window. */
2264
2265extern void dwarf2out_window_save PROTO((char *));
2266
2267/* Add a CFI to update the running total of the size of arguments pushed
2268 onto the stack. */
2269
2270extern void dwarf2out_args_size PROTO((char *, long));
2271
2272/* Entry point for saving a register to the stack. */
2273
2274extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2275
2276/* Entry point for saving the return address in the stack. */
2277
2278extern void dwarf2out_return_save PROTO((char *, long));
2279
2280/* Entry point for saving the return address in a register. */
2281
2282extern void dwarf2out_return_reg PROTO((char *, unsigned));
2283
2284/* Output a marker (i.e. a label) for the beginning of a function, before
2285 the prologue. */
2286
2287extern void dwarf2out_begin_prologue PROTO((void));
2288
2289/* Output a marker (i.e. a label) for the absolute end of the generated
2290 code for a function definition. */
2291
2292extern void dwarf2out_end_epilogue PROTO((void));
| 2282extern void make_decl_one_only PROTO ((tree));
2283extern int supports_one_only PROTO ((void));
2284extern void variable_section PROTO ((tree, int));
2285
2286/* In fold-const.c */
2287extern int div_and_round_double PROTO ((enum tree_code, int,
2288 HOST_WIDE_INT, HOST_WIDE_INT,
2289 HOST_WIDE_INT, HOST_WIDE_INT,
2290 HOST_WIDE_INT *,
2291 HOST_WIDE_INT *,
2292 HOST_WIDE_INT *,
2293 HOST_WIDE_INT *));
2294
2295/* In stmt.c */
2296extern void emit_nop PROTO ((void));
2297extern void expand_computed_goto PROTO ((tree));
2298extern struct rtx_def *label_rtx PROTO ((tree));
2299extern void expand_asm_operands PROTO ((tree, tree, tree, tree, int,
2300 char *, int));
2301extern int any_pending_cleanups PROTO ((int));
2302extern void init_stmt PROTO ((void));
2303extern void init_stmt_for_function PROTO ((void));
2304extern void remember_end_note PROTO ((tree));
2305extern int drop_through_at_end_p PROTO ((void));
2306extern void expand_start_target_temps PROTO ((void));
2307extern void expand_end_target_temps PROTO ((void));
2308extern void expand_elseif PROTO ((tree));
2309extern void expand_decl PROTO ((tree));
2310extern int expand_decl_cleanup PROTO ((tree, tree));
2311extern void expand_anon_union_decl PROTO ((tree, tree, tree));
2312extern void move_cleanups_up PROTO ((void));
2313extern void expand_start_case_dummy PROTO ((void));
2314extern void expand_end_case_dummy PROTO ((void));
2315extern tree case_index_expr_type PROTO ((void));
2316extern HOST_WIDE_INT all_cases_count PROTO ((tree, int *));
2317extern void check_for_full_enumeration_handling PROTO ((tree));
2318extern void declare_nonlocal_label PROTO ((tree));
2319#ifdef BUFSIZ
2320extern void lang_print_xnode PROTO ((FILE *, tree, int));
2321#endif
2322
2323
2324/* If KIND=='I', return a suitable global initializer (constructor) name.
2325 If KIND=='D', return a suitable global clean-up (destructor) name. */
2326extern tree get_file_function_name PROTO((int));
2327
2328/* Interface of the DWARF2 unwind info support. */
2329
2330/* Decide whether we want to emit frame unwind information for the current
2331 translation unit. */
2332
2333extern int dwarf2out_do_frame PROTO((void));
2334
2335/* Generate a new label for the CFI info to refer to. */
2336
2337extern char *dwarf2out_cfi_label PROTO((void));
2338
2339/* Entry point to update the canonical frame address (CFA). */
2340
2341extern void dwarf2out_def_cfa PROTO((char *, unsigned, long));
2342
2343/* Add the CFI for saving a register window. */
2344
2345extern void dwarf2out_window_save PROTO((char *));
2346
2347/* Add a CFI to update the running total of the size of arguments pushed
2348 onto the stack. */
2349
2350extern void dwarf2out_args_size PROTO((char *, long));
2351
2352/* Entry point for saving a register to the stack. */
2353
2354extern void dwarf2out_reg_save PROTO((char *, unsigned, long));
2355
2356/* Entry point for saving the return address in the stack. */
2357
2358extern void dwarf2out_return_save PROTO((char *, long));
2359
2360/* Entry point for saving the return address in a register. */
2361
2362extern void dwarf2out_return_reg PROTO((char *, unsigned));
2363
2364/* Output a marker (i.e. a label) for the beginning of a function, before
2365 the prologue. */
2366
2367extern void dwarf2out_begin_prologue PROTO((void));
2368
2369/* Output a marker (i.e. a label) for the absolute end of the generated
2370 code for a function definition. */
2371
2372extern void dwarf2out_end_epilogue PROTO((void));
|