]>
Commit | Line | Data |
---|---|---|
d72a838e | 1 | /* Front-end tree definitions for GNU compiler. |
d513ec2f | 2 | Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
fbbb2067 | 3 | 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. |
d72a838e | 4 | |
f12b58b3 | 5 | This file is part of GCC. |
d72a838e | 6 | |
f12b58b3 | 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. | |
d72a838e | 11 | |
f12b58b3 | 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. | |
d72a838e | 16 | |
17 | You should have received a copy of the GNU General Public License | |
f12b58b3 | 18 | along with GCC; see the file COPYING. If not, write to the Free |
67ce556b | 19 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
20 | 02110-1301, USA. */ | |
d72a838e | 21 | |
b229f760 | 22 | #ifndef GCC_TREE_H |
23 | #define GCC_TREE_H | |
24 | ||
d72a838e | 25 | #include "machmode.h" |
5a8a92a0 | 26 | #include "input.h" |
674b05f5 | 27 | #include "statistics.h" |
f6cc6a08 | 28 | #include "vec.h" |
d72a838e | 29 | |
b8dea3b2 | 30 | /* Codes of tree nodes */ |
d72a838e | 31 | |
32 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
33 | ||
34 | enum tree_code { | |
35 | #include "tree.def" | |
36 | ||
4bbea254 | 37 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
6d5a6036 | 38 | NUM_TREE_CODES. */ |
d72a838e | 39 | }; |
40 | ||
41 | #undef DEFTREECODE | |
42 | ||
5ded8c6f | 43 | extern unsigned char tree_contains_struct[256][64]; |
44 | #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) | |
45 | ||
f3c6d29a | 46 | /* Number of language-independent tree codes. */ |
47 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
d72a838e | 48 | |
ce45a448 | 49 | /* Tree code classes. */ |
50 | ||
51 | /* Each tree_code has an associated code class represented by a | |
52 | TREE_CODE_CLASS. */ | |
53 | ||
54 | enum tree_code_class { | |
55 | tcc_exceptional, /* An exceptional code (fits no category). */ | |
56 | tcc_constant, /* A constant. */ | |
9843a47d | 57 | /* Order of tcc_type and tcc_declaration is important. */ |
ce45a448 | 58 | tcc_type, /* A type object code. */ |
59 | tcc_declaration, /* A declaration (also serving as variable refs). */ | |
60 | tcc_reference, /* A reference to storage. */ | |
61 | tcc_comparison, /* A comparison expression. */ | |
62 | tcc_unary, /* A unary arithmetic expression. */ | |
63 | tcc_binary, /* A binary arithmetic expression. */ | |
64 | tcc_statement, /* A statement expression, which have side effects | |
65 | but usually no interesting value. */ | |
66 | tcc_expression /* Any other expression. */ | |
67 | }; | |
68 | ||
69 | /* Each tree code class has an associated string representation. | |
70 | These must correspond to the tree_code_class entries. */ | |
71 | ||
a93de1ee | 72 | extern const char *const tree_code_class_strings[]; |
ce45a448 | 73 | |
74 | /* Returns the string representing CLASS. */ | |
75 | ||
76 | #define TREE_CODE_CLASS_STRING(CLASS)\ | |
77 | tree_code_class_strings[(int) (CLASS)] | |
d72a838e | 78 | |
b4dae43c | 79 | #define MAX_TREE_CODES 256 |
ce45a448 | 80 | extern const enum tree_code_class tree_code_type[]; |
b4dae43c | 81 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
d72a838e | 82 | |
ce45a448 | 83 | /* Nonzero if CODE represents an exceptional code. */ |
84 | ||
85 | #define EXCEPTIONAL_CLASS_P(CODE)\ | |
86 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) | |
87 | ||
88 | /* Nonzero if CODE represents a constant. */ | |
89 | ||
90 | #define CONSTANT_CLASS_P(CODE)\ | |
91 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) | |
92 | ||
93 | /* Nonzero if CODE represents a type. */ | |
94 | ||
95 | #define TYPE_P(CODE)\ | |
96 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) | |
97 | ||
98 | /* Nonzero if CODE represents a declaration. */ | |
99 | ||
100 | #define DECL_P(CODE)\ | |
101 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) | |
102 | ||
437f5d6b | 103 | /* Nonzero if CODE represents a memory tag. */ |
104 | ||
105 | #define MTAG_P(CODE) \ | |
106 | (TREE_CODE (CODE) == STRUCT_FIELD_TAG \ | |
107 | || TREE_CODE (CODE) == NAME_MEMORY_TAG \ | |
108 | || TREE_CODE (CODE) == TYPE_MEMORY_TAG) | |
109 | ||
110 | ||
5ded8c6f | 111 | /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ |
112 | ||
113 | #define VAR_OR_FUNCTION_DECL_P(DECL)\ | |
114 | (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) | |
115 | ||
9843a47d | 116 | /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in |
117 | ascending code order. */ | |
5ded8c6f | 118 | |
2a448a75 | 119 | #define INDIRECT_REF_P(CODE)\ |
120 | (TREE_CODE (CODE) == INDIRECT_REF \ | |
9843a47d | 121 | || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \ |
122 | || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF) | |
2a448a75 | 123 | |
ce45a448 | 124 | /* Nonzero if CODE represents a reference. */ |
125 | ||
126 | #define REFERENCE_CLASS_P(CODE)\ | |
127 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) | |
128 | ||
129 | /* Nonzero if CODE represents a comparison. */ | |
130 | ||
131 | #define COMPARISON_CLASS_P(CODE)\ | |
132 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) | |
133 | ||
134 | /* Nonzero if CODE represents a unary arithmetic expression. */ | |
135 | ||
136 | #define UNARY_CLASS_P(CODE)\ | |
137 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) | |
138 | ||
139 | /* Nonzero if CODE represents a binary arithmetic expression. */ | |
140 | ||
141 | #define BINARY_CLASS_P(CODE)\ | |
142 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) | |
143 | ||
144 | /* Nonzero if CODE represents a statement expression. */ | |
145 | ||
146 | #define STATEMENT_CLASS_P(CODE)\ | |
147 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) | |
148 | ||
149 | /* Nonzero if CODE represents any other expression. */ | |
150 | ||
151 | #define EXPRESSION_CLASS_P(CODE)\ | |
152 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) | |
153 | ||
ce45a448 | 154 | /* Returns nonzero iff CODE represents a type or declaration. */ |
155 | ||
156 | #define IS_TYPE_OR_DECL_P(CODE)\ | |
157 | (TYPE_P (CODE) || DECL_P (CODE)) | |
66d12a6c | 158 | |
f712a0dc | 159 | /* Returns nonzero iff CLASS is the tree-code class of an |
14ac2afb | 160 | expression. */ |
161 | ||
ce45a448 | 162 | #define IS_EXPR_CODE_CLASS(CLASS)\ |
fbbb2067 | 163 | ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) |
b5e4e1dc | 164 | |
165 | /* Returns nonzero iff NODE is an expression of some kind. */ | |
166 | ||
167 | #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) | |
14ac2afb | 168 | |
d72a838e | 169 | /* Number of argument-words in each kind of tree-node. */ |
170 | ||
ab1a776d | 171 | extern const unsigned char tree_code_length[]; |
f3c6d29a | 172 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
d72a838e | 173 | |
174 | /* Names of tree components. */ | |
175 | ||
ab1a776d | 176 | extern const char *const tree_code_name[]; |
f6cc6a08 | 177 | |
046bfc77 | 178 | /* A vectors of trees. */ |
179 | DEF_VEC_P(tree); | |
180 | DEF_VEC_ALLOC_P(tree,gc); | |
181 | DEF_VEC_ALLOC_P(tree,heap); | |
f6cc6a08 | 182 | |
d72a838e | 183 | \f |
ab7943b9 | 184 | /* Classify which part of the compiler has defined a given builtin function. |
185 | Note that we assume below that this is no more than two bits. */ | |
8305149e | 186 | enum built_in_class |
187 | { | |
188 | NOT_BUILT_IN = 0, | |
189 | BUILT_IN_FRONTEND, | |
190 | BUILT_IN_MD, | |
191 | BUILT_IN_NORMAL | |
192 | }; | |
ab7943b9 | 193 | |
194 | /* Names for the above. */ | |
8934cb0c | 195 | extern const char *const built_in_class_names[4]; |
ab7943b9 | 196 | |
d72a838e | 197 | /* Codes that identify the various built in functions |
198 | so that expand_call can identify them quickly. */ | |
199 | ||
9cfddb70 | 200 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, |
d72a838e | 201 | enum built_in_function |
202 | { | |
4e9d90c7 | 203 | #include "builtins.def" |
132bc06c | 204 | |
0dfc45b5 | 205 | /* Complex division routines in libgcc. These are done via builtins |
206 | because emit_library_call_value can't handle complex values. */ | |
207 | BUILT_IN_COMPLEX_MUL_MIN, | |
208 | BUILT_IN_COMPLEX_MUL_MAX | |
209 | = BUILT_IN_COMPLEX_MUL_MIN | |
210 | + MAX_MODE_COMPLEX_FLOAT | |
211 | - MIN_MODE_COMPLEX_FLOAT, | |
212 | ||
213 | BUILT_IN_COMPLEX_DIV_MIN, | |
214 | BUILT_IN_COMPLEX_DIV_MAX | |
215 | = BUILT_IN_COMPLEX_DIV_MIN | |
216 | + MAX_MODE_COMPLEX_FLOAT | |
217 | - MIN_MODE_COMPLEX_FLOAT, | |
218 | ||
88b5b080 | 219 | /* Upper bound on non-language-specific builtins. */ |
132bc06c | 220 | END_BUILTINS |
d72a838e | 221 | }; |
4e9d90c7 | 222 | #undef DEF_BUILTIN |
ab7943b9 | 223 | |
224 | /* Names for the above. */ | |
0dfc45b5 | 225 | extern const char * built_in_names[(int) END_BUILTINS]; |
df94cd3b | 226 | |
852da3c3 | 227 | /* Helper macros for math builtins. */ |
228 | ||
229 | #define BUILTIN_EXP10_P(FN) \ | |
230 | ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ | |
231 | || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) | |
232 | ||
233 | #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ | |
234 | || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ | |
235 | || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) | |
236 | ||
237 | #define BUILTIN_SQRT_P(FN) \ | |
238 | ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) | |
239 | ||
240 | #define BUILTIN_CBRT_P(FN) \ | |
241 | ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) | |
242 | ||
243 | #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) | |
244 | ||
4f35b1fc | 245 | #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L |
246 | #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL | |
247 | ||
df94cd3b | 248 | /* An array of _DECL trees for the above. */ |
573aba85 | 249 | extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; |
0a68165a | 250 | extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; |
d72a838e | 251 | \f |
252 | /* The definition of tree nodes fills the next several pages. */ | |
253 | ||
254 | /* A tree node can represent a data type, a variable, an expression | |
255 | or a statement. Each node has a TREE_CODE which says what kind of | |
256 | thing it represents. Some common codes are: | |
257 | INTEGER_TYPE -- represents a type of integers. | |
258 | ARRAY_TYPE -- represents a type of pointer. | |
259 | VAR_DECL -- represents a declared variable. | |
260 | INTEGER_CST -- represents a constant integer value. | |
261 | PLUS_EXPR -- represents a sum (an expression). | |
262 | ||
263 | As for the contents of a tree node: there are some fields | |
264 | that all nodes share. Each TREE_CODE has various special-purpose | |
265 | fields as well. The fields of a node are never accessed directly, | |
266 | always through accessor macros. */ | |
267 | ||
d72a838e | 268 | /* Every kind of tree node starts with this structure, |
269 | so all nodes have these fields. | |
270 | ||
a7baca71 | 271 | See the accessor macros, defined below, for documentation of the |
a7dce381 | 272 | fields. */ |
4ee9c684 | 273 | union tree_ann_d; |
d72a838e | 274 | |
1f3233d1 | 275 | struct tree_common GTY(()) |
d72a838e | 276 | { |
6a3e3d6d | 277 | tree chain; |
278 | tree type; | |
4ee9c684 | 279 | union tree_ann_d *ann; |
20f2763e | 280 | |
488c4206 | 281 | ENUM_BITFIELD(tree_code) code : 8; |
20f2763e | 282 | |
d72a838e | 283 | unsigned side_effects_flag : 1; |
284 | unsigned constant_flag : 1; | |
d72a838e | 285 | unsigned addressable_flag : 1; |
286 | unsigned volatile_flag : 1; | |
287 | unsigned readonly_flag : 1; | |
288 | unsigned unsigned_flag : 1; | |
289 | unsigned asm_written_flag: 1; | |
4ee9c684 | 290 | unsigned nowarning_flag : 1; |
66d12a6c | 291 | |
4ee9c684 | 292 | unsigned used_flag : 1; |
00dd2e9e | 293 | unsigned nothrow_flag : 1; |
d72a838e | 294 | unsigned static_flag : 1; |
295 | unsigned public_flag : 1; | |
296 | unsigned private_flag : 1; | |
297 | unsigned protected_flag : 1; | |
88da234d | 298 | unsigned deprecated_flag : 1; |
4ee9c684 | 299 | unsigned invariant_flag : 1; |
d72a838e | 300 | |
301 | unsigned lang_flag_0 : 1; | |
302 | unsigned lang_flag_1 : 1; | |
303 | unsigned lang_flag_2 : 1; | |
304 | unsigned lang_flag_3 : 1; | |
305 | unsigned lang_flag_4 : 1; | |
306 | unsigned lang_flag_5 : 1; | |
307 | unsigned lang_flag_6 : 1; | |
4ee9c684 | 308 | unsigned visited : 1; |
d72a838e | 309 | }; |
310 | ||
7e787821 | 311 | /* The following table lists the uses of each of the above flags and |
312 | for which types of nodes they are defined. Note that expressions | |
313 | include decls. | |
314 | ||
315 | addressable_flag: | |
316 | ||
317 | TREE_ADDRESSABLE in | |
60b8c5b3 | 318 | VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, |
d513ec2f | 319 | ..._TYPE, IDENTIFIER_NODE. |
320 | In a STMT_EXPR, it means we want the result of the enclosed | |
321 | expression. | |
4ee9c684 | 322 | CALL_EXPR_TAILCALL in CALL_EXPR |
7e787821 | 323 | |
324 | static_flag: | |
325 | ||
326 | TREE_STATIC in | |
997d68fe | 327 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
2cfde4f3 | 328 | BINFO_VIRTUAL_P in |
57c28194 | 329 | TREE_BINFO |
7e787821 | 330 | TREE_CONSTANT_OVERFLOW in |
886cfd4f | 331 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
7e787821 | 332 | TREE_SYMBOL_REFERENCED in |
333 | IDENTIFIER_NODE | |
a9bc793b | 334 | CLEANUP_EH_ONLY in |
dddab69e | 335 | TARGET_EXPR, WITH_CLEANUP_EXPR |
4ee9c684 | 336 | ASM_INPUT_P in |
337 | ASM_EXPR | |
338 | EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR | |
b24423db | 339 | TYPE_REF_CAN_ALIAS_ALL in |
340 | POINTER_TYPE, REFERENCE_TYPE | |
7e787821 | 341 | |
342 | public_flag: | |
343 | ||
344 | TREE_OVERFLOW in | |
886cfd4f | 345 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
7e787821 | 346 | TREE_PUBLIC in |
1e5bfc66 | 347 | VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE |
4ee9c684 | 348 | ASM_VOLATILE_P in |
349 | ASM_EXPR | |
00b76131 | 350 | TYPE_CACHED_VALUES_P in |
351 | ..._TYPE | |
0c8fe10f | 352 | SAVE_EXPR_RESOLVED_P in |
353 | SAVE_EXPR | |
7e787821 | 354 | |
355 | private_flag: | |
356 | ||
7e787821 | 357 | TREE_PRIVATE in |
a9bc793b | 358 | ..._DECL |
ea523851 | 359 | CALL_EXPR_RETURN_SLOT_OPT in |
805e22b2 | 360 | CALL_EXPR |
dddcebdc | 361 | DECL_BY_REFERENCE in |
362 | PARM_DECL, RESULT_DECL | |
7e787821 | 363 | |
364 | protected_flag: | |
365 | ||
7e787821 | 366 | TREE_PROTECTED in |
367 | BLOCK | |
a9bc793b | 368 | ..._DECL |
eaa112a0 | 369 | CALL_FROM_THUNK_P in |
491e04ef | 370 | CALL_EXPR |
7e787821 | 371 | |
372 | side_effects_flag: | |
373 | ||
374 | TREE_SIDE_EFFECTS in | |
375 | all expressions | |
66d12a6c | 376 | all decls |
377 | all constants | |
7e787821 | 378 | |
4ee9c684 | 379 | FORCED_LABEL in |
380 | LABEL_DECL | |
381 | ||
7e787821 | 382 | volatile_flag: |
383 | ||
384 | TREE_THIS_VOLATILE in | |
385 | all expressions | |
386 | TYPE_VOLATILE in | |
387 | ..._TYPE | |
388 | ||
389 | readonly_flag: | |
390 | ||
391 | TREE_READONLY in | |
997d68fe | 392 | all expressions |
7e787821 | 393 | TYPE_READONLY in |
394 | ..._TYPE | |
395 | ||
396 | constant_flag: | |
397 | ||
398 | TREE_CONSTANT in | |
399 | all expressions | |
66d12a6c | 400 | all decls |
401 | all constants | |
bc97b18f | 402 | TYPE_SIZES_GIMPLIFIED |
403 | ..._TYPE | |
7e787821 | 404 | |
7e787821 | 405 | unsigned_flag: |
406 | ||
78a8ed03 | 407 | TYPE_UNSIGNED in |
408 | all types | |
86ae60fd | 409 | DECL_UNSIGNED in |
410 | all decls | |
411 | BIT_FIELD_REF_UNSIGNED in | |
412 | BIT_FIELD_REF | |
7e787821 | 413 | |
414 | asm_written_flag: | |
415 | ||
416 | TREE_ASM_WRITTEN in | |
417 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
4ee9c684 | 418 | BLOCK, SSA_NAME |
7e787821 | 419 | |
420 | used_flag: | |
421 | ||
422 | TREE_USED in | |
423 | expressions, IDENTIFIER_NODE | |
424 | ||
00dd2e9e | 425 | nothrow_flag: |
7e787821 | 426 | |
00dd2e9e | 427 | TREE_NOTHROW in |
428 | CALL_EXPR, FUNCTION_DECL | |
7e787821 | 429 | |
9f5f9308 | 430 | TYPE_ALIGN_OK in |
431 | ..._TYPE | |
432 | ||
010d0641 | 433 | TREE_THIS_NOTRAP in |
b056d812 | 434 | (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF |
010d0641 | 435 | |
88da234d | 436 | deprecated_flag: |
437 | ||
438 | TREE_DEPRECATED in | |
439 | ..._DECL | |
eaa112a0 | 440 | |
f4a30bd7 | 441 | IDENTIFIER_TRANSPARENT_ALIAS in |
442 | IDENTIFIER_NODE | |
443 | ||
4ee9c684 | 444 | visited: |
445 | ||
446 | Used in tree traversals to mark visited nodes. | |
447 | ||
448 | invariant_flag: | |
449 | ||
450 | TREE_INVARIANT in | |
451 | all expressions. | |
452 | ||
453 | nowarning_flag: | |
454 | ||
455 | TREE_NO_WARNING in | |
55c151dc | 456 | ... any expr or decl node |
88da234d | 457 | */ |
5ded8c6f | 458 | #undef DEFTREESTRUCT |
459 | #define DEFTREESTRUCT(ENUM, NAME) ENUM, | |
460 | enum tree_node_structure_enum { | |
461 | #include "treestruct.def" | |
462 | LAST_TS_ENUM | |
463 | }; | |
464 | #undef DEFTREESTRUCT | |
716fc477 | 465 | |
d72a838e | 466 | /* Define accessors for the fields that all tree nodes have |
467 | (though some fields are not used for all kinds of nodes). */ | |
468 | ||
469 | /* The tree-code says what kind of node it is. | |
470 | Codes are defined in tree.def. */ | |
471 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
2aea9e36 | 472 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE)) |
d72a838e | 473 | |
3e207e38 | 474 | /* When checking is enabled, errors will be generated if a tree node |
1fa3a8f6 | 475 | is accessed incorrectly. The macros die with a fatal error. */ |
0c4e40c5 | 476 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
3e207e38 | 477 | |
5e674ace | 478 | #define TREE_CHECK(T, CODE) __extension__ \ |
479 | ({ const tree __t = (T); \ | |
480 | if (TREE_CODE (__t) != (CODE)) \ | |
36066e37 | 481 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
482 | (CODE), 0); \ | |
483 | __t; }) | |
484 | ||
485 | #define TREE_NOT_CHECK(T, CODE) __extension__ \ | |
486 | ({ const tree __t = (T); \ | |
487 | if (TREE_CODE (__t) == (CODE)) \ | |
488 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
489 | (CODE), 0); \ | |
a4070a91 | 490 | __t; }) |
5e674ace | 491 | |
82bb2115 | 492 | #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ |
493 | ({ const tree __t = (T); \ | |
494 | if (TREE_CODE (__t) != (CODE1) \ | |
495 | && TREE_CODE (__t) != (CODE2)) \ | |
36066e37 | 496 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
497 | (CODE1), (CODE2), 0); \ | |
498 | __t; }) | |
499 | ||
500 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \ | |
501 | ({ const tree __t = (T); \ | |
502 | if (TREE_CODE (__t) == (CODE1) \ | |
503 | || TREE_CODE (__t) == (CODE2)) \ | |
504 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
505 | (CODE1), (CODE2), 0); \ | |
82bb2115 | 506 | __t; }) |
507 | ||
508 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
509 | ({ const tree __t = (T); \ | |
510 | if (TREE_CODE (__t) != (CODE1) \ | |
511 | && TREE_CODE (__t) != (CODE2) \ | |
512 | && TREE_CODE (__t) != (CODE3)) \ | |
36066e37 | 513 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
514 | (CODE1), (CODE2), (CODE3), 0); \ | |
515 | __t; }) | |
516 | ||
517 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
518 | ({ const tree __t = (T); \ | |
519 | if (TREE_CODE (__t) == (CODE1) \ | |
520 | || TREE_CODE (__t) == (CODE2) \ | |
521 | || TREE_CODE (__t) == (CODE3)) \ | |
522 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
523 | (CODE1), (CODE2), (CODE3), 0); \ | |
82bb2115 | 524 | __t; }) |
525 | ||
b24423db | 526 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ |
527 | ({ const tree __t = (T); \ | |
528 | if (TREE_CODE (__t) != (CODE1) \ | |
529 | && TREE_CODE (__t) != (CODE2) \ | |
530 | && TREE_CODE (__t) != (CODE3) \ | |
531 | && TREE_CODE (__t) != (CODE4)) \ | |
36066e37 | 532 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
533 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
534 | __t; }) | |
535 | ||
536 | #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ | |
537 | ({ const tree __t = (T); \ | |
538 | if (TREE_CODE (__t) == (CODE1) \ | |
539 | || TREE_CODE (__t) == (CODE2) \ | |
540 | || TREE_CODE (__t) == (CODE3) \ | |
541 | || TREE_CODE (__t) == (CODE4)) \ | |
542 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
543 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
b24423db | 544 | __t; }) |
545 | ||
82bb2115 | 546 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ |
547 | ({ const tree __t = (T); \ | |
548 | if (TREE_CODE (__t) != (CODE1) \ | |
549 | && TREE_CODE (__t) != (CODE2) \ | |
550 | && TREE_CODE (__t) != (CODE3) \ | |
551 | && TREE_CODE (__t) != (CODE4) \ | |
552 | && TREE_CODE (__t) != (CODE5)) \ | |
36066e37 | 553 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
554 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
555 | __t; }) | |
556 | ||
557 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ | |
558 | ({ const tree __t = (T); \ | |
559 | if (TREE_CODE (__t) == (CODE1) \ | |
560 | || TREE_CODE (__t) == (CODE2) \ | |
561 | || TREE_CODE (__t) == (CODE3) \ | |
562 | || TREE_CODE (__t) == (CODE4) \ | |
563 | || TREE_CODE (__t) == (CODE5)) \ | |
564 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
565 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
82bb2115 | 566 | __t; }) |
567 | ||
5ded8c6f | 568 | #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \ |
569 | ({ const tree __t = (T); \ | |
570 | if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \ | |
571 | tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \ | |
572 | __FUNCTION__); \ | |
573 | __t; }) | |
574 | ||
5e674ace | 575 | #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ |
576 | ({ const tree __t = (T); \ | |
577 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ | |
578 | tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ | |
76c6f48d | 579 | __FUNCTION__); \ |
a4070a91 | 580 | __t; }) |
581 | ||
582 | /* These checks have to be special cased. */ | |
5e674ace | 583 | #define EXPR_CHECK(T) __extension__ \ |
584 | ({ const tree __t = (T); \ | |
585 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
47549347 | 586 | if (!IS_EXPR_CODE_CLASS (__c)) \ |
ce45a448 | 587 | tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \ |
66d12a6c | 588 | __FUNCTION__); \ |
589 | __t; }) | |
590 | ||
591 | /* These checks have to be special cased. */ | |
592 | #define NON_TYPE_CHECK(T) __extension__ \ | |
593 | ({ const tree __t = (T); \ | |
5dd4318b | 594 | if (TYPE_P (__t)) \ |
ce45a448 | 595 | tree_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \ |
76c6f48d | 596 | __FUNCTION__); \ |
a4070a91 | 597 | __t; }) |
598 | ||
5e674ace | 599 | #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ |
600 | (*({const tree __t = (T); \ | |
601 | const int __i = (I); \ | |
66bc87db | 602 | if (TREE_CODE (__t) != TREE_VEC) \ |
36066e37 | 603 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
604 | TREE_VEC, 0); \ | |
66bc87db | 605 | if (__i < 0 || __i >= __t->vec.length) \ |
606 | tree_vec_elt_check_failed (__i, __t->vec.length, \ | |
607 | __FILE__, __LINE__, __FUNCTION__); \ | |
608 | &__t->vec.a[__i]; })) | |
609 | ||
4ee9c684 | 610 | #define PHI_NODE_ELT_CHECK(t, i) __extension__ \ |
611 | (*({const tree __t = t; \ | |
612 | const int __i = (i); \ | |
613 | if (TREE_CODE (__t) != PHI_NODE) \ | |
36066e37 | 614 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
615 | PHI_NODE, 0); \ | |
4ee9c684 | 616 | if (__i < 0 || __i >= __t->phi.capacity) \ |
617 | phi_node_elt_check_failed (__i, __t->phi.num_args, \ | |
618 | __FILE__, __LINE__, __FUNCTION__); \ | |
619 | &__t->phi.a[__i]; })) | |
620 | ||
2fcde217 | 621 | /* Special checks for TREE_OPERANDs. */ |
5e674ace | 622 | #define TREE_OPERAND_CHECK(T, I) __extension__ \ |
acdc09d1 | 623 | (*({const tree __t = EXPR_CHECK (T); \ |
5e674ace | 624 | const int __i = (I); \ |
2fcde217 | 625 | if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ |
626 | tree_operand_check_failed (__i, TREE_CODE (__t), \ | |
627 | __FILE__, __LINE__, __FUNCTION__); \ | |
628 | &__t->exp.operands[__i]; })) | |
629 | ||
5e674ace | 630 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ |
631 | (*({const tree __t = (T); \ | |
632 | const int __i = (I); \ | |
633 | if (TREE_CODE (__t) != CODE) \ | |
36066e37 | 634 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\ |
5e674ace | 635 | if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \ |
636 | tree_operand_check_failed (__i, (CODE), \ | |
2fcde217 | 637 | __FILE__, __LINE__, __FUNCTION__); \ |
638 | &__t->exp.operands[__i]; })) | |
639 | ||
5e674ace | 640 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \ |
2fcde217 | 641 | (*(rtx *) \ |
5e674ace | 642 | ({const tree __t = (T); \ |
643 | const int __i = (I); \ | |
644 | if (TREE_CODE (__t) != (CODE)) \ | |
36066e37 | 645 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \ |
5e674ace | 646 | if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \ |
647 | tree_operand_check_failed (__i, (CODE), \ | |
2fcde217 | 648 | __FILE__, __LINE__, __FUNCTION__); \ |
649 | &__t->exp.operands[__i]; })) | |
650 | ||
5ded8c6f | 651 | extern void tree_contains_struct_check_failed (const tree, |
652 | const enum tree_node_structure_enum, | |
653 | const char *, int, const char *) | |
654 | ATTRIBUTE_NORETURN; | |
655 | ||
36066e37 | 656 | extern void tree_check_failed (const tree, const char *, int, const char *, |
657 | ...) ATTRIBUTE_NORETURN; | |
658 | extern void tree_not_check_failed (const tree, const char *, int, const char *, | |
659 | ...) ATTRIBUTE_NORETURN; | |
ce45a448 | 660 | extern void tree_class_check_failed (const tree, const enum tree_code_class, |
60b8c5b3 | 661 | const char *, int, const char *) |
a4070a91 | 662 | ATTRIBUTE_NORETURN; |
60b8c5b3 | 663 | extern void tree_vec_elt_check_failed (int, int, const char *, |
664 | int, const char *) | |
66bc87db | 665 | ATTRIBUTE_NORETURN; |
4ee9c684 | 666 | extern void phi_node_elt_check_failed (int, int, const char *, |
667 | int, const char *) | |
668 | ATTRIBUTE_NORETURN; | |
60b8c5b3 | 669 | extern void tree_operand_check_failed (int, enum tree_code, |
670 | const char *, int, const char *) | |
2fcde217 | 671 | ATTRIBUTE_NORETURN; |
60b8c5b3 | 672 | |
0c4e40c5 | 673 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
3e207e38 | 674 | |
5ded8c6f | 675 | #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) |
82bb2115 | 676 | #define TREE_CHECK(T, CODE) (T) |
36066e37 | 677 | #define TREE_NOT_CHECK(T, CODE) (T) |
82bb2115 | 678 | #define TREE_CHECK2(T, CODE1, CODE2) (T) |
36066e37 | 679 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) |
82bb2115 | 680 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) |
36066e37 | 681 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) |
b24423db | 682 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
36066e37 | 683 | #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
82bb2115 | 684 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
36066e37 | 685 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
82bb2115 | 686 | #define TREE_CLASS_CHECK(T, CODE) (T) |
687 | #define EXPR_CHECK(T) (T) | |
66d12a6c | 688 | #define NON_TYPE_CHECK(T) (T) |
82bb2115 | 689 | #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
690 | #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) | |
691 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) | |
5e674ace | 692 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I])) |
4ee9c684 | 693 | #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i]) |
a4070a91 | 694 | |
695 | #endif | |
696 | ||
4ee9c684 | 697 | #define TREE_BLOCK(NODE) ((NODE)->exp.block) |
698 | ||
a4070a91 | 699 | #include "tree-check.h" |
700 | ||
ce45a448 | 701 | #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) |
5ded8c6f | 702 | #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) |
437f5d6b | 703 | #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG) |
5ded8c6f | 704 | #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) |
705 | #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) | |
706 | #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) | |
707 | #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) | |
ce45a448 | 708 | #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) |
709 | #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) | |
82bb2115 | 710 | #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
b24423db | 711 | #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
82bb2115 | 712 | |
3cb98335 | 713 | #define RECORD_OR_UNION_CHECK(T) \ |
82bb2115 | 714 | TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
3cb98335 | 715 | #define NOT_RECORD_OR_UNION_CHECK(T) \ |
716 | TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) | |
491e04ef | 717 | |
82bb2115 | 718 | #define NUMERICAL_TYPE_CHECK(T) \ |
719 | TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \ | |
720 | CHAR_TYPE, REAL_TYPE) | |
3e207e38 | 721 | |
d72a838e | 722 | /* In all nodes that are expressions, this is the data type of the expression. |
723 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
8a95ab85 | 724 | In ARRAY_TYPE nodes, this is the type of the elements. |
725 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
d72a838e | 726 | #define TREE_TYPE(NODE) ((NODE)->common.type) |
727 | ||
3609f4f0 | 728 | /* Here is how primitive or already-canonicalized types' hash codes |
729 | are made. */ | |
908e5f41 | 730 | #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
731 | ||
732 | /* A simple hash function for an arbitrary tree node. This must not be | |
733 | used in hash tables which are saved to a PCH. */ | |
734 | #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) | |
3609f4f0 | 735 | |
d72a838e | 736 | /* Nodes are chained together for many purposes. |
737 | Types are chained together to record them for being output to the debugger | |
738 | (see the function `chain_type'). | |
739 | Decls in the same scope are chained together to record the contents | |
740 | of the scope. | |
741 | Statement nodes for successive statements used to be chained together. | |
742 | Often lists of things are represented by TREE_LIST nodes that | |
743 | are chained together. */ | |
744 | ||
745 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
746 | ||
747 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
748 | that don't change the machine mode. */ | |
749 | ||
bdcbc557 | 750 | #define STRIP_NOPS(EXP) \ |
d72a838e | 751 | while ((TREE_CODE (EXP) == NOP_EXPR \ |
752 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
753 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 754 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
d72a838e | 755 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
756 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
7ec74242 | 757 | (EXP) = TREE_OPERAND (EXP, 0) |
f2bfbd07 | 758 | |
155b05dc | 759 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
760 | ||
761 | #define STRIP_SIGN_NOPS(EXP) \ | |
762 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
763 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
764 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 765 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
155b05dc | 766 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
767 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
78a8ed03 | 768 | && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \ |
769 | == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
7ec74242 | 770 | (EXP) = TREE_OPERAND (EXP, 0) |
155b05dc | 771 | |
f2bfbd07 | 772 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
773 | ||
774 | #define STRIP_TYPE_NOPS(EXP) \ | |
775 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
776 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
777 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 778 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
f2bfbd07 | 779 | && (TREE_TYPE (EXP) \ |
780 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
7ec74242 | 781 | (EXP) = TREE_OPERAND (EXP, 0) |
ffcb8a96 | 782 | |
4ee9c684 | 783 | /* Remove unnecessary type conversions according to |
784 | tree_ssa_useless_type_conversion. */ | |
785 | ||
786 | #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ | |
787 | while (tree_ssa_useless_type_conversion (EXP)) \ | |
788 | EXP = TREE_OPERAND (EXP, 0) | |
789 | ||
ffcb8a96 | 790 | /* Nonzero if TYPE represents an integral type. Note that we do not |
9843a47d | 791 | include COMPLEX types here. Keep these checks in ascending code |
f7f07c95 | 792 | order. */ |
ffcb8a96 | 793 | |
794 | #define INTEGRAL_TYPE_P(TYPE) \ | |
9843a47d | 795 | (TREE_CODE (TYPE) == ENUMERAL_TYPE \ |
796 | || TREE_CODE (TYPE) == BOOLEAN_TYPE \ | |
797 | || TREE_CODE (TYPE) == CHAR_TYPE \ | |
798 | || TREE_CODE (TYPE) == INTEGER_TYPE) | |
ffcb8a96 | 799 | |
4b69983d | 800 | /* Nonzero if TYPE represents a scalar floating-point type. */ |
801 | ||
802 | #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) | |
803 | ||
804 | /* Nonzero if TYPE represents a complex floating-point type. */ | |
805 | ||
806 | #define COMPLEX_FLOAT_TYPE_P(TYPE) \ | |
807 | (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
808 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
809 | ||
4c779744 | 810 | /* Nonzero if TYPE represents a vector floating-point type. */ |
811 | ||
812 | #define VECTOR_FLOAT_TYPE_P(TYPE) \ | |
813 | (TREE_CODE (TYPE) == VECTOR_TYPE \ | |
814 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
815 | ||
ffcb8a96 | 816 | /* Nonzero if TYPE represents a floating-point type, including complex |
9843a47d | 817 | and vector floating-point types. The vector and complex check does |
818 | not use the previous two macros to enable early folding. */ | |
ffcb8a96 | 819 | |
9843a47d | 820 | #define FLOAT_TYPE_P(TYPE) \ |
821 | (SCALAR_FLOAT_TYPE_P (TYPE) \ | |
822 | || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
823 | || TREE_CODE (TYPE) == VECTOR_TYPE) \ | |
824 | && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) | |
68db3216 | 825 | |
9843a47d | 826 | /* Nonzero if TYPE represents an aggregate (multi-component) type. |
827 | Keep these checks in ascending code order. */ | |
68db3216 | 828 | |
829 | #define AGGREGATE_TYPE_P(TYPE) \ | |
830 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
16037b31 | 831 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE) |
e57949ab | 832 | |
1c15359d | 833 | /* Nonzero if TYPE represents a pointer or reference type. |
9843a47d | 834 | (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in |
835 | ascending code order. */ | |
e57949ab | 836 | |
837 | #define POINTER_TYPE_P(TYPE) \ | |
838 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
1071e86e | 839 | |
4b72716d | 840 | /* Nonzero if this type is a complete type. */ |
841 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
842 | ||
5c803577 | 843 | /* Nonzero if this type is the (possibly qualified) void type. */ |
c92b3a11 | 844 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
5c803577 | 845 | |
4b72716d | 846 | /* Nonzero if this type is complete or is cv void. */ |
847 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
56ba46a4 | 848 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
4b72716d | 849 | |
850 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
851 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
7ec74242 | 852 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
4b72716d | 853 | |
d72a838e | 854 | \f |
855 | /* Define many boolean fields that all tree nodes have. */ | |
856 | ||
857 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
858 | So it cannot be in a register. | |
859 | In a FUNCTION_DECL, nonzero means its address is needed. | |
860 | So it must be compiled even if it is an inline function. | |
cec9f9b5 | 861 | In a FIELD_DECL node, it means that the programmer is permitted to |
862 | construct the address of this field. This is used for aliasing | |
863 | purposes: see record_component_aliases. | |
d72a838e | 864 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
6c34d0c2 | 865 | In LABEL_DECL nodes, it means a goto for this label has been seen |
d72a838e | 866 | from a place outside all binding contours that restore stack levels. |
867 | In ..._TYPE nodes, it means that objects of this type must | |
868 | be fully addressable. This means that pieces of this | |
869 | object cannot go into register parameters, for example. | |
870 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
871 | had its address taken. That matters for inline functions. */ | |
872 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
873 | ||
6070c035 | 874 | /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the |
875 | exit of a function. Calls for which this is true are candidates for tail | |
876 | call optimizations. */ | |
4ee9c684 | 877 | #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag) |
878 | ||
d72a838e | 879 | /* In a VAR_DECL, nonzero means allocate static storage. |
bc3a4bfd | 880 | In a FUNCTION_DECL, nonzero if function has been defined. |
b24423db | 881 | In a CONSTRUCTOR, nonzero means allocate static storage. |
882 | ||
883 | ??? This is also used in lots of other nodes in unclear ways which | |
884 | should be cleaned up some day. */ | |
d72a838e | 885 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) |
886 | ||
dddab69e | 887 | /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup |
888 | should only be executed if an exception is thrown, not on normal exit | |
889 | of its scope. */ | |
a9bc793b | 890 | #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag) |
891 | ||
4ee9c684 | 892 | /* In an expr node (usually a conversion) this means the node was made |
55c151dc | 893 | implicitly and should not lead to any sort of warning. In a decl node, |
894 | warnings concerning the decl should be suppressed. This is used at | |
895 | least for used-before-set warnings, and it set after one warning is | |
896 | emitted. */ | |
4ee9c684 | 897 | #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag) |
d72a838e | 898 | |
886cfd4f | 899 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means |
900 | there was an overflow in folding. This is distinct from | |
901 | TREE_OVERFLOW because ANSI C requires a diagnostic when overflows | |
902 | occur in constant expressions. */ | |
b24423db | 903 | #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag) |
7eec364c | 904 | |
2cf6f20a | 905 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
906 | this string as an argument. */ | |
56ba46a4 | 907 | #define TREE_SYMBOL_REFERENCED(NODE) \ |
76c6f48d | 908 | (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag) |
2cf6f20a | 909 | |
b24423db | 910 | /* Nonzero in a pointer or reference type means the data pointed to |
911 | by this type can alias anything. */ | |
912 | #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ | |
913 | (PTR_OR_REF_CHECK (NODE)->common.static_flag) | |
914 | ||
886cfd4f | 915 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
916 | there was an overflow in folding, and no warning has been issued | |
b24423db | 917 | for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, |
05812c7f | 918 | but not vice versa. */ |
b24423db | 919 | |
05812c7f | 920 | #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag) |
7eec364c | 921 | |
d72a838e | 922 | /* In a VAR_DECL or FUNCTION_DECL, |
923 | nonzero means name is to be accessible from outside this module. | |
1e5bfc66 | 924 | In an IDENTIFIER_NODE, nonzero means an external declaration |
4bbea254 | 925 | accessible from outside this module was previously seen |
d72a838e | 926 | for this name in an inner scope. */ |
927 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
928 | ||
00b76131 | 929 | /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector |
930 | of cached values, or is something else. */ | |
931 | #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag) | |
0c8fe10f | 932 | |
933 | /* In a SAVE_EXPR, indicates that the original expression has already | |
934 | been substituted with a VAR_DECL that contains the value. */ | |
935 | #define SAVE_EXPR_RESOLVED_P(NODE) \ | |
936 | (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag) | |
00b76131 | 937 | |
66d12a6c | 938 | /* In any expression, decl, or constant, nonzero means it has side effects or |
939 | reevaluation of the whole expression could produce a different value. | |
940 | This is set if any subexpression is a function call, a side effect or a | |
941 | reference to a volatile variable. In a ..._DECL, this is set only if the | |
942 | declaration said `volatile'. This will never be set for a constant. */ | |
943 | #define TREE_SIDE_EFFECTS(NODE) \ | |
944 | (NON_TYPE_CHECK (NODE)->common.side_effects_flag) | |
d72a838e | 945 | |
4ee9c684 | 946 | /* In a LABEL_DECL, nonzero means this label had its address taken |
947 | and therefore can never be deleted and is a jump target for | |
948 | computed gotos. */ | |
949 | #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag) | |
950 | ||
d72a838e | 951 | /* Nonzero means this expression is volatile in the C sense: |
952 | its address should be of type `volatile WHATEVER *'. | |
953 | In other words, the declared item is volatile qualified. | |
954 | This is used in _DECL nodes and _REF nodes. | |
bcde7378 | 955 | On a FUNCTION_DECL node, this means the function does not |
956 | return normally. This is the same effect as setting | |
957 | the attribute noreturn on the function in C. | |
d72a838e | 958 | |
959 | In a ..._TYPE node, means this type is volatile-qualified. | |
960 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
961 | because eventually we may make that a different bit. | |
962 | ||
963 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
964 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
965 | ||
010d0641 | 966 | /* Nonzero means this node will not trap. In an INDIRECT_REF, means |
967 | accessing the memory pointed to won't generate a trap. However, | |
968 | this only applies to an object when used appropriately: it doesn't | |
b056d812 | 969 | mean that writing a READONLY mem won't trap. Similarly for |
970 | ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF. | |
491e04ef | 971 | |
7d23383d | 972 | In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index |
973 | (or slice of the array) always belongs to the range of the array. | |
974 | I.e. that the access will not trap, provided that the access to | |
975 | the base to the array will not trap. */ | |
010d0641 | 976 | #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag) |
977 | ||
d72a838e | 978 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, |
66d12a6c | 979 | nonzero means it may not be the lhs of an assignment. */ |
980 | #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag) | |
d72a838e | 981 | |
a8b24921 | 982 | /* Nonzero if NODE is a _DECL with TREE_READONLY set. */ |
ce45a448 | 983 | #define TREE_READONLY_DECL_P(NODE)\ |
984 | (DECL_P (NODE) && TREE_READONLY (NODE)) | |
1431bff6 | 985 | |
66d12a6c | 986 | /* Value of expression is constant. Always on in all ..._CST nodes. May |
987 | also appear in an expression or decl where the value is constant. */ | |
988 | #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag) | |
d72a838e | 989 | |
bc97b18f | 990 | /* Nonzero if NODE, a type, has had its sizes gimplified. */ |
991 | #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag) | |
992 | ||
86ae60fd | 993 | /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
5ded8c6f | 994 | #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag) |
86ae60fd | 995 | |
996 | /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */ | |
997 | #define BIT_FIELD_REF_UNSIGNED(NODE) \ | |
998 | (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag) | |
d72a838e | 999 | |
78a8ed03 | 1000 | /* In integral and pointer types, means an unsigned type. */ |
1001 | #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag) | |
1002 | ||
56ba46a4 | 1003 | #define TYPE_TRAP_SIGNED(NODE) \ |
78a8ed03 | 1004 | (flag_trapv && ! TYPE_UNSIGNED (NODE)) |
bec2d490 | 1005 | |
d72a838e | 1006 | /* Nonzero in a VAR_DECL means assembler code has been written. |
1007 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
1008 | This is interesting in an inline function, since it might not need | |
1009 | to be compiled separately. | |
7dd9d898 | 1010 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
bc3a4bfd | 1011 | if the sdb debugging info for the type has been written. |
491e04ef | 1012 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
4ee9c684 | 1013 | In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal |
1014 | PHI node. */ | |
d72a838e | 1015 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
1016 | ||
1017 | /* Nonzero in a _DECL if the name is used in its scope. | |
1018 | Nonzero in an expr node means inhibit warning if value is unused. | |
1019 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
7c0a8197 | 1020 | was used. |
1021 | In a BLOCK, this means that the block contains variables that are used. */ | |
d72a838e | 1022 | #define TREE_USED(NODE) ((NODE)->common.used_flag) |
1023 | ||
00dd2e9e | 1024 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw |
1025 | an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ | |
1026 | #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag) | |
a9d9ab08 | 1027 | |
ea523851 | 1028 | /* In a CALL_EXPR, means that it's safe to use the target of the call |
1029 | expansion as the return slot for a call that returns in memory. */ | |
1030 | #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag) | |
805e22b2 | 1031 | |
dddcebdc | 1032 | /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible |
1033 | reference (and the TREE_TYPE is a pointer to the true type). */ | |
5ded8c6f | 1034 | #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag) |
dddcebdc | 1035 | |
eaa112a0 | 1036 | /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
1037 | thunked-to function. */ | |
fe9522ce | 1038 | #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag) |
eaa112a0 | 1039 | |
a9d9ab08 | 1040 | /* In a type, nonzero means that all objects of the type are guaranteed by the |
1041 | language or front-end to be properly aligned, so we can indicate that a MEM | |
1042 | of this type is aligned at least to the alignment of the type, even if it | |
1043 | doesn't appear that it is. We see this, for example, in object-oriented | |
1044 | languages where a tag field may show this is an object of a more-aligned | |
4ee9c684 | 1045 | variant of the more generic type. |
1046 | ||
1047 | In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME | |
1048 | freelist. */ | |
a9d9ab08 | 1049 | #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag) |
d72a838e | 1050 | |
bc3a4bfd | 1051 | /* Used in classes in C++. */ |
d72a838e | 1052 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
bc3a4bfd | 1053 | /* Used in classes in C++. |
1054 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
d72a838e | 1055 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
1056 | ||
f4a30bd7 | 1057 | /* Nonzero in a _DECL if the use of the name is defined as a |
88da234d | 1058 | deprecated feature by __attribute__((deprecated)). */ |
f4a30bd7 | 1059 | #define TREE_DEPRECATED(NODE) \ |
1060 | ((NODE)->common.deprecated_flag) | |
1061 | ||
1062 | /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose | |
1063 | uses are to be substituted for uses of the TREE_CHAINed identifier. */ | |
1064 | #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ | |
1065 | (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag) | |
88da234d | 1066 | |
4ee9c684 | 1067 | /* Value of expression is function invariant. A strict subset of |
1068 | TREE_CONSTANT, such an expression is constant over any one function | |
1069 | invocation, though not across different invocations. May appear in | |
1070 | any expression node. */ | |
1071 | #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag) | |
1072 | ||
bc3a4bfd | 1073 | /* These flags are available for each language front end to use internally. */ |
d72a838e | 1074 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
1075 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
1076 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
1077 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
1078 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
1079 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
1080 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
1081 | \f | |
1082 | /* Define additional fields and accessors for nodes representing constants. */ | |
1083 | ||
9e6d0a9a | 1084 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
1085 | If the data type is signed, the value is sign-extended to 2 words | |
d72a838e | 1086 | even though not all of them may really be in use. |
9e6d0a9a | 1087 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2a8a276e | 1088 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
1089 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
1090 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
d72a838e | 1091 | |
76c6f48d | 1092 | #define INT_CST_LT(A, B) \ |
1093 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
1094 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
56ba46a4 | 1095 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
d72a838e | 1096 | |
76c6f48d | 1097 | #define INT_CST_LT_UNSIGNED(A, B) \ |
1098 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
1099 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
1100 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
6c34d0c2 | 1101 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
56ba46a4 | 1102 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
60b8c5b3 | 1103 | |
1f3233d1 | 1104 | struct tree_int_cst GTY(()) |
d72a838e | 1105 | { |
851dfbff | 1106 | struct tree_common common; |
2a8a276e | 1107 | /* A sub-struct is necessary here because the function `const_hash' |
1108 | wants to scan both words as a unit and taking the address of the | |
1109 | sub-struct yields the properly inclusive bounded pointer. */ | |
1f3233d1 | 1110 | struct tree_int_cst_lowhi { |
2a8a276e | 1111 | unsigned HOST_WIDE_INT low; |
1112 | HOST_WIDE_INT high; | |
1113 | } int_cst; | |
d72a838e | 1114 | }; |
1115 | ||
479838ec | 1116 | /* In a REAL_CST node. struct real_value is an opaque entity, with |
ef258422 | 1117 | manipulators defined in real.h. We don't want tree.h depending on |
1118 | real.h and transitively on tm.h. */ | |
479838ec | 1119 | struct real_value; |
56ba46a4 | 1120 | |
ef258422 | 1121 | #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
1122 | #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) | |
d72a838e | 1123 | |
1f3233d1 | 1124 | struct tree_real_cst GTY(()) |
d72a838e | 1125 | { |
851dfbff | 1126 | struct tree_common common; |
479838ec | 1127 | struct real_value * real_cst_ptr; |
d72a838e | 1128 | }; |
1129 | ||
1130 | /* In a STRING_CST */ | |
3e207e38 | 1131 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
7d95f6a3 | 1132 | #define TREE_STRING_POINTER(NODE) \ |
1133 | ((const char *)(STRING_CST_CHECK (NODE)->string.str)) | |
d72a838e | 1134 | |
1f3233d1 | 1135 | struct tree_string GTY(()) |
d72a838e | 1136 | { |
851dfbff | 1137 | struct tree_common common; |
d72a838e | 1138 | int length; |
7d95f6a3 | 1139 | char str[1]; |
d72a838e | 1140 | }; |
1141 | ||
1142 | /* In a COMPLEX_CST node. */ | |
3e207e38 | 1143 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
1144 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
d72a838e | 1145 | |
1f3233d1 | 1146 | struct tree_complex GTY(()) |
d72a838e | 1147 | { |
851dfbff | 1148 | struct tree_common common; |
6a3e3d6d | 1149 | tree real; |
1150 | tree imag; | |
d72a838e | 1151 | }; |
886cfd4f | 1152 | |
1153 | /* In a VECTOR_CST node. */ | |
1154 | #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) | |
1155 | ||
1f3233d1 | 1156 | struct tree_vector GTY(()) |
886cfd4f | 1157 | { |
1158 | struct tree_common common; | |
886cfd4f | 1159 | tree elements; |
1160 | }; | |
d72a838e | 1161 | \f |
d856c8a6 | 1162 | #include "symtab.h" |
0d086e18 | 1163 | |
d72a838e | 1164 | /* Define fields and accessors for some special-purpose tree nodes. */ |
1165 | ||
0d086e18 | 1166 | #define IDENTIFIER_LENGTH(NODE) \ |
56ba46a4 | 1167 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
0d086e18 | 1168 | #define IDENTIFIER_POINTER(NODE) \ |
76c6f48d | 1169 | ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
af694375 | 1170 | #define IDENTIFIER_HASH_VALUE(NODE) \ |
1171 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) | |
0d086e18 | 1172 | |
1173 | /* Translate a hash table identifier pointer to a tree_identifier | |
1174 | pointer, and vice versa. */ | |
1175 | ||
1176 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
56ba46a4 | 1177 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
1178 | #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) | |
d72a838e | 1179 | |
1f3233d1 | 1180 | struct tree_identifier GTY(()) |
d72a838e | 1181 | { |
851dfbff | 1182 | struct tree_common common; |
0d086e18 | 1183 | struct ht_identifier id; |
d72a838e | 1184 | }; |
1185 | ||
1186 | /* In a TREE_LIST node. */ | |
3e207e38 | 1187 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
1188 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
d72a838e | 1189 | |
1f3233d1 | 1190 | struct tree_list GTY(()) |
d72a838e | 1191 | { |
851dfbff | 1192 | struct tree_common common; |
6a3e3d6d | 1193 | tree purpose; |
1194 | tree value; | |
d72a838e | 1195 | }; |
1196 | ||
1197 | /* In a TREE_VEC node. */ | |
3e207e38 | 1198 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
56ba46a4 | 1199 | #define TREE_VEC_END(NODE) \ |
1200 | ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) | |
d72a838e | 1201 | |
66bc87db | 1202 | #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
1203 | ||
1f3233d1 | 1204 | struct tree_vec GTY(()) |
d72a838e | 1205 | { |
851dfbff | 1206 | struct tree_common common; |
d72a838e | 1207 | int length; |
1f3233d1 | 1208 | tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; |
d72a838e | 1209 | }; |
1210 | ||
c75b4594 | 1211 | /* In a CONSTRUCTOR node. */ |
1212 | #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) | |
1213 | ||
1214 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the | |
1215 | value of each element (stored within VAL). IX must be a scratch variable | |
1216 | of unsigned integer type. */ | |
1217 | #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ | |
1218 | for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ | |
1219 | ? false \ | |
1220 | : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ | |
1221 | true); \ | |
1222 | (IX)++) | |
1223 | ||
1224 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both | |
1225 | the value of each element (stored within VAL) and its index (stored | |
1226 | within INDEX). IX must be a scratch variable of unsigned integer type. */ | |
1227 | #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ | |
1228 | for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ | |
1229 | ? false \ | |
1230 | : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ | |
1231 | (INDEX = VEC_index (constructor_elt, V, IX)->index), \ | |
1232 | true); \ | |
1233 | (IX)++) | |
1234 | ||
1235 | /* Append a new constructor element to V, with the specified INDEX and VAL. */ | |
1236 | #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ | |
1237 | do { \ | |
1238 | constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \ | |
1239 | _ce___->index = INDEX; \ | |
1240 | _ce___->value = VALUE; \ | |
1241 | } while (0) | |
1242 | ||
1243 | /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the | |
1244 | element. INDEX can optionally design the position of VALUE: in arrays, | |
1245 | it is the index where VALUE has to be placed; in structures, it is the | |
1246 | FIELD_DECL of the member. */ | |
1247 | typedef struct constructor_elt_d GTY(()) | |
1248 | { | |
1249 | tree index; | |
1250 | tree value; | |
1251 | } constructor_elt; | |
1252 | ||
1253 | DEF_VEC_O(constructor_elt); | |
1254 | DEF_VEC_ALLOC_O(constructor_elt,gc); | |
1255 | ||
1256 | struct tree_constructor GTY(()) | |
1257 | { | |
1258 | struct tree_common common; | |
1259 | VEC(constructor_elt,gc) *elts; | |
1260 | }; | |
1261 | ||
d72a838e | 1262 | /* Define fields and accessors for some nodes that represent expressions. */ |
1263 | ||
365db11e | 1264 | /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
4ee9c684 | 1265 | #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
1266 | && VOID_TYPE_P (TREE_TYPE (NODE)) \ | |
1267 | && integer_zerop (TREE_OPERAND (NODE, 0))) | |
1268 | ||
f20853dd | 1269 | /* In ordinary expression nodes. */ |
2fcde217 | 1270 | #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
3e207e38 | 1271 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) |
f20853dd | 1272 | |
b50fb4a3 | 1273 | /* In a LOOP_EXPR node. */ |
2fcde217 | 1274 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
b50fb4a3 | 1275 | |
fdfe4b3f | 1276 | #ifdef USE_MAPPED_LOCATION |
1277 | /* The source location of this expression. Non-tree_exp nodes such as | |
1278 | decls and constants can be shared among multiple locations, so | |
1279 | return nothing. */ | |
1280 | #define EXPR_LOCATION(NODE) \ | |
ce45a448 | 1281 | (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION) |
fdfe4b3f | 1282 | #define SET_EXPR_LOCATION(NODE, FROM) \ |
1283 | (EXPR_CHECK (NODE)->exp.locus = (FROM)) | |
1284 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION) | |
fbf0afd1 | 1285 | /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */ |
fdfe4b3f | 1286 | #define EXPR_LOCUS(NODE) \ |
ce45a448 | 1287 | (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL) |
fdfe4b3f | 1288 | #define SET_EXPR_LOCUS(NODE, FROM) \ |
1289 | do { source_location *loc_tmp = FROM; \ | |
1290 | EXPR_CHECK (NODE)->exp.locus \ | |
1291 | = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0) | |
1292 | #define EXPR_FILENAME(NODE) \ | |
1293 | LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus) | |
1294 | #define EXPR_LINENO(NODE) \ | |
1295 | LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) | |
1296 | #else | |
4ee9c684 | 1297 | /* The source location of this expression. Non-tree_exp nodes such as |
1298 | decls and constants can be shared among multiple locations, so | |
1299 | return nothing. */ | |
1300 | #define EXPR_LOCUS(NODE) \ | |
ce45a448 | 1301 | (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL) |
4ee9c684 | 1302 | #define SET_EXPR_LOCUS(NODE, FROM) \ |
1303 | (EXPR_CHECK (NODE)->exp.locus = (FROM)) | |
fdfe4b3f | 1304 | #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM) |
4ee9c684 | 1305 | #define EXPR_FILENAME(NODE) \ |
1306 | (EXPR_CHECK (NODE)->exp.locus->file) | |
1307 | #define EXPR_LINENO(NODE) \ | |
1308 | (EXPR_CHECK (NODE)->exp.locus->line) | |
4ee9c684 | 1309 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL) |
fdfe4b3f | 1310 | #define EXPR_LOCATION(NODE) \ |
1311 | (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION) | |
4ee9c684 | 1312 | #endif |
dae7d8ad | 1313 | |
7ebc28e0 | 1314 | /* In a TARGET_EXPR node. */ |
2fcde217 | 1315 | #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
1316 | #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) | |
1317 | #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) | |
7ebc28e0 | 1318 | |
7dd37241 | 1319 | /* DECL_EXPR accessor. This gives access to the DECL associated with |
1320 | the given declaration statement. */ | |
1321 | #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) | |
1322 | ||
4ee9c684 | 1323 | #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
1324 | ||
1325 | /* SWITCH_EXPR accessors. These give access to the condition, body and | |
1326 | original condition type (before any compiler conversions) | |
1327 | of the switch statement, respectively. */ | |
ffc8e524 | 1328 | #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) |
1329 | #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) | |
1330 | #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) | |
4ee9c684 | 1331 | |
eaae3b75 | 1332 | /* CASE_LABEL_EXPR accessors. These give access to the high and low values |
4ee9c684 | 1333 | of a case label, respectively. */ |
ffc8e524 | 1334 | #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) |
1335 | #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) | |
1336 | #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) | |
4ee9c684 | 1337 | |
aed164c3 | 1338 | /* The operands of a TARGET_MEM_REF. */ |
1339 | #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) | |
1340 | #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) | |
1341 | #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) | |
1342 | #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) | |
1343 | #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) | |
1344 | #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5)) | |
1345 | #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6)) | |
1346 | ||
4ee9c684 | 1347 | /* The operands of a BIND_EXPR. */ |
1348 | #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) | |
1349 | #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) | |
1350 | #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) | |
1351 | ||
1352 | /* GOTO_EXPR accessor. This gives access to the label associated with | |
1353 | a goto statement. */ | |
1354 | #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) | |
1355 | ||
226c2452 | 1356 | /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the |
4ee9c684 | 1357 | instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and |
1358 | ASM_CLOBBERS represent the outputs, inputs, and clobbers for the | |
1359 | statement. */ | |
ffc8e524 | 1360 | #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) |
1361 | #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) | |
1362 | #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) | |
1363 | #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) | |
4ee9c684 | 1364 | /* Nonzero if we want to create an ASM_INPUT instead of an |
1365 | ASM_OPERAND with no operands. */ | |
1366 | #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE)) | |
1367 | #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE)) | |
1368 | ||
1369 | /* COND_EXPR accessors. */ | |
1370 | #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) | |
1371 | #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) | |
1372 | #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) | |
1373 | ||
1374 | /* LABEL_EXPR accessor. This gives access to the label associated with | |
1375 | the given label expression. */ | |
1376 | #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) | |
1377 | ||
1378 | /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other | |
1379 | accessors for SSA operands. */ | |
491e04ef | 1380 | |
4ee9c684 | 1381 | /* CATCH_EXPR accessors. */ |
1382 | #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) | |
1383 | #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) | |
1384 | ||
1385 | /* EH_FILTER_EXPR accessors. */ | |
1386 | #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) | |
1387 | #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) | |
1388 | #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE)) | |
1389 | ||
215e2f1d | 1390 | /* OBJ_TYPE_REF accessors. */ |
1391 | #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) | |
1392 | #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) | |
1393 | #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) | |
1394 | ||
88dbf20f | 1395 | /* ASSERT_EXPR accessors. */ |
1396 | #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) | |
1397 | #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) | |
1398 | ||
1f3233d1 | 1399 | struct tree_exp GTY(()) |
f20853dd | 1400 | { |
851dfbff | 1401 | struct tree_common common; |
fdfe4b3f | 1402 | source_locus locus; |
f20853dd | 1403 | int complexity; |
4ee9c684 | 1404 | tree block; |
60b8c5b3 | 1405 | tree GTY ((special ("tree_exp"), |
1406 | desc ("TREE_CODE ((tree) &%0)"))) | |
1f3233d1 | 1407 | operands[1]; |
f20853dd | 1408 | }; |
1409 | \f | |
4ee9c684 | 1410 | /* SSA_NAME accessors. */ |
1411 | ||
1412 | /* Returns the variable being referenced. Once released, this is the | |
1413 | only field that can be relied upon. */ | |
1414 | #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var | |
1415 | ||
1416 | /* Returns the statement which defines this reference. Note that | |
1417 | we use the same field when chaining SSA_NAME nodes together on | |
1418 | the SSA_NAME freelist. */ | |
1419 | #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain | |
1420 | ||
1421 | /* Returns the SSA version number of this SSA name. Note that in | |
1422 | tree SSA, version numbers are not per variable and may be recycled. */ | |
1423 | #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version | |
1424 | ||
1425 | /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are | |
1426 | never output, so we can safely use the ASM_WRITTEN_FLAG for this | |
1427 | status bit. */ | |
1428 | #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ | |
1429 | SSA_NAME_CHECK (NODE)->common.asm_written_flag | |
1430 | ||
786d45db | 1431 | /* Nonzero if this SSA_NAME expression is currently on the free list of |
4ee9c684 | 1432 | SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
1433 | has no meaning for an SSA_NAME. */ | |
1434 | #define SSA_NAME_IN_FREE_LIST(NODE) \ | |
1435 | SSA_NAME_CHECK (NODE)->common.nothrow_flag | |
1436 | ||
786d45db | 1437 | /* Attributes for SSA_NAMEs for pointer-type variables. */ |
1438 | #define SSA_NAME_PTR_INFO(N) \ | |
1439 | SSA_NAME_CHECK (N)->ssa_name.ptr_info | |
1440 | ||
7cd909bf | 1441 | /* Get the value of this SSA_NAME, if available. */ |
1442 | #define SSA_NAME_VALUE(N) \ | |
1443 | SSA_NAME_CHECK (N)->ssa_name.value_handle | |
1444 | ||
f3d9a16c | 1445 | /* Auxiliary pass-specific data. */ |
1446 | #define SSA_NAME_AUX(N) \ | |
1447 | SSA_NAME_CHECK (N)->ssa_name.aux | |
491e04ef | 1448 | |
591c2a30 | 1449 | #ifndef _TREE_FLOW_H |
1450 | struct ptr_info_def; | |
786d45db | 1451 | #endif |
1452 | ||
22aa74c4 | 1453 | |
1454 | ||
fe24f256 | 1455 | /* Immediate use linking structure. This structure is used for maintaining |
22aa74c4 | 1456 | a doubly linked list of uses of an SSA_NAME. */ |
b66731e8 | 1457 | typedef struct ssa_use_operand_d GTY(()) |
22aa74c4 | 1458 | { |
b66731e8 | 1459 | struct ssa_use_operand_d* GTY((skip(""))) prev; |
1460 | struct ssa_use_operand_d* GTY((skip(""))) next; | |
22aa74c4 | 1461 | tree GTY((skip(""))) stmt; |
1462 | tree *GTY((skip(""))) use; | |
b66731e8 | 1463 | } ssa_use_operand_t; |
22aa74c4 | 1464 | |
1465 | /* Return the immediate_use information for an SSA_NAME. */ | |
1466 | #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses | |
1467 | ||
4ee9c684 | 1468 | struct tree_ssa_name GTY(()) |
1469 | { | |
1470 | struct tree_common common; | |
1471 | ||
1472 | /* _DECL wrapped by this SSA name. */ | |
1473 | tree var; | |
1474 | ||
1475 | /* SSA version number. */ | |
1476 | unsigned int version; | |
786d45db | 1477 | |
1478 | /* Pointer attributes used for alias analysis. */ | |
1479 | struct ptr_info_def *ptr_info; | |
7cd909bf | 1480 | |
4c7a0518 | 1481 | /* Value for SSA name used by various passes. |
1482 | ||
1483 | Right now only invariants are allowed to persist beyond a pass in | |
1484 | this field; in the future we will allow VALUE_HANDLEs to persist | |
1485 | as well. */ | |
1486 | tree value_handle; | |
f3d9a16c | 1487 | |
1488 | /* Auxiliary information stored with the ssa name. */ | |
1489 | PTR GTY((skip)) aux; | |
22aa74c4 | 1490 | |
1491 | /* Immediate uses list for this SSA_NAME. */ | |
b66731e8 | 1492 | struct ssa_use_operand_d imm_uses; |
4ee9c684 | 1493 | }; |
1494 | \f | |
1495 | /* In a PHI_NODE node. */ | |
22aa74c4 | 1496 | |
1497 | /* These 2 macros should be considered off limits for use by developers. If | |
1498 | you wish to access the use or def fields of a PHI_NODE in the SSA | |
1499 | optimizers, use the accessor macros found in tree-ssa-operands.h. | |
1500 | These two macros are to be used only by those accessor macros, and other | |
fe24f256 | 1501 | select places where we *absolutely* must take the address of the tree. */ |
22aa74c4 | 1502 | |
56004dc5 | 1503 | #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result |
1504 | #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def | |
4ee9c684 | 1505 | |
04f8eea3 | 1506 | /* PHI_NODEs for each basic block are chained together in a single linked |
1507 | list. The head of the list is linked from the block annotation, and | |
1508 | the link to the next PHI is in PHI_CHAIN. */ | |
1509 | #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE)) | |
1510 | ||
56004dc5 | 1511 | #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args |
1512 | #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity | |
1513 | #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I) | |
cc890649 | 1514 | #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I))) |
56004dc5 | 1515 | #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero |
af6c896a | 1516 | #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb |
22aa74c4 | 1517 | #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use |
4ee9c684 | 1518 | |
4ee9c684 | 1519 | struct phi_arg_d GTY(()) |
1520 | { | |
aa28f7e7 | 1521 | /* imm_use MUST be the first element in struct because we do some |
1522 | pointer arithmetic with it. See phi_arg_index_from_use. */ | |
b66731e8 | 1523 | struct ssa_use_operand_d imm_use; |
4ee9c684 | 1524 | tree def; |
6e9a4371 | 1525 | bool nonzero; |
4ee9c684 | 1526 | }; |
1527 | ||
1528 | struct tree_phi_node GTY(()) | |
1529 | { | |
1530 | struct tree_common common; | |
1531 | tree result; | |
1532 | int num_args; | |
1533 | int capacity; | |
1534 | ||
af6c896a | 1535 | /* Basic block to that the phi node belongs. */ |
1536 | struct basic_block_def *bb; | |
1537 | ||
882e3bab | 1538 | /* Arguments of the PHI node. These are maintained in the same |
1539 | order as predecessor edge vector BB->PREDS. */ | |
ebfac782 | 1540 | struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1]; |
4ee9c684 | 1541 | }; |
1542 | \f | |
1543 | ||
1544 | struct varray_head_tag; | |
1545 | ||
d72a838e | 1546 | /* In a BLOCK node. */ |
3e207e38 | 1547 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
3e207e38 | 1548 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
1549 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
d72a838e | 1550 | /* Note: when changing this, make sure to find the places |
1551 | that use chainon or nreverse. */ | |
7b7cc58a | 1552 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) |
3e207e38 | 1553 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
1554 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
d72a838e | 1555 | |
1556 | /* Nonzero means that this block is prepared to handle exceptions | |
1557 | listed in the BLOCK_VARS slot. */ | |
56ba46a4 | 1558 | #define BLOCK_HANDLER_BLOCK(NODE) \ |
1559 | (BLOCK_CHECK (NODE)->block.handler_block_flag) | |
d72a838e | 1560 | |
5846cb0f | 1561 | /* An index number for this block. These values are not guaranteed to |
1562 | be unique across functions -- whether or not they are depends on | |
1563 | the debugging output format in use. */ | |
1564 | #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) | |
1565 | ||
a36145ca | 1566 | /* If block reordering splits a lexical block into discontiguous |
1567 | address ranges, we'll make a copy of the original block. | |
1568 | ||
1569 | Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. | |
1570 | In that case, we have one source block that has been replicated | |
1571 | (through inlining or unrolling) into many logical blocks, and that | |
1572 | these logical blocks have different physical variables in them. | |
1573 | ||
1574 | In this case, we have one logical block split into several | |
1575 | non-contiguous address ranges. Most debug formats can't actually | |
1576 | represent this idea directly, so we fake it by creating multiple | |
1577 | logical blocks with the same variables in them. However, for those | |
1578 | that do support non-contiguous regions, these allow the original | |
1579 | logical block to be reconstructed, along with the set of address | |
1580 | ranges. | |
1581 | ||
1582 | One of the logical block fragments is arbitrarily chosen to be | |
1583 | the ORIGIN. The other fragments will point to the origin via | |
1584 | BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer | |
6c34d0c2 | 1585 | be null. The list of fragments will be chained through |
a36145ca | 1586 | BLOCK_FRAGMENT_CHAIN from the origin. */ |
1587 | ||
56ba46a4 | 1588 | #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
1589 | #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) | |
a36145ca | 1590 | |
44276901 | 1591 | /* For an inlined function, this gives the location where it was called |
1592 | from. This is only set in the top level block, which corresponds to the | |
1593 | inlined function scope. This is used in the debug output routines. */ | |
1594 | ||
1595 | #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) | |
1596 | ||
1f3233d1 | 1597 | struct tree_block GTY(()) |
d72a838e | 1598 | { |
851dfbff | 1599 | struct tree_common common; |
f20853dd | 1600 | |
1601 | unsigned handler_block_flag : 1; | |
1602 | unsigned abstract_flag : 1; | |
874a9b8d | 1603 | unsigned block_num : 30; |
f20853dd | 1604 | |
6a3e3d6d | 1605 | tree vars; |
1606 | tree subblocks; | |
1607 | tree supercontext; | |
1608 | tree abstract_origin; | |
1609 | tree fragment_origin; | |
1610 | tree fragment_chain; | |
44276901 | 1611 | location_t locus; |
d72a838e | 1612 | }; |
1613 | \f | |
1614 | /* Define fields and accessors for nodes representing data types. */ | |
1615 | ||
1616 | /* See tree.def for documentation of the use of these fields. | |
82bb2115 | 1617 | Look at the documentation of the various ..._TYPE tree codes. |
1618 | ||
3927afe0 | 1619 | Note that the type.values, type.minval, and type.maxval fields are |
82bb2115 | 1620 | overloaded and used for different macros in different kinds of types. |
1621 | Each macro must check to ensure the tree node is of the proper kind of | |
1622 | type. Note also that some of the front-ends also overload these fields, | |
1623 | so they must be checked as well. */ | |
d72a838e | 1624 | |
3e207e38 | 1625 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) |
1626 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) | |
1627 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) | |
1628 | #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) | |
82bb2115 | 1629 | #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values) |
16037b31 | 1630 | #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values) |
3cb98335 | 1631 | #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values) |
00b76131 | 1632 | #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values) |
1633 | #define TYPE_ORIG_SIZE_TYPE(NODE) \ | |
1634 | (INTEGER_TYPE_CHECK (NODE)->type.values \ | |
1635 | ? TREE_TYPE ((NODE)->type.values) : NULL_TREE) | |
3cb98335 | 1636 | #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval) |
1637 | #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval) | |
82bb2115 | 1638 | #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values) |
1639 | #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval) | |
1640 | #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval) | |
3e207e38 | 1641 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) |
1642 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
b24423db | 1643 | #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval) |
1644 | #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval) | |
82bb2115 | 1645 | #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval) |
1646 | #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval) | |
3e207e38 | 1647 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) |
1648 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
1649 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
1f3233d1 | 1650 | #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) |
3e207e38 | 1651 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) |
1652 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
1653 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
3e207e38 | 1654 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) |
3e207e38 | 1655 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) |
d72a838e | 1656 | |
e2ea7e3a | 1657 | /* For a VECTOR_TYPE node, this describes a different type which is emitted |
1658 | in the debugging output. We use this to describe a vector as a | |
1659 | structure containing an array. */ | |
49be8259 | 1660 | #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values) |
e2ea7e3a | 1661 | |
3cb98335 | 1662 | /* For record and union types, information about this type, as a base type |
fbf0afd1 | 1663 | for itself. */ |
3cb98335 | 1664 | #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo) |
1665 | ||
1666 | /* For non record and union types, used in a language-dependent way. */ | |
1667 | #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo) | |
a6a316cb | 1668 | |
b5ba9f3a | 1669 | /* The (language-specific) typed-based alias set for this type. |
1670 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
1671 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
1672 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
1673 | type can alias objects of any type. */ | |
1674 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
1675 | ||
1676 | /* Nonzero iff the typed-based alias set for this type has been | |
1677 | calculated. */ | |
56ba46a4 | 1678 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) |
b5ba9f3a | 1679 | |
a12eeaaf | 1680 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
1681 | to this type. */ | |
3e207e38 | 1682 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
a12eeaaf | 1683 | |
c3b0175e | 1684 | /* The alignment necessary for objects of this type. |
1685 | The value is an int, measured in bits. */ | |
3e207e38 | 1686 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
c3b0175e | 1687 | |
aca14577 | 1688 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1689 | 0 if it is the default for this type. */ | |
1690 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) | |
1691 | ||
89e923d8 | 1692 | /* The alignment for NODE, in bytes. */ |
56ba46a4 | 1693 | #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
89e923d8 | 1694 | |
13fad59c | 1695 | /* If your language allows you to declare types, and you want debug info |
1696 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
1697 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
1698 | type node. You then set the TYPE_STUB_DECL field of the type node | |
1699 | to point back at the TYPE_DECL node. This allows the debug routines | |
1700 | to know that the two nodes represent the same type, so that we only | |
88b5b080 | 1701 | get one debug info record for them. */ |
56ba46a4 | 1702 | #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) |
d72a838e | 1703 | |
7dd9d898 | 1704 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
1705 | has BLKmode only because it lacks the alignment requirement for | |
1706 | its size. */ | |
3e207e38 | 1707 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
d72a838e | 1708 | |
4944c3db | 1709 | /* In an INTEGER_TYPE, it means the type represents a size. We use |
1710 | this both for validity checking and to permit optimizations that | |
1711 | are unsafe for other types. Note that the C `size_t' type should | |
1712 | *not* have this flag set. The `size_t' type is simply a typedef | |
1713 | for an ordinary integer type that happens to be the type of an | |
1714 | expression returned by `sizeof'; `size_t' has no special | |
1715 | properties. Expressions whose type have TYPE_IS_SIZETYPE set are | |
1716 | always actual sizes. */ | |
d490e2f2 | 1717 | #define TYPE_IS_SIZETYPE(NODE) \ |
1718 | (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) | |
1719 | ||
1720 | /* In a FUNCTION_TYPE, indicates that the function returns with the stack | |
1721 | pointer depressed. */ | |
1722 | #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ | |
fabd00bc | 1723 | (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) |
902de8ed | 1724 | |
d72a838e | 1725 | /* Nonzero in a type considered volatile as a whole. */ |
5926a453 | 1726 | #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag) |
d72a838e | 1727 | |
1728 | /* Means this type is const-qualified. */ | |
5926a453 | 1729 | #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag) |
d72a838e | 1730 | |
a5b1863e | 1731 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
1732 | the term. */ | |
1733 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
1734 | ||
1735 | /* There is a TYPE_QUAL value for each type qualifier. They can be | |
1736 | combined by bitwise-or to form the complete set of qualifiers for a | |
1737 | type. */ | |
1738 | ||
1739 | #define TYPE_UNQUALIFIED 0x0 | |
1740 | #define TYPE_QUAL_CONST 0x1 | |
1741 | #define TYPE_QUAL_VOLATILE 0x2 | |
1742 | #define TYPE_QUAL_RESTRICT 0x4 | |
1743 | ||
1744 | /* The set of type qualifiers for this type. */ | |
716fc477 | 1745 | #define TYPE_QUALS(NODE) \ |
1746 | ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1747 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
1c15359d | 1748 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) |
a5b1863e | 1749 | |
bc3a4bfd | 1750 | /* These flags are available for each language front end to use internally. */ |
3e207e38 | 1751 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
1752 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
1753 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
1754 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
1755 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
1756 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
1757 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
d72a838e | 1758 | |
4ee9c684 | 1759 | /* Used to keep track of visited nodes in tree traversals. This is set to |
1760 | 0 by copy_node and make_node. */ | |
1761 | #define TREE_VISITED(NODE) ((NODE)->common.visited) | |
1762 | ||
b759e947 | 1763 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
1764 | that distinguish string from array of char). | |
88b5b080 | 1765 | If set in a SET_TYPE, indicates a bitstring type. */ |
3e207e38 | 1766 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
b759e947 | 1767 | |
20dd417a | 1768 | /* If non-NULL, this is an upper bound of the size (in bytes) of an |
56ba46a4 | 1769 | object of the given ARRAY_TYPE. This allows temporaries to be |
1770 | allocated. */ | |
1771 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ | |
7559a14d | 1772 | (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval) |
255218ff | 1773 | |
8a95ab85 | 1774 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
56ba46a4 | 1775 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ |
99d38b9e | 1776 | (((unsigned HOST_WIDE_INT) 1) \ |
1777 | << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision) | |
1778 | ||
1779 | /* Set precision to n when we have 2^n sub-parts of the vector. */ | |
1780 | #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ | |
1781 | (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X)) | |
8a95ab85 | 1782 | |
fcdd3ab3 | 1783 | /* Indicates that objects of this type must be initialized by calling a |
be98dac3 | 1784 | function when they are created. */ |
851dfbff | 1785 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
1786 | (TYPE_CHECK (NODE)->type.needs_constructing_flag) | |
be98dac3 | 1787 | |
fa602b3f | 1788 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
1789 | the same way that the first union alternative would be passed. */ | |
851dfbff | 1790 | #define TYPE_TRANSPARENT_UNION(NODE) \ |
1791 | (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
1792 | ||
1793 | /* For an ARRAY_TYPE, indicates that it is not permitted to | |
1794 | take the address of a component of the type. */ | |
1795 | #define TYPE_NONALIASED_COMPONENT(NODE) \ | |
1796 | (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
fa602b3f | 1797 | |
ad87de1e | 1798 | /* Indicated that objects of this type should be laid out in as |
1a8ea5c4 | 1799 | compact a way as possible. */ |
3e207e38 | 1800 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
1a8ea5c4 | 1801 | |
2bd342e5 | 1802 | /* Used by type_contains_placeholder_p to avoid recomputation. |
1803 | Values are: 0 (unknown), 1 (false), 2 (true). Never access | |
1804 | this field directly. */ | |
1805 | #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ | |
1806 | (TYPE_CHECK (NODE)->type.contains_placeholder_bits) | |
1807 | ||
1f3233d1 | 1808 | struct die_struct; |
1809 | ||
1810 | struct tree_type GTY(()) | |
d72a838e | 1811 | { |
851dfbff | 1812 | struct tree_common common; |
6a3e3d6d | 1813 | tree values; |
1814 | tree size; | |
1815 | tree size_unit; | |
1816 | tree attributes; | |
108009b4 | 1817 | unsigned int uid; |
d72a838e | 1818 | |
108009b4 | 1819 | unsigned int precision : 9; |
488c4206 | 1820 | ENUM_BITFIELD(machine_mode) mode : 7; |
a12eeaaf | 1821 | |
b759e947 | 1822 | unsigned string_flag : 1; |
d72a838e | 1823 | unsigned no_force_blk_flag : 1; |
be98dac3 | 1824 | unsigned needs_constructing_flag : 1; |
fa602b3f | 1825 | unsigned transparent_union_flag : 1; |
1a8ea5c4 | 1826 | unsigned packed_flag : 1; |
a5b1863e | 1827 | unsigned restrict_flag : 1; |
2bd342e5 | 1828 | unsigned contains_placeholder_bits : 2; |
a5b1863e | 1829 | |
d72a838e | 1830 | unsigned lang_flag_0 : 1; |
1831 | unsigned lang_flag_1 : 1; | |
1832 | unsigned lang_flag_2 : 1; | |
1833 | unsigned lang_flag_3 : 1; | |
1834 | unsigned lang_flag_4 : 1; | |
1835 | unsigned lang_flag_5 : 1; | |
1836 | unsigned lang_flag_6 : 1; | |
aca14577 | 1837 | unsigned user_align : 1; |
d72a838e | 1838 | |
c926ba81 | 1839 | unsigned int align; |
6a3e3d6d | 1840 | tree pointer_to; |
1841 | tree reference_to; | |
1f3233d1 | 1842 | union tree_type_symtab { |
60b8c5b3 | 1843 | int GTY ((tag ("0"))) address; |
1844 | char * GTY ((tag ("1"))) pointer; | |
573aba85 | 1845 | struct die_struct * GTY ((tag ("2"))) die; |
60b8c5b3 | 1846 | } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"), |
1f3233d1 | 1847 | descbits ("2"))) symtab; |
6a3e3d6d | 1848 | tree name; |
1849 | tree minval; | |
1850 | tree maxval; | |
1851 | tree next_variant; | |
1852 | tree main_variant; | |
1853 | tree binfo; | |
6a3e3d6d | 1854 | tree context; |
f7c44134 | 1855 | HOST_WIDE_INT alias_set; |
d72a838e | 1856 | /* Points to a structure whose details depend on the language in use. */ |
1857 | struct lang_type *lang_specific; | |
1858 | }; | |
1859 | \f | |
1860 | /* Define accessor macros for information about type inheritance | |
1861 | and basetypes. | |
1862 | ||
1863 | A "basetype" means a particular usage of a data type for inheritance | |
1864 | in another type. Each such basetype usage has its own "binfo" | |
1865 | object to describe it. The binfo object is a TREE_VEC node. | |
1866 | ||
1867 | Inheritance is represented by the binfo nodes allocated for a | |
1868 | given type. For example, given types C and D, such that D is | |
1869 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
1870 | the binfo properties of C, similarly one for D, and one for | |
1871 | describing the binfo properties of D as a base type for C. | |
1872 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
1873 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
1874 | ||
57c28194 | 1875 | /* BINFO specific flags. */ |
1876 | ||
1877 | /* Nonzero means that the derivation chain is via a `virtual' declaration. */ | |
1878 | #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag) | |
1879 | ||
1880 | /* Flags for language dependent use. */ | |
1881 | #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) | |
1882 | #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) | |
1883 | #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) | |
1884 | #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) | |
1885 | #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) | |
1886 | #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) | |
1887 | #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) | |
1888 | ||
d72a838e | 1889 | /* The actual data type node being inherited in this basetype. */ |
3cb98335 | 1890 | #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) |
d72a838e | 1891 | |
1892 | /* The offset where this basetype appears in its containing type. | |
1893 | BINFO_OFFSET slot holds the offset (in bytes) | |
1894 | from the base of the complete object to the base of the part of the | |
1895 | object that is allocated on behalf of this `type'. | |
1896 | This is always 0 except when there is multiple inheritance. */ | |
6c34d0c2 | 1897 | |
3cb98335 | 1898 | #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) |
d6c9423f | 1899 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
d72a838e | 1900 | |
1901 | /* The virtual function table belonging to this basetype. Virtual | |
1902 | function tables provide a mechanism for run-time method dispatching. | |
1903 | The entries of a virtual function table are language-dependent. */ | |
1904 | ||
3cb98335 | 1905 | #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) |
d72a838e | 1906 | |
1907 | /* The virtual functions in the virtual function table. This is | |
1908 | a TREE_LIST that is used as an initial approximation for building | |
1909 | a virtual function table for this basetype. */ | |
3cb98335 | 1910 | #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) |
d72a838e | 1911 | |
6ed1e0f8 | 1912 | /* A vector of binfos for the direct basetypes inherited by this |
1913 | basetype. | |
d72a838e | 1914 | |
6ed1e0f8 | 1915 | If this basetype describes type D as inherited in C, and if the |
1916 | basetypes of D are E and F, then this vector contains binfos for | |
f6cc6a08 | 1917 | inheritance of E and F by C. */ |
1918 | #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) | |
d72a838e | 1919 | |
824507ab | 1920 | /* The number of basetypes for NODE. */ |
f6cc6a08 | 1921 | #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE))) |
824507ab | 1922 | |
2cfde4f3 | 1923 | /* Accessor macro to get to the Nth base binfo of this binfo. */ |
f6cc6a08 | 1924 | #define BINFO_BASE_BINFO(NODE,N) \ |
1925 | (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N))) | |
1926 | #define BINFO_BASE_ITERATE(NODE,N,B) \ | |
1927 | (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B))) | |
1928 | #define BINFO_BASE_APPEND(NODE,T) \ | |
1929 | (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T))) | |
d6c9423f | 1930 | |
809d9739 | 1931 | /* For a BINFO record describing a virtual base class, i.e., one where |
1932 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
4b922c0c | 1933 | base. The actual contents are language-dependent. In the C++ |
1934 | front-end this field is an INTEGER_CST giving an offset into the | |
1935 | vtable where the offset to the virtual base can be found. */ | |
3cb98335 | 1936 | #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) |
44882314 | 1937 | |
95f3173a | 1938 | /* Indicates the accesses this binfo has to its bases. The values are |
1939 | access_public_node, access_protected_node or access_private_node. | |
1940 | If this array is not present, public access is implied. */ | |
2cfde4f3 | 1941 | #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) |
db77fe17 | 1942 | |
1943 | #define BINFO_BASE_ACCESS(NODE,N) \ | |
1944 | VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N)) | |
1945 | #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ | |
1946 | VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T)) | |
95f3173a | 1947 | |
f6cc6a08 | 1948 | /* The index in the VTT where this subobject's sub-VTT can be found. |
1949 | NULL_TREE if there is no sub-VTT. */ | |
1950 | #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) | |
95f3173a | 1951 | |
f6cc6a08 | 1952 | /* The index in the VTT where the vptr for this subobject can be |
1953 | found. NULL_TREE if there is no secondary vptr in the VTT. */ | |
1954 | #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) | |
1955 | ||
2cfde4f3 | 1956 | /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base |
1957 | inheriting this base for non-virtual bases. For virtual bases it | |
eea75c62 | 1958 | points either to the binfo for which this is a primary binfo, or to |
1959 | the binfo of the most derived type. */ | |
3cb98335 | 1960 | #define BINFO_INHERITANCE_CHAIN(NODE) \ |
1961 | (TREE_BINFO_CHECK(NODE)->binfo.inheritance) | |
1962 | ||
1963 | struct tree_binfo GTY (()) | |
1964 | { | |
1965 | struct tree_common common; | |
1966 | ||
1967 | tree offset; | |
1968 | tree vtable; | |
1969 | tree virtuals; | |
3cb98335 | 1970 | tree vptr_field; |
046bfc77 | 1971 | VEC(tree,gc) *base_accesses; |
3cb98335 | 1972 | tree inheritance; |
1973 | ||
f6cc6a08 | 1974 | tree vtt_subvtt; |
1975 | tree vtt_vptr; | |
f6cc6a08 | 1976 | |
046bfc77 | 1977 | VEC(tree,none) base_binfos; |
3cb98335 | 1978 | }; |
3cb98335 | 1979 | |
d72a838e | 1980 | \f |
1981 | /* Define fields and accessors for nodes representing declared names. */ | |
1982 | ||
4ee9c684 | 1983 | /* Nonzero if DECL represents a variable for the SSA passes. */ |
437f5d6b | 1984 | #define SSA_VAR_P(DECL) \ |
1985 | (TREE_CODE (DECL) == VAR_DECL \ | |
1986 | || TREE_CODE (DECL) == PARM_DECL \ | |
1987 | || TREE_CODE (DECL) == RESULT_DECL \ | |
1988 | || MTAG_P (DECL) \ | |
1989 | || (TREE_CODE (DECL) == SSA_NAME \ | |
1990 | && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ | |
1991 | || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ | |
1992 | || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \ | |
1993 | || MTAG_P (SSA_NAME_VAR (DECL))))) | |
4ee9c684 | 1994 | |
56ba46a4 | 1995 | |
56ba46a4 | 1996 | |
56ba46a4 | 1997 | |
5ded8c6f | 1998 | /* Enumerate visibility settings. */ |
1999 | #ifndef SYMBOL_VISIBILITY_DEFINED | |
2000 | #define SYMBOL_VISIBILITY_DEFINED | |
2001 | enum symbol_visibility | |
2002 | { | |
2003 | VISIBILITY_DEFAULT, | |
2004 | VISIBILITY_INTERNAL, | |
2005 | VISIBILITY_HIDDEN, | |
2006 | VISIBILITY_PROTECTED | |
2007 | }; | |
2008 | #endif | |
56ba46a4 | 2009 | |
5ded8c6f | 2010 | struct function; |
6c34d0c2 | 2011 | |
7e64c604 | 2012 | |
5ded8c6f | 2013 | /* This is the name of the object as written by the user. |
2014 | It is an IDENTIFIER_NODE. */ | |
2015 | #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) | |
56ba46a4 | 2016 | |
5ded8c6f | 2017 | /* Every ..._DECL node gets a unique number. */ |
2018 | #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) | |
7e64c604 | 2019 | |
5ded8c6f | 2020 | /* These two fields describe where in the source code the declaration |
2021 | was. If the declaration appears in several places (as for a C | |
2022 | function that is declared first and then defined later), this | |
2023 | information should refer to the definition. */ | |
2024 | #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) | |
2025 | #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) | |
2026 | #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) | |
2027 | #ifdef USE_MAPPED_LOCATION | |
2028 | #define DECL_IS_BUILTIN(DECL) \ | |
2029 | (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) | |
2030 | #else | |
2031 | #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0) | |
2032 | #endif | |
56ba46a4 | 2033 | |
40109983 | 2034 | /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
2035 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
2036 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
2037 | points to either the FUNCTION_DECL for the containing function, | |
2038 | the RECORD_TYPE or UNION_TYPE for the containing type, or | |
2039 | NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file | |
2040 | scope". */ | |
5ded8c6f | 2041 | #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) |
2042 | #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context) | |
2043 | struct tree_decl_minimal GTY(()) | |
2044 | { | |
2045 | struct tree_common common; | |
2046 | location_t locus; | |
2047 | unsigned int uid; | |
2048 | tree name; | |
2049 | tree context; | |
2050 | }; | |
2051 | ||
437f5d6b | 2052 | /* When computing aliasing information, we represent the memory pointed-to |
2053 | by pointers with artificial variables called "memory tags" (MT). There | |
2054 | are two kinds of tags: type and name. Type tags (TMT) are used in | |
2055 | type-based alias analysis, they represent all the pointed-to locations | |
2056 | and variables of the same alias set class. Name tags (NMT) are used in | |
2057 | flow-sensitive points-to alias analysis, they represent the variables | |
2058 | and memory locations pointed-to by a specific SSA_NAME pointer. */ | |
2059 | ||
2060 | struct tree_memory_tag GTY(()) | |
2061 | { | |
2062 | struct tree_decl_minimal common; | |
2063 | tree parent_var; | |
2064 | unsigned int is_global:1; | |
2065 | }; | |
2066 | ||
2067 | #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global) | |
2068 | #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->mtag.parent_var) | |
2069 | ||
5ded8c6f | 2070 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
2071 | decl node which this decl is an instance of, or else it is NULL indicating | |
2072 | that this decl is not an instance of some other decl. For example, | |
2073 | in a nested declaration of an inline function, this points back to the | |
2074 | definition. */ | |
2075 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) | |
2076 | ||
2077 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract | |
2078 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
2079 | #define DECL_ORIGIN(NODE) \ | |
2080 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) | |
2081 | ||
2082 | /* Nonzero for any sort of ..._DECL node means this decl node represents an | |
2083 | inline instance of some original (abstract) decl from an inline function; | |
2084 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
2085 | nodes can also have their abstract origin set to themselves. */ | |
2086 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ | |
2087 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) | |
2088 | ||
e3c541f0 | 2089 | /* In a DECL this is the field where attributes are stored. */ |
5ded8c6f | 2090 | #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes) |
2091 | ||
d72a838e | 2092 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
40109983 | 2093 | For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
d72a838e | 2094 | For a VAR_DECL, holds the initial value. |
2095 | For a PARM_DECL, not used--default | |
2096 | values for parameters are encoded in the type of the function, | |
66d12a6c | 2097 | not in the PARM_DECL slot. |
5ded8c6f | 2098 | For a FIELD_DECL, this is used for enumeration values and the C |
2099 | frontend uses it for temporarily storing bitwidth of bitfields. | |
66d12a6c | 2100 | |
2101 | ??? Need to figure out some way to check this isn't a PARM_DECL. */ | |
5ded8c6f | 2102 | #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) |
2103 | ||
b278476e | 2104 | /* Holds the size of the datum, in bits, as a tree expression. |
d72a838e | 2105 | Need not be constant. */ |
5ded8c6f | 2106 | #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) |
b278476e | 2107 | /* Likewise for the size in bytes. */ |
5ded8c6f | 2108 | #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) |
c6713de4 | 2109 | /* Holds the alignment required for the datum, in bits. */ |
5ded8c6f | 2110 | #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align) |
c6713de4 | 2111 | /* The alignment of NODE, in bytes. */ |
2112 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
b4bb829f | 2113 | /* For FIELD_DECLs, off_align holds the number of low-order bits of |
2114 | DECL_FIELD_OFFSET which are known to be always zero. | |
2115 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
2116 | has. */ | |
5ded8c6f | 2117 | #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align) |
8fd3ce0b | 2118 | /* Holds the machine mode corresponding to the declaration of a variable or |
2119 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
2120 | FIELD_DECL. */ | |
5ded8c6f | 2121 | #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) |
56ba46a4 | 2122 | |
fc0cc704 | 2123 | /* For FUNCTION_DECL, if it is built-in, this identifies which built-in |
2124 | operation it is. Note, however, that this field is overloaded, with | |
2125 | DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be | |
2126 | checked before any access to the former. */ | |
5ded8c6f | 2127 | #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f) |
9366434c | 2128 | #define DECL_DEBUG_EXPR_IS_FROM(NODE) \ |
5ded8c6f | 2129 | (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from) |
d72a838e | 2130 | |
5d4990a0 | 2131 | /* Nonzero for a given ..._DECL node means that the name of this node should |
2132 | be ignored for symbolic debug purposes. */ | |
5ded8c6f | 2133 | #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) |
d72a838e | 2134 | |
f7a75810 | 2135 | /* Nonzero for a given ..._DECL node means that this node represents an |
2136 | "abstract instance" of the given declaration (e.g. in the original | |
2137 | declaration of an inline function). When generating symbolic debugging | |
c3418f42 | 2138 | information, we mustn't try to generate any address information for nodes |
f7a75810 | 2139 | marked as "abstract instances" because we don't actually generate |
2140 | any code or allocate any data space for such instances. */ | |
5ded8c6f | 2141 | #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) |
f7a772a7 | 2142 | |
9ed1ded5 | 2143 | /* Language-specific decl information. */ |
5ded8c6f | 2144 | #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) |
d72a838e | 2145 | |
5ded8c6f | 2146 | /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: |
65661e93 | 2147 | do not allocate storage, and refer to a definition elsewhere. Note that |
2148 | this does not necessarily imply the entity represented by NODE | |
2149 | has no program source-level definition in this translation unit. For | |
2150 | example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and | |
2151 | DECL_EXTERNAL may be true simultaneously; that can be the case for | |
2152 | a C99 "extern inline" function. */ | |
5ded8c6f | 2153 | #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2) |
d72a838e | 2154 | |
9bc65db1 | 2155 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
de132707 | 2156 | initializations. */ |
9bc65db1 | 2157 | #define DEFAULT_INIT_PRIORITY 65535 |
2158 | #define MAX_INIT_PRIORITY 65535 | |
34341acb | 2159 | #define MAX_RESERVED_INIT_PRIORITY 100 |
9bc65db1 | 2160 | |
d72a838e | 2161 | |
2162 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
2163 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
2164 | ||
2165 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
2166 | ||
2167 | Also set in some languages for variables, etc., outside the normal | |
2168 | lexical scope, such as class instance variables. */ | |
5ded8c6f | 2169 | #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) |
d72a838e | 2170 | |
5ded8c6f | 2171 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2172 | Used in FIELD_DECLs for vtable pointers. | |
2173 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
2174 | #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) | |
d72a838e | 2175 | |
5ded8c6f | 2176 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
2177 | #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) | |
e2b04249 | 2178 | |
5ded8c6f | 2179 | /* Additional flags for language-specific uses. */ |
2180 | #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) | |
2181 | #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) | |
2182 | #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) | |
2183 | #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) | |
2184 | #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) | |
2185 | #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) | |
2186 | #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) | |
2187 | #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) | |
60f65a0a | 2188 | |
5ded8c6f | 2189 | /* Used to indicate an alias set for the memory pointed to by this |
2190 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
2191 | pointer (or reference) type. */ | |
2192 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
2193 | (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set) | |
4ee9c684 | 2194 | |
5ded8c6f | 2195 | /* Nonzero if an alias set has been assigned to this declaration. */ |
2196 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
2197 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
9c40570a | 2198 | |
5ded8c6f | 2199 | /* Nonzero for a decl which is at file scope. */ |
2200 | #define DECL_FILE_SCOPE_P(EXP) \ | |
2201 | (! DECL_CONTEXT (EXP) \ | |
2202 | || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL) | |
b212f378 | 2203 | |
5ded8c6f | 2204 | /* Nonzero for a decl that is decorated using attribute used. |
2205 | This indicates compiler tools that this decl needs to be preserved. */ | |
2206 | #define DECL_PRESERVE_P(DECL) \ | |
2207 | DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag | |
2208 | ||
2209 | /* For function local variables of COMPLEX type, indicates that the | |
2210 | variable is not aliased, and that all modifications to the variable | |
2211 | have been adjusted so that they are killing assignments. Thus the | |
2212 | variable may now be treated as a GIMPLE register, and use real | |
2213 | instead of virtual ops in SSA form. */ | |
2214 | #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \ | |
2215 | DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag | |
8f80e66d | 2216 | |
5ded8c6f | 2217 | struct tree_decl_common GTY(()) |
2218 | { | |
2219 | struct tree_decl_minimal common; | |
2220 | tree size; | |
1b53eb20 | 2221 | |
5ded8c6f | 2222 | ENUM_BITFIELD(machine_mode) mode : 8; |
2a6f0f81 | 2223 | |
5ded8c6f | 2224 | unsigned nonlocal_flag : 1; |
2225 | unsigned virtual_flag : 1; | |
2226 | unsigned ignored_flag : 1; | |
2227 | unsigned abstract_flag : 1; | |
2228 | unsigned artificial_flag : 1; | |
2229 | unsigned user_align : 1; | |
2230 | unsigned preserve_flag: 1; | |
2231 | unsigned debug_expr_is_from : 1; | |
2232 | ||
2233 | unsigned lang_flag_0 : 1; | |
2234 | unsigned lang_flag_1 : 1; | |
2235 | unsigned lang_flag_2 : 1; | |
2236 | unsigned lang_flag_3 : 1; | |
2237 | unsigned lang_flag_4 : 1; | |
2238 | unsigned lang_flag_5 : 1; | |
2239 | unsigned lang_flag_6 : 1; | |
2240 | unsigned lang_flag_7 : 1; | |
2241 | ||
2242 | /* In LABEL_DECL, this is DECL_ERROR_ISSUED. | |
2243 | In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ | |
2244 | unsigned decl_flag_0 : 1; | |
03908818 | 2245 | /* In FIELD_DECL, this is DECL_PACKED. */ |
5ded8c6f | 2246 | unsigned decl_flag_1 : 1; |
2247 | /* In FIELD_DECL, this is DECL_BIT_FIELD | |
2248 | In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. | |
03908818 | 2249 | In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */ |
5ded8c6f | 2250 | unsigned decl_flag_2 : 1; |
2251 | /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P | |
2252 | In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */ | |
2253 | unsigned decl_flag_3 : 1; | |
2254 | /* Logically, this would go in a theoretical base shared by var and parm | |
2255 | decl. */ | |
2256 | unsigned gimple_reg_flag : 1; | |
2257 | ||
2258 | union tree_decl_u1 { | |
2259 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is | |
2260 | DECL_FUNCTION_CODE. */ | |
2261 | enum built_in_function f; | |
2262 | /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this | |
2263 | is used by language-dependent code. */ | |
2264 | HOST_WIDE_INT i; | |
2265 | /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for | |
2266 | FUNCTION_DECLs). */ | |
2267 | struct tree_decl_u1_a { | |
2268 | unsigned int align : 24; | |
2269 | unsigned int off_align : 8; | |
2270 | } a; | |
2271 | } GTY ((skip)) u1; | |
2272 | ||
2273 | tree size_unit; | |
2274 | tree initial; | |
2275 | tree attributes; | |
2276 | tree abstract_origin; | |
2277 | ||
2278 | HOST_WIDE_INT pointer_alias_set; | |
2279 | /* Points to a structure whose details depend on the language in use. */ | |
2280 | struct lang_decl *lang_specific; | |
2281 | }; | |
1431bff6 | 2282 | |
75fa4f82 | 2283 | extern tree decl_value_expr_lookup (tree); |
2284 | extern void decl_value_expr_insert (tree, tree); | |
2285 | ||
afcf285e | 2286 | /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, |
2287 | if transformations have made this more complicated than evaluating the | |
2288 | decl itself. This should only be used for debugging; once this field has | |
2289 | been set, the decl itself may not legitimately appear in the function. */ | |
75fa4f82 | 2290 | #define DECL_HAS_VALUE_EXPR_P(NODE) \ |
5ded8c6f | 2291 | (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3) |
afcf285e | 2292 | #define DECL_VALUE_EXPR(NODE) \ |
5ded8c6f | 2293 | (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) |
75fa4f82 | 2294 | #define SET_DECL_VALUE_EXPR(NODE, VAL) \ |
5ded8c6f | 2295 | (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) |
afcf285e | 2296 | |
5ded8c6f | 2297 | /* Holds the RTL expression for the value of a variable or function. |
2298 | This value can be evaluated lazily for functions, variables with | |
2299 | static storage duration, and labels. */ | |
2300 | #define DECL_RTL(NODE) \ | |
2301 | (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ | |
2302 | ? (NODE)->decl_with_rtl.rtl \ | |
2303 | : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) | |
7259f3f8 | 2304 | |
5ded8c6f | 2305 | /* Set the DECL_RTL for NODE to RTL. */ |
2306 | #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) | |
26d1c5ff | 2307 | |
5ded8c6f | 2308 | /* Returns nonzero if NODE is a tree node that can contain RTL. */ |
2309 | #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) | |
2310 | ||
2311 | /* Returns nonzero if the DECL_RTL for NODE has already been set. */ | |
2312 | #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) | |
2313 | ||
2314 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for | |
2315 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
2316 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
2317 | (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) | |
2318 | ||
2319 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
2320 | #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) | |
2321 | ||
2322 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ | |
2323 | #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) | |
2324 | ||
2325 | struct tree_decl_with_rtl GTY(()) | |
2326 | { | |
2327 | struct tree_decl_common common; | |
2328 | rtx rtl; | |
2329 | }; | |
2330 | ||
2331 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the | |
2332 | byte containing the bit closest to the beginning of the structure. */ | |
2333 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) | |
2334 | ||
2335 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
2336 | field from DECL_FIELD_OFFSET. */ | |
2337 | #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) | |
2338 | ||
2339 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and | |
2340 | if so, the type that was originally specified for it. | |
2341 | TREE_TYPE may have been modified (in finish_struct). */ | |
2342 | #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) | |
2343 | ||
2344 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which | |
2345 | if nonzero, indicates that the field occupies the type. */ | |
2346 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) | |
2347 | ||
2348 | /* For FIELD_DECLs, off_align holds the number of low-order bits of | |
2349 | DECL_FIELD_OFFSET which are known to be always zero. | |
2350 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
2351 | has. */ | |
2352 | #define DECL_OFFSET_ALIGN(NODE) \ | |
2353 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align) | |
2354 | ||
2355 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
2356 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
2357 | (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X))) | |
2358 | /* 1 if the alignment for this type was requested by "aligned" attribute, | |
2359 | 0 if it is the default for this type. */ | |
2360 | ||
2361 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in | |
2362 | which this FIELD_DECL is defined. This information is needed when | |
2363 | writing debugging information about vfield and vbase decls for C++. */ | |
2364 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) | |
2365 | ||
2366 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ | |
2367 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) | |
26dfc457 | 2368 | |
d72a838e | 2369 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
2370 | specially. */ | |
5ded8c6f | 2371 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) |
56ba46a4 | 2372 | |
5ded8c6f | 2373 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
2374 | this component. */ | |
2375 | #define DECL_NONADDRESSABLE_P(NODE) \ | |
2376 | (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3) | |
8305149e | 2377 | |
5ded8c6f | 2378 | struct tree_field_decl GTY(()) |
2379 | { | |
2380 | struct tree_decl_common common; | |
2381 | ||
2382 | tree offset; | |
2383 | tree bit_field_type; | |
2384 | tree qualifier; | |
2385 | tree bit_offset; | |
2386 | tree fcontext; | |
2387 | ||
2388 | }; | |
d72a838e | 2389 | |
5ded8c6f | 2390 | /* A numeric unique identifier for a LABEL_DECL. The UID allocation is |
2391 | dense, unique within any one function, and may be used to index arrays. | |
2392 | If the value is -1, then no UID has been assigned. */ | |
2393 | #define LABEL_DECL_UID(NODE) \ | |
2394 | (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set) | |
56ba46a4 | 2395 | |
5ded8c6f | 2396 | /* In LABEL_DECL nodes, nonzero means that an error message about |
2397 | jumping into such a binding contour has been printed for this label. */ | |
2398 | #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0) | |
00dd2e9e | 2399 | |
5ded8c6f | 2400 | struct tree_label_decl GTY(()) |
2401 | { | |
2402 | struct tree_decl_with_rtl common; | |
2403 | /* Java's verifier has some need to store information about labels, | |
2404 | and was using fields that no longer exist on labels. | |
2405 | Once the verifier doesn't need these anymore, they should be removed. */ | |
2406 | tree java_field_1; | |
2407 | tree java_field_2; | |
2408 | tree java_field_3; | |
2409 | unsigned int java_field_4; | |
d72a838e | 2410 | |
5ded8c6f | 2411 | }; |
2412 | ||
2413 | struct tree_result_decl GTY(()) | |
2414 | { | |
2415 | struct tree_decl_with_rtl common; | |
2416 | }; | |
2417 | ||
2418 | struct tree_const_decl GTY(()) | |
2419 | { | |
2420 | struct tree_decl_with_rtl common; | |
2421 | }; | |
2422 | ||
2423 | /* For a PARM_DECL, records the data type used to pass the argument, | |
2424 | which may be different from the type seen in the program. */ | |
2425 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) | |
2426 | ||
2427 | /* For PARM_DECL, holds an RTL for the stack slot or register | |
2428 | where the data was actually passed. */ | |
2429 | #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) | |
2682e5d6 | 2430 | |
5ded8c6f | 2431 | struct tree_parm_decl GTY(()) |
2432 | { | |
2433 | struct tree_decl_with_rtl common; | |
2434 | rtx incoming_rtl; | |
2435 | }; | |
02e7a332 | 2436 | |
aa5ec236 | 2437 | |
5ded8c6f | 2438 | /* Nonzero in a decl means that the gimplifier has seen (or placed) |
2439 | this variable in a BIND_EXPR. */ | |
2440 | #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ | |
2441 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) | |
c8ba8c46 | 2442 | |
5ded8c6f | 2443 | /* Used to indicate that the linkage status of this DECL is not yet known, |
2444 | so it should not be output now. */ | |
2445 | #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) | |
2446 | ||
2447 | /* Nonzero for a given ..._DECL node means that no warnings should be | |
2448 | generated just because this node is unused. */ | |
2449 | #define DECL_IN_SYSTEM_HEADER(NODE) \ | |
2450 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag) | |
2451 | ||
2452 | /* Used to indicate that this DECL has weak linkage. */ | |
2453 | #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) | |
2454 | ||
2455 | /* Internal to the gimplifier. Indicates that the value is a formal | |
2456 | temporary controlled by the gimplifier. */ | |
2457 | #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \ | |
2458 | DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp | |
2459 | ||
6c1e551f | 2460 | /* Used to indicate that the DECL is a dllimport. */ |
2461 | #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) | |
9a0ce7db | 2462 | |
83b34c62 | 2463 | /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary |
2464 | based on a variable with a restrict qualified type. If it is, | |
2465 | DECL_RESTRICT_BASE returns the restrict qualified variable on which | |
2466 | it is based. */ | |
2467 | ||
2468 | #define DECL_BASED_ON_RESTRICT_P(NODE) \ | |
2469 | (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p) | |
2470 | #define DECL_GET_RESTRICT_BASE(NODE) \ | |
2471 | (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE))) | |
2472 | #define SET_DECL_RESTRICT_BASE(NODE, VAL) \ | |
2473 | (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL))) | |
2474 | ||
2475 | extern tree decl_restrict_base_lookup (tree); | |
2476 | extern void decl_restrict_base_insert (tree, tree); | |
f65e3573 | 2477 | |
d1d06be2 | 2478 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
2479 | not be put out unless it is needed in this translation unit. | |
2480 | Entities like this are shared across translation units (like weak | |
2481 | entities), but are guaranteed to be generated by any translation | |
2482 | unit that needs them, and therefore need not be put out anywhere | |
2483 | where they are not needed. DECL_COMDAT is just a hint to the | |
2484 | back-end; it is up to front-ends which set this flag to ensure | |
2485 | that there will never be any harm, other than bloat, in putting out | |
2486 | something which is DECL_COMDAT. */ | |
5ded8c6f | 2487 | #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) |
d1d06be2 | 2488 | |
5ded8c6f | 2489 | /* The name of the object as the assembler will see it (but before any |
2490 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
2491 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
2492 | #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) | |
abd28cef | 2493 | |
5ded8c6f | 2494 | /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. |
2495 | This is true of all DECL nodes except FIELD_DECL. */ | |
2496 | #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ | |
2497 | (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) | |
8f8ac140 | 2498 | |
5ded8c6f | 2499 | /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, |
2500 | the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set | |
2501 | yet. */ | |
2502 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ | |
2503 | (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) | |
d72a838e | 2504 | |
5ded8c6f | 2505 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ |
2506 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
2507 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) | |
c6f5e832 | 2508 | |
5ded8c6f | 2509 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's |
2510 | DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause | |
2511 | the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the | |
2512 | semantics of using this macro, are different than saying: | |
851dfbff | 2513 | |
5ded8c6f | 2514 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) |
a5b1863e | 2515 | |
5ded8c6f | 2516 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ |
4ee9c684 | 2517 | |
5ded8c6f | 2518 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ |
2519 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
2520 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ | |
2521 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
2522 | : (void) 0) | |
4ee9c684 | 2523 | |
5ded8c6f | 2524 | /* Records the section name in a section attribute. Used to pass |
2525 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
2526 | #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name) | |
a5b1863e | 2527 | |
5ded8c6f | 2528 | /* Value of the decls's visibility attribute */ |
2529 | #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) | |
2530 | ||
2531 | /* Nonzero means that the decl had its visibility specified rather than | |
2532 | being inferred. */ | |
2533 | #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) | |
2534 | ||
2535 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in | |
2536 | multiple translation units should be merged. */ | |
2537 | #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only) | |
2538 | ||
2539 | struct tree_decl_with_vis GTY(()) | |
2540 | { | |
2541 | struct tree_decl_with_rtl common; | |
2542 | tree assembler_name; | |
2543 | tree section_name; | |
2544 | ||
2545 | /* Belong to VAR_DECL exclusively. */ | |
2546 | unsigned defer_output:1; | |
2547 | unsigned hard_register:1; | |
2548 | unsigned thread_local:1; | |
2549 | unsigned common_flag:1; | |
2550 | unsigned in_text_section : 1; | |
2551 | unsigned gimple_formal_temp : 1; | |
6c1e551f | 2552 | unsigned dllimport_flag : 1; |
83b34c62 | 2553 | unsigned based_on_restrict_p : 1; |
5ded8c6f | 2554 | /* Used by C++. Might become a generic decl flag. */ |
2555 | unsigned shadowed_for_var_p : 1; | |
2556 | ||
2557 | /* Don't belong to VAR_DECL exclusively. */ | |
2558 | unsigned in_system_header_flag : 1; | |
2559 | unsigned weak_flag:1; | |
2560 | unsigned seen_in_bind_expr : 1; | |
2561 | unsigned comdat_flag : 1; | |
2562 | ENUM_BITFIELD(symbol_visibility) visibility : 2; | |
2563 | unsigned visibility_specified : 1; | |
2564 | /* Belong to FUNCTION_DECL exclusively. */ | |
2565 | unsigned one_only : 1; | |
2566 | unsigned init_priority_p:1; | |
2567 | ||
2568 | /* Belongs to VAR_DECL exclusively. */ | |
2569 | ENUM_BITFIELD(tls_model) tls_model : 3; | |
83b34c62 | 2570 | /* 11 unused bits. */ |
5ded8c6f | 2571 | }; |
2572 | ||
2573 | /* In a VAR_DECL that's static, | |
2574 | nonzero if the space is in the text section. */ | |
2575 | #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) | |
2576 | ||
2577 | /* Nonzero for a given ..._DECL node means that this node should be | |
2578 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
2579 | is not error_mark_node, then the decl cannot be put in .common. */ | |
2580 | #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) | |
2581 | ||
2582 | /* In a VAR_DECL, nonzero if the decl is a register variable with | |
2583 | an explicit asm specification. */ | |
2584 | #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) | |
2585 | ||
2586 | extern tree decl_debug_expr_lookup (tree); | |
2587 | extern void decl_debug_expr_insert (tree, tree); | |
2588 | /* For VAR_DECL, this is set to either an expression that it was split | |
2589 | from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of | |
2590 | subexpressions that it was split into. */ | |
2591 | #define DECL_DEBUG_EXPR(NODE) \ | |
2592 | (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) | |
2593 | ||
2594 | #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ | |
2595 | (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) | |
2596 | ||
2597 | ||
2598 | extern unsigned short decl_init_priority_lookup (tree); | |
2599 | extern void decl_init_priority_insert (tree, unsigned short); | |
2600 | ||
2601 | /* In a non-local VAR_DECL with static storage duration, this is the | |
2602 | initialization priority. If this value is zero, the NODE will be | |
2603 | initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/ | |
2604 | ||
2605 | #define DECL_HAS_INIT_PRIORITY_P(NODE) \ | |
2606 | (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) | |
2607 | #define DECL_INIT_PRIORITY(NODE) \ | |
2608 | (decl_init_priority_lookup (VAR_DECL_CHECK (NODE))) | |
2609 | #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ | |
2610 | (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL)) | |
2611 | ||
2612 | /* In a VAR_DECL, the model to use if the data should be allocated from | |
2613 | thread-local storage. */ | |
2614 | #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model) | |
2615 | ||
2616 | /* In a VAR_DECL, nonzero if the data should be allocated from | |
2617 | thread-local storage. */ | |
2618 | #define DECL_THREAD_LOCAL_P(NODE) \ | |
2619 | (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE) | |
2620 | ||
2621 | struct tree_var_decl GTY(()) | |
2622 | { | |
2623 | struct tree_decl_with_vis common; | |
2624 | }; | |
2625 | ||
2626 | ||
2627 | /* This field is used to reference anything in decl.result and is meant only | |
2628 | for use by the garbage collector. */ | |
2629 | #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) | |
2630 | ||
2631 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
2632 | Before the struct containing the FUNCTION_DECL is laid out, | |
2633 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
2634 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
2635 | function. When the class is laid out, this pointer is changed | |
2636 | to an INTEGER_CST node which is suitable for use as an index | |
2637 | into the virtual function table. | |
2638 | C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */ | |
2639 | #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex) | |
2640 | ||
2641 | struct tree_decl_non_common GTY(()) | |
2642 | ||
2643 | { | |
2644 | struct tree_decl_with_vis common; | |
2645 | /* C++ uses this in namespaces. */ | |
2646 | tree saved_tree; | |
2647 | /* C++ uses this in templates. */ | |
2648 | tree arguments; | |
2649 | /* Almost all FE's use this. */ | |
2650 | tree result; | |
2651 | /* C++ uses this in namespaces. */ | |
2652 | tree vindex; | |
2653 | }; | |
2654 | ||
2655 | /* In FUNCTION_DECL, holds the decl for the return value. */ | |
2656 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) | |
2657 | ||
2658 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ | |
2659 | #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) | |
2660 | ||
2661 | /* In a FUNCTION_DECL, the saved representation of the body of the | |
2662 | entire function. */ | |
2663 | #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree) | |
2664 | ||
2665 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
2666 | as if it were a malloc, meaning it returns a pointer that is | |
2667 | not an alias. */ | |
2668 | #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) | |
2669 | ||
2670 | /* Nonzero in a FUNCTION_DECL means this function may return more | |
2671 | than once. */ | |
2672 | #define DECL_IS_RETURNS_TWICE(NODE) \ | |
2673 | (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) | |
2674 | ||
2675 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
2676 | as "pure" function (like const function, but may read global memory). */ | |
2677 | #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) | |
2678 | ||
2679 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
2680 | as "novops" function (function that does not read global memory, | |
2681 | but may have arbitrary side effects). */ | |
2682 | #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) | |
2683 | ||
2684 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically | |
2685 | at the beginning or end of execution. */ | |
2686 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ | |
2687 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) | |
2688 | ||
2689 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
2690 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) | |
2691 | ||
2692 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should | |
2693 | be instrumented with calls to support routines. */ | |
2694 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ | |
2695 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) | |
2696 | ||
2697 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be | |
2698 | disabled in this function. */ | |
2699 | #define DECL_NO_LIMIT_STACK(NODE) \ | |
2700 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) | |
2701 | ||
2702 | /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a | |
2703 | static chain is not needed. */ | |
2704 | #define DECL_NO_STATIC_CHAIN(NODE) \ | |
2705 | (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag) | |
3a2bf8d3 | 2706 | |
e1232ce2 | 2707 | /* Nonzero for a decl that cgraph has decided should be inlined into |
2708 | at least one call site. It is not meaningful to look at this | |
2709 | directly; always use cgraph_function_possibly_inlined_p. */ | |
2710 | #define DECL_POSSIBLY_INLINED(DECL) \ | |
5ded8c6f | 2711 | FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined |
e1232ce2 | 2712 | |
5ded8c6f | 2713 | /* Nonzero in a FUNCTION_DECL means this function can be substituted |
2714 | where it is called. */ | |
2715 | #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag) | |
9423c9b7 | 2716 | |
5ded8c6f | 2717 | /* Nonzero in a FUNCTION_DECL means that this function was declared inline, |
2718 | such as via the `inline' keyword in C/C++. This flag controls the linkage | |
2719 | semantics of 'inline'; whether or not the function is inlined is | |
2720 | controlled by DECL_INLINE. */ | |
2721 | #define DECL_DECLARED_INLINE_P(NODE) \ | |
2722 | (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) | |
d471893d | 2723 | |
5ded8c6f | 2724 | /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") |
2725 | that describes the status of this function. */ | |
2726 | #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f) | |
50c96bdc | 2727 | |
5ded8c6f | 2728 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
2729 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
9c40570a | 2730 | |
5ded8c6f | 2731 | /* For a builtin function, identify which part of the compiler defined it. */ |
2732 | #define DECL_BUILT_IN_CLASS(NODE) \ | |
2733 | (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) | |
1b53eb20 | 2734 | |
5ded8c6f | 2735 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. |
2736 | VAR_DECL and PARM_DECL reserve the arguments slot for language-specific | |
2737 | uses. */ | |
2738 | #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments) | |
d460b85f | 2739 | #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments) |
d72a838e | 2740 | |
5ded8c6f | 2741 | /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the |
2742 | arguments/result/saved_tree fields by front ends. It was either inherit | |
2743 | FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL, | |
2744 | which seemed a bit strange. */ | |
d72a838e | 2745 | |
5ded8c6f | 2746 | struct tree_function_decl GTY(()) |
2747 | { | |
2748 | struct tree_decl_non_common common; | |
2749 | ||
aa5ec236 | 2750 | unsigned static_ctor_flag : 1; |
2751 | unsigned static_dtor_flag : 1; | |
5ded8c6f | 2752 | unsigned uninlinable : 1; |
2753 | unsigned possibly_inlined : 1; | |
2754 | unsigned novops_flag : 1; | |
2755 | unsigned returns_twice_flag : 1; | |
ab7943b9 | 2756 | unsigned malloc_flag : 1; |
851dfbff | 2757 | unsigned pure_flag : 1; |
5ded8c6f | 2758 | |
746149b7 | 2759 | unsigned declared_inline_flag : 1; |
5ded8c6f | 2760 | unsigned regdecl_flag : 1; |
2761 | unsigned inline_flag : 1; | |
2762 | unsigned no_instrument_function_entry_exit : 1; | |
2763 | unsigned no_limit_stack : 1; | |
2764 | ENUM_BITFIELD(built_in_class) built_in_class : 2; | |
ab7943b9 | 2765 | |
5ded8c6f | 2766 | struct function *f; |
2767 | }; | |
d72a838e | 2768 | |
5ded8c6f | 2769 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
2770 | #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result) | |
1b53eb20 | 2771 | |
5ded8c6f | 2772 | /* In a TYPE_DECL nonzero means the detail info about this type is not dumped |
2773 | into stabs. Instead it will generate cross reference ('x') of names. | |
2774 | This uses the same flag as DECL_EXTERNAL. */ | |
2775 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ | |
2776 | (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2) | |
4ee9c684 | 2777 | |
5ded8c6f | 2778 | struct tree_type_decl GTY(()) |
2779 | { | |
2780 | struct tree_decl_non_common common; | |
9a7aa5df | 2781 | |
d72a838e | 2782 | }; |
4ee9c684 | 2783 | \f |
2784 | /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. | |
2785 | To reduce overhead, the nodes containing the statements are not trees. | |
2786 | This avoids the overhead of tree_common on all linked list elements. | |
2787 | ||
2788 | Use the interface in tree-iterator.h to access this node. */ | |
2789 | ||
2790 | #define STATEMENT_LIST_HEAD(NODE) \ | |
2791 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) | |
2792 | #define STATEMENT_LIST_TAIL(NODE) \ | |
2793 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) | |
2794 | ||
2795 | struct tree_statement_list_node | |
2796 | GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) | |
2797 | { | |
2798 | struct tree_statement_list_node *prev; | |
2799 | struct tree_statement_list_node *next; | |
2800 | tree stmt; | |
2801 | }; | |
2802 | ||
2803 | struct tree_statement_list | |
2804 | GTY(()) | |
2805 | { | |
2806 | struct tree_common common; | |
2807 | struct tree_statement_list_node *head; | |
2808 | struct tree_statement_list_node *tail; | |
2809 | }; | |
6354ec2d | 2810 | |
2811 | #define VALUE_HANDLE_ID(NODE) \ | |
2812 | (VALUE_HANDLE_CHECK (NODE)->value_handle.id) | |
2813 | ||
2814 | #define VALUE_HANDLE_EXPR_SET(NODE) \ | |
2815 | (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set) | |
2816 | ||
2817 | /* Defined and used in tree-ssa-pre.c. */ | |
2818 | struct value_set; | |
2819 | ||
2820 | struct tree_value_handle GTY(()) | |
2821 | { | |
2822 | struct tree_common common; | |
2823 | ||
2824 | /* The set of expressions represented by this handle. */ | |
2825 | struct value_set * GTY ((skip)) expr_set; | |
2826 | ||
2827 | /* Unique ID for this value handle. IDs are handed out in a | |
2828 | conveniently dense form starting at 0, so that we can make | |
fbf0afd1 | 2829 | bitmaps of value handles. */ |
6354ec2d | 2830 | unsigned int id; |
2831 | }; | |
d72a838e | 2832 | \f |
2833 | /* Define the overall contents of a tree node. | |
2834 | It may be any of the structures declared above | |
2835 | for various types of node. */ | |
2836 | ||
1f3233d1 | 2837 | union tree_node GTY ((ptr_alias (union lang_tree_node), |
2838 | desc ("tree_node_structure (&%h)"))) | |
d72a838e | 2839 | { |
1f3233d1 | 2840 | struct tree_common GTY ((tag ("TS_COMMON"))) common; |
2841 | struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; | |
2842 | struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; | |
2843 | struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; | |
2844 | struct tree_string GTY ((tag ("TS_STRING"))) string; | |
2845 | struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; | |
2846 | struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; | |
5ded8c6f | 2847 | struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal; |
2848 | struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common; | |
2849 | struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl; | |
2850 | struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common; | |
2851 | struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl; | |
2852 | struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis; | |
2853 | struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl; | |
2854 | struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl; | |
2855 | struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl; | |
2856 | struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl; | |
2857 | struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl; | |
2858 | struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl; | |
2859 | struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl; | |
1f3233d1 | 2860 | struct tree_type GTY ((tag ("TS_TYPE"))) type; |
2861 | struct tree_list GTY ((tag ("TS_LIST"))) list; | |
2862 | struct tree_vec GTY ((tag ("TS_VEC"))) vec; | |
2863 | struct tree_exp GTY ((tag ("TS_EXP"))) exp; | |
4ee9c684 | 2864 | struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; |
2865 | struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi; | |
1f3233d1 | 2866 | struct tree_block GTY ((tag ("TS_BLOCK"))) block; |
3cb98335 | 2867 | struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; |
4ee9c684 | 2868 | struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; |
6354ec2d | 2869 | struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle; |
c75b4594 | 2870 | struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor; |
437f5d6b | 2871 | struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag; |
4ee9c684 | 2872 | }; |
5059aa85 | 2873 | \f |
775e7cc0 | 2874 | /* Standard named or nameless data types of the C compiler. */ |
2875 | ||
2876 | enum tree_index | |
2877 | { | |
2878 | TI_ERROR_MARK, | |
2879 | TI_INTQI_TYPE, | |
2880 | TI_INTHI_TYPE, | |
2881 | TI_INTSI_TYPE, | |
2882 | TI_INTDI_TYPE, | |
2883 | TI_INTTI_TYPE, | |
2884 | ||
2885 | TI_UINTQI_TYPE, | |
2886 | TI_UINTHI_TYPE, | |
2887 | TI_UINTSI_TYPE, | |
2888 | TI_UINTDI_TYPE, | |
2889 | TI_UINTTI_TYPE, | |
6c34d0c2 | 2890 | |
775e7cc0 | 2891 | TI_INTEGER_ZERO, |
2892 | TI_INTEGER_ONE, | |
c87787ad | 2893 | TI_INTEGER_MINUS_ONE, |
775e7cc0 | 2894 | TI_NULL_POINTER, |
2895 | ||
2896 | TI_SIZE_ZERO, | |
2897 | TI_SIZE_ONE, | |
02e7a332 | 2898 | |
2899 | TI_BITSIZE_ZERO, | |
2900 | TI_BITSIZE_ONE, | |
2901 | TI_BITSIZE_UNIT, | |
2902 | ||
2c584053 | 2903 | TI_PUBLIC, |
2904 | TI_PROTECTED, | |
2905 | TI_PRIVATE, | |
2906 | ||
3c2239cf | 2907 | TI_BOOLEAN_FALSE, |
2908 | TI_BOOLEAN_TRUE, | |
2909 | ||
775e7cc0 | 2910 | TI_COMPLEX_INTEGER_TYPE, |
2911 | TI_COMPLEX_FLOAT_TYPE, | |
2912 | TI_COMPLEX_DOUBLE_TYPE, | |
2913 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
2914 | ||
2915 | TI_FLOAT_TYPE, | |
2916 | TI_DOUBLE_TYPE, | |
2917 | TI_LONG_DOUBLE_TYPE, | |
2918 | ||
4070bd43 | 2919 | TI_FLOAT_PTR_TYPE, |
2920 | TI_DOUBLE_PTR_TYPE, | |
2921 | TI_LONG_DOUBLE_PTR_TYPE, | |
2922 | TI_INTEGER_PTR_TYPE, | |
2923 | ||
775e7cc0 | 2924 | TI_VOID_TYPE, |
2925 | TI_PTR_TYPE, | |
2926 | TI_CONST_PTR_TYPE, | |
654ef926 | 2927 | TI_SIZE_TYPE, |
73673831 | 2928 | TI_PID_TYPE, |
775e7cc0 | 2929 | TI_PTRDIFF_TYPE, |
2930 | TI_VA_LIST_TYPE, | |
a6c787e5 | 2931 | TI_VA_LIST_GPR_COUNTER_FIELD, |
2932 | TI_VA_LIST_FPR_COUNTER_FIELD, | |
3c2239cf | 2933 | TI_BOOLEAN_TYPE, |
e256d445 | 2934 | TI_FILEPTR_TYPE, |
775e7cc0 | 2935 | |
c4503c0a | 2936 | TI_DFLOAT32_TYPE, |
2937 | TI_DFLOAT64_TYPE, | |
2938 | TI_DFLOAT128_TYPE, | |
2939 | TI_DFLOAT32_PTR_TYPE, | |
2940 | TI_DFLOAT64_PTR_TYPE, | |
2941 | TI_DFLOAT128_PTR_TYPE, | |
2942 | ||
83f69b41 | 2943 | TI_VOID_LIST_NODE, |
2944 | ||
5c62f199 | 2945 | TI_MAIN_IDENTIFIER, |
2946 | ||
775e7cc0 | 2947 | TI_MAX |
2948 | }; | |
2949 | ||
1f3233d1 | 2950 | extern GTY(()) tree global_trees[TI_MAX]; |
775e7cc0 | 2951 | |
2952 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
6c34d0c2 | 2953 | |
775e7cc0 | 2954 | #define intQI_type_node global_trees[TI_INTQI_TYPE] |
2955 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
2956 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
2957 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
2958 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
2959 | ||
2960 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
2961 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
2962 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
2963 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
2964 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
2965 | ||
775e7cc0 | 2966 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
2967 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
c87787ad | 2968 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
775e7cc0 | 2969 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
2970 | #define size_one_node global_trees[TI_SIZE_ONE] | |
02e7a332 | 2971 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
2972 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
2973 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
2974 | ||
95f3173a | 2975 | /* Base access nodes. */ |
2c584053 | 2976 | #define access_public_node global_trees[TI_PUBLIC] |
2977 | #define access_protected_node global_trees[TI_PROTECTED] | |
2978 | #define access_private_node global_trees[TI_PRIVATE] | |
95f3173a | 2979 | |
775e7cc0 | 2980 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
2981 | ||
2982 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
2983 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
2984 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
2985 | ||
4070bd43 | 2986 | #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] |
2987 | #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] | |
2988 | #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] | |
2989 | #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] | |
2990 | ||
775e7cc0 | 2991 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] |
2992 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
2993 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
2994 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
2995 | ||
2996 | #define void_type_node global_trees[TI_VOID_TYPE] | |
39b6af4b | 2997 | /* The C type `void *'. */ |
775e7cc0 | 2998 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
39b6af4b | 2999 | /* The C type `const void *'. */ |
775e7cc0 | 3000 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
654ef926 | 3001 | /* The C type `size_t'. */ |
3002 | #define size_type_node global_trees[TI_SIZE_TYPE] | |
73673831 | 3003 | #define pid_type_node global_trees[TI_PID_TYPE] |
775e7cc0 | 3004 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] |
3005 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
a6c787e5 | 3006 | #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] |
3007 | #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] | |
e256d445 | 3008 | /* The C type `FILE *'. */ |
3009 | #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] | |
b06898ca | 3010 | |
3c2239cf | 3011 | #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] |
3012 | #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] | |
3013 | #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] | |
3014 | ||
c4503c0a | 3015 | /* The decimal floating point types. */ |
3016 | #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] | |
3017 | #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] | |
3018 | #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] | |
3019 | #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] | |
3020 | #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] | |
3021 | #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] | |
3022 | ||
83f69b41 | 3023 | /* The node that should be placed at the end of a parameter list to |
3024 | indicate that the function does not take a variable number of | |
3025 | arguments. The TREE_VALUE will be void_type_node and there will be | |
3026 | no TREE_CHAIN. Language-independent code should not assume | |
3027 | anything else about this node. */ | |
3028 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
3029 | ||
5c62f199 | 3030 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
3031 | #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
3032 | ||
b06898ca | 3033 | /* An enumeration of the standard C integer types. These must be |
f5ec8cb5 | 3034 | ordered so that shorter types appear before longer ones, and so |
3035 | that signed types appear before unsigned ones, for the correct | |
3036 | functioning of interpret_integer() in c-lex.c. */ | |
6c34d0c2 | 3037 | enum integer_type_kind |
b06898ca | 3038 | { |
3039 | itk_char, | |
3040 | itk_signed_char, | |
3041 | itk_unsigned_char, | |
3042 | itk_short, | |
3043 | itk_unsigned_short, | |
3044 | itk_int, | |
3045 | itk_unsigned_int, | |
3046 | itk_long, | |
3047 | itk_unsigned_long, | |
3048 | itk_long_long, | |
3049 | itk_unsigned_long_long, | |
3050 | itk_none | |
3051 | }; | |
3052 | ||
3053 | typedef enum integer_type_kind integer_type_kind; | |
3054 | ||
3055 | /* The standard C integer types. Use integer_type_kind to index into | |
3056 | this array. */ | |
1f3233d1 | 3057 | extern GTY(()) tree integer_types[itk_none]; |
b06898ca | 3058 | |
3059 | #define char_type_node integer_types[itk_char] | |
3060 | #define signed_char_type_node integer_types[itk_signed_char] | |
3061 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
3062 | #define short_integer_type_node integer_types[itk_short] | |
3063 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
3064 | #define integer_type_node integer_types[itk_int] | |
3065 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
3066 | #define long_integer_type_node integer_types[itk_long] | |
3067 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
3068 | #define long_long_integer_type_node integer_types[itk_long_long] | |
3069 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
24dfead4 | 3070 | \f |
3071 | /* Set to the default thread-local storage (tls) model to use. */ | |
3072 | ||
24dfead4 | 3073 | extern enum tls_model flag_tls_default; |
8cf34b34 | 3074 | |
775e7cc0 | 3075 | \f |
fc5cb4c0 | 3076 | /* A pointer-to-function member type looks like: |
3077 | ||
3078 | struct { | |
3079 | __P __pfn; | |
3080 | ptrdiff_t __delta; | |
3081 | }; | |
3082 | ||
3083 | If __pfn is NULL, it is a NULL pointer-to-member-function. | |
3084 | ||
3085 | (Because the vtable is always the first thing in the object, we | |
3086 | don't need its offset.) If the function is virtual, then PFN is | |
3087 | one plus twice the index into the vtable; otherwise, it is just a | |
3088 | pointer to the function. | |
3089 | ||
3090 | Unfortunately, using the lowest bit of PFN doesn't work in | |
3091 | architectures that don't impose alignment requirements on function | |
3092 | addresses, or that use the lowest bit to tell one ISA from another, | |
3093 | for example. For such architectures, we use the lowest bit of | |
3094 | DELTA instead of the lowest bit of the PFN, and DELTA will be | |
3095 | multiplied by 2. */ | |
3096 | ||
3097 | enum ptrmemfunc_vbit_where_t | |
3098 | { | |
3099 | ptrmemfunc_vbit_in_pfn, | |
3100 | ptrmemfunc_vbit_in_delta | |
3101 | }; | |
3102 | \f | |
fb084c16 | 3103 | #define NULL_TREE (tree) NULL |
3104 | ||
60b8c5b3 | 3105 | extern tree decl_assembler_name (tree); |
d72a838e | 3106 | |
6663ac46 | 3107 | /* Compute the number of bytes occupied by 'node'. This routine only |
3108 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
3109 | ||
60b8c5b3 | 3110 | extern size_t tree_size (tree); |
6663ac46 | 3111 | |
51d121a0 | 3112 | /* Compute the number of bytes occupied by a tree with code CODE. This |
3113 | function cannot be used for TREE_VEC or PHI_NODE codes, which are of | |
3114 | variable length. */ | |
3115 | extern size_t tree_code_size (enum tree_code); | |
3116 | ||
d72a838e | 3117 | /* Lowest level primitive for allocating a node. |
3118 | The TREE_CODE is the only argument. Contents are initialized | |
3119 | to zero except for a few of the common fields. */ | |
3120 | ||
674b05f5 | 3121 | extern tree make_node_stat (enum tree_code MEM_STAT_DECL); |
3122 | #define make_node(t) make_node_stat (t MEM_STAT_INFO) | |
d72a838e | 3123 | |
ff6d0dd9 | 3124 | /* Make a copy of a node, with all the same contents. */ |
d72a838e | 3125 | |
674b05f5 | 3126 | extern tree copy_node_stat (tree MEM_STAT_DECL); |
3127 | #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) | |
d72a838e | 3128 | |
3129 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
3130 | ||
60b8c5b3 | 3131 | extern tree copy_list (tree); |
d72a838e | 3132 | |
3cb98335 | 3133 | /* Make a BINFO. */ |
3134 | extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); | |
3135 | #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) | |
3136 | ||
d72a838e | 3137 | /* Make a TREE_VEC. */ |
3138 | ||
674b05f5 | 3139 | extern tree make_tree_vec_stat (int MEM_STAT_DECL); |
3140 | #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) | |
d72a838e | 3141 | |
4ee9c684 | 3142 | /* Tree nodes for SSA analysis. */ |
3143 | ||
4ee9c684 | 3144 | extern void init_phinodes (void); |
3145 | extern void fini_phinodes (void); | |
3146 | extern void release_phi_node (tree); | |
3147 | #ifdef GATHER_STATISTICS | |
3148 | extern void phinodes_print_statistics (void); | |
3149 | #endif | |
3150 | ||
3151 | extern void init_ssanames (void); | |
3152 | extern void fini_ssanames (void); | |
3153 | extern tree make_ssa_name (tree, tree); | |
3aaaf63f | 3154 | extern tree duplicate_ssa_name (tree, tree); |
abb91f0b | 3155 | extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *); |
4ee9c684 | 3156 | extern void release_ssa_name (tree); |
81d08033 | 3157 | extern void release_defs (tree); |
cbbefea4 | 3158 | extern void replace_ssa_name_symbol (tree, tree); |
81d08033 | 3159 | |
4ee9c684 | 3160 | #ifdef GATHER_STATISTICS |
3161 | extern void ssanames_print_statistics (void); | |
3162 | #endif | |
3163 | ||
d72a838e | 3164 | /* Return the (unique) IDENTIFIER_NODE node for a given name. |
3165 | The name is supplied as a char *. */ | |
3166 | ||
60b8c5b3 | 3167 | extern tree get_identifier (const char *); |
d72a838e | 3168 | |
69642df2 | 3169 | #if GCC_VERSION >= 3000 |
3170 | #define get_identifier(str) \ | |
3171 | (__builtin_constant_p (str) \ | |
3172 | ? get_identifier_with_length ((str), strlen (str)) \ | |
3173 | : get_identifier (str)) | |
3174 | #endif | |
3175 | ||
3176 | ||
82863d5e | 3177 | /* Identical to get_identifier, except that the length is assumed |
3178 | known. */ | |
3179 | ||
69642df2 | 3180 | extern tree get_identifier_with_length (const char *, size_t); |
82863d5e | 3181 | |
06fcb3a0 | 3182 | /* If an identifier with the name TEXT (a null-terminated string) has |
3183 | previously been referred to, return that node; otherwise return | |
3184 | NULL_TREE. */ | |
3185 | ||
60b8c5b3 | 3186 | extern tree maybe_get_identifier (const char *); |
06fcb3a0 | 3187 | |
d72a838e | 3188 | /* Construct various types of nodes. */ |
3189 | ||
60b8c5b3 | 3190 | extern tree build_nt (enum tree_code, ...); |
3191 | ||
674b05f5 | 3192 | extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); |
3193 | #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) | |
3194 | extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
3195 | #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) | |
3196 | extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
3197 | #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) | |
3198 | extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
3199 | #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) | |
3200 | extern tree build4_stat (enum tree_code, tree, tree, tree, tree, | |
3201 | tree MEM_STAT_DECL); | |
3202 | #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
aed164c3 | 3203 | extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree, |
3204 | tree, tree, tree MEM_STAT_DECL); | |
3205 | #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \ | |
3206 | build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO) | |
413a7abf | 3207 | |
7016c612 | 3208 | extern tree build_int_cst (tree, HOST_WIDE_INT); |
dec41e98 | 3209 | extern tree build_int_cst_type (tree, HOST_WIDE_INT); |
7016c612 | 3210 | extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT); |
3211 | extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); | |
60b8c5b3 | 3212 | extern tree build_vector (tree, tree); |
c75b4594 | 3213 | extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *); |
3214 | extern tree build_constructor (tree, VEC(constructor_elt,gc) *); | |
3215 | extern tree build_constructor_single (tree, tree, tree); | |
3216 | extern tree build_constructor_from_list (tree, tree); | |
60b8c5b3 | 3217 | extern tree build_real_from_int_cst (tree, tree); |
3218 | extern tree build_complex (tree, tree, tree); | |
3219 | extern tree build_string (int, const char *); | |
674b05f5 | 3220 | extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); |
3221 | #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) | |
3222 | extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
d7683f13 | 3223 | extern tree build_fn_decl (const char *, tree); |
674b05f5 | 3224 | #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO) |
0a4b7550 | 3225 | extern tree build_block (tree, tree, tree, tree); |
fdfe4b3f | 3226 | #ifndef USE_MAPPED_LOCATION |
4ee9c684 | 3227 | extern void annotate_with_file_line (tree, const char *, int); |
3228 | extern void annotate_with_locus (tree, location_t); | |
fdfe4b3f | 3229 | #endif |
4ee9c684 | 3230 | extern tree build_empty_stmt (void); |
d72a838e | 3231 | |
3232 | /* Construct various nodes representing data types. */ | |
3233 | ||
60b8c5b3 | 3234 | extern tree make_signed_type (int); |
3235 | extern tree make_unsigned_type (int); | |
dbc64c75 | 3236 | extern tree signed_type_for (tree); |
dec41e98 | 3237 | extern tree unsigned_type_for (tree); |
1561d3cd | 3238 | extern void initialize_sizetypes (bool); |
60b8c5b3 | 3239 | extern void set_sizetype (tree); |
3240 | extern void fixup_unsigned_type (tree); | |
b24423db | 3241 | extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 3242 | extern tree build_pointer_type (tree); |
b24423db | 3243 | extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 3244 | extern tree build_reference_type (tree); |
4917c376 | 3245 | extern tree build_vector_type_for_mode (tree, enum machine_mode); |
3246 | extern tree build_vector_type (tree innertype, int nunits); | |
60b8c5b3 | 3247 | extern tree build_type_no_quals (tree); |
3248 | extern tree build_index_type (tree); | |
3249 | extern tree build_index_2_type (tree, tree); | |
3250 | extern tree build_array_type (tree, tree); | |
3251 | extern tree build_function_type (tree, tree); | |
3252 | extern tree build_function_type_list (tree, ...); | |
5bfb0742 | 3253 | extern tree build_method_type_directly (tree, tree, tree); |
60b8c5b3 | 3254 | extern tree build_method_type (tree, tree); |
3255 | extern tree build_offset_type (tree, tree); | |
3256 | extern tree build_complex_type (tree); | |
b3f1469f | 3257 | extern tree build_resx (int); |
60b8c5b3 | 3258 | extern tree array_type_nelts (tree); |
7d23383d | 3259 | extern bool in_array_bounds_p (tree); |
60b8c5b3 | 3260 | |
3261 | extern tree value_member (tree, tree); | |
3262 | extern tree purpose_member (tree, tree); | |
908e5f41 | 3263 | |
60b8c5b3 | 3264 | extern int attribute_list_equal (tree, tree); |
3265 | extern int attribute_list_contained (tree, tree); | |
3266 | extern int tree_int_cst_equal (tree, tree); | |
3267 | extern int tree_int_cst_lt (tree, tree); | |
3268 | extern int tree_int_cst_compare (tree, tree); | |
3269 | extern int host_integerp (tree, int); | |
3270 | extern HOST_WIDE_INT tree_low_cst (tree, int); | |
3271 | extern int tree_int_cst_msb (tree); | |
3272 | extern int tree_int_cst_sgn (tree); | |
b9845e76 | 3273 | extern int tree_int_cst_sign_bit (tree); |
60b8c5b3 | 3274 | extern int tree_expr_nonnegative_p (tree); |
bb445479 | 3275 | extern bool may_negate_without_overflow_p (tree); |
60b8c5b3 | 3276 | extern tree get_inner_array_type (tree); |
296a500c | 3277 | |
fb084c16 | 3278 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
3279 | put the prototype here. Rtl.h does declare the prototype if | |
3280 | tree.h had been included. */ | |
3281 | ||
60b8c5b3 | 3282 | extern tree make_tree (tree, rtx); |
d72a838e | 3283 | \f |
a12eeaaf | 3284 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
3285 | is ATTRIBUTE. | |
3286 | ||
3287 | Such modified types already made are recorded so that duplicates | |
88b5b080 | 3288 | are not made. */ |
a12eeaaf | 3289 | |
60b8c5b3 | 3290 | extern tree build_type_attribute_variant (tree, tree); |
3291 | extern tree build_decl_attribute_variant (tree, tree); | |
a12eeaaf | 3292 | |
e3c541f0 | 3293 | /* Structure describing an attribute and a function to handle it. */ |
3294 | struct attribute_spec | |
3295 | { | |
3296 | /* The name of the attribute (without any leading or trailing __), | |
3297 | or NULL to mark the end of a table of attributes. */ | |
e99c3a1d | 3298 | const char *const name; |
e3c541f0 | 3299 | /* The minimum length of the list of arguments of the attribute. */ |
e99c3a1d | 3300 | const int min_length; |
e3c541f0 | 3301 | /* The maximum length of the list of arguments of the attribute |
3302 | (-1 for no maximum). */ | |
e99c3a1d | 3303 | const int max_length; |
e3c541f0 | 3304 | /* Whether this attribute requires a DECL. If it does, it will be passed |
3305 | from types of DECLs, function return types and array element types to | |
3306 | the DECLs, function types and array types respectively; but when | |
3307 | applied to a type in any other circumstances, it will be ignored with | |
3308 | a warning. (If greater control is desired for a given attribute, | |
3309 | this should be false, and the flags argument to the handler may be | |
3310 | used to gain greater control in that case.) */ | |
e99c3a1d | 3311 | const bool decl_required; |
e3c541f0 | 3312 | /* Whether this attribute requires a type. If it does, it will be passed |
3313 | from a DECL to the type of that DECL. */ | |
e99c3a1d | 3314 | const bool type_required; |
e3c541f0 | 3315 | /* Whether this attribute requires a function (or method) type. If it does, |
3316 | it will be passed from a function pointer type to the target type, | |
3317 | and from a function return type (which is not itself a function | |
3318 | pointer type) to the function type. */ | |
e99c3a1d | 3319 | const bool function_type_required; |
e3c541f0 | 3320 | /* Function to handle this attribute. NODE points to the node to which |
3321 | the attribute is to be applied. If a DECL, it should be modified in | |
3322 | place; if a TYPE, a copy should be created. NAME is the name of the | |
3323 | attribute (possibly with leading or trailing __). ARGS is the TREE_LIST | |
3324 | of the arguments (which may be NULL). FLAGS gives further information | |
3325 | about the context of the attribute. Afterwards, the attributes will | |
3326 | be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, | |
3327 | unless *NO_ADD_ATTRS is set to true (which should be done on error, | |
3328 | as well as in any other cases when the attributes should not be added | |
3329 | to the DECL or TYPE). Depending on FLAGS, any attributes to be | |
3330 | applied to another type or DECL later may be returned; | |
3331 | otherwise the return value should be NULL_TREE. This pointer may be | |
3332 | NULL if no special handling is required beyond the checks implied | |
3333 | by the rest of this structure. */ | |
60b8c5b3 | 3334 | tree (*const handler) (tree *node, tree name, tree args, |
3335 | int flags, bool *no_add_attrs); | |
e3c541f0 | 3336 | }; |
3337 | ||
e3c541f0 | 3338 | /* Flags that may be passed in the third argument of decl_attributes, and |
3339 | to handler functions for attributes. */ | |
3340 | enum attribute_flags | |
3341 | { | |
3342 | /* The type passed in is the type of a DECL, and any attributes that | |
3343 | should be passed in again to be applied to the DECL rather than the | |
3344 | type should be returned. */ | |
3345 | ATTR_FLAG_DECL_NEXT = 1, | |
3346 | /* The type passed in is a function return type, and any attributes that | |
3347 | should be passed in again to be applied to the function type rather | |
3348 | than the return type should be returned. */ | |
3349 | ATTR_FLAG_FUNCTION_NEXT = 2, | |
3350 | /* The type passed in is an array element type, and any attributes that | |
3351 | should be passed in again to be applied to the array type rather | |
3352 | than the element type should be returned. */ | |
3353 | ATTR_FLAG_ARRAY_NEXT = 4, | |
3354 | /* The type passed in is a structure, union or enumeration type being | |
3355 | created, and should be modified in place. */ | |
7d3b509a | 3356 | ATTR_FLAG_TYPE_IN_PLACE = 8, |
3357 | /* The attributes are being applied by default to a library function whose | |
3358 | name indicates known behavior, and should be silently ignored if they | |
3359 | are not in fact compatible with the function type. */ | |
3360 | ATTR_FLAG_BUILT_IN = 16 | |
e3c541f0 | 3361 | }; |
3362 | ||
ed5635e4 | 3363 | /* Default versions of target-overridable functions. */ |
3364 | ||
60b8c5b3 | 3365 | extern tree merge_decl_attributes (tree, tree); |
3366 | extern tree merge_type_attributes (tree, tree); | |
0bf60c2b | 3367 | |
f712a0dc | 3368 | /* Given a tree node and a string, return nonzero if the tree node is |
fe78f852 | 3369 | a valid attribute name for the string. */ |
3370 | ||
60b8c5b3 | 3371 | extern int is_attribute_p (const char *, tree); |
fe78f852 | 3372 | |
3373 | /* Given an attribute name and a list of attributes, return the list element | |
3374 | of the attribute or NULL_TREE if not found. */ | |
3375 | ||
60b8c5b3 | 3376 | extern tree lookup_attribute (const char *, tree); |
4ab0a739 | 3377 | |
3378 | /* Given two attributes lists, return a list of their union. */ | |
3379 | ||
60b8c5b3 | 3380 | extern tree merge_attributes (tree, tree); |
fe78f852 | 3381 | |
3aa0c315 | 3382 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
a767736d | 3383 | /* Given two Windows decl attributes lists, possibly including |
3384 | dllimport, return a list of their union . */ | |
60b8c5b3 | 3385 | extern tree merge_dllimport_decl_attributes (tree, tree); |
3aa0c315 | 3386 | |
3387 | /* Handle a "dllimport" or "dllexport" attribute. */ | |
3388 | extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); | |
a767736d | 3389 | #endif |
3390 | ||
e40000f4 | 3391 | /* Check whether CAND is suitable to be returned from get_qualified_type |
3392 | (BASE, TYPE_QUALS). */ | |
3393 | ||
3394 | extern bool check_qualified_type (tree, tree, int); | |
3395 | ||
051b8c96 | 3396 | /* Return a version of the TYPE, qualified as indicated by the |
3397 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
3398 | return NULL_TREE. */ | |
3399 | ||
60b8c5b3 | 3400 | extern tree get_qualified_type (tree, int); |
051b8c96 | 3401 | |
3402 | /* Like get_qualified_type, but creates the type if it does not | |
3403 | exist. This function never returns NULL_TREE. */ | |
a5b1863e | 3404 | |
60b8c5b3 | 3405 | extern tree build_qualified_type (tree, int); |
a5b1863e | 3406 | |
3407 | /* Like build_qualified_type, but only deals with the `const' and | |
3408 | `volatile' qualifiers. This interface is retained for backwards | |
de132707 | 3409 | compatibility with the various front-ends; new code should use |
a5b1863e | 3410 | build_qualified_type instead. */ |
d72a838e | 3411 | |
a5b1863e | 3412 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
76c6f48d | 3413 | build_qualified_type ((TYPE), \ |
a5b1863e | 3414 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ |
3415 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
d72a838e | 3416 | |
11121344 | 3417 | /* Make a copy of a type node. */ |
3418 | ||
e086912e | 3419 | extern tree build_distinct_type_copy (tree); |
3420 | extern tree build_variant_type_copy (tree); | |
11121344 | 3421 | |
805e22b2 | 3422 | /* Finish up a builtin RECORD_TYPE. Give it a name and provide its |
8e7d98a7 | 3423 | fields. Optionally specify an alignment, and then lay it out. */ |
805e22b2 | 3424 | |
60b8c5b3 | 3425 | extern void finish_builtin_struct (tree, const char *, |
3426 | tree, tree); | |
805e22b2 | 3427 | |
d72a838e | 3428 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
99f4e085 | 3429 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
3430 | node, does nothing except for the first time. */ | |
d72a838e | 3431 | |
60b8c5b3 | 3432 | extern void layout_type (tree); |
d72a838e | 3433 | |
99f4e085 | 3434 | /* These functions allow a front-end to perform a manual layout of a |
3435 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
3436 | depends on the placement of fields so far.) Begin by calling | |
02e7a332 | 3437 | start_record_layout. Then, call place_field for each of the |
99f4e085 | 3438 | fields. Then, call finish_record_layout. See layout_type for the |
3439 | default way in which these functions are used. */ | |
3440 | ||
ad847b26 | 3441 | typedef struct record_layout_info_s |
99f4e085 | 3442 | { |
3443 | /* The RECORD_TYPE that we are laying out. */ | |
3444 | tree t; | |
02e7a332 | 3445 | /* The offset into the record so far, in bytes, not including bits in |
3446 | BITPOS. */ | |
3447 | tree offset; | |
3448 | /* The last known alignment of SIZE. */ | |
3449 | unsigned int offset_align; | |
3450 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
3451 | tree bitpos; | |
99f4e085 | 3452 | /* The alignment of the record so far, in bits. */ |
3453 | unsigned int record_align; | |
f5712181 | 3454 | /* The alignment of the record so far, ignoring #pragma pack and |
3455 | __attribute__ ((packed)), in bits. */ | |
02e7a332 | 3456 | unsigned int unpacked_align; |
f04f096b | 3457 | /* The previous field layed out. */ |
3458 | tree prev_field; | |
99f4e085 | 3459 | /* The static variables (i.e., class variables, as opposed to |
3460 | instance variables) encountered in T. */ | |
3461 | tree pending_statics; | |
8642f3d3 | 3462 | /* Bits remaining in the current alignment group */ |
3463 | int remaining_in_alignment; | |
23325b33 | 3464 | /* True if prev_field was packed and we haven't found any non-packed |
3465 | fields that we have put in the same alignment group. */ | |
3466 | int prev_packed; | |
f5712181 | 3467 | /* True if we've seen a packed field that didn't have normal |
3468 | alignment anyway. */ | |
99f4e085 | 3469 | int packed_maybe_necessary; |
02e7a332 | 3470 | } *record_layout_info; |
99f4e085 | 3471 | |
60b8c5b3 | 3472 | extern void set_lang_adjust_rli (void (*) (record_layout_info)); |
3473 | extern record_layout_info start_record_layout (tree); | |
3474 | extern tree bit_from_pos (tree, tree); | |
3475 | extern tree byte_from_pos (tree, tree); | |
3476 | extern void pos_from_bit (tree *, tree *, unsigned int, tree); | |
3477 | extern void normalize_offset (tree *, tree *, unsigned int); | |
3478 | extern tree rli_size_unit_so_far (record_layout_info); | |
3479 | extern tree rli_size_so_far (record_layout_info); | |
3480 | extern void normalize_rli (record_layout_info); | |
3481 | extern void place_field (record_layout_info, tree); | |
3482 | extern void compute_record_mode (tree); | |
3483 | extern void finish_record_layout (record_layout_info, int); | |
99f4e085 | 3484 | |
d72a838e | 3485 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
3486 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
3487 | How the hash code is computed is up to the caller, as long as any two | |
3488 | callers that could hash identical-looking type nodes agree. */ | |
3489 | ||
60b8c5b3 | 3490 | extern tree type_hash_canon (unsigned int, tree); |
d72a838e | 3491 | |
3492 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
3493 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
3494 | fields. Call this only once for any given decl node. | |
3495 | ||
3496 | Second argument is the boundary that this field can be assumed to | |
3497 | be starting at (in bits). Zero means it can be assumed aligned | |
3498 | on any boundary that may be needed. */ | |
3499 | ||
60b8c5b3 | 3500 | extern void layout_decl (tree, unsigned); |
d72a838e | 3501 | |
dddcebdc | 3502 | /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of |
3503 | a previous call to layout_decl and calls it again. */ | |
3504 | ||
3505 | extern void relayout_decl (tree); | |
3506 | ||
0fc6aef1 | 3507 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
3508 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
3509 | The value is BLKmode if no other mode is found. This is like | |
3510 | mode_for_size, but is passed a tree. */ | |
3511 | ||
60b8c5b3 | 3512 | extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int); |
0fc6aef1 | 3513 | |
d72a838e | 3514 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
3515 | ||
60b8c5b3 | 3516 | extern tree non_lvalue (tree); |
60b8c5b3 | 3517 | |
3518 | extern tree convert (tree, tree); | |
3519 | extern unsigned int expr_align (tree); | |
3520 | extern tree expr_first (tree); | |
3521 | extern tree expr_last (tree); | |
4ee9c684 | 3522 | extern tree expr_only (tree); |
60b8c5b3 | 3523 | extern tree size_in_bytes (tree); |
3524 | extern HOST_WIDE_INT int_size_in_bytes (tree); | |
3525 | extern tree bit_position (tree); | |
3526 | extern HOST_WIDE_INT int_bit_position (tree); | |
3527 | extern tree byte_position (tree); | |
3528 | extern HOST_WIDE_INT int_byte_position (tree); | |
902de8ed | 3529 | |
3530 | /* Define data structures, macros, and functions for handling sizes | |
3531 | and the various types used to represent sizes. */ | |
3532 | ||
3533 | enum size_type_kind | |
3534 | { | |
88b5b080 | 3535 | SIZETYPE, /* Normal representation of sizes in bytes. */ |
3536 | SSIZETYPE, /* Signed representation of sizes in bytes. */ | |
902de8ed | 3537 | BITSIZETYPE, /* Normal representation of sizes in bits. */ |
3538 | SBITSIZETYPE, /* Signed representation of sizes in bits. */ | |
902de8ed | 3539 | TYPE_KIND_LAST}; |
3540 | ||
1f3233d1 | 3541 | extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; |
902de8ed | 3542 | |
3543 | #define sizetype sizetype_tab[(int) SIZETYPE] | |
3544 | #define bitsizetype sizetype_tab[(int) BITSIZETYPE] | |
3545 | #define ssizetype sizetype_tab[(int) SSIZETYPE] | |
902de8ed | 3546 | #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] |
902de8ed | 3547 | |
85390276 | 3548 | extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); |
60b8c5b3 | 3549 | extern tree size_binop (enum tree_code, tree, tree); |
3550 | extern tree size_diffop (tree, tree); | |
1e9d55d7 | 3551 | |
3552 | #define size_int(L) size_int_kind (L, SIZETYPE) | |
3553 | #define ssize_int(L) size_int_kind (L, SSIZETYPE) | |
3554 | #define bitsize_int(L) size_int_kind (L, BITSIZETYPE) | |
3555 | #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE) | |
30384dcf | 3556 | |
60b8c5b3 | 3557 | extern tree round_up (tree, int); |
3558 | extern tree round_down (tree, int); | |
3559 | extern tree get_pending_sizes (void); | |
60b8c5b3 | 3560 | extern void put_pending_size (tree); |
3561 | extern void put_pending_sizes (tree); | |
d72a838e | 3562 | |
3563 | /* Type for sizes of data-type. */ | |
3564 | ||
30384dcf | 3565 | #define BITS_PER_UNIT_LOG \ |
3566 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
3567 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
3568 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
3569 | ||
6b5553e5 | 3570 | /* If nonzero, an upper limit on alignment of structure fields, in bits, */ |
fe352cf1 | 3571 | extern unsigned int maximum_field_alignment; |
fbf0afd1 | 3572 | /* and its original value in bytes, specified via -fpack-struct=<value>. */ |
6b5553e5 | 3573 | extern unsigned int initial_max_fld_align; |
64233515 | 3574 | |
d72a838e | 3575 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
3576 | by making the last node in X point to Y. | |
3577 | Returns X, except if X is 0 returns Y. */ | |
3578 | ||
60b8c5b3 | 3579 | extern tree chainon (tree, tree); |
d72a838e | 3580 | |
3581 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
3582 | ||
674b05f5 | 3583 | extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); |
3584 | #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) | |
d72a838e | 3585 | |
3586 | /* Return the last tree node in a chain. */ | |
3587 | ||
60b8c5b3 | 3588 | extern tree tree_last (tree); |
d72a838e | 3589 | |
3590 | /* Reverse the order of elements in a chain, and return the new head. */ | |
3591 | ||
60b8c5b3 | 3592 | extern tree nreverse (tree); |
d72a838e | 3593 | |
3594 | /* Returns the length of a chain of nodes | |
3595 | (number of chain pointers to follow before reaching a null pointer). */ | |
3596 | ||
60b8c5b3 | 3597 | extern int list_length (tree); |
d72a838e | 3598 | |
efd3939c | 3599 | /* Returns the number of FIELD_DECLs in a type. */ |
3600 | ||
60b8c5b3 | 3601 | extern int fields_length (tree); |
efd3939c | 3602 | |
e19896a4 | 3603 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
3604 | aggregate of zeros. Otherwise return FALSE. */ | |
3605 | ||
60b8c5b3 | 3606 | extern bool initializer_zerop (tree); |
e19896a4 | 3607 | |
7cb4a4d0 | 3608 | extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
3609 | HOST_WIDE_INT *, bool *); | |
b7f95d09 | 3610 | extern HOST_WIDE_INT count_type_elements (tree, bool); |
957697db | 3611 | |
4ee9c684 | 3612 | /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */ |
3613 | ||
3614 | extern void add_var_to_bind_expr (tree, tree); | |
3615 | ||
778ac06a | 3616 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ |
d72a838e | 3617 | |
60b8c5b3 | 3618 | extern int integer_zerop (tree); |
d72a838e | 3619 | |
778ac06a | 3620 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ |
d72a838e | 3621 | |
60b8c5b3 | 3622 | extern int integer_onep (tree); |
d72a838e | 3623 | |
3624 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
3625 | all of whose significant bits are 1. */ | |
3626 | ||
60b8c5b3 | 3627 | extern int integer_all_onesp (tree); |
d72a838e | 3628 | |
3629 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
3630 | exactly one bit 1. */ | |
3631 | ||
60b8c5b3 | 3632 | extern int integer_pow2p (tree); |
d72a838e | 3633 | |
805e22b2 | 3634 | /* integer_nonzerop (tree x) is nonzero if X is an integer constant |
3635 | with a nonzero value. */ | |
3636 | ||
60b8c5b3 | 3637 | extern int integer_nonzerop (tree); |
805e22b2 | 3638 | |
dec41e98 | 3639 | extern bool zero_p (tree); |
3640 | extern bool cst_and_fits_in_hwi (tree); | |
b091dc59 | 3641 | extern tree num_ending_zeros (tree); |
dec41e98 | 3642 | |
82e3f297 | 3643 | /* staticp (tree x) is nonzero if X is a reference to data allocated |
3644 | at a fixed address in memory. Returns the outermost data. */ | |
d72a838e | 3645 | |
82e3f297 | 3646 | extern tree staticp (tree); |
d72a838e | 3647 | |
d72a838e | 3648 | /* save_expr (EXP) returns an expression equivalent to EXP |
3649 | but it can be used multiple times within context CTX | |
3650 | and only evaluate EXP once. */ | |
3651 | ||
60b8c5b3 | 3652 | extern tree save_expr (tree); |
d72a838e | 3653 | |
414bee42 | 3654 | /* Look inside EXPR and into any simple arithmetic operations. Return |
3655 | the innermost non-arithmetic node. */ | |
3656 | ||
60b8c5b3 | 3657 | extern tree skip_simple_arithmetic (tree); |
414bee42 | 3658 | |
1f3233d1 | 3659 | /* Return which tree structure is used by T. */ |
3660 | ||
60b8c5b3 | 3661 | enum tree_node_structure_enum tree_node_structure (tree); |
1f3233d1 | 3662 | |
9f354f8d | 3663 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
3664 | or offset that depends on a field within a record. | |
3665 | ||
3666 | Note that we only allow such expressions within simple arithmetic | |
3667 | or a COND_EXPR. */ | |
3668 | ||
60b8c5b3 | 3669 | extern bool contains_placeholder_p (tree); |
ce3fb06e | 3670 | |
3671 | /* This macro calls the above function but short-circuits the common | |
3672 | case of a constant to save time. Also check for null. */ | |
3673 | ||
3674 | #define CONTAINS_PLACEHOLDER_P(EXP) \ | |
3675 | ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) | |
3676 | ||
3677 | /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR. | |
3678 | This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field | |
3679 | positions. */ | |
3680 | ||
60b8c5b3 | 3681 | extern bool type_contains_placeholder_p (tree); |
9f354f8d | 3682 | |
3683 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
3684 | return a tree with all occurrences of references to F in a | |
3685 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
3686 | contains only arithmetic expressions. */ | |
3687 | ||
60b8c5b3 | 3688 | extern tree substitute_in_expr (tree, tree, tree); |
9f354f8d | 3689 | |
55f9d7dc | 3690 | /* This macro calls the above function but short-circuits the common |
3691 | case of a constant to save time and also checks for NULL. */ | |
3692 | ||
3693 | #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ | |
3694 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) | |
3695 | ||
3696 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
3697 | for it within OBJ, a tree that is an object or a chain of references. */ | |
3698 | ||
3699 | extern tree substitute_placeholder_in_expr (tree, tree); | |
3700 | ||
3701 | /* This macro calls the above function but short-circuits the common | |
3702 | case of a constant to save time and also checks for NULL. */ | |
3703 | ||
3704 | #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ | |
3705 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ | |
3706 | : substitute_placeholder_in_expr (EXP, OBJ)) | |
3707 | ||
654995a1 | 3708 | /* variable_size (EXP) is like save_expr (EXP) except that it |
3709 | is for the special case of something that is part of a | |
3710 | variable size for a data type. It makes special arrangements | |
3711 | to compute the value at the right time when the data type | |
3712 | belongs to a function parameter. */ | |
3713 | ||
60b8c5b3 | 3714 | extern tree variable_size (tree); |
654995a1 | 3715 | |
845bebef | 3716 | /* stabilize_reference (EXP) returns a reference equivalent to EXP |
d72a838e | 3717 | but it can be used multiple times |
3718 | and only evaluate the subexpressions once. */ | |
3719 | ||
60b8c5b3 | 3720 | extern tree stabilize_reference (tree); |
d72a838e | 3721 | |
1b6e6303 | 3722 | /* Subroutine of stabilize_reference; this is called for subtrees of |
3723 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
3724 | to ensure that it is only evaluated once. */ | |
3725 | ||
60b8c5b3 | 3726 | extern tree stabilize_reference_1 (tree); |
1b6e6303 | 3727 | |
d72a838e | 3728 | /* Return EXP, stripped of any conversions to wider types |
3729 | in such a way that the result of converting to type FOR_TYPE | |
3730 | is the same as if EXP were converted to FOR_TYPE. | |
3731 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
3732 | ||
60b8c5b3 | 3733 | extern tree get_unwidened (tree, tree); |
d72a838e | 3734 | |
3735 | /* Return OP or a simpler expression for a narrower value | |
3736 | which can be sign-extended or zero-extended to give back OP. | |
3737 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
3738 | or 0 if the value should be sign-extended. */ | |
3739 | ||
60b8c5b3 | 3740 | extern tree get_narrower (tree, int *); |
d72a838e | 3741 | |
d72a838e | 3742 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, |
3743 | look for nested component-refs or array-refs at constant positions | |
3744 | and find the ultimate containing object, which is returned. */ | |
3745 | ||
60b8c5b3 | 3746 | extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
ffbcd083 | 3747 | tree *, enum machine_mode *, int *, int *, |
3748 | bool); | |
d72a838e | 3749 | |
f96c43fb | 3750 | /* Return 1 if T is an expression that get_inner_reference handles. */ |
3751 | ||
60b8c5b3 | 3752 | extern int handled_component_p (tree); |
f96c43fb | 3753 | |
6374121b | 3754 | /* Return a tree of sizetype representing the size, in bytes, of the element |
3755 | of EXP, an ARRAY_REF. */ | |
3756 | ||
3757 | extern tree array_ref_element_size (tree); | |
3758 | ||
3759 | /* Return a tree representing the lower bound of the array mentioned in | |
3760 | EXP, an ARRAY_REF. */ | |
3761 | ||
3762 | extern tree array_ref_low_bound (tree); | |
3763 | ||
7d23383d | 3764 | /* Return a tree representing the upper bound of the array mentioned in |
3765 | EXP, an ARRAY_REF. */ | |
3766 | ||
3767 | extern tree array_ref_up_bound (tree); | |
3768 | ||
6374121b | 3769 | /* Return a tree representing the offset, in bytes, of the field referenced |
3770 | by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ | |
3771 | ||
3772 | extern tree component_ref_field_offset (tree); | |
3773 | ||
804dff30 | 3774 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
3775 | NUL_TREE if there is no containing scope. */ | |
3776 | ||
60b8c5b3 | 3777 | extern tree get_containing_scope (tree); |
804dff30 | 3778 | |
d72a838e | 3779 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
3780 | or zero if none. */ | |
60b8c5b3 | 3781 | extern tree decl_function_context (tree); |
d72a838e | 3782 | |
7dd9d898 | 3783 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
3784 | this _DECL with its context, or zero if none. */ | |
60b8c5b3 | 3785 | extern tree decl_type_context (tree); |
d72a838e | 3786 | |
03f2a1be | 3787 | /* Return 1 if EXPR is the real constant zero. */ |
60b8c5b3 | 3788 | extern int real_zerop (tree); |
d72a838e | 3789 | \f |
3790 | /* Declare commonly used variables for tree structure. */ | |
3791 | ||
b3034b6d | 3792 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
3793 | Zero means allow extended lvalues. */ | |
3794 | ||
3795 | extern int pedantic_lvalues; | |
3796 | ||
88b5b080 | 3797 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ |
d72a838e | 3798 | |
1f3233d1 | 3799 | extern GTY(()) tree current_function_decl; |
d72a838e | 3800 | |
d0309f39 | 3801 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
2d754264 | 3802 | extern GTY(()) const char * current_function_func_begin_label; |
d72a838e | 3803 | \f |
bb02c0b3 | 3804 | /* In tree.c */ |
eac18265 | 3805 | extern unsigned crc32_string (unsigned, const char *); |
60b8c5b3 | 3806 | extern void clean_symbol_name (char *); |
3807 | extern tree get_file_function_name_long (const char *); | |
60b8c5b3 | 3808 | extern tree get_callee_fndecl (tree); |
681a883f | 3809 | extern void change_decl_assembler_name (tree, tree); |
60b8c5b3 | 3810 | extern int type_num_arguments (tree); |
21dff555 | 3811 | extern bool associative_tree_code (enum tree_code); |
3812 | extern bool commutative_tree_code (enum tree_code); | |
faab57e3 | 3813 | extern tree upper_bound_in_type (tree, tree); |
3814 | extern tree lower_bound_in_type (tree, tree); | |
5373158f | 3815 | extern int operand_equal_for_phi_arg_p (tree, tree); |
bb02c0b3 | 3816 | \f |
d72a838e | 3817 | /* In stmt.c */ |
3818 | ||
60b8c5b3 | 3819 | extern void expand_expr_stmt (tree); |
c48505a3 | 3820 | extern int warn_if_unused_value (tree, location_t); |
60b8c5b3 | 3821 | extern void expand_label (tree); |
3822 | extern void expand_goto (tree); | |
60b8c5b3 | 3823 | |
4ee9c684 | 3824 | extern rtx expand_stack_save (void); |
3825 | extern void expand_stack_restore (tree); | |
60b8c5b3 | 3826 | extern void expand_return (tree); |
60b8c5b3 | 3827 | extern int is_body_block (tree); |
3828 | ||
873f1e89 | 3829 | /* In tree-eh.c */ |
60b8c5b3 | 3830 | extern void using_eh_for_cleanups (void); |
d72a838e | 3831 | |
3832 | /* In fold-const.c */ | |
3833 | ||
9239a87e | 3834 | /* Fold constants as much as possible in an expression. |
3835 | Returns the simplified expression. | |
3836 | Acts only on the top level of the expression; | |
3837 | if the argument itself cannot be simplified, its | |
3838 | subexpressions are not changed. */ | |
3839 | ||
60b8c5b3 | 3840 | extern tree fold (tree); |
d3858e14 | 3841 | extern tree fold_unary (enum tree_code, tree, tree); |
3842 | extern tree fold_binary (enum tree_code, tree, tree, tree); | |
3843 | extern tree fold_ternary (enum tree_code, tree, tree, tree, tree); | |
ba04ccb0 | 3844 | extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); |
3845 | #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO) | |
3846 | extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
3847 | #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO) | |
3848 | extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
3849 | #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO) | |
a62b6979 | 3850 | extern tree fold_build1_initializer (enum tree_code, tree, tree); |
3851 | extern tree fold_build2_initializer (enum tree_code, tree, tree, tree); | |
3852 | extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree); | |
d7aeca92 | 3853 | extern tree fold_convert (tree, tree); |
60b8c5b3 | 3854 | extern tree fold_single_bit_test (enum tree_code, tree, tree, tree); |
db97ad41 | 3855 | extern tree fold_ignored_result (tree); |
d1aade50 | 3856 | extern tree fold_abs_const (tree, tree); |
9ea9fcf0 | 3857 | extern tree fold_indirect_ref_1 (tree, tree); |
60b8c5b3 | 3858 | |
4d28c5d1 | 3859 | extern tree force_fit_type (tree, int, bool, bool); |
3860 | ||
60b8c5b3 | 3861 | extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
3862 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3863 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3864 | extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3865 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3866 | extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3867 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3868 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3869 | extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3870 | HOST_WIDE_INT, unsigned int, | |
3871 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3872 | extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3873 | HOST_WIDE_INT, unsigned int, | |
3874 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3875 | extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3876 | HOST_WIDE_INT, unsigned int, | |
3877 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3878 | extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3879 | HOST_WIDE_INT, unsigned int, | |
3880 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3881 | ||
3882 | extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT, | |
3883 | HOST_WIDE_INT, unsigned HOST_WIDE_INT, | |
3884 | HOST_WIDE_INT, unsigned HOST_WIDE_INT *, | |
3885 | HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, | |
3886 | HOST_WIDE_INT *); | |
3887 | ||
4ee9c684 | 3888 | enum operand_equal_flag |
3889 | { | |
3890 | OEP_ONLY_CONST = 1, | |
3891 | OEP_PURE_SAME = 2 | |
3892 | }; | |
3893 | ||
3894 | extern int operand_equal_p (tree, tree, unsigned int); | |
3895 | ||
60b8c5b3 | 3896 | extern tree omit_one_operand (tree, tree, tree); |
9bc9f15f | 3897 | extern tree omit_two_operands (tree, tree, tree, tree); |
60b8c5b3 | 3898 | extern tree invert_truthvalue (tree); |
c1677a03 | 3899 | extern tree fold_unary_to_constant (enum tree_code, tree, tree); |
3900 | extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
4ee9c684 | 3901 | extern tree fold_read_from_constant_string (tree); |
3902 | extern tree int_const_binop (enum tree_code, tree, tree, int); | |
fcdd3ab3 | 3903 | extern tree build_fold_addr_expr (tree); |
198d9bbe | 3904 | extern tree fold_build_cleanup_point_expr (tree type, tree expr); |
3905 | extern tree fold_strip_sign_ops (tree); | |
fcdd3ab3 | 3906 | extern tree build_fold_addr_expr_with_type (tree, tree); |
3907 | extern tree build_fold_indirect_ref (tree); | |
1928904f | 3908 | extern tree fold_indirect_ref (tree); |
5c9198bd | 3909 | extern tree constant_boolean_node (int, tree); |
dede8dcc | 3910 | extern tree build_low_bits_mask (tree, unsigned); |
e94026da | 3911 | |
cc0bdf91 | 3912 | extern bool tree_swap_operands_p (tree, tree, bool); |
9d72d61d | 3913 | extern void swap_tree_operands (tree, tree *, tree *); |
cc0bdf91 | 3914 | extern enum tree_code swap_tree_comparison (enum tree_code); |
3915 | ||
dbc64c75 | 3916 | extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); |
eea12c72 | 3917 | extern enum tree_code invert_tree_comparison (enum tree_code, bool); |
dbc64c75 | 3918 | |
de452836 | 3919 | extern bool tree_expr_nonzero_p (tree); |
3920 | ||
805e22b2 | 3921 | /* In builtins.c */ |
4a4d48d5 | 3922 | extern tree fold_builtin (tree, tree, bool); |
f0613857 | 3923 | extern tree fold_builtin_fputs (tree, bool, bool, tree); |
ea726109 | 3924 | extern tree fold_builtin_strcpy (tree, tree, tree); |
3925 | extern tree fold_builtin_strncpy (tree, tree, tree); | |
0a39fd54 | 3926 | extern tree fold_builtin_memory_chk (tree, tree, tree, bool, |
3927 | enum built_in_function); | |
3928 | extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool, | |
3929 | enum built_in_function); | |
3930 | extern tree fold_builtin_strncpy_chk (tree, tree); | |
3931 | extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function); | |
743b0c6a | 3932 | extern bool fold_builtin_next_arg (tree); |
60b8c5b3 | 3933 | extern enum built_in_function builtin_mathfn_code (tree); |
3934 | extern tree build_function_call_expr (tree, tree); | |
3935 | extern tree mathfn_built_in (tree, enum built_in_function fn); | |
4ee9c684 | 3936 | extern tree strip_float_extensions (tree); |
4ee9c684 | 3937 | extern tree c_strlen (tree, int); |
df5d7812 | 3938 | extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *); |
f2462d6c | 3939 | extern tree build_va_arg_indirect_ref (tree); |
03f2a1be | 3940 | |
8cce4b41 | 3941 | /* In convert.c */ |
60b8c5b3 | 3942 | extern tree strip_float_extensions (tree); |
8cce4b41 | 3943 | |
9501a338 | 3944 | /* In alias.c */ |
60b8c5b3 | 3945 | extern void record_component_aliases (tree); |
3946 | extern HOST_WIDE_INT get_alias_set (tree); | |
3947 | extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); | |
c1628b55 | 3948 | extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); |
60b8c5b3 | 3949 | extern int objects_must_conflict_p (tree, tree); |
83de9b44 | 3950 | |
f52f7b9e | 3951 | /* In tree.c */ |
60b8c5b3 | 3952 | extern int really_constant_p (tree); |
3953 | extern int int_fits_type_p (tree, tree); | |
1f8a6ff8 | 3954 | extern bool variably_modified_type_p (tree, tree); |
60b8c5b3 | 3955 | extern int tree_log2 (tree); |
3956 | extern int tree_floor_log2 (tree); | |
3957 | extern int simple_cst_equal (tree, tree); | |
3958 | extern unsigned int iterative_hash_expr (tree, unsigned int); | |
3959 | extern int compare_tree_int (tree, unsigned HOST_WIDE_INT); | |
3960 | extern int type_list_equal (tree, tree); | |
3961 | extern int chain_member (tree, tree); | |
3962 | extern tree type_hash_lookup (unsigned int, tree); | |
3963 | extern void type_hash_add (unsigned int, tree); | |
60b8c5b3 | 3964 | extern int simple_cst_list_equal (tree, tree); |
3965 | extern void dump_tree_statistics (void); | |
3966 | extern void expand_function_end (void); | |
82aa4bd5 | 3967 | extern void expand_function_start (tree); |
f1a0edff | 3968 | extern void stack_protect_prologue (void); |
71d89928 | 3969 | extern void stack_protect_epilogue (void); |
750ad201 | 3970 | extern void recompute_tree_invariant_for_addr_expr (tree); |
2ce91ad7 | 3971 | extern bool is_global_var (tree t); |
4ee9c684 | 3972 | extern bool needs_to_live_in_memory (tree); |
409a160c | 3973 | extern tree reconstruct_complex_type (tree, tree); |
60b8c5b3 | 3974 | |
3975 | extern int real_onep (tree); | |
3976 | extern int real_twop (tree); | |
3977 | extern int real_minus_onep (tree); | |
3978 | extern void init_ttree (void); | |
1561d3cd | 3979 | extern void build_common_tree_nodes (bool, bool); |
60b8c5b3 | 3980 | extern void build_common_tree_nodes_2 (int); |
9cfddb70 | 3981 | extern void build_common_builtin_nodes (void); |
4f7f7efd | 3982 | extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); |
60b8c5b3 | 3983 | extern tree build_range_type (tree, tree, tree); |
2146e26d | 3984 | extern HOST_WIDE_INT int_cst_value (tree); |
3985 | extern tree tree_fold_gcd (tree, tree); | |
d2024a0d | 3986 | extern tree build_addr (tree, tree); |
f52f7b9e | 3987 | |
504d3463 | 3988 | extern bool fields_compatible_p (tree, tree); |
3989 | extern tree find_compatible_field (tree, tree); | |
3990 | ||
f52f7b9e | 3991 | /* In function.c */ |
60b8c5b3 | 3992 | extern void expand_main_function (void); |
3993 | extern void init_dummy_function_start (void); | |
3994 | extern void expand_dummy_function_end (void); | |
3995 | extern void init_function_for_compilation (void); | |
ecc82929 | 3996 | extern void allocate_struct_function (tree); |
60b8c5b3 | 3997 | extern void init_function_start (tree); |
e8825bb0 | 3998 | extern bool use_register_for_decl (tree); |
4ee9c684 | 3999 | extern void setjmp_vars_warning (tree); |
60b8c5b3 | 4000 | extern void setjmp_args_warning (void); |
60b8c5b3 | 4001 | extern void init_temp_slots (void); |
60b8c5b3 | 4002 | extern void free_temp_slots (void); |
4003 | extern void pop_temp_slots (void); | |
4004 | extern void push_temp_slots (void); | |
4005 | extern void preserve_temp_slots (rtx); | |
45550790 | 4006 | extern int aggregate_value_p (tree, tree); |
60b8c5b3 | 4007 | extern void push_function_context (void); |
4008 | extern void pop_function_context (void); | |
4009 | extern void push_function_context_to (tree); | |
4010 | extern void pop_function_context_from (tree); | |
6b275368 | 4011 | extern tree gimplify_parameters (void); |
f52f7b9e | 4012 | |
4013 | /* In print-rtl.c */ | |
4014 | #ifdef BUFSIZ | |
60b8c5b3 | 4015 | extern void print_rtl (FILE *, rtx); |
f52f7b9e | 4016 | #endif |
4017 | ||
4018 | /* In print-tree.c */ | |
60b8c5b3 | 4019 | extern void debug_tree (tree); |
f52f7b9e | 4020 | #ifdef BUFSIZ |
60b8c5b3 | 4021 | extern void print_node (FILE *, const char *, tree, int); |
4022 | extern void print_node_brief (FILE *, const char *, tree, int); | |
4023 | extern void indent_to (FILE *, int); | |
f52f7b9e | 4024 | #endif |
4025 | ||
d9671935 | 4026 | /* In tree-inline.c: */ |
4027 | extern bool debug_find_tree (tree, tree); | |
ac13e8d9 | 4028 | /* This is in tree-inline.c since the routine uses |
4029 | data structures from the inliner. */ | |
4030 | extern tree unsave_expr_now (tree); | |
03908818 | 4031 | extern tree build_duplicate_type (tree); |
d9671935 | 4032 | |
f52f7b9e | 4033 | /* In emit-rtl.c */ |
bccd9980 | 4034 | extern rtx emit_line_note (location_t); |
f52f7b9e | 4035 | |
302bf7ba | 4036 | /* In calls.c */ |
dfe08167 | 4037 | |
4fec1d6c | 4038 | /* Nonzero if this is a call to a function whose return value depends |
4039 | solely on its arguments, has no side effects, and does not read | |
4040 | global memory. */ | |
79c31609 | 4041 | #define ECF_CONST 1 |
4fec1d6c | 4042 | /* Nonzero if this call will never return. */ |
79c31609 | 4043 | #define ECF_NORETURN 2 |
4044 | /* Nonzero if this is a call to malloc or a related function. */ | |
4045 | #define ECF_MALLOC 4 | |
4046 | /* Nonzero if it is plausible that this is a call to alloca. */ | |
4047 | #define ECF_MAY_BE_ALLOCA 8 | |
4048 | /* Nonzero if this is a call to a function that won't throw an exception. */ | |
4049 | #define ECF_NOTHROW 16 | |
4050 | /* Nonzero if this is a call to setjmp or a related function. */ | |
4051 | #define ECF_RETURNS_TWICE 32 | |
4fec1d6c | 4052 | /* Nonzero if this call replaces the current stack frame. */ |
4053 | #define ECF_SIBCALL 64 | |
79c31609 | 4054 | /* Nonzero if this is a call to "pure" function (like const function, |
4055 | but may read memory. */ | |
4fec1d6c | 4056 | #define ECF_PURE 128 |
79c31609 | 4057 | /* Nonzero if this is a call to a function that returns with the stack |
4058 | pointer depressed. */ | |
4fec1d6c | 4059 | #define ECF_SP_DEPRESSED 256 |
79c31609 | 4060 | /* Create libcall block around the call. */ |
13422b8a | 4061 | #define ECF_LIBCALL_BLOCK 512 |
fc09b200 | 4062 | /* Function does not read or write memory (but may have side effects, so |
4063 | it does not necessarily fit ECF_CONST). */ | |
4064 | #define ECF_NOVOPS 1024 | |
79c31609 | 4065 | |
60b8c5b3 | 4066 | extern int flags_from_decl_or_type (tree); |
886a914d | 4067 | extern int call_expr_flags (tree); |
79c31609 | 4068 | |
60b8c5b3 | 4069 | extern int setjmp_call_p (tree); |
4070 | extern bool alloca_call_p (tree); | |
0336f0f0 | 4071 | extern bool must_pass_in_stack_var_size (enum machine_mode, tree); |
4072 | extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree); | |
302bf7ba | 4073 | |
e3f6ce11 | 4074 | /* In attribs.c. */ |
434712c4 | 4075 | |
4076 | /* Process the attributes listed in ATTRIBUTES and install them in *NODE, | |
4077 | which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, | |
4078 | it should be modified in place; if a TYPE, a copy should be created | |
4079 | unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further | |
4080 | information, in the form of a bitwise OR of flags in enum attribute_flags | |
4081 | from tree.h. Depending on these flags, some attributes may be | |
4082 | returned to be applied at a later stage (for example, to apply | |
4083 | a decl attribute to the declaration rather than to its type). */ | |
aecda0d6 | 4084 | extern tree decl_attributes (tree *, tree, int); |
e3f6ce11 | 4085 | |
f52f7b9e | 4086 | /* In integrate.c */ |
60b8c5b3 | 4087 | extern void set_decl_abstract_flags (tree, int); |
60b8c5b3 | 4088 | extern void set_decl_origin_self (tree); |
f52f7b9e | 4089 | |
f52f7b9e | 4090 | /* In stor-layout.c */ |
ee1ab431 | 4091 | extern void set_min_and_max_values_for_integral_type (tree, int, bool); |
60b8c5b3 | 4092 | extern void fixup_signed_type (tree); |
4093 | extern void internal_reference_types (void); | |
4ee9c684 | 4094 | extern unsigned int update_alignment_for_field (record_layout_info, tree, |
4095 | unsigned int); | |
f52f7b9e | 4096 | /* varasm.c */ |
b2c4af5e | 4097 | extern void make_decl_rtl (tree); |
60b8c5b3 | 4098 | extern void make_decl_one_only (tree); |
4099 | extern int supports_one_only (void); | |
4100 | extern void variable_section (tree, int); | |
60b8c5b3 | 4101 | extern void resolve_unique_section (tree, int, int); |
4102 | extern void mark_referenced (tree); | |
4490a821 | 4103 | extern void mark_decl_referenced (tree); |
3cad5dd7 | 4104 | extern void notice_global_symbol (tree); |
b2c4af5e | 4105 | extern void set_user_assembler_name (tree, const char *); |
e9f08e82 | 4106 | extern void process_pending_assemble_externals (void); |
d7401838 | 4107 | extern void finish_aliases_1 (void); |
4108 | extern void finish_aliases_2 (void); | |
f52f7b9e | 4109 | |
f52f7b9e | 4110 | /* In stmt.c */ |
60b8c5b3 | 4111 | extern void expand_computed_goto (tree); |
4112 | extern bool parse_output_constraint (const char **, int, int, int, | |
4113 | bool *, bool *, bool *); | |
d7e38994 | 4114 | extern bool parse_input_constraint (const char **, int, int, int, int, |
4115 | const char * const *, bool *, bool *); | |
4ee9c684 | 4116 | extern void expand_asm_expr (tree); |
ef13e68f | 4117 | extern tree resolve_asm_operand_names (tree, tree, tree); |
fcb807f8 | 4118 | extern void expand_case (tree); |
60b8c5b3 | 4119 | extern void expand_decl (tree); |
60b8c5b3 | 4120 | extern void expand_anon_union_decl (tree, tree, tree); |
64d5fb6a | 4121 | #ifdef HARD_CONST |
4122 | /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */ | |
4123 | extern bool decl_overlaps_hard_reg_set_p (tree, const HARD_REG_SET); | |
4124 | #endif | |
4ee9c684 | 4125 | |
4126 | /* In gimplify.c. */ | |
4127 | extern tree create_artificial_label (void); | |
4128 | extern void gimplify_function_tree (tree); | |
4129 | extern const char *get_name (tree); | |
4130 | extern tree unshare_expr (tree); | |
da41aa8e | 4131 | extern void sort_case_labels (tree); |
f52f7b9e | 4132 | |
c0c62896 | 4133 | /* If KIND=='I', return a suitable global initializer (constructor) name. |
4134 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
60b8c5b3 | 4135 | extern tree get_file_function_name (int); |
a50b6670 | 4136 | \f |
4137 | /* Interface of the DWARF2 unwind info support. */ | |
4138 | ||
a50b6670 | 4139 | /* Generate a new label for the CFI info to refer to. */ |
4140 | ||
60b8c5b3 | 4141 | extern char *dwarf2out_cfi_label (void); |
a50b6670 | 4142 | |
4143 | /* Entry point to update the canonical frame address (CFA). */ | |
4144 | ||
c043c821 | 4145 | extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); |
a50b6670 | 4146 | |
4147 | /* Add the CFI for saving a register window. */ | |
4148 | ||
60b8c5b3 | 4149 | extern void dwarf2out_window_save (const char *); |
a50b6670 | 4150 | |
4151 | /* Add a CFI to update the running total of the size of arguments pushed | |
4152 | onto the stack. */ | |
4153 | ||
c043c821 | 4154 | extern void dwarf2out_args_size (const char *, HOST_WIDE_INT); |
a50b6670 | 4155 | |
4156 | /* Entry point for saving a register to the stack. */ | |
4157 | ||
c043c821 | 4158 | extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); |
a50b6670 | 4159 | |
4160 | /* Entry point for saving the return address in the stack. */ | |
4161 | ||
c043c821 | 4162 | extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); |
a50b6670 | 4163 | |
4164 | /* Entry point for saving the return address in a register. */ | |
4165 | ||
60b8c5b3 | 4166 | extern void dwarf2out_return_reg (const char *, unsigned); |
a50b6670 | 4167 | |
567925e3 | 4168 | /* Entry point for saving the first register into the second. */ |
4169 | ||
4170 | extern void dwarf2out_reg_save_reg (const char *, rtx, rtx); | |
4171 | ||
dddcebdc | 4172 | /* In tree-inline.c */ |
4173 | ||
c6224531 | 4174 | /* The type of a set of already-visited pointers. Functions for creating |
4175 | and manipulating it are declared in pointer-set.h */ | |
4176 | struct pointer_set_t; | |
4177 | ||
4ee9c684 | 4178 | /* The type of a callback function for walking over tree structure. */ |
1431bff6 | 4179 | |
60b8c5b3 | 4180 | typedef tree (*walk_tree_fn) (tree *, int *, void *); |
c6224531 | 4181 | extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*); |
dddcebdc | 4182 | extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*); |
1431bff6 | 4183 | |
ca74b940 | 4184 | /* Assign the RTX to declaration. */ |
4185 | ||
60b8c5b3 | 4186 | extern void set_decl_rtl (tree, rtx); |
ebfc27f5 | 4187 | extern void set_decl_incoming_rtl (tree, rtx); |
bdcbc557 | 4188 | \f |
491e04ef | 4189 | /* Enum and arrays used for tree allocation stats. |
b4b174c3 | 4190 | Keep in sync with tree.c:tree_node_kind_names. */ |
b7257530 | 4191 | typedef enum |
4192 | { | |
4193 | d_kind, | |
4194 | t_kind, | |
4195 | b_kind, | |
4196 | s_kind, | |
4197 | r_kind, | |
4198 | e_kind, | |
4199 | c_kind, | |
4200 | id_kind, | |
4201 | perm_list_kind, | |
4202 | temp_list_kind, | |
4203 | vec_kind, | |
3cb98335 | 4204 | binfo_kind, |
4ee9c684 | 4205 | phi_kind, |
4206 | ssa_name_kind, | |
c75b4594 | 4207 | constr_kind, |
b7257530 | 4208 | x_kind, |
4209 | lang_decl, | |
4210 | lang_type, | |
4211 | all_kinds | |
4212 | } tree_node_kind; | |
4213 | ||
4214 | extern int tree_node_counts[]; | |
4215 | extern int tree_node_sizes[]; | |
4ee9c684 | 4216 | |
4217 | /* True if we are in gimple form and the actions of the folders need to | |
4218 | be restricted. False if we are not in gimple form and folding is not | |
4219 | restricted to creating gimple expressions. */ | |
4220 | extern bool in_gimple_form; | |
491e04ef | 4221 | |
b04fab2a | 4222 | /* In tree-gimple.c. */ |
4223 | extern tree get_base_address (tree t); | |
4224 | ||
459e8543 | 4225 | /* In tree-vectorizer.c. */ |
4226 | extern void vect_set_verbosity_level (const char *); | |
4227 | ||
5ded8c6f | 4228 | struct tree_map GTY(()) |
4229 | { | |
4230 | unsigned int hash; | |
4231 | tree from; | |
4232 | tree to; | |
4233 | }; | |
4234 | ||
4235 | extern unsigned int tree_map_hash (const void *); | |
4236 | extern int tree_map_marked_p (const void *); | |
4237 | extern int tree_map_eq (const void *, const void *); | |
4238 | ||
aed164c3 | 4239 | /* In tree-ssa-address.c. */ |
4240 | extern tree tree_mem_ref_addr (tree, tree); | |
4241 | extern void copy_mem_ref_info (tree, tree); | |
4242 | ||
0a39fd54 | 4243 | /* In tree-object-size.c. */ |
4244 | extern void init_object_sizes (void); | |
4245 | extern void fini_object_sizes (void); | |
4246 | extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int); | |
4247 | ||
516849c7 | 4248 | /* In expr.c. */ |
4249 | extern unsigned HOST_WIDE_INT highest_pow2_factor (tree); | |
4250 | ||
b229f760 | 4251 | #endif /* GCC_TREE_H */ |