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