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