]>
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, |
71d59383 | 3 | 2001, 2002, 2003, 2004, 2005, 2006 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 | 18 | along with GCC; see the file COPYING. If not, write to the Free |
366ccddb KC |
19 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
20 | 02110-1301, USA. */ | |
8da1b058 | 21 | |
df89f8e7 GDR |
22 | #ifndef GCC_TREE_H |
23 | #define GCC_TREE_H | |
24 | ||
9c5835d5 | 25 | #include "hashtab.h" |
8da1b058 | 26 | #include "machmode.h" |
6060edcb | 27 | #include "input.h" |
b9dcdee4 | 28 | #include "statistics.h" |
fa743e8c | 29 | #include "vec.h" |
8da1b058 | 30 | |
d6b12657 | 31 | /* Codes of tree nodes */ |
8da1b058 RS |
32 | |
33 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
34 | ||
35 | enum tree_code { | |
36 | #include "tree.def" | |
37 | ||
6dc42e49 | 38 | LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for |
cdc9d803 | 39 | NUM_TREE_CODES. */ |
8da1b058 RS |
40 | }; |
41 | ||
42 | #undef DEFTREECODE | |
43 | ||
820cc88f DB |
44 | extern unsigned char tree_contains_struct[256][64]; |
45 | #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) | |
46 | ||
8d5e6e25 RK |
47 | /* Number of language-independent tree codes. */ |
48 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
8da1b058 | 49 | |
6615c446 JO |
50 | /* Tree code classes. */ |
51 | ||
52 | /* Each tree_code has an associated code class represented by a | |
53 | TREE_CODE_CLASS. */ | |
54 | ||
55 | enum tree_code_class { | |
56 | tcc_exceptional, /* An exceptional code (fits no category). */ | |
57 | tcc_constant, /* A constant. */ | |
38b3627d | 58 | /* Order of tcc_type and tcc_declaration is important. */ |
6615c446 JO |
59 | tcc_type, /* A type object code. */ |
60 | tcc_declaration, /* A declaration (also serving as variable refs). */ | |
61 | tcc_reference, /* A reference to storage. */ | |
62 | tcc_comparison, /* A comparison expression. */ | |
63 | tcc_unary, /* A unary arithmetic expression. */ | |
64 | tcc_binary, /* A binary arithmetic expression. */ | |
65 | tcc_statement, /* A statement expression, which have side effects | |
66 | but usually no interesting value. */ | |
07beea0d AH |
67 | tcc_expression, /* Any other expression. */ |
68 | tcc_gimple_stmt /* A GIMPLE statement. */ | |
6615c446 JO |
69 | }; |
70 | ||
71 | /* Each tree code class has an associated string representation. | |
72 | These must correspond to the tree_code_class entries. */ | |
73 | ||
b85e3643 | 74 | extern const char *const tree_code_class_strings[]; |
6615c446 JO |
75 | |
76 | /* Returns the string representing CLASS. */ | |
77 | ||
78 | #define TREE_CODE_CLASS_STRING(CLASS)\ | |
79 | tree_code_class_strings[(int) (CLASS)] | |
8da1b058 | 80 | |
0a6969ad | 81 | #define MAX_TREE_CODES 256 |
6615c446 | 82 | extern const enum tree_code_class tree_code_type[]; |
0a6969ad | 83 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
8da1b058 | 84 | |
6615c446 JO |
85 | /* Nonzero if CODE represents an exceptional code. */ |
86 | ||
87 | #define EXCEPTIONAL_CLASS_P(CODE)\ | |
88 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) | |
89 | ||
90 | /* Nonzero if CODE represents a constant. */ | |
91 | ||
92 | #define CONSTANT_CLASS_P(CODE)\ | |
93 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) | |
94 | ||
95 | /* Nonzero if CODE represents a type. */ | |
96 | ||
97 | #define TYPE_P(CODE)\ | |
98 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) | |
99 | ||
100 | /* Nonzero if CODE represents a declaration. */ | |
101 | ||
102 | #define DECL_P(CODE)\ | |
103 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) | |
104 | ||
326eda4b DB |
105 | /* Nonzero if CODE represents a memory tag. */ |
106 | ||
107 | #define MTAG_P(CODE) \ | |
108 | (TREE_CODE (CODE) == STRUCT_FIELD_TAG \ | |
109 | || TREE_CODE (CODE) == NAME_MEMORY_TAG \ | |
18cd8a03 | 110 | || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG) |
0ac11108 | 111 | |
326eda4b | 112 | |
820cc88f DB |
113 | /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ |
114 | ||
115 | #define VAR_OR_FUNCTION_DECL_P(DECL)\ | |
116 | (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) | |
117 | ||
38b3627d NS |
118 | /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in |
119 | ascending code order. */ | |
820cc88f | 120 | |
1b096a0a DB |
121 | #define INDIRECT_REF_P(CODE)\ |
122 | (TREE_CODE (CODE) == INDIRECT_REF \ | |
38b3627d NS |
123 | || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \ |
124 | || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF) | |
1b096a0a | 125 | |
6615c446 JO |
126 | /* Nonzero if CODE represents a reference. */ |
127 | ||
128 | #define REFERENCE_CLASS_P(CODE)\ | |
129 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) | |
130 | ||
131 | /* Nonzero if CODE represents a comparison. */ | |
132 | ||
133 | #define COMPARISON_CLASS_P(CODE)\ | |
134 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) | |
135 | ||
136 | /* Nonzero if CODE represents a unary arithmetic expression. */ | |
137 | ||
138 | #define UNARY_CLASS_P(CODE)\ | |
139 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) | |
140 | ||
141 | /* Nonzero if CODE represents a binary arithmetic expression. */ | |
142 | ||
143 | #define BINARY_CLASS_P(CODE)\ | |
144 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) | |
145 | ||
146 | /* Nonzero if CODE represents a statement expression. */ | |
147 | ||
148 | #define STATEMENT_CLASS_P(CODE)\ | |
149 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) | |
150 | ||
151 | /* Nonzero if CODE represents any other expression. */ | |
152 | ||
153 | #define EXPRESSION_CLASS_P(CODE)\ | |
154 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) | |
155 | ||
6615c446 JO |
156 | /* Returns nonzero iff CODE represents a type or declaration. */ |
157 | ||
158 | #define IS_TYPE_OR_DECL_P(CODE)\ | |
159 | (TYPE_P (CODE) || DECL_P (CODE)) | |
4f976745 | 160 | |
0e9e1e0a | 161 | /* Returns nonzero iff CLASS is the tree-code class of an |
4da05956 MM |
162 | expression. */ |
163 | ||
6615c446 | 164 | #define IS_EXPR_CODE_CLASS(CLASS)\ |
4600cc14 | 165 | ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) |
c25d44dd | 166 | |
07beea0d AH |
167 | /* Returns nonzer iff CLASS is a GIMPLE statement. */ |
168 | ||
169 | #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt) | |
170 | ||
c25d44dd JM |
171 | /* Returns nonzero iff NODE is an expression of some kind. */ |
172 | ||
173 | #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) | |
4da05956 | 174 | |
50674e96 DN |
175 | /* Returns nonzero iff NODE is an OpenMP directive. */ |
176 | ||
177 | #define OMP_DIRECTIVE_P(NODE) \ | |
178 | (TREE_CODE (NODE) == OMP_PARALLEL \ | |
50674e96 | 179 | || TREE_CODE (NODE) == OMP_FOR \ |
777f7f9a | 180 | || TREE_CODE (NODE) == OMP_SECTIONS \ |
50674e96 | 181 | || TREE_CODE (NODE) == OMP_SINGLE \ |
777f7f9a | 182 | || TREE_CODE (NODE) == OMP_SECTION \ |
50674e96 DN |
183 | || TREE_CODE (NODE) == OMP_MASTER \ |
184 | || TREE_CODE (NODE) == OMP_ORDERED \ | |
777f7f9a RH |
185 | || TREE_CODE (NODE) == OMP_CRITICAL \ |
186 | || TREE_CODE (NODE) == OMP_RETURN \ | |
187 | || TREE_CODE (NODE) == OMP_CONTINUE) | |
50674e96 | 188 | |
8da1b058 RS |
189 | /* Number of argument-words in each kind of tree-node. */ |
190 | ||
2f9834e8 | 191 | extern const unsigned char tree_code_length[]; |
8d5e6e25 | 192 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
8da1b058 RS |
193 | |
194 | /* Names of tree components. */ | |
195 | ||
2f9834e8 | 196 | extern const char *const tree_code_name[]; |
fa743e8c | 197 | |
d4e6fecb NS |
198 | /* A vectors of trees. */ |
199 | DEF_VEC_P(tree); | |
200 | DEF_VEC_ALLOC_P(tree,gc); | |
201 | DEF_VEC_ALLOC_P(tree,heap); | |
fa743e8c | 202 | |
8da1b058 | 203 | \f |
9df2c88c RK |
204 | /* Classify which part of the compiler has defined a given builtin function. |
205 | Note that we assume below that this is no more than two bits. */ | |
26db82d8 BS |
206 | enum built_in_class |
207 | { | |
208 | NOT_BUILT_IN = 0, | |
209 | BUILT_IN_FRONTEND, | |
210 | BUILT_IN_MD, | |
211 | BUILT_IN_NORMAL | |
212 | }; | |
9df2c88c RK |
213 | |
214 | /* Names for the above. */ | |
fd05eb80 | 215 | extern const char *const built_in_class_names[4]; |
9df2c88c | 216 | |
8da1b058 RS |
217 | /* Codes that identify the various built in functions |
218 | so that expand_call can identify them quickly. */ | |
219 | ||
c6a912da | 220 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, |
8da1b058 RS |
221 | enum built_in_function |
222 | { | |
cb1072f4 | 223 | #include "builtins.def" |
972ded9c | 224 | |
7e7e470f RH |
225 | /* Complex division routines in libgcc. These are done via builtins |
226 | because emit_library_call_value can't handle complex values. */ | |
227 | BUILT_IN_COMPLEX_MUL_MIN, | |
228 | BUILT_IN_COMPLEX_MUL_MAX | |
229 | = BUILT_IN_COMPLEX_MUL_MIN | |
230 | + MAX_MODE_COMPLEX_FLOAT | |
231 | - MIN_MODE_COMPLEX_FLOAT, | |
232 | ||
233 | BUILT_IN_COMPLEX_DIV_MIN, | |
234 | BUILT_IN_COMPLEX_DIV_MAX | |
235 | = BUILT_IN_COMPLEX_DIV_MIN | |
236 | + MAX_MODE_COMPLEX_FLOAT | |
237 | - MIN_MODE_COMPLEX_FLOAT, | |
238 | ||
2ba84f36 | 239 | /* Upper bound on non-language-specific builtins. */ |
972ded9c | 240 | END_BUILTINS |
8da1b058 | 241 | }; |
cb1072f4 | 242 | #undef DEF_BUILTIN |
9df2c88c RK |
243 | |
244 | /* Names for the above. */ | |
7e7e470f | 245 | extern const char * built_in_names[(int) END_BUILTINS]; |
3ff5f682 | 246 | |
82b4201f KG |
247 | /* Helper macros for math builtins. */ |
248 | ||
249 | #define BUILTIN_EXP10_P(FN) \ | |
250 | ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ | |
251 | || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) | |
252 | ||
253 | #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ | |
254 | || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ | |
255 | || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) | |
256 | ||
257 | #define BUILTIN_SQRT_P(FN) \ | |
258 | ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) | |
259 | ||
260 | #define BUILTIN_CBRT_P(FN) \ | |
261 | ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) | |
262 | ||
263 | #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) | |
264 | ||
ea6a6627 VR |
265 | #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L |
266 | #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL | |
267 | ||
3ff5f682 | 268 | /* An array of _DECL trees for the above. */ |
17211ab5 | 269 | extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; |
272f51a3 | 270 | extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; |
8da1b058 | 271 | \f |
aaf46ef9 DN |
272 | /* In an OMP_CLAUSE node. */ |
273 | ||
274 | /* Number of operands and names for each clause. */ | |
275 | extern unsigned const char omp_clause_num_ops[]; | |
276 | extern const char * const omp_clause_code_name[]; | |
277 | ||
278 | /* Clause codes. Do not reorder, as this is used to index into the tables | |
279 | omp_clause_num_ops and omp_clause_code_name. */ | |
280 | enum omp_clause_code | |
281 | { | |
282 | /* Clause zero is special-cased inside the parser | |
283 | (c_parser_omp_variable_list). */ | |
284 | OMP_CLAUSE_ERROR = 0, | |
285 | ||
286 | /* OpenMP clause: private (variable_list). */ | |
287 | OMP_CLAUSE_PRIVATE, | |
288 | ||
289 | /* OpenMP clause: shared (variable_list). */ | |
290 | OMP_CLAUSE_SHARED, | |
291 | ||
292 | /* OpenMP clause: firstprivate (variable_list). */ | |
293 | OMP_CLAUSE_FIRSTPRIVATE, | |
294 | ||
295 | /* OpenMP clause: lastprivate (variable_list). */ | |
296 | OMP_CLAUSE_LASTPRIVATE, | |
297 | ||
298 | /* OpenMP clause: reduction (operator:variable_list). | |
299 | OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator. | |
300 | Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var. | |
0ac11108 | 301 | Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var |
aaf46ef9 DN |
302 | into the shared one. |
303 | Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL | |
304 | placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */ | |
305 | OMP_CLAUSE_REDUCTION, | |
306 | ||
307 | /* OpenMP clause: copyin (variable_list). */ | |
308 | OMP_CLAUSE_COPYIN, | |
309 | ||
310 | /* OpenMP clause: copyprivate (variable_list). */ | |
311 | OMP_CLAUSE_COPYPRIVATE, | |
312 | ||
313 | /* OpenMP clause: if (scalar-expression). */ | |
314 | OMP_CLAUSE_IF, | |
315 | ||
316 | /* OpenMP clause: num_threads (integer-expression). */ | |
317 | OMP_CLAUSE_NUM_THREADS, | |
318 | ||
319 | /* OpenMP clause: schedule. */ | |
320 | OMP_CLAUSE_SCHEDULE, | |
321 | ||
322 | /* OpenMP clause: nowait. */ | |
323 | OMP_CLAUSE_NOWAIT, | |
324 | ||
325 | /* OpenMP clause: ordered. */ | |
326 | OMP_CLAUSE_ORDERED, | |
327 | ||
328 | /* OpenMP clause: default. */ | |
329 | OMP_CLAUSE_DEFAULT | |
330 | }; | |
331 | \f | |
8da1b058 RS |
332 | /* The definition of tree nodes fills the next several pages. */ |
333 | ||
334 | /* A tree node can represent a data type, a variable, an expression | |
335 | or a statement. Each node has a TREE_CODE which says what kind of | |
336 | thing it represents. Some common codes are: | |
337 | INTEGER_TYPE -- represents a type of integers. | |
338 | ARRAY_TYPE -- represents a type of pointer. | |
339 | VAR_DECL -- represents a declared variable. | |
340 | INTEGER_CST -- represents a constant integer value. | |
341 | PLUS_EXPR -- represents a sum (an expression). | |
342 | ||
343 | As for the contents of a tree node: there are some fields | |
344 | that all nodes share. Each TREE_CODE has various special-purpose | |
345 | fields as well. The fields of a node are never accessed directly, | |
346 | always through accessor macros. */ | |
347 | ||
8da1b058 RS |
348 | /* Every kind of tree node starts with this structure, |
349 | so all nodes have these fields. | |
350 | ||
76c9d226 | 351 | See the accessor macros, defined below, for documentation of the |
eebedaa5 | 352 | fields. */ |
6de9cd9a | 353 | union tree_ann_d; |
8da1b058 | 354 | |
07beea0d | 355 | struct tree_base GTY(()) |
8da1b058 | 356 | { |
c149cc37 | 357 | ENUM_BITFIELD(tree_code) code : 8; |
ae34ac46 | 358 | |
8da1b058 RS |
359 | unsigned side_effects_flag : 1; |
360 | unsigned constant_flag : 1; | |
8da1b058 RS |
361 | unsigned addressable_flag : 1; |
362 | unsigned volatile_flag : 1; | |
363 | unsigned readonly_flag : 1; | |
364 | unsigned unsigned_flag : 1; | |
365 | unsigned asm_written_flag: 1; | |
6de9cd9a | 366 | unsigned nowarning_flag : 1; |
4f976745 | 367 | |
6de9cd9a | 368 | unsigned used_flag : 1; |
12a22e76 | 369 | unsigned nothrow_flag : 1; |
8da1b058 RS |
370 | unsigned static_flag : 1; |
371 | unsigned public_flag : 1; | |
372 | unsigned private_flag : 1; | |
373 | unsigned protected_flag : 1; | |
e23bd218 | 374 | unsigned deprecated_flag : 1; |
6de9cd9a | 375 | unsigned invariant_flag : 1; |
8da1b058 RS |
376 | |
377 | unsigned lang_flag_0 : 1; | |
378 | unsigned lang_flag_1 : 1; | |
379 | unsigned lang_flag_2 : 1; | |
380 | unsigned lang_flag_3 : 1; | |
381 | unsigned lang_flag_4 : 1; | |
382 | unsigned lang_flag_5 : 1; | |
383 | unsigned lang_flag_6 : 1; | |
6de9cd9a | 384 | unsigned visited : 1; |
07beea0d AH |
385 | |
386 | /* FIXME tuples: Eventually, we need to move this somewhere external to | |
387 | the trees. */ | |
388 | union tree_ann_d *ann; | |
389 | }; | |
390 | ||
391 | struct tree_common GTY(()) | |
392 | { | |
393 | struct tree_base base; | |
394 | tree chain; | |
395 | tree type; | |
396 | }; | |
397 | ||
398 | /* GIMPLE_MODIFY_STMT */ | |
399 | struct gimple_stmt GTY(()) | |
400 | { | |
401 | struct tree_base base; | |
402 | source_locus locus; | |
403 | tree block; | |
404 | /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */ | |
405 | tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1]; | |
8da1b058 RS |
406 | }; |
407 | ||
a5f99f01 RK |
408 | /* The following table lists the uses of each of the above flags and |
409 | for which types of nodes they are defined. Note that expressions | |
410 | include decls. | |
411 | ||
412 | addressable_flag: | |
413 | ||
414 | TREE_ADDRESSABLE in | |
46c5ad27 | 415 | VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, |
1574ef13 AO |
416 | ..._TYPE, IDENTIFIER_NODE. |
417 | In a STMT_EXPR, it means we want the result of the enclosed | |
418 | expression. | |
6de9cd9a | 419 | CALL_EXPR_TAILCALL in CALL_EXPR |
c782c2fe | 420 | CASE_LOW_SEEN in CASE_LABEL_EXPR |
a5f99f01 RK |
421 | |
422 | static_flag: | |
423 | ||
424 | TREE_STATIC in | |
e5e809f4 | 425 | VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR |
604a3205 | 426 | BINFO_VIRTUAL_P in |
809e3e7f | 427 | TREE_BINFO |
a5f99f01 | 428 | TREE_CONSTANT_OVERFLOW in |
69ef87e2 | 429 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
a5f99f01 RK |
430 | TREE_SYMBOL_REFERENCED in |
431 | IDENTIFIER_NODE | |
659e5a7a | 432 | CLEANUP_EH_ONLY in |
5a508662 | 433 | TARGET_EXPR, WITH_CLEANUP_EXPR |
6de9cd9a DN |
434 | ASM_INPUT_P in |
435 | ASM_EXPR | |
436 | EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR | |
22421b79 RK |
437 | TYPE_REF_CAN_ALIAS_ALL in |
438 | POINTER_TYPE, REFERENCE_TYPE | |
c782c2fe | 439 | CASE_HIGH_SEEN in CASE_LABEL_EXPR |
a5f99f01 RK |
440 | |
441 | public_flag: | |
442 | ||
443 | TREE_OVERFLOW in | |
69ef87e2 | 444 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
a5f99f01 | 445 | TREE_PUBLIC in |
4c521bad | 446 | VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE |
6de9cd9a DN |
447 | ASM_VOLATILE_P in |
448 | ASM_EXPR | |
89b0433e NS |
449 | TYPE_CACHED_VALUES_P in |
450 | ..._TYPE | |
7f5e6307 RH |
451 | SAVE_EXPR_RESOLVED_P in |
452 | SAVE_EXPR | |
953ff289 DN |
453 | OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in |
454 | OMP_CLAUSE_LASTPRIVATE | |
455 | OMP_CLAUSE_PRIVATE_DEBUG in | |
456 | OMP_CLAUSE_PRIVATE | |
a5f99f01 RK |
457 | |
458 | private_flag: | |
459 | ||
a5f99f01 | 460 | TREE_PRIVATE in |
659e5a7a | 461 | ..._DECL |
fa47911c | 462 | CALL_EXPR_RETURN_SLOT_OPT in |
4977bab6 | 463 | CALL_EXPR |
d8472c75 JM |
464 | DECL_BY_REFERENCE in |
465 | PARM_DECL, RESULT_DECL | |
777f7f9a RH |
466 | OMP_RETURN_NOWAIT in |
467 | OMP_RETURN | |
468 | OMP_SECTION_LAST in | |
469 | OMP_SECTION | |
761041be JJ |
470 | OMP_PARALLEL_COMBINED in |
471 | OMP_PARALLEL | |
a5f99f01 RK |
472 | |
473 | protected_flag: | |
474 | ||
a5f99f01 RK |
475 | TREE_PROTECTED in |
476 | BLOCK | |
659e5a7a | 477 | ..._DECL |
dd292d0a | 478 | CALL_FROM_THUNK_P in |
caf93cb0 | 479 | CALL_EXPR |
a5f99f01 RK |
480 | |
481 | side_effects_flag: | |
482 | ||
483 | TREE_SIDE_EFFECTS in | |
484 | all expressions | |
4f976745 RK |
485 | all decls |
486 | all constants | |
a5f99f01 | 487 | |
6de9cd9a DN |
488 | FORCED_LABEL in |
489 | LABEL_DECL | |
490 | ||
a5f99f01 RK |
491 | volatile_flag: |
492 | ||
493 | TREE_THIS_VOLATILE in | |
494 | all expressions | |
495 | TYPE_VOLATILE in | |
496 | ..._TYPE | |
497 | ||
498 | readonly_flag: | |
499 | ||
500 | TREE_READONLY in | |
e5e809f4 | 501 | all expressions |
a5f99f01 RK |
502 | TYPE_READONLY in |
503 | ..._TYPE | |
504 | ||
505 | constant_flag: | |
506 | ||
507 | TREE_CONSTANT in | |
508 | all expressions | |
4f976745 RK |
509 | all decls |
510 | all constants | |
ad50bc8d RH |
511 | TYPE_SIZES_GIMPLIFIED |
512 | ..._TYPE | |
a5f99f01 | 513 | |
a5f99f01 RK |
514 | unsigned_flag: |
515 | ||
8df83eae RK |
516 | TYPE_UNSIGNED in |
517 | all types | |
a150de29 RK |
518 | DECL_UNSIGNED in |
519 | all decls | |
520 | BIT_FIELD_REF_UNSIGNED in | |
521 | BIT_FIELD_REF | |
a5f99f01 RK |
522 | |
523 | asm_written_flag: | |
524 | ||
525 | TREE_ASM_WRITTEN in | |
526 | VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE | |
6de9cd9a | 527 | BLOCK, SSA_NAME |
a5f99f01 RK |
528 | |
529 | used_flag: | |
530 | ||
531 | TREE_USED in | |
532 | expressions, IDENTIFIER_NODE | |
533 | ||
12a22e76 | 534 | nothrow_flag: |
a5f99f01 | 535 | |
12a22e76 JM |
536 | TREE_NOTHROW in |
537 | CALL_EXPR, FUNCTION_DECL | |
a5f99f01 | 538 | |
1e2d4dc1 RK |
539 | TYPE_ALIGN_OK in |
540 | ..._TYPE | |
541 | ||
5cb2183e | 542 | TREE_THIS_NOTRAP in |
7ccf35ed | 543 | (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF |
5cb2183e | 544 | |
e23bd218 IR |
545 | deprecated_flag: |
546 | ||
547 | TREE_DEPRECATED in | |
548 | ..._DECL | |
dd292d0a | 549 | |
a0203ca7 AO |
550 | IDENTIFIER_TRANSPARENT_ALIAS in |
551 | IDENTIFIER_NODE | |
552 | ||
6de9cd9a DN |
553 | visited: |
554 | ||
555 | Used in tree traversals to mark visited nodes. | |
556 | ||
557 | invariant_flag: | |
558 | ||
559 | TREE_INVARIANT in | |
560 | all expressions. | |
561 | ||
562 | nowarning_flag: | |
563 | ||
564 | TREE_NO_WARNING in | |
73022c2a | 565 | ... any expr or decl node |
e23bd218 | 566 | */ |
820cc88f DB |
567 | #undef DEFTREESTRUCT |
568 | #define DEFTREESTRUCT(ENUM, NAME) ENUM, | |
569 | enum tree_node_structure_enum { | |
570 | #include "treestruct.def" | |
571 | LAST_TS_ENUM | |
572 | }; | |
573 | #undef DEFTREESTRUCT | |
a6d7adfd | 574 | |
8da1b058 RS |
575 | /* Define accessors for the fields that all tree nodes have |
576 | (though some fields are not used for all kinds of nodes). */ | |
577 | ||
578 | /* The tree-code says what kind of node it is. | |
579 | Codes are defined in tree.def. */ | |
07beea0d AH |
580 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) |
581 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) | |
8da1b058 | 582 | |
12b195d9 | 583 | /* When checking is enabled, errors will be generated if a tree node |
0e61db61 | 584 | is accessed incorrectly. The macros die with a fatal error. */ |
f4524c9e | 585 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
12b195d9 | 586 | |
7f42b6d7 RK |
587 | #define TREE_CHECK(T, CODE) __extension__ \ |
588 | ({ const tree __t = (T); \ | |
589 | if (TREE_CODE (__t) != (CODE)) \ | |
086e3095 NS |
590 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
591 | (CODE), 0); \ | |
592 | __t; }) | |
593 | ||
594 | #define TREE_NOT_CHECK(T, CODE) __extension__ \ | |
595 | ({ const tree __t = (T); \ | |
596 | if (TREE_CODE (__t) == (CODE)) \ | |
597 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
598 | (CODE), 0); \ | |
8f985ec4 | 599 | __t; }) |
7f42b6d7 | 600 | |
eb34af89 RK |
601 | #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ |
602 | ({ const tree __t = (T); \ | |
603 | if (TREE_CODE (__t) != (CODE1) \ | |
604 | && TREE_CODE (__t) != (CODE2)) \ | |
086e3095 NS |
605 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
606 | (CODE1), (CODE2), 0); \ | |
607 | __t; }) | |
608 | ||
609 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \ | |
610 | ({ const tree __t = (T); \ | |
611 | if (TREE_CODE (__t) == (CODE1) \ | |
612 | || TREE_CODE (__t) == (CODE2)) \ | |
613 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
614 | (CODE1), (CODE2), 0); \ | |
eb34af89 RK |
615 | __t; }) |
616 | ||
617 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
618 | ({ const tree __t = (T); \ | |
619 | if (TREE_CODE (__t) != (CODE1) \ | |
620 | && TREE_CODE (__t) != (CODE2) \ | |
621 | && TREE_CODE (__t) != (CODE3)) \ | |
086e3095 NS |
622 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
623 | (CODE1), (CODE2), (CODE3), 0); \ | |
624 | __t; }) | |
625 | ||
626 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ | |
627 | ({ const tree __t = (T); \ | |
628 | if (TREE_CODE (__t) == (CODE1) \ | |
629 | || TREE_CODE (__t) == (CODE2) \ | |
630 | || TREE_CODE (__t) == (CODE3)) \ | |
631 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
632 | (CODE1), (CODE2), (CODE3), 0); \ | |
eb34af89 RK |
633 | __t; }) |
634 | ||
22421b79 RK |
635 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ |
636 | ({ const tree __t = (T); \ | |
637 | if (TREE_CODE (__t) != (CODE1) \ | |
638 | && TREE_CODE (__t) != (CODE2) \ | |
639 | && TREE_CODE (__t) != (CODE3) \ | |
640 | && TREE_CODE (__t) != (CODE4)) \ | |
086e3095 NS |
641 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
642 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
643 | __t; }) | |
644 | ||
645 | #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ | |
646 | ({ const tree __t = (T); \ | |
647 | if (TREE_CODE (__t) == (CODE1) \ | |
648 | || TREE_CODE (__t) == (CODE2) \ | |
649 | || TREE_CODE (__t) == (CODE3) \ | |
650 | || TREE_CODE (__t) == (CODE4)) \ | |
651 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
652 | (CODE1), (CODE2), (CODE3), (CODE4), 0); \ | |
22421b79 RK |
653 | __t; }) |
654 | ||
eb34af89 RK |
655 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ |
656 | ({ const tree __t = (T); \ | |
657 | if (TREE_CODE (__t) != (CODE1) \ | |
658 | && TREE_CODE (__t) != (CODE2) \ | |
659 | && TREE_CODE (__t) != (CODE3) \ | |
660 | && TREE_CODE (__t) != (CODE4) \ | |
661 | && TREE_CODE (__t) != (CODE5)) \ | |
086e3095 NS |
662 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
663 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
664 | __t; }) | |
665 | ||
666 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ | |
667 | ({ const tree __t = (T); \ | |
668 | if (TREE_CODE (__t) == (CODE1) \ | |
669 | || TREE_CODE (__t) == (CODE2) \ | |
670 | || TREE_CODE (__t) == (CODE3) \ | |
671 | || TREE_CODE (__t) == (CODE4) \ | |
672 | || TREE_CODE (__t) == (CODE5)) \ | |
673 | tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
674 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ | |
eb34af89 RK |
675 | __t; }) |
676 | ||
820cc88f DB |
677 | #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \ |
678 | ({ const tree __t = (T); \ | |
679 | if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \ | |
680 | tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \ | |
681 | __FUNCTION__); \ | |
682 | __t; }) | |
683 | ||
7f42b6d7 RK |
684 | #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ |
685 | ({ const tree __t = (T); \ | |
686 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ | |
687 | tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ | |
b9daac31 | 688 | __FUNCTION__); \ |
8f985ec4 ZW |
689 | __t; }) |
690 | ||
953ff289 DN |
691 | #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ |
692 | ({ const tree __t = (T); \ | |
aaf46ef9 | 693 | if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \ |
953ff289 DN |
694 | tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
695 | (CODE1), (CODE2)); \ | |
696 | __t; }) | |
697 | ||
aaf46ef9 DN |
698 | #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \ |
699 | ({ const tree __t = (T); \ | |
700 | if (TREE_CODE (__t) != OMP_CLAUSE) \ | |
701 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
702 | OMP_CLAUSE, 0); \ | |
703 | if (__t->omp_clause.code != (CODE)) \ | |
704 | omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
705 | (CODE)); \ | |
706 | __t; }) | |
707 | ||
708 | #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ | |
709 | ({ const tree __t = (T); \ | |
710 | if (TREE_CODE (__t) != OMP_CLAUSE) \ | |
711 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
712 | OMP_CLAUSE, 0); \ | |
713 | if ((int) __t->omp_clause.code < (int) (CODE1) \ | |
714 | || (int) __t->omp_clause.code > (int) (CODE2)) \ | |
715 | omp_clause_range_check_failed (__t, __FILE__, __LINE__, \ | |
716 | __FUNCTION__, (CODE1), (CODE2)); \ | |
717 | __t; }) | |
718 | ||
8f985ec4 | 719 | /* These checks have to be special cased. */ |
7f42b6d7 RK |
720 | #define EXPR_CHECK(T) __extension__ \ |
721 | ({ const tree __t = (T); \ | |
722 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
68ad9159 | 723 | if (!IS_EXPR_CODE_CLASS (__c)) \ |
6615c446 | 724 | tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \ |
4f976745 RK |
725 | __FUNCTION__); \ |
726 | __t; }) | |
727 | ||
07beea0d AH |
728 | #define GIMPLE_STMT_CHECK(T) __extension__ \ |
729 | ({ const tree __t = (T); \ | |
730 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ | |
731 | if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \ | |
732 | tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\ | |
733 | __FUNCTION__); \ | |
734 | __t; }) | |
735 | ||
4f976745 RK |
736 | /* These checks have to be special cased. */ |
737 | #define NON_TYPE_CHECK(T) __extension__ \ | |
738 | ({ const tree __t = (T); \ | |
3f724eb8 | 739 | if (TYPE_P (__t)) \ |
dd5827cb ILT |
740 | tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \ |
741 | __FUNCTION__); \ | |
8f985ec4 ZW |
742 | __t; }) |
743 | ||
7f42b6d7 RK |
744 | #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ |
745 | (*({const tree __t = (T); \ | |
746 | const int __i = (I); \ | |
fa7b533b | 747 | if (TREE_CODE (__t) != TREE_VEC) \ |
086e3095 NS |
748 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
749 | TREE_VEC, 0); \ | |
fa7b533b ZW |
750 | if (__i < 0 || __i >= __t->vec.length) \ |
751 | tree_vec_elt_check_failed (__i, __t->vec.length, \ | |
752 | __FILE__, __LINE__, __FUNCTION__); \ | |
753 | &__t->vec.a[__i]; })) | |
754 | ||
6de9cd9a DN |
755 | #define PHI_NODE_ELT_CHECK(t, i) __extension__ \ |
756 | (*({const tree __t = t; \ | |
757 | const int __i = (i); \ | |
758 | if (TREE_CODE (__t) != PHI_NODE) \ | |
086e3095 NS |
759 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ |
760 | PHI_NODE, 0); \ | |
6de9cd9a DN |
761 | if (__i < 0 || __i >= __t->phi.capacity) \ |
762 | phi_node_elt_check_failed (__i, __t->phi.num_args, \ | |
763 | __FILE__, __LINE__, __FUNCTION__); \ | |
764 | &__t->phi.a[__i]; })) | |
765 | ||
aaf46ef9 DN |
766 | #define OMP_CLAUSE_ELT_CHECK(t, i) __extension__ \ |
767 | (*({const tree __t = t; \ | |
768 | const int __i = (i); \ | |
769 | if (TREE_CODE (__t) != OMP_CLAUSE) \ | |
770 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ | |
771 | OMP_CLAUSE, 0); \ | |
772 | if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \ | |
773 | omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \ | |
774 | __FUNCTION__); \ | |
775 | &__t->omp_clause.ops[__i]; })) | |
776 | ||
06790e5f | 777 | /* Special checks for TREE_OPERANDs. */ |
7f42b6d7 | 778 | #define TREE_OPERAND_CHECK(T, I) __extension__ \ |
55448d12 | 779 | (*({const tree __t = EXPR_CHECK (T); \ |
7f42b6d7 | 780 | const int __i = (I); \ |
07beea0d AH |
781 | if (GIMPLE_TUPLE_P (__t)) \ |
782 | gcc_unreachable (); \ | |
06790e5f ZW |
783 | if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ |
784 | tree_operand_check_failed (__i, TREE_CODE (__t), \ | |
785 | __FILE__, __LINE__, __FUNCTION__); \ | |
786 | &__t->exp.operands[__i]; })) | |
787 | ||
7f42b6d7 RK |
788 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ |
789 | (*({const tree __t = (T); \ | |
790 | const int __i = (I); \ | |
791 | if (TREE_CODE (__t) != CODE) \ | |
086e3095 | 792 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\ |
7f42b6d7 RK |
793 | if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \ |
794 | tree_operand_check_failed (__i, (CODE), \ | |
06790e5f ZW |
795 | __FILE__, __LINE__, __FUNCTION__); \ |
796 | &__t->exp.operands[__i]; })) | |
797 | ||
07beea0d AH |
798 | /* Special checks for GIMPLE_STMT_OPERANDs. */ |
799 | #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \ | |
800 | (*({const tree __t = GIMPLE_STMT_CHECK (T); \ | |
801 | const int __i = (I); \ | |
802 | if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ | |
803 | tree_operand_check_failed (__i, TREE_CODE (__t), \ | |
804 | __FILE__, __LINE__, __FUNCTION__); \ | |
805 | &__t->gstmt.operands[__i]; })) | |
806 | ||
7f42b6d7 | 807 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \ |
06790e5f | 808 | (*(rtx *) \ |
7f42b6d7 RK |
809 | ({const tree __t = (T); \ |
810 | const int __i = (I); \ | |
811 | if (TREE_CODE (__t) != (CODE)) \ | |
086e3095 | 812 | tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \ |
7f42b6d7 RK |
813 | if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \ |
814 | tree_operand_check_failed (__i, (CODE), \ | |
06790e5f ZW |
815 | __FILE__, __LINE__, __FUNCTION__); \ |
816 | &__t->exp.operands[__i]; })) | |
817 | ||
07beea0d AH |
818 | /* Nodes are chained together for many purposes. |
819 | Types are chained together to record them for being output to the debugger | |
820 | (see the function `chain_type'). | |
821 | Decls in the same scope are chained together to record the contents | |
822 | of the scope. | |
823 | Statement nodes for successive statements used to be chained together. | |
824 | Often lists of things are represented by TREE_LIST nodes that | |
825 | are chained together. */ | |
826 | ||
827 | #define TREE_CHAIN(NODE) __extension__ \ | |
828 | (*({const tree __t = (NODE); \ | |
829 | if (GIMPLE_TUPLE_P (__t)) \ | |
830 | gcc_unreachable (); \ | |
831 | &__t->common.chain; })) | |
832 | ||
833 | /* In all nodes that are expressions, this is the data type of the expression. | |
834 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
835 | In ARRAY_TYPE nodes, this is the type of the elements. | |
836 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
837 | #define TREE_TYPE(NODE) __extension__ \ | |
838 | (*({const tree __t = (NODE); \ | |
839 | if (GIMPLE_TUPLE_P (__t)) \ | |
840 | gcc_unreachable (); \ | |
841 | &__t->common.type; })) | |
842 | ||
820cc88f | 843 | extern void tree_contains_struct_check_failed (const tree, |
0ac11108 | 844 | const enum tree_node_structure_enum, |
820cc88f DB |
845 | const char *, int, const char *) |
846 | ATTRIBUTE_NORETURN; | |
847 | ||
086e3095 NS |
848 | extern void tree_check_failed (const tree, const char *, int, const char *, |
849 | ...) ATTRIBUTE_NORETURN; | |
850 | extern void tree_not_check_failed (const tree, const char *, int, const char *, | |
851 | ...) ATTRIBUTE_NORETURN; | |
6615c446 | 852 | extern void tree_class_check_failed (const tree, const enum tree_code_class, |
46c5ad27 | 853 | const char *, int, const char *) |
8f985ec4 | 854 | ATTRIBUTE_NORETURN; |
953ff289 DN |
855 | extern void tree_range_check_failed (const tree, const char *, int, |
856 | const char *, enum tree_code, | |
857 | enum tree_code); | |
dd5827cb ILT |
858 | extern void tree_not_class_check_failed (const tree, |
859 | const enum tree_code_class, | |
860 | const char *, int, const char *) | |
861 | ATTRIBUTE_NORETURN; | |
46c5ad27 AJ |
862 | extern void tree_vec_elt_check_failed (int, int, const char *, |
863 | int, const char *) | |
fa7b533b | 864 | ATTRIBUTE_NORETURN; |
6de9cd9a DN |
865 | extern void phi_node_elt_check_failed (int, int, const char *, |
866 | int, const char *) | |
867 | ATTRIBUTE_NORETURN; | |
46c5ad27 AJ |
868 | extern void tree_operand_check_failed (int, enum tree_code, |
869 | const char *, int, const char *) | |
06790e5f | 870 | ATTRIBUTE_NORETURN; |
aaf46ef9 DN |
871 | extern void omp_clause_check_failed (const tree, const char *, int, |
872 | const char *, enum omp_clause_code) | |
873 | ATTRIBUTE_NORETURN; | |
874 | extern void omp_clause_operand_check_failed (int, tree, const char *, | |
875 | int, const char *) | |
876 | ATTRIBUTE_NORETURN; | |
877 | extern void omp_clause_range_check_failed (const tree, const char *, int, | |
878 | const char *, enum omp_clause_code, | |
879 | enum omp_clause_code) | |
880 | ATTRIBUTE_NORETURN; | |
46c5ad27 | 881 | |
f4524c9e | 882 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
12b195d9 | 883 | |
820cc88f | 884 | #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) |
eb34af89 | 885 | #define TREE_CHECK(T, CODE) (T) |
086e3095 | 886 | #define TREE_NOT_CHECK(T, CODE) (T) |
eb34af89 | 887 | #define TREE_CHECK2(T, CODE1, CODE2) (T) |
086e3095 | 888 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) |
eb34af89 | 889 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) |
086e3095 | 890 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) |
22421b79 | 891 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
086e3095 | 892 | #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
eb34af89 | 893 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
086e3095 | 894 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
eb34af89 | 895 | #define TREE_CLASS_CHECK(T, CODE) (T) |
953ff289 | 896 | #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) |
eb34af89 | 897 | #define EXPR_CHECK(T) (T) |
07beea0d | 898 | #define GIMPLE_STMT_CHECK(T) (T) |
4f976745 | 899 | #define NON_TYPE_CHECK(T) (T) |
eb34af89 RK |
900 | #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
901 | #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) | |
902 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) | |
07beea0d | 903 | #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I]) |
7f42b6d7 | 904 | #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I])) |
6de9cd9a | 905 | #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i]) |
aaf46ef9 DN |
906 | #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) |
907 | #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) | |
62f3e894 | 908 | #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) |
8f985ec4 | 909 | |
07beea0d AH |
910 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) |
911 | #define TREE_TYPE(NODE) ((NODE)->common.type) | |
912 | ||
8f985ec4 ZW |
913 | #endif |
914 | ||
07beea0d | 915 | #define TREE_BLOCK(NODE) *(tree_block (NODE)) |
6de9cd9a | 916 | |
8f985ec4 ZW |
917 | #include "tree-check.h" |
918 | ||
6615c446 | 919 | #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) |
820cc88f | 920 | #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) |
326eda4b | 921 | #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG) |
820cc88f DB |
922 | #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) |
923 | #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) | |
924 | #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) | |
925 | #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) | |
6615c446 JO |
926 | #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) |
927 | #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) | |
eb34af89 | 928 | #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
22421b79 | 929 | #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
eb34af89 | 930 | |
95b4aca6 | 931 | #define RECORD_OR_UNION_CHECK(T) \ |
eb34af89 | 932 | TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
95b4aca6 NS |
933 | #define NOT_RECORD_OR_UNION_CHECK(T) \ |
934 | TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) | |
caf93cb0 | 935 | |
eb34af89 | 936 | #define NUMERICAL_TYPE_CHECK(T) \ |
71d59383 | 937 | TREE_CHECK4 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE) |
12b195d9 | 938 | |
07beea0d AH |
939 | /* Nonzero if NODE is a GIMPLE statement. */ |
940 | #define GIMPLE_STMT_P(NODE) \ | |
941 | (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt) | |
942 | ||
943 | /* Nonzero if NODE is a GIMPLE tuple. */ | |
944 | #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE)) | |
945 | ||
946 | /* A GIMPLE tuple that has a ``locus'' field. */ | |
947 | #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE)) | |
948 | ||
949 | /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well. | |
950 | ||
951 | If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the | |
952 | NODE code is unknown at compile time, use this macro. */ | |
953 | #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I))) | |
954 | ||
955 | /* Like TREE_TYPE but returns void_type_node for gimple tuples that have | |
956 | no type. */ | |
957 | ||
958 | #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE))) | |
8da1b058 | 959 | |
1c0cc57e KG |
960 | /* Here is how primitive or already-canonicalized types' hash codes |
961 | are made. */ | |
fd917e0d JM |
962 | #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
963 | ||
964 | /* A simple hash function for an arbitrary tree node. This must not be | |
965 | used in hash tables which are saved to a PCH. */ | |
966 | #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) | |
1c0cc57e | 967 | |
8da1b058 RS |
968 | /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs |
969 | that don't change the machine mode. */ | |
970 | ||
9a6bb3f7 | 971 | #define STRIP_NOPS(EXP) \ |
8da1b058 RS |
972 | while ((TREE_CODE (EXP) == NOP_EXPR \ |
973 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
974 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 975 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
8da1b058 | 976 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
07beea0d | 977 | == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ |
713cc17b | 978 | (EXP) = TREE_OPERAND (EXP, 0) |
0fafb45e | 979 | |
14a774a9 RK |
980 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
981 | ||
982 | #define STRIP_SIGN_NOPS(EXP) \ | |
983 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
984 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
985 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 986 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
14a774a9 RK |
987 | && (TYPE_MODE (TREE_TYPE (EXP)) \ |
988 | == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
8df83eae RK |
989 | && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \ |
990 | == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ | |
713cc17b | 991 | (EXP) = TREE_OPERAND (EXP, 0) |
14a774a9 | 992 | |
0fafb45e RS |
993 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
994 | ||
995 | #define STRIP_TYPE_NOPS(EXP) \ | |
996 | while ((TREE_CODE (EXP) == NOP_EXPR \ | |
997 | || TREE_CODE (EXP) == CONVERT_EXPR \ | |
998 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ | |
9a6bb3f7 | 999 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
0fafb45e RS |
1000 | && (TREE_TYPE (EXP) \ |
1001 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
713cc17b | 1002 | (EXP) = TREE_OPERAND (EXP, 0) |
87291138 | 1003 | |
6de9cd9a DN |
1004 | /* Remove unnecessary type conversions according to |
1005 | tree_ssa_useless_type_conversion. */ | |
1006 | ||
1007 | #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ | |
1008 | while (tree_ssa_useless_type_conversion (EXP)) \ | |
1009 | EXP = TREE_OPERAND (EXP, 0) | |
1010 | ||
87291138 | 1011 | /* Nonzero if TYPE represents an integral type. Note that we do not |
38b3627d | 1012 | include COMPLEX types here. Keep these checks in ascending code |
6c6cfbfd | 1013 | order. */ |
87291138 RK |
1014 | |
1015 | #define INTEGRAL_TYPE_P(TYPE) \ | |
38b3627d NS |
1016 | (TREE_CODE (TYPE) == ENUMERAL_TYPE \ |
1017 | || TREE_CODE (TYPE) == BOOLEAN_TYPE \ | |
38b3627d | 1018 | || TREE_CODE (TYPE) == INTEGER_TYPE) |
87291138 | 1019 | |
00229de4 RS |
1020 | /* Nonzero if TYPE represents a scalar floating-point type. */ |
1021 | ||
1022 | #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) | |
1023 | ||
1024 | /* Nonzero if TYPE represents a complex floating-point type. */ | |
1025 | ||
1026 | #define COMPLEX_FLOAT_TYPE_P(TYPE) \ | |
1027 | (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
1028 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
1029 | ||
d97c6333 JW |
1030 | /* Nonzero if TYPE represents a vector floating-point type. */ |
1031 | ||
1032 | #define VECTOR_FLOAT_TYPE_P(TYPE) \ | |
1033 | (TREE_CODE (TYPE) == VECTOR_TYPE \ | |
1034 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
1035 | ||
87291138 | 1036 | /* Nonzero if TYPE represents a floating-point type, including complex |
38b3627d NS |
1037 | and vector floating-point types. The vector and complex check does |
1038 | not use the previous two macros to enable early folding. */ | |
87291138 | 1039 | |
38b3627d NS |
1040 | #define FLOAT_TYPE_P(TYPE) \ |
1041 | (SCALAR_FLOAT_TYPE_P (TYPE) \ | |
1042 | || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
1043 | || TREE_CODE (TYPE) == VECTOR_TYPE) \ | |
1044 | && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) | |
947765f9 | 1045 | |
5fc89bfd JJ |
1046 | /* Nonzero if TYPE represents a decimal floating-point type. */ |
1047 | #define DECIMAL_FLOAT_TYPE_P(TYPE) \ | |
1048 | (SCALAR_FLOAT_TYPE_P (TYPE) \ | |
1049 | && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) | |
1050 | ||
38b3627d NS |
1051 | /* Nonzero if TYPE represents an aggregate (multi-component) type. |
1052 | Keep these checks in ascending code order. */ | |
947765f9 PB |
1053 | |
1054 | #define AGGREGATE_TYPE_P(TYPE) \ | |
1055 | (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ | |
08f2586c | 1056 | || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE) |
9e6cfc43 | 1057 | |
66804d9e | 1058 | /* Nonzero if TYPE represents a pointer or reference type. |
38b3627d NS |
1059 | (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in |
1060 | ascending code order. */ | |
9e6cfc43 JM |
1061 | |
1062 | #define POINTER_TYPE_P(TYPE) \ | |
1063 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
555f90c5 | 1064 | |
d0f062fb NS |
1065 | /* Nonzero if this type is a complete type. */ |
1066 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
1067 | ||
71653180 | 1068 | /* Nonzero if this type is the (possibly qualified) void type. */ |
e7cd085f | 1069 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
71653180 | 1070 | |
d0f062fb NS |
1071 | /* Nonzero if this type is complete or is cv void. */ |
1072 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
c46080ab | 1073 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
d0f062fb NS |
1074 | |
1075 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
1076 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
713cc17b | 1077 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
d0f062fb | 1078 | |
8da1b058 RS |
1079 | \f |
1080 | /* Define many boolean fields that all tree nodes have. */ | |
1081 | ||
1082 | /* In VAR_DECL nodes, nonzero means address of this is needed. | |
1083 | So it cannot be in a register. | |
1084 | In a FUNCTION_DECL, nonzero means its address is needed. | |
1085 | So it must be compiled even if it is an inline function. | |
1febe16b RK |
1086 | In a FIELD_DECL node, it means that the programmer is permitted to |
1087 | construct the address of this field. This is used for aliasing | |
1088 | purposes: see record_component_aliases. | |
8da1b058 | 1089 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
41077ce4 | 1090 | In LABEL_DECL nodes, it means a goto for this label has been seen |
8da1b058 RS |
1091 | from a place outside all binding contours that restore stack levels. |
1092 | In ..._TYPE nodes, it means that objects of this type must | |
1093 | be fully addressable. This means that pieces of this | |
1094 | object cannot go into register parameters, for example. | |
1095 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
1096 | had its address taken. That matters for inline functions. */ | |
07beea0d | 1097 | #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) |
8da1b058 | 1098 | |
ead553a1 SB |
1099 | /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the |
1100 | exit of a function. Calls for which this is true are candidates for tail | |
1101 | call optimizations. */ | |
07beea0d AH |
1102 | #define CALL_EXPR_TAILCALL(NODE) \ |
1103 | (CALL_EXPR_CHECK(NODE)->base.addressable_flag) | |
6de9cd9a | 1104 | |
c782c2fe RS |
1105 | /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the |
1106 | CASE_LOW operand has been processed. */ | |
1107 | #define CASE_LOW_SEEN(NODE) \ | |
07beea0d | 1108 | (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) |
c782c2fe | 1109 | |
8da1b058 | 1110 | /* In a VAR_DECL, nonzero means allocate static storage. |
9f86614b | 1111 | In a FUNCTION_DECL, nonzero if function has been defined. |
22421b79 RK |
1112 | In a CONSTRUCTOR, nonzero means allocate static storage. |
1113 | ||
1114 | ??? This is also used in lots of other nodes in unclear ways which | |
1115 | should be cleaned up some day. */ | |
07beea0d | 1116 | #define TREE_STATIC(NODE) ((NODE)->base.static_flag) |
8da1b058 | 1117 | |
5a508662 RH |
1118 | /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup |
1119 | should only be executed if an exception is thrown, not on normal exit | |
1120 | of its scope. */ | |
07beea0d | 1121 | #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) |
659e5a7a | 1122 | |
c782c2fe RS |
1123 | /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the |
1124 | CASE_HIGH operand has been processed. */ | |
1125 | #define CASE_HIGH_SEEN(NODE) \ | |
07beea0d | 1126 | (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) |
c782c2fe | 1127 | |
6de9cd9a | 1128 | /* In an expr node (usually a conversion) this means the node was made |
73022c2a RH |
1129 | implicitly and should not lead to any sort of warning. In a decl node, |
1130 | warnings concerning the decl should be suppressed. This is used at | |
1131 | least for used-before-set warnings, and it set after one warning is | |
1132 | emitted. */ | |
07beea0d | 1133 | #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) |
8da1b058 | 1134 | |
69ef87e2 AH |
1135 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means |
1136 | there was an overflow in folding. This is distinct from | |
1137 | TREE_OVERFLOW because ANSI C requires a diagnostic when overflows | |
1138 | occur in constant expressions. */ | |
07beea0d | 1139 | #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->base.static_flag) |
261450e8 | 1140 | |
d3568529 JM |
1141 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
1142 | this string as an argument. */ | |
c46080ab | 1143 | #define TREE_SYMBOL_REFERENCED(NODE) \ |
07beea0d | 1144 | (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) |
d3568529 | 1145 | |
22421b79 RK |
1146 | /* Nonzero in a pointer or reference type means the data pointed to |
1147 | by this type can alias anything. */ | |
1148 | #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ | |
07beea0d | 1149 | (PTR_OR_REF_CHECK (NODE)->base.static_flag) |
22421b79 | 1150 | |
69ef87e2 AH |
1151 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
1152 | there was an overflow in folding, and no warning has been issued | |
22421b79 | 1153 | for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW, |
87f2a9f5 | 1154 | but not vice versa. */ |
22421b79 | 1155 | |
07beea0d | 1156 | #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) |
261450e8 | 1157 | |
b9e75696 | 1158 | /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, |
8da1b058 | 1159 | nonzero means name is to be accessible from outside this module. |
4c521bad | 1160 | In an IDENTIFIER_NODE, nonzero means an external declaration |
6dc42e49 | 1161 | accessible from outside this module was previously seen |
8da1b058 | 1162 | for this name in an inner scope. */ |
07beea0d | 1163 | #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) |
8da1b058 | 1164 | |
89b0433e NS |
1165 | /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector |
1166 | of cached values, or is something else. */ | |
07beea0d | 1167 | #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag) |
7f5e6307 RH |
1168 | |
1169 | /* In a SAVE_EXPR, indicates that the original expression has already | |
1170 | been substituted with a VAR_DECL that contains the value. */ | |
1171 | #define SAVE_EXPR_RESOLVED_P(NODE) \ | |
07beea0d | 1172 | (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag) |
89b0433e | 1173 | |
4f976745 RK |
1174 | /* In any expression, decl, or constant, nonzero means it has side effects or |
1175 | reevaluation of the whole expression could produce a different value. | |
1176 | This is set if any subexpression is a function call, a side effect or a | |
1177 | reference to a volatile variable. In a ..._DECL, this is set only if the | |
1178 | declaration said `volatile'. This will never be set for a constant. */ | |
1179 | #define TREE_SIDE_EFFECTS(NODE) \ | |
07beea0d | 1180 | (NON_TYPE_CHECK (NODE)->base.side_effects_flag) |
8da1b058 | 1181 | |
6de9cd9a DN |
1182 | /* In a LABEL_DECL, nonzero means this label had its address taken |
1183 | and therefore can never be deleted and is a jump target for | |
1184 | computed gotos. */ | |
07beea0d | 1185 | #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag) |
6de9cd9a | 1186 | |
8da1b058 RS |
1187 | /* Nonzero means this expression is volatile in the C sense: |
1188 | its address should be of type `volatile WHATEVER *'. | |
1189 | In other words, the declared item is volatile qualified. | |
1190 | This is used in _DECL nodes and _REF nodes. | |
d29f81b6 AP |
1191 | On a FUNCTION_DECL node, this means the function does not |
1192 | return normally. This is the same effect as setting | |
1193 | the attribute noreturn on the function in C. | |
8da1b058 RS |
1194 | |
1195 | In a ..._TYPE node, means this type is volatile-qualified. | |
1196 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
1197 | because eventually we may make that a different bit. | |
1198 | ||
1199 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
07beea0d | 1200 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) |
8da1b058 | 1201 | |
5cb2183e AH |
1202 | /* Nonzero means this node will not trap. In an INDIRECT_REF, means |
1203 | accessing the memory pointed to won't generate a trap. However, | |
1204 | this only applies to an object when used appropriately: it doesn't | |
7ccf35ed DN |
1205 | mean that writing a READONLY mem won't trap. Similarly for |
1206 | ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF. | |
caf93cb0 | 1207 | |
a7e5372d ZD |
1208 | In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index |
1209 | (or slice of the array) always belongs to the range of the array. | |
1210 | I.e. that the access will not trap, provided that the access to | |
1211 | the base to the array will not trap. */ | |
07beea0d | 1212 | #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag) |
5cb2183e | 1213 | |
8da1b058 | 1214 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, |
4f976745 | 1215 | nonzero means it may not be the lhs of an assignment. */ |
07beea0d | 1216 | #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) |
8da1b058 | 1217 | |
272d0bee | 1218 | /* Nonzero if NODE is a _DECL with TREE_READONLY set. */ |
6615c446 JO |
1219 | #define TREE_READONLY_DECL_P(NODE)\ |
1220 | (DECL_P (NODE) && TREE_READONLY (NODE)) | |
588d3ade | 1221 | |
4f976745 RK |
1222 | /* Value of expression is constant. Always on in all ..._CST nodes. May |
1223 | also appear in an expression or decl where the value is constant. */ | |
07beea0d | 1224 | #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) |
8da1b058 | 1225 | |
ad50bc8d | 1226 | /* Nonzero if NODE, a type, has had its sizes gimplified. */ |
07beea0d AH |
1227 | #define TYPE_SIZES_GIMPLIFIED(NODE) \ |
1228 | (TYPE_CHECK (NODE)->base.constant_flag) | |
ad50bc8d | 1229 | |
a150de29 | 1230 | /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
07beea0d AH |
1231 | #define DECL_UNSIGNED(NODE) \ |
1232 | (DECL_COMMON_CHECK (NODE)->base.unsigned_flag) | |
a150de29 RK |
1233 | |
1234 | /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */ | |
1235 | #define BIT_FIELD_REF_UNSIGNED(NODE) \ | |
07beea0d | 1236 | (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag) |
8da1b058 | 1237 | |
8df83eae | 1238 | /* In integral and pointer types, means an unsigned type. */ |
07beea0d | 1239 | #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag) |
8df83eae | 1240 | |
c46080ab | 1241 | #define TYPE_TRAP_SIGNED(NODE) \ |
8df83eae | 1242 | (flag_trapv && ! TYPE_UNSIGNED (NODE)) |
91ce572a | 1243 | |
8da1b058 RS |
1244 | /* Nonzero in a VAR_DECL means assembler code has been written. |
1245 | Nonzero in a FUNCTION_DECL means that the function has been compiled. | |
1246 | This is interesting in an inline function, since it might not need | |
1247 | to be compiled separately. | |
3635a54b | 1248 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE |
9f86614b | 1249 | if the sdb debugging info for the type has been written. |
caf93cb0 | 1250 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
6de9cd9a DN |
1251 | In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal |
1252 | PHI node. */ | |
07beea0d | 1253 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) |
8da1b058 RS |
1254 | |
1255 | /* Nonzero in a _DECL if the name is used in its scope. | |
1256 | Nonzero in an expr node means inhibit warning if value is unused. | |
1257 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
0ac11108 | 1258 | was used. |
9acf766f | 1259 | In a BLOCK, this means that the block contains variables that are used. */ |
07beea0d | 1260 | #define TREE_USED(NODE) ((NODE)->base.used_flag) |
8da1b058 | 1261 | |
12a22e76 JM |
1262 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw |
1263 | an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ | |
07beea0d | 1264 | #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) |
c3d32120 | 1265 | |
fa47911c JM |
1266 | /* In a CALL_EXPR, means that it's safe to use the target of the call |
1267 | expansion as the return slot for a call that returns in memory. */ | |
07beea0d | 1268 | #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag) |
4977bab6 | 1269 | |
d8472c75 JM |
1270 | /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible |
1271 | reference (and the TREE_TYPE is a pointer to the true type). */ | |
07beea0d AH |
1272 | #define DECL_BY_REFERENCE(NODE) \ |
1273 | (DECL_COMMON_CHECK (NODE)->base.private_flag) | |
d8472c75 | 1274 | |
dd292d0a MM |
1275 | /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
1276 | thunked-to function. */ | |
07beea0d AH |
1277 | #define CALL_FROM_THUNK_P(NODE) \ |
1278 | (CALL_EXPR_CHECK (NODE)->base.protected_flag) | |
dd292d0a | 1279 | |
c3d32120 RK |
1280 | /* In a type, nonzero means that all objects of the type are guaranteed by the |
1281 | language or front-end to be properly aligned, so we can indicate that a MEM | |
1282 | of this type is aligned at least to the alignment of the type, even if it | |
1283 | doesn't appear that it is. We see this, for example, in object-oriented | |
1284 | languages where a tag field may show this is an object of a more-aligned | |
6de9cd9a DN |
1285 | variant of the more generic type. |
1286 | ||
1287 | In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME | |
1288 | freelist. */ | |
07beea0d | 1289 | #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) |
8da1b058 | 1290 | |
9f86614b | 1291 | /* Used in classes in C++. */ |
07beea0d | 1292 | #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) |
9f86614b RS |
1293 | /* Used in classes in C++. |
1294 | In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ | |
07beea0d | 1295 | #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) |
8da1b058 | 1296 | |
a0203ca7 | 1297 | /* Nonzero in a _DECL if the use of the name is defined as a |
e23bd218 | 1298 | deprecated feature by __attribute__((deprecated)). */ |
a0203ca7 | 1299 | #define TREE_DEPRECATED(NODE) \ |
07beea0d | 1300 | ((NODE)->base.deprecated_flag) |
a0203ca7 AO |
1301 | |
1302 | /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose | |
1303 | uses are to be substituted for uses of the TREE_CHAINed identifier. */ | |
1304 | #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ | |
07beea0d | 1305 | (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) |
e23bd218 | 1306 | |
6de9cd9a DN |
1307 | /* Value of expression is function invariant. A strict subset of |
1308 | TREE_CONSTANT, such an expression is constant over any one function | |
1309 | invocation, though not across different invocations. May appear in | |
1310 | any expression node. */ | |
07beea0d | 1311 | #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag) |
6de9cd9a | 1312 | |
9f86614b | 1313 | /* These flags are available for each language front end to use internally. */ |
07beea0d AH |
1314 | #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0) |
1315 | #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1) | |
1316 | #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2) | |
1317 | #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3) | |
1318 | #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4) | |
1319 | #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5) | |
1320 | #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6) | |
8da1b058 RS |
1321 | \f |
1322 | /* Define additional fields and accessors for nodes representing constants. */ | |
1323 | ||
e5d70561 RK |
1324 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
1325 | If the data type is signed, the value is sign-extended to 2 words | |
8da1b058 | 1326 | even though not all of them may really be in use. |
e5d70561 | 1327 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2afaa41c GM |
1328 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
1329 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
1330 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
8da1b058 | 1331 | |
b9daac31 GS |
1332 | #define INT_CST_LT(A, B) \ |
1333 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
1334 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
c46080ab | 1335 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
8da1b058 | 1336 | |
b9daac31 GS |
1337 | #define INT_CST_LT_UNSIGNED(A, B) \ |
1338 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
1339 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
1340 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
41077ce4 | 1341 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
c46080ab | 1342 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
46c5ad27 | 1343 | |
e2500fed | 1344 | struct tree_int_cst GTY(()) |
8da1b058 | 1345 | { |
2bf105ab | 1346 | struct tree_common common; |
f82783bd | 1347 | double_int int_cst; |
8da1b058 RS |
1348 | }; |
1349 | ||
0ee6fdb5 | 1350 | /* In a REAL_CST node. struct real_value is an opaque entity, with |
11ad4784 ZW |
1351 | manipulators defined in real.h. We don't want tree.h depending on |
1352 | real.h and transitively on tm.h. */ | |
0ee6fdb5 | 1353 | struct real_value; |
c46080ab | 1354 | |
11ad4784 ZW |
1355 | #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
1356 | #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) | |
8da1b058 | 1357 | |
e2500fed | 1358 | struct tree_real_cst GTY(()) |
8da1b058 | 1359 | { |
2bf105ab | 1360 | struct tree_common common; |
0ee6fdb5 | 1361 | struct real_value * real_cst_ptr; |
8da1b058 RS |
1362 | }; |
1363 | ||
1364 | /* In a STRING_CST */ | |
12b195d9 | 1365 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
7238c5ec RM |
1366 | #define TREE_STRING_POINTER(NODE) \ |
1367 | ((const char *)(STRING_CST_CHECK (NODE)->string.str)) | |
8da1b058 | 1368 | |
e2500fed | 1369 | struct tree_string GTY(()) |
8da1b058 | 1370 | { |
2bf105ab | 1371 | struct tree_common common; |
8da1b058 | 1372 | int length; |
7238c5ec | 1373 | char str[1]; |
8da1b058 RS |
1374 | }; |
1375 | ||
1376 | /* In a COMPLEX_CST node. */ | |
12b195d9 ML |
1377 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
1378 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
8da1b058 | 1379 | |
e2500fed | 1380 | struct tree_complex GTY(()) |
8da1b058 | 1381 | { |
2bf105ab | 1382 | struct tree_common common; |
2f78c311 ZW |
1383 | tree real; |
1384 | tree imag; | |
8da1b058 | 1385 | }; |
69ef87e2 AH |
1386 | |
1387 | /* In a VECTOR_CST node. */ | |
1388 | #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) | |
1389 | ||
e2500fed | 1390 | struct tree_vector GTY(()) |
69ef87e2 AH |
1391 | { |
1392 | struct tree_common common; | |
69ef87e2 AH |
1393 | tree elements; |
1394 | }; | |
8da1b058 | 1395 | \f |
4f4e53dd | 1396 | #include "symtab.h" |
2a967f3d | 1397 | |
8da1b058 RS |
1398 | /* Define fields and accessors for some special-purpose tree nodes. */ |
1399 | ||
2a967f3d | 1400 | #define IDENTIFIER_LENGTH(NODE) \ |
c46080ab | 1401 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
2a967f3d | 1402 | #define IDENTIFIER_POINTER(NODE) \ |
b9daac31 | 1403 | ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
5e0c54e5 GDR |
1404 | #define IDENTIFIER_HASH_VALUE(NODE) \ |
1405 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) | |
2a967f3d NB |
1406 | |
1407 | /* Translate a hash table identifier pointer to a tree_identifier | |
1408 | pointer, and vice versa. */ | |
1409 | ||
1410 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
c46080ab RK |
1411 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
1412 | #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) | |
8da1b058 | 1413 | |
e2500fed | 1414 | struct tree_identifier GTY(()) |
8da1b058 | 1415 | { |
2bf105ab | 1416 | struct tree_common common; |
2a967f3d | 1417 | struct ht_identifier id; |
8da1b058 RS |
1418 | }; |
1419 | ||
1420 | /* In a TREE_LIST node. */ | |
12b195d9 ML |
1421 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
1422 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
8da1b058 | 1423 | |
e2500fed | 1424 | struct tree_list GTY(()) |
8da1b058 | 1425 | { |
2bf105ab | 1426 | struct tree_common common; |
2f78c311 ZW |
1427 | tree purpose; |
1428 | tree value; | |
8da1b058 RS |
1429 | }; |
1430 | ||
1431 | /* In a TREE_VEC node. */ | |
12b195d9 | 1432 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) |
c46080ab RK |
1433 | #define TREE_VEC_END(NODE) \ |
1434 | ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) | |
8da1b058 | 1435 | |
fa7b533b ZW |
1436 | #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
1437 | ||
e2500fed | 1438 | struct tree_vec GTY(()) |
8da1b058 | 1439 | { |
2bf105ab | 1440 | struct tree_common common; |
8da1b058 | 1441 | int length; |
e2500fed | 1442 | tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; |
8da1b058 RS |
1443 | }; |
1444 | ||
4038c495 GB |
1445 | /* In a CONSTRUCTOR node. */ |
1446 | #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) | |
1447 | ||
1448 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the | |
1449 | value of each element (stored within VAL). IX must be a scratch variable | |
1450 | of unsigned integer type. */ | |
1451 | #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ | |
1452 | for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ | |
1453 | ? false \ | |
1454 | : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ | |
1455 | true); \ | |
1456 | (IX)++) | |
1457 | ||
1458 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both | |
1459 | the value of each element (stored within VAL) and its index (stored | |
1460 | within INDEX). IX must be a scratch variable of unsigned integer type. */ | |
1461 | #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ | |
1462 | for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ | |
1463 | ? false \ | |
1464 | : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ | |
1465 | (INDEX = VEC_index (constructor_elt, V, IX)->index), \ | |
1466 | true); \ | |
1467 | (IX)++) | |
1468 | ||
1469 | /* Append a new constructor element to V, with the specified INDEX and VAL. */ | |
1470 | #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ | |
1471 | do { \ | |
1472 | constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \ | |
1473 | _ce___->index = INDEX; \ | |
1474 | _ce___->value = VALUE; \ | |
1475 | } while (0) | |
1476 | ||
1477 | /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the | |
1478 | element. INDEX can optionally design the position of VALUE: in arrays, | |
1479 | it is the index where VALUE has to be placed; in structures, it is the | |
1480 | FIELD_DECL of the member. */ | |
1481 | typedef struct constructor_elt_d GTY(()) | |
1482 | { | |
1483 | tree index; | |
1484 | tree value; | |
1485 | } constructor_elt; | |
1486 | ||
1487 | DEF_VEC_O(constructor_elt); | |
1488 | DEF_VEC_ALLOC_O(constructor_elt,gc); | |
1489 | ||
1490 | struct tree_constructor GTY(()) | |
1491 | { | |
1492 | struct tree_common common; | |
1493 | VEC(constructor_elt,gc) *elts; | |
1494 | }; | |
1495 | ||
8da1b058 RS |
1496 | /* Define fields and accessors for some nodes that represent expressions. */ |
1497 | ||
1ea7e6ad | 1498 | /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
6de9cd9a DN |
1499 | #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
1500 | && VOID_TYPE_P (TREE_TYPE (NODE)) \ | |
1501 | && integer_zerop (TREE_OPERAND (NODE, 0))) | |
1502 | ||
61131fa2 | 1503 | /* In ordinary expression nodes. */ |
06790e5f | 1504 | #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
12b195d9 | 1505 | #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) |
61131fa2 | 1506 | |
07beea0d AH |
1507 | /* In gimple statements. */ |
1508 | #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I) | |
1509 | #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus) | |
1510 | #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block) | |
1511 | ||
40edd0bd | 1512 | /* In a LOOP_EXPR node. */ |
06790e5f | 1513 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
40edd0bd | 1514 | |
c1667470 PB |
1515 | /* The source location of this expression. Non-tree_exp nodes such as |
1516 | decls and constants can be shared among multiple locations, so | |
1517 | return nothing. */ | |
07beea0d AH |
1518 | #define EXPR_LOCATION(NODE) expr_location ((NODE)) |
1519 | #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM)) | |
1520 | #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE)) | |
1521 | #define EXPR_LOCUS(NODE) expr_locus ((NODE)) | |
1522 | #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM)) | |
1523 | #define EXPR_FILENAME(NODE) *(expr_filename ((NODE))) | |
1524 | #define EXPR_LINENO(NODE) *(expr_lineno ((NODE))) | |
1525 | ||
1526 | /* True if a tree is an expression or statement that can have a | |
1527 | location. */ | |
1528 | #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE)) | |
bf1e5319 | 1529 | |
6f30f1f1 | 1530 | /* In a TARGET_EXPR node. */ |
06790e5f ZW |
1531 | #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
1532 | #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) | |
1533 | #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) | |
6f30f1f1 | 1534 | |
350fae66 RK |
1535 | /* DECL_EXPR accessor. This gives access to the DECL associated with |
1536 | the given declaration statement. */ | |
1537 | #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) | |
1538 | ||
6de9cd9a DN |
1539 | #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
1540 | ||
1541 | /* SWITCH_EXPR accessors. These give access to the condition, body and | |
1542 | original condition type (before any compiler conversions) | |
1543 | of the switch statement, respectively. */ | |
ebaae582 SB |
1544 | #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) |
1545 | #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) | |
1546 | #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) | |
6de9cd9a | 1547 | |
8c161995 | 1548 | /* CASE_LABEL_EXPR accessors. These give access to the high and low values |
6de9cd9a | 1549 | of a case label, respectively. */ |
ebaae582 SB |
1550 | #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) |
1551 | #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) | |
1552 | #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) | |
6de9cd9a | 1553 | |
ac182688 ZD |
1554 | /* The operands of a TARGET_MEM_REF. */ |
1555 | #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) | |
1556 | #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) | |
1557 | #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) | |
1558 | #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) | |
1559 | #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) | |
1560 | #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5)) | |
1561 | #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6)) | |
1562 | ||
6de9cd9a DN |
1563 | /* The operands of a BIND_EXPR. */ |
1564 | #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) | |
1565 | #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) | |
1566 | #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) | |
1567 | ||
1568 | /* GOTO_EXPR accessor. This gives access to the label associated with | |
1569 | a goto statement. */ | |
1570 | #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) | |
1571 | ||
e130a54b | 1572 | /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the |
6de9cd9a DN |
1573 | instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and |
1574 | ASM_CLOBBERS represent the outputs, inputs, and clobbers for the | |
1575 | statement. */ | |
ebaae582 SB |
1576 | #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) |
1577 | #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) | |
1578 | #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) | |
1579 | #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) | |
6de9cd9a DN |
1580 | /* Nonzero if we want to create an ASM_INPUT instead of an |
1581 | ASM_OPERAND with no operands. */ | |
1582 | #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE)) | |
1583 | #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE)) | |
1584 | ||
1585 | /* COND_EXPR accessors. */ | |
1586 | #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) | |
1587 | #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) | |
1588 | #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) | |
1589 | ||
42fd6772 ZD |
1590 | /* Accessors for the chains of recurrences. */ |
1591 | #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) | |
1592 | #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) | |
1593 | #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) | |
1594 | #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) | |
1595 | ||
6de9cd9a DN |
1596 | /* LABEL_EXPR accessor. This gives access to the label associated with |
1597 | the given label expression. */ | |
1598 | #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) | |
1599 | ||
1600 | /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other | |
1601 | accessors for SSA operands. */ | |
caf93cb0 | 1602 | |
6de9cd9a DN |
1603 | /* CATCH_EXPR accessors. */ |
1604 | #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) | |
1605 | #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) | |
1606 | ||
1607 | /* EH_FILTER_EXPR accessors. */ | |
1608 | #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) | |
1609 | #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) | |
1610 | #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE)) | |
1611 | ||
0f59171d RH |
1612 | /* OBJ_TYPE_REF accessors. */ |
1613 | #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) | |
1614 | #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) | |
1615 | #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) | |
1616 | ||
0bca51f0 DN |
1617 | /* ASSERT_EXPR accessors. */ |
1618 | #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) | |
1619 | #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) | |
1620 | ||
953ff289 DN |
1621 | /* OpenMP directive and clause accessors. */ |
1622 | ||
1623 | #define OMP_BODY(NODE) \ | |
1624 | TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0) | |
1625 | #define OMP_CLAUSES(NODE) \ | |
1626 | TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1) | |
1627 | ||
1628 | #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) | |
1629 | #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) | |
50674e96 DN |
1630 | #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2) |
1631 | #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3) | |
953ff289 DN |
1632 | |
1633 | #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0) | |
1634 | #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1) | |
1635 | #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2) | |
1636 | #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3) | |
1637 | #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4) | |
1638 | #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5) | |
1639 | ||
1640 | #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) | |
1641 | #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) | |
1642 | ||
1643 | #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) | |
1644 | ||
1645 | #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) | |
1646 | #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) | |
1647 | ||
1648 | #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) | |
1649 | ||
1650 | #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) | |
1651 | ||
1652 | #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) | |
1653 | #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) | |
1654 | ||
aaf46ef9 DN |
1655 | #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) |
1656 | #define OMP_CLAUSE_DECL(NODE) \ | |
1657 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ | |
1658 | OMP_CLAUSE_PRIVATE, \ | |
1659 | OMP_CLAUSE_COPYPRIVATE), 0) | |
953ff289 | 1660 | |
777f7f9a RH |
1661 | /* True on an OMP_SECTION statement that was the last lexical member. |
1662 | This status is meaningful in the implementation of lastprivate. */ | |
1663 | #define OMP_SECTION_LAST(NODE) \ | |
1664 | TREE_PRIVATE (OMP_SECTION_CHECK (NODE)) | |
1665 | ||
1666 | /* True on an OMP_RETURN statement if the return does not require a | |
1667 | thread synchronization via some sort of barrier. The exact barrier | |
1668 | that would otherwise be emitted is dependent on the OMP statement | |
1669 | with which this return is associated. */ | |
1670 | #define OMP_RETURN_NOWAIT(NODE) \ | |
1671 | TREE_PRIVATE (OMP_RETURN_CHECK (NODE)) | |
1672 | ||
761041be JJ |
1673 | /* True on an OMP_PARALLEL statement if it represents an explicit |
1674 | combined parallel work-sharing constructs. */ | |
1675 | #define OMP_PARALLEL_COMBINED(NODE) \ | |
1676 | TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE)) | |
1677 | ||
953ff289 DN |
1678 | /* True on a PRIVATE clause if its decl is kept around for debugging |
1679 | information only and its DECL_VALUE_EXPR is supposed to point | |
1680 | to what it has been remapped to. */ | |
1681 | #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ | |
aaf46ef9 | 1682 | TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) |
953ff289 DN |
1683 | |
1684 | /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same | |
1685 | decl is present in the chain. */ | |
1686 | #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ | |
aaf46ef9 | 1687 | TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)) |
953ff289 DN |
1688 | |
1689 | #define OMP_CLAUSE_IF_EXPR(NODE) \ | |
aaf46ef9 | 1690 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) |
953ff289 | 1691 | #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ |
aaf46ef9 | 1692 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) |
953ff289 | 1693 | #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ |
aaf46ef9 | 1694 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) |
953ff289 DN |
1695 | |
1696 | #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ | |
aaf46ef9 | 1697 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) |
953ff289 | 1698 | #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ |
aaf46ef9 | 1699 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) |
953ff289 | 1700 | #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ |
aaf46ef9 | 1701 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) |
953ff289 | 1702 | #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ |
aaf46ef9 | 1703 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) |
953ff289 DN |
1704 | |
1705 | enum omp_clause_schedule_kind | |
1706 | { | |
1707 | OMP_CLAUSE_SCHEDULE_STATIC, | |
1708 | OMP_CLAUSE_SCHEDULE_DYNAMIC, | |
1709 | OMP_CLAUSE_SCHEDULE_GUIDED, | |
1710 | OMP_CLAUSE_SCHEDULE_RUNTIME | |
1711 | }; | |
1712 | ||
1713 | #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ | |
aaf46ef9 | 1714 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) |
953ff289 DN |
1715 | |
1716 | enum omp_clause_default_kind | |
1717 | { | |
1718 | OMP_CLAUSE_DEFAULT_UNSPECIFIED, | |
1719 | OMP_CLAUSE_DEFAULT_SHARED, | |
1720 | OMP_CLAUSE_DEFAULT_NONE, | |
1721 | OMP_CLAUSE_DEFAULT_PRIVATE | |
1722 | }; | |
1723 | ||
1724 | #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ | |
aaf46ef9 | 1725 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) |
953ff289 | 1726 | |
e2500fed | 1727 | struct tree_exp GTY(()) |
61131fa2 | 1728 | { |
2bf105ab | 1729 | struct tree_common common; |
c1667470 | 1730 | source_locus locus; |
61131fa2 | 1731 | int complexity; |
6de9cd9a | 1732 | tree block; |
46c5ad27 AJ |
1733 | tree GTY ((special ("tree_exp"), |
1734 | desc ("TREE_CODE ((tree) &%0)"))) | |
e2500fed | 1735 | operands[1]; |
61131fa2 RS |
1736 | }; |
1737 | \f | |
6de9cd9a DN |
1738 | /* SSA_NAME accessors. */ |
1739 | ||
1740 | /* Returns the variable being referenced. Once released, this is the | |
1741 | only field that can be relied upon. */ | |
1742 | #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var | |
1743 | ||
1744 | /* Returns the statement which defines this reference. Note that | |
1745 | we use the same field when chaining SSA_NAME nodes together on | |
1746 | the SSA_NAME freelist. */ | |
1747 | #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain | |
1748 | ||
1749 | /* Returns the SSA version number of this SSA name. Note that in | |
1750 | tree SSA, version numbers are not per variable and may be recycled. */ | |
1751 | #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version | |
1752 | ||
1753 | /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are | |
1754 | never output, so we can safely use the ASM_WRITTEN_FLAG for this | |
1755 | status bit. */ | |
1756 | #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ | |
07beea0d | 1757 | SSA_NAME_CHECK (NODE)->base.asm_written_flag |
6de9cd9a | 1758 | |
313679b0 | 1759 | /* Nonzero if this SSA_NAME expression is currently on the free list of |
6de9cd9a DN |
1760 | SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
1761 | has no meaning for an SSA_NAME. */ | |
1762 | #define SSA_NAME_IN_FREE_LIST(NODE) \ | |
07beea0d | 1763 | SSA_NAME_CHECK (NODE)->base.nothrow_flag |
6de9cd9a | 1764 | |
313679b0 DN |
1765 | /* Attributes for SSA_NAMEs for pointer-type variables. */ |
1766 | #define SSA_NAME_PTR_INFO(N) \ | |
1767 | SSA_NAME_CHECK (N)->ssa_name.ptr_info | |
1768 | ||
7e6eb623 DB |
1769 | /* Get the value of this SSA_NAME, if available. */ |
1770 | #define SSA_NAME_VALUE(N) \ | |
1771 | SSA_NAME_CHECK (N)->ssa_name.value_handle | |
1772 | ||
ff2ad0f7 DN |
1773 | #ifndef _TREE_FLOW_H |
1774 | struct ptr_info_def; | |
313679b0 DN |
1775 | #endif |
1776 | ||
f430bae8 AM |
1777 | |
1778 | ||
f652d14b | 1779 | /* Immediate use linking structure. This structure is used for maintaining |
f430bae8 | 1780 | a doubly linked list of uses of an SSA_NAME. */ |
f47c96aa | 1781 | typedef struct ssa_use_operand_d GTY(()) |
f430bae8 | 1782 | { |
f47c96aa AM |
1783 | struct ssa_use_operand_d* GTY((skip(""))) prev; |
1784 | struct ssa_use_operand_d* GTY((skip(""))) next; | |
f430bae8 AM |
1785 | tree GTY((skip(""))) stmt; |
1786 | tree *GTY((skip(""))) use; | |
f47c96aa | 1787 | } ssa_use_operand_t; |
f430bae8 AM |
1788 | |
1789 | /* Return the immediate_use information for an SSA_NAME. */ | |
1790 | #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses | |
1791 | ||
6de9cd9a DN |
1792 | struct tree_ssa_name GTY(()) |
1793 | { | |
1794 | struct tree_common common; | |
1795 | ||
1796 | /* _DECL wrapped by this SSA name. */ | |
1797 | tree var; | |
1798 | ||
1799 | /* SSA version number. */ | |
1800 | unsigned int version; | |
313679b0 DN |
1801 | |
1802 | /* Pointer attributes used for alias analysis. */ | |
1803 | struct ptr_info_def *ptr_info; | |
7e6eb623 | 1804 | |
3aecd08b JL |
1805 | /* Value for SSA name used by various passes. |
1806 | ||
1807 | Right now only invariants are allowed to persist beyond a pass in | |
1808 | this field; in the future we will allow VALUE_HANDLEs to persist | |
1809 | as well. */ | |
1810 | tree value_handle; | |
5f240ec4 | 1811 | |
f430bae8 | 1812 | /* Immediate uses list for this SSA_NAME. */ |
f47c96aa | 1813 | struct ssa_use_operand_d imm_uses; |
6de9cd9a DN |
1814 | }; |
1815 | \f | |
1816 | /* In a PHI_NODE node. */ | |
f430bae8 | 1817 | |
0ac11108 EC |
1818 | /* These 2 macros should be considered off limits for use by developers. If |
1819 | you wish to access the use or def fields of a PHI_NODE in the SSA | |
1820 | optimizers, use the accessor macros found in tree-ssa-operands.h. | |
1821 | These two macros are to be used only by those accessor macros, and other | |
f652d14b | 1822 | select places where we *absolutely* must take the address of the tree. */ |
f430bae8 | 1823 | |
d00ad49b AM |
1824 | #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result |
1825 | #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def | |
6de9cd9a | 1826 | |
17192884 SB |
1827 | /* PHI_NODEs for each basic block are chained together in a single linked |
1828 | list. The head of the list is linked from the block annotation, and | |
1829 | the link to the next PHI is in PHI_CHAIN. */ | |
1830 | #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE)) | |
1831 | ||
d00ad49b AM |
1832 | #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args |
1833 | #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity | |
1834 | #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I) | |
6b66c718 | 1835 | #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I))) |
30d396e3 | 1836 | #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb |
f430bae8 | 1837 | #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use |
6de9cd9a | 1838 | |
6de9cd9a DN |
1839 | struct phi_arg_d GTY(()) |
1840 | { | |
5dbc71f8 KH |
1841 | /* imm_use MUST be the first element in struct because we do some |
1842 | pointer arithmetic with it. See phi_arg_index_from_use. */ | |
f47c96aa | 1843 | struct ssa_use_operand_d imm_use; |
6de9cd9a | 1844 | tree def; |
6de9cd9a DN |
1845 | }; |
1846 | ||
1847 | struct tree_phi_node GTY(()) | |
1848 | { | |
1849 | struct tree_common common; | |
1850 | tree result; | |
1851 | int num_args; | |
1852 | int capacity; | |
1853 | ||
30d396e3 ZD |
1854 | /* Basic block to that the phi node belongs. */ |
1855 | struct basic_block_def *bb; | |
1856 | ||
4b0ec99a KH |
1857 | /* Arguments of the PHI node. These are maintained in the same |
1858 | order as predecessor edge vector BB->PREDS. */ | |
c24a4dcf | 1859 | struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1]; |
6de9cd9a DN |
1860 | }; |
1861 | \f | |
aaf46ef9 DN |
1862 | #define OMP_CLAUSE_CODE(NODE) \ |
1863 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.code | |
1864 | ||
1865 | #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ | |
1866 | ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) | |
1867 | ||
1868 | #define OMP_CLAUSE_CODE(NODE) \ | |
1869 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.code | |
1870 | ||
1871 | #define OMP_CLAUSE_OPERAND(NODE, I) \ | |
1872 | OMP_CLAUSE_ELT_CHECK (NODE, I) | |
1873 | ||
1874 | struct tree_omp_clause GTY(()) | |
1875 | { | |
1876 | struct tree_common common; | |
1877 | enum omp_clause_code code; | |
1878 | union omp_clause_subcode { | |
1879 | enum omp_clause_default_kind default_kind; | |
1880 | enum omp_clause_schedule_kind schedule_kind; | |
1881 | enum tree_code reduction_code; | |
1882 | } GTY ((skip)) subcode; | |
fb57dc0b | 1883 | tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1]; |
aaf46ef9 DN |
1884 | }; |
1885 | \f | |
6de9cd9a DN |
1886 | |
1887 | struct varray_head_tag; | |
1888 | ||
8da1b058 | 1889 | /* In a BLOCK node. */ |
12b195d9 | 1890 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
12b195d9 ML |
1891 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
1892 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
8da1b058 RS |
1893 | /* Note: when changing this, make sure to find the places |
1894 | that use chainon or nreverse. */ | |
a901fa64 | 1895 | #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) |
12b195d9 ML |
1896 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
1897 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
8da1b058 RS |
1898 | |
1899 | /* Nonzero means that this block is prepared to handle exceptions | |
1900 | listed in the BLOCK_VARS slot. */ | |
c46080ab RK |
1901 | #define BLOCK_HANDLER_BLOCK(NODE) \ |
1902 | (BLOCK_CHECK (NODE)->block.handler_block_flag) | |
8da1b058 | 1903 | |
18c038b9 MM |
1904 | /* An index number for this block. These values are not guaranteed to |
1905 | be unique across functions -- whether or not they are depends on | |
1906 | the debugging output format in use. */ | |
1907 | #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) | |
1908 | ||
a20612aa RH |
1909 | /* If block reordering splits a lexical block into discontiguous |
1910 | address ranges, we'll make a copy of the original block. | |
1911 | ||
1912 | Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. | |
1913 | In that case, we have one source block that has been replicated | |
1914 | (through inlining or unrolling) into many logical blocks, and that | |
1915 | these logical blocks have different physical variables in them. | |
1916 | ||
1917 | In this case, we have one logical block split into several | |
1918 | non-contiguous address ranges. Most debug formats can't actually | |
1919 | represent this idea directly, so we fake it by creating multiple | |
1920 | logical blocks with the same variables in them. However, for those | |
1921 | that do support non-contiguous regions, these allow the original | |
1922 | logical block to be reconstructed, along with the set of address | |
1923 | ranges. | |
1924 | ||
1925 | One of the logical block fragments is arbitrarily chosen to be | |
1926 | the ORIGIN. The other fragments will point to the origin via | |
1927 | BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer | |
41077ce4 | 1928 | be null. The list of fragments will be chained through |
a20612aa RH |
1929 | BLOCK_FRAGMENT_CHAIN from the origin. */ |
1930 | ||
c46080ab RK |
1931 | #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
1932 | #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) | |
a20612aa | 1933 | |
3e2844cb JW |
1934 | /* For an inlined function, this gives the location where it was called |
1935 | from. This is only set in the top level block, which corresponds to the | |
1936 | inlined function scope. This is used in the debug output routines. */ | |
1937 | ||
1938 | #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) | |
1939 | ||
e2500fed | 1940 | struct tree_block GTY(()) |
8da1b058 | 1941 | { |
2bf105ab | 1942 | struct tree_common common; |
61131fa2 RS |
1943 | |
1944 | unsigned handler_block_flag : 1; | |
1945 | unsigned abstract_flag : 1; | |
a84efb51 | 1946 | unsigned block_num : 30; |
61131fa2 | 1947 | |
2f78c311 ZW |
1948 | tree vars; |
1949 | tree subblocks; | |
1950 | tree supercontext; | |
1951 | tree abstract_origin; | |
1952 | tree fragment_origin; | |
1953 | tree fragment_chain; | |
3e2844cb | 1954 | location_t locus; |
8da1b058 RS |
1955 | }; |
1956 | \f | |
1957 | /* Define fields and accessors for nodes representing data types. */ | |
1958 | ||
1959 | /* See tree.def for documentation of the use of these fields. | |
eb34af89 RK |
1960 | Look at the documentation of the various ..._TYPE tree codes. |
1961 | ||
d1a6adeb | 1962 | Note that the type.values, type.minval, and type.maxval fields are |
eb34af89 RK |
1963 | overloaded and used for different macros in different kinds of types. |
1964 | Each macro must check to ensure the tree node is of the proper kind of | |
1965 | type. Note also that some of the front-ends also overload these fields, | |
1966 | so they must be checked as well. */ | |
8da1b058 | 1967 | |
12b195d9 ML |
1968 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) |
1969 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) | |
1970 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) | |
1971 | #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) | |
eb34af89 | 1972 | #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values) |
08f2586c | 1973 | #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values) |
95b4aca6 | 1974 | #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values) |
89b0433e NS |
1975 | #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values) |
1976 | #define TYPE_ORIG_SIZE_TYPE(NODE) \ | |
1977 | (INTEGER_TYPE_CHECK (NODE)->type.values \ | |
1978 | ? TREE_TYPE ((NODE)->type.values) : NULL_TREE) | |
95b4aca6 NS |
1979 | #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval) |
1980 | #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval) | |
eb34af89 RK |
1981 | #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values) |
1982 | #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval) | |
1983 | #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval) | |
12b195d9 ML |
1984 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) |
1985 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) | |
22421b79 RK |
1986 | #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval) |
1987 | #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval) | |
eb34af89 RK |
1988 | #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval) |
1989 | #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval) | |
12b195d9 ML |
1990 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) |
1991 | #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) | |
1992 | #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) | |
e2500fed | 1993 | #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) |
12b195d9 ML |
1994 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) |
1995 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) | |
1996 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) | |
12b195d9 | 1997 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) |
12b195d9 | 1998 | #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) |
8da1b058 | 1999 | |
4061f623 BS |
2000 | /* For a VECTOR_TYPE node, this describes a different type which is emitted |
2001 | in the debugging output. We use this to describe a vector as a | |
2002 | structure containing an array. */ | |
5c5214a9 | 2003 | #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values) |
4061f623 | 2004 | |
95b4aca6 | 2005 | /* For record and union types, information about this type, as a base type |
8c27b7d4 | 2006 | for itself. */ |
95b4aca6 NS |
2007 | #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo) |
2008 | ||
2009 | /* For non record and union types, used in a language-dependent way. */ | |
2010 | #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo) | |
8ff0c1af | 2011 | |
41472af8 MM |
2012 | /* The (language-specific) typed-based alias set for this type. |
2013 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
2014 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
2015 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
2016 | type can alias objects of any type. */ | |
2017 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) | |
2018 | ||
2019 | /* Nonzero iff the typed-based alias set for this type has been | |
2020 | calculated. */ | |
c46080ab | 2021 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) |
41472af8 | 2022 | |
bad1b4ba RK |
2023 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
2024 | to this type. */ | |
12b195d9 | 2025 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) |
bad1b4ba | 2026 | |
869637e6 RS |
2027 | /* The alignment necessary for objects of this type. |
2028 | The value is an int, measured in bits. */ | |
12b195d9 | 2029 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) |
869637e6 | 2030 | |
11cf4d18 JJ |
2031 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
2032 | 0 if it is the default for this type. */ | |
2033 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) | |
2034 | ||
834c6dff | 2035 | /* The alignment for NODE, in bytes. */ |
c46080ab | 2036 | #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
834c6dff | 2037 | |
2b5f2501 RH |
2038 | /* If your language allows you to declare types, and you want debug info |
2039 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
2040 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
2041 | type node. You then set the TYPE_STUB_DECL field of the type node | |
2042 | to point back at the TYPE_DECL node. This allows the debug routines | |
2043 | to know that the two nodes represent the same type, so that we only | |
2ba84f36 | 2044 | get one debug info record for them. */ |
c46080ab | 2045 | #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) |
8da1b058 | 2046 | |
3635a54b RK |
2047 | /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type |
2048 | has BLKmode only because it lacks the alignment requirement for | |
2049 | its size. */ | |
12b195d9 | 2050 | #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) |
8da1b058 | 2051 | |
e36308b0 MM |
2052 | /* In an INTEGER_TYPE, it means the type represents a size. We use |
2053 | this both for validity checking and to permit optimizations that | |
2054 | are unsafe for other types. Note that the C `size_t' type should | |
2055 | *not* have this flag set. The `size_t' type is simply a typedef | |
2056 | for an ordinary integer type that happens to be the type of an | |
2057 | expression returned by `sizeof'; `size_t' has no special | |
2058 | properties. Expressions whose type have TYPE_IS_SIZETYPE set are | |
2059 | always actual sizes. */ | |
7393c642 RK |
2060 | #define TYPE_IS_SIZETYPE(NODE) \ |
2061 | (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) | |
2062 | ||
2063 | /* In a FUNCTION_TYPE, indicates that the function returns with the stack | |
2064 | pointer depressed. */ | |
2065 | #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ | |
199acebb | 2066 | (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) |
fed3cef0 | 2067 | |
8da1b058 | 2068 | /* Nonzero in a type considered volatile as a whole. */ |
07beea0d | 2069 | #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) |
8da1b058 RS |
2070 | |
2071 | /* Means this type is const-qualified. */ | |
07beea0d | 2072 | #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) |
8da1b058 | 2073 | |
3932261a MM |
2074 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
2075 | the term. */ | |
2076 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) | |
2077 | ||
2078 | /* There is a TYPE_QUAL value for each type qualifier. They can be | |
2079 | combined by bitwise-or to form the complete set of qualifiers for a | |
2080 | type. */ | |
2081 | ||
2082 | #define TYPE_UNQUALIFIED 0x0 | |
2083 | #define TYPE_QUAL_CONST 0x1 | |
2084 | #define TYPE_QUAL_VOLATILE 0x2 | |
2085 | #define TYPE_QUAL_RESTRICT 0x4 | |
2086 | ||
2087 | /* The set of type qualifiers for this type. */ | |
a6d7adfd GM |
2088 | #define TYPE_QUALS(NODE) \ |
2089 | ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | |
2090 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
66804d9e | 2091 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) |
3932261a | 2092 | |
9f86614b | 2093 | /* These flags are available for each language front end to use internally. */ |
12b195d9 ML |
2094 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) |
2095 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) | |
2096 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) | |
2097 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) | |
2098 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) | |
2099 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) | |
2100 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) | |
8da1b058 | 2101 | |
6de9cd9a DN |
2102 | /* Used to keep track of visited nodes in tree traversals. This is set to |
2103 | 0 by copy_node and make_node. */ | |
07beea0d | 2104 | #define TREE_VISITED(NODE) ((NODE)->base.visited) |
6de9cd9a | 2105 | |
74a3fd26 PB |
2106 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
2107 | that distinguish string from array of char). | |
05fa7d54 | 2108 | If set in a INTEGER_TYPE, indicates a character type. */ |
12b195d9 | 2109 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) |
74a3fd26 | 2110 | |
4fe9b91c | 2111 | /* If non-NULL, this is an upper bound of the size (in bytes) of an |
c46080ab RK |
2112 | object of the given ARRAY_TYPE. This allows temporaries to be |
2113 | allocated. */ | |
2114 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ | |
a6002f8d | 2115 | (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval) |
2fb2b21c | 2116 | |
0b4565c9 | 2117 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
c46080ab | 2118 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ |
a4e8ea7f SE |
2119 | (((unsigned HOST_WIDE_INT) 1) \ |
2120 | << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision) | |
2121 | ||
2122 | /* Set precision to n when we have 2^n sub-parts of the vector. */ | |
2123 | #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ | |
2124 | (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X)) | |
0b4565c9 | 2125 | |
cd3ce9b4 | 2126 | /* Indicates that objects of this type must be initialized by calling a |
4ac3d994 | 2127 | function when they are created. */ |
2bf105ab RK |
2128 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
2129 | (TYPE_CHECK (NODE)->type.needs_constructing_flag) | |
4ac3d994 | 2130 | |
adb23061 RK |
2131 | /* Indicates that objects of this type (a UNION_TYPE), should be passed |
2132 | the same way that the first union alternative would be passed. */ | |
2bf105ab RK |
2133 | #define TYPE_TRANSPARENT_UNION(NODE) \ |
2134 | (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
2135 | ||
2136 | /* For an ARRAY_TYPE, indicates that it is not permitted to | |
2137 | take the address of a component of the type. */ | |
2138 | #define TYPE_NONALIASED_COMPONENT(NODE) \ | |
2139 | (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) | |
adb23061 | 2140 | |
956d6950 | 2141 | /* Indicated that objects of this type should be laid out in as |
9e357cd8 | 2142 | compact a way as possible. */ |
12b195d9 | 2143 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) |
9e357cd8 | 2144 | |
a5bfe141 RH |
2145 | /* Used by type_contains_placeholder_p to avoid recomputation. |
2146 | Values are: 0 (unknown), 1 (false), 2 (true). Never access | |
2147 | this field directly. */ | |
2148 | #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ | |
2149 | (TYPE_CHECK (NODE)->type.contains_placeholder_bits) | |
2150 | ||
e2500fed GK |
2151 | struct die_struct; |
2152 | ||
2153 | struct tree_type GTY(()) | |
8da1b058 | 2154 | { |
2bf105ab | 2155 | struct tree_common common; |
2f78c311 ZW |
2156 | tree values; |
2157 | tree size; | |
2158 | tree size_unit; | |
2159 | tree attributes; | |
b3ddc3ab | 2160 | unsigned int uid; |
8da1b058 | 2161 | |
b3ddc3ab | 2162 | unsigned int precision : 9; |
c149cc37 | 2163 | ENUM_BITFIELD(machine_mode) mode : 7; |
bad1b4ba | 2164 | |
74a3fd26 | 2165 | unsigned string_flag : 1; |
8da1b058 | 2166 | unsigned no_force_blk_flag : 1; |
4ac3d994 | 2167 | unsigned needs_constructing_flag : 1; |
adb23061 | 2168 | unsigned transparent_union_flag : 1; |
9e357cd8 | 2169 | unsigned packed_flag : 1; |
3932261a | 2170 | unsigned restrict_flag : 1; |
a5bfe141 | 2171 | unsigned contains_placeholder_bits : 2; |
3932261a | 2172 | |
8da1b058 RS |
2173 | unsigned lang_flag_0 : 1; |
2174 | unsigned lang_flag_1 : 1; | |
2175 | unsigned lang_flag_2 : 1; | |
2176 | unsigned lang_flag_3 : 1; | |
2177 | unsigned lang_flag_4 : 1; | |
2178 | unsigned lang_flag_5 : 1; | |
2179 | unsigned lang_flag_6 : 1; | |
11cf4d18 | 2180 | unsigned user_align : 1; |
8da1b058 | 2181 | |
69b78d8d | 2182 | unsigned int align; |
2f78c311 ZW |
2183 | tree pointer_to; |
2184 | tree reference_to; | |
e2500fed | 2185 | union tree_type_symtab { |
46c5ad27 AJ |
2186 | int GTY ((tag ("0"))) address; |
2187 | char * GTY ((tag ("1"))) pointer; | |
17211ab5 | 2188 | struct die_struct * GTY ((tag ("2"))) die; |
46c5ad27 | 2189 | } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"), |
e2500fed | 2190 | descbits ("2"))) symtab; |
2f78c311 ZW |
2191 | tree name; |
2192 | tree minval; | |
2193 | tree maxval; | |
2194 | tree next_variant; | |
2195 | tree main_variant; | |
2196 | tree binfo; | |
2f78c311 | 2197 | tree context; |
3bdf5ad1 | 2198 | HOST_WIDE_INT alias_set; |
8da1b058 RS |
2199 | /* Points to a structure whose details depend on the language in use. */ |
2200 | struct lang_type *lang_specific; | |
2201 | }; | |
2202 | \f | |
2203 | /* Define accessor macros for information about type inheritance | |
2204 | and basetypes. | |
2205 | ||
2206 | A "basetype" means a particular usage of a data type for inheritance | |
2207 | in another type. Each such basetype usage has its own "binfo" | |
2208 | object to describe it. The binfo object is a TREE_VEC node. | |
2209 | ||
2210 | Inheritance is represented by the binfo nodes allocated for a | |
2211 | given type. For example, given types C and D, such that D is | |
2212 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
2213 | the binfo properties of C, similarly one for D, and one for | |
2214 | describing the binfo properties of D as a base type for C. | |
2215 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
2216 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
2217 | ||
809e3e7f NS |
2218 | /* BINFO specific flags. */ |
2219 | ||
2220 | /* Nonzero means that the derivation chain is via a `virtual' declaration. */ | |
07beea0d | 2221 | #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) |
809e3e7f NS |
2222 | |
2223 | /* Flags for language dependent use. */ | |
2224 | #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) | |
2225 | #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) | |
2226 | #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) | |
2227 | #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) | |
2228 | #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) | |
2229 | #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) | |
2230 | #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) | |
2231 | ||
8da1b058 | 2232 | /* The actual data type node being inherited in this basetype. */ |
95b4aca6 | 2233 | #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) |
8da1b058 RS |
2234 | |
2235 | /* The offset where this basetype appears in its containing type. | |
2236 | BINFO_OFFSET slot holds the offset (in bytes) | |
2237 | from the base of the complete object to the base of the part of the | |
2238 | object that is allocated on behalf of this `type'. | |
2239 | This is always 0 except when there is multiple inheritance. */ | |
41077ce4 | 2240 | |
95b4aca6 | 2241 | #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) |
7d02bbef | 2242 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
8da1b058 RS |
2243 | |
2244 | /* The virtual function table belonging to this basetype. Virtual | |
2245 | function tables provide a mechanism for run-time method dispatching. | |
2246 | The entries of a virtual function table are language-dependent. */ | |
2247 | ||
95b4aca6 | 2248 | #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) |
8da1b058 RS |
2249 | |
2250 | /* The virtual functions in the virtual function table. This is | |
2251 | a TREE_LIST that is used as an initial approximation for building | |
2252 | a virtual function table for this basetype. */ | |
95b4aca6 | 2253 | #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) |
8da1b058 | 2254 | |
0430641b MM |
2255 | /* A vector of binfos for the direct basetypes inherited by this |
2256 | basetype. | |
8da1b058 | 2257 | |
0430641b MM |
2258 | If this basetype describes type D as inherited in C, and if the |
2259 | basetypes of D are E and F, then this vector contains binfos for | |
fa743e8c NS |
2260 | inheritance of E and F by C. */ |
2261 | #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) | |
8da1b058 | 2262 | |
5e1677bc | 2263 | /* The number of basetypes for NODE. */ |
fa743e8c | 2264 | #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE))) |
5e1677bc | 2265 | |
604a3205 | 2266 | /* Accessor macro to get to the Nth base binfo of this binfo. */ |
fa743e8c NS |
2267 | #define BINFO_BASE_BINFO(NODE,N) \ |
2268 | (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N))) | |
2269 | #define BINFO_BASE_ITERATE(NODE,N,B) \ | |
2270 | (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B))) | |
2271 | #define BINFO_BASE_APPEND(NODE,T) \ | |
2272 | (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T))) | |
7d02bbef | 2273 | |
39ac3e4f MM |
2274 | /* For a BINFO record describing a virtual base class, i.e., one where |
2275 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
1824b90d NS |
2276 | base. The actual contents are language-dependent. In the C++ |
2277 | front-end this field is an INTEGER_CST giving an offset into the | |
2278 | vtable where the offset to the virtual base can be found. */ | |
95b4aca6 | 2279 | #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) |
2cc3ac7a | 2280 | |
dbbf88d1 NS |
2281 | /* Indicates the accesses this binfo has to its bases. The values are |
2282 | access_public_node, access_protected_node or access_private_node. | |
2283 | If this array is not present, public access is implied. */ | |
604a3205 | 2284 | #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) |
63d1c7b3 NS |
2285 | |
2286 | #define BINFO_BASE_ACCESS(NODE,N) \ | |
2287 | VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N)) | |
2288 | #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ | |
2289 | VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T)) | |
dbbf88d1 | 2290 | |
fa743e8c NS |
2291 | /* The index in the VTT where this subobject's sub-VTT can be found. |
2292 | NULL_TREE if there is no sub-VTT. */ | |
2293 | #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) | |
dbbf88d1 | 2294 | |
fa743e8c NS |
2295 | /* The index in the VTT where the vptr for this subobject can be |
2296 | found. NULL_TREE if there is no secondary vptr in the VTT. */ | |
2297 | #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) | |
2298 | ||
604a3205 NS |
2299 | /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base |
2300 | inheriting this base for non-virtual bases. For virtual bases it | |
fc6633e0 NS |
2301 | points either to the binfo for which this is a primary binfo, or to |
2302 | the binfo of the most derived type. */ | |
95b4aca6 NS |
2303 | #define BINFO_INHERITANCE_CHAIN(NODE) \ |
2304 | (TREE_BINFO_CHECK(NODE)->binfo.inheritance) | |
2305 | ||
2306 | struct tree_binfo GTY (()) | |
2307 | { | |
2308 | struct tree_common common; | |
2309 | ||
2310 | tree offset; | |
2311 | tree vtable; | |
2312 | tree virtuals; | |
95b4aca6 | 2313 | tree vptr_field; |
d4e6fecb | 2314 | VEC(tree,gc) *base_accesses; |
95b4aca6 NS |
2315 | tree inheritance; |
2316 | ||
fa743e8c NS |
2317 | tree vtt_subvtt; |
2318 | tree vtt_vptr; | |
fa743e8c | 2319 | |
d4e6fecb | 2320 | VEC(tree,none) base_binfos; |
95b4aca6 | 2321 | }; |
95b4aca6 | 2322 | |
8da1b058 RS |
2323 | \f |
2324 | /* Define fields and accessors for nodes representing declared names. */ | |
2325 | ||
6de9cd9a | 2326 | /* Nonzero if DECL represents a variable for the SSA passes. */ |
326eda4b DB |
2327 | #define SSA_VAR_P(DECL) \ |
2328 | (TREE_CODE (DECL) == VAR_DECL \ | |
2329 | || TREE_CODE (DECL) == PARM_DECL \ | |
2330 | || TREE_CODE (DECL) == RESULT_DECL \ | |
2331 | || MTAG_P (DECL) \ | |
2332 | || (TREE_CODE (DECL) == SSA_NAME \ | |
2333 | && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ | |
2334 | || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ | |
2335 | || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \ | |
2336 | || MTAG_P (SSA_NAME_VAR (DECL))))) | |
6de9cd9a | 2337 | |
c46080ab | 2338 | |
c46080ab | 2339 | |
c46080ab | 2340 | |
820cc88f DB |
2341 | /* Enumerate visibility settings. */ |
2342 | #ifndef SYMBOL_VISIBILITY_DEFINED | |
2343 | #define SYMBOL_VISIBILITY_DEFINED | |
2344 | enum symbol_visibility | |
2345 | { | |
2346 | VISIBILITY_DEFAULT, | |
b9e75696 | 2347 | VISIBILITY_PROTECTED, |
820cc88f | 2348 | VISIBILITY_HIDDEN, |
b9e75696 | 2349 | VISIBILITY_INTERNAL |
820cc88f DB |
2350 | }; |
2351 | #endif | |
c46080ab | 2352 | |
820cc88f | 2353 | struct function; |
41077ce4 | 2354 | |
92643fea | 2355 | |
820cc88f DB |
2356 | /* This is the name of the object as written by the user. |
2357 | It is an IDENTIFIER_NODE. */ | |
2358 | #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) | |
c46080ab | 2359 | |
820cc88f DB |
2360 | /* Every ..._DECL node gets a unique number. */ |
2361 | #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) | |
92643fea | 2362 | |
820cc88f DB |
2363 | /* These two fields describe where in the source code the declaration |
2364 | was. If the declaration appears in several places (as for a C | |
2365 | function that is declared first and then defined later), this | |
2366 | information should refer to the definition. */ | |
2367 | #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) | |
2368 | #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) | |
2369 | #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) | |
2370 | #ifdef USE_MAPPED_LOCATION | |
2371 | #define DECL_IS_BUILTIN(DECL) \ | |
2372 | (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) | |
2373 | #else | |
2374 | #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0) | |
2375 | #endif | |
c46080ab | 2376 | |
d1bd0ded GK |
2377 | /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
2378 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
2379 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
2380 | points to either the FUNCTION_DECL for the containing function, | |
2381 | the RECORD_TYPE or UNION_TYPE for the containing type, or | |
2382 | NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file | |
2383 | scope". */ | |
820cc88f DB |
2384 | #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) |
2385 | #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context) | |
2386 | struct tree_decl_minimal GTY(()) | |
2387 | { | |
2388 | struct tree_common common; | |
2389 | location_t locus; | |
2390 | unsigned int uid; | |
2391 | tree name; | |
2392 | tree context; | |
2393 | }; | |
2394 | ||
326eda4b DB |
2395 | /* When computing aliasing information, we represent the memory pointed-to |
2396 | by pointers with artificial variables called "memory tags" (MT). There | |
18cd8a03 | 2397 | are two kinds of tags, namely symbol and name: |
0ac11108 | 2398 | |
18cd8a03 DN |
2399 | Symbol tags (SMT) are used in flow-insensitive alias analysis, they |
2400 | represent all the pointed-to locations and variables pointed-to by | |
2401 | the same pointer symbol. Usually, this set is computed using | |
2402 | type-based analysis (i.e., alias set classes), but this may not | |
2403 | always be the case. | |
2404 | ||
2405 | Name tags (NMT) are used in flow-sensitive points-to alias | |
2406 | analysis, they represent the variables and memory locations | |
2407 | pointed-to by a specific SSA_NAME pointer. | |
2408 | ||
2409 | In general, given a pointer P with a symbol tag SMT, the alias set | |
2410 | of SMT should be the union of all the alias sets of the NMTs of | |
2411 | every SSA_NAME for P. */ | |
326eda4b DB |
2412 | struct tree_memory_tag GTY(()) |
2413 | { | |
2414 | struct tree_decl_minimal common; | |
326eda4b DB |
2415 | unsigned int is_global:1; |
2416 | }; | |
2417 | ||
2418 | #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global) | |
3c0b6c43 DB |
2419 | |
2420 | struct tree_struct_field_tag GTY(()) | |
2421 | { | |
2422 | struct tree_memory_tag common; | |
0ac11108 | 2423 | |
3c0b6c43 DB |
2424 | /* Parent variable. */ |
2425 | tree parent_var; | |
0ac11108 | 2426 | |
3c0b6c43 DB |
2427 | /* Offset inside structure. */ |
2428 | unsigned HOST_WIDE_INT offset; | |
2429 | ||
2430 | /* Size of the field. */ | |
2431 | unsigned HOST_WIDE_INT size; | |
2432 | ||
2433 | }; | |
2434 | #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var) | |
2435 | #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset) | |
2436 | #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size) | |
326eda4b | 2437 | |
820cc88f DB |
2438 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
2439 | decl node which this decl is an instance of, or else it is NULL indicating | |
2440 | that this decl is not an instance of some other decl. For example, | |
2441 | in a nested declaration of an inline function, this points back to the | |
2442 | definition. */ | |
2443 | #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) | |
2444 | ||
2445 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract | |
2446 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
2447 | #define DECL_ORIGIN(NODE) \ | |
2448 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) | |
2449 | ||
2450 | /* Nonzero for any sort of ..._DECL node means this decl node represents an | |
2451 | inline instance of some original (abstract) decl from an inline function; | |
2452 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
2453 | nodes can also have their abstract origin set to themselves. */ | |
2454 | #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ | |
2455 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) | |
2456 | ||
91d231cb | 2457 | /* In a DECL this is the field where attributes are stored. */ |
820cc88f DB |
2458 | #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes) |
2459 | ||
8da1b058 | 2460 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
d1bd0ded | 2461 | For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
8da1b058 RS |
2462 | For a VAR_DECL, holds the initial value. |
2463 | For a PARM_DECL, not used--default | |
2464 | values for parameters are encoded in the type of the function, | |
4f976745 | 2465 | not in the PARM_DECL slot. |
820cc88f | 2466 | For a FIELD_DECL, this is used for enumeration values and the C |
0ac11108 | 2467 | frontend uses it for temporarily storing bitwidth of bitfields. |
4f976745 RK |
2468 | |
2469 | ??? Need to figure out some way to check this isn't a PARM_DECL. */ | |
820cc88f DB |
2470 | #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) |
2471 | ||
06ceef4e | 2472 | /* Holds the size of the datum, in bits, as a tree expression. |
8da1b058 | 2473 | Need not be constant. */ |
820cc88f | 2474 | #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) |
06ceef4e | 2475 | /* Likewise for the size in bytes. */ |
820cc88f | 2476 | #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) |
971774bb | 2477 | /* Holds the alignment required for the datum, in bits. */ |
820cc88f | 2478 | #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align) |
971774bb MM |
2479 | /* The alignment of NODE, in bytes. */ |
2480 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
2f5c7f45 GK |
2481 | /* For FIELD_DECLs, off_align holds the number of low-order bits of |
2482 | DECL_FIELD_OFFSET which are known to be always zero. | |
2483 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
2484 | has. */ | |
820cc88f | 2485 | #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align) |
17c73321 RK |
2486 | /* Holds the machine mode corresponding to the declaration of a variable or |
2487 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
2488 | FIELD_DECL. */ | |
820cc88f | 2489 | #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) |
c46080ab | 2490 | |
9c0a30c3 EB |
2491 | /* For FUNCTION_DECL, if it is built-in, this identifies which built-in |
2492 | operation it is. Note, however, that this field is overloaded, with | |
2493 | DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be | |
2494 | checked before any access to the former. */ | |
820cc88f | 2495 | #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f) |
dad2a933 | 2496 | #define DECL_DEBUG_EXPR_IS_FROM(NODE) \ |
820cc88f | 2497 | (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from) |
8da1b058 | 2498 | |
4aa708ba | 2499 | /* Nonzero for a given ..._DECL node means that the name of this node should |
0ac11108 | 2500 | be ignored for symbolic debug purposes. */ |
820cc88f | 2501 | #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) |
8da1b058 | 2502 | |
c5caa350 CH |
2503 | /* Nonzero for a given ..._DECL node means that this node represents an |
2504 | "abstract instance" of the given declaration (e.g. in the original | |
2505 | declaration of an inline function). When generating symbolic debugging | |
9faa82d8 | 2506 | information, we mustn't try to generate any address information for nodes |
c5caa350 CH |
2507 | marked as "abstract instances" because we don't actually generate |
2508 | any code or allocate any data space for such instances. */ | |
820cc88f | 2509 | #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) |
2c0d84d6 | 2510 | |
3110a56e | 2511 | /* Language-specific decl information. */ |
820cc88f | 2512 | #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) |
8da1b058 | 2513 | |
820cc88f | 2514 | /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: |
9783dd38 GDR |
2515 | do not allocate storage, and refer to a definition elsewhere. Note that |
2516 | this does not necessarily imply the entity represented by NODE | |
2517 | has no program source-level definition in this translation unit. For | |
2518 | example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and | |
2519 | DECL_EXTERNAL may be true simultaneously; that can be the case for | |
2520 | a C99 "extern inline" function. */ | |
820cc88f | 2521 | #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2) |
8da1b058 | 2522 | |
2ce3c6c6 | 2523 | /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority |
14b493d6 | 2524 | initializations. */ |
2ce3c6c6 JM |
2525 | #define DEFAULT_INIT_PRIORITY 65535 |
2526 | #define MAX_INIT_PRIORITY 65535 | |
9a6e70c9 | 2527 | #define MAX_RESERVED_INIT_PRIORITY 100 |
2ce3c6c6 | 2528 | |
8da1b058 RS |
2529 | |
2530 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. | |
2531 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
2532 | ||
2533 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
2534 | ||
2535 | Also set in some languages for variables, etc., outside the normal | |
2536 | lexical scope, such as class instance variables. */ | |
820cc88f | 2537 | #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) |
8da1b058 | 2538 | |
820cc88f DB |
2539 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2540 | Used in FIELD_DECLs for vtable pointers. | |
2541 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
2542 | #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) | |
8da1b058 | 2543 | |
820cc88f DB |
2544 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
2545 | #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) | |
bc522472 | 2546 | |
820cc88f DB |
2547 | /* Additional flags for language-specific uses. */ |
2548 | #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) | |
2549 | #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) | |
2550 | #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) | |
2551 | #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) | |
2552 | #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) | |
2553 | #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) | |
2554 | #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) | |
2555 | #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) | |
48eb4e53 | 2556 | |
820cc88f DB |
2557 | /* Used to indicate an alias set for the memory pointed to by this |
2558 | particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have | |
2559 | pointer (or reference) type. */ | |
2560 | #define DECL_POINTER_ALIAS_SET(NODE) \ | |
2561 | (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set) | |
6de9cd9a | 2562 | |
820cc88f DB |
2563 | /* Nonzero if an alias set has been assigned to this declaration. */ |
2564 | #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ | |
2565 | (DECL_POINTER_ALIAS_SET (NODE) != - 1) | |
968b41a1 | 2566 | |
820cc88f DB |
2567 | /* Nonzero for a decl which is at file scope. */ |
2568 | #define DECL_FILE_SCOPE_P(EXP) \ | |
2569 | (! DECL_CONTEXT (EXP) \ | |
2570 | || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL) | |
d7afec4b | 2571 | |
820cc88f DB |
2572 | /* Nonzero for a decl that is decorated using attribute used. |
2573 | This indicates compiler tools that this decl needs to be preserved. */ | |
2574 | #define DECL_PRESERVE_P(DECL) \ | |
2575 | DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag | |
0ac11108 | 2576 | |
820cc88f DB |
2577 | /* For function local variables of COMPLEX type, indicates that the |
2578 | variable is not aliased, and that all modifications to the variable | |
2579 | have been adjusted so that they are killing assignments. Thus the | |
2580 | variable may now be treated as a GIMPLE register, and use real | |
2581 | instead of virtual ops in SSA form. */ | |
2582 | #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \ | |
2583 | DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag | |
5daf7c0a | 2584 | |
fe1f8f44 DB |
2585 | /* This is true if DECL is call clobbered in the current function. |
2586 | The result of this flag should always be the same as | |
2587 | bitmap_bit_p (call_clobbered_vars, DECL_UID (decl)). */ | |
2588 | #define DECL_CALL_CLOBBERED(DECL) \ | |
2589 | DECL_COMMON_CHECK (DECL)->decl_common.call_clobbered_flag | |
2590 | ||
820cc88f DB |
2591 | struct tree_decl_common GTY(()) |
2592 | { | |
2593 | struct tree_decl_minimal common; | |
2594 | tree size; | |
c2f7fa15 | 2595 | |
820cc88f | 2596 | ENUM_BITFIELD(machine_mode) mode : 8; |
3d78f2e9 | 2597 | |
820cc88f DB |
2598 | unsigned nonlocal_flag : 1; |
2599 | unsigned virtual_flag : 1; | |
2600 | unsigned ignored_flag : 1; | |
2601 | unsigned abstract_flag : 1; | |
2602 | unsigned artificial_flag : 1; | |
2603 | unsigned user_align : 1; | |
2604 | unsigned preserve_flag: 1; | |
2605 | unsigned debug_expr_is_from : 1; | |
2606 | ||
2607 | unsigned lang_flag_0 : 1; | |
2608 | unsigned lang_flag_1 : 1; | |
2609 | unsigned lang_flag_2 : 1; | |
2610 | unsigned lang_flag_3 : 1; | |
2611 | unsigned lang_flag_4 : 1; | |
2612 | unsigned lang_flag_5 : 1; | |
2613 | unsigned lang_flag_6 : 1; | |
2614 | unsigned lang_flag_7 : 1; | |
0ac11108 | 2615 | |
820cc88f DB |
2616 | /* In LABEL_DECL, this is DECL_ERROR_ISSUED. |
2617 | In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ | |
2618 | unsigned decl_flag_0 : 1; | |
52dd234b | 2619 | /* In FIELD_DECL, this is DECL_PACKED. */ |
820cc88f DB |
2620 | unsigned decl_flag_1 : 1; |
2621 | /* In FIELD_DECL, this is DECL_BIT_FIELD | |
0ac11108 EC |
2622 | In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. |
2623 | In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */ | |
2624 | unsigned decl_flag_2 : 1; | |
820cc88f DB |
2625 | /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P |
2626 | In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */ | |
0ac11108 EC |
2627 | unsigned decl_flag_3 : 1; |
2628 | /* Logically, these two would go in a theoretical base shared by var and | |
fe1f8f44 | 2629 | parm decl. */ |
820cc88f | 2630 | unsigned gimple_reg_flag : 1; |
fe1f8f44 | 2631 | unsigned call_clobbered_flag : 1; |
0ac11108 | 2632 | |
820cc88f DB |
2633 | union tree_decl_u1 { |
2634 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is | |
2635 | DECL_FUNCTION_CODE. */ | |
2636 | enum built_in_function f; | |
2637 | /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this | |
2638 | is used by language-dependent code. */ | |
2639 | HOST_WIDE_INT i; | |
2640 | /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for | |
2641 | FUNCTION_DECLs). */ | |
2642 | struct tree_decl_u1_a { | |
2643 | unsigned int align : 24; | |
2644 | unsigned int off_align : 8; | |
2645 | } a; | |
2646 | } GTY ((skip)) u1; | |
2647 | ||
2648 | tree size_unit; | |
2649 | tree initial; | |
2650 | tree attributes; | |
2651 | tree abstract_origin; | |
0ac11108 EC |
2652 | |
2653 | HOST_WIDE_INT pointer_alias_set; | |
820cc88f DB |
2654 | /* Points to a structure whose details depend on the language in use. */ |
2655 | struct lang_decl *lang_specific; | |
2656 | }; | |
588d3ade | 2657 | |
833b3afe DB |
2658 | extern tree decl_value_expr_lookup (tree); |
2659 | extern void decl_value_expr_insert (tree, tree); | |
2660 | ||
1a186ec5 RH |
2661 | /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, |
2662 | if transformations have made this more complicated than evaluating the | |
2663 | decl itself. This should only be used for debugging; once this field has | |
2664 | been set, the decl itself may not legitimately appear in the function. */ | |
833b3afe | 2665 | #define DECL_HAS_VALUE_EXPR_P(NODE) \ |
820cc88f | 2666 | (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3) |
1a186ec5 | 2667 | #define DECL_VALUE_EXPR(NODE) \ |
0ac11108 | 2668 | (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) |
833b3afe | 2669 | #define SET_DECL_VALUE_EXPR(NODE, VAL) \ |
820cc88f | 2670 | (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) |
1a186ec5 | 2671 | |
820cc88f DB |
2672 | /* Holds the RTL expression for the value of a variable or function. |
2673 | This value can be evaluated lazily for functions, variables with | |
2674 | static storage duration, and labels. */ | |
2675 | #define DECL_RTL(NODE) \ | |
2676 | (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ | |
2677 | ? (NODE)->decl_with_rtl.rtl \ | |
2678 | : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) | |
140592a0 | 2679 | |
820cc88f DB |
2680 | /* Set the DECL_RTL for NODE to RTL. */ |
2681 | #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) | |
6e9a3221 | 2682 | |
820cc88f DB |
2683 | /* Returns nonzero if NODE is a tree node that can contain RTL. */ |
2684 | #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) | |
2685 | ||
2686 | /* Returns nonzero if the DECL_RTL for NODE has already been set. */ | |
2687 | #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) | |
2688 | ||
2689 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for | |
2690 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
2691 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
2692 | (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) | |
2693 | ||
2694 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
2695 | #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) | |
2696 | ||
2697 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ | |
2698 | #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) | |
2699 | ||
2700 | struct tree_decl_with_rtl GTY(()) | |
2701 | { | |
2702 | struct tree_decl_common common; | |
2703 | rtx rtl; | |
2704 | }; | |
2705 | ||
2706 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the | |
a40776a2 SL |
2707 | DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning |
2708 | of the structure. */ | |
820cc88f DB |
2709 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) |
2710 | ||
2711 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
a40776a2 SL |
2712 | field from DECL_FIELD_OFFSET. This field may be nonzero even for fields |
2713 | that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the | |
2714 | natural alignment of the field's type). */ | |
820cc88f DB |
2715 | #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) |
2716 | ||
2717 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and | |
2718 | if so, the type that was originally specified for it. | |
2719 | TREE_TYPE may have been modified (in finish_struct). */ | |
2720 | #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) | |
2721 | ||
2722 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which | |
2723 | if nonzero, indicates that the field occupies the type. */ | |
2724 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) | |
2725 | ||
2726 | /* For FIELD_DECLs, off_align holds the number of low-order bits of | |
2727 | DECL_FIELD_OFFSET which are known to be always zero. | |
2728 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
2729 | has. */ | |
2730 | #define DECL_OFFSET_ALIGN(NODE) \ | |
2731 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align) | |
2732 | ||
2733 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
2734 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
2735 | (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X))) | |
2736 | /* 1 if the alignment for this type was requested by "aligned" attribute, | |
2737 | 0 if it is the default for this type. */ | |
2738 | ||
2739 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in | |
2740 | which this FIELD_DECL is defined. This information is needed when | |
2741 | writing debugging information about vfield and vbase decls for C++. */ | |
2742 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) | |
2743 | ||
2744 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ | |
2745 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) | |
2a8f6b90 | 2746 | |
8da1b058 RS |
2747 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
2748 | specially. */ | |
820cc88f | 2749 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) |
c46080ab | 2750 | |
820cc88f DB |
2751 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
2752 | this component. */ | |
2753 | #define DECL_NONADDRESSABLE_P(NODE) \ | |
2754 | (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3) | |
26db82d8 | 2755 | |
820cc88f DB |
2756 | struct tree_field_decl GTY(()) |
2757 | { | |
2758 | struct tree_decl_common common; | |
2759 | ||
0ac11108 EC |
2760 | tree offset; |
2761 | tree bit_field_type; | |
820cc88f DB |
2762 | tree qualifier; |
2763 | tree bit_offset; | |
2764 | tree fcontext; | |
0ac11108 | 2765 | |
820cc88f | 2766 | }; |
8da1b058 | 2767 | |
820cc88f DB |
2768 | /* A numeric unique identifier for a LABEL_DECL. The UID allocation is |
2769 | dense, unique within any one function, and may be used to index arrays. | |
2770 | If the value is -1, then no UID has been assigned. */ | |
2771 | #define LABEL_DECL_UID(NODE) \ | |
2772 | (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set) | |
c46080ab | 2773 | |
820cc88f DB |
2774 | /* In LABEL_DECL nodes, nonzero means that an error message about |
2775 | jumping into such a binding contour has been printed for this label. */ | |
2776 | #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0) | |
12a22e76 | 2777 | |
820cc88f DB |
2778 | struct tree_label_decl GTY(()) |
2779 | { | |
2780 | struct tree_decl_with_rtl common; | |
2781 | /* Java's verifier has some need to store information about labels, | |
0ac11108 | 2782 | and was using fields that no longer exist on labels. |
820cc88f DB |
2783 | Once the verifier doesn't need these anymore, they should be removed. */ |
2784 | tree java_field_1; | |
2785 | tree java_field_2; | |
2786 | tree java_field_3; | |
2787 | unsigned int java_field_4; | |
8da1b058 | 2788 | |
820cc88f DB |
2789 | }; |
2790 | ||
2791 | struct tree_result_decl GTY(()) | |
2792 | { | |
2793 | struct tree_decl_with_rtl common; | |
2794 | }; | |
2795 | ||
2796 | struct tree_const_decl GTY(()) | |
2797 | { | |
2798 | struct tree_decl_with_rtl common; | |
2799 | }; | |
2800 | ||
2801 | /* For a PARM_DECL, records the data type used to pass the argument, | |
2802 | which may be different from the type seen in the program. */ | |
2803 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) | |
2804 | ||
2805 | /* For PARM_DECL, holds an RTL for the stack slot or register | |
2806 | where the data was actually passed. */ | |
2807 | #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) | |
30801830 | 2808 | |
820cc88f DB |
2809 | struct tree_parm_decl GTY(()) |
2810 | { | |
2811 | struct tree_decl_with_rtl common; | |
0ac11108 | 2812 | rtx incoming_rtl; |
820cc88f | 2813 | }; |
770ae6cc | 2814 | |
2c5f4139 | 2815 | |
820cc88f DB |
2816 | /* Nonzero in a decl means that the gimplifier has seen (or placed) |
2817 | this variable in a BIND_EXPR. */ | |
2818 | #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ | |
2819 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) | |
3edbc4b9 | 2820 | |
820cc88f DB |
2821 | /* Used to indicate that the linkage status of this DECL is not yet known, |
2822 | so it should not be output now. */ | |
2823 | #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) | |
2824 | ||
2825 | /* Nonzero for a given ..._DECL node means that no warnings should be | |
2826 | generated just because this node is unused. */ | |
2827 | #define DECL_IN_SYSTEM_HEADER(NODE) \ | |
2828 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag) | |
2829 | ||
2830 | /* Used to indicate that this DECL has weak linkage. */ | |
2831 | #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) | |
2832 | ||
2833 | /* Internal to the gimplifier. Indicates that the value is a formal | |
2834 | temporary controlled by the gimplifier. */ | |
2835 | #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \ | |
2836 | DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp | |
2837 | ||
43d9ad1d DS |
2838 | /* Used to indicate that the DECL is a dllimport. */ |
2839 | #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) | |
daefd78b | 2840 | |
0b494699 ILT |
2841 | /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary |
2842 | based on a variable with a restrict qualified type. If it is, | |
2843 | DECL_RESTRICT_BASE returns the restrict qualified variable on which | |
2844 | it is based. */ | |
2845 | ||
2846 | #define DECL_BASED_ON_RESTRICT_P(NODE) \ | |
2847 | (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p) | |
2848 | #define DECL_GET_RESTRICT_BASE(NODE) \ | |
2849 | (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE))) | |
2850 | #define SET_DECL_RESTRICT_BASE(NODE, VAL) \ | |
2851 | (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL))) | |
2852 | ||
2853 | extern tree decl_restrict_base_lookup (tree); | |
2854 | extern void decl_restrict_base_insert (tree, tree); | |
c5bd82cb | 2855 | |
59182242 MM |
2856 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
2857 | not be put out unless it is needed in this translation unit. | |
2858 | Entities like this are shared across translation units (like weak | |
2859 | entities), but are guaranteed to be generated by any translation | |
2860 | unit that needs them, and therefore need not be put out anywhere | |
2861 | where they are not needed. DECL_COMDAT is just a hint to the | |
2862 | back-end; it is up to front-ends which set this flag to ensure | |
2863 | that there will never be any harm, other than bloat, in putting out | |
2864 | something which is DECL_COMDAT. */ | |
820cc88f | 2865 | #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) |
59182242 | 2866 | |
820cc88f DB |
2867 | /* The name of the object as the assembler will see it (but before any |
2868 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
2869 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
2870 | #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) | |
07417085 | 2871 | |
0ac11108 | 2872 | /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. |
820cc88f DB |
2873 | This is true of all DECL nodes except FIELD_DECL. */ |
2874 | #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ | |
2875 | (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) | |
a157febd | 2876 | |
820cc88f DB |
2877 | /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, |
2878 | the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set | |
2879 | yet. */ | |
2880 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ | |
2881 | (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) | |
8da1b058 | 2882 | |
820cc88f DB |
2883 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ |
2884 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
2885 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) | |
27da1b4d | 2886 | |
820cc88f DB |
2887 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's |
2888 | DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause | |
2889 | the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the | |
2890 | semantics of using this macro, are different than saying: | |
2bf105ab | 2891 | |
820cc88f | 2892 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) |
3932261a | 2893 | |
820cc88f | 2894 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ |
6de9cd9a | 2895 | |
820cc88f DB |
2896 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ |
2897 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
2898 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ | |
2899 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
2900 | : (void) 0) | |
6de9cd9a | 2901 | |
820cc88f DB |
2902 | /* Records the section name in a section attribute. Used to pass |
2903 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
2904 | #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name) | |
3932261a | 2905 | |
820cc88f DB |
2906 | /* Value of the decls's visibility attribute */ |
2907 | #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) | |
2908 | ||
2909 | /* Nonzero means that the decl had its visibility specified rather than | |
2910 | being inferred. */ | |
2911 | #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) | |
2912 | ||
2913 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in | |
2914 | multiple translation units should be merged. */ | |
2915 | #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only) | |
2916 | ||
2917 | struct tree_decl_with_vis GTY(()) | |
2918 | { | |
2919 | struct tree_decl_with_rtl common; | |
2920 | tree assembler_name; | |
2921 | tree section_name; | |
0ac11108 | 2922 | |
820cc88f DB |
2923 | /* Belong to VAR_DECL exclusively. */ |
2924 | unsigned defer_output:1; | |
2925 | unsigned hard_register:1; | |
2926 | unsigned thread_local:1; | |
0ac11108 | 2927 | unsigned common_flag:1; |
820cc88f DB |
2928 | unsigned in_text_section : 1; |
2929 | unsigned gimple_formal_temp : 1; | |
0ac11108 | 2930 | unsigned dllimport_flag : 1; |
0b494699 | 2931 | unsigned based_on_restrict_p : 1; |
820cc88f DB |
2932 | /* Used by C++. Might become a generic decl flag. */ |
2933 | unsigned shadowed_for_var_p : 1; | |
0ac11108 | 2934 | |
820cc88f DB |
2935 | /* Don't belong to VAR_DECL exclusively. */ |
2936 | unsigned in_system_header_flag : 1; | |
2937 | unsigned weak_flag:1; | |
2938 | unsigned seen_in_bind_expr : 1; | |
2939 | unsigned comdat_flag : 1; | |
2940 | ENUM_BITFIELD(symbol_visibility) visibility : 2; | |
2941 | unsigned visibility_specified : 1; | |
2942 | /* Belong to FUNCTION_DECL exclusively. */ | |
2943 | unsigned one_only : 1; | |
2944 | unsigned init_priority_p:1; | |
2945 | ||
2946 | /* Belongs to VAR_DECL exclusively. */ | |
2947 | ENUM_BITFIELD(tls_model) tls_model : 3; | |
b23987ec | 2948 | /* 11 unused bits. */ |
820cc88f DB |
2949 | }; |
2950 | ||
2951 | /* In a VAR_DECL that's static, | |
2952 | nonzero if the space is in the text section. */ | |
2953 | #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) | |
2954 | ||
2955 | /* Nonzero for a given ..._DECL node means that this node should be | |
2956 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
2957 | is not error_mark_node, then the decl cannot be put in .common. */ | |
2958 | #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) | |
2959 | ||
2960 | /* In a VAR_DECL, nonzero if the decl is a register variable with | |
2961 | an explicit asm specification. */ | |
2962 | #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) | |
2963 | ||
2964 | extern tree decl_debug_expr_lookup (tree); | |
2965 | extern void decl_debug_expr_insert (tree, tree); | |
2966 | /* For VAR_DECL, this is set to either an expression that it was split | |
2967 | from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of | |
2968 | subexpressions that it was split into. */ | |
2969 | #define DECL_DEBUG_EXPR(NODE) \ | |
2970 | (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) | |
2971 | ||
2972 | #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ | |
2973 | (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) | |
2974 | ||
2975 | ||
2976 | extern unsigned short decl_init_priority_lookup (tree); | |
2977 | extern void decl_init_priority_insert (tree, unsigned short); | |
2978 | ||
2979 | /* In a non-local VAR_DECL with static storage duration, this is the | |
2980 | initialization priority. If this value is zero, the NODE will be | |
2981 | initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/ | |
2982 | ||
2983 | #define DECL_HAS_INIT_PRIORITY_P(NODE) \ | |
2984 | (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) | |
2985 | #define DECL_INIT_PRIORITY(NODE) \ | |
2986 | (decl_init_priority_lookup (VAR_DECL_CHECK (NODE))) | |
2987 | #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ | |
2988 | (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL)) | |
2989 | ||
2990 | /* In a VAR_DECL, the model to use if the data should be allocated from | |
2991 | thread-local storage. */ | |
2992 | #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model) | |
2993 | ||
2994 | /* In a VAR_DECL, nonzero if the data should be allocated from | |
2995 | thread-local storage. */ | |
2996 | #define DECL_THREAD_LOCAL_P(NODE) \ | |
2997 | (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE) | |
2998 | ||
2999 | struct tree_var_decl GTY(()) | |
3000 | { | |
3001 | struct tree_decl_with_vis common; | |
3002 | }; | |
3003 | ||
3004 | ||
3005 | /* This field is used to reference anything in decl.result and is meant only | |
3006 | for use by the garbage collector. */ | |
3007 | #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) | |
3008 | ||
3009 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
3010 | Before the struct containing the FUNCTION_DECL is laid out, | |
3011 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
3012 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
3013 | function. When the class is laid out, this pointer is changed | |
3014 | to an INTEGER_CST node which is suitable for use as an index | |
0ac11108 | 3015 | into the virtual function table. |
820cc88f DB |
3016 | C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */ |
3017 | #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex) | |
3018 | ||
3019 | struct tree_decl_non_common GTY(()) | |
3020 | ||
3021 | { | |
3022 | struct tree_decl_with_vis common; | |
3023 | /* C++ uses this in namespaces. */ | |
3024 | tree saved_tree; | |
3025 | /* C++ uses this in templates. */ | |
0ac11108 | 3026 | tree arguments; |
820cc88f | 3027 | /* Almost all FE's use this. */ |
0ac11108 | 3028 | tree result; |
820cc88f DB |
3029 | /* C++ uses this in namespaces. */ |
3030 | tree vindex; | |
3031 | }; | |
3032 | ||
3033 | /* In FUNCTION_DECL, holds the decl for the return value. */ | |
3034 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) | |
3035 | ||
3036 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ | |
3037 | #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) | |
3038 | ||
3039 | /* In a FUNCTION_DECL, the saved representation of the body of the | |
3040 | entire function. */ | |
3041 | #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree) | |
3042 | ||
3043 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3044 | as if it were a malloc, meaning it returns a pointer that is | |
3045 | not an alias. */ | |
3046 | #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) | |
3047 | ||
3048 | /* Nonzero in a FUNCTION_DECL means this function may return more | |
3049 | than once. */ | |
3050 | #define DECL_IS_RETURNS_TWICE(NODE) \ | |
3051 | (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) | |
3052 | ||
3053 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3054 | as "pure" function (like const function, but may read global memory). */ | |
3055 | #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) | |
3056 | ||
3057 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3058 | as "novops" function (function that does not read global memory, | |
3059 | but may have arbitrary side effects). */ | |
3060 | #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) | |
3061 | ||
3062 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically | |
3063 | at the beginning or end of execution. */ | |
3064 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ | |
3065 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) | |
3066 | ||
3067 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
3068 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) | |
3069 | ||
3070 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should | |
3071 | be instrumented with calls to support routines. */ | |
3072 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ | |
3073 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) | |
3074 | ||
3075 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be | |
3076 | disabled in this function. */ | |
3077 | #define DECL_NO_LIMIT_STACK(NODE) \ | |
3078 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) | |
3079 | ||
3080 | /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a | |
3081 | static chain is not needed. */ | |
3082 | #define DECL_NO_STATIC_CHAIN(NODE) \ | |
3083 | (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag) | |
4b1e44be | 3084 | |
6f312d18 ZW |
3085 | /* Nonzero for a decl that cgraph has decided should be inlined into |
3086 | at least one call site. It is not meaningful to look at this | |
3087 | directly; always use cgraph_function_possibly_inlined_p. */ | |
3088 | #define DECL_POSSIBLY_INLINED(DECL) \ | |
820cc88f | 3089 | FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined |
6f312d18 | 3090 | |
820cc88f DB |
3091 | /* Nonzero in a FUNCTION_DECL means this function can be substituted |
3092 | where it is called. */ | |
3093 | #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag) | |
8e3e233b | 3094 | |
820cc88f DB |
3095 | /* Nonzero in a FUNCTION_DECL means that this function was declared inline, |
3096 | such as via the `inline' keyword in C/C++. This flag controls the linkage | |
3097 | semantics of 'inline'; whether or not the function is inlined is | |
3098 | controlled by DECL_INLINE. */ | |
3099 | #define DECL_DECLARED_INLINE_P(NODE) \ | |
3100 | (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) | |
17ad5b5e | 3101 | |
820cc88f DB |
3102 | /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") |
3103 | that describes the status of this function. */ | |
3104 | #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f) | |
e41d82f5 | 3105 | |
820cc88f DB |
3106 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
3107 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
968b41a1 | 3108 | |
820cc88f DB |
3109 | /* For a builtin function, identify which part of the compiler defined it. */ |
3110 | #define DECL_BUILT_IN_CLASS(NODE) \ | |
3111 | (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) | |
c2f7fa15 | 3112 | |
820cc88f DB |
3113 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. |
3114 | VAR_DECL and PARM_DECL reserve the arguments slot for language-specific | |
3115 | uses. */ | |
3116 | #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments) | |
046a69e0 | 3117 | #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments) |
8da1b058 | 3118 | |
820cc88f DB |
3119 | /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the |
3120 | arguments/result/saved_tree fields by front ends. It was either inherit | |
3121 | FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL, | |
3122 | which seemed a bit strange. */ | |
8da1b058 | 3123 | |
820cc88f DB |
3124 | struct tree_function_decl GTY(()) |
3125 | { | |
3126 | struct tree_decl_non_common common; | |
0ac11108 | 3127 | |
2c5f4139 JM |
3128 | unsigned static_ctor_flag : 1; |
3129 | unsigned static_dtor_flag : 1; | |
820cc88f DB |
3130 | unsigned uninlinable : 1; |
3131 | unsigned possibly_inlined : 1; | |
3132 | unsigned novops_flag : 1; | |
3133 | unsigned returns_twice_flag : 1; | |
9df2c88c | 3134 | unsigned malloc_flag : 1; |
2bf105ab | 3135 | unsigned pure_flag : 1; |
0ac11108 | 3136 | |
b3c3af2f | 3137 | unsigned declared_inline_flag : 1; |
820cc88f DB |
3138 | unsigned regdecl_flag : 1; |
3139 | unsigned inline_flag : 1; | |
3140 | unsigned no_instrument_function_entry_exit : 1; | |
3141 | unsigned no_limit_stack : 1; | |
3142 | ENUM_BITFIELD(built_in_class) built_in_class : 2; | |
9df2c88c | 3143 | |
820cc88f DB |
3144 | struct function *f; |
3145 | }; | |
8da1b058 | 3146 | |
820cc88f DB |
3147 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
3148 | #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result) | |
c2f7fa15 | 3149 | |
820cc88f DB |
3150 | /* In a TYPE_DECL nonzero means the detail info about this type is not dumped |
3151 | into stabs. Instead it will generate cross reference ('x') of names. | |
3152 | This uses the same flag as DECL_EXTERNAL. */ | |
3153 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ | |
3154 | (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2) | |
6de9cd9a | 3155 | |
820cc88f DB |
3156 | struct tree_type_decl GTY(()) |
3157 | { | |
3158 | struct tree_decl_non_common common; | |
09f532c9 | 3159 | |
8da1b058 | 3160 | }; |
6de9cd9a DN |
3161 | \f |
3162 | /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. | |
3163 | To reduce overhead, the nodes containing the statements are not trees. | |
3164 | This avoids the overhead of tree_common on all linked list elements. | |
3165 | ||
3166 | Use the interface in tree-iterator.h to access this node. */ | |
3167 | ||
3168 | #define STATEMENT_LIST_HEAD(NODE) \ | |
3169 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) | |
3170 | #define STATEMENT_LIST_TAIL(NODE) \ | |
3171 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) | |
3172 | ||
3173 | struct tree_statement_list_node | |
3174 | GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) | |
3175 | { | |
3176 | struct tree_statement_list_node *prev; | |
3177 | struct tree_statement_list_node *next; | |
3178 | tree stmt; | |
3179 | }; | |
3180 | ||
3181 | struct tree_statement_list | |
3182 | GTY(()) | |
3183 | { | |
3184 | struct tree_common common; | |
3185 | struct tree_statement_list_node *head; | |
3186 | struct tree_statement_list_node *tail; | |
3187 | }; | |
33c94679 DN |
3188 | |
3189 | #define VALUE_HANDLE_ID(NODE) \ | |
3190 | (VALUE_HANDLE_CHECK (NODE)->value_handle.id) | |
3191 | ||
3192 | #define VALUE_HANDLE_EXPR_SET(NODE) \ | |
3193 | (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set) | |
3194 | ||
c90186eb DB |
3195 | #define VALUE_HANDLE_VUSES(NODE) \ |
3196 | (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses) | |
3197 | ||
33c94679 | 3198 | /* Defined and used in tree-ssa-pre.c. */ |
33c94679 DN |
3199 | |
3200 | struct tree_value_handle GTY(()) | |
3201 | { | |
3202 | struct tree_common common; | |
3203 | ||
3204 | /* The set of expressions represented by this handle. */ | |
83737db2 | 3205 | struct bitmap_set * GTY ((skip)) expr_set; |
33c94679 DN |
3206 | |
3207 | /* Unique ID for this value handle. IDs are handed out in a | |
3208 | conveniently dense form starting at 0, so that we can make | |
8c27b7d4 | 3209 | bitmaps of value handles. */ |
33c94679 | 3210 | unsigned int id; |
c90186eb DB |
3211 | |
3212 | /* Set of virtual uses represented by this handle. */ | |
3213 | VEC (tree, gc) *vuses; | |
33c94679 | 3214 | }; |
8da1b058 RS |
3215 | \f |
3216 | /* Define the overall contents of a tree node. | |
3217 | It may be any of the structures declared above | |
3218 | for various types of node. */ | |
3219 | ||
e2500fed GK |
3220 | union tree_node GTY ((ptr_alias (union lang_tree_node), |
3221 | desc ("tree_node_structure (&%h)"))) | |
8da1b058 | 3222 | { |
07beea0d | 3223 | struct tree_base GTY ((tag ("TS_BASE"))) base; |
e2500fed GK |
3224 | struct tree_common GTY ((tag ("TS_COMMON"))) common; |
3225 | struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; | |
3226 | struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; | |
3227 | struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; | |
3228 | struct tree_string GTY ((tag ("TS_STRING"))) string; | |
3229 | struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; | |
3230 | struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; | |
820cc88f DB |
3231 | struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal; |
3232 | struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common; | |
3233 | struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl; | |
3234 | struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common; | |
3235 | struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl; | |
3236 | struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis; | |
3237 | struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl; | |
3238 | struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl; | |
3239 | struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl; | |
3240 | struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl; | |
3241 | struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl; | |
3242 | struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl; | |
3243 | struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl; | |
e2500fed GK |
3244 | struct tree_type GTY ((tag ("TS_TYPE"))) type; |
3245 | struct tree_list GTY ((tag ("TS_LIST"))) list; | |
3246 | struct tree_vec GTY ((tag ("TS_VEC"))) vec; | |
3247 | struct tree_exp GTY ((tag ("TS_EXP"))) exp; | |
6de9cd9a DN |
3248 | struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; |
3249 | struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi; | |
e2500fed | 3250 | struct tree_block GTY ((tag ("TS_BLOCK"))) block; |
95b4aca6 | 3251 | struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; |
6de9cd9a | 3252 | struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; |
07beea0d | 3253 | struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt; |
33c94679 | 3254 | struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle; |
4038c495 | 3255 | struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor; |
326eda4b | 3256 | struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag; |
0ac11108 | 3257 | struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft; |
aaf46ef9 | 3258 | struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause; |
6de9cd9a | 3259 | }; |
1d2a8985 | 3260 | \f |
81b3411c BS |
3261 | /* Standard named or nameless data types of the C compiler. */ |
3262 | ||
3263 | enum tree_index | |
3264 | { | |
3265 | TI_ERROR_MARK, | |
3266 | TI_INTQI_TYPE, | |
3267 | TI_INTHI_TYPE, | |
3268 | TI_INTSI_TYPE, | |
3269 | TI_INTDI_TYPE, | |
3270 | TI_INTTI_TYPE, | |
3271 | ||
3272 | TI_UINTQI_TYPE, | |
3273 | TI_UINTHI_TYPE, | |
3274 | TI_UINTSI_TYPE, | |
3275 | TI_UINTDI_TYPE, | |
3276 | TI_UINTTI_TYPE, | |
41077ce4 | 3277 | |
167fa32c EC |
3278 | TI_UINT32_TYPE, |
3279 | TI_UINT64_TYPE, | |
3280 | ||
81b3411c BS |
3281 | TI_INTEGER_ZERO, |
3282 | TI_INTEGER_ONE, | |
f2d1f0ba | 3283 | TI_INTEGER_MINUS_ONE, |
81b3411c BS |
3284 | TI_NULL_POINTER, |
3285 | ||
3286 | TI_SIZE_ZERO, | |
3287 | TI_SIZE_ONE, | |
770ae6cc RK |
3288 | |
3289 | TI_BITSIZE_ZERO, | |
3290 | TI_BITSIZE_ONE, | |
3291 | TI_BITSIZE_UNIT, | |
3292 | ||
5a98fa7b MM |
3293 | TI_PUBLIC, |
3294 | TI_PROTECTED, | |
3295 | TI_PRIVATE, | |
3296 | ||
de7df9eb JM |
3297 | TI_BOOLEAN_FALSE, |
3298 | TI_BOOLEAN_TRUE, | |
3299 | ||
81b3411c BS |
3300 | TI_COMPLEX_INTEGER_TYPE, |
3301 | TI_COMPLEX_FLOAT_TYPE, | |
3302 | TI_COMPLEX_DOUBLE_TYPE, | |
3303 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
3304 | ||
3305 | TI_FLOAT_TYPE, | |
3306 | TI_DOUBLE_TYPE, | |
3307 | TI_LONG_DOUBLE_TYPE, | |
3308 | ||
a2a919aa KG |
3309 | TI_FLOAT_PTR_TYPE, |
3310 | TI_DOUBLE_PTR_TYPE, | |
3311 | TI_LONG_DOUBLE_PTR_TYPE, | |
3312 | TI_INTEGER_PTR_TYPE, | |
3313 | ||
81b3411c BS |
3314 | TI_VOID_TYPE, |
3315 | TI_PTR_TYPE, | |
3316 | TI_CONST_PTR_TYPE, | |
c9f8536c | 3317 | TI_SIZE_TYPE, |
d1c38823 | 3318 | TI_PID_TYPE, |
81b3411c BS |
3319 | TI_PTRDIFF_TYPE, |
3320 | TI_VA_LIST_TYPE, | |
9d30f3c1 JJ |
3321 | TI_VA_LIST_GPR_COUNTER_FIELD, |
3322 | TI_VA_LIST_FPR_COUNTER_FIELD, | |
de7df9eb | 3323 | TI_BOOLEAN_TYPE, |
498c0f27 | 3324 | TI_FILEPTR_TYPE, |
81b3411c | 3325 | |
9a8ce21f JG |
3326 | TI_DFLOAT32_TYPE, |
3327 | TI_DFLOAT64_TYPE, | |
3328 | TI_DFLOAT128_TYPE, | |
3329 | TI_DFLOAT32_PTR_TYPE, | |
3330 | TI_DFLOAT64_PTR_TYPE, | |
3331 | TI_DFLOAT128_PTR_TYPE, | |
3332 | ||
cbd5937a MM |
3333 | TI_VOID_LIST_NODE, |
3334 | ||
5b47282c GM |
3335 | TI_MAIN_IDENTIFIER, |
3336 | ||
81b3411c BS |
3337 | TI_MAX |
3338 | }; | |
3339 | ||
e2500fed | 3340 | extern GTY(()) tree global_trees[TI_MAX]; |
81b3411c BS |
3341 | |
3342 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
41077ce4 | 3343 | |
81b3411c BS |
3344 | #define intQI_type_node global_trees[TI_INTQI_TYPE] |
3345 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
3346 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
3347 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
3348 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
3349 | ||
3350 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
3351 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
3352 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
3353 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
3354 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
3355 | ||
167fa32c EC |
3356 | #define uint32_type_node global_trees[TI_UINT32_TYPE] |
3357 | #define uint64_type_node global_trees[TI_UINT64_TYPE] | |
3358 | ||
81b3411c BS |
3359 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
3360 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
f2d1f0ba | 3361 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
81b3411c BS |
3362 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
3363 | #define size_one_node global_trees[TI_SIZE_ONE] | |
770ae6cc RK |
3364 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
3365 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
3366 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
3367 | ||
dbbf88d1 | 3368 | /* Base access nodes. */ |
5a98fa7b MM |
3369 | #define access_public_node global_trees[TI_PUBLIC] |
3370 | #define access_protected_node global_trees[TI_PROTECTED] | |
3371 | #define access_private_node global_trees[TI_PRIVATE] | |
dbbf88d1 | 3372 | |
81b3411c BS |
3373 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
3374 | ||
3375 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
3376 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
3377 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
3378 | ||
a2a919aa KG |
3379 | #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] |
3380 | #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] | |
3381 | #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] | |
3382 | #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] | |
3383 | ||
81b3411c BS |
3384 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] |
3385 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
3386 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
3387 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
3388 | ||
3389 | #define void_type_node global_trees[TI_VOID_TYPE] | |
fc693822 | 3390 | /* The C type `void *'. */ |
81b3411c | 3391 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
fc693822 | 3392 | /* The C type `const void *'. */ |
81b3411c | 3393 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
c9f8536c MM |
3394 | /* The C type `size_t'. */ |
3395 | #define size_type_node global_trees[TI_SIZE_TYPE] | |
d1c38823 | 3396 | #define pid_type_node global_trees[TI_PID_TYPE] |
81b3411c BS |
3397 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] |
3398 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
9d30f3c1 JJ |
3399 | #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] |
3400 | #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] | |
498c0f27 JJ |
3401 | /* The C type `FILE *'. */ |
3402 | #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] | |
7145ef21 | 3403 | |
de7df9eb JM |
3404 | #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] |
3405 | #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] | |
3406 | #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] | |
3407 | ||
9a8ce21f JG |
3408 | /* The decimal floating point types. */ |
3409 | #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] | |
3410 | #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] | |
3411 | #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] | |
3412 | #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] | |
3413 | #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] | |
3414 | #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] | |
3415 | ||
cbd5937a MM |
3416 | /* The node that should be placed at the end of a parameter list to |
3417 | indicate that the function does not take a variable number of | |
3418 | arguments. The TREE_VALUE will be void_type_node and there will be | |
3419 | no TREE_CHAIN. Language-independent code should not assume | |
3420 | anything else about this node. */ | |
3421 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
3422 | ||
5b47282c GM |
3423 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
3424 | #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
3425 | ||
7145ef21 | 3426 | /* An enumeration of the standard C integer types. These must be |
ceeedfc1 NB |
3427 | ordered so that shorter types appear before longer ones, and so |
3428 | that signed types appear before unsigned ones, for the correct | |
3429 | functioning of interpret_integer() in c-lex.c. */ | |
41077ce4 | 3430 | enum integer_type_kind |
7145ef21 MM |
3431 | { |
3432 | itk_char, | |
3433 | itk_signed_char, | |
3434 | itk_unsigned_char, | |
3435 | itk_short, | |
3436 | itk_unsigned_short, | |
3437 | itk_int, | |
3438 | itk_unsigned_int, | |
3439 | itk_long, | |
3440 | itk_unsigned_long, | |
3441 | itk_long_long, | |
3442 | itk_unsigned_long_long, | |
3443 | itk_none | |
3444 | }; | |
3445 | ||
3446 | typedef enum integer_type_kind integer_type_kind; | |
3447 | ||
3448 | /* The standard C integer types. Use integer_type_kind to index into | |
3449 | this array. */ | |
e2500fed | 3450 | extern GTY(()) tree integer_types[itk_none]; |
7145ef21 MM |
3451 | |
3452 | #define char_type_node integer_types[itk_char] | |
3453 | #define signed_char_type_node integer_types[itk_signed_char] | |
3454 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
3455 | #define short_integer_type_node integer_types[itk_short] | |
3456 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
3457 | #define integer_type_node integer_types[itk_int] | |
3458 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
3459 | #define long_integer_type_node integer_types[itk_long] | |
3460 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
3461 | #define long_long_integer_type_node integer_types[itk_long_long] | |
3462 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
dce81a1a JJ |
3463 | \f |
3464 | /* Set to the default thread-local storage (tls) model to use. */ | |
3465 | ||
dce81a1a | 3466 | extern enum tls_model flag_tls_default; |
25fdb4dc | 3467 | |
81b3411c | 3468 | \f |
f963b5d9 RS |
3469 | /* A pointer-to-function member type looks like: |
3470 | ||
3471 | struct { | |
3472 | __P __pfn; | |
3473 | ptrdiff_t __delta; | |
3474 | }; | |
3475 | ||
3476 | If __pfn is NULL, it is a NULL pointer-to-member-function. | |
3477 | ||
3478 | (Because the vtable is always the first thing in the object, we | |
3479 | don't need its offset.) If the function is virtual, then PFN is | |
3480 | one plus twice the index into the vtable; otherwise, it is just a | |
3481 | pointer to the function. | |
3482 | ||
3483 | Unfortunately, using the lowest bit of PFN doesn't work in | |
3484 | architectures that don't impose alignment requirements on function | |
3485 | addresses, or that use the lowest bit to tell one ISA from another, | |
3486 | for example. For such architectures, we use the lowest bit of | |
3487 | DELTA instead of the lowest bit of the PFN, and DELTA will be | |
3488 | multiplied by 2. */ | |
3489 | ||
3490 | enum ptrmemfunc_vbit_where_t | |
3491 | { | |
3492 | ptrmemfunc_vbit_in_pfn, | |
3493 | ptrmemfunc_vbit_in_delta | |
3494 | }; | |
3495 | \f | |
f837a861 MM |
3496 | #define NULL_TREE (tree) NULL |
3497 | ||
46c5ad27 | 3498 | extern tree decl_assembler_name (tree); |
8a4a83ed | 3499 | extern bool decl_assembler_name_equal (tree decl, tree asmname); |
8da1b058 | 3500 | |
c5620996 GK |
3501 | /* Compute the number of bytes occupied by 'node'. This routine only |
3502 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
3503 | ||
46c5ad27 | 3504 | extern size_t tree_size (tree); |
c5620996 | 3505 | |
a38b644b ZW |
3506 | /* Compute the number of bytes occupied by a tree with code CODE. This |
3507 | function cannot be used for TREE_VEC or PHI_NODE codes, which are of | |
3508 | variable length. */ | |
3509 | extern size_t tree_code_size (enum tree_code); | |
3510 | ||
8da1b058 RS |
3511 | /* Lowest level primitive for allocating a node. |
3512 | The TREE_CODE is the only argument. Contents are initialized | |
3513 | to zero except for a few of the common fields. */ | |
3514 | ||
b9dcdee4 JH |
3515 | extern tree make_node_stat (enum tree_code MEM_STAT_DECL); |
3516 | #define make_node(t) make_node_stat (t MEM_STAT_INFO) | |
8da1b058 | 3517 | |
1b70d38a | 3518 | /* Make a copy of a node, with all the same contents. */ |
8da1b058 | 3519 | |
b9dcdee4 JH |
3520 | extern tree copy_node_stat (tree MEM_STAT_DECL); |
3521 | #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) | |
8da1b058 RS |
3522 | |
3523 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
3524 | ||
46c5ad27 | 3525 | extern tree copy_list (tree); |
8da1b058 | 3526 | |
95b4aca6 NS |
3527 | /* Make a BINFO. */ |
3528 | extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); | |
3529 | #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) | |
3530 | ||
8da1b058 RS |
3531 | /* Make a TREE_VEC. */ |
3532 | ||
b9dcdee4 JH |
3533 | extern tree make_tree_vec_stat (int MEM_STAT_DECL); |
3534 | #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) | |
8da1b058 | 3535 | |
6de9cd9a DN |
3536 | /* Tree nodes for SSA analysis. */ |
3537 | ||
6de9cd9a DN |
3538 | extern void init_phinodes (void); |
3539 | extern void fini_phinodes (void); | |
3540 | extern void release_phi_node (tree); | |
3541 | #ifdef GATHER_STATISTICS | |
3542 | extern void phinodes_print_statistics (void); | |
3543 | #endif | |
3544 | ||
3545 | extern void init_ssanames (void); | |
3546 | extern void fini_ssanames (void); | |
3547 | extern tree make_ssa_name (tree, tree); | |
d7621d3c | 3548 | extern tree duplicate_ssa_name (tree, tree); |
8bb46326 | 3549 | extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *); |
6de9cd9a | 3550 | extern void release_ssa_name (tree); |
53b4bf74 | 3551 | extern void release_defs (tree); |
bbc630f5 | 3552 | extern void replace_ssa_name_symbol (tree, tree); |
53b4bf74 | 3553 | |
6de9cd9a DN |
3554 | #ifdef GATHER_STATISTICS |
3555 | extern void ssanames_print_statistics (void); | |
3556 | #endif | |
3557 | ||
8da1b058 RS |
3558 | /* Return the (unique) IDENTIFIER_NODE node for a given name. |
3559 | The name is supplied as a char *. */ | |
3560 | ||
46c5ad27 | 3561 | extern tree get_identifier (const char *); |
8da1b058 | 3562 | |
7bb3fbbb RS |
3563 | #if GCC_VERSION >= 3000 |
3564 | #define get_identifier(str) \ | |
3565 | (__builtin_constant_p (str) \ | |
3566 | ? get_identifier_with_length ((str), strlen (str)) \ | |
3567 | : get_identifier (str)) | |
3568 | #endif | |
3569 | ||
3570 | ||
4bad9e39 APB |
3571 | /* Identical to get_identifier, except that the length is assumed |
3572 | known. */ | |
3573 | ||
7bb3fbbb | 3574 | extern tree get_identifier_with_length (const char *, size_t); |
4bad9e39 | 3575 | |
6b9300aa RK |
3576 | /* If an identifier with the name TEXT (a null-terminated string) has |
3577 | previously been referred to, return that node; otherwise return | |
3578 | NULL_TREE. */ | |
3579 | ||
46c5ad27 | 3580 | extern tree maybe_get_identifier (const char *); |
6b9300aa | 3581 | |
8da1b058 RS |
3582 | /* Construct various types of nodes. */ |
3583 | ||
46c5ad27 AJ |
3584 | extern tree build_nt (enum tree_code, ...); |
3585 | ||
b9dcdee4 JH |
3586 | extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); |
3587 | #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) | |
3588 | extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
3589 | #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) | |
3590 | extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
3591 | #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) | |
07beea0d AH |
3592 | extern tree build2_gimple_stat (enum tree_code, tree, tree MEM_STAT_DECL); |
3593 | #define build2_gimple(c,t1,t2) build2_gimple_stat (c,t1,t2 MEM_STAT_INFO) | |
b9dcdee4 JH |
3594 | extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); |
3595 | #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) | |
3596 | extern tree build4_stat (enum tree_code, tree, tree, tree, tree, | |
3597 | tree MEM_STAT_DECL); | |
3598 | #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
953ff289 DN |
3599 | extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree, |
3600 | tree MEM_STAT_DECL); | |
3601 | #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) | |
ac182688 ZD |
3602 | extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree, |
3603 | tree, tree, tree MEM_STAT_DECL); | |
3604 | #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \ | |
3605 | build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO) | |
4221057e | 3606 | |
7d60be94 | 3607 | extern tree build_int_cst (tree, HOST_WIDE_INT); |
8b11a64c | 3608 | extern tree build_int_cst_type (tree, HOST_WIDE_INT); |
7d60be94 NS |
3609 | extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT); |
3610 | extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); | |
46c5ad27 | 3611 | extern tree build_vector (tree, tree); |
4038c495 GB |
3612 | extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *); |
3613 | extern tree build_constructor (tree, VEC(constructor_elt,gc) *); | |
3614 | extern tree build_constructor_single (tree, tree, tree); | |
3615 | extern tree build_constructor_from_list (tree, tree); | |
46c5ad27 AJ |
3616 | extern tree build_real_from_int_cst (tree, tree); |
3617 | extern tree build_complex (tree, tree, tree); | |
bfabddb6 | 3618 | extern tree build_one_cst (tree); |
46c5ad27 | 3619 | extern tree build_string (int, const char *); |
b9dcdee4 JH |
3620 | extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); |
3621 | #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) | |
3622 | extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
0ac11108 | 3623 | extern tree build_fn_decl (const char *, tree); |
b9dcdee4 | 3624 | #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO) |
22e8617b | 3625 | extern tree build_block (tree, tree, tree, tree); |
c1667470 | 3626 | #ifndef USE_MAPPED_LOCATION |
6de9cd9a DN |
3627 | extern void annotate_with_file_line (tree, const char *, int); |
3628 | extern void annotate_with_locus (tree, location_t); | |
c1667470 | 3629 | #endif |
6de9cd9a | 3630 | extern tree build_empty_stmt (void); |
aaf46ef9 | 3631 | extern tree build_omp_clause (enum omp_clause_code); |
8da1b058 RS |
3632 | |
3633 | /* Construct various nodes representing data types. */ | |
3634 | ||
46c5ad27 AJ |
3635 | extern tree make_signed_type (int); |
3636 | extern tree make_unsigned_type (int); | |
2f4675b4 | 3637 | extern tree signed_type_for (tree); |
8b11a64c | 3638 | extern tree unsigned_type_for (tree); |
8c1d6d62 | 3639 | extern void initialize_sizetypes (bool); |
46c5ad27 AJ |
3640 | extern void set_sizetype (tree); |
3641 | extern void fixup_unsigned_type (tree); | |
22421b79 | 3642 | extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); |
46c5ad27 | 3643 | extern tree build_pointer_type (tree); |
22421b79 | 3644 | extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); |
46c5ad27 | 3645 | extern tree build_reference_type (tree); |
4a5eab38 PB |
3646 | extern tree build_vector_type_for_mode (tree, enum machine_mode); |
3647 | extern tree build_vector_type (tree innertype, int nunits); | |
46c5ad27 AJ |
3648 | extern tree build_type_no_quals (tree); |
3649 | extern tree build_index_type (tree); | |
3650 | extern tree build_index_2_type (tree, tree); | |
3651 | extern tree build_array_type (tree, tree); | |
3652 | extern tree build_function_type (tree, tree); | |
3653 | extern tree build_function_type_list (tree, ...); | |
43dc123f | 3654 | extern tree build_method_type_directly (tree, tree, tree); |
46c5ad27 AJ |
3655 | extern tree build_method_type (tree, tree); |
3656 | extern tree build_offset_type (tree, tree); | |
3657 | extern tree build_complex_type (tree); | |
b4660e5a | 3658 | extern tree build_resx (int); |
46c5ad27 | 3659 | extern tree array_type_nelts (tree); |
a7e5372d | 3660 | extern bool in_array_bounds_p (tree); |
11fc4275 | 3661 | extern bool range_in_array_bounds_p (tree); |
46c5ad27 AJ |
3662 | |
3663 | extern tree value_member (tree, tree); | |
3664 | extern tree purpose_member (tree, tree); | |
fd917e0d | 3665 | |
46c5ad27 AJ |
3666 | extern int attribute_list_equal (tree, tree); |
3667 | extern int attribute_list_contained (tree, tree); | |
3668 | extern int tree_int_cst_equal (tree, tree); | |
3669 | extern int tree_int_cst_lt (tree, tree); | |
3670 | extern int tree_int_cst_compare (tree, tree); | |
3671 | extern int host_integerp (tree, int); | |
3672 | extern HOST_WIDE_INT tree_low_cst (tree, int); | |
3673 | extern int tree_int_cst_msb (tree); | |
3674 | extern int tree_int_cst_sgn (tree); | |
d7bf3bcf | 3675 | extern int tree_int_cst_sign_bit (tree); |
682d0395 | 3676 | extern bool tree_expr_nonnegative_p (tree); |
82b85a85 | 3677 | extern bool may_negate_without_overflow_p (tree); |
46c5ad27 | 3678 | extern tree get_inner_array_type (tree); |
12cfc830 | 3679 | |
f837a861 MM |
3680 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
3681 | put the prototype here. Rtl.h does declare the prototype if | |
3682 | tree.h had been included. */ | |
3683 | ||
46c5ad27 | 3684 | extern tree make_tree (tree, rtx); |
8da1b058 | 3685 | \f |
bad1b4ba RK |
3686 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
3687 | is ATTRIBUTE. | |
3688 | ||
3689 | Such modified types already made are recorded so that duplicates | |
2ba84f36 | 3690 | are not made. */ |
bad1b4ba | 3691 | |
46c5ad27 AJ |
3692 | extern tree build_type_attribute_variant (tree, tree); |
3693 | extern tree build_decl_attribute_variant (tree, tree); | |
bad1b4ba | 3694 | |
91d231cb JM |
3695 | /* Structure describing an attribute and a function to handle it. */ |
3696 | struct attribute_spec | |
3697 | { | |
3698 | /* The name of the attribute (without any leading or trailing __), | |
3699 | or NULL to mark the end of a table of attributes. */ | |
8b60264b | 3700 | const char *const name; |
91d231cb | 3701 | /* The minimum length of the list of arguments of the attribute. */ |
8b60264b | 3702 | const int min_length; |
91d231cb JM |
3703 | /* The maximum length of the list of arguments of the attribute |
3704 | (-1 for no maximum). */ | |
8b60264b | 3705 | const int max_length; |
91d231cb JM |
3706 | /* Whether this attribute requires a DECL. If it does, it will be passed |
3707 | from types of DECLs, function return types and array element types to | |
3708 | the DECLs, function types and array types respectively; but when | |
3709 | applied to a type in any other circumstances, it will be ignored with | |
3710 | a warning. (If greater control is desired for a given attribute, | |
3711 | this should be false, and the flags argument to the handler may be | |
3712 | used to gain greater control in that case.) */ | |
8b60264b | 3713 | const bool decl_required; |
91d231cb JM |
3714 | /* Whether this attribute requires a type. If it does, it will be passed |
3715 | from a DECL to the type of that DECL. */ | |
8b60264b | 3716 | const bool type_required; |
91d231cb JM |
3717 | /* Whether this attribute requires a function (or method) type. If it does, |
3718 | it will be passed from a function pointer type to the target type, | |
3719 | and from a function return type (which is not itself a function | |
3720 | pointer type) to the function type. */ | |
8b60264b | 3721 | const bool function_type_required; |
91d231cb JM |
3722 | /* Function to handle this attribute. NODE points to the node to which |
3723 | the attribute is to be applied. If a DECL, it should be modified in | |
3724 | place; if a TYPE, a copy should be created. NAME is the name of the | |
3725 | attribute (possibly with leading or trailing __). ARGS is the TREE_LIST | |
3726 | of the arguments (which may be NULL). FLAGS gives further information | |
3727 | about the context of the attribute. Afterwards, the attributes will | |
3728 | be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, | |
3729 | unless *NO_ADD_ATTRS is set to true (which should be done on error, | |
3730 | as well as in any other cases when the attributes should not be added | |
3731 | to the DECL or TYPE). Depending on FLAGS, any attributes to be | |
3732 | applied to another type or DECL later may be returned; | |
3733 | otherwise the return value should be NULL_TREE. This pointer may be | |
3734 | NULL if no special handling is required beyond the checks implied | |
3735 | by the rest of this structure. */ | |
46c5ad27 AJ |
3736 | tree (*const handler) (tree *node, tree name, tree args, |
3737 | int flags, bool *no_add_attrs); | |
91d231cb JM |
3738 | }; |
3739 | ||
91d231cb JM |
3740 | /* Flags that may be passed in the third argument of decl_attributes, and |
3741 | to handler functions for attributes. */ | |
3742 | enum attribute_flags | |
3743 | { | |
3744 | /* The type passed in is the type of a DECL, and any attributes that | |
3745 | should be passed in again to be applied to the DECL rather than the | |
3746 | type should be returned. */ | |
3747 | ATTR_FLAG_DECL_NEXT = 1, | |
3748 | /* The type passed in is a function return type, and any attributes that | |
3749 | should be passed in again to be applied to the function type rather | |
3750 | than the return type should be returned. */ | |
3751 | ATTR_FLAG_FUNCTION_NEXT = 2, | |
3752 | /* The type passed in is an array element type, and any attributes that | |
3753 | should be passed in again to be applied to the array type rather | |
3754 | than the element type should be returned. */ | |
3755 | ATTR_FLAG_ARRAY_NEXT = 4, | |
3756 | /* The type passed in is a structure, union or enumeration type being | |
3757 | created, and should be modified in place. */ | |
6431177a JM |
3758 | ATTR_FLAG_TYPE_IN_PLACE = 8, |
3759 | /* The attributes are being applied by default to a library function whose | |
3760 | name indicates known behavior, and should be silently ignored if they | |
3761 | are not in fact compatible with the function type. */ | |
3762 | ATTR_FLAG_BUILT_IN = 16 | |
91d231cb JM |
3763 | }; |
3764 | ||
501990bb NB |
3765 | /* Default versions of target-overridable functions. */ |
3766 | ||
46c5ad27 AJ |
3767 | extern tree merge_decl_attributes (tree, tree); |
3768 | extern tree merge_type_attributes (tree, tree); | |
d9525bec | 3769 | |
0e9e1e0a | 3770 | /* Given a tree node and a string, return nonzero if the tree node is |
9c130398 DE |
3771 | a valid attribute name for the string. */ |
3772 | ||
46c5ad27 | 3773 | extern int is_attribute_p (const char *, tree); |
9c130398 DE |
3774 | |
3775 | /* Given an attribute name and a list of attributes, return the list element | |
3776 | of the attribute or NULL_TREE if not found. */ | |
3777 | ||
46c5ad27 | 3778 | extern tree lookup_attribute (const char *, tree); |
6cb3d314 | 3779 | |
b70f0f48 JM |
3780 | /* Remove any instances of attribute ATTR_NAME in LIST and return the |
3781 | modified list. */ | |
3782 | ||
3783 | extern tree remove_attribute (const char *, tree); | |
3784 | ||
6cb3d314 DE |
3785 | /* Given two attributes lists, return a list of their union. */ |
3786 | ||
46c5ad27 | 3787 | extern tree merge_attributes (tree, tree); |
9c130398 | 3788 | |
b2ca3702 | 3789 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
672a6f42 NB |
3790 | /* Given two Windows decl attributes lists, possibly including |
3791 | dllimport, return a list of their union . */ | |
46c5ad27 | 3792 | extern tree merge_dllimport_decl_attributes (tree, tree); |
b2ca3702 MM |
3793 | |
3794 | /* Handle a "dllimport" or "dllexport" attribute. */ | |
3795 | extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); | |
672a6f42 NB |
3796 | #endif |
3797 | ||
896c3aa3 JM |
3798 | /* Check whether CAND is suitable to be returned from get_qualified_type |
3799 | (BASE, TYPE_QUALS). */ | |
3800 | ||
3801 | extern bool check_qualified_type (tree, tree, int); | |
3802 | ||
5101b304 MM |
3803 | /* Return a version of the TYPE, qualified as indicated by the |
3804 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
3805 | return NULL_TREE. */ | |
3806 | ||
46c5ad27 | 3807 | extern tree get_qualified_type (tree, int); |
5101b304 MM |
3808 | |
3809 | /* Like get_qualified_type, but creates the type if it does not | |
3810 | exist. This function never returns NULL_TREE. */ | |
3932261a | 3811 | |
46c5ad27 | 3812 | extern tree build_qualified_type (tree, int); |
3932261a MM |
3813 | |
3814 | /* Like build_qualified_type, but only deals with the `const' and | |
3815 | `volatile' qualifiers. This interface is retained for backwards | |
14b493d6 | 3816 | compatibility with the various front-ends; new code should use |
3932261a | 3817 | build_qualified_type instead. */ |
8da1b058 | 3818 | |
3932261a | 3819 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
b9daac31 | 3820 | build_qualified_type ((TYPE), \ |
3932261a MM |
3821 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ |
3822 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
8da1b058 | 3823 | |
43100b14 RS |
3824 | /* Make a copy of a type node. */ |
3825 | ||
8dd16ecc NS |
3826 | extern tree build_distinct_type_copy (tree); |
3827 | extern tree build_variant_type_copy (tree); | |
43100b14 | 3828 | |
4977bab6 | 3829 | /* Finish up a builtin RECORD_TYPE. Give it a name and provide its |
86df8c86 | 3830 | fields. Optionally specify an alignment, and then lay it out. */ |
4977bab6 | 3831 | |
46c5ad27 AJ |
3832 | extern void finish_builtin_struct (tree, const char *, |
3833 | tree, tree); | |
4977bab6 | 3834 | |
8da1b058 | 3835 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
9328904c MM |
3836 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
3837 | node, does nothing except for the first time. */ | |
8da1b058 | 3838 | |
46c5ad27 | 3839 | extern void layout_type (tree); |
8da1b058 | 3840 | |
9328904c MM |
3841 | /* These functions allow a front-end to perform a manual layout of a |
3842 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
3843 | depends on the placement of fields so far.) Begin by calling | |
770ae6cc | 3844 | start_record_layout. Then, call place_field for each of the |
9328904c MM |
3845 | fields. Then, call finish_record_layout. See layout_type for the |
3846 | default way in which these functions are used. */ | |
3847 | ||
defd0dea | 3848 | typedef struct record_layout_info_s |
9328904c MM |
3849 | { |
3850 | /* The RECORD_TYPE that we are laying out. */ | |
3851 | tree t; | |
770ae6cc RK |
3852 | /* The offset into the record so far, in bytes, not including bits in |
3853 | BITPOS. */ | |
3854 | tree offset; | |
3855 | /* The last known alignment of SIZE. */ | |
3856 | unsigned int offset_align; | |
3857 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
3858 | tree bitpos; | |
9328904c MM |
3859 | /* The alignment of the record so far, in bits. */ |
3860 | unsigned int record_align; | |
78d55cc8 JM |
3861 | /* The alignment of the record so far, ignoring #pragma pack and |
3862 | __attribute__ ((packed)), in bits. */ | |
770ae6cc | 3863 | unsigned int unpacked_align; |
f913c102 AO |
3864 | /* The previous field layed out. */ |
3865 | tree prev_field; | |
9328904c MM |
3866 | /* The static variables (i.e., class variables, as opposed to |
3867 | instance variables) encountered in T. */ | |
3868 | tree pending_statics; | |
e4850f36 DR |
3869 | /* Bits remaining in the current alignment group */ |
3870 | int remaining_in_alignment; | |
78d55cc8 JM |
3871 | /* True if we've seen a packed field that didn't have normal |
3872 | alignment anyway. */ | |
9328904c | 3873 | int packed_maybe_necessary; |
770ae6cc | 3874 | } *record_layout_info; |
9328904c | 3875 | |
46c5ad27 AJ |
3876 | extern void set_lang_adjust_rli (void (*) (record_layout_info)); |
3877 | extern record_layout_info start_record_layout (tree); | |
3878 | extern tree bit_from_pos (tree, tree); | |
3879 | extern tree byte_from_pos (tree, tree); | |
3880 | extern void pos_from_bit (tree *, tree *, unsigned int, tree); | |
3881 | extern void normalize_offset (tree *, tree *, unsigned int); | |
3882 | extern tree rli_size_unit_so_far (record_layout_info); | |
3883 | extern tree rli_size_so_far (record_layout_info); | |
3884 | extern void normalize_rli (record_layout_info); | |
3885 | extern void place_field (record_layout_info, tree); | |
3886 | extern void compute_record_mode (tree); | |
3887 | extern void finish_record_layout (record_layout_info, int); | |
9328904c | 3888 | |
8da1b058 RS |
3889 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
3890 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
3891 | How the hash code is computed is up to the caller, as long as any two | |
3892 | callers that could hash identical-looking type nodes agree. */ | |
3893 | ||
46c5ad27 | 3894 | extern tree type_hash_canon (unsigned int, tree); |
8da1b058 RS |
3895 | |
3896 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
3897 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
3898 | fields. Call this only once for any given decl node. | |
3899 | ||
3900 | Second argument is the boundary that this field can be assumed to | |
3901 | be starting at (in bits). Zero means it can be assumed aligned | |
3902 | on any boundary that may be needed. */ | |
3903 | ||
46c5ad27 | 3904 | extern void layout_decl (tree, unsigned); |
8da1b058 | 3905 | |
d8472c75 JM |
3906 | /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of |
3907 | a previous call to layout_decl and calls it again. */ | |
3908 | ||
3909 | extern void relayout_decl (tree); | |
3910 | ||
72c602fc RK |
3911 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
3912 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
3913 | The value is BLKmode if no other mode is found. This is like | |
3914 | mode_for_size, but is passed a tree. */ | |
3915 | ||
46c5ad27 | 3916 | extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int); |
72c602fc | 3917 | |
8da1b058 RS |
3918 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
3919 | ||
46c5ad27 | 3920 | extern tree non_lvalue (tree); |
46c5ad27 AJ |
3921 | |
3922 | extern tree convert (tree, tree); | |
3923 | extern unsigned int expr_align (tree); | |
3924 | extern tree expr_first (tree); | |
3925 | extern tree expr_last (tree); | |
6de9cd9a | 3926 | extern tree expr_only (tree); |
46c5ad27 AJ |
3927 | extern tree size_in_bytes (tree); |
3928 | extern HOST_WIDE_INT int_size_in_bytes (tree); | |
a441447f | 3929 | extern HOST_WIDE_INT max_int_size_in_bytes (tree); |
46c5ad27 AJ |
3930 | extern tree bit_position (tree); |
3931 | extern HOST_WIDE_INT int_bit_position (tree); | |
3932 | extern tree byte_position (tree); | |
3933 | extern HOST_WIDE_INT int_byte_position (tree); | |
fed3cef0 RK |
3934 | |
3935 | /* Define data structures, macros, and functions for handling sizes | |
3936 | and the various types used to represent sizes. */ | |
3937 | ||
3938 | enum size_type_kind | |
3939 | { | |
2ba84f36 KH |
3940 | SIZETYPE, /* Normal representation of sizes in bytes. */ |
3941 | SSIZETYPE, /* Signed representation of sizes in bytes. */ | |
fed3cef0 RK |
3942 | BITSIZETYPE, /* Normal representation of sizes in bits. */ |
3943 | SBITSIZETYPE, /* Signed representation of sizes in bits. */ | |
fed3cef0 RK |
3944 | TYPE_KIND_LAST}; |
3945 | ||
e2500fed | 3946 | extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; |
fed3cef0 RK |
3947 | |
3948 | #define sizetype sizetype_tab[(int) SIZETYPE] | |
3949 | #define bitsizetype sizetype_tab[(int) BITSIZETYPE] | |
3950 | #define ssizetype sizetype_tab[(int) SSIZETYPE] | |
fed3cef0 | 3951 | #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] |
fed3cef0 | 3952 | |
ce552f75 | 3953 | extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); |
46c5ad27 AJ |
3954 | extern tree size_binop (enum tree_code, tree, tree); |
3955 | extern tree size_diffop (tree, tree); | |
3e95a7cb ZW |
3956 | |
3957 | #define size_int(L) size_int_kind (L, SIZETYPE) | |
3958 | #define ssize_int(L) size_int_kind (L, SSIZETYPE) | |
3959 | #define bitsize_int(L) size_int_kind (L, BITSIZETYPE) | |
3960 | #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE) | |
f8dac6eb | 3961 | |
46c5ad27 AJ |
3962 | extern tree round_up (tree, int); |
3963 | extern tree round_down (tree, int); | |
3964 | extern tree get_pending_sizes (void); | |
46c5ad27 AJ |
3965 | extern void put_pending_size (tree); |
3966 | extern void put_pending_sizes (tree); | |
8da1b058 RS |
3967 | |
3968 | /* Type for sizes of data-type. */ | |
3969 | ||
f8dac6eb R |
3970 | #define BITS_PER_UNIT_LOG \ |
3971 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
3972 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
3973 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
3974 | ||
467cecf3 | 3975 | /* If nonzero, an upper limit on alignment of structure fields, in bits, */ |
729a2125 | 3976 | extern unsigned int maximum_field_alignment; |
8c27b7d4 | 3977 | /* and its original value in bytes, specified via -fpack-struct=<value>. */ |
467cecf3 | 3978 | extern unsigned int initial_max_fld_align; |
8294accf | 3979 | |
8da1b058 RS |
3980 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
3981 | by making the last node in X point to Y. | |
3982 | Returns X, except if X is 0 returns Y. */ | |
3983 | ||
46c5ad27 | 3984 | extern tree chainon (tree, tree); |
8da1b058 RS |
3985 | |
3986 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
3987 | ||
b9dcdee4 JH |
3988 | extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); |
3989 | #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) | |
8da1b058 RS |
3990 | |
3991 | /* Return the last tree node in a chain. */ | |
3992 | ||
46c5ad27 | 3993 | extern tree tree_last (tree); |
8da1b058 RS |
3994 | |
3995 | /* Reverse the order of elements in a chain, and return the new head. */ | |
3996 | ||
46c5ad27 | 3997 | extern tree nreverse (tree); |
8da1b058 RS |
3998 | |
3999 | /* Returns the length of a chain of nodes | |
4000 | (number of chain pointers to follow before reaching a null pointer). */ | |
4001 | ||
46c5ad27 | 4002 | extern int list_length (tree); |
8da1b058 | 4003 | |
c3b247b4 JM |
4004 | /* Returns the number of FIELD_DECLs in a type. */ |
4005 | ||
46c5ad27 | 4006 | extern int fields_length (tree); |
c3b247b4 | 4007 | |
27b41650 KG |
4008 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
4009 | aggregate of zeros. Otherwise return FALSE. */ | |
4010 | ||
46c5ad27 | 4011 | extern bool initializer_zerop (tree); |
27b41650 | 4012 | |
fe24d485 OH |
4013 | /* Examine CTOR to discover: |
4014 | * how many scalar fields are set to nonzero values, | |
4015 | and place it in *P_NZ_ELTS; | |
4016 | * how many scalar fields in total are in CTOR, | |
4017 | and place it in *P_ELT_COUNT. | |
4018 | * if a type is a union, and the initializer from the constructor | |
4019 | is not the largest element in the union, then set *p_must_clear. | |
4020 | ||
4021 | Return whether or not CTOR is a valid static constant initializer, the same | |
4022 | as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */ | |
4023 | ||
4024 | extern bool categorize_ctor_elements (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, | |
4025 | bool *); | |
4026 | ||
73ed17ff | 4027 | extern HOST_WIDE_INT count_type_elements (tree, bool); |
40209195 | 4028 | |
ea4b7848 | 4029 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ |
8da1b058 | 4030 | |
46c5ad27 | 4031 | extern int integer_zerop (tree); |
8da1b058 | 4032 | |
ea4b7848 | 4033 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ |
8da1b058 | 4034 | |
46c5ad27 | 4035 | extern int integer_onep (tree); |
8da1b058 RS |
4036 | |
4037 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
4038 | all of whose significant bits are 1. */ | |
4039 | ||
46c5ad27 | 4040 | extern int integer_all_onesp (tree); |
8da1b058 RS |
4041 | |
4042 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with | |
4043 | exactly one bit 1. */ | |
4044 | ||
46c5ad27 | 4045 | extern int integer_pow2p (tree); |
8da1b058 | 4046 | |
4977bab6 ZW |
4047 | /* integer_nonzerop (tree x) is nonzero if X is an integer constant |
4048 | with a nonzero value. */ | |
4049 | ||
46c5ad27 | 4050 | extern int integer_nonzerop (tree); |
4977bab6 | 4051 | |
8b11a64c ZD |
4052 | extern bool zero_p (tree); |
4053 | extern bool cst_and_fits_in_hwi (tree); | |
ca4c3169 | 4054 | extern tree num_ending_zeros (tree); |
8b11a64c | 4055 | |
525c6bf5 RH |
4056 | /* staticp (tree x) is nonzero if X is a reference to data allocated |
4057 | at a fixed address in memory. Returns the outermost data. */ | |
8da1b058 | 4058 | |
525c6bf5 | 4059 | extern tree staticp (tree); |
8da1b058 | 4060 | |
8da1b058 RS |
4061 | /* save_expr (EXP) returns an expression equivalent to EXP |
4062 | but it can be used multiple times within context CTX | |
4063 | and only evaluate EXP once. */ | |
4064 | ||
46c5ad27 | 4065 | extern tree save_expr (tree); |
8da1b058 | 4066 | |
a9ecacf6 OH |
4067 | /* Look inside EXPR and into any simple arithmetic operations. Return |
4068 | the innermost non-arithmetic node. */ | |
4069 | ||
46c5ad27 | 4070 | extern tree skip_simple_arithmetic (tree); |
a9ecacf6 | 4071 | |
e2500fed GK |
4072 | /* Return which tree structure is used by T. */ |
4073 | ||
46c5ad27 | 4074 | enum tree_node_structure_enum tree_node_structure (tree); |
e2500fed | 4075 | |
7380d707 RK |
4076 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size |
4077 | or offset that depends on a field within a record. | |
4078 | ||
4079 | Note that we only allow such expressions within simple arithmetic | |
4080 | or a COND_EXPR. */ | |
4081 | ||
46c5ad27 | 4082 | extern bool contains_placeholder_p (tree); |
7a6cdb44 RK |
4083 | |
4084 | /* This macro calls the above function but short-circuits the common | |
4085 | case of a constant to save time. Also check for null. */ | |
4086 | ||
4087 | #define CONTAINS_PLACEHOLDER_P(EXP) \ | |
4088 | ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) | |
4089 | ||
4090 | /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR. | |
4091 | This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field | |
4092 | positions. */ | |
4093 | ||
46c5ad27 | 4094 | extern bool type_contains_placeholder_p (tree); |
7380d707 RK |
4095 | |
4096 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
4097 | return a tree with all occurrences of references to F in a | |
4098 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
4099 | contains only arithmetic expressions. */ | |
4100 | ||
46c5ad27 | 4101 | extern tree substitute_in_expr (tree, tree, tree); |
7380d707 | 4102 | |
6fce44af RK |
4103 | /* This macro calls the above function but short-circuits the common |
4104 | case of a constant to save time and also checks for NULL. */ | |
4105 | ||
4106 | #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ | |
4107 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) | |
4108 | ||
4109 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
4110 | for it within OBJ, a tree that is an object or a chain of references. */ | |
4111 | ||
4112 | extern tree substitute_placeholder_in_expr (tree, tree); | |
4113 | ||
4114 | /* This macro calls the above function but short-circuits the common | |
4115 | case of a constant to save time and also checks for NULL. */ | |
4116 | ||
4117 | #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ | |
4118 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ | |
4119 | : substitute_placeholder_in_expr (EXP, OBJ)) | |
4120 | ||
90ca31be RS |
4121 | /* variable_size (EXP) is like save_expr (EXP) except that it |
4122 | is for the special case of something that is part of a | |
4123 | variable size for a data type. It makes special arrangements | |
4124 | to compute the value at the right time when the data type | |
4125 | belongs to a function parameter. */ | |
4126 | ||
46c5ad27 | 4127 | extern tree variable_size (tree); |
90ca31be | 4128 | |
dcc24678 | 4129 | /* stabilize_reference (EXP) returns a reference equivalent to EXP |
8da1b058 RS |
4130 | but it can be used multiple times |
4131 | and only evaluate the subexpressions once. */ | |
4132 | ||
46c5ad27 | 4133 | extern tree stabilize_reference (tree); |
8da1b058 | 4134 | |
1c8b10bb RK |
4135 | /* Subroutine of stabilize_reference; this is called for subtrees of |
4136 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
4137 | to ensure that it is only evaluated once. */ | |
4138 | ||
46c5ad27 | 4139 | extern tree stabilize_reference_1 (tree); |
1c8b10bb | 4140 | |
8da1b058 RS |
4141 | /* Return EXP, stripped of any conversions to wider types |
4142 | in such a way that the result of converting to type FOR_TYPE | |
4143 | is the same as if EXP were converted to FOR_TYPE. | |
4144 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
4145 | ||
46c5ad27 | 4146 | extern tree get_unwidened (tree, tree); |
8da1b058 RS |
4147 | |
4148 | /* Return OP or a simpler expression for a narrower value | |
4149 | which can be sign-extended or zero-extended to give back OP. | |
4150 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
4151 | or 0 if the value should be sign-extended. */ | |
4152 | ||
46c5ad27 | 4153 | extern tree get_narrower (tree, int *); |
8da1b058 | 4154 | |
8da1b058 RS |
4155 | /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, |
4156 | look for nested component-refs or array-refs at constant positions | |
4157 | and find the ultimate containing object, which is returned. */ | |
4158 | ||
46c5ad27 | 4159 | extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
579eab58 EB |
4160 | tree *, enum machine_mode *, int *, int *, |
4161 | bool); | |
8da1b058 | 4162 | |
ed239f5a RK |
4163 | /* Return 1 if T is an expression that get_inner_reference handles. */ |
4164 | ||
46c5ad27 | 4165 | extern int handled_component_p (tree); |
ed239f5a | 4166 | |
44de5aeb RK |
4167 | /* Return a tree of sizetype representing the size, in bytes, of the element |
4168 | of EXP, an ARRAY_REF. */ | |
4169 | ||
4170 | extern tree array_ref_element_size (tree); | |
4171 | ||
4172 | /* Return a tree representing the lower bound of the array mentioned in | |
4173 | EXP, an ARRAY_REF. */ | |
4174 | ||
4175 | extern tree array_ref_low_bound (tree); | |
4176 | ||
a7e5372d ZD |
4177 | /* Return a tree representing the upper bound of the array mentioned in |
4178 | EXP, an ARRAY_REF. */ | |
4179 | ||
4180 | extern tree array_ref_up_bound (tree); | |
4181 | ||
44de5aeb RK |
4182 | /* Return a tree representing the offset, in bytes, of the field referenced |
4183 | by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ | |
4184 | ||
4185 | extern tree component_ref_field_offset (tree); | |
4186 | ||
140b60b4 MM |
4187 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
4188 | NUL_TREE if there is no containing scope. */ | |
4189 | ||
46c5ad27 | 4190 | extern tree get_containing_scope (tree); |
140b60b4 | 4191 | |
8da1b058 RS |
4192 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
4193 | or zero if none. */ | |
46c5ad27 | 4194 | extern tree decl_function_context (tree); |
8da1b058 | 4195 | |
3635a54b RK |
4196 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
4197 | this _DECL with its context, or zero if none. */ | |
46c5ad27 | 4198 | extern tree decl_type_context (tree); |
8da1b058 | 4199 | |
a3c11cd3 | 4200 | /* Return 1 if EXPR is the real constant zero. */ |
46c5ad27 | 4201 | extern int real_zerop (tree); |
8da1b058 RS |
4202 | \f |
4203 | /* Declare commonly used variables for tree structure. */ | |
4204 | ||
4812480a JM |
4205 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
4206 | Zero means allow extended lvalues. */ | |
4207 | ||
4208 | extern int pedantic_lvalues; | |
4209 | ||
2ba84f36 | 4210 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ |
8da1b058 | 4211 | |
e2500fed | 4212 | extern GTY(()) tree current_function_decl; |
8da1b058 | 4213 | |
00262c8a | 4214 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
375d2edc | 4215 | extern GTY(()) const char * current_function_func_begin_label; |
8da1b058 | 4216 | \f |
143f1945 | 4217 | /* In tree.c */ |
2aab7ceb | 4218 | extern unsigned crc32_string (unsigned, const char *); |
46c5ad27 | 4219 | extern void clean_symbol_name (char *); |
5880f14f | 4220 | extern tree get_file_function_name (const char *); |
46c5ad27 | 4221 | extern tree get_callee_fndecl (tree); |
fccc4eb2 | 4222 | extern void change_decl_assembler_name (tree, tree); |
46c5ad27 | 4223 | extern int type_num_arguments (tree); |
3168cb99 JL |
4224 | extern bool associative_tree_code (enum tree_code); |
4225 | extern bool commutative_tree_code (enum tree_code); | |
18522563 ZD |
4226 | extern tree upper_bound_in_type (tree, tree); |
4227 | extern tree lower_bound_in_type (tree, tree); | |
cdef8bc6 | 4228 | extern int operand_equal_for_phi_arg_p (tree, tree); |
953ff289 | 4229 | extern bool empty_body_p (tree); |
143f1945 | 4230 | \f |
8da1b058 RS |
4231 | /* In stmt.c */ |
4232 | ||
46c5ad27 | 4233 | extern void expand_expr_stmt (tree); |
b9861bff | 4234 | extern int warn_if_unused_value (tree, location_t); |
46c5ad27 AJ |
4235 | extern void expand_label (tree); |
4236 | extern void expand_goto (tree); | |
46c5ad27 | 4237 | |
6de9cd9a DN |
4238 | extern rtx expand_stack_save (void); |
4239 | extern void expand_stack_restore (tree); | |
46c5ad27 | 4240 | extern void expand_return (tree); |
46c5ad27 AJ |
4241 | extern int is_body_block (tree); |
4242 | ||
165b54c3 | 4243 | /* In tree-eh.c */ |
46c5ad27 | 4244 | extern void using_eh_for_cleanups (void); |
8da1b058 RS |
4245 | |
4246 | /* In fold-const.c */ | |
4247 | ||
63b48197 MS |
4248 | /* Non-zero if we are folding constants inside an initializer; zero |
4249 | otherwise. */ | |
4250 | extern int folding_initializer; | |
4251 | ||
4b63dccb RK |
4252 | /* Fold constants as much as possible in an expression. |
4253 | Returns the simplified expression. | |
4254 | Acts only on the top level of the expression; | |
4255 | if the argument itself cannot be simplified, its | |
4256 | subexpressions are not changed. */ | |
4257 | ||
46c5ad27 | 4258 | extern tree fold (tree); |
721425b6 KH |
4259 | extern tree fold_unary (enum tree_code, tree, tree); |
4260 | extern tree fold_binary (enum tree_code, tree, tree, tree); | |
4261 | extern tree fold_ternary (enum tree_code, tree, tree, tree, tree); | |
5808968e AP |
4262 | extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); |
4263 | #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO) | |
4264 | extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
4265 | #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO) | |
4266 | extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
4267 | #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO) | |
00d1b1d6 JM |
4268 | extern tree fold_build1_initializer (enum tree_code, tree, tree); |
4269 | extern tree fold_build2_initializer (enum tree_code, tree, tree, tree); | |
4270 | extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree); | |
e419fe91 | 4271 | extern tree fold_convert (tree, tree); |
46c5ad27 | 4272 | extern tree fold_single_bit_test (enum tree_code, tree, tree, tree); |
9675412f | 4273 | extern tree fold_ignored_result (tree); |
9655d83b | 4274 | extern tree fold_abs_const (tree, tree); |
095ecc24 | 4275 | extern tree fold_indirect_ref_1 (tree, tree); |
46c5ad27 | 4276 | |
ca7a3bd7 NS |
4277 | extern tree force_fit_type (tree, int, bool, bool); |
4278 | ||
6b7283ac EB |
4279 | extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
4280 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
4281 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, | |
4282 | bool); | |
4283 | #define add_double(l1,h1,l2,h2,lv,hv) \ | |
4284 | add_double_with_sign (l1, h1, l2, h2, lv, hv, false) | |
46c5ad27 AJ |
4285 | extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
4286 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
6b7283ac EB |
4287 | extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
4288 | unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
4289 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, | |
4290 | bool); | |
4291 | #define mul_double(l1,h1,l2,h2,lv,hv) \ | |
4292 | mul_double_with_sign (l1, h1, l2, h2, lv, hv, false) | |
46c5ad27 AJ |
4293 | extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, |
4294 | HOST_WIDE_INT, unsigned int, | |
4295 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
4296 | extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
4297 | HOST_WIDE_INT, unsigned int, | |
4298 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); | |
4299 | extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
4300 | HOST_WIDE_INT, unsigned int, | |
4301 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
4302 | extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, | |
4303 | HOST_WIDE_INT, unsigned int, | |
4304 | unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); | |
4305 | ||
4306 | extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT, | |
4307 | HOST_WIDE_INT, unsigned HOST_WIDE_INT, | |
4308 | HOST_WIDE_INT, unsigned HOST_WIDE_INT *, | |
4309 | HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, | |
4310 | HOST_WIDE_INT *); | |
4311 | ||
6de9cd9a DN |
4312 | enum operand_equal_flag |
4313 | { | |
4314 | OEP_ONLY_CONST = 1, | |
4315 | OEP_PURE_SAME = 2 | |
4316 | }; | |
4317 | ||
4318 | extern int operand_equal_p (tree, tree, unsigned int); | |
4319 | ||
46c5ad27 | 4320 | extern tree omit_one_operand (tree, tree, tree); |
08039bd8 | 4321 | extern tree omit_two_operands (tree, tree, tree, tree); |
46c5ad27 | 4322 | extern tree invert_truthvalue (tree); |
d817ed3b | 4323 | extern tree fold_truth_not_expr (tree); |
b52d5eaa RS |
4324 | extern tree fold_unary_to_constant (enum tree_code, tree, tree); |
4325 | extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
6de9cd9a DN |
4326 | extern tree fold_read_from_constant_string (tree); |
4327 | extern tree int_const_binop (enum tree_code, tree, tree, int); | |
cd3ce9b4 | 4328 | extern tree build_fold_addr_expr (tree); |
e3bb43c0 RS |
4329 | extern tree fold_build_cleanup_point_expr (tree type, tree expr); |
4330 | extern tree fold_strip_sign_ops (tree); | |
cd3ce9b4 JM |
4331 | extern tree build_fold_addr_expr_with_type (tree, tree); |
4332 | extern tree build_fold_indirect_ref (tree); | |
6a720599 | 4333 | extern tree fold_indirect_ref (tree); |
e9ea8bd5 | 4334 | extern tree constant_boolean_node (int, tree); |
38b0dcb8 | 4335 | extern tree build_low_bits_mask (tree, unsigned); |
c530479e | 4336 | |
fd660b1b | 4337 | extern bool tree_swap_operands_p (tree, tree, bool); |
3c7d0735 | 4338 | extern void swap_tree_operands (tree, tree *, tree *); |
fd660b1b JL |
4339 | extern enum tree_code swap_tree_comparison (enum tree_code); |
4340 | ||
2f4675b4 | 4341 | extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); |
227858d1 | 4342 | extern enum tree_code invert_tree_comparison (enum tree_code, bool); |
2f4675b4 | 4343 | |
4db8040c JM |
4344 | extern bool tree_expr_nonzero_p (tree); |
4345 | ||
4977bab6 | 4346 | /* In builtins.c */ |
49d1af89 | 4347 | extern tree fold_builtin (tree, tree, bool); |
a32e70c3 | 4348 | extern tree fold_builtin_fputs (tree, bool, bool, tree); |
a456b432 KH |
4349 | extern tree fold_builtin_strcpy (tree, tree, tree); |
4350 | extern tree fold_builtin_strncpy (tree, tree, tree); | |
10a0d495 JJ |
4351 | extern tree fold_builtin_memory_chk (tree, tree, tree, bool, |
4352 | enum built_in_function); | |
4353 | extern tree fold_builtin_stxcpy_chk (tree, tree, tree, bool, | |
4354 | enum built_in_function); | |
4355 | extern tree fold_builtin_strncpy_chk (tree, tree); | |
4356 | extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function); | |
2efcfa4e | 4357 | extern bool fold_builtin_next_arg (tree); |
46c5ad27 AJ |
4358 | extern enum built_in_function builtin_mathfn_code (tree); |
4359 | extern tree build_function_call_expr (tree, tree); | |
4360 | extern tree mathfn_built_in (tree, enum built_in_function fn); | |
6de9cd9a | 4361 | extern tree strip_float_extensions (tree); |
6de9cd9a | 4362 | extern tree c_strlen (tree, int); |
e5da415c | 4363 | extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *); |
c2433d7d | 4364 | extern tree build_va_arg_indirect_ref (tree); |
953ff289 | 4365 | tree build_string_literal (int, const char *); |
a3c11cd3 | 4366 | |
77f9af81 | 4367 | /* In convert.c */ |
46c5ad27 | 4368 | extern tree strip_float_extensions (tree); |
77f9af81 | 4369 | |
a0c33338 | 4370 | /* In alias.c */ |
46c5ad27 AJ |
4371 | extern void record_component_aliases (tree); |
4372 | extern HOST_WIDE_INT get_alias_set (tree); | |
4373 | extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); | |
5399d643 | 4374 | extern int alias_sets_might_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); |
46c5ad27 | 4375 | extern int objects_must_conflict_p (tree, tree); |
bebe2280 | 4376 | |
a1d061a1 | 4377 | /* In tree.c */ |
46c5ad27 AJ |
4378 | extern int really_constant_p (tree); |
4379 | extern int int_fits_type_p (tree, tree); | |
5377d5ba | 4380 | extern bool variably_modified_type_p (tree, tree); |
46c5ad27 AJ |
4381 | extern int tree_log2 (tree); |
4382 | extern int tree_floor_log2 (tree); | |
4383 | extern int simple_cst_equal (tree, tree); | |
9c5835d5 | 4384 | extern hashval_t iterative_hash_expr (tree, hashval_t); |
46c5ad27 AJ |
4385 | extern int compare_tree_int (tree, unsigned HOST_WIDE_INT); |
4386 | extern int type_list_equal (tree, tree); | |
4387 | extern int chain_member (tree, tree); | |
4388 | extern tree type_hash_lookup (unsigned int, tree); | |
4389 | extern void type_hash_add (unsigned int, tree); | |
46c5ad27 AJ |
4390 | extern int simple_cst_list_equal (tree, tree); |
4391 | extern void dump_tree_statistics (void); | |
4392 | extern void expand_function_end (void); | |
b79c5284 | 4393 | extern void expand_function_start (tree); |
7d69de61 | 4394 | extern void stack_protect_prologue (void); |
b755446c | 4395 | extern void stack_protect_epilogue (void); |
127203ac | 4396 | extern void recompute_tree_invariant_for_addr_expr (tree); |
c597ef4e | 4397 | extern bool is_global_var (tree t); |
6de9cd9a | 4398 | extern bool needs_to_live_in_memory (tree); |
b34417a4 | 4399 | extern tree reconstruct_complex_type (tree, tree); |
46c5ad27 AJ |
4400 | |
4401 | extern int real_onep (tree); | |
4402 | extern int real_twop (tree); | |
4403 | extern int real_minus_onep (tree); | |
4404 | extern void init_ttree (void); | |
8c1d6d62 | 4405 | extern void build_common_tree_nodes (bool, bool); |
46c5ad27 | 4406 | extern void build_common_tree_nodes_2 (int); |
c6a912da | 4407 | extern void build_common_builtin_nodes (void); |
bc15d0ef | 4408 | extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); |
46c5ad27 | 4409 | extern tree build_range_type (tree, tree, tree); |
56cf8686 SP |
4410 | extern HOST_WIDE_INT int_cst_value (tree); |
4411 | extern tree tree_fold_gcd (tree, tree); | |
bde6c65d | 4412 | extern tree build_addr (tree, tree); |
a1d061a1 | 4413 | |
fa27426e RH |
4414 | extern bool fields_compatible_p (tree, tree); |
4415 | extern tree find_compatible_field (tree, tree); | |
4416 | ||
07beea0d AH |
4417 | extern location_t expr_location (tree); |
4418 | extern void set_expr_location (tree, location_t); | |
4419 | extern bool expr_has_location (tree); | |
4420 | extern | |
4421 | #ifdef USE_MAPPED_LOCATION | |
4422 | source_location * | |
4423 | #else | |
4424 | source_locus | |
4425 | #endif | |
4426 | expr_locus (tree); | |
4427 | extern void set_expr_locus (tree, | |
4428 | #ifdef USE_MAPPED_LOCATION | |
4429 | source_location *loc | |
4430 | #else | |
4431 | source_locus loc | |
4432 | #endif | |
4433 | ); | |
4434 | extern const char **expr_filename (tree); | |
4435 | extern int *expr_lineno (tree); | |
4436 | extern tree *tree_block (tree); | |
4437 | extern tree *generic_tree_operand (tree, int); | |
4438 | extern tree *generic_tree_type (tree); | |
4439 | ||
a1d061a1 | 4440 | /* In function.c */ |
46c5ad27 AJ |
4441 | extern void expand_main_function (void); |
4442 | extern void init_dummy_function_start (void); | |
4443 | extern void expand_dummy_function_end (void); | |
c2924966 | 4444 | extern unsigned int init_function_for_compilation (void); |
3a70d621 | 4445 | extern void allocate_struct_function (tree); |
46c5ad27 | 4446 | extern void init_function_start (tree); |
8fff4fc1 | 4447 | extern bool use_register_for_decl (tree); |
6de9cd9a | 4448 | extern void setjmp_vars_warning (tree); |
46c5ad27 | 4449 | extern void setjmp_args_warning (void); |
46c5ad27 | 4450 | extern void init_temp_slots (void); |
46c5ad27 AJ |
4451 | extern void free_temp_slots (void); |
4452 | extern void pop_temp_slots (void); | |
4453 | extern void push_temp_slots (void); | |
4454 | extern void preserve_temp_slots (rtx); | |
61f71b34 | 4455 | extern int aggregate_value_p (tree, tree); |
46c5ad27 AJ |
4456 | extern void push_function_context (void); |
4457 | extern void pop_function_context (void); | |
4458 | extern void push_function_context_to (tree); | |
4459 | extern void pop_function_context_from (tree); | |
4744afba | 4460 | extern tree gimplify_parameters (void); |
a1d061a1 JL |
4461 | |
4462 | /* In print-rtl.c */ | |
4463 | #ifdef BUFSIZ | |
46c5ad27 | 4464 | extern void print_rtl (FILE *, rtx); |
a1d061a1 JL |
4465 | #endif |
4466 | ||
4467 | /* In print-tree.c */ | |
46c5ad27 | 4468 | extern void debug_tree (tree); |
a1d061a1 | 4469 | #ifdef BUFSIZ |
24a7799e | 4470 | extern void dump_addr (FILE*, const char *, void *); |
46c5ad27 AJ |
4471 | extern void print_node (FILE *, const char *, tree, int); |
4472 | extern void print_node_brief (FILE *, const char *, tree, int); | |
4473 | extern void indent_to (FILE *, int); | |
a1d061a1 JL |
4474 | #endif |
4475 | ||
61a36b9b RK |
4476 | /* In tree-inline.c: */ |
4477 | extern bool debug_find_tree (tree, tree); | |
19114537 EC |
4478 | /* This is in tree-inline.c since the routine uses |
4479 | data structures from the inliner. */ | |
4480 | extern tree unsave_expr_now (tree); | |
52dd234b | 4481 | extern tree build_duplicate_type (tree); |
61a36b9b | 4482 | |
a1d061a1 | 4483 | /* In emit-rtl.c */ |
0cea056b | 4484 | extern rtx emit_line_note (location_t); |
a1d061a1 | 4485 | |
3a8c995b | 4486 | /* In calls.c */ |
f2d33f13 | 4487 | |
6e14af16 ZW |
4488 | /* Nonzero if this is a call to a function whose return value depends |
4489 | solely on its arguments, has no side effects, and does not read | |
4490 | global memory. */ | |
fa5b060f | 4491 | #define ECF_CONST 1 |
6e14af16 | 4492 | /* Nonzero if this call will never return. */ |
fa5b060f SB |
4493 | #define ECF_NORETURN 2 |
4494 | /* Nonzero if this is a call to malloc or a related function. */ | |
4495 | #define ECF_MALLOC 4 | |
4496 | /* Nonzero if it is plausible that this is a call to alloca. */ | |
4497 | #define ECF_MAY_BE_ALLOCA 8 | |
4498 | /* Nonzero if this is a call to a function that won't throw an exception. */ | |
4499 | #define ECF_NOTHROW 16 | |
4500 | /* Nonzero if this is a call to setjmp or a related function. */ | |
4501 | #define ECF_RETURNS_TWICE 32 | |
6e14af16 ZW |
4502 | /* Nonzero if this call replaces the current stack frame. */ |
4503 | #define ECF_SIBCALL 64 | |
fa5b060f SB |
4504 | /* Nonzero if this is a call to "pure" function (like const function, |
4505 | but may read memory. */ | |
6e14af16 | 4506 | #define ECF_PURE 128 |
fa5b060f SB |
4507 | /* Nonzero if this is a call to a function that returns with the stack |
4508 | pointer depressed. */ | |
6e14af16 | 4509 | #define ECF_SP_DEPRESSED 256 |
fa5b060f | 4510 | /* Create libcall block around the call. */ |
321cf1f2 | 4511 | #define ECF_LIBCALL_BLOCK 512 |
dcd6de6d ZD |
4512 | /* Function does not read or write memory (but may have side effects, so |
4513 | it does not necessarily fit ECF_CONST). */ | |
4514 | #define ECF_NOVOPS 1024 | |
fa5b060f | 4515 | |
46c5ad27 | 4516 | extern int flags_from_decl_or_type (tree); |
f027e0a2 | 4517 | extern int call_expr_flags (tree); |
fa5b060f | 4518 | |
46c5ad27 AJ |
4519 | extern int setjmp_call_p (tree); |
4520 | extern bool alloca_call_p (tree); | |
fe984136 RH |
4521 | extern bool must_pass_in_stack_var_size (enum machine_mode, tree); |
4522 | extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, tree); | |
3a8c995b | 4523 | |
bb9f8221 | 4524 | /* In attribs.c. */ |
0c96e965 RK |
4525 | |
4526 | /* Process the attributes listed in ATTRIBUTES and install them in *NODE, | |
4527 | which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, | |
4528 | it should be modified in place; if a TYPE, a copy should be created | |
4529 | unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further | |
4530 | information, in the form of a bitwise OR of flags in enum attribute_flags | |
4531 | from tree.h. Depending on these flags, some attributes may be | |
4532 | returned to be applied at a later stage (for example, to apply | |
4533 | a decl attribute to the declaration rather than to its type). */ | |
4682ae04 | 4534 | extern tree decl_attributes (tree *, tree, int); |
bb9f8221 | 4535 | |
a1d061a1 | 4536 | /* In integrate.c */ |
46c5ad27 | 4537 | extern void set_decl_abstract_flags (tree, int); |
46c5ad27 | 4538 | extern void set_decl_origin_self (tree); |
a1d061a1 | 4539 | |
a1d061a1 | 4540 | /* In stor-layout.c */ |
7b6d72fc | 4541 | extern void set_min_and_max_values_for_integral_type (tree, int, bool); |
46c5ad27 AJ |
4542 | extern void fixup_signed_type (tree); |
4543 | extern void internal_reference_types (void); | |
6de9cd9a DN |
4544 | extern unsigned int update_alignment_for_field (record_layout_info, tree, |
4545 | unsigned int); | |
a1d061a1 | 4546 | /* varasm.c */ |
0e6df31e | 4547 | extern void make_decl_rtl (tree); |
46c5ad27 AJ |
4548 | extern void make_decl_one_only (tree); |
4549 | extern int supports_one_only (void); | |
46c5ad27 AJ |
4550 | extern void resolve_unique_section (tree, int, int); |
4551 | extern void mark_referenced (tree); | |
bb9a388d | 4552 | extern void mark_decl_referenced (tree); |
810db579 | 4553 | extern void notice_global_symbol (tree); |
0e6df31e | 4554 | extern void set_user_assembler_name (tree, const char *); |
857e7259 | 4555 | extern void process_pending_assemble_externals (void); |
e4d5432a RH |
4556 | extern void finish_aliases_1 (void); |
4557 | extern void finish_aliases_2 (void); | |
a1d061a1 | 4558 | |
a1d061a1 | 4559 | /* In stmt.c */ |
46c5ad27 AJ |
4560 | extern void expand_computed_goto (tree); |
4561 | extern bool parse_output_constraint (const char **, int, int, int, | |
4562 | bool *, bool *, bool *); | |
1456deaf JM |
4563 | extern bool parse_input_constraint (const char **, int, int, int, int, |
4564 | const char * const *, bool *, bool *); | |
6de9cd9a | 4565 | extern void expand_asm_expr (tree); |
7dc8b126 | 4566 | extern tree resolve_asm_operand_names (tree, tree, tree); |
7efcb746 | 4567 | extern void expand_case (tree); |
46c5ad27 | 4568 | extern void expand_decl (tree); |
46c5ad27 | 4569 | extern void expand_anon_union_decl (tree, tree, tree); |
61158923 HPN |
4570 | #ifdef HARD_CONST |
4571 | /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */ | |
91b4415a | 4572 | extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *); |
61158923 | 4573 | #endif |
6de9cd9a DN |
4574 | |
4575 | /* In gimplify.c. */ | |
4576 | extern tree create_artificial_label (void); | |
4577 | extern void gimplify_function_tree (tree); | |
4578 | extern const char *get_name (tree); | |
4579 | extern tree unshare_expr (tree); | |
0f1f6967 | 4580 | extern void sort_case_labels (tree); |
af4142d5 JM |
4581 | \f |
4582 | /* Interface of the DWARF2 unwind info support. */ | |
4583 | ||
af4142d5 JM |
4584 | /* Generate a new label for the CFI info to refer to. */ |
4585 | ||
46c5ad27 | 4586 | extern char *dwarf2out_cfi_label (void); |
af4142d5 JM |
4587 | |
4588 | /* Entry point to update the canonical frame address (CFA). */ | |
4589 | ||
0ab5b679 | 4590 | extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); |
af4142d5 JM |
4591 | |
4592 | /* Add the CFI for saving a register window. */ | |
4593 | ||
46c5ad27 | 4594 | extern void dwarf2out_window_save (const char *); |
af4142d5 JM |
4595 | |
4596 | /* Add a CFI to update the running total of the size of arguments pushed | |
4597 | onto the stack. */ | |
4598 | ||
0ab5b679 | 4599 | extern void dwarf2out_args_size (const char *, HOST_WIDE_INT); |
af4142d5 JM |
4600 | |
4601 | /* Entry point for saving a register to the stack. */ | |
4602 | ||
0ab5b679 | 4603 | extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); |
af4142d5 JM |
4604 | |
4605 | /* Entry point for saving the return address in the stack. */ | |
4606 | ||
0ab5b679 | 4607 | extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); |
af4142d5 JM |
4608 | |
4609 | /* Entry point for saving the return address in a register. */ | |
4610 | ||
46c5ad27 | 4611 | extern void dwarf2out_return_reg (const char *, unsigned); |
af4142d5 | 4612 | |
150cdc9e RH |
4613 | /* Entry point for saving the first register into the second. */ |
4614 | ||
4615 | extern void dwarf2out_reg_save_reg (const char *, rtx, rtx); | |
4616 | ||
d8472c75 JM |
4617 | /* In tree-inline.c */ |
4618 | ||
0c58f841 MA |
4619 | /* The type of a set of already-visited pointers. Functions for creating |
4620 | and manipulating it are declared in pointer-set.h */ | |
4621 | struct pointer_set_t; | |
4622 | ||
6de9cd9a | 4623 | /* The type of a callback function for walking over tree structure. */ |
588d3ade | 4624 | |
46c5ad27 | 4625 | typedef tree (*walk_tree_fn) (tree *, int *, void *); |
0c58f841 | 4626 | extern tree walk_tree (tree*, walk_tree_fn, void*, struct pointer_set_t*); |
d8472c75 | 4627 | extern tree walk_tree_without_duplicates (tree*, walk_tree_fn, void*); |
588d3ade | 4628 | |
a560d4d4 JH |
4629 | /* Assign the RTX to declaration. */ |
4630 | ||
46c5ad27 | 4631 | extern void set_decl_rtl (tree, rtx); |
fbe6ec81 | 4632 | extern void set_decl_incoming_rtl (tree, rtx); |
9a6bb3f7 | 4633 | \f |
caf93cb0 | 4634 | /* Enum and arrays used for tree allocation stats. |
938d968e | 4635 | Keep in sync with tree.c:tree_node_kind_names. */ |
adc4adcd GP |
4636 | typedef enum |
4637 | { | |
4638 | d_kind, | |
4639 | t_kind, | |
4640 | b_kind, | |
4641 | s_kind, | |
4642 | r_kind, | |
4643 | e_kind, | |
4644 | c_kind, | |
4645 | id_kind, | |
4646 | perm_list_kind, | |
4647 | temp_list_kind, | |
4648 | vec_kind, | |
95b4aca6 | 4649 | binfo_kind, |
6de9cd9a DN |
4650 | phi_kind, |
4651 | ssa_name_kind, | |
4038c495 | 4652 | constr_kind, |
adc4adcd GP |
4653 | x_kind, |
4654 | lang_decl, | |
4655 | lang_type, | |
aaf46ef9 | 4656 | omp_clause_kind, |
07beea0d | 4657 | gimple_stmt_kind, |
adc4adcd GP |
4658 | all_kinds |
4659 | } tree_node_kind; | |
4660 | ||
4661 | extern int tree_node_counts[]; | |
4662 | extern int tree_node_sizes[]; | |
6de9cd9a DN |
4663 | |
4664 | /* True if we are in gimple form and the actions of the folders need to | |
4665 | be restricted. False if we are not in gimple form and folding is not | |
4666 | restricted to creating gimple expressions. */ | |
4667 | extern bool in_gimple_form; | |
caf93cb0 | 4668 | |
389fdba0 RH |
4669 | /* In tree-gimple.c. */ |
4670 | extern tree get_base_address (tree t); | |
4671 | ||
c866976a LB |
4672 | /* In tree-vectorizer.c. */ |
4673 | extern void vect_set_verbosity_level (const char *); | |
4674 | ||
820cc88f DB |
4675 | struct tree_map GTY(()) |
4676 | { | |
4677 | unsigned int hash; | |
4678 | tree from; | |
4679 | tree to; | |
4680 | }; | |
4681 | ||
4682 | extern unsigned int tree_map_hash (const void *); | |
4683 | extern int tree_map_marked_p (const void *); | |
4684 | extern int tree_map_eq (const void *, const void *); | |
4685 | ||
ac182688 ZD |
4686 | /* In tree-ssa-address.c. */ |
4687 | extern tree tree_mem_ref_addr (tree, tree); | |
4688 | extern void copy_mem_ref_info (tree, tree); | |
4689 | ||
b16caf72 JL |
4690 | /* In tree-vrp.c */ |
4691 | extern bool ssa_name_nonzero_p (tree); | |
4692 | extern bool ssa_name_nonnegative_p (tree); | |
4693 | ||
10a0d495 JJ |
4694 | /* In tree-object-size.c. */ |
4695 | extern void init_object_sizes (void); | |
4696 | extern void fini_object_sizes (void); | |
4697 | extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int); | |
4698 | ||
86a07404 IR |
4699 | /* In expr.c. */ |
4700 | extern unsigned HOST_WIDE_INT highest_pow2_factor (tree); | |
4701 | ||
df89f8e7 | 4702 | #endif /* GCC_TREE_H */ |