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