]>
Commit | Line | Data |
---|---|---|
8da1b058 | 1 | /* Front-end tree definitions for GNU compiler. |
06ceef4e RK |
2 | Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000 |
3 | Free Software Foundation, Inc. | |
8da1b058 | 4 | |
1322177d | 5 | This file is part of GCC. |
8da1b058 | 6 | |
1322177d LB |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
8da1b058 | 11 | |
1322177d LB |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
8da1b058 RS |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d LB |
18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
8da1b058 RS |
21 | |
22 | #include "machmode.h" | |
9f8f4efe | 23 | #include "version.h" |
8da1b058 | 24 | |
d6b12657 | 25 | /* Codes of tree nodes */ |
8da1b058 RS |
26 | |
27 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
28 | ||
29 | enum tree_code { | |
30 | #include "tree.def" | |
31 | ||
6dc42e49 | 32 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
8da1b058 RS |
33 | NUM_TREE_CODE. */ |
34 | }; | |
35 | ||
36 | #undef DEFTREECODE | |
37 | ||
8d5e6e25 RK |
38 | /* Number of language-independent tree codes. */ |
39 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
8da1b058 RS |
40 | |
41 | /* Indexed by enum tree_code, contains a character which is | |
42 | `<' for a comparison expression, `1', for a unary arithmetic | |
43 | expression, `2' for a binary arithmetic expression, `e' for | |
44 | other types of expressions, `r' for a reference, `c' for a | |
45 | constant, `d' for a decl, `t' for a type, `s' for a statement, | |
46 | and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ | |
47 | ||
0a6969ad JC |
48 | #define MAX_TREE_CODES 256 |
49 | extern char tree_code_type[MAX_TREE_CODES]; | |
50 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] | |
8da1b058 | 51 | |
4da05956 MM |
52 | /* Returns non-zero iff CLASS is the tree-code class of an |
53 | expression. */ | |
54 | ||
55 | #define IS_EXPR_CODE_CLASS(CLASS) \ | |
8830da36 | 56 | (CLASS == '<' || CLASS == '1' || CLASS == '2' || CLASS == 'e') |
4da05956 | 57 | |
8da1b058 RS |
58 | /* Number of argument-words in each kind of tree-node. */ |
59 | ||
0a6969ad | 60 | extern int tree_code_length[MAX_TREE_CODES]; |
8d5e6e25 | 61 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
8da1b058 RS |
62 | |
63 | /* Names of tree components. */ | |
64 | ||
5f8ded66 | 65 | extern const char *tree_code_name[MAX_TREE_CODES]; |
8da1b058 | 66 | \f |
9df2c88c RK |
67 | /* Classify which part of the compiler has defined a given builtin function. |
68 | Note that we assume below that this is no more than two bits. */ | |
26db82d8 BS |
69 | enum built_in_class |
70 | { | |
71 | NOT_BUILT_IN = 0, | |
72 | BUILT_IN_FRONTEND, | |
73 | BUILT_IN_MD, | |
74 | BUILT_IN_NORMAL | |
75 | }; | |
9df2c88c RK |
76 | |
77 | /* Names for the above. */ | |
fd05eb80 | 78 | extern const char *const built_in_class_names[4]; |
9df2c88c | 79 | |
8da1b058 RS |
80 | /* Codes that identify the various built in functions |
81 | so that expand_call can identify them quickly. */ | |
82 | ||
10841285 | 83 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA) ENUM, |
8da1b058 RS |
84 | enum built_in_function |
85 | { | |
cb1072f4 | 86 | #include "builtins.def" |
972ded9c RS |
87 | |
88 | /* Upper bound on non-language-specific builtins. */ | |
89 | END_BUILTINS | |
8da1b058 | 90 | }; |
cb1072f4 | 91 | #undef DEF_BUILTIN |
9df2c88c RK |
92 | |
93 | /* Names for the above. */ | |
fd05eb80 | 94 | extern const char *const built_in_names[(int) END_BUILTINS]; |
3ff5f682 KG |
95 | |
96 | /* An array of _DECL trees for the above. */ | |
2f78c311 | 97 | extern tree built_in_decls[(int) END_BUILTINS]; |
8da1b058 RS |
98 | \f |
99 | /* The definition of tree nodes fills the next several pages. */ | |
100 | ||
101 | /* A tree node can represent a data type, a variable, an expression | |
102 | or a statement. Each node has a TREE_CODE which says what kind of | |
103 | thing it represents. Some common codes are: | |
104 | INTEGER_TYPE -- represents a type of integers. | |
105 | ARRAY_TYPE -- represents a type of pointer. | |
106 | VAR_DECL -- represents a declared variable. | |
107 | INTEGER_CST -- represents a constant integer value. | |
108 | PLUS_EXPR -- represents a sum (an expression). | |
109 | ||
110 | As for the contents of a tree node: there are some fields | |
111 | that all nodes share. Each TREE_CODE has various special-purpose | |
112 | fields as well. The fields of a node are never accessed directly, | |
113 | always through accessor macros. */ | |
114 | ||
8da1b058 RS |
115 | /* Every kind of tree node starts with this structure, |
116 | so all nodes have these fields. | |
117 | ||
76c9d226 MM |
118 | See the accessor macros, defined below, for documentation of the |
119 | fields. */ | |
8da1b058 RS |
120 | |
121 | struct tree_common | |
122 | { | |
2f78c311 ZW |
123 | tree chain; |
124 | tree type; | |
2b1d9dc0 | 125 | void *aux; |
c149cc37 | 126 | ENUM_BITFIELD(tree_code) code : 8; |
8da1b058 RS |
127 | unsigned side_effects_flag : 1; |
128 | unsigned constant_flag : 1; | |
8da1b058 RS |
129 | unsigned addressable_flag : 1; |
130 | unsigned volatile_flag : 1; | |
131 | unsigned readonly_flag : 1; | |
132 | unsigned unsigned_flag : 1; | |
133 | unsigned asm_written_flag: 1; | |
134 | ||
135 | unsigned used_flag : 1; | |
12a22e76 | 136 | unsigned nothrow_flag : 1; |
8da1b058 RS |
137 | unsigned static_flag : 1; |
138 | unsigned public_flag : 1; | |
139 | unsigned private_flag : 1; | |
140 | unsigned protected_flag : 1; | |
a6d7adfd | 141 | unsigned bounded_flag : 1; |
8da1b058 RS |
142 | |
143 | unsigned lang_flag_0 : 1; | |
144 | unsigned lang_flag_1 : 1; | |
145 | unsigned lang_flag_2 : 1; | |
146 | unsigned lang_flag_3 : 1; | |
147 | unsigned lang_flag_4 : 1; | |
148 | unsigned lang_flag_5 : 1; | |
149 | unsigned lang_flag_6 : 1; | |
1f8f4a0b MM |
150 | /* This flag is presently unused. However, language front-ends |
151 | should not make use of this flag; it is reserved for future | |
152 | expansion. */ | |
153 | unsigned dummy : 1; | |
8da1b058 RS |
154 | }; |
155 | ||
a5f99f01 RK |
156 | /* The following table lists the uses of each of the above flags and |
157 | for which types of nodes they are defined. Note that expressions | |
158 | include decls. | |
159 | ||
160 | addressable_flag: | |
161 | ||
162 | TREE_ADDRESSABLE in | |
1febe16b RK |
163 | VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, |
164 | ..._TYPE, IDENTIFIER_NODE | |
a5f99f01 RK |
165 | |
166 | static_flag: | |
167 | ||
168 | TREE_STATIC in | |
e5e809f4 | 169 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
a5f99f01 RK |
170 | TREE_NO_UNUSED_WARNING in |
171 | CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR | |
172 | TREE_VIA_VIRTUAL in | |
173 | TREE_LIST or TREE_VEC | |
174 | TREE_CONSTANT_OVERFLOW in | |
175 | INTEGER_CST, REAL_CST, COMPLEX_CST | |
176 | TREE_SYMBOL_REFERENCED in | |
177 | IDENTIFIER_NODE | |
178 | ||
179 | public_flag: | |
180 | ||
181 | TREE_OVERFLOW in | |
182 | INTEGER_CST, REAL_CST, COMPLEX_CST | |
183 | TREE_PUBLIC in | |
4c521bad | 184 | VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE |
a5f99f01 RK |
185 | TREE_VIA_PUBLIC in |
186 | TREE_LIST or TREE_VEC | |
dadafe54 PB |
187 | EXPR_WFL_EMIT_LINE_NOTE in |
188 | EXPR_WITH_FILE_LOCATION | |
a5f99f01 RK |
189 | |
190 | private_flag: | |
191 | ||
192 | TREE_VIA_PRIVATE in | |
193 | TREE_LIST or TREE_VEC | |
194 | TREE_PRIVATE in | |
195 | ??? unspecified nodes | |
196 | ||
197 | protected_flag: | |
198 | ||
199 | TREE_VIA_PROTECTED in | |
200 | TREE_LIST | |
201 | TREE_PROTECTED in | |
202 | BLOCK | |
203 | ??? unspecified nodes | |
204 | ||
205 | side_effects_flag: | |
206 | ||
207 | TREE_SIDE_EFFECTS in | |
208 | all expressions | |
209 | ||
210 | volatile_flag: | |
211 | ||
212 | TREE_THIS_VOLATILE in | |
213 | all expressions | |
214 | TYPE_VOLATILE in | |
215 | ..._TYPE | |
216 | ||
217 | readonly_flag: | |
218 | ||
219 | TREE_READONLY in | |
e5e809f4 | 220 | all expressions |
a5f99f01 RK |
221 | TYPE_READONLY in |
222 | ..._TYPE | |
223 | ||
224 | constant_flag: | |
225 | ||
226 | TREE_CONSTANT in | |
227 | all expressions | |
228 | ||
a5f99f01 RK |
229 | unsigned_flag: |
230 | ||
231 | TREE_UNSIGNED in | |
232 | INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL | |
a5f99f01 RK |
233 | DECL_BUILT_IN_NONANSI in |
234 | FUNCTION_DECL | |
e9a25f70 JL |
235 | SAVE_EXPR_NOPLACEHOLDER in |
236 | SAVE_EXPR | |
a5f99f01 RK |
237 | |
238 | asm_written_flag: | |
239 | ||
240 | TREE_ASM_WRITTEN in | |
241 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
242 | BLOCK | |
243 | ||
244 | used_flag: | |
245 | ||
246 | TREE_USED in | |
247 | expressions, IDENTIFIER_NODE | |
248 | ||
12a22e76 | 249 | nothrow_flag: |
a5f99f01 | 250 | |
12a22e76 JM |
251 | TREE_NOTHROW in |
252 | CALL_EXPR, FUNCTION_DECL | |
a5f99f01 | 253 | |
a6d7adfd GM |
254 | bounded_flag: |
255 | ||
256 | TREE_BOUNDED in | |
4c521bad NB |
257 | expressions, VAR_DECL, PARM_DECL, FIELD_DECL, FUNCTION_DECL, |
258 | IDENTIFIER_NODE | |
a6d7adfd GM |
259 | TYPE_BOUNDED in |
260 | ..._TYPE | |
261 | */ | |
262 | ||
8da1b058 RS |
263 | /* Define accessors for the fields that all tree nodes have |
264 | (though some fields are not used for all kinds of nodes). */ | |
265 | ||
266 | /* The tree-code says what kind of node it is. | |
267 | Codes are defined in tree.def. */ | |
268 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
dbbbbf3b JDA |
269 | #define TREE_SET_CODE(NODE, VALUE) \ |
270 | ((NODE)->common.code = (ENUM_BITFIELD(tree_code)) (VALUE)) | |
8da1b058 | 271 | |
12b195d9 | 272 | /* When checking is enabled, errors will be generated if a tree node |
8f985ec4 | 273 | is accessed incorrectly. The macros abort with a fatal error. */ |
f4524c9e | 274 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
12b195d9 | 275 | |
8784fdcd | 276 | #define TREE_CHECK(t, code) __extension__ \ |
8f985ec4 ZW |
277 | ({ const tree __t = t; \ |
278 | if (TREE_CODE(__t) != (code)) \ | |
fbfc1192 | 279 | tree_check_failed (__t, code, __FILE__, __LINE__, __FUNCTION__); \ |
8f985ec4 | 280 | __t; }) |
8784fdcd | 281 | #define TREE_CLASS_CHECK(t, class) __extension__ \ |
8f985ec4 ZW |
282 | ({ const tree __t = t; \ |
283 | if (TREE_CODE_CLASS(TREE_CODE(__t)) != (class)) \ | |
fbfc1192 | 284 | tree_class_check_failed (__t, class, __FILE__, __LINE__, __FUNCTION__); \ |
8f985ec4 ZW |
285 | __t; }) |
286 | ||
287 | /* These checks have to be special cased. */ | |
8784fdcd | 288 | #define CST_OR_CONSTRUCTOR_CHECK(t) __extension__ \ |
8f985ec4 ZW |
289 | ({ const tree __t = t; \ |
290 | enum tree_code __c = TREE_CODE(__t); \ | |
291 | if (__c != CONSTRUCTOR && TREE_CODE_CLASS(__c) != 'c') \ | |
fbfc1192 | 292 | tree_check_failed (__t, CONSTRUCTOR, __FILE__, __LINE__, __FUNCTION__); \ |
8f985ec4 | 293 | __t; }) |
8784fdcd | 294 | #define EXPR_CHECK(t) __extension__ \ |
8f985ec4 ZW |
295 | ({ const tree __t = t; \ |
296 | char __c = TREE_CODE_CLASS(TREE_CODE(__t)); \ | |
297 | if (__c != 'r' && __c != 's' && __c != '<' \ | |
298 | && __c != '1' && __c != '2' && __c != 'e') \ | |
fbfc1192 | 299 | tree_class_check_failed(__t, 'e', __FILE__, __LINE__, __FUNCTION__); \ |
8f985ec4 ZW |
300 | __t; }) |
301 | ||
58782098 | 302 | extern void tree_check_failed PARAMS ((const tree, enum tree_code, |
f8a83ee3 | 303 | const char *, int, const char *)) |
8f985ec4 | 304 | ATTRIBUTE_NORETURN; |
f8a83ee3 ZW |
305 | extern void tree_class_check_failed PARAMS ((const tree, int, |
306 | const char *, int, const char *)) | |
8f985ec4 ZW |
307 | ATTRIBUTE_NORETURN; |
308 | ||
f4524c9e | 309 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
12b195d9 | 310 | |
8f985ec4 ZW |
311 | #define TREE_CHECK(t, code) (t) |
312 | #define TREE_CLASS_CHECK(t, code) (t) | |
313 | #define CST_OR_CONSTRUCTOR_CHECK(t) (t) | |
314 | #define EXPR_CHECK(t) (t) | |
315 | ||
316 | #endif | |
317 | ||
318 | #include "tree-check.h" | |
319 | ||
320 | #define TYPE_CHECK(tree) TREE_CLASS_CHECK (tree, 't') | |
321 | #define DECL_CHECK(tree) TREE_CLASS_CHECK (tree, 'd') | |
322 | #define CST_CHECK(tree) TREE_CLASS_CHECK (tree, 'c') | |
12b195d9 | 323 | |
8da1b058 RS |
324 | /* In all nodes that are expressions, this is the data type of the expression. |
325 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
0b4565c9 BS |
326 | In ARRAY_TYPE nodes, this is the type of the elements. |
327 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
8da1b058 RS |
328 | #define TREE_TYPE(NODE) ((NODE)->common.type) |
329 | ||
1c0cc57e KG |
330 | /* Here is how primitive or already-canonicalized types' hash codes |
331 | are made. */ | |
332 | #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777) | |
333 | ||
8da1b058 RS |
334 | /* Nodes are chained together for many purposes. |
335 | Types are chained together to record them for being output to the debugger | |
336 | (see the function `chain_type'). | |
337 | Decls in the same scope are chained together to record the contents | |
338 | of the scope. | |
339 | Statement nodes for successive statements used to be chained together. | |
340 | Often lists of things are represented by TREE_LIST nodes that | |
341 | are chained together. */ | |
342 | ||
343 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
344 | ||
345 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
346 | that don't change the machine mode. */ | |
347 | ||
9a6bb3f7 | 348 | #define STRIP_NOPS(EXP) \ |
8da1b058 RS |
349 | while ((TREE_CODE (EXP) == NOP_EXPR \ |
350 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
351 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 352 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
8da1b058 RS |
353 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
354 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
355 | (EXP) = TREE_OPERAND (EXP, 0); | |
0fafb45e | 356 | |
14a774a9 RK |
357 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
358 | ||
359 | #define STRIP_SIGN_NOPS(EXP) \ | |
360 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
361 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
362 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 363 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
14a774a9 RK |
364 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
365 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
366 | && (TREE_UNSIGNED (TREE_TYPE (EXP)) \ | |
367 | == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
368 | (EXP) = TREE_OPERAND (EXP, 0); | |
369 | ||
0fafb45e RS |
370 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
371 | ||
372 | #define STRIP_TYPE_NOPS(EXP) \ | |
373 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
374 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
375 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 376 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
0fafb45e RS |
377 | && (TREE_TYPE (EXP) \ |
378 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
379 | (EXP) = TREE_OPERAND (EXP, 0); | |
87291138 RK |
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)) | |
947765f9 PB |
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) | |
9e6cfc43 | 402 | |
a6d7adfd GM |
403 | /* Nonzero if TYPE represents an unbounded pointer or unbounded |
404 | reference type. (It should be renamed to INDIRECT_TYPE_P.) */ | |
9e6cfc43 JM |
405 | |
406 | #define POINTER_TYPE_P(TYPE) \ | |
407 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
555f90c5 | 408 | |
a6d7adfd GM |
409 | /* Nonzero if TYPE represents a bounded pointer or bounded reference type. */ |
410 | ||
411 | #define BOUNDED_INDIRECT_TYPE_P(TYPE) \ | |
412 | (TREE_CODE (TYPE) == RECORD_TYPE && TREE_TYPE (TYPE)) | |
413 | ||
414 | /* Nonzero if TYPE represents a bounded pointer type. */ | |
415 | ||
416 | #define BOUNDED_POINTER_TYPE_P(TYPE) \ | |
417 | (BOUNDED_INDIRECT_TYPE_P (TYPE) \ | |
418 | && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == POINTER_TYPE) | |
419 | ||
420 | /* Nonzero if TYPE represents a bounded reference type. Bounded | |
421 | reference types have two specific uses: (1) When a reference is | |
422 | seated to a variable-length RECORD_TYPE that has an array of | |
423 | indeterminate length as its final field. For all other objects, it | |
424 | is sufficient to check bounds at the time the reference is seated, | |
425 | and assume that all future uses of the reference are safe, since | |
426 | the address of references cannot change. (2) When a reference | |
427 | supertype is seated to an subtype object. The bounds "remember" | |
428 | the true size of the complete object, so that subsequent upcasts of | |
429 | the address of the reference will be checked properly (is such a | |
430 | thing valid C++?). */ | |
431 | ||
432 | #define BOUNDED_REFERENCE_TYPE_P(TYPE) \ | |
433 | (BOUNDED_INDIRECT_TYPE_P (TYPE) \ | |
434 | && TREE_CODE (TYPE_BOUNDED_SUBTYPE (TYPE)) == REFERENCE_TYPE) | |
435 | ||
436 | /* Nonzero if TYPE represents a pointer or reference type, either | |
437 | bounded or unbounded. */ | |
438 | ||
439 | #define MAYBE_BOUNDED_INDIRECT_TYPE_P(TYPE) \ | |
440 | (POINTER_TYPE_P (TYPE) || BOUNDED_INDIRECT_TYPE_P (TYPE)) | |
441 | ||
442 | /* Nonzero if TYPE represents a pointer type, either bounded or unbounded. */ | |
443 | ||
444 | #define MAYBE_BOUNDED_POINTER_TYPE_P(TYPE) \ | |
445 | (TREE_CODE (TYPE) == POINTER_TYPE || BOUNDED_POINTER_TYPE_P (TYPE)) | |
446 | ||
447 | /* Nonzero if TYPE represents a reference type, either bounded or unbounded. */ | |
448 | ||
449 | #define MAYBE_BOUNDED_REFERENCE_TYPE_P(TYPE) \ | |
450 | (TREE_CODE (TYPE) == REFERENCE_TYPE || BOUNDED_REFERENCE_TYPE_P (TYPE)) | |
451 | ||
d0f062fb NS |
452 | /* Nonzero if this type is a complete type. */ |
453 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
454 | ||
71653180 | 455 | /* Nonzero if this type is the (possibly qualified) void type. */ |
e7cd085f | 456 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
71653180 | 457 | |
d0f062fb NS |
458 | /* Nonzero if this type is complete or is cv void. */ |
459 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
71653180 | 460 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
d0f062fb NS |
461 | |
462 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
463 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
464 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : NODE)) | |
465 | ||
555f90c5 JM |
466 | /* Nonzero if TYPE represents a type. */ |
467 | ||
468 | #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't') | |
8da1b058 RS |
469 | \f |
470 | /* Define many boolean fields that all tree nodes have. */ | |
471 | ||
472 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
473 | So it cannot be in a register. | |
474 | In a FUNCTION_DECL, nonzero means its address is needed. | |
475 | So it must be compiled even if it is an inline function. | |
1febe16b RK |
476 | In a FIELD_DECL node, it means that the programmer is permitted to |
477 | construct the address of this field. This is used for aliasing | |
478 | purposes: see record_component_aliases. | |
8da1b058 RS |
479 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
480 | In LABEL_DECL nodes, it means a goto for this label has been seen | |
481 | from a place outside all binding contours that restore stack levels. | |
482 | In ..._TYPE nodes, it means that objects of this type must | |
483 | be fully addressable. This means that pieces of this | |
484 | object cannot go into register parameters, for example. | |
485 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
486 | had its address taken. That matters for inline functions. */ | |
487 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
488 | ||
489 | /* In a VAR_DECL, nonzero means allocate static storage. | |
9f86614b | 490 | In a FUNCTION_DECL, nonzero if function has been defined. |
8da1b058 RS |
491 | In a CONSTRUCTOR, nonzero means allocate static storage. */ |
492 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) | |
493 | ||
248c0f74 JM |
494 | /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was |
495 | made implicitly and should not lead to an "unused value" warning. */ | |
8da1b058 RS |
496 | #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag) |
497 | ||
498 | /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation | |
499 | chain is via a `virtual' declaration. */ | |
500 | #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag) | |
501 | ||
ae202b56 RK |
502 | /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means there was an |
503 | overflow in folding. This is distinct from TREE_OVERFLOW because ANSI C | |
504 | requires a diagnostic when overflows occur in constant expressions. */ | |
261450e8 PE |
505 | #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag) |
506 | ||
d3568529 JM |
507 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
508 | this string as an argument. */ | |
509 | #define TREE_SYMBOL_REFERENCED(NODE) ((NODE)->common.static_flag) | |
510 | ||
ae202b56 RK |
511 | /* In an INTEGER_CST, REAL_CST, of COMPLEX_CST, this means there was an |
512 | overflow in folding, and no warning has been issued for this subexpression. | |
261450e8 PE |
513 | TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, but not vice versa. */ |
514 | #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) | |
515 | ||
8da1b058 RS |
516 | /* In a VAR_DECL or FUNCTION_DECL, |
517 | nonzero means name is to be accessible from outside this module. | |
4c521bad | 518 | In an IDENTIFIER_NODE, nonzero means an external declaration |
6dc42e49 | 519 | accessible from outside this module was previously seen |
8da1b058 RS |
520 | for this name in an inner scope. */ |
521 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
522 | ||
523 | /* Nonzero for TREE_LIST or TREE_VEC node means that the path to the | |
524 | base class is via a `public' declaration, which preserves public | |
525 | fields from the base class as public. */ | |
526 | #define TREE_VIA_PUBLIC(NODE) ((NODE)->common.public_flag) | |
527 | ||
9e5386db MS |
528 | /* Ditto, for `private' declarations. */ |
529 | #define TREE_VIA_PRIVATE(NODE) ((NODE)->common.private_flag) | |
530 | ||
531 | /* Nonzero for TREE_LIST node means that the path to the | |
532 | base class is via a `protected' declaration, which preserves | |
533 | protected fields from the base class as protected. | |
534 | OVERLOADED. */ | |
026380ff | 535 | #define TREE_VIA_PROTECTED(NODE) ((NODE)->common.protected_flag) |
9e5386db | 536 | |
8da1b058 RS |
537 | /* In any expression, nonzero means it has side effects or reevaluation |
538 | of the whole expression could produce a different value. | |
539 | This is set if any subexpression is a function call, a side effect | |
540 | or a reference to a volatile variable. | |
541 | In a ..._DECL, this is set only if the declaration said `volatile'. */ | |
542 | #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag) | |
543 | ||
544 | /* Nonzero means this expression is volatile in the C sense: | |
545 | its address should be of type `volatile WHATEVER *'. | |
546 | In other words, the declared item is volatile qualified. | |
547 | This is used in _DECL nodes and _REF nodes. | |
548 | ||
549 | In a ..._TYPE node, means this type is volatile-qualified. | |
550 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
551 | because eventually we may make that a different bit. | |
552 | ||
553 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
554 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
555 | ||
556 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, | |
557 | nonzero means it may not be the lhs of an assignment. | |
558 | In a ..._TYPE node, means this type is const-qualified | |
559 | (but the macro TYPE_READONLY should be used instead of this macro | |
560 | when the node is a type). */ | |
561 | #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
562 | ||
563 | /* Value of expression is constant. | |
564 | Always appears in all ..._CST nodes. | |
565 | May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR | |
566 | if the value is constant. */ | |
567 | #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag) | |
568 | ||
8da1b058 RS |
569 | /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type. |
570 | In FIELD_DECL nodes, means an unsigned bit field. | |
571 | The same bit is used in functions as DECL_BUILT_IN_NONANSI. */ | |
572 | #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag) | |
573 | ||
91ce572a CC |
574 | #define TYPE_TRAP_SIGNED(NODE) (flag_trapv && ! TREE_UNSIGNED (NODE)) |
575 | ||
8da1b058 RS |
576 | /* Nonzero in a VAR_DECL means assembler code has been written. |
577 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
578 | This is interesting in an inline function, since it might not need | |
579 | to be compiled separately. | |
3635a54b | 580 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
9f86614b RS |
581 | if the sdb debugging info for the type has been written. |
582 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. */ | |
8da1b058 RS |
583 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
584 | ||
585 | /* Nonzero in a _DECL if the name is used in its scope. | |
586 | Nonzero in an expr node means inhibit warning if value is unused. | |
587 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
588 | was used. */ | |
589 | #define TREE_USED(NODE) ((NODE)->common.used_flag) | |
590 | ||
12a22e76 JM |
591 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw |
592 | an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ | |
593 | #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag) | |
8da1b058 | 594 | |
9f86614b | 595 | /* Used in classes in C++. */ |
8da1b058 | 596 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
9f86614b RS |
597 | /* Used in classes in C++. |
598 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
8da1b058 RS |
599 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
600 | ||
a6d7adfd GM |
601 | /* In a ..._TYPE node, nonzero means that the type's size and layout, |
602 | (or the size and layout of its arguments and/or return value in the | |
603 | case of a FUNCTION_TYPE or METHOD_TYPE) was changed by the presence | |
604 | of pointer bounds. Use TYPE_BOUNDED instead of this macro when the | |
605 | node is a type, because eventually we may make that a different | |
606 | bit. TYPE_BOUNDED doesn't mean that this type is a bounded indirect | |
607 | type--use BOUNDED_POINTER_TYPE_P, BOUNDED_REFERENCE_TYPE_P, | |
608 | BOUNDED_INDIRECT_TYPE_P to test for that. | |
609 | ||
610 | In a FUNCTION_DECL, nonzero means that the size and layout of one | |
611 | of its arguments and/or return value was changed by the presence of | |
612 | pointer bounds. This value can differ from the value of | |
613 | TYPE_BOUNDED (TREE_TYPE (fundecl)) if the function was implicitly | |
614 | declared, then later called with pointer args, or was declared with | |
615 | a variable argument list and is later called with pointer values in | |
616 | the variable argument list. | |
617 | ||
618 | In a VAR_DECL, PARM_DECL or FIELD_DECL, TREE_BOUNDED matches the value | |
619 | of the decl's type's BOUNDED_POINTER_TYPE_P. | |
620 | ||
621 | In a CONSTRUCTOR or other expression, nonzero means the value is a | |
622 | bounded pointer. It is insufficient to determine the boundedness | |
623 | of an expression EXP with BOUNDED_POINTER_TYPE_P (TREE_TYPE (EXP)), | |
624 | since we allow pointer to be temporarily cast to integer for | |
625 | rounding up to an alignment boudary in a way that preserves the | |
626 | pointer's bounds. | |
627 | ||
628 | In an IDENTIFIER_NODE, nonzero means that the name is prefixed with | |
629 | BP_PREFIX (see varasm.c). This occurs for the DECL_ASSEMBLER_NAME | |
630 | of a function that has bounded pointer(s) for its return type and/or | |
631 | argument type(s). */ | |
632 | ||
633 | #define TREE_BOUNDED(NODE) ((NODE)->common.bounded_flag) | |
634 | ||
9f86614b | 635 | /* These flags are available for each language front end to use internally. */ |
8da1b058 RS |
636 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
637 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
638 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
639 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
640 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
641 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
642 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
643 | \f | |
644 | /* Define additional fields and accessors for nodes representing constants. */ | |
645 | ||
e5d70561 RK |
646 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
647 | If the data type is signed, the value is sign-extended to 2 words | |
8da1b058 | 648 | even though not all of them may really be in use. |
e5d70561 | 649 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2afaa41c GM |
650 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
651 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
652 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
8da1b058 RS |
653 | |
654 | #define INT_CST_LT(A, B) \ | |
655 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
656 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
05bccae2 | 657 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
8da1b058 RS |
658 | |
659 | #define INT_CST_LT_UNSIGNED(A, B) \ | |
e5d70561 RK |
660 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ |
661 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
662 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
05bccae2 RK |
663 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
664 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) | |
8da1b058 RS |
665 | |
666 | struct tree_int_cst | |
667 | { | |
2bf105ab | 668 | struct tree_common common; |
2f78c311 | 669 | rtx rtl; /* acts as link to register transfer language |
8e15f736 | 670 | (rtl) info */ |
2afaa41c GM |
671 | /* A sub-struct is necessary here because the function `const_hash' |
672 | wants to scan both words as a unit and taking the address of the | |
673 | sub-struct yields the properly inclusive bounded pointer. */ | |
674 | struct { | |
675 | unsigned HOST_WIDE_INT low; | |
676 | HOST_WIDE_INT high; | |
677 | } int_cst; | |
8da1b058 RS |
678 | }; |
679 | ||
680 | /* In REAL_CST, STRING_CST, COMPLEX_CST nodes, and CONSTRUCTOR nodes, | |
681 | and generally in all kinds of constants that could | |
682 | be given labels (rather than being immediate). */ | |
683 | ||
12b195d9 | 684 | #define TREE_CST_RTL(NODE) (CST_OR_CONSTRUCTOR_CHECK (NODE)->real_cst.rtl) |
8da1b058 RS |
685 | |
686 | /* In a REAL_CST node. */ | |
687 | /* We can represent a real value as either a `double' or a string. | |
688 | Strings don't allow for any optimization, but they do allow | |
689 | for cross-compilation. */ | |
690 | ||
12b195d9 | 691 | #define TREE_REAL_CST(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst) |
8da1b058 RS |
692 | |
693 | #include "real.h" | |
694 | ||
695 | struct tree_real_cst | |
696 | { | |
2bf105ab | 697 | struct tree_common common; |
2f78c311 | 698 | rtx rtl; /* acts as link to register transfer language |
8da1b058 RS |
699 | (rtl) info */ |
700 | REAL_VALUE_TYPE real_cst; | |
701 | }; | |
702 | ||
703 | /* In a STRING_CST */ | |
12b195d9 ML |
704 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
705 | #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer) | |
8da1b058 RS |
706 | |
707 | struct tree_string | |
708 | { | |
2bf105ab | 709 | struct tree_common common; |
2f78c311 | 710 | rtx rtl; /* acts as link to register transfer language |
8da1b058 RS |
711 | (rtl) info */ |
712 | int length; | |
520a57c8 | 713 | const char *pointer; |
8da1b058 RS |
714 | }; |
715 | ||
716 | /* In a COMPLEX_CST node. */ | |
12b195d9 ML |
717 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
718 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
8da1b058 RS |
719 | |
720 | struct tree_complex | |
721 | { | |
2bf105ab | 722 | struct tree_common common; |
2f78c311 | 723 | rtx rtl; /* acts as link to register transfer language |
8da1b058 | 724 | (rtl) info */ |
2f78c311 ZW |
725 | tree real; |
726 | tree imag; | |
8da1b058 RS |
727 | }; |
728 | \f | |
2a967f3d NB |
729 | #include "hashtable.h" |
730 | ||
8da1b058 RS |
731 | /* Define fields and accessors for some special-purpose tree nodes. */ |
732 | ||
2a967f3d NB |
733 | #define IDENTIFIER_LENGTH(NODE) \ |
734 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) | |
735 | #define IDENTIFIER_POINTER(NODE) \ | |
736 | ((char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) | |
737 | ||
738 | /* Translate a hash table identifier pointer to a tree_identifier | |
739 | pointer, and vice versa. */ | |
740 | ||
741 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
742 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) | |
743 | #define GCC_IDENT_TO_HT_IDENT(NODE) \ | |
744 | (&((struct tree_identifier *) (NODE))->id) | |
8da1b058 RS |
745 | |
746 | struct tree_identifier | |
747 | { | |
2bf105ab | 748 | struct tree_common common; |
2a967f3d | 749 | struct ht_identifier id; |
8da1b058 RS |
750 | }; |
751 | ||
752 | /* In a TREE_LIST node. */ | |
12b195d9 ML |
753 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
754 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
8da1b058 RS |
755 | |
756 | struct tree_list | |
757 | { | |
2bf105ab | 758 | struct tree_common common; |
2f78c311 ZW |
759 | tree purpose; |
760 | tree value; | |
8da1b058 RS |
761 | }; |
762 | ||
763 | /* In a TREE_VEC node. */ | |
12b195d9 ML |
764 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
765 | #define TREE_VEC_ELT(NODE,I) (TREE_VEC_CHECK (NODE)->vec.a[I]) | |
52267fcb | 766 | #define TREE_VEC_END(NODE) ((void) TREE_VEC_CHECK (NODE),&((NODE)->vec.a[(NODE)->vec.length])) |
8da1b058 RS |
767 | |
768 | struct tree_vec | |
769 | { | |
2bf105ab | 770 | struct tree_common common; |
8da1b058 | 771 | int length; |
2f78c311 | 772 | tree a[1]; |
8da1b058 RS |
773 | }; |
774 | ||
775 | /* Define fields and accessors for some nodes that represent expressions. */ | |
776 | ||
777 | /* In a SAVE_EXPR node. */ | |
778 | #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND(NODE, 1) | |
2f78c311 | 779 | #define SAVE_EXPR_RTL(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[2]) |
e9a25f70 | 780 | #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (NODE) |
d26f8097 MM |
781 | /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs |
782 | both in normal code and in a handler. (Normally, in a handler, all | |
783 | SAVE_EXPRs are unsaved, meaning that there values are | |
784 | recalculated.) */ | |
785 | #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (NODE) | |
8da1b058 RS |
786 | |
787 | /* In a RTL_EXPR node. */ | |
2f78c311 ZW |
788 | #define RTL_EXPR_SEQUENCE(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[0]) |
789 | #define RTL_EXPR_RTL(NODE) (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[1]) | |
8da1b058 | 790 | |
6ad7895a APB |
791 | /* In a WITH_CLEANUP_EXPR node. */ |
792 | #define WITH_CLEANUP_EXPR_RTL(NODE) \ | |
2f78c311 | 793 | (*(rtx *) &EXPR_CHECK (NODE)->exp.operands[2]) |
6ad7895a | 794 | |
8da1b058 RS |
795 | /* In a CONSTRUCTOR node. */ |
796 | #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND (NODE, 1) | |
797 | ||
61131fa2 | 798 | /* In ordinary expression nodes. */ |
12b195d9 ML |
799 | #define TREE_OPERAND(NODE, I) (EXPR_CHECK (NODE)->exp.operands[I]) |
800 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) | |
61131fa2 | 801 | |
40edd0bd APB |
802 | /* In a LABELED_BLOCK_EXPR node. */ |
803 | #define LABELED_BLOCK_LABEL(NODE) TREE_OPERAND (NODE, 0) | |
804 | #define LABELED_BLOCK_BODY(NODE) TREE_OPERAND (NODE, 1) | |
805 | ||
806 | /* In a EXIT_BLOCK_EXPR node. */ | |
807 | #define EXIT_BLOCK_LABELED_BLOCK(NODE) TREE_OPERAND (NODE, 0) | |
808 | #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND (NODE, 1) | |
809 | ||
810 | /* In a LOOP_EXPR node. */ | |
811 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND (NODE, 0) | |
812 | ||
dadafe54 | 813 | /* In a EXPR_WITH_FILE_LOCATION node. */ |
bf1e5319 | 814 | #define EXPR_WFL_NODE(NODE) TREE_OPERAND((NODE), 0) |
86fff623 MM |
815 | #define EXPR_WFL_FILENAME(NODE) \ |
816 | (IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE ((NODE)))) | |
817 | #define EXPR_WFL_FILENAME_NODE(NODE) TREE_OPERAND((NODE), 1) | |
12b195d9 ML |
818 | #define EXPR_WFL_LINENO(NODE) (EXPR_CHECK (NODE)->exp.complexity >> 12) |
819 | #define EXPR_WFL_COLNO(NODE) (EXPR_CHECK (NODE)->exp.complexity & 0xfff) | |
820 | #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity) | |
bf1e5319 APB |
821 | #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \ |
822 | (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff)) | |
dadafe54 | 823 | #define EXPR_WFL_EMIT_LINE_NOTE(NODE) ((NODE)->common.public_flag) |
bf1e5319 | 824 | |
61131fa2 RS |
825 | struct tree_exp |
826 | { | |
2bf105ab | 827 | struct tree_common common; |
61131fa2 | 828 | int complexity; |
2f78c311 | 829 | tree operands[1]; |
61131fa2 RS |
830 | }; |
831 | \f | |
8da1b058 | 832 | /* In a BLOCK node. */ |
12b195d9 | 833 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
12b195d9 ML |
834 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
835 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
8da1b058 RS |
836 | /* Note: when changing this, make sure to find the places |
837 | that use chainon or nreverse. */ | |
a901fa64 | 838 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) |
12b195d9 ML |
839 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
840 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
8da1b058 RS |
841 | |
842 | /* Nonzero means that this block is prepared to handle exceptions | |
843 | listed in the BLOCK_VARS slot. */ | |
12b195d9 | 844 | #define BLOCK_HANDLER_BLOCK(NODE) (BLOCK_CHECK (NODE)->block.handler_block_flag) |
8da1b058 | 845 | |
18c038b9 MM |
846 | /* An index number for this block. These values are not guaranteed to |
847 | be unique across functions -- whether or not they are depends on | |
848 | the debugging output format in use. */ | |
849 | #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) | |
850 | ||
a20612aa RH |
851 | /* If block reordering splits a lexical block into discontiguous |
852 | address ranges, we'll make a copy of the original block. | |
853 | ||
854 | Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. | |
855 | In that case, we have one source block that has been replicated | |
856 | (through inlining or unrolling) into many logical blocks, and that | |
857 | these logical blocks have different physical variables in them. | |
858 | ||
859 | In this case, we have one logical block split into several | |
860 | non-contiguous address ranges. Most debug formats can't actually | |
861 | represent this idea directly, so we fake it by creating multiple | |
862 | logical blocks with the same variables in them. However, for those | |
863 | that do support non-contiguous regions, these allow the original | |
864 | logical block to be reconstructed, along with the set of address | |
865 | ranges. | |
866 | ||
867 | One of the logical block fragments is arbitrarily chosen to be | |
868 | the ORIGIN. The other fragments will point to the origin via | |
869 | BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer | |
870 | be null. The list of fragments will be chained through | |
871 | BLOCK_FRAGMENT_CHAIN from the origin. */ | |
872 | ||
873 | #define BLOCK_FRAGMENT_ORIGIN(NODE) \ | |
874 | (BLOCK_CHECK (NODE)->block.fragment_origin) | |
875 | #define BLOCK_FRAGMENT_CHAIN(NODE) \ | |
876 | (BLOCK_CHECK (NODE)->block.fragment_chain) | |
877 | ||
61131fa2 | 878 | struct tree_block |
8da1b058 | 879 | { |
2bf105ab | 880 | struct tree_common common; |
61131fa2 RS |
881 | |
882 | unsigned handler_block_flag : 1; | |
883 | unsigned abstract_flag : 1; | |
a84efb51 | 884 | unsigned block_num : 30; |
61131fa2 | 885 | |
2f78c311 ZW |
886 | tree vars; |
887 | tree subblocks; | |
888 | tree supercontext; | |
889 | tree abstract_origin; | |
890 | tree fragment_origin; | |
891 | tree fragment_chain; | |
8da1b058 RS |
892 | }; |
893 | \f | |
894 | /* Define fields and accessors for nodes representing data types. */ | |
895 | ||
896 | /* See tree.def for documentation of the use of these fields. | |
897 | Look at the documentation of the various ..._TYPE tree codes. */ | |
898 | ||
12b195d9 ML |
899 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) |
900 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) | |
901 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) | |
902 | #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) | |
903 | #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values) | |
904 | #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values) | |
905 | #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values) | |
906 | #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
907 | #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval) | |
908 | #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values) | |
909 | #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
910 | #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
911 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) | |
912 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
913 | #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval) | |
914 | #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval) | |
915 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) | |
916 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
917 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
918 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) | |
919 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
920 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
12b195d9 | 921 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) |
12b195d9 | 922 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) |
8da1b058 | 923 | |
4061f623 BS |
924 | /* For a VECTOR_TYPE node, this describes a different type which is emitted |
925 | in the debugging output. We use this to describe a vector as a | |
926 | structure containing an array. */ | |
927 | #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values) | |
928 | ||
a6d7adfd GM |
929 | /* Indirect types present difficulties because they may be represented |
930 | as either POINTER_TYPE/REFERENCE_TYPE nodes (unbounded) or as | |
931 | RECORD_TYPE nodes (bounded). Bounded and unbounded pointers might | |
932 | be logically equivalent, but physically different. Simple | |
933 | comparison of the main variant only tells if the types are | |
934 | logically equivalent. Use this predicate to compare for physical | |
935 | equivalency. */ | |
936 | ||
937 | /* Types have the same main variant, and have the same boundedness. */ | |
938 | #define TYPE_MAIN_VARIANTS_PHYSICALLY_EQUAL_P(TYPE1, TYPE2) \ | |
939 | (TYPE_MAIN_VARIANT (TYPE1) == TYPE_MAIN_VARIANT (TYPE2) \ | |
940 | && TREE_CODE (TYPE1) == TREE_CODE (TYPE2)) | |
941 | ||
942 | /* Return the type variant that has no qualifiers (i.e., the main variant), | |
943 | except that the boundedness qualifier is preserved. */ | |
944 | #define TYPE_MAIN_PHYSICAL_VARIANT(TYPE) \ | |
945 | (BOUNDED_POINTER_TYPE_P (TYPE) \ | |
946 | ? build_qualified_type (TYPE, TYPE_QUAL_BOUNDED) \ | |
947 | : TYPE_MAIN_VARIANT (TYPE)) | |
948 | ||
8ff0c1af MM |
949 | /* For aggregate types, information about this type, as a base type |
950 | for itself. Used in a language-dependent way for types that are | |
951 | neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */ | |
952 | #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo) | |
953 | ||
41472af8 MM |
954 | /* The (language-specific) typed-based alias set for this type. |
955 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
956 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
957 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
958 | type can alias objects of any type. */ | |
959 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
960 | ||
961 | /* Nonzero iff the typed-based alias set for this type has been | |
962 | calculated. */ | |
963 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ | |
964 | (TYPE_CHECK (NODE)->type.alias_set != -1) | |
965 | ||
bad1b4ba RK |
966 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
967 | to this type. */ | |
12b195d9 | 968 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
bad1b4ba | 969 | |
869637e6 RS |
970 | /* The alignment necessary for objects of this type. |
971 | The value is an int, measured in bits. */ | |
12b195d9 | 972 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
869637e6 | 973 | |
11cf4d18 JJ |
974 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
975 | 0 if it is the default for this type. */ | |
976 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) | |
977 | ||
834c6dff MM |
978 | /* The alignment for NODE, in bytes. */ |
979 | #define TYPE_ALIGN_UNIT(NODE) \ | |
980 | (TYPE_ALIGN (NODE) / BITS_PER_UNIT) | |
981 | ||
2b5f2501 RH |
982 | /* If your language allows you to declare types, and you want debug info |
983 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
984 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
985 | type node. You then set the TYPE_STUB_DECL field of the type node | |
986 | to point back at the TYPE_DECL node. This allows the debug routines | |
987 | to know that the two nodes represent the same type, so that we only | |
988 | get one debug info record for them. */ | |
8da1b058 RS |
989 | #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (NODE)) |
990 | ||
3635a54b RK |
991 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
992 | has BLKmode only because it lacks the alignment requirement for | |
993 | its size. */ | |
12b195d9 | 994 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
8da1b058 | 995 | |
e36308b0 MM |
996 | /* In an INTEGER_TYPE, it means the type represents a size. We use |
997 | this both for validity checking and to permit optimizations that | |
998 | are unsafe for other types. Note that the C `size_t' type should | |
999 | *not* have this flag set. The `size_t' type is simply a typedef | |
1000 | for an ordinary integer type that happens to be the type of an | |
1001 | expression returned by `sizeof'; `size_t' has no special | |
1002 | properties. Expressions whose type have TYPE_IS_SIZETYPE set are | |
1003 | always actual sizes. */ | |
7393c642 RK |
1004 | #define TYPE_IS_SIZETYPE(NODE) \ |
1005 | (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) | |
1006 | ||
1007 | /* In a FUNCTION_TYPE, indicates that the function returns with the stack | |
1008 | pointer depressed. */ | |
1009 | #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ | |
199acebb | 1010 | (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) |
fed3cef0 | 1011 | |
8da1b058 RS |
1012 | /* Nonzero in a type considered volatile as a whole. */ |
1013 | #define TYPE_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
1014 | ||
1015 | /* Means this type is const-qualified. */ | |
1016 | #define TYPE_READONLY(NODE) ((NODE)->common.readonly_flag) | |
1017 | ||
3932261a MM |
1018 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
1019 | the term. */ | |
1020 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
1021 | ||
a6d7adfd GM |
1022 | /* If nonzero, this type's size and layout, (or the size and layout of |
1023 | its arguments and/or return value in the case of a FUNCTION_TYPE or | |
1024 | METHOD_TYPE) was changed by the presence of pointer bounds. */ | |
1025 | #define TYPE_BOUNDED(NODE) (TYPE_CHECK (NODE)->common.bounded_flag) | |
1026 | ||
3932261a MM |
1027 | /* There is a TYPE_QUAL value for each type qualifier. They can be |
1028 | combined by bitwise-or to form the complete set of qualifiers for a | |
1029 | type. */ | |
1030 | ||
1031 | #define TYPE_UNQUALIFIED 0x0 | |
1032 | #define TYPE_QUAL_CONST 0x1 | |
1033 | #define TYPE_QUAL_VOLATILE 0x2 | |
1034 | #define TYPE_QUAL_RESTRICT 0x4 | |
a6d7adfd | 1035 | #define TYPE_QUAL_BOUNDED 0x8 |
3932261a MM |
1036 | |
1037 | /* The set of type qualifiers for this type. */ | |
a6d7adfd GM |
1038 | #define TYPE_QUALS(NODE) \ |
1039 | ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1040 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
1041 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ | |
1042 | | (BOUNDED_INDIRECT_TYPE_P (NODE) * TYPE_QUAL_BOUNDED)) | |
1043 | ||
1044 | /* The set of qualifiers pertinent to an expression node. */ | |
1045 | #define TREE_EXPR_QUALS(NODE) \ | |
1046 | ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1047 | | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
1048 | | (TREE_BOUNDED (NODE) * TYPE_QUAL_BOUNDED)) | |
1049 | ||
1050 | /* The set of qualifiers pertinent to a FUNCTION_DECL node. */ | |
1051 | #define TREE_FUNC_QUALS(NODE) \ | |
1052 | ((TREE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1053 | | (TREE_THIS_VOLATILE (NODE) * TYPE_QUAL_VOLATILE)) | |
3932261a | 1054 | |
9f86614b | 1055 | /* These flags are available for each language front end to use internally. */ |
12b195d9 ML |
1056 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
1057 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
1058 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
1059 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
1060 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
1061 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
1062 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
8da1b058 | 1063 | |
74a3fd26 PB |
1064 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
1065 | that distinguish string from array of char). | |
1066 | If set in a SET_TYPE, indicates a bitstring type. */ | |
12b195d9 | 1067 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
74a3fd26 | 1068 | |
2fb2b21c PB |
1069 | /* If non-NULL, this is a upper bound of the size (in bytes) of an |
1070 | object of the given ARRAY_TYPE. This allows temporaries to be allocated. */ | |
1071 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) TYPE_MAX_VALUE (ARRAY_TYPE) | |
1072 | ||
0b4565c9 BS |
1073 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
1074 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) (GET_MODE_NUNITS (TYPE_CHECK (VECTOR_TYPE)->type.mode)) | |
1075 | ||
1076 | /* Indicates that objects of this type must be initialized by calling a | |
4ac3d994 | 1077 | function when they are created. */ |
2bf105ab RK |
1078 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
1079 | (TYPE_CHECK (NODE)->type.needs_constructing_flag) | |
4ac3d994 | 1080 | |
adb23061 RK |
1081 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
1082 | the same way that the first union alternative would be passed. */ | |
2bf105ab RK |
1083 | #define TYPE_TRANSPARENT_UNION(NODE) \ |
1084 | (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
1085 | ||
1086 | /* For an ARRAY_TYPE, indicates that it is not permitted to | |
1087 | take the address of a component of the type. */ | |
1088 | #define TYPE_NONALIASED_COMPONENT(NODE) \ | |
1089 | (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
adb23061 | 1090 | |
956d6950 | 1091 | /* Indicated that objects of this type should be laid out in as |
9e357cd8 | 1092 | compact a way as possible. */ |
12b195d9 | 1093 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
9e357cd8 | 1094 | |
a6d7adfd GM |
1095 | /* A bounded pointer or bounded reference type (collectively called |
1096 | indirect types) is represented as a RECORD_TYPE node containing | |
1097 | three pointer fields whose type is the corresponding unbounded | |
1098 | POINTER_TYPE or REFERENCE_TYPE. A RECORD_TYPE node that represents | |
1099 | a bounded indirect type differs from a normal RECORD_TYPE node in | |
1100 | that its TREE_TYPE is non-NULL and has the pointed-to type just as | |
1101 | a POINTER_TYPE or REFERENCE_TYPE node has. The bounded RECORD_TYPE | |
1102 | nodes are stored on the same type variant chain alongside the | |
1103 | variants of the underlaying indirect types nodes. The main variant | |
1104 | of such chains is always the unbounded type. */ | |
1105 | ||
1106 | /* Access the field decls of a bounded-pointer type. */ | |
1107 | #define TYPE_BOUNDED_VALUE(TYPE) TYPE_FIELDS (TYPE) | |
1108 | #define TYPE_BOUNDED_BASE(TYPE) TREE_CHAIN (TYPE_BOUNDED_VALUE (TYPE)) | |
1109 | #define TYPE_BOUNDED_EXTENT(TYPE) TREE_CHAIN (TYPE_BOUNDED_BASE (TYPE)) | |
1110 | ||
1111 | /* Access the simple-pointer subtype of a bounded-pointer type. */ | |
1112 | #define TYPE_BOUNDED_SUBTYPE(TYPE) TREE_TYPE (TYPE_BOUNDED_VALUE (TYPE)) | |
1113 | ||
1114 | /* Find the unbounded counterpart to a type, or return TYPE if it is | |
1115 | already unbounded. */ | |
1116 | #define TYPE_UNBOUNDED_VARIANT(TYPE) \ | |
1117 | (BOUNDED_POINTER_TYPE_P (TYPE) ? TYPE_BOUNDED_SUBTYPE (TYPE) : (TYPE)) | |
1118 | ||
1119 | /* This field comprises two bits, for values in the range 0..3: | |
1120 | ||
1121 | depth=0 means that type is a scalar, or an aggregate that contains | |
1122 | only depth=0 types, or a function that has only depth=0 types for | |
1123 | its return value and argument types. | |
1124 | ||
1125 | depth=1 means that type is a pointer to a depth=0 type, or an | |
1126 | aggregate that contains only depth=0 and depth=1 types, or a | |
1127 | function that has only depth=0 and depth=1 types for its return | |
1128 | value and argument types. | |
1129 | ||
1130 | The meanings of depth=2 and depth=3 are obvious by induction. | |
1131 | Varargs functions are depth=3. The type `va_list' is depth=3. | |
1132 | ||
1133 | The purpose of measuring pointer depth of a type is to determine | |
1134 | the eligibility of a function for an automatically-generated | |
1135 | bounded-pointer thunk. A depth=0 functions needs no thunk. A | |
1136 | depth=1 function is eligible for an automatic thunk. Functions | |
1137 | with depth 2 or more are too complex to get automatic thunks. | |
1138 | ||
1139 | Function decls also have a pointer_depth field, since we also | |
1140 | consider the actual argument types for functions. */ | |
1141 | ||
1142 | #define TYPE_POINTER_DEPTH(TYPE) (TYPE_CHECK (TYPE)->type.pointer_depth) | |
1143 | ||
1144 | /* In a FUNCTION_TYPE node, this bit stores the value of | |
1145 | default_pointer_boundedness at the time TYPE was created. It is | |
1146 | useful for choosing default boundedness of function arguments for | |
1147 | non-prototype function decls and for varargs/stdarg lists. */ | |
2bf105ab RK |
1148 | #define TYPE_AMBIENT_BOUNDEDNESS(TYPE) \ |
1149 | (FUNCTION_TYPE_CHECK (TYPE)->type.transparent_union_flag) | |
a6d7adfd GM |
1150 | |
1151 | #define MAX_POINTER_DEPTH 2 | |
1152 | #define VA_LIST_POINTER_DEPTH 3 | |
1153 | ||
8da1b058 RS |
1154 | struct tree_type |
1155 | { | |
2bf105ab | 1156 | struct tree_common common; |
2f78c311 ZW |
1157 | tree values; |
1158 | tree size; | |
1159 | tree size_unit; | |
1160 | tree attributes; | |
b3ddc3ab | 1161 | unsigned int uid; |
8da1b058 | 1162 | |
b3ddc3ab | 1163 | unsigned int precision : 9; |
c149cc37 | 1164 | ENUM_BITFIELD(machine_mode) mode : 7; |
bad1b4ba | 1165 | |
74a3fd26 | 1166 | unsigned string_flag : 1; |
8da1b058 | 1167 | unsigned no_force_blk_flag : 1; |
4ac3d994 | 1168 | unsigned needs_constructing_flag : 1; |
adb23061 | 1169 | unsigned transparent_union_flag : 1; |
9e357cd8 | 1170 | unsigned packed_flag : 1; |
3932261a | 1171 | unsigned restrict_flag : 1; |
a6d7adfd | 1172 | unsigned pointer_depth : 2; |
3932261a | 1173 | |
8da1b058 RS |
1174 | unsigned lang_flag_0 : 1; |
1175 | unsigned lang_flag_1 : 1; | |
1176 | unsigned lang_flag_2 : 1; | |
1177 | unsigned lang_flag_3 : 1; | |
1178 | unsigned lang_flag_4 : 1; | |
1179 | unsigned lang_flag_5 : 1; | |
1180 | unsigned lang_flag_6 : 1; | |
11cf4d18 | 1181 | unsigned user_align : 1; |
8da1b058 | 1182 | |
69b78d8d | 1183 | unsigned int align; |
2f78c311 ZW |
1184 | tree pointer_to; |
1185 | tree reference_to; | |
a0665b77 | 1186 | union {int address; char *pointer; } symtab; |
2f78c311 ZW |
1187 | tree name; |
1188 | tree minval; | |
1189 | tree maxval; | |
1190 | tree next_variant; | |
1191 | tree main_variant; | |
1192 | tree binfo; | |
2f78c311 | 1193 | tree context; |
3bdf5ad1 | 1194 | HOST_WIDE_INT alias_set; |
8da1b058 RS |
1195 | /* Points to a structure whose details depend on the language in use. */ |
1196 | struct lang_type *lang_specific; | |
1197 | }; | |
1198 | \f | |
1199 | /* Define accessor macros for information about type inheritance | |
1200 | and basetypes. | |
1201 | ||
1202 | A "basetype" means a particular usage of a data type for inheritance | |
1203 | in another type. Each such basetype usage has its own "binfo" | |
1204 | object to describe it. The binfo object is a TREE_VEC node. | |
1205 | ||
1206 | Inheritance is represented by the binfo nodes allocated for a | |
1207 | given type. For example, given types C and D, such that D is | |
1208 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
1209 | the binfo properties of C, similarly one for D, and one for | |
1210 | describing the binfo properties of D as a base type for C. | |
1211 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
1212 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
1213 | ||
1214 | /* The actual data type node being inherited in this basetype. */ | |
1215 | #define BINFO_TYPE(NODE) TREE_TYPE (NODE) | |
1216 | ||
1217 | /* The offset where this basetype appears in its containing type. | |
1218 | BINFO_OFFSET slot holds the offset (in bytes) | |
1219 | from the base of the complete object to the base of the part of the | |
1220 | object that is allocated on behalf of this `type'. | |
1221 | This is always 0 except when there is multiple inheritance. */ | |
1222 | ||
1223 | #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) | |
1224 | #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) | |
7d02bbef | 1225 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
8da1b058 RS |
1226 | |
1227 | /* The virtual function table belonging to this basetype. Virtual | |
1228 | function tables provide a mechanism for run-time method dispatching. | |
1229 | The entries of a virtual function table are language-dependent. */ | |
1230 | ||
1231 | #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) | |
1232 | #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) | |
1233 | ||
1234 | /* The virtual functions in the virtual function table. This is | |
1235 | a TREE_LIST that is used as an initial approximation for building | |
1236 | a virtual function table for this basetype. */ | |
1237 | #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) | |
1238 | #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) | |
1239 | ||
0430641b MM |
1240 | /* A vector of binfos for the direct basetypes inherited by this |
1241 | basetype. | |
8da1b058 | 1242 | |
0430641b MM |
1243 | If this basetype describes type D as inherited in C, and if the |
1244 | basetypes of D are E and F, then this vector contains binfos for | |
1245 | inheritance of E and F by C. | |
8da1b058 RS |
1246 | |
1247 | ??? This could probably be done by just allocating the | |
1248 | base types at the end of this TREE_VEC (instead of using | |
1249 | another TREE_VEC). This would simplify the calculation | |
1250 | of how many basetypes a given type had. */ | |
1251 | #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) | |
1252 | #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) | |
1253 | ||
5e1677bc MM |
1254 | /* The number of basetypes for NODE. */ |
1255 | #define BINFO_N_BASETYPES(NODE) \ | |
1256 | (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0) | |
1257 | ||
7d02bbef JM |
1258 | /* Accessor macro to get to the Nth basetype of this basetype. */ |
1259 | #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) | |
1260 | #define TYPE_BINFO_BASETYPE(NODE,N) BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) | |
1261 | ||
39ac3e4f MM |
1262 | /* For a BINFO record describing a virtual base class, i.e., one where |
1263 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
1264 | base. The actual contents are language-dependent. Under the old | |
1265 | ABI, the C++ front-end uses a FIELD_DECL whose contents are a | |
1266 | pointer to the virtual base; under the new ABI this field is | |
1267 | instead a INTEGER_CST giving an offset into the vtable where the | |
1268 | offset to the virtual base can be found. */ | |
2cc3ac7a MS |
1269 | #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT ((NODE), 5) |
1270 | ||
bbc0e641 | 1271 | /* The size of a base class subobject of this type. Not all frontends |
06ceef4e | 1272 | currently allocate the space for these fields. */ |
7d02bbef | 1273 | #define BINFO_SIZE(NODE) TREE_VEC_ELT ((NODE), 6) |
06ceef4e | 1274 | #define BINFO_SIZE_UNIT(NODE) TREE_VEC_ELT ((NODE), 7) |
7d02bbef | 1275 | #define TYPE_BINFO_SIZE(NODE) BINFO_SIZE (TYPE_BINFO (NODE)) |
06ceef4e | 1276 | #define TYPE_BINFO_SIZE_UNIT(NODE) BINFO_SIZE_UNIT (TYPE_BINFO (NODE)) |
8da1b058 RS |
1277 | |
1278 | /* Slot used to build a chain that represents a use of inheritance. | |
1279 | For example, if X is derived from Y, and Y is derived from Z, | |
1280 | then this field can be used to link the binfo node for X to | |
1281 | the binfo node for X's Y to represent the use of inheritance | |
1282 | from X to Y. Similarly, this slot of the binfo node for X's Y | |
1283 | can point to the Z from which Y is inherited (in X's inheritance | |
1284 | hierarchy). In this fashion, one can represent and traverse specific | |
1285 | uses of inheritance using the binfo nodes themselves (instead of | |
1286 | consing new space pointing to binfo nodes). | |
1287 | It is up to the language-dependent front-ends to maintain | |
1288 | this information as necessary. */ | |
1289 | #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) | |
1290 | \f | |
1291 | /* Define fields and accessors for nodes representing declared names. */ | |
1292 | ||
7766fe8e JM |
1293 | /* Nonzero if DECL represents a decl. */ |
1294 | #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') | |
8da1b058 RS |
1295 | /* This is the name of the object as written by the user. |
1296 | It is an IDENTIFIER_NODE. */ | |
12b195d9 | 1297 | #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) |
92643fea MM |
1298 | /* The name of the object as the assembler will see it (but before any |
1299 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
1300 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
1301 | #define DECL_ASSEMBLER_NAME(NODE) \ | |
1302 | ((DECL_ASSEMBLER_NAME_SET_P (NODE) \ | |
1303 | ? (void) 0 \ | |
1304 | : (*lang_set_decl_assembler_name) (NODE)), \ | |
1305 | DECL_CHECK (NODE)->decl.assembler_name) | |
1306 | /* Returns non-zero if the DECL_ASSEMBLER_NAME for NODE has been | |
1307 | set. If zero, the NODE might still have a DECL_ASSEMBLER_NAME -- | |
1308 | it just hasn't been set yet. */ | |
1309 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ | |
1310 | (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE) | |
1311 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ | |
1312 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
1313 | (DECL_CHECK (NODE)->decl.assembler_name = (NAME)) | |
1314 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if | |
1315 | DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro | |
1316 | will not cause the DECL_ASSEMBLER_NAME of either DECL to be set. | |
1317 | In other words, the semantics of using this macro, are different | |
1318 | than saying: | |
1319 | ||
1320 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) | |
1321 | ||
1322 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ | |
1323 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ | |
1324 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
1325 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ | |
1326 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
1327 | : (void) 0) | |
1328 | ||
868e8789 DE |
1329 | /* Records the section name in a section attribute. Used to pass |
1330 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
12b195d9 | 1331 | #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) |
9b800101 | 1332 | /* For FIELD_DECLs, this is the |
3635a54b RK |
1333 | RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is |
1334 | a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, | |
a082c85a JM |
1335 | and CONST_DECL nodes, this points to either the FUNCTION_DECL for the |
1336 | containing function, the RECORD_TYPE or UNION_TYPE for the containing | |
1337 | type, or NULL_TREE if the given decl has "file scope". */ | |
12b195d9 | 1338 | #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) |
770ae6cc | 1339 | #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context) |
77cf75a8 RK |
1340 | /* In a DECL this is the field where configuration dependent machine |
1341 | attributes are store */ | |
12b195d9 | 1342 | #define DECL_MACHINE_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.machine_attributes) |
770ae6cc RK |
1343 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the |
1344 | byte containing the bit closest to the beginning of the structure. */ | |
1345 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments) | |
1346 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
1347 | field from DECL_FIELD_OFFSET. */ | |
1348 | #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t) | |
8da1b058 | 1349 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and |
8e148bef RS |
1350 | if so, the type that was originally specified for it. |
1351 | TREE_TYPE may have been modified (in finish_struct). */ | |
770ae6cc | 1352 | #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result) |
8da1b058 RS |
1353 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. */ |
1354 | /* VAR_DECL and PARM_DECL reserve the arguments slot | |
1355 | for language-specific uses. */ | |
12b195d9 | 1356 | #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) |
17aec3eb RK |
1357 | /* This field is used to reference anything in decl.result and is meant only |
1358 | for use by the garbage collector. */ | |
1359 | #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result) | |
8da1b058 | 1360 | /* In FUNCTION_DECL, holds the decl for the return value. */ |
770ae6cc | 1361 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result) |
9506a28d | 1362 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
770ae6cc | 1363 | #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result) |
8da1b058 | 1364 | /* In PARM_DECL, holds the type as written (perhaps a function or array). */ |
770ae6cc | 1365 | #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result) |
8da1b058 RS |
1366 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
1367 | For a VAR_DECL, holds the initial value. | |
1368 | For a PARM_DECL, not used--default | |
1369 | values for parameters are encoded in the type of the function, | |
1370 | not in the PARM_DECL slot. */ | |
12b195d9 | 1371 | #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) |
8da1b058 RS |
1372 | /* For a PARM_DECL, records the data type used to pass the argument, |
1373 | which may be different from the type seen in the program. */ | |
770ae6cc | 1374 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial) |
3635a54b RK |
1375 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
1376 | if nonzero, indicates that the field occupies the type. */ | |
770ae6cc | 1377 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial) |
daa8df65 MM |
1378 | /* These two fields describe where in the source code the declaration |
1379 | was. If the declaration appears in several places (as for a C | |
1380 | function that is declared first and then defined later), this | |
1381 | information should refer to the definition. */ | |
12b195d9 ML |
1382 | #define DECL_SOURCE_FILE(NODE) (DECL_CHECK (NODE)->decl.filename) |
1383 | #define DECL_SOURCE_LINE(NODE) (DECL_CHECK (NODE)->decl.linenum) | |
06ceef4e | 1384 | /* Holds the size of the datum, in bits, as a tree expression. |
8da1b058 | 1385 | Need not be constant. */ |
12b195d9 | 1386 | #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) |
06ceef4e RK |
1387 | /* Likewise for the size in bytes. */ |
1388 | #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit) | |
971774bb | 1389 | /* Holds the alignment required for the datum, in bits. */ |
770ae6cc | 1390 | #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align) |
971774bb MM |
1391 | /* The alignment of NODE, in bytes. */ |
1392 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
2f5c7f45 GK |
1393 | /* For FIELD_DECLs, off_align holds the number of low-order bits of |
1394 | DECL_FIELD_OFFSET which are known to be always zero. | |
1395 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
1396 | has. */ | |
1397 | #define DECL_OFFSET_ALIGN(NODE) \ | |
1398 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align) | |
1399 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
1400 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
1401 | (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X))) | |
11cf4d18 JJ |
1402 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1403 | 0 if it is the default for this type. */ | |
1404 | #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align) | |
17c73321 RK |
1405 | /* Holds the machine mode corresponding to the declaration of a variable or |
1406 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
1407 | FIELD_DECL. */ | |
12b195d9 | 1408 | #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) |
17c73321 RK |
1409 | /* Holds the RTL expression for the value of a variable or function. If |
1410 | PROMOTED_MODE is defined, the mode of this expression may not be same | |
1411 | as DECL_MODE. In that case, DECL_MODE contains the mode corresponding | |
1412 | to the variable's data type, while the mode | |
19e7881c MM |
1413 | of DECL_RTL is the mode actually used to contain the data. |
1414 | ||
1415 | This value can be evaluated lazily for functions, variables with | |
1416 | static storage duration, and labels. */ | |
1417 | #define DECL_RTL(NODE) \ | |
1418 | (DECL_CHECK (NODE)->decl.rtl \ | |
1419 | ? (NODE)->decl.rtl \ | |
1420 | : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl)) | |
1421 | /* Set the DECL_RTL for NODE to RTL. */ | |
1422 | #define SET_DECL_RTL(NODE, RTL) \ | |
1423 | (DECL_CHECK (NODE)->decl.rtl = (RTL)) | |
1424 | /* Returns non-zero if the DECL_RTL for NODE has already been set. */ | |
1425 | #define DECL_RTL_SET_P(NODE) \ | |
1426 | (DECL_CHECK (NODE)->decl.rtl != NULL) | |
1427 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for | |
1428 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
1429 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
1430 | (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl) | |
1431 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
1432 | #define DECL_RTL_IF_SET(NODE) \ | |
1433 | (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) | |
0dfa1860 MM |
1434 | /* Holds an INSN_LIST of all of the live ranges in which the variable |
1435 | has been moved to a possibly different register. */ | |
12b195d9 | 1436 | #define DECL_LIVE_RANGE_RTL(NODE) (DECL_CHECK (NODE)->decl.live_range_rtl) |
8da1b058 RS |
1437 | /* For PARM_DECL, holds an RTL for the stack slot or register |
1438 | where the data was actually passed. */ | |
770ae6cc | 1439 | #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r) |
8da1b058 | 1440 | /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */ |
770ae6cc | 1441 | #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f) |
66321686 RS |
1442 | /* For FUNCTION_DECL, if it is built-in, |
1443 | this identifies which built-in operation it is. */ | |
770ae6cc | 1444 | #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f) |
8da1b058 RS |
1445 | |
1446 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
1447 | Before the struct containing the FUNCTION_DECL is laid out, | |
1448 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
1449 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
1450 | function. When the class is laid out, this pointer is changed | |
1451 | to an INTEGER_CST node which is suitable for use as an index | |
1452 | into the virtual function table. */ | |
12b195d9 | 1453 | #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) |
8da1b058 RS |
1454 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in |
1455 | which this FIELD_DECL is defined. This information is needed when | |
1456 | writing debugging information about vfield and vbase decls for C++. */ | |
770ae6cc | 1457 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex) |
8da1b058 | 1458 | |
0e77444b | 1459 | /* Every ..._DECL node gets a unique number. */ |
12b195d9 | 1460 | #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) |
0e77444b | 1461 | |
c5caa350 CH |
1462 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
1463 | decl node which this decl is an instance of, or else it is NULL indicating | |
4a7d05dc DE |
1464 | that this decl is not an instance of some other decl. For example, |
1465 | in a nested declaration of an inline function, this points back to the | |
1466 | definition. */ | |
12b195d9 | 1467 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) |
c5caa350 | 1468 | |
02e24c7a MM |
1469 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract |
1470 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
1471 | #define DECL_ORIGIN(NODE) \ | |
1472 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : NODE) | |
1473 | ||
f93dacbd RK |
1474 | /* Nonzero for any sort of ..._DECL node means this decl node represents an |
1475 | inline instance of some original (abstract) decl from an inline function; | |
1476 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
1477 | nodes can also have their abstract origin set to themselves. */ | |
3d62d651 ZW |
1478 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != (tree) 0 \ |
1479 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) | |
8da1b058 RS |
1480 | |
1481 | /* Nonzero if a _DECL means that the name of this decl should be ignored | |
1482 | for symbolic debug purposes. */ | |
12b195d9 | 1483 | #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) |
8da1b058 | 1484 | |
c5caa350 CH |
1485 | /* Nonzero for a given ..._DECL node means that this node represents an |
1486 | "abstract instance" of the given declaration (e.g. in the original | |
1487 | declaration of an inline function). When generating symbolic debugging | |
9faa82d8 | 1488 | information, we mustn't try to generate any address information for nodes |
c5caa350 CH |
1489 | marked as "abstract instances" because we don't actually generate |
1490 | any code or allocate any data space for such instances. */ | |
12b195d9 | 1491 | #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) |
c5caa350 | 1492 | |
3110a56e RS |
1493 | /* Nonzero if a _DECL means that no warnings should be generated just |
1494 | because this decl is unused. */ | |
12b195d9 | 1495 | #define DECL_IN_SYSTEM_HEADER(NODE) (DECL_CHECK (NODE)->decl.in_system_header_flag) |
3110a56e | 1496 | |
2c0d84d6 MS |
1497 | /* Nonzero for a given ..._DECL node means that this node should be |
1498 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
1499 | is not error_mark_node, then the decl cannot be put in .common. */ | |
12b195d9 | 1500 | #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) |
2c0d84d6 | 1501 | |
3110a56e | 1502 | /* Language-specific decl information. */ |
12b195d9 | 1503 | #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) |
8da1b058 RS |
1504 | |
1505 | /* In a VAR_DECL or FUNCTION_DECL, | |
1506 | nonzero means external reference: | |
1507 | do not allocate storage, and refer to a definition elsewhere. */ | |
12b195d9 | 1508 | #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) |
8da1b058 | 1509 | |
2ce3c6c6 JM |
1510 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
1511 | initializatons. */ | |
1512 | #define DEFAULT_INIT_PRIORITY 65535 | |
1513 | #define MAX_INIT_PRIORITY 65535 | |
9a6e70c9 | 1514 | #define MAX_RESERVED_INIT_PRIORITY 100 |
2ce3c6c6 | 1515 | |
60e9e4b7 DE |
1516 | /* In a TYPE_DECL |
1517 | nonzero means the detail info about this type is not dumped into stabs. | |
5a783256 | 1518 | Instead it will generate cross reference ('x') of names. |
60e9e4b7 | 1519 | This uses the same flag as DECL_EXTERNAL. */ |
770ae6cc RK |
1520 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ |
1521 | (TYPE_DECL_CHECK (NODE)->decl.external_flag) | |
60e9e4b7 | 1522 | |
a5f99f01 | 1523 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
12b195d9 | 1524 | #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
a5f99f01 RK |
1525 | /* In LABEL_DECL nodes, nonzero means that an error message about |
1526 | jumping into such a binding contour has been printed for this label. */ | |
770ae6cc | 1527 | #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag) |
5a1c7968 | 1528 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
770ae6cc | 1529 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag) |
a5f99f01 RK |
1530 | /* In a FUNCTION_DECL with a non-zero DECL_CONTEXT, indicates that a |
1531 | static chain is not needed. */ | |
770ae6cc RK |
1532 | #define DECL_NO_STATIC_CHAIN(NODE) \ |
1533 | (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag) | |
8da1b058 RS |
1534 | |
1535 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
1536 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
1537 | ||
1538 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
1539 | ||
1540 | Also set in some languages for variables, etc., outside the normal | |
1541 | lexical scope, such as class instance variables. */ | |
12b195d9 | 1542 | #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) |
8da1b058 RS |
1543 | |
1544 | /* Nonzero in a FUNCTION_DECL means this function can be substituted | |
1545 | where it is called. */ | |
770ae6cc | 1546 | #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag) |
8da1b058 | 1547 | |
5daf7c0a JM |
1548 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ |
1549 | #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable) | |
1550 | ||
8da1b058 RS |
1551 | /* Nonzero in a FUNCTION_DECL means this is a built-in function |
1552 | that is not specified by ansi C and that users are supposed to be allowed | |
1553 | to redefine for any purpose whatever. */ | |
770ae6cc RK |
1554 | #define DECL_BUILT_IN_NONANSI(NODE) \ |
1555 | (FUNCTION_DECL_CHECK (NODE)->common.unsigned_flag) | |
8da1b058 | 1556 | |
140592a0 AG |
1557 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
1558 | as if it were a malloc, meaning it returns a pointer that is | |
1559 | not an alias. */ | |
770ae6cc | 1560 | #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag) |
140592a0 | 1561 | |
2a8f6b90 JH |
1562 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
1563 | as "pure" function (like const function, but may read global memory). */ | |
1564 | #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag) | |
1565 | ||
8da1b058 RS |
1566 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
1567 | specially. */ | |
770ae6cc | 1568 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag) |
8da1b058 RS |
1569 | /* In a LABEL_DECL, nonzero means label was defined inside a binding |
1570 | contour that restored a stack level and which is now exited. */ | |
770ae6cc | 1571 | #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag) |
26db82d8 | 1572 | |
12a22e76 | 1573 | /* Unused in FUNCTION_DECL. */ |
26db82d8 | 1574 | |
b8af45d0 RS |
1575 | /* In a VAR_DECL that's static, |
1576 | nonzero if the space is in the text section. */ | |
770ae6cc | 1577 | #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag) |
8da1b058 | 1578 | |
12a22e76 JM |
1579 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
1580 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
1581 | /* For a builtin function, identify which part of the compiler defined it. */ | |
770ae6cc RK |
1582 | #define DECL_BUILT_IN_CLASS(NODE) \ |
1583 | (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class) | |
12a22e76 | 1584 | |
5a1c7968 | 1585 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2458b9c0 JM |
1586 | Used in FIELD_DECLs for vtable pointers. |
1587 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
12b195d9 | 1588 | #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) |
8da1b058 | 1589 | |
30801830 JM |
1590 | /* Used to indicate that the linkage status of this DECL is not yet known, |
1591 | so it should not be output now. */ | |
12b195d9 | 1592 | #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) |
30801830 | 1593 | |
adb23061 RK |
1594 | /* Used in PARM_DECLs whose type are unions to indicate that the |
1595 | argument should be passed in the same way that the first union | |
1596 | alternative would be passed. */ | |
770ae6cc RK |
1597 | #define DECL_TRANSPARENT_UNION(NODE) \ |
1598 | (PARM_DECL_CHECK (NODE)->decl.transparent_union) | |
adb23061 | 1599 | |
2c5f4139 JM |
1600 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically |
1601 | at the beginning or end of execution. */ | |
770ae6cc RK |
1602 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ |
1603 | (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag) | |
1604 | ||
1605 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
1606 | (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag) | |
2c5f4139 | 1607 | |
3edbc4b9 | 1608 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
12b195d9 | 1609 | #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) |
3edbc4b9 | 1610 | |
daefd78b | 1611 | /* Used to indicate that this DECL has weak linkage. */ |
12b195d9 | 1612 | #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) |
daefd78b | 1613 | |
c5bd82cb JM |
1614 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in |
1615 | multiple translation units should be merged. */ | |
12b195d9 | 1616 | #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) |
c5bd82cb | 1617 | |
59182242 MM |
1618 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
1619 | not be put out unless it is needed in this translation unit. | |
1620 | Entities like this are shared across translation units (like weak | |
1621 | entities), but are guaranteed to be generated by any translation | |
1622 | unit that needs them, and therefore need not be put out anywhere | |
1623 | where they are not needed. DECL_COMDAT is just a hint to the | |
1624 | back-end; it is up to front-ends which set this flag to ensure | |
1625 | that there will never be any harm, other than bloat, in putting out | |
1626 | something which is DECL_COMDAT. */ | |
1627 | #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) | |
1628 | ||
07417085 KR |
1629 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should |
1630 | be instrumented with calls to support routines. */ | |
770ae6cc RK |
1631 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ |
1632 | (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit) | |
07417085 | 1633 | |
c5c76735 JL |
1634 | /* Used in FUNCTION_DECLs to indicate that check-memory-usage should be |
1635 | disabled in this function. */ | |
770ae6cc RK |
1636 | #define DECL_NO_CHECK_MEMORY_USAGE(NODE) \ |
1637 | (FUNCTION_DECL_CHECK (NODE)->decl.no_check_memory_usage) | |
7d384cc0 | 1638 | |
a157febd GK |
1639 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be |
1640 | disabled in this function. */ | |
770ae6cc RK |
1641 | #define DECL_NO_LIMIT_STACK(NODE) \ |
1642 | (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack) | |
a157febd | 1643 | |
8da1b058 | 1644 | /* Additional flags for language-specific uses. */ |
12b195d9 ML |
1645 | #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) |
1646 | #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) | |
1647 | #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) | |
1648 | #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) | |
1649 | #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) | |
1650 | #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) | |
1651 | #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) | |
1652 | #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) | |
8da1b058 | 1653 | |
27da1b4d MK |
1654 | /* Used to indicate that the pointer to this DECL cannot be treated as |
1655 | an address constant. */ | |
1656 | #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) | |
1657 | ||
2bf105ab RK |
1658 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
1659 | this component. */ | |
1660 | #define DECL_NONADDRESSABLE_P(NODE) \ | |
1661 | (FIELD_DECL_CHECK (NODE)->decl.non_addressable) | |
1662 | ||
3932261a MM |
1663 | /* Used to indicate an alias set for the memory pointed to by this |
1664 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
1665 | pointer (or reference) type. */ | |
1666 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
1667 | (DECL_CHECK (NODE)->decl.pointer_alias_set) | |
1668 | ||
1669 | /* Nonzero if an alias set has been assigned to this declaration. */ | |
1670 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
1671 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
1672 | ||
a6d7adfd GM |
1673 | /* The pointer_depth field comprises two bits for values in the range |
1674 | 0..3. The value is normally equal to TYPE_POINTER_DEPTH of decl's | |
1675 | type node, but for functions it migth be greater. For example, | |
1676 | this can happen when the function is declared to accept a parameter | |
1677 | of type void* (depth=1), but is actually called with an argument of | |
1678 | type foo** (depth=2). The function type will get the formal | |
1679 | parameter's depth, but the function decl will get the actual | |
1680 | argument's depth. */ | |
1681 | #define DECL_POINTER_DEPTH(DECL) (DECL_CHECK (DECL)->decl.pointer_depth) | |
1682 | ||
eb3ae3e1 ZW |
1683 | struct function; |
1684 | ||
8da1b058 RS |
1685 | struct tree_decl |
1686 | { | |
2bf105ab | 1687 | struct tree_common common; |
3b304f5b | 1688 | const char *filename; |
8da1b058 | 1689 | int linenum; |
0e77444b | 1690 | unsigned int uid; |
2f78c311 | 1691 | tree size; |
e60a8c26 | 1692 | ENUM_BITFIELD(machine_mode) mode : 8; |
8da1b058 RS |
1693 | |
1694 | unsigned external_flag : 1; | |
1695 | unsigned nonlocal_flag : 1; | |
1696 | unsigned regdecl_flag : 1; | |
1697 | unsigned inline_flag : 1; | |
1698 | unsigned bit_field_flag : 1; | |
1699 | unsigned virtual_flag : 1; | |
8da1b058 | 1700 | unsigned ignored_flag : 1; |
c5caa350 | 1701 | unsigned abstract_flag : 1; |
8da1b058 | 1702 | |
3110a56e | 1703 | unsigned in_system_header_flag : 1; |
2c0d84d6 | 1704 | unsigned common_flag : 1; |
30801830 | 1705 | unsigned defer_output : 1; |
adb23061 | 1706 | unsigned transparent_union : 1; |
2c5f4139 JM |
1707 | unsigned static_ctor_flag : 1; |
1708 | unsigned static_dtor_flag : 1; | |
3edbc4b9 | 1709 | unsigned artificial_flag : 1; |
daefd78b | 1710 | unsigned weak_flag : 1; |
3110a56e | 1711 | |
9df2c88c RK |
1712 | unsigned non_addr_const_p : 1; |
1713 | unsigned no_instrument_function_entry_exit : 1; | |
1714 | unsigned no_check_memory_usage : 1; | |
1715 | unsigned comdat_flag : 1; | |
1716 | unsigned malloc_flag : 1; | |
1717 | unsigned no_limit_stack : 1; | |
c149cc37 | 1718 | ENUM_BITFIELD(built_in_class) built_in_class : 2; |
2bf105ab RK |
1719 | |
1720 | unsigned pure_flag : 1; | |
a6d7adfd | 1721 | unsigned pointer_depth : 2; |
2bf105ab | 1722 | unsigned non_addressable : 1; |
11cf4d18 | 1723 | unsigned user_align : 1; |
5daf7c0a JM |
1724 | unsigned uninlinable : 1; |
1725 | /* Two unused bits. */ | |
9df2c88c | 1726 | |
8da1b058 RS |
1727 | unsigned lang_flag_0 : 1; |
1728 | unsigned lang_flag_1 : 1; | |
1729 | unsigned lang_flag_2 : 1; | |
1730 | unsigned lang_flag_3 : 1; | |
1731 | unsigned lang_flag_4 : 1; | |
1732 | unsigned lang_flag_5 : 1; | |
1733 | unsigned lang_flag_6 : 1; | |
1734 | unsigned lang_flag_7 : 1; | |
1735 | ||
09f532c9 | 1736 | union { |
b850de4f MM |
1737 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is |
1738 | DECL_FUNCTION_CODE. */ | |
9df2c88c | 1739 | enum built_in_function f; |
b850de4f MM |
1740 | /* In a FUNCITON_DECL for which DECL_BUILT_IN does not hold, this |
1741 | is used by language-dependent code. */ | |
1742 | HOST_WIDE_INT i; | |
1743 | /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for | |
1744 | FUNCTION_DECLs). */ | |
770ae6cc | 1745 | struct {unsigned int align : 24; unsigned int off_align : 8;} a; |
9df2c88c | 1746 | } u1; |
09f532c9 | 1747 | |
2f78c311 ZW |
1748 | tree size_unit; |
1749 | tree name; | |
1750 | tree context; | |
1751 | tree arguments; /* Also used for DECL_FIELD_OFFSET */ | |
1752 | tree result; /* Also used for DECL_BIT_FIELD_TYPE */ | |
1753 | tree initial; /* Also used for DECL_QUALIFIER */ | |
1754 | tree abstract_origin; | |
1755 | tree assembler_name; | |
1756 | tree section_name; | |
1757 | tree machine_attributes; | |
1758 | rtx rtl; /* RTL representation for object. */ | |
1759 | rtx live_range_rtl; | |
06ceef4e | 1760 | |
9df2c88c | 1761 | /* In FUNCTION_DECL, if it is inline, holds the saved insn chain. |
770ae6cc | 1762 | In FIELD_DECL, is DECL_FIELD_BIT_OFFSET. |
9df2c88c RK |
1763 | In PARM_DECL, holds an RTL for the stack slot |
1764 | of register where the data was actually passed. | |
1765 | Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */ | |
77f934bb | 1766 | union { |
49ad7cfa | 1767 | struct function *f; |
2f78c311 ZW |
1768 | rtx r; |
1769 | tree t; | |
9df2c88c RK |
1770 | int i; |
1771 | } u2; | |
1772 | ||
2f78c311 | 1773 | tree vindex; |
3bdf5ad1 | 1774 | HOST_WIDE_INT pointer_alias_set; |
8da1b058 RS |
1775 | /* Points to a structure whose details depend on the language in use. */ |
1776 | struct lang_decl *lang_specific; | |
1777 | }; | |
1778 | \f | |
1779 | /* Define the overall contents of a tree node. | |
1780 | It may be any of the structures declared above | |
1781 | for various types of node. */ | |
1782 | ||
1783 | union tree_node | |
1784 | { | |
1785 | struct tree_common common; | |
1786 | struct tree_int_cst int_cst; | |
1787 | struct tree_real_cst real_cst; | |
1788 | struct tree_string string; | |
1789 | struct tree_complex complex; | |
1790 | struct tree_identifier identifier; | |
1791 | struct tree_decl decl; | |
1792 | struct tree_type type; | |
1793 | struct tree_list list; | |
1794 | struct tree_vec vec; | |
1795 | struct tree_exp exp; | |
61131fa2 | 1796 | struct tree_block block; |
8da1b058 | 1797 | }; |
1d2a8985 | 1798 | \f |
81b3411c BS |
1799 | /* Standard named or nameless data types of the C compiler. */ |
1800 | ||
1801 | enum tree_index | |
1802 | { | |
1803 | TI_ERROR_MARK, | |
1804 | TI_INTQI_TYPE, | |
1805 | TI_INTHI_TYPE, | |
1806 | TI_INTSI_TYPE, | |
1807 | TI_INTDI_TYPE, | |
1808 | TI_INTTI_TYPE, | |
1809 | ||
1810 | TI_UINTQI_TYPE, | |
1811 | TI_UINTHI_TYPE, | |
1812 | TI_UINTSI_TYPE, | |
1813 | TI_UINTDI_TYPE, | |
1814 | TI_UINTTI_TYPE, | |
1815 | ||
81b3411c BS |
1816 | TI_INTEGER_ZERO, |
1817 | TI_INTEGER_ONE, | |
f2d1f0ba | 1818 | TI_INTEGER_MINUS_ONE, |
81b3411c BS |
1819 | TI_NULL_POINTER, |
1820 | ||
1821 | TI_SIZE_ZERO, | |
1822 | TI_SIZE_ONE, | |
770ae6cc RK |
1823 | |
1824 | TI_BITSIZE_ZERO, | |
1825 | TI_BITSIZE_ONE, | |
1826 | TI_BITSIZE_UNIT, | |
1827 | ||
81b3411c BS |
1828 | TI_COMPLEX_INTEGER_TYPE, |
1829 | TI_COMPLEX_FLOAT_TYPE, | |
1830 | TI_COMPLEX_DOUBLE_TYPE, | |
1831 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
1832 | ||
1833 | TI_FLOAT_TYPE, | |
1834 | TI_DOUBLE_TYPE, | |
1835 | TI_LONG_DOUBLE_TYPE, | |
1836 | ||
1837 | TI_VOID_TYPE, | |
1838 | TI_PTR_TYPE, | |
1839 | TI_CONST_PTR_TYPE, | |
1840 | TI_PTRDIFF_TYPE, | |
1841 | TI_VA_LIST_TYPE, | |
1842 | ||
cbd5937a MM |
1843 | TI_VOID_LIST_NODE, |
1844 | ||
4061f623 BS |
1845 | TI_V4SF_TYPE, |
1846 | TI_V4SI_TYPE, | |
1847 | TI_V8QI_TYPE, | |
1848 | TI_V4HI_TYPE, | |
1849 | TI_V2SI_TYPE, | |
1850 | ||
5b47282c GM |
1851 | TI_MAIN_IDENTIFIER, |
1852 | ||
81b3411c BS |
1853 | TI_MAX |
1854 | }; | |
1855 | ||
1856 | extern tree global_trees[TI_MAX]; | |
1857 | ||
1858 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
1859 | ||
1860 | #define intQI_type_node global_trees[TI_INTQI_TYPE] | |
1861 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
1862 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
1863 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
1864 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
1865 | ||
1866 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
1867 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
1868 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
1869 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
1870 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
1871 | ||
81b3411c BS |
1872 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
1873 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
f2d1f0ba | 1874 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
81b3411c BS |
1875 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
1876 | #define size_one_node global_trees[TI_SIZE_ONE] | |
770ae6cc RK |
1877 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
1878 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
1879 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
1880 | ||
81b3411c BS |
1881 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
1882 | ||
1883 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
1884 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
1885 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
1886 | ||
1887 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] | |
1888 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
1889 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
1890 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
1891 | ||
1892 | #define void_type_node global_trees[TI_VOID_TYPE] | |
fc693822 | 1893 | /* The C type `void *'. */ |
81b3411c | 1894 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
fc693822 | 1895 | /* The C type `const void *'. */ |
81b3411c BS |
1896 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
1897 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] | |
1898 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
7145ef21 | 1899 | |
cbd5937a MM |
1900 | /* The node that should be placed at the end of a parameter list to |
1901 | indicate that the function does not take a variable number of | |
1902 | arguments. The TREE_VALUE will be void_type_node and there will be | |
1903 | no TREE_CHAIN. Language-independent code should not assume | |
1904 | anything else about this node. */ | |
1905 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
1906 | ||
5b47282c GM |
1907 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
1908 | #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
1909 | ||
4061f623 BS |
1910 | #define V4SF_type_node global_trees[TI_V4SF_TYPE] |
1911 | #define V4SI_type_node global_trees[TI_V4SI_TYPE] | |
1912 | #define V8QI_type_node global_trees[TI_V8QI_TYPE] | |
1913 | #define V4HI_type_node global_trees[TI_V4HI_TYPE] | |
1914 | #define V2SI_type_node global_trees[TI_V2SI_TYPE] | |
1915 | ||
7145ef21 MM |
1916 | /* An enumeration of the standard C integer types. These must be |
1917 | ordered so that shorter types appear before longer ones. */ | |
1918 | enum integer_type_kind | |
1919 | { | |
1920 | itk_char, | |
1921 | itk_signed_char, | |
1922 | itk_unsigned_char, | |
1923 | itk_short, | |
1924 | itk_unsigned_short, | |
1925 | itk_int, | |
1926 | itk_unsigned_int, | |
1927 | itk_long, | |
1928 | itk_unsigned_long, | |
1929 | itk_long_long, | |
1930 | itk_unsigned_long_long, | |
1931 | itk_none | |
1932 | }; | |
1933 | ||
1934 | typedef enum integer_type_kind integer_type_kind; | |
1935 | ||
1936 | /* The standard C integer types. Use integer_type_kind to index into | |
1937 | this array. */ | |
1938 | extern tree integer_types[itk_none]; | |
1939 | ||
1940 | #define char_type_node integer_types[itk_char] | |
1941 | #define signed_char_type_node integer_types[itk_signed_char] | |
1942 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
1943 | #define short_integer_type_node integer_types[itk_short] | |
1944 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
1945 | #define integer_type_node integer_types[itk_int] | |
1946 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
1947 | #define long_integer_type_node integer_types[itk_long] | |
1948 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
1949 | #define long_long_integer_type_node integer_types[itk_long_long] | |
1950 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
1951 | ||
81b3411c | 1952 | \f |
f837a861 MM |
1953 | #define NULL_TREE (tree) NULL |
1954 | ||
520a57c8 ZW |
1955 | /* Approximate positive square root of a host double. This is for |
1956 | statistical reports, not code generation. */ | |
1957 | extern double approx_sqrt PARAMS ((double)); | |
1958 | ||
58782098 | 1959 | extern char *permalloc PARAMS ((int)); |
58782098 | 1960 | extern char *expralloc PARAMS ((int)); |
8da1b058 | 1961 | |
c5620996 GK |
1962 | /* Compute the number of bytes occupied by 'node'. This routine only |
1963 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
1964 | ||
1965 | extern size_t tree_size PARAMS ((tree)); | |
1966 | ||
8da1b058 RS |
1967 | /* Lowest level primitive for allocating a node. |
1968 | The TREE_CODE is the only argument. Contents are initialized | |
1969 | to zero except for a few of the common fields. */ | |
1970 | ||
58782098 KG |
1971 | extern tree make_node PARAMS ((enum tree_code)); |
1972 | extern tree make_lang_type PARAMS ((enum tree_code)); | |
1973 | extern tree (*make_lang_type_fn) PARAMS ((enum tree_code)); | |
8da1b058 RS |
1974 | |
1975 | /* Make a copy of a node, with all the same contents except | |
1976 | for TREE_PERMANENT. (The copy is permanent | |
1977 | iff nodes being made now are permanent.) */ | |
1978 | ||
58782098 | 1979 | extern tree copy_node PARAMS ((tree)); |
8da1b058 RS |
1980 | |
1981 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
1982 | ||
58782098 | 1983 | extern tree copy_list PARAMS ((tree)); |
8da1b058 RS |
1984 | |
1985 | /* Make a TREE_VEC. */ | |
1986 | ||
58782098 | 1987 | extern tree make_tree_vec PARAMS ((int)); |
8da1b058 RS |
1988 | |
1989 | /* Return the (unique) IDENTIFIER_NODE node for a given name. | |
1990 | The name is supplied as a char *. */ | |
1991 | ||
58782098 | 1992 | extern tree get_identifier PARAMS ((const char *)); |
8da1b058 | 1993 | |
6b9300aa RK |
1994 | /* If an identifier with the name TEXT (a null-terminated string) has |
1995 | previously been referred to, return that node; otherwise return | |
1996 | NULL_TREE. */ | |
1997 | ||
58782098 | 1998 | extern tree maybe_get_identifier PARAMS ((const char *)); |
6b9300aa | 1999 | |
8da1b058 RS |
2000 | /* Construct various types of nodes. */ |
2001 | ||
e5d70561 | 2002 | #define build_int_2(LO,HI) \ |
f9e158c3 | 2003 | build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) |
e5d70561 | 2004 | |
58782098 KG |
2005 | extern tree build PARAMS ((enum tree_code, tree, ...)); |
2006 | extern tree build_nt PARAMS ((enum tree_code, ...)); | |
58782098 | 2007 | |
f9e158c3 | 2008 | extern tree build_int_2_wide PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT)); |
58782098 KG |
2009 | extern tree build_real PARAMS ((tree, REAL_VALUE_TYPE)); |
2010 | extern tree build_real_from_int_cst PARAMS ((tree, tree)); | |
2011 | extern tree build_complex PARAMS ((tree, tree, tree)); | |
2012 | extern tree build_string PARAMS ((int, const char *)); | |
2013 | extern tree build1 PARAMS ((enum tree_code, tree, tree)); | |
2014 | extern tree build_tree_list PARAMS ((tree, tree)); | |
58782098 KG |
2015 | extern tree build_decl PARAMS ((enum tree_code, tree, tree)); |
2016 | extern tree build_block PARAMS ((tree, tree, tree, tree, tree)); | |
2017 | extern tree build_expr_wfl PARAMS ((tree, const char *, int, int)); | |
8da1b058 RS |
2018 | |
2019 | /* Construct various nodes representing data types. */ | |
2020 | ||
58782098 KG |
2021 | extern tree make_signed_type PARAMS ((int)); |
2022 | extern tree make_unsigned_type PARAMS ((int)); | |
fed3cef0 | 2023 | extern void initialize_sizetypes PARAMS ((void)); |
58782098 KG |
2024 | extern void set_sizetype PARAMS ((tree)); |
2025 | extern tree signed_or_unsigned_type PARAMS ((int, tree)); | |
2026 | extern void fixup_unsigned_type PARAMS ((tree)); | |
2027 | extern tree build_pointer_type PARAMS ((tree)); | |
2028 | extern tree build_reference_type PARAMS ((tree)); | |
12e1243e | 2029 | extern tree build_type_no_quals PARAMS ((tree)); |
58782098 KG |
2030 | extern tree build_index_type PARAMS ((tree)); |
2031 | extern tree build_index_2_type PARAMS ((tree, tree)); | |
2032 | extern tree build_array_type PARAMS ((tree, tree)); | |
2033 | extern tree build_function_type PARAMS ((tree, tree)); | |
2034 | extern tree build_method_type PARAMS ((tree, tree)); | |
2035 | extern tree build_offset_type PARAMS ((tree, tree)); | |
2036 | extern tree build_complex_type PARAMS ((tree)); | |
2037 | extern tree array_type_nelts PARAMS ((tree)); | |
2038 | ||
2039 | extern tree value_member PARAMS ((tree, tree)); | |
2040 | extern tree purpose_member PARAMS ((tree, tree)); | |
2041 | extern tree binfo_member PARAMS ((tree, tree)); | |
05bccae2 | 2042 | extern unsigned int attribute_hash_list PARAMS ((tree)); |
58782098 KG |
2043 | extern int attribute_list_equal PARAMS ((tree, tree)); |
2044 | extern int attribute_list_contained PARAMS ((tree, tree)); | |
2045 | extern int tree_int_cst_equal PARAMS ((tree, tree)); | |
2046 | extern int tree_int_cst_lt PARAMS ((tree, tree)); | |
56cb9733 | 2047 | extern int tree_int_cst_compare PARAMS ((tree, tree)); |
665f2503 RK |
2048 | extern int host_integerp PARAMS ((tree, int)); |
2049 | extern HOST_WIDE_INT tree_low_cst PARAMS ((tree, int)); | |
a49a6a68 | 2050 | extern int tree_int_cst_msb PARAMS ((tree)); |
58782098 | 2051 | extern int tree_int_cst_sgn PARAMS ((tree)); |
a36556a8 | 2052 | extern int tree_expr_nonnegative_p PARAMS ((tree)); |
2f78c311 | 2053 | extern int rtl_expr_nonnegative_p PARAMS ((rtx)); |
58782098 KG |
2054 | extern int index_type_equal PARAMS ((tree, tree)); |
2055 | extern tree get_inner_array_type PARAMS ((tree)); | |
12cfc830 | 2056 | |
f837a861 MM |
2057 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
2058 | put the prototype here. Rtl.h does declare the prototype if | |
2059 | tree.h had been included. */ | |
2060 | ||
2f78c311 | 2061 | extern tree make_tree PARAMS ((tree, rtx)); |
8da1b058 | 2062 | \f |
bad1b4ba RK |
2063 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
2064 | is ATTRIBUTE. | |
2065 | ||
2066 | Such modified types already made are recorded so that duplicates | |
2067 | are not made. */ | |
2068 | ||
58782098 KG |
2069 | extern tree build_type_attribute_variant PARAMS ((tree, tree)); |
2070 | extern tree build_decl_attribute_variant PARAMS ((tree, tree)); | |
bad1b4ba | 2071 | |
501990bb NB |
2072 | /* Default versions of target-overridable functions. */ |
2073 | ||
672a6f42 NB |
2074 | extern tree merge_decl_attributes PARAMS ((tree, tree)); |
2075 | extern tree merge_type_attributes PARAMS ((tree, tree)); | |
501990bb | 2076 | extern int default_valid_attribute_p PARAMS ((tree, tree, tree, tree)); |
8d8e52be JM |
2077 | extern int default_comp_type_attributes PARAMS ((tree, tree)); |
2078 | extern void default_set_default_type_attributes PARAMS ((tree)); | |
12a68f1f | 2079 | extern void default_insert_attributes PARAMS ((tree, tree *)); |
d9525bec BK |
2080 | |
2081 | /* Split a list of declspecs and attributes into two. */ | |
2082 | ||
58782098 | 2083 | extern void split_specs_attrs PARAMS ((tree, tree *, tree *)); |
d9525bec BK |
2084 | |
2085 | /* Strip attributes from a list of combined specs and attrs. */ | |
2086 | ||
58782098 | 2087 | extern tree strip_attrs PARAMS ((tree)); |
d9525bec | 2088 | |
9c130398 DE |
2089 | /* Return 1 if an attribute and its arguments are valid for a decl or type. */ |
2090 | ||
58782098 | 2091 | extern int valid_machine_attribute PARAMS ((tree, tree, tree, tree)); |
9c130398 DE |
2092 | |
2093 | /* Given a tree node and a string, return non-zero if the tree node is | |
2094 | a valid attribute name for the string. */ | |
2095 | ||
58782098 | 2096 | extern int is_attribute_p PARAMS ((const char *, tree)); |
9c130398 DE |
2097 | |
2098 | /* Given an attribute name and a list of attributes, return the list element | |
2099 | of the attribute or NULL_TREE if not found. */ | |
2100 | ||
58782098 | 2101 | extern tree lookup_attribute PARAMS ((const char *, tree)); |
6cb3d314 DE |
2102 | |
2103 | /* Given two attributes lists, return a list of their union. */ | |
2104 | ||
58782098 | 2105 | extern tree merge_attributes PARAMS ((tree, tree)); |
9c130398 | 2106 | |
672a6f42 NB |
2107 | #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES |
2108 | /* Given two Windows decl attributes lists, possibly including | |
2109 | dllimport, return a list of their union . */ | |
2110 | extern tree merge_dllimport_decl_attributes PARAMS ((tree, tree)); | |
2111 | #endif | |
2112 | ||
5101b304 MM |
2113 | /* Return a version of the TYPE, qualified as indicated by the |
2114 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
2115 | return NULL_TREE. */ | |
2116 | ||
2117 | extern tree get_qualified_type PARAMS ((tree, int)); | |
2118 | ||
2119 | /* Like get_qualified_type, but creates the type if it does not | |
2120 | exist. This function never returns NULL_TREE. */ | |
3932261a | 2121 | |
58782098 | 2122 | extern tree build_qualified_type PARAMS ((tree, int)); |
3932261a MM |
2123 | |
2124 | /* Like build_qualified_type, but only deals with the `const' and | |
2125 | `volatile' qualifiers. This interface is retained for backwards | |
2126 | compatiblity with the various front-ends; new code should use | |
2127 | build_qualified_type instead. */ | |
8da1b058 | 2128 | |
3932261a MM |
2129 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
2130 | build_qualified_type (TYPE, \ | |
2131 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ | |
2132 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
8da1b058 | 2133 | |
43100b14 RS |
2134 | /* Make a copy of a type node. */ |
2135 | ||
58782098 | 2136 | extern tree build_type_copy PARAMS ((tree)); |
43100b14 | 2137 | |
8da1b058 | 2138 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
9328904c MM |
2139 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
2140 | node, does nothing except for the first time. */ | |
8da1b058 | 2141 | |
58782098 | 2142 | extern void layout_type PARAMS ((tree)); |
8da1b058 | 2143 | |
9328904c MM |
2144 | /* These functions allow a front-end to perform a manual layout of a |
2145 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
2146 | depends on the placement of fields so far.) Begin by calling | |
770ae6cc | 2147 | start_record_layout. Then, call place_field for each of the |
9328904c MM |
2148 | fields. Then, call finish_record_layout. See layout_type for the |
2149 | default way in which these functions are used. */ | |
2150 | ||
defd0dea | 2151 | typedef struct record_layout_info_s |
9328904c MM |
2152 | { |
2153 | /* The RECORD_TYPE that we are laying out. */ | |
2154 | tree t; | |
770ae6cc RK |
2155 | /* The offset into the record so far, in bytes, not including bits in |
2156 | BITPOS. */ | |
2157 | tree offset; | |
2158 | /* The last known alignment of SIZE. */ | |
2159 | unsigned int offset_align; | |
2160 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
2161 | tree bitpos; | |
9328904c MM |
2162 | /* The alignment of the record so far, in bits. */ |
2163 | unsigned int record_align; | |
770ae6cc RK |
2164 | /* The alignment of the record so far, not including padding, in bits. */ |
2165 | unsigned int unpacked_align; | |
e0cea8d9 RK |
2166 | /* The alignment of the record so far, allowing for the record to be |
2167 | padded only at the end, in bits. */ | |
2168 | unsigned int unpadded_align; | |
9328904c MM |
2169 | /* The static variables (i.e., class variables, as opposed to |
2170 | instance variables) encountered in T. */ | |
2171 | tree pending_statics; | |
9328904c | 2172 | int packed_maybe_necessary; |
770ae6cc | 2173 | } *record_layout_info; |
9328904c | 2174 | |
e0cea8d9 RK |
2175 | extern void set_lang_adjust_rli PARAMS ((void (*) PARAMS |
2176 | ((record_layout_info)))); | |
770ae6cc | 2177 | extern record_layout_info start_record_layout PARAMS ((tree)); |
f2704b9f RK |
2178 | extern tree bit_from_pos PARAMS ((tree, tree)); |
2179 | extern tree byte_from_pos PARAMS ((tree, tree)); | |
2180 | extern void pos_from_byte PARAMS ((tree *, tree *, unsigned int, | |
2181 | tree)); | |
2182 | extern void pos_from_bit PARAMS ((tree *, tree *, unsigned int, | |
2183 | tree)); | |
2184 | extern void normalize_offset PARAMS ((tree *, tree *, | |
2185 | unsigned int)); | |
770ae6cc RK |
2186 | extern tree rli_size_unit_so_far PARAMS ((record_layout_info)); |
2187 | extern tree rli_size_so_far PARAMS ((record_layout_info)); | |
2188 | extern void normalize_rli PARAMS ((record_layout_info)); | |
2189 | extern void place_field PARAMS ((record_layout_info, tree)); | |
65e14bf5 | 2190 | extern void compute_record_mode PARAMS ((tree)); |
770ae6cc | 2191 | extern void finish_record_layout PARAMS ((record_layout_info)); |
9328904c | 2192 | |
8da1b058 RS |
2193 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
2194 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
2195 | How the hash code is computed is up to the caller, as long as any two | |
2196 | callers that could hash identical-looking type nodes agree. */ | |
2197 | ||
05bccae2 | 2198 | extern tree type_hash_canon PARAMS ((unsigned int, tree)); |
8da1b058 RS |
2199 | |
2200 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
2201 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
2202 | fields. Call this only once for any given decl node. | |
2203 | ||
2204 | Second argument is the boundary that this field can be assumed to | |
2205 | be starting at (in bits). Zero means it can be assumed aligned | |
2206 | on any boundary that may be needed. */ | |
2207 | ||
58782098 | 2208 | extern void layout_decl PARAMS ((tree, unsigned)); |
8da1b058 | 2209 | |
72c602fc RK |
2210 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
2211 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
2212 | The value is BLKmode if no other mode is found. This is like | |
2213 | mode_for_size, but is passed a tree. */ | |
2214 | ||
2215 | extern enum machine_mode mode_for_size_tree PARAMS ((tree, enum mode_class, | |
2216 | int)); | |
2217 | ||
8da1b058 RS |
2218 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
2219 | ||
58782098 KG |
2220 | extern tree non_lvalue PARAMS ((tree)); |
2221 | extern tree pedantic_non_lvalue PARAMS ((tree)); | |
8da1b058 | 2222 | |
58782098 | 2223 | extern tree convert PARAMS ((tree, tree)); |
729a2125 | 2224 | extern unsigned int expr_align PARAMS ((tree)); |
58782098 KG |
2225 | extern tree size_in_bytes PARAMS ((tree)); |
2226 | extern HOST_WIDE_INT int_size_in_bytes PARAMS ((tree)); | |
665f2503 RK |
2227 | extern tree bit_position PARAMS ((tree)); |
2228 | extern HOST_WIDE_INT int_bit_position PARAMS ((tree)); | |
770ae6cc RK |
2229 | extern tree byte_position PARAMS ((tree)); |
2230 | extern HOST_WIDE_INT int_byte_position PARAMS ((tree)); | |
fed3cef0 RK |
2231 | |
2232 | /* Define data structures, macros, and functions for handling sizes | |
2233 | and the various types used to represent sizes. */ | |
2234 | ||
2235 | enum size_type_kind | |
2236 | { | |
2237 | SIZETYPE, /* Normal representation of sizes in bytes. */ | |
2238 | SSIZETYPE, /* Signed representation of sizes in bytes. */ | |
2239 | USIZETYPE, /* Unsigned representation of sizes in bytes. */ | |
2240 | BITSIZETYPE, /* Normal representation of sizes in bits. */ | |
2241 | SBITSIZETYPE, /* Signed representation of sizes in bits. */ | |
2242 | UBITSIZETYPE, /* Unsifgned representation of sizes in bits. */ | |
2243 | TYPE_KIND_LAST}; | |
2244 | ||
2245 | extern tree sizetype_tab[(int) TYPE_KIND_LAST]; | |
2246 | ||
2247 | #define sizetype sizetype_tab[(int) SIZETYPE] | |
2248 | #define bitsizetype sizetype_tab[(int) BITSIZETYPE] | |
2249 | #define ssizetype sizetype_tab[(int) SSIZETYPE] | |
2250 | #define usizetype sizetype_tab[(int) USIZETYPE] | |
2251 | #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] | |
2252 | #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE] | |
2253 | ||
58782098 | 2254 | extern tree size_binop PARAMS ((enum tree_code, tree, tree)); |
fed3cef0 RK |
2255 | extern tree size_diffop PARAMS ((tree, tree)); |
2256 | extern tree size_int_wide PARAMS ((HOST_WIDE_INT, | |
2257 | enum size_type_kind)); | |
2258 | extern tree size_int_type_wide PARAMS ((HOST_WIDE_INT, tree)); | |
06ceef4e | 2259 | |
fed3cef0 RK |
2260 | #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T) |
2261 | #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE) | |
2262 | #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE) | |
2263 | #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE) | |
2264 | #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE) | |
f8dac6eb | 2265 | |
58782098 | 2266 | extern tree round_up PARAMS ((tree, int)); |
36244024 | 2267 | extern tree round_down PARAMS ((tree, int)); |
58782098 | 2268 | extern tree get_pending_sizes PARAMS ((void)); |
fe375cf1 JJ |
2269 | extern int is_pending_size PARAMS ((tree)); |
2270 | extern void put_pending_size PARAMS ((tree)); | |
58782098 | 2271 | extern void put_pending_sizes PARAMS ((tree)); |
8da1b058 RS |
2272 | |
2273 | /* Type for sizes of data-type. */ | |
2274 | ||
f8dac6eb R |
2275 | #define BITS_PER_UNIT_LOG \ |
2276 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
2277 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
2278 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
2279 | ||
8294accf | 2280 | /* If nonzero, an upper limit on alignment of structure fields, in bits. */ |
729a2125 | 2281 | extern unsigned int maximum_field_alignment; |
8294accf | 2282 | |
abc95ed3 | 2283 | /* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */ |
729a2125 | 2284 | extern unsigned int set_alignment; |
8294accf | 2285 | |
8da1b058 RS |
2286 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
2287 | by making the last node in X point to Y. | |
2288 | Returns X, except if X is 0 returns Y. */ | |
2289 | ||
58782098 | 2290 | extern tree chainon PARAMS ((tree, tree)); |
8da1b058 RS |
2291 | |
2292 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
2293 | ||
58782098 | 2294 | extern tree tree_cons PARAMS ((tree, tree, tree)); |
8da1b058 RS |
2295 | |
2296 | /* Return the last tree node in a chain. */ | |
2297 | ||
58782098 | 2298 | extern tree tree_last PARAMS ((tree)); |
8da1b058 RS |
2299 | |
2300 | /* Reverse the order of elements in a chain, and return the new head. */ | |
2301 | ||
58782098 | 2302 | extern tree nreverse PARAMS ((tree)); |
8da1b058 RS |
2303 | |
2304 | /* Returns the length of a chain of nodes | |
2305 | (number of chain pointers to follow before reaching a null pointer). */ | |
2306 | ||
58782098 | 2307 | extern int list_length PARAMS ((tree)); |
8da1b058 | 2308 | |
c3b247b4 JM |
2309 | /* Returns the number of FIELD_DECLs in a type. */ |
2310 | ||
2311 | extern int fields_length PARAMS ((tree)); | |
2312 | ||
8da1b058 RS |
2313 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ |
2314 | ||
58782098 | 2315 | extern int integer_zerop PARAMS ((tree)); |
8da1b058 RS |
2316 | |
2317 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ | |
2318 | ||
58782098 | 2319 | extern int integer_onep PARAMS ((tree)); |
8da1b058 RS |
2320 | |
2321 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
2322 | all of whose significant bits are 1. */ | |
2323 | ||
58782098 | 2324 | extern int integer_all_onesp PARAMS ((tree)); |
8da1b058 RS |
2325 | |
2326 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
2327 | exactly one bit 1. */ | |
2328 | ||
58782098 | 2329 | extern int integer_pow2p PARAMS ((tree)); |
8da1b058 RS |
2330 | |
2331 | /* staticp (tree x) is nonzero if X is a reference to data allocated | |
2332 | at a fixed address in memory. */ | |
2333 | ||
58782098 | 2334 | extern int staticp PARAMS ((tree)); |
8da1b058 RS |
2335 | |
2336 | /* Gets an error if argument X is not an lvalue. | |
2337 | Also returns 1 if X is an lvalue, 0 if not. */ | |
2338 | ||
58782098 | 2339 | extern int lvalue_or_else PARAMS ((tree, const char *)); |
8da1b058 RS |
2340 | |
2341 | /* save_expr (EXP) returns an expression equivalent to EXP | |
2342 | but it can be used multiple times within context CTX | |
2343 | and only evaluate EXP once. */ | |
2344 | ||
58782098 | 2345 | extern tree save_expr PARAMS ((tree)); |
8da1b058 | 2346 | |
b7f6588d JM |
2347 | /* Returns the index of the first non-tree operand for CODE, or the number |
2348 | of operands if all are trees. */ | |
2349 | ||
58782098 | 2350 | extern int first_rtl_op PARAMS ((enum tree_code)); |
b7f6588d | 2351 | |
679163cf | 2352 | /* unsave_expr (EXP) returns an expression equivalent to EXP but it |
582db8e4 | 2353 | can be used multiple times and will evaluate EXP in its entirety |
679163cf MS |
2354 | each time. */ |
2355 | ||
58782098 | 2356 | extern tree unsave_expr PARAMS ((tree)); |
679163cf | 2357 | |
582db8e4 MM |
2358 | /* Reset EXP in place so that it can be expaned again. Does not |
2359 | recurse into subtrees. */ | |
2360 | ||
58782098 | 2361 | extern void unsave_expr_1 PARAMS ((tree)); |
582db8e4 MM |
2362 | |
2363 | /* Like unsave_expr_1, but recurses into all subtrees. */ | |
679163cf | 2364 | |
58782098 | 2365 | extern tree unsave_expr_now PARAMS ((tree)); |
679163cf | 2366 | |
582db8e4 MM |
2367 | /* If non-null, these are language-specific helper functions for |
2368 | unsave_expr_now. If present, LANG_UNSAVE is called before its | |
2369 | argument (an UNSAVE_EXPR) is to be unsaved, and all other | |
2370 | processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is | |
2371 | called from unsave_expr_1 for language-specific tree codes. */ | |
58782098 KG |
2372 | extern void (*lang_unsave) PARAMS ((tree *)); |
2373 | extern void (*lang_unsave_expr_now) PARAMS ((tree)); | |
0a818f84 | 2374 | |
194c7c45 RH |
2375 | /* Return 0 if it is safe to evaluate EXPR multiple times, |
2376 | return 1 if it is safe if EXPR is unsaved afterward, or | |
2377 | return 2 if it is completely unsafe. */ | |
3fe30ff6 RH |
2378 | extern int unsafe_for_reeval PARAMS ((tree)); |
2379 | ||
2380 | /* If non-null, these are language-specific helper functions for | |
2381 | unsafe_for_reeval. Return negative to not handle some tree. */ | |
2382 | extern int (*lang_unsafe_for_reeval) PARAMS ((tree)); | |
8c57aea6 | 2383 | |
7380d707 RK |
2384 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
2385 | or offset that depends on a field within a record. | |
2386 | ||
2387 | Note that we only allow such expressions within simple arithmetic | |
2388 | or a COND_EXPR. */ | |
2389 | ||
58782098 | 2390 | extern int contains_placeholder_p PARAMS ((tree)); |
7380d707 | 2391 | |
b7f6588d JM |
2392 | /* Return 1 if EXP contains any expressions that produce cleanups for an |
2393 | outer scope to deal with. Used by fold. */ | |
2394 | ||
58782098 | 2395 | extern int has_cleanups PARAMS ((tree)); |
b7f6588d | 2396 | |
7380d707 RK |
2397 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, |
2398 | return a tree with all occurrences of references to F in a | |
2399 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
2400 | contains only arithmetic expressions. */ | |
2401 | ||
58782098 | 2402 | extern tree substitute_in_expr PARAMS ((tree, tree, tree)); |
7380d707 | 2403 | |
90ca31be RS |
2404 | /* variable_size (EXP) is like save_expr (EXP) except that it |
2405 | is for the special case of something that is part of a | |
2406 | variable size for a data type. It makes special arrangements | |
2407 | to compute the value at the right time when the data type | |
2408 | belongs to a function parameter. */ | |
2409 | ||
58782098 | 2410 | extern tree variable_size PARAMS ((tree)); |
90ca31be | 2411 | |
8da1b058 RS |
2412 | /* stabilize_reference (EXP) returns an reference equivalent to EXP |
2413 | but it can be used multiple times | |
2414 | and only evaluate the subexpressions once. */ | |
2415 | ||
58782098 | 2416 | extern tree stabilize_reference PARAMS ((tree)); |
8da1b058 | 2417 | |
1c8b10bb RK |
2418 | /* Subroutine of stabilize_reference; this is called for subtrees of |
2419 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
2420 | to ensure that it is only evaluated once. */ | |
2421 | ||
58782098 | 2422 | extern tree stabilize_reference_1 PARAMS ((tree)); |
1c8b10bb | 2423 | |
8da1b058 RS |
2424 | /* Return EXP, stripped of any conversions to wider types |
2425 | in such a way that the result of converting to type FOR_TYPE | |
2426 | is the same as if EXP were converted to FOR_TYPE. | |
2427 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
2428 | ||
58782098 | 2429 | extern tree get_unwidened PARAMS ((tree, tree)); |
8da1b058 RS |
2430 | |
2431 | /* Return OP or a simpler expression for a narrower value | |
2432 | which can be sign-extended or zero-extended to give back OP. | |
2433 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
2434 | or 0 if the value should be sign-extended. */ | |
2435 | ||
58782098 | 2436 | extern tree get_narrower PARAMS ((tree, int *)); |
8da1b058 RS |
2437 | |
2438 | /* Given MODE and UNSIGNEDP, return a suitable type-tree | |
2439 | with that mode. | |
2440 | The definition of this resides in language-specific code | |
2441 | as the repertoire of available types may vary. */ | |
2442 | ||
58782098 | 2443 | extern tree type_for_mode PARAMS ((enum machine_mode, int)); |
8da1b058 RS |
2444 | |
2445 | /* Given PRECISION and UNSIGNEDP, return a suitable type-tree | |
2446 | for an integer type with at least that precision. | |
2447 | The definition of this resides in language-specific code | |
2448 | as the repertoire of available types may vary. */ | |
2449 | ||
58782098 | 2450 | extern tree type_for_size PARAMS ((unsigned, int)); |
8da1b058 RS |
2451 | |
2452 | /* Given an integer type T, return a type like T but unsigned. | |
2453 | If T is unsigned, the value is T. | |
2454 | The definition of this resides in language-specific code | |
2455 | as the repertoire of available types may vary. */ | |
2456 | ||
58782098 | 2457 | extern tree unsigned_type PARAMS ((tree)); |
8da1b058 RS |
2458 | |
2459 | /* Given an integer type T, return a type like T but signed. | |
2460 | If T is signed, the value is T. | |
2461 | The definition of this resides in language-specific code | |
2462 | as the repertoire of available types may vary. */ | |
2463 | ||
58782098 | 2464 | extern tree signed_type PARAMS ((tree)); |
8da1b058 RS |
2465 | |
2466 | /* This function must be defined in the language-specific files. | |
2467 | expand_expr calls it to build the cleanup-expression for a TARGET_EXPR. | |
2468 | This is defined in a language-specific file. */ | |
2469 | ||
58782098 | 2470 | extern tree maybe_build_cleanup PARAMS ((tree)); |
8da1b058 RS |
2471 | |
2472 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, | |
2473 | look for nested component-refs or array-refs at constant positions | |
2474 | and find the ultimate containing object, which is returned. */ | |
2475 | ||
770ae6cc RK |
2476 | extern tree get_inner_reference PARAMS ((tree, HOST_WIDE_INT *, |
2477 | HOST_WIDE_INT *, tree *, | |
2478 | enum machine_mode *, int *, | |
2479 | int *, unsigned int *)); | |
8da1b058 | 2480 | |
140b60b4 MM |
2481 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
2482 | NUL_TREE if there is no containing scope. */ | |
2483 | ||
58782098 | 2484 | extern tree get_containing_scope PARAMS ((tree)); |
140b60b4 | 2485 | |
8da1b058 RS |
2486 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
2487 | or zero if none. */ | |
58782098 | 2488 | extern tree decl_function_context PARAMS ((tree)); |
8da1b058 | 2489 | |
3635a54b RK |
2490 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
2491 | this _DECL with its context, or zero if none. */ | |
58782098 | 2492 | extern tree decl_type_context PARAMS ((tree)); |
8da1b058 RS |
2493 | |
2494 | /* Given the FUNCTION_DECL for the current function, | |
2495 | return zero if it is ok for this function to be inline. | |
2496 | Otherwise return a warning message with a single %s | |
2497 | for the function's name. */ | |
2498 | ||
58782098 | 2499 | extern const char *function_cannot_inline_p PARAMS ((tree)); |
a3c11cd3 JW |
2500 | |
2501 | /* Return 1 if EXPR is the real constant zero. */ | |
58782098 | 2502 | extern int real_zerop PARAMS ((tree)); |
8da1b058 RS |
2503 | \f |
2504 | /* Declare commonly used variables for tree structure. */ | |
2505 | ||
8da1b058 RS |
2506 | /* Points to the name of the input file from which the current input |
2507 | being parsed originally came (before it went into cpp). */ | |
3b304f5b | 2508 | extern const char *input_filename; |
8da1b058 RS |
2509 | |
2510 | /* Current line number in input file. */ | |
2511 | extern int lineno; | |
2512 | ||
4812480a JM |
2513 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
2514 | Zero means allow extended lvalues. */ | |
2515 | ||
2516 | extern int pedantic_lvalues; | |
2517 | ||
8da1b058 RS |
2518 | /* Nonzero means can safely call expand_expr now; |
2519 | otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ | |
2520 | ||
2521 | extern int immediate_size_expand; | |
2522 | ||
2523 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ | |
2524 | ||
2525 | extern tree current_function_decl; | |
2526 | ||
00262c8a ML |
2527 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
2528 | extern tree current_function_func_begin_label; | |
2529 | ||
8da1b058 RS |
2530 | /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ |
2531 | ||
2532 | extern int all_types_permanent; | |
2533 | ||
a1d7ffe3 JM |
2534 | /* Pointer to function to compute the name to use to print a declaration. |
2535 | DECL is the declaration in question. | |
2536 | VERBOSITY determines what information will be printed: | |
2537 | 0: DECL_NAME, demangled as necessary. | |
2538 | 1: and scope information. | |
2539 | 2: and any other information that might be interesting, such as function | |
2540 | parameter types in C++. */ | |
2541 | ||
58782098 | 2542 | extern const char *(*decl_printable_name) PARAMS ((tree, int)); |
dc437e16 RS |
2543 | |
2544 | /* Pointer to function to finish handling an incomplete decl at the | |
2545 | end of compilation. */ | |
2546 | ||
58782098 | 2547 | extern void (*incomplete_decl_finalize_hook) PARAMS ((tree)); |
f425a887 | 2548 | |
3b304f5b | 2549 | extern const char *init_parse PARAMS ((const char *)); |
58782098 | 2550 | extern void finish_parse PARAMS ((void)); |
f425a887 | 2551 | |
26db82d8 BS |
2552 | extern const char * const language_string; |
2553 | ||
2554 | /* Declare a predefined function. Return the declaration. This function is | |
2555 | provided by each language frontend. */ | |
58782098 | 2556 | extern tree builtin_function PARAMS ((const char *, tree, int, |
26db82d8 BS |
2557 | enum built_in_class, |
2558 | const char *)); | |
8da1b058 | 2559 | \f |
143f1945 | 2560 | /* In tree.c */ |
58782098 | 2561 | extern char *perm_calloc PARAMS ((int, long)); |
881c6935 | 2562 | extern void clean_symbol_name PARAMS ((char *)); |
58782098 KG |
2563 | extern tree get_file_function_name_long PARAMS ((const char *)); |
2564 | extern tree get_set_constructor_bits PARAMS ((tree, char *, int)); | |
2565 | extern tree get_set_constructor_bytes PARAMS ((tree, | |
0f41302f | 2566 | unsigned char *, int)); |
58782098 | 2567 | extern tree get_callee_fndecl PARAMS ((tree)); |
92643fea | 2568 | extern void set_decl_assembler_name PARAMS ((tree)); |
f5d6a24c | 2569 | extern int type_num_arguments PARAMS ((tree)); |
143f1945 | 2570 | \f |
8da1b058 RS |
2571 | /* In stmt.c */ |
2572 | ||
58782098 | 2573 | extern int in_control_zone_p PARAMS ((void)); |
2f78c311 | 2574 | extern void expand_fixups PARAMS ((rtx)); |
58782098 KG |
2575 | extern tree expand_start_stmt_expr PARAMS ((void)); |
2576 | extern tree expand_end_stmt_expr PARAMS ((tree)); | |
2577 | extern void expand_expr_stmt PARAMS ((tree)); | |
2578 | extern int warn_if_unused_value PARAMS ((tree)); | |
2579 | extern void expand_decl_init PARAMS ((tree)); | |
2580 | extern void clear_last_expr PARAMS ((void)); | |
2581 | extern void expand_label PARAMS ((tree)); | |
2582 | extern void expand_goto PARAMS ((tree)); | |
2583 | extern void expand_asm PARAMS ((tree)); | |
2584 | extern void expand_start_cond PARAMS ((tree, int)); | |
2585 | extern void expand_end_cond PARAMS ((void)); | |
2586 | extern void expand_start_else PARAMS ((void)); | |
2587 | extern void expand_start_elseif PARAMS ((tree)); | |
2588 | extern struct nesting *expand_start_loop PARAMS ((int)); | |
2589 | extern struct nesting *expand_start_loop_continue_elsewhere PARAMS ((int)); | |
f0de0c5d | 2590 | extern struct nesting *expand_start_null_loop PARAMS ((void)); |
58782098 KG |
2591 | extern void expand_loop_continue_here PARAMS ((void)); |
2592 | extern void expand_end_loop PARAMS ((void)); | |
f0de0c5d | 2593 | extern void expand_end_null_loop PARAMS ((void)); |
58782098 KG |
2594 | extern int expand_continue_loop PARAMS ((struct nesting *)); |
2595 | extern int expand_exit_loop PARAMS ((struct nesting *)); | |
2596 | extern int expand_exit_loop_if_false PARAMS ((struct nesting *, | |
d6b12657 | 2597 | tree)); |
58782098 | 2598 | extern int expand_exit_something PARAMS ((void)); |
f837a861 | 2599 | |
58782098 | 2600 | extern void expand_return PARAMS ((tree)); |
2f78c311 | 2601 | extern int optimize_tail_recursion PARAMS ((tree, rtx)); |
58782098 | 2602 | extern void expand_start_bindings_and_block PARAMS ((int, tree)); |
a97901e6 MM |
2603 | #define expand_start_bindings(flags) \ |
2604 | expand_start_bindings_and_block(flags, NULL_TREE) | |
58782098 KG |
2605 | extern void expand_end_bindings PARAMS ((tree, int, int)); |
2606 | extern void warn_about_unused_variables PARAMS ((tree)); | |
2607 | extern void start_cleanup_deferral PARAMS ((void)); | |
2608 | extern void end_cleanup_deferral PARAMS ((void)); | |
deb5e280 JM |
2609 | extern int is_body_block PARAMS ((tree)); |
2610 | ||
58782098 | 2611 | extern int conditional_context PARAMS ((void)); |
91088ddb | 2612 | extern struct nesting * current_nesting_level PARAMS ((void)); |
58782098 | 2613 | extern tree last_cleanup_this_contour PARAMS ((void)); |
58782098 | 2614 | extern void expand_start_case PARAMS ((int, tree, tree, |
dff01034 | 2615 | const char *)); |
58782098 | 2616 | extern void expand_end_case PARAMS ((tree)); |
56cb9733 MM |
2617 | extern int add_case_node PARAMS ((tree, tree, |
2618 | tree, tree *)); | |
58782098 | 2619 | extern int pushcase PARAMS ((tree, |
d6b12657 RK |
2620 | tree (*) (tree, tree), |
2621 | tree, tree *)); | |
58782098 | 2622 | extern int pushcase_range PARAMS ((tree, tree, |
d6b12657 RK |
2623 | tree (*) (tree, tree), |
2624 | tree, tree *)); | |
58782098 KG |
2625 | extern void using_eh_for_cleanups PARAMS ((void)); |
2626 | extern int stmt_loop_nest_empty PARAMS ((void)); | |
8da1b058 RS |
2627 | |
2628 | /* In fold-const.c */ | |
2629 | ||
4b63dccb RK |
2630 | /* Fold constants as much as possible in an expression. |
2631 | Returns the simplified expression. | |
2632 | Acts only on the top level of the expression; | |
2633 | if the argument itself cannot be simplified, its | |
2634 | subexpressions are not changed. */ | |
2635 | ||
58782098 | 2636 | extern tree fold PARAMS ((tree)); |
4b63dccb | 2637 | |
58782098 | 2638 | extern int force_fit_type PARAMS ((tree, int)); |
05bccae2 RK |
2639 | extern int add_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
2640 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2641 | unsigned HOST_WIDE_INT *, | |
2642 | HOST_WIDE_INT *)); | |
2643 | extern int neg_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2644 | unsigned HOST_WIDE_INT *, | |
2645 | HOST_WIDE_INT *)); | |
2646 | extern int mul_double PARAMS ((unsigned HOST_WIDE_INT, | |
2647 | HOST_WIDE_INT, | |
2648 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2649 | unsigned HOST_WIDE_INT *, | |
2650 | HOST_WIDE_INT *)); | |
2651 | extern void lshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2652 | HOST_WIDE_INT, unsigned int, | |
2653 | unsigned HOST_WIDE_INT *, | |
2654 | HOST_WIDE_INT *, int)); | |
2655 | extern void rshift_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2656 | HOST_WIDE_INT, unsigned int, | |
2657 | unsigned HOST_WIDE_INT *, | |
2658 | HOST_WIDE_INT *, int)); | |
2659 | extern void lrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2660 | HOST_WIDE_INT, unsigned int, | |
2661 | unsigned HOST_WIDE_INT *, | |
2662 | HOST_WIDE_INT *)); | |
2663 | extern void rrotate_double PARAMS ((unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
2664 | HOST_WIDE_INT, unsigned int, | |
2665 | unsigned HOST_WIDE_INT *, | |
2666 | HOST_WIDE_INT *)); | |
58782098 KG |
2667 | extern int operand_equal_p PARAMS ((tree, tree, int)); |
2668 | extern tree invert_truthvalue PARAMS ((tree)); | |
c530479e RH |
2669 | |
2670 | /* In builtins.c. Given a type, apply default promotions wrt unnamed | |
2671 | function arguments and return the new type. Return NULL_TREE if no | |
2672 | change. Required by any language that supports variadic arguments. */ | |
2673 | ||
58782098 | 2674 | extern tree (*lang_type_promotes_to) PARAMS ((tree)); |
94e9dc13 | 2675 | extern tree fold_builtin PARAMS ((tree)); |
8da1b058 RS |
2676 | \f |
2677 | /* The language front-end must define these functions. */ | |
2678 | ||
2679 | /* Function of no arguments for initializing lexical scanning. */ | |
58782098 | 2680 | extern void init_lex PARAMS ((void)); |
8da1b058 | 2681 | /* Function of no arguments for initializing the symbol table. */ |
58782098 | 2682 | extern void init_decl_processing PARAMS ((void)); |
8da1b058 | 2683 | |
9faa82d8 | 2684 | /* Function to identify which front-end produced the output file. */ |
58782098 | 2685 | extern const char *lang_identify PARAMS ((void)); |
c9591059 | 2686 | |
78b099bd | 2687 | /* Function to replace the DECL_LANG_SPECIFIC field of a DECL with a copy. */ |
58782098 | 2688 | extern void copy_lang_decl PARAMS ((tree)); |
78b099bd | 2689 | |
8da1b058 | 2690 | /* Function called with no arguments to parse and compile the input. */ |
58782098 | 2691 | extern int yyparse PARAMS ((void)); |
8da1b058 RS |
2692 | /* Functions for processing symbol declarations. */ |
2693 | /* Function to enter a new lexical scope. | |
2694 | Takes one argument: always zero when called from outside the front end. */ | |
58782098 | 2695 | extern void pushlevel PARAMS ((int)); |
8da1b058 RS |
2696 | /* Function to exit a lexical scope. It returns a BINDING for that scope. |
2697 | Takes three arguments: | |
2698 | KEEP -- nonzero if there were declarations in this scope. | |
2699 | REVERSE -- reverse the order of decls before returning them. | |
2700 | FUNCTIONBODY -- nonzero if this level is the body of a function. */ | |
58782098 | 2701 | extern tree poplevel PARAMS ((int, int, int)); |
69b78d8d | 2702 | /* Set the BLOCK node for the current scope level. */ |
58782098 | 2703 | extern void set_block PARAMS ((tree)); |
8da1b058 RS |
2704 | /* Function to add a decl to the current scope level. |
2705 | Takes one argument, a decl to add. | |
2706 | Returns that decl, or, if the same symbol is already declared, may | |
2707 | return a different decl for that name. */ | |
58782098 | 2708 | extern tree pushdecl PARAMS ((tree)); |
8da1b058 | 2709 | /* Function to return the chain of decls so far in the current scope level. */ |
58782098 | 2710 | extern tree getdecls PARAMS ((void)); |
8da1b058 | 2711 | /* Function to return the chain of structure tags in the current scope level. */ |
58782098 | 2712 | extern tree gettags PARAMS ((void)); |
a3c11cd3 | 2713 | |
58782098 | 2714 | extern tree build_range_type PARAMS ((tree, tree, tree)); |
a3c11cd3 | 2715 | |
a0c33338 | 2716 | /* In alias.c */ |
bebe2280 RB |
2717 | extern void record_component_aliases PARAMS ((tree)); |
2718 | extern HOST_WIDE_INT get_alias_set PARAMS ((tree)); | |
1da68f56 RK |
2719 | extern int alias_sets_conflict_p PARAMS ((HOST_WIDE_INT, |
2720 | HOST_WIDE_INT)); | |
2721 | extern int readonly_fields_p PARAMS ((tree)); | |
2722 | extern int objects_must_conflict_p PARAMS ((tree, tree)); | |
bebe2280 RB |
2723 | |
2724 | /* In c-common.c */ | |
2725 | extern HOST_WIDE_INT lang_get_alias_set PARAMS ((tree)); | |
a0c33338 | 2726 | |
92643fea MM |
2727 | /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing |
2728 | that the assembler should talk about, set DECL_ASSEMBLER_NAME to an | |
2729 | appropriate IDENTIFIER_NODE. Otherwise, set it to the | |
2730 | ERROR_MARK_NODE to ensure that the assembler does not talk about | |
2731 | it. */ | |
2732 | extern void (*lang_set_decl_assembler_name) PARAMS ((tree)); | |
2733 | ||
7584b89f RE |
2734 | struct obstack; |
2735 | ||
a1d061a1 | 2736 | /* In tree.c */ |
58782098 | 2737 | extern int really_constant_p PARAMS ((tree)); |
58782098 KG |
2738 | extern void set_identifier_size PARAMS ((int)); |
2739 | extern int int_fits_type_p PARAMS ((tree, tree)); | |
2740 | extern int tree_log2 PARAMS ((tree)); | |
05bccae2 | 2741 | extern int tree_floor_log2 PARAMS ((tree)); |
58782098 KG |
2742 | extern void preserve_data PARAMS ((void)); |
2743 | extern int object_permanent_p PARAMS ((tree)); | |
2744 | extern int type_precision PARAMS ((tree)); | |
2745 | extern int simple_cst_equal PARAMS ((tree, tree)); | |
05bccae2 | 2746 | extern int compare_tree_int PARAMS ((tree, unsigned int)); |
58782098 KG |
2747 | extern int type_list_equal PARAMS ((tree, tree)); |
2748 | extern int chain_member PARAMS ((tree, tree)); | |
2749 | extern int chain_member_purpose PARAMS ((tree, tree)); | |
2750 | extern int chain_member_value PARAMS ((tree, tree)); | |
2751 | extern tree listify PARAMS ((tree)); | |
05bccae2 RK |
2752 | extern tree type_hash_lookup PARAMS ((unsigned int, tree)); |
2753 | extern void type_hash_add PARAMS ((unsigned int, tree)); | |
2754 | extern unsigned int type_hash_list PARAMS ((tree)); | |
58782098 | 2755 | extern int simple_cst_list_equal PARAMS ((tree, tree)); |
58782098 KG |
2756 | extern void dump_tree_statistics PARAMS ((void)); |
2757 | extern void print_obstack_statistics PARAMS ((const char *, | |
37b37199 | 2758 | struct obstack *)); |
a1d061a1 | 2759 | #ifdef BUFSIZ |
a0c33338 RK |
2760 | extern void print_obstack_name PARAMS ((char *, FILE *, |
2761 | const char *)); | |
a1d061a1 | 2762 | #endif |
3b304f5b | 2763 | extern void expand_function_end PARAMS ((const char *, int, int)); |
58782098 | 2764 | extern void expand_function_start PARAMS ((tree, int)); |
1f731749 | 2765 | extern void expand_pending_sizes PARAMS ((tree)); |
a0c33338 | 2766 | |
58782098 KG |
2767 | extern int real_onep PARAMS ((tree)); |
2768 | extern int real_twop PARAMS ((tree)); | |
58782098 KG |
2769 | extern void gcc_obstack_init PARAMS ((struct obstack *)); |
2770 | extern void init_obstacks PARAMS ((void)); | |
58782098 KG |
2771 | extern void build_common_tree_nodes PARAMS ((int)); |
2772 | extern void build_common_tree_nodes_2 PARAMS ((int)); | |
9ccb25d5 | 2773 | extern void mark_tree_hashtable PARAMS ((void *)); |
a1d061a1 JL |
2774 | |
2775 | /* In function.c */ | |
58782098 KG |
2776 | extern void setjmp_protect_args PARAMS ((void)); |
2777 | extern void setjmp_protect PARAMS ((tree)); | |
2778 | extern void expand_main_function PARAMS ((void)); | |
2779 | extern void mark_varargs PARAMS ((void)); | |
2780 | extern void init_dummy_function_start PARAMS ((void)); | |
2781 | extern void expand_dummy_function_end PARAMS ((void)); | |
2782 | extern void init_function_for_compilation PARAMS ((void)); | |
36244024 | 2783 | extern void init_function_start PARAMS ((tree, const char *, int)); |
58782098 KG |
2784 | extern void assign_parms PARAMS ((tree)); |
2785 | extern void put_var_into_stack PARAMS ((tree)); | |
13eb1f7f | 2786 | extern void flush_addressof PARAMS ((tree)); |
58782098 KG |
2787 | extern void uninitialized_vars_warning PARAMS ((tree)); |
2788 | extern void setjmp_args_warning PARAMS ((void)); | |
2789 | extern void mark_all_temps_used PARAMS ((void)); | |
2790 | extern void init_temp_slots PARAMS ((void)); | |
2791 | extern void combine_temp_slots PARAMS ((void)); | |
2792 | extern void free_temp_slots PARAMS ((void)); | |
2793 | extern void pop_temp_slots PARAMS ((void)); | |
2794 | extern void push_temp_slots PARAMS ((void)); | |
2f78c311 | 2795 | extern void preserve_temp_slots PARAMS ((rtx)); |
05bccae2 | 2796 | extern void preserve_rtl_expr_temps PARAMS ((tree)); |
58782098 | 2797 | extern int aggregate_value_p PARAMS ((tree)); |
591ccf92 | 2798 | extern void free_temps_for_rtl_expr PARAMS ((tree)); |
2f78c311 ZW |
2799 | extern void instantiate_virtual_regs PARAMS ((tree, rtx)); |
2800 | extern void unshare_all_rtl PARAMS ((tree, rtx)); | |
58782098 KG |
2801 | extern int max_parm_reg_num PARAMS ((void)); |
2802 | extern void push_function_context PARAMS ((void)); | |
2803 | extern void pop_function_context PARAMS ((void)); | |
2804 | extern void push_function_context_to PARAMS ((tree)); | |
2805 | extern void pop_function_context_from PARAMS ((tree)); | |
eb3ae3e1 | 2806 | extern void ggc_mark_struct_function PARAMS ((struct function *)); |
a1d061a1 JL |
2807 | |
2808 | /* In print-rtl.c */ | |
2809 | #ifdef BUFSIZ | |
2f78c311 | 2810 | extern void print_rtl PARAMS ((FILE *, rtx)); |
a1d061a1 JL |
2811 | #endif |
2812 | ||
2813 | /* In print-tree.c */ | |
58782098 | 2814 | extern void debug_tree PARAMS ((tree)); |
a1d061a1 | 2815 | #ifdef BUFSIZ |
a0c33338 RK |
2816 | extern void print_node PARAMS ((FILE *, const char *, tree, |
2817 | int)); | |
2818 | extern void print_node_brief PARAMS ((FILE *, const char *, tree, | |
2819 | int)); | |
58782098 | 2820 | extern void indent_to PARAMS ((FILE *, int)); |
a1d061a1 JL |
2821 | #endif |
2822 | ||
2823 | /* In expr.c */ | |
58782098 | 2824 | extern int apply_args_register_offset PARAMS ((int)); |
2f78c311 ZW |
2825 | extern rtx expand_builtin_return_addr |
2826 | PARAMS ((enum built_in_function, int, rtx)); | |
58782098 | 2827 | extern void check_max_integer_computation_mode PARAMS ((tree)); |
a1d061a1 JL |
2828 | |
2829 | /* In emit-rtl.c */ | |
591ccf92 | 2830 | extern void start_sequence_for_rtl_expr PARAMS ((tree)); |
2f78c311 | 2831 | extern rtx emit_line_note PARAMS ((const char *, int)); |
a1d061a1 | 2832 | |
3a8c995b | 2833 | /* In calls.c */ |
f2d33f13 | 2834 | |
f2d33f13 | 2835 | extern int setjmp_call_p PARAMS ((tree)); |
3a8c995b | 2836 | |
a0c33338 RK |
2837 | /* In front end. */ |
2838 | ||
58782098 KG |
2839 | extern int mark_addressable PARAMS ((tree)); |
2840 | extern void incomplete_type_error PARAMS ((tree, tree)); | |
58782098 | 2841 | extern void print_lang_statistics PARAMS ((void)); |
58782098 | 2842 | extern tree truthvalue_conversion PARAMS ((tree)); |
a1d061a1 | 2843 | #ifdef BUFSIZ |
58782098 KG |
2844 | extern void print_lang_decl PARAMS ((FILE *, tree, int)); |
2845 | extern void print_lang_type PARAMS ((FILE *, tree, int)); | |
2846 | extern void print_lang_identifier PARAMS ((FILE *, tree, int)); | |
a1d061a1 | 2847 | #endif |
58782098 KG |
2848 | extern int global_bindings_p PARAMS ((void)); |
2849 | extern void insert_block PARAMS ((tree)); | |
a1d061a1 JL |
2850 | |
2851 | /* In integrate.c */ | |
f93dacbd | 2852 | extern void save_for_inline PARAMS ((tree)); |
58782098 KG |
2853 | extern void set_decl_abstract_flags PARAMS ((tree, int)); |
2854 | extern void output_inline_function PARAMS ((tree)); | |
1cfdcc15 | 2855 | extern void set_decl_origin_self PARAMS ((tree)); |
a1d061a1 | 2856 | |
a0c33338 | 2857 | /* In front end. */ |
58782098 | 2858 | extern void set_yydebug PARAMS ((int)); |
a1d061a1 JL |
2859 | |
2860 | /* In stor-layout.c */ | |
58782098 | 2861 | extern void fixup_signed_type PARAMS ((tree)); |
b5d6a2ff | 2862 | extern void internal_reference_types PARAMS ((void)); |
a1d061a1 JL |
2863 | |
2864 | /* varasm.c */ | |
6c418184 | 2865 | extern void make_decl_rtl PARAMS ((tree, const char *)); |
58782098 KG |
2866 | extern void make_decl_one_only PARAMS ((tree)); |
2867 | extern int supports_one_only PARAMS ((void)); | |
2868 | extern void variable_section PARAMS ((tree, int)); | |
a1d061a1 JL |
2869 | |
2870 | /* In fold-const.c */ | |
58782098 | 2871 | extern int div_and_round_double PARAMS ((enum tree_code, int, |
05bccae2 RK |
2872 | unsigned HOST_WIDE_INT, |
2873 | HOST_WIDE_INT, | |
2874 | unsigned HOST_WIDE_INT, | |
2875 | HOST_WIDE_INT, | |
2876 | unsigned HOST_WIDE_INT *, | |
2877 | HOST_WIDE_INT *, | |
2878 | unsigned HOST_WIDE_INT *, | |
2879 | HOST_WIDE_INT *)); | |
a1d061a1 JL |
2880 | |
2881 | /* In stmt.c */ | |
58782098 KG |
2882 | extern void emit_nop PARAMS ((void)); |
2883 | extern void expand_computed_goto PARAMS ((tree)); | |
40b18c0a MM |
2884 | extern bool parse_output_constraint PARAMS ((const char **, |
2885 | int, int, int, | |
2886 | bool *, bool *, bool *)); | |
58782098 | 2887 | extern void expand_asm_operands PARAMS ((tree, tree, tree, tree, int, |
3b304f5b | 2888 | const char *, int)); |
58782098 KG |
2889 | extern int any_pending_cleanups PARAMS ((int)); |
2890 | extern void init_stmt PARAMS ((void)); | |
2891 | extern void init_stmt_for_function PARAMS ((void)); | |
2892 | extern int drop_through_at_end_p PARAMS ((void)); | |
2893 | extern void expand_start_target_temps PARAMS ((void)); | |
2894 | extern void expand_end_target_temps PARAMS ((void)); | |
2895 | extern void expand_elseif PARAMS ((tree)); | |
7393c642 | 2896 | extern void save_stack_pointer PARAMS ((void)); |
58782098 KG |
2897 | extern void expand_decl PARAMS ((tree)); |
2898 | extern int expand_decl_cleanup PARAMS ((tree, tree)); | |
2899 | extern void expand_anon_union_decl PARAMS ((tree, tree, tree)); | |
2900 | extern void move_cleanups_up PARAMS ((void)); | |
2901 | extern void expand_start_case_dummy PARAMS ((void)); | |
2902 | extern void expand_end_case_dummy PARAMS ((void)); | |
2903 | extern tree case_index_expr_type PARAMS ((void)); | |
2904 | extern HOST_WIDE_INT all_cases_count PARAMS ((tree, int *)); | |
2905 | extern void check_for_full_enumeration_handling PARAMS ((tree)); | |
2906 | extern void declare_nonlocal_label PARAMS ((tree)); | |
31ed227b | 2907 | #ifdef BUFSIZ |
58782098 | 2908 | extern void lang_print_xnode PARAMS ((FILE *, tree, int)); |
31ed227b JL |
2909 | #endif |
2910 | ||
a1d061a1 | 2911 | |
496651db MM |
2912 | /* If KIND=='I', return a suitable global initializer (constructor) name. |
2913 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
58782098 | 2914 | extern tree get_file_function_name PARAMS ((int)); |
af4142d5 JM |
2915 | \f |
2916 | /* Interface of the DWARF2 unwind info support. */ | |
2917 | ||
af4142d5 JM |
2918 | /* Generate a new label for the CFI info to refer to. */ |
2919 | ||
58782098 | 2920 | extern char *dwarf2out_cfi_label PARAMS ((void)); |
af4142d5 JM |
2921 | |
2922 | /* Entry point to update the canonical frame address (CFA). */ | |
2923 | ||
d3e3972c | 2924 | extern void dwarf2out_def_cfa PARAMS ((const char *, unsigned, long)); |
af4142d5 JM |
2925 | |
2926 | /* Add the CFI for saving a register window. */ | |
2927 | ||
d3e3972c | 2928 | extern void dwarf2out_window_save PARAMS ((const char *)); |
af4142d5 JM |
2929 | |
2930 | /* Add a CFI to update the running total of the size of arguments pushed | |
2931 | onto the stack. */ | |
2932 | ||
d3e3972c | 2933 | extern void dwarf2out_args_size PARAMS ((const char *, long)); |
af4142d5 JM |
2934 | |
2935 | /* Entry point for saving a register to the stack. */ | |
2936 | ||
d3e3972c | 2937 | extern void dwarf2out_reg_save PARAMS ((const char *, unsigned, long)); |
af4142d5 JM |
2938 | |
2939 | /* Entry point for saving the return address in the stack. */ | |
2940 | ||
d3e3972c | 2941 | extern void dwarf2out_return_save PARAMS ((const char *, long)); |
af4142d5 JM |
2942 | |
2943 | /* Entry point for saving the return address in a register. */ | |
2944 | ||
d3e3972c | 2945 | extern void dwarf2out_return_reg PARAMS ((const char *, unsigned)); |
af4142d5 | 2946 | |
9a6bb3f7 | 2947 | \f |
987009bf ZW |
2948 | /* Redefine abort to report an internal error w/o coredump, and |
2949 | reporting the location of the error in the source file. This logic | |
2950 | is duplicated in rtl.h and tree.h because every file that needs the | |
2951 | special abort includes one or both. toplev.h gets too few files, | |
2952 | system.h gets too many. */ | |
2953 | ||
58782098 | 2954 | extern void fancy_abort PARAMS ((const char *, int, const char *)) |
987009bf | 2955 | ATTRIBUTE_NORETURN; |
fbfc1192 | 2956 | #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__) |