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