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