]>
Commit | Line | Data |
---|---|---|
0aca815c | 1 | /* Definitions for the ubiquitous 'tree' type for GNU compilers. |
711789cc | 2 | Copyright (C) 1989-2013 Free Software Foundation, Inc. |
d72a838e | 3 | |
f12b58b3 | 4 | This file is part of GCC. |
d72a838e | 5 | |
f12b58b3 | 6 | GCC is free software; you can redistribute it and/or modify it under |
7 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
f12b58b3 | 9 | version. |
d72a838e | 10 | |
f12b58b3 | 11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
d72a838e | 15 | |
16 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
d72a838e | 19 | |
b229f760 | 20 | #ifndef GCC_TREE_H |
21 | #define GCC_TREE_H | |
22 | ||
503c6e8e | 23 | #include "hashtab.h" |
d72a838e | 24 | #include "machmode.h" |
5a8a92a0 | 25 | #include "input.h" |
674b05f5 | 26 | #include "statistics.h" |
f6cc6a08 | 27 | #include "vec.h" |
ad3827a6 | 28 | #include "double-int.h" |
a7a46268 | 29 | #include "real.h" |
30 | #include "fixed-value.h" | |
32c2fdea | 31 | #include "alias.h" |
f3f006ad | 32 | #include "flags.h" |
d72a838e | 33 | |
b8dea3b2 | 34 | /* Codes of tree nodes */ |
d72a838e | 35 | |
36 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, | |
e014fc6a | 37 | #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE, |
d72a838e | 38 | |
39 | enum tree_code { | |
e014fc6a | 40 | #include "all-tree.def" |
41 | MAX_TREE_CODES | |
d72a838e | 42 | }; |
43 | ||
44 | #undef DEFTREECODE | |
e014fc6a | 45 | #undef END_OF_BASE_TREE_CODES |
d72a838e | 46 | |
5ca99950 | 47 | extern unsigned char tree_contains_struct[MAX_TREE_CODES][64]; |
5ded8c6f | 48 | #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) |
49 | ||
9b88d08d | 50 | /* Macros for initializing `tree_contains_struct'. */ |
51 | #define MARK_TS_BASE(C) \ | |
52 | do { \ | |
53 | tree_contains_struct[C][TS_BASE] = 1; \ | |
54 | } while (0) | |
55 | ||
56 | #define MARK_TS_TYPED(C) \ | |
57 | do { \ | |
58 | MARK_TS_BASE (C); \ | |
59 | tree_contains_struct[C][TS_TYPED] = 1; \ | |
60 | } while (0) | |
61 | ||
62 | #define MARK_TS_COMMON(C) \ | |
63 | do { \ | |
64 | MARK_TS_TYPED (C); \ | |
65 | tree_contains_struct[C][TS_COMMON] = 1; \ | |
66 | } while (0) | |
67 | ||
8f2eb9e1 | 68 | #define MARK_TS_TYPE_COMMON(C) \ |
69 | do { \ | |
70 | MARK_TS_COMMON (C); \ | |
71 | tree_contains_struct[C][TS_TYPE_COMMON] = 1; \ | |
72 | } while (0) | |
73 | ||
74 | #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ | |
75 | do { \ | |
76 | MARK_TS_TYPE_COMMON (C); \ | |
77 | tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \ | |
78 | } while (0) | |
79 | ||
9b88d08d | 80 | #define MARK_TS_DECL_MINIMAL(C) \ |
81 | do { \ | |
82 | MARK_TS_COMMON (C); \ | |
83 | tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \ | |
84 | } while (0) | |
85 | ||
86 | #define MARK_TS_DECL_COMMON(C) \ | |
87 | do { \ | |
88 | MARK_TS_DECL_MINIMAL (C); \ | |
89 | tree_contains_struct[C][TS_DECL_COMMON] = 1; \ | |
90 | } while (0) | |
91 | ||
92 | #define MARK_TS_DECL_WRTL(C) \ | |
93 | do { \ | |
94 | MARK_TS_DECL_COMMON (C); \ | |
95 | tree_contains_struct[C][TS_DECL_WRTL] = 1; \ | |
96 | } while (0) | |
97 | ||
98 | #define MARK_TS_DECL_WITH_VIS(C) \ | |
99 | do { \ | |
100 | MARK_TS_DECL_WRTL (C); \ | |
101 | tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \ | |
102 | } while (0) | |
103 | ||
104 | #define MARK_TS_DECL_NON_COMMON(C) \ | |
105 | do { \ | |
106 | MARK_TS_DECL_WITH_VIS (C); \ | |
107 | tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \ | |
108 | } while (0) | |
109 | ||
f3c6d29a | 110 | /* Number of language-independent tree codes. */ |
111 | #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) | |
d72a838e | 112 | |
ce45a448 | 113 | /* Tree code classes. */ |
114 | ||
115 | /* Each tree_code has an associated code class represented by a | |
116 | TREE_CODE_CLASS. */ | |
117 | ||
118 | enum tree_code_class { | |
119 | tcc_exceptional, /* An exceptional code (fits no category). */ | |
120 | tcc_constant, /* A constant. */ | |
9843a47d | 121 | /* Order of tcc_type and tcc_declaration is important. */ |
ce45a448 | 122 | tcc_type, /* A type object code. */ |
123 | tcc_declaration, /* A declaration (also serving as variable refs). */ | |
124 | tcc_reference, /* A reference to storage. */ | |
125 | tcc_comparison, /* A comparison expression. */ | |
126 | tcc_unary, /* A unary arithmetic expression. */ | |
127 | tcc_binary, /* A binary arithmetic expression. */ | |
128 | tcc_statement, /* A statement expression, which have side effects | |
129 | but usually no interesting value. */ | |
c2f47e15 | 130 | tcc_vl_exp, /* A function call or other expression with a |
131 | variable-length operand vector. */ | |
75a70cf9 | 132 | tcc_expression /* Any other expression. */ |
ce45a448 | 133 | }; |
134 | ||
135 | /* Each tree code class has an associated string representation. | |
136 | These must correspond to the tree_code_class entries. */ | |
137 | ||
a93de1ee | 138 | extern const char *const tree_code_class_strings[]; |
ce45a448 | 139 | |
140 | /* Returns the string representing CLASS. */ | |
141 | ||
142 | #define TREE_CODE_CLASS_STRING(CLASS)\ | |
143 | tree_code_class_strings[(int) (CLASS)] | |
d72a838e | 144 | |
ce45a448 | 145 | extern const enum tree_code_class tree_code_type[]; |
b4dae43c | 146 | #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
d72a838e | 147 | |
ce45a448 | 148 | /* Nonzero if CODE represents an exceptional code. */ |
149 | ||
150 | #define EXCEPTIONAL_CLASS_P(CODE)\ | |
151 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) | |
152 | ||
153 | /* Nonzero if CODE represents a constant. */ | |
154 | ||
155 | #define CONSTANT_CLASS_P(CODE)\ | |
156 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) | |
157 | ||
158 | /* Nonzero if CODE represents a type. */ | |
159 | ||
160 | #define TYPE_P(CODE)\ | |
161 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) | |
162 | ||
163 | /* Nonzero if CODE represents a declaration. */ | |
164 | ||
165 | #define DECL_P(CODE)\ | |
166 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) | |
167 | ||
80a58eb0 | 168 | /* True if NODE designates a variable declaration. */ |
169 | #define VAR_P(NODE) \ | |
170 | (TREE_CODE (NODE) == VAR_DECL) | |
171 | ||
5ded8c6f | 172 | /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ |
173 | ||
174 | #define VAR_OR_FUNCTION_DECL_P(DECL)\ | |
175 | (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) | |
176 | ||
9843a47d | 177 | /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in |
178 | ascending code order. */ | |
5ded8c6f | 179 | |
2a448a75 | 180 | #define INDIRECT_REF_P(CODE)\ |
5d9de213 | 181 | (TREE_CODE (CODE) == INDIRECT_REF) |
2a448a75 | 182 | |
ce45a448 | 183 | /* Nonzero if CODE represents a reference. */ |
184 | ||
185 | #define REFERENCE_CLASS_P(CODE)\ | |
186 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) | |
187 | ||
188 | /* Nonzero if CODE represents a comparison. */ | |
189 | ||
190 | #define COMPARISON_CLASS_P(CODE)\ | |
191 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) | |
192 | ||
193 | /* Nonzero if CODE represents a unary arithmetic expression. */ | |
194 | ||
195 | #define UNARY_CLASS_P(CODE)\ | |
196 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) | |
197 | ||
198 | /* Nonzero if CODE represents a binary arithmetic expression. */ | |
199 | ||
200 | #define BINARY_CLASS_P(CODE)\ | |
201 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) | |
202 | ||
203 | /* Nonzero if CODE represents a statement expression. */ | |
204 | ||
205 | #define STATEMENT_CLASS_P(CODE)\ | |
206 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) | |
207 | ||
c2f47e15 | 208 | /* Nonzero if CODE represents a function call-like expression with a |
209 | variable-length operand vector. */ | |
210 | ||
211 | #define VL_EXP_CLASS_P(CODE)\ | |
212 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp) | |
213 | ||
ce45a448 | 214 | /* Nonzero if CODE represents any other expression. */ |
215 | ||
216 | #define EXPRESSION_CLASS_P(CODE)\ | |
217 | (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) | |
218 | ||
ce45a448 | 219 | /* Returns nonzero iff CODE represents a type or declaration. */ |
220 | ||
221 | #define IS_TYPE_OR_DECL_P(CODE)\ | |
222 | (TYPE_P (CODE) || DECL_P (CODE)) | |
66d12a6c | 223 | |
f712a0dc | 224 | /* Returns nonzero iff CLASS is the tree-code class of an |
14ac2afb | 225 | expression. */ |
226 | ||
ce45a448 | 227 | #define IS_EXPR_CODE_CLASS(CLASS)\ |
fbbb2067 | 228 | ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) |
b5e4e1dc | 229 | |
230 | /* Returns nonzero iff NODE is an expression of some kind. */ | |
231 | ||
232 | #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) | |
14ac2afb | 233 | |
d72a838e | 234 | /* Number of argument-words in each kind of tree-node. */ |
235 | ||
ab1a776d | 236 | extern const unsigned char tree_code_length[]; |
f3c6d29a | 237 | #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
d72a838e | 238 | |
239 | /* Names of tree components. */ | |
240 | ||
ab1a776d | 241 | extern const char *const tree_code_name[]; |
f6cc6a08 | 242 | |
afea39ad | 243 | /* When procesing aliases on symtab level, we need the declaration of target. |
244 | For this reason we need to queue aliases and process them after all declarations | |
245 | has been produced. */ | |
246 | ||
34e5cced | 247 | typedef struct GTY(()) alias_pair |
248 | { | |
249 | tree decl; | |
98ff07a9 | 250 | tree target; |
34e5cced | 251 | } alias_pair; |
252 | ||
253 | /* Define gc'd vector type. */ | |
34e5cced | 254 | |
f1f41a6c | 255 | extern GTY(()) vec<alias_pair, va_gc> *alias_pairs; |
34e5cced | 256 | |
d72a838e | 257 | \f |
ab7943b9 | 258 | /* Classify which part of the compiler has defined a given builtin function. |
259 | Note that we assume below that this is no more than two bits. */ | |
8305149e | 260 | enum built_in_class |
261 | { | |
262 | NOT_BUILT_IN = 0, | |
263 | BUILT_IN_FRONTEND, | |
264 | BUILT_IN_MD, | |
265 | BUILT_IN_NORMAL | |
266 | }; | |
ab7943b9 | 267 | |
34c4d8ed | 268 | /* Last marker used for LTO stremaing of built_in_class. We can not add it |
269 | to the enum since we need the enumb to fit in 2 bits. */ | |
270 | #define BUILT_IN_LAST (BUILT_IN_NORMAL + 1) | |
271 | ||
ab7943b9 | 272 | /* Names for the above. */ |
8934cb0c | 273 | extern const char *const built_in_class_names[4]; |
ab7943b9 | 274 | |
d72a838e | 275 | /* Codes that identify the various built in functions |
276 | so that expand_call can identify them quickly. */ | |
277 | ||
9cfddb70 | 278 | #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, |
d72a838e | 279 | enum built_in_function |
280 | { | |
4e9d90c7 | 281 | #include "builtins.def" |
132bc06c | 282 | |
0dfc45b5 | 283 | /* Complex division routines in libgcc. These are done via builtins |
284 | because emit_library_call_value can't handle complex values. */ | |
285 | BUILT_IN_COMPLEX_MUL_MIN, | |
286 | BUILT_IN_COMPLEX_MUL_MAX | |
287 | = BUILT_IN_COMPLEX_MUL_MIN | |
288 | + MAX_MODE_COMPLEX_FLOAT | |
289 | - MIN_MODE_COMPLEX_FLOAT, | |
290 | ||
291 | BUILT_IN_COMPLEX_DIV_MIN, | |
292 | BUILT_IN_COMPLEX_DIV_MAX | |
293 | = BUILT_IN_COMPLEX_DIV_MIN | |
294 | + MAX_MODE_COMPLEX_FLOAT | |
295 | - MIN_MODE_COMPLEX_FLOAT, | |
296 | ||
88b5b080 | 297 | /* Upper bound on non-language-specific builtins. */ |
132bc06c | 298 | END_BUILTINS |
d72a838e | 299 | }; |
4e9d90c7 | 300 | #undef DEF_BUILTIN |
ab7943b9 | 301 | |
302 | /* Names for the above. */ | |
0dfc45b5 | 303 | extern const char * built_in_names[(int) END_BUILTINS]; |
df94cd3b | 304 | |
852da3c3 | 305 | /* Helper macros for math builtins. */ |
306 | ||
307 | #define BUILTIN_EXP10_P(FN) \ | |
308 | ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ | |
309 | || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) | |
310 | ||
311 | #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ | |
312 | || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ | |
313 | || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) | |
314 | ||
315 | #define BUILTIN_SQRT_P(FN) \ | |
316 | ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) | |
317 | ||
318 | #define BUILTIN_CBRT_P(FN) \ | |
319 | ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) | |
320 | ||
321 | #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) | |
322 | ||
4f35b1fc | 323 | #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L |
e84da7c1 | 324 | #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R |
64b5be08 | 325 | #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX |
d72a838e | 326 | \f |
55d6e7cd | 327 | /* In an OMP_CLAUSE node. */ |
328 | ||
329 | /* Number of operands and names for each clause. */ | |
330 | extern unsigned const char omp_clause_num_ops[]; | |
331 | extern const char * const omp_clause_code_name[]; | |
332 | ||
333 | /* Clause codes. Do not reorder, as this is used to index into the tables | |
334 | omp_clause_num_ops and omp_clause_code_name. */ | |
335 | enum omp_clause_code | |
336 | { | |
337 | /* Clause zero is special-cased inside the parser | |
338 | (c_parser_omp_variable_list). */ | |
339 | OMP_CLAUSE_ERROR = 0, | |
340 | ||
341 | /* OpenMP clause: private (variable_list). */ | |
342 | OMP_CLAUSE_PRIVATE, | |
343 | ||
344 | /* OpenMP clause: shared (variable_list). */ | |
345 | OMP_CLAUSE_SHARED, | |
346 | ||
347 | /* OpenMP clause: firstprivate (variable_list). */ | |
348 | OMP_CLAUSE_FIRSTPRIVATE, | |
349 | ||
350 | /* OpenMP clause: lastprivate (variable_list). */ | |
351 | OMP_CLAUSE_LASTPRIVATE, | |
352 | ||
353 | /* OpenMP clause: reduction (operator:variable_list). | |
354 | OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator. | |
355 | Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var. | |
7bd4091f | 356 | Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var |
55d6e7cd | 357 | into the shared one. |
358 | Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL | |
fd6481cf | 359 | placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */ |
55d6e7cd | 360 | OMP_CLAUSE_REDUCTION, |
361 | ||
362 | /* OpenMP clause: copyin (variable_list). */ | |
363 | OMP_CLAUSE_COPYIN, | |
364 | ||
365 | /* OpenMP clause: copyprivate (variable_list). */ | |
366 | OMP_CLAUSE_COPYPRIVATE, | |
367 | ||
3d483a94 | 368 | /* OpenMP clause: linear (variable-list[:linear-step]). */ |
369 | OMP_CLAUSE_LINEAR, | |
370 | ||
371 | /* OpenMP clause: uniform (argument-list). */ | |
372 | OMP_CLAUSE_UNIFORM, | |
373 | ||
55d6e7cd | 374 | /* OpenMP clause: if (scalar-expression). */ |
375 | OMP_CLAUSE_IF, | |
376 | ||
377 | /* OpenMP clause: num_threads (integer-expression). */ | |
378 | OMP_CLAUSE_NUM_THREADS, | |
379 | ||
380 | /* OpenMP clause: schedule. */ | |
381 | OMP_CLAUSE_SCHEDULE, | |
382 | ||
383 | /* OpenMP clause: nowait. */ | |
384 | OMP_CLAUSE_NOWAIT, | |
385 | ||
386 | /* OpenMP clause: ordered. */ | |
387 | OMP_CLAUSE_ORDERED, | |
388 | ||
389 | /* OpenMP clause: default. */ | |
fd6481cf | 390 | OMP_CLAUSE_DEFAULT, |
391 | ||
392 | /* OpenMP clause: collapse (constant-integer-expression). */ | |
393 | OMP_CLAUSE_COLLAPSE, | |
394 | ||
395 | /* OpenMP clause: untied. */ | |
2169f33b | 396 | OMP_CLAUSE_UNTIED, |
397 | ||
398 | /* OpenMP clause: final (scalar-expression). */ | |
399 | OMP_CLAUSE_FINAL, | |
400 | ||
401 | /* OpenMP clause: mergeable. */ | |
3d483a94 | 402 | OMP_CLAUSE_MERGEABLE, |
403 | ||
404 | /* OpenMP clause: safelen (constant-integer-expression). */ | |
405 | OMP_CLAUSE_SAFELEN, | |
406 | ||
407 | /* Internally used only clause, holding SIMD uid. */ | |
408 | OMP_CLAUSE__SIMDUID_ | |
55d6e7cd | 409 | }; |
410 | \f | |
d72a838e | 411 | /* The definition of tree nodes fills the next several pages. */ |
412 | ||
413 | /* A tree node can represent a data type, a variable, an expression | |
414 | or a statement. Each node has a TREE_CODE which says what kind of | |
415 | thing it represents. Some common codes are: | |
416 | INTEGER_TYPE -- represents a type of integers. | |
417 | ARRAY_TYPE -- represents a type of pointer. | |
418 | VAR_DECL -- represents a declared variable. | |
419 | INTEGER_CST -- represents a constant integer value. | |
420 | PLUS_EXPR -- represents a sum (an expression). | |
421 | ||
422 | As for the contents of a tree node: there are some fields | |
423 | that all nodes share. Each TREE_CODE has various special-purpose | |
424 | fields as well. The fields of a node are never accessed directly, | |
425 | always through accessor macros. */ | |
426 | ||
d72a838e | 427 | /* Every kind of tree node starts with this structure, |
428 | so all nodes have these fields. | |
429 | ||
a7baca71 | 430 | See the accessor macros, defined below, for documentation of the |
4d039f23 | 431 | fields, and the table below which connects the fields and the |
87d8f7b6 | 432 | accessor macros. */ |
d72a838e | 433 | |
fb1e4f4a | 434 | struct GTY(()) tree_base { |
5ca99950 | 435 | ENUM_BITFIELD(tree_code) code : 16; |
20f2763e | 436 | |
d72a838e | 437 | unsigned side_effects_flag : 1; |
438 | unsigned constant_flag : 1; | |
d72a838e | 439 | unsigned addressable_flag : 1; |
440 | unsigned volatile_flag : 1; | |
441 | unsigned readonly_flag : 1; | |
d72a838e | 442 | unsigned asm_written_flag: 1; |
4ee9c684 | 443 | unsigned nowarning_flag : 1; |
87d8f7b6 | 444 | unsigned visited : 1; |
66d12a6c | 445 | |
4ee9c684 | 446 | unsigned used_flag : 1; |
00dd2e9e | 447 | unsigned nothrow_flag : 1; |
d72a838e | 448 | unsigned static_flag : 1; |
449 | unsigned public_flag : 1; | |
450 | unsigned private_flag : 1; | |
451 | unsigned protected_flag : 1; | |
88da234d | 452 | unsigned deprecated_flag : 1; |
7ac958de | 453 | unsigned default_def_flag : 1; |
7ac958de | 454 | |
87d8f7b6 | 455 | union { |
456 | /* The bits in the following structure should only be used with | |
457 | accessor macros that constrain inputs with tree checking. */ | |
458 | struct { | |
459 | unsigned lang_flag_0 : 1; | |
460 | unsigned lang_flag_1 : 1; | |
461 | unsigned lang_flag_2 : 1; | |
462 | unsigned lang_flag_3 : 1; | |
463 | unsigned lang_flag_4 : 1; | |
464 | unsigned lang_flag_5 : 1; | |
465 | unsigned lang_flag_6 : 1; | |
466 | unsigned saturating_flag : 1; | |
467 | ||
468 | unsigned unsigned_flag : 1; | |
469 | unsigned packed_flag : 1; | |
470 | unsigned user_align : 1; | |
471 | unsigned nameless_flag : 1; | |
472 | unsigned spare0 : 4; | |
473 | ||
474 | unsigned spare1 : 8; | |
475 | ||
476 | /* This field is only used with TREE_TYPE nodes; the only reason it is | |
477 | present in tree_base instead of tree_type is to save space. The size | |
478 | of the field must be large enough to hold addr_space_t values. */ | |
479 | unsigned address_space : 8; | |
480 | } bits; | |
481 | /* The following fields are present in tree_base to save space. The | |
482 | nodes using them do not require any of the flags above and so can | |
483 | make better use of the 4-byte sized word. */ | |
484 | /* VEC length. This field is only used with TREE_VEC. */ | |
485 | int length; | |
486 | /* SSA version number. This field is only used with SSA_NAME. */ | |
487 | unsigned int version; | |
488 | } GTY((skip(""))) u; | |
1646aa85 | 489 | }; |
490 | ||
7e787821 | 491 | /* The following table lists the uses of each of the above flags and |
eba15a75 | 492 | for which types of nodes they are defined. |
7e787821 | 493 | |
494 | addressable_flag: | |
495 | ||
496 | TREE_ADDRESSABLE in | |
f8b3db21 | 497 | VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL |
f7b5f694 | 498 | SSA_NAME |
eba15a75 | 499 | all types |
500 | CONSTRUCTOR, IDENTIFIER_NODE | |
f7b5f694 | 501 | STMT_EXPR |
eba15a75 | 502 | |
503 | CALL_EXPR_TAILCALL in | |
504 | CALL_EXPR | |
505 | ||
506 | CASE_LOW_SEEN in | |
507 | CASE_LABEL_EXPR | |
7e787821 | 508 | |
4d039f23 | 509 | PREDICT_EXPR_OUTCOME in |
510 | PREDICT_EXPR | |
511 | ||
7e787821 | 512 | static_flag: |
513 | ||
514 | TREE_STATIC in | |
eba15a75 | 515 | VAR_DECL, FUNCTION_DECL |
516 | CONSTRUCTOR | |
517 | ||
518 | TREE_NO_TRAMPOLINE in | |
519 | ADDR_EXPR | |
520 | ||
2cfde4f3 | 521 | BINFO_VIRTUAL_P in |
57c28194 | 522 | TREE_BINFO |
eba15a75 | 523 | |
7e787821 | 524 | TREE_SYMBOL_REFERENCED in |
525 | IDENTIFIER_NODE | |
eba15a75 | 526 | |
a9bc793b | 527 | CLEANUP_EH_ONLY in |
dddab69e | 528 | TARGET_EXPR, WITH_CLEANUP_EXPR |
eba15a75 | 529 | |
0bc060a4 | 530 | TRY_CATCH_IS_CLEANUP in |
531 | TRY_CATCH_EXPR | |
eba15a75 | 532 | |
4ee9c684 | 533 | ASM_INPUT_P in |
534 | ASM_EXPR | |
eba15a75 | 535 | |
b24423db | 536 | TYPE_REF_CAN_ALIAS_ALL in |
537 | POINTER_TYPE, REFERENCE_TYPE | |
eba15a75 | 538 | |
28d5335f | 539 | CASE_HIGH_SEEN in |
eba15a75 | 540 | CASE_LABEL_EXPR |
541 | ||
7765d0db | 542 | ENUM_IS_SCOPED in |
543 | ENUMERAL_TYPE | |
7e787821 | 544 | |
4c0315d0 | 545 | TRANSACTION_EXPR_OUTER in |
546 | TRANSACTION_EXPR | |
547 | ||
7e787821 | 548 | public_flag: |
549 | ||
550 | TREE_OVERFLOW in | |
886cfd4f | 551 | INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST |
eba15a75 | 552 | |
7e787821 | 553 | TREE_PUBLIC in |
eba15a75 | 554 | VAR_DECL, FUNCTION_DECL |
555 | IDENTIFIER_NODE | |
556 | ||
4ee9c684 | 557 | ASM_VOLATILE_P in |
558 | ASM_EXPR | |
eba15a75 | 559 | |
48dc2227 | 560 | CALL_EXPR_VA_ARG_PACK in |
eba15a75 | 561 | CALL_EXPR |
562 | ||
00b76131 | 563 | TYPE_CACHED_VALUES_P in |
eba15a75 | 564 | all types |
565 | ||
0c8fe10f | 566 | SAVE_EXPR_RESOLVED_P in |
eba15a75 | 567 | SAVE_EXPR |
568 | ||
1e8e9920 | 569 | OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in |
eba15a75 | 570 | OMP_CLAUSE_LASTPRIVATE |
571 | ||
1e8e9920 | 572 | OMP_CLAUSE_PRIVATE_DEBUG in |
eba15a75 | 573 | OMP_CLAUSE_PRIVATE |
7e787821 | 574 | |
3d483a94 | 575 | OMP_CLAUSE_LINEAR_NO_COPYIN in |
576 | OMP_CLAUSE_LINEAR | |
577 | ||
4c0315d0 | 578 | TRANSACTION_EXPR_RELAXED in |
579 | TRANSACTION_EXPR | |
580 | ||
7e787821 | 581 | private_flag: |
582 | ||
7e787821 | 583 | TREE_PRIVATE in |
eba15a75 | 584 | all decls |
585 | ||
ea523851 | 586 | CALL_EXPR_RETURN_SLOT_OPT in |
805e22b2 | 587 | CALL_EXPR |
eba15a75 | 588 | |
61e47ac8 | 589 | OMP_SECTION_LAST in |
eba15a75 | 590 | OMP_SECTION |
591 | ||
87f7c31e | 592 | OMP_PARALLEL_COMBINED in |
eba15a75 | 593 | OMP_PARALLEL |
4d039f23 | 594 | |
fd6481cf | 595 | OMP_CLAUSE_PRIVATE_OUTER_REF in |
596 | OMP_CLAUSE_PRIVATE | |
7e787821 | 597 | |
3d483a94 | 598 | OMP_CLAUSE_LINEAR_NO_COPYOUT in |
599 | OMP_CLAUSE_LINEAR | |
600 | ||
678b5e9b | 601 | TYPE_REF_IS_RVALUE in |
602 | REFERENCE_TYPE | |
603 | ||
4d039f23 | 604 | ENUM_IS_OPAQUE in |
605 | ENUMERAL_TYPE | |
606 | ||
7e787821 | 607 | protected_flag: |
608 | ||
7e787821 | 609 | TREE_PROTECTED in |
610 | BLOCK | |
eba15a75 | 611 | all decls |
612 | ||
990495a7 | 613 | CALL_FROM_THUNK_P and |
a882d754 | 614 | CALL_ALLOCA_FOR_VAR_P in |
491e04ef | 615 | CALL_EXPR |
7e787821 | 616 | |
617 | side_effects_flag: | |
618 | ||
619 | TREE_SIDE_EFFECTS in | |
620 | all expressions | |
eba15a75 | 621 | all decls |
622 | all constants | |
7e787821 | 623 | |
4ee9c684 | 624 | FORCED_LABEL in |
eba15a75 | 625 | LABEL_DECL |
4ee9c684 | 626 | |
7e787821 | 627 | volatile_flag: |
628 | ||
629 | TREE_THIS_VOLATILE in | |
630 | all expressions | |
eba15a75 | 631 | all decls |
632 | ||
7e787821 | 633 | TYPE_VOLATILE in |
eba15a75 | 634 | all types |
7e787821 | 635 | |
636 | readonly_flag: | |
637 | ||
638 | TREE_READONLY in | |
997d68fe | 639 | all expressions |
eba15a75 | 640 | all decls |
641 | ||
7e787821 | 642 | TYPE_READONLY in |
eba15a75 | 643 | all types |
7e787821 | 644 | |
645 | constant_flag: | |
646 | ||
647 | TREE_CONSTANT in | |
648 | all expressions | |
eba15a75 | 649 | all decls |
650 | all constants | |
651 | ||
652 | TYPE_SIZES_GIMPLIFIED in | |
653 | all types | |
7e787821 | 654 | |
7e787821 | 655 | unsigned_flag: |
656 | ||
78a8ed03 | 657 | TYPE_UNSIGNED in |
658 | all types | |
eba15a75 | 659 | |
86ae60fd | 660 | DECL_UNSIGNED in |
661 | all decls | |
7e787821 | 662 | |
663 | asm_written_flag: | |
664 | ||
665 | TREE_ASM_WRITTEN in | |
bace6acf | 666 | VAR_DECL, FUNCTION_DECL, TYPE_DECL |
eba15a75 | 667 | RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE |
87d8f7b6 | 668 | BLOCK, STRING_CST |
669 | ||
670 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI in | |
671 | SSA_NAME | |
eba15a75 | 672 | |
7e787821 | 673 | used_flag: |
674 | ||
675 | TREE_USED in | |
eba15a75 | 676 | all expressions |
677 | all decls | |
678 | IDENTIFIER_NODE | |
7e787821 | 679 | |
00dd2e9e | 680 | nothrow_flag: |
7e787821 | 681 | |
00dd2e9e | 682 | TREE_NOTHROW in |
eba15a75 | 683 | CALL_EXPR |
684 | FUNCTION_DECL | |
7e787821 | 685 | |
9f5f9308 | 686 | TYPE_ALIGN_OK in |
eba15a75 | 687 | all types |
9f5f9308 | 688 | |
010d0641 | 689 | TREE_THIS_NOTRAP in |
b93508c0 | 690 | INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF |
010d0641 | 691 | |
87d8f7b6 | 692 | SSA_NAME_IN_FREELIST in |
693 | SSA_NAME | |
694 | ||
88da234d | 695 | deprecated_flag: |
696 | ||
eba15a75 | 697 | TREE_DEPRECATED in |
698 | all decls | |
e0213ecc | 699 | all types |
eba15a75 | 700 | |
701 | IDENTIFIER_TRANSPARENT_ALIAS in | |
702 | IDENTIFIER_NODE | |
eaa112a0 | 703 | |
4ee9c684 | 704 | visited: |
705 | ||
eba15a75 | 706 | TREE_VISITED in |
707 | all trees (used liberally by many passes) | |
4ee9c684 | 708 | |
06f0b99c | 709 | saturating_flag: |
710 | ||
711 | TYPE_SATURATING in | |
712 | all types | |
713 | ||
5084b2e4 | 714 | VAR_DECL_IS_VIRTUAL_OPERAND in |
715 | VAR_DECL | |
716 | ||
4ee9c684 | 717 | nowarning_flag: |
718 | ||
719 | TREE_NO_WARNING in | |
eba15a75 | 720 | all expressions |
721 | all decls | |
722 | ||
5bf971ee | 723 | TYPE_ARTIFICIAL in |
724 | all types | |
725 | ||
eba15a75 | 726 | default_def_flag: |
727 | ||
e0213ecc | 728 | TYPE_VECTOR_OPAQUE in |
729 | VECTOR_TYPE | |
730 | ||
eba15a75 | 731 | SSA_NAME_IS_DEFAULT_DEF in |
732 | SSA_NAME | |
05c14132 | 733 | |
734 | DECL_NONLOCAL_FRAME in | |
735 | VAR_DECL | |
585bb356 | 736 | |
737 | TYPE_FINAL_P in | |
738 | RECORD_TYPE, UNION_TYPE and QUAL_UNION_TYPE | |
88da234d | 739 | */ |
eba15a75 | 740 | |
87d8f7b6 | 741 | struct GTY(()) tree_typed { |
742 | struct tree_base base; | |
743 | tree type; | |
744 | }; | |
745 | ||
746 | struct GTY(()) tree_common { | |
747 | struct tree_typed typed; | |
748 | tree chain; | |
749 | }; | |
750 | ||
5ded8c6f | 751 | #undef DEFTREESTRUCT |
752 | #define DEFTREESTRUCT(ENUM, NAME) ENUM, | |
753 | enum tree_node_structure_enum { | |
754 | #include "treestruct.def" | |
755 | LAST_TS_ENUM | |
756 | }; | |
757 | #undef DEFTREESTRUCT | |
716fc477 | 758 | |
d72a838e | 759 | /* Define accessors for the fields that all tree nodes have |
760 | (though some fields are not used for all kinds of nodes). */ | |
761 | ||
762 | /* The tree-code says what kind of node it is. | |
763 | Codes are defined in tree.def. */ | |
35cc02b5 | 764 | #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) |
765 | #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) | |
d72a838e | 766 | |
3e207e38 | 767 | /* When checking is enabled, errors will be generated if a tree node |
1fa3a8f6 | 768 | is accessed incorrectly. The macros die with a fatal error. */ |
0c4e40c5 | 769 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
3e207e38 | 770 | |
2b15d2ba | 771 | #define TREE_CHECK(T, CODE) \ |
772 | (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) | |
773 | ||
774 | #define TREE_NOT_CHECK(T, CODE) \ | |
775 | (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) | |
776 | ||
777 | #define TREE_CHECK2(T, CODE1, CODE2) \ | |
778 | (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) | |
779 | ||
780 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) \ | |
781 | (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) | |
782 | ||
783 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ | |
784 | (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) | |
785 | ||
786 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ | |
787 | (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ | |
788 | (CODE1), (CODE2), (CODE3))) | |
789 | ||
790 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ | |
791 | (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ | |
792 | (CODE1), (CODE2), (CODE3), (CODE4))) | |
793 | ||
794 | #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ | |
795 | (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ | |
796 | (CODE1), (CODE2), (CODE3), (CODE4))) | |
797 | ||
798 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ | |
799 | (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ | |
800 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) | |
801 | ||
802 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ | |
803 | (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ | |
804 | (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) | |
805 | ||
806 | #define CONTAINS_STRUCT_CHECK(T, STRUCT) \ | |
807 | (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) | |
808 | ||
809 | #define TREE_CLASS_CHECK(T, CLASS) \ | |
810 | (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) | |
811 | ||
812 | #define TREE_RANGE_CHECK(T, CODE1, CODE2) \ | |
813 | (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) | |
814 | ||
815 | #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ | |
816 | (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) | |
817 | ||
818 | #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ | |
819 | (omp_clause_range_check ((T), (CODE1), (CODE2), \ | |
820 | __FILE__, __LINE__, __FUNCTION__)) | |
55d6e7cd | 821 | |
a4070a91 | 822 | /* These checks have to be special cased. */ |
2b15d2ba | 823 | #define EXPR_CHECK(T) \ |
824 | (expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) | |
66d12a6c | 825 | |
826 | /* These checks have to be special cased. */ | |
2b15d2ba | 827 | #define NON_TYPE_CHECK(T) \ |
828 | (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) | |
829 | ||
830 | #define TREE_VEC_ELT_CHECK(T, I) \ | |
831 | (*(CONST_CAST2 (tree *, typeof (T)*, \ | |
832 | tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) | |
833 | ||
834 | #define OMP_CLAUSE_ELT_CHECK(T, I) \ | |
835 | (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) | |
55d6e7cd | 836 | |
2fcde217 | 837 | /* Special checks for TREE_OPERANDs. */ |
2b15d2ba | 838 | #define TREE_OPERAND_CHECK(T, I) \ |
839 | (*(CONST_CAST2 (tree*, typeof (T)*, \ | |
840 | tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) | |
841 | ||
842 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ | |
843 | (*(tree_operand_check_code ((T), (CODE), (I), \ | |
844 | __FILE__, __LINE__, __FUNCTION__))) | |
2fcde217 | 845 | |
35cc02b5 | 846 | /* Nodes are chained together for many purposes. |
847 | Types are chained together to record them for being output to the debugger | |
848 | (see the function `chain_type'). | |
849 | Decls in the same scope are chained together to record the contents | |
850 | of the scope. | |
851 | Statement nodes for successive statements used to be chained together. | |
852 | Often lists of things are represented by TREE_LIST nodes that | |
853 | are chained together. */ | |
854 | ||
2b15d2ba | 855 | #define TREE_CHAIN(NODE) \ |
856 | (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) | |
35cc02b5 | 857 | |
858 | /* In all nodes that are expressions, this is the data type of the expression. | |
859 | In POINTER_TYPE nodes, this is the type that the pointer points to. | |
860 | In ARRAY_TYPE nodes, this is the type of the elements. | |
861 | In VECTOR_TYPE nodes, this is the type of the elements. */ | |
2b15d2ba | 862 | #define TREE_TYPE(NODE) \ |
863 | (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) | |
35cc02b5 | 864 | |
aae87fc3 | 865 | extern void tree_contains_struct_check_failed (const_tree, |
7bd4091f | 866 | const enum tree_node_structure_enum, |
5ded8c6f | 867 | const char *, int, const char *) |
868 | ATTRIBUTE_NORETURN; | |
869 | ||
aae87fc3 | 870 | extern void tree_check_failed (const_tree, const char *, int, const char *, |
36066e37 | 871 | ...) ATTRIBUTE_NORETURN; |
aae87fc3 | 872 | extern void tree_not_check_failed (const_tree, const char *, int, const char *, |
36066e37 | 873 | ...) ATTRIBUTE_NORETURN; |
aae87fc3 | 874 | extern void tree_class_check_failed (const_tree, const enum tree_code_class, |
60b8c5b3 | 875 | const char *, int, const char *) |
a4070a91 | 876 | ATTRIBUTE_NORETURN; |
aae87fc3 | 877 | extern void tree_range_check_failed (const_tree, const char *, int, |
1e8e9920 | 878 | const char *, enum tree_code, |
cded957c | 879 | enum tree_code) |
880 | ATTRIBUTE_NORETURN; | |
aae87fc3 | 881 | extern void tree_not_class_check_failed (const_tree, |
59db13d3 | 882 | const enum tree_code_class, |
883 | const char *, int, const char *) | |
884 | ATTRIBUTE_NORETURN; | |
60b8c5b3 | 885 | extern void tree_vec_elt_check_failed (int, int, const char *, |
886 | int, const char *) | |
66bc87db | 887 | ATTRIBUTE_NORETURN; |
4ee9c684 | 888 | extern void phi_node_elt_check_failed (int, int, const char *, |
889 | int, const char *) | |
890 | ATTRIBUTE_NORETURN; | |
aae87fc3 | 891 | extern void tree_operand_check_failed (int, const_tree, |
60b8c5b3 | 892 | const char *, int, const char *) |
2fcde217 | 893 | ATTRIBUTE_NORETURN; |
aae87fc3 | 894 | extern void omp_clause_check_failed (const_tree, const char *, int, |
55d6e7cd | 895 | const char *, enum omp_clause_code) |
896 | ATTRIBUTE_NORETURN; | |
720082dc | 897 | extern void omp_clause_operand_check_failed (int, const_tree, const char *, |
55d6e7cd | 898 | int, const char *) |
899 | ATTRIBUTE_NORETURN; | |
aae87fc3 | 900 | extern void omp_clause_range_check_failed (const_tree, const char *, int, |
55d6e7cd | 901 | const char *, enum omp_clause_code, |
902 | enum omp_clause_code) | |
903 | ATTRIBUTE_NORETURN; | |
60b8c5b3 | 904 | |
0c4e40c5 | 905 | #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
3e207e38 | 906 | |
5ded8c6f | 907 | #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) |
82bb2115 | 908 | #define TREE_CHECK(T, CODE) (T) |
36066e37 | 909 | #define TREE_NOT_CHECK(T, CODE) (T) |
82bb2115 | 910 | #define TREE_CHECK2(T, CODE1, CODE2) (T) |
36066e37 | 911 | #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) |
82bb2115 | 912 | #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) |
36066e37 | 913 | #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) |
b24423db | 914 | #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
36066e37 | 915 | #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
82bb2115 | 916 | #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
36066e37 | 917 | #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
82bb2115 | 918 | #define TREE_CLASS_CHECK(T, CODE) (T) |
1e8e9920 | 919 | #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) |
82bb2115 | 920 | #define EXPR_CHECK(T) (T) |
66d12a6c | 921 | #define NON_TYPE_CHECK(T) (T) |
82bb2115 | 922 | #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
923 | #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) | |
924 | #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) | |
55d6e7cd | 925 | #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) |
926 | #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) | |
07d32e01 | 927 | #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) |
a4070a91 | 928 | |
35cc02b5 | 929 | #define TREE_CHAIN(NODE) ((NODE)->common.chain) |
1646aa85 | 930 | #define TREE_TYPE(NODE) ((NODE)->typed.type) |
35cc02b5 | 931 | |
a4070a91 | 932 | #endif |
933 | ||
5169661d | 934 | #define TREE_BLOCK(NODE) (tree_block (NODE)) |
935 | #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) | |
4ee9c684 | 936 | |
a4070a91 | 937 | #include "tree-check.h" |
938 | ||
ce45a448 | 939 | #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) |
5ded8c6f | 940 | #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) |
941 | #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) | |
942 | #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) | |
943 | #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) | |
944 | #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) | |
ce45a448 | 945 | #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) |
946 | #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) | |
c2f47e15 | 947 | #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) |
82bb2115 | 948 | #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
b24423db | 949 | #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
82bb2115 | 950 | |
3cb98335 | 951 | #define RECORD_OR_UNION_CHECK(T) \ |
82bb2115 | 952 | TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
3cb98335 | 953 | #define NOT_RECORD_OR_UNION_CHECK(T) \ |
954 | TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) | |
491e04ef | 955 | |
82bb2115 | 956 | #define NUMERICAL_TYPE_CHECK(T) \ |
06f0b99c | 957 | TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ |
958 | FIXED_POINT_TYPE) | |
3e207e38 | 959 | |
3609f4f0 | 960 | /* Here is how primitive or already-canonicalized types' hash codes |
961 | are made. */ | |
908e5f41 | 962 | #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
963 | ||
964 | /* A simple hash function for an arbitrary tree node. This must not be | |
965 | used in hash tables which are saved to a PCH. */ | |
966 | #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) | |
3609f4f0 | 967 | |
75a70cf9 | 968 | /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ |
d9659041 | 969 | #define CONVERT_EXPR_CODE_P(CODE) \ |
75a70cf9 | 970 | ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) |
72dd6141 | 971 | |
75a70cf9 | 972 | /* Similarly, but accept an expressions instead of a tree code. */ |
d9659041 | 973 | #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) |
72dd6141 | 974 | |
975 | /* Generate case for NOP_EXPR, CONVERT_EXPR. */ | |
976 | ||
977 | #define CASE_CONVERT \ | |
978 | case NOP_EXPR: \ | |
979 | case CONVERT_EXPR | |
980 | ||
98112881 | 981 | /* Given an expression as a tree, strip any conversion that generates |
982 | no instruction. Accepts both tree and const_tree arguments since | |
983 | we are not modifying the tree itself. */ | |
d72a838e | 984 | |
98112881 | 985 | #define STRIP_NOPS(EXP) \ |
986 | (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) | |
f2bfbd07 | 987 | |
155b05dc | 988 | /* Like STRIP_NOPS, but don't let the signedness change either. */ |
989 | ||
990 | #define STRIP_SIGN_NOPS(EXP) \ | |
98112881 | 991 | (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) |
155b05dc | 992 | |
f2bfbd07 | 993 | /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
994 | ||
995 | #define STRIP_TYPE_NOPS(EXP) \ | |
72dd6141 | 996 | while ((CONVERT_EXPR_P (EXP) \ |
f2bfbd07 | 997 | || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ |
bdcbc557 | 998 | && TREE_OPERAND (EXP, 0) != error_mark_node \ |
f2bfbd07 | 999 | && (TREE_TYPE (EXP) \ |
1000 | == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ | |
7ec74242 | 1001 | (EXP) = TREE_OPERAND (EXP, 0) |
ffcb8a96 | 1002 | |
4ee9c684 | 1003 | /* Remove unnecessary type conversions according to |
1004 | tree_ssa_useless_type_conversion. */ | |
1005 | ||
98112881 | 1006 | #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ |
1007 | (EXP) = tree_ssa_strip_useless_type_conversions (EXP) | |
4ee9c684 | 1008 | |
8ee286c8 | 1009 | /* Nonzero if TYPE represents a vector type. */ |
1010 | ||
1011 | #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE) | |
1012 | ||
ffcb8a96 | 1013 | /* Nonzero if TYPE represents an integral type. Note that we do not |
9843a47d | 1014 | include COMPLEX types here. Keep these checks in ascending code |
f7f07c95 | 1015 | order. */ |
ffcb8a96 | 1016 | |
1017 | #define INTEGRAL_TYPE_P(TYPE) \ | |
9843a47d | 1018 | (TREE_CODE (TYPE) == ENUMERAL_TYPE \ |
1019 | || TREE_CODE (TYPE) == BOOLEAN_TYPE \ | |
9843a47d | 1020 | || TREE_CODE (TYPE) == INTEGER_TYPE) |
ffcb8a96 | 1021 | |
06f0b99c | 1022 | /* Nonzero if TYPE represents a non-saturating fixed-point type. */ |
1023 | ||
1024 | #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ | |
1025 | (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) | |
1026 | ||
1027 | /* Nonzero if TYPE represents a saturating fixed-point type. */ | |
1028 | ||
1029 | #define SAT_FIXED_POINT_TYPE_P(TYPE) \ | |
1030 | (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) | |
1031 | ||
1032 | /* Nonzero if TYPE represents a fixed-point type. */ | |
1033 | ||
1034 | #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) | |
1035 | ||
4b69983d | 1036 | /* Nonzero if TYPE represents a scalar floating-point type. */ |
1037 | ||
1038 | #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) | |
1039 | ||
1040 | /* Nonzero if TYPE represents a complex floating-point type. */ | |
1041 | ||
1042 | #define COMPLEX_FLOAT_TYPE_P(TYPE) \ | |
1043 | (TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
1044 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) | |
1045 | ||
b423d9f7 | 1046 | /* Nonzero if TYPE represents a vector integer type. */ |
1047 | ||
8ee286c8 | 1048 | #define VECTOR_INTEGER_TYPE_P(TYPE) \ |
1049 | (VECTOR_TYPE_P (TYPE) \ | |
1050 | && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) | |
b423d9f7 | 1051 | |
1052 | ||
4c779744 | 1053 | /* Nonzero if TYPE represents a vector floating-point type. */ |
1054 | ||
1055 | #define VECTOR_FLOAT_TYPE_P(TYPE) \ | |
8ee286c8 | 1056 | (VECTOR_TYPE_P (TYPE) \ |
4c779744 | 1057 | && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) |
1058 | ||
ffcb8a96 | 1059 | /* Nonzero if TYPE represents a floating-point type, including complex |
9843a47d | 1060 | and vector floating-point types. The vector and complex check does |
1061 | not use the previous two macros to enable early folding. */ | |
ffcb8a96 | 1062 | |
9843a47d | 1063 | #define FLOAT_TYPE_P(TYPE) \ |
1064 | (SCALAR_FLOAT_TYPE_P (TYPE) \ | |
1065 | || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ | |
8ee286c8 | 1066 | || VECTOR_TYPE_P (TYPE)) \ |
9843a47d | 1067 | && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) |
68db3216 | 1068 | |
e5d0ba06 | 1069 | /* Nonzero if TYPE represents a decimal floating-point type. */ |
1070 | #define DECIMAL_FLOAT_TYPE_P(TYPE) \ | |
1071 | (SCALAR_FLOAT_TYPE_P (TYPE) \ | |
1072 | && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) | |
1073 | ||
969443c4 | 1074 | /* Nonzero if TYPE is a record or union type. */ |
1075 | #define RECORD_OR_UNION_TYPE_P(TYPE) \ | |
1076 | (TREE_CODE (TYPE) == RECORD_TYPE \ | |
1077 | || TREE_CODE (TYPE) == UNION_TYPE \ | |
1078 | || TREE_CODE (TYPE) == QUAL_UNION_TYPE) | |
1079 | ||
9843a47d | 1080 | /* Nonzero if TYPE represents an aggregate (multi-component) type. |
1081 | Keep these checks in ascending code order. */ | |
68db3216 | 1082 | |
1083 | #define AGGREGATE_TYPE_P(TYPE) \ | |
969443c4 | 1084 | (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) |
e57949ab | 1085 | |
1c15359d | 1086 | /* Nonzero if TYPE represents a pointer or reference type. |
9843a47d | 1087 | (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in |
1088 | ascending code order. */ | |
e57949ab | 1089 | |
1090 | #define POINTER_TYPE_P(TYPE) \ | |
1091 | (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) | |
1071e86e | 1092 | |
08fc5390 | 1093 | /* Nonzero if TYPE represents a pointer to function. */ |
1094 | #define FUNCTION_POINTER_TYPE_P(TYPE) \ | |
1095 | (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) | |
1096 | ||
4b72716d | 1097 | /* Nonzero if this type is a complete type. */ |
1098 | #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) | |
1099 | ||
5c803577 | 1100 | /* Nonzero if this type is the (possibly qualified) void type. */ |
c92b3a11 | 1101 | #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
5c803577 | 1102 | |
4b72716d | 1103 | /* Nonzero if this type is complete or is cv void. */ |
1104 | #define COMPLETE_OR_VOID_TYPE_P(NODE) \ | |
56ba46a4 | 1105 | (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
4b72716d | 1106 | |
1107 | /* Nonzero if this type is complete or is an array with unspecified bound. */ | |
1108 | #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ | |
7ec74242 | 1109 | (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
4b72716d | 1110 | |
d72a838e | 1111 | \f |
1112 | /* Define many boolean fields that all tree nodes have. */ | |
1113 | ||
a353dfef | 1114 | /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address |
1115 | of this is needed. So it cannot be in a register. | |
2c91799f | 1116 | In a FUNCTION_DECL it has no meaning. |
6c34d0c2 | 1117 | In LABEL_DECL nodes, it means a goto for this label has been seen |
d72a838e | 1118 | from a place outside all binding contours that restore stack levels. |
f7b5f694 | 1119 | In an artificial SSA_NAME that points to a stack partition with at least |
1120 | two variables, it means that at least one variable has TREE_ADDRESSABLE. | |
4cd5bb61 | 1121 | In ..._TYPE nodes, it means that objects of this type must be fully |
1122 | addressable. This means that pieces of this object cannot go into | |
1123 | register parameters, for example. If this a function type, this | |
1124 | means that the value must be returned in memory. | |
f7b5f694 | 1125 | In CONSTRUCTOR nodes, it means object constructed must be in memory. |
d72a838e | 1126 | In IDENTIFIER_NODEs, this means that some extern decl for this name |
f7b5f694 | 1127 | had its address taken. That matters for inline functions. |
1128 | In a STMT_EXPR, it means we want the result of the enclosed expression. */ | |
35cc02b5 | 1129 | #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) |
d72a838e | 1130 | |
6070c035 | 1131 | /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the |
1132 | exit of a function. Calls for which this is true are candidates for tail | |
1133 | call optimizations. */ | |
35cc02b5 | 1134 | #define CALL_EXPR_TAILCALL(NODE) \ |
1135 | (CALL_EXPR_CHECK(NODE)->base.addressable_flag) | |
4ee9c684 | 1136 | |
359d87c6 | 1137 | /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the |
1138 | CASE_LOW operand has been processed. */ | |
1139 | #define CASE_LOW_SEEN(NODE) \ | |
35cc02b5 | 1140 | (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) |
359d87c6 | 1141 | |
4a1849e3 | 1142 | #define PREDICT_EXPR_OUTCOME(NODE) \ |
b9c74b4d | 1143 | ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)) |
1144 | #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ | |
1145 | (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME) | |
4a1849e3 | 1146 | #define PREDICT_EXPR_PREDICTOR(NODE) \ |
1147 | ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0)) | |
1148 | ||
d72a838e | 1149 | /* In a VAR_DECL, nonzero means allocate static storage. |
bc3a4bfd | 1150 | In a FUNCTION_DECL, nonzero if function has been defined. |
eba15a75 | 1151 | In a CONSTRUCTOR, nonzero means allocate static storage. */ |
35cc02b5 | 1152 | #define TREE_STATIC(NODE) ((NODE)->base.static_flag) |
d72a838e | 1153 | |
eba15a75 | 1154 | /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ |
1155 | #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) | |
1156 | ||
0bc060a4 | 1157 | /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup |
dddab69e | 1158 | should only be executed if an exception is thrown, not on normal exit |
1159 | of its scope. */ | |
35cc02b5 | 1160 | #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) |
a9bc793b | 1161 | |
0bc060a4 | 1162 | /* In a TRY_CATCH_EXPR, means that the handler should be considered a |
1163 | separate cleanup in honor_protect_cleanup_actions. */ | |
1164 | #define TRY_CATCH_IS_CLEANUP(NODE) \ | |
1165 | (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) | |
1166 | ||
359d87c6 | 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) \ | |
35cc02b5 | 1170 | (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) |
359d87c6 | 1171 | |
7765d0db | 1172 | /* Used to mark scoped enums. */ |
1173 | #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) | |
28d5335f | 1174 | |
aa290616 | 1175 | /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ |
1176 | #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) | |
1177 | ||
4ee9c684 | 1178 | /* In an expr node (usually a conversion) this means the node was made |
55c151dc | 1179 | implicitly and should not lead to any sort of warning. In a decl node, |
1180 | warnings concerning the decl should be suppressed. This is used at | |
1181 | least for used-before-set warnings, and it set after one warning is | |
1182 | emitted. */ | |
35cc02b5 | 1183 | #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) |
d72a838e | 1184 | |
5bf971ee | 1185 | /* Used to indicate that this TYPE represents a compiler-generated entity. */ |
1186 | #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) | |
1187 | ||
2cf6f20a | 1188 | /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
1189 | this string as an argument. */ | |
56ba46a4 | 1190 | #define TREE_SYMBOL_REFERENCED(NODE) \ |
35cc02b5 | 1191 | (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) |
2cf6f20a | 1192 | |
b24423db | 1193 | /* Nonzero in a pointer or reference type means the data pointed to |
1194 | by this type can alias anything. */ | |
1195 | #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ | |
35cc02b5 | 1196 | (PTR_OR_REF_CHECK (NODE)->base.static_flag) |
b24423db | 1197 | |
886cfd4f | 1198 | /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
acfce21e | 1199 | there was an overflow in folding. */ |
b24423db | 1200 | |
35cc02b5 | 1201 | #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) |
7eec364c | 1202 | |
f170d67f | 1203 | /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ |
1204 | ||
1205 | #define TREE_OVERFLOW_P(EXPR) \ | |
1206 | (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) | |
1207 | ||
4a2849cb | 1208 | /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, |
807bf718 | 1209 | nonzero means name is to be accessible from outside this translation unit. |
1e5bfc66 | 1210 | In an IDENTIFIER_NODE, nonzero means an external declaration |
807bf718 | 1211 | accessible from outside this translation unit was previously seen |
d72a838e | 1212 | for this name in an inner scope. */ |
35cc02b5 | 1213 | #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) |
d72a838e | 1214 | |
00b76131 | 1215 | /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector |
1216 | of cached values, or is something else. */ | |
35cc02b5 | 1217 | #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag) |
0c8fe10f | 1218 | |
1219 | /* In a SAVE_EXPR, indicates that the original expression has already | |
1220 | been substituted with a VAR_DECL that contains the value. */ | |
1221 | #define SAVE_EXPR_RESOLVED_P(NODE) \ | |
eba15a75 | 1222 | (SAVE_EXPR_CHECK (NODE)->base.public_flag) |
00b76131 | 1223 | |
48dc2227 | 1224 | /* Set on a CALL_EXPR if this stdarg call should be passed the argument |
1225 | pack. */ | |
1226 | #define CALL_EXPR_VA_ARG_PACK(NODE) \ | |
1227 | (CALL_EXPR_CHECK(NODE)->base.public_flag) | |
1228 | ||
66d12a6c | 1229 | /* In any expression, decl, or constant, nonzero means it has side effects or |
1230 | reevaluation of the whole expression could produce a different value. | |
1231 | This is set if any subexpression is a function call, a side effect or a | |
1232 | reference to a volatile variable. In a ..._DECL, this is set only if the | |
1233 | declaration said `volatile'. This will never be set for a constant. */ | |
1234 | #define TREE_SIDE_EFFECTS(NODE) \ | |
35cc02b5 | 1235 | (NON_TYPE_CHECK (NODE)->base.side_effects_flag) |
d72a838e | 1236 | |
4ee9c684 | 1237 | /* In a LABEL_DECL, nonzero means this label had its address taken |
1238 | and therefore can never be deleted and is a jump target for | |
1239 | computed gotos. */ | |
eba15a75 | 1240 | #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) |
4ee9c684 | 1241 | |
d72a838e | 1242 | /* Nonzero means this expression is volatile in the C sense: |
1243 | its address should be of type `volatile WHATEVER *'. | |
1244 | In other words, the declared item is volatile qualified. | |
1245 | This is used in _DECL nodes and _REF nodes. | |
bcde7378 | 1246 | On a FUNCTION_DECL node, this means the function does not |
1247 | return normally. This is the same effect as setting | |
1248 | the attribute noreturn on the function in C. | |
d72a838e | 1249 | |
1250 | In a ..._TYPE node, means this type is volatile-qualified. | |
1251 | But use TYPE_VOLATILE instead of this macro when the node is a type, | |
1252 | because eventually we may make that a different bit. | |
1253 | ||
1254 | If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ | |
35cc02b5 | 1255 | #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) |
d72a838e | 1256 | |
010d0641 | 1257 | /* Nonzero means this node will not trap. In an INDIRECT_REF, means |
1258 | accessing the memory pointed to won't generate a trap. However, | |
1259 | this only applies to an object when used appropriately: it doesn't | |
5d9de213 | 1260 | mean that writing a READONLY mem won't trap. |
491e04ef | 1261 | |
7d23383d | 1262 | In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index |
1263 | (or slice of the array) always belongs to the range of the array. | |
1264 | I.e. that the access will not trap, provided that the access to | |
1265 | the base to the array will not trap. */ | |
b93508c0 | 1266 | #define TREE_THIS_NOTRAP(NODE) \ |
1267 | (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ | |
1268 | ARRAY_RANGE_REF)->base.nothrow_flag) | |
010d0641 | 1269 | |
d72a838e | 1270 | /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, |
48e1416a | 1271 | nonzero means it may not be the lhs of an assignment. |
9c2a0c05 | 1272 | Nonzero in a FUNCTION_DECL means this function should be treated |
1273 | as "const" function (can only read its arguments). */ | |
35cc02b5 | 1274 | #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) |
d72a838e | 1275 | |
66d12a6c | 1276 | /* Value of expression is constant. Always on in all ..._CST nodes. May |
1277 | also appear in an expression or decl where the value is constant. */ | |
35cc02b5 | 1278 | #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) |
d72a838e | 1279 | |
bc97b18f | 1280 | /* Nonzero if NODE, a type, has had its sizes gimplified. */ |
35cc02b5 | 1281 | #define TYPE_SIZES_GIMPLIFIED(NODE) \ |
1282 | (TYPE_CHECK (NODE)->base.constant_flag) | |
bc97b18f | 1283 | |
86ae60fd | 1284 | /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
35cc02b5 | 1285 | #define DECL_UNSIGNED(NODE) \ |
87d8f7b6 | 1286 | (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) |
86ae60fd | 1287 | |
78a8ed03 | 1288 | /* In integral and pointer types, means an unsigned type. */ |
87d8f7b6 | 1289 | #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) |
78a8ed03 | 1290 | |
0aca815c | 1291 | /* True if overflow wraps around for the given integral type. That |
1292 | is, TYPE_MAX + 1 == TYPE_MIN. */ | |
1293 | #define TYPE_OVERFLOW_WRAPS(TYPE) \ | |
1294 | (TYPE_UNSIGNED (TYPE) || flag_wrapv) | |
1295 | ||
1296 | /* True if overflow is undefined for the given integral type. We may | |
1297 | optimize on the assumption that values in the type never overflow. | |
1298 | ||
1299 | IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED | |
1300 | must issue a warning based on warn_strict_overflow. In some cases | |
1301 | it will be appropriate to issue the warning immediately, and in | |
1302 | other cases it will be appropriate to simply set a flag and let the | |
1303 | caller decide whether a warning is appropriate or not. */ | |
1304 | #define TYPE_OVERFLOW_UNDEFINED(TYPE) \ | |
1305 | (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow) | |
1306 | ||
1307 | /* True if overflow for the given integral type should issue a | |
1308 | trap. */ | |
1309 | #define TYPE_OVERFLOW_TRAPS(TYPE) \ | |
1310 | (!TYPE_UNSIGNED (TYPE) && flag_trapv) | |
1311 | ||
1312 | /* True if pointer types have undefined overflow. */ | |
1313 | #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow) | |
1314 | ||
9238c28d | 1315 | /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. |
d72a838e | 1316 | Nonzero in a FUNCTION_DECL means that the function has been compiled. |
1317 | This is interesting in an inline function, since it might not need | |
1318 | to be compiled separately. | |
bace6acf | 1319 | Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE |
1320 | or TYPE_DECL if the debugging info for the type has been written. | |
491e04ef | 1321 | In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
4ee9c684 | 1322 | In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal |
1323 | PHI node. */ | |
35cc02b5 | 1324 | #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) |
d72a838e | 1325 | |
1326 | /* Nonzero in a _DECL if the name is used in its scope. | |
1327 | Nonzero in an expr node means inhibit warning if value is unused. | |
1328 | In IDENTIFIER_NODEs, this means that some extern decl for this name | |
7bd4091f | 1329 | was used. |
7c0a8197 | 1330 | In a BLOCK, this means that the block contains variables that are used. */ |
35cc02b5 | 1331 | #define TREE_USED(NODE) ((NODE)->base.used_flag) |
d72a838e | 1332 | |
b93508c0 | 1333 | /* In a FUNCTION_DECL, nonzero means a call to the function cannot |
1334 | throw an exception. In a CALL_EXPR, nonzero means the call cannot | |
1335 | throw. We can't easily check the node type here as the C++ | |
1336 | frontend also uses this flag (for AGGR_INIT_EXPR). */ | |
8cf61389 | 1337 | #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) |
a9d9ab08 | 1338 | |
ea523851 | 1339 | /* In a CALL_EXPR, means that it's safe to use the target of the call |
1340 | expansion as the return slot for a call that returns in memory. */ | |
eba15a75 | 1341 | #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ |
1342 | (CALL_EXPR_CHECK (NODE)->base.private_flag) | |
805e22b2 | 1343 | |
7ac958de | 1344 | /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is |
1095d222 | 1345 | passed by invisible reference (and the TREE_TYPE is a pointer to the true |
1346 | type). */ | |
7ac958de | 1347 | #define DECL_BY_REFERENCE(NODE) \ |
1348 | (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ | |
1349 | RESULT_DECL)->decl_common.decl_by_reference_flag) | |
dddcebdc | 1350 | |
96cd09d2 | 1351 | /* In VAR_DECL and PARM_DECL, set when the decl has been used except for |
1352 | being set. */ | |
abc6c64f | 1353 | #define DECL_READ_P(NODE) \ |
1354 | (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) | |
1355 | ||
96cd09d2 | 1356 | /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes |
1357 | attempting to share the stack slot with some other variable. */ | |
c7c68014 | 1358 | #define DECL_NONSHAREABLE(NODE) \ |
1359 | (TREE_CHECK2 (NODE, VAR_DECL, \ | |
1360 | RESULT_DECL)->decl_common.decl_nonshareable_flag) | |
1361 | ||
eaa112a0 | 1362 | /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
1363 | thunked-to function. */ | |
eba15a75 | 1364 | #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) |
eaa112a0 | 1365 | |
990495a7 | 1366 | /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that |
1367 | it has been built for the declaration of a variable-sized object. */ | |
a882d754 | 1368 | #define CALL_ALLOCA_FOR_VAR_P(NODE) \ |
1369 | (CALL_EXPR_CHECK (NODE)->base.protected_flag) | |
990495a7 | 1370 | |
a9d9ab08 | 1371 | /* In a type, nonzero means that all objects of the type are guaranteed by the |
1372 | language or front-end to be properly aligned, so we can indicate that a MEM | |
1373 | of this type is aligned at least to the alignment of the type, even if it | |
1374 | doesn't appear that it is. We see this, for example, in object-oriented | |
1375 | languages where a tag field may show this is an object of a more-aligned | |
4ee9c684 | 1376 | variant of the more generic type. |
1377 | ||
1378 | In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME | |
1379 | freelist. */ | |
35cc02b5 | 1380 | #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) |
d72a838e | 1381 | |
bc3a4bfd | 1382 | /* Used in classes in C++. */ |
35cc02b5 | 1383 | #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) |
cee43f7e | 1384 | /* Used in classes in C++. */ |
35cc02b5 | 1385 | #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) |
d72a838e | 1386 | |
678b5e9b | 1387 | /* True if reference type NODE is a C++ rvalue reference. */ |
1388 | #define TYPE_REF_IS_RVALUE(NODE) \ | |
1389 | (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) | |
1390 | ||
f4a30bd7 | 1391 | /* Nonzero in a _DECL if the use of the name is defined as a |
88da234d | 1392 | deprecated feature by __attribute__((deprecated)). */ |
f4a30bd7 | 1393 | #define TREE_DEPRECATED(NODE) \ |
35cc02b5 | 1394 | ((NODE)->base.deprecated_flag) |
f4a30bd7 | 1395 | |
1396 | /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose | |
1397 | uses are to be substituted for uses of the TREE_CHAINed identifier. */ | |
1398 | #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ | |
35cc02b5 | 1399 | (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) |
88da234d | 1400 | |
06f0b99c | 1401 | /* In fixed-point types, means a saturating type. */ |
87d8f7b6 | 1402 | #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag) |
06f0b99c | 1403 | |
bc3a4bfd | 1404 | /* These flags are available for each language front end to use internally. */ |
87d8f7b6 | 1405 | #define TREE_LANG_FLAG_0(NODE) \ |
1406 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) | |
1407 | #define TREE_LANG_FLAG_1(NODE) \ | |
1408 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) | |
1409 | #define TREE_LANG_FLAG_2(NODE) \ | |
1410 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) | |
1411 | #define TREE_LANG_FLAG_3(NODE) \ | |
1412 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) | |
1413 | #define TREE_LANG_FLAG_4(NODE) \ | |
1414 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) | |
1415 | #define TREE_LANG_FLAG_5(NODE) \ | |
1416 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) | |
1417 | #define TREE_LANG_FLAG_6(NODE) \ | |
1418 | (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) | |
d72a838e | 1419 | \f |
1420 | /* Define additional fields and accessors for nodes representing constants. */ | |
1421 | ||
9e6d0a9a | 1422 | /* In an INTEGER_CST node. These two together make a 2-word integer. |
1423 | If the data type is signed, the value is sign-extended to 2 words | |
d72a838e | 1424 | even though not all of them may really be in use. |
9e6d0a9a | 1425 | In an unsigned constant shorter than 2 words, the extra bits are 0. */ |
2a8a276e | 1426 | #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) |
1427 | #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) | |
1428 | #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) | |
d72a838e | 1429 | |
76c6f48d | 1430 | #define INT_CST_LT(A, B) \ |
1431 | (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ | |
1432 | || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ | |
56ba46a4 | 1433 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
d72a838e | 1434 | |
76c6f48d | 1435 | #define INT_CST_LT_UNSIGNED(A, B) \ |
1436 | (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
1437 | < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ | |
1438 | || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ | |
6c34d0c2 | 1439 | == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ |
56ba46a4 | 1440 | && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) |
60b8c5b3 | 1441 | |
fb1e4f4a | 1442 | struct GTY(()) tree_int_cst { |
189737d2 | 1443 | struct tree_typed typed; |
99748102 | 1444 | double_int int_cst; |
d72a838e | 1445 | }; |
1446 | ||
479838ec | 1447 | /* In a REAL_CST node. struct real_value is an opaque entity, with |
ef258422 | 1448 | manipulators defined in real.h. We don't want tree.h depending on |
1449 | real.h and transitively on tm.h. */ | |
479838ec | 1450 | struct real_value; |
56ba46a4 | 1451 | |
ef258422 | 1452 | #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
1453 | #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) | |
d72a838e | 1454 | |
fb1e4f4a | 1455 | struct GTY(()) tree_real_cst { |
189737d2 | 1456 | struct tree_typed typed; |
479838ec | 1457 | struct real_value * real_cst_ptr; |
d72a838e | 1458 | }; |
1459 | ||
06f0b99c | 1460 | /* In a FIXED_CST node. */ |
1461 | struct fixed_value; | |
1462 | ||
eb65426a | 1463 | #define TREE_FIXED_CST_PTR(NODE) \ |
1464 | (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) | |
06f0b99c | 1465 | #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) |
1466 | ||
fb1e4f4a | 1467 | struct GTY(()) tree_fixed_cst { |
189737d2 | 1468 | struct tree_typed typed; |
06f0b99c | 1469 | struct fixed_value * fixed_cst_ptr; |
1470 | }; | |
1471 | ||
d72a838e | 1472 | /* In a STRING_CST */ |
21f01152 | 1473 | /* In C terms, this is sizeof, not strlen. */ |
3e207e38 | 1474 | #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
7d95f6a3 | 1475 | #define TREE_STRING_POINTER(NODE) \ |
1476 | ((const char *)(STRING_CST_CHECK (NODE)->string.str)) | |
d72a838e | 1477 | |
fb1e4f4a | 1478 | struct GTY(()) tree_string { |
189737d2 | 1479 | struct tree_typed typed; |
d72a838e | 1480 | int length; |
7d95f6a3 | 1481 | char str[1]; |
d72a838e | 1482 | }; |
1483 | ||
1484 | /* In a COMPLEX_CST node. */ | |
3e207e38 | 1485 | #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
1486 | #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) | |
d72a838e | 1487 | |
fb1e4f4a | 1488 | struct GTY(()) tree_complex { |
189737d2 | 1489 | struct tree_typed typed; |
6a3e3d6d | 1490 | tree real; |
1491 | tree imag; | |
d72a838e | 1492 | }; |
886cfd4f | 1493 | |
1494 | /* In a VECTOR_CST node. */ | |
dbe954dc | 1495 | #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE))) |
fadf62f4 | 1496 | #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts) |
1497 | #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX]) | |
886cfd4f | 1498 | |
fb1e4f4a | 1499 | struct GTY(()) tree_vector { |
189737d2 | 1500 | struct tree_typed typed; |
dbe954dc | 1501 | tree GTY ((length ("TYPE_VECTOR_SUBPARTS (TREE_TYPE ((tree)&%h))"))) elts[1]; |
886cfd4f | 1502 | }; |
d72a838e | 1503 | \f |
d856c8a6 | 1504 | #include "symtab.h" |
0d086e18 | 1505 | |
d72a838e | 1506 | /* Define fields and accessors for some special-purpose tree nodes. */ |
1507 | ||
0d086e18 | 1508 | #define IDENTIFIER_LENGTH(NODE) \ |
56ba46a4 | 1509 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
0d086e18 | 1510 | #define IDENTIFIER_POINTER(NODE) \ |
76c6f48d | 1511 | ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
af694375 | 1512 | #define IDENTIFIER_HASH_VALUE(NODE) \ |
1513 | (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) | |
0d086e18 | 1514 | |
1515 | /* Translate a hash table identifier pointer to a tree_identifier | |
1516 | pointer, and vice versa. */ | |
1517 | ||
1518 | #define HT_IDENT_TO_GCC_IDENT(NODE) \ | |
fc9c9e87 | 1519 | ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
56ba46a4 | 1520 | #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) |
d72a838e | 1521 | |
fb1e4f4a | 1522 | struct GTY(()) tree_identifier { |
fc9c9e87 | 1523 | struct tree_common common; |
0d086e18 | 1524 | struct ht_identifier id; |
d72a838e | 1525 | }; |
1526 | ||
1527 | /* In a TREE_LIST node. */ | |
3e207e38 | 1528 | #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
1529 | #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) | |
d72a838e | 1530 | |
fb1e4f4a | 1531 | struct GTY(()) tree_list { |
851dfbff | 1532 | struct tree_common common; |
6a3e3d6d | 1533 | tree purpose; |
1534 | tree value; | |
d72a838e | 1535 | }; |
1536 | ||
1537 | /* In a TREE_VEC node. */ | |
87d8f7b6 | 1538 | #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) |
56ba46a4 | 1539 | #define TREE_VEC_END(NODE) \ |
87d8f7b6 | 1540 | ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) |
d72a838e | 1541 | |
66bc87db | 1542 | #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
1543 | ||
fb1e4f4a | 1544 | struct GTY(()) tree_vec { |
851dfbff | 1545 | struct tree_common common; |
1f3233d1 | 1546 | tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; |
d72a838e | 1547 | }; |
1548 | ||
c75b4594 | 1549 | /* In a CONSTRUCTOR node. */ |
1550 | #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) | |
f82f1250 | 1551 | #define CONSTRUCTOR_ELT(NODE,IDX) \ |
f1f41a6c | 1552 | (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) |
eb65426a | 1553 | #define CONSTRUCTOR_NELTS(NODE) \ |
f1f41a6c | 1554 | (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) |
c75b4594 | 1555 | |
1556 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the | |
1557 | value of each element (stored within VAL). IX must be a scratch variable | |
1558 | of unsigned integer type. */ | |
1559 | #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ | |
f1f41a6c | 1560 | for (IX = 0; (IX >= vec_safe_length (V)) \ |
c75b4594 | 1561 | ? false \ |
f1f41a6c | 1562 | : ((VAL = (*(V))[IX].value), \ |
c75b4594 | 1563 | true); \ |
1564 | (IX)++) | |
1565 | ||
1566 | /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both | |
1567 | the value of each element (stored within VAL) and its index (stored | |
1568 | within INDEX). IX must be a scratch variable of unsigned integer type. */ | |
1569 | #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ | |
f1f41a6c | 1570 | for (IX = 0; (IX >= vec_safe_length (V)) \ |
c75b4594 | 1571 | ? false \ |
f1f41a6c | 1572 | : (((void) (VAL = (*V)[IX].value)), \ |
1573 | (INDEX = (*V)[IX].index), \ | |
4081d362 | 1574 | true); \ |
c75b4594 | 1575 | (IX)++) |
1576 | ||
1577 | /* Append a new constructor element to V, with the specified INDEX and VAL. */ | |
1578 | #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ | |
1579 | do { \ | |
e82e4eb5 | 1580 | constructor_elt _ce___ = {INDEX, VALUE}; \ |
f1f41a6c | 1581 | vec_safe_push ((V), _ce___); \ |
c75b4594 | 1582 | } while (0) |
1583 | ||
34a6a65d | 1584 | /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for |
1585 | constructor output purposes. */ | |
1586 | #define CONSTRUCTOR_BITFIELD_P(NODE) \ | |
1587 | (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) | |
1588 | ||
3c25489e | 1589 | /* True if NODE is a clobber right hand side, an expression of indeterminate |
1590 | value that clobbers the LHS in a copy instruction. We use a volatile | |
1591 | empty CONSTRUCTOR for this, as it matches most of the necessary semantic. | |
1592 | In particular the volatile flag causes us to not prematurely remove | |
1593 | such clobber instructions. */ | |
1594 | #define TREE_CLOBBER_P(NODE) \ | |
1595 | (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) | |
1596 | ||
c75b4594 | 1597 | /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the |
1598 | element. INDEX can optionally design the position of VALUE: in arrays, | |
1599 | it is the index where VALUE has to be placed; in structures, it is the | |
1600 | FIELD_DECL of the member. */ | |
fb1e4f4a | 1601 | typedef struct GTY(()) constructor_elt_d { |
c75b4594 | 1602 | tree index; |
1603 | tree value; | |
1604 | } constructor_elt; | |
1605 | ||
c75b4594 | 1606 | |
fb1e4f4a | 1607 | struct GTY(()) tree_constructor { |
d39db554 | 1608 | struct tree_typed typed; |
f1f41a6c | 1609 | vec<constructor_elt, va_gc> *elts; |
c75b4594 | 1610 | }; |
1611 | ||
d72a838e | 1612 | /* Define fields and accessors for some nodes that represent expressions. */ |
1613 | ||
365db11e | 1614 | /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
4ee9c684 | 1615 | #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
1616 | && VOID_TYPE_P (TREE_TYPE (NODE)) \ | |
1617 | && integer_zerop (TREE_OPERAND (NODE, 0))) | |
1618 | ||
f20853dd | 1619 | /* In ordinary expression nodes. */ |
c2f47e15 | 1620 | #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) |
2fcde217 | 1621 | #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
f20853dd | 1622 | |
c2f47e15 | 1623 | /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand |
1624 | length. Its value includes the length operand itself; that is, | |
1625 | the minimum valid length is 1. | |
1626 | Note that we have to bypass the use of TREE_OPERAND to access | |
1627 | that field to avoid infinite recursion in expanding the macros. */ | |
1628 | #define VL_EXP_OPERAND_LENGTH(NODE) \ | |
1629 | ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) | |
1630 | ||
9845d120 | 1631 | /* Nonzero if is_gimple_debug() may possibly hold. */ |
1632 | #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments) | |
1633 | ||
b50fb4a3 | 1634 | /* In a LOOP_EXPR node. */ |
2fcde217 | 1635 | #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
b50fb4a3 | 1636 | |
fdfe4b3f | 1637 | /* The source location of this expression. Non-tree_exp nodes such as |
1638 | decls and constants can be shared among multiple locations, so | |
1639 | return nothing. */ | |
eb65426a | 1640 | #define EXPR_LOCATION(NODE) \ |
de9d5a8c | 1641 | (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) |
75a70cf9 | 1642 | #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) |
8e7408e3 | 1643 | #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ |
1644 | != UNKNOWN_LOCATION) | |
5daea214 | 1645 | /* The location to be used in a diagnostic about this expression. Do not |
1646 | use this macro if the location will be assigned to other expressions. */ | |
b0e7825e | 1647 | #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \ |
1648 | ? (NODE)->exp.locus : input_location) | |
1649 | #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ | |
1650 | ? (NODE)->exp.locus : (LOCUS)) | |
75a70cf9 | 1651 | #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) |
1652 | #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) | |
35cc02b5 | 1653 | |
1654 | /* True if a tree is an expression or statement that can have a | |
1655 | location. */ | |
e60a6f7b | 1656 | #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) |
dae7d8ad | 1657 | |
dda49785 | 1658 | extern void protected_set_expr_location (tree, location_t); |
1659 | ||
7ebc28e0 | 1660 | /* In a TARGET_EXPR node. */ |
2fcde217 | 1661 | #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
1662 | #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) | |
1663 | #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) | |
7ebc28e0 | 1664 | |
7dd37241 | 1665 | /* DECL_EXPR accessor. This gives access to the DECL associated with |
1666 | the given declaration statement. */ | |
1667 | #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) | |
1668 | ||
4ee9c684 | 1669 | #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
1670 | ||
862f468c | 1671 | /* COMPOUND_LITERAL_EXPR accessors. */ |
1672 | #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ | |
1673 | TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) | |
1674 | #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ | |
1675 | DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) | |
1676 | ||
4ee9c684 | 1677 | /* SWITCH_EXPR accessors. These give access to the condition, body and |
1678 | original condition type (before any compiler conversions) | |
1679 | of the switch statement, respectively. */ | |
ffc8e524 | 1680 | #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) |
1681 | #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) | |
1682 | #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) | |
4ee9c684 | 1683 | |
eaae3b75 | 1684 | /* CASE_LABEL_EXPR accessors. These give access to the high and low values |
4ee9c684 | 1685 | of a case label, respectively. */ |
ffc8e524 | 1686 | #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) |
1687 | #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) | |
1688 | #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) | |
315119c9 | 1689 | #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) |
4ee9c684 | 1690 | |
28daba6f | 1691 | /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match |
1692 | corresponding MEM_REF operands. */ | |
1693 | #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) | |
1694 | #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) | |
aed164c3 | 1695 | #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) |
1696 | #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) | |
28daba6f | 1697 | #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) |
aed164c3 | 1698 | |
4ee9c684 | 1699 | /* The operands of a BIND_EXPR. */ |
1700 | #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) | |
1701 | #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) | |
1702 | #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) | |
1703 | ||
1704 | /* GOTO_EXPR accessor. This gives access to the label associated with | |
1705 | a goto statement. */ | |
1706 | #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) | |
1707 | ||
226c2452 | 1708 | /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the |
4ee9c684 | 1709 | instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and |
1710 | ASM_CLOBBERS represent the outputs, inputs, and clobbers for the | |
1711 | statement. */ | |
ffc8e524 | 1712 | #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) |
1713 | #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) | |
1714 | #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) | |
1715 | #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) | |
78f55ca8 | 1716 | #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) |
4ee9c684 | 1717 | /* Nonzero if we want to create an ASM_INPUT instead of an |
1718 | ASM_OPERAND with no operands. */ | |
eba15a75 | 1719 | #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) |
1720 | #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) | |
4ee9c684 | 1721 | |
1722 | /* COND_EXPR accessors. */ | |
1723 | #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) | |
1724 | #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) | |
1725 | #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) | |
1726 | ||
17519ba0 | 1727 | /* Accessors for the chains of recurrences. */ |
1728 | #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) | |
1729 | #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) | |
1730 | #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) | |
1731 | #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) | |
1732 | ||
4ee9c684 | 1733 | /* LABEL_EXPR accessor. This gives access to the label associated with |
1734 | the given label expression. */ | |
1735 | #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) | |
1736 | ||
1737 | /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other | |
1738 | accessors for SSA operands. */ | |
491e04ef | 1739 | |
4ee9c684 | 1740 | /* CATCH_EXPR accessors. */ |
1741 | #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) | |
1742 | #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) | |
1743 | ||
1744 | /* EH_FILTER_EXPR accessors. */ | |
1745 | #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) | |
1746 | #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) | |
4ee9c684 | 1747 | |
215e2f1d | 1748 | /* OBJ_TYPE_REF accessors. */ |
1749 | #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) | |
1750 | #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) | |
1751 | #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) | |
1752 | ||
88dbf20f | 1753 | /* ASSERT_EXPR accessors. */ |
1754 | #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) | |
1755 | #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) | |
1756 | ||
c2f47e15 | 1757 | /* CALL_EXPR accessors. |
1758 | */ | |
1759 | #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) | |
1760 | #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) | |
c2f47e15 | 1761 | #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) |
1762 | #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3) | |
1763 | ||
1764 | /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. | |
1765 | We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if | |
1766 | the argument count is zero when checking is enabled. Instead, do | |
1767 | the pointer arithmetic to advance past the 3 fixed operands in a | |
1768 | CALL_EXPR. That produces a valid pointer to just past the end of the | |
1769 | operand array, even if it's not valid to dereference it. */ | |
1770 | #define CALL_EXPR_ARGP(NODE) \ | |
1771 | (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) | |
1772 | ||
4c0315d0 | 1773 | /* TM directives and accessors. */ |
1774 | #define TRANSACTION_EXPR_BODY(NODE) \ | |
1775 | TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) | |
1776 | #define TRANSACTION_EXPR_OUTER(NODE) \ | |
1777 | (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) | |
1778 | #define TRANSACTION_EXPR_RELAXED(NODE) \ | |
1779 | (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) | |
1780 | ||
1e8e9920 | 1781 | /* OpenMP directive and clause accessors. */ |
1782 | ||
1783 | #define OMP_BODY(NODE) \ | |
1784 | TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0) | |
1785 | #define OMP_CLAUSES(NODE) \ | |
1786 | TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1) | |
1787 | ||
1788 | #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) | |
1789 | #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) | |
1790 | ||
fd6481cf | 1791 | #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) |
1792 | #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) | |
fd6481cf | 1793 | |
1794 | #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) | |
1795 | #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) | |
1796 | #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) | |
fd6481cf | 1797 | |
1e8e9920 | 1798 | #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0) |
1799 | #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1) | |
1800 | #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2) | |
1801 | #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3) | |
1802 | #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4) | |
1803 | #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5) | |
1804 | ||
1805 | #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) | |
1806 | #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) | |
1807 | ||
1808 | #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) | |
1809 | ||
1810 | #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) | |
1811 | #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) | |
1812 | ||
1813 | #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) | |
1814 | ||
1815 | #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) | |
1816 | ||
1817 | #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) | |
1818 | #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) | |
1819 | ||
55d6e7cd | 1820 | #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) |
1821 | #define OMP_CLAUSE_DECL(NODE) \ | |
1822 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ | |
1823 | OMP_CLAUSE_PRIVATE, \ | |
3d483a94 | 1824 | OMP_CLAUSE_UNIFORM), 0) |
e60a6f7b | 1825 | #define OMP_CLAUSE_HAS_LOCATION(NODE) \ |
8e7408e3 | 1826 | (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ |
1827 | != UNKNOWN_LOCATION) | |
e60a6f7b | 1828 | #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus |
1e8e9920 | 1829 | |
61e47ac8 | 1830 | /* True on an OMP_SECTION statement that was the last lexical member. |
1831 | This status is meaningful in the implementation of lastprivate. */ | |
1832 | #define OMP_SECTION_LAST(NODE) \ | |
eba15a75 | 1833 | (OMP_SECTION_CHECK (NODE)->base.private_flag) |
61e47ac8 | 1834 | |
87f7c31e | 1835 | /* True on an OMP_PARALLEL statement if it represents an explicit |
1836 | combined parallel work-sharing constructs. */ | |
1837 | #define OMP_PARALLEL_COMBINED(NODE) \ | |
eba15a75 | 1838 | (OMP_PARALLEL_CHECK (NODE)->base.private_flag) |
87f7c31e | 1839 | |
1e8e9920 | 1840 | /* True on a PRIVATE clause if its decl is kept around for debugging |
1841 | information only and its DECL_VALUE_EXPR is supposed to point | |
1842 | to what it has been remapped to. */ | |
1843 | #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ | |
eba15a75 | 1844 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) |
1e8e9920 | 1845 | |
fd6481cf | 1846 | /* True on a PRIVATE clause if ctor needs access to outer region's |
1847 | variable. */ | |
1848 | #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ | |
1849 | TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) | |
1850 | ||
1e8e9920 | 1851 | /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same |
1852 | decl is present in the chain. */ | |
1853 | #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ | |
eba15a75 | 1854 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) |
fd6481cf | 1855 | #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ |
1856 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ | |
1857 | OMP_CLAUSE_LASTPRIVATE),\ | |
1858 | 1) | |
75a70cf9 | 1859 | #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ |
1860 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init | |
1e8e9920 | 1861 | |
2169f33b | 1862 | #define OMP_CLAUSE_FINAL_EXPR(NODE) \ |
1863 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) | |
1e8e9920 | 1864 | #define OMP_CLAUSE_IF_EXPR(NODE) \ |
55d6e7cd | 1865 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) |
1e8e9920 | 1866 | #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ |
55d6e7cd | 1867 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) |
1e8e9920 | 1868 | #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ |
55d6e7cd | 1869 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) |
1e8e9920 | 1870 | |
fd6481cf | 1871 | #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ |
1872 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) | |
1873 | #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ | |
1874 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) | |
1875 | #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ | |
1876 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) | |
1877 | ||
1e8e9920 | 1878 | #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ |
55d6e7cd | 1879 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) |
1e8e9920 | 1880 | #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ |
55d6e7cd | 1881 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) |
1e8e9920 | 1882 | #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ |
55d6e7cd | 1883 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) |
75a70cf9 | 1884 | #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ |
1885 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init | |
1886 | #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ | |
1887 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge | |
1e8e9920 | 1888 | #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ |
55d6e7cd | 1889 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) |
1e8e9920 | 1890 | |
3d483a94 | 1891 | /* True if a LINEAR clause doesn't need copy in. True for iterator vars which |
1892 | are always initialized inside of the loop construct, false otherwise. */ | |
1893 | #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \ | |
1894 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag) | |
1895 | ||
1896 | /* True if a LINEAR clause doesn't need copy out. True for iterator vars which | |
1897 | are declared inside of the simd construct. */ | |
1898 | #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \ | |
1899 | TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) | |
1900 | ||
1901 | #define OMP_CLAUSE_LINEAR_STEP(NODE) \ | |
1902 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1) | |
1903 | ||
1904 | #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \ | |
1905 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0) | |
1906 | ||
1907 | #define OMP_CLAUSE__SIMDUID__DECL(NODE) \ | |
1908 | OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0) | |
1909 | ||
1e8e9920 | 1910 | enum omp_clause_schedule_kind |
1911 | { | |
1912 | OMP_CLAUSE_SCHEDULE_STATIC, | |
1913 | OMP_CLAUSE_SCHEDULE_DYNAMIC, | |
1914 | OMP_CLAUSE_SCHEDULE_GUIDED, | |
fd6481cf | 1915 | OMP_CLAUSE_SCHEDULE_AUTO, |
1e8e9920 | 1916 | OMP_CLAUSE_SCHEDULE_RUNTIME |
1917 | }; | |
1918 | ||
1919 | #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ | |
55d6e7cd | 1920 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) |
1e8e9920 | 1921 | |
1922 | enum omp_clause_default_kind | |
1923 | { | |
1924 | OMP_CLAUSE_DEFAULT_UNSPECIFIED, | |
1925 | OMP_CLAUSE_DEFAULT_SHARED, | |
1926 | OMP_CLAUSE_DEFAULT_NONE, | |
fd6481cf | 1927 | OMP_CLAUSE_DEFAULT_PRIVATE, |
1928 | OMP_CLAUSE_DEFAULT_FIRSTPRIVATE | |
1e8e9920 | 1929 | }; |
1930 | ||
1931 | #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ | |
55d6e7cd | 1932 | (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) |
1e8e9920 | 1933 | |
fb1e4f4a | 1934 | struct GTY(()) tree_exp { |
1e184c62 | 1935 | struct tree_typed typed; |
9c85a98a | 1936 | location_t locus; |
60b8c5b3 | 1937 | tree GTY ((special ("tree_exp"), |
1938 | desc ("TREE_CODE ((tree) &%0)"))) | |
1f3233d1 | 1939 | operands[1]; |
f20853dd | 1940 | }; |
1941 | \f | |
4ee9c684 | 1942 | /* SSA_NAME accessors. */ |
1943 | ||
ec11736b | 1944 | /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE |
1945 | if there is no name associated with it. */ | |
1946 | #define SSA_NAME_IDENTIFIER(NODE) \ | |
1947 | (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ | |
1948 | ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ | |
1949 | ? (NODE)->ssa_name.var \ | |
1950 | : DECL_NAME ((NODE)->ssa_name.var)) \ | |
1951 | : NULL_TREE) | |
1952 | ||
1953 | /* Returns the variable being referenced. This can be NULL_TREE for | |
1954 | temporaries not associated with any user variable. | |
1955 | Once released, this is the only field that can be relied upon. */ | |
1956 | #define SSA_NAME_VAR(NODE) \ | |
1957 | (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ | |
1958 | || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ | |
1959 | ? NULL_TREE : (NODE)->ssa_name.var) | |
1960 | ||
1961 | #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ | |
1962 | do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0) | |
4ee9c684 | 1963 | |
75a70cf9 | 1964 | /* Returns the statement which defines this SSA name. */ |
1965 | #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt | |
4ee9c684 | 1966 | |
1967 | /* Returns the SSA version number of this SSA name. Note that in | |
1968 | tree SSA, version numbers are not per variable and may be recycled. */ | |
87d8f7b6 | 1969 | #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version |
4ee9c684 | 1970 | |
1971 | /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are | |
1972 | never output, so we can safely use the ASM_WRITTEN_FLAG for this | |
1973 | status bit. */ | |
1974 | #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ | |
35cc02b5 | 1975 | SSA_NAME_CHECK (NODE)->base.asm_written_flag |
4ee9c684 | 1976 | |
786d45db | 1977 | /* Nonzero if this SSA_NAME expression is currently on the free list of |
4ee9c684 | 1978 | SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
1979 | has no meaning for an SSA_NAME. */ | |
1980 | #define SSA_NAME_IN_FREE_LIST(NODE) \ | |
35cc02b5 | 1981 | SSA_NAME_CHECK (NODE)->base.nothrow_flag |
4ee9c684 | 1982 | |
de6ed584 | 1983 | /* Nonzero if this SSA_NAME is the default definition for the |
1984 | underlying symbol. A default SSA name is created for symbol S if | |
1985 | the very first reference to S in the function is a read operation. | |
1986 | Default definitions are always created by an empty statement and | |
1987 | belong to no basic block. */ | |
eb65426a | 1988 | #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ |
83901169 | 1989 | SSA_NAME_CHECK (NODE)->base.default_def_flag |
de6ed584 | 1990 | |
786d45db | 1991 | /* Attributes for SSA_NAMEs for pointer-type variables. */ |
1992 | #define SSA_NAME_PTR_INFO(N) \ | |
1993 | SSA_NAME_CHECK (N)->ssa_name.ptr_info | |
1994 | ||
9b40bfbf | 1995 | /* Defined in tree-flow.h. */ |
591c2a30 | 1996 | struct ptr_info_def; |
22aa74c4 | 1997 | |
fe24f256 | 1998 | /* Immediate use linking structure. This structure is used for maintaining |
22aa74c4 | 1999 | a doubly linked list of uses of an SSA_NAME. */ |
fb1e4f4a | 2000 | typedef struct GTY(()) ssa_use_operand_d { |
b66731e8 | 2001 | struct ssa_use_operand_d* GTY((skip(""))) prev; |
2002 | struct ssa_use_operand_d* GTY((skip(""))) next; | |
75a70cf9 | 2003 | /* Immediate uses for a given SSA name are maintained as a cyclic |
2004 | list. To recognize the root of this list, the location field | |
2005 | needs to point to the original SSA name. Since statements and | |
2006 | SSA names are of different data types, we need this union. See | |
2007 | the explanation in struct immediate_use_iterator_d. */ | |
2008 | union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc; | |
22aa74c4 | 2009 | tree *GTY((skip(""))) use; |
b66731e8 | 2010 | } ssa_use_operand_t; |
22aa74c4 | 2011 | |
2012 | /* Return the immediate_use information for an SSA_NAME. */ | |
2013 | #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses | |
2014 | ||
fb1e4f4a | 2015 | struct GTY(()) tree_ssa_name { |
acb5ba8c | 2016 | struct tree_typed typed; |
4ee9c684 | 2017 | |
2018 | /* _DECL wrapped by this SSA name. */ | |
2019 | tree var; | |
2020 | ||
75a70cf9 | 2021 | /* Statement that defines this SSA name. */ |
2022 | gimple def_stmt; | |
2023 | ||
786d45db | 2024 | /* Pointer attributes used for alias analysis. */ |
2025 | struct ptr_info_def *ptr_info; | |
7cd909bf | 2026 | |
22aa74c4 | 2027 | /* Immediate uses list for this SSA_NAME. */ |
b66731e8 | 2028 | struct ssa_use_operand_d imm_uses; |
4ee9c684 | 2029 | }; |
2030 | \f | |
fb1e4f4a | 2031 | struct GTY(()) phi_arg_d { |
aa28f7e7 | 2032 | /* imm_use MUST be the first element in struct because we do some |
2033 | pointer arithmetic with it. See phi_arg_index_from_use. */ | |
b66731e8 | 2034 | struct ssa_use_operand_d imm_use; |
4ee9c684 | 2035 | tree def; |
efbcb6de | 2036 | location_t locus; |
4ee9c684 | 2037 | }; |
2038 | ||
4ee9c684 | 2039 | \f |
55d6e7cd | 2040 | #define OMP_CLAUSE_CODE(NODE) \ |
2041 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.code | |
2042 | ||
2043 | #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ | |
2044 | ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) | |
2045 | ||
2046 | #define OMP_CLAUSE_CODE(NODE) \ | |
2047 | (OMP_CLAUSE_CHECK (NODE))->omp_clause.code | |
2048 | ||
2049 | #define OMP_CLAUSE_OPERAND(NODE, I) \ | |
2050 | OMP_CLAUSE_ELT_CHECK (NODE, I) | |
2051 | ||
fb1e4f4a | 2052 | struct GTY(()) tree_omp_clause { |
55d6e7cd | 2053 | struct tree_common common; |
e60a6f7b | 2054 | location_t locus; |
55d6e7cd | 2055 | enum omp_clause_code code; |
2056 | union omp_clause_subcode { | |
2057 | enum omp_clause_default_kind default_kind; | |
2058 | enum omp_clause_schedule_kind schedule_kind; | |
2059 | enum tree_code reduction_code; | |
2060 | } GTY ((skip)) subcode; | |
75a70cf9 | 2061 | |
2062 | /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's | |
2063 | usage. */ | |
2064 | gimple_seq gimple_reduction_init; | |
2065 | gimple_seq gimple_reduction_merge; | |
2066 | ||
c360ad02 | 2067 | tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1]; |
55d6e7cd | 2068 | }; |
2069 | \f | |
4ee9c684 | 2070 | |
d72a838e | 2071 | /* In a BLOCK node. */ |
3e207e38 | 2072 | #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
eb65426a | 2073 | #define BLOCK_NONLOCALIZED_VARS(NODE) \ |
2074 | (BLOCK_CHECK (NODE)->block.nonlocalized_vars) | |
2075 | #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ | |
f1f41a6c | 2076 | vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) |
2077 | #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] | |
3e207e38 | 2078 | #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
2079 | #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) | |
027fc6ef | 2080 | #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) |
3e207e38 | 2081 | #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
2082 | #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) | |
d72a838e | 2083 | |
665611e7 | 2084 | /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ |
87d8f7b6 | 2085 | #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) |
665611e7 | 2086 | |
5846cb0f | 2087 | /* An index number for this block. These values are not guaranteed to |
2088 | be unique across functions -- whether or not they are depends on | |
2089 | the debugging output format in use. */ | |
2090 | #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) | |
2091 | ||
a36145ca | 2092 | /* If block reordering splits a lexical block into discontiguous |
2093 | address ranges, we'll make a copy of the original block. | |
2094 | ||
2095 | Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. | |
2096 | In that case, we have one source block that has been replicated | |
2097 | (through inlining or unrolling) into many logical blocks, and that | |
2098 | these logical blocks have different physical variables in them. | |
2099 | ||
2100 | In this case, we have one logical block split into several | |
2101 | non-contiguous address ranges. Most debug formats can't actually | |
2102 | represent this idea directly, so we fake it by creating multiple | |
2103 | logical blocks with the same variables in them. However, for those | |
2104 | that do support non-contiguous regions, these allow the original | |
2105 | logical block to be reconstructed, along with the set of address | |
2106 | ranges. | |
2107 | ||
2108 | One of the logical block fragments is arbitrarily chosen to be | |
2109 | the ORIGIN. The other fragments will point to the origin via | |
2110 | BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer | |
6c34d0c2 | 2111 | be null. The list of fragments will be chained through |
a36145ca | 2112 | BLOCK_FRAGMENT_CHAIN from the origin. */ |
2113 | ||
56ba46a4 | 2114 | #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
2115 | #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) | |
a36145ca | 2116 | |
44276901 | 2117 | /* For an inlined function, this gives the location where it was called |
2118 | from. This is only set in the top level block, which corresponds to the | |
2119 | inlined function scope. This is used in the debug output routines. */ | |
2120 | ||
2121 | #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) | |
2122 | ||
fb1e4f4a | 2123 | struct GTY(()) tree_block { |
027fc6ef | 2124 | struct tree_base base; |
2125 | tree chain; | |
f20853dd | 2126 | |
f20853dd | 2127 | unsigned abstract_flag : 1; |
cee43f7e | 2128 | unsigned block_num : 31; |
f20853dd | 2129 | |
93110716 | 2130 | location_t locus; |
2131 | ||
6a3e3d6d | 2132 | tree vars; |
f1f41a6c | 2133 | vec<tree, va_gc> *nonlocalized_vars; |
4b5d70fd | 2134 | |
6a3e3d6d | 2135 | tree subblocks; |
2136 | tree supercontext; | |
2137 | tree abstract_origin; | |
2138 | tree fragment_origin; | |
2139 | tree fragment_chain; | |
d72a838e | 2140 | }; |
2141 | \f | |
2142 | /* Define fields and accessors for nodes representing data types. */ | |
2143 | ||
2144 | /* See tree.def for documentation of the use of these fields. | |
82bb2115 | 2145 | Look at the documentation of the various ..._TYPE tree codes. |
2146 | ||
3927afe0 | 2147 | Note that the type.values, type.minval, and type.maxval fields are |
82bb2115 | 2148 | overloaded and used for different macros in different kinds of types. |
2149 | Each macro must check to ensure the tree node is of the proper kind of | |
2150 | type. Note also that some of the front-ends also overload these fields, | |
2151 | so they must be checked as well. */ | |
d72a838e | 2152 | |
8f2eb9e1 | 2153 | #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) |
2154 | #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) | |
2155 | #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) | |
2156 | #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) | |
2157 | #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) | |
2158 | #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) | |
2159 | #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) | |
2160 | #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) | |
2161 | #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) | |
2162 | #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) | |
6753bca0 | 2163 | |
342ad2d6 | 2164 | /* Vector types need to check target flags to determine type. */ |
2165 | extern enum machine_mode vector_type_mode (const_tree); | |
2166 | #define TYPE_MODE(NODE) \ | |
8ee286c8 | 2167 | (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \ |
8f2eb9e1 | 2168 | ? vector_type_mode (NODE) : (NODE)->type_common.mode) |
342ad2d6 | 2169 | #define SET_TYPE_MODE(NODE, MODE) \ |
8f2eb9e1 | 2170 | (TYPE_CHECK (NODE)->type_common.mode = (MODE)) |
342ad2d6 | 2171 | |
09eb10ed | 2172 | /* The "canonical" type for this type node, which is used by frontends to |
2173 | compare the type for equality with another type. If two types are | |
6753bca0 | 2174 | equal (based on the semantics of the language), then they will have |
48e1416a | 2175 | equivalent TYPE_CANONICAL entries. |
6753bca0 | 2176 | |
09eb10ed | 2177 | As a special case, if TYPE_CANONICAL is NULL_TREE, and thus |
2178 | TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot | |
2179 | be used for comparison against other types. Instead, the type is | |
6753bca0 | 2180 | said to require structural equality checks, described in |
09eb10ed | 2181 | TYPE_STRUCTURAL_EQUALITY_P. |
2182 | ||
2183 | For unqualified aggregate and function types the middle-end relies on | |
2184 | TYPE_CANONICAL to tell whether two variables can be assigned | |
2185 | to each other without a conversion. The middle-end also makes sure | |
2186 | to assign the same alias-sets to the type partition with equal | |
2187 | TYPE_CANONICAL of their unqualified variants. */ | |
8f2eb9e1 | 2188 | #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) |
6753bca0 | 2189 | /* Indicates that the type node requires structural equality |
09eb10ed | 2190 | checks. The compiler will need to look at the composition of the |
6753bca0 | 2191 | type to determine whether it is equal to another type, rather than |
09eb10ed | 2192 | just comparing canonical type pointers. For instance, we would need |
6753bca0 | 2193 | to look at the return and parameter types of a FUNCTION_TYPE |
09eb10ed | 2194 | node. */ |
6753bca0 | 2195 | #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) |
2196 | /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the | |
09eb10ed | 2197 | type node requires structural equality. */ |
6753bca0 | 2198 | #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) |
09eb10ed | 2199 | |
06f0b99c | 2200 | #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) |
2201 | #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) | |
d72a838e | 2202 | |
b5ba9f3a | 2203 | /* The (language-specific) typed-based alias set for this type. |
2204 | Objects whose TYPE_ALIAS_SETs are different cannot alias each | |
2205 | other. If the TYPE_ALIAS_SET is -1, no alias set has yet been | |
2206 | assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this | |
2207 | type can alias objects of any type. */ | |
8f2eb9e1 | 2208 | #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) |
b5ba9f3a | 2209 | |
2210 | /* Nonzero iff the typed-based alias set for this type has been | |
2211 | calculated. */ | |
8f2eb9e1 | 2212 | #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ |
2213 | (TYPE_CHECK (NODE)->type_common.alias_set != -1) | |
b5ba9f3a | 2214 | |
a12eeaaf | 2215 | /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
2216 | to this type. */ | |
8f2eb9e1 | 2217 | #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) |
a12eeaaf | 2218 | |
c3b0175e | 2219 | /* The alignment necessary for objects of this type. |
2220 | The value is an int, measured in bits. */ | |
8f2eb9e1 | 2221 | #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align) |
c3b0175e | 2222 | |
aca14577 | 2223 | /* 1 if the alignment for this type was requested by "aligned" attribute, |
2224 | 0 if it is the default for this type. */ | |
87d8f7b6 | 2225 | #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) |
aca14577 | 2226 | |
89e923d8 | 2227 | /* The alignment for NODE, in bytes. */ |
56ba46a4 | 2228 | #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
89e923d8 | 2229 | |
13fad59c | 2230 | /* If your language allows you to declare types, and you want debug info |
2231 | for them, then you need to generate corresponding TYPE_DECL nodes. | |
2232 | These "stub" TYPE_DECL nodes have no name, and simply point at the | |
2233 | type node. You then set the TYPE_STUB_DECL field of the type node | |
2234 | to point back at the TYPE_DECL node. This allows the debug routines | |
2235 | to know that the two nodes represent the same type, so that we only | |
88b5b080 | 2236 | get one debug info record for them. */ |
742529a2 | 2237 | #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) |
d72a838e | 2238 | |
96cd09d2 | 2239 | /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means |
2240 | the type has BLKmode only because it lacks the alignment required for | |
7dd9d898 | 2241 | its size. */ |
8f2eb9e1 | 2242 | #define TYPE_NO_FORCE_BLK(NODE) \ |
2243 | (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) | |
d72a838e | 2244 | |
2245 | /* Nonzero in a type considered volatile as a whole. */ | |
35cc02b5 | 2246 | #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) |
d72a838e | 2247 | |
2248 | /* Means this type is const-qualified. */ | |
35cc02b5 | 2249 | #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) |
d72a838e | 2250 | |
a5b1863e | 2251 | /* If nonzero, this type is `restrict'-qualified, in the C sense of |
2252 | the term. */ | |
8f2eb9e1 | 2253 | #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) |
a5b1863e | 2254 | |
84bfaaeb | 2255 | /* If nonzero, type's name shouldn't be emitted into debug info. */ |
87d8f7b6 | 2256 | #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) |
84bfaaeb | 2257 | |
bd1a81f7 | 2258 | /* The address space the type is in. */ |
87d8f7b6 | 2259 | #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) |
bd1a81f7 | 2260 | |
a5b1863e | 2261 | /* There is a TYPE_QUAL value for each type qualifier. They can be |
2262 | combined by bitwise-or to form the complete set of qualifiers for a | |
2263 | type. */ | |
ece7f9e3 | 2264 | enum cv_qualifier |
2265 | { | |
2266 | TYPE_UNQUALIFIED = 0x0, | |
2267 | TYPE_QUAL_CONST = 0x1, | |
2268 | TYPE_QUAL_VOLATILE = 0x2, | |
2269 | TYPE_QUAL_RESTRICT = 0x4 | |
2270 | }; | |
a5b1863e | 2271 | |
bd1a81f7 | 2272 | /* Encode/decode the named memory support as part of the qualifier. If more |
2273 | than 8 qualifiers are added, these macros need to be adjusted. */ | |
2274 | #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) | |
2275 | #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) | |
2276 | ||
2277 | /* Return all qualifiers except for the address space qualifiers. */ | |
2278 | #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) | |
2279 | ||
2280 | /* Only keep the address space out of the qualifiers and discard the other | |
2281 | qualifiers. */ | |
2282 | #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) | |
2283 | ||
a5b1863e | 2284 | /* The set of type qualifiers for this type. */ |
716fc477 | 2285 | #define TYPE_QUALS(NODE) \ |
3637bb87 | 2286 | ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ |
2287 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
2288 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ | |
2289 | | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) | |
bd1a81f7 | 2290 | |
2291 | /* The same as TYPE_QUALS without the address space qualifications. */ | |
2292 | #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ | |
3637bb87 | 2293 | ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ |
2294 | | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | |
2295 | | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) | |
a5b1863e | 2296 | |
bc3a4bfd | 2297 | /* These flags are available for each language front end to use internally. */ |
8f2eb9e1 | 2298 | #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) |
2299 | #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) | |
2300 | #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) | |
2301 | #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) | |
2302 | #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) | |
2303 | #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) | |
2304 | #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) | |
d72a838e | 2305 | |
4ee9c684 | 2306 | /* Used to keep track of visited nodes in tree traversals. This is set to |
2307 | 0 by copy_node and make_node. */ | |
35cc02b5 | 2308 | #define TREE_VISITED(NODE) ((NODE)->base.visited) |
4ee9c684 | 2309 | |
b759e947 | 2310 | /* If set in an ARRAY_TYPE, indicates a string type (for languages |
2311 | that distinguish string from array of char). | |
e026e576 | 2312 | If set in a INTEGER_TYPE, indicates a character type. */ |
8f2eb9e1 | 2313 | #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) |
255218ff | 2314 | |
8a95ab85 | 2315 | /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ |
56ba46a4 | 2316 | #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ |
99d38b9e | 2317 | (((unsigned HOST_WIDE_INT) 1) \ |
8f2eb9e1 | 2318 | << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision) |
99d38b9e | 2319 | |
2320 | /* Set precision to n when we have 2^n sub-parts of the vector. */ | |
2321 | #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ | |
8f2eb9e1 | 2322 | (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X)) |
8a95ab85 | 2323 | |
8b50765f | 2324 | /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings |
2325 | about missing conversions to other vector types of the same size. */ | |
8d125f7d | 2326 | #define TYPE_VECTOR_OPAQUE(NODE) \ |
e0213ecc | 2327 | (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) |
8d125f7d | 2328 | |
fcdd3ab3 | 2329 | /* Indicates that objects of this type must be initialized by calling a |
be98dac3 | 2330 | function when they are created. */ |
851dfbff | 2331 | #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
8f2eb9e1 | 2332 | (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) |
be98dac3 | 2333 | |
8df5a43d | 2334 | /* Indicates that a UNION_TYPE object should be passed the same way that |
2335 | the first union alternative would be passed, or that a RECORD_TYPE | |
2336 | object should be passed the same way that the first (and only) member | |
2337 | would be passed. */ | |
2338 | #define TYPE_TRANSPARENT_AGGR(NODE) \ | |
8f2eb9e1 | 2339 | (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) |
851dfbff | 2340 | |
c67bf066 | 2341 | /* For an ARRAY_TYPE, indicates that it is not permitted to take the |
2342 | address of a component of the type. This is the counterpart of | |
2343 | DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ | |
851dfbff | 2344 | #define TYPE_NONALIASED_COMPONENT(NODE) \ |
8f2eb9e1 | 2345 | (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) |
fa602b3f | 2346 | |
ad87de1e | 2347 | /* Indicated that objects of this type should be laid out in as |
1a8ea5c4 | 2348 | compact a way as possible. */ |
87d8f7b6 | 2349 | #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) |
1a8ea5c4 | 2350 | |
2bd342e5 | 2351 | /* Used by type_contains_placeholder_p to avoid recomputation. |
2352 | Values are: 0 (unknown), 1 (false), 2 (true). Never access | |
2353 | this field directly. */ | |
2354 | #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ | |
8f2eb9e1 | 2355 | (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) |
2bd342e5 | 2356 | |
585bb356 | 2357 | /* Nonzero if RECORD_TYPE represents a final derivation of class. */ |
2358 | #define TYPE_FINAL_P(NODE) \ | |
2359 | (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag) | |
2360 | ||
929d2a90 | 2361 | /* The debug output functions use the symtab union field to store |
2362 | information specific to the debugging format. The different debug | |
2363 | output hooks store different types in the union field. These three | |
2364 | macros are used to access different fields in the union. The debug | |
2365 | hooks are responsible for consistently using only a specific | |
2366 | macro. */ | |
2367 | ||
2368 | /* Symtab field as an integer. Used by stabs generator in dbxout.c to | |
2369 | hold the type's number in the generated stabs. */ | |
8f2eb9e1 | 2370 | #define TYPE_SYMTAB_ADDRESS(NODE) \ |
2371 | (TYPE_CHECK (NODE)->type_common.symtab.address) | |
929d2a90 | 2372 | |
2373 | /* Symtab field as a string. Used by COFF generator in sdbout.c to | |
2374 | hold struct/union type tag names. */ | |
8f2eb9e1 | 2375 | #define TYPE_SYMTAB_POINTER(NODE) \ |
2376 | (TYPE_CHECK (NODE)->type_common.symtab.pointer) | |
929d2a90 | 2377 | |
2378 | /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator | |
2379 | in dwarf2out.c to point to the DIE generated for the type. */ | |
8f2eb9e1 | 2380 | #define TYPE_SYMTAB_DIE(NODE) \ |
2381 | (TYPE_CHECK (NODE)->type_common.symtab.die) | |
929d2a90 | 2382 | |
2383 | /* The garbage collector needs to know the interpretation of the | |
2384 | symtab field. These constants represent the different types in the | |
2385 | union. */ | |
2386 | ||
2387 | #define TYPE_SYMTAB_IS_ADDRESS (0) | |
2388 | #define TYPE_SYMTAB_IS_POINTER (1) | |
2389 | #define TYPE_SYMTAB_IS_DIE (2) | |
2390 | ||
1f3233d1 | 2391 | struct die_struct; |
2392 | ||
8f2eb9e1 | 2393 | struct GTY(()) tree_type_common { |
851dfbff | 2394 | struct tree_common common; |
6a3e3d6d | 2395 | tree size; |
2396 | tree size_unit; | |
2397 | tree attributes; | |
108009b4 | 2398 | unsigned int uid; |
d72a838e | 2399 | |
33a0b99d | 2400 | unsigned int precision : 10; |
d72a838e | 2401 | unsigned no_force_blk_flag : 1; |
be98dac3 | 2402 | unsigned needs_constructing_flag : 1; |
8df5a43d | 2403 | unsigned transparent_aggr_flag : 1; |
a5b1863e | 2404 | unsigned restrict_flag : 1; |
2bd342e5 | 2405 | unsigned contains_placeholder_bits : 2; |
a5b1863e | 2406 | |
33a0b99d | 2407 | ENUM_BITFIELD(machine_mode) mode : 8; |
2408 | ||
2409 | unsigned string_flag : 1; | |
d72a838e | 2410 | unsigned lang_flag_0 : 1; |
2411 | unsigned lang_flag_1 : 1; | |
2412 | unsigned lang_flag_2 : 1; | |
2413 | unsigned lang_flag_3 : 1; | |
2414 | unsigned lang_flag_4 : 1; | |
2415 | unsigned lang_flag_5 : 1; | |
2416 | unsigned lang_flag_6 : 1; | |
2417 | ||
c926ba81 | 2418 | unsigned int align; |
9fac1c66 | 2419 | alias_set_type alias_set; |
6a3e3d6d | 2420 | tree pointer_to; |
2421 | tree reference_to; | |
1f3233d1 | 2422 | union tree_type_symtab { |
929d2a90 | 2423 | int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address; |
2424 | const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer; | |
2425 | struct die_struct * GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die; | |
2426 | } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab; | |
6a3e3d6d | 2427 | tree name; |
6a3e3d6d | 2428 | tree next_variant; |
2429 | tree main_variant; | |
6a3e3d6d | 2430 | tree context; |
6753bca0 | 2431 | tree canonical; |
8f2eb9e1 | 2432 | }; |
2433 | ||
2434 | #define TYPE_LANG_SPECIFIC(NODE) \ | |
2435 | (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) | |
2436 | ||
2437 | struct GTY(()) tree_type_with_lang_specific { | |
2438 | struct tree_type_common common; | |
d72a838e | 2439 | /* Points to a structure whose details depend on the language in use. */ |
2440 | struct lang_type *lang_specific; | |
2441 | }; | |
8f2eb9e1 | 2442 | |
2443 | #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) | |
2444 | #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) | |
2445 | #define TYPE_FIELDS(NODE) \ | |
2446 | (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) | |
2447 | #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values) | |
2448 | #define TYPE_ARG_TYPES(NODE) \ | |
2449 | (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) | |
2450 | #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values) | |
2451 | ||
2452 | #define TYPE_METHODS(NODE) \ | |
2453 | (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) | |
2454 | #define TYPE_VFIELD(NODE) \ | |
2455 | (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) | |
2456 | #define TYPE_METHOD_BASETYPE(NODE) \ | |
2457 | (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) | |
2458 | #define TYPE_OFFSET_BASETYPE(NODE) \ | |
2459 | (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) | |
2460 | #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) | |
2461 | #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) | |
2462 | #define TYPE_NEXT_PTR_TO(NODE) \ | |
2463 | (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) | |
2464 | #define TYPE_NEXT_REF_TO(NODE) \ | |
2465 | (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) | |
2466 | #define TYPE_MIN_VALUE(NODE) \ | |
2467 | (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) | |
2468 | #define TYPE_MAX_VALUE(NODE) \ | |
2469 | (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) | |
2470 | ||
2471 | /* If non-NULL, this is an upper bound of the size (in bytes) of an | |
2472 | object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be | |
2473 | allocated. */ | |
2474 | #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ | |
2475 | (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) | |
2476 | ||
2477 | /* For record and union types, information about this type, as a base type | |
2478 | for itself. */ | |
2479 | #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) | |
2480 | ||
2481 | /* For non record and union types, used in a language-dependent way. */ | |
2482 | #define TYPE_LANG_SLOT_1(NODE) \ | |
2483 | (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) | |
2484 | ||
2485 | struct GTY(()) tree_type_non_common { | |
2486 | struct tree_type_with_lang_specific with_lang_specific; | |
2487 | tree values; | |
2488 | tree minval; | |
2489 | tree maxval; | |
2490 | tree binfo; | |
2491 | }; | |
d72a838e | 2492 | \f |
2493 | /* Define accessor macros for information about type inheritance | |
2494 | and basetypes. | |
2495 | ||
2496 | A "basetype" means a particular usage of a data type for inheritance | |
2497 | in another type. Each such basetype usage has its own "binfo" | |
2498 | object to describe it. The binfo object is a TREE_VEC node. | |
2499 | ||
2500 | Inheritance is represented by the binfo nodes allocated for a | |
2501 | given type. For example, given types C and D, such that D is | |
2502 | inherited by C, 3 binfo nodes will be allocated: one for describing | |
2503 | the binfo properties of C, similarly one for D, and one for | |
2504 | describing the binfo properties of D as a base type for C. | |
2505 | Thus, given a pointer to class C, one can get a pointer to the binfo | |
2506 | of D acting as a basetype for C by looking at C's binfo's basetypes. */ | |
2507 | ||
57c28194 | 2508 | /* BINFO specific flags. */ |
2509 | ||
2510 | /* Nonzero means that the derivation chain is via a `virtual' declaration. */ | |
35cc02b5 | 2511 | #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) |
57c28194 | 2512 | |
2513 | /* Flags for language dependent use. */ | |
2514 | #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) | |
2515 | #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) | |
2516 | #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) | |
2517 | #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) | |
2518 | #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) | |
2519 | #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) | |
2520 | #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) | |
2521 | ||
d72a838e | 2522 | /* The actual data type node being inherited in this basetype. */ |
3cb98335 | 2523 | #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) |
d72a838e | 2524 | |
2525 | /* The offset where this basetype appears in its containing type. | |
2526 | BINFO_OFFSET slot holds the offset (in bytes) | |
2527 | from the base of the complete object to the base of the part of the | |
2528 | object that is allocated on behalf of this `type'. | |
2529 | This is always 0 except when there is multiple inheritance. */ | |
6c34d0c2 | 2530 | |
3cb98335 | 2531 | #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) |
d6c9423f | 2532 | #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
d72a838e | 2533 | |
2534 | /* The virtual function table belonging to this basetype. Virtual | |
2535 | function tables provide a mechanism for run-time method dispatching. | |
2536 | The entries of a virtual function table are language-dependent. */ | |
2537 | ||
3cb98335 | 2538 | #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) |
d72a838e | 2539 | |
2540 | /* The virtual functions in the virtual function table. This is | |
2541 | a TREE_LIST that is used as an initial approximation for building | |
2542 | a virtual function table for this basetype. */ | |
3cb98335 | 2543 | #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) |
d72a838e | 2544 | |
6ed1e0f8 | 2545 | /* A vector of binfos for the direct basetypes inherited by this |
2546 | basetype. | |
d72a838e | 2547 | |
6ed1e0f8 | 2548 | If this basetype describes type D as inherited in C, and if the |
2549 | basetypes of D are E and F, then this vector contains binfos for | |
f6cc6a08 | 2550 | inheritance of E and F by C. */ |
2551 | #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) | |
d72a838e | 2552 | |
824507ab | 2553 | /* The number of basetypes for NODE. */ |
f1f41a6c | 2554 | #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) |
824507ab | 2555 | |
2cfde4f3 | 2556 | /* Accessor macro to get to the Nth base binfo of this binfo. */ |
f6cc6a08 | 2557 | #define BINFO_BASE_BINFO(NODE,N) \ |
f1f41a6c | 2558 | ((*BINFO_BASE_BINFOS (NODE))[(N)]) |
f6cc6a08 | 2559 | #define BINFO_BASE_ITERATE(NODE,N,B) \ |
f1f41a6c | 2560 | (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) |
f6cc6a08 | 2561 | #define BINFO_BASE_APPEND(NODE,T) \ |
f1f41a6c | 2562 | (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) |
d6c9423f | 2563 | |
809d9739 | 2564 | /* For a BINFO record describing a virtual base class, i.e., one where |
2565 | TREE_VIA_VIRTUAL is set, this field assists in locating the virtual | |
4b922c0c | 2566 | base. The actual contents are language-dependent. In the C++ |
2567 | front-end this field is an INTEGER_CST giving an offset into the | |
2568 | vtable where the offset to the virtual base can be found. */ | |
3cb98335 | 2569 | #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) |
44882314 | 2570 | |
95f3173a | 2571 | /* Indicates the accesses this binfo has to its bases. The values are |
2572 | access_public_node, access_protected_node or access_private_node. | |
2573 | If this array is not present, public access is implied. */ | |
2cfde4f3 | 2574 | #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) |
db77fe17 | 2575 | |
2576 | #define BINFO_BASE_ACCESS(NODE,N) \ | |
f1f41a6c | 2577 | (*BINFO_BASE_ACCESSES (NODE))[(N)] |
db77fe17 | 2578 | #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ |
f1f41a6c | 2579 | BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) |
95f3173a | 2580 | |
f6cc6a08 | 2581 | /* The index in the VTT where this subobject's sub-VTT can be found. |
2582 | NULL_TREE if there is no sub-VTT. */ | |
2583 | #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) | |
95f3173a | 2584 | |
f6cc6a08 | 2585 | /* The index in the VTT where the vptr for this subobject can be |
2586 | found. NULL_TREE if there is no secondary vptr in the VTT. */ | |
2587 | #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) | |
2588 | ||
2cfde4f3 | 2589 | /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base |
2590 | inheriting this base for non-virtual bases. For virtual bases it | |
eea75c62 | 2591 | points either to the binfo for which this is a primary binfo, or to |
2592 | the binfo of the most derived type. */ | |
3cb98335 | 2593 | #define BINFO_INHERITANCE_CHAIN(NODE) \ |
2594 | (TREE_BINFO_CHECK(NODE)->binfo.inheritance) | |
2595 | ||
fb1e4f4a | 2596 | struct GTY (()) tree_binfo { |
3cb98335 | 2597 | struct tree_common common; |
2598 | ||
2599 | tree offset; | |
2600 | tree vtable; | |
2601 | tree virtuals; | |
3cb98335 | 2602 | tree vptr_field; |
f1f41a6c | 2603 | vec<tree, va_gc> *base_accesses; |
3cb98335 | 2604 | tree inheritance; |
2605 | ||
f6cc6a08 | 2606 | tree vtt_subvtt; |
2607 | tree vtt_vptr; | |
f6cc6a08 | 2608 | |
f1f41a6c | 2609 | vec<tree, va_gc> base_binfos; |
3cb98335 | 2610 | }; |
3cb98335 | 2611 | |
d72a838e | 2612 | \f |
2613 | /* Define fields and accessors for nodes representing declared names. */ | |
2614 | ||
2f4ec87c | 2615 | /* Nonzero if DECL represents an SSA name or a variable that can possibly |
2616 | have an associated SSA name. */ | |
437f5d6b | 2617 | #define SSA_VAR_P(DECL) \ |
2618 | (TREE_CODE (DECL) == VAR_DECL \ | |
2619 | || TREE_CODE (DECL) == PARM_DECL \ | |
2620 | || TREE_CODE (DECL) == RESULT_DECL \ | |
2f4ec87c | 2621 | || TREE_CODE (DECL) == SSA_NAME) |
56ba46a4 | 2622 | |
56ba46a4 | 2623 | |
56ba46a4 | 2624 | |
5ded8c6f | 2625 | /* Enumerate visibility settings. */ |
2626 | #ifndef SYMBOL_VISIBILITY_DEFINED | |
2627 | #define SYMBOL_VISIBILITY_DEFINED | |
2628 | enum symbol_visibility | |
2629 | { | |
2630 | VISIBILITY_DEFAULT, | |
4a2849cb | 2631 | VISIBILITY_PROTECTED, |
5ded8c6f | 2632 | VISIBILITY_HIDDEN, |
4a2849cb | 2633 | VISIBILITY_INTERNAL |
5ded8c6f | 2634 | }; |
2635 | #endif | |
56ba46a4 | 2636 | |
5ded8c6f | 2637 | struct function; |
6c34d0c2 | 2638 | |
1767a056 | 2639 | #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) |
7e64c604 | 2640 | |
5ded8c6f | 2641 | /* This is the name of the object as written by the user. |
2642 | It is an IDENTIFIER_NODE. */ | |
2643 | #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) | |
56ba46a4 | 2644 | |
5ded8c6f | 2645 | /* Every ..._DECL node gets a unique number. */ |
2646 | #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) | |
7e64c604 | 2647 | |
688ff29b | 2648 | /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous |
2649 | uses. */ | |
2650 | #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) | |
2651 | ||
1a981e1a | 2652 | /* Every ..._DECL node gets a unique number that stays the same even |
2653 | when the decl is copied by the inliner once it is set. */ | |
eb65426a | 2654 | #define DECL_PT_UID(NODE) \ |
2655 | (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ | |
2656 | ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) | |
1a981e1a | 2657 | /* Initialize the ..._DECL node pt-uid to the decls uid. */ |
eb65426a | 2658 | #define SET_DECL_PT_UID(NODE, UID) \ |
2659 | (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) | |
1a981e1a | 2660 | /* Whether the ..._DECL node pt-uid has been initialized and thus needs to |
2661 | be preserved when copyin the decl. */ | |
eb65426a | 2662 | #define DECL_PT_UID_SET_P(NODE) \ |
2663 | (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) | |
1a981e1a | 2664 | |
5ded8c6f | 2665 | /* These two fields describe where in the source code the declaration |
2666 | was. If the declaration appears in several places (as for a C | |
2667 | function that is declared first and then defined later), this | |
2668 | information should refer to the definition. */ | |
eb65426a | 2669 | #define DECL_SOURCE_LOCATION(NODE) \ |
2670 | (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) | |
5ded8c6f | 2671 | #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) |
2672 | #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) | |
cff9d209 | 2673 | #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) |
5ded8c6f | 2674 | #define DECL_IS_BUILTIN(DECL) \ |
567510a2 | 2675 | (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION) |
56ba46a4 | 2676 | |
40109983 | 2677 | /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
2678 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
34e5cced | 2679 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL |
2680 | nodes, this points to either the FUNCTION_DECL for the containing | |
2681 | function, the RECORD_TYPE or UNION_TYPE for the containing type, or | |
40109983 | 2682 | NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file |
22bf03ad | 2683 | scope". In particular, for VAR_DECLs which are virtual table pointers |
2684 | (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type | |
2685 | they belong to. */ | |
5ded8c6f | 2686 | #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) |
eb65426a | 2687 | #define DECL_FIELD_CONTEXT(NODE) \ |
2688 | (FIELD_DECL_CHECK (NODE)->decl_minimal.context) | |
84bfaaeb | 2689 | |
2690 | /* If nonzero, decl's name shouldn't be emitted into debug info. */ | |
87d8f7b6 | 2691 | #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) |
84bfaaeb | 2692 | |
fb1e4f4a | 2693 | struct GTY(()) tree_decl_minimal { |
5ded8c6f | 2694 | struct tree_common common; |
2695 | location_t locus; | |
2696 | unsigned int uid; | |
2697 | tree name; | |
2698 | tree context; | |
2699 | }; | |
2700 | ||
4fb5e5ca | 2701 | |
5ded8c6f | 2702 | /* For any sort of a ..._DECL node, this points to the original (abstract) |
16e43d96 | 2703 | decl node which this decl is an inlined/cloned instance of, or else it |
2704 | is NULL indicating that this decl is not an instance of some other decl. | |
2705 | ||
2706 | The C front-end also uses this in a nested declaration of an inline | |
2707 | function, to point back to the definition. */ | |
eb65426a | 2708 | #define DECL_ABSTRACT_ORIGIN(NODE) \ |
2709 | (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) | |
5ded8c6f | 2710 | |
2711 | /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract | |
2712 | origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ | |
2713 | #define DECL_ORIGIN(NODE) \ | |
2714 | (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) | |
2715 | ||
2716 | /* Nonzero for any sort of ..._DECL node means this decl node represents an | |
2717 | inline instance of some original (abstract) decl from an inline function; | |
2718 | suppress any warnings about shadowing some other variable. FUNCTION_DECL | |
2719 | nodes can also have their abstract origin set to themselves. */ | |
eb65426a | 2720 | #define DECL_FROM_INLINE(NODE) \ |
2721 | (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ | |
2722 | && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) | |
5ded8c6f | 2723 | |
e3c541f0 | 2724 | /* In a DECL this is the field where attributes are stored. */ |
eb65426a | 2725 | #define DECL_ATTRIBUTES(NODE) \ |
2726 | (DECL_COMMON_CHECK (NODE)->decl_common.attributes) | |
5ded8c6f | 2727 | |
d72a838e | 2728 | /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
40109983 | 2729 | For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
d72a838e | 2730 | For a VAR_DECL, holds the initial value. |
4682b6fe | 2731 | For a PARM_DECL, used for DECL_ARG_TYPE--default |
d72a838e | 2732 | values for parameters are encoded in the type of the function, |
66d12a6c | 2733 | not in the PARM_DECL slot. |
5ded8c6f | 2734 | For a FIELD_DECL, this is used for enumeration values and the C |
7bd4091f | 2735 | frontend uses it for temporarily storing bitwidth of bitfields. |
66d12a6c | 2736 | |
2737 | ??? Need to figure out some way to check this isn't a PARM_DECL. */ | |
5ded8c6f | 2738 | #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) |
2739 | ||
b278476e | 2740 | /* Holds the size of the datum, in bits, as a tree expression. |
d72a838e | 2741 | Need not be constant. */ |
5ded8c6f | 2742 | #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) |
b278476e | 2743 | /* Likewise for the size in bytes. */ |
5ded8c6f | 2744 | #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) |
c6713de4 | 2745 | /* Holds the alignment required for the datum, in bits. */ |
097b5c8b | 2746 | #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) |
c6713de4 | 2747 | /* The alignment of NODE, in bytes. */ |
2748 | #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) | |
6c96b31e | 2749 | /* Set if the alignment of this DECL has been set by the user, for |
2750 | example with an 'aligned' attribute. */ | |
eb65426a | 2751 | #define DECL_USER_ALIGN(NODE) \ |
87d8f7b6 | 2752 | (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) |
8fd3ce0b | 2753 | /* Holds the machine mode corresponding to the declaration of a variable or |
2754 | field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a | |
2755 | FIELD_DECL. */ | |
5ded8c6f | 2756 | #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) |
56ba46a4 | 2757 | |
fc0cc704 | 2758 | /* For FUNCTION_DECL, if it is built-in, this identifies which built-in |
2759 | operation it is. Note, however, that this field is overloaded, with | |
2760 | DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be | |
2761 | checked before any access to the former. */ | |
097b5c8b | 2762 | #define DECL_FUNCTION_CODE(NODE) \ |
2763 | (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) | |
d72a838e | 2764 | |
58d82cd0 | 2765 | #define DECL_FUNCTION_PERSONALITY(NODE) \ |
2766 | (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) | |
2767 | ||
5d4990a0 | 2768 | /* Nonzero for a given ..._DECL node means that the name of this node should |
28fa603b | 2769 | be ignored for symbolic debug purposes. For a TYPE_DECL, this means that |
2770 | the associated type should be ignored. For a FUNCTION_DECL, the body of | |
2771 | the function should also be ignored. */ | |
eb65426a | 2772 | #define DECL_IGNORED_P(NODE) \ |
2773 | (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) | |
d72a838e | 2774 | |
f7a75810 | 2775 | /* Nonzero for a given ..._DECL node means that this node represents an |
2776 | "abstract instance" of the given declaration (e.g. in the original | |
2777 | declaration of an inline function). When generating symbolic debugging | |
c3418f42 | 2778 | information, we mustn't try to generate any address information for nodes |
f7a75810 | 2779 | marked as "abstract instances" because we don't actually generate |
2780 | any code or allocate any data space for such instances. */ | |
eb65426a | 2781 | #define DECL_ABSTRACT(NODE) \ |
2782 | (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) | |
f7a772a7 | 2783 | |
9ed1ded5 | 2784 | /* Language-specific decl information. */ |
eb65426a | 2785 | #define DECL_LANG_SPECIFIC(NODE) \ |
2786 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) | |
d72a838e | 2787 | |
5ded8c6f | 2788 | /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: |
65661e93 | 2789 | do not allocate storage, and refer to a definition elsewhere. Note that |
2790 | this does not necessarily imply the entity represented by NODE | |
2791 | has no program source-level definition in this translation unit. For | |
2792 | example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and | |
2793 | DECL_EXTERNAL may be true simultaneously; that can be the case for | |
2794 | a C99 "extern inline" function. */ | |
33a0b99d | 2795 | #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) |
d72a838e | 2796 | |
d72a838e | 2797 | /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. |
2798 | For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. | |
2799 | ||
2800 | For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. | |
2801 | ||
2802 | Also set in some languages for variables, etc., outside the normal | |
2803 | lexical scope, such as class instance variables. */ | |
eb65426a | 2804 | #define DECL_NONLOCAL(NODE) \ |
2805 | (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) | |
d72a838e | 2806 | |
5ded8c6f | 2807 | /* Used in VAR_DECLs to indicate that the variable is a vtable. |
2808 | Used in FIELD_DECLs for vtable pointers. | |
2809 | Used in FUNCTION_DECLs to indicate that the function is virtual. */ | |
eb65426a | 2810 | #define DECL_VIRTUAL_P(NODE) \ |
2811 | (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) | |
d72a838e | 2812 | |
5ded8c6f | 2813 | /* Used to indicate that this DECL represents a compiler-generated entity. */ |
eb65426a | 2814 | #define DECL_ARTIFICIAL(NODE) \ |
2815 | (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) | |
e2b04249 | 2816 | |
5ded8c6f | 2817 | /* Additional flags for language-specific uses. */ |
eb65426a | 2818 | #define DECL_LANG_FLAG_0(NODE) \ |
2819 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) | |
2820 | #define DECL_LANG_FLAG_1(NODE) \ | |
2821 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) | |
2822 | #define DECL_LANG_FLAG_2(NODE) \ | |
2823 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) | |
2824 | #define DECL_LANG_FLAG_3(NODE) \ | |
2825 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) | |
2826 | #define DECL_LANG_FLAG_4(NODE) \ | |
2827 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) | |
2828 | #define DECL_LANG_FLAG_5(NODE) \ | |
2829 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) | |
2830 | #define DECL_LANG_FLAG_6(NODE) \ | |
2831 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) | |
2832 | #define DECL_LANG_FLAG_7(NODE) \ | |
2833 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) | |
2834 | #define DECL_LANG_FLAG_8(NODE) \ | |
2835 | (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) | |
60f65a0a | 2836 | |
2108f7c0 | 2837 | /* Nonzero for a scope which is equal to file scope. */ |
2838 | #define SCOPE_FILE_SCOPE_P(EXP) \ | |
2839 | (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) | |
5ded8c6f | 2840 | /* Nonzero for a decl which is at file scope. */ |
2108f7c0 | 2841 | #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) |
2842 | /* Nonzero for a type which is at file scope. */ | |
2843 | #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) | |
b212f378 | 2844 | |
5ded8c6f | 2845 | /* Nonzero for a decl that is decorated using attribute used. |
b636e057 | 2846 | This indicates to compiler tools that this decl needs to be preserved. */ |
5ded8c6f | 2847 | #define DECL_PRESERVE_P(DECL) \ |
2848 | DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag | |
7bd4091f | 2849 | |
8ea8de24 | 2850 | /* For function local variables of COMPLEX and VECTOR types, |
2851 | indicates that the variable is not aliased, and that all | |
2852 | modifications to the variable have been adjusted so that | |
2853 | they are killing assignments. Thus the variable may now | |
2854 | be treated as a GIMPLE register, and use real instead of | |
2855 | virtual ops in SSA form. */ | |
2856 | #define DECL_GIMPLE_REG_P(DECL) \ | |
5ded8c6f | 2857 | DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag |
8f80e66d | 2858 | |
fb1e4f4a | 2859 | struct GTY(()) tree_decl_common { |
5ded8c6f | 2860 | struct tree_decl_minimal common; |
2861 | tree size; | |
1b53eb20 | 2862 | |
5ded8c6f | 2863 | ENUM_BITFIELD(machine_mode) mode : 8; |
2a6f0f81 | 2864 | |
5ded8c6f | 2865 | unsigned nonlocal_flag : 1; |
2866 | unsigned virtual_flag : 1; | |
2867 | unsigned ignored_flag : 1; | |
2868 | unsigned abstract_flag : 1; | |
2869 | unsigned artificial_flag : 1; | |
5ded8c6f | 2870 | unsigned preserve_flag: 1; |
2871 | unsigned debug_expr_is_from : 1; | |
2872 | ||
2873 | unsigned lang_flag_0 : 1; | |
2874 | unsigned lang_flag_1 : 1; | |
2875 | unsigned lang_flag_2 : 1; | |
2876 | unsigned lang_flag_3 : 1; | |
2877 | unsigned lang_flag_4 : 1; | |
2878 | unsigned lang_flag_5 : 1; | |
2879 | unsigned lang_flag_6 : 1; | |
2880 | unsigned lang_flag_7 : 1; | |
17814aca | 2881 | unsigned lang_flag_8 : 1; |
7bd4091f | 2882 | |
5ded8c6f | 2883 | /* In LABEL_DECL, this is DECL_ERROR_ISSUED. |
2884 | In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ | |
2885 | unsigned decl_flag_0 : 1; | |
5ded8c6f | 2886 | /* In FIELD_DECL, this is DECL_BIT_FIELD |
7bd4091f | 2887 | In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. |
33a0b99d | 2888 | In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */ |
2889 | unsigned decl_flag_1 : 1; | |
5ded8c6f | 2890 | /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P |
4d5b4e6a | 2891 | In VAR_DECL, PARM_DECL and RESULT_DECL, this is |
2892 | DECL_HAS_VALUE_EXPR_P. */ | |
33a0b99d | 2893 | unsigned decl_flag_2 : 1; |
96cd09d2 | 2894 | /* 1 bit unused. */ |
2895 | unsigned decl_flag_3 : 1; | |
7bd4091f | 2896 | /* Logically, these two would go in a theoretical base shared by var and |
604eef2c | 2897 | parm decl. */ |
5ded8c6f | 2898 | unsigned gimple_reg_flag : 1; |
7ac958de | 2899 | /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */ |
2900 | unsigned decl_by_reference_flag : 1; | |
96cd09d2 | 2901 | /* In a VAR_DECL and PARM_DECL, this is DECL_READ_P. */ |
abc6c64f | 2902 | unsigned decl_read_flag : 1; |
96cd09d2 | 2903 | /* In a VAR_DECL or RESULT_DECL, this is DECL_NONSHAREABLE. */ |
c7c68014 | 2904 | unsigned decl_nonshareable_flag : 1; |
7bd4091f | 2905 | |
097b5c8b | 2906 | /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */ |
2907 | unsigned int off_align : 8; | |
5ded8c6f | 2908 | |
96cd09d2 | 2909 | /* 24 bits unused. */ |
313b1a2e | 2910 | |
2911 | /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */ | |
2912 | unsigned int align; | |
2913 | ||
a44dc115 | 2914 | /* UID for points-to sets, stable over copying from inlining. */ |
2915 | unsigned int pt_uid; | |
2916 | ||
5ded8c6f | 2917 | tree size_unit; |
2918 | tree initial; | |
2919 | tree attributes; | |
2920 | tree abstract_origin; | |
7bd4091f | 2921 | |
5ded8c6f | 2922 | /* Points to a structure whose details depend on the language in use. */ |
2923 | struct lang_decl *lang_specific; | |
2924 | }; | |
1431bff6 | 2925 | |
75fa4f82 | 2926 | extern tree decl_value_expr_lookup (tree); |
2927 | extern void decl_value_expr_insert (tree, tree); | |
2928 | ||
afcf285e | 2929 | /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, |
2930 | if transformations have made this more complicated than evaluating the | |
2931 | decl itself. This should only be used for debugging; once this field has | |
2932 | been set, the decl itself may not legitimately appear in the function. */ | |
75fa4f82 | 2933 | #define DECL_HAS_VALUE_EXPR_P(NODE) \ |
4d5b4e6a | 2934 | (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ |
2935 | ->decl_common.decl_flag_2) | |
afcf285e | 2936 | #define DECL_VALUE_EXPR(NODE) \ |
7bd4091f | 2937 | (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) |
eb65426a | 2938 | #define SET_DECL_VALUE_EXPR(NODE, VAL) \ |
5ded8c6f | 2939 | (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) |
afcf285e | 2940 | |
5ded8c6f | 2941 | /* Holds the RTL expression for the value of a variable or function. |
2942 | This value can be evaluated lazily for functions, variables with | |
2943 | static storage duration, and labels. */ | |
2944 | #define DECL_RTL(NODE) \ | |
2945 | (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ | |
2946 | ? (NODE)->decl_with_rtl.rtl \ | |
2947 | : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) | |
7259f3f8 | 2948 | |
5ded8c6f | 2949 | /* Set the DECL_RTL for NODE to RTL. */ |
2950 | #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) | |
26d1c5ff | 2951 | |
5ded8c6f | 2952 | /* Returns nonzero if NODE is a tree node that can contain RTL. */ |
2953 | #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) | |
2954 | ||
2955 | /* Returns nonzero if the DECL_RTL for NODE has already been set. */ | |
eb65426a | 2956 | #define DECL_RTL_SET_P(NODE) \ |
2957 | (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) | |
5ded8c6f | 2958 | |
2959 | /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for | |
2960 | NODE1, it will not be set for NODE2; this is a lazy copy. */ | |
2961 | #define COPY_DECL_RTL(NODE1, NODE2) \ | |
eb65426a | 2962 | (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \ |
2963 | = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) | |
5ded8c6f | 2964 | |
2965 | /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ | |
2966 | #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) | |
2967 | ||
72fdb379 | 2968 | #if (GCC_VERSION >= 2007) |
2969 | #define DECL_RTL_KNOWN_SET(decl) __extension__ \ | |
2970 | ({ tree const __d = (decl); \ | |
2971 | gcc_checking_assert (DECL_RTL_SET_P (__d)); \ | |
2972 | /* Dereference it so the compiler knows it can't be NULL even \ | |
2973 | without assertion checking. */ \ | |
2974 | &*DECL_RTL_IF_SET (__d); }) | |
2975 | #else | |
2976 | #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) | |
2977 | #endif | |
2978 | ||
5ded8c6f | 2979 | /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
2980 | #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) | |
2981 | ||
fb1e4f4a | 2982 | struct GTY(()) tree_decl_with_rtl { |
5ded8c6f | 2983 | struct tree_decl_common common; |
2984 | rtx rtl; | |
2985 | }; | |
2986 | ||
2987 | /* In a FIELD_DECL, this is the field position, counting in bytes, of the | |
9f35f9b2 | 2988 | DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning |
2989 | of the structure. */ | |
5ded8c6f | 2990 | #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) |
2991 | ||
2992 | /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the | |
9f35f9b2 | 2993 | field from DECL_FIELD_OFFSET. This field may be nonzero even for fields |
2994 | that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the | |
2995 | natural alignment of the field's type). */ | |
eb65426a | 2996 | #define DECL_FIELD_BIT_OFFSET(NODE) \ |
2997 | (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) | |
5ded8c6f | 2998 | |
2999 | /* In a FIELD_DECL, this indicates whether the field was a bit-field and | |
3000 | if so, the type that was originally specified for it. | |
3001 | TREE_TYPE may have been modified (in finish_struct). */ | |
eb65426a | 3002 | #define DECL_BIT_FIELD_TYPE(NODE) \ |
3003 | (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) | |
5ded8c6f | 3004 | |
8d8a34f9 | 3005 | /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage |
3006 | representative FIELD_DECL. */ | |
3007 | #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ | |
3008 | (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) | |
3009 | ||
5ded8c6f | 3010 | /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
3011 | if nonzero, indicates that the field occupies the type. */ | |
3012 | #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) | |
3013 | ||
3014 | /* For FIELD_DECLs, off_align holds the number of low-order bits of | |
3015 | DECL_FIELD_OFFSET which are known to be always zero. | |
3016 | DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET | |
3017 | has. */ | |
3018 | #define DECL_OFFSET_ALIGN(NODE) \ | |
097b5c8b | 3019 | (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) |
5ded8c6f | 3020 | |
3021 | /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ | |
3022 | #define SET_DECL_OFFSET_ALIGN(NODE, X) \ | |
7e8d812e | 3023 | (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) |
5ded8c6f | 3024 | |
3025 | /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in | |
3026 | which this FIELD_DECL is defined. This information is needed when | |
3027 | writing debugging information about vfield and vbase decls for C++. */ | |
3028 | #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) | |
3029 | ||
3030 | /* In a FIELD_DECL, indicates this field should be bit-packed. */ | |
87d8f7b6 | 3031 | #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag) |
26dfc457 | 3032 | |
d72a838e | 3033 | /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
3034 | specially. */ | |
33a0b99d | 3035 | #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) |
56ba46a4 | 3036 | |
5ded8c6f | 3037 | /* Used in a FIELD_DECL to indicate that we cannot form the address of |
c67bf066 | 3038 | this component. This makes it possible for Type-Based Alias Analysis |
3039 | to disambiguate accesses to this field with indirect accesses using | |
3040 | the field's type: | |
3041 | ||
3042 | struct S { int i; } s; | |
3043 | int *p; | |
3044 | ||
3045 | If the flag is set on 'i', TBAA computes that s.i and *p never conflict. | |
3046 | ||
3047 | From the implementation's viewpoint, the alias set of the type of the | |
3048 | field 'i' (int) will not be recorded as a subset of that of the type of | |
3049 | 's' (struct S) in record_component_aliases. The counterpart is that | |
3050 | accesses to s.i must not be given the alias set of the type of 'i' | |
3051 | (int) but instead directly that of the type of 's' (struct S). */ | |
5ded8c6f | 3052 | #define DECL_NONADDRESSABLE_P(NODE) \ |
33a0b99d | 3053 | (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) |
8305149e | 3054 | |
fb1e4f4a | 3055 | struct GTY(()) tree_field_decl { |
5ded8c6f | 3056 | struct tree_decl_common common; |
3057 | ||
7bd4091f | 3058 | tree offset; |
3059 | tree bit_field_type; | |
5ded8c6f | 3060 | tree qualifier; |
3061 | tree bit_offset; | |
3062 | tree fcontext; | |
5ded8c6f | 3063 | }; |
d72a838e | 3064 | |
5ded8c6f | 3065 | /* A numeric unique identifier for a LABEL_DECL. The UID allocation is |
3066 | dense, unique within any one function, and may be used to index arrays. | |
3067 | If the value is -1, then no UID has been assigned. */ | |
3068 | #define LABEL_DECL_UID(NODE) \ | |
313b1a2e | 3069 | (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid) |
56ba46a4 | 3070 | |
e38def9c | 3071 | /* In a LABEL_DECL, the EH region number for which the label is the |
3072 | post_landing_pad. */ | |
3073 | #define EH_LANDING_PAD_NR(NODE) \ | |
3074 | (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr) | |
3075 | ||
5ded8c6f | 3076 | /* In LABEL_DECL nodes, nonzero means that an error message about |
3077 | jumping into such a binding contour has been printed for this label. */ | |
313b1a2e | 3078 | #define DECL_ERROR_ISSUED(NODE) \ |
3079 | (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0) | |
00dd2e9e | 3080 | |
fb1e4f4a | 3081 | struct GTY(()) tree_label_decl { |
5ded8c6f | 3082 | struct tree_decl_with_rtl common; |
313b1a2e | 3083 | int label_decl_uid; |
e38def9c | 3084 | int eh_landing_pad_nr; |
5ded8c6f | 3085 | }; |
3086 | ||
fb1e4f4a | 3087 | struct GTY(()) tree_result_decl { |
5ded8c6f | 3088 | struct tree_decl_with_rtl common; |
3089 | }; | |
3090 | ||
fb1e4f4a | 3091 | struct GTY(()) tree_const_decl { |
544d4f58 | 3092 | struct tree_decl_common common; |
5ded8c6f | 3093 | }; |
3094 | ||
3095 | /* For a PARM_DECL, records the data type used to pass the argument, | |
3096 | which may be different from the type seen in the program. */ | |
3097 | #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) | |
3098 | ||
3099 | /* For PARM_DECL, holds an RTL for the stack slot or register | |
3100 | where the data was actually passed. */ | |
eb65426a | 3101 | #define DECL_INCOMING_RTL(NODE) \ |
3102 | (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) | |
2682e5d6 | 3103 | |
fb1e4f4a | 3104 | struct GTY(()) tree_parm_decl { |
5ded8c6f | 3105 | struct tree_decl_with_rtl common; |
7bd4091f | 3106 | rtx incoming_rtl; |
5ded8c6f | 3107 | }; |
02e7a332 | 3108 | |
aa5ec236 | 3109 | |
5ded8c6f | 3110 | /* Nonzero for a given ..._DECL node means that no warnings should be |
3111 | generated just because this node is unused. */ | |
3112 | #define DECL_IN_SYSTEM_HEADER(NODE) \ | |
bdbc474b | 3113 | (in_system_header_at (DECL_SOURCE_LOCATION (NODE))) |
5ded8c6f | 3114 | |
eb65426a | 3115 | /* Used to indicate that the linkage status of this DECL is not yet known, |
3116 | so it should not be output now. */ | |
3117 | #define DECL_DEFER_OUTPUT(NODE) \ | |
3118 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) | |
3119 | ||
3120 | /* In a VAR_DECL that's static, | |
3121 | nonzero if the space is in the text section. */ | |
3122 | #define DECL_IN_TEXT_SECTION(NODE) \ | |
3123 | (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) | |
3124 | ||
ecba073f | 3125 | /* In a VAR_DECL that's static, |
3126 | nonzero if it belongs to the global constant pool. */ | |
3127 | #define DECL_IN_CONSTANT_POOL(NODE) \ | |
3128 | (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool) | |
3129 | ||
eb65426a | 3130 | /* Nonzero for a given ..._DECL node means that this node should be |
3131 | put in .common, if possible. If a DECL_INITIAL is given, and it | |
3132 | is not error_mark_node, then the decl cannot be put in .common. */ | |
3133 | #define DECL_COMMON(NODE) \ | |
3134 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) | |
3135 | ||
3136 | /* In a VAR_DECL, nonzero if the decl is a register variable with | |
3137 | an explicit asm specification. */ | |
3138 | #define DECL_HARD_REGISTER(NODE) \ | |
3139 | (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) | |
3140 | ||
5ded8c6f | 3141 | /* Used to indicate that this DECL has weak linkage. */ |
3142 | #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) | |
3143 | ||
6c1e551f | 3144 | /* Used to indicate that the DECL is a dllimport. */ |
eb65426a | 3145 | #define DECL_DLLIMPORT_P(NODE) \ |
3146 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) | |
9a0ce7db | 3147 | |
d1d06be2 | 3148 | /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need |
3149 | not be put out unless it is needed in this translation unit. | |
3150 | Entities like this are shared across translation units (like weak | |
3151 | entities), but are guaranteed to be generated by any translation | |
3152 | unit that needs them, and therefore need not be put out anywhere | |
3153 | where they are not needed. DECL_COMDAT is just a hint to the | |
3154 | back-end; it is up to front-ends which set this flag to ensure | |
3155 | that there will never be any harm, other than bloat, in putting out | |
3156 | something which is DECL_COMDAT. */ | |
eb65426a | 3157 | #define DECL_COMDAT(NODE) \ |
3158 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) | |
d1d06be2 | 3159 | |
eb65426a | 3160 | #define DECL_COMDAT_GROUP(NODE) \ |
3161 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group) | |
3162 | ||
3163 | /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in | |
3164 | multiple translation units should be merged. */ | |
3165 | #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE) | |
ecd88073 | 3166 | |
5ded8c6f | 3167 | /* The name of the object as the assembler will see it (but before any |
3168 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
3169 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
3170 | #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) | |
abd28cef | 3171 | |
7bd4091f | 3172 | /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. |
5ded8c6f | 3173 | This is true of all DECL nodes except FIELD_DECL. */ |
3174 | #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ | |
3175 | (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) | |
8f8ac140 | 3176 | |
5ded8c6f | 3177 | /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, |
3178 | the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set | |
3179 | yet. */ | |
3180 | #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ | |
eb65426a | 3181 | (HAS_DECL_ASSEMBLER_NAME_P (NODE) \ |
3182 | && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) | |
d72a838e | 3183 | |
5ded8c6f | 3184 | /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ |
3185 | #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ | |
3186 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) | |
c6f5e832 | 3187 | |
5ded8c6f | 3188 | /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's |
3189 | DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause | |
3190 | the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the | |
3191 | semantics of using this macro, are different than saying: | |
851dfbff | 3192 | |
5ded8c6f | 3193 | SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) |
a5b1863e | 3194 | |
5ded8c6f | 3195 | which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ |
4ee9c684 | 3196 | |
5ded8c6f | 3197 | #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ |
3198 | (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ | |
3199 | ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ | |
3200 | DECL_ASSEMBLER_NAME (DECL1)) \ | |
3201 | : (void) 0) | |
4ee9c684 | 3202 | |
5ded8c6f | 3203 | /* Records the section name in a section attribute. Used to pass |
3204 | the name from decl_attributes to make_function_rtl and make_decl_rtl. */ | |
eb65426a | 3205 | #define DECL_SECTION_NAME(NODE) \ |
3206 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name) | |
3207 | ||
3208 | /* Nonzero in a decl means that the gimplifier has seen (or placed) | |
3209 | this variable in a BIND_EXPR. */ | |
3210 | #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ | |
3211 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) | |
a5b1863e | 3212 | |
5ded8c6f | 3213 | /* Value of the decls's visibility attribute */ |
eb65426a | 3214 | #define DECL_VISIBILITY(NODE) \ |
3215 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) | |
5ded8c6f | 3216 | |
3217 | /* Nonzero means that the decl had its visibility specified rather than | |
3218 | being inferred. */ | |
eb65426a | 3219 | #define DECL_VISIBILITY_SPECIFIED(NODE) \ |
3220 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) | |
5ded8c6f | 3221 | |
eb65426a | 3222 | /* In a VAR_DECL, the model to use if the data should be allocated from |
3223 | thread-local storage. */ | |
3224 | #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model) | |
3225 | ||
3226 | /* In a VAR_DECL, nonzero if the data should be allocated from | |
3227 | thread-local storage. */ | |
3228 | #define DECL_THREAD_LOCAL_P(NODE) \ | |
3229 | (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL) | |
3230 | ||
3231 | /* In a non-local VAR_DECL with static storage duration, true if the | |
3232 | variable has an initialization priority. If false, the variable | |
3233 | will be initialized at the DEFAULT_INIT_PRIORITY. */ | |
3234 | #define DECL_HAS_INIT_PRIORITY_P(NODE) \ | |
3235 | (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) | |
5ded8c6f | 3236 | |
3b73548b | 3237 | /* Specify whether the section name was set by user or by |
3238 | compiler via -ffunction-sections. */ | |
3239 | #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \ | |
3240 | (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p) | |
3241 | ||
fb1e4f4a | 3242 | struct GTY(()) tree_decl_with_vis { |
5ded8c6f | 3243 | struct tree_decl_with_rtl common; |
3244 | tree assembler_name; | |
3245 | tree section_name; | |
ecd88073 | 3246 | tree comdat_group; |
7bd4091f | 3247 | |
5ded8c6f | 3248 | /* Belong to VAR_DECL exclusively. */ |
8115f0af | 3249 | unsigned defer_output : 1; |
3250 | unsigned hard_register : 1; | |
8115f0af | 3251 | unsigned common_flag : 1; |
5ded8c6f | 3252 | unsigned in_text_section : 1; |
ecba073f | 3253 | unsigned in_constant_pool : 1; |
7bd4091f | 3254 | unsigned dllimport_flag : 1; |
5ded8c6f | 3255 | /* Don't belong to VAR_DECL exclusively. */ |
8115f0af | 3256 | unsigned weak_flag : 1; |
4f364235 | 3257 | /* When SECTION_NAME is implied by -ffunction-section. */ |
3258 | unsigned implicit_section_name_p : 1; | |
8115f0af | 3259 | |
5ded8c6f | 3260 | unsigned seen_in_bind_expr : 1; |
3261 | unsigned comdat_flag : 1; | |
3262 | ENUM_BITFIELD(symbol_visibility) visibility : 2; | |
3263 | unsigned visibility_specified : 1; | |
5ded8c6f | 3264 | /* Belongs to VAR_DECL exclusively. */ |
3265 | ENUM_BITFIELD(tls_model) tls_model : 3; | |
8115f0af | 3266 | |
3267 | /* Belong to FUNCTION_DECL exclusively. */ | |
3268 | unsigned init_priority_p : 1; | |
ecba073f | 3269 | /* Used by C++ only. Might become a generic decl flag. */ |
3270 | unsigned shadowed_for_var_p : 1; | |
585bb356 | 3271 | /* Belong to FUNCTION_DECL exclusively. */ |
fc3dabd5 | 3272 | unsigned cxx_constructor : 1; |
3273 | /* Belong to FUNCTION_DECL exclusively. */ | |
3274 | unsigned cxx_destructor : 1; | |
3275 | /* Belong to FUNCTION_DECL exclusively. */ | |
585bb356 | 3276 | unsigned final : 1; |
fc3dabd5 | 3277 | /* 11 unused bits. */ |
5ded8c6f | 3278 | }; |
3279 | ||
5ded8c6f | 3280 | extern tree decl_debug_expr_lookup (tree); |
3281 | extern void decl_debug_expr_insert (tree, tree); | |
8e966116 | 3282 | /* For VAR_DECL, this is set to an expression that it was split from. */ |
3283 | #define DECL_HAS_DEBUG_EXPR_P(NODE) \ | |
3284 | (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from) | |
5ded8c6f | 3285 | #define DECL_DEBUG_EXPR(NODE) \ |
3286 | (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) | |
3287 | ||
3288 | #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ | |
3289 | (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) | |
3290 | ||
f0b5f617 | 3291 | /* An initialization priority. */ |
9af7fd5b | 3292 | typedef unsigned short priority_type; |
5ded8c6f | 3293 | |
9af7fd5b | 3294 | extern priority_type decl_init_priority_lookup (tree); |
3295 | extern priority_type decl_fini_priority_lookup (tree); | |
3296 | extern void decl_init_priority_insert (tree, priority_type); | |
3297 | extern void decl_fini_priority_insert (tree, priority_type); | |
5ded8c6f | 3298 | |
2c56f72e | 3299 | /* For a VAR_DECL or FUNCTION_DECL the initialization priority of |
48e1416a | 3300 | NODE. */ |
5ded8c6f | 3301 | #define DECL_INIT_PRIORITY(NODE) \ |
9af7fd5b | 3302 | (decl_init_priority_lookup (NODE)) |
3303 | /* Set the initialization priority for NODE to VAL. */ | |
5ded8c6f | 3304 | #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ |
9af7fd5b | 3305 | (decl_init_priority_insert (NODE, VAL)) |
3306 | ||
2c56f72e | 3307 | /* For a FUNCTION_DECL the finalization priority of NODE. */ |
9af7fd5b | 3308 | #define DECL_FINI_PRIORITY(NODE) \ |
3309 | (decl_fini_priority_lookup (NODE)) | |
3310 | /* Set the finalization priority for NODE to VAL. */ | |
3311 | #define SET_DECL_FINI_PRIORITY(NODE, VAL) \ | |
3312 | (decl_fini_priority_insert (NODE, VAL)) | |
3313 | ||
3314 | /* The initialization priority for entities for which no explicit | |
3315 | initialization priority has been specified. */ | |
3316 | #define DEFAULT_INIT_PRIORITY 65535 | |
3317 | ||
3318 | /* The maximum allowed initialization priority. */ | |
3319 | #define MAX_INIT_PRIORITY 65535 | |
3320 | ||
3321 | /* The largest priority value reserved for use by system runtime | |
3322 | libraries. */ | |
3323 | #define MAX_RESERVED_INIT_PRIORITY 100 | |
5ded8c6f | 3324 | |
05c14132 | 3325 | /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */ |
5084b2e4 | 3326 | #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \ |
87d8f7b6 | 3327 | (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag) |
5084b2e4 | 3328 | |
05c14132 | 3329 | /* In a VAR_DECL, nonzero if this is a non-local frame structure. */ |
3330 | #define DECL_NONLOCAL_FRAME(NODE) \ | |
3331 | (VAR_DECL_CHECK (NODE)->base.default_def_flag) | |
3332 | ||
fb1e4f4a | 3333 | struct GTY(()) tree_var_decl { |
5ded8c6f | 3334 | struct tree_decl_with_vis common; |
3335 | }; | |
3336 | ||
3337 | ||
3338 | /* This field is used to reference anything in decl.result and is meant only | |
3339 | for use by the garbage collector. */ | |
eb65426a | 3340 | #define DECL_RESULT_FLD(NODE) \ |
3341 | (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) | |
5ded8c6f | 3342 | |
3343 | /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. | |
3344 | Before the struct containing the FUNCTION_DECL is laid out, | |
3345 | DECL_VINDEX may point to a FUNCTION_DECL in a base class which | |
3346 | is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual | |
3347 | function. When the class is laid out, this pointer is changed | |
3348 | to an INTEGER_CST node which is suitable for use as an index | |
7bd4091f | 3349 | into the virtual function table. |
5ded8c6f | 3350 | C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */ |
eb65426a | 3351 | #define DECL_VINDEX(NODE) \ |
3352 | (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex) | |
5ded8c6f | 3353 | |
fb1e4f4a | 3354 | struct GTY(()) |
3355 | tree_decl_non_common { | |
5ded8c6f | 3356 | struct tree_decl_with_vis common; |
3357 | /* C++ uses this in namespaces. */ | |
3358 | tree saved_tree; | |
3359 | /* C++ uses this in templates. */ | |
7bd4091f | 3360 | tree arguments; |
5ded8c6f | 3361 | /* Almost all FE's use this. */ |
7bd4091f | 3362 | tree result; |
9ccd0eb4 | 3363 | /* C++ uses this in namespaces and function_decls. */ |
5ded8c6f | 3364 | tree vindex; |
3365 | }; | |
3366 | ||
3367 | /* In FUNCTION_DECL, holds the decl for the return value. */ | |
3368 | #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) | |
3369 | ||
3370 | /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ | |
eb65426a | 3371 | #define DECL_UNINLINABLE(NODE) \ |
3372 | (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) | |
5ded8c6f | 3373 | |
3374 | /* In a FUNCTION_DECL, the saved representation of the body of the | |
3375 | entire function. */ | |
eb65426a | 3376 | #define DECL_SAVED_TREE(NODE) \ |
3377 | (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree) | |
5ded8c6f | 3378 | |
3379 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3380 | as if it were a malloc, meaning it returns a pointer that is | |
3381 | not an alias. */ | |
eb65426a | 3382 | #define DECL_IS_MALLOC(NODE) \ |
3383 | (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) | |
5ded8c6f | 3384 | |
68d6de5b | 3385 | /* Nonzero in a FUNCTION_DECL means this function should be treated as |
3386 | C++ operator new, meaning that it returns a pointer for which we | |
3387 | should not use type based aliasing. */ | |
3388 | #define DECL_IS_OPERATOR_NEW(NODE) \ | |
3389 | (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag) | |
3390 | ||
5ded8c6f | 3391 | /* Nonzero in a FUNCTION_DECL means this function may return more |
3392 | than once. */ | |
3393 | #define DECL_IS_RETURNS_TWICE(NODE) \ | |
3394 | (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) | |
3395 | ||
3396 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3397 | as "pure" function (like const function, but may read global memory). */ | |
9c2a0c05 | 3398 | #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) |
3399 | ||
3400 | /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND | |
3401 | the const or pure function may not terminate. When this is nonzero | |
3402 | for a const or pure function, it can be dealt with by cse passes | |
3403 | but cannot be removed by dce passes since you are not allowed to | |
3404 | change an infinite looping program into one that terminates without | |
3405 | error. */ | |
3406 | #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \ | |
3407 | (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag) | |
5ded8c6f | 3408 | |
3409 | /* Nonzero in a FUNCTION_DECL means this function should be treated | |
3410 | as "novops" function (function that does not read global memory, | |
3411 | but may have arbitrary side effects). */ | |
eb65426a | 3412 | #define DECL_IS_NOVOPS(NODE) \ |
3413 | (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) | |
5ded8c6f | 3414 | |
3415 | /* Used in FUNCTION_DECLs to indicate that they should be run automatically | |
3416 | at the beginning or end of execution. */ | |
3417 | #define DECL_STATIC_CONSTRUCTOR(NODE) \ | |
3418 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) | |
3419 | ||
3420 | #define DECL_STATIC_DESTRUCTOR(NODE) \ | |
3421 | (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) | |
3422 | ||
3423 | /* Used in FUNCTION_DECLs to indicate that function entry and exit should | |
3424 | be instrumented with calls to support routines. */ | |
3425 | #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ | |
3426 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) | |
3427 | ||
3428 | /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be | |
3429 | disabled in this function. */ | |
3430 | #define DECL_NO_LIMIT_STACK(NODE) \ | |
3431 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) | |
3432 | ||
3bb63aeb | 3433 | /* In a FUNCTION_DECL indicates that a static chain is needed. */ |
3434 | #define DECL_STATIC_CHAIN(NODE) \ | |
5ded8c6f | 3435 | (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag) |
3a2bf8d3 | 3436 | |
e1232ce2 | 3437 | /* Nonzero for a decl that cgraph has decided should be inlined into |
3438 | at least one call site. It is not meaningful to look at this | |
3439 | directly; always use cgraph_function_possibly_inlined_p. */ | |
3440 | #define DECL_POSSIBLY_INLINED(DECL) \ | |
5ded8c6f | 3441 | FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined |
e1232ce2 | 3442 | |
5ded8c6f | 3443 | /* Nonzero in a FUNCTION_DECL means that this function was declared inline, |
3444 | such as via the `inline' keyword in C/C++. This flag controls the linkage | |
73b5e722 | 3445 | semantics of 'inline' */ |
5ded8c6f | 3446 | #define DECL_DECLARED_INLINE_P(NODE) \ |
3447 | (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) | |
d471893d | 3448 | |
73b5e722 | 3449 | /* Nonzero in a FUNCTION_DECL means this function should not get |
3450 | -Winline warnings. */ | |
3451 | #define DECL_NO_INLINE_WARNING_P(NODE) \ | |
3452 | (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag) | |
3453 | ||
4c0315d0 | 3454 | /* Nonzero if a FUNCTION_CODE is a TM load/store. */ |
3455 | #define BUILTIN_TM_LOAD_STORE_P(FN) \ | |
3456 | ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) | |
3457 | ||
3458 | /* Nonzero if a FUNCTION_CODE is a TM load. */ | |
3459 | #define BUILTIN_TM_LOAD_P(FN) \ | |
3460 | ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) | |
3461 | ||
3462 | /* Nonzero if a FUNCTION_CODE is a TM store. */ | |
3463 | #define BUILTIN_TM_STORE_P(FN) \ | |
3464 | ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE) | |
3465 | ||
3466 | #define CASE_BUILT_IN_TM_LOAD(FN) \ | |
3467 | case BUILT_IN_TM_LOAD_##FN: \ | |
3468 | case BUILT_IN_TM_LOAD_RAR_##FN: \ | |
3469 | case BUILT_IN_TM_LOAD_RAW_##FN: \ | |
3470 | case BUILT_IN_TM_LOAD_RFW_##FN | |
3471 | ||
3472 | #define CASE_BUILT_IN_TM_STORE(FN) \ | |
3473 | case BUILT_IN_TM_STORE_##FN: \ | |
3474 | case BUILT_IN_TM_STORE_WAR_##FN: \ | |
3475 | case BUILT_IN_TM_STORE_WAW_##FN | |
3476 | ||
ebb7d626 | 3477 | /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner |
3478 | disregarding size and cost heuristics. This is equivalent to using | |
3479 | the always_inline attribute without the required diagnostics if the | |
3480 | function cannot be inlined. */ | |
3481 | #define DECL_DISREGARD_INLINE_LIMITS(NODE) \ | |
3482 | (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits) | |
3483 | ||
f1f41a6c | 3484 | extern vec<tree, va_gc> **decl_debug_args_lookup (tree); |
3485 | extern vec<tree, va_gc> **decl_debug_args_insert (tree); | |
841424cc | 3486 | |
3487 | /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */ | |
3488 | #define DECL_HAS_DEBUG_ARGS_P(NODE) \ | |
3489 | (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag) | |
3490 | ||
5ded8c6f | 3491 | /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") |
3492 | that describes the status of this function. */ | |
eb65426a | 3493 | #define DECL_STRUCT_FUNCTION(NODE) \ |
3494 | (FUNCTION_DECL_CHECK (NODE)->function_decl.f) | |
50c96bdc | 3495 | |
5ded8c6f | 3496 | /* In a FUNCTION_DECL, nonzero means a built in function. */ |
3497 | #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) | |
9c40570a | 3498 | |
5ded8c6f | 3499 | /* For a builtin function, identify which part of the compiler defined it. */ |
3500 | #define DECL_BUILT_IN_CLASS(NODE) \ | |
3501 | (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) | |
1b53eb20 | 3502 | |
5ded8c6f | 3503 | /* In FUNCTION_DECL, a chain of ..._DECL nodes. |
3504 | VAR_DECL and PARM_DECL reserve the arguments slot for language-specific | |
3505 | uses. */ | |
eb65426a | 3506 | #define DECL_ARGUMENTS(NODE) \ |
3507 | (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments) | |
3508 | #define DECL_ARGUMENT_FLD(NODE) \ | |
3509 | (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments) | |
d72a838e | 3510 | |
46f8e3b0 | 3511 | /* In FUNCTION_DECL, the function specific target options to use when compiling |
3512 | this function. */ | |
3513 | #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \ | |
3514 | (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target) | |
3515 | ||
3516 | /* In FUNCTION_DECL, the function specific optimization options to use when | |
3517 | compiling this function. */ | |
3518 | #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \ | |
3519 | (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization) | |
3520 | ||
cc8ef84f | 3521 | /* In FUNCTION_DECL, this is set if this function has other versions generated |
3522 | using "target" attributes. The default version is the one which does not | |
3523 | have any "target" attribute set. */ | |
3524 | #define DECL_FUNCTION_VERSIONED(NODE)\ | |
3525 | (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function) | |
3526 | ||
fc3dabd5 | 3527 | /* In FUNCTION_DECL, this is set if this function is a C++ constructor. |
3528 | Devirtualization machinery uses this knowledge for determing type of the | |
3529 | object constructed. Also we assume that constructor address is not | |
3530 | important. */ | |
3531 | #define DECL_CXX_CONSTRUCTOR_P(NODE)\ | |
3532 | (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor) | |
3533 | ||
3534 | /* In FUNCTION_DECL, this is set if this function is a C++ destructor. | |
3535 | Devirtualization machinery uses this to track types in destruction. */ | |
3536 | #define DECL_CXX_DESTRUCTOR_P(NODE)\ | |
3537 | (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor) | |
3538 | ||
585bb356 | 3539 | /* In FUNCTION_DECL that represent an virtual method this is set when |
3540 | the method is final. */ | |
3541 | #define DECL_FINAL_P(NODE)\ | |
3542 | (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final) | |
3543 | ||
5ded8c6f | 3544 | /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the |
3545 | arguments/result/saved_tree fields by front ends. It was either inherit | |
3546 | FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL, | |
3547 | which seemed a bit strange. */ | |
d72a838e | 3548 | |
fb1e4f4a | 3549 | struct GTY(()) tree_function_decl { |
5ded8c6f | 3550 | struct tree_decl_non_common common; |
7bd4091f | 3551 | |
ebb7d626 | 3552 | struct function *f; |
3553 | ||
58d82cd0 | 3554 | /* The personality function. Used for stack unwinding. */ |
3555 | tree personality; | |
3556 | ||
46f8e3b0 | 3557 | /* Function specific options that are used by this function. */ |
3558 | tree function_specific_target; /* target options */ | |
3559 | tree function_specific_optimization; /* optimization options */ | |
3560 | ||
097b5c8b | 3561 | /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is |
ebb7d626 | 3562 | DECL_FUNCTION_CODE. Otherwise unused. |
3563 | ??? The bitfield needs to be able to hold all target function | |
3564 | codes as well. */ | |
8f81a001 | 3565 | ENUM_BITFIELD(built_in_function) function_code : 11; |
ebb7d626 | 3566 | ENUM_BITFIELD(built_in_class) built_in_class : 2; |
097b5c8b | 3567 | |
aa5ec236 | 3568 | unsigned static_ctor_flag : 1; |
3569 | unsigned static_dtor_flag : 1; | |
5ded8c6f | 3570 | unsigned uninlinable : 1; |
ebb7d626 | 3571 | |
8f81a001 | 3572 | unsigned possibly_inlined : 1; |
5ded8c6f | 3573 | unsigned novops_flag : 1; |
3574 | unsigned returns_twice_flag : 1; | |
ab7943b9 | 3575 | unsigned malloc_flag : 1; |
68d6de5b | 3576 | unsigned operator_new_flag : 1; |
746149b7 | 3577 | unsigned declared_inline_flag : 1; |
5ded8c6f | 3578 | unsigned regdecl_flag : 1; |
73b5e722 | 3579 | unsigned no_inline_warning_flag : 1; |
841424cc | 3580 | |
8f81a001 | 3581 | unsigned no_instrument_function_entry_exit : 1; |
5ded8c6f | 3582 | unsigned no_limit_stack : 1; |
ebb7d626 | 3583 | unsigned disregard_inline_limits : 1; |
9c2a0c05 | 3584 | unsigned pure_flag : 1; |
3585 | unsigned looping_const_or_pure_flag : 1; | |
841424cc | 3586 | unsigned has_debug_args_flag : 1; |
4c0315d0 | 3587 | unsigned tm_clone_flag : 1; |
cc8ef84f | 3588 | unsigned versioned_function : 1; |
3589 | /* No bits left. */ | |
5ded8c6f | 3590 | }; |
d72a838e | 3591 | |
23bdc9ca | 3592 | /* The source language of the translation-unit. */ |
3593 | #define TRANSLATION_UNIT_LANGUAGE(NODE) \ | |
3594 | (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language) | |
3595 | ||
3596 | /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */ | |
3597 | ||
3598 | struct GTY(()) tree_translation_unit_decl { | |
3599 | struct tree_decl_common common; | |
3600 | /* Source language of this translation unit. Used for DWARF output. */ | |
3601 | const char * GTY((skip(""))) language; | |
3602 | /* TODO: Non-optimization used to build this translation unit. */ | |
3603 | /* TODO: Root of a partial DWARF tree for global types and decls. */ | |
3604 | }; | |
3605 | ||
3606 | /* A vector of all translation-units. */ | |
f1f41a6c | 3607 | extern GTY (()) vec<tree, va_gc> *all_translation_units; |
23bdc9ca | 3608 | |
5ded8c6f | 3609 | /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ |
eb65426a | 3610 | #define DECL_ORIGINAL_TYPE(NODE) \ |
3611 | (TYPE_DECL_CHECK (NODE)->decl_non_common.result) | |
1b53eb20 | 3612 | |
5ded8c6f | 3613 | /* In a TYPE_DECL nonzero means the detail info about this type is not dumped |
3614 | into stabs. Instead it will generate cross reference ('x') of names. | |
3615 | This uses the same flag as DECL_EXTERNAL. */ | |
3616 | #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ | |
33a0b99d | 3617 | (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1) |
4ee9c684 | 3618 | |
5d8a39b7 | 3619 | /* Getter of the imported declaration associated to the |
3620 | IMPORTED_DECL node. */ | |
3621 | #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \ | |
3622 | (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE))) | |
3623 | ||
fb1e4f4a | 3624 | struct GTY(()) tree_type_decl { |
5ded8c6f | 3625 | struct tree_decl_non_common common; |
9a7aa5df | 3626 | |
d72a838e | 3627 | }; |
4ee9c684 | 3628 | \f |
3629 | /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. | |
3630 | To reduce overhead, the nodes containing the statements are not trees. | |
3631 | This avoids the overhead of tree_common on all linked list elements. | |
3632 | ||
3633 | Use the interface in tree-iterator.h to access this node. */ | |
3634 | ||
3635 | #define STATEMENT_LIST_HEAD(NODE) \ | |
3636 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) | |
3637 | #define STATEMENT_LIST_TAIL(NODE) \ | |
3638 | (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) | |
3639 | ||
fb1e4f4a | 3640 | struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node |
3641 | { | |
4ee9c684 | 3642 | struct tree_statement_list_node *prev; |
3643 | struct tree_statement_list_node *next; | |
3644 | tree stmt; | |
3645 | }; | |
3646 | ||
fb1e4f4a | 3647 | struct GTY(()) tree_statement_list |
3648 | { | |
cacfdc02 | 3649 | struct tree_typed typed; |
4ee9c684 | 3650 | struct tree_statement_list_node *head; |
3651 | struct tree_statement_list_node *tail; | |
3652 | }; | |
6354ec2d | 3653 | |
46f8e3b0 | 3654 | |
3655 | /* Optimization options used by a function. */ | |
3656 | ||
fb1e4f4a | 3657 | struct GTY(()) tree_optimization_option { |
46f8e3b0 | 3658 | struct tree_common common; |
3659 | ||
3660 | /* The optimization options used by the user. */ | |
3661 | struct cl_optimization opts; | |
08c7d04b | 3662 | |
3663 | /* Target optabs for this set of optimization options. This is of | |
3664 | type `struct target_optabs *'. */ | |
9d3fa937 | 3665 | unsigned char *GTY ((atomic)) optabs; |
3666 | ||
3667 | /* The value of this_target_optabs against which the optabs above were | |
3668 | generated. */ | |
3669 | struct target_optabs *GTY ((skip)) base_optabs; | |
46f8e3b0 | 3670 | }; |
3671 | ||
3672 | #define TREE_OPTIMIZATION(NODE) \ | |
3673 | (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) | |
3674 | ||
08c7d04b | 3675 | #define TREE_OPTIMIZATION_OPTABS(NODE) \ |
9d3fa937 | 3676 | (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs) |
3677 | ||
3678 | #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \ | |
3679 | (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs) | |
08c7d04b | 3680 | |
46f8e3b0 | 3681 | /* Return a tree node that encapsulates the current optimization options. */ |
3682 | extern tree build_optimization_node (void); | |
3683 | ||
9d3fa937 | 3684 | extern void init_tree_optimization_optabs (tree); |
08c7d04b | 3685 | |
46f8e3b0 | 3686 | /* Target options used by a function. */ |
3687 | ||
fb1e4f4a | 3688 | struct GTY(()) tree_target_option { |
46f8e3b0 | 3689 | struct tree_common common; |
3690 | ||
3691 | /* The optimization options used by the user. */ | |
3692 | struct cl_target_option opts; | |
3693 | }; | |
3694 | ||
3695 | #define TREE_TARGET_OPTION(NODE) \ | |
3696 | (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) | |
3697 | ||
3698 | /* Return a tree node that encapsulates the current target options. */ | |
3699 | extern tree build_target_option_node (void); | |
3700 | ||
d72a838e | 3701 | \f |
3702 | /* Define the overall contents of a tree node. | |
3703 | It may be any of the structures declared above | |
3704 | for various types of node. */ | |
3705 | ||
fb1e4f4a | 3706 | union GTY ((ptr_alias (union lang_tree_node), |
ba72912a | 3707 | desc ("tree_node_structure (&%h)"), variable_size)) tree_node { |
35cc02b5 | 3708 | struct tree_base GTY ((tag ("TS_BASE"))) base; |
1646aa85 | 3709 | struct tree_typed GTY ((tag ("TS_TYPED"))) typed; |
1f3233d1 | 3710 | struct tree_common GTY ((tag ("TS_COMMON"))) common; |
3711 | struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; | |
3712 | struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; | |
06f0b99c | 3713 | struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst; |
1f3233d1 | 3714 | struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; |
3715 | struct tree_string GTY ((tag ("TS_STRING"))) string; | |
3716 | struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; | |
3717 | struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; | |
5ded8c6f | 3718 | struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal; |
3719 | struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common; | |
3720 | struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl; | |
3721 | struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common; | |
3722 | struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl; | |
3723 | struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis; | |
3724 | struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl; | |
3725 | struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl; | |
3726 | struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl; | |
3727 | struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl; | |
3728 | struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl; | |
3729 | struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl; | |
3730 | struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl; | |
23bdc9ca | 3731 | struct tree_translation_unit_decl GTY ((tag ("TS_TRANSLATION_UNIT_DECL"))) |
3732 | translation_unit_decl; | |
8f2eb9e1 | 3733 | struct tree_type_common GTY ((tag ("TS_TYPE_COMMON"))) type_common; |
3734 | struct tree_type_with_lang_specific GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC"))) | |
3735 | type_with_lang_specific; | |
3736 | struct tree_type_non_common GTY ((tag ("TS_TYPE_NON_COMMON"))) | |
3737 | type_non_common; | |
1f3233d1 | 3738 | struct tree_list GTY ((tag ("TS_LIST"))) list; |
3739 | struct tree_vec GTY ((tag ("TS_VEC"))) vec; | |
3740 | struct tree_exp GTY ((tag ("TS_EXP"))) exp; | |
4ee9c684 | 3741 | struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; |
1f3233d1 | 3742 | struct tree_block GTY ((tag ("TS_BLOCK"))) block; |
3cb98335 | 3743 | struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; |
4ee9c684 | 3744 | struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; |
c75b4594 | 3745 | struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor; |
55d6e7cd | 3746 | struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause; |
46f8e3b0 | 3747 | struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization; |
3748 | struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option; | |
4ee9c684 | 3749 | }; |
2b15d2ba | 3750 | |
3751 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
3752 | ||
3753 | inline tree | |
3754 | tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c) | |
3755 | { | |
3756 | if (TREE_CODE (__t) != __c) | |
3757 | tree_check_failed (__t, __f, __l, __g, __c, 0); | |
3758 | return __t; | |
3759 | } | |
3760 | ||
3761 | inline tree | |
3762 | tree_not_check (tree __t, const char *__f, int __l, const char *__g, | |
3763 | enum tree_code __c) | |
3764 | { | |
3765 | if (TREE_CODE (__t) == __c) | |
3766 | tree_not_check_failed (__t, __f, __l, __g, __c, 0); | |
3767 | return __t; | |
3768 | } | |
3769 | ||
3770 | inline tree | |
3771 | tree_check2 (tree __t, const char *__f, int __l, const char *__g, | |
3772 | enum tree_code __c1, enum tree_code __c2) | |
3773 | { | |
3774 | if (TREE_CODE (__t) != __c1 | |
3775 | && TREE_CODE (__t) != __c2) | |
3776 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); | |
3777 | return __t; | |
3778 | } | |
3779 | ||
3780 | inline tree | |
3781 | tree_not_check2 (tree __t, const char *__f, int __l, const char *__g, | |
3782 | enum tree_code __c1, enum tree_code __c2) | |
3783 | { | |
3784 | if (TREE_CODE (__t) == __c1 | |
3785 | || TREE_CODE (__t) == __c2) | |
3786 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); | |
3787 | return __t; | |
3788 | } | |
3789 | ||
3790 | inline tree | |
3791 | tree_check3 (tree __t, const char *__f, int __l, const char *__g, | |
3792 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) | |
3793 | { | |
3794 | if (TREE_CODE (__t) != __c1 | |
3795 | && TREE_CODE (__t) != __c2 | |
3796 | && TREE_CODE (__t) != __c3) | |
3797 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); | |
3798 | return __t; | |
3799 | } | |
3800 | ||
3801 | inline tree | |
3802 | tree_not_check3 (tree __t, const char *__f, int __l, const char *__g, | |
3803 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) | |
3804 | { | |
3805 | if (TREE_CODE (__t) == __c1 | |
3806 | || TREE_CODE (__t) == __c2 | |
3807 | || TREE_CODE (__t) == __c3) | |
3808 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); | |
3809 | return __t; | |
3810 | } | |
3811 | ||
3812 | inline tree | |
3813 | tree_check4 (tree __t, const char *__f, int __l, const char *__g, | |
3814 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
3815 | enum tree_code __c4) | |
3816 | { | |
3817 | if (TREE_CODE (__t) != __c1 | |
3818 | && TREE_CODE (__t) != __c2 | |
3819 | && TREE_CODE (__t) != __c3 | |
3820 | && TREE_CODE (__t) != __c4) | |
3821 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); | |
3822 | return __t; | |
3823 | } | |
3824 | ||
3825 | inline tree | |
3826 | tree_not_check4 (tree __t, const char *__f, int __l, const char *__g, | |
3827 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
3828 | enum tree_code __c4) | |
3829 | { | |
3830 | if (TREE_CODE (__t) == __c1 | |
3831 | || TREE_CODE (__t) == __c2 | |
3832 | || TREE_CODE (__t) == __c3 | |
3833 | || TREE_CODE (__t) == __c4) | |
3834 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); | |
3835 | return __t; | |
3836 | } | |
3837 | ||
3838 | inline tree | |
3839 | tree_check5 (tree __t, const char *__f, int __l, const char *__g, | |
3840 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
3841 | enum tree_code __c4, enum tree_code __c5) | |
3842 | { | |
3843 | if (TREE_CODE (__t) != __c1 | |
3844 | && TREE_CODE (__t) != __c2 | |
3845 | && TREE_CODE (__t) != __c3 | |
3846 | && TREE_CODE (__t) != __c4 | |
3847 | && TREE_CODE (__t) != __c5) | |
3848 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); | |
3849 | return __t; | |
3850 | } | |
3851 | ||
3852 | inline tree | |
3853 | tree_not_check5 (tree __t, const char *__f, int __l, const char *__g, | |
3854 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
3855 | enum tree_code __c4, enum tree_code __c5) | |
3856 | { | |
3857 | if (TREE_CODE (__t) == __c1 | |
3858 | || TREE_CODE (__t) == __c2 | |
3859 | || TREE_CODE (__t) == __c3 | |
3860 | || TREE_CODE (__t) == __c4 | |
3861 | || TREE_CODE (__t) == __c5) | |
3862 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); | |
3863 | return __t; | |
3864 | } | |
3865 | ||
3866 | inline tree | |
3867 | contains_struct_check (tree __t, const enum tree_node_structure_enum __s, | |
3868 | const char *__f, int __l, const char *__g) | |
3869 | { | |
3870 | if (tree_contains_struct[TREE_CODE(__t)][__s] != 1) | |
3871 | tree_contains_struct_check_failed (__t, __s, __f, __l, __g); | |
3872 | return __t; | |
3873 | } | |
3874 | ||
3875 | inline tree | |
3876 | tree_class_check (tree __t, const enum tree_code_class __class, | |
3877 | const char *__f, int __l, const char *__g) | |
3878 | { | |
3879 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != __class) | |
3880 | tree_class_check_failed (__t, __class, __f, __l, __g); | |
3881 | return __t; | |
3882 | } | |
3883 | ||
3884 | inline tree | |
3885 | tree_range_check (tree __t, | |
3886 | enum tree_code __code1, enum tree_code __code2, | |
3887 | const char *__f, int __l, const char *__g) | |
3888 | { | |
3889 | if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) | |
3890 | tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); | |
3891 | return __t; | |
3892 | } | |
3893 | ||
3894 | inline tree | |
3895 | omp_clause_subcode_check (tree __t, enum omp_clause_code __code, | |
3896 | const char *__f, int __l, const char *__g) | |
3897 | { | |
3898 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
3899 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
3900 | if (__t->omp_clause.code != __code) | |
3901 | omp_clause_check_failed (__t, __f, __l, __g, __code); | |
3902 | return __t; | |
3903 | } | |
3904 | ||
3905 | inline tree | |
3906 | omp_clause_range_check (tree __t, | |
3907 | enum omp_clause_code __code1, | |
3908 | enum omp_clause_code __code2, | |
3909 | const char *__f, int __l, const char *__g) | |
3910 | { | |
3911 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
3912 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
3913 | if ((int) __t->omp_clause.code < (int) __code1 | |
3914 | || (int) __t->omp_clause.code > (int) __code2) | |
3915 | omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); | |
3916 | return __t; | |
3917 | } | |
3918 | ||
3919 | /* These checks have to be special cased. */ | |
3920 | ||
3921 | inline tree | |
3922 | expr_check (tree __t, const char *__f, int __l, const char *__g) | |
3923 | { | |
3924 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); | |
3925 | if (!IS_EXPR_CODE_CLASS (__c)) | |
3926 | tree_class_check_failed (__t, tcc_expression, __f, __l, __g); | |
3927 | return __t; | |
3928 | } | |
3929 | ||
3930 | /* These checks have to be special cased. */ | |
3931 | ||
3932 | inline tree | |
3933 | non_type_check (tree __t, const char *__f, int __l, const char *__g) | |
3934 | { | |
3935 | if (TYPE_P (__t)) | |
3936 | tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); | |
3937 | return __t; | |
3938 | } | |
3939 | ||
3940 | inline tree * | |
3941 | tree_vec_elt_check (tree __t, int __i, | |
3942 | const char *__f, int __l, const char *__g) | |
3943 | { | |
3944 | if (TREE_CODE (__t) != TREE_VEC) | |
3945 | tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); | |
87d8f7b6 | 3946 | if (__i < 0 || __i >= __t->base.u.length) |
3947 | tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); | |
2b15d2ba | 3948 | return &CONST_CAST_TREE (__t)->vec.a[__i]; |
3949 | } | |
3950 | ||
3951 | inline tree * | |
3952 | omp_clause_elt_check (tree __t, int __i, | |
3953 | const char *__f, int __l, const char *__g) | |
3954 | { | |
3955 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
3956 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
3957 | if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) | |
3958 | omp_clause_operand_check_failed (__i, __t, __f, __l, __g); | |
3959 | return &__t->omp_clause.ops[__i]; | |
3960 | } | |
3961 | ||
3962 | inline const_tree | |
3963 | tree_check (const_tree __t, const char *__f, int __l, const char *__g, | |
3964 | tree_code __c) | |
3965 | { | |
3966 | if (TREE_CODE (__t) != __c) | |
3967 | tree_check_failed (__t, __f, __l, __g, __c, 0); | |
3968 | return __t; | |
3969 | } | |
3970 | ||
3971 | inline const_tree | |
3972 | tree_not_check (const_tree __t, const char *__f, int __l, const char *__g, | |
3973 | enum tree_code __c) | |
3974 | { | |
3975 | if (TREE_CODE (__t) == __c) | |
3976 | tree_not_check_failed (__t, __f, __l, __g, __c, 0); | |
3977 | return __t; | |
3978 | } | |
3979 | ||
3980 | inline const_tree | |
3981 | tree_check2 (const_tree __t, const char *__f, int __l, const char *__g, | |
3982 | enum tree_code __c1, enum tree_code __c2) | |
3983 | { | |
3984 | if (TREE_CODE (__t) != __c1 | |
3985 | && TREE_CODE (__t) != __c2) | |
3986 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); | |
3987 | return __t; | |
3988 | } | |
3989 | ||
3990 | inline const_tree | |
3991 | tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g, | |
3992 | enum tree_code __c1, enum tree_code __c2) | |
3993 | { | |
3994 | if (TREE_CODE (__t) == __c1 | |
3995 | || TREE_CODE (__t) == __c2) | |
3996 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); | |
3997 | return __t; | |
3998 | } | |
3999 | ||
4000 | inline const_tree | |
4001 | tree_check3 (const_tree __t, const char *__f, int __l, const char *__g, | |
4002 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) | |
4003 | { | |
4004 | if (TREE_CODE (__t) != __c1 | |
4005 | && TREE_CODE (__t) != __c2 | |
4006 | && TREE_CODE (__t) != __c3) | |
4007 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); | |
4008 | return __t; | |
4009 | } | |
4010 | ||
4011 | inline const_tree | |
4012 | tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g, | |
4013 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) | |
4014 | { | |
4015 | if (TREE_CODE (__t) == __c1 | |
4016 | || TREE_CODE (__t) == __c2 | |
4017 | || TREE_CODE (__t) == __c3) | |
4018 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); | |
4019 | return __t; | |
4020 | } | |
4021 | ||
4022 | inline const_tree | |
4023 | tree_check4 (const_tree __t, const char *__f, int __l, const char *__g, | |
4024 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
4025 | enum tree_code __c4) | |
4026 | { | |
4027 | if (TREE_CODE (__t) != __c1 | |
4028 | && TREE_CODE (__t) != __c2 | |
4029 | && TREE_CODE (__t) != __c3 | |
4030 | && TREE_CODE (__t) != __c4) | |
4031 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); | |
4032 | return __t; | |
4033 | } | |
4034 | ||
4035 | inline const_tree | |
4036 | tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g, | |
4037 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
4038 | enum tree_code __c4) | |
4039 | { | |
4040 | if (TREE_CODE (__t) == __c1 | |
4041 | || TREE_CODE (__t) == __c2 | |
4042 | || TREE_CODE (__t) == __c3 | |
4043 | || TREE_CODE (__t) == __c4) | |
4044 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); | |
4045 | return __t; | |
4046 | } | |
4047 | ||
4048 | inline const_tree | |
4049 | tree_check5 (const_tree __t, const char *__f, int __l, const char *__g, | |
4050 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
4051 | enum tree_code __c4, enum tree_code __c5) | |
4052 | { | |
4053 | if (TREE_CODE (__t) != __c1 | |
4054 | && TREE_CODE (__t) != __c2 | |
4055 | && TREE_CODE (__t) != __c3 | |
4056 | && TREE_CODE (__t) != __c4 | |
4057 | && TREE_CODE (__t) != __c5) | |
4058 | tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); | |
4059 | return __t; | |
4060 | } | |
4061 | ||
4062 | inline const_tree | |
4063 | tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g, | |
4064 | enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, | |
4065 | enum tree_code __c4, enum tree_code __c5) | |
4066 | { | |
4067 | if (TREE_CODE (__t) == __c1 | |
4068 | || TREE_CODE (__t) == __c2 | |
4069 | || TREE_CODE (__t) == __c3 | |
4070 | || TREE_CODE (__t) == __c4 | |
4071 | || TREE_CODE (__t) == __c5) | |
4072 | tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); | |
4073 | return __t; | |
4074 | } | |
4075 | ||
4076 | inline const_tree | |
4077 | contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s, | |
4078 | const char *__f, int __l, const char *__g) | |
4079 | { | |
4080 | if (tree_contains_struct[TREE_CODE(__t)][__s] != 1) | |
4081 | tree_contains_struct_check_failed (__t, __s, __f, __l, __g); | |
4082 | return __t; | |
4083 | } | |
4084 | ||
4085 | inline const_tree | |
4086 | tree_class_check (const_tree __t, const enum tree_code_class __class, | |
4087 | const char *__f, int __l, const char *__g) | |
4088 | { | |
4089 | if (TREE_CODE_CLASS (TREE_CODE(__t)) != __class) | |
4090 | tree_class_check_failed (__t, __class, __f, __l, __g); | |
4091 | return __t; | |
4092 | } | |
4093 | ||
4094 | inline const_tree | |
4095 | tree_range_check (const_tree __t, | |
4096 | enum tree_code __code1, enum tree_code __code2, | |
4097 | const char *__f, int __l, const char *__g) | |
4098 | { | |
4099 | if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) | |
4100 | tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); | |
4101 | return __t; | |
4102 | } | |
4103 | ||
4104 | inline const_tree | |
4105 | omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code, | |
4106 | const char *__f, int __l, const char *__g) | |
4107 | { | |
4108 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
4109 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
4110 | if (__t->omp_clause.code != __code) | |
4111 | omp_clause_check_failed (__t, __f, __l, __g, __code); | |
4112 | return __t; | |
4113 | } | |
4114 | ||
4115 | inline const_tree | |
4116 | omp_clause_range_check (const_tree __t, | |
4117 | enum omp_clause_code __code1, | |
4118 | enum omp_clause_code __code2, | |
4119 | const char *__f, int __l, const char *__g) | |
4120 | { | |
4121 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
4122 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
4123 | if ((int) __t->omp_clause.code < (int) __code1 | |
4124 | || (int) __t->omp_clause.code > (int) __code2) | |
4125 | omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); | |
4126 | return __t; | |
4127 | } | |
4128 | ||
4129 | inline const_tree | |
4130 | expr_check (const_tree __t, const char *__f, int __l, const char *__g) | |
4131 | { | |
4132 | char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); | |
4133 | if (!IS_EXPR_CODE_CLASS (__c)) | |
4134 | tree_class_check_failed (__t, tcc_expression, __f, __l, __g); | |
4135 | return __t; | |
4136 | } | |
4137 | ||
4138 | inline const_tree | |
4139 | non_type_check (const_tree __t, const char *__f, int __l, const char *__g) | |
4140 | { | |
4141 | if (TYPE_P (__t)) | |
4142 | tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); | |
4143 | return __t; | |
4144 | } | |
4145 | ||
4146 | inline const_tree * | |
4147 | tree_vec_elt_check (const_tree __t, int __i, | |
4148 | const char *__f, int __l, const char *__g) | |
4149 | { | |
4150 | if (TREE_CODE (__t) != TREE_VEC) | |
4151 | tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); | |
87d8f7b6 | 4152 | if (__i < 0 || __i >= __t->base.u.length) |
4153 | tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); | |
2b15d2ba | 4154 | return CONST_CAST (const_tree *, &__t->vec.a[__i]); |
4155 | //return &__t->vec.a[__i]; | |
4156 | } | |
4157 | ||
4158 | inline const_tree * | |
4159 | omp_clause_elt_check (const_tree __t, int __i, | |
4160 | const char *__f, int __l, const char *__g) | |
4161 | { | |
4162 | if (TREE_CODE (__t) != OMP_CLAUSE) | |
4163 | tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); | |
4164 | if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) | |
4165 | omp_clause_operand_check_failed (__i, __t, __f, __l, __g); | |
4166 | return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]); | |
4167 | } | |
4168 | ||
4169 | #endif | |
4170 | ||
4171 | /* Compute the number of operands in an expression node NODE. For | |
4172 | tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, | |
4173 | otherwise it is looked up from the node's code. */ | |
4174 | static inline int | |
4175 | tree_operand_length (const_tree node) | |
4176 | { | |
4177 | if (VL_EXP_CLASS_P (node)) | |
4178 | return VL_EXP_OPERAND_LENGTH (node); | |
4179 | else | |
4180 | return TREE_CODE_LENGTH (TREE_CODE (node)); | |
4181 | } | |
4182 | ||
4183 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
4184 | ||
4185 | /* Special checks for TREE_OPERANDs. */ | |
4186 | inline tree * | |
4187 | tree_operand_check (tree __t, int __i, | |
4188 | const char *__f, int __l, const char *__g) | |
4189 | { | |
4190 | const_tree __u = EXPR_CHECK (__t); | |
4191 | if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) | |
4192 | tree_operand_check_failed (__i, __u, __f, __l, __g); | |
4193 | return &CONST_CAST_TREE (__u)->exp.operands[__i]; | |
4194 | } | |
4195 | ||
4196 | inline tree * | |
4197 | tree_operand_check_code (tree __t, enum tree_code __code, int __i, | |
4198 | const char *__f, int __l, const char *__g) | |
4199 | { | |
4200 | if (TREE_CODE (__t) != __code) | |
4201 | tree_check_failed (__t, __f, __l, __g, __code, 0); | |
4202 | if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) | |
4203 | tree_operand_check_failed (__i, __t, __f, __l, __g); | |
4204 | return &__t->exp.operands[__i]; | |
4205 | } | |
4206 | ||
4207 | inline const_tree * | |
4208 | tree_operand_check (const_tree __t, int __i, | |
4209 | const char *__f, int __l, const char *__g) | |
4210 | { | |
4211 | const_tree __u = EXPR_CHECK (__t); | |
4212 | if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) | |
4213 | tree_operand_check_failed (__i, __u, __f, __l, __g); | |
4214 | return CONST_CAST (const_tree *, &__u->exp.operands[__i]); | |
4215 | } | |
4216 | ||
4217 | inline const_tree * | |
4218 | tree_operand_check_code (const_tree __t, enum tree_code __code, int __i, | |
4219 | const char *__f, int __l, const char *__g) | |
4220 | { | |
4221 | if (TREE_CODE (__t) != __code) | |
4222 | tree_check_failed (__t, __f, __l, __g, __code, 0); | |
4223 | if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) | |
4224 | tree_operand_check_failed (__i, __t, __f, __l, __g); | |
4225 | return CONST_CAST (const_tree *, &__t->exp.operands[__i]); | |
4226 | } | |
4227 | ||
4228 | #endif | |
4229 | ||
5059aa85 | 4230 | \f |
775e7cc0 | 4231 | /* Standard named or nameless data types of the C compiler. */ |
4232 | ||
4233 | enum tree_index | |
4234 | { | |
4235 | TI_ERROR_MARK, | |
4236 | TI_INTQI_TYPE, | |
4237 | TI_INTHI_TYPE, | |
4238 | TI_INTSI_TYPE, | |
4239 | TI_INTDI_TYPE, | |
4240 | TI_INTTI_TYPE, | |
4241 | ||
4242 | TI_UINTQI_TYPE, | |
4243 | TI_UINTHI_TYPE, | |
4244 | TI_UINTSI_TYPE, | |
4245 | TI_UINTDI_TYPE, | |
4246 | TI_UINTTI_TYPE, | |
6c34d0c2 | 4247 | |
74bdbe96 | 4248 | TI_UINT16_TYPE, |
42791117 | 4249 | TI_UINT32_TYPE, |
4250 | TI_UINT64_TYPE, | |
4251 | ||
775e7cc0 | 4252 | TI_INTEGER_ZERO, |
4253 | TI_INTEGER_ONE, | |
2512209b | 4254 | TI_INTEGER_THREE, |
c87787ad | 4255 | TI_INTEGER_MINUS_ONE, |
775e7cc0 | 4256 | TI_NULL_POINTER, |
4257 | ||
4258 | TI_SIZE_ZERO, | |
4259 | TI_SIZE_ONE, | |
02e7a332 | 4260 | |
4261 | TI_BITSIZE_ZERO, | |
4262 | TI_BITSIZE_ONE, | |
4263 | TI_BITSIZE_UNIT, | |
4264 | ||
2c584053 | 4265 | TI_PUBLIC, |
4266 | TI_PROTECTED, | |
4267 | TI_PRIVATE, | |
4268 | ||
3c2239cf | 4269 | TI_BOOLEAN_FALSE, |
4270 | TI_BOOLEAN_TRUE, | |
4271 | ||
775e7cc0 | 4272 | TI_COMPLEX_INTEGER_TYPE, |
4273 | TI_COMPLEX_FLOAT_TYPE, | |
4274 | TI_COMPLEX_DOUBLE_TYPE, | |
4275 | TI_COMPLEX_LONG_DOUBLE_TYPE, | |
4276 | ||
4277 | TI_FLOAT_TYPE, | |
4278 | TI_DOUBLE_TYPE, | |
4279 | TI_LONG_DOUBLE_TYPE, | |
4280 | ||
4070bd43 | 4281 | TI_FLOAT_PTR_TYPE, |
4282 | TI_DOUBLE_PTR_TYPE, | |
4283 | TI_LONG_DOUBLE_PTR_TYPE, | |
4284 | TI_INTEGER_PTR_TYPE, | |
4285 | ||
775e7cc0 | 4286 | TI_VOID_TYPE, |
4287 | TI_PTR_TYPE, | |
4288 | TI_CONST_PTR_TYPE, | |
654ef926 | 4289 | TI_SIZE_TYPE, |
73673831 | 4290 | TI_PID_TYPE, |
775e7cc0 | 4291 | TI_PTRDIFF_TYPE, |
4292 | TI_VA_LIST_TYPE, | |
a6c787e5 | 4293 | TI_VA_LIST_GPR_COUNTER_FIELD, |
4294 | TI_VA_LIST_FPR_COUNTER_FIELD, | |
3c2239cf | 4295 | TI_BOOLEAN_TYPE, |
e256d445 | 4296 | TI_FILEPTR_TYPE, |
775e7cc0 | 4297 | |
c4503c0a | 4298 | TI_DFLOAT32_TYPE, |
4299 | TI_DFLOAT64_TYPE, | |
4300 | TI_DFLOAT128_TYPE, | |
4301 | TI_DFLOAT32_PTR_TYPE, | |
4302 | TI_DFLOAT64_PTR_TYPE, | |
4303 | TI_DFLOAT128_PTR_TYPE, | |
4304 | ||
83f69b41 | 4305 | TI_VOID_LIST_NODE, |
4306 | ||
5c62f199 | 4307 | TI_MAIN_IDENTIFIER, |
4308 | ||
06f0b99c | 4309 | TI_SAT_SFRACT_TYPE, |
4310 | TI_SAT_FRACT_TYPE, | |
4311 | TI_SAT_LFRACT_TYPE, | |
4312 | TI_SAT_LLFRACT_TYPE, | |
4313 | TI_SAT_USFRACT_TYPE, | |
4314 | TI_SAT_UFRACT_TYPE, | |
4315 | TI_SAT_ULFRACT_TYPE, | |
4316 | TI_SAT_ULLFRACT_TYPE, | |
4317 | TI_SFRACT_TYPE, | |
4318 | TI_FRACT_TYPE, | |
4319 | TI_LFRACT_TYPE, | |
4320 | TI_LLFRACT_TYPE, | |
4321 | TI_USFRACT_TYPE, | |
4322 | TI_UFRACT_TYPE, | |
4323 | TI_ULFRACT_TYPE, | |
4324 | TI_ULLFRACT_TYPE, | |
4325 | TI_SAT_SACCUM_TYPE, | |
4326 | TI_SAT_ACCUM_TYPE, | |
4327 | TI_SAT_LACCUM_TYPE, | |
4328 | TI_SAT_LLACCUM_TYPE, | |
4329 | TI_SAT_USACCUM_TYPE, | |
4330 | TI_SAT_UACCUM_TYPE, | |
4331 | TI_SAT_ULACCUM_TYPE, | |
4332 | TI_SAT_ULLACCUM_TYPE, | |
4333 | TI_SACCUM_TYPE, | |
4334 | TI_ACCUM_TYPE, | |
4335 | TI_LACCUM_TYPE, | |
4336 | TI_LLACCUM_TYPE, | |
4337 | TI_USACCUM_TYPE, | |
4338 | TI_UACCUM_TYPE, | |
4339 | TI_ULACCUM_TYPE, | |
4340 | TI_ULLACCUM_TYPE, | |
4341 | TI_QQ_TYPE, | |
4342 | TI_HQ_TYPE, | |
4343 | TI_SQ_TYPE, | |
4344 | TI_DQ_TYPE, | |
4345 | TI_TQ_TYPE, | |
4346 | TI_UQQ_TYPE, | |
4347 | TI_UHQ_TYPE, | |
4348 | TI_USQ_TYPE, | |
4349 | TI_UDQ_TYPE, | |
4350 | TI_UTQ_TYPE, | |
4351 | TI_SAT_QQ_TYPE, | |
4352 | TI_SAT_HQ_TYPE, | |
4353 | TI_SAT_SQ_TYPE, | |
4354 | TI_SAT_DQ_TYPE, | |
4355 | TI_SAT_TQ_TYPE, | |
4356 | TI_SAT_UQQ_TYPE, | |
4357 | TI_SAT_UHQ_TYPE, | |
4358 | TI_SAT_USQ_TYPE, | |
4359 | TI_SAT_UDQ_TYPE, | |
4360 | TI_SAT_UTQ_TYPE, | |
4361 | TI_HA_TYPE, | |
4362 | TI_SA_TYPE, | |
4363 | TI_DA_TYPE, | |
4364 | TI_TA_TYPE, | |
4365 | TI_UHA_TYPE, | |
4366 | TI_USA_TYPE, | |
4367 | TI_UDA_TYPE, | |
4368 | TI_UTA_TYPE, | |
4369 | TI_SAT_HA_TYPE, | |
4370 | TI_SAT_SA_TYPE, | |
4371 | TI_SAT_DA_TYPE, | |
4372 | TI_SAT_TA_TYPE, | |
4373 | TI_SAT_UHA_TYPE, | |
4374 | TI_SAT_USA_TYPE, | |
4375 | TI_SAT_UDA_TYPE, | |
4376 | TI_SAT_UTA_TYPE, | |
4377 | ||
46f8e3b0 | 4378 | TI_OPTIMIZATION_DEFAULT, |
4379 | TI_OPTIMIZATION_CURRENT, | |
46f8e3b0 | 4380 | TI_TARGET_OPTION_DEFAULT, |
4381 | TI_TARGET_OPTION_CURRENT, | |
24470055 | 4382 | TI_CURRENT_TARGET_PRAGMA, |
46f8e3b0 | 4383 | TI_CURRENT_OPTIMIZE_PRAGMA, |
4384 | ||
775e7cc0 | 4385 | TI_MAX |
4386 | }; | |
4387 | ||
1f3233d1 | 4388 | extern GTY(()) tree global_trees[TI_MAX]; |
775e7cc0 | 4389 | |
4390 | #define error_mark_node global_trees[TI_ERROR_MARK] | |
6c34d0c2 | 4391 | |
775e7cc0 | 4392 | #define intQI_type_node global_trees[TI_INTQI_TYPE] |
4393 | #define intHI_type_node global_trees[TI_INTHI_TYPE] | |
4394 | #define intSI_type_node global_trees[TI_INTSI_TYPE] | |
4395 | #define intDI_type_node global_trees[TI_INTDI_TYPE] | |
4396 | #define intTI_type_node global_trees[TI_INTTI_TYPE] | |
4397 | ||
4398 | #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] | |
4399 | #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] | |
4400 | #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] | |
4401 | #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] | |
4402 | #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] | |
4403 | ||
74bdbe96 | 4404 | #define uint16_type_node global_trees[TI_UINT16_TYPE] |
42791117 | 4405 | #define uint32_type_node global_trees[TI_UINT32_TYPE] |
4406 | #define uint64_type_node global_trees[TI_UINT64_TYPE] | |
4407 | ||
775e7cc0 | 4408 | #define integer_zero_node global_trees[TI_INTEGER_ZERO] |
4409 | #define integer_one_node global_trees[TI_INTEGER_ONE] | |
2512209b | 4410 | #define integer_three_node global_trees[TI_INTEGER_THREE] |
c87787ad | 4411 | #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] |
775e7cc0 | 4412 | #define size_zero_node global_trees[TI_SIZE_ZERO] |
4413 | #define size_one_node global_trees[TI_SIZE_ONE] | |
02e7a332 | 4414 | #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] |
4415 | #define bitsize_one_node global_trees[TI_BITSIZE_ONE] | |
4416 | #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] | |
4417 | ||
95f3173a | 4418 | /* Base access nodes. */ |
2c584053 | 4419 | #define access_public_node global_trees[TI_PUBLIC] |
4420 | #define access_protected_node global_trees[TI_PROTECTED] | |
4421 | #define access_private_node global_trees[TI_PRIVATE] | |
95f3173a | 4422 | |
775e7cc0 | 4423 | #define null_pointer_node global_trees[TI_NULL_POINTER] |
4424 | ||
4425 | #define float_type_node global_trees[TI_FLOAT_TYPE] | |
4426 | #define double_type_node global_trees[TI_DOUBLE_TYPE] | |
4427 | #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] | |
4428 | ||
4070bd43 | 4429 | #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] |
4430 | #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] | |
4431 | #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] | |
4432 | #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] | |
4433 | ||
775e7cc0 | 4434 | #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] |
4435 | #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] | |
4436 | #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] | |
4437 | #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] | |
4438 | ||
4439 | #define void_type_node global_trees[TI_VOID_TYPE] | |
39b6af4b | 4440 | /* The C type `void *'. */ |
775e7cc0 | 4441 | #define ptr_type_node global_trees[TI_PTR_TYPE] |
39b6af4b | 4442 | /* The C type `const void *'. */ |
775e7cc0 | 4443 | #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] |
654ef926 | 4444 | /* The C type `size_t'. */ |
4445 | #define size_type_node global_trees[TI_SIZE_TYPE] | |
73673831 | 4446 | #define pid_type_node global_trees[TI_PID_TYPE] |
775e7cc0 | 4447 | #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] |
4448 | #define va_list_type_node global_trees[TI_VA_LIST_TYPE] | |
a6c787e5 | 4449 | #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] |
4450 | #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] | |
e256d445 | 4451 | /* The C type `FILE *'. */ |
4452 | #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] | |
b06898ca | 4453 | |
3c2239cf | 4454 | #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] |
4455 | #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] | |
4456 | #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] | |
4457 | ||
c4503c0a | 4458 | /* The decimal floating point types. */ |
4459 | #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] | |
4460 | #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] | |
4461 | #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] | |
4462 | #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] | |
4463 | #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] | |
4464 | #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] | |
4465 | ||
06f0b99c | 4466 | /* The fixed-point types. */ |
4467 | #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE] | |
4468 | #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE] | |
4469 | #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE] | |
4470 | #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE] | |
4471 | #define sat_unsigned_short_fract_type_node \ | |
4472 | global_trees[TI_SAT_USFRACT_TYPE] | |
4473 | #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE] | |
4474 | #define sat_unsigned_long_fract_type_node \ | |
4475 | global_trees[TI_SAT_ULFRACT_TYPE] | |
4476 | #define sat_unsigned_long_long_fract_type_node \ | |
4477 | global_trees[TI_SAT_ULLFRACT_TYPE] | |
4478 | #define short_fract_type_node global_trees[TI_SFRACT_TYPE] | |
4479 | #define fract_type_node global_trees[TI_FRACT_TYPE] | |
4480 | #define long_fract_type_node global_trees[TI_LFRACT_TYPE] | |
4481 | #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE] | |
4482 | #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE] | |
4483 | #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE] | |
4484 | #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE] | |
4485 | #define unsigned_long_long_fract_type_node \ | |
4486 | global_trees[TI_ULLFRACT_TYPE] | |
4487 | #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE] | |
4488 | #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE] | |
4489 | #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE] | |
4490 | #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE] | |
4491 | #define sat_unsigned_short_accum_type_node \ | |
4492 | global_trees[TI_SAT_USACCUM_TYPE] | |
4493 | #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE] | |
4494 | #define sat_unsigned_long_accum_type_node \ | |
4495 | global_trees[TI_SAT_ULACCUM_TYPE] | |
4496 | #define sat_unsigned_long_long_accum_type_node \ | |
4497 | global_trees[TI_SAT_ULLACCUM_TYPE] | |
4498 | #define short_accum_type_node global_trees[TI_SACCUM_TYPE] | |
4499 | #define accum_type_node global_trees[TI_ACCUM_TYPE] | |
4500 | #define long_accum_type_node global_trees[TI_LACCUM_TYPE] | |
4501 | #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE] | |
4502 | #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE] | |
4503 | #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE] | |
4504 | #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE] | |
4505 | #define unsigned_long_long_accum_type_node \ | |
4506 | global_trees[TI_ULLACCUM_TYPE] | |
4507 | #define qq_type_node global_trees[TI_QQ_TYPE] | |
4508 | #define hq_type_node global_trees[TI_HQ_TYPE] | |
4509 | #define sq_type_node global_trees[TI_SQ_TYPE] | |
4510 | #define dq_type_node global_trees[TI_DQ_TYPE] | |
4511 | #define tq_type_node global_trees[TI_TQ_TYPE] | |
4512 | #define uqq_type_node global_trees[TI_UQQ_TYPE] | |
4513 | #define uhq_type_node global_trees[TI_UHQ_TYPE] | |
4514 | #define usq_type_node global_trees[TI_USQ_TYPE] | |
4515 | #define udq_type_node global_trees[TI_UDQ_TYPE] | |
4516 | #define utq_type_node global_trees[TI_UTQ_TYPE] | |
4517 | #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE] | |
4518 | #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE] | |
4519 | #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE] | |
4520 | #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE] | |
4521 | #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE] | |
4522 | #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE] | |
4523 | #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE] | |
4524 | #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE] | |
4525 | #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE] | |
4526 | #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE] | |
4527 | #define ha_type_node global_trees[TI_HA_TYPE] | |
4528 | #define sa_type_node global_trees[TI_SA_TYPE] | |
4529 | #define da_type_node global_trees[TI_DA_TYPE] | |
4530 | #define ta_type_node global_trees[TI_TA_TYPE] | |
4531 | #define uha_type_node global_trees[TI_UHA_TYPE] | |
4532 | #define usa_type_node global_trees[TI_USA_TYPE] | |
4533 | #define uda_type_node global_trees[TI_UDA_TYPE] | |
4534 | #define uta_type_node global_trees[TI_UTA_TYPE] | |
4535 | #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE] | |
4536 | #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE] | |
4537 | #define sat_da_type_node global_trees[TI_SAT_DA_TYPE] | |
4538 | #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE] | |
4539 | #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE] | |
4540 | #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE] | |
4541 | #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE] | |
4542 | #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE] | |
4543 | ||
83f69b41 | 4544 | /* The node that should be placed at the end of a parameter list to |
4545 | indicate that the function does not take a variable number of | |
4546 | arguments. The TREE_VALUE will be void_type_node and there will be | |
4547 | no TREE_CHAIN. Language-independent code should not assume | |
4548 | anything else about this node. */ | |
4549 | #define void_list_node global_trees[TI_VOID_LIST_NODE] | |
4550 | ||
5c62f199 | 4551 | #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] |
eb65426a | 4552 | #define MAIN_NAME_P(NODE) \ |
4553 | (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) | |
5c62f199 | 4554 | |
24470055 | 4555 | /* Optimization options (OPTIMIZATION_NODE) to use for default and current |
4556 | functions. */ | |
46f8e3b0 | 4557 | #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT] |
4558 | #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT] | |
46f8e3b0 | 4559 | |
4560 | /* Default/current target options (TARGET_OPTION_NODE). */ | |
4561 | #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT] | |
4562 | #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT] | |
4563 | ||
4564 | /* Default tree list option(), optimize() pragmas to be linked into the | |
4565 | attribute list. */ | |
24470055 | 4566 | #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA] |
46f8e3b0 | 4567 | #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA] |
4568 | ||
b06898ca | 4569 | /* An enumeration of the standard C integer types. These must be |
f5ec8cb5 | 4570 | ordered so that shorter types appear before longer ones, and so |
4571 | that signed types appear before unsigned ones, for the correct | |
4572 | functioning of interpret_integer() in c-lex.c. */ | |
6c34d0c2 | 4573 | enum integer_type_kind |
b06898ca | 4574 | { |
4575 | itk_char, | |
4576 | itk_signed_char, | |
4577 | itk_unsigned_char, | |
4578 | itk_short, | |
4579 | itk_unsigned_short, | |
4580 | itk_int, | |
4581 | itk_unsigned_int, | |
4582 | itk_long, | |
4583 | itk_unsigned_long, | |
4584 | itk_long_long, | |
4585 | itk_unsigned_long_long, | |
6388cfe2 | 4586 | itk_int128, |
4587 | itk_unsigned_int128, | |
b06898ca | 4588 | itk_none |
4589 | }; | |
4590 | ||
4591 | typedef enum integer_type_kind integer_type_kind; | |
4592 | ||
4593 | /* The standard C integer types. Use integer_type_kind to index into | |
4594 | this array. */ | |
1f3233d1 | 4595 | extern GTY(()) tree integer_types[itk_none]; |
b06898ca | 4596 | |
4597 | #define char_type_node integer_types[itk_char] | |
4598 | #define signed_char_type_node integer_types[itk_signed_char] | |
4599 | #define unsigned_char_type_node integer_types[itk_unsigned_char] | |
4600 | #define short_integer_type_node integer_types[itk_short] | |
4601 | #define short_unsigned_type_node integer_types[itk_unsigned_short] | |
4602 | #define integer_type_node integer_types[itk_int] | |
4603 | #define unsigned_type_node integer_types[itk_unsigned_int] | |
4604 | #define long_integer_type_node integer_types[itk_long] | |
4605 | #define long_unsigned_type_node integer_types[itk_unsigned_long] | |
4606 | #define long_long_integer_type_node integer_types[itk_long_long] | |
4607 | #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] | |
6388cfe2 | 4608 | #define int128_integer_type_node integer_types[itk_int128] |
4609 | #define int128_unsigned_type_node integer_types[itk_unsigned_int128] | |
775e7cc0 | 4610 | \f |
fc5cb4c0 | 4611 | /* A pointer-to-function member type looks like: |
4612 | ||
4613 | struct { | |
4614 | __P __pfn; | |
4615 | ptrdiff_t __delta; | |
4616 | }; | |
4617 | ||
4618 | If __pfn is NULL, it is a NULL pointer-to-member-function. | |
4619 | ||
4620 | (Because the vtable is always the first thing in the object, we | |
4621 | don't need its offset.) If the function is virtual, then PFN is | |
4622 | one plus twice the index into the vtable; otherwise, it is just a | |
4623 | pointer to the function. | |
4624 | ||
4625 | Unfortunately, using the lowest bit of PFN doesn't work in | |
4626 | architectures that don't impose alignment requirements on function | |
4627 | addresses, or that use the lowest bit to tell one ISA from another, | |
4628 | for example. For such architectures, we use the lowest bit of | |
4629 | DELTA instead of the lowest bit of the PFN, and DELTA will be | |
4630 | multiplied by 2. */ | |
4631 | ||
4632 | enum ptrmemfunc_vbit_where_t | |
4633 | { | |
4634 | ptrmemfunc_vbit_in_pfn, | |
4635 | ptrmemfunc_vbit_in_delta | |
4636 | }; | |
4637 | \f | |
fb084c16 | 4638 | #define NULL_TREE (tree) NULL |
4639 | ||
da579dbb | 4640 | /* True if NODE is an erroneous expression. */ |
4641 | ||
4642 | #define error_operand_p(NODE) \ | |
4643 | ((NODE) == error_mark_node \ | |
4644 | || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node)) | |
4645 | ||
60b8c5b3 | 4646 | extern tree decl_assembler_name (tree); |
28485874 | 4647 | extern bool decl_assembler_name_equal (tree decl, const_tree asmname); |
4648 | extern hashval_t decl_assembler_name_hash (const_tree asmname); | |
d72a838e | 4649 | |
6663ac46 | 4650 | /* Compute the number of bytes occupied by 'node'. This routine only |
4651 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
4652 | ||
720082dc | 4653 | extern size_t tree_size (const_tree); |
6663ac46 | 4654 | |
51d121a0 | 4655 | /* Compute the number of bytes occupied by a tree with code CODE. This |
75a70cf9 | 4656 | function cannot be used for TREE_VEC codes, which are of variable |
4657 | length. */ | |
51d121a0 | 4658 | extern size_t tree_code_size (enum tree_code); |
4659 | ||
e44576dd | 4660 | /* Allocate and return a new UID from the DECL_UID namespace. */ |
4661 | extern int allocate_decl_uid (void); | |
4662 | ||
d72a838e | 4663 | /* Lowest level primitive for allocating a node. |
4664 | The TREE_CODE is the only argument. Contents are initialized | |
4665 | to zero except for a few of the common fields. */ | |
4666 | ||
674b05f5 | 4667 | extern tree make_node_stat (enum tree_code MEM_STAT_DECL); |
4668 | #define make_node(t) make_node_stat (t MEM_STAT_INFO) | |
d72a838e | 4669 | |
ff6d0dd9 | 4670 | /* Make a copy of a node, with all the same contents. */ |
d72a838e | 4671 | |
674b05f5 | 4672 | extern tree copy_node_stat (tree MEM_STAT_DECL); |
4673 | #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) | |
d72a838e | 4674 | |
4675 | /* Make a copy of a chain of TREE_LIST nodes. */ | |
4676 | ||
60b8c5b3 | 4677 | extern tree copy_list (tree); |
d72a838e | 4678 | |
b6e3dd65 | 4679 | /* Make a CASE_LABEL_EXPR. */ |
4680 | ||
4681 | extern tree build_case_label (tree, tree, tree); | |
4682 | ||
3cb98335 | 4683 | /* Make a BINFO. */ |
4684 | extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); | |
4685 | #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) | |
4686 | ||
d72a838e | 4687 | /* Make a TREE_VEC. */ |
4688 | ||
674b05f5 | 4689 | extern tree make_tree_vec_stat (int MEM_STAT_DECL); |
4690 | #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) | |
d72a838e | 4691 | |
4692 | /* Return the (unique) IDENTIFIER_NODE node for a given name. | |
4693 | The name is supplied as a char *. */ | |
4694 | ||
60b8c5b3 | 4695 | extern tree get_identifier (const char *); |
d72a838e | 4696 | |
69642df2 | 4697 | #if GCC_VERSION >= 3000 |
4698 | #define get_identifier(str) \ | |
4699 | (__builtin_constant_p (str) \ | |
4700 | ? get_identifier_with_length ((str), strlen (str)) \ | |
4701 | : get_identifier (str)) | |
4702 | #endif | |
4703 | ||
4704 | ||
82863d5e | 4705 | /* Identical to get_identifier, except that the length is assumed |
4706 | known. */ | |
4707 | ||
69642df2 | 4708 | extern tree get_identifier_with_length (const char *, size_t); |
82863d5e | 4709 | |
06fcb3a0 | 4710 | /* If an identifier with the name TEXT (a null-terminated string) has |
4711 | previously been referred to, return that node; otherwise return | |
4712 | NULL_TREE. */ | |
4713 | ||
60b8c5b3 | 4714 | extern tree maybe_get_identifier (const char *); |
06fcb3a0 | 4715 | |
d72a838e | 4716 | /* Construct various types of nodes. */ |
4717 | ||
60b8c5b3 | 4718 | extern tree build_nt (enum tree_code, ...); |
f1f41a6c | 4719 | extern tree build_nt_call_vec (tree, vec<tree, va_gc> *); |
60b8c5b3 | 4720 | |
674b05f5 | 4721 | extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); |
4722 | #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) | |
4723 | extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); | |
4724 | #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) | |
4725 | extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); | |
4726 | #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) | |
4727 | extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); | |
4728 | #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) | |
4729 | extern tree build4_stat (enum tree_code, tree, tree, tree, tree, | |
4730 | tree MEM_STAT_DECL); | |
4731 | #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
1e8e9920 | 4732 | extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree, |
4733 | tree MEM_STAT_DECL); | |
4734 | #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) | |
413a7abf | 4735 | |
2330f9c5 | 4736 | /* _loc versions of build[1-5]. */ |
2d60d82b | 4737 | |
4738 | static inline tree | |
4739 | build1_stat_loc (location_t loc, enum tree_code code, tree type, | |
4740 | tree arg1 MEM_STAT_DECL) | |
4741 | { | |
4742 | tree t = build1_stat (code, type, arg1 PASS_MEM_STAT); | |
4743 | if (CAN_HAVE_LOCATION_P (t)) | |
4744 | SET_EXPR_LOCATION (t, loc); | |
4745 | return t; | |
4746 | } | |
4747 | #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO) | |
4748 | ||
4749 | static inline tree | |
4750 | build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, | |
4751 | tree arg1 MEM_STAT_DECL) | |
4752 | { | |
4753 | tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT); | |
4754 | if (CAN_HAVE_LOCATION_P (t)) | |
4755 | SET_EXPR_LOCATION (t, loc); | |
4756 | return t; | |
4757 | } | |
4758 | #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO) | |
4759 | ||
4760 | static inline tree | |
4761 | build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, | |
4762 | tree arg1, tree arg2 MEM_STAT_DECL) | |
4763 | { | |
4764 | tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT); | |
4765 | if (CAN_HAVE_LOCATION_P (t)) | |
4766 | SET_EXPR_LOCATION (t, loc); | |
4767 | return t; | |
4768 | } | |
4769 | #define build3_loc(l,c,t1,t2,t3,t4) \ | |
4770 | build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO) | |
4771 | ||
4772 | static inline tree | |
4773 | build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, | |
4774 | tree arg1, tree arg2, tree arg3 MEM_STAT_DECL) | |
4775 | { | |
4776 | tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); | |
4777 | if (CAN_HAVE_LOCATION_P (t)) | |
4778 | SET_EXPR_LOCATION (t, loc); | |
4779 | return t; | |
4780 | } | |
4781 | #define build4_loc(l,c,t1,t2,t3,t4,t5) \ | |
4782 | build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO) | |
4783 | ||
4784 | static inline tree | |
4785 | build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, | |
4786 | tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL) | |
4787 | { | |
4788 | tree t = build5_stat (code, type, arg0, arg1, arg2, arg3, | |
4789 | arg4 PASS_MEM_STAT); | |
4790 | if (CAN_HAVE_LOCATION_P (t)) | |
4791 | SET_EXPR_LOCATION (t, loc); | |
4792 | return t; | |
4793 | } | |
4794 | #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \ | |
4795 | build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) | |
4796 | ||
9845d120 | 4797 | extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL); |
4798 | #define build_var_debug_value(t1,t2) \ | |
4799 | build_var_debug_value_stat (t1,t2 MEM_STAT_INFO) | |
4800 | ||
b79dc18a | 4801 | /* Constructs double_int from tree CST. */ |
4802 | ||
4803 | static inline double_int | |
4804 | tree_to_double_int (const_tree cst) | |
4805 | { | |
4806 | return TREE_INT_CST (cst); | |
4807 | } | |
4808 | ||
4809 | extern tree double_int_to_tree (tree, double_int); | |
4810 | extern bool double_int_fits_to_tree_p (const_tree, double_int); | |
d3237426 | 4811 | extern tree force_fit_type_double (tree, double_int, int, bool); |
b79dc18a | 4812 | |
d3bd87c3 | 4813 | /* Create an INT_CST node with a CST value zero extended. */ |
4814 | ||
4815 | static inline tree | |
4816 | build_int_cstu (tree type, unsigned HOST_WIDE_INT cst) | |
4817 | { | |
cf8f0e63 | 4818 | return double_int_to_tree (type, double_int::from_uhwi (cst)); |
d3bd87c3 | 4819 | } |
4820 | ||
7016c612 | 4821 | extern tree build_int_cst (tree, HOST_WIDE_INT); |
dec41e98 | 4822 | extern tree build_int_cst_type (tree, HOST_WIDE_INT); |
7016c612 | 4823 | extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); |
c7a1d251 | 4824 | extern tree make_vector_stat (unsigned MEM_STAT_DECL); |
4825 | #define make_vector(n) make_vector_stat (n MEM_STAT_INFO) | |
fadf62f4 | 4826 | extern tree build_vector_stat (tree, tree * MEM_STAT_DECL); |
4827 | #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO) | |
f1f41a6c | 4828 | extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *); |
191b2c61 | 4829 | extern tree build_vector_from_val (tree, tree); |
f1f41a6c | 4830 | extern tree build_constructor (tree, vec<constructor_elt, va_gc> *); |
c75b4594 | 4831 | extern tree build_constructor_single (tree, tree, tree); |
4832 | extern tree build_constructor_from_list (tree, tree); | |
4fa680c3 | 4833 | extern tree build_constructor_va (tree, int, ...); |
720082dc | 4834 | extern tree build_real_from_int_cst (tree, const_tree); |
60b8c5b3 | 4835 | extern tree build_complex (tree, tree, tree); |
ba56cb50 | 4836 | extern tree build_one_cst (tree); |
432dd330 | 4837 | extern tree build_minus_one_cst (tree); |
2c83a45e | 4838 | extern tree build_all_ones_cst (tree); |
98d92e3c | 4839 | extern tree build_zero_cst (tree); |
60b8c5b3 | 4840 | extern tree build_string (int, const char *); |
674b05f5 | 4841 | extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); |
4842 | #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) | |
f1f41a6c | 4843 | extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL); |
f352a3fb | 4844 | #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO) |
e60a6f7b | 4845 | extern tree build_decl_stat (location_t, enum tree_code, |
4846 | tree, tree MEM_STAT_DECL); | |
7bd4091f | 4847 | extern tree build_fn_decl (const char *, tree); |
e60a6f7b | 4848 | #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO) |
23bdc9ca | 4849 | extern tree build_translation_unit_decl (tree); |
0a4b7550 | 4850 | extern tree build_block (tree, tree, tree, tree); |
e60a6f7b | 4851 | extern tree build_empty_stmt (location_t); |
4852 | extern tree build_omp_clause (location_t, enum omp_clause_code); | |
3d483a94 | 4853 | extern tree find_omp_clause (tree, enum omp_clause_code); |
d72a838e | 4854 | |
c2f47e15 | 4855 | extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL); |
4856 | #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO) | |
4857 | ||
c2f47e15 | 4858 | extern tree build_call_nary (tree, tree, int, ...); |
4859 | extern tree build_call_valist (tree, tree, int, va_list); | |
389dd41b | 4860 | #define build_call_array(T1,T2,N,T3)\ |
4861 | build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3) | |
4862 | extern tree build_call_array_loc (location_t, tree, tree, int, const tree *); | |
f1f41a6c | 4863 | extern tree build_call_vec (tree, tree, vec<tree, va_gc> *); |
c2f47e15 | 4864 | |
d72a838e | 4865 | /* Construct various nodes representing data types. */ |
4866 | ||
60b8c5b3 | 4867 | extern tree make_signed_type (int); |
4868 | extern tree make_unsigned_type (int); | |
11773141 | 4869 | extern tree signed_or_unsigned_type_for (int, tree); |
dbc64c75 | 4870 | extern tree signed_type_for (tree); |
dec41e98 | 4871 | extern tree unsigned_type_for (tree); |
f2c1848b | 4872 | extern tree truth_type_for (tree); |
ad086ed4 | 4873 | extern void initialize_sizetypes (void); |
60b8c5b3 | 4874 | extern void fixup_unsigned_type (tree); |
b24423db | 4875 | extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 4876 | extern tree build_pointer_type (tree); |
b24423db | 4877 | extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); |
60b8c5b3 | 4878 | extern tree build_reference_type (tree); |
4917c376 | 4879 | extern tree build_vector_type_for_mode (tree, enum machine_mode); |
4880 | extern tree build_vector_type (tree innertype, int nunits); | |
8d125f7d | 4881 | extern tree build_opaque_vector_type (tree innertype, int nunits); |
60b8c5b3 | 4882 | extern tree build_type_no_quals (tree); |
4883 | extern tree build_index_type (tree); | |
60b8c5b3 | 4884 | extern tree build_array_type (tree, tree); |
47c154d9 | 4885 | extern tree build_nonshared_array_type (tree, tree); |
94b7b4dd | 4886 | extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT); |
60b8c5b3 | 4887 | extern tree build_function_type (tree, tree); |
4888 | extern tree build_function_type_list (tree, ...); | |
7a3ec978 | 4889 | extern tree build_function_decl_skip_args (tree, bitmap, bool); |
1c73f824 | 4890 | extern tree build_varargs_function_type_list (tree, ...); |
5edc3af9 | 4891 | extern tree build_function_type_array (tree, int, tree *); |
4892 | extern tree build_varargs_function_type_array (tree, int, tree *); | |
4893 | #define build_function_type_vec(RET, V) \ | |
f1f41a6c | 4894 | build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V)) |
5edc3af9 | 4895 | #define build_varargs_function_type_vec(RET, V) \ |
f1f41a6c | 4896 | build_varargs_function_type_array (RET, vec_safe_length (V), \ |
4897 | vec_safe_address (V)) | |
5bfb0742 | 4898 | extern tree build_method_type_directly (tree, tree, tree); |
60b8c5b3 | 4899 | extern tree build_method_type (tree, tree); |
4900 | extern tree build_offset_type (tree, tree); | |
4901 | extern tree build_complex_type (tree); | |
720082dc | 4902 | extern tree array_type_nelts (const_tree); |
7d23383d | 4903 | extern bool in_array_bounds_p (tree); |
2100c228 | 4904 | extern bool range_in_array_bounds_p (tree); |
60b8c5b3 | 4905 | |
4906 | extern tree value_member (tree, tree); | |
720082dc | 4907 | extern tree purpose_member (const_tree, tree); |
f1f41a6c | 4908 | extern bool vec_member (const_tree, vec<tree, va_gc> *); |
7616de93 | 4909 | extern tree chain_index (int, tree); |
908e5f41 | 4910 | |
5493cb9a | 4911 | extern int attribute_list_equal (const_tree, const_tree); |
4912 | extern int attribute_list_contained (const_tree, const_tree); | |
720082dc | 4913 | extern int tree_int_cst_equal (const_tree, const_tree); |
4914 | extern int tree_int_cst_lt (const_tree, const_tree); | |
4915 | extern int tree_int_cst_compare (const_tree, const_tree); | |
d6635d5c | 4916 | extern int host_integerp (const_tree, int) |
4917 | #ifndef ENABLE_TREE_CHECKING | |
4918 | ATTRIBUTE_PURE /* host_integerp is pure only when checking is disabled. */ | |
4919 | #endif | |
4920 | ; | |
720082dc | 4921 | extern HOST_WIDE_INT tree_low_cst (const_tree, int); |
d6635d5c | 4922 | #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003) |
4923 | extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT | |
4924 | tree_low_cst (const_tree t, int pos) | |
4925 | { | |
4926 | gcc_assert (host_integerp (t, pos)); | |
4927 | return TREE_INT_CST_LOW (t); | |
4928 | } | |
4929 | #endif | |
a6c23958 | 4930 | extern HOST_WIDE_INT size_low_cst (const_tree); |
720082dc | 4931 | extern int tree_int_cst_sgn (const_tree); |
b7bf20db | 4932 | extern int tree_int_cst_sign_bit (const_tree); |
5485b959 | 4933 | extern unsigned int tree_int_cst_min_precision (tree, bool); |
cd29ee4b | 4934 | extern bool tree_expr_nonnegative_p (tree); |
add6ee5e | 4935 | extern bool tree_expr_nonnegative_warnv_p (tree, bool *); |
b7bf20db | 4936 | extern bool may_negate_without_overflow_p (const_tree); |
eec9c06d | 4937 | extern tree strip_array_types (tree); |
c6418a4e | 4938 | extern tree excess_precision_type (tree); |
85d86b55 | 4939 | extern bool valid_constant_size_p (const_tree); |
432dd330 | 4940 | extern unsigned int element_precision (const_tree); |
296a500c | 4941 | |
06f0b99c | 4942 | /* Construct various nodes representing fract or accum data types. */ |
4943 | ||
4944 | extern tree make_fract_type (int, int, int); | |
4945 | extern tree make_accum_type (int, int, int); | |
4946 | ||
4947 | #define make_signed_fract_type(P) make_fract_type (P, 0, 0) | |
4948 | #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0) | |
4949 | #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1) | |
4950 | #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1) | |
4951 | #define make_signed_accum_type(P) make_accum_type (P, 0, 0) | |
4952 | #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0) | |
4953 | #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1) | |
4954 | #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1) | |
4955 | ||
4956 | #define make_or_reuse_signed_fract_type(P) \ | |
4957 | make_or_reuse_fract_type (P, 0, 0) | |
4958 | #define make_or_reuse_unsigned_fract_type(P) \ | |
4959 | make_or_reuse_fract_type (P, 1, 0) | |
4960 | #define make_or_reuse_sat_signed_fract_type(P) \ | |
4961 | make_or_reuse_fract_type (P, 0, 1) | |
4962 | #define make_or_reuse_sat_unsigned_fract_type(P) \ | |
4963 | make_or_reuse_fract_type (P, 1, 1) | |
4964 | #define make_or_reuse_signed_accum_type(P) \ | |
4965 | make_or_reuse_accum_type (P, 0, 0) | |
4966 | #define make_or_reuse_unsigned_accum_type(P) \ | |
4967 | make_or_reuse_accum_type (P, 1, 0) | |
4968 | #define make_or_reuse_sat_signed_accum_type(P) \ | |
4969 | make_or_reuse_accum_type (P, 0, 1) | |
4970 | #define make_or_reuse_sat_unsigned_accum_type(P) \ | |
4971 | make_or_reuse_accum_type (P, 1, 1) | |
4972 | ||
fb084c16 | 4973 | /* From expmed.c. Since rtl.h is included after tree.h, we can't |
4974 | put the prototype here. Rtl.h does declare the prototype if | |
4975 | tree.h had been included. */ | |
4976 | ||
60b8c5b3 | 4977 | extern tree make_tree (tree, rtx); |
d72a838e | 4978 | \f |
a12eeaaf | 4979 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTES |
4980 | is ATTRIBUTE. | |
4981 | ||
4982 | Such modified types already made are recorded so that duplicates | |
88b5b080 | 4983 | are not made. */ |
a12eeaaf | 4984 | |
60b8c5b3 | 4985 | extern tree build_type_attribute_variant (tree, tree); |
4986 | extern tree build_decl_attribute_variant (tree, tree); | |
e1f1071c | 4987 | extern tree build_type_attribute_qual_variant (tree, tree, int); |
a12eeaaf | 4988 | |
309303cf | 4989 | /* Return 0 if the attributes for two types are incompatible, 1 if they |
4990 | are compatible, and 2 if they are nearly compatible (which causes a | |
4991 | warning to be generated). */ | |
4992 | extern int comp_type_attributes (const_tree, const_tree); | |
4993 | ||
e3c541f0 | 4994 | /* Structure describing an attribute and a function to handle it. */ |
4995 | struct attribute_spec | |
4996 | { | |
4997 | /* The name of the attribute (without any leading or trailing __), | |
4998 | or NULL to mark the end of a table of attributes. */ | |
ffcdbf9c | 4999 | const char *name; |
e3c541f0 | 5000 | /* The minimum length of the list of arguments of the attribute. */ |
ffcdbf9c | 5001 | int min_length; |
e3c541f0 | 5002 | /* The maximum length of the list of arguments of the attribute |
5003 | (-1 for no maximum). */ | |
ffcdbf9c | 5004 | int max_length; |
e3c541f0 | 5005 | /* Whether this attribute requires a DECL. If it does, it will be passed |
5006 | from types of DECLs, function return types and array element types to | |
5007 | the DECLs, function types and array types respectively; but when | |
5008 | applied to a type in any other circumstances, it will be ignored with | |
5009 | a warning. (If greater control is desired for a given attribute, | |
5010 | this should be false, and the flags argument to the handler may be | |
5011 | used to gain greater control in that case.) */ | |
ffcdbf9c | 5012 | bool decl_required; |
e3c541f0 | 5013 | /* Whether this attribute requires a type. If it does, it will be passed |
5014 | from a DECL to the type of that DECL. */ | |
ffcdbf9c | 5015 | bool type_required; |
e3c541f0 | 5016 | /* Whether this attribute requires a function (or method) type. If it does, |
5017 | it will be passed from a function pointer type to the target type, | |
5018 | and from a function return type (which is not itself a function | |
5019 | pointer type) to the function type. */ | |
ffcdbf9c | 5020 | bool function_type_required; |
e3c541f0 | 5021 | /* Function to handle this attribute. NODE points to the node to which |
5022 | the attribute is to be applied. If a DECL, it should be modified in | |
5023 | place; if a TYPE, a copy should be created. NAME is the name of the | |
5024 | attribute (possibly with leading or trailing __). ARGS is the TREE_LIST | |
5025 | of the arguments (which may be NULL). FLAGS gives further information | |
5026 | about the context of the attribute. Afterwards, the attributes will | |
5027 | be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, | |
5028 | unless *NO_ADD_ATTRS is set to true (which should be done on error, | |
5029 | as well as in any other cases when the attributes should not be added | |
5030 | to the DECL or TYPE). Depending on FLAGS, any attributes to be | |
5031 | applied to another type or DECL later may be returned; | |
5032 | otherwise the return value should be NULL_TREE. This pointer may be | |
5033 | NULL if no special handling is required beyond the checks implied | |
5034 | by the rest of this structure. */ | |
ffcdbf9c | 5035 | tree (*handler) (tree *node, tree name, tree args, |
5036 | int flags, bool *no_add_attrs); | |
ac86af5d | 5037 | /* Specifies if attribute affects type's identity. */ |
ffcdbf9c | 5038 | bool affects_type_identity; |
e3c541f0 | 5039 | }; |
5040 | ||
e3c541f0 | 5041 | /* Flags that may be passed in the third argument of decl_attributes, and |
5042 | to handler functions for attributes. */ | |
5043 | enum attribute_flags | |
5044 | { | |
5045 | /* The type passed in is the type of a DECL, and any attributes that | |
5046 | should be passed in again to be applied to the DECL rather than the | |
5047 | type should be returned. */ | |
5048 | ATTR_FLAG_DECL_NEXT = 1, | |
5049 | /* The type passed in is a function return type, and any attributes that | |
5050 | should be passed in again to be applied to the function type rather | |
5051 | than the return type should be returned. */ | |
5052 | ATTR_FLAG_FUNCTION_NEXT = 2, | |
5053 | /* The type passed in is an array element type, and any attributes that | |
5054 | should be passed in again to be applied to the array type rather | |
5055 | than the element type should be returned. */ | |
5056 | ATTR_FLAG_ARRAY_NEXT = 4, | |
5057 | /* The type passed in is a structure, union or enumeration type being | |
5058 | created, and should be modified in place. */ | |
7d3b509a | 5059 | ATTR_FLAG_TYPE_IN_PLACE = 8, |
5060 | /* The attributes are being applied by default to a library function whose | |
5061 | name indicates known behavior, and should be silently ignored if they | |
5062 | are not in fact compatible with the function type. */ | |
ffcdbf9c | 5063 | ATTR_FLAG_BUILT_IN = 16, |
5064 | /* A given attribute has been parsed as a C++-11 attribute. */ | |
5065 | ATTR_FLAG_CXX11 = 32 | |
e3c541f0 | 5066 | }; |
5067 | ||
ed5635e4 | 5068 | /* Default versions of target-overridable functions. */ |
5069 | ||
60b8c5b3 | 5070 | extern tree merge_decl_attributes (tree, tree); |
5071 | extern tree merge_type_attributes (tree, tree); | |
0bf60c2b | 5072 | |
c55c785f | 5073 | /* This function is a private implementation detail of lookup_attribute() |
5074 | and you should never call it directly. */ | |
5075 | extern tree private_lookup_attribute (const char *, size_t, tree); | |
5076 | ||
5077 | /* Given an attribute name ATTR_NAME and a list of attributes LIST, | |
5078 | return a pointer to the attribute's list element if the attribute | |
5079 | is part of the list, or NULL_TREE if not found. If the attribute | |
5080 | appears more than once, this only returns the first occurrence; the | |
5081 | TREE_CHAIN of the return value should be passed back in if further | |
5082 | occurrences are wanted. ATTR_NAME must be in the form 'text' (not | |
5083 | '__text__'). */ | |
fe78f852 | 5084 | |
c55c785f | 5085 | static inline tree |
5086 | lookup_attribute (const char *attr_name, tree list) | |
5087 | { | |
5088 | gcc_checking_assert (attr_name[0] != '_'); | |
5089 | /* In most cases, list is NULL_TREE. */ | |
5090 | if (list == NULL_TREE) | |
5091 | return NULL_TREE; | |
5092 | else | |
5093 | /* Do the strlen() before calling the out-of-line implementation. | |
5094 | In most cases attr_name is a string constant, and the compiler | |
5095 | will optimize the strlen() away. */ | |
5096 | return private_lookup_attribute (attr_name, strlen (attr_name), list); | |
5097 | } | |
fe78f852 | 5098 | |
c55c785f | 5099 | /* This function is a private implementation detail of |
5100 | is_attribute_p() and you should never call it directly. */ | |
5101 | extern bool private_is_attribute_p (const char *, size_t, const_tree); | |
fe78f852 | 5102 | |
c55c785f | 5103 | /* Given an identifier node IDENT and a string ATTR_NAME, return true |
5104 | if the identifier node is a valid attribute name for the string. | |
5105 | ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could | |
5106 | be the identifier for 'text' or for '__text__'. */ | |
5107 | ||
5108 | static inline bool | |
5109 | is_attribute_p (const char *attr_name, const_tree ident) | |
5110 | { | |
5111 | gcc_checking_assert (attr_name[0] != '_'); | |
5112 | /* Do the strlen() before calling the out-of-line implementation. | |
5113 | In most cases attr_name is a string constant, and the compiler | |
5114 | will optimize the strlen() away. */ | |
5115 | return private_is_attribute_p (attr_name, strlen (attr_name), ident); | |
5116 | } | |
4ab0a739 | 5117 | |
6a47600c | 5118 | /* Remove any instances of attribute ATTR_NAME in LIST and return the |
c55c785f | 5119 | modified list. ATTR_NAME must be in the form 'text' (not |
5120 | '__text__'). */ | |
6a47600c | 5121 | |
5122 | extern tree remove_attribute (const char *, tree); | |
5123 | ||
4ab0a739 | 5124 | /* Given two attributes lists, return a list of their union. */ |
5125 | ||
60b8c5b3 | 5126 | extern tree merge_attributes (tree, tree); |
fe78f852 | 5127 | |
3aa0c315 | 5128 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
a767736d | 5129 | /* Given two Windows decl attributes lists, possibly including |
5130 | dllimport, return a list of their union . */ | |
60b8c5b3 | 5131 | extern tree merge_dllimport_decl_attributes (tree, tree); |
3aa0c315 | 5132 | |
5133 | /* Handle a "dllimport" or "dllexport" attribute. */ | |
5134 | extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); | |
a767736d | 5135 | #endif |
5136 | ||
e40000f4 | 5137 | /* Check whether CAND is suitable to be returned from get_qualified_type |
5138 | (BASE, TYPE_QUALS). */ | |
5139 | ||
720082dc | 5140 | extern bool check_qualified_type (const_tree, const_tree, int); |
e40000f4 | 5141 | |
051b8c96 | 5142 | /* Return a version of the TYPE, qualified as indicated by the |
5143 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
5144 | return NULL_TREE. */ | |
5145 | ||
60b8c5b3 | 5146 | extern tree get_qualified_type (tree, int); |
051b8c96 | 5147 | |
5148 | /* Like get_qualified_type, but creates the type if it does not | |
5149 | exist. This function never returns NULL_TREE. */ | |
a5b1863e | 5150 | |
60b8c5b3 | 5151 | extern tree build_qualified_type (tree, int); |
a5b1863e | 5152 | |
5d9de213 | 5153 | /* Create a variant of type T with alignment ALIGN. */ |
5154 | ||
5155 | extern tree build_aligned_type (tree, unsigned int); | |
5156 | ||
a5b1863e | 5157 | /* Like build_qualified_type, but only deals with the `const' and |
5158 | `volatile' qualifiers. This interface is retained for backwards | |
de132707 | 5159 | compatibility with the various front-ends; new code should use |
a5b1863e | 5160 | build_qualified_type instead. */ |
d72a838e | 5161 | |
a5b1863e | 5162 | #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ |
76c6f48d | 5163 | build_qualified_type ((TYPE), \ |
a5b1863e | 5164 | ((CONST_P) ? TYPE_QUAL_CONST : 0) \ |
5165 | | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) | |
d72a838e | 5166 | |
11121344 | 5167 | /* Make a copy of a type node. */ |
5168 | ||
e086912e | 5169 | extern tree build_distinct_type_copy (tree); |
5170 | extern tree build_variant_type_copy (tree); | |
11121344 | 5171 | |
805e22b2 | 5172 | /* Finish up a builtin RECORD_TYPE. Give it a name and provide its |
8e7d98a7 | 5173 | fields. Optionally specify an alignment, and then lay it out. */ |
805e22b2 | 5174 | |
60b8c5b3 | 5175 | extern void finish_builtin_struct (tree, const char *, |
5176 | tree, tree); | |
805e22b2 | 5177 | |
d72a838e | 5178 | /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, |
99f4e085 | 5179 | TYPE_ALIGN and TYPE_MODE fields. If called more than once on one |
5180 | node, does nothing except for the first time. */ | |
d72a838e | 5181 | |
60b8c5b3 | 5182 | extern void layout_type (tree); |
d72a838e | 5183 | |
99f4e085 | 5184 | /* These functions allow a front-end to perform a manual layout of a |
5185 | RECORD_TYPE. (For instance, if the placement of subsequent fields | |
5186 | depends on the placement of fields so far.) Begin by calling | |
02e7a332 | 5187 | start_record_layout. Then, call place_field for each of the |
99f4e085 | 5188 | fields. Then, call finish_record_layout. See layout_type for the |
5189 | default way in which these functions are used. */ | |
5190 | ||
ad847b26 | 5191 | typedef struct record_layout_info_s |
99f4e085 | 5192 | { |
5193 | /* The RECORD_TYPE that we are laying out. */ | |
5194 | tree t; | |
02e7a332 | 5195 | /* The offset into the record so far, in bytes, not including bits in |
5196 | BITPOS. */ | |
5197 | tree offset; | |
5198 | /* The last known alignment of SIZE. */ | |
5199 | unsigned int offset_align; | |
5200 | /* The bit position within the last OFFSET_ALIGN bits, in bits. */ | |
5201 | tree bitpos; | |
99f4e085 | 5202 | /* The alignment of the record so far, in bits. */ |
5203 | unsigned int record_align; | |
f5712181 | 5204 | /* The alignment of the record so far, ignoring #pragma pack and |
5205 | __attribute__ ((packed)), in bits. */ | |
02e7a332 | 5206 | unsigned int unpacked_align; |
9d75589a | 5207 | /* The previous field laid out. */ |
f04f096b | 5208 | tree prev_field; |
99f4e085 | 5209 | /* The static variables (i.e., class variables, as opposed to |
5210 | instance variables) encountered in T. */ | |
f1f41a6c | 5211 | vec<tree, va_gc> *pending_statics; |
8642f3d3 | 5212 | /* Bits remaining in the current alignment group */ |
5213 | int remaining_in_alignment; | |
f5712181 | 5214 | /* True if we've seen a packed field that didn't have normal |
5215 | alignment anyway. */ | |
99f4e085 | 5216 | int packed_maybe_necessary; |
02e7a332 | 5217 | } *record_layout_info; |
99f4e085 | 5218 | |
60b8c5b3 | 5219 | extern record_layout_info start_record_layout (tree); |
5220 | extern tree bit_from_pos (tree, tree); | |
5221 | extern tree byte_from_pos (tree, tree); | |
5222 | extern void pos_from_bit (tree *, tree *, unsigned int, tree); | |
5223 | extern void normalize_offset (tree *, tree *, unsigned int); | |
5224 | extern tree rli_size_unit_so_far (record_layout_info); | |
5225 | extern tree rli_size_so_far (record_layout_info); | |
5226 | extern void normalize_rli (record_layout_info); | |
5227 | extern void place_field (record_layout_info, tree); | |
5228 | extern void compute_record_mode (tree); | |
5229 | extern void finish_record_layout (record_layout_info, int); | |
99f4e085 | 5230 | |
d72a838e | 5231 | /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), |
5232 | return a canonicalized ..._TYPE node, so that duplicates are not made. | |
5233 | How the hash code is computed is up to the caller, as long as any two | |
5234 | callers that could hash identical-looking type nodes agree. */ | |
5235 | ||
60b8c5b3 | 5236 | extern tree type_hash_canon (unsigned int, tree); |
d72a838e | 5237 | |
5238 | /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, | |
5239 | calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE | |
5240 | fields. Call this only once for any given decl node. | |
5241 | ||
5242 | Second argument is the boundary that this field can be assumed to | |
5243 | be starting at (in bits). Zero means it can be assumed aligned | |
5244 | on any boundary that may be needed. */ | |
5245 | ||
60b8c5b3 | 5246 | extern void layout_decl (tree, unsigned); |
d72a838e | 5247 | |
dddcebdc | 5248 | /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of |
5249 | a previous call to layout_decl and calls it again. */ | |
5250 | ||
5251 | extern void relayout_decl (tree); | |
5252 | ||
0fc6aef1 | 5253 | /* Return the mode for data of a given size SIZE and mode class CLASS. |
5254 | If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. | |
5255 | The value is BLKmode if no other mode is found. This is like | |
5256 | mode_for_size, but is passed a tree. */ | |
5257 | ||
b7bf20db | 5258 | extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int); |
0fc6aef1 | 5259 | |
d72a838e | 5260 | /* Return an expr equal to X but certainly not valid as an lvalue. */ |
5261 | ||
389dd41b | 5262 | #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T) |
5263 | extern tree non_lvalue_loc (location_t, tree); | |
60b8c5b3 | 5264 | |
5265 | extern tree convert (tree, tree); | |
720082dc | 5266 | extern unsigned int expr_align (const_tree); |
60b8c5b3 | 5267 | extern tree expr_first (tree); |
5268 | extern tree expr_last (tree); | |
f8fd23c0 | 5269 | extern tree size_in_bytes (const_tree); |
720082dc | 5270 | extern HOST_WIDE_INT int_size_in_bytes (const_tree); |
f8fd23c0 | 5271 | extern HOST_WIDE_INT max_int_size_in_bytes (const_tree); |
92ddcd97 | 5272 | extern tree tree_expr_size (const_tree); |
720082dc | 5273 | extern tree bit_position (const_tree); |
5274 | extern HOST_WIDE_INT int_bit_position (const_tree); | |
5275 | extern tree byte_position (const_tree); | |
5276 | extern HOST_WIDE_INT int_byte_position (const_tree); | |
902de8ed | 5277 | |
5278 | /* Define data structures, macros, and functions for handling sizes | |
5279 | and the various types used to represent sizes. */ | |
5280 | ||
5281 | enum size_type_kind | |
5282 | { | |
748e5d45 | 5283 | stk_sizetype, /* Normal representation of sizes in bytes. */ |
5284 | stk_ssizetype, /* Signed representation of sizes in bytes. */ | |
5285 | stk_bitsizetype, /* Normal representation of sizes in bits. */ | |
5286 | stk_sbitsizetype, /* Signed representation of sizes in bits. */ | |
5287 | stk_type_kind_last | |
5288 | }; | |
902de8ed | 5289 | |
748e5d45 | 5290 | extern GTY(()) tree sizetype_tab[(int) stk_type_kind_last]; |
902de8ed | 5291 | |
748e5d45 | 5292 | #define sizetype sizetype_tab[(int) stk_sizetype] |
5293 | #define bitsizetype sizetype_tab[(int) stk_bitsizetype] | |
5294 | #define ssizetype sizetype_tab[(int) stk_ssizetype] | |
5295 | #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype] | |
902de8ed | 5296 | |
85390276 | 5297 | extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); |
389dd41b | 5298 | #define size_binop(CODE,T1,T2)\ |
5299 | size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
5300 | extern tree size_binop_loc (location_t, enum tree_code, tree, tree); | |
5301 | #define size_diffop(T1,T2)\ | |
5302 | size_diffop_loc (UNKNOWN_LOCATION, T1, T2) | |
5303 | extern tree size_diffop_loc (location_t, tree, tree); | |
1e9d55d7 | 5304 | |
748e5d45 | 5305 | #define size_int(L) size_int_kind (L, stk_sizetype) |
5306 | #define ssize_int(L) size_int_kind (L, stk_ssizetype) | |
5307 | #define bitsize_int(L) size_int_kind (L, stk_bitsizetype) | |
5308 | #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype) | |
30384dcf | 5309 | |
389dd41b | 5310 | #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N) |
5311 | extern tree round_up_loc (location_t, tree, int); | |
5312 | #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N) | |
5313 | extern tree round_down_loc (location_t, tree, int); | |
4189e677 | 5314 | extern void finalize_size_functions (void); |
d72a838e | 5315 | |
5316 | /* Type for sizes of data-type. */ | |
5317 | ||
30384dcf | 5318 | #define BITS_PER_UNIT_LOG \ |
5319 | ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ | |
5320 | + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ | |
5321 | + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) | |
5322 | ||
6b5553e5 | 5323 | /* If nonzero, an upper limit on alignment of structure fields, in bits, */ |
fe352cf1 | 5324 | extern unsigned int maximum_field_alignment; |
64233515 | 5325 | |
d72a838e | 5326 | /* Concatenate two lists (chains of TREE_LIST nodes) X and Y |
5327 | by making the last node in X point to Y. | |
5328 | Returns X, except if X is 0 returns Y. */ | |
5329 | ||
60b8c5b3 | 5330 | extern tree chainon (tree, tree); |
d72a838e | 5331 | |
5332 | /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ | |
5333 | ||
674b05f5 | 5334 | extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); |
5335 | #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) | |
d72a838e | 5336 | |
5337 | /* Return the last tree node in a chain. */ | |
5338 | ||
60b8c5b3 | 5339 | extern tree tree_last (tree); |
d72a838e | 5340 | |
5341 | /* Reverse the order of elements in a chain, and return the new head. */ | |
5342 | ||
60b8c5b3 | 5343 | extern tree nreverse (tree); |
d72a838e | 5344 | |
5345 | /* Returns the length of a chain of nodes | |
5346 | (number of chain pointers to follow before reaching a null pointer). */ | |
5347 | ||
720082dc | 5348 | extern int list_length (const_tree); |
d72a838e | 5349 | |
efd3939c | 5350 | /* Returns the number of FIELD_DECLs in a type. */ |
5351 | ||
720082dc | 5352 | extern int fields_length (const_tree); |
efd3939c | 5353 | |
8df5a43d | 5354 | /* Returns the first FIELD_DECL in a type. */ |
5355 | ||
5356 | extern tree first_field (const_tree); | |
5357 | ||
e19896a4 | 5358 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
5359 | aggregate of zeros. Otherwise return FALSE. */ | |
5360 | ||
720082dc | 5361 | extern bool initializer_zerop (const_tree); |
e19896a4 | 5362 | |
67f16f2b | 5363 | /* Given a vector VEC, return its first element if all elements are |
5364 | the same. Otherwise return NULL_TREE. */ | |
5365 | ||
5366 | extern tree uniform_vector_p (const_tree); | |
5367 | ||
f352a3fb | 5368 | /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */ |
5369 | ||
f1f41a6c | 5370 | extern vec<tree, va_gc> *ctor_to_vec (tree); |
f352a3fb | 5371 | |
927b65fb | 5372 | extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, |
5373 | HOST_WIDE_INT *, bool *); | |
20169a64 | 5374 | |
927b65fb | 5375 | extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree); |
957697db | 5376 | |
778ac06a | 5377 | /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ |
d72a838e | 5378 | |
720082dc | 5379 | extern int integer_zerop (const_tree); |
d72a838e | 5380 | |
778ac06a | 5381 | /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ |
d72a838e | 5382 | |
720082dc | 5383 | extern int integer_onep (const_tree); |
d72a838e | 5384 | |
5385 | /* integer_all_onesp (tree x) is nonzero if X is an integer constant | |
5386 | all of whose significant bits are 1. */ | |
5387 | ||
720082dc | 5388 | extern int integer_all_onesp (const_tree); |
d72a838e | 5389 | |
5a4f3016 | 5390 | /* integer_minus_onep (tree x) is nonzero if X is an integer constant of |
5391 | value -1. */ | |
5392 | ||
5393 | extern int integer_minus_onep (const_tree); | |
5394 | ||
d72a838e | 5395 | /* integer_pow2p (tree x) is nonzero is X is an integer constant with |
5396 | exactly one bit 1. */ | |
5397 | ||
720082dc | 5398 | extern int integer_pow2p (const_tree); |
d72a838e | 5399 | |
805e22b2 | 5400 | /* integer_nonzerop (tree x) is nonzero if X is an integer constant |
5401 | with a nonzero value. */ | |
5402 | ||
720082dc | 5403 | extern int integer_nonzerop (const_tree); |
805e22b2 | 5404 | |
720082dc | 5405 | extern bool cst_and_fits_in_hwi (const_tree); |
5406 | extern tree num_ending_zeros (const_tree); | |
dec41e98 | 5407 | |
06f0b99c | 5408 | /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of |
5409 | value 0. */ | |
5410 | ||
4dc2a232 | 5411 | extern int fixed_zerop (const_tree); |
06f0b99c | 5412 | |
82e3f297 | 5413 | /* staticp (tree x) is nonzero if X is a reference to data allocated |
5414 | at a fixed address in memory. Returns the outermost data. */ | |
d72a838e | 5415 | |
82e3f297 | 5416 | extern tree staticp (tree); |
d72a838e | 5417 | |
d72a838e | 5418 | /* save_expr (EXP) returns an expression equivalent to EXP |
5419 | but it can be used multiple times within context CTX | |
5420 | and only evaluate EXP once. */ | |
5421 | ||
60b8c5b3 | 5422 | extern tree save_expr (tree); |
d72a838e | 5423 | |
3303f1bb | 5424 | /* Look inside EXPR into any simple arithmetic operations. Return the |
5425 | outermost non-arithmetic or non-invariant node. */ | |
414bee42 | 5426 | |
60b8c5b3 | 5427 | extern tree skip_simple_arithmetic (tree); |
414bee42 | 5428 | |
3303f1bb | 5429 | /* Look inside EXPR into simple arithmetic operations involving constants. |
5430 | Return the outermost non-arithmetic or non-constant node. */ | |
5431 | ||
5432 | extern tree skip_simple_constant_arithmetic (tree); | |
5433 | ||
1f3233d1 | 5434 | /* Return which tree structure is used by T. */ |
5435 | ||
720082dc | 5436 | enum tree_node_structure_enum tree_node_structure (const_tree); |
1f3233d1 | 5437 | |
91c9bb2d | 5438 | /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a |
5439 | size or offset that depends on a field within a record. */ | |
9f354f8d | 5440 | |
b7bf20db | 5441 | extern bool contains_placeholder_p (const_tree); |
ce3fb06e | 5442 | |
5443 | /* This macro calls the above function but short-circuits the common | |
5444 | case of a constant to save time. Also check for null. */ | |
5445 | ||
5446 | #define CONTAINS_PLACEHOLDER_P(EXP) \ | |
5447 | ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) | |
5448 | ||
91c9bb2d | 5449 | /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR |
5450 | directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and | |
5451 | field positions. */ | |
ce3fb06e | 5452 | |
60b8c5b3 | 5453 | extern bool type_contains_placeholder_p (tree); |
9f354f8d | 5454 | |
9d75589a | 5455 | /* Given a tree EXP, find all occurrences of references to fields |
4189e677 | 5456 | in a PLACEHOLDER_EXPR and place them in vector REFS without |
5457 | duplicates. Also record VAR_DECLs and CONST_DECLs. Note that | |
5458 | we assume here that EXP contains only arithmetic expressions | |
5459 | or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their | |
5460 | argument list. */ | |
5461 | ||
f1f41a6c | 5462 | extern void find_placeholder_in_expr (tree, vec<tree> *); |
4189e677 | 5463 | |
5464 | /* This macro calls the above function but short-circuits the common | |
5465 | case of a constant to save time and also checks for NULL. */ | |
5466 | ||
5467 | #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \ | |
5468 | do { \ | |
5469 | if((EXP) && !TREE_CONSTANT (EXP)) \ | |
5470 | find_placeholder_in_expr (EXP, V); \ | |
5471 | } while (0) | |
5472 | ||
9f354f8d | 5473 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, |
5474 | return a tree with all occurrences of references to F in a | |
4189e677 | 5475 | PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and |
5476 | CONST_DECLs. Note that we assume here that EXP contains only | |
5477 | arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs | |
5478 | occurring only in their argument list. */ | |
9f354f8d | 5479 | |
60b8c5b3 | 5480 | extern tree substitute_in_expr (tree, tree, tree); |
9f354f8d | 5481 | |
55f9d7dc | 5482 | /* This macro calls the above function but short-circuits the common |
5483 | case of a constant to save time and also checks for NULL. */ | |
5484 | ||
5485 | #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ | |
5486 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) | |
5487 | ||
5488 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
5489 | for it within OBJ, a tree that is an object or a chain of references. */ | |
5490 | ||
5491 | extern tree substitute_placeholder_in_expr (tree, tree); | |
5492 | ||
5493 | /* This macro calls the above function but short-circuits the common | |
5494 | case of a constant to save time and also checks for NULL. */ | |
5495 | ||
5496 | #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ | |
5497 | ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ | |
5498 | : substitute_placeholder_in_expr (EXP, OBJ)) | |
5499 | ||
654995a1 | 5500 | /* variable_size (EXP) is like save_expr (EXP) except that it |
5501 | is for the special case of something that is part of a | |
5502 | variable size for a data type. It makes special arrangements | |
5503 | to compute the value at the right time when the data type | |
5504 | belongs to a function parameter. */ | |
5505 | ||
60b8c5b3 | 5506 | extern tree variable_size (tree); |
654995a1 | 5507 | |
845bebef | 5508 | /* stabilize_reference (EXP) returns a reference equivalent to EXP |
d72a838e | 5509 | but it can be used multiple times |
5510 | and only evaluate the subexpressions once. */ | |
5511 | ||
60b8c5b3 | 5512 | extern tree stabilize_reference (tree); |
d72a838e | 5513 | |
1b6e6303 | 5514 | /* Subroutine of stabilize_reference; this is called for subtrees of |
5515 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
5516 | to ensure that it is only evaluated once. */ | |
5517 | ||
60b8c5b3 | 5518 | extern tree stabilize_reference_1 (tree); |
1b6e6303 | 5519 | |
d72a838e | 5520 | /* Return EXP, stripped of any conversions to wider types |
5521 | in such a way that the result of converting to type FOR_TYPE | |
5522 | is the same as if EXP were converted to FOR_TYPE. | |
5523 | If FOR_TYPE is 0, it signifies EXP's type. */ | |
5524 | ||
60b8c5b3 | 5525 | extern tree get_unwidened (tree, tree); |
d72a838e | 5526 | |
5527 | /* Return OP or a simpler expression for a narrower value | |
5528 | which can be sign-extended or zero-extended to give back OP. | |
5529 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
5530 | or 0 if the value should be sign-extended. */ | |
5531 | ||
60b8c5b3 | 5532 | extern tree get_narrower (tree, int *); |
d72a838e | 5533 | |
a306ee43 | 5534 | /* Return true if T is an expression that get_inner_reference handles. */ |
5535 | ||
a174b54d | 5536 | static inline bool |
5537 | handled_component_p (const_tree t) | |
5538 | { | |
5539 | switch (TREE_CODE (t)) | |
5540 | { | |
a174b54d | 5541 | case COMPONENT_REF: |
c165a033 | 5542 | case BIT_FIELD_REF: |
a174b54d | 5543 | case ARRAY_REF: |
5544 | case ARRAY_RANGE_REF: | |
a174b54d | 5545 | case REALPART_EXPR: |
5546 | case IMAGPART_EXPR: | |
c165a033 | 5547 | case VIEW_CONVERT_EXPR: |
a174b54d | 5548 | return true; |
5549 | ||
5550 | default: | |
5551 | return false; | |
5552 | } | |
5553 | } | |
a306ee43 | 5554 | |
5555 | /* Given an expression EXP that is a handled_component_p, | |
5556 | look for the ultimate containing object, which is returned and specify | |
5557 | the access position and size. */ | |
d72a838e | 5558 | |
60b8c5b3 | 5559 | extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, |
ffbcd083 | 5560 | tree *, enum machine_mode *, int *, int *, |
5561 | bool); | |
d72a838e | 5562 | |
6374121b | 5563 | /* Return a tree of sizetype representing the size, in bytes, of the element |
5e19919e | 5564 | of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ |
6374121b | 5565 | |
5566 | extern tree array_ref_element_size (tree); | |
5567 | ||
e01d3bb3 | 5568 | bool array_at_struct_end_p (tree); |
5569 | ||
6374121b | 5570 | /* Return a tree representing the lower bound of the array mentioned in |
5e19919e | 5571 | EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ |
6374121b | 5572 | |
5573 | extern tree array_ref_low_bound (tree); | |
5574 | ||
7d23383d | 5575 | /* Return a tree representing the upper bound of the array mentioned in |
5e19919e | 5576 | EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ |
7d23383d | 5577 | |
5578 | extern tree array_ref_up_bound (tree); | |
5579 | ||
6374121b | 5580 | /* Return a tree representing the offset, in bytes, of the field referenced |
5581 | by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ | |
5582 | ||
5583 | extern tree component_ref_field_offset (tree); | |
5584 | ||
804dff30 | 5585 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
5586 | NUL_TREE if there is no containing scope. */ | |
5587 | ||
720082dc | 5588 | extern tree get_containing_scope (const_tree); |
804dff30 | 5589 | |
d72a838e | 5590 | /* Return the FUNCTION_DECL which provides this _DECL with its context, |
5591 | or zero if none. */ | |
720082dc | 5592 | extern tree decl_function_context (const_tree); |
d72a838e | 5593 | |
7dd9d898 | 5594 | /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides |
5595 | this _DECL with its context, or zero if none. */ | |
720082dc | 5596 | extern tree decl_type_context (const_tree); |
d72a838e | 5597 | |
03f2a1be | 5598 | /* Return 1 if EXPR is the real constant zero. */ |
720082dc | 5599 | extern int real_zerop (const_tree); |
d72a838e | 5600 | \f |
5601 | /* Declare commonly used variables for tree structure. */ | |
5602 | ||
b3034b6d | 5603 | /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. |
5604 | Zero means allow extended lvalues. */ | |
5605 | ||
5606 | extern int pedantic_lvalues; | |
5607 | ||
88b5b080 | 5608 | /* Points to the FUNCTION_DECL of the function whose body we are reading. */ |
d72a838e | 5609 | |
1f3233d1 | 5610 | extern GTY(()) tree current_function_decl; |
d72a838e | 5611 | |
d0309f39 | 5612 | /* Nonzero means a FUNC_BEGIN label was emitted. */ |
2d754264 | 5613 | extern GTY(()) const char * current_function_func_begin_label; |
448e99f5 | 5614 | \f |
5615 | /* Iterator for going through the function arguments. */ | |
5616 | typedef struct { | |
448e99f5 | 5617 | tree next; /* TREE_LIST pointing to the next argument */ |
5618 | } function_args_iterator; | |
5619 | ||
5620 | /* Initialize the iterator I with arguments from function FNDECL */ | |
5621 | ||
5622 | static inline void | |
0591727a | 5623 | function_args_iter_init (function_args_iterator *i, const_tree fntype) |
448e99f5 | 5624 | { |
448e99f5 | 5625 | i->next = TYPE_ARG_TYPES (fntype); |
5626 | } | |
5627 | ||
5628 | /* Return a pointer that holds the next argument if there are more arguments to | |
5629 | handle, otherwise return NULL. */ | |
5630 | ||
5631 | static inline tree * | |
5632 | function_args_iter_cond_ptr (function_args_iterator *i) | |
5633 | { | |
5634 | return (i->next) ? &TREE_VALUE (i->next) : NULL; | |
5635 | } | |
5636 | ||
5637 | /* Return the next argument if there are more arguments to handle, otherwise | |
5638 | return NULL. */ | |
5639 | ||
5640 | static inline tree | |
5641 | function_args_iter_cond (function_args_iterator *i) | |
5642 | { | |
5643 | return (i->next) ? TREE_VALUE (i->next) : NULL_TREE; | |
5644 | } | |
5645 | ||
5646 | /* Advance to the next argument. */ | |
5647 | static inline void | |
5648 | function_args_iter_next (function_args_iterator *i) | |
5649 | { | |
5650 | gcc_assert (i->next != NULL_TREE); | |
5651 | i->next = TREE_CHAIN (i->next); | |
5652 | } | |
5653 | ||
cee43f7e | 5654 | /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */ |
5655 | ||
5656 | static inline bool | |
5657 | inlined_function_outer_scope_p (const_tree block) | |
5658 | { | |
8e7408e3 | 5659 | return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION; |
cee43f7e | 5660 | } |
5661 | ||
448e99f5 | 5662 | /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set |
5663 | to point to the next tree element. ITER is an instance of | |
5664 | function_args_iterator used to iterate the arguments. */ | |
5665 | #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \ | |
5666 | for (function_args_iter_init (&(ITER), (FNTYPE)); \ | |
5667 | (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \ | |
5668 | function_args_iter_next (&(ITER))) | |
5669 | ||
5670 | /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set | |
5671 | to the next tree element. ITER is an instance of function_args_iterator | |
5672 | used to iterate the arguments. */ | |
5673 | #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \ | |
5674 | for (function_args_iter_init (&(ITER), (FNTYPE)); \ | |
5675 | (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \ | |
5676 | function_args_iter_next (&(ITER))) | |
5677 | ||
5678 | ||
d72a838e | 5679 | \f |
bb02c0b3 | 5680 | /* In tree.c */ |
eac18265 | 5681 | extern unsigned crc32_string (unsigned, const char *); |
06306fd3 | 5682 | extern unsigned crc32_byte (unsigned, char); |
267dc7fa | 5683 | extern unsigned crc32_unsigned (unsigned, unsigned); |
60b8c5b3 | 5684 | extern void clean_symbol_name (char *); |
db85cc4f | 5685 | extern tree get_file_function_name (const char *); |
b7bf20db | 5686 | extern tree get_callee_fndecl (const_tree); |
720082dc | 5687 | extern int type_num_arguments (const_tree); |
21dff555 | 5688 | extern bool associative_tree_code (enum tree_code); |
5689 | extern bool commutative_tree_code (enum tree_code); | |
00f4f705 | 5690 | extern bool commutative_ternary_tree_code (enum tree_code); |
faab57e3 | 5691 | extern tree upper_bound_in_type (tree, tree); |
5692 | extern tree lower_bound_in_type (tree, tree); | |
b7bf20db | 5693 | extern int operand_equal_for_phi_arg_p (const_tree, const_tree); |
e60a6f7b | 5694 | extern tree create_artificial_label (location_t); |
75a70cf9 | 5695 | extern const char *get_name (tree); |
0591727a | 5696 | extern bool stdarg_p (const_tree); |
448e99f5 | 5697 | extern bool prototype_p (tree); |
a8891ab1 | 5698 | extern bool is_typedef_decl (tree x); |
5699 | extern bool typedef_variant_p (tree); | |
9f627b1a | 5700 | extern bool auto_var_in_fn_p (const_tree, const_tree); |
15155321 | 5701 | extern tree build_low_bits_mask (tree, unsigned); |
98112881 | 5702 | extern tree tree_strip_nop_conversions (tree); |
5703 | extern tree tree_strip_sign_nop_conversions (tree); | |
4c0315d0 | 5704 | extern const_tree strip_invariant_refs (const_tree); |
58d82cd0 | 5705 | extern tree lhd_gcc_personality (void); |
6816d0c4 | 5706 | extern void assign_assembler_name_if_neeeded (tree); |
0e763b2a | 5707 | extern void warn_deprecated_use (tree, tree); |
8ceff600 | 5708 | extern void cache_integer_cst (tree); |
6816d0c4 | 5709 | |
15155321 | 5710 | \f |
5711 | /* In cgraph.c */ | |
5712 | extern void change_decl_assembler_name (tree, tree); | |
bb02c0b3 | 5713 | \f |
75a70cf9 | 5714 | /* In gimplify.c */ |
5715 | extern tree unshare_expr (tree); | |
827e392b | 5716 | extern tree unshare_expr_without_location (tree); |
75a70cf9 | 5717 | \f |
d72a838e | 5718 | /* In stmt.c */ |
5719 | ||
60b8c5b3 | 5720 | extern void expand_label (tree); |
5721 | extern void expand_goto (tree); | |
60b8c5b3 | 5722 | |
4ee9c684 | 5723 | extern rtx expand_stack_save (void); |
5724 | extern void expand_stack_restore (tree); | |
60b8c5b3 | 5725 | extern void expand_return (tree); |
60b8c5b3 | 5726 | |
873f1e89 | 5727 | /* In tree-eh.c */ |
60b8c5b3 | 5728 | extern void using_eh_for_cleanups (void); |
d72a838e | 5729 | |
23a070f3 | 5730 | extern bool tree_could_trap_p (tree); |
5731 | extern bool operation_could_trap_helper_p (enum tree_code, bool, bool, bool, | |
5732 | bool, tree, bool *); | |
5733 | extern bool operation_could_trap_p (enum tree_code, bool, bool, tree); | |
5734 | extern bool tree_could_throw_p (tree); | |
5735 | ||
4c0315d0 | 5736 | /* Compare and hash for any structure which begins with a canonical |
5737 | pointer. Assumes all pointers are interchangeable, which is sort | |
5738 | of already assumed by gcc elsewhere IIRC. */ | |
5739 | ||
5740 | static inline int | |
5741 | struct_ptr_eq (const void *a, const void *b) | |
5742 | { | |
5743 | const void * const * x = (const void * const *) a; | |
5744 | const void * const * y = (const void * const *) b; | |
5745 | return *x == *y; | |
5746 | } | |
5747 | ||
5748 | static inline hashval_t | |
5749 | struct_ptr_hash (const void *a) | |
5750 | { | |
5751 | const void * const * x = (const void * const *) a; | |
5752 | return (intptr_t)*x >> 4; | |
5753 | } | |
5754 | ||
d72a838e | 5755 | /* In fold-const.c */ |
5756 | ||
47be647d | 5757 | /* Non-zero if we are folding constants inside an initializer; zero |
5758 | otherwise. */ | |
5759 | extern int folding_initializer; | |
5760 | ||
bd56c1f7 | 5761 | /* Convert between trees and native memory representation. */ |
b7bf20db | 5762 | extern int native_encode_expr (const_tree, unsigned char *, int); |
5763 | extern tree native_interpret_expr (tree, const unsigned char *, int); | |
bd56c1f7 | 5764 | |
9239a87e | 5765 | /* Fold constants as much as possible in an expression. |
5766 | Returns the simplified expression. | |
5767 | Acts only on the top level of the expression; | |
5768 | if the argument itself cannot be simplified, its | |
5769 | subexpressions are not changed. */ | |
5770 | ||
60b8c5b3 | 5771 | extern tree fold (tree); |
389dd41b | 5772 | #define fold_unary(CODE,T1,T2)\ |
5773 | fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
5774 | extern tree fold_unary_loc (location_t, enum tree_code, tree, tree); | |
5775 | #define fold_unary_ignore_overflow(CODE,T1,T2)\ | |
5776 | fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
5777 | extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree); | |
5778 | #define fold_binary(CODE,T1,T2,T3)\ | |
5779 | fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3) | |
5780 | extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree); | |
5781 | #define fold_ternary(CODE,T1,T2,T3,T4)\ | |
5782 | fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4) | |
5783 | extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree); | |
5784 | #define fold_build1(c,t1,t2)\ | |
5785 | fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO) | |
5786 | #define fold_build1_loc(l,c,t1,t2)\ | |
5787 | fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO) | |
5788 | extern tree fold_build1_stat_loc (location_t, enum tree_code, tree, | |
5789 | tree MEM_STAT_DECL); | |
5790 | #define fold_build2(c,t1,t2,t3)\ | |
5791 | fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO) | |
5792 | #define fold_build2_loc(l,c,t1,t2,t3)\ | |
5793 | fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO) | |
5794 | extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree, | |
5795 | tree MEM_STAT_DECL); | |
5796 | #define fold_build3(c,t1,t2,t3,t4)\ | |
5797 | fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO) | |
5798 | #define fold_build3_loc(l,c,t1,t2,t3,t4)\ | |
5799 | fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO) | |
5800 | extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree, | |
5801 | tree MEM_STAT_DECL); | |
5802 | extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree); | |
5803 | extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree); | |
5804 | extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree); | |
5805 | #define fold_build_call_array(T1,T2,N,T4)\ | |
5806 | fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4) | |
5807 | extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *); | |
5808 | #define fold_build_call_array_initializer(T1,T2,N,T4)\ | |
5809 | fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4) | |
5810 | extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *); | |
b7bf20db | 5811 | extern bool fold_convertible_p (const_tree, const_tree); |
389dd41b | 5812 | #define fold_convert(T1,T2)\ |
5813 | fold_convert_loc(UNKNOWN_LOCATION, T1, T2) | |
5814 | extern tree fold_convert_loc (location_t, tree, tree); | |
5815 | extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree); | |
db97ad41 | 5816 | extern tree fold_ignored_result (tree); |
d1aade50 | 5817 | extern tree fold_abs_const (tree, tree); |
389dd41b | 5818 | extern tree fold_indirect_ref_1 (location_t, tree, tree); |
add6ee5e | 5819 | extern void fold_defer_overflow_warnings (void); |
75a70cf9 | 5820 | extern void fold_undefer_overflow_warnings (bool, const_gimple, int); |
add6ee5e | 5821 | extern void fold_undefer_and_ignore_overflow_warnings (void); |
5822 | extern bool fold_deferring_overflow_warnings_p (void); | |
b9be572e | 5823 | extern tree fold_fma (location_t, tree, tree, tree, tree); |
60b8c5b3 | 5824 | |
4ee9c684 | 5825 | enum operand_equal_flag |
5826 | { | |
5827 | OEP_ONLY_CONST = 1, | |
34e1297a | 5828 | OEP_PURE_SAME = 2, |
5829 | OEP_CONSTANT_ADDRESS_OF = 4 | |
4ee9c684 | 5830 | }; |
5831 | ||
b7bf20db | 5832 | extern int operand_equal_p (const_tree, const_tree, unsigned int); |
b4b34335 | 5833 | extern int multiple_of_p (tree, const_tree, const_tree); |
389dd41b | 5834 | #define omit_one_operand(T1,T2,T3)\ |
5835 | omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3) | |
5836 | extern tree omit_one_operand_loc (location_t, tree, tree, tree); | |
5837 | #define omit_two_operands(T1,T2,T3,T4)\ | |
5838 | omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4) | |
5839 | extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree); | |
5840 | #define invert_truthvalue(T)\ | |
5841 | invert_truthvalue_loc(UNKNOWN_LOCATION, T) | |
5842 | extern tree invert_truthvalue_loc (location_t, tree); | |
c1677a03 | 5843 | extern tree fold_unary_to_constant (enum tree_code, tree, tree); |
5844 | extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
4ee9c684 | 5845 | extern tree fold_read_from_constant_string (tree); |
317e2a67 | 5846 | extern tree int_const_binop (enum tree_code, const_tree, const_tree); |
389dd41b | 5847 | #define build_fold_addr_expr(T)\ |
5848 | build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T)) | |
5849 | extern tree build_fold_addr_expr_loc (location_t, tree); | |
5850 | #define build_fold_addr_expr_with_type(T,TYPE)\ | |
5851 | build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE) | |
5852 | extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree); | |
198d9bbe | 5853 | extern tree fold_build_cleanup_point_expr (tree type, tree expr); |
5854 | extern tree fold_strip_sign_ops (tree); | |
389dd41b | 5855 | #define build_fold_indirect_ref(T)\ |
5856 | build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T) | |
5857 | extern tree build_fold_indirect_ref_loc (location_t, tree); | |
5858 | #define fold_indirect_ref(T)\ | |
5859 | fold_indirect_ref_loc (UNKNOWN_LOCATION, T) | |
5860 | extern tree fold_indirect_ref_loc (location_t, tree); | |
182cf5a9 | 5861 | extern tree build_simple_mem_ref_loc (location_t, tree); |
5862 | #define build_simple_mem_ref(T)\ | |
5863 | build_simple_mem_ref_loc (UNKNOWN_LOCATION, T) | |
5864 | extern double_int mem_ref_offset (const_tree); | |
9614eeff | 5865 | extern tree reference_alias_ptr_type (const_tree); |
1d0b727d | 5866 | extern tree build_invariant_address (tree, tree, HOST_WIDE_INT); |
3a82f2b4 | 5867 | extern tree constant_boolean_node (bool, tree); |
401d1fb3 | 5868 | extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree); |
e94026da | 5869 | |
b7bf20db | 5870 | extern bool tree_swap_operands_p (const_tree, const_tree, bool); |
cc0bdf91 | 5871 | extern enum tree_code swap_tree_comparison (enum tree_code); |
5872 | ||
dbc64c75 | 5873 | extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); |
eea12c72 | 5874 | extern enum tree_code invert_tree_comparison (enum tree_code, bool); |
dbc64c75 | 5875 | |
de452836 | 5876 | extern bool tree_expr_nonzero_p (tree); |
93116081 | 5877 | extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *); |
5878 | extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1, | |
5879 | bool *); | |
5880 | extern bool tree_single_nonzero_warnv_p (tree, bool *); | |
93116081 | 5881 | extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *); |
5882 | extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree, | |
5883 | bool *); | |
5884 | extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p); | |
5885 | extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p); | |
75a70cf9 | 5886 | extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *); |
18f22ec3 | 5887 | |
add6ee5e | 5888 | extern bool tree_expr_nonzero_warnv_p (tree, bool *); |
de452836 | 5889 | |
46ef5347 | 5890 | extern bool fold_real_zero_addition_p (const_tree, const_tree, int); |
389dd41b | 5891 | extern tree combine_comparisons (location_t, enum tree_code, enum tree_code, |
c82f3b60 | 5892 | enum tree_code, tree, tree, tree); |
15155321 | 5893 | extern void debug_fold_checksum (const_tree); |
46ef5347 | 5894 | |
82012ffe | 5895 | /* Return nonzero if CODE is a tree code that represents a truth value. */ |
5896 | static inline bool | |
5897 | truth_value_p (enum tree_code code) | |
5898 | { | |
5899 | return (TREE_CODE_CLASS (code) == tcc_comparison | |
5900 | || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR | |
5901 | || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR | |
5902 | || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR); | |
5903 | } | |
5904 | ||
a845d317 | 5905 | /* Return whether TYPE is a type suitable for an offset for |
5906 | a POINTER_PLUS_EXPR. */ | |
5907 | static inline bool | |
5908 | ptrofftype_p (tree type) | |
5909 | { | |
5910 | return (INTEGRAL_TYPE_P (type) | |
5911 | && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype) | |
5912 | && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); | |
5913 | } | |
5914 | ||
a0553bff | 5915 | /* Return OFF converted to a pointer offset type suitable as offset for |
5916 | POINTER_PLUS_EXPR. Use location LOC for this conversion. */ | |
5917 | static inline tree | |
5918 | convert_to_ptrofftype_loc (location_t loc, tree off) | |
5919 | { | |
5920 | return fold_convert_loc (loc, sizetype, off); | |
5921 | } | |
5922 | #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t) | |
5923 | ||
2cc66f2a | 5924 | /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ |
5925 | static inline tree | |
5926 | fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off) | |
5927 | { | |
5928 | return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr), | |
5929 | ptr, fold_convert_loc (loc, sizetype, off)); | |
5930 | } | |
5931 | #define fold_build_pointer_plus(p,o) \ | |
5932 | fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o) | |
5933 | ||
5934 | /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ | |
5935 | static inline tree | |
5936 | fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off) | |
5937 | { | |
5938 | return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr), | |
5939 | ptr, size_int (off)); | |
5940 | } | |
5941 | #define fold_build_pointer_plus_hwi(p,o) \ | |
5942 | fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o) | |
82012ffe | 5943 | |
805e22b2 | 5944 | /* In builtins.c */ |
0b049e15 | 5945 | |
5946 | /* Non-zero if __builtin_constant_p should be folded right away. */ | |
5947 | extern bool force_folding_builtin_constant_p; | |
5948 | ||
51d2c51e | 5949 | extern bool avoid_folding_inline_builtin (tree); |
389dd41b | 5950 | extern tree fold_call_expr (location_t, tree, bool); |
5951 | extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree); | |
5952 | extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree); | |
5953 | extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree); | |
5954 | extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool, | |
0a39fd54 | 5955 | enum built_in_function); |
389dd41b | 5956 | extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool, |
0a39fd54 | 5957 | enum built_in_function); |
1063acde | 5958 | extern tree fold_builtin_stxncpy_chk (location_t, tree, tree, tree, tree, tree, bool, |
5959 | enum built_in_function); | |
389dd41b | 5960 | extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function); |
c2f47e15 | 5961 | extern bool fold_builtin_next_arg (tree, bool); |
b7bf20db | 5962 | extern enum built_in_function builtin_mathfn_code (const_tree); |
389dd41b | 5963 | extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *); |
414c3a2c | 5964 | extern tree build_call_expr_loc_array (location_t, tree, int, tree *); |
f1f41a6c | 5965 | extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *); |
389dd41b | 5966 | extern tree build_call_expr_loc (location_t, tree, int, ...); |
0568e9c1 | 5967 | extern tree build_call_expr (tree, int, ...); |
60b8c5b3 | 5968 | extern tree mathfn_built_in (tree, enum built_in_function fn); |
4ee9c684 | 5969 | extern tree c_strlen (tree, int); |
75a70cf9 | 5970 | extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *); |
f2462d6c | 5971 | extern tree build_va_arg_indirect_ref (tree); |
f656b751 | 5972 | extern tree build_string_literal (int, const char *); |
b7bf20db | 5973 | extern bool validate_arglist (const_tree, ...); |
f656b751 | 5974 | extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode); |
7bfefa9d | 5975 | extern bool is_builtin_fn (tree); |
ceea063b | 5976 | extern bool get_object_alignment_1 (tree, unsigned int *, |
5977 | unsigned HOST_WIDE_INT *); | |
957d0361 | 5978 | extern unsigned int get_object_alignment (tree); |
ceea063b | 5979 | extern bool get_pointer_alignment_1 (tree, unsigned int *, |
5980 | unsigned HOST_WIDE_INT *); | |
957d0361 | 5981 | extern unsigned int get_pointer_alignment (tree); |
75a70cf9 | 5982 | extern tree fold_call_stmt (gimple, bool); |
5983 | extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function); | |
9c20c4fc | 5984 | extern tree make_range (tree, int *, tree *, tree *, bool *); |
946e9eb4 | 5985 | extern tree make_range_step (location_t, enum tree_code, tree, tree, tree, |
5986 | tree *, tree *, int *, bool *); | |
389dd41b | 5987 | extern tree build_range_check (location_t, tree, tree, int, tree, tree); |
48e1416a | 5988 | extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int, |
9c20c4fc | 5989 | tree, tree); |
7bfefa9d | 5990 | extern void set_builtin_user_assembler_name (tree decl, const char *asmspec); |
a6b74a67 | 5991 | extern bool is_simple_builtin (tree); |
5992 | extern bool is_inexpensive_builtin (tree); | |
03f2a1be | 5993 | |
8cce4b41 | 5994 | /* In convert.c */ |
60b8c5b3 | 5995 | extern tree strip_float_extensions (tree); |
8cce4b41 | 5996 | |
f52f7b9e | 5997 | /* In tree.c */ |
720082dc | 5998 | extern int really_constant_p (const_tree); |
c7d4e749 | 5999 | extern bool decl_address_invariant_p (const_tree); |
b9c94ed7 | 6000 | extern bool decl_address_ip_invariant_p (const_tree); |
a6caa15f | 6001 | extern bool int_fits_type_p (const_tree, const_tree); |
e506f1d4 | 6002 | #ifndef GENERATOR_FILE |
1f1872fd | 6003 | extern void get_type_static_bounds (const_tree, mpz_t, mpz_t); |
e506f1d4 | 6004 | #endif |
1f8a6ff8 | 6005 | extern bool variably_modified_type_p (tree, tree); |
720082dc | 6006 | extern int tree_log2 (const_tree); |
6007 | extern int tree_floor_log2 (const_tree); | |
b7bf20db | 6008 | extern int simple_cst_equal (const_tree, const_tree); |
720082dc | 6009 | extern hashval_t iterative_hash_expr (const_tree, hashval_t); |
75a70cf9 | 6010 | extern hashval_t iterative_hash_exprs_commutative (const_tree, |
6011 | const_tree, hashval_t); | |
591f01a8 | 6012 | extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); |
f6c33c78 | 6013 | extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t); |
34e5cced | 6014 | extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); |
720082dc | 6015 | extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT); |
b7bf20db | 6016 | extern int type_list_equal (const_tree, const_tree); |
720082dc | 6017 | extern int chain_member (const_tree, const_tree); |
720082dc | 6018 | extern int simple_cst_list_equal (const_tree, const_tree); |
60b8c5b3 | 6019 | extern void dump_tree_statistics (void); |
750ad201 | 6020 | extern void recompute_tree_invariant_for_addr_expr (tree); |
fb80456a | 6021 | extern bool needs_to_live_in_memory (const_tree); |
409a160c | 6022 | extern tree reconstruct_complex_type (tree, tree); |
60b8c5b3 | 6023 | |
720082dc | 6024 | extern int real_onep (const_tree); |
6025 | extern int real_twop (const_tree); | |
6026 | extern int real_minus_onep (const_tree); | |
60b8c5b3 | 6027 | extern void init_ttree (void); |
c38a75b7 | 6028 | extern void build_common_tree_nodes (bool, bool); |
471eff36 | 6029 | extern void build_common_builtin_nodes (void); |
4f7f7efd | 6030 | extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); |
60b8c5b3 | 6031 | extern tree build_range_type (tree, tree, tree); |
47c154d9 | 6032 | extern tree build_nonshared_range_type (tree, tree, tree); |
a9538d68 | 6033 | extern bool subrange_type_for_debug_p (const_tree, tree *, tree *); |
720082dc | 6034 | extern HOST_WIDE_INT int_cst_value (const_tree); |
84cc784c | 6035 | extern HOST_WIDEST_INT widest_int_cst_value (const_tree); |
504d3463 | 6036 | |
5169661d | 6037 | extern tree tree_block (tree); |
6038 | extern void tree_set_block (tree, tree); | |
1b16fc45 | 6039 | extern location_t *block_nonartificial_location (tree); |
b430e8d9 | 6040 | extern location_t tree_nonartificial_location (tree); |
35cc02b5 | 6041 | |
15155321 | 6042 | extern tree block_ultimate_origin (const_tree); |
6043 | ||
6378ffb3 | 6044 | extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree); |
f5e35fed | 6045 | extern bool virtual_method_call_p (tree); |
fba0273a | 6046 | extern tree obj_type_ref_class (tree ref); |
7371d299 | 6047 | extern bool types_same_for_odr (tree type1, tree type2); |
b9ed1410 | 6048 | extern tree get_ref_base_and_extent (tree, HOST_WIDE_INT *, |
6049 | HOST_WIDE_INT *, HOST_WIDE_INT *); | |
fb8b391e | 6050 | extern bool contains_bitfld_component_ref_p (const_tree); |
5514adf9 | 6051 | extern bool type_in_anonymous_namespace_p (tree); |
6378ffb3 | 6052 | |
15155321 | 6053 | /* In tree-nested.c */ |
6054 | extern tree build_addr (tree, tree); | |
6055 | ||
f52f7b9e | 6056 | /* In function.c */ |
60b8c5b3 | 6057 | extern void expand_main_function (void); |
15155321 | 6058 | extern void expand_function_end (void); |
6059 | extern void expand_function_start (tree); | |
6060 | extern void stack_protect_prologue (void); | |
6061 | extern void stack_protect_epilogue (void); | |
60b8c5b3 | 6062 | extern void init_dummy_function_start (void); |
6063 | extern void expand_dummy_function_end (void); | |
80f2ef47 | 6064 | extern void allocate_struct_function (tree, bool); |
87d4aa85 | 6065 | extern void push_struct_function (tree fndecl); |
60b8c5b3 | 6066 | extern void init_function_start (tree); |
b7bf20db | 6067 | extern bool use_register_for_decl (const_tree); |
3072d30e | 6068 | extern void generate_setjmp_warnings (void); |
60b8c5b3 | 6069 | extern void init_temp_slots (void); |
60b8c5b3 | 6070 | extern void free_temp_slots (void); |
6071 | extern void pop_temp_slots (void); | |
6072 | extern void push_temp_slots (void); | |
6073 | extern void preserve_temp_slots (rtx); | |
fb80456a | 6074 | extern int aggregate_value_p (const_tree, const_tree); |
60b8c5b3 | 6075 | extern void push_function_context (void); |
6076 | extern void pop_function_context (void); | |
75a70cf9 | 6077 | extern gimple_seq gimplify_parameters (void); |
f52f7b9e | 6078 | |
6079 | /* In print-rtl.c */ | |
6080 | #ifdef BUFSIZ | |
dd9b9fc5 | 6081 | extern void print_rtl (FILE *, const_rtx); |
f52f7b9e | 6082 | #endif |
6083 | ||
6084 | /* In print-tree.c */ | |
60b8c5b3 | 6085 | extern void debug_tree (tree); |
c7d89805 | 6086 | extern void debug_raw (const tree_node &ref); |
6087 | extern void debug_raw (const tree_node *ptr); | |
6088 | extern void debug (const tree_node &ref); | |
6089 | extern void debug (const tree_node *ptr); | |
6090 | extern void debug_verbose (const tree_node &ref); | |
6091 | extern void debug_verbose (const tree_node *ptr); | |
6092 | extern void debug_head (const tree_node &ref); | |
6093 | extern void debug_head (const tree_node *ptr); | |
6094 | extern void debug_body (const tree_node &ref); | |
6095 | extern void debug_body (const tree_node *ptr); | |
f1f41a6c | 6096 | extern void debug_vec_tree (vec<tree, va_gc> *); |
c7d89805 | 6097 | extern void debug (vec<tree, va_gc> &ref); |
6098 | extern void debug (vec<tree, va_gc> *ptr); | |
84fcb947 | 6099 | extern void debug_raw (vec<tree, va_gc> &ref); |
6100 | extern void debug_raw (vec<tree, va_gc> *ptr); | |
f52f7b9e | 6101 | #ifdef BUFSIZ |
5d1b319b | 6102 | extern void dump_addr (FILE*, const char *, const void *); |
60b8c5b3 | 6103 | extern void print_node (FILE *, const char *, tree, int); |
f1f41a6c | 6104 | extern void print_vec_tree (FILE *, const char *, vec<tree, va_gc> *, int); |
5d1b319b | 6105 | extern void print_node_brief (FILE *, const char *, const_tree, int); |
60b8c5b3 | 6106 | extern void indent_to (FILE *, int); |
f52f7b9e | 6107 | #endif |
6108 | ||
d9671935 | 6109 | /* In tree-inline.c: */ |
6110 | extern bool debug_find_tree (tree, tree); | |
ac13e8d9 | 6111 | /* This is in tree-inline.c since the routine uses |
6112 | data structures from the inliner. */ | |
03908818 | 6113 | extern tree build_duplicate_type (tree); |
d9671935 | 6114 | |
302bf7ba | 6115 | /* In calls.c */ |
dfe08167 | 6116 | |
4fec1d6c | 6117 | /* Nonzero if this is a call to a function whose return value depends |
6118 | solely on its arguments, has no side effects, and does not read | |
9c2a0c05 | 6119 | global memory. This corresponds to TREE_READONLY for function |
6120 | decls. */ | |
6121 | #define ECF_CONST (1 << 0) | |
6122 | /* Nonzero if this is a call to "pure" function (like const function, | |
6123 | but may read memory. This corresponds to DECL_PURE_P for function | |
6124 | decls. */ | |
6125 | #define ECF_PURE (1 << 1) | |
6126 | /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no | |
6127 | infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P | |
6128 | for function decls.*/ | |
6129 | #define ECF_LOOPING_CONST_OR_PURE (1 << 2) | |
4fec1d6c | 6130 | /* Nonzero if this call will never return. */ |
9c2a0c05 | 6131 | #define ECF_NORETURN (1 << 3) |
79c31609 | 6132 | /* Nonzero if this is a call to malloc or a related function. */ |
9c2a0c05 | 6133 | #define ECF_MALLOC (1 << 4) |
79c31609 | 6134 | /* Nonzero if it is plausible that this is a call to alloca. */ |
9c2a0c05 | 6135 | #define ECF_MAY_BE_ALLOCA (1 << 5) |
79c31609 | 6136 | /* Nonzero if this is a call to a function that won't throw an exception. */ |
9c2a0c05 | 6137 | #define ECF_NOTHROW (1 << 6) |
79c31609 | 6138 | /* Nonzero if this is a call to setjmp or a related function. */ |
9c2a0c05 | 6139 | #define ECF_RETURNS_TWICE (1 << 7) |
4fec1d6c | 6140 | /* Nonzero if this call replaces the current stack frame. */ |
9c2a0c05 | 6141 | #define ECF_SIBCALL (1 << 8) |
fc09b200 | 6142 | /* Function does not read or write memory (but may have side effects, so |
6143 | it does not necessarily fit ECF_CONST). */ | |
2dd6f9ed | 6144 | #define ECF_NOVOPS (1 << 9) |
7bd95dfd | 6145 | /* The function does not lead to calls within current function unit. */ |
6146 | #define ECF_LEAF (1 << 10) | |
4c0315d0 | 6147 | /* Nonzero if this call does not affect transactions. */ |
6148 | #define ECF_TM_PURE (1 << 11) | |
6149 | /* Nonzero if this call is into the transaction runtime library. */ | |
6150 | #define ECF_TM_BUILTIN (1 << 12) | |
79c31609 | 6151 | |
5d1b319b | 6152 | extern int flags_from_decl_or_type (const_tree); |
b7bf20db | 6153 | extern int call_expr_flags (const_tree); |
9954b2fd | 6154 | extern void set_call_expr_flags (tree, int); |
79c31609 | 6155 | |
8ce86007 | 6156 | /* Call argument flags. */ |
6157 | ||
6158 | /* Nonzero if the argument is not dereferenced recursively, thus only | |
6159 | directly reachable memory is read or written. */ | |
6160 | #define EAF_DIRECT (1 << 0) | |
6161 | /* Nonzero if memory reached by the argument is not clobbered. */ | |
6162 | #define EAF_NOCLOBBER (1 << 1) | |
6163 | /* Nonzero if the argument does not escape. */ | |
6164 | #define EAF_NOESCAPE (1 << 2) | |
6165 | /* Nonzero if the argument is not used by the function. */ | |
6166 | #define EAF_UNUSED (1 << 3) | |
6167 | ||
6168 | /* Call return flags. */ | |
6169 | ||
6170 | /* Mask for the argument number that is returned. Lower two bits of | |
6171 | the return flags, encodes argument slots zero to three. */ | |
6172 | #define ERF_RETURN_ARG_MASK (3) | |
6173 | /* Nonzero if the return value is equal to the argument number | |
6174 | flags & ERF_RETURN_ARG_MASK. */ | |
6175 | #define ERF_RETURNS_ARG (1 << 2) | |
6176 | /* Nonzero if the return value does not alias with anything. Functions | |
6177 | with the malloc attribute have this set on their return value. */ | |
6178 | #define ERF_NOALIAS (1 << 3) | |
6179 | ||
5d1b319b | 6180 | extern int setjmp_call_p (const_tree); |
75a70cf9 | 6181 | extern bool gimple_alloca_call_p (const_gimple); |
5d1b319b | 6182 | extern bool alloca_call_p (const_tree); |
fb80456a | 6183 | extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree); |
6184 | extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree); | |
302bf7ba | 6185 | |
e3f6ce11 | 6186 | /* In attribs.c. */ |
434712c4 | 6187 | |
9bf1c74e | 6188 | extern const struct attribute_spec *lookup_attribute_spec (const_tree); |
ffcdbf9c | 6189 | extern const struct attribute_spec *lookup_scoped_attribute_spec (const_tree, |
6190 | const_tree); | |
2fdd6488 | 6191 | |
b7831f3e | 6192 | extern void init_attributes (void); |
6193 | ||
434712c4 | 6194 | /* Process the attributes listed in ATTRIBUTES and install them in *NODE, |
6195 | which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, | |
6196 | it should be modified in place; if a TYPE, a copy should be created | |
6197 | unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further | |
6198 | information, in the form of a bitwise OR of flags in enum attribute_flags | |
6199 | from tree.h. Depending on these flags, some attributes may be | |
6200 | returned to be applied at a later stage (for example, to apply | |
6201 | a decl attribute to the declaration rather than to its type). */ | |
aecda0d6 | 6202 | extern tree decl_attributes (tree *, tree, int); |
e3f6ce11 | 6203 | |
ffcdbf9c | 6204 | extern bool cxx11_attribute_p (const_tree); |
6205 | ||
6206 | extern tree get_attribute_name (const_tree); | |
6207 | ||
6208 | extern tree get_attribute_namespace (const_tree); | |
6209 | ||
4c0315d0 | 6210 | extern void apply_tm_attr (tree, tree); |
6211 | ||
f52f7b9e | 6212 | /* In stor-layout.c */ |
ee1ab431 | 6213 | extern void set_min_and_max_values_for_integral_type (tree, int, bool); |
60b8c5b3 | 6214 | extern void fixup_signed_type (tree); |
6215 | extern void internal_reference_types (void); | |
4ee9c684 | 6216 | extern unsigned int update_alignment_for_field (record_layout_info, tree, |
6217 | unsigned int); | |
f52f7b9e | 6218 | /* varasm.c */ |
ecba073f | 6219 | extern tree tree_output_constant_def (tree); |
b2c4af5e | 6220 | extern void make_decl_rtl (tree); |
e6db644e | 6221 | extern rtx make_decl_rtl_for_debug (tree); |
ecd88073 | 6222 | extern void make_decl_one_only (tree, tree); |
60b8c5b3 | 6223 | extern int supports_one_only (void); |
60b8c5b3 | 6224 | extern void resolve_unique_section (tree, int, int); |
6225 | extern void mark_referenced (tree); | |
4490a821 | 6226 | extern void mark_decl_referenced (tree); |
3cad5dd7 | 6227 | extern void notice_global_symbol (tree); |
b2c4af5e | 6228 | extern void set_user_assembler_name (tree, const char *); |
e9f08e82 | 6229 | extern void process_pending_assemble_externals (void); |
9ced88d0 | 6230 | extern bool decl_replaceable_p (tree); |
6231 | extern bool decl_binds_to_current_def_p (tree); | |
b5369b7d | 6232 | extern enum tls_model decl_default_tls_model (const_tree); |
6233 | ||
dff12c10 | 6234 | /* Declare DECL to be a weak symbol. */ |
6235 | extern void declare_weak (tree); | |
6236 | /* Merge weak status. */ | |
6237 | extern void merge_weak (tree, tree); | |
6238 | /* Make one symbol an alias for another. */ | |
6239 | extern void assemble_alias (tree, tree); | |
6240 | ||
6241 | /* Return nonzero if VALUE is a valid constant-valued expression | |
6242 | for use in initializing a static variable; one that can be an | |
6243 | element of a "constant" initializer. | |
6244 | ||
6245 | Return null_pointer_node if the value is absolute; | |
6246 | if it is relocatable, return the variable that determines the relocation. | |
6247 | We assume that VALUE has been folded as much as possible; | |
6248 | therefore, we do not need to check for such things as | |
6249 | arithmetic-combinations of integers. */ | |
6250 | extern tree initializer_constant_valid_p (tree, tree); | |
6251 | ||
6252 | /* Return true if VALUE is a valid constant-valued expression | |
6253 | for use in initializing a static bit-field; one that can be | |
6254 | an element of a "constant" initializer. */ | |
6255 | extern bool initializer_constant_valid_for_bitfield_p (tree); | |
6256 | ||
21eb4639 | 6257 | /* Whether a constructor CTOR is a valid static constant initializer if all |
6258 | its elements are. This used to be internal to initializer_constant_valid_p | |
6259 | and has been exposed to let other functions like categorize_ctor_elements | |
6260 | evaluate the property while walking a constructor for other purposes. */ | |
6261 | ||
6262 | extern bool constructor_static_from_elts_p (const_tree); | |
6263 | ||
f52f7b9e | 6264 | /* In stmt.c */ |
60b8c5b3 | 6265 | extern void expand_computed_goto (tree); |
6266 | extern bool parse_output_constraint (const char **, int, int, int, | |
6267 | bool *, bool *, bool *); | |
d7e38994 | 6268 | extern bool parse_input_constraint (const char **, int, int, int, int, |
6269 | const char * const *, bool *, bool *); | |
16c9337c | 6270 | extern void expand_asm_stmt (gimple); |
78f55ca8 | 6271 | extern tree resolve_asm_operand_names (tree, tree, tree, tree); |
64d5fb6a | 6272 | #ifdef HARD_CONST |
6273 | /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */ | |
2389b26b | 6274 | extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *); |
64d5fb6a | 6275 | #endif |
4ee9c684 | 6276 | |
a50b6670 | 6277 | \f |
dddcebdc | 6278 | /* In tree-inline.c */ |
6279 | ||
c6224531 | 6280 | /* The type of a set of already-visited pointers. Functions for creating |
6281 | and manipulating it are declared in pointer-set.h */ | |
6282 | struct pointer_set_t; | |
6283 | ||
4ee9c684 | 6284 | /* The type of a callback function for walking over tree structure. */ |
1431bff6 | 6285 | |
60b8c5b3 | 6286 | typedef tree (*walk_tree_fn) (tree *, int *, void *); |
20a8f962 | 6287 | |
6288 | /* The type of a callback function that represents a custom walk_tree. */ | |
6289 | ||
6290 | typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *), | |
6291 | void *, struct pointer_set_t*); | |
6292 | ||
6293 | extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*, | |
6294 | walk_tree_lh); | |
6295 | extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*, | |
6296 | walk_tree_lh); | |
6297 | #define walk_tree(a,b,c,d) \ | |
6298 | walk_tree_1 (a, b, c, d, NULL) | |
6299 | #define walk_tree_without_duplicates(a,b,c) \ | |
6300 | walk_tree_without_duplicates_1 (a, b, c, NULL) | |
1431bff6 | 6301 | |
15155321 | 6302 | /* In emit-rtl.c */ |
ca74b940 | 6303 | /* Assign the RTX to declaration. */ |
6304 | ||
60b8c5b3 | 6305 | extern void set_decl_rtl (tree, rtx); |
d91cf567 | 6306 | extern void set_decl_incoming_rtl (tree, rtx, bool); |
bdcbc557 | 6307 | \f |
491e04ef | 6308 | /* Enum and arrays used for tree allocation stats. |
b4b174c3 | 6309 | Keep in sync with tree.c:tree_node_kind_names. */ |
b7257530 | 6310 | typedef enum |
6311 | { | |
6312 | d_kind, | |
6313 | t_kind, | |
6314 | b_kind, | |
6315 | s_kind, | |
6316 | r_kind, | |
6317 | e_kind, | |
6318 | c_kind, | |
6319 | id_kind, | |
b7257530 | 6320 | vec_kind, |
3cb98335 | 6321 | binfo_kind, |
4ee9c684 | 6322 | ssa_name_kind, |
c75b4594 | 6323 | constr_kind, |
b7257530 | 6324 | x_kind, |
6325 | lang_decl, | |
6326 | lang_type, | |
55d6e7cd | 6327 | omp_clause_kind, |
b7257530 | 6328 | all_kinds |
6329 | } tree_node_kind; | |
6330 | ||
6331 | extern int tree_node_counts[]; | |
6332 | extern int tree_node_sizes[]; | |
4ee9c684 | 6333 | |
6334 | /* True if we are in gimple form and the actions of the folders need to | |
6335 | be restricted. False if we are not in gimple form and folding is not | |
6336 | restricted to creating gimple expressions. */ | |
6337 | extern bool in_gimple_form; | |
491e04ef | 6338 | |
15155321 | 6339 | /* In gimple.c. */ |
b04fab2a | 6340 | extern tree get_base_address (tree t); |
f639fdbf | 6341 | extern void mark_addressable (tree); |
b04fab2a | 6342 | |
bfd211a3 | 6343 | /* In tree.c. */ |
9af7fd5b | 6344 | |
fb1e4f4a | 6345 | struct GTY(()) tree_map_base { |
9af7fd5b | 6346 | tree from; |
6347 | }; | |
6348 | ||
6349 | extern int tree_map_base_eq (const void *, const void *); | |
6350 | extern unsigned int tree_map_base_hash (const void *); | |
6351 | extern int tree_map_base_marked_p (const void *); | |
927a6b6b | 6352 | extern bool list_equal_p (const_tree, const_tree); |
9af7fd5b | 6353 | |
6354 | /* Map from a tree to another tree. */ | |
6355 | ||
fb1e4f4a | 6356 | struct GTY(()) tree_map { |
9af7fd5b | 6357 | struct tree_map_base base; |
5ded8c6f | 6358 | unsigned int hash; |
5ded8c6f | 6359 | tree to; |
6360 | }; | |
6361 | ||
9af7fd5b | 6362 | #define tree_map_eq tree_map_base_eq |
5ded8c6f | 6363 | extern unsigned int tree_map_hash (const void *); |
9af7fd5b | 6364 | #define tree_map_marked_p tree_map_base_marked_p |
6365 | ||
cc194b6e | 6366 | /* Map from a decl tree to another tree. */ |
6367 | ||
6368 | struct GTY(()) tree_decl_map { | |
6369 | struct tree_map_base base; | |
6370 | tree to; | |
6371 | }; | |
6372 | ||
6373 | #define tree_decl_map_eq tree_map_base_eq | |
6374 | extern unsigned int tree_decl_map_hash (const void *); | |
6375 | #define tree_decl_map_marked_p tree_map_base_marked_p | |
6376 | ||
9af7fd5b | 6377 | /* Map from a tree to an int. */ |
5ded8c6f | 6378 | |
fb1e4f4a | 6379 | struct GTY(()) tree_int_map { |
9af7fd5b | 6380 | struct tree_map_base base; |
bfd211a3 | 6381 | unsigned int to; |
6382 | }; | |
6383 | ||
9af7fd5b | 6384 | #define tree_int_map_eq tree_map_base_eq |
6385 | #define tree_int_map_hash tree_map_base_hash | |
6386 | #define tree_int_map_marked_p tree_map_base_marked_p | |
6387 | ||
6388 | /* Map from a tree to initialization/finalization priorities. */ | |
6389 | ||
fb1e4f4a | 6390 | struct GTY(()) tree_priority_map { |
9af7fd5b | 6391 | struct tree_map_base base; |
6392 | priority_type init; | |
6393 | priority_type fini; | |
6394 | }; | |
6395 | ||
6396 | #define tree_priority_map_eq tree_map_base_eq | |
6397 | #define tree_priority_map_hash tree_map_base_hash | |
6398 | #define tree_priority_map_marked_p tree_map_base_marked_p | |
bfd211a3 | 6399 | |
841424cc | 6400 | /* Map from a decl tree to a tree vector. */ |
6401 | ||
6402 | struct GTY(()) tree_vec_map { | |
6403 | struct tree_map_base base; | |
f1f41a6c | 6404 | vec<tree, va_gc> *to; |
841424cc | 6405 | }; |
6406 | ||
6407 | #define tree_vec_map_eq tree_map_base_eq | |
6408 | #define tree_vec_map_hash tree_decl_map_hash | |
6409 | #define tree_vec_map_marked_p tree_map_base_marked_p | |
6410 | ||
9845d120 | 6411 | /* In tree-ssa.c */ |
6412 | ||
6413 | tree target_for_debug_bind (tree); | |
6414 | ||
aed164c3 | 6415 | /* In tree-ssa-address.c. */ |
6416 | extern tree tree_mem_ref_addr (tree, tree); | |
74fcb726 | 6417 | extern void copy_ref_info (tree, tree); |
aed164c3 | 6418 | |
8dbf774a | 6419 | /* In tree-vrp.c */ |
9f627b1a | 6420 | extern bool ssa_name_nonnegative_p (const_tree); |
8dbf774a | 6421 | |
0a39fd54 | 6422 | /* In tree-object-size.c. */ |
6423 | extern void init_object_sizes (void); | |
6424 | extern void fini_object_sizes (void); | |
6425 | extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int); | |
6426 | ||
516849c7 | 6427 | /* In expr.c. */ |
88c5a1d1 | 6428 | |
6429 | /* Determine whether the LEN bytes can be moved by using several move | |
6430 | instructions. Return nonzero if a call to move_by_pieces should | |
6431 | succeed. */ | |
6432 | extern int can_move_by_pieces (unsigned HOST_WIDE_INT, unsigned int); | |
6433 | ||
6d1013f7 | 6434 | /* Is it an ADDR_EXPR of a DECL that's not in memory? */ |
6435 | extern bool addr_expr_of_non_mem_decl_p (tree); | |
6436 | ||
b7bf20db | 6437 | extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree); |
58d82cd0 | 6438 | extern tree build_personality_function (const char *); |
516849c7 | 6439 | |
4c0315d0 | 6440 | /* In trans-mem.c. */ |
6441 | extern tree build_tm_abort_call (location_t, bool); | |
6442 | extern bool is_tm_safe (const_tree); | |
6443 | extern bool is_tm_pure (const_tree); | |
6444 | extern bool is_tm_may_cancel_outer (tree); | |
6445 | extern bool is_tm_ending_fndecl (tree); | |
6446 | extern void record_tm_replacement (tree, tree); | |
6447 | extern void tm_malloc_replacement (tree); | |
6448 | ||
6449 | static inline bool | |
6450 | is_tm_safe_or_pure (const_tree x) | |
6451 | { | |
6452 | return is_tm_safe (x) || is_tm_pure (x); | |
6453 | } | |
6454 | ||
bc8bb825 | 6455 | /* In tree-inline.c. */ |
6456 | ||
6457 | void init_inline_once (void); | |
6458 | ||
c2f47e15 | 6459 | /* Abstract iterators for CALL_EXPRs. These static inline definitions |
6460 | have to go towards the end of tree.h so that union tree_node is fully | |
6461 | defined by this point. */ | |
6462 | ||
6463 | /* Structure containing iterator state. */ | |
a641ee36 | 6464 | typedef struct call_expr_arg_iterator_d { |
c2f47e15 | 6465 | tree t; /* the call_expr */ |
6466 | int n; /* argument count */ | |
6467 | int i; /* next argument index */ | |
6468 | } call_expr_arg_iterator; | |
6469 | ||
a641ee36 | 6470 | typedef struct const_call_expr_arg_iterator_d { |
b7bf20db | 6471 | const_tree t; /* the call_expr */ |
6472 | int n; /* argument count */ | |
6473 | int i; /* next argument index */ | |
6474 | } const_call_expr_arg_iterator; | |
6475 | ||
c2f47e15 | 6476 | /* Initialize the abstract argument list iterator object ITER with the |
6477 | arguments from CALL_EXPR node EXP. */ | |
6478 | static inline void | |
6479 | init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter) | |
6480 | { | |
6481 | iter->t = exp; | |
6482 | iter->n = call_expr_nargs (exp); | |
6483 | iter->i = 0; | |
6484 | } | |
6485 | ||
b7bf20db | 6486 | static inline void |
6487 | init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter) | |
6488 | { | |
6489 | iter->t = exp; | |
6490 | iter->n = call_expr_nargs (exp); | |
6491 | iter->i = 0; | |
6492 | } | |
6493 | ||
c2f47e15 | 6494 | /* Return the next argument from abstract argument list iterator object ITER, |
6495 | and advance its state. Return NULL_TREE if there are no more arguments. */ | |
6496 | static inline tree | |
6497 | next_call_expr_arg (call_expr_arg_iterator *iter) | |
6498 | { | |
6499 | tree result; | |
6500 | if (iter->i >= iter->n) | |
6501 | return NULL_TREE; | |
6502 | result = CALL_EXPR_ARG (iter->t, iter->i); | |
6503 | iter->i++; | |
6504 | return result; | |
6505 | } | |
6506 | ||
b7bf20db | 6507 | static inline const_tree |
6508 | next_const_call_expr_arg (const_call_expr_arg_iterator *iter) | |
6509 | { | |
6510 | const_tree result; | |
6511 | if (iter->i >= iter->n) | |
6512 | return NULL_TREE; | |
6513 | result = CALL_EXPR_ARG (iter->t, iter->i); | |
6514 | iter->i++; | |
6515 | return result; | |
6516 | } | |
6517 | ||
c2f47e15 | 6518 | /* Initialize the abstract argument list iterator object ITER, then advance |
6519 | past and return the first argument. Useful in for expressions, e.g. | |
6520 | for (arg = first_call_expr_arg (exp, &iter); arg; | |
6521 | arg = next_call_expr_arg (&iter)) */ | |
6522 | static inline tree | |
6523 | first_call_expr_arg (tree exp, call_expr_arg_iterator *iter) | |
6524 | { | |
6525 | init_call_expr_arg_iterator (exp, iter); | |
6526 | return next_call_expr_arg (iter); | |
6527 | } | |
6528 | ||
b7bf20db | 6529 | static inline const_tree |
6530 | first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter) | |
6531 | { | |
6532 | init_const_call_expr_arg_iterator (exp, iter); | |
6533 | return next_const_call_expr_arg (iter); | |
6534 | } | |
6535 | ||
c2f47e15 | 6536 | /* Test whether there are more arguments in abstract argument list iterator |
6537 | ITER, without changing its state. */ | |
6538 | static inline bool | |
6539 | more_call_expr_args_p (const call_expr_arg_iterator *iter) | |
6540 | { | |
6541 | return (iter->i < iter->n); | |
6542 | } | |
6543 | ||
b7bf20db | 6544 | static inline bool |
6545 | more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter) | |
6546 | { | |
6547 | return (iter->i < iter->n); | |
6548 | } | |
c2f47e15 | 6549 | |
6550 | /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER | |
6551 | (of type call_expr_arg_iterator) to hold the iteration state. */ | |
6552 | #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \ | |
6553 | for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \ | |
6554 | (arg) = next_call_expr_arg (&(iter))) | |
6555 | ||
b7bf20db | 6556 | #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \ |
6557 | for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \ | |
6558 | (arg) = next_const_call_expr_arg (&(iter))) | |
6559 | ||
7bfefa9d | 6560 | /* Return true if tree node T is a language-specific node. */ |
6561 | static inline bool | |
6562 | is_lang_specific (tree t) | |
6563 | { | |
6564 | return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES; | |
6565 | } | |
6566 | ||
9b40bfbf | 6567 | /* In gimple-low.c. */ |
6568 | extern bool block_may_fallthru (const_tree); | |
6569 | ||
b710ec85 | 6570 | /* In vtable-verify.c. */ |
6571 | extern void save_vtable_map_decl (tree); | |
6572 | ||
b9a16870 | 6573 | \f |
6574 | /* Functional interface to the builtin functions. */ | |
6575 | ||
6576 | /* The builtin_info structure holds the FUNCTION_DECL of the standard builtin | |
6577 | function, and a flag that says if the function is available implicitly, or | |
6578 | whether the user has to code explicit calls to __builtin_<xxx>. */ | |
6579 | ||
6580 | typedef struct GTY(()) builtin_info_type_d { | |
6581 | tree decl[(int)END_BUILTINS]; | |
6582 | bool implicit_p[(int)END_BUILTINS]; | |
6583 | } builtin_info_type; | |
6584 | ||
6585 | extern GTY(()) builtin_info_type builtin_info; | |
6586 | ||
6587 | /* Valid builtin number. */ | |
6588 | #define BUILTIN_VALID_P(FNCODE) \ | |
6589 | (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1)) | |
6590 | ||
6591 | /* Return the tree node for an explicit standard builtin function or NULL. */ | |
6592 | static inline tree | |
6593 | builtin_decl_explicit (enum built_in_function fncode) | |
6594 | { | |
6595 | gcc_checking_assert (BUILTIN_VALID_P (fncode)); | |
6596 | ||
6597 | return builtin_info.decl[(size_t)fncode]; | |
6598 | } | |
6599 | ||
6600 | /* Return the tree node for an implicit builtin function or NULL. */ | |
6601 | static inline tree | |
6602 | builtin_decl_implicit (enum built_in_function fncode) | |
6603 | { | |
6604 | size_t uns_fncode = (size_t)fncode; | |
6605 | gcc_checking_assert (BUILTIN_VALID_P (fncode)); | |
6606 | ||
6607 | if (!builtin_info.implicit_p[uns_fncode]) | |
6608 | return NULL_TREE; | |
6609 | ||
6610 | return builtin_info.decl[uns_fncode]; | |
6611 | } | |
6612 | ||
6613 | /* Set explicit builtin function nodes and whether it is an implicit | |
6614 | function. */ | |
6615 | ||
6616 | static inline void | |
6617 | set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p) | |
6618 | { | |
6619 | size_t ufncode = (size_t)fncode; | |
6620 | ||
6621 | gcc_checking_assert (BUILTIN_VALID_P (fncode) | |
6622 | && (decl != NULL_TREE || !implicit_p)); | |
6623 | ||
6624 | builtin_info.decl[ufncode] = decl; | |
6625 | builtin_info.implicit_p[ufncode] = implicit_p; | |
6626 | } | |
6627 | ||
6628 | /* Set the implicit flag for a builtin function. */ | |
6629 | ||
6630 | static inline void | |
6631 | set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p) | |
6632 | { | |
6633 | size_t uns_fncode = (size_t)fncode; | |
6634 | ||
6635 | gcc_checking_assert (BUILTIN_VALID_P (fncode) | |
6636 | && builtin_info.decl[uns_fncode] != NULL_TREE); | |
6637 | ||
6638 | builtin_info.implicit_p[uns_fncode] = implicit_p; | |
6639 | } | |
6640 | ||
6641 | /* Return whether the standard builtin function can be used as an explicit | |
6642 | function. */ | |
6643 | ||
6644 | static inline bool | |
6645 | builtin_decl_explicit_p (enum built_in_function fncode) | |
6646 | { | |
6647 | gcc_checking_assert (BUILTIN_VALID_P (fncode)); | |
6648 | return (builtin_info.decl[(size_t)fncode] != NULL_TREE); | |
6649 | } | |
6650 | ||
6651 | /* Return whether the standard builtin function can be used implicitly. */ | |
6652 | ||
6653 | static inline bool | |
6654 | builtin_decl_implicit_p (enum built_in_function fncode) | |
6655 | { | |
6656 | size_t uns_fncode = (size_t)fncode; | |
6657 | ||
6658 | gcc_checking_assert (BUILTIN_VALID_P (fncode)); | |
6659 | return (builtin_info.decl[uns_fncode] != NULL_TREE | |
6660 | && builtin_info.implicit_p[uns_fncode]); | |
6661 | } | |
6662 | ||
8ceff600 | 6663 | /* For anonymous aggregate types, we need some sort of name to |
6664 | hold on to. In practice, this should not appear, but it should | |
6665 | not be harmful if it does. */ | |
6666 | #ifndef NO_DOT_IN_LABEL | |
6667 | #define ANON_AGGRNAME_FORMAT "._%d" | |
6668 | #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \ | |
6669 | && IDENTIFIER_POINTER (ID_NODE)[1] == '_') | |
6670 | #else /* NO_DOT_IN_LABEL */ | |
6671 | #ifndef NO_DOLLAR_IN_LABEL | |
6672 | #define ANON_AGGRNAME_FORMAT "$_%d" | |
6673 | #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \ | |
6674 | && IDENTIFIER_POINTER (ID_NODE)[1] == '_') | |
6675 | #else /* NO_DOLLAR_IN_LABEL */ | |
6676 | #define ANON_AGGRNAME_PREFIX "__anon_" | |
6677 | #define ANON_AGGRNAME_P(ID_NODE) \ | |
6678 | (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \ | |
6679 | sizeof (ANON_AGGRNAME_PREFIX) - 1)) | |
6680 | #define ANON_AGGRNAME_FORMAT "__anon_%d" | |
6681 | #endif /* NO_DOLLAR_IN_LABEL */ | |
6682 | #endif /* NO_DOT_IN_LABEL */ | |
6683 | ||
6684 | ||
b229f760 | 6685 | #endif /* GCC_TREE_H */ |