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