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