]>
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, |
9f5f9308 | 3 | 2001, 2002, 2003, 2004 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 |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, 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" |
d72a838e | 28 | |
b8dea3b2 | 29 | /* Codes of tree nodes */ |
d72a838e | 30 | |
31 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
32 | ||
33 | enum tree_code { | |
34 | #include "tree.def" | |
35 | ||
4bbea254 | 36 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
6d5a6036 | 37 | NUM_TREE_CODES. */ |
d72a838e | 38 | }; |
39 | ||
40 | #undef DEFTREECODE | |
41 | ||
f3c6d29a | 42 | /* Number of language-independent tree codes. */ |
43 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
d72a838e | 44 | |
45 | /* Indexed by enum tree_code, contains a character which is | |
46 | `<' for a comparison expression, `1', for a unary arithmetic | |
47 | expression, `2' for a binary arithmetic expression, `e' for | |
48 | other types of expressions, `r' for a reference, `c' for a | |
49 | constant, `d' for a decl, `t' for a type, `s' for a statement, | |
50 | and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ | |
51 | ||
b4dae43c | 52 | #define MAX_TREE_CODES 256 |
ab1a776d | 53 | extern const char tree_code_type[]; |
b4dae43c | 54 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
d72a838e | 55 | |
0bed3869 | 56 | /* Returns nonzero iff CLASS is not the tree code of a type. */ |
66d12a6c | 57 | |
58 | #define IS_NON_TYPE_CODE_CLASS(CLASS) (strchr ("xbcdr<12se", (CLASS)) != 0) | |
59 | ||
f712a0dc | 60 | /* Returns nonzero iff CLASS is the tree-code class of an |
14ac2afb | 61 | expression. */ |
62 | ||
b5e4e1dc | 63 | #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0) |
64 | ||
65 | /* Returns nonzero iff NODE is an expression of some kind. */ | |
66 | ||
67 | #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) | |
14ac2afb | 68 | |
d72a838e | 69 | /* Number of argument-words in each kind of tree-node. */ |
70 | ||
ab1a776d | 71 | extern const unsigned char tree_code_length[]; |
f3c6d29a | 72 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
d72a838e | 73 | |
74 | /* Names of tree components. */ | |
75 | ||
ab1a776d | 76 | extern const char *const tree_code_name[]; |
d72a838e | 77 | \f |
ab7943b9 | 78 | /* Classify which part of the compiler has defined a given builtin function. |
79 | Note that we assume below that this is no more than two bits. */ | |
8305149e | 80 | enum built_in_class |
81 | { | |
82 | NOT_BUILT_IN = 0, | |
83 | BUILT_IN_FRONTEND, | |
84 | BUILT_IN_MD, | |
85 | BUILT_IN_NORMAL | |
86 | }; | |
ab7943b9 | 87 | |
88 | /* Names for the above. */ | |
8934cb0c | 89 | extern const char *const built_in_class_names[4]; |
ab7943b9 | 90 | |
d72a838e | 91 | /* Codes that identify the various built in functions |
92 | so that expand_call can identify them quickly. */ | |
93 | ||
0a68165a | 94 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM, |
d72a838e | 95 | enum built_in_function |
96 | { | |
4e9d90c7 | 97 | #include "builtins.def" |
132bc06c | 98 | |
88b5b080 | 99 | /* Upper bound on non-language-specific builtins. */ |
132bc06c | 100 | END_BUILTINS |
d72a838e | 101 | }; |
4e9d90c7 | 102 | #undef DEF_BUILTIN |
ab7943b9 | 103 | |
104 | /* Names for the above. */ | |
8934cb0c | 105 | extern const char *const built_in_names[(int) END_BUILTINS]; |
df94cd3b | 106 | |
852da3c3 | 107 | /* Helper macros for math builtins. */ |
108 | ||
109 | #define BUILTIN_EXP10_P(FN) \ | |
110 | ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ | |
111 | || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) | |
112 | ||
113 | #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ | |
114 | || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ | |
115 | || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) | |
116 | ||
117 | #define BUILTIN_SQRT_P(FN) \ | |
118 | ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) | |
119 | ||
120 | #define BUILTIN_CBRT_P(FN) \ | |
121 | ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) | |
122 | ||
123 | #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) | |
124 | ||
df94cd3b | 125 | /* An array of _DECL trees for the above. */ |
573aba85 | 126 | extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; |
0a68165a | 127 | extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; |
d72a838e | 128 | \f |
129 | /* The definition of tree nodes fills the next several pages. */ | |
130 | ||
131 | /* A tree node can represent a data type, a variable, an expression | |
132 | or a statement. Each node has a TREE_CODE which says what kind of | |
133 | thing it represents. Some common codes are: | |
134 | INTEGER_TYPE -- represents a type of integers. | |
135 | ARRAY_TYPE -- represents a type of pointer. | |
136 | VAR_DECL -- represents a declared variable. | |
137 | INTEGER_CST -- represents a constant integer value. | |
138 | PLUS_EXPR -- represents a sum (an expression). | |
139 | ||
140 | As for the contents of a tree node: there are some fields | |
141 | that all nodes share. Each TREE_CODE has various special-purpose | |
142 | fields as well. The fields of a node are never accessed directly, | |
143 | always through accessor macros. */ | |
144 | ||
d72a838e | 145 | /* Every kind of tree node starts with this structure, |
146 | so all nodes have these fields. | |
147 | ||
a7baca71 | 148 | See the accessor macros, defined below, for documentation of the |
a7dce381 | 149 | fields. */ |
4ee9c684 | 150 | union tree_ann_d; |
d72a838e | 151 | |
1f3233d1 | 152 | struct tree_common GTY(()) |
d72a838e | 153 | { |
6a3e3d6d | 154 | tree chain; |
155 | tree type; | |
4ee9c684 | 156 | union tree_ann_d *ann; |
20f2763e | 157 | |
488c4206 | 158 | ENUM_BITFIELD(tree_code) code : 8; |
20f2763e | 159 | |
d72a838e | 160 | unsigned side_effects_flag : 1; |
161 | unsigned constant_flag : 1; | |
d72a838e | 162 | unsigned addressable_flag : 1; |
163 | unsigned volatile_flag : 1; | |
164 | unsigned readonly_flag : 1; | |
165 | unsigned unsigned_flag : 1; | |
166 | unsigned asm_written_flag: 1; | |
4ee9c684 | 167 | unsigned nowarning_flag : 1; |
66d12a6c | 168 | |
4ee9c684 | 169 | unsigned used_flag : 1; |
00dd2e9e | 170 | unsigned nothrow_flag : 1; |
d72a838e | 171 | unsigned static_flag : 1; |
172 | unsigned public_flag : 1; | |
173 | unsigned private_flag : 1; | |
174 | unsigned protected_flag : 1; | |
88da234d | 175 | unsigned deprecated_flag : 1; |
4ee9c684 | 176 | unsigned invariant_flag : 1; |
d72a838e | 177 | |
178 | unsigned lang_flag_0 : 1; | |
179 | unsigned lang_flag_1 : 1; | |
180 | unsigned lang_flag_2 : 1; | |
181 | unsigned lang_flag_3 : 1; | |
182 | unsigned lang_flag_4 : 1; | |
183 | unsigned lang_flag_5 : 1; | |
184 | unsigned lang_flag_6 : 1; | |
4ee9c684 | 185 | unsigned visited : 1; |
d72a838e | 186 | }; |
187 | ||
7e787821 | 188 | /* The following table lists the uses of each of the above flags and |
189 | for which types of nodes they are defined. Note that expressions | |
190 | include decls. | |
191 | ||
192 | addressable_flag: | |
193 | ||
194 | TREE_ADDRESSABLE in | |
60b8c5b3 | 195 | VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, |
d513ec2f | 196 | ..._TYPE, IDENTIFIER_NODE. |
197 | In a STMT_EXPR, it means we want the result of the enclosed | |
198 | expression. | |
4ee9c684 | 199 | CALL_EXPR_TAILCALL in CALL_EXPR |
7e787821 | 200 | |
201 | static_flag: | |
202 | ||
203 | TREE_STATIC in | |
997d68fe | 204 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
7e787821 | 205 | TREE_VIA_VIRTUAL in |
206 | TREE_LIST or TREE_VEC | |
207 | TREE_CONSTANT_OVERFLOW in | |
886cfd4f | 208 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
7e787821 | 209 | TREE_SYMBOL_REFERENCED in |
210 | IDENTIFIER_NODE | |
a9bc793b | 211 | CLEANUP_EH_ONLY in |
212 | TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, | |
213 | TREE_LIST elements of a block's cleanup list. | |
4ee9c684 | 214 | ASM_INPUT_P in |
215 | ASM_EXPR | |
216 | EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR | |
b24423db | 217 | TYPE_REF_CAN_ALIAS_ALL in |
218 | POINTER_TYPE, REFERENCE_TYPE | |
7e787821 | 219 | |
220 | public_flag: | |
221 | ||
222 | TREE_OVERFLOW in | |
886cfd4f | 223 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
b24423db | 224 | ??? and other expressions? |
7e787821 | 225 | TREE_PUBLIC in |
1e5bfc66 | 226 | VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE |
4ee9c684 | 227 | TREE_VIA_PUBLIC in |
228 | TREE_LIST or TREE_VEC | |
229 | ASM_VOLATILE_P in | |
230 | ASM_EXPR | |
7e787821 | 231 | |
232 | private_flag: | |
233 | ||
7e787821 | 234 | TREE_PRIVATE in |
a9bc793b | 235 | ..._DECL |
805e22b2 | 236 | CALL_EXPR_HAS_RETURN_SLOT_ADDR in |
237 | CALL_EXPR | |
7e787821 | 238 | |
239 | protected_flag: | |
240 | ||
7e787821 | 241 | TREE_PROTECTED in |
242 | BLOCK | |
a9bc793b | 243 | ..._DECL |
eaa112a0 | 244 | CALL_FROM_THUNK_P in |
245 | CALL_EXPR | |
7e787821 | 246 | |
247 | side_effects_flag: | |
248 | ||
249 | TREE_SIDE_EFFECTS in | |
250 | all expressions | |
66d12a6c | 251 | all decls |
252 | all constants | |
7e787821 | 253 | |
4ee9c684 | 254 | FORCED_LABEL in |
255 | LABEL_DECL | |
256 | ||
7e787821 | 257 | volatile_flag: |
258 | ||
259 | TREE_THIS_VOLATILE in | |
260 | all expressions | |
261 | TYPE_VOLATILE in | |
262 | ..._TYPE | |
263 | ||
264 | readonly_flag: | |
265 | ||
266 | TREE_READONLY in | |
997d68fe | 267 | all expressions |
7e787821 | 268 | TYPE_READONLY in |
269 | ..._TYPE | |
270 | ||
271 | constant_flag: | |
272 | ||
273 | TREE_CONSTANT in | |
274 | all expressions | |
66d12a6c | 275 | all decls |
276 | all constants | |
7e787821 | 277 | |
7e787821 | 278 | unsigned_flag: |
279 | ||
78a8ed03 | 280 | TYPE_UNSIGNED in |
281 | all types | |
86ae60fd | 282 | DECL_UNSIGNED in |
283 | all decls | |
284 | BIT_FIELD_REF_UNSIGNED in | |
285 | BIT_FIELD_REF | |
0dbd1c74 | 286 | SAVE_EXPR_NOPLACEHOLDER in |
287 | SAVE_EXPR | |
7e787821 | 288 | |
289 | asm_written_flag: | |
290 | ||
291 | TREE_ASM_WRITTEN in | |
292 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
4ee9c684 | 293 | BLOCK, SSA_NAME |
7e787821 | 294 | |
295 | used_flag: | |
296 | ||
297 | TREE_USED in | |
298 | expressions, IDENTIFIER_NODE | |
299 | ||
00dd2e9e | 300 | nothrow_flag: |
7e787821 | 301 | |
00dd2e9e | 302 | TREE_NOTHROW in |
303 | CALL_EXPR, FUNCTION_DECL | |
7e787821 | 304 | |
9f5f9308 | 305 | TYPE_ALIGN_OK in |
306 | ..._TYPE | |
307 | ||
88da234d | 308 | deprecated_flag: |
309 | ||
310 | TREE_DEPRECATED in | |
311 | ..._DECL | |
eaa112a0 | 312 | |
4ee9c684 | 313 | visited: |
314 | ||
315 | Used in tree traversals to mark visited nodes. | |
316 | ||
317 | invariant_flag: | |
318 | ||
319 | TREE_INVARIANT in | |
320 | all expressions. | |
321 | ||
322 | nowarning_flag: | |
323 | ||
324 | TREE_NO_WARNING in | |
325 | ... any expr node | |
88da234d | 326 | */ |
716fc477 | 327 | |
d72a838e | 328 | /* Define accessors for the fields that all tree nodes have |
329 | (though some fields are not used for all kinds of nodes). */ | |
330 | ||
331 | /* The tree-code says what kind of node it is. | |
332 | Codes are defined in tree.def. */ | |
333 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
2aea9e36 | 334 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE)) |
d72a838e | 335 | |
3e207e38 | 336 | /* When checking is enabled, errors will be generated if a tree node |
a4070a91 | 337 | is accessed incorrectly. The macros abort with a fatal error. */ |
0c4e40c5 | 338 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
3e207e38 | 339 | |
5e674ace | 340 | #define TREE_CHECK(T, CODE) __extension__ \ |
341 | ({ const tree __t = (T); \ | |
342 | if (TREE_CODE (__t) != (CODE)) \ | |
343 | tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \ | |
a4070a91 | 344 | __t; }) |
5e674ace | 345 | |
82bb2115 | 346 | #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ |
347 | ({ const tree __t = (T); \ | |
348 | if (TREE_CODE (__t) != (CODE1) \ | |
349 | && TREE_CODE (__t) != (CODE2)) \ | |
350 | tree_check2_failed (__t, (CODE1), (CODE2), __FILE__, __LINE__, \ | |
351 | __FUNCTION__); \ | |
352 | __t; }) | |
353 | ||
354 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
355 | ({ const tree __t = (T); \ | |
356 | if (TREE_CODE (__t) != (CODE1) \ | |
357 | && TREE_CODE (__t) != (CODE2) \ | |
358 | && TREE_CODE (__t) != (CODE3)) \ | |
359 | tree_check3_failed (__t, (CODE1), (CODE2), (CODE3), __FILE__, \ | |
360 | __LINE__, __FUNCTION__); \ | |
361 | __t; }) | |
362 | ||
b24423db | 363 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ |
364 | ({ const tree __t = (T); \ | |
365 | if (TREE_CODE (__t) != (CODE1) \ | |
366 | && TREE_CODE (__t) != (CODE2) \ | |
367 | && TREE_CODE (__t) != (CODE3) \ | |
368 | && TREE_CODE (__t) != (CODE4)) \ | |
369 | tree_check4_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \ | |
370 | __FILE__, __LINE__, __FUNCTION__); \ | |
371 | __t; }) | |
372 | ||
82bb2115 | 373 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ |
374 | ({ const tree __t = (T); \ | |
375 | if (TREE_CODE (__t) != (CODE1) \ | |
376 | && TREE_CODE (__t) != (CODE2) \ | |
377 | && TREE_CODE (__t) != (CODE3) \ | |
378 | && TREE_CODE (__t) != (CODE4) \ | |
379 | && TREE_CODE (__t) != (CODE5)) \ | |
380 | tree_check5_failed (__t, (CODE1), (CODE2), (CODE3), (CODE4), \ | |
381 | (CODE5), __FILE__, __LINE__, __FUNCTION__); \ | |
382 | __t; }) | |
383 | ||
5e674ace | 384 | #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ |
385 | ({ const tree __t = (T); \ | |
386 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ | |
387 | tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ | |
76c6f48d | 388 | __FUNCTION__); \ |
a4070a91 | 389 | __t; }) |
390 | ||
391 | /* These checks have to be special cased. */ | |
5e674ace | 392 | #define EXPR_CHECK(T) __extension__ \ |
393 | ({ const tree __t = (T); \ | |
394 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
47549347 | 395 | if (!IS_EXPR_CODE_CLASS (__c)) \ |
66d12a6c | 396 | tree_class_check_failed (__t, 'E', __FILE__, __LINE__, \ |
397 | __FUNCTION__); \ | |
398 | __t; }) | |
399 | ||
400 | /* These checks have to be special cased. */ | |
401 | #define NON_TYPE_CHECK(T) __extension__ \ | |
402 | ({ const tree __t = (T); \ | |
403 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
404 | if (!IS_NON_TYPE_CODE_CLASS (__c)) \ | |
405 | tree_class_check_failed (__t, 'T', __FILE__, __LINE__, \ | |
76c6f48d | 406 | __FUNCTION__); \ |
a4070a91 | 407 | __t; }) |
408 | ||
4ee9c684 | 409 | #define EREF_NODE_CHECK(t) __extension__ \ |
410 | ({ const tree __t = t; \ | |
411 | if (TREE_CODE (__t) != EPHI_NODE \ | |
412 | && TREE_CODE (__t) != EKILL_NODE \ | |
413 | && TREE_CODE (__t) != EUSE_NODE \ | |
414 | && TREE_CODE (__t) != EEXIT_NODE) \ | |
415 | tree_check_failed (__t, TREE_CODE (t), \ | |
416 | __FILE__, __LINE__, __FUNCTION__); \ | |
417 | __t; }) | |
418 | ||
5e674ace | 419 | #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ |
420 | (*({const tree __t = (T); \ | |
421 | const int __i = (I); \ | |
66bc87db | 422 | if (TREE_CODE (__t) != TREE_VEC) \ |
423 | tree_check_failed (__t, TREE_VEC, \ | |
424 | __FILE__, __LINE__, __FUNCTION__); \ | |
425 | if (__i < 0 || __i >= __t->vec.length) \ | |
426 | tree_vec_elt_check_failed (__i, __t->vec.length, \ | |
427 | __FILE__, __LINE__, __FUNCTION__); \ | |
428 | &__t->vec.a[__i]; })) | |
429 | ||
4ee9c684 | 430 | #define EPHI_NODE_ELT_CHECK(t, i) __extension__ \ |
431 | (*({const tree __t = t; \ | |
432 | const int __i = (i); \ | |
433 | if (TREE_CODE (__t) != EPHI_NODE) \ | |
434 | tree_check_failed (__t, EPHI_NODE, \ | |
435 | __FILE__, __LINE__, __FUNCTION__); \ | |
436 | if (__i < 0 || __i >= __t->ephi.capacity) \ | |
437 | ephi_node_elt_check_failed (__i, __t->ephi.num_args, \ | |
438 | __FILE__, __LINE__, __FUNCTION__); \ | |
439 | &__t->ephi.a[__i]; })) | |
440 | ||
441 | #define PHI_NODE_ELT_CHECK(t, i) __extension__ \ | |
442 | (*({const tree __t = t; \ | |
443 | const int __i = (i); \ | |
444 | if (TREE_CODE (__t) != PHI_NODE) \ | |
445 | tree_check_failed (__t, PHI_NODE, \ | |
446 | __FILE__, __LINE__, __FUNCTION__); \ | |
447 | if (__i < 0 || __i >= __t->phi.capacity) \ | |
448 | phi_node_elt_check_failed (__i, __t->phi.num_args, \ | |
449 | __FILE__, __LINE__, __FUNCTION__); \ | |
450 | &__t->phi.a[__i]; })) | |
451 | ||
2fcde217 | 452 | /* Special checks for TREE_OPERANDs. */ |
5e674ace | 453 | #define TREE_OPERAND_CHECK(T, I) __extension__ \ |
acdc09d1 | 454 | (*({const tree __t = EXPR_CHECK (T); \ |
5e674ace | 455 | const int __i = (I); \ |
2fcde217 | 456 | if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ |
457 | tree_operand_check_failed (__i, TREE_CODE (__t), \ | |
458 | __FILE__, __LINE__, __FUNCTION__); \ | |
459 | &__t->exp.operands[__i]; })) | |
460 | ||
5e674ace | 461 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ |
462 | (*({const tree __t = (T); \ | |
463 | const int __i = (I); \ | |
464 | if (TREE_CODE (__t) != CODE) \ | |
465 | tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \ | |
466 | if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \ | |
467 | tree_operand_check_failed (__i, (CODE), \ | |
2fcde217 | 468 | __FILE__, __LINE__, __FUNCTION__); \ |
469 | &__t->exp.operands[__i]; })) | |
470 | ||
5e674ace | 471 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \ |
2fcde217 | 472 | (*(rtx *) \ |
5e674ace | 473 | ({const tree __t = (T); \ |
474 | const int __i = (I); \ | |
475 | if (TREE_CODE (__t) != (CODE)) \ | |
476 | tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \ | |
477 | if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \ | |
478 | tree_operand_check_failed (__i, (CODE), \ | |
2fcde217 | 479 | __FILE__, __LINE__, __FUNCTION__); \ |
480 | &__t->exp.operands[__i]; })) | |
481 | ||
60b8c5b3 | 482 | extern void tree_check_failed (const tree, enum tree_code, |
483 | const char *, int, const char *) | |
a4070a91 | 484 | ATTRIBUTE_NORETURN; |
82bb2115 | 485 | extern void tree_check2_failed (const tree, enum tree_code, enum tree_code, |
486 | const char *, int, const char *) | |
487 | ATTRIBUTE_NORETURN; | |
488 | extern void tree_check3_failed (const tree, enum tree_code, enum tree_code, | |
489 | enum tree_code, const char *, int, | |
490 | const char *) | |
491 | ATTRIBUTE_NORETURN; | |
b24423db | 492 | extern void tree_check4_failed (const tree, enum tree_code, enum tree_code, |
493 | enum tree_code, enum tree_code, | |
494 | const char *, int, const char *) | |
495 | ATTRIBUTE_NORETURN; | |
82bb2115 | 496 | extern void tree_check5_failed (const tree, enum tree_code, enum tree_code, |
497 | enum tree_code, enum tree_code, enum tree_code, | |
498 | const char *, int, const char *) | |
499 | ATTRIBUTE_NORETURN; | |
60b8c5b3 | 500 | extern void tree_class_check_failed (const tree, int, |
501 | const char *, int, const char *) | |
a4070a91 | 502 | ATTRIBUTE_NORETURN; |
60b8c5b3 | 503 | extern void tree_vec_elt_check_failed (int, int, const char *, |
504 | int, const char *) | |
66bc87db | 505 | ATTRIBUTE_NORETURN; |
4ee9c684 | 506 | extern void phi_node_elt_check_failed (int, int, const char *, |
507 | int, const char *) | |
508 | ATTRIBUTE_NORETURN; | |
509 | extern void ephi_node_elt_check_failed (int, int, const char *, | |
510 | int, const char *) | |
511 | ATTRIBUTE_NORETURN; | |
a4070a91 | 512 | |
60b8c5b3 | 513 | extern void tree_operand_check_failed (int, enum tree_code, |
514 | const char *, int, const char *) | |
2fcde217 | 515 | ATTRIBUTE_NORETURN; |
60b8c5b3 | 516 | |
0c4e40c5 | 517 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
3e207e38 | 518 | |
82bb2115 | 519 | #define TREE_CHECK(T, CODE) (T) |
520 | #define TREE_CHECK2(T, CODE1, CODE2) (T) | |
521 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) | |
b24423db | 522 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
82bb2115 | 523 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
524 | #define TREE_CLASS_CHECK(T, CODE) (T) | |
525 | #define EXPR_CHECK(T) (T) | |
66d12a6c | 526 | #define NON_TYPE_CHECK(T) (T) |
82bb2115 | 527 | #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
528 | #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) | |
529 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) | |
5e674ace | 530 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I])) |
4ee9c684 | 531 | #define EREF_NODE_CHECK(T) (T) |
532 | #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i]) | |
533 | #define EPHI_NODE_ELT_CHECK(T, i) ((T)->ephi.a[i]) | |
a4070a91 | 534 | |
535 | #endif | |
536 | ||
4ee9c684 | 537 | #define TREE_BLOCK(NODE) ((NODE)->exp.block) |
538 | ||
a4070a91 | 539 | #include "tree-check.h" |
540 | ||
5e674ace | 541 | #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't') |
542 | #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd') | |
543 | #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c') | |
544 | #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's') | |
82bb2115 | 545 | #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
b24423db | 546 | #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
82bb2115 | 547 | |
49be8259 | 548 | #define SET_OR_ARRAY_CHECK(T) \ |
549 | TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE) | |
82bb2115 | 550 | |
551 | #define REC_OR_UNION_CHECK(T) \ | |
552 | TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) | |
553 | ||
554 | #define NUMERICAL_TYPE_CHECK(T) \ | |
555 | TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \ | |
556 | CHAR_TYPE, REAL_TYPE) | |
3e207e38 | 557 | |
d72a838e | 558 | /* In all nodes that are expressions, this is the data type of the expression. |
559 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
8a95ab85 | 560 | In ARRAY_TYPE nodes, this is the type of the elements. |
561 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
d72a838e | 562 | #define TREE_TYPE(NODE) ((NODE)->common.type) |
563 | ||
3609f4f0 | 564 | /* Here is how primitive or already-canonicalized types' hash codes |
565 | are made. */ | |
908e5f41 | 566 | #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
567 | ||
568 | /* A simple hash function for an arbitrary tree node. This must not be | |
569 | used in hash tables which are saved to a PCH. */ | |
570 | #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) | |
3609f4f0 | 571 | |
d72a838e | 572 | /* Nodes are chained together for many purposes. |
573 | Types are chained together to record them for being output to the debugger | |
574 | (see the function `chain_type'). | |
575 | Decls in the same scope are chained together to record the contents | |
576 | of the scope. | |
577 | Statement nodes for successive statements used to be chained together. | |
578 | Often lists of things are represented by TREE_LIST nodes that | |
579 | are chained together. */ | |
580 | ||
581 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
582 | ||
583 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
584 | that don't change the machine mode. */ | |
585 | ||
bdcbc557 | 586 | #define STRIP_NOPS(EXP) \ |
d72a838e | 587 | while ((TREE_CODE (EXP) == NOP_EXPR \ |
588 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
589 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 590 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
d72a838e | 591 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
592 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
7ec74242 | 593 | (EXP) = TREE_OPERAND (EXP, 0) |
f2bfbd07 | 594 | |
155b05dc | 595 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
596 | ||
597 | #define STRIP_SIGN_NOPS(EXP) \ | |
598 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
599 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
600 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 601 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
155b05dc | 602 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
603 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
78a8ed03 | 604 | && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \ |
605 | == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
7ec74242 | 606 | (EXP) = TREE_OPERAND (EXP, 0) |
155b05dc | 607 | |
10f6a269 | 608 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */ |
609 | ||
610 | #define STRIP_MAIN_TYPE_NOPS(EXP) \ | |
611 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
612 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
613 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
614 | && TREE_OPERAND (EXP, 0) != error_mark_node \ | |
615 | && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \ | |
616 | == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
617 | (EXP) = TREE_OPERAND (EXP, 0) | |
618 | ||
f2bfbd07 | 619 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
620 | ||
621 | #define STRIP_TYPE_NOPS(EXP) \ | |
622 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
623 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
624 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
bdcbc557 | 625 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
f2bfbd07 | 626 | && (TREE_TYPE (EXP) \ |
627 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
7ec74242 | 628 | (EXP) = TREE_OPERAND (EXP, 0) |
ffcb8a96 | 629 | |
4ee9c684 | 630 | /* Remove unnecessary type conversions according to |
631 | tree_ssa_useless_type_conversion. */ | |
632 | ||
633 | #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ | |
634 | while (tree_ssa_useless_type_conversion (EXP)) \ | |
635 | EXP = TREE_OPERAND (EXP, 0) | |
636 | ||
ffcb8a96 | 637 | /* Nonzero if TYPE represents an integral type. Note that we do not |
638 | include COMPLEX types here. */ | |
639 | ||
640 | #define INTEGRAL_TYPE_P(TYPE) \ | |
641 | (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ | |
642 | || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) | |
643 | ||
4b69983d | 644 | /* Nonzero if TYPE represents a scalar floating-point type. */ |
645 | ||
646 | #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) | |
647 | ||
648 | /* Nonzero if TYPE represents a complex floating-point type. */ | |
649 | ||
650 | #define COMPLEX_FLOAT_TYPE_P(TYPE) \ | |
651 | (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
652 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
653 | ||
ffcb8a96 | 654 | /* Nonzero if TYPE represents a floating-point type, including complex |
655 | floating-point types. */ | |
656 | ||
657 | #define FLOAT_TYPE_P(TYPE) \ | |
4b69983d | 658 | (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE)) |
68db3216 | 659 | |
88b5b080 | 660 | /* Nonzero if TYPE represents an aggregate (multi-component) type. */ |
68db3216 | 661 | |
662 | #define AGGREGATE_TYPE_P(TYPE) \ | |
663 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
664 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ | |
665 | || TREE_CODE (TYPE) == SET_TYPE) | |
e57949ab | 666 | |
1c15359d | 667 | /* Nonzero if TYPE represents a pointer or reference type. |
668 | (It should be renamed to INDIRECT_TYPE_P.) */ | |
e57949ab | 669 | |
670 | #define POINTER_TYPE_P(TYPE) \ | |
671 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
1071e86e | 672 | |
4b72716d | 673 | /* Nonzero if this type is a complete type. */ |
674 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
675 | ||
5c803577 | 676 | /* Nonzero if this type is the (possibly qualified) void type. */ |
c92b3a11 | 677 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
5c803577 | 678 | |
4b72716d | 679 | /* Nonzero if this type is complete or is cv void. */ |
680 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
56ba46a4 | 681 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
4b72716d | 682 | |
683 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
684 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
7ec74242 | 685 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
4b72716d | 686 | |
1071e86e | 687 | /* Nonzero if TYPE represents a type. */ |
688 | ||
689 | #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't') | |
d72a838e | 690 | \f |
691 | /* Define many boolean fields that all tree nodes have. */ | |
692 | ||
693 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
694 | So it cannot be in a register. | |
695 | In a FUNCTION_DECL, nonzero means its address is needed. | |
696 | So it must be compiled even if it is an inline function. | |
cec9f9b5 | 697 | In a FIELD_DECL node, it means that the programmer is permitted to |
698 | construct the address of this field. This is used for aliasing | |
699 | purposes: see record_component_aliases. | |
d72a838e | 700 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
6c34d0c2 | 701 | In LABEL_DECL nodes, it means a goto for this label has been seen |
d72a838e | 702 | from a place outside all binding contours that restore stack levels. |
703 | In ..._TYPE nodes, it means that objects of this type must | |
704 | be fully addressable. This means that pieces of this | |
705 | object cannot go into register parameters, for example. | |
706 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
707 | had its address taken. That matters for inline functions. */ | |
708 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
709 | ||
4ee9c684 | 710 | #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag) |
711 | ||
d72a838e | 712 | /* In a VAR_DECL, nonzero means allocate static storage. |
bc3a4bfd | 713 | In a FUNCTION_DECL, nonzero if function has been defined. |
b24423db | 714 | In a CONSTRUCTOR, nonzero means allocate static storage. |
715 | ||
716 | ??? This is also used in lots of other nodes in unclear ways which | |
717 | should be cleaned up some day. */ | |
d72a838e | 718 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) |
719 | ||
a9bc793b | 720 | /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a |
721 | block's cleanup list, means that the pertinent cleanup should only be | |
722 | executed if an exception is thrown, not on normal exit of its scope. */ | |
723 | #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag) | |
724 | ||
4ee9c684 | 725 | /* In an expr node (usually a conversion) this means the node was made |
726 | implicitly and should not lead to any sort of warning. */ | |
727 | #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag) | |
d72a838e | 728 | |
729 | /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation | |
730 | chain is via a `virtual' declaration. */ | |
b24423db | 731 | #define TREE_VIA_VIRTUAL(NODE) \ |
732 | (TREE_CHECK2 (NODE, TREE_LIST, TREE_VEC)->common.static_flag) | |
d72a838e | 733 | |
886cfd4f | 734 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means |
735 | there was an overflow in folding. This is distinct from | |
736 | TREE_OVERFLOW because ANSI C requires a diagnostic when overflows | |
737 | occur in constant expressions. */ | |
b24423db | 738 | #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag) |
7eec364c | 739 | |
2cf6f20a | 740 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
741 | this string as an argument. */ | |
56ba46a4 | 742 | #define TREE_SYMBOL_REFERENCED(NODE) \ |
76c6f48d | 743 | (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag) |
2cf6f20a | 744 | |
b24423db | 745 | /* Nonzero in a pointer or reference type means the data pointed to |
746 | by this type can alias anything. */ | |
747 | #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ | |
748 | (PTR_OR_REF_CHECK (NODE)->common.static_flag) | |
749 | ||
886cfd4f | 750 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
751 | there was an overflow in folding, and no warning has been issued | |
b24423db | 752 | for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, |
753 | but not vice versa. | |
754 | ||
755 | ??? Apparently, lots of code assumes this is defined in all | |
756 | expressions. */ | |
7eec364c | 757 | #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) |
758 | ||
d72a838e | 759 | /* In a VAR_DECL or FUNCTION_DECL, |
760 | nonzero means name is to be accessible from outside this module. | |
1e5bfc66 | 761 | In an IDENTIFIER_NODE, nonzero means an external declaration |
4bbea254 | 762 | accessible from outside this module was previously seen |
d72a838e | 763 | for this name in an inner scope. */ |
764 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
765 | ||
66d12a6c | 766 | /* In any expression, decl, or constant, nonzero means it has side effects or |
767 | reevaluation of the whole expression could produce a different value. | |
768 | This is set if any subexpression is a function call, a side effect or a | |
769 | reference to a volatile variable. In a ..._DECL, this is set only if the | |
770 | declaration said `volatile'. This will never be set for a constant. */ | |
771 | #define TREE_SIDE_EFFECTS(NODE) \ | |
772 | (NON_TYPE_CHECK (NODE)->common.side_effects_flag) | |
d72a838e | 773 | |
4ee9c684 | 774 | /* In a LABEL_DECL, nonzero means this label had its address taken |
775 | and therefore can never be deleted and is a jump target for | |
776 | computed gotos. */ | |
777 | #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag) | |
778 | ||
d72a838e | 779 | /* Nonzero means this expression is volatile in the C sense: |
780 | its address should be of type `volatile WHATEVER *'. | |
781 | In other words, the declared item is volatile qualified. | |
782 | This is used in _DECL nodes and _REF nodes. | |
783 | ||
784 | In a ..._TYPE node, means this type is volatile-qualified. | |
785 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
786 | because eventually we may make that a different bit. | |
787 | ||
788 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
789 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
790 | ||
791 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, | |
66d12a6c | 792 | nonzero means it may not be the lhs of an assignment. */ |
793 | #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag) | |
d72a838e | 794 | |
a8b24921 | 795 | /* Nonzero if NODE is a _DECL with TREE_READONLY set. */ |
66d12a6c | 796 | #define TREE_READONLY_DECL_P(NODE) (DECL_P (NODE) && TREE_READONLY (NODE)) |
1431bff6 | 797 | |
66d12a6c | 798 | /* Value of expression is constant. Always on in all ..._CST nodes. May |
799 | also appear in an expression or decl where the value is constant. */ | |
800 | #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag) | |
d72a838e | 801 | |
86ae60fd | 802 | /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
803 | #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag) | |
804 | ||
805 | /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */ | |
806 | #define BIT_FIELD_REF_UNSIGNED(NODE) \ | |
807 | (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag) | |
d72a838e | 808 | |
78a8ed03 | 809 | /* In integral and pointer types, means an unsigned type. */ |
810 | #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag) | |
811 | ||
56ba46a4 | 812 | #define TYPE_TRAP_SIGNED(NODE) \ |
78a8ed03 | 813 | (flag_trapv && ! TYPE_UNSIGNED (NODE)) |
bec2d490 | 814 | |
d72a838e | 815 | /* Nonzero in a VAR_DECL means assembler code has been written. |
816 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
817 | This is interesting in an inline function, since it might not need | |
818 | to be compiled separately. | |
7dd9d898 | 819 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
bc3a4bfd | 820 | if the sdb debugging info for the type has been written. |
4ee9c684 | 821 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
822 | In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal | |
823 | PHI node. */ | |
d72a838e | 824 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
825 | ||
826 | /* Nonzero in a _DECL if the name is used in its scope. | |
827 | Nonzero in an expr node means inhibit warning if value is unused. | |
828 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
829 | was used. */ | |
830 | #define TREE_USED(NODE) ((NODE)->common.used_flag) | |
831 | ||
00dd2e9e | 832 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw |
833 | an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ | |
834 | #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag) | |
a9d9ab08 | 835 | |
805e22b2 | 836 | /* In a CALL_EXPR, means that the address of the return slot is part of the |
837 | argument list. */ | |
838 | #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag) | |
839 | ||
eaa112a0 | 840 | /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
841 | thunked-to function. */ | |
842 | #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag) | |
843 | ||
a9d9ab08 | 844 | /* In a type, nonzero means that all objects of the type are guaranteed by the |
845 | language or front-end to be properly aligned, so we can indicate that a MEM | |
846 | of this type is aligned at least to the alignment of the type, even if it | |
847 | doesn't appear that it is. We see this, for example, in object-oriented | |
848 | languages where a tag field may show this is an object of a more-aligned | |
4ee9c684 | 849 | variant of the more generic type. |
850 | ||
851 | In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME | |
852 | freelist. */ | |
a9d9ab08 | 853 | #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag) |
d72a838e | 854 | |
bc3a4bfd | 855 | /* Used in classes in C++. */ |
d72a838e | 856 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
bc3a4bfd | 857 | /* Used in classes in C++. |
858 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
d72a838e | 859 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
860 | ||
dafdd1c8 | 861 | /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a |
88da234d | 862 | deprecated feature by __attribute__((deprecated)). */ |
863 | #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag) | |
864 | ||
4ee9c684 | 865 | /* Value of expression is function invariant. A strict subset of |
866 | TREE_CONSTANT, such an expression is constant over any one function | |
867 | invocation, though not across different invocations. May appear in | |
868 | any expression node. */ | |
869 | #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag) | |
870 | ||
bc3a4bfd | 871 | /* These flags are available for each language front end to use internally. */ |
d72a838e | 872 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
873 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
874 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
875 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
876 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
877 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
878 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
879 | \f | |
880 | /* Define additional fields and accessors for nodes representing constants. */ | |
881 | ||
9e6d0a9a | 882 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
883 | If the data type is signed, the value is sign-extended to 2 words | |
d72a838e | 884 | even though not all of them may really be in use. |
9e6d0a9a | 885 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2a8a276e | 886 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
887 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
888 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
d72a838e | 889 | |
76c6f48d | 890 | #define INT_CST_LT(A, B) \ |
891 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
892 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
56ba46a4 | 893 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
d72a838e | 894 | |
76c6f48d | 895 | #define INT_CST_LT_UNSIGNED(A, B) \ |
896 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
897 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
898 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
6c34d0c2 | 899 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
56ba46a4 | 900 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
60b8c5b3 | 901 | |
1f3233d1 | 902 | struct tree_int_cst GTY(()) |
d72a838e | 903 | { |
851dfbff | 904 | struct tree_common common; |
2a8a276e | 905 | /* A sub-struct is necessary here because the function `const_hash' |
906 | wants to scan both words as a unit and taking the address of the | |
907 | sub-struct yields the properly inclusive bounded pointer. */ | |
1f3233d1 | 908 | struct tree_int_cst_lowhi { |
2a8a276e | 909 | unsigned HOST_WIDE_INT low; |
910 | HOST_WIDE_INT high; | |
911 | } int_cst; | |
d72a838e | 912 | }; |
913 | ||
479838ec | 914 | /* In a REAL_CST node. struct real_value is an opaque entity, with |
ef258422 | 915 | manipulators defined in real.h. We don't want tree.h depending on |
916 | real.h and transitively on tm.h. */ | |
479838ec | 917 | struct real_value; |
56ba46a4 | 918 | |
ef258422 | 919 | #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
920 | #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) | |
d72a838e | 921 | |
1f3233d1 | 922 | struct tree_real_cst GTY(()) |
d72a838e | 923 | { |
851dfbff | 924 | struct tree_common common; |
479838ec | 925 | struct real_value * real_cst_ptr; |
d72a838e | 926 | }; |
927 | ||
928 | /* In a STRING_CST */ | |
3e207e38 | 929 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
cbe4c3a5 | 930 | #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer) |
d72a838e | 931 | |
1f3233d1 | 932 | struct tree_string GTY(()) |
d72a838e | 933 | { |
851dfbff | 934 | struct tree_common common; |
d72a838e | 935 | int length; |
cbe4c3a5 | 936 | const char *pointer; |
d72a838e | 937 | }; |
938 | ||
939 | /* In a COMPLEX_CST node. */ | |
3e207e38 | 940 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
941 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
d72a838e | 942 | |
1f3233d1 | 943 | struct tree_complex GTY(()) |
d72a838e | 944 | { |
851dfbff | 945 | struct tree_common common; |
6a3e3d6d | 946 | tree real; |
947 | tree imag; | |
d72a838e | 948 | }; |
886cfd4f | 949 | |
950 | /* In a VECTOR_CST node. */ | |
951 | #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) | |
952 | ||
1f3233d1 | 953 | struct tree_vector GTY(()) |
886cfd4f | 954 | { |
955 | struct tree_common common; | |
886cfd4f | 956 | tree elements; |
957 | }; | |
d72a838e | 958 | \f |
d856c8a6 | 959 | #include "symtab.h" |
0d086e18 | 960 | |
d72a838e | 961 | /* Define fields and accessors for some special-purpose tree nodes. */ |
962 | ||
0d086e18 | 963 | #define IDENTIFIER_LENGTH(NODE) \ |
56ba46a4 | 964 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
0d086e18 | 965 | #define IDENTIFIER_POINTER(NODE) \ |
76c6f48d | 966 | ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
af694375 | 967 | #define IDENTIFIER_HASH_VALUE(NODE) \ |
968 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) | |
0d086e18 | 969 | |
970 | /* Translate a hash table identifier pointer to a tree_identifier | |
971 | pointer, and vice versa. */ | |
972 | ||
973 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
56ba46a4 | 974 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
975 | #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) | |
d72a838e | 976 | |
1f3233d1 | 977 | struct tree_identifier GTY(()) |
d72a838e | 978 | { |
851dfbff | 979 | struct tree_common common; |
0d086e18 | 980 | struct ht_identifier id; |
d72a838e | 981 | }; |
982 | ||
983 | /* In a TREE_LIST node. */ | |
3e207e38 | 984 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
985 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
d72a838e | 986 | |
1f3233d1 | 987 | struct tree_list GTY(()) |
d72a838e | 988 | { |
851dfbff | 989 | struct tree_common common; |
6a3e3d6d | 990 | tree purpose; |
991 | tree value; | |
d72a838e | 992 | }; |
993 | ||
994 | /* In a TREE_VEC node. */ | |
3e207e38 | 995 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
56ba46a4 | 996 | #define TREE_VEC_END(NODE) \ |
997 | ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) | |
d72a838e | 998 | |
66bc87db | 999 | #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
1000 | ||
1f3233d1 | 1001 | struct tree_vec GTY(()) |
d72a838e | 1002 | { |
851dfbff | 1003 | struct tree_common common; |
d72a838e | 1004 | int length; |
1f3233d1 | 1005 | tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; |
d72a838e | 1006 | }; |
1007 | ||
1008 | /* Define fields and accessors for some nodes that represent expressions. */ | |
1009 | ||
365db11e | 1010 | /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
4ee9c684 | 1011 | #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
1012 | && VOID_TYPE_P (TREE_TYPE (NODE)) \ | |
1013 | && integer_zerop (TREE_OPERAND (NODE, 0))) | |
1014 | ||
d72a838e | 1015 | /* In a SAVE_EXPR node. */ |
2fcde217 | 1016 | #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1) |
1017 | #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2) | |
1018 | ||
78a8ed03 | 1019 | #define SAVE_EXPR_NOPLACEHOLDER(NODE) \ |
1020 | (SAVE_EXPR_CHECK (NODE)->common.unsigned_flag) | |
1021 | ||
73e36ac1 | 1022 | /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs |
1023 | both in normal code and in a handler. (Normally, in a handler, all | |
7f9de2ce | 1024 | SAVE_EXPRs are unsaved, meaning that their values are |
73e36ac1 | 1025 | recalculated.) */ |
56ba46a4 | 1026 | #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE)) |
d72a838e | 1027 | |
1028 | /* In a RTL_EXPR node. */ | |
2fcde217 | 1029 | #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0) |
1030 | #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1) | |
60ffaf4d | 1031 | #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2) |
d72a838e | 1032 | |
5929001a | 1033 | /* In a WITH_CLEANUP_EXPR node. */ |
1034 | #define WITH_CLEANUP_EXPR_RTL(NODE) \ | |
2fcde217 | 1035 | TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2) |
5929001a | 1036 | |
d72a838e | 1037 | /* In a CONSTRUCTOR node. */ |
b56337d2 | 1038 | #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0) |
d72a838e | 1039 | |
f20853dd | 1040 | /* In ordinary expression nodes. */ |
2fcde217 | 1041 | #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
3e207e38 | 1042 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) |
f20853dd | 1043 | |
b50fb4a3 | 1044 | /* In a LABELED_BLOCK_EXPR node. */ |
56ba46a4 | 1045 | #define LABELED_BLOCK_LABEL(NODE) \ |
2fcde217 | 1046 | TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0) |
56ba46a4 | 1047 | #define LABELED_BLOCK_BODY(NODE) \ |
2fcde217 | 1048 | TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1) |
b50fb4a3 | 1049 | |
dafdd1c8 | 1050 | /* In an EXIT_BLOCK_EXPR node. */ |
56ba46a4 | 1051 | #define EXIT_BLOCK_LABELED_BLOCK(NODE) \ |
2fcde217 | 1052 | TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0) |
1053 | #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1) | |
b50fb4a3 | 1054 | |
1055 | /* In a LOOP_EXPR node. */ | |
2fcde217 | 1056 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
b50fb4a3 | 1057 | |
4ee9c684 | 1058 | /* The source location of this expression. Non-tree_exp nodes such as |
1059 | decls and constants can be shared among multiple locations, so | |
1060 | return nothing. */ | |
1061 | #define EXPR_LOCUS(NODE) \ | |
1062 | (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \ | |
1063 | ? (NODE)->exp.locus \ | |
1064 | : (location_t *)NULL) | |
1065 | #define SET_EXPR_LOCUS(NODE, FROM) \ | |
1066 | (EXPR_CHECK (NODE)->exp.locus = (FROM)) | |
1067 | #define EXPR_FILENAME(NODE) \ | |
1068 | (EXPR_CHECK (NODE)->exp.locus->file) | |
1069 | #define EXPR_LINENO(NODE) \ | |
1070 | (EXPR_CHECK (NODE)->exp.locus->line) | |
1071 | #ifdef USE_MAPPED_LOCATION | |
1072 | #define EXPR_LOCATION(NODE) \ | |
1073 | (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) \ | |
1074 | ? (NODE)->exp.locus \ | |
1075 | : UNKNOWN_LOCATION) | |
1076 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION) | |
1077 | #else | |
1078 | #define EXPR_LOCATION(NODE) (*EXPR_LOCUS (NODE)) | |
1079 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL) | |
1080 | #endif | |
dae7d8ad | 1081 | |
7ebc28e0 | 1082 | /* In a TARGET_EXPR node. */ |
2fcde217 | 1083 | #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
1084 | #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) | |
1085 | #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) | |
7ebc28e0 | 1086 | |
4ee9c684 | 1087 | #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
1088 | ||
1089 | /* SWITCH_EXPR accessors. These give access to the condition, body and | |
1090 | original condition type (before any compiler conversions) | |
1091 | of the switch statement, respectively. */ | |
1092 | #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0) | |
1093 | #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1) | |
1094 | #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2) | |
1095 | ||
1096 | /* CASE_LABEL accessors. These give access to the high and low values | |
1097 | of a case label, respectively. */ | |
1098 | #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0) | |
1099 | #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1) | |
1100 | #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2) | |
1101 | ||
1102 | /* The operands of a BIND_EXPR. */ | |
1103 | #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) | |
1104 | #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) | |
1105 | #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) | |
1106 | ||
1107 | /* GOTO_EXPR accessor. This gives access to the label associated with | |
1108 | a goto statement. */ | |
1109 | #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) | |
1110 | ||
1111 | /* ASM_STMT accessors. ASM_STRING returns a STRING_CST for the | |
1112 | instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and | |
1113 | ASM_CLOBBERS represent the outputs, inputs, and clobbers for the | |
1114 | statement. */ | |
1115 | #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0) | |
1116 | #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1) | |
1117 | #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2) | |
1118 | #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3) | |
1119 | /* Nonzero if we want to create an ASM_INPUT instead of an | |
1120 | ASM_OPERAND with no operands. */ | |
1121 | #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE)) | |
1122 | #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE)) | |
1123 | ||
1124 | /* COND_EXPR accessors. */ | |
1125 | #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) | |
1126 | #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) | |
1127 | #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) | |
1128 | ||
1129 | /* LABEL_EXPR accessor. This gives access to the label associated with | |
1130 | the given label expression. */ | |
1131 | #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) | |
1132 | ||
1133 | /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other | |
1134 | accessors for SSA operands. */ | |
1135 | ||
1136 | /* CATCH_EXPR accessors. */ | |
1137 | #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) | |
1138 | #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) | |
1139 | ||
1140 | /* EH_FILTER_EXPR accessors. */ | |
1141 | #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) | |
1142 | #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) | |
1143 | #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE)) | |
1144 | ||
1f3233d1 | 1145 | struct tree_exp GTY(()) |
f20853dd | 1146 | { |
851dfbff | 1147 | struct tree_common common; |
4ee9c684 | 1148 | location_t *locus; |
f20853dd | 1149 | int complexity; |
4ee9c684 | 1150 | tree block; |
60b8c5b3 | 1151 | tree GTY ((special ("tree_exp"), |
1152 | desc ("TREE_CODE ((tree) &%0)"))) | |
1f3233d1 | 1153 | operands[1]; |
f20853dd | 1154 | }; |
1155 | \f | |
4ee9c684 | 1156 | /* SSA_NAME accessors. */ |
1157 | ||
1158 | /* Returns the variable being referenced. Once released, this is the | |
1159 | only field that can be relied upon. */ | |
1160 | #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var | |
1161 | ||
1162 | /* Returns the statement which defines this reference. Note that | |
1163 | we use the same field when chaining SSA_NAME nodes together on | |
1164 | the SSA_NAME freelist. */ | |
1165 | #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain | |
1166 | ||
1167 | /* Returns the SSA version number of this SSA name. Note that in | |
1168 | tree SSA, version numbers are not per variable and may be recycled. */ | |
1169 | #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version | |
1170 | ||
1171 | /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are | |
1172 | never output, so we can safely use the ASM_WRITTEN_FLAG for this | |
1173 | status bit. */ | |
1174 | #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ | |
1175 | SSA_NAME_CHECK (NODE)->common.asm_written_flag | |
1176 | ||
786d45db | 1177 | /* Nonzero if this SSA_NAME expression is currently on the free list of |
4ee9c684 | 1178 | SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
1179 | has no meaning for an SSA_NAME. */ | |
1180 | #define SSA_NAME_IN_FREE_LIST(NODE) \ | |
1181 | SSA_NAME_CHECK (NODE)->common.nothrow_flag | |
1182 | ||
786d45db | 1183 | /* Attributes for SSA_NAMEs for pointer-type variables. */ |
1184 | #define SSA_NAME_PTR_INFO(N) \ | |
1185 | SSA_NAME_CHECK (N)->ssa_name.ptr_info | |
1186 | ||
1187 | #ifndef GCC_BITMAP_H | |
1188 | struct bitmap_head_def; | |
1189 | #endif | |
1190 | ||
1191 | /* Aliasing information for SSA_NAMEs representing pointer variables. */ | |
1192 | struct ptr_info_def GTY(()) | |
1193 | { | |
1194 | /* Nonzero if points-to analysis couldn't determine where this pointer | |
1195 | is pointing to. */ | |
1196 | unsigned int pt_anything : 1; | |
1197 | ||
1198 | /* Nonzero if this pointer is the result of a call to malloc. */ | |
1199 | unsigned int pt_malloc : 1; | |
1200 | ||
1201 | /* Nonzero if the value of this pointer escapes the current function. */ | |
1202 | unsigned int value_escapes_p : 1; | |
1203 | ||
1204 | /* Set of variables that this pointer may point to. */ | |
1205 | struct bitmap_head_def *pt_vars; | |
1206 | ||
1207 | /* If this pointer has been dereferenced, and points-to information is | |
1208 | more precise than type-based aliasing, indirect references to this | |
1209 | pointer will be represented by this memory tag, instead of the type | |
1210 | tag computed by TBAA. */ | |
1211 | tree name_mem_tag; | |
1212 | }; | |
1213 | ||
4ee9c684 | 1214 | struct tree_ssa_name GTY(()) |
1215 | { | |
1216 | struct tree_common common; | |
1217 | ||
1218 | /* _DECL wrapped by this SSA name. */ | |
1219 | tree var; | |
1220 | ||
1221 | /* SSA version number. */ | |
1222 | unsigned int version; | |
786d45db | 1223 | |
1224 | /* Pointer attributes used for alias analysis. */ | |
1225 | struct ptr_info_def *ptr_info; | |
4ee9c684 | 1226 | }; |
1227 | \f | |
1228 | /* In a PHI_NODE node. */ | |
1229 | #define PHI_RESULT(NODE) PHI_NODE_CHECK (NODE)->phi.result | |
1230 | ||
1231 | /* Nonzero if the PHI node was rewritten by a previous pass through the | |
1232 | SSA renamer. */ | |
1233 | #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten | |
1234 | #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args | |
1235 | #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity | |
1236 | #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I) | |
1237 | #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e | |
1238 | #define PHI_ARG_DEF(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def | |
6e9a4371 | 1239 | #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero |
4ee9c684 | 1240 | |
1241 | struct edge_def; | |
1242 | ||
1243 | struct phi_arg_d GTY(()) | |
1244 | { | |
1245 | tree def; | |
1246 | struct edge_def * GTY((skip (""))) e; | |
6e9a4371 | 1247 | bool nonzero; |
4ee9c684 | 1248 | }; |
1249 | ||
1250 | struct tree_phi_node GTY(()) | |
1251 | { | |
1252 | struct tree_common common; | |
1253 | tree result; | |
1254 | int num_args; | |
1255 | int capacity; | |
1256 | ||
1257 | /* Nonzero if the PHI node was rewritten by a previous pass through the | |
1258 | SSA renamer. */ | |
1259 | int rewritten; | |
1260 | ||
1261 | struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1]; | |
1262 | }; | |
1263 | \f | |
1264 | ||
1265 | struct varray_head_tag; | |
1266 | ||
1267 | struct tree_eref_common GTY(()) | |
1268 | { | |
1269 | struct tree_common common; | |
1270 | ||
1271 | /* SSAPRE: ID for the EREF. Used only for sorting erefs inside a | |
1272 | block. */ | |
1273 | int id; | |
1274 | ||
1275 | /* SSAPRE: Name for the EREF. Used only for printing.*/ | |
1276 | tree name; | |
1277 | ||
1278 | /* SSAPRE: The statement associated with this expression reference. */ | |
1279 | tree stmt; | |
1280 | ||
0bed3869 | 1281 | /* SSAPRE: True if expression needs to be saved to a temporary. */ |
4ee9c684 | 1282 | unsigned int save:1; |
1283 | ||
1284 | /* SSAPRE: True if expression needs to be reloaded from a temporary. */ | |
1285 | unsigned int reload:1; | |
1286 | ||
1287 | /* SSAPRE: Redundancy class of expression. */ | |
1288 | unsigned int class; | |
1289 | ||
0bed3869 | 1290 | /* SSAPRE: Processed flag 1. */ |
4ee9c684 | 1291 | unsigned int processed:1; |
1292 | ||
1293 | /* SSAPRE: True if expression is injured. */ | |
1294 | unsigned int injured:1; | |
1295 | ||
1296 | /* SSAPRE: Temporary assigned to this reference. */ | |
1297 | tree temp; | |
1298 | ||
1299 | }; | |
1300 | ||
1301 | struct tree_euse_node GTY(()) | |
1302 | { | |
1303 | struct tree_eref_common common; | |
1304 | ||
0bed3869 | 1305 | /* SSAPRE: Definition for this use. */ |
4ee9c684 | 1306 | tree def; |
1307 | ||
0bed3869 | 1308 | /* SSAPRE: True if this is an EPHI operand occurrence. */ |
4ee9c684 | 1309 | unsigned int op_occurrence:1; |
1310 | ||
1311 | /* SSAPRE: True if expression was inserted as a PHI operand occurrence. */ | |
1312 | unsigned int inserted:1; | |
1313 | ||
1314 | /* SSAPRE: True if expression occurs as a lvalue. */ | |
1315 | unsigned int lval:1; | |
1316 | }; | |
1317 | struct ephi_arg_d GTY(()) | |
1318 | { | |
1319 | ||
1320 | /* SSAPRE: True if this phi argument is injured. */ | |
1321 | unsigned int injured:1; | |
1322 | ||
0bed3869 | 1323 | /* SSAPRE: True if there is a real occurrence for this phi argument. */ |
4ee9c684 | 1324 | unsigned int has_real_use:1; |
1325 | ||
1326 | /* SSAPRE: True if delayed renaming is required on this phi argument. */ | |
1327 | unsigned int delayed_rename:1; | |
1328 | ||
1329 | /* SSAPRE: Processed 2 flag for this phi argument. */ | |
1330 | unsigned int processed2:1; | |
1331 | ||
1332 | /* SSAPRE: True if this operand stops forward movement. */ | |
1333 | unsigned int stops:1; | |
1334 | ||
0bed3869 | 1335 | /* SSAPRE: Definition of this phi operand. */ |
4ee9c684 | 1336 | tree def; |
1337 | ||
1338 | /* SSAPRE: Phi predecessor for this phi operand. */ | |
1339 | tree pred; | |
1340 | ||
1341 | struct edge_def * GTY((skip (""))) e; | |
1342 | }; | |
1343 | struct tree_ephi_node GTY(()) | |
1344 | { | |
1345 | struct tree_eref_common common; | |
1346 | ||
1347 | /* SSAPRE: True if PHI is downsafe. */ | |
1348 | unsigned int downsafe:1; | |
1349 | ||
1350 | /* SSAPRE: True if PHI is cant_be_avail. */ | |
1351 | unsigned int cant_be_avail:1; | |
1352 | ||
0bed3869 | 1353 | /* SSAPRE: True if PHI is dead. */ |
4ee9c684 | 1354 | unsigned int dead:1; |
1355 | ||
0bed3869 | 1356 | /* SSAPRE: True if PHI is pointless or identical to some value. */ |
4ee9c684 | 1357 | unsigned int identity:1; |
1358 | ||
1359 | /* SSAPRE: True if replacing occurrence known for ESSA minimization. */ | |
1360 | unsigned int rep_occur_known:1; | |
1361 | ||
1362 | /* SSAPRE: True if PHI is pointless, but is also injured. */ | |
1363 | unsigned int ident_injured:1; | |
1364 | ||
1365 | /* SSAPRE: True if this PHI stops forward movement. */ | |
1366 | unsigned int stops:1; | |
1367 | ||
1368 | /* SSAPRE: If PHI's replacing occurrence is known, this is it. */ | |
1369 | tree identical_to; | |
1370 | ||
1371 | /* SSAPRE: Uses of this ephi. */ | |
1372 | struct varray_head_tag *uses; | |
1373 | ||
1374 | int num_args; | |
1375 | int capacity; | |
1376 | struct ephi_arg_d GTY ((length ("((tree)&%h)->ephi.capacity"))) a[1]; | |
1377 | ||
1378 | }; | |
1379 | /* In both EPHI's and EUSES */ | |
1380 | #define EREF_PROCESSED(NODE) EREF_NODE_CHECK (NODE)->eref.processed | |
1381 | #define EREF_ID(NODE) EREF_NODE_CHECK (NODE)->eref.id | |
1382 | #define EREF_NAME(NODE) EREF_NODE_CHECK (NODE)->eref.name | |
1383 | #define EREF_STMT(NODE) EREF_NODE_CHECK (NODE)->eref.stmt | |
1384 | #define EREF_RELOAD(NODE) EREF_NODE_CHECK (NODE)->eref.reload | |
1385 | #define EREF_SAVE(NODE) EREF_NODE_CHECK (NODE)->eref.save | |
1386 | #define EREF_CLASS(NODE) EREF_NODE_CHECK (NODE)->eref.class | |
1387 | #define EREF_INJURED(NODE) EREF_NODE_CHECK (NODE)->eref.injured | |
1388 | #define EREF_TEMP(NODE) EREF_NODE_CHECK (NODE)->eref.temp | |
1389 | ||
1390 | /* In a EUSE_NODE node. */ | |
1391 | #define EUSE_DEF(NODE) EUSE_NODE_CHECK (NODE)->euse.def | |
1392 | #define EUSE_PHIOP(NODE) EUSE_NODE_CHECK (NODE)->euse.op_occurrence | |
1393 | #define EUSE_INSERTED(NODE) EUSE_NODE_CHECK (NODE)->euse.inserted | |
1394 | #define EUSE_LVAL(NODE) EUSE_NODE_CHECK (NODE)->euse.lval | |
1395 | ||
1396 | /* In a EPHI_NODE node. */ | |
1397 | #define EPHI_NUM_ARGS(NODE) EPHI_NODE_CHECK (NODE)->ephi.num_args | |
1398 | #define EPHI_ARG_CAPACITY(NODE) EPHI_NODE_CHECK (NODE)->ephi.capacity | |
1399 | #define EPHI_ARG_ELT(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I) | |
1400 | #define EPHI_ARG_EDGE(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).e | |
1401 | #define EPHI_ARG_PRED(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).pred | |
1402 | #define EPHI_ARG_DEF(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).def | |
1403 | #define EPHI_ARG_INJURED(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).injured | |
1404 | #define EPHI_ARG_DELAYED_RENAME(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).delayed_rename | |
1405 | #define EPHI_ARG_HAS_REAL_USE(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).has_real_use | |
1406 | #define EPHI_ARG_STOPS(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).stops | |
1407 | #define EPHI_ARG_PROCESSED2(NODE, I) EPHI_NODE_ELT_CHECK (NODE, I).processed2 | |
1408 | #define EPHI_IDENTITY(NODE) EPHI_NODE_CHECK (NODE)->ephi.identity | |
1409 | #define EPHI_IDENT_INJURED(NODE) EPHI_NODE_CHECK (NODE)->ephi.ident_injured | |
1410 | ||
1411 | #define EPHI_REP_OCCUR_KNOWN(NODE) EPHI_NODE_CHECK (NODE)->ephi.rep_occur_known | |
1412 | #define EPHI_IDENTICAL_TO(NODE) EPHI_NODE_CHECK (NODE)->ephi.identical_to | |
1413 | #define EPHI_DOWNSAFE(NODE) EPHI_NODE_CHECK (NODE)->ephi.downsafe | |
1414 | #define EPHI_CANT_BE_AVAIL(NODE) EPHI_NODE_CHECK (NODE)->ephi.cant_be_avail | |
1415 | #define EPHI_DEAD(NODE) EPHI_NODE_CHECK (NODE)->ephi.dead | |
1416 | #define EPHI_USES(NODE) EPHI_NODE_CHECK (NODE)->ephi.uses | |
1417 | #define EPHI_STOPS(NODE) EPHI_NODE_CHECK (NODE)->ephi.stops | |
1418 | ||
d72a838e | 1419 | /* In a BLOCK node. */ |
3e207e38 | 1420 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
3e207e38 | 1421 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
1422 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
d72a838e | 1423 | /* Note: when changing this, make sure to find the places |
1424 | that use chainon or nreverse. */ | |
7b7cc58a | 1425 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) |
3e207e38 | 1426 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
1427 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
d72a838e | 1428 | |
1429 | /* Nonzero means that this block is prepared to handle exceptions | |
1430 | listed in the BLOCK_VARS slot. */ | |
56ba46a4 | 1431 | #define BLOCK_HANDLER_BLOCK(NODE) \ |
1432 | (BLOCK_CHECK (NODE)->block.handler_block_flag) | |
d72a838e | 1433 | |
5846cb0f | 1434 | /* An index number for this block. These values are not guaranteed to |
1435 | be unique across functions -- whether or not they are depends on | |
1436 | the debugging output format in use. */ | |
1437 | #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) | |
1438 | ||
a36145ca | 1439 | /* If block reordering splits a lexical block into discontiguous |
1440 | address ranges, we'll make a copy of the original block. | |
1441 | ||
1442 | Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. | |
1443 | In that case, we have one source block that has been replicated | |
1444 | (through inlining or unrolling) into many logical blocks, and that | |
1445 | these logical blocks have different physical variables in them. | |
1446 | ||
1447 | In this case, we have one logical block split into several | |
1448 | non-contiguous address ranges. Most debug formats can't actually | |
1449 | represent this idea directly, so we fake it by creating multiple | |
1450 | logical blocks with the same variables in them. However, for those | |
1451 | that do support non-contiguous regions, these allow the original | |
1452 | logical block to be reconstructed, along with the set of address | |
1453 | ranges. | |
1454 | ||
1455 | One of the logical block fragments is arbitrarily chosen to be | |
1456 | the ORIGIN. The other fragments will point to the origin via | |
1457 | BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer | |
6c34d0c2 | 1458 | be null. The list of fragments will be chained through |
a36145ca | 1459 | BLOCK_FRAGMENT_CHAIN from the origin. */ |
1460 | ||
56ba46a4 | 1461 | #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
1462 | #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) | |
a36145ca | 1463 | |
1f3233d1 | 1464 | struct tree_block GTY(()) |
d72a838e | 1465 | { |
851dfbff | 1466 | struct tree_common common; |
f20853dd | 1467 | |
1468 | unsigned handler_block_flag : 1; | |
1469 | unsigned abstract_flag : 1; | |
874a9b8d | 1470 | unsigned block_num : 30; |
f20853dd | 1471 | |
6a3e3d6d | 1472 | tree vars; |
1473 | tree subblocks; | |
1474 | tree supercontext; | |
1475 | tree abstract_origin; | |
1476 | tree fragment_origin; | |
1477 | tree fragment_chain; | |
d72a838e | 1478 | }; |
1479 | \f | |
1480 | /* Define fields and accessors for nodes representing data types. */ | |
1481 | ||
1482 | /* See tree.def for documentation of the use of these fields. | |
82bb2115 | 1483 | Look at the documentation of the various ..._TYPE tree codes. |
1484 | ||
3927afe0 | 1485 | Note that the type.values, type.minval, and type.maxval fields are |
82bb2115 | 1486 | overloaded and used for different macros in different kinds of types. |
1487 | Each macro must check to ensure the tree node is of the proper kind of | |
1488 | type. Note also that some of the front-ends also overload these fields, | |
1489 | so they must be checked as well. */ | |
d72a838e | 1490 | |
3e207e38 | 1491 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) |
1492 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) | |
1493 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) | |
1494 | #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) | |
82bb2115 | 1495 | #define TYPE_ORIG_SIZE_TYPE(NODE) (INTEGER_TYPE_CHECK (NODE)->type.values) |
1496 | #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values) | |
49be8259 | 1497 | #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values) |
82bb2115 | 1498 | #define TYPE_FIELDS(NODE) (REC_OR_UNION_CHECK (NODE)->type.values) |
1499 | #define TYPE_METHODS(NODE) (REC_OR_UNION_CHECK (NODE)->type.maxval) | |
1500 | #define TYPE_VFIELD(NODE) (REC_OR_UNION_CHECK (NODE)->type.minval) | |
1501 | #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values) | |
1502 | #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval) | |
1503 | #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval) | |
3e207e38 | 1504 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) |
1505 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
b24423db | 1506 | #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval) |
1507 | #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval) | |
82bb2115 | 1508 | #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval) |
1509 | #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval) | |
3e207e38 | 1510 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) |
1511 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
1512 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
1f3233d1 | 1513 | #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) |
3e207e38 | 1514 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) |
1515 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
1516 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
3e207e38 | 1517 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) |
3e207e38 | 1518 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) |
d72a838e | 1519 | |
e2ea7e3a | 1520 | /* For a VECTOR_TYPE node, this describes a different type which is emitted |
1521 | in the debugging output. We use this to describe a vector as a | |
1522 | structure containing an array. */ | |
49be8259 | 1523 | #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values) |
e2ea7e3a | 1524 | |
a6a316cb | 1525 | /* For aggregate types, information about this type, as a base type |
1526 | for itself. Used in a language-dependent way for types that are | |
1527 | neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */ | |
1528 | #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo) | |
1529 | ||
b5ba9f3a | 1530 | /* The (language-specific) typed-based alias set for this type. |
1531 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
1532 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
1533 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
1534 | type can alias objects of any type. */ | |
1535 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
1536 | ||
1537 | /* Nonzero iff the typed-based alias set for this type has been | |
1538 | calculated. */ | |
56ba46a4 | 1539 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) |
b5ba9f3a | 1540 | |
a12eeaaf | 1541 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
1542 | to this type. */ | |
3e207e38 | 1543 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
a12eeaaf | 1544 | |
c3b0175e | 1545 | /* The alignment necessary for objects of this type. |
1546 | The value is an int, measured in bits. */ | |
3e207e38 | 1547 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
c3b0175e | 1548 | |
aca14577 | 1549 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1550 | 0 if it is the default for this type. */ | |
1551 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) | |
1552 | ||
89e923d8 | 1553 | /* The alignment for NODE, in bytes. */ |
56ba46a4 | 1554 | #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
89e923d8 | 1555 | |
13fad59c | 1556 | /* If your language allows you to declare types, and you want debug info |
1557 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
1558 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
1559 | type node. You then set the TYPE_STUB_DECL field of the type node | |
1560 | to point back at the TYPE_DECL node. This allows the debug routines | |
1561 | to know that the two nodes represent the same type, so that we only | |
88b5b080 | 1562 | get one debug info record for them. */ |
56ba46a4 | 1563 | #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) |
d72a838e | 1564 | |
7dd9d898 | 1565 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
1566 | has BLKmode only because it lacks the alignment requirement for | |
1567 | its size. */ | |
3e207e38 | 1568 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
d72a838e | 1569 | |
4944c3db | 1570 | /* In an INTEGER_TYPE, it means the type represents a size. We use |
1571 | this both for validity checking and to permit optimizations that | |
1572 | are unsafe for other types. Note that the C `size_t' type should | |
1573 | *not* have this flag set. The `size_t' type is simply a typedef | |
1574 | for an ordinary integer type that happens to be the type of an | |
1575 | expression returned by `sizeof'; `size_t' has no special | |
1576 | properties. Expressions whose type have TYPE_IS_SIZETYPE set are | |
1577 | always actual sizes. */ | |
d490e2f2 | 1578 | #define TYPE_IS_SIZETYPE(NODE) \ |
1579 | (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) | |
1580 | ||
1581 | /* In a FUNCTION_TYPE, indicates that the function returns with the stack | |
1582 | pointer depressed. */ | |
1583 | #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ | |
fabd00bc | 1584 | (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) |
902de8ed | 1585 | |
d72a838e | 1586 | /* Nonzero in a type considered volatile as a whole. */ |
5926a453 | 1587 | #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag) |
d72a838e | 1588 | |
1589 | /* Means this type is const-qualified. */ | |
5926a453 | 1590 | #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag) |
d72a838e | 1591 | |
a5b1863e | 1592 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
1593 | the term. */ | |
1594 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
1595 | ||
1596 | /* There is a TYPE_QUAL value for each type qualifier. They can be | |
1597 | combined by bitwise-or to form the complete set of qualifiers for a | |
1598 | type. */ | |
1599 | ||
1600 | #define TYPE_UNQUALIFIED 0x0 | |
1601 | #define TYPE_QUAL_CONST 0x1 | |
1602 | #define TYPE_QUAL_VOLATILE 0x2 | |
1603 | #define TYPE_QUAL_RESTRICT 0x4 | |
1604 | ||
1605 | /* The set of type qualifiers for this type. */ | |
716fc477 | 1606 | #define TYPE_QUALS(NODE) \ |
1607 | ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1608 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
1c15359d | 1609 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) |
a5b1863e | 1610 | |
bc3a4bfd | 1611 | /* These flags are available for each language front end to use internally. */ |
3e207e38 | 1612 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
1613 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
1614 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
1615 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
1616 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
1617 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
1618 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
d72a838e | 1619 | |
4ee9c684 | 1620 | /* Used to keep track of visited nodes in tree traversals. This is set to |
1621 | 0 by copy_node and make_node. */ | |
1622 | #define TREE_VISITED(NODE) ((NODE)->common.visited) | |
1623 | ||
b759e947 | 1624 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
1625 | that distinguish string from array of char). | |
88b5b080 | 1626 | If set in a SET_TYPE, indicates a bitstring type. */ |
3e207e38 | 1627 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
b759e947 | 1628 | |
20dd417a | 1629 | /* If non-NULL, this is an upper bound of the size (in bytes) of an |
56ba46a4 | 1630 | object of the given ARRAY_TYPE. This allows temporaries to be |
1631 | allocated. */ | |
1632 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ | |
7559a14d | 1633 | (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval) |
255218ff | 1634 | |
8a95ab85 | 1635 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
56ba46a4 | 1636 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ |
1637 | GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode) | |
8a95ab85 | 1638 | |
fcdd3ab3 | 1639 | /* Indicates that objects of this type must be initialized by calling a |
be98dac3 | 1640 | function when they are created. */ |
851dfbff | 1641 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
1642 | (TYPE_CHECK (NODE)->type.needs_constructing_flag) | |
be98dac3 | 1643 | |
fa602b3f | 1644 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
1645 | the same way that the first union alternative would be passed. */ | |
851dfbff | 1646 | #define TYPE_TRANSPARENT_UNION(NODE) \ |
1647 | (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
1648 | ||
1649 | /* For an ARRAY_TYPE, indicates that it is not permitted to | |
1650 | take the address of a component of the type. */ | |
1651 | #define TYPE_NONALIASED_COMPONENT(NODE) \ | |
1652 | (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
fa602b3f | 1653 | |
ad87de1e | 1654 | /* Indicated that objects of this type should be laid out in as |
1a8ea5c4 | 1655 | compact a way as possible. */ |
3e207e38 | 1656 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
1a8ea5c4 | 1657 | |
1f3233d1 | 1658 | struct die_struct; |
1659 | ||
1660 | struct tree_type GTY(()) | |
d72a838e | 1661 | { |
851dfbff | 1662 | struct tree_common common; |
6a3e3d6d | 1663 | tree values; |
1664 | tree size; | |
1665 | tree size_unit; | |
1666 | tree attributes; | |
108009b4 | 1667 | unsigned int uid; |
d72a838e | 1668 | |
108009b4 | 1669 | unsigned int precision : 9; |
488c4206 | 1670 | ENUM_BITFIELD(machine_mode) mode : 7; |
a12eeaaf | 1671 | |
b759e947 | 1672 | unsigned string_flag : 1; |
d72a838e | 1673 | unsigned no_force_blk_flag : 1; |
be98dac3 | 1674 | unsigned needs_constructing_flag : 1; |
fa602b3f | 1675 | unsigned transparent_union_flag : 1; |
1a8ea5c4 | 1676 | unsigned packed_flag : 1; |
a5b1863e | 1677 | unsigned restrict_flag : 1; |
1c15359d | 1678 | unsigned spare : 2; |
a5b1863e | 1679 | |
d72a838e | 1680 | unsigned lang_flag_0 : 1; |
1681 | unsigned lang_flag_1 : 1; | |
1682 | unsigned lang_flag_2 : 1; | |
1683 | unsigned lang_flag_3 : 1; | |
1684 | unsigned lang_flag_4 : 1; | |
1685 | unsigned lang_flag_5 : 1; | |
1686 | unsigned lang_flag_6 : 1; | |
aca14577 | 1687 | unsigned user_align : 1; |
d72a838e | 1688 | |
c926ba81 | 1689 | unsigned int align; |
6a3e3d6d | 1690 | tree pointer_to; |
1691 | tree reference_to; | |
1f3233d1 | 1692 | union tree_type_symtab { |
60b8c5b3 | 1693 | int GTY ((tag ("0"))) address; |
1694 | char * GTY ((tag ("1"))) pointer; | |
573aba85 | 1695 | struct die_struct * GTY ((tag ("2"))) die; |
60b8c5b3 | 1696 | } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"), |
1f3233d1 | 1697 | descbits ("2"))) symtab; |
6a3e3d6d | 1698 | tree name; |
1699 | tree minval; | |
1700 | tree maxval; | |
1701 | tree next_variant; | |
1702 | tree main_variant; | |
1703 | tree binfo; | |
6a3e3d6d | 1704 | tree context; |
f7c44134 | 1705 | HOST_WIDE_INT alias_set; |
d72a838e | 1706 | /* Points to a structure whose details depend on the language in use. */ |
1707 | struct lang_type *lang_specific; | |
1708 | }; | |
1709 | \f | |
1710 | /* Define accessor macros for information about type inheritance | |
1711 | and basetypes. | |
1712 | ||
1713 | A "basetype" means a particular usage of a data type for inheritance | |
1714 | in another type. Each such basetype usage has its own "binfo" | |
1715 | object to describe it. The binfo object is a TREE_VEC node. | |
1716 | ||
1717 | Inheritance is represented by the binfo nodes allocated for a | |
1718 | given type. For example, given types C and D, such that D is | |
1719 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
1720 | the binfo properties of C, similarly one for D, and one for | |
1721 | describing the binfo properties of D as a base type for C. | |
1722 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
1723 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
1724 | ||
1725 | /* The actual data type node being inherited in this basetype. */ | |
1726 | #define BINFO_TYPE(NODE) TREE_TYPE (NODE) | |
1727 | ||
1728 | /* The offset where this basetype appears in its containing type. | |
1729 | BINFO_OFFSET slot holds the offset (in bytes) | |
1730 | from the base of the complete object to the base of the part of the | |
1731 | object that is allocated on behalf of this `type'. | |
1732 | This is always 0 except when there is multiple inheritance. */ | |
6c34d0c2 | 1733 | |
d72a838e | 1734 | #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) |
1735 | #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) | |
d6c9423f | 1736 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
d72a838e | 1737 | |
1738 | /* The virtual function table belonging to this basetype. Virtual | |
1739 | function tables provide a mechanism for run-time method dispatching. | |
1740 | The entries of a virtual function table are language-dependent. */ | |
1741 | ||
1742 | #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) | |
1743 | #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) | |
1744 | ||
1745 | /* The virtual functions in the virtual function table. This is | |
1746 | a TREE_LIST that is used as an initial approximation for building | |
1747 | a virtual function table for this basetype. */ | |
1748 | #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) | |
1749 | #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) | |
1750 | ||
6ed1e0f8 | 1751 | /* A vector of binfos for the direct basetypes inherited by this |
1752 | basetype. | |
d72a838e | 1753 | |
6ed1e0f8 | 1754 | If this basetype describes type D as inherited in C, and if the |
1755 | basetypes of D are E and F, then this vector contains binfos for | |
1756 | inheritance of E and F by C. | |
d72a838e | 1757 | |
1758 | ??? This could probably be done by just allocating the | |
1759 | base types at the end of this TREE_VEC (instead of using | |
1760 | another TREE_VEC). This would simplify the calculation | |
1761 | of how many basetypes a given type had. */ | |
1762 | #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) | |
1763 | #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) | |
1764 | ||
824507ab | 1765 | /* The number of basetypes for NODE. */ |
1766 | #define BINFO_N_BASETYPES(NODE) \ | |
1767 | (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0) | |
1768 | ||
d6c9423f | 1769 | /* Accessor macro to get to the Nth basetype of this basetype. */ |
1770 | #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) | |
56ba46a4 | 1771 | #define TYPE_BINFO_BASETYPE(NODE,N) \ |
1772 | BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) | |
d6c9423f | 1773 | |
809d9739 | 1774 | /* For a BINFO record describing a virtual base class, i.e., one where |
1775 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
4b922c0c | 1776 | base. The actual contents are language-dependent. In the C++ |
1777 | front-end this field is an INTEGER_CST giving an offset into the | |
1778 | vtable where the offset to the virtual base can be found. */ | |
56ba46a4 | 1779 | #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5) |
44882314 | 1780 | |
95f3173a | 1781 | /* Indicates the accesses this binfo has to its bases. The values are |
1782 | access_public_node, access_protected_node or access_private_node. | |
1783 | If this array is not present, public access is implied. */ | |
1784 | #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6) | |
1785 | #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N)) | |
1786 | ||
1787 | /* Number of language independent elements in a binfo. Languages may | |
1788 | add additional trailing elements. */ | |
1789 | ||
1790 | #define BINFO_ELTS 7 | |
d72a838e | 1791 | |
1792 | /* Slot used to build a chain that represents a use of inheritance. | |
1793 | For example, if X is derived from Y, and Y is derived from Z, | |
1794 | then this field can be used to link the binfo node for X to | |
1795 | the binfo node for X's Y to represent the use of inheritance | |
1796 | from X to Y. Similarly, this slot of the binfo node for X's Y | |
1797 | can point to the Z from which Y is inherited (in X's inheritance | |
1798 | hierarchy). In this fashion, one can represent and traverse specific | |
1799 | uses of inheritance using the binfo nodes themselves (instead of | |
1800 | consing new space pointing to binfo nodes). | |
1801 | It is up to the language-dependent front-ends to maintain | |
1802 | this information as necessary. */ | |
1803 | #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) | |
1804 | \f | |
1805 | /* Define fields and accessors for nodes representing declared names. */ | |
1806 | ||
713984f9 | 1807 | /* Nonzero if DECL represents a decl. */ |
1808 | #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') | |
56ba46a4 | 1809 | |
4ee9c684 | 1810 | /* Nonzero if DECL represents a variable for the SSA passes. */ |
1811 | #define SSA_VAR_P(DECL) \ | |
1812 | (TREE_CODE (DECL) == VAR_DECL \ | |
1813 | || TREE_CODE (DECL) == PARM_DECL \ | |
1814 | || TREE_CODE (DECL) == RESULT_DECL \ | |
1815 | || (TREE_CODE (DECL) == SSA_NAME \ | |
1816 | && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ | |
1817 | || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ | |
1818 | || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL))) | |
1819 | ||
d72a838e | 1820 | /* This is the name of the object as written by the user. |
1821 | It is an IDENTIFIER_NODE. */ | |
3e207e38 | 1822 | #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) |
56ba46a4 | 1823 | |
7e64c604 | 1824 | /* The name of the object as the assembler will see it (but before any |
1825 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
1826 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
d1f6c8f2 | 1827 | #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) |
56ba46a4 | 1828 | |
f712a0dc | 1829 | /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, |
56ba46a4 | 1830 | the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set |
1831 | yet. */ | |
7e64c604 | 1832 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ |
1833 | (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE) | |
56ba46a4 | 1834 | |
7e64c604 | 1835 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ |
1836 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
1837 | (DECL_CHECK (NODE)->decl.assembler_name = (NAME)) | |
56ba46a4 | 1838 | |
1839 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's | |
1840 | DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause | |
1841 | the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the | |
1842 | semantics of using this macro, are different than saying: | |
6c34d0c2 | 1843 | |
7e64c604 | 1844 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) |
1845 | ||
1846 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ | |
56ba46a4 | 1847 | |
7e64c604 | 1848 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ |
1849 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
6c34d0c2 | 1850 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ |
1851 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
7e64c604 | 1852 | : (void) 0) |
1853 | ||
99c00961 | 1854 | /* Records the section name in a section attribute. Used to pass |
1855 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
3e207e38 | 1856 | #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) |
56ba46a4 | 1857 | |
40109983 | 1858 | /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
1859 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
1860 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
1861 | points to either the FUNCTION_DECL for the containing function, | |
1862 | the RECORD_TYPE or UNION_TYPE for the containing type, or | |
1863 | NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file | |
1864 | scope". */ | |
3e207e38 | 1865 | #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) |
02e7a332 | 1866 | #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context) |
e3c541f0 | 1867 | /* In a DECL this is the field where attributes are stored. */ |
1868 | #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes) | |
02e7a332 | 1869 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the |
1870 | byte containing the bit closest to the beginning of the structure. */ | |
1871 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments) | |
1872 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
1873 | field from DECL_FIELD_OFFSET. */ | |
1874 | #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t) | |
d72a838e | 1875 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and |
9c059d9a | 1876 | if so, the type that was originally specified for it. |
1877 | TREE_TYPE may have been modified (in finish_struct). */ | |
02e7a332 | 1878 | #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result) |
56ba46a4 | 1879 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. |
1880 | VAR_DECL and PARM_DECL reserve the arguments slot for language-specific | |
1881 | uses. */ | |
3e207e38 | 1882 | #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) |
b8e0d419 | 1883 | /* This field is used to reference anything in decl.result and is meant only |
1884 | for use by the garbage collector. */ | |
1885 | #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result) | |
d72a838e | 1886 | /* In FUNCTION_DECL, holds the decl for the return value. */ |
02e7a332 | 1887 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result) |
e5932677 | 1888 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
02e7a332 | 1889 | #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result) |
d72a838e | 1890 | /* In PARM_DECL, holds the type as written (perhaps a function or array). */ |
02e7a332 | 1891 | #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result) |
d72a838e | 1892 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
40109983 | 1893 | For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
d72a838e | 1894 | For a VAR_DECL, holds the initial value. |
1895 | For a PARM_DECL, not used--default | |
1896 | values for parameters are encoded in the type of the function, | |
66d12a6c | 1897 | not in the PARM_DECL slot. |
1898 | ||
1899 | ??? Need to figure out some way to check this isn't a PARM_DECL. */ | |
3e207e38 | 1900 | #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) |
d72a838e | 1901 | /* For a PARM_DECL, records the data type used to pass the argument, |
1902 | which may be different from the type seen in the program. */ | |
02e7a332 | 1903 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial) |
7dd9d898 | 1904 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
1905 | if nonzero, indicates that the field occupies the type. */ | |
02e7a332 | 1906 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial) |
346064d9 | 1907 | /* These two fields describe where in the source code the declaration |
1908 | was. If the declaration appears in several places (as for a C | |
1909 | function that is declared first and then defined later), this | |
1910 | information should refer to the definition. */ | |
1911 | #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus) | |
1912 | #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file) | |
1913 | #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line) | |
b278476e | 1914 | /* Holds the size of the datum, in bits, as a tree expression. |
d72a838e | 1915 | Need not be constant. */ |
3e207e38 | 1916 | #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) |
b278476e | 1917 | /* Likewise for the size in bytes. */ |
1918 | #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit) | |
c6713de4 | 1919 | /* Holds the alignment required for the datum, in bits. */ |
02e7a332 | 1920 | #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align) |
c6713de4 | 1921 | /* The alignment of NODE, in bytes. */ |
1922 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
b4bb829f | 1923 | /* For FIELD_DECLs, off_align holds the number of low-order bits of |
1924 | DECL_FIELD_OFFSET which are known to be always zero. | |
1925 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
1926 | has. */ | |
1927 | #define DECL_OFFSET_ALIGN(NODE) \ | |
1928 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align) | |
1929 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
1930 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
1931 | (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X))) | |
aca14577 | 1932 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1933 | 0 if it is the default for this type. */ | |
1934 | #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align) | |
8fd3ce0b | 1935 | /* Holds the machine mode corresponding to the declaration of a variable or |
1936 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
1937 | FIELD_DECL. */ | |
3e207e38 | 1938 | #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) |
6000e302 | 1939 | /* Holds the RTL expression for the value of a variable or function. |
0e8e37b2 | 1940 | This value can be evaluated lazily for functions, variables with |
1941 | static storage duration, and labels. */ | |
1942 | #define DECL_RTL(NODE) \ | |
1943 | (DECL_CHECK (NODE)->decl.rtl \ | |
1944 | ? (NODE)->decl.rtl \ | |
1945 | : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl)) | |
1946 | /* Set the DECL_RTL for NODE to RTL. */ | |
ca74b940 | 1947 | #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) |
f712a0dc | 1948 | /* Returns nonzero if the DECL_RTL for NODE has already been set. */ |
56ba46a4 | 1949 | #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL) |
0e8e37b2 | 1950 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for |
1951 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
1952 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
1953 | (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl) | |
1954 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
56ba46a4 | 1955 | #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) |
1956 | ||
d72a838e | 1957 | /* For PARM_DECL, holds an RTL for the stack slot or register |
1958 | where the data was actually passed. */ | |
02e7a332 | 1959 | #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r) |
56ba46a4 | 1960 | |
cbc44df5 | 1961 | /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") |
1962 | that describes the status of this function. */ | |
1963 | #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f) | |
56ba46a4 | 1964 | |
463a5bad | 1965 | /* For FUNCTION_DECL, if it is built-in, |
1966 | this identifies which built-in operation it is. */ | |
02e7a332 | 1967 | #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f) |
d72a838e | 1968 | |
4ee9c684 | 1969 | /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this is |
1970 | the approximate number of statements in this function. There is | |
1971 | no need for this number to be exact; it is only used in various | |
1972 | heuristics regarding optimization. */ | |
1973 | #define DECL_NUM_STMTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.i) | |
1974 | ||
d72a838e | 1975 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. |
1976 | Before the struct containing the FUNCTION_DECL is laid out, | |
1977 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
1978 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
1979 | function. When the class is laid out, this pointer is changed | |
1980 | to an INTEGER_CST node which is suitable for use as an index | |
1981 | into the virtual function table. */ | |
3e207e38 | 1982 | #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) |
56ba46a4 | 1983 | |
d72a838e | 1984 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in |
1985 | which this FIELD_DECL is defined. This information is needed when | |
1986 | writing debugging information about vfield and vbase decls for C++. */ | |
02e7a332 | 1987 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex) |
d72a838e | 1988 | |
6053ec2b | 1989 | /* Every ..._DECL node gets a unique number. */ |
3e207e38 | 1990 | #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) |
6053ec2b | 1991 | |
f7a75810 | 1992 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
1993 | decl node which this decl is an instance of, or else it is NULL indicating | |
62c36aa3 | 1994 | that this decl is not an instance of some other decl. For example, |
1995 | in a nested declaration of an inline function, this points back to the | |
1996 | definition. */ | |
3e207e38 | 1997 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) |
f7a75810 | 1998 | |
c0671ae8 | 1999 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract |
2000 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
2001 | #define DECL_ORIGIN(NODE) \ | |
76c6f48d | 2002 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) |
c0671ae8 | 2003 | |
c8c4ca6d | 2004 | /* Nonzero for any sort of ..._DECL node means this decl node represents an |
2005 | inline instance of some original (abstract) decl from an inline function; | |
2006 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
88b5b080 | 2007 | nodes can also have their abstract origin set to themselves. */ |
76c6f48d | 2008 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ |
a93d2759 | 2009 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) |
d72a838e | 2010 | |
2011 | /* Nonzero if a _DECL means that the name of this decl should be ignored | |
2012 | for symbolic debug purposes. */ | |
3e207e38 | 2013 | #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) |
d72a838e | 2014 | |
f7a75810 | 2015 | /* Nonzero for a given ..._DECL node means that this node represents an |
2016 | "abstract instance" of the given declaration (e.g. in the original | |
2017 | declaration of an inline function). When generating symbolic debugging | |
c3418f42 | 2018 | information, we mustn't try to generate any address information for nodes |
f7a75810 | 2019 | marked as "abstract instances" because we don't actually generate |
2020 | any code or allocate any data space for such instances. */ | |
3e207e38 | 2021 | #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) |
f7a75810 | 2022 | |
9ed1ded5 | 2023 | /* Nonzero if a _DECL means that no warnings should be generated just |
2024 | because this decl is unused. */ | |
56ba46a4 | 2025 | #define DECL_IN_SYSTEM_HEADER(NODE) \ |
2026 | (DECL_CHECK (NODE)->decl.in_system_header_flag) | |
9ed1ded5 | 2027 | |
f7a772a7 | 2028 | /* Nonzero for a given ..._DECL node means that this node should be |
2029 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
2030 | is not error_mark_node, then the decl cannot be put in .common. */ | |
3e207e38 | 2031 | #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) |
f7a772a7 | 2032 | |
9ed1ded5 | 2033 | /* Language-specific decl information. */ |
3e207e38 | 2034 | #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) |
d72a838e | 2035 | |
2036 | /* In a VAR_DECL or FUNCTION_DECL, | |
2037 | nonzero means external reference: | |
2038 | do not allocate storage, and refer to a definition elsewhere. */ | |
3e207e38 | 2039 | #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) |
d72a838e | 2040 | |
9bc65db1 | 2041 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
de132707 | 2042 | initializations. */ |
9bc65db1 | 2043 | #define DEFAULT_INIT_PRIORITY 65535 |
2044 | #define MAX_INIT_PRIORITY 65535 | |
34341acb | 2045 | #define MAX_RESERVED_INIT_PRIORITY 100 |
9bc65db1 | 2046 | |
203891af | 2047 | /* In a TYPE_DECL |
2048 | nonzero means the detail info about this type is not dumped into stabs. | |
6c34d0c2 | 2049 | Instead it will generate cross reference ('x') of names. |
88b5b080 | 2050 | This uses the same flag as DECL_EXTERNAL. */ |
02e7a332 | 2051 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ |
56ba46a4 | 2052 | (TYPE_DECL_CHECK (NODE)->decl.external_flag) |
203891af | 2053 | |
7e787821 | 2054 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
3e207e38 | 2055 | #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
56ba46a4 | 2056 | |
7e787821 | 2057 | /* In LABEL_DECL nodes, nonzero means that an error message about |
2058 | jumping into such a binding contour has been printed for this label. */ | |
02e7a332 | 2059 | #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag) |
56ba46a4 | 2060 | |
077bcaed | 2061 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
02e7a332 | 2062 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag) |
56ba46a4 | 2063 | |
f712a0dc | 2064 | /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a |
7e787821 | 2065 | static chain is not needed. */ |
02e7a332 | 2066 | #define DECL_NO_STATIC_CHAIN(NODE) \ |
56ba46a4 | 2067 | (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag) |
d72a838e | 2068 | |
2069 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
2070 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
2071 | ||
2072 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
2073 | ||
2074 | Also set in some languages for variables, etc., outside the normal | |
2075 | lexical scope, such as class instance variables. */ | |
3e207e38 | 2076 | #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) |
d72a838e | 2077 | |
2078 | /* Nonzero in a FUNCTION_DECL means this function can be substituted | |
2079 | where it is called. */ | |
02e7a332 | 2080 | #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag) |
d72a838e | 2081 | |
746149b7 | 2082 | /* Nonzero in a FUNCTION_DECL means that this function was declared inline, |
2083 | such as via the `inline' keyword in C/C++. This flag controls the linkage | |
2084 | semantics of 'inline'; whether or not the function is inlined is | |
2085 | controlled by DECL_INLINE. */ | |
2086 | #define DECL_DECLARED_INLINE_P(NODE) \ | |
2087 | (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag) | |
e2b04249 | 2088 | |
4ee9c684 | 2089 | /* In a VAR_DECL, nonzero if the decl is a register variable with |
2090 | an explicit asm specification. */ | |
2091 | #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag) | |
2092 | ||
9c40570a | 2093 | /* Value of the decls's visibility attribute */ |
2094 | #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility) | |
2095 | ||
8f80e66d | 2096 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ |
2097 | #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable) | |
2098 | ||
6c34d0c2 | 2099 | /* In a VAR_DECL, nonzero if the data should be allocated from |
2a6f0f81 | 2100 | thread-local storage. */ |
2101 | #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag) | |
2102 | ||
1431bff6 | 2103 | /* In a FUNCTION_DECL, the saved representation of the body of the |
2104 | entire function. Usually a COMPOUND_STMT, but in C++ this may also | |
2105 | be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */ | |
2106 | #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree) | |
2107 | ||
734c98be | 2108 | /* List of FUNCTION_DECLs inlined into this function's body. */ |
1431bff6 | 2109 | #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns) |
2110 | ||
7259f3f8 | 2111 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
2112 | as if it were a malloc, meaning it returns a pointer that is | |
2113 | not an alias. */ | |
02e7a332 | 2114 | #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag) |
7259f3f8 | 2115 | |
26dfc457 | 2116 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
2117 | as "pure" function (like const function, but may read global memory). */ | |
2118 | #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag) | |
2119 | ||
d72a838e | 2120 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
2121 | specially. */ | |
02e7a332 | 2122 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag) |
56ba46a4 | 2123 | |
d72a838e | 2124 | /* In a LABEL_DECL, nonzero means label was defined inside a binding |
2125 | contour that restored a stack level and which is now exited. */ | |
02e7a332 | 2126 | #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag) |
8305149e | 2127 | |
00dd2e9e | 2128 | /* Unused in FUNCTION_DECL. */ |
8305149e | 2129 | |
3566762d | 2130 | /* In a VAR_DECL that's static, |
2131 | nonzero if the space is in the text section. */ | |
02e7a332 | 2132 | #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag) |
d72a838e | 2133 | |
00dd2e9e | 2134 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
2135 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
56ba46a4 | 2136 | |
00dd2e9e | 2137 | /* For a builtin function, identify which part of the compiler defined it. */ |
02e7a332 | 2138 | #define DECL_BUILT_IN_CLASS(NODE) \ |
56ba46a4 | 2139 | (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class) |
00dd2e9e | 2140 | |
077bcaed | 2141 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
d7565c5a | 2142 | Used in FIELD_DECLs for vtable pointers. |
2143 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
3e207e38 | 2144 | #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) |
d72a838e | 2145 | |
2682e5d6 | 2146 | /* Used to indicate that the linkage status of this DECL is not yet known, |
2147 | so it should not be output now. */ | |
3e207e38 | 2148 | #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) |
2682e5d6 | 2149 | |
fa602b3f | 2150 | /* Used in PARM_DECLs whose type are unions to indicate that the |
2151 | argument should be passed in the same way that the first union | |
2152 | alternative would be passed. */ | |
02e7a332 | 2153 | #define DECL_TRANSPARENT_UNION(NODE) \ |
56ba46a4 | 2154 | (PARM_DECL_CHECK (NODE)->decl.transparent_union) |
fa602b3f | 2155 | |
aa5ec236 | 2156 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically |
2157 | at the beginning or end of execution. */ | |
02e7a332 | 2158 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ |
56ba46a4 | 2159 | (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag) |
02e7a332 | 2160 | |
2161 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
2162 | (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag) | |
aa5ec236 | 2163 | |
c8ba8c46 | 2164 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
3e207e38 | 2165 | #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) |
c8ba8c46 | 2166 | |
9a0ce7db | 2167 | /* Used to indicate that this DECL has weak linkage. */ |
3e207e38 | 2168 | #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) |
9a0ce7db | 2169 | |
f65e3573 | 2170 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in |
2171 | multiple translation units should be merged. */ | |
3e207e38 | 2172 | #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) |
f65e3573 | 2173 | |
d1d06be2 | 2174 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
2175 | not be put out unless it is needed in this translation unit. | |
2176 | Entities like this are shared across translation units (like weak | |
2177 | entities), but are guaranteed to be generated by any translation | |
2178 | unit that needs them, and therefore need not be put out anywhere | |
2179 | where they are not needed. DECL_COMDAT is just a hint to the | |
2180 | back-end; it is up to front-ends which set this flag to ensure | |
2181 | that there will never be any harm, other than bloat, in putting out | |
2182 | something which is DECL_COMDAT. */ | |
2183 | #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) | |
2184 | ||
abd28cef | 2185 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should |
2186 | be instrumented with calls to support routines. */ | |
02e7a332 | 2187 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ |
56ba46a4 | 2188 | (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit) |
abd28cef | 2189 | |
8f8ac140 | 2190 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be |
2191 | disabled in this function. */ | |
02e7a332 | 2192 | #define DECL_NO_LIMIT_STACK(NODE) \ |
56ba46a4 | 2193 | (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack) |
8f8ac140 | 2194 | |
d72a838e | 2195 | /* Additional flags for language-specific uses. */ |
3e207e38 | 2196 | #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) |
2197 | #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) | |
2198 | #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) | |
2199 | #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) | |
2200 | #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) | |
2201 | #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) | |
2202 | #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) | |
2203 | #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) | |
d72a838e | 2204 | |
c6f5e832 | 2205 | /* Used to indicate that the pointer to this DECL cannot be treated as |
2206 | an address constant. */ | |
2207 | #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) | |
2208 | ||
851dfbff | 2209 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
2210 | this component. */ | |
2211 | #define DECL_NONADDRESSABLE_P(NODE) \ | |
2212 | (FIELD_DECL_CHECK (NODE)->decl.non_addressable) | |
2213 | ||
a5b1863e | 2214 | /* Used to indicate an alias set for the memory pointed to by this |
2215 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
2216 | pointer (or reference) type. */ | |
2217 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
2218 | (DECL_CHECK (NODE)->decl.pointer_alias_set) | |
2219 | ||
0bed3869 | 2220 | /* Used to store the alias_var for a DECL node. */ |
4ee9c684 | 2221 | #define DECL_PTA_ALIASVAR(NODE) \ |
2222 | (DECL_CHECK (NODE)->decl.alias_var) | |
2223 | ||
2224 | /* A numeric unique identifier for a LABEL_DECL. The UID allocation is | |
2225 | dense, unique within any one function, and may be used to index arrays. | |
2226 | If the value is -1, then no UID has been assigned. */ | |
2227 | #define LABEL_DECL_UID(NODE) \ | |
2228 | (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set) | |
2229 | ||
a5b1863e | 2230 | /* Nonzero if an alias set has been assigned to this declaration. */ |
2231 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
2232 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
2233 | ||
3a2bf8d3 | 2234 | /* Nonzero for a decl which is at file scope. */ |
2235 | #define DECL_FILE_SCOPE_P(EXP) \ | |
2236 | (! DECL_CONTEXT (EXP) \ | |
2237 | || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL) | |
2238 | ||
4ee9c684 | 2239 | /* Nonzero for a decl that has been marked as needing a memory slot. |
2240 | NOTE: Never use this macro directly. It will give you incomplete | |
2241 | information. Most of the time this bit will only be set after alias | |
2242 | analysis in the tree optimizers. It's always better to call | |
2243 | needs_to_live_in_memory instead. To mark memory variables use | |
2244 | mark_call_clobbered. */ | |
2245 | #define DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL(DECL) \ | |
2246 | DECL_CHECK (DECL)->decl.needs_to_live_in_memory | |
2247 | ||
e1232ce2 | 2248 | /* Nonzero for a decl that cgraph has decided should be inlined into |
2249 | at least one call site. It is not meaningful to look at this | |
2250 | directly; always use cgraph_function_possibly_inlined_p. */ | |
2251 | #define DECL_POSSIBLY_INLINED(DECL) \ | |
2252 | FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined | |
2253 | ||
9c40570a | 2254 | /* Enumerate visibility settings. */ |
2255 | ||
2256 | enum symbol_visibility | |
2257 | { | |
2258 | VISIBILITY_DEFAULT, | |
2259 | VISIBILITY_INTERNAL, | |
2260 | VISIBILITY_HIDDEN, | |
2261 | VISIBILITY_PROTECTED | |
2262 | }; | |
2263 | ||
821653e1 | 2264 | struct function; |
4ee9c684 | 2265 | union alias_var_def; |
1f3233d1 | 2266 | struct tree_decl GTY(()) |
d72a838e | 2267 | { |
851dfbff | 2268 | struct tree_common common; |
73b2a785 | 2269 | location_t locus; |
6053ec2b | 2270 | unsigned int uid; |
6a3e3d6d | 2271 | tree size; |
bec79597 | 2272 | ENUM_BITFIELD(machine_mode) mode : 8; |
d72a838e | 2273 | |
2274 | unsigned external_flag : 1; | |
2275 | unsigned nonlocal_flag : 1; | |
2276 | unsigned regdecl_flag : 1; | |
2277 | unsigned inline_flag : 1; | |
2278 | unsigned bit_field_flag : 1; | |
2279 | unsigned virtual_flag : 1; | |
d72a838e | 2280 | unsigned ignored_flag : 1; |
f7a75810 | 2281 | unsigned abstract_flag : 1; |
d72a838e | 2282 | |
9ed1ded5 | 2283 | unsigned in_system_header_flag : 1; |
f7a772a7 | 2284 | unsigned common_flag : 1; |
2682e5d6 | 2285 | unsigned defer_output : 1; |
fa602b3f | 2286 | unsigned transparent_union : 1; |
aa5ec236 | 2287 | unsigned static_ctor_flag : 1; |
2288 | unsigned static_dtor_flag : 1; | |
c8ba8c46 | 2289 | unsigned artificial_flag : 1; |
9a0ce7db | 2290 | unsigned weak_flag : 1; |
9ed1ded5 | 2291 | |
ab7943b9 | 2292 | unsigned non_addr_const_p : 1; |
2293 | unsigned no_instrument_function_entry_exit : 1; | |
ab7943b9 | 2294 | unsigned comdat_flag : 1; |
2295 | unsigned malloc_flag : 1; | |
2296 | unsigned no_limit_stack : 1; | |
488c4206 | 2297 | ENUM_BITFIELD(built_in_class) built_in_class : 2; |
851dfbff | 2298 | unsigned pure_flag : 1; |
8a06f2d4 | 2299 | |
851dfbff | 2300 | unsigned non_addressable : 1; |
aca14577 | 2301 | unsigned user_align : 1; |
8f80e66d | 2302 | unsigned uninlinable : 1; |
2a6f0f81 | 2303 | unsigned thread_local_flag : 1; |
746149b7 | 2304 | unsigned declared_inline_flag : 1; |
4ee9c684 | 2305 | unsigned seen_in_bind_expr : 1; |
9c40570a | 2306 | ENUM_BITFIELD(symbol_visibility) visibility : 2; |
ab7943b9 | 2307 | |
d72a838e | 2308 | unsigned lang_flag_0 : 1; |
2309 | unsigned lang_flag_1 : 1; | |
2310 | unsigned lang_flag_2 : 1; | |
2311 | unsigned lang_flag_3 : 1; | |
2312 | unsigned lang_flag_4 : 1; | |
2313 | unsigned lang_flag_5 : 1; | |
2314 | unsigned lang_flag_6 : 1; | |
2315 | unsigned lang_flag_7 : 1; | |
2316 | ||
4ee9c684 | 2317 | unsigned needs_to_live_in_memory : 1; |
e1232ce2 | 2318 | unsigned possibly_inlined : 1; |
2319 | /* 14 unused bits. */ | |
4ee9c684 | 2320 | |
1f3233d1 | 2321 | union tree_decl_u1 { |
1f1fa73c | 2322 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is |
2323 | DECL_FUNCTION_CODE. */ | |
ab7943b9 | 2324 | enum built_in_function f; |
28c2d844 | 2325 | /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this |
1f1fa73c | 2326 | is used by language-dependent code. */ |
2327 | HOST_WIDE_INT i; | |
2328 | /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for | |
2329 | FUNCTION_DECLs). */ | |
1f3233d1 | 2330 | struct tree_decl_u1_a { |
60b8c5b3 | 2331 | unsigned int align : 24; |
1f3233d1 | 2332 | unsigned int off_align : 8; |
2333 | } a; | |
7035b2ab | 2334 | } GTY ((skip)) u1; |
9a7aa5df | 2335 | |
6a3e3d6d | 2336 | tree size_unit; |
2337 | tree name; | |
2338 | tree context; | |
2339 | tree arguments; /* Also used for DECL_FIELD_OFFSET */ | |
2340 | tree result; /* Also used for DECL_BIT_FIELD_TYPE */ | |
2341 | tree initial; /* Also used for DECL_QUALIFIER */ | |
2342 | tree abstract_origin; | |
2343 | tree assembler_name; | |
2344 | tree section_name; | |
e3c541f0 | 2345 | tree attributes; |
6a3e3d6d | 2346 | rtx rtl; /* RTL representation for object. */ |
b278476e | 2347 | |
ab7943b9 | 2348 | /* In FUNCTION_DECL, if it is inline, holds the saved insn chain. |
02e7a332 | 2349 | In FIELD_DECL, is DECL_FIELD_BIT_OFFSET. |
ab7943b9 | 2350 | In PARM_DECL, holds an RTL for the stack slot |
2351 | of register where the data was actually passed. | |
2352 | Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */ | |
1f3233d1 | 2353 | union tree_decl_u2 { |
2354 | struct function * GTY ((tag ("FUNCTION_DECL"))) f; | |
2355 | rtx GTY ((tag ("PARM_DECL"))) r; | |
2356 | tree GTY ((tag ("FIELD_DECL"))) t; | |
573aba85 | 2357 | int GTY ((tag ("VAR_DECL"))) i; |
1f3233d1 | 2358 | } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2; |
ab7943b9 | 2359 | |
1431bff6 | 2360 | /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */ |
2361 | tree saved_tree; | |
2362 | ||
2363 | /* In a FUNCTION_DECL, these are function data which is to be kept | |
2364 | as long as FUNCTION_DECL is kept. */ | |
2365 | tree inlined_fns; | |
2366 | ||
6a3e3d6d | 2367 | tree vindex; |
f7c44134 | 2368 | HOST_WIDE_INT pointer_alias_set; |
4ee9c684 | 2369 | union alias_var_def *GTY ((skip(""))) alias_var; |
d72a838e | 2370 | /* Points to a structure whose details depend on the language in use. */ |
2371 | struct lang_decl *lang_specific; | |
2372 | }; | |
4ee9c684 | 2373 | |
2374 | \f | |
2375 | /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. | |
2376 | To reduce overhead, the nodes containing the statements are not trees. | |
2377 | This avoids the overhead of tree_common on all linked list elements. | |
2378 | ||
2379 | Use the interface in tree-iterator.h to access this node. */ | |
2380 | ||
2381 | #define STATEMENT_LIST_HEAD(NODE) \ | |
2382 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) | |
2383 | #define STATEMENT_LIST_TAIL(NODE) \ | |
2384 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) | |
2385 | ||
2386 | struct tree_statement_list_node | |
2387 | GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) | |
2388 | { | |
2389 | struct tree_statement_list_node *prev; | |
2390 | struct tree_statement_list_node *next; | |
2391 | tree stmt; | |
2392 | }; | |
2393 | ||
2394 | struct tree_statement_list | |
2395 | GTY(()) | |
2396 | { | |
2397 | struct tree_common common; | |
2398 | struct tree_statement_list_node *head; | |
2399 | struct tree_statement_list_node *tail; | |
2400 | }; | |
d72a838e | 2401 | \f |
1f3233d1 | 2402 | enum tree_node_structure_enum { |
2403 | TS_COMMON, | |
2404 | TS_INT_CST, | |
2405 | TS_REAL_CST, | |
2406 | TS_VECTOR, | |
2407 | TS_STRING, | |
2408 | TS_COMPLEX, | |
2409 | TS_IDENTIFIER, | |
2410 | TS_DECL, | |
2411 | TS_TYPE, | |
2412 | TS_LIST, | |
2413 | TS_VEC, | |
2414 | TS_EXP, | |
4ee9c684 | 2415 | TS_SSA_NAME, |
2416 | TS_PHI_NODE, | |
2417 | TS_EPHI_NODE, | |
2418 | TS_EUSE_NODE, | |
2419 | TS_EREF_NODE, | |
1f3233d1 | 2420 | TS_BLOCK, |
4ee9c684 | 2421 | TS_STATEMENT_LIST, |
1f3233d1 | 2422 | LAST_TS_ENUM |
2423 | }; | |
2424 | ||
d72a838e | 2425 | /* Define the overall contents of a tree node. |
2426 | It may be any of the structures declared above | |
2427 | for various types of node. */ | |
2428 | ||
1f3233d1 | 2429 | union tree_node GTY ((ptr_alias (union lang_tree_node), |
2430 | desc ("tree_node_structure (&%h)"))) | |
d72a838e | 2431 | { |
1f3233d1 | 2432 | struct tree_common GTY ((tag ("TS_COMMON"))) common; |
2433 | struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; | |
2434 | struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; | |
2435 | struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; | |
2436 | struct tree_string GTY ((tag ("TS_STRING"))) string; | |
2437 | struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; | |
2438 | struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; | |
2439 | struct tree_decl GTY ((tag ("TS_DECL"))) decl; | |
2440 | struct tree_type GTY ((tag ("TS_TYPE"))) type; | |
2441 | struct tree_list GTY ((tag ("TS_LIST"))) list; | |
2442 | struct tree_vec GTY ((tag ("TS_VEC"))) vec; | |
2443 | struct tree_exp GTY ((tag ("TS_EXP"))) exp; | |
4ee9c684 | 2444 | struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; |
2445 | struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi; | |
2446 | struct tree_eref_common GTY ((tag ("TS_EREF_NODE"))) eref; | |
2447 | struct tree_ephi_node GTY ((tag ("TS_EPHI_NODE"))) ephi; | |
2448 | struct tree_euse_node GTY ((tag ("TS_EUSE_NODE"))) euse; | |
1f3233d1 | 2449 | struct tree_block GTY ((tag ("TS_BLOCK"))) block; |
4ee9c684 | 2450 | struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; |
2451 | }; | |
5059aa85 | 2452 | \f |
775e7cc0 | 2453 | /* Standard named or nameless data types of the C compiler. */ |
2454 | ||
2455 | enum tree_index | |
2456 | { | |
2457 | TI_ERROR_MARK, | |
2458 | TI_INTQI_TYPE, | |
2459 | TI_INTHI_TYPE, | |
2460 | TI_INTSI_TYPE, | |
2461 | TI_INTDI_TYPE, | |
2462 | TI_INTTI_TYPE, | |
2463 | ||
2464 | TI_UINTQI_TYPE, | |
2465 | TI_UINTHI_TYPE, | |
2466 | TI_UINTSI_TYPE, | |
2467 | TI_UINTDI_TYPE, | |
2468 | TI_UINTTI_TYPE, | |
6c34d0c2 | 2469 | |
775e7cc0 | 2470 | TI_INTEGER_ZERO, |
2471 | TI_INTEGER_ONE, | |
c87787ad | 2472 | TI_INTEGER_MINUS_ONE, |
775e7cc0 | 2473 | TI_NULL_POINTER, |
2474 | ||
2475 | TI_SIZE_ZERO, | |
2476 | TI_SIZE_ONE, | |
02e7a332 | 2477 | |
2478 | TI_BITSIZE_ZERO, | |
2479 | TI_BITSIZE_ONE, | |
2480 | TI_BITSIZE_UNIT, | |
2481 | ||
2c584053 | 2482 | TI_PUBLIC, |
2483 | TI_PROTECTED, | |
2484 | TI_PRIVATE, | |
2485 | ||
3c2239cf | 2486 | TI_BOOLEAN_FALSE, |
2487 | TI_BOOLEAN_TRUE, | |
2488 | ||
775e7cc0 | 2489 | TI_COMPLEX_INTEGER_TYPE, |
2490 | TI_COMPLEX_FLOAT_TYPE, | |
2491 | TI_COMPLEX_DOUBLE_TYPE, | |
2492 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
2493 | ||
2494 | TI_FLOAT_TYPE, | |
2495 | TI_DOUBLE_TYPE, | |
2496 | TI_LONG_DOUBLE_TYPE, | |
2497 | ||
4070bd43 | 2498 | TI_FLOAT_PTR_TYPE, |
2499 | TI_DOUBLE_PTR_TYPE, | |
2500 | TI_LONG_DOUBLE_PTR_TYPE, | |
2501 | TI_INTEGER_PTR_TYPE, | |
2502 | ||
775e7cc0 | 2503 | TI_VOID_TYPE, |
2504 | TI_PTR_TYPE, | |
2505 | TI_CONST_PTR_TYPE, | |
654ef926 | 2506 | TI_SIZE_TYPE, |
73673831 | 2507 | TI_PID_TYPE, |
775e7cc0 | 2508 | TI_PTRDIFF_TYPE, |
2509 | TI_VA_LIST_TYPE, | |
3c2239cf | 2510 | TI_BOOLEAN_TYPE, |
e256d445 | 2511 | TI_FILEPTR_TYPE, |
775e7cc0 | 2512 | |
83f69b41 | 2513 | TI_VOID_LIST_NODE, |
2514 | ||
5c62f199 | 2515 | TI_MAIN_IDENTIFIER, |
2516 | ||
775e7cc0 | 2517 | TI_MAX |
2518 | }; | |
2519 | ||
1f3233d1 | 2520 | extern GTY(()) tree global_trees[TI_MAX]; |
775e7cc0 | 2521 | |
2522 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
6c34d0c2 | 2523 | |
775e7cc0 | 2524 | #define intQI_type_node global_trees[TI_INTQI_TYPE] |
2525 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
2526 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
2527 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
2528 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
2529 | ||
2530 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
2531 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
2532 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
2533 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
2534 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
2535 | ||
775e7cc0 | 2536 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
2537 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
c87787ad | 2538 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
775e7cc0 | 2539 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
2540 | #define size_one_node global_trees[TI_SIZE_ONE] | |
02e7a332 | 2541 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
2542 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
2543 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
2544 | ||
95f3173a | 2545 | /* Base access nodes. */ |
2c584053 | 2546 | #define access_public_node global_trees[TI_PUBLIC] |
2547 | #define access_protected_node global_trees[TI_PROTECTED] | |
2548 | #define access_private_node global_trees[TI_PRIVATE] | |
95f3173a | 2549 | |
775e7cc0 | 2550 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
2551 | ||
2552 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
2553 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
2554 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
2555 | ||
4070bd43 | 2556 | #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] |
2557 | #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] | |
2558 | #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] | |
2559 | #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] | |
2560 | ||
775e7cc0 | 2561 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] |
2562 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
2563 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
2564 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
2565 | ||
2566 | #define void_type_node global_trees[TI_VOID_TYPE] | |
39b6af4b | 2567 | /* The C type `void *'. */ |
775e7cc0 | 2568 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
39b6af4b | 2569 | /* The C type `const void *'. */ |
775e7cc0 | 2570 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
654ef926 | 2571 | /* The C type `size_t'. */ |
2572 | #define size_type_node global_trees[TI_SIZE_TYPE] | |
73673831 | 2573 | #define pid_type_node global_trees[TI_PID_TYPE] |
775e7cc0 | 2574 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] |
2575 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
e256d445 | 2576 | /* The C type `FILE *'. */ |
2577 | #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] | |
b06898ca | 2578 | |
3c2239cf | 2579 | #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] |
2580 | #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] | |
2581 | #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] | |
2582 | ||
83f69b41 | 2583 | /* The node that should be placed at the end of a parameter list to |
2584 | indicate that the function does not take a variable number of | |
2585 | arguments. The TREE_VALUE will be void_type_node and there will be | |
2586 | no TREE_CHAIN. Language-independent code should not assume | |
2587 | anything else about this node. */ | |
2588 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
2589 | ||
5c62f199 | 2590 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
2591 | #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
2592 | ||
b06898ca | 2593 | /* An enumeration of the standard C integer types. These must be |
f5ec8cb5 | 2594 | ordered so that shorter types appear before longer ones, and so |
2595 | that signed types appear before unsigned ones, for the correct | |
2596 | functioning of interpret_integer() in c-lex.c. */ | |
6c34d0c2 | 2597 | enum integer_type_kind |
b06898ca | 2598 | { |
2599 | itk_char, | |
2600 | itk_signed_char, | |
2601 | itk_unsigned_char, | |
2602 | itk_short, | |
2603 | itk_unsigned_short, | |
2604 | itk_int, | |
2605 | itk_unsigned_int, | |
2606 | itk_long, | |
2607 | itk_unsigned_long, | |
2608 | itk_long_long, | |
2609 | itk_unsigned_long_long, | |
2610 | itk_none | |
2611 | }; | |
2612 | ||
2613 | typedef enum integer_type_kind integer_type_kind; | |
2614 | ||
2615 | /* The standard C integer types. Use integer_type_kind to index into | |
2616 | this array. */ | |
1f3233d1 | 2617 | extern GTY(()) tree integer_types[itk_none]; |
b06898ca | 2618 | |
2619 | #define char_type_node integer_types[itk_char] | |
2620 | #define signed_char_type_node integer_types[itk_signed_char] | |
2621 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
2622 | #define short_integer_type_node integer_types[itk_short] | |
2623 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
2624 | #define integer_type_node integer_types[itk_int] | |
2625 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
2626 | #define long_integer_type_node integer_types[itk_long] | |
2627 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
2628 | #define long_long_integer_type_node integer_types[itk_long_long] | |
2629 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
24dfead4 | 2630 | \f |
2631 | /* Set to the default thread-local storage (tls) model to use. */ | |
2632 | ||
2633 | enum tls_model { | |
2634 | TLS_MODEL_GLOBAL_DYNAMIC = 1, | |
2635 | TLS_MODEL_LOCAL_DYNAMIC, | |
2636 | TLS_MODEL_INITIAL_EXEC, | |
2637 | TLS_MODEL_LOCAL_EXEC | |
2638 | }; | |
b06898ca | 2639 | |
24dfead4 | 2640 | extern enum tls_model flag_tls_default; |
8cf34b34 | 2641 | |
775e7cc0 | 2642 | \f |
fc5cb4c0 | 2643 | /* A pointer-to-function member type looks like: |
2644 | ||
2645 | struct { | |
2646 | __P __pfn; | |
2647 | ptrdiff_t __delta; | |
2648 | }; | |
2649 | ||
2650 | If __pfn is NULL, it is a NULL pointer-to-member-function. | |
2651 | ||
2652 | (Because the vtable is always the first thing in the object, we | |
2653 | don't need its offset.) If the function is virtual, then PFN is | |
2654 | one plus twice the index into the vtable; otherwise, it is just a | |
2655 | pointer to the function. | |
2656 | ||
2657 | Unfortunately, using the lowest bit of PFN doesn't work in | |
2658 | architectures that don't impose alignment requirements on function | |
2659 | addresses, or that use the lowest bit to tell one ISA from another, | |
2660 | for example. For such architectures, we use the lowest bit of | |
2661 | DELTA instead of the lowest bit of the PFN, and DELTA will be | |
2662 | multiplied by 2. */ | |
2663 | ||
2664 | enum ptrmemfunc_vbit_where_t | |
2665 | { | |
2666 | ptrmemfunc_vbit_in_pfn, | |
2667 | ptrmemfunc_vbit_in_delta | |
2668 | }; | |
2669 | \f | |
fb084c16 | 2670 | #define NULL_TREE (tree) NULL |
2671 | ||
c12cb392 | 2672 | extern GTY(()) tree frame_base_decl; |
60b8c5b3 | 2673 | extern tree decl_assembler_name (tree); |
d72a838e | 2674 | |
6663ac46 | 2675 | /* Compute the number of bytes occupied by 'node'. This routine only |
2676 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
2677 | ||
60b8c5b3 | 2678 | extern size_t tree_size (tree); |
6663ac46 | 2679 | |
d72a838e | 2680 | /* Lowest level primitive for allocating a node. |
2681 | The TREE_CODE is the only argument. Contents are initialized | |
2682 | to zero except for a few of the common fields. */ | |
2683 | ||
674b05f5 | 2684 | extern tree make_node_stat (enum tree_code MEM_STAT_DECL); |
2685 | #define make_node(t) make_node_stat (t MEM_STAT_INFO) | |
d72a838e | 2686 | |
ff6d0dd9 | 2687 | /* Make a copy of a node, with all the same contents. */ |
d72a838e | 2688 | |
674b05f5 | 2689 | extern tree copy_node_stat (tree MEM_STAT_DECL); |
2690 | #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) | |
d72a838e | 2691 | |
2692 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
2693 | ||
60b8c5b3 | 2694 | extern tree copy_list (tree); |
d72a838e | 2695 | |
2696 | /* Make a TREE_VEC. */ | |
2697 | ||
674b05f5 | 2698 | extern tree make_tree_vec_stat (int MEM_STAT_DECL); |
2699 | #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) | |
d72a838e | 2700 | |
4ee9c684 | 2701 | /* Tree nodes for SSA analysis. */ |
2702 | ||
2703 | extern tree make_phi_node (tree, int); | |
2704 | extern void init_phinodes (void); | |
2705 | extern void fini_phinodes (void); | |
2706 | extern void release_phi_node (tree); | |
2707 | #ifdef GATHER_STATISTICS | |
2708 | extern void phinodes_print_statistics (void); | |
2709 | #endif | |
2710 | ||
2711 | extern void init_ssanames (void); | |
2712 | extern void fini_ssanames (void); | |
2713 | extern tree make_ssa_name (tree, tree); | |
2714 | extern void release_ssa_name (tree); | |
2715 | #ifdef GATHER_STATISTICS | |
2716 | extern void ssanames_print_statistics (void); | |
2717 | #endif | |
2718 | ||
d72a838e | 2719 | /* Return the (unique) IDENTIFIER_NODE node for a given name. |
2720 | The name is supplied as a char *. */ | |
2721 | ||
60b8c5b3 | 2722 | extern tree get_identifier (const char *); |
d72a838e | 2723 | |
69642df2 | 2724 | #if GCC_VERSION >= 3000 |
2725 | #define get_identifier(str) \ | |
2726 | (__builtin_constant_p (str) \ | |
2727 | ? get_identifier_with_length ((str), strlen (str)) \ | |
2728 | : get_identifier (str)) | |
2729 | #endif | |
2730 | ||
2731 | ||
82863d5e | 2732 | /* Identical to get_identifier, except that the length is assumed |
2733 | known. */ | |
2734 | ||
69642df2 | 2735 | extern tree get_identifier_with_length (const char *, size_t); |
82863d5e | 2736 | |
06fcb3a0 | 2737 | /* If an identifier with the name TEXT (a null-terminated string) has |
2738 | previously been referred to, return that node; otherwise return | |
2739 | NULL_TREE. */ | |
2740 | ||
60b8c5b3 | 2741 | extern tree maybe_get_identifier (const char *); |
06fcb3a0 | 2742 | |
d72a838e | 2743 | /* Construct various types of nodes. */ |
2744 | ||
76c6f48d | 2745 | #define build_int_2(LO, HI) \ |
4491f79f | 2746 | build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) |
9e6d0a9a | 2747 | |
60b8c5b3 | 2748 | extern tree build (enum tree_code, tree, ...); |
2749 | extern tree build_nt (enum tree_code, ...); | |
2750 | ||
413a7abf | 2751 | #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L |
2752 | /* Use preprocessor trickery to map "build" to "buildN" where N is the | |
2753 | expected number of arguments. This is used for both efficiency (no | |
2754 | varargs), and checking (verifying number of passed arguments). */ | |
2755 | #define build(code, ...) \ | |
2756 | _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__) | |
2757 | #define _buildN1(BASE, X) _buildN2(BASE, X) | |
2758 | #define _buildN2(BASE, X) BASE##X | |
2759 | #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0) | |
2760 | #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c | |
2761 | #endif | |
2762 | ||
674b05f5 | 2763 | extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); |
2764 | #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) | |
2765 | extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
2766 | #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) | |
2767 | extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
2768 | #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) | |
2769 | extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
2770 | #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) | |
2771 | extern tree build4_stat (enum tree_code, tree, tree, tree, tree, | |
2772 | tree MEM_STAT_DECL); | |
2773 | #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
413a7abf | 2774 | |
60b8c5b3 | 2775 | extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT); |
2776 | extern tree build_vector (tree, tree); | |
2777 | extern tree build_constructor (tree, tree); | |
2778 | extern tree build_real_from_int_cst (tree, tree); | |
2779 | extern tree build_complex (tree, tree, tree); | |
2780 | extern tree build_string (int, const char *); | |
674b05f5 | 2781 | extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); |
2782 | #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) | |
2783 | extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
2784 | #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO) | |
60b8c5b3 | 2785 | extern tree build_block (tree, tree, tree, tree, tree); |
4ee9c684 | 2786 | extern void annotate_with_file_line (tree, const char *, int); |
2787 | extern void annotate_with_locus (tree, location_t); | |
2788 | extern tree build_empty_stmt (void); | |
d72a838e | 2789 | |
2790 | /* Construct various nodes representing data types. */ | |
2791 | ||
60b8c5b3 | 2792 | extern tree make_signed_type (int); |
2793 | extern tree make_unsigned_type (int); | |
2794 | extern void initialize_sizetypes (void); | |
2795 | extern void set_sizetype (tree); | |
2796 | extern void fixup_unsigned_type (tree); | |
b24423db | 2797 | extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 2798 | extern tree build_pointer_type (tree); |
b24423db | 2799 | extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 2800 | extern tree build_reference_type (tree); |
4917c376 | 2801 | extern tree build_vector_type_for_mode (tree, enum machine_mode); |
2802 | extern tree build_vector_type (tree innertype, int nunits); | |
60b8c5b3 | 2803 | extern tree build_type_no_quals (tree); |
2804 | extern tree build_index_type (tree); | |
2805 | extern tree build_index_2_type (tree, tree); | |
2806 | extern tree build_array_type (tree, tree); | |
2807 | extern tree build_function_type (tree, tree); | |
2808 | extern tree build_function_type_list (tree, ...); | |
5bfb0742 | 2809 | extern tree build_method_type_directly (tree, tree, tree); |
60b8c5b3 | 2810 | extern tree build_method_type (tree, tree); |
2811 | extern tree build_offset_type (tree, tree); | |
2812 | extern tree build_complex_type (tree); | |
2813 | extern tree array_type_nelts (tree); | |
2814 | ||
2815 | extern tree value_member (tree, tree); | |
2816 | extern tree purpose_member (tree, tree); | |
2817 | extern tree binfo_member (tree, tree); | |
908e5f41 | 2818 | |
60b8c5b3 | 2819 | extern int attribute_list_equal (tree, tree); |
2820 | extern int attribute_list_contained (tree, tree); | |
2821 | extern int tree_int_cst_equal (tree, tree); | |
2822 | extern int tree_int_cst_lt (tree, tree); | |
2823 | extern int tree_int_cst_compare (tree, tree); | |
2824 | extern int host_integerp (tree, int); | |
2825 | extern HOST_WIDE_INT tree_low_cst (tree, int); | |
2826 | extern int tree_int_cst_msb (tree); | |
2827 | extern int tree_int_cst_sgn (tree); | |
2828 | extern int tree_expr_nonnegative_p (tree); | |
2829 | extern int rtl_expr_nonnegative_p (rtx); | |
2830 | extern tree get_inner_array_type (tree); | |
296a500c | 2831 | |
fb084c16 | 2832 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
2833 | put the prototype here. Rtl.h does declare the prototype if | |
2834 | tree.h had been included. */ | |
2835 | ||
60b8c5b3 | 2836 | extern tree make_tree (tree, rtx); |
d72a838e | 2837 | \f |
a12eeaaf | 2838 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
2839 | is ATTRIBUTE. | |
2840 | ||
2841 | Such modified types already made are recorded so that duplicates | |
88b5b080 | 2842 | are not made. */ |
a12eeaaf | 2843 | |
60b8c5b3 | 2844 | extern tree build_type_attribute_variant (tree, tree); |
2845 | extern tree build_decl_attribute_variant (tree, tree); | |
a12eeaaf | 2846 | |
e3c541f0 | 2847 | /* Structure describing an attribute and a function to handle it. */ |
2848 | struct attribute_spec | |
2849 | { | |
2850 | /* The name of the attribute (without any leading or trailing __), | |
2851 | or NULL to mark the end of a table of attributes. */ | |
e99c3a1d | 2852 | const char *const name; |
e3c541f0 | 2853 | /* The minimum length of the list of arguments of the attribute. */ |
e99c3a1d | 2854 | const int min_length; |
e3c541f0 | 2855 | /* The maximum length of the list of arguments of the attribute |
2856 | (-1 for no maximum). */ | |
e99c3a1d | 2857 | const int max_length; |
e3c541f0 | 2858 | /* Whether this attribute requires a DECL. If it does, it will be passed |
2859 | from types of DECLs, function return types and array element types to | |
2860 | the DECLs, function types and array types respectively; but when | |
2861 | applied to a type in any other circumstances, it will be ignored with | |
2862 | a warning. (If greater control is desired for a given attribute, | |
2863 | this should be false, and the flags argument to the handler may be | |
2864 | used to gain greater control in that case.) */ | |
e99c3a1d | 2865 | const bool decl_required; |
e3c541f0 | 2866 | /* Whether this attribute requires a type. If it does, it will be passed |
2867 | from a DECL to the type of that DECL. */ | |
e99c3a1d | 2868 | const bool type_required; |
e3c541f0 | 2869 | /* Whether this attribute requires a function (or method) type. If it does, |
2870 | it will be passed from a function pointer type to the target type, | |
2871 | and from a function return type (which is not itself a function | |
2872 | pointer type) to the function type. */ | |
e99c3a1d | 2873 | const bool function_type_required; |
e3c541f0 | 2874 | /* Function to handle this attribute. NODE points to the node to which |
2875 | the attribute is to be applied. If a DECL, it should be modified in | |
2876 | place; if a TYPE, a copy should be created. NAME is the name of the | |
2877 | attribute (possibly with leading or trailing __). ARGS is the TREE_LIST | |
2878 | of the arguments (which may be NULL). FLAGS gives further information | |
2879 | about the context of the attribute. Afterwards, the attributes will | |
2880 | be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, | |
2881 | unless *NO_ADD_ATTRS is set to true (which should be done on error, | |
2882 | as well as in any other cases when the attributes should not be added | |
2883 | to the DECL or TYPE). Depending on FLAGS, any attributes to be | |
2884 | applied to another type or DECL later may be returned; | |
2885 | otherwise the return value should be NULL_TREE. This pointer may be | |
2886 | NULL if no special handling is required beyond the checks implied | |
2887 | by the rest of this structure. */ | |
60b8c5b3 | 2888 | tree (*const handler) (tree *node, tree name, tree args, |
2889 | int flags, bool *no_add_attrs); | |
e3c541f0 | 2890 | }; |
2891 | ||
e3c541f0 | 2892 | /* Flags that may be passed in the third argument of decl_attributes, and |
2893 | to handler functions for attributes. */ | |
2894 | enum attribute_flags | |
2895 | { | |
2896 | /* The type passed in is the type of a DECL, and any attributes that | |
2897 | should be passed in again to be applied to the DECL rather than the | |
2898 | type should be returned. */ | |
2899 | ATTR_FLAG_DECL_NEXT = 1, | |
2900 | /* The type passed in is a function return type, and any attributes that | |
2901 | should be passed in again to be applied to the function type rather | |
2902 | than the return type should be returned. */ | |
2903 | ATTR_FLAG_FUNCTION_NEXT = 2, | |
2904 | /* The type passed in is an array element type, and any attributes that | |
2905 | should be passed in again to be applied to the array type rather | |
2906 | than the element type should be returned. */ | |
2907 | ATTR_FLAG_ARRAY_NEXT = 4, | |
2908 | /* The type passed in is a structure, union or enumeration type being | |
2909 | created, and should be modified in place. */ | |
7d3b509a | 2910 | ATTR_FLAG_TYPE_IN_PLACE = 8, |
2911 | /* The attributes are being applied by default to a library function whose | |
2912 | name indicates known behavior, and should be silently ignored if they | |
2913 | are not in fact compatible with the function type. */ | |
2914 | ATTR_FLAG_BUILT_IN = 16 | |
e3c541f0 | 2915 | }; |
2916 | ||
ed5635e4 | 2917 | /* Default versions of target-overridable functions. */ |
2918 | ||
60b8c5b3 | 2919 | extern tree merge_decl_attributes (tree, tree); |
2920 | extern tree merge_type_attributes (tree, tree); | |
2921 | extern void default_register_cpp_builtins (struct cpp_reader *); | |
0bf60c2b | 2922 | |
2923 | /* Split a list of declspecs and attributes into two. */ | |
2924 | ||
aecda0d6 | 2925 | extern void split_specs_attrs (tree, tree *, tree *); |
0bf60c2b | 2926 | |
2927 | /* Strip attributes from a list of combined specs and attrs. */ | |
2928 | ||
aecda0d6 | 2929 | extern tree strip_attrs (tree); |
0bf60c2b | 2930 | |
fe78f852 | 2931 | /* Return 1 if an attribute and its arguments are valid for a decl or type. */ |
2932 | ||
60b8c5b3 | 2933 | extern int valid_machine_attribute (tree, tree, tree, tree); |
fe78f852 | 2934 | |
f712a0dc | 2935 | /* Given a tree node and a string, return nonzero if the tree node is |
fe78f852 | 2936 | a valid attribute name for the string. */ |
2937 | ||
60b8c5b3 | 2938 | extern int is_attribute_p (const char *, tree); |
fe78f852 | 2939 | |
2940 | /* Given an attribute name and a list of attributes, return the list element | |
2941 | of the attribute or NULL_TREE if not found. */ | |
2942 | ||
60b8c5b3 | 2943 | extern tree lookup_attribute (const char *, tree); |
4ab0a739 | 2944 | |
2945 | /* Given two attributes lists, return a list of their union. */ | |
2946 | ||
60b8c5b3 | 2947 | extern tree merge_attributes (tree, tree); |
fe78f852 | 2948 | |
a767736d | 2949 | #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES |
2950 | /* Given two Windows decl attributes lists, possibly including | |
2951 | dllimport, return a list of their union . */ | |
60b8c5b3 | 2952 | extern tree merge_dllimport_decl_attributes (tree, tree); |
a767736d | 2953 | #endif |
2954 | ||
e40000f4 | 2955 | /* Check whether CAND is suitable to be returned from get_qualified_type |
2956 | (BASE, TYPE_QUALS). */ | |
2957 | ||
2958 | extern bool check_qualified_type (tree, tree, int); | |
2959 | ||
051b8c96 | 2960 | /* Return a version of the TYPE, qualified as indicated by the |
2961 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
2962 | return NULL_TREE. */ | |
2963 | ||
60b8c5b3 | 2964 | extern tree get_qualified_type (tree, int); |
051b8c96 | 2965 | |
2966 | /* Like get_qualified_type, but creates the type if it does not | |
2967 | exist. This function never returns NULL_TREE. */ | |
a5b1863e | 2968 | |
60b8c5b3 | 2969 | extern tree build_qualified_type (tree, int); |
a5b1863e | 2970 | |
2971 | /* Like build_qualified_type, but only deals with the `const' and | |
2972 | `volatile' qualifiers. This interface is retained for backwards | |
de132707 | 2973 | compatibility with the various front-ends; new code should use |
a5b1863e | 2974 | build_qualified_type instead. */ |
d72a838e | 2975 | |
a5b1863e | 2976 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
76c6f48d | 2977 | build_qualified_type ((TYPE), \ |
a5b1863e | 2978 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ |
2979 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
d72a838e | 2980 | |
11121344 | 2981 | /* Make a copy of a type node. */ |
2982 | ||
60b8c5b3 | 2983 | extern tree build_type_copy (tree); |
11121344 | 2984 | |
805e22b2 | 2985 | /* Finish up a builtin RECORD_TYPE. Give it a name and provide its |
2986 | fields. Optionally specify an alignment, and then lsy it out. */ | |
2987 | ||
60b8c5b3 | 2988 | extern void finish_builtin_struct (tree, const char *, |
2989 | tree, tree); | |
805e22b2 | 2990 | |
d72a838e | 2991 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
99f4e085 | 2992 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
2993 | node, does nothing except for the first time. */ | |
d72a838e | 2994 | |
60b8c5b3 | 2995 | extern void layout_type (tree); |
d72a838e | 2996 | |
99f4e085 | 2997 | /* These functions allow a front-end to perform a manual layout of a |
2998 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
2999 | depends on the placement of fields so far.) Begin by calling | |
02e7a332 | 3000 | start_record_layout. Then, call place_field for each of the |
99f4e085 | 3001 | fields. Then, call finish_record_layout. See layout_type for the |
3002 | default way in which these functions are used. */ | |
3003 | ||
ad847b26 | 3004 | typedef struct record_layout_info_s |
99f4e085 | 3005 | { |
3006 | /* The RECORD_TYPE that we are laying out. */ | |
3007 | tree t; | |
02e7a332 | 3008 | /* The offset into the record so far, in bytes, not including bits in |
3009 | BITPOS. */ | |
3010 | tree offset; | |
3011 | /* The last known alignment of SIZE. */ | |
3012 | unsigned int offset_align; | |
3013 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
3014 | tree bitpos; | |
99f4e085 | 3015 | /* The alignment of the record so far, in bits. */ |
3016 | unsigned int record_align; | |
f5712181 | 3017 | /* The alignment of the record so far, ignoring #pragma pack and |
3018 | __attribute__ ((packed)), in bits. */ | |
02e7a332 | 3019 | unsigned int unpacked_align; |
f04f096b | 3020 | /* The previous field layed out. */ |
3021 | tree prev_field; | |
99f4e085 | 3022 | /* The static variables (i.e., class variables, as opposed to |
3023 | instance variables) encountered in T. */ | |
3024 | tree pending_statics; | |
8642f3d3 | 3025 | /* Bits remaining in the current alignment group */ |
3026 | int remaining_in_alignment; | |
f5712181 | 3027 | /* True if we've seen a packed field that didn't have normal |
3028 | alignment anyway. */ | |
99f4e085 | 3029 | int packed_maybe_necessary; |
02e7a332 | 3030 | } *record_layout_info; |
99f4e085 | 3031 | |
60b8c5b3 | 3032 | extern void set_lang_adjust_rli (void (*) (record_layout_info)); |
3033 | extern record_layout_info start_record_layout (tree); | |
3034 | extern tree bit_from_pos (tree, tree); | |
3035 | extern tree byte_from_pos (tree, tree); | |
3036 | extern void pos_from_bit (tree *, tree *, unsigned int, tree); | |
3037 | extern void normalize_offset (tree *, tree *, unsigned int); | |
3038 | extern tree rli_size_unit_so_far (record_layout_info); | |
3039 | extern tree rli_size_so_far (record_layout_info); | |
3040 | extern void normalize_rli (record_layout_info); | |
3041 | extern void place_field (record_layout_info, tree); | |
3042 | extern void compute_record_mode (tree); | |
3043 | extern void finish_record_layout (record_layout_info, int); | |
99f4e085 | 3044 | |
d72a838e | 3045 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
3046 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
3047 | How the hash code is computed is up to the caller, as long as any two | |
3048 | callers that could hash identical-looking type nodes agree. */ | |
3049 | ||
60b8c5b3 | 3050 | extern tree type_hash_canon (unsigned int, tree); |
d72a838e | 3051 | |
3052 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
3053 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
3054 | fields. Call this only once for any given decl node. | |
3055 | ||
3056 | Second argument is the boundary that this field can be assumed to | |
3057 | be starting at (in bits). Zero means it can be assumed aligned | |
3058 | on any boundary that may be needed. */ | |
3059 | ||
60b8c5b3 | 3060 | extern void layout_decl (tree, unsigned); |
d72a838e | 3061 | |
0fc6aef1 | 3062 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
3063 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
3064 | The value is BLKmode if no other mode is found. This is like | |
3065 | mode_for_size, but is passed a tree. */ | |
3066 | ||
60b8c5b3 | 3067 | extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int); |
0fc6aef1 | 3068 | |
d72a838e | 3069 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
3070 | ||
60b8c5b3 | 3071 | extern tree non_lvalue (tree); |
3072 | extern tree pedantic_non_lvalue (tree); | |
3073 | ||
3074 | extern tree convert (tree, tree); | |
3075 | extern unsigned int expr_align (tree); | |
3076 | extern tree expr_first (tree); | |
3077 | extern tree expr_last (tree); | |
4ee9c684 | 3078 | extern tree expr_only (tree); |
60b8c5b3 | 3079 | extern tree size_in_bytes (tree); |
3080 | extern HOST_WIDE_INT int_size_in_bytes (tree); | |
3081 | extern tree bit_position (tree); | |
3082 | extern HOST_WIDE_INT int_bit_position (tree); | |
3083 | extern tree byte_position (tree); | |
3084 | extern HOST_WIDE_INT int_byte_position (tree); | |
902de8ed | 3085 | |
3086 | /* Define data structures, macros, and functions for handling sizes | |
3087 | and the various types used to represent sizes. */ | |
3088 | ||
3089 | enum size_type_kind | |
3090 | { | |
88b5b080 | 3091 | SIZETYPE, /* Normal representation of sizes in bytes. */ |
3092 | SSIZETYPE, /* Signed representation of sizes in bytes. */ | |
902de8ed | 3093 | USIZETYPE, /* Unsigned representation of sizes in bytes. */ |
3094 | BITSIZETYPE, /* Normal representation of sizes in bits. */ | |
3095 | SBITSIZETYPE, /* Signed representation of sizes in bits. */ | |
91c82c20 | 3096 | UBITSIZETYPE, /* Unsigned representation of sizes in bits. */ |
902de8ed | 3097 | TYPE_KIND_LAST}; |
3098 | ||
1f3233d1 | 3099 | extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; |
902de8ed | 3100 | |
3101 | #define sizetype sizetype_tab[(int) SIZETYPE] | |
3102 | #define bitsizetype sizetype_tab[(int) BITSIZETYPE] | |
3103 | #define ssizetype sizetype_tab[(int) SSIZETYPE] | |
3104 | #define usizetype sizetype_tab[(int) USIZETYPE] | |
3105 | #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] | |
3106 | #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE] | |
3107 | ||
60b8c5b3 | 3108 | extern tree size_binop (enum tree_code, tree, tree); |
3109 | extern tree size_diffop (tree, tree); | |
3110 | extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind); | |
3111 | extern tree size_int_type_wide (HOST_WIDE_INT, tree); | |
b278476e | 3112 | |
902de8ed | 3113 | #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T) |
3114 | #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE) | |
3115 | #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE) | |
3116 | #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE) | |
3117 | #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE) | |
30384dcf | 3118 | |
60b8c5b3 | 3119 | extern tree round_up (tree, int); |
3120 | extern tree round_down (tree, int); | |
3121 | extern tree get_pending_sizes (void); | |
60b8c5b3 | 3122 | extern void put_pending_size (tree); |
3123 | extern void put_pending_sizes (tree); | |
d72a838e | 3124 | |
3125 | /* Type for sizes of data-type. */ | |
3126 | ||
30384dcf | 3127 | #define BITS_PER_UNIT_LOG \ |
3128 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
3129 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
3130 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
3131 | ||
88b5b080 | 3132 | /* If nonzero, an upper limit on alignment of structure fields, in bits. */ |
fe352cf1 | 3133 | extern unsigned int maximum_field_alignment; |
64233515 | 3134 | |
f712a0dc | 3135 | /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */ |
fe352cf1 | 3136 | extern unsigned int set_alignment; |
64233515 | 3137 | |
d72a838e | 3138 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
3139 | by making the last node in X point to Y. | |
3140 | Returns X, except if X is 0 returns Y. */ | |
3141 | ||
60b8c5b3 | 3142 | extern tree chainon (tree, tree); |
d72a838e | 3143 | |
3144 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
3145 | ||
674b05f5 | 3146 | extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); |
3147 | #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) | |
d72a838e | 3148 | |
3149 | /* Return the last tree node in a chain. */ | |
3150 | ||
60b8c5b3 | 3151 | extern tree tree_last (tree); |
d72a838e | 3152 | |
3153 | /* Reverse the order of elements in a chain, and return the new head. */ | |
3154 | ||
60b8c5b3 | 3155 | extern tree nreverse (tree); |
d72a838e | 3156 | |
3157 | /* Returns the length of a chain of nodes | |
3158 | (number of chain pointers to follow before reaching a null pointer). */ | |
3159 | ||
60b8c5b3 | 3160 | extern int list_length (tree); |
d72a838e | 3161 | |
efd3939c | 3162 | /* Returns the number of FIELD_DECLs in a type. */ |
3163 | ||
60b8c5b3 | 3164 | extern int fields_length (tree); |
efd3939c | 3165 | |
e19896a4 | 3166 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
3167 | aggregate of zeros. Otherwise return FALSE. */ | |
3168 | ||
60b8c5b3 | 3169 | extern bool initializer_zerop (tree); |
e19896a4 | 3170 | |
4ee9c684 | 3171 | extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *); |
3172 | extern HOST_WIDE_INT count_type_elements (tree); | |
957697db | 3173 | extern int mostly_zeros_p (tree); |
3174 | ||
4ee9c684 | 3175 | /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */ |
3176 | ||
3177 | extern void add_var_to_bind_expr (tree, tree); | |
3178 | ||
d72a838e | 3179 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ |
3180 | ||
60b8c5b3 | 3181 | extern int integer_zerop (tree); |
d72a838e | 3182 | |
3183 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ | |
3184 | ||
60b8c5b3 | 3185 | extern int integer_onep (tree); |
d72a838e | 3186 | |
3187 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
3188 | all of whose significant bits are 1. */ | |
3189 | ||
60b8c5b3 | 3190 | extern int integer_all_onesp (tree); |
d72a838e | 3191 | |
3192 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
3193 | exactly one bit 1. */ | |
3194 | ||
60b8c5b3 | 3195 | extern int integer_pow2p (tree); |
d72a838e | 3196 | |
805e22b2 | 3197 | /* integer_nonzerop (tree x) is nonzero if X is an integer constant |
3198 | with a nonzero value. */ | |
3199 | ||
60b8c5b3 | 3200 | extern int integer_nonzerop (tree); |
805e22b2 | 3201 | |
d72a838e | 3202 | /* staticp (tree x) is nonzero if X is a reference to data allocated |
3203 | at a fixed address in memory. */ | |
3204 | ||
60b8c5b3 | 3205 | extern int staticp (tree); |
d72a838e | 3206 | |
d72a838e | 3207 | /* save_expr (EXP) returns an expression equivalent to EXP |
3208 | but it can be used multiple times within context CTX | |
3209 | and only evaluate EXP once. */ | |
3210 | ||
60b8c5b3 | 3211 | extern tree save_expr (tree); |
d72a838e | 3212 | |
414bee42 | 3213 | /* Look inside EXPR and into any simple arithmetic operations. Return |
3214 | the innermost non-arithmetic node. */ | |
3215 | ||
60b8c5b3 | 3216 | extern tree skip_simple_arithmetic (tree); |
414bee42 | 3217 | |
bc280274 | 3218 | /* Returns the index of the first non-tree operand for CODE, or the number |
3219 | of operands if all are trees. */ | |
3220 | ||
60b8c5b3 | 3221 | extern int first_rtl_op (enum tree_code); |
bc280274 | 3222 | |
1f3233d1 | 3223 | /* Return which tree structure is used by T. */ |
3224 | ||
60b8c5b3 | 3225 | enum tree_node_structure_enum tree_node_structure (tree); |
1f3233d1 | 3226 | |
0e676ec9 | 3227 | /* unsave_expr (EXP) returns an expression equivalent to EXP but it |
4a2fac76 | 3228 | can be used multiple times and will evaluate EXP in its entirety |
0e676ec9 | 3229 | each time. */ |
3230 | ||
60b8c5b3 | 3231 | extern tree unsave_expr (tree); |
0e676ec9 | 3232 | |
de132707 | 3233 | /* Reset EXP in place so that it can be expanded again. Does not |
4a2fac76 | 3234 | recurse into subtrees. */ |
3235 | ||
60b8c5b3 | 3236 | extern void unsave_expr_1 (tree); |
4a2fac76 | 3237 | |
4f8af819 | 3238 | /* Return 0 if it is safe to evaluate EXPR multiple times, |
3239 | return 1 if it is safe if EXPR is unsaved afterward, or | |
3240 | return 2 if it is completely unsafe. */ | |
60b8c5b3 | 3241 | extern int unsafe_for_reeval (tree); |
c63e27d8 | 3242 | |
9f354f8d | 3243 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
3244 | or offset that depends on a field within a record. | |
3245 | ||
3246 | Note that we only allow such expressions within simple arithmetic | |
3247 | or a COND_EXPR. */ | |
3248 | ||
60b8c5b3 | 3249 | extern bool contains_placeholder_p (tree); |
ce3fb06e | 3250 | |
3251 | /* This macro calls the above function but short-circuits the common | |
3252 | case of a constant to save time. Also check for null. */ | |
3253 | ||
3254 | #define CONTAINS_PLACEHOLDER_P(EXP) \ | |
3255 | ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) | |
3256 | ||
3257 | /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR. | |
3258 | This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field | |
3259 | positions. */ | |
3260 | ||
60b8c5b3 | 3261 | extern bool type_contains_placeholder_p (tree); |
9f354f8d | 3262 | |
bc280274 | 3263 | /* Return 1 if EXP contains any expressions that produce cleanups for an |
3264 | outer scope to deal with. Used by fold. */ | |
3265 | ||
60b8c5b3 | 3266 | extern int has_cleanups (tree); |
bc280274 | 3267 | |
9f354f8d | 3268 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, |
3269 | return a tree with all occurrences of references to F in a | |
3270 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
3271 | contains only arithmetic expressions. */ | |
3272 | ||
60b8c5b3 | 3273 | extern tree substitute_in_expr (tree, tree, tree); |
9f354f8d | 3274 | |
55f9d7dc | 3275 | /* This macro calls the above function but short-circuits the common |
3276 | case of a constant to save time and also checks for NULL. */ | |
3277 | ||
3278 | #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ | |
3279 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) | |
3280 | ||
3281 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
3282 | for it within OBJ, a tree that is an object or a chain of references. */ | |
3283 | ||
3284 | extern tree substitute_placeholder_in_expr (tree, tree); | |
3285 | ||
3286 | /* This macro calls the above function but short-circuits the common | |
3287 | case of a constant to save time and also checks for NULL. */ | |
3288 | ||
3289 | #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ | |
3290 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ | |
3291 | : substitute_placeholder_in_expr (EXP, OBJ)) | |
3292 | ||
654995a1 | 3293 | /* variable_size (EXP) is like save_expr (EXP) except that it |
3294 | is for the special case of something that is part of a | |
3295 | variable size for a data type. It makes special arrangements | |
3296 | to compute the value at the right time when the data type | |
3297 | belongs to a function parameter. */ | |
3298 | ||
60b8c5b3 | 3299 | extern tree variable_size (tree); |
654995a1 | 3300 | |
ab7083b0 | 3301 | /* Given a type T, force elaboration of any SAVE_EXPRs used in the definition |
3302 | of that type. */ | |
3303 | ||
3304 | extern void force_type_save_exprs (tree); | |
3305 | ||
845bebef | 3306 | /* stabilize_reference (EXP) returns a reference equivalent to EXP |
d72a838e | 3307 | but it can be used multiple times |
3308 | and only evaluate the subexpressions once. */ | |
3309 | ||
60b8c5b3 | 3310 | extern tree stabilize_reference (tree); |
d72a838e | 3311 | |
1b6e6303 | 3312 | /* Subroutine of stabilize_reference; this is called for subtrees of |
3313 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
3314 | to ensure that it is only evaluated once. */ | |
3315 | ||
60b8c5b3 | 3316 | extern tree stabilize_reference_1 (tree); |
1b6e6303 | 3317 | |
d72a838e | 3318 | /* Return EXP, stripped of any conversions to wider types |
3319 | in such a way that the result of converting to type FOR_TYPE | |
3320 | is the same as if EXP were converted to FOR_TYPE. | |
3321 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
3322 | ||
60b8c5b3 | 3323 | extern tree get_unwidened (tree, tree); |
d72a838e | 3324 | |
3325 | /* Return OP or a simpler expression for a narrower value | |
3326 | which can be sign-extended or zero-extended to give back OP. | |
3327 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
3328 | or 0 if the value should be sign-extended. */ | |
3329 | ||
60b8c5b3 | 3330 | extern tree get_narrower (tree, int *); |
d72a838e | 3331 | |
d72a838e | 3332 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, |
3333 | look for nested component-refs or array-refs at constant positions | |
3334 | and find the ultimate containing object, which is returned. */ | |
3335 | ||
60b8c5b3 | 3336 | extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
3337 | tree *, enum machine_mode *, int *, int *); | |
d72a838e | 3338 | |
f96c43fb | 3339 | /* Return 1 if T is an expression that get_inner_reference handles. */ |
3340 | ||
60b8c5b3 | 3341 | extern int handled_component_p (tree); |
f96c43fb | 3342 | |
804dff30 | 3343 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
3344 | NUL_TREE if there is no containing scope. */ | |
3345 | ||
60b8c5b3 | 3346 | extern tree get_containing_scope (tree); |
804dff30 | 3347 | |
d72a838e | 3348 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
3349 | or zero if none. */ | |
60b8c5b3 | 3350 | extern tree decl_function_context (tree); |
d72a838e | 3351 | |
7dd9d898 | 3352 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
3353 | this _DECL with its context, or zero if none. */ | |
60b8c5b3 | 3354 | extern tree decl_type_context (tree); |
d72a838e | 3355 | |
03f2a1be | 3356 | /* Return 1 if EXPR is the real constant zero. */ |
60b8c5b3 | 3357 | extern int real_zerop (tree); |
d72a838e | 3358 | \f |
3359 | /* Declare commonly used variables for tree structure. */ | |
3360 | ||
b3034b6d | 3361 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
3362 | Zero means allow extended lvalues. */ | |
3363 | ||
3364 | extern int pedantic_lvalues; | |
3365 | ||
d72a838e | 3366 | /* Nonzero means can safely call expand_expr now; |
3367 | otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ | |
3368 | ||
3369 | extern int immediate_size_expand; | |
3370 | ||
88b5b080 | 3371 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ |
d72a838e | 3372 | |
1f3233d1 | 3373 | extern GTY(()) tree current_function_decl; |
d72a838e | 3374 | |
d0309f39 | 3375 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
1f3233d1 | 3376 | extern GTY(()) tree current_function_func_begin_label; |
d0309f39 | 3377 | |
4ee9c684 | 3378 | /* A DECL for the current file-scope context. When using IMA, this heads a |
3379 | chain of FILE_DECLs; currently only C uses it. */ | |
3380 | ||
3381 | extern GTY(()) tree current_file_decl; | |
3382 | ||
d72a838e | 3383 | /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ |
3384 | ||
3385 | extern int all_types_permanent; | |
3386 | ||
d61095a9 | 3387 | /* Exit a binding level. This function is provided by each language |
3388 | frontend. */ | |
3389 | extern tree poplevel (int, int, int); | |
3390 | ||
8305149e | 3391 | /* Declare a predefined function. Return the declaration. This function is |
3392 | provided by each language frontend. */ | |
60b8c5b3 | 3393 | extern tree builtin_function (const char *, tree, int, enum built_in_class, |
3394 | const char *, tree); | |
d72a838e | 3395 | \f |
bb02c0b3 | 3396 | /* In tree.c */ |
eac18265 | 3397 | extern unsigned crc32_string (unsigned, const char *); |
60b8c5b3 | 3398 | extern void clean_symbol_name (char *); |
3399 | extern tree get_file_function_name_long (const char *); | |
3400 | extern tree get_set_constructor_bits (tree, char *, int); | |
3401 | extern tree get_set_constructor_bytes (tree, unsigned char *, int); | |
3402 | extern tree get_callee_fndecl (tree); | |
681a883f | 3403 | extern void change_decl_assembler_name (tree, tree); |
60b8c5b3 | 3404 | extern int type_num_arguments (tree); |
3405 | extern tree lhd_unsave_expr_now (tree); | |
4ee9c684 | 3406 | extern bool is_essa_node (tree); |
21dff555 | 3407 | extern bool associative_tree_code (enum tree_code); |
3408 | extern bool commutative_tree_code (enum tree_code); | |
1d347c23 | 3409 | |
bb02c0b3 | 3410 | \f |
d72a838e | 3411 | /* In stmt.c */ |
3412 | ||
60b8c5b3 | 3413 | extern void expand_fixups (rtx); |
3414 | extern tree expand_start_stmt_expr (int); | |
3415 | extern tree expand_end_stmt_expr (tree); | |
3416 | extern void expand_expr_stmt (tree); | |
3417 | extern void expand_expr_stmt_value (tree, int, int); | |
3418 | extern int warn_if_unused_value (tree); | |
3419 | extern void expand_decl_init (tree); | |
3420 | extern void clear_last_expr (void); | |
3421 | extern void expand_label (tree); | |
3422 | extern void expand_goto (tree); | |
3423 | extern void expand_asm (tree, int); | |
3424 | extern void expand_start_cond (tree, int); | |
3425 | extern void expand_end_cond (void); | |
3426 | extern void expand_start_else (void); | |
3427 | extern void expand_start_elseif (tree); | |
60b8c5b3 | 3428 | |
4ee9c684 | 3429 | extern void expand_stack_alloc (tree, tree); |
3430 | extern rtx expand_stack_save (void); | |
3431 | extern void expand_stack_restore (tree); | |
60b8c5b3 | 3432 | extern void expand_return (tree); |
60b8c5b3 | 3433 | extern void expand_start_bindings_and_block (int, tree); |
89689e23 | 3434 | #define expand_start_bindings(flags) \ |
3435 | expand_start_bindings_and_block(flags, NULL_TREE) | |
60b8c5b3 | 3436 | extern void expand_end_bindings (tree, int, int); |
3437 | extern void warn_about_unused_variables (tree); | |
3438 | extern void start_cleanup_deferral (void); | |
3439 | extern void end_cleanup_deferral (void); | |
3440 | extern int is_body_block (tree); | |
3441 | ||
3442 | extern int conditional_context (void); | |
3443 | extern struct nesting * current_nesting_level (void); | |
3444 | extern tree last_cleanup_this_contour (void); | |
3445 | extern void expand_start_case (int, tree, tree, const char *); | |
3446 | extern void expand_end_case_type (tree, tree); | |
79dc3b8e | 3447 | #define expand_end_case(cond) expand_end_case_type (cond, NULL) |
4ee9c684 | 3448 | extern int add_case_node (tree, tree, tree, tree *, bool); |
60b8c5b3 | 3449 | extern int pushcase (tree, tree (*) (tree, tree), tree, tree *); |
3450 | extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *); | |
3451 | extern void using_eh_for_cleanups (void); | |
d72a838e | 3452 | |
3453 | /* In fold-const.c */ | |
3454 | ||
9239a87e | 3455 | /* Fold constants as much as possible in an expression. |
3456 | Returns the simplified expression. | |
3457 | Acts only on the top level of the expression; | |
3458 | if the argument itself cannot be simplified, its | |
3459 | subexpressions are not changed. */ | |
3460 | ||
60b8c5b3 | 3461 | extern tree fold (tree); |
276beea2 | 3462 | extern tree fold_initializer (tree); |
d7aeca92 | 3463 | extern tree fold_convert (tree, tree); |
60b8c5b3 | 3464 | extern tree fold_single_bit_test (enum tree_code, tree, tree, tree); |
3465 | ||
3466 | extern int force_fit_type (tree, int); | |
3467 | extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3468 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3469 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3470 | extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3471 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3472 | extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3473 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3474 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3475 | extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3476 | HOST_WIDE_INT, unsigned int, | |
3477 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3478 | extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3479 | HOST_WIDE_INT, unsigned int, | |
3480 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3481 | extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3482 | HOST_WIDE_INT, unsigned int, | |
3483 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3484 | extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3485 | HOST_WIDE_INT, unsigned int, | |
3486 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3487 | ||
3488 | extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT, | |
3489 | HOST_WIDE_INT, unsigned HOST_WIDE_INT, | |
3490 | HOST_WIDE_INT, unsigned HOST_WIDE_INT *, | |
3491 | HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, | |
3492 | HOST_WIDE_INT *); | |
3493 | ||
4ee9c684 | 3494 | enum operand_equal_flag |
3495 | { | |
3496 | OEP_ONLY_CONST = 1, | |
3497 | OEP_PURE_SAME = 2 | |
3498 | }; | |
3499 | ||
3500 | extern int operand_equal_p (tree, tree, unsigned int); | |
3501 | ||
60b8c5b3 | 3502 | extern tree omit_one_operand (tree, tree, tree); |
3503 | extern tree invert_truthvalue (tree); | |
4ee9c684 | 3504 | extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree); |
3505 | extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
3506 | extern tree fold_read_from_constant_string (tree); | |
3507 | extern tree int_const_binop (enum tree_code, tree, tree, int); | |
fcdd3ab3 | 3508 | extern tree build_fold_addr_expr (tree); |
3509 | extern tree build_fold_addr_expr_with_type (tree, tree); | |
3510 | extern tree build_fold_indirect_ref (tree); | |
e94026da | 3511 | |
805e22b2 | 3512 | /* In builtins.c */ |
60b8c5b3 | 3513 | extern tree fold_builtin (tree); |
3514 | extern enum built_in_function builtin_mathfn_code (tree); | |
3515 | extern tree build_function_call_expr (tree, tree); | |
3516 | extern tree mathfn_built_in (tree, enum built_in_function fn); | |
4ee9c684 | 3517 | extern tree strip_float_extensions (tree); |
3518 | extern tree simplify_builtin (tree, int); | |
3519 | extern tree c_strlen (tree, int); | |
03f2a1be | 3520 | |
8cce4b41 | 3521 | /* In convert.c */ |
60b8c5b3 | 3522 | extern tree strip_float_extensions (tree); |
8cce4b41 | 3523 | |
9501a338 | 3524 | /* In alias.c */ |
60b8c5b3 | 3525 | extern void record_component_aliases (tree); |
3526 | extern HOST_WIDE_INT get_alias_set (tree); | |
3527 | extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); | |
c1628b55 | 3528 | extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); |
60b8c5b3 | 3529 | extern int readonly_fields_p (tree); |
3530 | extern int objects_must_conflict_p (tree, tree); | |
83de9b44 | 3531 | |
f52f7b9e | 3532 | /* In tree.c */ |
60b8c5b3 | 3533 | extern int really_constant_p (tree); |
3534 | extern int int_fits_type_p (tree, tree); | |
3535 | extern bool variably_modified_type_p (tree); | |
3536 | extern int tree_log2 (tree); | |
3537 | extern int tree_floor_log2 (tree); | |
3538 | extern int simple_cst_equal (tree, tree); | |
3539 | extern unsigned int iterative_hash_expr (tree, unsigned int); | |
3540 | extern int compare_tree_int (tree, unsigned HOST_WIDE_INT); | |
3541 | extern int type_list_equal (tree, tree); | |
3542 | extern int chain_member (tree, tree); | |
3543 | extern tree type_hash_lookup (unsigned int, tree); | |
3544 | extern void type_hash_add (unsigned int, tree); | |
60b8c5b3 | 3545 | extern int simple_cst_list_equal (tree, tree); |
3546 | extern void dump_tree_statistics (void); | |
3547 | extern void expand_function_end (void); | |
3548 | extern void expand_function_start (tree, int); | |
3549 | extern void expand_pending_sizes (tree); | |
4ee9c684 | 3550 | extern void recompute_tree_invarant_for_addr_expr (tree); |
3551 | extern bool needs_to_live_in_memory (tree); | |
3552 | extern tree make_vector (enum machine_mode, tree, int); | |
409a160c | 3553 | extern tree reconstruct_complex_type (tree, tree); |
60b8c5b3 | 3554 | |
3555 | extern int real_onep (tree); | |
3556 | extern int real_twop (tree); | |
3557 | extern int real_minus_onep (tree); | |
3558 | extern void init_ttree (void); | |
3559 | extern void build_common_tree_nodes (int); | |
3560 | extern void build_common_tree_nodes_2 (int); | |
3561 | extern tree build_range_type (tree, tree, tree); | |
f52f7b9e | 3562 | |
3563 | /* In function.c */ | |
60b8c5b3 | 3564 | extern void setjmp_protect_args (void); |
3565 | extern void setjmp_protect (tree); | |
3566 | extern void expand_main_function (void); | |
3567 | extern void init_dummy_function_start (void); | |
3568 | extern void expand_dummy_function_end (void); | |
3569 | extern void init_function_for_compilation (void); | |
ecc82929 | 3570 | extern void allocate_struct_function (tree); |
60b8c5b3 | 3571 | extern void init_function_start (tree); |
3572 | extern void assign_parms (tree); | |
3573 | extern void put_var_into_stack (tree, int); | |
3574 | extern void flush_addressof (tree); | |
4ee9c684 | 3575 | extern void setjmp_vars_warning (tree); |
60b8c5b3 | 3576 | extern void setjmp_args_warning (void); |
60b8c5b3 | 3577 | extern void init_temp_slots (void); |
3578 | extern void combine_temp_slots (void); | |
3579 | extern void free_temp_slots (void); | |
3580 | extern void pop_temp_slots (void); | |
3581 | extern void push_temp_slots (void); | |
3582 | extern void preserve_temp_slots (rtx); | |
3583 | extern void preserve_rtl_expr_temps (tree); | |
45550790 | 3584 | extern int aggregate_value_p (tree, tree); |
60b8c5b3 | 3585 | extern void free_temps_for_rtl_expr (tree); |
3586 | extern void instantiate_virtual_regs (tree, rtx); | |
3587 | extern void unshare_all_rtl (tree, rtx); | |
3588 | extern void push_function_context (void); | |
3589 | extern void pop_function_context (void); | |
3590 | extern void push_function_context_to (tree); | |
3591 | extern void pop_function_context_from (tree); | |
f52f7b9e | 3592 | |
3593 | /* In print-rtl.c */ | |
3594 | #ifdef BUFSIZ | |
60b8c5b3 | 3595 | extern void print_rtl (FILE *, rtx); |
f52f7b9e | 3596 | #endif |
3597 | ||
3598 | /* In print-tree.c */ | |
60b8c5b3 | 3599 | extern void debug_tree (tree); |
f52f7b9e | 3600 | #ifdef BUFSIZ |
60b8c5b3 | 3601 | extern void print_node (FILE *, const char *, tree, int); |
3602 | extern void print_node_brief (FILE *, const char *, tree, int); | |
3603 | extern void indent_to (FILE *, int); | |
f52f7b9e | 3604 | #endif |
3605 | ||
3606 | /* In expr.c */ | |
60b8c5b3 | 3607 | extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx); |
3608 | extern void check_max_integer_computation_mode (tree); | |
f52f7b9e | 3609 | |
3610 | /* In emit-rtl.c */ | |
60b8c5b3 | 3611 | extern void start_sequence_for_rtl_expr (tree); |
bccd9980 | 3612 | extern rtx emit_line_note (location_t); |
f52f7b9e | 3613 | |
302bf7ba | 3614 | /* In calls.c */ |
dfe08167 | 3615 | |
79c31609 | 3616 | /* Nonzero if this is a call to a `const' function. */ |
3617 | #define ECF_CONST 1 | |
3618 | /* Nonzero if this is a call to a `volatile' function. */ | |
3619 | #define ECF_NORETURN 2 | |
3620 | /* Nonzero if this is a call to malloc or a related function. */ | |
3621 | #define ECF_MALLOC 4 | |
3622 | /* Nonzero if it is plausible that this is a call to alloca. */ | |
3623 | #define ECF_MAY_BE_ALLOCA 8 | |
3624 | /* Nonzero if this is a call to a function that won't throw an exception. */ | |
3625 | #define ECF_NOTHROW 16 | |
3626 | /* Nonzero if this is a call to setjmp or a related function. */ | |
3627 | #define ECF_RETURNS_TWICE 32 | |
3628 | /* Nonzero if this is a call to `longjmp'. */ | |
3629 | #define ECF_LONGJMP 64 | |
3630 | /* Nonzero if this is a syscall that makes a new process in the image of | |
3631 | the current one. */ | |
73673831 | 3632 | #define ECF_SIBCALL 128 |
79c31609 | 3633 | /* Nonzero if this is a call to "pure" function (like const function, |
3634 | but may read memory. */ | |
73673831 | 3635 | #define ECF_PURE 256 |
79c31609 | 3636 | /* Nonzero if this is a call to a function that returns with the stack |
3637 | pointer depressed. */ | |
73673831 | 3638 | #define ECF_SP_DEPRESSED 512 |
79c31609 | 3639 | /* Nonzero if this call is known to always return. */ |
73673831 | 3640 | #define ECF_ALWAYS_RETURN 1024 |
79c31609 | 3641 | /* Create libcall block around the call. */ |
73673831 | 3642 | #define ECF_LIBCALL_BLOCK 2048 |
79c31609 | 3643 | |
60b8c5b3 | 3644 | extern int flags_from_decl_or_type (tree); |
886a914d | 3645 | extern int call_expr_flags (tree); |
79c31609 | 3646 | |
60b8c5b3 | 3647 | extern int setjmp_call_p (tree); |
3648 | extern bool alloca_call_p (tree); | |
302bf7ba | 3649 | |
e3f6ce11 | 3650 | /* In attribs.c. */ |
434712c4 | 3651 | |
3652 | /* Process the attributes listed in ATTRIBUTES and install them in *NODE, | |
3653 | which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, | |
3654 | it should be modified in place; if a TYPE, a copy should be created | |
3655 | unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further | |
3656 | information, in the form of a bitwise OR of flags in enum attribute_flags | |
3657 | from tree.h. Depending on these flags, some attributes may be | |
3658 | returned to be applied at a later stage (for example, to apply | |
3659 | a decl attribute to the declaration rather than to its type). */ | |
aecda0d6 | 3660 | extern tree decl_attributes (tree *, tree, int); |
e3f6ce11 | 3661 | |
f52f7b9e | 3662 | /* In integrate.c */ |
60b8c5b3 | 3663 | extern void set_decl_abstract_flags (tree, int); |
60b8c5b3 | 3664 | extern void set_decl_origin_self (tree); |
f52f7b9e | 3665 | |
f52f7b9e | 3666 | /* In stor-layout.c */ |
ee1ab431 | 3667 | extern void set_min_and_max_values_for_integral_type (tree, int, bool); |
60b8c5b3 | 3668 | extern void fixup_signed_type (tree); |
3669 | extern void internal_reference_types (void); | |
4ee9c684 | 3670 | extern unsigned int update_alignment_for_field (record_layout_info, tree, |
3671 | unsigned int); | |
f52f7b9e | 3672 | /* varasm.c */ |
60b8c5b3 | 3673 | extern void make_decl_rtl (tree, const char *); |
3674 | extern void make_decl_one_only (tree); | |
3675 | extern int supports_one_only (void); | |
3676 | extern void variable_section (tree, int); | |
3677 | enum tls_model decl_tls_model (tree); | |
60b8c5b3 | 3678 | extern void resolve_unique_section (tree, int, int); |
3679 | extern void mark_referenced (tree); | |
4490a821 | 3680 | extern void mark_decl_referenced (tree); |
3cad5dd7 | 3681 | extern void notice_global_symbol (tree); |
f52f7b9e | 3682 | |
f52f7b9e | 3683 | /* In stmt.c */ |
60b8c5b3 | 3684 | extern void emit_nop (void); |
3685 | extern void expand_computed_goto (tree); | |
3686 | extern bool parse_output_constraint (const char **, int, int, int, | |
3687 | bool *, bool *, bool *); | |
d7e38994 | 3688 | extern bool parse_input_constraint (const char **, int, int, int, int, |
3689 | const char * const *, bool *, bool *); | |
867bd639 | 3690 | extern void expand_asm_operands (tree, tree, tree, tree, int, location_t); |
4ee9c684 | 3691 | extern void expand_asm_expr (tree); |
3692 | extern bool asm_op_is_mem_input (tree, tree); | |
ef13e68f | 3693 | extern tree resolve_asm_operand_names (tree, tree, tree); |
60b8c5b3 | 3694 | extern int any_pending_cleanups (void); |
3695 | extern void init_stmt_for_function (void); | |
3696 | extern void expand_start_target_temps (void); | |
3697 | extern void expand_end_target_temps (void); | |
3698 | extern void expand_elseif (tree); | |
3699 | extern void save_stack_pointer (void); | |
3700 | extern void expand_decl (tree); | |
3701 | extern int expand_decl_cleanup (tree, tree); | |
3702 | extern int expand_decl_cleanup_eh (tree, tree, int); | |
3703 | extern void expand_anon_union_decl (tree, tree, tree); | |
4ee9c684 | 3704 | extern int containing_blocks_have_cleanups_or_stack_level (void); |
3705 | ||
3706 | /* In gimplify.c. */ | |
3707 | extern tree create_artificial_label (void); | |
3708 | extern void gimplify_function_tree (tree); | |
3709 | extern const char *get_name (tree); | |
3710 | extern tree unshare_expr (tree); | |
da41aa8e | 3711 | extern void sort_case_labels (tree); |
f52f7b9e | 3712 | |
c0c62896 | 3713 | /* If KIND=='I', return a suitable global initializer (constructor) name. |
3714 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
60b8c5b3 | 3715 | extern tree get_file_function_name (int); |
a50b6670 | 3716 | \f |
3717 | /* Interface of the DWARF2 unwind info support. */ | |
3718 | ||
a50b6670 | 3719 | /* Generate a new label for the CFI info to refer to. */ |
3720 | ||
60b8c5b3 | 3721 | extern char *dwarf2out_cfi_label (void); |
a50b6670 | 3722 | |
3723 | /* Entry point to update the canonical frame address (CFA). */ | |
3724 | ||
c043c821 | 3725 | extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); |
a50b6670 | 3726 | |
3727 | /* Add the CFI for saving a register window. */ | |
3728 | ||
60b8c5b3 | 3729 | extern void dwarf2out_window_save (const char *); |
a50b6670 | 3730 | |
3731 | /* Add a CFI to update the running total of the size of arguments pushed | |
3732 | onto the stack. */ | |
3733 | ||
c043c821 | 3734 | extern void dwarf2out_args_size (const char *, HOST_WIDE_INT); |
a50b6670 | 3735 | |
3736 | /* Entry point for saving a register to the stack. */ | |
3737 | ||
c043c821 | 3738 | extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); |
a50b6670 | 3739 | |
3740 | /* Entry point for saving the return address in the stack. */ | |
3741 | ||
c043c821 | 3742 | extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); |
a50b6670 | 3743 | |
3744 | /* Entry point for saving the return address in a register. */ | |
3745 | ||
60b8c5b3 | 3746 | extern void dwarf2out_return_reg (const char *, unsigned); |
a50b6670 | 3747 | |
4ee9c684 | 3748 | /* The type of a callback function for walking over tree structure. */ |
1431bff6 | 3749 | |
60b8c5b3 | 3750 | typedef tree (*walk_tree_fn) (tree *, int *, void *); |
4ee9c684 | 3751 | tree walk_tree (tree*, walk_tree_fn, void*, void*); |
3752 | tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*); | |
1431bff6 | 3753 | |
3119c950 | 3754 | /* In tree-dump.c */ |
3755 | ||
3756 | /* Different tree dump places. When you add new tree dump places, | |
4ee9c684 | 3757 | extend the DUMP_FILES array in tree-dump.c. */ |
3119c950 | 3758 | enum tree_dump_index |
3759 | { | |
4ee9c684 | 3760 | TDI_none, /* No dump */ |
3761 | TDI_tu, /* dump the whole translation unit. */ | |
3762 | TDI_class, /* dump class hierarchy. */ | |
3119c950 | 3763 | TDI_original, /* dump each function before optimizing it */ |
4ee9c684 | 3764 | TDI_generic, /* dump each function after genericizing it */ |
3765 | TDI_nested, /* dump each function after unnesting it */ | |
3119c950 | 3766 | TDI_inlined, /* dump each function after inlining |
3767 | within it. */ | |
4ee9c684 | 3768 | TDI_vcg, /* create a VCG graph file for each |
3769 | function's flowgraph. */ | |
0bed3869 | 3770 | TDI_xml, /* dump function call graph. */ |
4ee9c684 | 3771 | TDI_all, /* enable all the dumps. */ |
3119c950 | 3772 | TDI_end |
3773 | }; | |
3774 | ||
3775 | /* Bit masks to control tree dumping. Not all values are applicable to | |
3776 | all tree dumps. Add new ones at the end. When you define new | |
3777 | values, extend the DUMP_OPTIONS array in tree-dump.c */ | |
3778 | #define TDF_ADDRESS (1 << 0) /* dump node addresses */ | |
3779 | #define TDF_SLIM (1 << 1) /* don't go wild following links */ | |
4ee9c684 | 3780 | #define TDF_RAW (1 << 2) /* don't unparse the function */ |
3781 | #define TDF_DETAILS (1 << 3) /* show more detailed info about | |
3782 | each pass */ | |
3783 | #define TDF_STATS (1 << 4) /* dump various statistics about | |
3784 | each pass */ | |
3785 | #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */ | |
3786 | #define TDF_VOPS (1 << 6) /* display virtual operands */ | |
3787 | #define TDF_LINENO (1 << 7) /* display statement line numbers */ | |
3788 | #define TDF_UID (1 << 8) /* display decl UIDs */ | |
3789 | ||
3119c950 | 3790 | |
3791 | typedef struct dump_info *dump_info_p; | |
3792 | ||
60b8c5b3 | 3793 | extern int dump_flag (dump_info_p, int, tree); |
3794 | extern int dump_enabled_p (enum tree_dump_index); | |
3795 | extern FILE *dump_begin (enum tree_dump_index, int *); | |
3796 | extern void dump_end (enum tree_dump_index, FILE *); | |
3797 | extern void dump_node (tree, int, FILE *); | |
3798 | extern int dump_switch_p (const char *); | |
3799 | extern const char *dump_flag_name (enum tree_dump_index); | |
ca74b940 | 3800 | /* Assign the RTX to declaration. */ |
3801 | ||
60b8c5b3 | 3802 | extern void set_decl_rtl (tree, rtx); |
ebfc27f5 | 3803 | extern void set_decl_incoming_rtl (tree, rtx); |
bdcbc557 | 3804 | \f |
dda90815 | 3805 | /* Redefine abort to report an internal error w/o coredump, and |
3806 | reporting the location of the error in the source file. This logic | |
3807 | is duplicated in rtl.h and tree.h because every file that needs the | |
3808 | special abort includes one or both. toplev.h gets too few files, | |
3809 | system.h gets too many. */ | |
3810 | ||
60b8c5b3 | 3811 | extern void fancy_abort (const char *, int, const char *) |
dda90815 | 3812 | ATTRIBUTE_NORETURN; |
19fafbd3 | 3813 | #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__) |
b229f760 | 3814 | |
b7257530 | 3815 | /* Enum and arrays used for tree allocation stats. |
b4b174c3 | 3816 | Keep in sync with tree.c:tree_node_kind_names. */ |
b7257530 | 3817 | typedef enum |
3818 | { | |
3819 | d_kind, | |
3820 | t_kind, | |
3821 | b_kind, | |
3822 | s_kind, | |
3823 | r_kind, | |
3824 | e_kind, | |
3825 | c_kind, | |
3826 | id_kind, | |
3827 | perm_list_kind, | |
3828 | temp_list_kind, | |
3829 | vec_kind, | |
4ee9c684 | 3830 | phi_kind, |
3831 | ssa_name_kind, | |
b7257530 | 3832 | x_kind, |
3833 | lang_decl, | |
3834 | lang_type, | |
3835 | all_kinds | |
3836 | } tree_node_kind; | |
3837 | ||
3838 | extern int tree_node_counts[]; | |
3839 | extern int tree_node_sizes[]; | |
4ee9c684 | 3840 | |
3841 | /* True if we are in gimple form and the actions of the folders need to | |
3842 | be restricted. False if we are not in gimple form and folding is not | |
3843 | restricted to creating gimple expressions. */ | |
3844 | extern bool in_gimple_form; | |
b7257530 | 3845 | |
b229f760 | 3846 | #endif /* GCC_TREE_H */ |