]>
Commit | Line | Data |
---|---|---|
8da1b058 | 1 | /* Front-end tree definitions for GNU compiler. |
1574ef13 | 2 | Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
1e2d4dc1 | 3 | 2001, 2002, 2003, 2004 Free Software Foundation, Inc. |
8da1b058 | 4 | |
1322177d | 5 | This file is part of GCC. |
8da1b058 | 6 | |
1322177d LB |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
8da1b058 | 11 | |
1322177d LB |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
8da1b058 RS |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d LB |
18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
8da1b058 | 21 | |
df89f8e7 GDR |
22 | #ifndef GCC_TREE_H |
23 | #define GCC_TREE_H | |
24 | ||
8da1b058 | 25 | #include "machmode.h" |
6060edcb | 26 | #include "input.h" |
b9dcdee4 | 27 | #include "statistics.h" |
fa743e8c | 28 | #include "vec.h" |
8da1b058 | 29 | |
d6b12657 | 30 | /* Codes of tree nodes */ |
8da1b058 RS |
31 | |
32 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
33 | ||
34 | enum tree_code { | |
35 | #include "tree.def" | |
36 | ||
6dc42e49 | 37 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
cdc9d803 | 38 | NUM_TREE_CODES. */ |
8da1b058 RS |
39 | }; |
40 | ||
41 | #undef DEFTREECODE | |
42 | ||
8d5e6e25 RK |
43 | /* Number of language-independent tree codes. */ |
44 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
8da1b058 | 45 | |
6615c446 JO |
46 | /* Tree code classes. */ |
47 | ||
48 | /* Each tree_code has an associated code class represented by a | |
49 | TREE_CODE_CLASS. */ | |
50 | ||
51 | enum tree_code_class { | |
52 | tcc_exceptional, /* An exceptional code (fits no category). */ | |
53 | tcc_constant, /* A constant. */ | |
54 | tcc_type, /* A type object code. */ | |
55 | tcc_declaration, /* A declaration (also serving as variable refs). */ | |
56 | tcc_reference, /* A reference to storage. */ | |
57 | tcc_comparison, /* A comparison expression. */ | |
58 | tcc_unary, /* A unary arithmetic expression. */ | |
59 | tcc_binary, /* A binary arithmetic expression. */ | |
60 | tcc_statement, /* A statement expression, which have side effects | |
61 | but usually no interesting value. */ | |
62 | tcc_expression /* Any other expression. */ | |
63 | }; | |
64 | ||
65 | /* Each tree code class has an associated string representation. | |
66 | These must correspond to the tree_code_class entries. */ | |
67 | ||
b85e3643 | 68 | extern const char *const tree_code_class_strings[]; |
6615c446 JO |
69 | |
70 | /* Returns the string representing CLASS. */ | |
71 | ||
72 | #define TREE_CODE_CLASS_STRING(CLASS)\ | |
73 | tree_code_class_strings[(int) (CLASS)] | |
8da1b058 | 74 | |
0a6969ad | 75 | #define MAX_TREE_CODES 256 |
6615c446 | 76 | extern const enum tree_code_class tree_code_type[]; |
0a6969ad | 77 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
8da1b058 | 78 | |
6615c446 JO |
79 | /* Nonzero if CODE represents an exceptional code. */ |
80 | ||
81 | #define EXCEPTIONAL_CLASS_P(CODE)\ | |
82 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) | |
83 | ||
84 | /* Nonzero if CODE represents a constant. */ | |
85 | ||
86 | #define CONSTANT_CLASS_P(CODE)\ | |
87 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) | |
88 | ||
89 | /* Nonzero if CODE represents a type. */ | |
90 | ||
91 | #define TYPE_P(CODE)\ | |
92 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) | |
93 | ||
94 | /* Nonzero if CODE represents a declaration. */ | |
95 | ||
96 | #define DECL_P(CODE)\ | |
97 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) | |
98 | ||
99 | /* Nonzero if CODE represents a reference. */ | |
100 | ||
101 | #define REFERENCE_CLASS_P(CODE)\ | |
102 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) | |
103 | ||
104 | /* Nonzero if CODE represents a comparison. */ | |
105 | ||
106 | #define COMPARISON_CLASS_P(CODE)\ | |
107 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) | |
108 | ||
109 | /* Nonzero if CODE represents a unary arithmetic expression. */ | |
110 | ||
111 | #define UNARY_CLASS_P(CODE)\ | |
112 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) | |
113 | ||
114 | /* Nonzero if CODE represents a binary arithmetic expression. */ | |
115 | ||
116 | #define BINARY_CLASS_P(CODE)\ | |
117 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) | |
118 | ||
119 | /* Nonzero if CODE represents a statement expression. */ | |
120 | ||
121 | #define STATEMENT_CLASS_P(CODE)\ | |
122 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) | |
123 | ||
124 | /* Nonzero if CODE represents any other expression. */ | |
125 | ||
126 | #define EXPRESSION_CLASS_P(CODE)\ | |
127 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) | |
128 | ||
9cf737f8 | 129 | /* Returns nonzero iff CLASS is not the tree code of a type. */ |
4f976745 | 130 | |
6615c446 JO |
131 | #define IS_NON_TYPE_CODE_CLASS(CLASS) ((CLASS) != tcc_type) |
132 | ||
133 | /* Returns nonzero iff CODE represents a type or declaration. */ | |
134 | ||
135 | #define IS_TYPE_OR_DECL_P(CODE)\ | |
136 | (TYPE_P (CODE) || DECL_P (CODE)) | |
4f976745 | 137 | |
0e9e1e0a | 138 | /* Returns nonzero iff CLASS is the tree-code class of an |
4da05956 MM |
139 | expression. */ |
140 | ||
6615c446 JO |
141 | #define IS_EXPR_CODE_CLASS(CLASS)\ |
142 | (((CLASS) >= tcc_reference) && ((CLASS) <= tcc_expression)) | |
c25d44dd JM |
143 | |
144 | /* Returns nonzero iff NODE is an expression of some kind. */ | |
145 | ||
146 | #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) | |
4da05956 | 147 | |
8da1b058 RS |
148 | /* Number of argument-words in each kind of tree-node. */ |
149 | ||
2f9834e8 | 150 | extern const unsigned char tree_code_length[]; |
8d5e6e25 | 151 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
8da1b058 RS |
152 | |
153 | /* Names of tree components. */ | |
154 | ||
2f9834e8 | 155 | extern const char *const tree_code_name[]; |
fa743e8c | 156 | |
4c254e68 NS |
157 | /* A garbage collected vector of trees. */ |
158 | DEF_VEC_GC_P(tree); | |
fa743e8c | 159 | |
8da1b058 | 160 | \f |
9df2c88c RK |
161 | /* Classify which part of the compiler has defined a given builtin function. |
162 | Note that we assume below that this is no more than two bits. */ | |
26db82d8 BS |
163 | enum built_in_class |
164 | { | |
165 | NOT_BUILT_IN = 0, | |
166 | BUILT_IN_FRONTEND, | |
167 | BUILT_IN_MD, | |
168 | BUILT_IN_NORMAL | |
169 | }; | |
9df2c88c RK |
170 | |
171 | /* Names for the above. */ | |
fd05eb80 | 172 | extern const char *const built_in_class_names[4]; |
9df2c88c | 173 | |
8da1b058 RS |
174 | /* Codes that identify the various built in functions |
175 | so that expand_call can identify them quickly. */ | |
176 | ||
272f51a3 | 177 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM, |
8da1b058 RS |
178 | enum built_in_function |
179 | { | |
cb1072f4 | 180 | #include "builtins.def" |
972ded9c | 181 | |
2ba84f36 | 182 | /* Upper bound on non-language-specific builtins. */ |
972ded9c | 183 | END_BUILTINS |
8da1b058 | 184 | }; |
cb1072f4 | 185 | #undef DEF_BUILTIN |
9df2c88c RK |
186 | |
187 | /* Names for the above. */ | |
fd05eb80 | 188 | extern const char *const built_in_names[(int) END_BUILTINS]; |
3ff5f682 | 189 | |
82b4201f KG |
190 | /* Helper macros for math builtins. */ |
191 | ||
192 | #define BUILTIN_EXP10_P(FN) \ | |
193 | ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ | |
194 | || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) | |
195 | ||
196 | #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ | |
197 | || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ | |
198 | || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) | |
199 | ||
200 | #define BUILTIN_SQRT_P(FN) \ | |
201 | ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) | |
202 | ||
203 | #define BUILTIN_CBRT_P(FN) \ | |
204 | ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) | |
205 | ||
206 | #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) | |
207 | ||
3ff5f682 | 208 | /* An array of _DECL trees for the above. */ |
17211ab5 | 209 | extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; |
272f51a3 | 210 | extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; |
8da1b058 RS |
211 | \f |
212 | /* The definition of tree nodes fills the next several pages. */ | |
213 | ||
214 | /* A tree node can represent a data type, a variable, an expression | |
215 | or a statement. Each node has a TREE_CODE which says what kind of | |
216 | thing it represents. Some common codes are: | |
217 | INTEGER_TYPE -- represents a type of integers. | |
218 | ARRAY_TYPE -- represents a type of pointer. | |
219 | VAR_DECL -- represents a declared variable. | |
220 | INTEGER_CST -- represents a constant integer value. | |
221 | PLUS_EXPR -- represents a sum (an expression). | |
222 | ||
223 | As for the contents of a tree node: there are some fields | |
224 | that all nodes share. Each TREE_CODE has various special-purpose | |
225 | fields as well. The fields of a node are never accessed directly, | |
226 | always through accessor macros. */ | |
227 | ||
8da1b058 RS |
228 | /* Every kind of tree node starts with this structure, |
229 | so all nodes have these fields. | |
230 | ||
76c9d226 | 231 | See the accessor macros, defined below, for documentation of the |
eebedaa5 | 232 | fields. */ |
6de9cd9a | 233 | union tree_ann_d; |
8da1b058 | 234 | |
e2500fed | 235 | struct tree_common GTY(()) |
8da1b058 | 236 | { |
2f78c311 ZW |
237 | tree chain; |
238 | tree type; | |
6de9cd9a | 239 | union tree_ann_d *ann; |
ae34ac46 | 240 | |
c149cc37 | 241 | ENUM_BITFIELD(tree_code) code : 8; |
ae34ac46 | 242 | |
8da1b058 RS |
243 | unsigned side_effects_flag : 1; |
244 | unsigned constant_flag : 1; | |
8da1b058 RS |
245 | unsigned addressable_flag : 1; |
246 | unsigned volatile_flag : 1; | |
247 | unsigned readonly_flag : 1; | |
248 | unsigned unsigned_flag : 1; | |
249 | unsigned asm_written_flag: 1; | |
6de9cd9a | 250 | unsigned nowarning_flag : 1; |
4f976745 | 251 | |
6de9cd9a | 252 | unsigned used_flag : 1; |
12a22e76 | 253 | unsigned nothrow_flag : 1; |
8da1b058 RS |
254 | unsigned static_flag : 1; |
255 | unsigned public_flag : 1; | |
256 | unsigned private_flag : 1; | |
257 | unsigned protected_flag : 1; | |
e23bd218 | 258 | unsigned deprecated_flag : 1; |
6de9cd9a | 259 | unsigned invariant_flag : 1; |
8da1b058 RS |
260 | |
261 | unsigned lang_flag_0 : 1; | |
262 | unsigned lang_flag_1 : 1; | |
263 | unsigned lang_flag_2 : 1; | |
264 | unsigned lang_flag_3 : 1; | |
265 | unsigned lang_flag_4 : 1; | |
266 | unsigned lang_flag_5 : 1; | |
267 | unsigned lang_flag_6 : 1; | |
6de9cd9a | 268 | unsigned visited : 1; |
8da1b058 RS |
269 | }; |
270 | ||
a5f99f01 RK |
271 | /* The following table lists the uses of each of the above flags and |
272 | for which types of nodes they are defined. Note that expressions | |
273 | include decls. | |
274 | ||
275 | addressable_flag: | |
276 | ||
277 | TREE_ADDRESSABLE in | |
46c5ad27 | 278 | VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, |
1574ef13 AO |
279 | ..._TYPE, IDENTIFIER_NODE. |
280 | In a STMT_EXPR, it means we want the result of the enclosed | |
281 | expression. | |
6de9cd9a | 282 | CALL_EXPR_TAILCALL in CALL_EXPR |
a5f99f01 RK |
283 | |
284 | static_flag: | |
285 | ||
286 | TREE_STATIC in | |
e5e809f4 | 287 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
604a3205 | 288 | BINFO_VIRTUAL_P in |
809e3e7f | 289 | TREE_BINFO |
a5f99f01 | 290 | TREE_CONSTANT_OVERFLOW in |
69ef87e2 | 291 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
a5f99f01 RK |
292 | TREE_SYMBOL_REFERENCED in |
293 | IDENTIFIER_NODE | |
659e5a7a | 294 | CLEANUP_EH_ONLY in |
5a508662 | 295 | TARGET_EXPR, WITH_CLEANUP_EXPR |
6de9cd9a DN |
296 | ASM_INPUT_P in |
297 | ASM_EXPR | |
298 | EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR | |
22421b79 RK |
299 | TYPE_REF_CAN_ALIAS_ALL in |
300 | POINTER_TYPE, REFERENCE_TYPE | |
a5f99f01 RK |
301 | |
302 | public_flag: | |
303 | ||
304 | TREE_OVERFLOW in | |
69ef87e2 | 305 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
22421b79 | 306 | ??? and other expressions? |
a5f99f01 | 307 | TREE_PUBLIC in |
4c521bad | 308 | VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE |
6de9cd9a DN |
309 | ASM_VOLATILE_P in |
310 | ASM_EXPR | |
89b0433e NS |
311 | TYPE_CACHED_VALUES_P in |
312 | ..._TYPE | |
7f5e6307 RH |
313 | SAVE_EXPR_RESOLVED_P in |
314 | SAVE_EXPR | |
a5f99f01 RK |
315 | |
316 | private_flag: | |
317 | ||
a5f99f01 | 318 | TREE_PRIVATE in |
659e5a7a | 319 | ..._DECL |
4977bab6 ZW |
320 | CALL_EXPR_HAS_RETURN_SLOT_ADDR in |
321 | CALL_EXPR | |
d8472c75 JM |
322 | DECL_BY_REFERENCE in |
323 | PARM_DECL, RESULT_DECL | |
a5f99f01 RK |
324 | |
325 | protected_flag: | |
326 | ||
a5f99f01 RK |
327 | TREE_PROTECTED in |
328 | BLOCK | |
659e5a7a | 329 | ..._DECL |
dd292d0a | 330 | CALL_FROM_THUNK_P in |
caf93cb0 | 331 | CALL_EXPR |
a5f99f01 RK |
332 | |
333 | side_effects_flag: | |
334 | ||
335 | TREE_SIDE_EFFECTS in | |
336 | all expressions | |
4f976745 RK |
337 | all decls |
338 | all constants | |
a5f99f01 | 339 | |
6de9cd9a DN |
340 | FORCED_LABEL in |
341 | LABEL_DECL | |
342 | ||
a5f99f01 RK |
343 | volatile_flag: |
344 | ||
345 | TREE_THIS_VOLATILE in | |
346 | all expressions | |
347 | TYPE_VOLATILE in | |
348 | ..._TYPE | |
349 | ||
350 | readonly_flag: | |
351 | ||
352 | TREE_READONLY in | |
e5e809f4 | 353 | all expressions |
a5f99f01 RK |
354 | TYPE_READONLY in |
355 | ..._TYPE | |
356 | ||
357 | constant_flag: | |
358 | ||
359 | TREE_CONSTANT in | |
360 | all expressions | |
4f976745 RK |
361 | all decls |
362 | all constants | |
a5f99f01 | 363 | |
a5f99f01 RK |
364 | unsigned_flag: |
365 | ||
8df83eae RK |
366 | TYPE_UNSIGNED in |
367 | all types | |
a150de29 RK |
368 | DECL_UNSIGNED in |
369 | all decls | |
370 | BIT_FIELD_REF_UNSIGNED in | |
371 | BIT_FIELD_REF | |
a5f99f01 RK |
372 | |
373 | asm_written_flag: | |
374 | ||
375 | TREE_ASM_WRITTEN in | |
376 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
6de9cd9a | 377 | BLOCK, SSA_NAME |
a5f99f01 RK |
378 | |
379 | used_flag: | |
380 | ||
381 | TREE_USED in | |
382 | expressions, IDENTIFIER_NODE | |
383 | ||
12a22e76 | 384 | nothrow_flag: |
a5f99f01 | 385 | |
12a22e76 JM |
386 | TREE_NOTHROW in |
387 | CALL_EXPR, FUNCTION_DECL | |
a5f99f01 | 388 | |
1e2d4dc1 RK |
389 | TYPE_ALIGN_OK in |
390 | ..._TYPE | |
391 | ||
5cb2183e | 392 | TREE_THIS_NOTRAP in |
7ccf35ed | 393 | (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF |
5cb2183e | 394 | |
e23bd218 IR |
395 | deprecated_flag: |
396 | ||
397 | TREE_DEPRECATED in | |
398 | ..._DECL | |
dd292d0a | 399 | |
6de9cd9a DN |
400 | visited: |
401 | ||
402 | Used in tree traversals to mark visited nodes. | |
403 | ||
404 | invariant_flag: | |
405 | ||
406 | TREE_INVARIANT in | |
407 | all expressions. | |
408 | ||
409 | nowarning_flag: | |
410 | ||
411 | TREE_NO_WARNING in | |
73022c2a | 412 | ... any expr or decl node |
e23bd218 | 413 | */ |
a6d7adfd | 414 | |
8da1b058 RS |
415 | /* Define accessors for the fields that all tree nodes have |
416 | (though some fields are not used for all kinds of nodes). */ | |
417 | ||
418 | /* The tree-code says what kind of node it is. | |
419 | Codes are defined in tree.def. */ | |
420 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) | |
7e7c843f | 421 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE)) |
8da1b058 | 422 | |
12b195d9 | 423 | /* When checking is enabled, errors will be generated if a tree node |
8f985ec4 | 424 | is accessed incorrectly. The macros abort with a fatal error. */ |
f4524c9e | 425 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
12b195d9 | 426 | |
7f42b6d7 RK |
427 | #define TREE_CHECK(T, CODE) __extension__ \ |
428 | ({ const tree __t = (T); \ | |
429 | if (TREE_CODE (__t) != (CODE)) \ | |
086e3095 NS |
430 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
431 | (CODE), 0); \ | |
432 | __t; }) | |
433 | ||
434 | #define TREE_NOT_CHECK(T, CODE) __extension__ \ | |
435 | ({ const tree __t = (T); \ | |
436 | if (TREE_CODE (__t) == (CODE)) \ | |
437 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
438 | (CODE), 0); \ | |
8f985ec4 | 439 | __t; }) |
7f42b6d7 | 440 | |
eb34af89 RK |
441 | #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ |
442 | ({ const tree __t = (T); \ | |
443 | if (TREE_CODE (__t) != (CODE1) \ | |
444 | && TREE_CODE (__t) != (CODE2)) \ | |
086e3095 NS |
445 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
446 | (CODE1), (CODE2), 0); \ | |
447 | __t; }) | |
448 | ||
449 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \ | |
450 | ({ const tree __t = (T); \ | |
451 | if (TREE_CODE (__t) == (CODE1) \ | |
452 | || TREE_CODE (__t) == (CODE2)) \ | |
453 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
454 | (CODE1), (CODE2), 0); \ | |
eb34af89 RK |
455 | __t; }) |
456 | ||
457 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
458 | ({ const tree __t = (T); \ | |
459 | if (TREE_CODE (__t) != (CODE1) \ | |
460 | && TREE_CODE (__t) != (CODE2) \ | |
461 | && TREE_CODE (__t) != (CODE3)) \ | |
086e3095 NS |
462 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
463 | (CODE1), (CODE2), (CODE3), 0); \ | |
464 | __t; }) | |
465 | ||
466 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
467 | ({ const tree __t = (T); \ | |
468 | if (TREE_CODE (__t) == (CODE1) \ | |
469 | || TREE_CODE (__t) == (CODE2) \ | |
470 | || TREE_CODE (__t) == (CODE3)) \ | |
471 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
472 | (CODE1), (CODE2), (CODE3), 0); \ | |
eb34af89 RK |
473 | __t; }) |
474 | ||
22421b79 RK |
475 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ |
476 | ({ const tree __t = (T); \ | |
477 | if (TREE_CODE (__t) != (CODE1) \ | |
478 | && TREE_CODE (__t) != (CODE2) \ | |
479 | && TREE_CODE (__t) != (CODE3) \ | |
480 | && TREE_CODE (__t) != (CODE4)) \ | |
086e3095 NS |
481 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
482 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
483 | __t; }) | |
484 | ||
485 | #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ | |
486 | ({ const tree __t = (T); \ | |
487 | if (TREE_CODE (__t) == (CODE1) \ | |
488 | || TREE_CODE (__t) == (CODE2) \ | |
489 | || TREE_CODE (__t) == (CODE3) \ | |
490 | || TREE_CODE (__t) == (CODE4)) \ | |
491 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
492 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
22421b79 RK |
493 | __t; }) |
494 | ||
eb34af89 RK |
495 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ |
496 | ({ const tree __t = (T); \ | |
497 | if (TREE_CODE (__t) != (CODE1) \ | |
498 | && TREE_CODE (__t) != (CODE2) \ | |
499 | && TREE_CODE (__t) != (CODE3) \ | |
500 | && TREE_CODE (__t) != (CODE4) \ | |
501 | && TREE_CODE (__t) != (CODE5)) \ | |
086e3095 NS |
502 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
503 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
504 | __t; }) | |
505 | ||
506 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ | |
507 | ({ const tree __t = (T); \ | |
508 | if (TREE_CODE (__t) == (CODE1) \ | |
509 | || TREE_CODE (__t) == (CODE2) \ | |
510 | || TREE_CODE (__t) == (CODE3) \ | |
511 | || TREE_CODE (__t) == (CODE4) \ | |
512 | || TREE_CODE (__t) == (CODE5)) \ | |
513 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
514 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
eb34af89 RK |
515 | __t; }) |
516 | ||
7f42b6d7 RK |
517 | #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ |
518 | ({ const tree __t = (T); \ | |
519 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ | |
520 | tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ | |
b9daac31 | 521 | __FUNCTION__); \ |
8f985ec4 ZW |
522 | __t; }) |
523 | ||
524 | /* These checks have to be special cased. */ | |
7f42b6d7 RK |
525 | #define EXPR_CHECK(T) __extension__ \ |
526 | ({ const tree __t = (T); \ | |
527 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
68ad9159 | 528 | if (!IS_EXPR_CODE_CLASS (__c)) \ |
6615c446 | 529 | tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \ |
4f976745 RK |
530 | __FUNCTION__); \ |
531 | __t; }) | |
532 | ||
533 | /* These checks have to be special cased. */ | |
534 | #define NON_TYPE_CHECK(T) __extension__ \ | |
535 | ({ const tree __t = (T); \ | |
536 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
537 | if (!IS_NON_TYPE_CODE_CLASS (__c)) \ | |
6615c446 | 538 | tree_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \ |
b9daac31 | 539 | __FUNCTION__); \ |
8f985ec4 ZW |
540 | __t; }) |
541 | ||
7f42b6d7 RK |
542 | #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ |
543 | (*({const tree __t = (T); \ | |
544 | const int __i = (I); \ | |
fa7b533b | 545 | if (TREE_CODE (__t) != TREE_VEC) \ |
086e3095 NS |
546 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
547 | TREE_VEC, 0); \ | |
fa7b533b ZW |
548 | if (__i < 0 || __i >= __t->vec.length) \ |
549 | tree_vec_elt_check_failed (__i, __t->vec.length, \ | |
550 | __FILE__, __LINE__, __FUNCTION__); \ | |
551 | &__t->vec.a[__i]; })) | |
552 | ||
6de9cd9a DN |
553 | #define PHI_NODE_ELT_CHECK(t, i) __extension__ \ |
554 | (*({const tree __t = t; \ | |
555 | const int __i = (i); \ | |
556 | if (TREE_CODE (__t) != PHI_NODE) \ | |
086e3095 NS |
557 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
558 | PHI_NODE, 0); \ | |
6de9cd9a DN |
559 | if (__i < 0 || __i >= __t->phi.capacity) \ |
560 | phi_node_elt_check_failed (__i, __t->phi.num_args, \ | |
561 | __FILE__, __LINE__, __FUNCTION__); \ | |
562 | &__t->phi.a[__i]; })) | |
563 | ||
06790e5f | 564 | /* Special checks for TREE_OPERANDs. */ |
7f42b6d7 | 565 | #define TREE_OPERAND_CHECK(T, I) __extension__ \ |
55448d12 | 566 | (*({const tree __t = EXPR_CHECK (T); \ |
7f42b6d7 | 567 | const int __i = (I); \ |
06790e5f ZW |
568 | if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ |
569 | tree_operand_check_failed (__i, TREE_CODE (__t), \ | |
570 | __FILE__, __LINE__, __FUNCTION__); \ | |
571 | &__t->exp.operands[__i]; })) | |
572 | ||
7f42b6d7 RK |
573 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ |
574 | (*({const tree __t = (T); \ | |
575 | const int __i = (I); \ | |
576 | if (TREE_CODE (__t) != CODE) \ | |
086e3095 | 577 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\ |
7f42b6d7 RK |
578 | if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \ |
579 | tree_operand_check_failed (__i, (CODE), \ | |
06790e5f ZW |
580 | __FILE__, __LINE__, __FUNCTION__); \ |
581 | &__t->exp.operands[__i]; })) | |
582 | ||
7f42b6d7 | 583 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \ |
06790e5f | 584 | (*(rtx *) \ |
7f42b6d7 RK |
585 | ({const tree __t = (T); \ |
586 | const int __i = (I); \ | |
587 | if (TREE_CODE (__t) != (CODE)) \ | |
086e3095 | 588 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \ |
7f42b6d7 RK |
589 | if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \ |
590 | tree_operand_check_failed (__i, (CODE), \ | |
06790e5f ZW |
591 | __FILE__, __LINE__, __FUNCTION__); \ |
592 | &__t->exp.operands[__i]; })) | |
593 | ||
086e3095 NS |
594 | extern void tree_check_failed (const tree, const char *, int, const char *, |
595 | ...) ATTRIBUTE_NORETURN; | |
596 | extern void tree_not_check_failed (const tree, const char *, int, const char *, | |
597 | ...) ATTRIBUTE_NORETURN; | |
6615c446 | 598 | extern void tree_class_check_failed (const tree, const enum tree_code_class, |
46c5ad27 | 599 | const char *, int, const char *) |
8f985ec4 | 600 | ATTRIBUTE_NORETURN; |
46c5ad27 AJ |
601 | extern void tree_vec_elt_check_failed (int, int, const char *, |
602 | int, const char *) | |
fa7b533b | 603 | ATTRIBUTE_NORETURN; |
6de9cd9a DN |
604 | extern void phi_node_elt_check_failed (int, int, const char *, |
605 | int, const char *) | |
606 | ATTRIBUTE_NORETURN; | |
46c5ad27 AJ |
607 | extern void tree_operand_check_failed (int, enum tree_code, |
608 | const char *, int, const char *) | |
06790e5f | 609 | ATTRIBUTE_NORETURN; |
46c5ad27 | 610 | |
f4524c9e | 611 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
12b195d9 | 612 | |
eb34af89 | 613 | #define TREE_CHECK(T, CODE) (T) |
086e3095 | 614 | #define TREE_NOT_CHECK(T, CODE) (T) |
eb34af89 | 615 | #define TREE_CHECK2(T, CODE1, CODE2) (T) |
086e3095 | 616 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) |
eb34af89 | 617 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) |
086e3095 | 618 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) |
22421b79 | 619 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
086e3095 | 620 | #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
eb34af89 | 621 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
086e3095 | 622 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
eb34af89 RK |
623 | #define TREE_CLASS_CHECK(T, CODE) (T) |
624 | #define EXPR_CHECK(T) (T) | |
4f976745 | 625 | #define NON_TYPE_CHECK(T) (T) |
eb34af89 RK |
626 | #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
627 | #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) | |
628 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) | |
7f42b6d7 | 629 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I])) |
6de9cd9a | 630 | #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i]) |
8f985ec4 ZW |
631 | |
632 | #endif | |
633 | ||
6de9cd9a DN |
634 | #define TREE_BLOCK(NODE) ((NODE)->exp.block) |
635 | ||
8f985ec4 ZW |
636 | #include "tree-check.h" |
637 | ||
6615c446 JO |
638 | #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) |
639 | #define DECL_CHECK(T) TREE_CLASS_CHECK (T, tcc_declaration) | |
640 | #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) | |
641 | #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) | |
eb34af89 | 642 | #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
22421b79 | 643 | #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
eb34af89 | 644 | |
5c5214a9 ZW |
645 | #define SET_OR_ARRAY_CHECK(T) \ |
646 | TREE_CHECK2 (T, ARRAY_TYPE, SET_TYPE) | |
eb34af89 | 647 | |
95b4aca6 | 648 | #define RECORD_OR_UNION_CHECK(T) \ |
eb34af89 | 649 | TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
95b4aca6 NS |
650 | #define NOT_RECORD_OR_UNION_CHECK(T) \ |
651 | TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) | |
caf93cb0 | 652 | |
eb34af89 RK |
653 | #define NUMERICAL_TYPE_CHECK(T) \ |
654 | TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \ | |
655 | CHAR_TYPE, REAL_TYPE) | |
12b195d9 | 656 | |
8da1b058 RS |
657 | /* In all nodes that are expressions, this is the data type of the expression. |
658 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
0b4565c9 BS |
659 | In ARRAY_TYPE nodes, this is the type of the elements. |
660 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
8da1b058 RS |
661 | #define TREE_TYPE(NODE) ((NODE)->common.type) |
662 | ||
1c0cc57e KG |
663 | /* Here is how primitive or already-canonicalized types' hash codes |
664 | are made. */ | |
fd917e0d JM |
665 | #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
666 | ||
667 | /* A simple hash function for an arbitrary tree node. This must not be | |
668 | used in hash tables which are saved to a PCH. */ | |
669 | #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) | |
1c0cc57e | 670 | |
8da1b058 RS |
671 | /* Nodes are chained together for many purposes. |
672 | Types are chained together to record them for being output to the debugger | |
673 | (see the function `chain_type'). | |
674 | Decls in the same scope are chained together to record the contents | |
675 | of the scope. | |
676 | Statement nodes for successive statements used to be chained together. | |
677 | Often lists of things are represented by TREE_LIST nodes that | |
678 | are chained together. */ | |
679 | ||
680 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) | |
681 | ||
682 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs | |
683 | that don't change the machine mode. */ | |
684 | ||
9a6bb3f7 | 685 | #define STRIP_NOPS(EXP) \ |
8da1b058 RS |
686 | while ((TREE_CODE (EXP) == NOP_EXPR \ |
687 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
688 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 689 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
8da1b058 RS |
690 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
691 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
713cc17b | 692 | (EXP) = TREE_OPERAND (EXP, 0) |
0fafb45e | 693 | |
14a774a9 RK |
694 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
695 | ||
696 | #define STRIP_SIGN_NOPS(EXP) \ | |
697 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
698 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
699 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 700 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
14a774a9 RK |
701 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
702 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
8df83eae RK |
703 | && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \ |
704 | == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
713cc17b | 705 | (EXP) = TREE_OPERAND (EXP, 0) |
14a774a9 | 706 | |
03307888 JM |
707 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */ |
708 | ||
709 | #define STRIP_MAIN_TYPE_NOPS(EXP) \ | |
710 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
711 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
712 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
713 | && TREE_OPERAND (EXP, 0) != error_mark_node \ | |
714 | && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \ | |
715 | == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
716 | (EXP) = TREE_OPERAND (EXP, 0) | |
717 | ||
0fafb45e RS |
718 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
719 | ||
720 | #define STRIP_TYPE_NOPS(EXP) \ | |
721 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
722 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
723 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 724 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
0fafb45e RS |
725 | && (TREE_TYPE (EXP) \ |
726 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
713cc17b | 727 | (EXP) = TREE_OPERAND (EXP, 0) |
87291138 | 728 | |
6de9cd9a DN |
729 | /* Remove unnecessary type conversions according to |
730 | tree_ssa_useless_type_conversion. */ | |
731 | ||
732 | #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ | |
733 | while (tree_ssa_useless_type_conversion (EXP)) \ | |
734 | EXP = TREE_OPERAND (EXP, 0) | |
735 | ||
87291138 RK |
736 | /* Nonzero if TYPE represents an integral type. Note that we do not |
737 | include COMPLEX types here. */ | |
738 | ||
739 | #define INTEGRAL_TYPE_P(TYPE) \ | |
740 | (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ | |
741 | || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) | |
742 | ||
00229de4 RS |
743 | /* Nonzero if TYPE represents a scalar floating-point type. */ |
744 | ||
745 | #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) | |
746 | ||
747 | /* Nonzero if TYPE represents a complex floating-point type. */ | |
748 | ||
749 | #define COMPLEX_FLOAT_TYPE_P(TYPE) \ | |
750 | (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
751 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
752 | ||
d97c6333 JW |
753 | /* Nonzero if TYPE represents a vector floating-point type. */ |
754 | ||
755 | #define VECTOR_FLOAT_TYPE_P(TYPE) \ | |
756 | (TREE_CODE (TYPE) == VECTOR_TYPE \ | |
757 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
758 | ||
87291138 | 759 | /* Nonzero if TYPE represents a floating-point type, including complex |
d97c6333 | 760 | and vector floating-point types. */ |
87291138 RK |
761 | |
762 | #define FLOAT_TYPE_P(TYPE) \ | |
d97c6333 JW |
763 | (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE) \ |
764 | || VECTOR_FLOAT_TYPE_P (TYPE)) | |
947765f9 | 765 | |
2ba84f36 | 766 | /* Nonzero if TYPE represents an aggregate (multi-component) type. */ |
947765f9 PB |
767 | |
768 | #define AGGREGATE_TYPE_P(TYPE) \ | |
769 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
770 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ | |
771 | || TREE_CODE (TYPE) == SET_TYPE) | |
9e6cfc43 | 772 | |
66804d9e NS |
773 | /* Nonzero if TYPE represents a pointer or reference type. |
774 | (It should be renamed to INDIRECT_TYPE_P.) */ | |
9e6cfc43 JM |
775 | |
776 | #define POINTER_TYPE_P(TYPE) \ | |
777 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
555f90c5 | 778 | |
d0f062fb NS |
779 | /* Nonzero if this type is a complete type. */ |
780 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
781 | ||
71653180 | 782 | /* Nonzero if this type is the (possibly qualified) void type. */ |
e7cd085f | 783 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
71653180 | 784 | |
d0f062fb NS |
785 | /* Nonzero if this type is complete or is cv void. */ |
786 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
c46080ab | 787 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
d0f062fb NS |
788 | |
789 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
790 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
713cc17b | 791 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
d0f062fb | 792 | |
8da1b058 RS |
793 | \f |
794 | /* Define many boolean fields that all tree nodes have. */ | |
795 | ||
796 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
797 | So it cannot be in a register. | |
798 | In a FUNCTION_DECL, nonzero means its address is needed. | |
799 | So it must be compiled even if it is an inline function. | |
1febe16b RK |
800 | In a FIELD_DECL node, it means that the programmer is permitted to |
801 | construct the address of this field. This is used for aliasing | |
802 | purposes: see record_component_aliases. | |
8da1b058 | 803 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
41077ce4 | 804 | In LABEL_DECL nodes, it means a goto for this label has been seen |
8da1b058 RS |
805 | from a place outside all binding contours that restore stack levels. |
806 | In ..._TYPE nodes, it means that objects of this type must | |
807 | be fully addressable. This means that pieces of this | |
808 | object cannot go into register parameters, for example. | |
809 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
810 | had its address taken. That matters for inline functions. */ | |
811 | #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) | |
812 | ||
6de9cd9a DN |
813 | #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag) |
814 | ||
8da1b058 | 815 | /* In a VAR_DECL, nonzero means allocate static storage. |
9f86614b | 816 | In a FUNCTION_DECL, nonzero if function has been defined. |
22421b79 RK |
817 | In a CONSTRUCTOR, nonzero means allocate static storage. |
818 | ||
819 | ??? This is also used in lots of other nodes in unclear ways which | |
820 | should be cleaned up some day. */ | |
8da1b058 RS |
821 | #define TREE_STATIC(NODE) ((NODE)->common.static_flag) |
822 | ||
5a508662 RH |
823 | /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup |
824 | should only be executed if an exception is thrown, not on normal exit | |
825 | of its scope. */ | |
659e5a7a JM |
826 | #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag) |
827 | ||
6de9cd9a | 828 | /* In an expr node (usually a conversion) this means the node was made |
73022c2a RH |
829 | implicitly and should not lead to any sort of warning. In a decl node, |
830 | warnings concerning the decl should be suppressed. This is used at | |
831 | least for used-before-set warnings, and it set after one warning is | |
832 | emitted. */ | |
6de9cd9a | 833 | #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag) |
8da1b058 | 834 | |
69ef87e2 AH |
835 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means |
836 | there was an overflow in folding. This is distinct from | |
837 | TREE_OVERFLOW because ANSI C requires a diagnostic when overflows | |
838 | occur in constant expressions. */ | |
22421b79 | 839 | #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag) |
261450e8 | 840 | |
d3568529 JM |
841 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
842 | this string as an argument. */ | |
c46080ab | 843 | #define TREE_SYMBOL_REFERENCED(NODE) \ |
b9daac31 | 844 | (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag) |
d3568529 | 845 | |
22421b79 RK |
846 | /* Nonzero in a pointer or reference type means the data pointed to |
847 | by this type can alias anything. */ | |
848 | #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ | |
849 | (PTR_OR_REF_CHECK (NODE)->common.static_flag) | |
850 | ||
69ef87e2 AH |
851 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
852 | there was an overflow in folding, and no warning has been issued | |
22421b79 | 853 | for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, |
caf93cb0 | 854 | but not vice versa. |
22421b79 RK |
855 | |
856 | ??? Apparently, lots of code assumes this is defined in all | |
857 | expressions. */ | |
261450e8 PE |
858 | #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) |
859 | ||
8da1b058 RS |
860 | /* In a VAR_DECL or FUNCTION_DECL, |
861 | nonzero means name is to be accessible from outside this module. | |
4c521bad | 862 | In an IDENTIFIER_NODE, nonzero means an external declaration |
6dc42e49 | 863 | accessible from outside this module was previously seen |
8da1b058 RS |
864 | for this name in an inner scope. */ |
865 | #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) | |
866 | ||
89b0433e NS |
867 | /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector |
868 | of cached values, or is something else. */ | |
869 | #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag) | |
7f5e6307 RH |
870 | |
871 | /* In a SAVE_EXPR, indicates that the original expression has already | |
872 | been substituted with a VAR_DECL that contains the value. */ | |
873 | #define SAVE_EXPR_RESOLVED_P(NODE) \ | |
874 | (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag) | |
89b0433e | 875 | |
4f976745 RK |
876 | /* In any expression, decl, or constant, nonzero means it has side effects or |
877 | reevaluation of the whole expression could produce a different value. | |
878 | This is set if any subexpression is a function call, a side effect or a | |
879 | reference to a volatile variable. In a ..._DECL, this is set only if the | |
880 | declaration said `volatile'. This will never be set for a constant. */ | |
881 | #define TREE_SIDE_EFFECTS(NODE) \ | |
882 | (NON_TYPE_CHECK (NODE)->common.side_effects_flag) | |
8da1b058 | 883 | |
6de9cd9a DN |
884 | /* In a LABEL_DECL, nonzero means this label had its address taken |
885 | and therefore can never be deleted and is a jump target for | |
886 | computed gotos. */ | |
887 | #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag) | |
888 | ||
8da1b058 RS |
889 | /* Nonzero means this expression is volatile in the C sense: |
890 | its address should be of type `volatile WHATEVER *'. | |
891 | In other words, the declared item is volatile qualified. | |
892 | This is used in _DECL nodes and _REF nodes. | |
893 | ||
894 | In a ..._TYPE node, means this type is volatile-qualified. | |
895 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
896 | because eventually we may make that a different bit. | |
897 | ||
898 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
899 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) | |
900 | ||
5cb2183e AH |
901 | /* Nonzero means this node will not trap. In an INDIRECT_REF, means |
902 | accessing the memory pointed to won't generate a trap. However, | |
903 | this only applies to an object when used appropriately: it doesn't | |
7ccf35ed DN |
904 | mean that writing a READONLY mem won't trap. Similarly for |
905 | ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF. | |
caf93cb0 | 906 | |
a7e5372d ZD |
907 | In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index |
908 | (or slice of the array) always belongs to the range of the array. | |
909 | I.e. that the access will not trap, provided that the access to | |
910 | the base to the array will not trap. */ | |
5cb2183e AH |
911 | #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag) |
912 | ||
8da1b058 | 913 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, |
4f976745 RK |
914 | nonzero means it may not be the lhs of an assignment. */ |
915 | #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag) | |
8da1b058 | 916 | |
272d0bee | 917 | /* Nonzero if NODE is a _DECL with TREE_READONLY set. */ |
6615c446 JO |
918 | #define TREE_READONLY_DECL_P(NODE)\ |
919 | (DECL_P (NODE) && TREE_READONLY (NODE)) | |
588d3ade | 920 | |
4f976745 RK |
921 | /* Value of expression is constant. Always on in all ..._CST nodes. May |
922 | also appear in an expression or decl where the value is constant. */ | |
923 | #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag) | |
8da1b058 | 924 | |
a150de29 RK |
925 | /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
926 | #define DECL_UNSIGNED(NODE) (DECL_CHECK (NODE)->common.unsigned_flag) | |
927 | ||
928 | /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */ | |
929 | #define BIT_FIELD_REF_UNSIGNED(NODE) \ | |
930 | (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag) | |
8da1b058 | 931 | |
8df83eae RK |
932 | /* In integral and pointer types, means an unsigned type. */ |
933 | #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag) | |
934 | ||
c46080ab | 935 | #define TYPE_TRAP_SIGNED(NODE) \ |
8df83eae | 936 | (flag_trapv && ! TYPE_UNSIGNED (NODE)) |
91ce572a | 937 | |
8da1b058 RS |
938 | /* Nonzero in a VAR_DECL means assembler code has been written. |
939 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
940 | This is interesting in an inline function, since it might not need | |
941 | to be compiled separately. | |
3635a54b | 942 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
9f86614b | 943 | if the sdb debugging info for the type has been written. |
caf93cb0 | 944 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
6de9cd9a DN |
945 | In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal |
946 | PHI node. */ | |
8da1b058 RS |
947 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) |
948 | ||
949 | /* Nonzero in a _DECL if the name is used in its scope. | |
950 | Nonzero in an expr node means inhibit warning if value is unused. | |
951 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
952 | was used. */ | |
953 | #define TREE_USED(NODE) ((NODE)->common.used_flag) | |
954 | ||
12a22e76 JM |
955 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw |
956 | an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ | |
957 | #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag) | |
c3d32120 | 958 | |
4977bab6 ZW |
959 | /* In a CALL_EXPR, means that the address of the return slot is part of the |
960 | argument list. */ | |
961 | #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag) | |
962 | ||
d8472c75 JM |
963 | /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible |
964 | reference (and the TREE_TYPE is a pointer to the true type). */ | |
965 | #define DECL_BY_REFERENCE(NODE) (DECL_CHECK (NODE)->common.private_flag) | |
966 | ||
dd292d0a MM |
967 | /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
968 | thunked-to function. */ | |
969 | #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag) | |
970 | ||
c3d32120 RK |
971 | /* In a type, nonzero means that all objects of the type are guaranteed by the |
972 | language or front-end to be properly aligned, so we can indicate that a MEM | |
973 | of this type is aligned at least to the alignment of the type, even if it | |
974 | doesn't appear that it is. We see this, for example, in object-oriented | |
975 | languages where a tag field may show this is an object of a more-aligned | |
6de9cd9a DN |
976 | variant of the more generic type. |
977 | ||
978 | In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME | |
979 | freelist. */ | |
c3d32120 | 980 | #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag) |
8da1b058 | 981 | |
9f86614b | 982 | /* Used in classes in C++. */ |
8da1b058 | 983 | #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) |
9f86614b RS |
984 | /* Used in classes in C++. |
985 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
8da1b058 RS |
986 | #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) |
987 | ||
e0a2f705 | 988 | /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a |
e23bd218 IR |
989 | deprecated feature by __attribute__((deprecated)). */ |
990 | #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag) | |
991 | ||
6de9cd9a DN |
992 | /* Value of expression is function invariant. A strict subset of |
993 | TREE_CONSTANT, such an expression is constant over any one function | |
994 | invocation, though not across different invocations. May appear in | |
995 | any expression node. */ | |
996 | #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag) | |
997 | ||
9f86614b | 998 | /* These flags are available for each language front end to use internally. */ |
8da1b058 RS |
999 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) |
1000 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) | |
1001 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) | |
1002 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) | |
1003 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) | |
1004 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) | |
1005 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) | |
1006 | \f | |
1007 | /* Define additional fields and accessors for nodes representing constants. */ | |
1008 | ||
e5d70561 RK |
1009 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
1010 | If the data type is signed, the value is sign-extended to 2 words | |
8da1b058 | 1011 | even though not all of them may really be in use. |
e5d70561 | 1012 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2afaa41c GM |
1013 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
1014 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
1015 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
8da1b058 | 1016 | |
b9daac31 GS |
1017 | #define INT_CST_LT(A, B) \ |
1018 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
1019 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
c46080ab | 1020 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
8da1b058 | 1021 | |
b9daac31 GS |
1022 | #define INT_CST_LT_UNSIGNED(A, B) \ |
1023 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
1024 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
1025 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
41077ce4 | 1026 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
c46080ab | 1027 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
46c5ad27 | 1028 | |
e2500fed | 1029 | struct tree_int_cst GTY(()) |
8da1b058 | 1030 | { |
2bf105ab | 1031 | struct tree_common common; |
2afaa41c GM |
1032 | /* A sub-struct is necessary here because the function `const_hash' |
1033 | wants to scan both words as a unit and taking the address of the | |
1034 | sub-struct yields the properly inclusive bounded pointer. */ | |
e2500fed | 1035 | struct tree_int_cst_lowhi { |
2afaa41c GM |
1036 | unsigned HOST_WIDE_INT low; |
1037 | HOST_WIDE_INT high; | |
1038 | } int_cst; | |
8da1b058 RS |
1039 | }; |
1040 | ||
0ee6fdb5 | 1041 | /* In a REAL_CST node. struct real_value is an opaque entity, with |
11ad4784 ZW |
1042 | manipulators defined in real.h. We don't want tree.h depending on |
1043 | real.h and transitively on tm.h. */ | |
0ee6fdb5 | 1044 | struct real_value; |
c46080ab | 1045 | |
11ad4784 ZW |
1046 | #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
1047 | #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) | |
8da1b058 | 1048 | |
e2500fed | 1049 | struct tree_real_cst GTY(()) |
8da1b058 | 1050 | { |
2bf105ab | 1051 | struct tree_common common; |
0ee6fdb5 | 1052 | struct real_value * real_cst_ptr; |
8da1b058 RS |
1053 | }; |
1054 | ||
1055 | /* In a STRING_CST */ | |
12b195d9 | 1056 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
a396f8ae | 1057 | #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.str) |
8da1b058 | 1058 | |
e2500fed | 1059 | struct tree_string GTY(()) |
8da1b058 | 1060 | { |
2bf105ab | 1061 | struct tree_common common; |
8da1b058 | 1062 | int length; |
a396f8ae | 1063 | const char str[1]; |
8da1b058 RS |
1064 | }; |
1065 | ||
1066 | /* In a COMPLEX_CST node. */ | |
12b195d9 ML |
1067 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
1068 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
8da1b058 | 1069 | |
e2500fed | 1070 | struct tree_complex GTY(()) |
8da1b058 | 1071 | { |
2bf105ab | 1072 | struct tree_common common; |
2f78c311 ZW |
1073 | tree real; |
1074 | tree imag; | |
8da1b058 | 1075 | }; |
69ef87e2 AH |
1076 | |
1077 | /* In a VECTOR_CST node. */ | |
1078 | #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) | |
1079 | ||
e2500fed | 1080 | struct tree_vector GTY(()) |
69ef87e2 AH |
1081 | { |
1082 | struct tree_common common; | |
69ef87e2 AH |
1083 | tree elements; |
1084 | }; | |
8da1b058 | 1085 | \f |
4f4e53dd | 1086 | #include "symtab.h" |
2a967f3d | 1087 | |
8da1b058 RS |
1088 | /* Define fields and accessors for some special-purpose tree nodes. */ |
1089 | ||
2a967f3d | 1090 | #define IDENTIFIER_LENGTH(NODE) \ |
c46080ab | 1091 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
2a967f3d | 1092 | #define IDENTIFIER_POINTER(NODE) \ |
b9daac31 | 1093 | ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
5e0c54e5 GDR |
1094 | #define IDENTIFIER_HASH_VALUE(NODE) \ |
1095 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) | |
2a967f3d NB |
1096 | |
1097 | /* Translate a hash table identifier pointer to a tree_identifier | |
1098 | pointer, and vice versa. */ | |
1099 | ||
1100 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
c46080ab RK |
1101 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
1102 | #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) | |
8da1b058 | 1103 | |
e2500fed | 1104 | struct tree_identifier GTY(()) |
8da1b058 | 1105 | { |
2bf105ab | 1106 | struct tree_common common; |
2a967f3d | 1107 | struct ht_identifier id; |
8da1b058 RS |
1108 | }; |
1109 | ||
1110 | /* In a TREE_LIST node. */ | |
12b195d9 ML |
1111 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
1112 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
8da1b058 | 1113 | |
e2500fed | 1114 | struct tree_list GTY(()) |
8da1b058 | 1115 | { |
2bf105ab | 1116 | struct tree_common common; |
2f78c311 ZW |
1117 | tree purpose; |
1118 | tree value; | |
8da1b058 RS |
1119 | }; |
1120 | ||
1121 | /* In a TREE_VEC node. */ | |
12b195d9 | 1122 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
c46080ab RK |
1123 | #define TREE_VEC_END(NODE) \ |
1124 | ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) | |
8da1b058 | 1125 | |
fa7b533b ZW |
1126 | #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
1127 | ||
e2500fed | 1128 | struct tree_vec GTY(()) |
8da1b058 | 1129 | { |
2bf105ab | 1130 | struct tree_common common; |
8da1b058 | 1131 | int length; |
e2500fed | 1132 | tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; |
8da1b058 RS |
1133 | }; |
1134 | ||
1135 | /* Define fields and accessors for some nodes that represent expressions. */ | |
1136 | ||
1ea7e6ad | 1137 | /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
6de9cd9a DN |
1138 | #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
1139 | && VOID_TYPE_P (TREE_TYPE (NODE)) \ | |
1140 | && integer_zerop (TREE_OPERAND (NODE, 0))) | |
1141 | ||
8da1b058 | 1142 | /* In a CONSTRUCTOR node. */ |
0864034e | 1143 | #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0) |
8da1b058 | 1144 | |
61131fa2 | 1145 | /* In ordinary expression nodes. */ |
06790e5f | 1146 | #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
12b195d9 | 1147 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) |
61131fa2 | 1148 | |
7ccf35ed DN |
1149 | /* In INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */ |
1150 | #define REF_ORIGINAL(NODE) TREE_CHAIN (TREE_CHECK3 (NODE, \ | |
1151 | INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF)) | |
8b11a64c | 1152 | |
40edd0bd | 1153 | /* In a LABELED_BLOCK_EXPR node. */ |
c46080ab | 1154 | #define LABELED_BLOCK_LABEL(NODE) \ |
06790e5f | 1155 | TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0) |
c46080ab | 1156 | #define LABELED_BLOCK_BODY(NODE) \ |
06790e5f | 1157 | TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1) |
40edd0bd | 1158 | |
e0a2f705 | 1159 | /* In an EXIT_BLOCK_EXPR node. */ |
c46080ab | 1160 | #define EXIT_BLOCK_LABELED_BLOCK(NODE) \ |
06790e5f ZW |
1161 | TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0) |
1162 | #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1) | |
40edd0bd APB |
1163 | |
1164 | /* In a LOOP_EXPR node. */ | |
06790e5f | 1165 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
40edd0bd | 1166 | |
c1667470 PB |
1167 | #ifdef USE_MAPPED_LOCATION |
1168 | /* The source location of this expression. Non-tree_exp nodes such as | |
1169 | decls and constants can be shared among multiple locations, so | |
1170 | return nothing. */ | |
1171 | #define EXPR_LOCATION(NODE) \ | |
6615c446 | 1172 | (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION) |
c1667470 PB |
1173 | #define SET_EXPR_LOCATION(NODE, FROM) \ |
1174 | (EXPR_CHECK (NODE)->exp.locus = (FROM)) | |
1175 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION) | |
8c27b7d4 | 1176 | /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */ |
c1667470 | 1177 | #define EXPR_LOCUS(NODE) \ |
6615c446 | 1178 | (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL) |
c1667470 PB |
1179 | #define SET_EXPR_LOCUS(NODE, FROM) \ |
1180 | do { source_location *loc_tmp = FROM; \ | |
1181 | EXPR_CHECK (NODE)->exp.locus \ | |
1182 | = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0) | |
1183 | #define EXPR_FILENAME(NODE) \ | |
1184 | LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus) | |
1185 | #define EXPR_LINENO(NODE) \ | |
1186 | LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) | |
1187 | #else | |
6de9cd9a DN |
1188 | /* The source location of this expression. Non-tree_exp nodes such as |
1189 | decls and constants can be shared among multiple locations, so | |
1190 | return nothing. */ | |
1191 | #define EXPR_LOCUS(NODE) \ | |
6615c446 | 1192 | (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL) |
6de9cd9a DN |
1193 | #define SET_EXPR_LOCUS(NODE, FROM) \ |
1194 | (EXPR_CHECK (NODE)->exp.locus = (FROM)) | |
c1667470 | 1195 | #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM) |
6de9cd9a DN |
1196 | #define EXPR_FILENAME(NODE) \ |
1197 | (EXPR_CHECK (NODE)->exp.locus->file) | |
1198 | #define EXPR_LINENO(NODE) \ | |
1199 | (EXPR_CHECK (NODE)->exp.locus->line) | |
6de9cd9a | 1200 | #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL) |
c1667470 PB |
1201 | #define EXPR_LOCATION(NODE) \ |
1202 | (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION) | |
6de9cd9a | 1203 | #endif |
bf1e5319 | 1204 | |
6f30f1f1 | 1205 | /* In a TARGET_EXPR node. */ |
06790e5f ZW |
1206 | #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
1207 | #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) | |
1208 | #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) | |
6f30f1f1 | 1209 | |
350fae66 RK |
1210 | /* DECL_EXPR accessor. This gives access to the DECL associated with |
1211 | the given declaration statement. */ | |
1212 | #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) | |
1213 | ||
6de9cd9a DN |
1214 | #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
1215 | ||
1216 | /* SWITCH_EXPR accessors. These give access to the condition, body and | |
1217 | original condition type (before any compiler conversions) | |
1218 | of the switch statement, respectively. */ | |
1219 | #define SWITCH_COND(NODE) TREE_OPERAND ((NODE), 0) | |
1220 | #define SWITCH_BODY(NODE) TREE_OPERAND ((NODE), 1) | |
1221 | #define SWITCH_LABELS(NODE) TREE_OPERAND ((NODE), 2) | |
1222 | ||
8c161995 | 1223 | /* CASE_LABEL_EXPR accessors. These give access to the high and low values |
6de9cd9a DN |
1224 | of a case label, respectively. */ |
1225 | #define CASE_LOW(NODE) TREE_OPERAND ((NODE), 0) | |
1226 | #define CASE_HIGH(NODE) TREE_OPERAND ((NODE), 1) | |
1227 | #define CASE_LABEL(NODE) TREE_OPERAND ((NODE), 2) | |
1228 | ||
1229 | /* The operands of a BIND_EXPR. */ | |
1230 | #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) | |
1231 | #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) | |
1232 | #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) | |
1233 | ||
1234 | /* GOTO_EXPR accessor. This gives access to the label associated with | |
1235 | a goto statement. */ | |
1236 | #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) | |
1237 | ||
e130a54b | 1238 | /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the |
6de9cd9a DN |
1239 | instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and |
1240 | ASM_CLOBBERS represent the outputs, inputs, and clobbers for the | |
1241 | statement. */ | |
1242 | #define ASM_STRING(NODE) TREE_OPERAND ((NODE), 0) | |
1243 | #define ASM_OUTPUTS(NODE) TREE_OPERAND ((NODE), 1) | |
1244 | #define ASM_INPUTS(NODE) TREE_OPERAND ((NODE), 2) | |
1245 | #define ASM_CLOBBERS(NODE) TREE_OPERAND ((NODE), 3) | |
1246 | /* Nonzero if we want to create an ASM_INPUT instead of an | |
1247 | ASM_OPERAND with no operands. */ | |
1248 | #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE)) | |
1249 | #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE)) | |
1250 | ||
1251 | /* COND_EXPR accessors. */ | |
1252 | #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) | |
1253 | #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) | |
1254 | #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) | |
1255 | ||
1256 | /* LABEL_EXPR accessor. This gives access to the label associated with | |
1257 | the given label expression. */ | |
1258 | #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) | |
1259 | ||
1260 | /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other | |
1261 | accessors for SSA operands. */ | |
caf93cb0 | 1262 | |
6de9cd9a DN |
1263 | /* CATCH_EXPR accessors. */ |
1264 | #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) | |
1265 | #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) | |
1266 | ||
1267 | /* EH_FILTER_EXPR accessors. */ | |
1268 | #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) | |
1269 | #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) | |
1270 | #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE)) | |
1271 | ||
0f59171d RH |
1272 | /* OBJ_TYPE_REF accessors. */ |
1273 | #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) | |
1274 | #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) | |
1275 | #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) | |
1276 | ||
e2500fed | 1277 | struct tree_exp GTY(()) |
61131fa2 | 1278 | { |
2bf105ab | 1279 | struct tree_common common; |
c1667470 | 1280 | source_locus locus; |
61131fa2 | 1281 | int complexity; |
6de9cd9a | 1282 | tree block; |
46c5ad27 AJ |
1283 | tree GTY ((special ("tree_exp"), |
1284 | desc ("TREE_CODE ((tree) &%0)"))) | |
e2500fed | 1285 | operands[1]; |
61131fa2 RS |
1286 | }; |
1287 | \f | |
6de9cd9a DN |
1288 | /* SSA_NAME accessors. */ |
1289 | ||
1290 | /* Returns the variable being referenced. Once released, this is the | |
1291 | only field that can be relied upon. */ | |
1292 | #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var | |
1293 | ||
1294 | /* Returns the statement which defines this reference. Note that | |
1295 | we use the same field when chaining SSA_NAME nodes together on | |
1296 | the SSA_NAME freelist. */ | |
1297 | #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain | |
1298 | ||
1299 | /* Returns the SSA version number of this SSA name. Note that in | |
1300 | tree SSA, version numbers are not per variable and may be recycled. */ | |
1301 | #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version | |
1302 | ||
1303 | /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are | |
1304 | never output, so we can safely use the ASM_WRITTEN_FLAG for this | |
1305 | status bit. */ | |
1306 | #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ | |
1307 | SSA_NAME_CHECK (NODE)->common.asm_written_flag | |
1308 | ||
313679b0 | 1309 | /* Nonzero if this SSA_NAME expression is currently on the free list of |
6de9cd9a DN |
1310 | SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
1311 | has no meaning for an SSA_NAME. */ | |
1312 | #define SSA_NAME_IN_FREE_LIST(NODE) \ | |
1313 | SSA_NAME_CHECK (NODE)->common.nothrow_flag | |
1314 | ||
195da47b JL |
1315 | /* If NAME is equivalent to some other SSA_NAME or an invariant, then |
1316 | return the equivalent SSA_NAME or invariant, else return NULL. */ | |
6f2aec07 JL |
1317 | #define SSA_NAME_EQUIV(NAME) __extension__ \ |
1318 | ({ tree equiv = SSA_NAME_CHECK (NAME)->ssa_name.equiv; \ | |
1319 | if (equiv && TREE_CODE (equiv) == SSA_NAME) \ | |
1320 | equiv = ssa_name (SSA_NAME_VERSION (equiv)); \ | |
1321 | equiv; \ | |
1322 | }) | |
1323 | ||
195da47b JL |
1324 | /* Record that NAME (an SSA_NAME) is equivalent to EQUIV. */ |
1325 | ||
6f2aec07 JL |
1326 | #define SET_SSA_NAME_EQUIV(NAME, EQUIV)\ |
1327 | SSA_NAME_CHECK (NAME)->ssa_name.equiv = (EQUIV); | |
1328 | ||
313679b0 DN |
1329 | /* Attributes for SSA_NAMEs for pointer-type variables. */ |
1330 | #define SSA_NAME_PTR_INFO(N) \ | |
1331 | SSA_NAME_CHECK (N)->ssa_name.ptr_info | |
1332 | ||
7e6eb623 DB |
1333 | /* Get the value of this SSA_NAME, if available. */ |
1334 | #define SSA_NAME_VALUE(N) \ | |
1335 | SSA_NAME_CHECK (N)->ssa_name.value_handle | |
1336 | ||
5f240ec4 ZD |
1337 | /* Auxiliary pass-specific data. */ |
1338 | #define SSA_NAME_AUX(N) \ | |
1339 | SSA_NAME_CHECK (N)->ssa_name.aux | |
caf93cb0 | 1340 | |
ff2ad0f7 DN |
1341 | #ifndef _TREE_FLOW_H |
1342 | struct ptr_info_def; | |
313679b0 DN |
1343 | #endif |
1344 | ||
6de9cd9a DN |
1345 | struct tree_ssa_name GTY(()) |
1346 | { | |
1347 | struct tree_common common; | |
1348 | ||
1349 | /* _DECL wrapped by this SSA name. */ | |
1350 | tree var; | |
1351 | ||
6f2aec07 JL |
1352 | tree equiv; |
1353 | ||
6de9cd9a DN |
1354 | /* SSA version number. */ |
1355 | unsigned int version; | |
313679b0 DN |
1356 | |
1357 | /* Pointer attributes used for alias analysis. */ | |
1358 | struct ptr_info_def *ptr_info; | |
7e6eb623 | 1359 | |
caf93cb0 | 1360 | /* Value for SSA name used by GVN. */ |
7e6eb623 | 1361 | tree GTY((skip)) value_handle; |
5f240ec4 ZD |
1362 | |
1363 | /* Auxiliary information stored with the ssa name. */ | |
1364 | PTR GTY((skip)) aux; | |
6de9cd9a DN |
1365 | }; |
1366 | \f | |
1367 | /* In a PHI_NODE node. */ | |
d00ad49b AM |
1368 | #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result |
1369 | #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def | |
6de9cd9a | 1370 | |
17192884 SB |
1371 | /* PHI_NODEs for each basic block are chained together in a single linked |
1372 | list. The head of the list is linked from the block annotation, and | |
1373 | the link to the next PHI is in PHI_CHAIN. */ | |
1374 | #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE)) | |
1375 | ||
6de9cd9a DN |
1376 | /* Nonzero if the PHI node was rewritten by a previous pass through the |
1377 | SSA renamer. */ | |
d00ad49b AM |
1378 | #define PHI_REWRITTEN(NODE) PHI_NODE_CHECK (NODE)->phi.rewritten |
1379 | #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args | |
1380 | #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity | |
1381 | #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I) | |
1382 | #define PHI_ARG_EDGE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).e | |
1383 | #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero | |
30d396e3 ZD |
1384 | #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb |
1385 | #define PHI_DF(NODE) PHI_NODE_CHECK (NODE)->phi.df | |
6de9cd9a DN |
1386 | |
1387 | struct edge_def; | |
1388 | ||
1389 | struct phi_arg_d GTY(()) | |
1390 | { | |
1391 | tree def; | |
1392 | struct edge_def * GTY((skip (""))) e; | |
dd747311 | 1393 | bool nonzero; |
6de9cd9a DN |
1394 | }; |
1395 | ||
1396 | struct tree_phi_node GTY(()) | |
1397 | { | |
1398 | struct tree_common common; | |
1399 | tree result; | |
1400 | int num_args; | |
1401 | int capacity; | |
1402 | ||
1403 | /* Nonzero if the PHI node was rewritten by a previous pass through the | |
1404 | SSA renamer. */ | |
1405 | int rewritten; | |
1406 | ||
30d396e3 ZD |
1407 | /* Basic block to that the phi node belongs. */ |
1408 | struct basic_block_def *bb; | |
1409 | ||
1410 | /* Dataflow information. */ | |
1411 | struct dataflow_d *df; | |
1412 | ||
6de9cd9a DN |
1413 | struct phi_arg_d GTY ((length ("((tree)&%h)->phi.capacity"))) a[1]; |
1414 | }; | |
1415 | \f | |
1416 | ||
1417 | struct varray_head_tag; | |
1418 | ||
8da1b058 | 1419 | /* In a BLOCK node. */ |
12b195d9 | 1420 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
12b195d9 ML |
1421 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
1422 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
8da1b058 RS |
1423 | /* Note: when changing this, make sure to find the places |
1424 | that use chainon or nreverse. */ | |
a901fa64 | 1425 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) |
12b195d9 ML |
1426 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
1427 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
8da1b058 RS |
1428 | |
1429 | /* Nonzero means that this block is prepared to handle exceptions | |
1430 | listed in the BLOCK_VARS slot. */ | |
c46080ab RK |
1431 | #define BLOCK_HANDLER_BLOCK(NODE) \ |
1432 | (BLOCK_CHECK (NODE)->block.handler_block_flag) | |
8da1b058 | 1433 | |
18c038b9 MM |
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 | ||
a20612aa RH |
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 | |
41077ce4 | 1458 | be null. The list of fragments will be chained through |
a20612aa RH |
1459 | BLOCK_FRAGMENT_CHAIN from the origin. */ |
1460 | ||
c46080ab RK |
1461 | #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
1462 | #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) | |
a20612aa | 1463 | |
e2500fed | 1464 | struct tree_block GTY(()) |
8da1b058 | 1465 | { |
2bf105ab | 1466 | struct tree_common common; |
61131fa2 RS |
1467 | |
1468 | unsigned handler_block_flag : 1; | |
1469 | unsigned abstract_flag : 1; | |
a84efb51 | 1470 | unsigned block_num : 30; |
61131fa2 | 1471 | |
2f78c311 ZW |
1472 | tree vars; |
1473 | tree subblocks; | |
1474 | tree supercontext; | |
1475 | tree abstract_origin; | |
1476 | tree fragment_origin; | |
1477 | tree fragment_chain; | |
8da1b058 RS |
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. | |
eb34af89 RK |
1483 | Look at the documentation of the various ..._TYPE tree codes. |
1484 | ||
d1a6adeb | 1485 | Note that the type.values, type.minval, and type.maxval fields are |
eb34af89 RK |
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. */ | |
8da1b058 | 1490 | |
12b195d9 ML |
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) | |
eb34af89 | 1495 | #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values) |
5c5214a9 | 1496 | #define TYPE_DOMAIN(NODE) (SET_OR_ARRAY_CHECK (NODE)->type.values) |
95b4aca6 | 1497 | #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values) |
89b0433e NS |
1498 | #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values) |
1499 | #define TYPE_ORIG_SIZE_TYPE(NODE) \ | |
1500 | (INTEGER_TYPE_CHECK (NODE)->type.values \ | |
1501 | ? TREE_TYPE ((NODE)->type.values) : NULL_TREE) | |
95b4aca6 NS |
1502 | #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval) |
1503 | #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval) | |
eb34af89 RK |
1504 | #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values) |
1505 | #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval) | |
1506 | #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval) | |
12b195d9 ML |
1507 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) |
1508 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
22421b79 RK |
1509 | #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval) |
1510 | #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval) | |
eb34af89 RK |
1511 | #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval) |
1512 | #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval) | |
12b195d9 ML |
1513 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) |
1514 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
1515 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
e2500fed | 1516 | #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) |
12b195d9 ML |
1517 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) |
1518 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
1519 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
12b195d9 | 1520 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) |
12b195d9 | 1521 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) |
8da1b058 | 1522 | |
4061f623 BS |
1523 | /* For a VECTOR_TYPE node, this describes a different type which is emitted |
1524 | in the debugging output. We use this to describe a vector as a | |
1525 | structure containing an array. */ | |
5c5214a9 | 1526 | #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values) |
4061f623 | 1527 | |
95b4aca6 | 1528 | /* For record and union types, information about this type, as a base type |
8c27b7d4 | 1529 | for itself. */ |
95b4aca6 NS |
1530 | #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo) |
1531 | ||
1532 | /* For non record and union types, used in a language-dependent way. */ | |
1533 | #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo) | |
8ff0c1af | 1534 | |
41472af8 MM |
1535 | /* The (language-specific) typed-based alias set for this type. |
1536 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
1537 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
1538 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
1539 | type can alias objects of any type. */ | |
1540 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
1541 | ||
1542 | /* Nonzero iff the typed-based alias set for this type has been | |
1543 | calculated. */ | |
c46080ab | 1544 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) |
41472af8 | 1545 | |
bad1b4ba RK |
1546 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
1547 | to this type. */ | |
12b195d9 | 1548 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
bad1b4ba | 1549 | |
869637e6 RS |
1550 | /* The alignment necessary for objects of this type. |
1551 | The value is an int, measured in bits. */ | |
12b195d9 | 1552 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
869637e6 | 1553 | |
11cf4d18 JJ |
1554 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1555 | 0 if it is the default for this type. */ | |
1556 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) | |
1557 | ||
834c6dff | 1558 | /* The alignment for NODE, in bytes. */ |
c46080ab | 1559 | #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
834c6dff | 1560 | |
2b5f2501 RH |
1561 | /* If your language allows you to declare types, and you want debug info |
1562 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
1563 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
1564 | type node. You then set the TYPE_STUB_DECL field of the type node | |
1565 | to point back at the TYPE_DECL node. This allows the debug routines | |
1566 | to know that the two nodes represent the same type, so that we only | |
2ba84f36 | 1567 | get one debug info record for them. */ |
c46080ab | 1568 | #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) |
8da1b058 | 1569 | |
3635a54b RK |
1570 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
1571 | has BLKmode only because it lacks the alignment requirement for | |
1572 | its size. */ | |
12b195d9 | 1573 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
8da1b058 | 1574 | |
e36308b0 MM |
1575 | /* In an INTEGER_TYPE, it means the type represents a size. We use |
1576 | this both for validity checking and to permit optimizations that | |
1577 | are unsafe for other types. Note that the C `size_t' type should | |
1578 | *not* have this flag set. The `size_t' type is simply a typedef | |
1579 | for an ordinary integer type that happens to be the type of an | |
1580 | expression returned by `sizeof'; `size_t' has no special | |
1581 | properties. Expressions whose type have TYPE_IS_SIZETYPE set are | |
1582 | always actual sizes. */ | |
7393c642 RK |
1583 | #define TYPE_IS_SIZETYPE(NODE) \ |
1584 | (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) | |
1585 | ||
1586 | /* In a FUNCTION_TYPE, indicates that the function returns with the stack | |
1587 | pointer depressed. */ | |
1588 | #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ | |
199acebb | 1589 | (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) |
fed3cef0 | 1590 | |
8da1b058 | 1591 | /* Nonzero in a type considered volatile as a whole. */ |
50e9f73a | 1592 | #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag) |
8da1b058 RS |
1593 | |
1594 | /* Means this type is const-qualified. */ | |
50e9f73a | 1595 | #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag) |
8da1b058 | 1596 | |
3932261a MM |
1597 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
1598 | the term. */ | |
1599 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
1600 | ||
1601 | /* There is a TYPE_QUAL value for each type qualifier. They can be | |
1602 | combined by bitwise-or to form the complete set of qualifiers for a | |
1603 | type. */ | |
1604 | ||
1605 | #define TYPE_UNQUALIFIED 0x0 | |
1606 | #define TYPE_QUAL_CONST 0x1 | |
1607 | #define TYPE_QUAL_VOLATILE 0x2 | |
1608 | #define TYPE_QUAL_RESTRICT 0x4 | |
1609 | ||
1610 | /* The set of type qualifiers for this type. */ | |
a6d7adfd GM |
1611 | #define TYPE_QUALS(NODE) \ |
1612 | ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
1613 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
66804d9e | 1614 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) |
3932261a | 1615 | |
9f86614b | 1616 | /* These flags are available for each language front end to use internally. */ |
12b195d9 ML |
1617 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
1618 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
1619 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
1620 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
1621 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
1622 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
1623 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
8da1b058 | 1624 | |
6de9cd9a DN |
1625 | /* Used to keep track of visited nodes in tree traversals. This is set to |
1626 | 0 by copy_node and make_node. */ | |
1627 | #define TREE_VISITED(NODE) ((NODE)->common.visited) | |
1628 | ||
74a3fd26 PB |
1629 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
1630 | that distinguish string from array of char). | |
2ba84f36 | 1631 | If set in a SET_TYPE, indicates a bitstring type. */ |
12b195d9 | 1632 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
74a3fd26 | 1633 | |
4fe9b91c | 1634 | /* If non-NULL, this is an upper bound of the size (in bytes) of an |
c46080ab RK |
1635 | object of the given ARRAY_TYPE. This allows temporaries to be |
1636 | allocated. */ | |
1637 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ | |
a6002f8d | 1638 | (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval) |
2fb2b21c | 1639 | |
0b4565c9 | 1640 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
c46080ab | 1641 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ |
26277d41 | 1642 | (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision) |
0b4565c9 | 1643 | |
cd3ce9b4 | 1644 | /* Indicates that objects of this type must be initialized by calling a |
4ac3d994 | 1645 | function when they are created. */ |
2bf105ab RK |
1646 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
1647 | (TYPE_CHECK (NODE)->type.needs_constructing_flag) | |
4ac3d994 | 1648 | |
adb23061 RK |
1649 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
1650 | the same way that the first union alternative would be passed. */ | |
2bf105ab RK |
1651 | #define TYPE_TRANSPARENT_UNION(NODE) \ |
1652 | (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
1653 | ||
1654 | /* For an ARRAY_TYPE, indicates that it is not permitted to | |
1655 | take the address of a component of the type. */ | |
1656 | #define TYPE_NONALIASED_COMPONENT(NODE) \ | |
1657 | (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
adb23061 | 1658 | |
956d6950 | 1659 | /* Indicated that objects of this type should be laid out in as |
9e357cd8 | 1660 | compact a way as possible. */ |
12b195d9 | 1661 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
9e357cd8 | 1662 | |
a5bfe141 RH |
1663 | /* Used by type_contains_placeholder_p to avoid recomputation. |
1664 | Values are: 0 (unknown), 1 (false), 2 (true). Never access | |
1665 | this field directly. */ | |
1666 | #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ | |
1667 | (TYPE_CHECK (NODE)->type.contains_placeholder_bits) | |
1668 | ||
e2500fed GK |
1669 | struct die_struct; |
1670 | ||
1671 | struct tree_type GTY(()) | |
8da1b058 | 1672 | { |
2bf105ab | 1673 | struct tree_common common; |
2f78c311 ZW |
1674 | tree values; |
1675 | tree size; | |
1676 | tree size_unit; | |
1677 | tree attributes; | |
b3ddc3ab | 1678 | unsigned int uid; |
8da1b058 | 1679 | |
b3ddc3ab | 1680 | unsigned int precision : 9; |
c149cc37 | 1681 | ENUM_BITFIELD(machine_mode) mode : 7; |
bad1b4ba | 1682 | |
74a3fd26 | 1683 | unsigned string_flag : 1; |
8da1b058 | 1684 | unsigned no_force_blk_flag : 1; |
4ac3d994 | 1685 | unsigned needs_constructing_flag : 1; |
adb23061 | 1686 | unsigned transparent_union_flag : 1; |
9e357cd8 | 1687 | unsigned packed_flag : 1; |
3932261a | 1688 | unsigned restrict_flag : 1; |
a5bfe141 | 1689 | unsigned contains_placeholder_bits : 2; |
3932261a | 1690 | |
8da1b058 RS |
1691 | unsigned lang_flag_0 : 1; |
1692 | unsigned lang_flag_1 : 1; | |
1693 | unsigned lang_flag_2 : 1; | |
1694 | unsigned lang_flag_3 : 1; | |
1695 | unsigned lang_flag_4 : 1; | |
1696 | unsigned lang_flag_5 : 1; | |
1697 | unsigned lang_flag_6 : 1; | |
11cf4d18 | 1698 | unsigned user_align : 1; |
8da1b058 | 1699 | |
69b78d8d | 1700 | unsigned int align; |
2f78c311 ZW |
1701 | tree pointer_to; |
1702 | tree reference_to; | |
e2500fed | 1703 | union tree_type_symtab { |
46c5ad27 AJ |
1704 | int GTY ((tag ("0"))) address; |
1705 | char * GTY ((tag ("1"))) pointer; | |
17211ab5 | 1706 | struct die_struct * GTY ((tag ("2"))) die; |
46c5ad27 | 1707 | } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"), |
e2500fed | 1708 | descbits ("2"))) symtab; |
2f78c311 ZW |
1709 | tree name; |
1710 | tree minval; | |
1711 | tree maxval; | |
1712 | tree next_variant; | |
1713 | tree main_variant; | |
1714 | tree binfo; | |
2f78c311 | 1715 | tree context; |
3bdf5ad1 | 1716 | HOST_WIDE_INT alias_set; |
8da1b058 RS |
1717 | /* Points to a structure whose details depend on the language in use. */ |
1718 | struct lang_type *lang_specific; | |
1719 | }; | |
1720 | \f | |
1721 | /* Define accessor macros for information about type inheritance | |
1722 | and basetypes. | |
1723 | ||
1724 | A "basetype" means a particular usage of a data type for inheritance | |
1725 | in another type. Each such basetype usage has its own "binfo" | |
1726 | object to describe it. The binfo object is a TREE_VEC node. | |
1727 | ||
1728 | Inheritance is represented by the binfo nodes allocated for a | |
1729 | given type. For example, given types C and D, such that D is | |
1730 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
1731 | the binfo properties of C, similarly one for D, and one for | |
1732 | describing the binfo properties of D as a base type for C. | |
1733 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
1734 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
1735 | ||
809e3e7f NS |
1736 | /* BINFO specific flags. */ |
1737 | ||
1738 | /* Nonzero means that the derivation chain is via a `virtual' declaration. */ | |
1739 | #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag) | |
1740 | ||
1741 | /* Flags for language dependent use. */ | |
1742 | #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) | |
1743 | #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) | |
1744 | #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) | |
1745 | #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) | |
1746 | #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) | |
1747 | #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) | |
1748 | #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) | |
1749 | ||
8da1b058 | 1750 | /* The actual data type node being inherited in this basetype. */ |
95b4aca6 | 1751 | #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) |
8da1b058 RS |
1752 | |
1753 | /* The offset where this basetype appears in its containing type. | |
1754 | BINFO_OFFSET slot holds the offset (in bytes) | |
1755 | from the base of the complete object to the base of the part of the | |
1756 | object that is allocated on behalf of this `type'. | |
1757 | This is always 0 except when there is multiple inheritance. */ | |
41077ce4 | 1758 | |
95b4aca6 | 1759 | #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) |
7d02bbef | 1760 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
8da1b058 RS |
1761 | |
1762 | /* The virtual function table belonging to this basetype. Virtual | |
1763 | function tables provide a mechanism for run-time method dispatching. | |
1764 | The entries of a virtual function table are language-dependent. */ | |
1765 | ||
95b4aca6 | 1766 | #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) |
8da1b058 RS |
1767 | |
1768 | /* The virtual functions in the virtual function table. This is | |
1769 | a TREE_LIST that is used as an initial approximation for building | |
1770 | a virtual function table for this basetype. */ | |
95b4aca6 | 1771 | #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) |
8da1b058 | 1772 | |
0430641b MM |
1773 | /* A vector of binfos for the direct basetypes inherited by this |
1774 | basetype. | |
8da1b058 | 1775 | |
0430641b MM |
1776 | If this basetype describes type D as inherited in C, and if the |
1777 | basetypes of D are E and F, then this vector contains binfos for | |
fa743e8c NS |
1778 | inheritance of E and F by C. */ |
1779 | #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) | |
8da1b058 | 1780 | |
5e1677bc | 1781 | /* The number of basetypes for NODE. */ |
fa743e8c | 1782 | #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE))) |
5e1677bc | 1783 | |
604a3205 | 1784 | /* Accessor macro to get to the Nth base binfo of this binfo. */ |
fa743e8c NS |
1785 | #define BINFO_BASE_BINFO(NODE,N) \ |
1786 | (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N))) | |
1787 | #define BINFO_BASE_ITERATE(NODE,N,B) \ | |
1788 | (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B))) | |
1789 | #define BINFO_BASE_APPEND(NODE,T) \ | |
1790 | (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T))) | |
7d02bbef | 1791 | |
39ac3e4f MM |
1792 | /* For a BINFO record describing a virtual base class, i.e., one where |
1793 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
1824b90d NS |
1794 | base. The actual contents are language-dependent. In the C++ |
1795 | front-end this field is an INTEGER_CST giving an offset into the | |
1796 | vtable where the offset to the virtual base can be found. */ | |
95b4aca6 | 1797 | #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) |
2cc3ac7a | 1798 | |
dbbf88d1 NS |
1799 | /* Indicates the accesses this binfo has to its bases. The values are |
1800 | access_public_node, access_protected_node or access_private_node. | |
1801 | If this array is not present, public access is implied. */ | |
604a3205 | 1802 | #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) |
63d1c7b3 NS |
1803 | |
1804 | #define BINFO_BASE_ACCESS(NODE,N) \ | |
1805 | VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N)) | |
1806 | #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ | |
1807 | VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T)) | |
dbbf88d1 | 1808 | |
fa743e8c NS |
1809 | /* The index in the VTT where this subobject's sub-VTT can be found. |
1810 | NULL_TREE if there is no sub-VTT. */ | |
1811 | #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) | |
dbbf88d1 | 1812 | |
fa743e8c NS |
1813 | /* The index in the VTT where the vptr for this subobject can be |
1814 | found. NULL_TREE if there is no secondary vptr in the VTT. */ | |
1815 | #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) | |
1816 | ||
604a3205 NS |
1817 | /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base |
1818 | inheriting this base for non-virtual bases. For virtual bases it | |
fc6633e0 NS |
1819 | points either to the binfo for which this is a primary binfo, or to |
1820 | the binfo of the most derived type. */ | |
95b4aca6 NS |
1821 | #define BINFO_INHERITANCE_CHAIN(NODE) \ |
1822 | (TREE_BINFO_CHECK(NODE)->binfo.inheritance) | |
1823 | ||
1824 | struct tree_binfo GTY (()) | |
1825 | { | |
1826 | struct tree_common common; | |
1827 | ||
1828 | tree offset; | |
1829 | tree vtable; | |
1830 | tree virtuals; | |
95b4aca6 | 1831 | tree vptr_field; |
63d1c7b3 | 1832 | VEC(tree) *base_accesses; |
95b4aca6 NS |
1833 | tree inheritance; |
1834 | ||
fa743e8c NS |
1835 | tree vtt_subvtt; |
1836 | tree vtt_vptr; | |
fa743e8c NS |
1837 | |
1838 | VEC(tree) base_binfos; | |
95b4aca6 | 1839 | }; |
95b4aca6 | 1840 | |
8da1b058 RS |
1841 | \f |
1842 | /* Define fields and accessors for nodes representing declared names. */ | |
1843 | ||
6de9cd9a DN |
1844 | /* Nonzero if DECL represents a variable for the SSA passes. */ |
1845 | #define SSA_VAR_P(DECL) \ | |
1846 | (TREE_CODE (DECL) == VAR_DECL \ | |
1847 | || TREE_CODE (DECL) == PARM_DECL \ | |
1848 | || TREE_CODE (DECL) == RESULT_DECL \ | |
1849 | || (TREE_CODE (DECL) == SSA_NAME \ | |
1850 | && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ | |
1851 | || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ | |
1852 | || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL))) | |
1853 | ||
8da1b058 RS |
1854 | /* This is the name of the object as written by the user. |
1855 | It is an IDENTIFIER_NODE. */ | |
12b195d9 | 1856 | #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) |
c46080ab | 1857 | |
92643fea MM |
1858 | /* The name of the object as the assembler will see it (but before any |
1859 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
1860 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
599bba86 | 1861 | #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) |
c46080ab | 1862 | |
0e9e1e0a | 1863 | /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, |
c46080ab RK |
1864 | the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set |
1865 | yet. */ | |
92643fea MM |
1866 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ |
1867 | (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE) | |
c46080ab | 1868 | |
92643fea MM |
1869 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ |
1870 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
1871 | (DECL_CHECK (NODE)->decl.assembler_name = (NAME)) | |
c46080ab RK |
1872 | |
1873 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's | |
1874 | DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause | |
1875 | the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the | |
1876 | semantics of using this macro, are different than saying: | |
41077ce4 | 1877 | |
92643fea MM |
1878 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) |
1879 | ||
1880 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ | |
c46080ab | 1881 | |
92643fea MM |
1882 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ |
1883 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
41077ce4 KH |
1884 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ |
1885 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
92643fea MM |
1886 | : (void) 0) |
1887 | ||
868e8789 DE |
1888 | /* Records the section name in a section attribute. Used to pass |
1889 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
12b195d9 | 1890 | #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) |
c46080ab | 1891 | |
d1bd0ded GK |
1892 | /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
1893 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
1894 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
1895 | points to either the FUNCTION_DECL for the containing function, | |
1896 | the RECORD_TYPE or UNION_TYPE for the containing type, or | |
1897 | NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file | |
1898 | scope". */ | |
12b195d9 | 1899 | #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) |
770ae6cc | 1900 | #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context) |
91d231cb JM |
1901 | /* In a DECL this is the field where attributes are stored. */ |
1902 | #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes) | |
770ae6cc RK |
1903 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the |
1904 | byte containing the bit closest to the beginning of the structure. */ | |
1905 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments) | |
1906 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
1907 | field from DECL_FIELD_OFFSET. */ | |
1908 | #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t) | |
8da1b058 | 1909 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and |
8e148bef RS |
1910 | if so, the type that was originally specified for it. |
1911 | TREE_TYPE may have been modified (in finish_struct). */ | |
770ae6cc | 1912 | #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result) |
c46080ab RK |
1913 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. |
1914 | VAR_DECL and PARM_DECL reserve the arguments slot for language-specific | |
1915 | uses. */ | |
12b195d9 | 1916 | #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) |
17aec3eb RK |
1917 | /* This field is used to reference anything in decl.result and is meant only |
1918 | for use by the garbage collector. */ | |
1919 | #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result) | |
8da1b058 | 1920 | /* In FUNCTION_DECL, holds the decl for the return value. */ |
770ae6cc | 1921 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result) |
9506a28d | 1922 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
770ae6cc | 1923 | #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result) |
8da1b058 | 1924 | /* In PARM_DECL, holds the type as written (perhaps a function or array). */ |
770ae6cc | 1925 | #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result) |
8da1b058 | 1926 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
d1bd0ded | 1927 | For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
8da1b058 RS |
1928 | For a VAR_DECL, holds the initial value. |
1929 | For a PARM_DECL, not used--default | |
1930 | values for parameters are encoded in the type of the function, | |
4f976745 RK |
1931 | not in the PARM_DECL slot. |
1932 | ||
1933 | ??? Need to figure out some way to check this isn't a PARM_DECL. */ | |
12b195d9 | 1934 | #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) |
8da1b058 RS |
1935 | /* For a PARM_DECL, records the data type used to pass the argument, |
1936 | which may be different from the type seen in the program. */ | |
770ae6cc | 1937 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial) |
3635a54b RK |
1938 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
1939 | if nonzero, indicates that the field occupies the type. */ | |
770ae6cc | 1940 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial) |
f31686a3 RH |
1941 | /* These two fields describe where in the source code the declaration |
1942 | was. If the declaration appears in several places (as for a C | |
1943 | function that is declared first and then defined later), this | |
1944 | information should refer to the definition. */ | |
1945 | #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus) | |
c1667470 PB |
1946 | #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) |
1947 | #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) | |
1948 | #ifdef USE_MAPPED_LOCATION | |
1949 | #define DECL_IS_BUILTIN(DECL) \ | |
1950 | (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) | |
1951 | #else | |
1952 | #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0) | |
1953 | #endif | |
06ceef4e | 1954 | /* Holds the size of the datum, in bits, as a tree expression. |
8da1b058 | 1955 | Need not be constant. */ |
12b195d9 | 1956 | #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) |
06ceef4e RK |
1957 | /* Likewise for the size in bytes. */ |
1958 | #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit) | |
971774bb | 1959 | /* Holds the alignment required for the datum, in bits. */ |
770ae6cc | 1960 | #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align) |
971774bb MM |
1961 | /* The alignment of NODE, in bytes. */ |
1962 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
2f5c7f45 GK |
1963 | /* For FIELD_DECLs, off_align holds the number of low-order bits of |
1964 | DECL_FIELD_OFFSET which are known to be always zero. | |
1965 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
1966 | has. */ | |
1967 | #define DECL_OFFSET_ALIGN(NODE) \ | |
1968 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align) | |
1969 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
1970 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
1971 | (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X))) | |
11cf4d18 JJ |
1972 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
1973 | 0 if it is the default for this type. */ | |
1974 | #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align) | |
17c73321 RK |
1975 | /* Holds the machine mode corresponding to the declaration of a variable or |
1976 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
1977 | FIELD_DECL. */ | |
12b195d9 | 1978 | #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) |
616f6d84 | 1979 | /* Holds the RTL expression for the value of a variable or function. |
19e7881c MM |
1980 | This value can be evaluated lazily for functions, variables with |
1981 | static storage duration, and labels. */ | |
1982 | #define DECL_RTL(NODE) \ | |
1983 | (DECL_CHECK (NODE)->decl.rtl \ | |
1984 | ? (NODE)->decl.rtl \ | |
0e6df31e | 1985 | : (make_decl_rtl (NODE), (NODE)->decl.rtl)) |
19e7881c | 1986 | /* Set the DECL_RTL for NODE to RTL. */ |
a560d4d4 | 1987 | #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) |
0e9e1e0a | 1988 | /* Returns nonzero if the DECL_RTL for NODE has already been set. */ |
c46080ab | 1989 | #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL) |
19e7881c MM |
1990 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for |
1991 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
1992 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
1993 | (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl) | |
1994 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
c46080ab RK |
1995 | #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) |
1996 | ||
8da1b058 RS |
1997 | /* For PARM_DECL, holds an RTL for the stack slot or register |
1998 | where the data was actually passed. */ | |
770ae6cc | 1999 | #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r) |
c46080ab | 2000 | |
1da326c3 SB |
2001 | /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") |
2002 | that describes the status of this function. */ | |
2003 | #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f) | |
c46080ab | 2004 | |
66321686 RS |
2005 | /* For FUNCTION_DECL, if it is built-in, |
2006 | this identifies which built-in operation it is. */ | |
770ae6cc | 2007 | #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f) |
8da1b058 RS |
2008 | |
2009 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
2010 | Before the struct containing the FUNCTION_DECL is laid out, | |
2011 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
2012 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
2013 | function. When the class is laid out, this pointer is changed | |
2014 | to an INTEGER_CST node which is suitable for use as an index | |
2015 | into the virtual function table. */ | |
12b195d9 | 2016 | #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) |
c46080ab | 2017 | |
8da1b058 RS |
2018 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in |
2019 | which this FIELD_DECL is defined. This information is needed when | |
2020 | writing debugging information about vfield and vbase decls for C++. */ | |
770ae6cc | 2021 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex) |
8da1b058 | 2022 | |
0e77444b | 2023 | /* Every ..._DECL node gets a unique number. */ |
12b195d9 | 2024 | #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) |
0e77444b | 2025 | |
c5caa350 CH |
2026 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
2027 | decl node which this decl is an instance of, or else it is NULL indicating | |
4a7d05dc DE |
2028 | that this decl is not an instance of some other decl. For example, |
2029 | in a nested declaration of an inline function, this points back to the | |
2030 | definition. */ | |
12b195d9 | 2031 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) |
c5caa350 | 2032 | |
02e24c7a MM |
2033 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract |
2034 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
2035 | #define DECL_ORIGIN(NODE) \ | |
b9daac31 | 2036 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) |
02e24c7a | 2037 | |
f93dacbd RK |
2038 | /* Nonzero for any sort of ..._DECL node means this decl node represents an |
2039 | inline instance of some original (abstract) decl from an inline function; | |
2040 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
2ba84f36 | 2041 | nodes can also have their abstract origin set to themselves. */ |
b9daac31 | 2042 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ |
3d62d651 | 2043 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) |
8da1b058 RS |
2044 | |
2045 | /* Nonzero if a _DECL means that the name of this decl should be ignored | |
2046 | for symbolic debug purposes. */ | |
12b195d9 | 2047 | #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) |
8da1b058 | 2048 | |
c5caa350 CH |
2049 | /* Nonzero for a given ..._DECL node means that this node represents an |
2050 | "abstract instance" of the given declaration (e.g. in the original | |
2051 | declaration of an inline function). When generating symbolic debugging | |
9faa82d8 | 2052 | information, we mustn't try to generate any address information for nodes |
c5caa350 CH |
2053 | marked as "abstract instances" because we don't actually generate |
2054 | any code or allocate any data space for such instances. */ | |
12b195d9 | 2055 | #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) |
c5caa350 | 2056 | |
3110a56e RS |
2057 | /* Nonzero if a _DECL means that no warnings should be generated just |
2058 | because this decl is unused. */ | |
c46080ab RK |
2059 | #define DECL_IN_SYSTEM_HEADER(NODE) \ |
2060 | (DECL_CHECK (NODE)->decl.in_system_header_flag) | |
3110a56e | 2061 | |
2c0d84d6 MS |
2062 | /* Nonzero for a given ..._DECL node means that this node should be |
2063 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
2064 | is not error_mark_node, then the decl cannot be put in .common. */ | |
12b195d9 | 2065 | #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) |
2c0d84d6 | 2066 | |
3110a56e | 2067 | /* Language-specific decl information. */ |
12b195d9 | 2068 | #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) |
8da1b058 RS |
2069 | |
2070 | /* In a VAR_DECL or FUNCTION_DECL, | |
2071 | nonzero means external reference: | |
2072 | do not allocate storage, and refer to a definition elsewhere. */ | |
12b195d9 | 2073 | #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) |
8da1b058 | 2074 | |
2ce3c6c6 | 2075 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
14b493d6 | 2076 | initializations. */ |
2ce3c6c6 JM |
2077 | #define DEFAULT_INIT_PRIORITY 65535 |
2078 | #define MAX_INIT_PRIORITY 65535 | |
9a6e70c9 | 2079 | #define MAX_RESERVED_INIT_PRIORITY 100 |
2ce3c6c6 | 2080 | |
60e9e4b7 DE |
2081 | /* In a TYPE_DECL |
2082 | nonzero means the detail info about this type is not dumped into stabs. | |
41077ce4 | 2083 | Instead it will generate cross reference ('x') of names. |
2ba84f36 | 2084 | This uses the same flag as DECL_EXTERNAL. */ |
770ae6cc | 2085 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ |
c46080ab | 2086 | (TYPE_DECL_CHECK (NODE)->decl.external_flag) |
60e9e4b7 | 2087 | |
a5f99f01 | 2088 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
12b195d9 | 2089 | #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) |
c46080ab | 2090 | |
a5f99f01 RK |
2091 | /* In LABEL_DECL nodes, nonzero means that an error message about |
2092 | jumping into such a binding contour has been printed for this label. */ | |
770ae6cc | 2093 | #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag) |
c46080ab | 2094 | |
5a1c7968 | 2095 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
770ae6cc | 2096 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag) |
c46080ab | 2097 | |
0e9e1e0a | 2098 | /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a |
a5f99f01 | 2099 | static chain is not needed. */ |
770ae6cc | 2100 | #define DECL_NO_STATIC_CHAIN(NODE) \ |
c46080ab | 2101 | (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag) |
8da1b058 RS |
2102 | |
2103 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
2104 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
2105 | ||
2106 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
2107 | ||
2108 | Also set in some languages for variables, etc., outside the normal | |
2109 | lexical scope, such as class instance variables. */ | |
12b195d9 | 2110 | #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) |
8da1b058 RS |
2111 | |
2112 | /* Nonzero in a FUNCTION_DECL means this function can be substituted | |
2113 | where it is called. */ | |
770ae6cc | 2114 | #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag) |
8da1b058 | 2115 | |
b3c3af2f SB |
2116 | /* Nonzero in a FUNCTION_DECL means that this function was declared inline, |
2117 | such as via the `inline' keyword in C/C++. This flag controls the linkage | |
2118 | semantics of 'inline'; whether or not the function is inlined is | |
2119 | controlled by DECL_INLINE. */ | |
2120 | #define DECL_DECLARED_INLINE_P(NODE) \ | |
2121 | (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag) | |
bc522472 | 2122 | |
48eb4e53 RK |
2123 | /* Nonzero in a decl means that the gimplifier has seen (or placed) |
2124 | this variable in a BIND_EXPR. */ | |
2125 | #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ | |
2126 | (DECL_CHECK (NODE)->decl.seen_in_bind_expr) | |
2127 | ||
6de9cd9a DN |
2128 | /* In a VAR_DECL, nonzero if the decl is a register variable with |
2129 | an explicit asm specification. */ | |
2130 | #define DECL_HARD_REGISTER(NODE) (DECL_CHECK (NODE)->decl.inline_flag) | |
2131 | ||
968b41a1 MA |
2132 | /* Value of the decls's visibility attribute */ |
2133 | #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility) | |
2134 | ||
d7afec4b ND |
2135 | /* Nonzero means that the decl had its visibility specified rather than |
2136 | being inferred. */ | |
2137 | #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_CHECK (NODE)->decl.visibility_specified) | |
2138 | ||
5daf7c0a JM |
2139 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ |
2140 | #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable) | |
2141 | ||
41077ce4 | 2142 | /* In a VAR_DECL, nonzero if the data should be allocated from |
3d78f2e9 RH |
2143 | thread-local storage. */ |
2144 | #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag) | |
2145 | ||
588d3ade | 2146 | /* In a FUNCTION_DECL, the saved representation of the body of the |
5882f0f3 | 2147 | entire function. */ |
588d3ade AO |
2148 | #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree) |
2149 | ||
1a186ec5 RH |
2150 | /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, |
2151 | if transformations have made this more complicated than evaluating the | |
2152 | decl itself. This should only be used for debugging; once this field has | |
2153 | been set, the decl itself may not legitimately appear in the function. */ | |
2154 | #define DECL_VALUE_EXPR(NODE) \ | |
2155 | (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl.saved_tree) | |
2156 | ||
684d9f3b | 2157 | /* List of FUNCTION_DECLs inlined into this function's body. */ |
588d3ade AO |
2158 | #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns) |
2159 | ||
140592a0 AG |
2160 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
2161 | as if it were a malloc, meaning it returns a pointer that is | |
2162 | not an alias. */ | |
770ae6cc | 2163 | #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag) |
140592a0 | 2164 | |
2a8f6b90 JH |
2165 | /* Nonzero in a FUNCTION_DECL means this function should be treated |
2166 | as "pure" function (like const function, but may read global memory). */ | |
2167 | #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag) | |
2168 | ||
8da1b058 RS |
2169 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
2170 | specially. */ | |
770ae6cc | 2171 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag) |
c46080ab | 2172 | |
12a22e76 | 2173 | /* Unused in FUNCTION_DECL. */ |
26db82d8 | 2174 | |
b8af45d0 RS |
2175 | /* In a VAR_DECL that's static, |
2176 | nonzero if the space is in the text section. */ | |
770ae6cc | 2177 | #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag) |
8da1b058 | 2178 | |
12a22e76 JM |
2179 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
2180 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
c46080ab | 2181 | |
12a22e76 | 2182 | /* For a builtin function, identify which part of the compiler defined it. */ |
770ae6cc | 2183 | #define DECL_BUILT_IN_CLASS(NODE) \ |
c46080ab | 2184 | (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class) |
12a22e76 | 2185 | |
5a1c7968 | 2186 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2458b9c0 JM |
2187 | Used in FIELD_DECLs for vtable pointers. |
2188 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
12b195d9 | 2189 | #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) |
8da1b058 | 2190 | |
30801830 JM |
2191 | /* Used to indicate that the linkage status of this DECL is not yet known, |
2192 | so it should not be output now. */ | |
12b195d9 | 2193 | #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) |
30801830 | 2194 | |
adb23061 RK |
2195 | /* Used in PARM_DECLs whose type are unions to indicate that the |
2196 | argument should be passed in the same way that the first union | |
2197 | alternative would be passed. */ | |
770ae6cc | 2198 | #define DECL_TRANSPARENT_UNION(NODE) \ |
c46080ab | 2199 | (PARM_DECL_CHECK (NODE)->decl.transparent_union) |
adb23061 | 2200 | |
2c5f4139 JM |
2201 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically |
2202 | at the beginning or end of execution. */ | |
770ae6cc | 2203 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ |
c46080ab | 2204 | (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag) |
770ae6cc RK |
2205 | |
2206 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
2207 | (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag) | |
2c5f4139 | 2208 | |
3edbc4b9 | 2209 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
12b195d9 | 2210 | #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) |
3edbc4b9 | 2211 | |
daefd78b | 2212 | /* Used to indicate that this DECL has weak linkage. */ |
12b195d9 | 2213 | #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) |
daefd78b | 2214 | |
c5bd82cb JM |
2215 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in |
2216 | multiple translation units should be merged. */ | |
12b195d9 | 2217 | #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) |
c5bd82cb | 2218 | |
59182242 MM |
2219 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
2220 | not be put out unless it is needed in this translation unit. | |
2221 | Entities like this are shared across translation units (like weak | |
2222 | entities), but are guaranteed to be generated by any translation | |
2223 | unit that needs them, and therefore need not be put out anywhere | |
2224 | where they are not needed. DECL_COMDAT is just a hint to the | |
2225 | back-end; it is up to front-ends which set this flag to ensure | |
2226 | that there will never be any harm, other than bloat, in putting out | |
2227 | something which is DECL_COMDAT. */ | |
2228 | #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) | |
2229 | ||
07417085 KR |
2230 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should |
2231 | be instrumented with calls to support routines. */ | |
770ae6cc | 2232 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ |
c46080ab | 2233 | (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit) |
07417085 | 2234 | |
a157febd GK |
2235 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be |
2236 | disabled in this function. */ | |
770ae6cc | 2237 | #define DECL_NO_LIMIT_STACK(NODE) \ |
c46080ab | 2238 | (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack) |
a157febd | 2239 | |
8da1b058 | 2240 | /* Additional flags for language-specific uses. */ |
12b195d9 ML |
2241 | #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) |
2242 | #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) | |
2243 | #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) | |
2244 | #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) | |
2245 | #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) | |
2246 | #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) | |
2247 | #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) | |
2248 | #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) | |
8da1b058 | 2249 | |
27da1b4d MK |
2250 | /* Used to indicate that the pointer to this DECL cannot be treated as |
2251 | an address constant. */ | |
2252 | #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) | |
2253 | ||
2bf105ab RK |
2254 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
2255 | this component. */ | |
2256 | #define DECL_NONADDRESSABLE_P(NODE) \ | |
2257 | (FIELD_DECL_CHECK (NODE)->decl.non_addressable) | |
2258 | ||
3932261a MM |
2259 | /* Used to indicate an alias set for the memory pointed to by this |
2260 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
2261 | pointer (or reference) type. */ | |
2262 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
2263 | (DECL_CHECK (NODE)->decl.pointer_alias_set) | |
2264 | ||
9cf737f8 | 2265 | /* Used to store the alias_var for a DECL node. */ |
6de9cd9a DN |
2266 | #define DECL_PTA_ALIASVAR(NODE) \ |
2267 | (DECL_CHECK (NODE)->decl.alias_var) | |
2268 | ||
2269 | /* A numeric unique identifier for a LABEL_DECL. The UID allocation is | |
2270 | dense, unique within any one function, and may be used to index arrays. | |
2271 | If the value is -1, then no UID has been assigned. */ | |
2272 | #define LABEL_DECL_UID(NODE) \ | |
2273 | (LABEL_DECL_CHECK (NODE)->decl.pointer_alias_set) | |
2274 | ||
3932261a MM |
2275 | /* Nonzero if an alias set has been assigned to this declaration. */ |
2276 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
2277 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
2278 | ||
4b1e44be RH |
2279 | /* Nonzero for a decl which is at file scope. */ |
2280 | #define DECL_FILE_SCOPE_P(EXP) \ | |
2281 | (! DECL_CONTEXT (EXP) \ | |
2282 | || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL) | |
2283 | ||
6f312d18 ZW |
2284 | /* Nonzero for a decl that cgraph has decided should be inlined into |
2285 | at least one call site. It is not meaningful to look at this | |
2286 | directly; always use cgraph_function_possibly_inlined_p. */ | |
2287 | #define DECL_POSSIBLY_INLINED(DECL) \ | |
2288 | FUNCTION_DECL_CHECK (DECL)->decl.possibly_inlined | |
2289 | ||
8e3e233b DP |
2290 | /* Nonzero for a decl that is decorated using attribute used. |
2291 | This indicates compiler tools that this decl needs to be preserved. */ | |
2292 | #define DECL_PRESERVE_P(DECL) \ | |
2293 | DECL_CHECK (DECL)->decl.preserve_flag | |
2294 | ||
17ad5b5e RH |
2295 | /* Internal to the gimplifier. Indicates that the value is a formal |
2296 | temporary controlled by the gimplifier. */ | |
2297 | #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \ | |
2298 | DECL_CHECK (DECL)->decl.gimple_formal_temp | |
2299 | ||
968b41a1 | 2300 | /* Enumerate visibility settings. */ |
d7afec4b ND |
2301 | #ifndef SYMBOL_VISIBILITY_DEFINED |
2302 | #define SYMBOL_VISIBILITY_DEFINED | |
968b41a1 MA |
2303 | enum symbol_visibility |
2304 | { | |
2305 | VISIBILITY_DEFAULT, | |
2306 | VISIBILITY_INTERNAL, | |
2307 | VISIBILITY_HIDDEN, | |
2308 | VISIBILITY_PROTECTED | |
2309 | }; | |
d7afec4b | 2310 | #endif |
968b41a1 | 2311 | |
eb3ae3e1 | 2312 | struct function; |
6de9cd9a | 2313 | union alias_var_def; |
e2500fed | 2314 | struct tree_decl GTY(()) |
8da1b058 | 2315 | { |
2bf105ab | 2316 | struct tree_common common; |
e6986399 | 2317 | location_t locus; |
0e77444b | 2318 | unsigned int uid; |
2f78c311 | 2319 | tree size; |
e60a8c26 | 2320 | ENUM_BITFIELD(machine_mode) mode : 8; |
8da1b058 RS |
2321 | |
2322 | unsigned external_flag : 1; | |
2323 | unsigned nonlocal_flag : 1; | |
2324 | unsigned regdecl_flag : 1; | |
2325 | unsigned inline_flag : 1; | |
2326 | unsigned bit_field_flag : 1; | |
2327 | unsigned virtual_flag : 1; | |
8da1b058 | 2328 | unsigned ignored_flag : 1; |
c5caa350 | 2329 | unsigned abstract_flag : 1; |
8da1b058 | 2330 | |
3110a56e | 2331 | unsigned in_system_header_flag : 1; |
2c0d84d6 | 2332 | unsigned common_flag : 1; |
30801830 | 2333 | unsigned defer_output : 1; |
adb23061 | 2334 | unsigned transparent_union : 1; |
2c5f4139 JM |
2335 | unsigned static_ctor_flag : 1; |
2336 | unsigned static_dtor_flag : 1; | |
3edbc4b9 | 2337 | unsigned artificial_flag : 1; |
daefd78b | 2338 | unsigned weak_flag : 1; |
3110a56e | 2339 | |
9df2c88c RK |
2340 | unsigned non_addr_const_p : 1; |
2341 | unsigned no_instrument_function_entry_exit : 1; | |
9df2c88c RK |
2342 | unsigned comdat_flag : 1; |
2343 | unsigned malloc_flag : 1; | |
2344 | unsigned no_limit_stack : 1; | |
c149cc37 | 2345 | ENUM_BITFIELD(built_in_class) built_in_class : 2; |
2bf105ab | 2346 | unsigned pure_flag : 1; |
37a08a29 | 2347 | |
2bf105ab | 2348 | unsigned non_addressable : 1; |
11cf4d18 | 2349 | unsigned user_align : 1; |
5daf7c0a | 2350 | unsigned uninlinable : 1; |
3d78f2e9 | 2351 | unsigned thread_local_flag : 1; |
b3c3af2f | 2352 | unsigned declared_inline_flag : 1; |
6de9cd9a | 2353 | unsigned seen_in_bind_expr : 1; |
968b41a1 | 2354 | ENUM_BITFIELD(symbol_visibility) visibility : 2; |
d7afec4b | 2355 | unsigned visibility_specified : 1; |
9df2c88c | 2356 | |
8da1b058 RS |
2357 | unsigned lang_flag_0 : 1; |
2358 | unsigned lang_flag_1 : 1; | |
2359 | unsigned lang_flag_2 : 1; | |
2360 | unsigned lang_flag_3 : 1; | |
2361 | unsigned lang_flag_4 : 1; | |
2362 | unsigned lang_flag_5 : 1; | |
2363 | unsigned lang_flag_6 : 1; | |
2364 | unsigned lang_flag_7 : 1; | |
2365 | ||
6f312d18 | 2366 | unsigned possibly_inlined : 1; |
8e3e233b | 2367 | unsigned preserve_flag: 1; |
17ad5b5e | 2368 | unsigned gimple_formal_temp : 1; |
8e3e233b | 2369 | /* 13 unused bits. */ |
6de9cd9a | 2370 | |
e2500fed | 2371 | union tree_decl_u1 { |
b850de4f MM |
2372 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is |
2373 | DECL_FUNCTION_CODE. */ | |
9df2c88c | 2374 | enum built_in_function f; |
43aa4e05 | 2375 | /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this |
b850de4f MM |
2376 | is used by language-dependent code. */ |
2377 | HOST_WIDE_INT i; | |
2378 | /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for | |
2379 | FUNCTION_DECLs). */ | |
e2500fed | 2380 | struct tree_decl_u1_a { |
46c5ad27 | 2381 | unsigned int align : 24; |
e2500fed GK |
2382 | unsigned int off_align : 8; |
2383 | } a; | |
1431042e | 2384 | } GTY ((skip)) u1; |
09f532c9 | 2385 | |
2f78c311 ZW |
2386 | tree size_unit; |
2387 | tree name; | |
2388 | tree context; | |
2389 | tree arguments; /* Also used for DECL_FIELD_OFFSET */ | |
2390 | tree result; /* Also used for DECL_BIT_FIELD_TYPE */ | |
2391 | tree initial; /* Also used for DECL_QUALIFIER */ | |
2392 | tree abstract_origin; | |
2393 | tree assembler_name; | |
2394 | tree section_name; | |
91d231cb | 2395 | tree attributes; |
2f78c311 | 2396 | rtx rtl; /* RTL representation for object. */ |
06ceef4e | 2397 | |
9df2c88c | 2398 | /* In FUNCTION_DECL, if it is inline, holds the saved insn chain. |
770ae6cc | 2399 | In FIELD_DECL, is DECL_FIELD_BIT_OFFSET. |
9df2c88c RK |
2400 | In PARM_DECL, holds an RTL for the stack slot |
2401 | of register where the data was actually passed. | |
2402 | Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */ | |
e2500fed GK |
2403 | union tree_decl_u2 { |
2404 | struct function * GTY ((tag ("FUNCTION_DECL"))) f; | |
2405 | rtx GTY ((tag ("PARM_DECL"))) r; | |
2406 | tree GTY ((tag ("FIELD_DECL"))) t; | |
17211ab5 | 2407 | int GTY ((tag ("VAR_DECL"))) i; |
e2500fed | 2408 | } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2; |
9df2c88c | 2409 | |
1a186ec5 RH |
2410 | /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. |
2411 | In a VAR_DECL or PARM_DECL, this is DECL_VALUE_EXPR. */ | |
588d3ade AO |
2412 | tree saved_tree; |
2413 | ||
2414 | /* In a FUNCTION_DECL, these are function data which is to be kept | |
2415 | as long as FUNCTION_DECL is kept. */ | |
2416 | tree inlined_fns; | |
2417 | ||
2f78c311 | 2418 | tree vindex; |
3bdf5ad1 | 2419 | HOST_WIDE_INT pointer_alias_set; |
6de9cd9a | 2420 | union alias_var_def *GTY ((skip(""))) alias_var; |
8da1b058 RS |
2421 | /* Points to a structure whose details depend on the language in use. */ |
2422 | struct lang_decl *lang_specific; | |
2423 | }; | |
6de9cd9a DN |
2424 | |
2425 | \f | |
2426 | /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. | |
2427 | To reduce overhead, the nodes containing the statements are not trees. | |
2428 | This avoids the overhead of tree_common on all linked list elements. | |
2429 | ||
2430 | Use the interface in tree-iterator.h to access this node. */ | |
2431 | ||
2432 | #define STATEMENT_LIST_HEAD(NODE) \ | |
2433 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) | |
2434 | #define STATEMENT_LIST_TAIL(NODE) \ | |
2435 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) | |
2436 | ||
2437 | struct tree_statement_list_node | |
2438 | GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) | |
2439 | { | |
2440 | struct tree_statement_list_node *prev; | |
2441 | struct tree_statement_list_node *next; | |
2442 | tree stmt; | |
2443 | }; | |
2444 | ||
2445 | struct tree_statement_list | |
2446 | GTY(()) | |
2447 | { | |
2448 | struct tree_common common; | |
2449 | struct tree_statement_list_node *head; | |
2450 | struct tree_statement_list_node *tail; | |
2451 | }; | |
33c94679 DN |
2452 | |
2453 | #define VALUE_HANDLE_ID(NODE) \ | |
2454 | (VALUE_HANDLE_CHECK (NODE)->value_handle.id) | |
2455 | ||
2456 | #define VALUE_HANDLE_EXPR_SET(NODE) \ | |
2457 | (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set) | |
2458 | ||
2459 | /* Defined and used in tree-ssa-pre.c. */ | |
2460 | struct value_set; | |
2461 | ||
2462 | struct tree_value_handle GTY(()) | |
2463 | { | |
2464 | struct tree_common common; | |
2465 | ||
2466 | /* The set of expressions represented by this handle. */ | |
2467 | struct value_set * GTY ((skip)) expr_set; | |
2468 | ||
2469 | /* Unique ID for this value handle. IDs are handed out in a | |
2470 | conveniently dense form starting at 0, so that we can make | |
8c27b7d4 | 2471 | bitmaps of value handles. */ |
33c94679 DN |
2472 | unsigned int id; |
2473 | }; | |
8da1b058 | 2474 | \f |
e2500fed GK |
2475 | enum tree_node_structure_enum { |
2476 | TS_COMMON, | |
2477 | TS_INT_CST, | |
2478 | TS_REAL_CST, | |
2479 | TS_VECTOR, | |
2480 | TS_STRING, | |
2481 | TS_COMPLEX, | |
2482 | TS_IDENTIFIER, | |
2483 | TS_DECL, | |
2484 | TS_TYPE, | |
2485 | TS_LIST, | |
2486 | TS_VEC, | |
2487 | TS_EXP, | |
6de9cd9a DN |
2488 | TS_SSA_NAME, |
2489 | TS_PHI_NODE, | |
e2500fed | 2490 | TS_BLOCK, |
95b4aca6 | 2491 | TS_BINFO, |
6de9cd9a | 2492 | TS_STATEMENT_LIST, |
33c94679 | 2493 | TS_VALUE_HANDLE, |
e2500fed GK |
2494 | LAST_TS_ENUM |
2495 | }; | |
2496 | ||
8da1b058 RS |
2497 | /* Define the overall contents of a tree node. |
2498 | It may be any of the structures declared above | |
2499 | for various types of node. */ | |
2500 | ||
e2500fed GK |
2501 | union tree_node GTY ((ptr_alias (union lang_tree_node), |
2502 | desc ("tree_node_structure (&%h)"))) | |
8da1b058 | 2503 | { |
e2500fed GK |
2504 | struct tree_common GTY ((tag ("TS_COMMON"))) common; |
2505 | struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; | |
2506 | struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; | |
2507 | struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; | |
2508 | struct tree_string GTY ((tag ("TS_STRING"))) string; | |
2509 | struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; | |
2510 | struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; | |
2511 | struct tree_decl GTY ((tag ("TS_DECL"))) decl; | |
2512 | struct tree_type GTY ((tag ("TS_TYPE"))) type; | |
2513 | struct tree_list GTY ((tag ("TS_LIST"))) list; | |
2514 | struct tree_vec GTY ((tag ("TS_VEC"))) vec; | |
2515 | struct tree_exp GTY ((tag ("TS_EXP"))) exp; | |
6de9cd9a DN |
2516 | struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; |
2517 | struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi; | |
e2500fed | 2518 | struct tree_block GTY ((tag ("TS_BLOCK"))) block; |
95b4aca6 | 2519 | struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; |
6de9cd9a | 2520 | struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; |
33c94679 | 2521 | struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle; |
6de9cd9a | 2522 | }; |
1d2a8985 | 2523 | \f |
81b3411c BS |
2524 | /* Standard named or nameless data types of the C compiler. */ |
2525 | ||
2526 | enum tree_index | |
2527 | { | |
2528 | TI_ERROR_MARK, | |
2529 | TI_INTQI_TYPE, | |
2530 | TI_INTHI_TYPE, | |
2531 | TI_INTSI_TYPE, | |
2532 | TI_INTDI_TYPE, | |
2533 | TI_INTTI_TYPE, | |
2534 | ||
2535 | TI_UINTQI_TYPE, | |
2536 | TI_UINTHI_TYPE, | |
2537 | TI_UINTSI_TYPE, | |
2538 | TI_UINTDI_TYPE, | |
2539 | TI_UINTTI_TYPE, | |
41077ce4 | 2540 | |
81b3411c BS |
2541 | TI_INTEGER_ZERO, |
2542 | TI_INTEGER_ONE, | |
f2d1f0ba | 2543 | TI_INTEGER_MINUS_ONE, |
81b3411c BS |
2544 | TI_NULL_POINTER, |
2545 | ||
2546 | TI_SIZE_ZERO, | |
2547 | TI_SIZE_ONE, | |
770ae6cc RK |
2548 | |
2549 | TI_BITSIZE_ZERO, | |
2550 | TI_BITSIZE_ONE, | |
2551 | TI_BITSIZE_UNIT, | |
2552 | ||
5a98fa7b MM |
2553 | TI_PUBLIC, |
2554 | TI_PROTECTED, | |
2555 | TI_PRIVATE, | |
2556 | ||
de7df9eb JM |
2557 | TI_BOOLEAN_FALSE, |
2558 | TI_BOOLEAN_TRUE, | |
2559 | ||
81b3411c BS |
2560 | TI_COMPLEX_INTEGER_TYPE, |
2561 | TI_COMPLEX_FLOAT_TYPE, | |
2562 | TI_COMPLEX_DOUBLE_TYPE, | |
2563 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
2564 | ||
2565 | TI_FLOAT_TYPE, | |
2566 | TI_DOUBLE_TYPE, | |
2567 | TI_LONG_DOUBLE_TYPE, | |
2568 | ||
a2a919aa KG |
2569 | TI_FLOAT_PTR_TYPE, |
2570 | TI_DOUBLE_PTR_TYPE, | |
2571 | TI_LONG_DOUBLE_PTR_TYPE, | |
2572 | TI_INTEGER_PTR_TYPE, | |
2573 | ||
81b3411c BS |
2574 | TI_VOID_TYPE, |
2575 | TI_PTR_TYPE, | |
2576 | TI_CONST_PTR_TYPE, | |
c9f8536c | 2577 | TI_SIZE_TYPE, |
d1c38823 | 2578 | TI_PID_TYPE, |
81b3411c BS |
2579 | TI_PTRDIFF_TYPE, |
2580 | TI_VA_LIST_TYPE, | |
de7df9eb | 2581 | TI_BOOLEAN_TYPE, |
498c0f27 | 2582 | TI_FILEPTR_TYPE, |
81b3411c | 2583 | |
cbd5937a MM |
2584 | TI_VOID_LIST_NODE, |
2585 | ||
5b47282c GM |
2586 | TI_MAIN_IDENTIFIER, |
2587 | ||
81b3411c BS |
2588 | TI_MAX |
2589 | }; | |
2590 | ||
e2500fed | 2591 | extern GTY(()) tree global_trees[TI_MAX]; |
81b3411c BS |
2592 | |
2593 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
41077ce4 | 2594 | |
81b3411c BS |
2595 | #define intQI_type_node global_trees[TI_INTQI_TYPE] |
2596 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
2597 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
2598 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
2599 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
2600 | ||
2601 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
2602 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
2603 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
2604 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
2605 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
2606 | ||
81b3411c BS |
2607 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
2608 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
f2d1f0ba | 2609 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
81b3411c BS |
2610 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
2611 | #define size_one_node global_trees[TI_SIZE_ONE] | |
770ae6cc RK |
2612 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
2613 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
2614 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
2615 | ||
dbbf88d1 | 2616 | /* Base access nodes. */ |
5a98fa7b MM |
2617 | #define access_public_node global_trees[TI_PUBLIC] |
2618 | #define access_protected_node global_trees[TI_PROTECTED] | |
2619 | #define access_private_node global_trees[TI_PRIVATE] | |
dbbf88d1 | 2620 | |
81b3411c BS |
2621 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
2622 | ||
2623 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
2624 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
2625 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
2626 | ||
a2a919aa KG |
2627 | #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] |
2628 | #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] | |
2629 | #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] | |
2630 | #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] | |
2631 | ||
81b3411c BS |
2632 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] |
2633 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
2634 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
2635 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
2636 | ||
2637 | #define void_type_node global_trees[TI_VOID_TYPE] | |
fc693822 | 2638 | /* The C type `void *'. */ |
81b3411c | 2639 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
fc693822 | 2640 | /* The C type `const void *'. */ |
81b3411c | 2641 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
c9f8536c MM |
2642 | /* The C type `size_t'. */ |
2643 | #define size_type_node global_trees[TI_SIZE_TYPE] | |
d1c38823 | 2644 | #define pid_type_node global_trees[TI_PID_TYPE] |
81b3411c BS |
2645 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] |
2646 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
498c0f27 JJ |
2647 | /* The C type `FILE *'. */ |
2648 | #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] | |
7145ef21 | 2649 | |
de7df9eb JM |
2650 | #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] |
2651 | #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] | |
2652 | #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] | |
2653 | ||
cbd5937a MM |
2654 | /* The node that should be placed at the end of a parameter list to |
2655 | indicate that the function does not take a variable number of | |
2656 | arguments. The TREE_VALUE will be void_type_node and there will be | |
2657 | no TREE_CHAIN. Language-independent code should not assume | |
2658 | anything else about this node. */ | |
2659 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
2660 | ||
5b47282c GM |
2661 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
2662 | #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
2663 | ||
7145ef21 | 2664 | /* An enumeration of the standard C integer types. These must be |
ceeedfc1 NB |
2665 | ordered so that shorter types appear before longer ones, and so |
2666 | that signed types appear before unsigned ones, for the correct | |
2667 | functioning of interpret_integer() in c-lex.c. */ | |
41077ce4 | 2668 | enum integer_type_kind |
7145ef21 MM |
2669 | { |
2670 | itk_char, | |
2671 | itk_signed_char, | |
2672 | itk_unsigned_char, | |
2673 | itk_short, | |
2674 | itk_unsigned_short, | |
2675 | itk_int, | |
2676 | itk_unsigned_int, | |
2677 | itk_long, | |
2678 | itk_unsigned_long, | |
2679 | itk_long_long, | |
2680 | itk_unsigned_long_long, | |
2681 | itk_none | |
2682 | }; | |
2683 | ||
2684 | typedef enum integer_type_kind integer_type_kind; | |
2685 | ||
2686 | /* The standard C integer types. Use integer_type_kind to index into | |
2687 | this array. */ | |
e2500fed | 2688 | extern GTY(()) tree integer_types[itk_none]; |
7145ef21 MM |
2689 | |
2690 | #define char_type_node integer_types[itk_char] | |
2691 | #define signed_char_type_node integer_types[itk_signed_char] | |
2692 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
2693 | #define short_integer_type_node integer_types[itk_short] | |
2694 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
2695 | #define integer_type_node integer_types[itk_int] | |
2696 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
2697 | #define long_integer_type_node integer_types[itk_long] | |
2698 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
2699 | #define long_long_integer_type_node integer_types[itk_long_long] | |
2700 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
dce81a1a JJ |
2701 | \f |
2702 | /* Set to the default thread-local storage (tls) model to use. */ | |
2703 | ||
dce81a1a | 2704 | extern enum tls_model flag_tls_default; |
25fdb4dc | 2705 | |
81b3411c | 2706 | \f |
f963b5d9 RS |
2707 | /* A pointer-to-function member type looks like: |
2708 | ||
2709 | struct { | |
2710 | __P __pfn; | |
2711 | ptrdiff_t __delta; | |
2712 | }; | |
2713 | ||
2714 | If __pfn is NULL, it is a NULL pointer-to-member-function. | |
2715 | ||
2716 | (Because the vtable is always the first thing in the object, we | |
2717 | don't need its offset.) If the function is virtual, then PFN is | |
2718 | one plus twice the index into the vtable; otherwise, it is just a | |
2719 | pointer to the function. | |
2720 | ||
2721 | Unfortunately, using the lowest bit of PFN doesn't work in | |
2722 | architectures that don't impose alignment requirements on function | |
2723 | addresses, or that use the lowest bit to tell one ISA from another, | |
2724 | for example. For such architectures, we use the lowest bit of | |
2725 | DELTA instead of the lowest bit of the PFN, and DELTA will be | |
2726 | multiplied by 2. */ | |
2727 | ||
2728 | enum ptrmemfunc_vbit_where_t | |
2729 | { | |
2730 | ptrmemfunc_vbit_in_pfn, | |
2731 | ptrmemfunc_vbit_in_delta | |
2732 | }; | |
2733 | \f | |
f837a861 MM |
2734 | #define NULL_TREE (tree) NULL |
2735 | ||
05ac140e | 2736 | extern GTY(()) tree frame_base_decl; |
46c5ad27 | 2737 | extern tree decl_assembler_name (tree); |
8da1b058 | 2738 | |
c5620996 GK |
2739 | /* Compute the number of bytes occupied by 'node'. This routine only |
2740 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
2741 | ||
46c5ad27 | 2742 | extern size_t tree_size (tree); |
c5620996 | 2743 | |
a38b644b ZW |
2744 | /* Compute the number of bytes occupied by a tree with code CODE. This |
2745 | function cannot be used for TREE_VEC or PHI_NODE codes, which are of | |
2746 | variable length. */ | |
2747 | extern size_t tree_code_size (enum tree_code); | |
2748 | ||
8da1b058 RS |
2749 | /* Lowest level primitive for allocating a node. |
2750 | The TREE_CODE is the only argument. Contents are initialized | |
2751 | to zero except for a few of the common fields. */ | |
2752 | ||
b9dcdee4 JH |
2753 | extern tree make_node_stat (enum tree_code MEM_STAT_DECL); |
2754 | #define make_node(t) make_node_stat (t MEM_STAT_INFO) | |
8da1b058 | 2755 | |
1b70d38a | 2756 | /* Make a copy of a node, with all the same contents. */ |
8da1b058 | 2757 | |
b9dcdee4 JH |
2758 | extern tree copy_node_stat (tree MEM_STAT_DECL); |
2759 | #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) | |
8da1b058 RS |
2760 | |
2761 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
2762 | ||
46c5ad27 | 2763 | extern tree copy_list (tree); |
8da1b058 | 2764 | |
95b4aca6 NS |
2765 | /* Make a BINFO. */ |
2766 | extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); | |
2767 | #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) | |
2768 | ||
8da1b058 RS |
2769 | /* Make a TREE_VEC. */ |
2770 | ||
b9dcdee4 JH |
2771 | extern tree make_tree_vec_stat (int MEM_STAT_DECL); |
2772 | #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) | |
8da1b058 | 2773 | |
6de9cd9a DN |
2774 | /* Tree nodes for SSA analysis. */ |
2775 | ||
2776 | extern tree make_phi_node (tree, int); | |
2777 | extern void init_phinodes (void); | |
2778 | extern void fini_phinodes (void); | |
2779 | extern void release_phi_node (tree); | |
2780 | #ifdef GATHER_STATISTICS | |
2781 | extern void phinodes_print_statistics (void); | |
2782 | #endif | |
2783 | ||
2784 | extern void init_ssanames (void); | |
2785 | extern void fini_ssanames (void); | |
2786 | extern tree make_ssa_name (tree, tree); | |
d7621d3c | 2787 | extern tree duplicate_ssa_name (tree, tree); |
6de9cd9a | 2788 | extern void release_ssa_name (tree); |
53b4bf74 | 2789 | extern void release_defs (tree); |
bbc630f5 | 2790 | extern void replace_ssa_name_symbol (tree, tree); |
53b4bf74 | 2791 | |
6de9cd9a DN |
2792 | #ifdef GATHER_STATISTICS |
2793 | extern void ssanames_print_statistics (void); | |
2794 | #endif | |
2795 | ||
b0382c67 ZD |
2796 | extern void mark_for_rewrite (tree); |
2797 | extern void unmark_all_for_rewrite (void); | |
2798 | extern bool marked_for_rewrite_p (tree); | |
2799 | extern bool any_marked_for_rewrite_p (void); | |
2800 | extern struct bitmap_head_def *marked_ssa_names (void); | |
2801 | ||
2802 | ||
8da1b058 RS |
2803 | /* Return the (unique) IDENTIFIER_NODE node for a given name. |
2804 | The name is supplied as a char *. */ | |
2805 | ||
46c5ad27 | 2806 | extern tree get_identifier (const char *); |
8da1b058 | 2807 | |
7bb3fbbb RS |
2808 | #if GCC_VERSION >= 3000 |
2809 | #define get_identifier(str) \ | |
2810 | (__builtin_constant_p (str) \ | |
2811 | ? get_identifier_with_length ((str), strlen (str)) \ | |
2812 | : get_identifier (str)) | |
2813 | #endif | |
2814 | ||
2815 | ||
4bad9e39 APB |
2816 | /* Identical to get_identifier, except that the length is assumed |
2817 | known. */ | |
2818 | ||
7bb3fbbb | 2819 | extern tree get_identifier_with_length (const char *, size_t); |
4bad9e39 | 2820 | |
6b9300aa RK |
2821 | /* If an identifier with the name TEXT (a null-terminated string) has |
2822 | previously been referred to, return that node; otherwise return | |
2823 | NULL_TREE. */ | |
2824 | ||
46c5ad27 | 2825 | extern tree maybe_get_identifier (const char *); |
6b9300aa | 2826 | |
8da1b058 RS |
2827 | /* Construct various types of nodes. */ |
2828 | ||
46c5ad27 AJ |
2829 | extern tree build (enum tree_code, tree, ...); |
2830 | extern tree build_nt (enum tree_code, ...); | |
2831 | ||
4221057e RH |
2832 | #if GCC_VERSION >= 3000 || __STDC_VERSION__ >= 199901L |
2833 | /* Use preprocessor trickery to map "build" to "buildN" where N is the | |
2834 | expected number of arguments. This is used for both efficiency (no | |
2835 | varargs), and checking (verifying number of passed arguments). */ | |
2836 | #define build(code, ...) \ | |
2837 | _buildN1(build, _buildC1(__VA_ARGS__))(code, __VA_ARGS__) | |
2838 | #define _buildN1(BASE, X) _buildN2(BASE, X) | |
2839 | #define _buildN2(BASE, X) BASE##X | |
2840 | #define _buildC1(...) _buildC2(__VA_ARGS__,9,8,7,6,5,4,3,2,1,0,0) | |
2841 | #define _buildC2(x,a1,a2,a3,a4,a5,a6,a7,a8,a9,c,...) c | |
2842 | #endif | |
2843 | ||
b9dcdee4 JH |
2844 | extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); |
2845 | #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) | |
2846 | extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
2847 | #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) | |
2848 | extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
2849 | #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) | |
2850 | extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
2851 | #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) | |
2852 | extern tree build4_stat (enum tree_code, tree, tree, tree, tree, | |
2853 | tree MEM_STAT_DECL); | |
2854 | #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
4221057e | 2855 | |
7d60be94 | 2856 | extern tree build_int_cst (tree, HOST_WIDE_INT); |
8b11a64c | 2857 | extern tree build_int_cst_type (tree, HOST_WIDE_INT); |
7d60be94 NS |
2858 | extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT); |
2859 | extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); | |
46c5ad27 AJ |
2860 | extern tree build_vector (tree, tree); |
2861 | extern tree build_constructor (tree, tree); | |
2862 | extern tree build_real_from_int_cst (tree, tree); | |
2863 | extern tree build_complex (tree, tree, tree); | |
2864 | extern tree build_string (int, const char *); | |
b9dcdee4 JH |
2865 | extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); |
2866 | #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) | |
2867 | extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
2868 | #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO) | |
46c5ad27 | 2869 | extern tree build_block (tree, tree, tree, tree, tree); |
c1667470 | 2870 | #ifndef USE_MAPPED_LOCATION |
6de9cd9a DN |
2871 | extern void annotate_with_file_line (tree, const char *, int); |
2872 | extern void annotate_with_locus (tree, location_t); | |
c1667470 | 2873 | #endif |
6de9cd9a | 2874 | extern tree build_empty_stmt (void); |
8da1b058 RS |
2875 | |
2876 | /* Construct various nodes representing data types. */ | |
2877 | ||
46c5ad27 AJ |
2878 | extern tree make_signed_type (int); |
2879 | extern tree make_unsigned_type (int); | |
2f4675b4 | 2880 | extern tree signed_type_for (tree); |
8b11a64c | 2881 | extern tree unsigned_type_for (tree); |
8c1d6d62 | 2882 | extern void initialize_sizetypes (bool); |
46c5ad27 AJ |
2883 | extern void set_sizetype (tree); |
2884 | extern void fixup_unsigned_type (tree); | |
22421b79 | 2885 | extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); |
46c5ad27 | 2886 | extern tree build_pointer_type (tree); |
22421b79 | 2887 | extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); |
46c5ad27 | 2888 | extern tree build_reference_type (tree); |
4a5eab38 PB |
2889 | extern tree build_vector_type_for_mode (tree, enum machine_mode); |
2890 | extern tree build_vector_type (tree innertype, int nunits); | |
46c5ad27 AJ |
2891 | extern tree build_type_no_quals (tree); |
2892 | extern tree build_index_type (tree); | |
2893 | extern tree build_index_2_type (tree, tree); | |
2894 | extern tree build_array_type (tree, tree); | |
2895 | extern tree build_function_type (tree, tree); | |
2896 | extern tree build_function_type_list (tree, ...); | |
43dc123f | 2897 | extern tree build_method_type_directly (tree, tree, tree); |
46c5ad27 AJ |
2898 | extern tree build_method_type (tree, tree); |
2899 | extern tree build_offset_type (tree, tree); | |
2900 | extern tree build_complex_type (tree); | |
2901 | extern tree array_type_nelts (tree); | |
a7e5372d | 2902 | extern bool in_array_bounds_p (tree); |
46c5ad27 AJ |
2903 | |
2904 | extern tree value_member (tree, tree); | |
2905 | extern tree purpose_member (tree, tree); | |
fd917e0d | 2906 | |
46c5ad27 AJ |
2907 | extern int attribute_list_equal (tree, tree); |
2908 | extern int attribute_list_contained (tree, tree); | |
2909 | extern int tree_int_cst_equal (tree, tree); | |
2910 | extern int tree_int_cst_lt (tree, tree); | |
2911 | extern int tree_int_cst_compare (tree, tree); | |
2912 | extern int host_integerp (tree, int); | |
2913 | extern HOST_WIDE_INT tree_low_cst (tree, int); | |
2914 | extern int tree_int_cst_msb (tree); | |
2915 | extern int tree_int_cst_sgn (tree); | |
2916 | extern int tree_expr_nonnegative_p (tree); | |
82b85a85 | 2917 | extern bool may_negate_without_overflow_p (tree); |
46c5ad27 | 2918 | extern tree get_inner_array_type (tree); |
12cfc830 | 2919 | |
f837a861 MM |
2920 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
2921 | put the prototype here. Rtl.h does declare the prototype if | |
2922 | tree.h had been included. */ | |
2923 | ||
46c5ad27 | 2924 | extern tree make_tree (tree, rtx); |
8da1b058 | 2925 | \f |
bad1b4ba RK |
2926 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
2927 | is ATTRIBUTE. | |
2928 | ||
2929 | Such modified types already made are recorded so that duplicates | |
2ba84f36 | 2930 | are not made. */ |
bad1b4ba | 2931 | |
46c5ad27 AJ |
2932 | extern tree build_type_attribute_variant (tree, tree); |
2933 | extern tree build_decl_attribute_variant (tree, tree); | |
bad1b4ba | 2934 | |
91d231cb JM |
2935 | /* Structure describing an attribute and a function to handle it. */ |
2936 | struct attribute_spec | |
2937 | { | |
2938 | /* The name of the attribute (without any leading or trailing __), | |
2939 | or NULL to mark the end of a table of attributes. */ | |
8b60264b | 2940 | const char *const name; |
91d231cb | 2941 | /* The minimum length of the list of arguments of the attribute. */ |
8b60264b | 2942 | const int min_length; |
91d231cb JM |
2943 | /* The maximum length of the list of arguments of the attribute |
2944 | (-1 for no maximum). */ | |
8b60264b | 2945 | const int max_length; |
91d231cb JM |
2946 | /* Whether this attribute requires a DECL. If it does, it will be passed |
2947 | from types of DECLs, function return types and array element types to | |
2948 | the DECLs, function types and array types respectively; but when | |
2949 | applied to a type in any other circumstances, it will be ignored with | |
2950 | a warning. (If greater control is desired for a given attribute, | |
2951 | this should be false, and the flags argument to the handler may be | |
2952 | used to gain greater control in that case.) */ | |
8b60264b | 2953 | const bool decl_required; |
91d231cb JM |
2954 | /* Whether this attribute requires a type. If it does, it will be passed |
2955 | from a DECL to the type of that DECL. */ | |
8b60264b | 2956 | const bool type_required; |
91d231cb JM |
2957 | /* Whether this attribute requires a function (or method) type. If it does, |
2958 | it will be passed from a function pointer type to the target type, | |
2959 | and from a function return type (which is not itself a function | |
2960 | pointer type) to the function type. */ | |
8b60264b | 2961 | const bool function_type_required; |
91d231cb JM |
2962 | /* Function to handle this attribute. NODE points to the node to which |
2963 | the attribute is to be applied. If a DECL, it should be modified in | |
2964 | place; if a TYPE, a copy should be created. NAME is the name of the | |
2965 | attribute (possibly with leading or trailing __). ARGS is the TREE_LIST | |
2966 | of the arguments (which may be NULL). FLAGS gives further information | |
2967 | about the context of the attribute. Afterwards, the attributes will | |
2968 | be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, | |
2969 | unless *NO_ADD_ATTRS is set to true (which should be done on error, | |
2970 | as well as in any other cases when the attributes should not be added | |
2971 | to the DECL or TYPE). Depending on FLAGS, any attributes to be | |
2972 | applied to another type or DECL later may be returned; | |
2973 | otherwise the return value should be NULL_TREE. This pointer may be | |
2974 | NULL if no special handling is required beyond the checks implied | |
2975 | by the rest of this structure. */ | |
46c5ad27 AJ |
2976 | tree (*const handler) (tree *node, tree name, tree args, |
2977 | int flags, bool *no_add_attrs); | |
91d231cb JM |
2978 | }; |
2979 | ||
91d231cb JM |
2980 | /* Flags that may be passed in the third argument of decl_attributes, and |
2981 | to handler functions for attributes. */ | |
2982 | enum attribute_flags | |
2983 | { | |
2984 | /* The type passed in is the type of a DECL, and any attributes that | |
2985 | should be passed in again to be applied to the DECL rather than the | |
2986 | type should be returned. */ | |
2987 | ATTR_FLAG_DECL_NEXT = 1, | |
2988 | /* The type passed in is a function return type, and any attributes that | |
2989 | should be passed in again to be applied to the function type rather | |
2990 | than the return type should be returned. */ | |
2991 | ATTR_FLAG_FUNCTION_NEXT = 2, | |
2992 | /* The type passed in is an array element type, and any attributes that | |
2993 | should be passed in again to be applied to the array type rather | |
2994 | than the element type should be returned. */ | |
2995 | ATTR_FLAG_ARRAY_NEXT = 4, | |
2996 | /* The type passed in is a structure, union or enumeration type being | |
2997 | created, and should be modified in place. */ | |
6431177a JM |
2998 | ATTR_FLAG_TYPE_IN_PLACE = 8, |
2999 | /* The attributes are being applied by default to a library function whose | |
3000 | name indicates known behavior, and should be silently ignored if they | |
3001 | are not in fact compatible with the function type. */ | |
3002 | ATTR_FLAG_BUILT_IN = 16 | |
91d231cb JM |
3003 | }; |
3004 | ||
501990bb NB |
3005 | /* Default versions of target-overridable functions. */ |
3006 | ||
46c5ad27 AJ |
3007 | extern tree merge_decl_attributes (tree, tree); |
3008 | extern tree merge_type_attributes (tree, tree); | |
3009 | extern void default_register_cpp_builtins (struct cpp_reader *); | |
d9525bec | 3010 | |
9c130398 DE |
3011 | /* Return 1 if an attribute and its arguments are valid for a decl or type. */ |
3012 | ||
46c5ad27 | 3013 | extern int valid_machine_attribute (tree, tree, tree, tree); |
9c130398 | 3014 | |
0e9e1e0a | 3015 | /* Given a tree node and a string, return nonzero if the tree node is |
9c130398 DE |
3016 | a valid attribute name for the string. */ |
3017 | ||
46c5ad27 | 3018 | extern int is_attribute_p (const char *, tree); |
9c130398 DE |
3019 | |
3020 | /* Given an attribute name and a list of attributes, return the list element | |
3021 | of the attribute or NULL_TREE if not found. */ | |
3022 | ||
46c5ad27 | 3023 | extern tree lookup_attribute (const char *, tree); |
6cb3d314 DE |
3024 | |
3025 | /* Given two attributes lists, return a list of their union. */ | |
3026 | ||
46c5ad27 | 3027 | extern tree merge_attributes (tree, tree); |
9c130398 | 3028 | |
b2ca3702 | 3029 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
672a6f42 NB |
3030 | /* Given two Windows decl attributes lists, possibly including |
3031 | dllimport, return a list of their union . */ | |
46c5ad27 | 3032 | extern tree merge_dllimport_decl_attributes (tree, tree); |
b2ca3702 MM |
3033 | |
3034 | /* Handle a "dllimport" or "dllexport" attribute. */ | |
3035 | extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); | |
672a6f42 NB |
3036 | #endif |
3037 | ||
896c3aa3 JM |
3038 | /* Check whether CAND is suitable to be returned from get_qualified_type |
3039 | (BASE, TYPE_QUALS). */ | |
3040 | ||
3041 | extern bool check_qualified_type (tree, tree, int); | |
3042 | ||
5101b304 MM |
3043 | /* Return a version of the TYPE, qualified as indicated by the |
3044 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
3045 | return NULL_TREE. */ | |
3046 | ||
46c5ad27 | 3047 | extern tree get_qualified_type (tree, int); |
5101b304 MM |
3048 | |
3049 | /* Like get_qualified_type, but creates the type if it does not | |
3050 | exist. This function never returns NULL_TREE. */ | |
3932261a | 3051 | |
46c5ad27 | 3052 | extern tree build_qualified_type (tree, int); |
3932261a MM |
3053 | |
3054 | /* Like build_qualified_type, but only deals with the `const' and | |
3055 | `volatile' qualifiers. This interface is retained for backwards | |
14b493d6 | 3056 | compatibility with the various front-ends; new code should use |
3932261a | 3057 | build_qualified_type instead. */ |
8da1b058 | 3058 | |
3932261a | 3059 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
b9daac31 | 3060 | build_qualified_type ((TYPE), \ |
3932261a MM |
3061 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ |
3062 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
8da1b058 | 3063 | |
43100b14 RS |
3064 | /* Make a copy of a type node. */ |
3065 | ||
8dd16ecc NS |
3066 | extern tree build_distinct_type_copy (tree); |
3067 | extern tree build_variant_type_copy (tree); | |
43100b14 | 3068 | |
4977bab6 | 3069 | /* Finish up a builtin RECORD_TYPE. Give it a name and provide its |
86df8c86 | 3070 | fields. Optionally specify an alignment, and then lay it out. */ |
4977bab6 | 3071 | |
46c5ad27 AJ |
3072 | extern void finish_builtin_struct (tree, const char *, |
3073 | tree, tree); | |
4977bab6 | 3074 | |
8da1b058 | 3075 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
9328904c MM |
3076 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
3077 | node, does nothing except for the first time. */ | |
8da1b058 | 3078 | |
46c5ad27 | 3079 | extern void layout_type (tree); |
8da1b058 | 3080 | |
9328904c MM |
3081 | /* These functions allow a front-end to perform a manual layout of a |
3082 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
3083 | depends on the placement of fields so far.) Begin by calling | |
770ae6cc | 3084 | start_record_layout. Then, call place_field for each of the |
9328904c MM |
3085 | fields. Then, call finish_record_layout. See layout_type for the |
3086 | default way in which these functions are used. */ | |
3087 | ||
defd0dea | 3088 | typedef struct record_layout_info_s |
9328904c MM |
3089 | { |
3090 | /* The RECORD_TYPE that we are laying out. */ | |
3091 | tree t; | |
770ae6cc RK |
3092 | /* The offset into the record so far, in bytes, not including bits in |
3093 | BITPOS. */ | |
3094 | tree offset; | |
3095 | /* The last known alignment of SIZE. */ | |
3096 | unsigned int offset_align; | |
3097 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
3098 | tree bitpos; | |
9328904c MM |
3099 | /* The alignment of the record so far, in bits. */ |
3100 | unsigned int record_align; | |
78d55cc8 JM |
3101 | /* The alignment of the record so far, ignoring #pragma pack and |
3102 | __attribute__ ((packed)), in bits. */ | |
770ae6cc | 3103 | unsigned int unpacked_align; |
f913c102 AO |
3104 | /* The previous field layed out. */ |
3105 | tree prev_field; | |
9328904c MM |
3106 | /* The static variables (i.e., class variables, as opposed to |
3107 | instance variables) encountered in T. */ | |
3108 | tree pending_statics; | |
e4850f36 DR |
3109 | /* Bits remaining in the current alignment group */ |
3110 | int remaining_in_alignment; | |
78d55cc8 JM |
3111 | /* True if we've seen a packed field that didn't have normal |
3112 | alignment anyway. */ | |
9328904c | 3113 | int packed_maybe_necessary; |
770ae6cc | 3114 | } *record_layout_info; |
9328904c | 3115 | |
46c5ad27 AJ |
3116 | extern void set_lang_adjust_rli (void (*) (record_layout_info)); |
3117 | extern record_layout_info start_record_layout (tree); | |
3118 | extern tree bit_from_pos (tree, tree); | |
3119 | extern tree byte_from_pos (tree, tree); | |
3120 | extern void pos_from_bit (tree *, tree *, unsigned int, tree); | |
3121 | extern void normalize_offset (tree *, tree *, unsigned int); | |
3122 | extern tree rli_size_unit_so_far (record_layout_info); | |
3123 | extern tree rli_size_so_far (record_layout_info); | |
3124 | extern void normalize_rli (record_layout_info); | |
3125 | extern void place_field (record_layout_info, tree); | |
3126 | extern void compute_record_mode (tree); | |
3127 | extern void finish_record_layout (record_layout_info, int); | |
9328904c | 3128 | |
8da1b058 RS |
3129 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
3130 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
3131 | How the hash code is computed is up to the caller, as long as any two | |
3132 | callers that could hash identical-looking type nodes agree. */ | |
3133 | ||
46c5ad27 | 3134 | extern tree type_hash_canon (unsigned int, tree); |
8da1b058 RS |
3135 | |
3136 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
3137 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
3138 | fields. Call this only once for any given decl node. | |
3139 | ||
3140 | Second argument is the boundary that this field can be assumed to | |
3141 | be starting at (in bits). Zero means it can be assumed aligned | |
3142 | on any boundary that may be needed. */ | |
3143 | ||
46c5ad27 | 3144 | extern void layout_decl (tree, unsigned); |
8da1b058 | 3145 | |
d8472c75 JM |
3146 | /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of |
3147 | a previous call to layout_decl and calls it again. */ | |
3148 | ||
3149 | extern void relayout_decl (tree); | |
3150 | ||
72c602fc RK |
3151 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
3152 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
3153 | The value is BLKmode if no other mode is found. This is like | |
3154 | mode_for_size, but is passed a tree. */ | |
3155 | ||
46c5ad27 | 3156 | extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int); |
72c602fc | 3157 | |
8da1b058 RS |
3158 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
3159 | ||
46c5ad27 AJ |
3160 | extern tree non_lvalue (tree); |
3161 | extern tree pedantic_non_lvalue (tree); | |
3162 | ||
3163 | extern tree convert (tree, tree); | |
3164 | extern unsigned int expr_align (tree); | |
3165 | extern tree expr_first (tree); | |
3166 | extern tree expr_last (tree); | |
6de9cd9a | 3167 | extern tree expr_only (tree); |
46c5ad27 AJ |
3168 | extern tree size_in_bytes (tree); |
3169 | extern HOST_WIDE_INT int_size_in_bytes (tree); | |
3170 | extern tree bit_position (tree); | |
3171 | extern HOST_WIDE_INT int_bit_position (tree); | |
3172 | extern tree byte_position (tree); | |
3173 | extern HOST_WIDE_INT int_byte_position (tree); | |
fed3cef0 RK |
3174 | |
3175 | /* Define data structures, macros, and functions for handling sizes | |
3176 | and the various types used to represent sizes. */ | |
3177 | ||
3178 | enum size_type_kind | |
3179 | { | |
2ba84f36 KH |
3180 | SIZETYPE, /* Normal representation of sizes in bytes. */ |
3181 | SSIZETYPE, /* Signed representation of sizes in bytes. */ | |
fed3cef0 RK |
3182 | BITSIZETYPE, /* Normal representation of sizes in bits. */ |
3183 | SBITSIZETYPE, /* Signed representation of sizes in bits. */ | |
fed3cef0 RK |
3184 | TYPE_KIND_LAST}; |
3185 | ||
e2500fed | 3186 | extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; |
fed3cef0 RK |
3187 | |
3188 | #define sizetype sizetype_tab[(int) SIZETYPE] | |
3189 | #define bitsizetype sizetype_tab[(int) BITSIZETYPE] | |
3190 | #define ssizetype sizetype_tab[(int) SSIZETYPE] | |
fed3cef0 | 3191 | #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] |
fed3cef0 | 3192 | |
ce552f75 | 3193 | extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); |
46c5ad27 AJ |
3194 | extern tree size_binop (enum tree_code, tree, tree); |
3195 | extern tree size_diffop (tree, tree); | |
3e95a7cb ZW |
3196 | |
3197 | #define size_int(L) size_int_kind (L, SIZETYPE) | |
3198 | #define ssize_int(L) size_int_kind (L, SSIZETYPE) | |
3199 | #define bitsize_int(L) size_int_kind (L, BITSIZETYPE) | |
3200 | #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE) | |
f8dac6eb | 3201 | |
46c5ad27 AJ |
3202 | extern tree round_up (tree, int); |
3203 | extern tree round_down (tree, int); | |
3204 | extern tree get_pending_sizes (void); | |
46c5ad27 AJ |
3205 | extern void put_pending_size (tree); |
3206 | extern void put_pending_sizes (tree); | |
8da1b058 RS |
3207 | |
3208 | /* Type for sizes of data-type. */ | |
3209 | ||
f8dac6eb R |
3210 | #define BITS_PER_UNIT_LOG \ |
3211 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
3212 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
3213 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
3214 | ||
467cecf3 | 3215 | /* If nonzero, an upper limit on alignment of structure fields, in bits, */ |
729a2125 | 3216 | extern unsigned int maximum_field_alignment; |
8c27b7d4 | 3217 | /* and its original value in bytes, specified via -fpack-struct=<value>. */ |
467cecf3 | 3218 | extern unsigned int initial_max_fld_align; |
8294accf | 3219 | |
0e9e1e0a | 3220 | /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */ |
729a2125 | 3221 | extern unsigned int set_alignment; |
8294accf | 3222 | |
8da1b058 RS |
3223 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
3224 | by making the last node in X point to Y. | |
3225 | Returns X, except if X is 0 returns Y. */ | |
3226 | ||
46c5ad27 | 3227 | extern tree chainon (tree, tree); |
8da1b058 RS |
3228 | |
3229 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
3230 | ||
b9dcdee4 JH |
3231 | extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); |
3232 | #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) | |
8da1b058 RS |
3233 | |
3234 | /* Return the last tree node in a chain. */ | |
3235 | ||
46c5ad27 | 3236 | extern tree tree_last (tree); |
8da1b058 RS |
3237 | |
3238 | /* Reverse the order of elements in a chain, and return the new head. */ | |
3239 | ||
46c5ad27 | 3240 | extern tree nreverse (tree); |
8da1b058 RS |
3241 | |
3242 | /* Returns the length of a chain of nodes | |
3243 | (number of chain pointers to follow before reaching a null pointer). */ | |
3244 | ||
46c5ad27 | 3245 | extern int list_length (tree); |
8da1b058 | 3246 | |
c3b247b4 JM |
3247 | /* Returns the number of FIELD_DECLs in a type. */ |
3248 | ||
46c5ad27 | 3249 | extern int fields_length (tree); |
c3b247b4 | 3250 | |
27b41650 KG |
3251 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
3252 | aggregate of zeros. Otherwise return FALSE. */ | |
3253 | ||
46c5ad27 | 3254 | extern bool initializer_zerop (tree); |
27b41650 | 3255 | |
6de9cd9a DN |
3256 | extern void categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *); |
3257 | extern HOST_WIDE_INT count_type_elements (tree); | |
40209195 JM |
3258 | extern int mostly_zeros_p (tree); |
3259 | ||
6de9cd9a DN |
3260 | /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */ |
3261 | ||
3262 | extern void add_var_to_bind_expr (tree, tree); | |
3263 | ||
8da1b058 RS |
3264 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ |
3265 | ||
46c5ad27 | 3266 | extern int integer_zerop (tree); |
8da1b058 RS |
3267 | |
3268 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ | |
3269 | ||
46c5ad27 | 3270 | extern int integer_onep (tree); |
8da1b058 RS |
3271 | |
3272 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
3273 | all of whose significant bits are 1. */ | |
3274 | ||
46c5ad27 | 3275 | extern int integer_all_onesp (tree); |
8da1b058 RS |
3276 | |
3277 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
3278 | exactly one bit 1. */ | |
3279 | ||
46c5ad27 | 3280 | extern int integer_pow2p (tree); |
8da1b058 | 3281 | |
4977bab6 ZW |
3282 | /* integer_nonzerop (tree x) is nonzero if X is an integer constant |
3283 | with a nonzero value. */ | |
3284 | ||
46c5ad27 | 3285 | extern int integer_nonzerop (tree); |
4977bab6 | 3286 | |
8b11a64c ZD |
3287 | extern bool zero_p (tree); |
3288 | extern bool cst_and_fits_in_hwi (tree); | |
3289 | ||
525c6bf5 RH |
3290 | /* staticp (tree x) is nonzero if X is a reference to data allocated |
3291 | at a fixed address in memory. Returns the outermost data. */ | |
8da1b058 | 3292 | |
525c6bf5 | 3293 | extern tree staticp (tree); |
8da1b058 | 3294 | |
8da1b058 RS |
3295 | /* save_expr (EXP) returns an expression equivalent to EXP |
3296 | but it can be used multiple times within context CTX | |
3297 | and only evaluate EXP once. */ | |
3298 | ||
46c5ad27 | 3299 | extern tree save_expr (tree); |
8da1b058 | 3300 | |
a9ecacf6 OH |
3301 | /* Look inside EXPR and into any simple arithmetic operations. Return |
3302 | the innermost non-arithmetic node. */ | |
3303 | ||
46c5ad27 | 3304 | extern tree skip_simple_arithmetic (tree); |
a9ecacf6 | 3305 | |
b7f6588d JM |
3306 | /* Returns the index of the first non-tree operand for CODE, or the number |
3307 | of operands if all are trees. */ | |
3308 | ||
46c5ad27 | 3309 | extern int first_rtl_op (enum tree_code); |
b7f6588d | 3310 | |
e2500fed GK |
3311 | /* Return which tree structure is used by T. */ |
3312 | ||
46c5ad27 | 3313 | enum tree_node_structure_enum tree_node_structure (tree); |
e2500fed | 3314 | |
7380d707 RK |
3315 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
3316 | or offset that depends on a field within a record. | |
3317 | ||
3318 | Note that we only allow such expressions within simple arithmetic | |
3319 | or a COND_EXPR. */ | |
3320 | ||
46c5ad27 | 3321 | extern bool contains_placeholder_p (tree); |
7a6cdb44 RK |
3322 | |
3323 | /* This macro calls the above function but short-circuits the common | |
3324 | case of a constant to save time. Also check for null. */ | |
3325 | ||
3326 | #define CONTAINS_PLACEHOLDER_P(EXP) \ | |
3327 | ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) | |
3328 | ||
3329 | /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR. | |
3330 | This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field | |
3331 | positions. */ | |
3332 | ||
46c5ad27 | 3333 | extern bool type_contains_placeholder_p (tree); |
7380d707 RK |
3334 | |
3335 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
3336 | return a tree with all occurrences of references to F in a | |
3337 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
3338 | contains only arithmetic expressions. */ | |
3339 | ||
46c5ad27 | 3340 | extern tree substitute_in_expr (tree, tree, tree); |
7380d707 | 3341 | |
6fce44af RK |
3342 | /* This macro calls the above function but short-circuits the common |
3343 | case of a constant to save time and also checks for NULL. */ | |
3344 | ||
3345 | #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ | |
3346 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) | |
3347 | ||
3348 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
3349 | for it within OBJ, a tree that is an object or a chain of references. */ | |
3350 | ||
3351 | extern tree substitute_placeholder_in_expr (tree, tree); | |
3352 | ||
3353 | /* This macro calls the above function but short-circuits the common | |
3354 | case of a constant to save time and also checks for NULL. */ | |
3355 | ||
3356 | #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ | |
3357 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ | |
3358 | : substitute_placeholder_in_expr (EXP, OBJ)) | |
3359 | ||
90ca31be RS |
3360 | /* variable_size (EXP) is like save_expr (EXP) except that it |
3361 | is for the special case of something that is part of a | |
3362 | variable size for a data type. It makes special arrangements | |
3363 | to compute the value at the right time when the data type | |
3364 | belongs to a function parameter. */ | |
3365 | ||
46c5ad27 | 3366 | extern tree variable_size (tree); |
90ca31be | 3367 | |
dcc24678 | 3368 | /* stabilize_reference (EXP) returns a reference equivalent to EXP |
8da1b058 RS |
3369 | but it can be used multiple times |
3370 | and only evaluate the subexpressions once. */ | |
3371 | ||
46c5ad27 | 3372 | extern tree stabilize_reference (tree); |
8da1b058 | 3373 | |
1c8b10bb RK |
3374 | /* Subroutine of stabilize_reference; this is called for subtrees of |
3375 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
3376 | to ensure that it is only evaluated once. */ | |
3377 | ||
46c5ad27 | 3378 | extern tree stabilize_reference_1 (tree); |
1c8b10bb | 3379 | |
8da1b058 RS |
3380 | /* Return EXP, stripped of any conversions to wider types |
3381 | in such a way that the result of converting to type FOR_TYPE | |
3382 | is the same as if EXP were converted to FOR_TYPE. | |
3383 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
3384 | ||
46c5ad27 | 3385 | extern tree get_unwidened (tree, tree); |
8da1b058 RS |
3386 | |
3387 | /* Return OP or a simpler expression for a narrower value | |
3388 | which can be sign-extended or zero-extended to give back OP. | |
3389 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
3390 | or 0 if the value should be sign-extended. */ | |
3391 | ||
46c5ad27 | 3392 | extern tree get_narrower (tree, int *); |
8da1b058 | 3393 | |
8da1b058 RS |
3394 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, |
3395 | look for nested component-refs or array-refs at constant positions | |
3396 | and find the ultimate containing object, which is returned. */ | |
3397 | ||
46c5ad27 AJ |
3398 | extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
3399 | tree *, enum machine_mode *, int *, int *); | |
8da1b058 | 3400 | |
ed239f5a RK |
3401 | /* Return 1 if T is an expression that get_inner_reference handles. */ |
3402 | ||
46c5ad27 | 3403 | extern int handled_component_p (tree); |
ed239f5a | 3404 | |
44de5aeb RK |
3405 | /* Return a tree of sizetype representing the size, in bytes, of the element |
3406 | of EXP, an ARRAY_REF. */ | |
3407 | ||
3408 | extern tree array_ref_element_size (tree); | |
3409 | ||
3410 | /* Return a tree representing the lower bound of the array mentioned in | |
3411 | EXP, an ARRAY_REF. */ | |
3412 | ||
3413 | extern tree array_ref_low_bound (tree); | |
3414 | ||
a7e5372d ZD |
3415 | /* Return a tree representing the upper bound of the array mentioned in |
3416 | EXP, an ARRAY_REF. */ | |
3417 | ||
3418 | extern tree array_ref_up_bound (tree); | |
3419 | ||
44de5aeb RK |
3420 | /* Return a tree representing the offset, in bytes, of the field referenced |
3421 | by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ | |
3422 | ||
3423 | extern tree component_ref_field_offset (tree); | |
3424 | ||
140b60b4 MM |
3425 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
3426 | NUL_TREE if there is no containing scope. */ | |
3427 | ||
46c5ad27 | 3428 | extern tree get_containing_scope (tree); |
140b60b4 | 3429 | |
8da1b058 RS |
3430 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
3431 | or zero if none. */ | |
46c5ad27 | 3432 | extern tree decl_function_context (tree); |
8da1b058 | 3433 | |
3635a54b RK |
3434 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
3435 | this _DECL with its context, or zero if none. */ | |
46c5ad27 | 3436 | extern tree decl_type_context (tree); |
8da1b058 | 3437 | |
a3c11cd3 | 3438 | /* Return 1 if EXPR is the real constant zero. */ |
46c5ad27 | 3439 | extern int real_zerop (tree); |
8da1b058 RS |
3440 | \f |
3441 | /* Declare commonly used variables for tree structure. */ | |
3442 | ||
4812480a JM |
3443 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
3444 | Zero means allow extended lvalues. */ | |
3445 | ||
3446 | extern int pedantic_lvalues; | |
3447 | ||
2ba84f36 | 3448 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ |
8da1b058 | 3449 | |
e2500fed | 3450 | extern GTY(()) tree current_function_decl; |
8da1b058 | 3451 | |
00262c8a | 3452 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
375d2edc | 3453 | extern GTY(()) const char * current_function_func_begin_label; |
8da1b058 | 3454 | \f |
143f1945 | 3455 | /* In tree.c */ |
2aab7ceb | 3456 | extern unsigned crc32_string (unsigned, const char *); |
46c5ad27 AJ |
3457 | extern void clean_symbol_name (char *); |
3458 | extern tree get_file_function_name_long (const char *); | |
3459 | extern tree get_set_constructor_bits (tree, char *, int); | |
3460 | extern tree get_set_constructor_bytes (tree, unsigned char *, int); | |
3461 | extern tree get_callee_fndecl (tree); | |
fccc4eb2 | 3462 | extern void change_decl_assembler_name (tree, tree); |
46c5ad27 | 3463 | extern int type_num_arguments (tree); |
3168cb99 JL |
3464 | extern bool associative_tree_code (enum tree_code); |
3465 | extern bool commutative_tree_code (enum tree_code); | |
24965e7a | 3466 | |
143f1945 | 3467 | \f |
8da1b058 RS |
3468 | /* In stmt.c */ |
3469 | ||
46c5ad27 AJ |
3470 | extern void expand_expr_stmt (tree); |
3471 | extern void expand_expr_stmt_value (tree, int, int); | |
b9861bff | 3472 | extern int warn_if_unused_value (tree, location_t); |
46c5ad27 | 3473 | extern void expand_decl_init (tree); |
46c5ad27 AJ |
3474 | extern void expand_label (tree); |
3475 | extern void expand_goto (tree); | |
3476 | extern void expand_asm (tree, int); | |
46c5ad27 | 3477 | |
6de9cd9a DN |
3478 | extern rtx expand_stack_save (void); |
3479 | extern void expand_stack_restore (tree); | |
46c5ad27 | 3480 | extern void expand_return (tree); |
46c5ad27 AJ |
3481 | extern int is_body_block (tree); |
3482 | ||
165b54c3 | 3483 | /* In tree-eh.c */ |
46c5ad27 | 3484 | extern void using_eh_for_cleanups (void); |
8da1b058 RS |
3485 | |
3486 | /* In fold-const.c */ | |
3487 | ||
4b63dccb RK |
3488 | /* Fold constants as much as possible in an expression. |
3489 | Returns the simplified expression. | |
3490 | Acts only on the top level of the expression; | |
3491 | if the argument itself cannot be simplified, its | |
3492 | subexpressions are not changed. */ | |
3493 | ||
46c5ad27 | 3494 | extern tree fold (tree); |
3e4093b6 | 3495 | extern tree fold_initializer (tree); |
e419fe91 | 3496 | extern tree fold_convert (tree, tree); |
46c5ad27 | 3497 | extern tree fold_single_bit_test (enum tree_code, tree, tree, tree); |
9675412f | 3498 | extern tree fold_ignored_result (tree); |
9655d83b | 3499 | extern tree fold_abs_const (tree, tree); |
46c5ad27 | 3500 | |
ca7a3bd7 NS |
3501 | extern tree force_fit_type (tree, int, bool, bool); |
3502 | ||
46c5ad27 AJ |
3503 | extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
3504 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3505 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3506 | extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3507 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3508 | extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3509 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3510 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3511 | extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3512 | HOST_WIDE_INT, unsigned int, | |
3513 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3514 | extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3515 | HOST_WIDE_INT, unsigned int, | |
3516 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
3517 | extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3518 | HOST_WIDE_INT, unsigned int, | |
3519 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3520 | extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
3521 | HOST_WIDE_INT, unsigned int, | |
3522 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
3523 | ||
3524 | extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT, | |
3525 | HOST_WIDE_INT, unsigned HOST_WIDE_INT, | |
3526 | HOST_WIDE_INT, unsigned HOST_WIDE_INT *, | |
3527 | HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, | |
3528 | HOST_WIDE_INT *); | |
3529 | ||
6de9cd9a DN |
3530 | enum operand_equal_flag |
3531 | { | |
3532 | OEP_ONLY_CONST = 1, | |
3533 | OEP_PURE_SAME = 2 | |
3534 | }; | |
3535 | ||
3536 | extern int operand_equal_p (tree, tree, unsigned int); | |
3537 | ||
46c5ad27 | 3538 | extern tree omit_one_operand (tree, tree, tree); |
08039bd8 | 3539 | extern tree omit_two_operands (tree, tree, tree, tree); |
46c5ad27 | 3540 | extern tree invert_truthvalue (tree); |
6de9cd9a DN |
3541 | extern tree nondestructive_fold_unary_to_constant (enum tree_code, tree, tree); |
3542 | extern tree nondestructive_fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
3543 | extern tree fold_read_from_constant_string (tree); | |
3544 | extern tree int_const_binop (enum tree_code, tree, tree, int); | |
cd3ce9b4 JM |
3545 | extern tree build_fold_addr_expr (tree); |
3546 | extern tree build_fold_addr_expr_with_type (tree, tree); | |
3547 | extern tree build_fold_indirect_ref (tree); | |
e9ea8bd5 | 3548 | extern tree constant_boolean_node (int, tree); |
c530479e | 3549 | |
fd660b1b JL |
3550 | extern bool tree_swap_operands_p (tree, tree, bool); |
3551 | extern enum tree_code swap_tree_comparison (enum tree_code); | |
3552 | ||
2f4675b4 ZD |
3553 | extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); |
3554 | ||
4977bab6 | 3555 | /* In builtins.c */ |
a32e70c3 RS |
3556 | extern tree fold_builtin (tree, bool); |
3557 | extern tree fold_builtin_fputs (tree, bool, bool, tree); | |
3558 | extern tree fold_builtin_strcpy (tree, tree); | |
3559 | extern tree fold_builtin_strncpy (tree, tree); | |
46c5ad27 AJ |
3560 | extern enum built_in_function builtin_mathfn_code (tree); |
3561 | extern tree build_function_call_expr (tree, tree); | |
3562 | extern tree mathfn_built_in (tree, enum built_in_function fn); | |
6de9cd9a | 3563 | extern tree strip_float_extensions (tree); |
6de9cd9a | 3564 | extern tree c_strlen (tree, int); |
e5da415c | 3565 | extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *); |
c2433d7d | 3566 | extern tree build_va_arg_indirect_ref (tree); |
a3c11cd3 | 3567 | |
77f9af81 | 3568 | /* In convert.c */ |
46c5ad27 | 3569 | extern tree strip_float_extensions (tree); |
77f9af81 | 3570 | |
a0c33338 | 3571 | /* In alias.c */ |
46c5ad27 AJ |
3572 | extern void record_component_aliases (tree); |
3573 | extern HOST_WIDE_INT get_alias_set (tree); | |
3574 | extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); | |
5399d643 | 3575 | extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); |
46c5ad27 | 3576 | extern int objects_must_conflict_p (tree, tree); |
bebe2280 | 3577 | |
a1d061a1 | 3578 | /* In tree.c */ |
46c5ad27 AJ |
3579 | extern int really_constant_p (tree); |
3580 | extern int int_fits_type_p (tree, tree); | |
5377d5ba | 3581 | extern bool variably_modified_type_p (tree, tree); |
46c5ad27 AJ |
3582 | extern int tree_log2 (tree); |
3583 | extern int tree_floor_log2 (tree); | |
3584 | extern int simple_cst_equal (tree, tree); | |
3585 | extern unsigned int iterative_hash_expr (tree, unsigned int); | |
3586 | extern int compare_tree_int (tree, unsigned HOST_WIDE_INT); | |
3587 | extern int type_list_equal (tree, tree); | |
3588 | extern int chain_member (tree, tree); | |
3589 | extern tree type_hash_lookup (unsigned int, tree); | |
3590 | extern void type_hash_add (unsigned int, tree); | |
46c5ad27 AJ |
3591 | extern int simple_cst_list_equal (tree, tree); |
3592 | extern void dump_tree_statistics (void); | |
3593 | extern void expand_function_end (void); | |
b79c5284 | 3594 | extern void expand_function_start (tree); |
46c5ad27 | 3595 | extern void expand_pending_sizes (tree); |
6de9cd9a | 3596 | extern void recompute_tree_invarant_for_addr_expr (tree); |
c597ef4e | 3597 | extern bool is_global_var (tree t); |
6de9cd9a | 3598 | extern bool needs_to_live_in_memory (tree); |
b34417a4 | 3599 | extern tree reconstruct_complex_type (tree, tree); |
46c5ad27 AJ |
3600 | |
3601 | extern int real_onep (tree); | |
3602 | extern int real_twop (tree); | |
3603 | extern int real_minus_onep (tree); | |
3604 | extern void init_ttree (void); | |
8c1d6d62 | 3605 | extern void build_common_tree_nodes (bool, bool); |
46c5ad27 | 3606 | extern void build_common_tree_nodes_2 (int); |
bc15d0ef | 3607 | extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); |
46c5ad27 | 3608 | extern tree build_range_type (tree, tree, tree); |
56cf8686 SP |
3609 | extern HOST_WIDE_INT int_cst_value (tree); |
3610 | extern tree tree_fold_gcd (tree, tree); | |
8b11a64c | 3611 | extern tree build_addr (tree); |
a1d061a1 | 3612 | |
fa27426e RH |
3613 | extern bool fields_compatible_p (tree, tree); |
3614 | extern tree find_compatible_field (tree, tree); | |
3615 | ||
a1d061a1 | 3616 | /* In function.c */ |
46c5ad27 AJ |
3617 | extern void expand_main_function (void); |
3618 | extern void init_dummy_function_start (void); | |
3619 | extern void expand_dummy_function_end (void); | |
3620 | extern void init_function_for_compilation (void); | |
3a70d621 | 3621 | extern void allocate_struct_function (tree); |
46c5ad27 | 3622 | extern void init_function_start (tree); |
8fff4fc1 | 3623 | extern bool use_register_for_decl (tree); |
46c5ad27 | 3624 | extern void assign_parms (tree); |
6de9cd9a | 3625 | extern void setjmp_vars_warning (tree); |
46c5ad27 | 3626 | extern void setjmp_args_warning (void); |
46c5ad27 AJ |
3627 | extern void init_temp_slots (void); |
3628 | extern void combine_temp_slots (void); | |
3629 | extern void free_temp_slots (void); | |
3630 | extern void pop_temp_slots (void); | |
3631 | extern void push_temp_slots (void); | |
3632 | extern void preserve_temp_slots (rtx); | |
3633 | extern void preserve_rtl_expr_temps (tree); | |
61f71b34 | 3634 | extern int aggregate_value_p (tree, tree); |
46c5ad27 AJ |
3635 | extern void push_function_context (void); |
3636 | extern void pop_function_context (void); | |
3637 | extern void push_function_context_to (tree); | |
3638 | extern void pop_function_context_from (tree); | |
a1d061a1 JL |
3639 | |
3640 | /* In print-rtl.c */ | |
3641 | #ifdef BUFSIZ | |
46c5ad27 | 3642 | extern void print_rtl (FILE *, rtx); |
a1d061a1 JL |
3643 | #endif |
3644 | ||
3645 | /* In print-tree.c */ | |
46c5ad27 | 3646 | extern void debug_tree (tree); |
a1d061a1 | 3647 | #ifdef BUFSIZ |
46c5ad27 AJ |
3648 | extern void print_node (FILE *, const char *, tree, int); |
3649 | extern void print_node_brief (FILE *, const char *, tree, int); | |
3650 | extern void indent_to (FILE *, int); | |
a1d061a1 JL |
3651 | #endif |
3652 | ||
61a36b9b RK |
3653 | /* In tree-inline.c: */ |
3654 | extern bool debug_find_tree (tree, tree); | |
19114537 EC |
3655 | /* This is in tree-inline.c since the routine uses |
3656 | data structures from the inliner. */ | |
3657 | extern tree unsave_expr_now (tree); | |
61a36b9b | 3658 | |
a1d061a1 | 3659 | /* In expr.c */ |
46c5ad27 AJ |
3660 | extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx); |
3661 | extern void check_max_integer_computation_mode (tree); | |
a1d061a1 JL |
3662 | |
3663 | /* In emit-rtl.c */ | |
0cea056b | 3664 | extern rtx emit_line_note (location_t); |
a1d061a1 | 3665 | |
3a8c995b | 3666 | /* In calls.c */ |
f2d33f13 | 3667 | |
fa5b060f SB |
3668 | /* Nonzero if this is a call to a `const' function. */ |
3669 | #define ECF_CONST 1 | |
3670 | /* Nonzero if this is a call to a `volatile' function. */ | |
3671 | #define ECF_NORETURN 2 | |
3672 | /* Nonzero if this is a call to malloc or a related function. */ | |
3673 | #define ECF_MALLOC 4 | |
3674 | /* Nonzero if it is plausible that this is a call to alloca. */ | |
3675 | #define ECF_MAY_BE_ALLOCA 8 | |
3676 | /* Nonzero if this is a call to a function that won't throw an exception. */ | |
3677 | #define ECF_NOTHROW 16 | |
3678 | /* Nonzero if this is a call to setjmp or a related function. */ | |
3679 | #define ECF_RETURNS_TWICE 32 | |
3680 | /* Nonzero if this is a call to `longjmp'. */ | |
3681 | #define ECF_LONGJMP 64 | |
3682 | /* Nonzero if this is a syscall that makes a new process in the image of | |
3683 | the current one. */ | |
d1c38823 | 3684 | #define ECF_SIBCALL 128 |
fa5b060f SB |
3685 | /* Nonzero if this is a call to "pure" function (like const function, |
3686 | but may read memory. */ | |
d1c38823 | 3687 | #define ECF_PURE 256 |
fa5b060f SB |
3688 | /* Nonzero if this is a call to a function that returns with the stack |
3689 | pointer depressed. */ | |
d1c38823 | 3690 | #define ECF_SP_DEPRESSED 512 |
fa5b060f | 3691 | /* Nonzero if this call is known to always return. */ |
d1c38823 | 3692 | #define ECF_ALWAYS_RETURN 1024 |
fa5b060f | 3693 | /* Create libcall block around the call. */ |
d1c38823 | 3694 | #define ECF_LIBCALL_BLOCK 2048 |
fa5b060f | 3695 | |
46c5ad27 | 3696 | extern int flags_from_decl_or_type (tree); |
f027e0a2 | 3697 | extern int call_expr_flags (tree); |
fa5b060f | 3698 | |
46c5ad27 AJ |
3699 | extern int setjmp_call_p (tree); |
3700 | extern bool alloca_call_p (tree); | |
fe984136 RH |
3701 | extern bool must_pass_in_stack_var_size (enum machine_mode, tree); |
3702 | extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree); | |
3a8c995b | 3703 | |
bb9f8221 | 3704 | /* In attribs.c. */ |
0c96e965 RK |
3705 | |
3706 | /* Process the attributes listed in ATTRIBUTES and install them in *NODE, | |
3707 | which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, | |
3708 | it should be modified in place; if a TYPE, a copy should be created | |
3709 | unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further | |
3710 | information, in the form of a bitwise OR of flags in enum attribute_flags | |
3711 | from tree.h. Depending on these flags, some attributes may be | |
3712 | returned to be applied at a later stage (for example, to apply | |
3713 | a decl attribute to the declaration rather than to its type). */ | |
4682ae04 | 3714 | extern tree decl_attributes (tree *, tree, int); |
bb9f8221 | 3715 | |
a1d061a1 | 3716 | /* In integrate.c */ |
46c5ad27 | 3717 | extern void set_decl_abstract_flags (tree, int); |
46c5ad27 | 3718 | extern void set_decl_origin_self (tree); |
a1d061a1 | 3719 | |
a1d061a1 | 3720 | /* In stor-layout.c */ |
7b6d72fc | 3721 | extern void set_min_and_max_values_for_integral_type (tree, int, bool); |
46c5ad27 AJ |
3722 | extern void fixup_signed_type (tree); |
3723 | extern void internal_reference_types (void); | |
6de9cd9a DN |
3724 | extern unsigned int update_alignment_for_field (record_layout_info, tree, |
3725 | unsigned int); | |
a1d061a1 | 3726 | /* varasm.c */ |
0e6df31e | 3727 | extern void make_decl_rtl (tree); |
46c5ad27 AJ |
3728 | extern void make_decl_one_only (tree); |
3729 | extern int supports_one_only (void); | |
3730 | extern void variable_section (tree, int); | |
3731 | enum tls_model decl_tls_model (tree); | |
46c5ad27 AJ |
3732 | extern void resolve_unique_section (tree, int, int); |
3733 | extern void mark_referenced (tree); | |
bb9a388d | 3734 | extern void mark_decl_referenced (tree); |
810db579 | 3735 | extern void notice_global_symbol (tree); |
0e6df31e | 3736 | extern void set_user_assembler_name (tree, const char *); |
a1d061a1 | 3737 | |
a1d061a1 | 3738 | /* In stmt.c */ |
46c5ad27 AJ |
3739 | extern void expand_computed_goto (tree); |
3740 | extern bool parse_output_constraint (const char **, int, int, int, | |
3741 | bool *, bool *, bool *); | |
1456deaf JM |
3742 | extern bool parse_input_constraint (const char **, int, int, int, int, |
3743 | const char * const *, bool *, bool *); | |
177560b2 | 3744 | extern void expand_asm_operands (tree, tree, tree, tree, int, location_t); |
6de9cd9a DN |
3745 | extern void expand_asm_expr (tree); |
3746 | extern bool asm_op_is_mem_input (tree, tree); | |
7dc8b126 | 3747 | extern tree resolve_asm_operand_names (tree, tree, tree); |
7efcb746 | 3748 | extern void expand_case (tree); |
46c5ad27 | 3749 | extern void expand_decl (tree); |
46c5ad27 | 3750 | extern void expand_anon_union_decl (tree, tree, tree); |
6de9cd9a DN |
3751 | |
3752 | /* In gimplify.c. */ | |
3753 | extern tree create_artificial_label (void); | |
3754 | extern void gimplify_function_tree (tree); | |
3755 | extern const char *get_name (tree); | |
3756 | extern tree unshare_expr (tree); | |
0f1f6967 | 3757 | extern void sort_case_labels (tree); |
a1d061a1 | 3758 | |
496651db MM |
3759 | /* If KIND=='I', return a suitable global initializer (constructor) name. |
3760 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
46c5ad27 | 3761 | extern tree get_file_function_name (int); |
af4142d5 JM |
3762 | \f |
3763 | /* Interface of the DWARF2 unwind info support. */ | |
3764 | ||
af4142d5 JM |
3765 | /* Generate a new label for the CFI info to refer to. */ |
3766 | ||
46c5ad27 | 3767 | extern char *dwarf2out_cfi_label (void); |
af4142d5 JM |
3768 | |
3769 | /* Entry point to update the canonical frame address (CFA). */ | |
3770 | ||
0ab5b679 | 3771 | extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); |
af4142d5 JM |
3772 | |
3773 | /* Add the CFI for saving a register window. */ | |
3774 | ||
46c5ad27 | 3775 | extern void dwarf2out_window_save (const char *); |
af4142d5 JM |
3776 | |
3777 | /* Add a CFI to update the running total of the size of arguments pushed | |
3778 | onto the stack. */ | |
3779 | ||
0ab5b679 | 3780 | extern void dwarf2out_args_size (const char *, HOST_WIDE_INT); |
af4142d5 JM |
3781 | |
3782 | /* Entry point for saving a register to the stack. */ | |
3783 | ||
0ab5b679 | 3784 | extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); |
af4142d5 JM |
3785 | |
3786 | /* Entry point for saving the return address in the stack. */ | |
3787 | ||
0ab5b679 | 3788 | extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); |
af4142d5 JM |
3789 | |
3790 | /* Entry point for saving the return address in a register. */ | |
3791 | ||
46c5ad27 | 3792 | extern void dwarf2out_return_reg (const char *, unsigned); |
af4142d5 | 3793 | |
d8472c75 JM |
3794 | /* In tree-inline.c */ |
3795 | ||
6de9cd9a | 3796 | /* The type of a callback function for walking over tree structure. */ |
588d3ade | 3797 | |
46c5ad27 | 3798 | typedef tree (*walk_tree_fn) (tree *, int *, void *); |
d8472c75 JM |
3799 | extern tree walk_tree (tree*, walk_tree_fn, void*, void*); |
3800 | extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*); | |
588d3ade | 3801 | |
89d684bb BM |
3802 | /* In tree-dump.c */ |
3803 | ||
3804 | /* Different tree dump places. When you add new tree dump places, | |
6de9cd9a | 3805 | extend the DUMP_FILES array in tree-dump.c. */ |
89d684bb BM |
3806 | enum tree_dump_index |
3807 | { | |
6de9cd9a DN |
3808 | TDI_none, /* No dump */ |
3809 | TDI_tu, /* dump the whole translation unit. */ | |
3810 | TDI_class, /* dump class hierarchy. */ | |
89d684bb | 3811 | TDI_original, /* dump each function before optimizing it */ |
6de9cd9a DN |
3812 | TDI_generic, /* dump each function after genericizing it */ |
3813 | TDI_nested, /* dump each function after unnesting it */ | |
89d684bb BM |
3814 | TDI_inlined, /* dump each function after inlining |
3815 | within it. */ | |
caf93cb0 | 3816 | TDI_vcg, /* create a VCG graph file for each |
6de9cd9a | 3817 | function's flowgraph. */ |
9f8628ba PB |
3818 | TDI_tree_all, /* enable all the GENERIC/GIMPLE dumps. */ |
3819 | TDI_rtl_all, /* enable all the RTL dumps. */ | |
9b3e897d PB |
3820 | TDI_ipa_all, /* enable all the IPA dumps. */ |
3821 | ||
3822 | TDI_cgraph, /* dump function call graph. */ | |
9f8628ba PB |
3823 | |
3824 | DFI_MIN, /* For now, RTL dumps are placed here. */ | |
3825 | DFI_sibling = DFI_MIN, | |
3826 | DFI_eh, | |
3827 | DFI_jump, | |
3828 | DFI_cse, | |
3829 | DFI_gcse, | |
3830 | DFI_loop, | |
3831 | DFI_bypass, | |
3832 | DFI_cfg, | |
3833 | DFI_bp, | |
3834 | DFI_vpt, | |
3835 | DFI_ce1, | |
3836 | DFI_tracer, | |
3837 | DFI_loop2, | |
3838 | DFI_web, | |
3839 | DFI_cse2, | |
3840 | DFI_life, | |
3841 | DFI_combine, | |
3842 | DFI_ce2, | |
3843 | DFI_regmove, | |
3844 | DFI_sms, | |
3845 | DFI_sched, | |
3846 | DFI_lreg, | |
3847 | DFI_greg, | |
3848 | DFI_postreload, | |
3849 | DFI_gcse2, | |
3850 | DFI_flow2, | |
3851 | DFI_peephole2, | |
3852 | DFI_ce3, | |
3853 | DFI_rnreg, | |
3854 | DFI_bbro, | |
3855 | DFI_branch_target_load, | |
3856 | DFI_sched2, | |
3857 | DFI_stack, | |
3858 | DFI_vartrack, | |
3859 | DFI_mach, | |
3860 | DFI_dbr, | |
3861 | ||
89d684bb BM |
3862 | TDI_end |
3863 | }; | |
3864 | ||
9f8628ba PB |
3865 | /* Bit masks to control dumping. Not all values are applicable to |
3866 | all dumps. Add new ones at the end. When you define new | |
89d684bb BM |
3867 | values, extend the DUMP_OPTIONS array in tree-dump.c */ |
3868 | #define TDF_ADDRESS (1 << 0) /* dump node addresses */ | |
3869 | #define TDF_SLIM (1 << 1) /* don't go wild following links */ | |
6de9cd9a DN |
3870 | #define TDF_RAW (1 << 2) /* don't unparse the function */ |
3871 | #define TDF_DETAILS (1 << 3) /* show more detailed info about | |
3872 | each pass */ | |
3873 | #define TDF_STATS (1 << 4) /* dump various statistics about | |
3874 | each pass */ | |
3875 | #define TDF_BLOCKS (1 << 5) /* display basic block boundaries */ | |
3876 | #define TDF_VOPS (1 << 6) /* display virtual operands */ | |
3877 | #define TDF_LINENO (1 << 7) /* display statement line numbers */ | |
3878 | #define TDF_UID (1 << 8) /* display decl UIDs */ | |
3879 | ||
9f8628ba PB |
3880 | #define TDF_TREE (1 << 9) /* is a tree dump */ |
3881 | #define TDF_RTL (1 << 10) /* is a RTL dump */ | |
9b3e897d | 3882 | #define TDF_IPA (1 << 11) /* is an IPA dump */ |
89d684bb BM |
3883 | |
3884 | typedef struct dump_info *dump_info_p; | |
3885 | ||
9f8628ba | 3886 | extern char *get_dump_file_name (enum tree_dump_index); |
46c5ad27 AJ |
3887 | extern int dump_flag (dump_info_p, int, tree); |
3888 | extern int dump_enabled_p (enum tree_dump_index); | |
9f8628ba | 3889 | extern int dump_initialized_p (enum tree_dump_index); |
46c5ad27 AJ |
3890 | extern FILE *dump_begin (enum tree_dump_index, int *); |
3891 | extern void dump_end (enum tree_dump_index, FILE *); | |
3892 | extern void dump_node (tree, int, FILE *); | |
3893 | extern int dump_switch_p (const char *); | |
3894 | extern const char *dump_flag_name (enum tree_dump_index); | |
a560d4d4 JH |
3895 | /* Assign the RTX to declaration. */ |
3896 | ||
46c5ad27 | 3897 | extern void set_decl_rtl (tree, rtx); |
fbe6ec81 | 3898 | extern void set_decl_incoming_rtl (tree, rtx); |
9a6bb3f7 | 3899 | \f |
caf93cb0 | 3900 | /* Enum and arrays used for tree allocation stats. |
938d968e | 3901 | Keep in sync with tree.c:tree_node_kind_names. */ |
adc4adcd GP |
3902 | typedef enum |
3903 | { | |
3904 | d_kind, | |
3905 | t_kind, | |
3906 | b_kind, | |
3907 | s_kind, | |
3908 | r_kind, | |
3909 | e_kind, | |
3910 | c_kind, | |
3911 | id_kind, | |
3912 | perm_list_kind, | |
3913 | temp_list_kind, | |
3914 | vec_kind, | |
95b4aca6 | 3915 | binfo_kind, |
6de9cd9a DN |
3916 | phi_kind, |
3917 | ssa_name_kind, | |
adc4adcd GP |
3918 | x_kind, |
3919 | lang_decl, | |
3920 | lang_type, | |
3921 | all_kinds | |
3922 | } tree_node_kind; | |
3923 | ||
3924 | extern int tree_node_counts[]; | |
3925 | extern int tree_node_sizes[]; | |
6de9cd9a DN |
3926 | |
3927 | /* True if we are in gimple form and the actions of the folders need to | |
3928 | be restricted. False if we are not in gimple form and folding is not | |
3929 | restricted to creating gimple expressions. */ | |
3930 | extern bool in_gimple_form; | |
caf93cb0 | 3931 | |
e9eb809d | 3932 | /* In tree-ssa-loop-niter.c. */ |
e9eb809d ZD |
3933 | tree lower_bound_in_type (tree, tree); |
3934 | tree upper_bound_in_type (tree, tree); | |
3935 | ||
56b043c8 JL |
3936 | /* In tree-ssa-threadupdate.c. */ |
3937 | extern bool thread_through_all_blocks (void); | |
3938 | ||
389fdba0 RH |
3939 | /* In tree-gimple.c. */ |
3940 | extern tree get_base_address (tree t); | |
3941 | ||
df89f8e7 | 3942 | #endif /* GCC_TREE_H */ |