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