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