1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2021 Free Software Foundation, Inc.
3
4 This file is part of GCC.
5
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
8 Software Foundation; either version 3, or (at your option) any later
9 version.
10
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.
15
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
19
20 #ifndef GCC_TREE_H
21 #define GCC_TREE_H
22
23 #include "tree-core.h"
24
25 /* Convert a target-independent built-in function code to a combined_fn. */
26
27 inline combined_fn
as_combined_fn(built_in_function fn)28 as_combined_fn (built_in_function fn)
29 {
30 return combined_fn (int (fn));
31 }
32
33 /* Convert an internal function code to a combined_fn. */
34
35 inline combined_fn
as_combined_fn(internal_fn fn)36 as_combined_fn (internal_fn fn)
37 {
38 return combined_fn (int (fn) + int (END_BUILTINS));
39 }
40
41 /* Return true if CODE is a target-independent built-in function. */
42
43 inline bool
builtin_fn_p(combined_fn code)44 builtin_fn_p (combined_fn code)
45 {
46 return int (code) < int (END_BUILTINS);
47 }
48
49 /* Return the target-independent built-in function represented by CODE.
50 Only valid if builtin_fn_p (CODE). */
51
52 inline built_in_function
as_builtin_fn(combined_fn code)53 as_builtin_fn (combined_fn code)
54 {
55 gcc_checking_assert (builtin_fn_p (code));
56 return built_in_function (int (code));
57 }
58
59 /* Return true if CODE is an internal function. */
60
61 inline bool
internal_fn_p(combined_fn code)62 internal_fn_p (combined_fn code)
63 {
64 return int (code) >= int (END_BUILTINS);
65 }
66
67 /* Return the internal function represented by CODE. Only valid if
68 internal_fn_p (CODE). */
69
70 inline internal_fn
as_internal_fn(combined_fn code)71 as_internal_fn (combined_fn code)
72 {
73 gcc_checking_assert (internal_fn_p (code));
74 return internal_fn (int (code) - int (END_BUILTINS));
75 }
76
77 /* Macros for initializing `tree_contains_struct'. */
78 #define MARK_TS_BASE(C) \
79 (tree_contains_struct[C][TS_BASE] = true)
80
81 #define MARK_TS_TYPED(C) \
82 (MARK_TS_BASE (C), \
83 tree_contains_struct[C][TS_TYPED] = true)
84
85 #define MARK_TS_COMMON(C) \
86 (MARK_TS_TYPED (C), \
87 tree_contains_struct[C][TS_COMMON] = true)
88
89 #define MARK_TS_TYPE_COMMON(C) \
90 (MARK_TS_COMMON (C), \
91 tree_contains_struct[C][TS_TYPE_COMMON] = true)
92
93 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
94 (MARK_TS_TYPE_COMMON (C), \
95 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
96
97 #define MARK_TS_TYPE_NON_COMMON(C) \
98 (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \
99 tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \
100
101 #define MARK_TS_DECL_MINIMAL(C) \
102 (MARK_TS_COMMON (C), \
103 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
104
105 #define MARK_TS_DECL_COMMON(C) \
106 (MARK_TS_DECL_MINIMAL (C), \
107 tree_contains_struct[C][TS_DECL_COMMON] = true)
108
109 #define MARK_TS_DECL_WRTL(C) \
110 (MARK_TS_DECL_COMMON (C), \
111 tree_contains_struct[C][TS_DECL_WRTL] = true)
112
113 #define MARK_TS_DECL_WITH_VIS(C) \
114 (MARK_TS_DECL_WRTL (C), \
115 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
116
117 #define MARK_TS_DECL_NON_COMMON(C) \
118 (MARK_TS_DECL_WITH_VIS (C), \
119 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
120
121 #define MARK_TS_EXP(C) \
122 (MARK_TS_TYPED (C), \
123 tree_contains_struct[C][TS_EXP] = true)
124
125 /* Returns the string representing CLASS. */
126
127 #define TREE_CODE_CLASS_STRING(CLASS)\
128 tree_code_class_strings[(int) (CLASS)]
129
130 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
131
132 /* Nonzero if NODE represents an exceptional code. */
133
134 #define EXCEPTIONAL_CLASS_P(NODE)\
135 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
136
137 /* Nonzero if NODE represents a constant. */
138
139 #define CONSTANT_CLASS_P(NODE)\
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
141
142 /* Nonzero if NODE represents a constant, or is a location wrapper
143 around such a node. */
144
145 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
146 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
147
148 /* Nonzero if NODE represents a type. */
149
150 #define TYPE_P(NODE)\
151 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
152
153 /* Nonzero if NODE represents a declaration. */
154
155 #define DECL_P(NODE)\
156 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
157
158 /* True if NODE designates a variable declaration. */
159 #define VAR_P(NODE) \
160 (TREE_CODE (NODE) == VAR_DECL)
161
162 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
163
164 #define VAR_OR_FUNCTION_DECL_P(DECL)\
165 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
166
167 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
168 ascending code order. */
169
170 #define INDIRECT_REF_P(NODE)\
171 (TREE_CODE (NODE) == INDIRECT_REF)
172
173 /* Nonzero if NODE represents a reference. */
174
175 #define REFERENCE_CLASS_P(NODE)\
176 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
177
178 /* Nonzero if NODE represents a comparison. */
179
180 #define COMPARISON_CLASS_P(NODE)\
181 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
182
183 /* Nonzero if NODE represents a unary arithmetic expression. */
184
185 #define UNARY_CLASS_P(NODE)\
186 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
187
188 /* Nonzero if NODE represents a binary arithmetic expression. */
189
190 #define BINARY_CLASS_P(NODE)\
191 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
192
193 /* Nonzero if NODE represents a statement expression. */
194
195 #define STATEMENT_CLASS_P(NODE)\
196 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
197
198 /* Nonzero if NODE represents a function call-like expression with a
199 variable-length operand vector. */
200
201 #define VL_EXP_CLASS_P(NODE)\
202 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
203
204 /* Nonzero if NODE represents any other expression. */
205
206 #define EXPRESSION_CLASS_P(NODE)\
207 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
208
209 /* Returns nonzero iff NODE represents a type or declaration. */
210
211 #define IS_TYPE_OR_DECL_P(NODE)\
212 (TYPE_P (NODE) || DECL_P (NODE))
213
214 /* Returns nonzero iff CLASS is the tree-code class of an
215 expression. */
216
217 #define IS_EXPR_CODE_CLASS(CLASS)\
218 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
219
220 /* Returns nonzero iff NODE is an expression of some kind. */
221
222 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
223
224 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
225
226
227 /* Helper macros for math builtins. */
228
229 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
230 #define CASE_FLT_FN_FLOATN_NX(FN) \
231 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
232 case FN##F32X: case FN##F64X: case FN##F128X
233 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
234 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
235
236 #define NULL_TREE (tree) NULL
237
238 /* Define accessors for the fields that all tree nodes have
239 (though some fields are not used for all kinds of nodes). */
240
241 /* The tree-code says what kind of node it is.
242 Codes are defined in tree.def. */
243 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
244 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
245
246 /* When checking is enabled, errors will be generated if a tree node
247 is accessed incorrectly. The macros die with a fatal error. */
248 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
249
250 #define TREE_CHECK(T, CODE) \
251 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
252
253 #define TREE_NOT_CHECK(T, CODE) \
254 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
255
256 #define TREE_CHECK2(T, CODE1, CODE2) \
257 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
258
259 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
260 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
261
262 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
263 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
264
265 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
266 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
267 (CODE1), (CODE2), (CODE3)))
268
269 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
270 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
271 (CODE1), (CODE2), (CODE3), (CODE4)))
272
273 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
274 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
275 (CODE1), (CODE2), (CODE3), (CODE4)))
276
277 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
278 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
279 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
280
281 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
282 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
283 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
284
285 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
286 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
287
288 #define TREE_CLASS_CHECK(T, CLASS) \
289 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
290
291 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
292 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
293
294 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
295 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
296
297 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
298 (omp_clause_range_check ((T), (CODE1), (CODE2), \
299 __FILE__, __LINE__, __FUNCTION__))
300
301 /* These checks have to be special cased. */
302 #define EXPR_CHECK(T) \
303 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
304
305 /* These checks have to be special cased. */
306 #define NON_TYPE_CHECK(T) \
307 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
308
309 /* These checks have to be special cased. */
310 #define ANY_INTEGRAL_TYPE_CHECK(T) \
311 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
312
313 #define TREE_INT_CST_ELT_CHECK(T, I) \
314 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
315
316 #define TREE_VEC_ELT_CHECK(T, I) \
317 (*(CONST_CAST2 (tree *, typeof (T)*, \
318 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
319
320 #define OMP_CLAUSE_ELT_CHECK(T, I) \
321 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
322
323 /* Special checks for TREE_OPERANDs. */
324 #define TREE_OPERAND_CHECK(T, I) \
325 (*(CONST_CAST2 (tree*, typeof (T)*, \
326 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
327
328 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
329 (*(tree_operand_check_code ((T), (CODE), (I), \
330 __FILE__, __LINE__, __FUNCTION__)))
331
332 /* Nodes are chained together for many purposes.
333 Types are chained together to record them for being output to the debugger
334 (see the function `chain_type').
335 Decls in the same scope are chained together to record the contents
336 of the scope.
337 Statement nodes for successive statements used to be chained together.
338 Often lists of things are represented by TREE_LIST nodes that
339 are chained together. */
340
341 #define TREE_CHAIN(NODE) \
342 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
343
344 /* In all nodes that are expressions, this is the data type of the expression.
345 In POINTER_TYPE nodes, this is the type that the pointer points to.
346 In ARRAY_TYPE nodes, this is the type of the elements.
347 In VECTOR_TYPE nodes, this is the type of the elements. */
348 #define TREE_TYPE(NODE) \
349 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
350
351 extern void tree_contains_struct_check_failed (const_tree,
352 const enum tree_node_structure_enum,
353 const char *, int, const char *)
354 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
355
356 extern void tree_check_failed (const_tree, const char *, int, const char *,
357 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
358 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
359 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
360 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
361 const char *, int, const char *)
362 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
363 extern void tree_range_check_failed (const_tree, const char *, int,
364 const char *, enum tree_code,
365 enum tree_code)
366 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
367 extern void tree_not_class_check_failed (const_tree,
368 const enum tree_code_class,
369 const char *, int, const char *)
370 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
371 extern void tree_int_cst_elt_check_failed (int, int, const char *,
372 int, const char *)
373 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
374 extern void tree_vec_elt_check_failed (int, int, const char *,
375 int, const char *)
376 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
377 extern void phi_node_elt_check_failed (int, int, const char *,
378 int, const char *)
379 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
380 extern void tree_operand_check_failed (int, const_tree,
381 const char *, int, const char *)
382 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
383 extern void omp_clause_check_failed (const_tree, const char *, int,
384 const char *, enum omp_clause_code)
385 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
386 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
387 int, const char *)
388 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
389 extern void omp_clause_range_check_failed (const_tree, const char *, int,
390 const char *, enum omp_clause_code,
391 enum omp_clause_code)
392 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
393
394 #else /* not ENABLE_TREE_CHECKING, or not gcc */
395
396 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
397 #define TREE_CHECK(T, CODE) (T)
398 #define TREE_NOT_CHECK(T, CODE) (T)
399 #define TREE_CHECK2(T, CODE1, CODE2) (T)
400 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
401 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
402 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
403 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
404 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
405 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
406 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
407 #define TREE_CLASS_CHECK(T, CODE) (T)
408 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
409 #define EXPR_CHECK(T) (T)
410 #define NON_TYPE_CHECK(T) (T)
411 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
412 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
413 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
414 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
415 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
416 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
417 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
418 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
419
420 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
421 #define TREE_TYPE(NODE) ((NODE)->typed.type)
422
423 #endif
424
425 #define TREE_BLOCK(NODE) (tree_block (NODE))
426 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
427
428 #include "tree-check.h"
429
430 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
431 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
432 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
433 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
434 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
435 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
436 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
437 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
438 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
439 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
440 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
441
442 #define RECORD_OR_UNION_CHECK(T) \
443 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
444 #define NOT_RECORD_OR_UNION_CHECK(T) \
445 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
446 #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
447 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
448
449 #define NUMERICAL_TYPE_CHECK(T) \
450 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
451 FIXED_POINT_TYPE)
452
453 /* Here is how primitive or already-canonicalized types' hash codes
454 are made. */
455 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
456
457 /* A simple hash function for an arbitrary tree node. This must not be
458 used in hash tables which are saved to a PCH. */
459 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
460
461 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
462 #define CONVERT_EXPR_CODE_P(CODE) \
463 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
464
465 /* Similarly, but accept an expression instead of a tree code. */
466 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
467
468 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
469
470 #define CASE_CONVERT \
471 case NOP_EXPR: \
472 case CONVERT_EXPR
473
474 /* Given an expression as a tree, strip any conversion that generates
475 no instruction. Accepts both tree and const_tree arguments since
476 we are not modifying the tree itself. */
477
478 #define STRIP_NOPS(EXP) \
479 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
480
481 /* Like STRIP_NOPS, but don't let the signedness change either. */
482
483 #define STRIP_SIGN_NOPS(EXP) \
484 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
485
486 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
487
488 #define STRIP_TYPE_NOPS(EXP) \
489 while ((CONVERT_EXPR_P (EXP) \
490 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
491 && TREE_OPERAND (EXP, 0) != error_mark_node \
492 && (TREE_TYPE (EXP) \
493 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
494 (EXP) = TREE_OPERAND (EXP, 0)
495
496 /* Remove unnecessary type conversions according to
497 tree_ssa_useless_type_conversion. */
498
499 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
500 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
501
502 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
503 in use to provide a location_t. */
504
505 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
506 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
507
508 /* Nonzero if TYPE represents a vector type. */
509
510 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
511
512 /* Nonzero if TYPE represents a vector of booleans. */
513
514 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
515 (TREE_CODE (TYPE) == VECTOR_TYPE \
516 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
517
518 /* Nonzero if TYPE represents an integral type. Note that we do not
519 include COMPLEX types here. Keep these checks in ascending code
520 order. */
521
522 #define INTEGRAL_TYPE_P(TYPE) \
523 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
524 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
525 || TREE_CODE (TYPE) == INTEGER_TYPE)
526
527 /* Nonzero if TYPE represents an integral type, including complex
528 and vector integer types. */
529
530 #define ANY_INTEGRAL_TYPE_P(TYPE) \
531 (INTEGRAL_TYPE_P (TYPE) \
532 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
533 || VECTOR_TYPE_P (TYPE)) \
534 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
535
536 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
537
538 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
539 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
540
541 /* Nonzero if TYPE represents a saturating fixed-point type. */
542
543 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
544 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
545
546 /* Nonzero if TYPE represents a fixed-point type. */
547
548 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
549
550 /* Nonzero if TYPE represents a scalar floating-point type. */
551
552 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
553
554 /* Nonzero if TYPE represents a complex floating-point type. */
555
556 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
557 (TREE_CODE (TYPE) == COMPLEX_TYPE \
558 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
559
560 /* Nonzero if TYPE represents a vector integer type. */
561
562 #define VECTOR_INTEGER_TYPE_P(TYPE) \
563 (VECTOR_TYPE_P (TYPE) \
564 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
565
566
567 /* Nonzero if TYPE represents a vector floating-point type. */
568
569 #define VECTOR_FLOAT_TYPE_P(TYPE) \
570 (VECTOR_TYPE_P (TYPE) \
571 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
572
573 /* Nonzero if TYPE represents a floating-point type, including complex
574 and vector floating-point types. The vector and complex check does
575 not use the previous two macros to enable early folding. */
576
577 #define FLOAT_TYPE_P(TYPE) \
578 (SCALAR_FLOAT_TYPE_P (TYPE) \
579 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
580 || VECTOR_TYPE_P (TYPE)) \
581 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
582
583 /* Nonzero if TYPE represents a decimal floating-point type. */
584 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
585 (SCALAR_FLOAT_TYPE_P (TYPE) \
586 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
587
588 /* Nonzero if TYPE is a record or union type. */
589 #define RECORD_OR_UNION_TYPE_P(TYPE) \
590 (TREE_CODE (TYPE) == RECORD_TYPE \
591 || TREE_CODE (TYPE) == UNION_TYPE \
592 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
593
594 /* Nonzero if TYPE represents an aggregate (multi-component) type.
595 Keep these checks in ascending code order. */
596
597 #define AGGREGATE_TYPE_P(TYPE) \
598 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
599
600 /* Nonzero if TYPE represents a pointer or reference type.
601 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
602 ascending code order. */
603
604 #define POINTER_TYPE_P(TYPE) \
605 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
606
607 /* Nonzero if TYPE represents a pointer to function. */
608 #define FUNCTION_POINTER_TYPE_P(TYPE) \
609 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
610
611 /* Nonzero if this type is a complete type. */
612 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
613
614 /* Nonzero if this type is the (possibly qualified) void type. */
615 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
616
617 /* Nonzero if this type is complete or is cv void. */
618 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
619 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
620
621 /* Nonzero if this type is complete or is an array with unspecified bound. */
622 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
623 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
624
625 #define FUNC_OR_METHOD_TYPE_P(NODE) \
626 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
627
628 #define OPAQUE_TYPE_P(NODE) \
629 (TREE_CODE (NODE) == OPAQUE_TYPE)
630
631 /* Define many boolean fields that all tree nodes have. */
632
633 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
634 of this is needed. So it cannot be in a register.
635 In a FUNCTION_DECL it has no meaning.
636 In LABEL_DECL nodes, it means a goto for this label has been seen
637 from a place outside all binding contours that restore stack levels.
638 In an artificial SSA_NAME that points to a stack partition with at least
639 two variables, it means that at least one variable has TREE_ADDRESSABLE.
640 In ..._TYPE nodes, it means that objects of this type must be fully
641 addressable. This means that pieces of this object cannot go into
642 register parameters, for example. If this a function type, this
643 means that the value must be returned in memory.
644 In CONSTRUCTOR nodes, it means object constructed must be in memory.
645 In IDENTIFIER_NODEs, this means that some extern decl for this name
646 had its address taken. That matters for inline functions.
647 In a STMT_EXPR, it means we want the result of the enclosed expression. */
648 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
649
650 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
651 exit of a function. Calls for which this is true are candidates for tail
652 call optimizations. */
653 #define CALL_EXPR_TAILCALL(NODE) \
654 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
655
656 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
657 optimization for correctness. */
658 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
659 (CALL_EXPR_CHECK (NODE)->base.static_flag)
660
661 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
662 CASE_LOW operand has been processed. */
663 #define CASE_LOW_SEEN(NODE) \
664 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
665
666 #define PREDICT_EXPR_OUTCOME(NODE) \
667 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
668 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
669 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
670 #define PREDICT_EXPR_PREDICTOR(NODE) \
671 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
672
673 /* In a VAR_DECL, nonzero means allocate static storage.
674 In a FUNCTION_DECL, nonzero if function has been defined.
675 In a CONSTRUCTOR, nonzero means allocate static storage. */
676 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
677
678 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
679 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
680
681 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
682 should only be executed if an exception is thrown, not on normal exit
683 of its scope. */
684 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
685
686 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
687 separate cleanup in honor_protect_cleanup_actions. */
688 #define TRY_CATCH_IS_CLEANUP(NODE) \
689 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
690
691 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
692 CASE_HIGH operand has been processed. */
693 #define CASE_HIGH_SEEN(NODE) \
694 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
695
696 /* Used to mark scoped enums. */
697 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
698
699 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
700 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
701
702 /* In an expr node (usually a conversion) this means the node was made
703 implicitly and should not lead to any sort of warning. In a decl node,
704 warnings concerning the decl should be suppressed. This is used at
705 least for used-before-set warnings, and it set after one warning is
706 emitted. */
707 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
708
709 /* Nonzero if we should warn about the change in empty class parameter
710 passing ABI in this TU. */
711 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
712 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
713
714 /* Nonzero if this type is "empty" according to the particular psABI. */
715 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
716
717 /* Used to indicate that this TYPE represents a compiler-generated entity. */
718 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
719
720 /* True if the type is indivisible at the source level, i.e. if its
721 component parts cannot be accessed directly. This is used to suppress
722 normal GNU extensions for target-specific vector types. */
723 #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
724
725 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
726 this string as an argument. */
727 #define TREE_SYMBOL_REFERENCED(NODE) \
728 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
729
730 /* Nonzero in a pointer or reference type means the data pointed to
731 by this type can alias anything. */
732 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
733 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
734
735 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
736 there was an overflow in folding. */
737
738 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
739
740 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
741
742 #define TREE_OVERFLOW_P(EXPR) \
743 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
744
745 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
746 nonzero means name is to be accessible from outside this translation unit.
747 In an IDENTIFIER_NODE, nonzero means an external declaration
748 accessible from outside this translation unit was previously seen
749 for this name in an inner scope. */
750 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
751
752 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
753 of cached values, or is something else. */
754 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
755
756 /* In a SAVE_EXPR, indicates that the original expression has already
757 been substituted with a VAR_DECL that contains the value. */
758 #define SAVE_EXPR_RESOLVED_P(NODE) \
759 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
760
761 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
762 pack. */
763 #define CALL_EXPR_VA_ARG_PACK(NODE) \
764 (CALL_EXPR_CHECK (NODE)->base.public_flag)
765
766 /* In any expression, decl, or constant, nonzero means it has side effects or
767 reevaluation of the whole expression could produce a different value.
768 This is set if any subexpression is a function call, a side effect or a
769 reference to a volatile variable. In a ..._DECL, this is set only if the
770 declaration said `volatile'. This will never be set for a constant. */
771 #define TREE_SIDE_EFFECTS(NODE) \
772 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
773
774 /* In a LABEL_DECL, nonzero means this label had its address taken
775 and therefore can never be deleted and is a jump target for
776 computed gotos. */
777 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
778
779 /* Whether a case or a user-defined label is allowed to fall through to.
780 This is used to implement -Wimplicit-fallthrough. */
781 #define FALLTHROUGH_LABEL_P(NODE) \
782 (LABEL_DECL_CHECK (NODE)->base.private_flag)
783
784 /* Set on the artificial label created for break; stmt from a switch.
785 This is used to implement -Wimplicit-fallthrough. */
786 #define SWITCH_BREAK_LABEL_P(NODE) \
787 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
788
789 /* Nonzero means this expression is volatile in the C sense:
790 its address should be of type `volatile WHATEVER *'.
791 In other words, the declared item is volatile qualified.
792 This is used in _DECL nodes and _REF nodes.
793 On a FUNCTION_DECL node, this means the function does not
794 return normally. This is the same effect as setting
795 the attribute noreturn on the function in C.
796
797 In a ..._TYPE node, means this type is volatile-qualified.
798 But use TYPE_VOLATILE instead of this macro when the node is a type,
799 because eventually we may make that a different bit.
800
801 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
802 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
803
804 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
805 accessing the memory pointed to won't generate a trap. However,
806 this only applies to an object when used appropriately: it doesn't
807 mean that writing a READONLY mem won't trap.
808
809 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
810 (or slice of the array) always belongs to the range of the array.
811 I.e. that the access will not trap, provided that the access to
812 the base to the array will not trap. */
813 #define TREE_THIS_NOTRAP(NODE) \
814 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
815 ARRAY_RANGE_REF)->base.nothrow_flag)
816
817 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
818 nonzero means it may not be the lhs of an assignment.
819 Nonzero in a FUNCTION_DECL means this function should be treated
820 as "const" function (can only read its arguments). */
821 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
822
823 /* Value of expression is constant. Always on in all ..._CST nodes. May
824 also appear in an expression or decl where the value is constant. */
825 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
826
827 /* Nonzero if NODE, a type, has had its sizes gimplified. */
828 #define TYPE_SIZES_GIMPLIFIED(NODE) \
829 (TYPE_CHECK (NODE)->base.constant_flag)
830
831 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
832 #define DECL_UNSIGNED(NODE) \
833 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
834
835 /* In integral and pointer types, means an unsigned type. */
836 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
837
838 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
839 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
840
841 /* True if overflow wraps around for the given integral or pointer type. That
842 is, TYPE_MAX + 1 == TYPE_MIN. */
843 #define TYPE_OVERFLOW_WRAPS(TYPE) \
844 (POINTER_TYPE_P (TYPE) \
845 ? flag_wrapv_pointer \
846 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
847 || flag_wrapv))
848
849 /* True if overflow is undefined for the given integral or pointer type.
850 We may optimize on the assumption that values in the type never overflow.
851
852 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
853 must issue a warning based on warn_strict_overflow. In some cases
854 it will be appropriate to issue the warning immediately, and in
855 other cases it will be appropriate to simply set a flag and let the
856 caller decide whether a warning is appropriate or not. */
857 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
858 (POINTER_TYPE_P (TYPE) \
859 ? !flag_wrapv_pointer \
860 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
861 && !flag_wrapv && !flag_trapv))
862
863 /* True if overflow for the given integral type should issue a
864 trap. */
865 #define TYPE_OVERFLOW_TRAPS(TYPE) \
866 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
867
868 /* True if an overflow is to be preserved for sanitization. */
869 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
870 (INTEGRAL_TYPE_P (TYPE) \
871 && !TYPE_OVERFLOW_WRAPS (TYPE) \
872 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
873
874 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
875 Nonzero in a FUNCTION_DECL means that the function has been compiled.
876 This is interesting in an inline function, since it might not need
877 to be compiled separately.
878 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
879 or TYPE_DECL if the debugging info for the type has been written.
880 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
881 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
882 PHI node. */
883 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
884
885 /* Nonzero in a _DECL if the name is used in its scope.
886 Nonzero in an expr node means inhibit warning if value is unused.
887 In IDENTIFIER_NODEs, this means that some extern decl for this name
888 was used.
889 In a BLOCK, this means that the block contains variables that are used. */
890 #define TREE_USED(NODE) ((NODE)->base.used_flag)
891
892 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
893 throw an exception. In a CALL_EXPR, nonzero means the call cannot
894 throw. We can't easily check the node type here as the C++
895 frontend also uses this flag (for AGGR_INIT_EXPR). */
896 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
897
898 /* In a CALL_EXPR, means that it's safe to use the target of the call
899 expansion as the return slot for a call that returns in memory. */
900 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
901 (CALL_EXPR_CHECK (NODE)->base.private_flag)
902
903 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
904 passed by invisible reference (and the TREE_TYPE is a pointer to the true
905 type). */
906 #define DECL_BY_REFERENCE(NODE) \
907 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
908 RESULT_DECL)->decl_common.decl_by_reference_flag)
909
910 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
911 being set. */
912 #define DECL_READ_P(NODE) \
913 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
914
915 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
916 attempting to share the stack slot with some other variable. */
917 #define DECL_NONSHAREABLE(NODE) \
918 (TREE_CHECK2 (NODE, VAR_DECL, \
919 RESULT_DECL)->decl_common.decl_nonshareable_flag)
920
921 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
922 buggy callers don't pass to the callee. */
923 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
924 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
925
926 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
927 thunked-to function. Be careful to avoid using this macro when one of the
928 next two applies instead. */
929 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
930
931 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
932 it has been built for the declaration of a variable-sized object and, if the
933 function being called is BUILT_IN_MEMCPY, means that it has been built for
934 the assignment of a variable-sized object. */
935 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
936 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
937
938 /* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or
939 DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete
940 expressions. Not set for C++20 destroying delete operators. */
941 #define CALL_FROM_NEW_OR_DELETE_P(NODE) \
942 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
943
944 /* Used in classes in C++. */
945 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
946 /* Used in classes in C++. */
947 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
948
949 /* True if reference type NODE is a C++ rvalue reference. */
950 #define TYPE_REF_IS_RVALUE(NODE) \
951 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
952
953 /* Nonzero in a _DECL if the use of the name is defined as a
954 deprecated feature by __attribute__((deprecated)). */
955 #define TREE_DEPRECATED(NODE) \
956 ((NODE)->base.deprecated_flag)
957
958 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
959 aggregate, (as created by anon_aggr_name_format). */
960 #define IDENTIFIER_ANON_P(NODE) \
961 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
962
963 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
964 uses are to be substituted for uses of the TREE_CHAINed identifier. */
965 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
966 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
967
968 /* In an aggregate type, indicates that the scalar fields of the type are
969 stored in reverse order from the target order. This effectively
970 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
971 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
972 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
973
974 /* In a non-aggregate type, indicates a saturating type. */
975 #define TYPE_SATURATING(NODE) \
976 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
977
978 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
979 of bits stored in reverse order from the target order. This effectively
980 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
981
982 The overall strategy is to preserve the invariant that every scalar in
983 memory is associated with a single storage order, i.e. all accesses to
984 this scalar are done with the same storage order. This invariant makes
985 it possible to factor out the storage order in most transformations, as
986 only the address and/or the value (in target order) matter for them.
987 But, of course, the storage order must be preserved when the accesses
988 themselves are rewritten or transformed. */
989 #define REF_REVERSE_STORAGE_ORDER(NODE) \
990 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
991
992 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
993 represented by a descriptor instead of a trampoline. */
994 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
995 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
996
997 /* In a CALL_EXPR, indicates that this is an indirect call for which
998 pointers to nested function are descriptors instead of trampolines. */
999 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
1000 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
1001
1002 /* These flags are available for each language front end to use internally. */
1003 #define TREE_LANG_FLAG_0(NODE) \
1004 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1005 #define TREE_LANG_FLAG_1(NODE) \
1006 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1007 #define TREE_LANG_FLAG_2(NODE) \
1008 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1009 #define TREE_LANG_FLAG_3(NODE) \
1010 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1011 #define TREE_LANG_FLAG_4(NODE) \
1012 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1013 #define TREE_LANG_FLAG_5(NODE) \
1014 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1015 #define TREE_LANG_FLAG_6(NODE) \
1016 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1017
1018 /* Define additional fields and accessors for nodes representing constants. */
1019
1020 #define TREE_INT_CST_NUNITS(NODE) \
1021 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1022 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1023 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1024 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1025 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1026 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1027 #define TREE_INT_CST_LOW(NODE) \
1028 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1029
1030 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1031 targets with variable-sized modes. */
1032 #define POLY_INT_CST_P(NODE) \
1033 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1034
1035 /* In a POLY_INT_CST node. */
1036 #define POLY_INT_CST_COEFF(NODE, I) \
1037 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1038
1039 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1040 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1041
1042 #define TREE_FIXED_CST_PTR(NODE) \
1043 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1044 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1045
1046 /* In a STRING_CST */
1047 /* In C terms, this is sizeof, not strlen. */
1048 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1049 #define TREE_STRING_POINTER(NODE) \
1050 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1051
1052 /* In a COMPLEX_CST node. */
1053 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1054 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1055
1056 /* In a VECTOR_CST node. See generic.texi for details. */
1057 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1058 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1059
1060 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1061 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1062 #define VECTOR_CST_NPATTERNS(NODE) \
1063 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1064 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1065 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1066 #define VECTOR_CST_DUPLICATE_P(NODE) \
1067 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1068 #define VECTOR_CST_STEPPED_P(NODE) \
1069 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1070 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1071 (VECTOR_CST_CHECK (NODE)->vector.elts)
1072 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1073 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1074
1075 /* Define fields and accessors for some special-purpose tree nodes. */
1076
1077 #define IDENTIFIER_LENGTH(NODE) \
1078 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1079 #define IDENTIFIER_POINTER(NODE) \
1080 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1081 #define IDENTIFIER_HASH_VALUE(NODE) \
1082 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1083
1084 /* Translate a hash table identifier pointer to a tree_identifier
1085 pointer, and vice versa. */
1086
1087 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1088 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1089 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1090
1091 /* In a TREE_LIST node. */
1092 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1093 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1094
1095 /* In a TREE_VEC node. */
1096 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1097 #define TREE_VEC_END(NODE) \
1098 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1099
1100 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1101
1102 /* In a CONSTRUCTOR node. */
1103 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1104 #define CONSTRUCTOR_ELT(NODE,IDX) \
1105 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1106 #define CONSTRUCTOR_NELTS(NODE) \
1107 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1108 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1109 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1110
1111 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1112 value of each element (stored within VAL). IX must be a scratch variable
1113 of unsigned integer type. */
1114 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1115 for (IX = 0; (IX >= vec_safe_length (V)) \
1116 ? false \
1117 : ((VAL = (*(V))[IX].value), \
1118 true); \
1119 (IX)++)
1120
1121 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1122 the value of each element (stored within VAL) and its index (stored
1123 within INDEX). IX must be a scratch variable of unsigned integer type. */
1124 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1125 for (IX = 0; (IX >= vec_safe_length (V)) \
1126 ? false \
1127 : (((void) (VAL = (*V)[IX].value)), \
1128 (INDEX = (*V)[IX].index), \
1129 true); \
1130 (IX)++)
1131
1132 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1133 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1134 do { \
1135 constructor_elt _ce___ = {INDEX, VALUE}; \
1136 vec_safe_push ((V), _ce___); \
1137 } while (0)
1138
1139 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1140 constructor output purposes. */
1141 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1142 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1143
1144 /* True if NODE is a clobber right hand side, an expression of indeterminate
1145 value that clobbers the LHS in a copy instruction. We use a volatile
1146 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1147 In particular the volatile flag causes us to not prematurely remove
1148 such clobber instructions. */
1149 #define TREE_CLOBBER_P(NODE) \
1150 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1151
1152 /* Define fields and accessors for some nodes that represent expressions. */
1153
1154 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1155 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1156 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1157 && integer_zerop (TREE_OPERAND (NODE, 0)))
1158
1159 /* In ordinary expression nodes. */
1160 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1161 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1162
1163 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1164 length. Its value includes the length operand itself; that is,
1165 the minimum valid length is 1.
1166 Note that we have to bypass the use of TREE_OPERAND to access
1167 that field to avoid infinite recursion in expanding the macros. */
1168 #define VL_EXP_OPERAND_LENGTH(NODE) \
1169 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1170
1171 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1172 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1173 /* Nonzero if gimple_debug_bind_p() (and thus
1174 gimple_debug_source_bind_p()) may possibly hold. */
1175 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1176 /* Nonzero if is_gimple_debug() may possibly hold. */
1177 #define MAY_HAVE_DEBUG_STMTS \
1178 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1179
1180 /* In a LOOP_EXPR node. */
1181 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1182
1183 /* The source location of this expression. Non-tree_exp nodes such as
1184 decls and constants can be shared among multiple locations, so
1185 return nothing. */
1186 #define EXPR_LOCATION(NODE) \
1187 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1188 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1189 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1190 != UNKNOWN_LOCATION)
1191 /* The location to be used in a diagnostic about this expression. Do not
1192 use this macro if the location will be assigned to other expressions. */
1193 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1194 ? (NODE)->exp.locus : (LOCUS))
1195 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1196 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1197
1198 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1199 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1200
1201 #define EXPR_HAS_RANGE(NODE) \
1202 (CAN_HAVE_RANGE_P (NODE) \
1203 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1204 : false)
1205
1206 /* True if a tree is an expression or statement that can have a
1207 location. */
1208 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1209
1210 static inline source_range
get_expr_source_range(tree expr)1211 get_expr_source_range (tree expr)
1212 {
1213 location_t loc = EXPR_LOCATION (expr);
1214 return get_range_from_loc (line_table, loc);
1215 }
1216
1217 extern void protected_set_expr_location (tree, location_t);
1218 extern void protected_set_expr_location_if_unset (tree, location_t);
1219
1220 WARN_UNUSED_RESULT extern tree maybe_wrap_with_location (tree, location_t);
1221
1222 extern int suppress_location_wrappers;
1223
1224 /* A class for suppressing the creation of location wrappers.
1225 Location wrappers will not be created during the lifetime
1226 of an instance of this class. */
1227
1228 class auto_suppress_location_wrappers
1229 {
1230 public:
auto_suppress_location_wrappers()1231 auto_suppress_location_wrappers () { ++suppress_location_wrappers; }
~auto_suppress_location_wrappers()1232 ~auto_suppress_location_wrappers () { --suppress_location_wrappers; }
1233 };
1234
1235 /* In a TARGET_EXPR node. */
1236 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1237 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1238 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1239 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1240 on rhs of MODIFY_EXPR. */
1241 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1242
1243 /* DECL_EXPR accessor. This gives access to the DECL associated with
1244 the given declaration statement. */
1245 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1246
1247 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1248
1249 /* COMPOUND_LITERAL_EXPR accessors. */
1250 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1251 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1252 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1253 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1254
1255 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1256 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1257 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1258 /* True if there are case labels for all possible values of SWITCH_COND, either
1259 because there is a default: case label or because the case label ranges cover
1260 all values. */
1261 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1262
1263 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1264 of a case label, respectively. */
1265 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1266 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1267 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1268 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1269
1270 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1271 corresponding MEM_REF operands. */
1272 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1273 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1274 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1275 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1276 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1277
1278 #define MR_DEPENDENCE_CLIQUE(NODE) \
1279 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1280 #define MR_DEPENDENCE_BASE(NODE) \
1281 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1282
1283 /* The operands of a BIND_EXPR. */
1284 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1285 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1286 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1287
1288 /* GOTO_EXPR accessor. This gives access to the label associated with
1289 a goto statement. */
1290 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1291
1292 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1293 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1294 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1295 statement. */
1296 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1297 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1298 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1299 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1300 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1301 /* Nonzero if we want to create an ASM_INPUT instead of an
1302 ASM_OPERAND with no operands. */
1303 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1304 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1305 /* Nonzero if we want to consider this asm as minimum length and cost
1306 for inlining decisions. */
1307 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1308
1309 /* COND_EXPR accessors. */
1310 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1311 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1312 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1313
1314 /* Accessors for the chains of recurrences. */
1315 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1316 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1317 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1318
1319 /* LABEL_EXPR accessor. This gives access to the label associated with
1320 the given label expression. */
1321 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1322
1323 /* CATCH_EXPR accessors. */
1324 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1325 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1326
1327 /* EH_FILTER_EXPR accessors. */
1328 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1329 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1330
1331 /* OBJ_TYPE_REF accessors. */
1332 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1333 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1334 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1335
1336 /* ASSERT_EXPR accessors. */
1337 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1338 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1339
1340 /* CALL_EXPR accessors. */
1341 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1342 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1343 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1344 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1345 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1346
1347 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1348 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1349 the argument count is zero when checking is enabled. Instead, do
1350 the pointer arithmetic to advance past the 3 fixed operands in a
1351 CALL_EXPR. That produces a valid pointer to just past the end of the
1352 operand array, even if it's not valid to dereference it. */
1353 #define CALL_EXPR_ARGP(NODE) \
1354 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1355
1356 /* TM directives and accessors. */
1357 #define TRANSACTION_EXPR_BODY(NODE) \
1358 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1359 #define TRANSACTION_EXPR_OUTER(NODE) \
1360 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1361 #define TRANSACTION_EXPR_RELAXED(NODE) \
1362 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1363
1364 /* OpenMP and OpenACC directive and clause accessors. */
1365
1366 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1367 as operand 1. */
1368 #define OMP_BODY(NODE) \
1369 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1370 #define OMP_CLAUSES(NODE) \
1371 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1372
1373 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1374 #define OMP_STANDALONE_CLAUSES(NODE) \
1375 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1376
1377 #define OACC_DATA_BODY(NODE) \
1378 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1379 #define OACC_DATA_CLAUSES(NODE) \
1380 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1381
1382 #define OACC_HOST_DATA_BODY(NODE) \
1383 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1384 #define OACC_HOST_DATA_CLAUSES(NODE) \
1385 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1386
1387 #define OACC_CACHE_CLAUSES(NODE) \
1388 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1389
1390 #define OACC_DECLARE_CLAUSES(NODE) \
1391 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1392
1393 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1394 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1395
1396 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1397 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1398
1399 #define OACC_UPDATE_CLAUSES(NODE) \
1400 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1401
1402 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1403 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1404
1405 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1406 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1407
1408 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1409 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1410 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1411
1412 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1413 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1414 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1415 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1416 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1417 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1418 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1419 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1420
1421 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1422 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1423
1424 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1425
1426 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1427 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1428
1429 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1430
1431 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1432 #define OMP_TASKGROUP_CLAUSES(NODE) \
1433 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1434
1435 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1436 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1437
1438 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1439 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1440 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1441
1442 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1443 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1444
1445 #define OMP_TARGET_DATA_BODY(NODE) \
1446 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1447 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1448 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1449
1450 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1451 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1452
1453 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1454 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1455
1456 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1457 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1458
1459 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1460 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1461
1462 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1463 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1464
1465 #define OMP_CLAUSE_SIZE(NODE) \
1466 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1467 OMP_CLAUSE_FROM, \
1468 OMP_CLAUSE__CACHE_), 1)
1469
1470 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1471 #define OMP_CLAUSE_DECL(NODE) \
1472 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1473 OMP_CLAUSE_PRIVATE, \
1474 OMP_CLAUSE__SCANTEMP_), 0)
1475 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1476 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1477 != UNKNOWN_LOCATION)
1478 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1479
1480 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1481 is non-rectangular. */
1482 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1483 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1484
1485 /* True on an OMP_SECTION statement that was the last lexical member.
1486 This status is meaningful in the implementation of lastprivate. */
1487 #define OMP_SECTION_LAST(NODE) \
1488 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1489
1490 /* True on an OMP_PARALLEL statement if it represents an explicit
1491 combined parallel work-sharing constructs. */
1492 #define OMP_PARALLEL_COMBINED(NODE) \
1493 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1494
1495 /* True on an OMP_TEAMS statement if it represents an explicit
1496 combined teams distribute constructs. */
1497 #define OMP_TEAMS_COMBINED(NODE) \
1498 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1499
1500 /* True on an OMP_TARGET statement if it represents explicit
1501 combined target teams, target parallel or target simd constructs. */
1502 #define OMP_TARGET_COMBINED(NODE) \
1503 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1504
1505 /* Memory order for OMP_ATOMIC*. */
1506 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1507 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1508 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1509
1510 /* True on a PRIVATE clause if its decl is kept around for debugging
1511 information only and its DECL_VALUE_EXPR is supposed to point
1512 to what it has been remapped to. */
1513 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1514 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1515
1516 /* True on a PRIVATE clause if ctor needs access to outer region's
1517 variable. */
1518 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1519 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1520
1521 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1522 (thus should be private on the outer taskloop and firstprivate on
1523 task). */
1524 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1525 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1526
1527 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1528 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1529 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1530
1531 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1532 to should be firstprivatized. */
1533 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1534 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1535
1536 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1537 decl is present in the chain. */
1538 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1539 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1540 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1541 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1542 OMP_CLAUSE_LASTPRIVATE),\
1543 1)
1544 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1545 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1546
1547 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1548 loop construct (thus should be lastprivate on the outer taskloop and
1549 firstprivate on task for the taskloop construct and carefully handled
1550 for loop construct). */
1551 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1552 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1553
1554 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1555 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1556 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1557
1558 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1559 decl is present in the chain (this can happen only for taskloop
1560 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1561 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1562 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1563
1564 /* True on a SHARED clause if a scalar is not modified in the body and
1565 thus could be optimized as firstprivate. */
1566 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1567 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1568
1569 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1570 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1571
1572 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1573 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1574 #define OMP_CLAUSE_IF_EXPR(NODE) \
1575 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1576 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1577 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1578 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1579 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1580 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1581 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1582 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1583 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1584
1585 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1586 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1587
1588 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1589 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1590
1591 /* OpenACC clause expressions */
1592 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1593 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1594 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1595 OMP_CLAUSE_OPERAND ( \
1596 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1597 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1598 OMP_CLAUSE_OPERAND ( \
1599 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1600 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1601 OMP_CLAUSE_OPERAND ( \
1602 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1603 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1604 OMP_CLAUSE_OPERAND ( \
1605 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1606 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1607 OMP_CLAUSE_OPERAND ( \
1608 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1609 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1610 OMP_CLAUSE_OPERAND ( \
1611 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1612 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1613 OMP_CLAUSE_OPERAND ( \
1614 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1615 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1616 OMP_CLAUSE_OPERAND ( \
1617 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1618 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1619 OMP_CLAUSE_OPERAND ( \
1620 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1621
1622 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1623 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1624
1625 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1626 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1627
1628 #define OMP_CLAUSE_MAP_KIND(NODE) \
1629 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1630 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1631 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1632 = (unsigned int) (MAP_KIND))
1633
1634 /* Nonzero if this map clause is for array (rather than pointer) based array
1635 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1636 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1637 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1638 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1639 /* Nonzero if this is a mapped array section, that might need special
1640 treatment if OMP_CLAUSE_SIZE is zero. */
1641 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1642 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1643 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1644 variable. */
1645 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1646 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1647
1648 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1649 clause. */
1650 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1651 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1652
1653 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1654 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1655
1656 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1657 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1658
1659 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1660 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1661 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1662 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1663 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1664 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1665
1666 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1667 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1668
1669 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1670 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1671 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1672 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1673 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1674 OMP_CLAUSE_IN_REDUCTION), 1)
1675 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1676 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1677 OMP_CLAUSE_IN_REDUCTION), 2)
1678 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1679 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1680 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1681 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1682 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1683 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1684 OMP_CLAUSE_IN_REDUCTION), 3)
1685 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1686 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1687 OMP_CLAUSE_IN_REDUCTION), 4)
1688
1689 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1690 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1691 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1692 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1693 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1694
1695 /* True if a REDUCTION clause has task reduction-modifier. */
1696 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1697 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1698
1699 /* True if a REDUCTION clause has inscan reduction-modifier. */
1700 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1701 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1702
1703 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1704 are always initialized inside of the loop construct, false otherwise. */
1705 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1706 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1707
1708 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1709 are declared inside of the simd construct. */
1710 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1711 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1712
1713 /* True if a LINEAR clause has a stride that is variable. */
1714 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1715 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1716
1717 /* True if a LINEAR clause is for an array or allocatable variable that
1718 needs special handling by the frontend. */
1719 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1720 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1721
1722 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1723 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1724
1725 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1726 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1727
1728 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1729 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1730
1731 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1732 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1733
1734 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1735 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1736
1737 #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1739
1740 /* True if an ALLOCATE clause was present on a combined or composite
1741 construct and the code for splitting the clauses has already performed
1742 checking if the listed variable has explicit privatization on the
1743 construct. */
1744 #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1745 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1746
1747 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1749
1750 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1752 OMP_CLAUSE_THREAD_LIMIT), 0)
1753
1754 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1755 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1756
1757 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1759 OMP_CLAUSE_DIST_SCHEDULE), 0)
1760
1761 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1762 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1763
1764 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1765 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1766
1767 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1768 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1769
1770 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1771 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1772
1773 /* True if a SCHEDULE clause has the simd modifier on it. */
1774 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1775 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1776
1777 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1778 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1779
1780 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1781 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1782 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1783 ((enum omp_clause_defaultmap_kind) \
1784 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1785 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1786 ((enum omp_clause_defaultmap_kind) \
1787 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1788 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1789 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1790 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1791
1792 #define OMP_CLAUSE_BIND_KIND(NODE) \
1793 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
1794
1795 #define OMP_CLAUSE_TILE_LIST(NODE) \
1796 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1797 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1798 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1799 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1801
1802 /* _CONDTEMP_ holding temporary with iteration count. */
1803 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
1804 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
1805
1806 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
1807 allocation. */
1808 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
1809 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
1810
1811 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
1812 one boolean_type_node for test whether alloca was used, another one
1813 to pass to __builtin_stack_restore or free. */
1814 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
1815 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
1816
1817 /* SSA_NAME accessors. */
1818
1819 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1820 information in the underlying SSA_NAME_VAR for efficiency. */
1821 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1822 SSA_NAME_CHECK (NODE)->base.public_flag
1823
1824 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1825 if there is no name associated with it. */
1826 #define SSA_NAME_IDENTIFIER(NODE) \
1827 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1828 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1829 ? (NODE)->ssa_name.var \
1830 : DECL_NAME ((NODE)->ssa_name.var)) \
1831 : NULL_TREE)
1832
1833 /* Returns the variable being referenced. This can be NULL_TREE for
1834 temporaries not associated with any user variable.
1835 Once released, this is the only field that can be relied upon. */
1836 #define SSA_NAME_VAR(NODE) \
1837 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1838 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1839 ? NULL_TREE : (NODE)->ssa_name.var)
1840
1841 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1842 do \
1843 { \
1844 tree var_ = (VAR); \
1845 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1846 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1847 = (var_ \
1848 && TREE_CODE (var_) == VAR_DECL \
1849 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1850 } \
1851 while (0)
1852
1853 /* Returns the statement which defines this SSA name. */
1854 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1855
1856 /* Returns the SSA version number of this SSA name. Note that in
1857 tree SSA, version numbers are not per variable and may be recycled. */
1858 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1859
1860 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1861 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1862 status bit. */
1863 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1864 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1865
1866 /* Nonzero if this SSA_NAME expression is currently on the free list of
1867 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1868 has no meaning for an SSA_NAME. */
1869 #define SSA_NAME_IN_FREE_LIST(NODE) \
1870 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1871
1872 /* Nonzero if this SSA_NAME is the default definition for the
1873 underlying symbol. A default SSA name is created for symbol S if
1874 the very first reference to S in the function is a read operation.
1875 Default definitions are always created by an empty statement and
1876 belong to no basic block. */
1877 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1878 SSA_NAME_CHECK (NODE)->base.default_def_flag
1879
1880 /* Nonzero if this SSA_NAME is known to point to memory that may not
1881 be written to. This is set for default defs of function parameters
1882 that have a corresponding r or R specification in the functions
1883 fn spec attribute. This is used by alias analysis. */
1884 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1885 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1886
1887 /* Attributes for SSA_NAMEs for pointer-type variables. */
1888 #define SSA_NAME_PTR_INFO(N) \
1889 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1890
1891 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1892 #define SSA_NAME_ANTI_RANGE_P(N) \
1893 SSA_NAME_CHECK (N)->base.static_flag
1894
1895 /* The type of range described by SSA_NAME_RANGE_INFO. */
1896 #define SSA_NAME_RANGE_TYPE(N) \
1897 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1898
1899 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1900 #define SSA_NAME_RANGE_INFO(N) \
1901 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1902
1903 /* Return the immediate_use information for an SSA_NAME. */
1904 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1905
1906 #define OMP_CLAUSE_CODE(NODE) \
1907 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1908
1909 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1910 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1911
1912 #define OMP_CLAUSE_OPERAND(NODE, I) \
1913 OMP_CLAUSE_ELT_CHECK (NODE, I)
1914
1915 /* In a BLOCK (scope) node:
1916 Variables declared in the scope NODE. */
1917 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1918 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1919 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1920 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1921 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1922 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1923 /* A chain of BLOCKs (scopes) nested within the scope NODE. */
1924 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1925 /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
1926 function scope. Inlined functions are chained by this so that given
1927 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
1928 in which E has been made or into which E has been inlined. */
1929 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1930 /* Points to the next scope at the same level of nesting as scope NODE. */
1931 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1932 /* A BLOCK, or FUNCTION_DECL of the function from which a block has been
1933 inlined. In a scope immediately enclosing an inlined leaf expression,
1934 points to the outermost scope into which it has been inlined (thus
1935 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
1936 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1937 #define BLOCK_ORIGIN(NODE) \
1938 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
1939 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1940
1941 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1942 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1943
1944 /* True if BLOCK appears in cold section. */
1945 #define BLOCK_IN_COLD_SECTION_P(NODE) \
1946 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
1947
1948 /* An index number for this block. These values are not guaranteed to
1949 be unique across functions -- whether or not they are depends on
1950 the debugging output format in use. */
1951 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1952
1953 /* If block reordering splits a lexical block into discontiguous
1954 address ranges, we'll make a copy of the original block.
1955
1956 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1957 In that case, we have one source block that has been replicated
1958 (through inlining or unrolling) into many logical blocks, and that
1959 these logical blocks have different physical variables in them.
1960
1961 In this case, we have one logical block split into several
1962 non-contiguous address ranges. Most debug formats can't actually
1963 represent this idea directly, so we fake it by creating multiple
1964 logical blocks with the same variables in them. However, for those
1965 that do support non-contiguous regions, these allow the original
1966 logical block to be reconstructed, along with the set of address
1967 ranges.
1968
1969 One of the logical block fragments is arbitrarily chosen to be
1970 the ORIGIN. The other fragments will point to the origin via
1971 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1972 be null. The list of fragments will be chained through
1973 BLOCK_FRAGMENT_CHAIN from the origin. */
1974
1975 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1976 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1977
1978 /* For an inlined function, this gives the location where it was called
1979 from. This is only set in the top level block, which corresponds to the
1980 inlined function scope. This is used in the debug output routines. */
1981
1982 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1983
1984 /* This gives the location of the end of the block, useful to attach
1985 code implicitly generated for outgoing paths. */
1986
1987 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1988
1989 /* Define fields and accessors for nodes representing data types. */
1990
1991 /* See tree.def for documentation of the use of these fields.
1992 Look at the documentation of the various ..._TYPE tree codes.
1993
1994 Note that the type.values, type.minval, and type.maxval fields are
1995 overloaded and used for different macros in different kinds of types.
1996 Each macro must check to ensure the tree node is of the proper kind of
1997 type. Note also that some of the front-ends also overload these fields,
1998 so they must be checked as well. */
1999
2000 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2001 /* Type size in bits as a tree expression. Need not be constant and may
2002 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2003 class subobject with its own virtual base classes (which are laid out
2004 separately). */
2005 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2006 /* Likewise, type size in bytes. */
2007 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2008 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2009 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2010 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2011 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2012 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2013 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2014 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2015
2016 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2017 #define TYPE_MODE(NODE) \
2018 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2019 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2020 #define SCALAR_TYPE_MODE(NODE) \
2021 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2022 #define SCALAR_INT_TYPE_MODE(NODE) \
2023 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2024 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2025 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2026 #define SET_TYPE_MODE(NODE, MODE) \
2027 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2028
2029 extern machine_mode element_mode (const_tree);
2030 extern machine_mode vector_type_mode (const_tree);
2031 extern unsigned int vector_element_bits (const_tree);
2032 extern tree vector_element_bits_tree (const_tree);
2033
2034 /* The "canonical" type for this type node, which is used by frontends to
2035 compare the type for equality with another type. If two types are
2036 equal (based on the semantics of the language), then they will have
2037 equivalent TYPE_CANONICAL entries.
2038
2039 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2040 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2041 be used for comparison against other types. Instead, the type is
2042 said to require structural equality checks, described in
2043 TYPE_STRUCTURAL_EQUALITY_P.
2044
2045 For unqualified aggregate and function types the middle-end relies on
2046 TYPE_CANONICAL to tell whether two variables can be assigned
2047 to each other without a conversion. The middle-end also makes sure
2048 to assign the same alias-sets to the type partition with equal
2049 TYPE_CANONICAL of their unqualified variants. */
2050 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2051 /* Indicates that the type node requires structural equality
2052 checks. The compiler will need to look at the composition of the
2053 type to determine whether it is equal to another type, rather than
2054 just comparing canonical type pointers. For instance, we would need
2055 to look at the return and parameter types of a FUNCTION_TYPE
2056 node. */
2057 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2058 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2059 type node requires structural equality. */
2060 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2061
2062 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2063 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2064
2065 /* The (language-specific) typed-based alias set for this type.
2066 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2067 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2068 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2069 type can alias objects of any type. */
2070 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2071
2072 /* Nonzero iff the typed-based alias set for this type has been
2073 calculated. */
2074 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2075 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2076
2077 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2078 to this type. */
2079 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2080
2081 /* Raw access to the alignment field. */
2082 #define TYPE_ALIGN_RAW(NODE) \
2083 (TYPE_CHECK (NODE)->type_common.align)
2084
2085 /* The alignment necessary for objects of this type.
2086 The value is an int, measured in bits and must be a power of two.
2087 We support also an "alignment" of zero. */
2088 #define TYPE_ALIGN(NODE) \
2089 (TYPE_ALIGN_RAW (NODE) \
2090 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2091
2092 /* Specify that TYPE_ALIGN(NODE) is X. */
2093 #define SET_TYPE_ALIGN(NODE, X) \
2094 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2095
2096 /* 1 if the alignment for this type was requested by "aligned" attribute,
2097 0 if it is the default for this type. */
2098 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2099
2100 /* The alignment for NODE, in bytes. */
2101 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2102
2103 /* The minimum alignment necessary for objects of this type without
2104 warning. The value is an int, measured in bits. */
2105 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2106 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2107 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2108
2109 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2110 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2111 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2112
2113 /* If your language allows you to declare types, and you want debug info
2114 for them, then you need to generate corresponding TYPE_DECL nodes.
2115 These "stub" TYPE_DECL nodes have no name, and simply point at the
2116 type node. You then set the TYPE_STUB_DECL field of the type node
2117 to point back at the TYPE_DECL node. This allows the debug routines
2118 to know that the two nodes represent the same type, so that we only
2119 get one debug info record for them. */
2120 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2121
2122 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2123 the type has BLKmode only because it lacks the alignment required for
2124 its size. */
2125 #define TYPE_NO_FORCE_BLK(NODE) \
2126 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2127
2128 /* Nonzero in a type considered volatile as a whole. */
2129 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2130
2131 /* Nonzero in a type considered atomic as a whole. */
2132 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2133
2134 /* Means this type is const-qualified. */
2135 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2136
2137 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2138 the term. */
2139 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2140
2141 /* If nonzero, type's name shouldn't be emitted into debug info. */
2142 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2143
2144 /* The address space the type is in. */
2145 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2146
2147 /* Encode/decode the named memory support as part of the qualifier. If more
2148 than 8 qualifiers are added, these macros need to be adjusted. */
2149 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2150 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2151
2152 /* Return all qualifiers except for the address space qualifiers. */
2153 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2154
2155 /* Only keep the address space out of the qualifiers and discard the other
2156 qualifiers. */
2157 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2158
2159 /* The set of type qualifiers for this type. */
2160 #define TYPE_QUALS(NODE) \
2161 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2162 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2163 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2164 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2165 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2166
2167 /* The same as TYPE_QUALS without the address space qualifications. */
2168 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2169 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2170 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2171 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2172 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2173
2174 /* The same as TYPE_QUALS without the address space and atomic
2175 qualifications. */
2176 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2177 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2178 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2179 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2180
2181 /* These flags are available for each language front end to use internally. */
2182 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2183 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2184 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2185 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2186 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2187 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2188 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2189 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2190
2191 /* Used to keep track of visited nodes in tree traversals. This is set to
2192 0 by copy_node and make_node. */
2193 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2194
2195 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2196 that distinguish string from array of char).
2197 If set in a INTEGER_TYPE, indicates a character type. */
2198 #define TYPE_STRING_FLAG(NODE) \
2199 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2200
2201 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2202 to the C++ one definition rule. This is used for LTO canonical type
2203 computation. */
2204 #define TYPE_CXX_ODR_P(NODE) \
2205 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2206
2207 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2208 about missing conversions to other vector types of the same size. */
2209 #define TYPE_VECTOR_OPAQUE(NODE) \
2210 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2211
2212 /* Indicates that objects of this type must be initialized by calling a
2213 function when they are created. */
2214 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2215 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2216
2217 /* Indicates that a UNION_TYPE object should be passed the same way that
2218 the first union alternative would be passed, or that a RECORD_TYPE
2219 object should be passed the same way that the first (and only) member
2220 would be passed. */
2221 #define TYPE_TRANSPARENT_AGGR(NODE) \
2222 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2223
2224 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2225 address of a component of the type. This is the counterpart of
2226 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2227 #define TYPE_NONALIASED_COMPONENT(NODE) \
2228 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2229
2230 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2231 whether the array is typeless storage or the type contains a member
2232 with this flag set. Such types are exempt from type-based alias
2233 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2234 the flag should be inherited from the element type, can change
2235 when type is finalized and because of that should not be used in
2236 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2237 the flag should not be changed after the array is created and should
2238 be used in type hashing. */
2239 #define TYPE_TYPELESS_STORAGE(NODE) \
2240 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2241 ARRAY_TYPE)->type_common.typeless_storage)
2242
2243 /* Indicated that objects of this type should be laid out in as
2244 compact a way as possible. */
2245 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2246
2247 /* Used by type_contains_placeholder_p to avoid recomputation.
2248 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2249 this field directly. */
2250 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2251 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2252
2253 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2254 #define TYPE_FINAL_P(NODE) \
2255 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2256
2257 /* The debug output functions use the symtab union field to store
2258 information specific to the debugging format. The different debug
2259 output hooks store different types in the union field. These three
2260 macros are used to access different fields in the union. The debug
2261 hooks are responsible for consistently using only a specific
2262 macro. */
2263
2264 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2265 hold the type's number in the generated stabs. */
2266 #define TYPE_SYMTAB_ADDRESS(NODE) \
2267 (TYPE_CHECK (NODE)->type_common.symtab.address)
2268
2269 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2270 in dwarf2out.c to point to the DIE generated for the type. */
2271 #define TYPE_SYMTAB_DIE(NODE) \
2272 (TYPE_CHECK (NODE)->type_common.symtab.die)
2273
2274 /* The garbage collector needs to know the interpretation of the
2275 symtab field. These constants represent the different types in the
2276 union. */
2277
2278 #define TYPE_SYMTAB_IS_ADDRESS (0)
2279 #define TYPE_SYMTAB_IS_DIE (1)
2280
2281 #define TYPE_LANG_SPECIFIC(NODE) \
2282 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2283
2284 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2285 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2286 #define TYPE_FIELDS(NODE) \
2287 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2288 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2289 #define TYPE_ARG_TYPES(NODE) \
2290 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2291 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2292
2293 #define TYPE_MIN_VALUE(NODE) \
2294 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2295 #define TYPE_NEXT_PTR_TO(NODE) \
2296 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2297 #define TYPE_NEXT_REF_TO(NODE) \
2298 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2299 #define TYPE_VFIELD(NODE) \
2300 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2301 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2302
2303 #define TYPE_MAX_VALUE(NODE) \
2304 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2305 #define TYPE_METHOD_BASETYPE(NODE) \
2306 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2307 #define TYPE_OFFSET_BASETYPE(NODE) \
2308 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2309 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2310 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2311 allocated. */
2312 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2313 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2314 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2315 /* For record and union types, information about this type, as a base type
2316 for itself. */
2317 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2318
2319 /* For types, used in a language-dependent way. */
2320 #define TYPE_LANG_SLOT_1(NODE) \
2321 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2322
2323 /* Define accessor macros for information about type inheritance
2324 and basetypes.
2325
2326 A "basetype" means a particular usage of a data type for inheritance
2327 in another type. Each such basetype usage has its own "binfo"
2328 object to describe it. The binfo object is a TREE_VEC node.
2329
2330 Inheritance is represented by the binfo nodes allocated for a
2331 given type. For example, given types C and D, such that D is
2332 inherited by C, 3 binfo nodes will be allocated: one for describing
2333 the binfo properties of C, similarly one for D, and one for
2334 describing the binfo properties of D as a base type for C.
2335 Thus, given a pointer to class C, one can get a pointer to the binfo
2336 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2337
2338 /* BINFO specific flags. */
2339
2340 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2341 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2342
2343 /* Flags for language dependent use. */
2344 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2345 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2346 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2347 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2348 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2349 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2350 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2351
2352 /* The actual data type node being inherited in this basetype. */
2353 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2354
2355 /* The offset where this basetype appears in its containing type.
2356 BINFO_OFFSET slot holds the offset (in bytes)
2357 from the base of the complete object to the base of the part of the
2358 object that is allocated on behalf of this `type'.
2359 This is always 0 except when there is multiple inheritance. */
2360
2361 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2362 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2363
2364 /* The virtual function table belonging to this basetype. Virtual
2365 function tables provide a mechanism for run-time method dispatching.
2366 The entries of a virtual function table are language-dependent. */
2367
2368 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2369
2370 /* The virtual functions in the virtual function table. This is
2371 a TREE_LIST that is used as an initial approximation for building
2372 a virtual function table for this basetype. */
2373 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2374
2375 /* A vector of binfos for the direct basetypes inherited by this
2376 basetype.
2377
2378 If this basetype describes type D as inherited in C, and if the
2379 basetypes of D are E and F, then this vector contains binfos for
2380 inheritance of E and F by C. */
2381 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2382
2383 /* The number of basetypes for NODE. */
2384 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2385
2386 /* Accessor macro to get to the Nth base binfo of this binfo. */
2387 #define BINFO_BASE_BINFO(NODE,N) \
2388 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2389 #define BINFO_BASE_ITERATE(NODE,N,B) \
2390 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2391 #define BINFO_BASE_APPEND(NODE,T) \
2392 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2393
2394 /* For a BINFO record describing a virtual base class, i.e., one where
2395 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2396 base. The actual contents are language-dependent. In the C++
2397 front-end this field is an INTEGER_CST giving an offset into the
2398 vtable where the offset to the virtual base can be found. */
2399 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2400
2401 /* Indicates the accesses this binfo has to its bases. The values are
2402 access_public_node, access_protected_node or access_private_node.
2403 If this array is not present, public access is implied. */
2404 #define BINFO_BASE_ACCESSES(NODE) \
2405 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2406
2407 #define BINFO_BASE_ACCESS(NODE,N) \
2408 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2409 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2410 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2411
2412 /* The index in the VTT where this subobject's sub-VTT can be found.
2413 NULL_TREE if there is no sub-VTT. */
2414 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2415
2416 /* The index in the VTT where the vptr for this subobject can be
2417 found. NULL_TREE if there is no secondary vptr in the VTT. */
2418 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2419
2420 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2421 inheriting this base for non-virtual bases. For virtual bases it
2422 points either to the binfo for which this is a primary binfo, or to
2423 the binfo of the most derived type. */
2424 #define BINFO_INHERITANCE_CHAIN(NODE) \
2425 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2426
2427
2428 /* Define fields and accessors for nodes representing declared names. */
2429
2430 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2431 have an associated SSA name. */
2432 #define SSA_VAR_P(DECL) \
2433 (TREE_CODE (DECL) == VAR_DECL \
2434 || TREE_CODE (DECL) == PARM_DECL \
2435 || TREE_CODE (DECL) == RESULT_DECL \
2436 || TREE_CODE (DECL) == SSA_NAME)
2437
2438
2439 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2440
2441 /* This is the name of the object as written by the user.
2442 It is an IDENTIFIER_NODE. */
2443 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2444
2445 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2446 #define TYPE_IDENTIFIER(NODE) \
2447 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2448 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2449
2450 /* Every ..._DECL node gets a unique number. */
2451 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2452
2453 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2454 uses. */
2455 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2456
2457 /* Every ..._DECL node gets a unique number that stays the same even
2458 when the decl is copied by the inliner once it is set. */
2459 #define DECL_PT_UID(NODE) \
2460 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2461 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2462 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2463 #define SET_DECL_PT_UID(NODE, UID) \
2464 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2465 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2466 be preserved when copyin the decl. */
2467 #define DECL_PT_UID_SET_P(NODE) \
2468 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2469
2470 /* These two fields describe where in the source code the declaration
2471 was. If the declaration appears in several places (as for a C
2472 function that is declared first and then defined later), this
2473 information should refer to the definition. */
2474 #define DECL_SOURCE_LOCATION(NODE) \
2475 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2476 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2477 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2478 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2479 /* This decl was created by a front-end or back-end rather than by
2480 user code, and has not been explicitly declared by the user -- when
2481 that happens the source location is updated to the user's
2482 source. This includes decls with no location (!). */
2483 #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2484 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2485
2486 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2487 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2488 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2489 nodes, this points to either the FUNCTION_DECL for the containing
2490 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2491 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2492 scope". In particular, for VAR_DECLs which are virtual table pointers
2493 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2494 they belong to. */
2495 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2496 #define DECL_FIELD_CONTEXT(NODE) \
2497 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2498
2499 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2500 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2501
2502 /* For any sort of a ..._DECL node, this points to the original (abstract)
2503 decl node which this decl is an inlined/cloned instance of, or else it
2504 is NULL indicating that this decl is not an instance of some other decl.
2505
2506 The C front-end also uses this in a nested declaration of an inline
2507 function, to point back to the definition. */
2508 #define DECL_ABSTRACT_ORIGIN(NODE) \
2509 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2510
2511 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2512 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2513 #define DECL_ORIGIN(NODE) \
2514 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2515
2516 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2517 inline instance of some original (abstract) decl from an inline function;
2518 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2519 nodes can also have their abstract origin set to themselves. */
2520 #define DECL_FROM_INLINE(NODE) \
2521 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2522 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2523
2524 /* In a DECL this is the field where attributes are stored. */
2525 #define DECL_ATTRIBUTES(NODE) \
2526 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2527
2528 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2529 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2530 For a VAR_DECL, holds the initial value.
2531 For a PARM_DECL, used for DECL_ARG_TYPE--default
2532 values for parameters are encoded in the type of the function,
2533 not in the PARM_DECL slot.
2534 For a FIELD_DECL, this is used for enumeration values and the C
2535 frontend uses it for temporarily storing bitwidth of bitfields.
2536
2537 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2538 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2539
2540 /* Holds the size of the datum, in bits, as a tree expression.
2541 Need not be constant and may be null. May be less than TYPE_SIZE
2542 for a C++ FIELD_DECL representing a base class subobject with its
2543 own virtual base classes (which are laid out separately). */
2544 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2545 /* Likewise for the size in bytes. */
2546 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2547 #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2548 /* Returns the alignment required for the datum, in bits. It must
2549 be a power of two, but an "alignment" of zero is supported
2550 (e.g. as "uninitialized" sentinel). */
2551 #define DECL_ALIGN(NODE) \
2552 (DECL_ALIGN_RAW (NODE) \
2553 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2554 /* Specify that DECL_ALIGN(NODE) is X. */
2555 #define SET_DECL_ALIGN(NODE, X) \
2556 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2557
2558 /* The minimum alignment necessary for the datum, in bits, without
2559 warning. */
2560 #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2561 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2562 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2563 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2564 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2565
2566 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2567 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2568 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2569
2570 /* The alignment of NODE, in bytes. */
2571 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2572 /* Set if the alignment of this DECL has been set by the user, for
2573 example with an 'aligned' attribute. */
2574 #define DECL_USER_ALIGN(NODE) \
2575 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2576 /* Holds the machine mode corresponding to the declaration of a variable or
2577 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2578 FIELD_DECL. */
2579 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2580 #define SET_DECL_MODE(NODE, MODE) \
2581 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2582
2583 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2584 operation it is. This is only intended for low-level accesses;
2585 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2586 should be used instead. */
2587 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2588 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2589
2590 /* Test if FCODE is a function code for an alloca operation. */
2591 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2592 ((FCODE) == BUILT_IN_ALLOCA \
2593 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2594 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2595
2596 /* Generate case for an alloca operation. */
2597 #define CASE_BUILT_IN_ALLOCA \
2598 case BUILT_IN_ALLOCA: \
2599 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2600 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2601
2602 #define DECL_FUNCTION_PERSONALITY(NODE) \
2603 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2604
2605 /* Nonzero for a given ..._DECL node means that the name of this node should
2606 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2607 the associated type should be ignored. For a FUNCTION_DECL, the body of
2608 the function should also be ignored. */
2609 #define DECL_IGNORED_P(NODE) \
2610 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2611
2612 /* Nonzero for a given ..._DECL node means that this node represents an
2613 "abstract instance" of the given declaration (e.g. in the original
2614 declaration of an inline function). When generating symbolic debugging
2615 information, we mustn't try to generate any address information for nodes
2616 marked as "abstract instances" because we don't actually generate
2617 any code or allocate any data space for such instances. */
2618 #define DECL_ABSTRACT_P(NODE) \
2619 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2620
2621 /* Language-specific decl information. */
2622 #define DECL_LANG_SPECIFIC(NODE) \
2623 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2624
2625 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2626 do not allocate storage, and refer to a definition elsewhere. Note that
2627 this does not necessarily imply the entity represented by NODE
2628 has no program source-level definition in this translation unit. For
2629 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2630 DECL_EXTERNAL may be true simultaneously; that can be the case for
2631 a C99 "extern inline" function. */
2632 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2633
2634 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2635 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2636
2637 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2638
2639 Also set in some languages for variables, etc., outside the normal
2640 lexical scope, such as class instance variables. */
2641 #define DECL_NONLOCAL(NODE) \
2642 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2643
2644 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2645 Used in FIELD_DECLs for vtable pointers.
2646 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2647 #define DECL_VIRTUAL_P(NODE) \
2648 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2649
2650 /* Used to indicate that this DECL represents a compiler-generated entity. */
2651 #define DECL_ARTIFICIAL(NODE) \
2652 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2653
2654 /* Additional flags for language-specific uses. */
2655 #define DECL_LANG_FLAG_0(NODE) \
2656 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2657 #define DECL_LANG_FLAG_1(NODE) \
2658 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2659 #define DECL_LANG_FLAG_2(NODE) \
2660 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2661 #define DECL_LANG_FLAG_3(NODE) \
2662 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2663 #define DECL_LANG_FLAG_4(NODE) \
2664 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2665 #define DECL_LANG_FLAG_5(NODE) \
2666 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2667 #define DECL_LANG_FLAG_6(NODE) \
2668 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2669 #define DECL_LANG_FLAG_7(NODE) \
2670 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2671 #define DECL_LANG_FLAG_8(NODE) \
2672 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2673
2674 /* Nonzero for a scope which is equal to file scope. */
2675 #define SCOPE_FILE_SCOPE_P(EXP) \
2676 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2677 /* Nonzero for a decl which is at file scope. */
2678 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2679 /* Nonzero for a type which is at file scope. */
2680 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2681
2682 /* Nonzero for a decl that is decorated using attribute used.
2683 This indicates to compiler tools that this decl needs to be preserved. */
2684 #define DECL_PRESERVE_P(DECL) \
2685 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2686
2687 /* Nonzero for a decl that is decorated with the "noinit" attribute.
2688 decls with this attribute are placed into the ".noinit" section, so they are
2689 not initialized by the target's startup code. */
2690 #define DECL_NOINIT_P(DECL) \
2691 (DECL_P (DECL) \
2692 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2693
2694 /* Nonzero for a decl that is decorated with the "persistent" attribute.
2695 decls with this attribute are placed into the ".persistent" section, so they
2696 are not initialized by the target's startup code. */
2697 #define DECL_PERSISTENT_P(DECL) \
2698 (DECL_P (DECL) \
2699 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2700
2701 /* For function local variables of COMPLEX and VECTOR types,
2702 indicates that the variable is not aliased, and that all
2703 modifications to the variable have been adjusted so that
2704 they are killing assignments. Thus the variable may now
2705 be treated as a GIMPLE register, and use real instead of
2706 virtual ops in SSA form. */
2707 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2708 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2709
2710 extern tree decl_value_expr_lookup (tree);
2711 extern void decl_value_expr_insert (tree, tree);
2712
2713 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2714 if transformations have made this more complicated than evaluating the
2715 decl itself. */
2716 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2717 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2718 ->decl_common.decl_flag_2)
2719 #define DECL_VALUE_EXPR(NODE) \
2720 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2721 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2722 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2723
2724 /* Holds the RTL expression for the value of a variable or function.
2725 This value can be evaluated lazily for functions, variables with
2726 static storage duration, and labels. */
2727 #define DECL_RTL(NODE) \
2728 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2729 ? (NODE)->decl_with_rtl.rtl \
2730 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2731
2732 /* Set the DECL_RTL for NODE to RTL. */
2733 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2734
2735 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2736 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2737
2738 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2739 #define DECL_RTL_SET_P(NODE) \
2740 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2741
2742 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2743 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2744 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2745 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2746 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2747
2748 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2749 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2750
2751 #if (GCC_VERSION >= 2007)
2752 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2753 ({ tree const __d = (decl); \
2754 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2755 /* Dereference it so the compiler knows it can't be NULL even \
2756 without assertion checking. */ \
2757 &*DECL_RTL_IF_SET (__d); })
2758 #else
2759 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2760 #endif
2761
2762 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2763 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2764
2765 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2766 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2767 of the structure. */
2768 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2769
2770 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2771 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2772 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2773 natural alignment of the field's type). */
2774 #define DECL_FIELD_BIT_OFFSET(NODE) \
2775 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2776
2777 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2778 if so, the type that was originally specified for it.
2779 TREE_TYPE may have been modified (in finish_struct). */
2780 #define DECL_BIT_FIELD_TYPE(NODE) \
2781 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2782
2783 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2784 representative FIELD_DECL. */
2785 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2786 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2787
2788 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2789 if nonzero, indicates that the field occupies the type. */
2790 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2791
2792 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2793 DECL_FIELD_OFFSET which are known to be always zero.
2794 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2795 has. */
2796 #define DECL_OFFSET_ALIGN(NODE) \
2797 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2798
2799 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2800 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2801 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2802
2803 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2804 which this FIELD_DECL is defined. This information is needed when
2805 writing debugging information about vfield and vbase decls for C++. */
2806 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2807
2808 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2809 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2810
2811 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
2812 like passing/returning containing struct by value.
2813 Set for C++17 empty base artificial FIELD_DECLs as well as
2814 empty [[no_unique_address]] non-static data members. */
2815 #define DECL_FIELD_ABI_IGNORED(NODE) \
2816 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2817
2818 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2819 specially. */
2820 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2821
2822 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2823 this component. This makes it possible for Type-Based Alias Analysis
2824 to disambiguate accesses to this field with indirect accesses using
2825 the field's type:
2826
2827 struct S { int i; } s;
2828 int *p;
2829
2830 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2831
2832 From the implementation's viewpoint, the alias set of the type of the
2833 field 'i' (int) will not be recorded as a subset of that of the type of
2834 's' (struct S) in record_component_aliases. The counterpart is that
2835 accesses to s.i must not be given the alias set of the type of 'i'
2836 (int) but instead directly that of the type of 's' (struct S). */
2837 #define DECL_NONADDRESSABLE_P(NODE) \
2838 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2839
2840 /* Used in a FIELD_DECL to indicate that this field is padding. */
2841 #define DECL_PADDING_P(NODE) \
2842 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2843
2844 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2845 dense, unique within any one function, and may be used to index arrays.
2846 If the value is -1, then no UID has been assigned. */
2847 #define LABEL_DECL_UID(NODE) \
2848 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2849
2850 /* In a LABEL_DECL, the EH region number for which the label is the
2851 post_landing_pad. */
2852 #define EH_LANDING_PAD_NR(NODE) \
2853 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2854
2855 /* For a PARM_DECL, records the data type used to pass the argument,
2856 which may be different from the type seen in the program. */
2857 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2858
2859 /* For PARM_DECL, holds an RTL for the stack slot or register
2860 where the data was actually passed. */
2861 #define DECL_INCOMING_RTL(NODE) \
2862 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2863
2864 /* Nonzero for a given ..._DECL node means that no warnings should be
2865 generated just because this node is unused. */
2866 #define DECL_IN_SYSTEM_HEADER(NODE) \
2867 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2868
2869 /* Used to indicate that the linkage status of this DECL is not yet known,
2870 so it should not be output now. */
2871 #define DECL_DEFER_OUTPUT(NODE) \
2872 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2873
2874 /* In a VAR_DECL that's static,
2875 nonzero if the space is in the text section. */
2876 #define DECL_IN_TEXT_SECTION(NODE) \
2877 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2878
2879 /* In a VAR_DECL that's static,
2880 nonzero if it belongs to the global constant pool. */
2881 #define DECL_IN_CONSTANT_POOL(NODE) \
2882 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2883
2884 /* Nonzero for a given ..._DECL node means that this node should be
2885 put in .common, if possible. If a DECL_INITIAL is given, and it
2886 is not error_mark_node, then the decl cannot be put in .common. */
2887 #define DECL_COMMON(NODE) \
2888 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2889
2890 /* In a VAR_DECL, nonzero if the decl is a register variable with
2891 an explicit asm specification. */
2892 #define DECL_HARD_REGISTER(NODE) \
2893 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2894
2895 /* Used to indicate that this DECL has weak linkage. */
2896 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2897
2898 /* Used to indicate that the DECL is a dllimport. */
2899 #define DECL_DLLIMPORT_P(NODE) \
2900 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2901
2902 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2903 not be put out unless it is needed in this translation unit.
2904 Entities like this are shared across translation units (like weak
2905 entities), but are guaranteed to be generated by any translation
2906 unit that needs them, and therefore need not be put out anywhere
2907 where they are not needed. DECL_COMDAT is just a hint to the
2908 back-end; it is up to front-ends which set this flag to ensure
2909 that there will never be any harm, other than bloat, in putting out
2910 something which is DECL_COMDAT. */
2911 #define DECL_COMDAT(NODE) \
2912 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2913
2914 #define DECL_COMDAT_GROUP(NODE) \
2915 decl_comdat_group (NODE)
2916
2917 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2918 multiple translation units should be merged. */
2919 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2920 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2921
2922 /* The name of the object as the assembler will see it (but before any
2923 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2924 as DECL_NAME. It is an IDENTIFIER_NODE.
2925
2926 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2927 One Definition Rule based type merging at LTO. It is computed only for
2928 LTO compilation and C++. */
2929 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2930
2931 /* Raw accessor for DECL_ASSEMBLE_NAME. */
2932 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
2933 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
2934
2935 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2936 This is true of all DECL nodes except FIELD_DECL. */
2937 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2938 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2939
2940 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2941 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2942 yet. */
2943 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2944 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
2945
2946 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2947 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2948 overwrite_decl_assembler_name (NODE, NAME)
2949
2950 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
2951 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
2952 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
2953 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
2954 other words, the semantics of using this macro, are different than
2955 saying:
2956
2957 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
2958
2959 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
2960
2961 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
2962 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
2963
2964 /* Records the section name in a section attribute. Used to pass
2965 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2966 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2967
2968 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2969 this variable in a BIND_EXPR. */
2970 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2971 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2972
2973 /* Value of the decls's visibility attribute */
2974 #define DECL_VISIBILITY(NODE) \
2975 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2976
2977 /* Nonzero means that the decl (or an enclosing scope) had its
2978 visibility specified rather than being inferred. */
2979 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2980 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2981
2982 /* In a VAR_DECL, the model to use if the data should be allocated from
2983 thread-local storage. */
2984 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2985
2986 /* In a VAR_DECL, nonzero if the data should be allocated from
2987 thread-local storage. */
2988 #define DECL_THREAD_LOCAL_P(NODE) \
2989 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2990
2991 /* In a non-local VAR_DECL with static storage duration, true if the
2992 variable has an initialization priority. If false, the variable
2993 will be initialized at the DEFAULT_INIT_PRIORITY. */
2994 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2995 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2996
2997 extern tree decl_debug_expr_lookup (tree);
2998 extern void decl_debug_expr_insert (tree, tree);
2999
3000 /* For VAR_DECL, this is set to an expression that it was split from. */
3001 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
3002 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3003 #define DECL_DEBUG_EXPR(NODE) \
3004 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3005
3006 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3007 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3008
3009 extern priority_type decl_init_priority_lookup (tree);
3010 extern priority_type decl_fini_priority_lookup (tree);
3011 extern void decl_init_priority_insert (tree, priority_type);
3012 extern void decl_fini_priority_insert (tree, priority_type);
3013
3014 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3015 NODE. */
3016 #define DECL_INIT_PRIORITY(NODE) \
3017 (decl_init_priority_lookup (NODE))
3018 /* Set the initialization priority for NODE to VAL. */
3019 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3020 (decl_init_priority_insert (NODE, VAL))
3021
3022 /* For a FUNCTION_DECL the finalization priority of NODE. */
3023 #define DECL_FINI_PRIORITY(NODE) \
3024 (decl_fini_priority_lookup (NODE))
3025 /* Set the finalization priority for NODE to VAL. */
3026 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3027 (decl_fini_priority_insert (NODE, VAL))
3028
3029 /* The initialization priority for entities for which no explicit
3030 initialization priority has been specified. */
3031 #define DEFAULT_INIT_PRIORITY 65535
3032
3033 /* The maximum allowed initialization priority. */
3034 #define MAX_INIT_PRIORITY 65535
3035
3036 /* The largest priority value reserved for use by system runtime
3037 libraries. */
3038 #define MAX_RESERVED_INIT_PRIORITY 100
3039
3040 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3041 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3042 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3043
3044 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3045 #define DECL_NONLOCAL_FRAME(NODE) \
3046 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3047
3048 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3049 #define DECL_NONALIASED(NODE) \
3050 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3051
3052 /* This field is used to reference anything in decl.result and is meant only
3053 for use by the garbage collector. */
3054 #define DECL_RESULT_FLD(NODE) \
3055 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3056
3057 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3058 Before the struct containing the FUNCTION_DECL is laid out,
3059 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3060 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3061 function. When the class is laid out, this pointer is changed
3062 to an INTEGER_CST node which is suitable for use as an index
3063 into the virtual function table. */
3064 #define DECL_VINDEX(NODE) \
3065 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3066
3067 /* In FUNCTION_DECL, holds the decl for the return value. */
3068 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3069
3070 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3071 #define DECL_UNINLINABLE(NODE) \
3072 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3073
3074 /* In a FUNCTION_DECL, the saved representation of the body of the
3075 entire function. */
3076 #define DECL_SAVED_TREE(NODE) \
3077 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3078
3079 /* Nonzero in a FUNCTION_DECL means this function should be treated
3080 as if it were a malloc, meaning it returns a pointer that is
3081 not an alias. */
3082 #define DECL_IS_MALLOC(NODE) \
3083 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3084
3085 /* Macro for direct set and get of function_decl.decl_type. */
3086 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3087 (NODE->function_decl.decl_type)
3088
3089 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3090 it to NONE. */
3091
3092 static inline void
set_function_decl_type(tree decl,function_decl_type t,bool set)3093 set_function_decl_type (tree decl, function_decl_type t, bool set)
3094 {
3095 if (set)
3096 {
3097 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl) == NONE
3098 || FUNCTION_DECL_DECL_TYPE (decl) == t);
3099 decl->function_decl.decl_type = t;
3100 }
3101 else if (FUNCTION_DECL_DECL_TYPE (decl) == t)
3102 FUNCTION_DECL_DECL_TYPE (decl) = NONE;
3103 }
3104
3105 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3106 function (like replaceable operators new or delete). */
3107 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3108 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3109
3110 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3111 C++ operator new, meaning that it returns a pointer for which we
3112 should not use type based aliasing. */
3113 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3114 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_NEW)
3115
3116 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3117 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3118
3119 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3120 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3121
3122 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3123 C++ operator delete. */
3124 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3125 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_DELETE)
3126
3127 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3128 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3129
3130 /* Nonzero in a FUNCTION_DECL means this function may return more
3131 than once. */
3132 #define DECL_IS_RETURNS_TWICE(NODE) \
3133 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3134
3135 /* Nonzero in a FUNCTION_DECL means this function should be treated
3136 as "pure" function (like const function, but may read global memory). */
3137 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3138
3139 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3140 the const or pure function may not terminate. When this is nonzero
3141 for a const or pure function, it can be dealt with by cse passes
3142 but cannot be removed by dce passes since you are not allowed to
3143 change an infinite looping program into one that terminates without
3144 error. */
3145 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3146 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3147
3148 /* Nonzero in a FUNCTION_DECL means this function should be treated
3149 as "novops" function (function that does not read global memory,
3150 but may have arbitrary side effects). */
3151 #define DECL_IS_NOVOPS(NODE) \
3152 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3153
3154 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3155 at the beginning or end of execution. */
3156 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3157 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3158
3159 #define DECL_STATIC_DESTRUCTOR(NODE) \
3160 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3161
3162 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3163 be instrumented with calls to support routines. */
3164 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3165 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3166
3167 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3168 disabled in this function. */
3169 #define DECL_NO_LIMIT_STACK(NODE) \
3170 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3171
3172 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3173 #define DECL_STATIC_CHAIN(NODE) \
3174 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3175
3176 /* Nonzero for a decl that cgraph has decided should be inlined into
3177 at least one call site. It is not meaningful to look at this
3178 directly; always use cgraph_function_possibly_inlined_p. */
3179 #define DECL_POSSIBLY_INLINED(DECL) \
3180 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3181
3182 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3183 such as via the `inline' keyword in C/C++. This flag controls the linkage
3184 semantics of 'inline' */
3185 #define DECL_DECLARED_INLINE_P(NODE) \
3186 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3187
3188 /* Nonzero in a FUNCTION_DECL means this function should not get
3189 -Winline warnings. */
3190 #define DECL_NO_INLINE_WARNING_P(NODE) \
3191 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3192
3193 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3194 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3195 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3196
3197 /* Nonzero if a FUNCTION_CODE is a TM load. */
3198 #define BUILTIN_TM_LOAD_P(FN) \
3199 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3200
3201 /* Nonzero if a FUNCTION_CODE is a TM store. */
3202 #define BUILTIN_TM_STORE_P(FN) \
3203 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3204
3205 #define CASE_BUILT_IN_TM_LOAD(FN) \
3206 case BUILT_IN_TM_LOAD_##FN: \
3207 case BUILT_IN_TM_LOAD_RAR_##FN: \
3208 case BUILT_IN_TM_LOAD_RAW_##FN: \
3209 case BUILT_IN_TM_LOAD_RFW_##FN
3210
3211 #define CASE_BUILT_IN_TM_STORE(FN) \
3212 case BUILT_IN_TM_STORE_##FN: \
3213 case BUILT_IN_TM_STORE_WAR_##FN: \
3214 case BUILT_IN_TM_STORE_WAW_##FN
3215
3216 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3217 disregarding size and cost heuristics. This is equivalent to using
3218 the always_inline attribute without the required diagnostics if the
3219 function cannot be inlined. */
3220 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3221 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3222
3223 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
3224 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
3225
3226 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3227 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3228 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3229
3230 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3231 that describes the status of this function. */
3232 #define DECL_STRUCT_FUNCTION(NODE) \
3233 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3234
3235 /* For a builtin function, identify which part of the compiler defined it. */
3236 #define DECL_BUILT_IN_CLASS(NODE) \
3237 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3238
3239 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3240 #define DECL_ARGUMENTS(NODE) \
3241 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3242
3243 /* In FUNCTION_DECL, the function specific target options to use when compiling
3244 this function. */
3245 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3246 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3247
3248 /* In FUNCTION_DECL, the function specific optimization options to use when
3249 compiling this function. */
3250 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3251 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3252
3253 /* In FUNCTION_DECL, this is set if this function has other versions generated
3254 using "target" attributes. The default version is the one which does not
3255 have any "target" attribute set. */
3256 #define DECL_FUNCTION_VERSIONED(NODE)\
3257 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3258
3259 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3260 Devirtualization machinery uses this knowledge for determing type of the
3261 object constructed. Also we assume that constructor address is not
3262 important. */
3263 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3264 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3265
3266 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3267 Devirtualization machinery uses this to track types in destruction. */
3268 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3269 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3270
3271 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3272 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3273 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == LAMBDA_FUNCTION)
3274
3275 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3276 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3277
3278 /* In FUNCTION_DECL that represent an virtual method this is set when
3279 the method is final. */
3280 #define DECL_FINAL_P(NODE)\
3281 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3282
3283 /* The source language of the translation-unit. */
3284 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3285 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3286
3287 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3288
3289 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3290 #define DECL_ORIGINAL_TYPE(NODE) \
3291 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3292
3293 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3294 into stabs. Instead it will generate cross reference ('x') of names.
3295 This uses the same flag as DECL_EXTERNAL. */
3296 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3297 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3298
3299 /* Getter of the imported declaration associated to the
3300 IMPORTED_DECL node. */
3301 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3302 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3303
3304 /* Getter of the symbol declaration associated with the
3305 NAMELIST_DECL node. */
3306 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3307 (DECL_INITIAL (NODE))
3308
3309 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3310 To reduce overhead, the nodes containing the statements are not trees.
3311 This avoids the overhead of tree_common on all linked list elements.
3312
3313 Use the interface in tree-iterator.h to access this node. */
3314
3315 #define STATEMENT_LIST_HEAD(NODE) \
3316 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3317 #define STATEMENT_LIST_TAIL(NODE) \
3318 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3319
3320 #define TREE_OPTIMIZATION(NODE) \
3321 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3322
3323 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3324 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3325
3326 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3327 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3328
3329 /* Return a tree node that encapsulates the optimization options in OPTS
3330 and OPTS_SET. */
3331 extern tree build_optimization_node (struct gcc_options *opts,
3332 struct gcc_options *opts_set);
3333
3334 #define TREE_TARGET_OPTION(NODE) \
3335 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3336
3337 #define TREE_TARGET_GLOBALS(NODE) \
3338 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3339
3340 /* Return a tree node that encapsulates the target options in OPTS and
3341 OPTS_SET. */
3342 extern tree build_target_option_node (struct gcc_options *opts,
3343 struct gcc_options *opts_set);
3344
3345 extern void prepare_target_option_nodes_for_pch (void);
3346
3347 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3348
3349 inline tree
tree_check(tree __t,const char * __f,int __l,const char * __g,tree_code __c)3350 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3351 {
3352 if (TREE_CODE (__t) != __c)
3353 tree_check_failed (__t, __f, __l, __g, __c, 0);
3354 return __t;
3355 }
3356
3357 inline tree
tree_not_check(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c)3358 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3359 enum tree_code __c)
3360 {
3361 if (TREE_CODE (__t) == __c)
3362 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3363 return __t;
3364 }
3365
3366 inline tree
tree_check2(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2)3367 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3368 enum tree_code __c1, enum tree_code __c2)
3369 {
3370 if (TREE_CODE (__t) != __c1
3371 && TREE_CODE (__t) != __c2)
3372 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3373 return __t;
3374 }
3375
3376 inline tree
tree_not_check2(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2)3377 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3378 enum tree_code __c1, enum tree_code __c2)
3379 {
3380 if (TREE_CODE (__t) == __c1
3381 || TREE_CODE (__t) == __c2)
3382 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3383 return __t;
3384 }
3385
3386 inline tree
tree_check3(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3)3387 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3388 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3389 {
3390 if (TREE_CODE (__t) != __c1
3391 && TREE_CODE (__t) != __c2
3392 && TREE_CODE (__t) != __c3)
3393 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3394 return __t;
3395 }
3396
3397 inline tree
tree_not_check3(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3)3398 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3399 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3400 {
3401 if (TREE_CODE (__t) == __c1
3402 || TREE_CODE (__t) == __c2
3403 || TREE_CODE (__t) == __c3)
3404 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3405 return __t;
3406 }
3407
3408 inline tree
tree_check4(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4)3409 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3410 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3411 enum tree_code __c4)
3412 {
3413 if (TREE_CODE (__t) != __c1
3414 && TREE_CODE (__t) != __c2
3415 && TREE_CODE (__t) != __c3
3416 && TREE_CODE (__t) != __c4)
3417 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3418 return __t;
3419 }
3420
3421 inline tree
tree_not_check4(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4)3422 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3423 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3424 enum tree_code __c4)
3425 {
3426 if (TREE_CODE (__t) == __c1
3427 || TREE_CODE (__t) == __c2
3428 || TREE_CODE (__t) == __c3
3429 || TREE_CODE (__t) == __c4)
3430 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3431 return __t;
3432 }
3433
3434 inline tree
tree_check5(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4,enum tree_code __c5)3435 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3436 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3437 enum tree_code __c4, enum tree_code __c5)
3438 {
3439 if (TREE_CODE (__t) != __c1
3440 && TREE_CODE (__t) != __c2
3441 && TREE_CODE (__t) != __c3
3442 && TREE_CODE (__t) != __c4
3443 && TREE_CODE (__t) != __c5)
3444 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3445 return __t;
3446 }
3447
3448 inline tree
tree_not_check5(tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4,enum tree_code __c5)3449 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3450 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3451 enum tree_code __c4, enum tree_code __c5)
3452 {
3453 if (TREE_CODE (__t) == __c1
3454 || TREE_CODE (__t) == __c2
3455 || TREE_CODE (__t) == __c3
3456 || TREE_CODE (__t) == __c4
3457 || TREE_CODE (__t) == __c5)
3458 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3459 return __t;
3460 }
3461
3462 inline tree
contains_struct_check(tree __t,const enum tree_node_structure_enum __s,const char * __f,int __l,const char * __g)3463 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3464 const char *__f, int __l, const char *__g)
3465 {
3466 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3467 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3468 return __t;
3469 }
3470
3471 inline tree
tree_class_check(tree __t,const enum tree_code_class __class,const char * __f,int __l,const char * __g)3472 tree_class_check (tree __t, const enum tree_code_class __class,
3473 const char *__f, int __l, const char *__g)
3474 {
3475 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3476 tree_class_check_failed (__t, __class, __f, __l, __g);
3477 return __t;
3478 }
3479
3480 inline tree
tree_range_check(tree __t,enum tree_code __code1,enum tree_code __code2,const char * __f,int __l,const char * __g)3481 tree_range_check (tree __t,
3482 enum tree_code __code1, enum tree_code __code2,
3483 const char *__f, int __l, const char *__g)
3484 {
3485 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3486 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3487 return __t;
3488 }
3489
3490 inline tree
omp_clause_subcode_check(tree __t,enum omp_clause_code __code,const char * __f,int __l,const char * __g)3491 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3492 const char *__f, int __l, const char *__g)
3493 {
3494 if (TREE_CODE (__t) != OMP_CLAUSE)
3495 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3496 if (__t->omp_clause.code != __code)
3497 omp_clause_check_failed (__t, __f, __l, __g, __code);
3498 return __t;
3499 }
3500
3501 inline tree
omp_clause_range_check(tree __t,enum omp_clause_code __code1,enum omp_clause_code __code2,const char * __f,int __l,const char * __g)3502 omp_clause_range_check (tree __t,
3503 enum omp_clause_code __code1,
3504 enum omp_clause_code __code2,
3505 const char *__f, int __l, const char *__g)
3506 {
3507 if (TREE_CODE (__t) != OMP_CLAUSE)
3508 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3509 if ((int) __t->omp_clause.code < (int) __code1
3510 || (int) __t->omp_clause.code > (int) __code2)
3511 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3512 return __t;
3513 }
3514
3515 /* These checks have to be special cased. */
3516
3517 inline tree
expr_check(tree __t,const char * __f,int __l,const char * __g)3518 expr_check (tree __t, const char *__f, int __l, const char *__g)
3519 {
3520 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3521 if (!IS_EXPR_CODE_CLASS (__c))
3522 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3523 return __t;
3524 }
3525
3526 /* These checks have to be special cased. */
3527
3528 inline tree
non_type_check(tree __t,const char * __f,int __l,const char * __g)3529 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3530 {
3531 if (TYPE_P (__t))
3532 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3533 return __t;
3534 }
3535
3536 inline const HOST_WIDE_INT *
tree_int_cst_elt_check(const_tree __t,int __i,const char * __f,int __l,const char * __g)3537 tree_int_cst_elt_check (const_tree __t, int __i,
3538 const char *__f, int __l, const char *__g)
3539 {
3540 if (TREE_CODE (__t) != INTEGER_CST)
3541 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3542 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3543 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3544 __f, __l, __g);
3545 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3546 }
3547
3548 inline HOST_WIDE_INT *
tree_int_cst_elt_check(tree __t,int __i,const char * __f,int __l,const char * __g)3549 tree_int_cst_elt_check (tree __t, int __i,
3550 const char *__f, int __l, const char *__g)
3551 {
3552 if (TREE_CODE (__t) != INTEGER_CST)
3553 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3554 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3555 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3556 __f, __l, __g);
3557 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3558 }
3559
3560 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3561
3562 # if GCC_VERSION >= 4006
3563 #pragma GCC diagnostic push
3564 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3565 #endif
3566
3567 inline tree *
tree_vec_elt_check(tree __t,int __i,const char * __f,int __l,const char * __g)3568 tree_vec_elt_check (tree __t, int __i,
3569 const char *__f, int __l, const char *__g)
3570 {
3571 if (TREE_CODE (__t) != TREE_VEC)
3572 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3573 if (__i < 0 || __i >= __t->base.u.length)
3574 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3575 return &CONST_CAST_TREE (__t)->vec.a[__i];
3576 }
3577
3578 # if GCC_VERSION >= 4006
3579 #pragma GCC diagnostic pop
3580 #endif
3581
3582 inline tree *
omp_clause_elt_check(tree __t,int __i,const char * __f,int __l,const char * __g)3583 omp_clause_elt_check (tree __t, int __i,
3584 const char *__f, int __l, const char *__g)
3585 {
3586 if (TREE_CODE (__t) != OMP_CLAUSE)
3587 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3588 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3589 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3590 return &__t->omp_clause.ops[__i];
3591 }
3592
3593 /* These checks have to be special cased. */
3594
3595 inline tree
any_integral_type_check(tree __t,const char * __f,int __l,const char * __g)3596 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3597 {
3598 if (!ANY_INTEGRAL_TYPE_P (__t))
3599 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3600 INTEGER_TYPE, 0);
3601 return __t;
3602 }
3603
3604 inline const_tree
tree_check(const_tree __t,const char * __f,int __l,const char * __g,tree_code __c)3605 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3606 tree_code __c)
3607 {
3608 if (TREE_CODE (__t) != __c)
3609 tree_check_failed (__t, __f, __l, __g, __c, 0);
3610 return __t;
3611 }
3612
3613 inline const_tree
tree_not_check(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c)3614 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3615 enum tree_code __c)
3616 {
3617 if (TREE_CODE (__t) == __c)
3618 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3619 return __t;
3620 }
3621
3622 inline const_tree
tree_check2(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2)3623 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3624 enum tree_code __c1, enum tree_code __c2)
3625 {
3626 if (TREE_CODE (__t) != __c1
3627 && TREE_CODE (__t) != __c2)
3628 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3629 return __t;
3630 }
3631
3632 inline const_tree
tree_not_check2(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2)3633 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3634 enum tree_code __c1, enum tree_code __c2)
3635 {
3636 if (TREE_CODE (__t) == __c1
3637 || TREE_CODE (__t) == __c2)
3638 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3639 return __t;
3640 }
3641
3642 inline const_tree
tree_check3(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3)3643 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3644 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3645 {
3646 if (TREE_CODE (__t) != __c1
3647 && TREE_CODE (__t) != __c2
3648 && TREE_CODE (__t) != __c3)
3649 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3650 return __t;
3651 }
3652
3653 inline const_tree
tree_not_check3(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3)3654 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3655 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3656 {
3657 if (TREE_CODE (__t) == __c1
3658 || TREE_CODE (__t) == __c2
3659 || TREE_CODE (__t) == __c3)
3660 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3661 return __t;
3662 }
3663
3664 inline const_tree
tree_check4(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4)3665 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3666 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3667 enum tree_code __c4)
3668 {
3669 if (TREE_CODE (__t) != __c1
3670 && TREE_CODE (__t) != __c2
3671 && TREE_CODE (__t) != __c3
3672 && TREE_CODE (__t) != __c4)
3673 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3674 return __t;
3675 }
3676
3677 inline const_tree
tree_not_check4(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4)3678 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3679 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3680 enum tree_code __c4)
3681 {
3682 if (TREE_CODE (__t) == __c1
3683 || TREE_CODE (__t) == __c2
3684 || TREE_CODE (__t) == __c3
3685 || TREE_CODE (__t) == __c4)
3686 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3687 return __t;
3688 }
3689
3690 inline const_tree
tree_check5(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4,enum tree_code __c5)3691 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3692 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3693 enum tree_code __c4, enum tree_code __c5)
3694 {
3695 if (TREE_CODE (__t) != __c1
3696 && TREE_CODE (__t) != __c2
3697 && TREE_CODE (__t) != __c3
3698 && TREE_CODE (__t) != __c4
3699 && TREE_CODE (__t) != __c5)
3700 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3701 return __t;
3702 }
3703
3704 inline const_tree
tree_not_check5(const_tree __t,const char * __f,int __l,const char * __g,enum tree_code __c1,enum tree_code __c2,enum tree_code __c3,enum tree_code __c4,enum tree_code __c5)3705 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3706 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3707 enum tree_code __c4, enum tree_code __c5)
3708 {
3709 if (TREE_CODE (__t) == __c1
3710 || TREE_CODE (__t) == __c2
3711 || TREE_CODE (__t) == __c3
3712 || TREE_CODE (__t) == __c4
3713 || TREE_CODE (__t) == __c5)
3714 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3715 return __t;
3716 }
3717
3718 inline const_tree
contains_struct_check(const_tree __t,const enum tree_node_structure_enum __s,const char * __f,int __l,const char * __g)3719 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3720 const char *__f, int __l, const char *__g)
3721 {
3722 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3723 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3724 return __t;
3725 }
3726
3727 inline const_tree
tree_class_check(const_tree __t,const enum tree_code_class __class,const char * __f,int __l,const char * __g)3728 tree_class_check (const_tree __t, const enum tree_code_class __class,
3729 const char *__f, int __l, const char *__g)
3730 {
3731 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3732 tree_class_check_failed (__t, __class, __f, __l, __g);
3733 return __t;
3734 }
3735
3736 inline const_tree
tree_range_check(const_tree __t,enum tree_code __code1,enum tree_code __code2,const char * __f,int __l,const char * __g)3737 tree_range_check (const_tree __t,
3738 enum tree_code __code1, enum tree_code __code2,
3739 const char *__f, int __l, const char *__g)
3740 {
3741 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3742 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3743 return __t;
3744 }
3745
3746 inline const_tree
omp_clause_subcode_check(const_tree __t,enum omp_clause_code __code,const char * __f,int __l,const char * __g)3747 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3748 const char *__f, int __l, const char *__g)
3749 {
3750 if (TREE_CODE (__t) != OMP_CLAUSE)
3751 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3752 if (__t->omp_clause.code != __code)
3753 omp_clause_check_failed (__t, __f, __l, __g, __code);
3754 return __t;
3755 }
3756
3757 inline const_tree
omp_clause_range_check(const_tree __t,enum omp_clause_code __code1,enum omp_clause_code __code2,const char * __f,int __l,const char * __g)3758 omp_clause_range_check (const_tree __t,
3759 enum omp_clause_code __code1,
3760 enum omp_clause_code __code2,
3761 const char *__f, int __l, const char *__g)
3762 {
3763 if (TREE_CODE (__t) != OMP_CLAUSE)
3764 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3765 if ((int) __t->omp_clause.code < (int) __code1
3766 || (int) __t->omp_clause.code > (int) __code2)
3767 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3768 return __t;
3769 }
3770
3771 inline const_tree
expr_check(const_tree __t,const char * __f,int __l,const char * __g)3772 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3773 {
3774 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3775 if (!IS_EXPR_CODE_CLASS (__c))
3776 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3777 return __t;
3778 }
3779
3780 inline const_tree
non_type_check(const_tree __t,const char * __f,int __l,const char * __g)3781 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3782 {
3783 if (TYPE_P (__t))
3784 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3785 return __t;
3786 }
3787
3788 # if GCC_VERSION >= 4006
3789 #pragma GCC diagnostic push
3790 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3791 #endif
3792
3793 inline const_tree *
tree_vec_elt_check(const_tree __t,int __i,const char * __f,int __l,const char * __g)3794 tree_vec_elt_check (const_tree __t, int __i,
3795 const char *__f, int __l, const char *__g)
3796 {
3797 if (TREE_CODE (__t) != TREE_VEC)
3798 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3799 if (__i < 0 || __i >= __t->base.u.length)
3800 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3801 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3802 //return &__t->vec.a[__i];
3803 }
3804
3805 # if GCC_VERSION >= 4006
3806 #pragma GCC diagnostic pop
3807 #endif
3808
3809 inline const_tree *
omp_clause_elt_check(const_tree __t,int __i,const char * __f,int __l,const char * __g)3810 omp_clause_elt_check (const_tree __t, int __i,
3811 const char *__f, int __l, const char *__g)
3812 {
3813 if (TREE_CODE (__t) != OMP_CLAUSE)
3814 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3815 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3816 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3817 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3818 }
3819
3820 inline const_tree
any_integral_type_check(const_tree __t,const char * __f,int __l,const char * __g)3821 any_integral_type_check (const_tree __t, const char *__f, int __l,
3822 const char *__g)
3823 {
3824 if (!ANY_INTEGRAL_TYPE_P (__t))
3825 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3826 INTEGER_TYPE, 0);
3827 return __t;
3828 }
3829
3830 #endif
3831
3832 /* Compute the number of operands in an expression node NODE. For
3833 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3834 otherwise it is looked up from the node's code. */
3835 static inline int
tree_operand_length(const_tree node)3836 tree_operand_length (const_tree node)
3837 {
3838 if (VL_EXP_CLASS_P (node))
3839 return VL_EXP_OPERAND_LENGTH (node);
3840 else
3841 return TREE_CODE_LENGTH (TREE_CODE (node));
3842 }
3843
3844 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3845
3846 /* Special checks for TREE_OPERANDs. */
3847 inline tree *
tree_operand_check(tree __t,int __i,const char * __f,int __l,const char * __g)3848 tree_operand_check (tree __t, int __i,
3849 const char *__f, int __l, const char *__g)
3850 {
3851 const_tree __u = EXPR_CHECK (__t);
3852 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3853 tree_operand_check_failed (__i, __u, __f, __l, __g);
3854 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3855 }
3856
3857 inline tree *
tree_operand_check_code(tree __t,enum tree_code __code,int __i,const char * __f,int __l,const char * __g)3858 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3859 const char *__f, int __l, const char *__g)
3860 {
3861 if (TREE_CODE (__t) != __code)
3862 tree_check_failed (__t, __f, __l, __g, __code, 0);
3863 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3864 tree_operand_check_failed (__i, __t, __f, __l, __g);
3865 return &__t->exp.operands[__i];
3866 }
3867
3868 inline const_tree *
tree_operand_check(const_tree __t,int __i,const char * __f,int __l,const char * __g)3869 tree_operand_check (const_tree __t, int __i,
3870 const char *__f, int __l, const char *__g)
3871 {
3872 const_tree __u = EXPR_CHECK (__t);
3873 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3874 tree_operand_check_failed (__i, __u, __f, __l, __g);
3875 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3876 }
3877
3878 inline const_tree *
tree_operand_check_code(const_tree __t,enum tree_code __code,int __i,const char * __f,int __l,const char * __g)3879 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3880 const char *__f, int __l, const char *__g)
3881 {
3882 if (TREE_CODE (__t) != __code)
3883 tree_check_failed (__t, __f, __l, __g, __code, 0);
3884 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3885 tree_operand_check_failed (__i, __t, __f, __l, __g);
3886 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3887 }
3888
3889 #endif
3890
3891 /* True iff an identifier matches a C string. */
3892
3893 inline bool
id_equal(const_tree id,const char * str)3894 id_equal (const_tree id, const char *str)
3895 {
3896 return !strcmp (IDENTIFIER_POINTER (id), str);
3897 }
3898
3899 inline bool
id_equal(const char * str,const_tree id)3900 id_equal (const char *str, const_tree id)
3901 {
3902 return id_equal (id, str);
3903 }
3904
3905 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
3906
3907 inline poly_uint64
TYPE_VECTOR_SUBPARTS(const_tree node)3908 TYPE_VECTOR_SUBPARTS (const_tree node)
3909 {
3910 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
3911 unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision;
3912 if (NUM_POLY_INT_COEFFS == 2)
3913 {
3914 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
3915 description of the encoding. */
3916 poly_uint64 res = 0;
3917 res.coeffs[0] = HOST_WIDE_INT_1U << (precision & 0xff);
3918 if (precision & 0x100)
3919 res.coeffs[1] = HOST_WIDE_INT_1U << (precision & 0xff);
3920 return res;
3921 }
3922 else
3923 return HOST_WIDE_INT_1U << precision;
3924 }
3925
3926 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
3927 satisfy valid_vector_subparts_p. */
3928
3929 inline void
SET_TYPE_VECTOR_SUBPARTS(tree node,poly_uint64 subparts)3930 SET_TYPE_VECTOR_SUBPARTS (tree node, poly_uint64 subparts)
3931 {
3932 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
3933 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
3934 int index = exact_log2 (coeff0);
3935 gcc_assert (index >= 0);
3936 if (NUM_POLY_INT_COEFFS == 2)
3937 {
3938 /* We have two coefficients that are each in the range 1 << [0, 63],
3939 so supporting all combinations would require 6 bits per coefficient
3940 and 12 bits in total. Since the precision field is only 10 bits
3941 in size, we need to be more restrictive than that.
3942
3943 At present, coeff[1] is always either 0 (meaning that the number
3944 of units is constant) or equal to coeff[0] (meaning that the number
3945 of units is N + X * N for some target-dependent zero-based runtime
3946 parameter X). We can therefore encode coeff[1] in a single bit.
3947
3948 The most compact encoding would be to use mask 0x3f for coeff[0]
3949 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
3950 get slightly more efficient code on some hosts if we instead
3951 treat the shift amount as an independent byte, so here we use
3952 0xff for coeff[0] and 0x100 for coeff[1]. */
3953 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
3954 gcc_assert (coeff1 == 0 || coeff1 == coeff0);
3955 VECTOR_TYPE_CHECK (node)->type_common.precision
3956 = index + (coeff1 != 0 ? 0x100 : 0);
3957 }
3958 else
3959 VECTOR_TYPE_CHECK (node)->type_common.precision = index;
3960 }
3961
3962 /* Return true if we can construct vector types with the given number
3963 of subparts. */
3964
3965 static inline bool
valid_vector_subparts_p(poly_uint64 subparts)3966 valid_vector_subparts_p (poly_uint64 subparts)
3967 {
3968 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
3969 if (!pow2p_hwi (coeff0))
3970 return false;
3971 if (NUM_POLY_INT_COEFFS == 2)
3972 {
3973 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
3974 if (coeff1 != 0 && coeff1 != coeff0)
3975 return false;
3976 }
3977 return true;
3978 }
3979
3980 /* Return the built-in function that DECL represents, given that it is known
3981 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
3982 inline built_in_function
DECL_FUNCTION_CODE(const_tree decl)3983 DECL_FUNCTION_CODE (const_tree decl)
3984 {
3985 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
3986 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_NORMAL);
3987 return (built_in_function) fndecl.function_code;
3988 }
3989
3990 /* Return the target-specific built-in function that DECL represents,
3991 given that it is known to be a FUNCTION_DECL with built-in class
3992 BUILT_IN_MD. */
3993 inline int
DECL_MD_FUNCTION_CODE(const_tree decl)3994 DECL_MD_FUNCTION_CODE (const_tree decl)
3995 {
3996 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
3997 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_MD);
3998 return fndecl.function_code;
3999 }
4000
4001 /* Return the frontend-specific built-in function that DECL represents,
4002 given that it is known to be a FUNCTION_DECL with built-in class
4003 BUILT_IN_FRONTEND. */
4004 inline int
DECL_FE_FUNCTION_CODE(const_tree decl)4005 DECL_FE_FUNCTION_CODE (const_tree decl)
4006 {
4007 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4008 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_FRONTEND);
4009 return fndecl.function_code;
4010 }
4011
4012 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4013 class FCLASS. */
4014 inline void
set_decl_built_in_function(tree decl,built_in_class fclass,unsigned int fcode)4015 set_decl_built_in_function (tree decl, built_in_class fclass,
4016 unsigned int fcode)
4017 {
4018 tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4019 fndecl.built_in_class = fclass;
4020 fndecl.function_code = fcode;
4021 }
4022
4023 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4024 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4025 inline void
copy_decl_built_in_function(tree newdecl,const_tree olddecl)4026 copy_decl_built_in_function (tree newdecl, const_tree olddecl)
4027 {
4028 tree_function_decl &newfndecl = FUNCTION_DECL_CHECK (newdecl)->function_decl;
4029 const tree_function_decl &oldfndecl
4030 = FUNCTION_DECL_CHECK (olddecl)->function_decl;
4031 newfndecl.built_in_class = oldfndecl.built_in_class;
4032 newfndecl.function_code = oldfndecl.function_code;
4033 }
4034
4035 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4036 wrapper added to express a location_t on behalf of the node's child
4037 (e.g. by maybe_wrap_with_location). */
4038
4039 #define EXPR_LOCATION_WRAPPER_P(NODE) \
4040 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4041
4042 /* Test if EXP is merely a wrapper node, added to express a location_t
4043 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4044
4045 inline bool
location_wrapper_p(const_tree exp)4046 location_wrapper_p (const_tree exp)
4047 {
4048 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4049 the flag EXPR_LOCATION_WRAPPER_P is set.
4050 It normally has the same type as its operand, but it can have a
4051 different one if the type of the operand has changed (e.g. when
4052 merging duplicate decls).
4053
4054 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4055 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4056 if ((TREE_CODE (exp) == NON_LVALUE_EXPR
4057 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4058 && EXPR_LOCATION_WRAPPER_P (exp))
4059 return true;
4060 return false;
4061 }
4062
4063 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4064
4065 inline tree
tree_strip_any_location_wrapper(tree exp)4066 tree_strip_any_location_wrapper (tree exp)
4067 {
4068 if (location_wrapper_p (exp))
4069 return TREE_OPERAND (exp, 0);
4070 else
4071 return exp;
4072 }
4073
4074 #define error_mark_node global_trees[TI_ERROR_MARK]
4075
4076 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4077 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4078 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4079 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4080 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4081
4082 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4083 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4084 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4085 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4086 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4087
4088 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4089 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4090 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4091 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4092 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4093
4094 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4095 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4096 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4097 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4098
4099 #define void_node global_trees[TI_VOID]
4100
4101 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4102 #define integer_one_node global_trees[TI_INTEGER_ONE]
4103 #define integer_three_node global_trees[TI_INTEGER_THREE]
4104 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4105 #define size_zero_node global_trees[TI_SIZE_ZERO]
4106 #define size_one_node global_trees[TI_SIZE_ONE]
4107 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4108 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4109 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4110
4111 /* Base access nodes. */
4112 #define access_public_node global_trees[TI_PUBLIC]
4113 #define access_protected_node global_trees[TI_PROTECTED]
4114 #define access_private_node global_trees[TI_PRIVATE]
4115
4116 #define null_pointer_node global_trees[TI_NULL_POINTER]
4117
4118 #define float_type_node global_trees[TI_FLOAT_TYPE]
4119 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4120 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4121
4122 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4123 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4124 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4125 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4126
4127 /* Names for individual types (code should normally iterate over all
4128 such types; these are only for back-end use, or in contexts such as
4129 *.def where iteration is not possible). */
4130 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4131 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4132 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4133 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4134 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4135 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4136 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4137
4138 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4139 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4140 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4141 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4142
4143 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4144 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4145 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4146 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4147
4148 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4149
4150 #define void_type_node global_trees[TI_VOID_TYPE]
4151 /* The C type `void *'. */
4152 #define ptr_type_node global_trees[TI_PTR_TYPE]
4153 /* The C type `const void *'. */
4154 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4155 /* The C type `size_t'. */
4156 #define size_type_node global_trees[TI_SIZE_TYPE]
4157 #define pid_type_node global_trees[TI_PID_TYPE]
4158 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4159 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4160 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4161 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4162 /* The C type `FILE *'. */
4163 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4164 /* The C type `const struct tm *'. */
4165 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4166 /* The C type `fenv_t *'. */
4167 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4168 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4169 /* The C type `fexcept_t *'. */
4170 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4171 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4172 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4173
4174 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4175 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4176 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4177
4178 /* The decimal floating point types. */
4179 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4180 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4181 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4182
4183 /* The fixed-point types. */
4184 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4185 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4186 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4187 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4188 #define sat_unsigned_short_fract_type_node \
4189 global_trees[TI_SAT_USFRACT_TYPE]
4190 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4191 #define sat_unsigned_long_fract_type_node \
4192 global_trees[TI_SAT_ULFRACT_TYPE]
4193 #define sat_unsigned_long_long_fract_type_node \
4194 global_trees[TI_SAT_ULLFRACT_TYPE]
4195 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4196 #define fract_type_node global_trees[TI_FRACT_TYPE]
4197 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4198 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4199 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4200 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4201 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4202 #define unsigned_long_long_fract_type_node \
4203 global_trees[TI_ULLFRACT_TYPE]
4204 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4205 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4206 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4207 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4208 #define sat_unsigned_short_accum_type_node \
4209 global_trees[TI_SAT_USACCUM_TYPE]
4210 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4211 #define sat_unsigned_long_accum_type_node \
4212 global_trees[TI_SAT_ULACCUM_TYPE]
4213 #define sat_unsigned_long_long_accum_type_node \
4214 global_trees[TI_SAT_ULLACCUM_TYPE]
4215 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4216 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4217 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4218 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4219 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4220 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4221 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4222 #define unsigned_long_long_accum_type_node \
4223 global_trees[TI_ULLACCUM_TYPE]
4224 #define qq_type_node global_trees[TI_QQ_TYPE]
4225 #define hq_type_node global_trees[TI_HQ_TYPE]
4226 #define sq_type_node global_trees[TI_SQ_TYPE]
4227 #define dq_type_node global_trees[TI_DQ_TYPE]
4228 #define tq_type_node global_trees[TI_TQ_TYPE]
4229 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4230 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4231 #define usq_type_node global_trees[TI_USQ_TYPE]
4232 #define udq_type_node global_trees[TI_UDQ_TYPE]
4233 #define utq_type_node global_trees[TI_UTQ_TYPE]
4234 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4235 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4236 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4237 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4238 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4239 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4240 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4241 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4242 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4243 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4244 #define ha_type_node global_trees[TI_HA_TYPE]
4245 #define sa_type_node global_trees[TI_SA_TYPE]
4246 #define da_type_node global_trees[TI_DA_TYPE]
4247 #define ta_type_node global_trees[TI_TA_TYPE]
4248 #define uha_type_node global_trees[TI_UHA_TYPE]
4249 #define usa_type_node global_trees[TI_USA_TYPE]
4250 #define uda_type_node global_trees[TI_UDA_TYPE]
4251 #define uta_type_node global_trees[TI_UTA_TYPE]
4252 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4253 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4254 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4255 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4256 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4257 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4258 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4259 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4260
4261 /* The node that should be placed at the end of a parameter list to
4262 indicate that the function does not take a variable number of
4263 arguments. The TREE_VALUE will be void_type_node and there will be
4264 no TREE_CHAIN. Language-independent code should not assume
4265 anything else about this node. */
4266 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4267
4268 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4269 #define MAIN_NAME_P(NODE) \
4270 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4271
4272 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4273 functions. */
4274 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4275 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4276
4277 /* Default/current target options (TARGET_OPTION_NODE). */
4278 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4279 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4280
4281 /* Default tree list option(), optimize() pragmas to be linked into the
4282 attribute list. */
4283 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4284 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4285
4286 /* SCEV analyzer global shared trees. */
4287 #define chrec_not_analyzed_yet NULL_TREE
4288 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4289 #define chrec_known global_trees[TI_CHREC_KNOWN]
4290
4291 #define char_type_node integer_types[itk_char]
4292 #define signed_char_type_node integer_types[itk_signed_char]
4293 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4294 #define short_integer_type_node integer_types[itk_short]
4295 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4296 #define integer_type_node integer_types[itk_int]
4297 #define unsigned_type_node integer_types[itk_unsigned_int]
4298 #define long_integer_type_node integer_types[itk_long]
4299 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4300 #define long_long_integer_type_node integer_types[itk_long_long]
4301 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4302
4303 /* True if NODE is an erroneous expression. */
4304
4305 #define error_operand_p(NODE) \
4306 ((NODE) == error_mark_node \
4307 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4308
4309 /* Return the number of elements encoded directly in a VECTOR_CST. */
4310
4311 inline unsigned int
vector_cst_encoded_nelts(const_tree t)4312 vector_cst_encoded_nelts (const_tree t)
4313 {
4314 return VECTOR_CST_NPATTERNS (t) * VECTOR_CST_NELTS_PER_PATTERN (t);
4315 }
4316
4317 extern tree decl_assembler_name (tree);
4318 extern void overwrite_decl_assembler_name (tree decl, tree name);
4319 extern tree decl_comdat_group (const_tree);
4320 extern tree decl_comdat_group_id (const_tree);
4321 extern const char *decl_section_name (const_tree);
4322 extern void set_decl_section_name (tree, const char *);
4323 extern void set_decl_section_name (tree, const_tree);
4324 extern enum tls_model decl_tls_model (const_tree);
4325 extern void set_decl_tls_model (tree, enum tls_model);
4326
4327 /* Compute the number of bytes occupied by 'node'. This routine only
4328 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4329
4330 extern size_t tree_size (const_tree);
4331
4332 /* Compute the number of bytes occupied by a tree with code CODE.
4333 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4334 which are of variable length. */
4335 extern size_t tree_code_size (enum tree_code);
4336
4337 /* Allocate and return a new UID from the DECL_UID namespace. */
4338 extern int allocate_decl_uid (void);
4339
4340 /* Lowest level primitive for allocating a node.
4341 The TREE_CODE is the only argument. Contents are initialized
4342 to zero except for a few of the common fields. */
4343
4344 extern tree make_node (enum tree_code CXX_MEM_STAT_INFO);
4345
4346 /* Free tree node. */
4347
4348 extern void free_node (tree);
4349
4350 /* Make a copy of a node, with all the same contents. */
4351
4352 extern tree copy_node (tree CXX_MEM_STAT_INFO);
4353
4354 /* Make a copy of a chain of TREE_LIST nodes. */
4355
4356 extern tree copy_list (tree);
4357
4358 /* Make a CASE_LABEL_EXPR. */
4359
4360 extern tree build_case_label (tree, tree, tree);
4361
4362 /* Make a BINFO. */
4363 extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO);
4364
4365 /* Make an INTEGER_CST. */
4366
4367 extern tree make_int_cst (int, int CXX_MEM_STAT_INFO);
4368
4369 /* Make a TREE_VEC. */
4370
4371 extern tree make_tree_vec (int CXX_MEM_STAT_INFO);
4372
4373 /* Grow a TREE_VEC. */
4374
4375 extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO);
4376
4377 /* Construct various types of nodes. */
4378
4379 extern tree build_nt (enum tree_code, ...);
4380 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
4381
4382 extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO);
4383 extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO);
4384 extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO);
4385 extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO);
4386 extern tree build4 (enum tree_code, tree, tree, tree, tree,
4387 tree CXX_MEM_STAT_INFO);
4388 extern tree build5 (enum tree_code, tree, tree, tree, tree, tree,
4389 tree CXX_MEM_STAT_INFO);
4390
4391 /* _loc versions of build[1-5]. */
4392
4393 static inline tree
build1_loc(location_t loc,enum tree_code code,tree type,tree arg1 CXX_MEM_STAT_INFO)4394 build1_loc (location_t loc, enum tree_code code, tree type,
4395 tree arg1 CXX_MEM_STAT_INFO)
4396 {
4397 tree t = build1 (code, type, arg1 PASS_MEM_STAT);
4398 if (CAN_HAVE_LOCATION_P (t))
4399 SET_EXPR_LOCATION (t, loc);
4400 return t;
4401 }
4402
4403 static inline tree
build2_loc(location_t loc,enum tree_code code,tree type,tree arg0,tree arg1 CXX_MEM_STAT_INFO)4404 build2_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4405 tree arg1 CXX_MEM_STAT_INFO)
4406 {
4407 tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT);
4408 if (CAN_HAVE_LOCATION_P (t))
4409 SET_EXPR_LOCATION (t, loc);
4410 return t;
4411 }
4412
4413 static inline tree
build3_loc(location_t loc,enum tree_code code,tree type,tree arg0,tree arg1,tree arg2 CXX_MEM_STAT_INFO)4414 build3_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4415 tree arg1, tree arg2 CXX_MEM_STAT_INFO)
4416 {
4417 tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4418 if (CAN_HAVE_LOCATION_P (t))
4419 SET_EXPR_LOCATION (t, loc);
4420 return t;
4421 }
4422
4423 static inline tree
build4_loc(location_t loc,enum tree_code code,tree type,tree arg0,tree arg1,tree arg2,tree arg3 CXX_MEM_STAT_INFO)4424 build4_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4425 tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO)
4426 {
4427 tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4428 if (CAN_HAVE_LOCATION_P (t))
4429 SET_EXPR_LOCATION (t, loc);
4430 return t;
4431 }
4432
4433 static inline tree
build5_loc(location_t loc,enum tree_code code,tree type,tree arg0,tree arg1,tree arg2,tree arg3,tree arg4 CXX_MEM_STAT_INFO)4434 build5_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4435 tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO)
4436 {
4437 tree t = build5 (code, type, arg0, arg1, arg2, arg3,
4438 arg4 PASS_MEM_STAT);
4439 if (CAN_HAVE_LOCATION_P (t))
4440 SET_EXPR_LOCATION (t, loc);
4441 return t;
4442 }
4443
4444 /* Constructs double_int from tree CST. */
4445
4446 extern tree double_int_to_tree (tree, double_int);
4447
4448 extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst);
4449 extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool);
4450
4451 /* Create an INT_CST node with a CST value zero extended. */
4452
4453 /* static inline */
4454 extern tree build_int_cst (tree, poly_int64);
4455 extern tree build_int_cstu (tree type, poly_uint64);
4456 extern tree build_int_cst_type (tree, poly_int64);
4457 extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO);
4458 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
4459 extern tree build_vector_from_val (tree, tree);
4460 extern tree build_uniform_cst (tree, tree);
4461 extern tree build_vec_series (tree, tree, tree);
4462 extern tree build_index_vector (tree, poly_uint64, poly_uint64);
4463 extern tree build_vector_a_then_b (tree, unsigned int, tree, tree);
4464 extern void recompute_constructor_flags (tree);
4465 extern void verify_constructor_flags (tree);
4466 extern tree build_constructor (tree, vec<constructor_elt, va_gc> * CXX_MEM_STAT_INFO);
4467 extern tree build_constructor_single (tree, tree, tree);
4468 extern tree build_constructor_from_list (tree, tree);
4469 extern tree build_constructor_from_vec (tree, const vec<tree, va_gc> *);
4470 extern tree build_constructor_va (tree, int, ...);
4471 extern tree build_clobber (tree);
4472 extern tree build_real_from_int_cst (tree, const_tree);
4473 extern tree build_real_from_wide (tree, const wide_int_ref &, signop);
4474 extern tree build_complex (tree, tree, tree);
4475 extern tree build_complex_inf (tree, bool);
4476 extern tree build_each_one_cst (tree);
4477 extern tree build_one_cst (tree);
4478 extern tree build_minus_one_cst (tree);
4479 extern tree build_all_ones_cst (tree);
4480 extern tree build_zero_cst (tree);
4481 extern tree build_string (unsigned, const char * = NULL);
4482 extern tree build_poly_int_cst (tree, const poly_wide_int_ref &);
4483 extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO);
4484 extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO);
4485 extern tree build_decl (location_t, enum tree_code,
4486 tree, tree CXX_MEM_STAT_INFO);
4487 extern tree build_fn_decl (const char *, tree);
4488 extern tree build_translation_unit_decl (tree);
4489 extern tree build_block (tree, tree, tree, tree);
4490 extern tree build_empty_stmt (location_t);
4491 extern tree build_omp_clause (location_t, enum omp_clause_code);
4492
4493 extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO);
4494
4495 extern tree build_call_nary (tree, tree, int, ...);
4496 extern tree build_call_valist (tree, tree, int, va_list);
4497 #define build_call_array(T1,T2,N,T3)\
4498 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4499 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4500 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
4501 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
4502 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
4503 extern tree build_call_expr_loc (location_t, tree, int, ...);
4504 extern tree build_call_expr (tree, int, ...);
4505 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
4506 tree, int, ...);
4507 extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn,
4508 tree, int, const tree *);
4509 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
4510 int, ...);
4511 extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT);
4512 extern tree build_string_literal (unsigned, const char * = NULL,
4513 tree = char_type_node,
4514 unsigned HOST_WIDE_INT = HOST_WIDE_INT_M1U);
4515
4516 /* Construct various nodes representing data types. */
4517
4518 extern tree signed_or_unsigned_type_for (int, tree);
4519 extern tree signed_type_for (tree);
4520 extern tree unsigned_type_for (tree);
4521 extern tree truth_type_for (tree);
4522 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
4523 extern tree build_pointer_type (tree);
4524 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
4525 extern tree build_reference_type (tree);
4526 extern tree build_vector_type_for_mode (tree, machine_mode);
4527 extern tree build_vector_type (tree, poly_int64);
4528 extern tree build_truth_vector_type_for_mode (poly_uint64, machine_mode);
4529 extern tree build_opaque_vector_type (tree, poly_int64);
4530 extern tree build_index_type (tree);
4531 extern tree build_array_type (tree, tree, bool = false);
4532 extern tree build_nonshared_array_type (tree, tree);
4533 extern tree build_array_type_nelts (tree, poly_uint64);
4534 extern tree build_function_type (tree, tree);
4535 extern tree build_function_type_list (tree, ...);
4536 extern tree build_varargs_function_type_list (tree, ...);
4537 extern tree build_function_type_array (tree, int, tree *);
4538 extern tree build_varargs_function_type_array (tree, int, tree *);
4539 #define build_function_type_vec(RET, V) \
4540 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4541 #define build_varargs_function_type_vec(RET, V) \
4542 build_varargs_function_type_array (RET, vec_safe_length (V), \
4543 vec_safe_address (V))
4544 extern tree build_method_type_directly (tree, tree, tree);
4545 extern tree build_method_type (tree, tree);
4546 extern tree build_offset_type (tree, tree);
4547 extern tree build_complex_type (tree, bool named = false);
4548 extern tree array_type_nelts (const_tree);
4549
4550 extern tree value_member (tree, tree);
4551 extern tree purpose_member (const_tree, tree);
4552 extern bool vec_member (const_tree, vec<tree, va_gc> *);
4553 extern tree chain_index (int, tree);
4554
4555 /* Arguments may be null. */
4556 extern int tree_int_cst_equal (const_tree, const_tree);
4557
4558 /* The following predicates are safe to call with a null argument. */
4559 extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE;
4560 extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE;
4561 extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE;
4562 extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE;
4563
4564 extern HOST_WIDE_INT tree_to_shwi (const_tree)
4565 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4566 extern poly_int64 tree_to_poly_int64 (const_tree)
4567 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4568 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree)
4569 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4570 extern poly_uint64 tree_to_poly_uint64 (const_tree)
4571 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4572 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4573 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
tree_to_shwi(const_tree t)4574 tree_to_shwi (const_tree t)
4575 {
4576 gcc_assert (tree_fits_shwi_p (t));
4577 return TREE_INT_CST_LOW (t);
4578 }
4579
4580 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
tree_to_uhwi(const_tree t)4581 tree_to_uhwi (const_tree t)
4582 {
4583 gcc_assert (tree_fits_uhwi_p (t));
4584 return TREE_INT_CST_LOW (t);
4585 }
4586 #if NUM_POLY_INT_COEFFS == 1
4587 extern inline __attribute__ ((__gnu_inline__)) poly_int64
tree_to_poly_int64(const_tree t)4588 tree_to_poly_int64 (const_tree t)
4589 {
4590 gcc_assert (tree_fits_poly_int64_p (t));
4591 return TREE_INT_CST_LOW (t);
4592 }
4593
4594 extern inline __attribute__ ((__gnu_inline__)) poly_uint64
tree_to_poly_uint64(const_tree t)4595 tree_to_poly_uint64 (const_tree t)
4596 {
4597 gcc_assert (tree_fits_poly_uint64_p (t));
4598 return TREE_INT_CST_LOW (t);
4599 }
4600 #endif
4601 #endif
4602 extern int tree_int_cst_sgn (const_tree);
4603 extern int tree_int_cst_sign_bit (const_tree);
4604 extern unsigned int tree_int_cst_min_precision (tree, signop);
4605 extern tree strip_array_types (tree);
4606 extern tree excess_precision_type (tree);
4607
4608 /* Desription of the reason why the argument of valid_constant_size_p
4609 is not a valid size. */
4610 enum cst_size_error {
4611 cst_size_ok,
4612 cst_size_not_constant,
4613 cst_size_negative,
4614 cst_size_too_big,
4615 cst_size_overflow
4616 };
4617
4618 extern bool valid_constant_size_p (const_tree, cst_size_error * = NULL);
4619 extern tree max_object_size ();
4620
4621 /* Return true if T holds a value that can be represented as a poly_int64
4622 without loss of precision. Store the value in *VALUE if so. */
4623
4624 inline bool
poly_int_tree_p(const_tree t,poly_int64_pod * value)4625 poly_int_tree_p (const_tree t, poly_int64_pod *value)
4626 {
4627 if (tree_fits_poly_int64_p (t))
4628 {
4629 *value = tree_to_poly_int64 (t);
4630 return true;
4631 }
4632 return false;
4633 }
4634
4635 /* Return true if T holds a value that can be represented as a poly_uint64
4636 without loss of precision. Store the value in *VALUE if so. */
4637
4638 inline bool
poly_int_tree_p(const_tree t,poly_uint64_pod * value)4639 poly_int_tree_p (const_tree t, poly_uint64_pod *value)
4640 {
4641 if (tree_fits_poly_uint64_p (t))
4642 {
4643 *value = tree_to_poly_uint64 (t);
4644 return true;
4645 }
4646 return false;
4647 }
4648
4649 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4650 put the prototype here. Rtl.h does declare the prototype if
4651 tree.h had been included. */
4652
4653 extern tree make_tree (tree, rtx);
4654
4655 /* Returns true iff CAND and BASE have equivalent language-specific
4656 qualifiers. */
4657
4658 extern bool check_lang_type (const_tree cand, const_tree base);
4659
4660 /* Returns true iff unqualified CAND and BASE are equivalent. */
4661
4662 extern bool check_base_type (const_tree cand, const_tree base);
4663
4664 /* Check whether CAND is suitable to be returned from get_qualified_type
4665 (BASE, TYPE_QUALS). */
4666
4667 extern bool check_qualified_type (const_tree, const_tree, int);
4668
4669 /* Return a version of the TYPE, qualified as indicated by the
4670 TYPE_QUALS, if one exists. If no qualified version exists yet,
4671 return NULL_TREE. */
4672
4673 extern tree get_qualified_type (tree, int);
4674
4675 /* Like get_qualified_type, but creates the type if it does not
4676 exist. This function never returns NULL_TREE. */
4677
4678 extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO);
4679
4680 /* Create a variant of type T with alignment ALIGN. */
4681
4682 extern tree build_aligned_type (tree, unsigned int);
4683
4684 /* Like build_qualified_type, but only deals with the `const' and
4685 `volatile' qualifiers. This interface is retained for backwards
4686 compatibility with the various front-ends; new code should use
4687 build_qualified_type instead. */
4688
4689 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4690 build_qualified_type ((TYPE), \
4691 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4692 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4693
4694 /* Make a copy of a type node. */
4695
4696 extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO);
4697 extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO);
4698
4699 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4700 return a canonicalized ..._TYPE node, so that duplicates are not made.
4701 How the hash code is computed is up to the caller, as long as any two
4702 callers that could hash identical-looking type nodes agree. */
4703
4704 extern hashval_t type_hash_canon_hash (tree);
4705 extern tree type_hash_canon (unsigned int, tree);
4706
4707 extern tree convert (tree, tree);
4708 extern tree size_in_bytes_loc (location_t, const_tree);
4709 inline tree
size_in_bytes(const_tree t)4710 size_in_bytes (const_tree t)
4711 {
4712 return size_in_bytes_loc (input_location, t);
4713 }
4714
4715 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4716 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4717 extern tree bit_position (const_tree);
4718 extern tree byte_position (const_tree);
4719 extern HOST_WIDE_INT int_byte_position (const_tree);
4720
4721 /* Type for sizes of data-type. */
4722
4723 #define sizetype sizetype_tab[(int) stk_sizetype]
4724 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4725 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4726 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4727 #define size_int(L) size_int_kind (L, stk_sizetype)
4728 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4729 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4730 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4731
4732 /* Log2 of BITS_PER_UNIT. */
4733
4734 #if BITS_PER_UNIT == 8
4735 #define LOG2_BITS_PER_UNIT 3
4736 #elif BITS_PER_UNIT == 16
4737 #define LOG2_BITS_PER_UNIT 4
4738 #else
4739 #error Unknown BITS_PER_UNIT
4740 #endif
4741
4742 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4743 by making the last node in X point to Y.
4744 Returns X, except if X is 0 returns Y. */
4745
4746 extern tree chainon (tree, tree);
4747
4748 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4749
4750 extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO);
4751
4752 /* Return the last tree node in a chain. */
4753
4754 extern tree tree_last (tree);
4755
4756 /* Reverse the order of elements in a chain, and return the new head. */
4757
4758 extern tree nreverse (tree);
4759
4760 /* Returns the length of a chain of nodes
4761 (number of chain pointers to follow before reaching a null pointer). */
4762
4763 extern int list_length (const_tree);
4764
4765 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
4766
4767 extern tree first_field (const_tree) ATTRIBUTE_NONNULL (1);
4768 extern tree last_field (const_tree) ATTRIBUTE_NONNULL (1);
4769
4770 /* Given an initializer INIT, return TRUE if INIT is zero or some
4771 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4772 null, set *NONZERO if and only if INIT is known not to be all
4773 zeros. The combination of return value of false and *NONZERO
4774 false implies that INIT may but need not be all zeros. Other
4775 combinations indicate definitive answers. */
4776
4777 extern bool initializer_zerop (const_tree, bool * = NULL);
4778 extern bool initializer_each_zero_or_onep (const_tree);
4779
4780 extern tree vector_cst_elt (const_tree, unsigned int);
4781
4782 /* Given a vector VEC, return its first element if all elements are
4783 the same. Otherwise return NULL_TREE. */
4784
4785 extern tree uniform_vector_p (const_tree);
4786
4787 /* If the argument is INTEGER_CST, return it. If the argument is vector
4788 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4789 return NULL_TREE. */
4790
4791 extern tree uniform_integer_cst_p (tree);
4792
4793 extern int single_nonzero_element (const_tree);
4794
4795 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4796
4797 extern vec<tree, va_gc> *ctor_to_vec (tree);
4798
4799 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4800
4801 extern bool zerop (const_tree);
4802
4803 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4804
4805 extern bool integer_zerop (const_tree);
4806
4807 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4808
4809 extern bool integer_onep (const_tree);
4810
4811 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4812 a vector or complex where each part is 1. */
4813
4814 extern bool integer_each_onep (const_tree);
4815
4816 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4817 all of whose significant bits are 1. */
4818
4819 extern bool integer_all_onesp (const_tree);
4820
4821 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4822 value -1. */
4823
4824 extern bool integer_minus_onep (const_tree);
4825
4826 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4827 exactly one bit 1. */
4828
4829 extern bool integer_pow2p (const_tree);
4830
4831 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4832 with a nonzero value. */
4833
4834 extern bool integer_nonzerop (const_tree);
4835
4836 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4837 a vector where each element is an integer constant of value -1. */
4838
4839 extern bool integer_truep (const_tree);
4840
4841 extern bool cst_and_fits_in_hwi (const_tree);
4842 extern tree num_ending_zeros (const_tree);
4843
4844 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4845 value 0. */
4846
4847 extern bool fixed_zerop (const_tree);
4848
4849 /* staticp (tree x) is nonzero if X is a reference to data allocated
4850 at a fixed address in memory. Returns the outermost data. */
4851
4852 extern tree staticp (tree);
4853
4854 /* save_expr (EXP) returns an expression equivalent to EXP
4855 but it can be used multiple times within context CTX
4856 and only evaluate EXP once. */
4857
4858 extern tree save_expr (tree);
4859
4860 /* Return true if T is function-invariant. */
4861
4862 extern bool tree_invariant_p (tree);
4863
4864 /* Look inside EXPR into any simple arithmetic operations. Return the
4865 outermost non-arithmetic or non-invariant node. */
4866
4867 extern tree skip_simple_arithmetic (tree);
4868
4869 /* Look inside EXPR into simple arithmetic operations involving constants.
4870 Return the outermost non-arithmetic or non-constant node. */
4871
4872 extern tree skip_simple_constant_arithmetic (tree);
4873
4874 /* Return which tree structure is used by T. */
4875
4876 enum tree_node_structure_enum tree_node_structure (const_tree);
4877
4878 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4879 size or offset that depends on a field within a record. */
4880
4881 extern bool contains_placeholder_p (const_tree);
4882
4883 /* This macro calls the above function but short-circuits the common
4884 case of a constant to save time. Also check for null. */
4885
4886 #define CONTAINS_PLACEHOLDER_P(EXP) \
4887 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4888
4889 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4890 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4891 field positions. */
4892
4893 extern bool type_contains_placeholder_p (tree);
4894
4895 /* Given a tree EXP, find all occurrences of references to fields
4896 in a PLACEHOLDER_EXPR and place them in vector REFS without
4897 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4898 we assume here that EXP contains only arithmetic expressions
4899 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4900 argument list. */
4901
4902 extern void find_placeholder_in_expr (tree, vec<tree> *);
4903
4904 /* This macro calls the above function but short-circuits the common
4905 case of a constant to save time and also checks for NULL. */
4906
4907 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4908 do { \
4909 if((EXP) && !TREE_CONSTANT (EXP)) \
4910 find_placeholder_in_expr (EXP, V); \
4911 } while (0)
4912
4913 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4914 return a tree with all occurrences of references to F in a
4915 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4916 CONST_DECLs. Note that we assume here that EXP contains only
4917 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4918 occurring only in their argument list. */
4919
4920 extern tree substitute_in_expr (tree, tree, tree);
4921
4922 /* This macro calls the above function but short-circuits the common
4923 case of a constant to save time and also checks for NULL. */
4924
4925 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4926 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4927
4928 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4929 for it within OBJ, a tree that is an object or a chain of references. */
4930
4931 extern tree substitute_placeholder_in_expr (tree, tree);
4932
4933 /* This macro calls the above function but short-circuits the common
4934 case of a constant to save time and also checks for NULL. */
4935
4936 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4937 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4938 : substitute_placeholder_in_expr (EXP, OBJ))
4939
4940
4941 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4942 but it can be used multiple times
4943 and only evaluate the subexpressions once. */
4944
4945 extern tree stabilize_reference (tree);
4946
4947 /* Return EXP, stripped of any conversions to wider types
4948 in such a way that the result of converting to type FOR_TYPE
4949 is the same as if EXP were converted to FOR_TYPE.
4950 If FOR_TYPE is 0, it signifies EXP's type. */
4951
4952 extern tree get_unwidened (tree, tree);
4953
4954 /* Return OP or a simpler expression for a narrower value
4955 which can be sign-extended or zero-extended to give back OP.
4956 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4957 or 0 if the value should be sign-extended. */
4958
4959 extern tree get_narrower (tree, int *);
4960
4961 /* Return true if T is an expression that get_inner_reference handles. */
4962
4963 static inline bool
handled_component_p(const_tree t)4964 handled_component_p (const_tree t)
4965 {
4966 switch (TREE_CODE (t))
4967 {
4968 case COMPONENT_REF:
4969 case BIT_FIELD_REF:
4970 case ARRAY_REF:
4971 case ARRAY_RANGE_REF:
4972 case REALPART_EXPR:
4973 case IMAGPART_EXPR:
4974 case VIEW_CONVERT_EXPR:
4975 return true;
4976
4977 default:
4978 return false;
4979 }
4980 }
4981
4982 /* Return true T is a component with reverse storage order. */
4983
4984 static inline bool
reverse_storage_order_for_component_p(tree t)4985 reverse_storage_order_for_component_p (tree t)
4986 {
4987 /* The storage order only applies to scalar components. */
4988 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t)))
4989 return false;
4990
4991 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
4992 t = TREE_OPERAND (t, 0);
4993
4994 switch (TREE_CODE (t))
4995 {
4996 case ARRAY_REF:
4997 case COMPONENT_REF:
4998 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4999 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5000 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
5001 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
5002
5003 case BIT_FIELD_REF:
5004 case MEM_REF:
5005 return REF_REVERSE_STORAGE_ORDER (t);
5006
5007 case ARRAY_RANGE_REF:
5008 case VIEW_CONVERT_EXPR:
5009 default:
5010 return false;
5011 }
5012
5013 gcc_unreachable ();
5014 }
5015
5016 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5017 that can modify the storage order of objects. Note that, even if the
5018 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5019 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5020 it can change the partition of the aggregate object into scalars. */
5021
5022 static inline bool
storage_order_barrier_p(const_tree t)5023 storage_order_barrier_p (const_tree t)
5024 {
5025 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
5026 return false;
5027
5028 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5029 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
5030 return true;
5031
5032 tree op = TREE_OPERAND (t, 0);
5033
5034 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
5035 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
5036 return true;
5037
5038 return false;
5039 }
5040
5041 /* Given a DECL or TYPE, return the scope in which it was declared, or
5042 NUL_TREE if there is no containing scope. */
5043
5044 extern tree get_containing_scope (const_tree);
5045
5046 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5047
5048 extern const_tree get_ultimate_context (const_tree);
5049
5050 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5051 or zero if none. */
5052 extern tree decl_function_context (const_tree);
5053
5054 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5055 this _DECL with its context, or zero if none. */
5056 extern tree decl_type_context (const_tree);
5057
5058 /* Return true if EXPR is the real constant zero. */
5059 extern bool real_zerop (const_tree);
5060
5061 /* Initialize the iterator I with arguments from function FNDECL */
5062
5063 static inline void
function_args_iter_init(function_args_iterator * i,const_tree fntype)5064 function_args_iter_init (function_args_iterator *i, const_tree fntype)
5065 {
5066 i->next = TYPE_ARG_TYPES (fntype);
5067 }
5068
5069 /* Return a pointer that holds the next argument if there are more arguments to
5070 handle, otherwise return NULL. */
5071
5072 static inline tree *
function_args_iter_cond_ptr(function_args_iterator * i)5073 function_args_iter_cond_ptr (function_args_iterator *i)
5074 {
5075 return (i->next) ? &TREE_VALUE (i->next) : NULL;
5076 }
5077
5078 /* Return the next argument if there are more arguments to handle, otherwise
5079 return NULL. */
5080
5081 static inline tree
function_args_iter_cond(function_args_iterator * i)5082 function_args_iter_cond (function_args_iterator *i)
5083 {
5084 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
5085 }
5086
5087 /* Advance to the next argument. */
5088 static inline void
function_args_iter_next(function_args_iterator * i)5089 function_args_iter_next (function_args_iterator *i)
5090 {
5091 gcc_assert (i->next != NULL_TREE);
5092 i->next = TREE_CHAIN (i->next);
5093 }
5094
5095 /* Returns true if a BLOCK has a source location.
5096 BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5097 so the function returns true for all but the innermost and outermost
5098 blocks into which an expression has been inlined. */
5099
5100 static inline bool
inlined_function_outer_scope_p(const_tree block)5101 inlined_function_outer_scope_p (const_tree block)
5102 {
5103 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
5104 }
5105
5106 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5107 to point to the next tree element. ITER is an instance of
5108 function_args_iterator used to iterate the arguments. */
5109 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5110 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5111 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5112 function_args_iter_next (&(ITER)))
5113
5114 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5115 to the next tree element. ITER is an instance of function_args_iterator
5116 used to iterate the arguments. */
5117 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5118 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5119 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5120 function_args_iter_next (&(ITER)))
5121
5122 /* In tree.c */
5123 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5124 extern unsigned crc32_string (unsigned, const char *);
5125 inline unsigned
crc32_unsigned(unsigned chksum,unsigned value)5126 crc32_unsigned (unsigned chksum, unsigned value)
5127 {
5128 return crc32_unsigned_n (chksum, value, 4);
5129 }
5130 inline unsigned
crc32_byte(unsigned chksum,char byte)5131 crc32_byte (unsigned chksum, char byte)
5132 {
5133 return crc32_unsigned_n (chksum, byte, 1);
5134 }
5135 extern void clean_symbol_name (char *);
5136 extern tree get_file_function_name (const char *);
5137 extern tree get_callee_fndecl (const_tree);
5138 extern combined_fn get_call_combined_fn (const_tree);
5139 extern int type_num_arguments (const_tree);
5140 extern tree type_argument_type (const_tree, unsigned) ATTRIBUTE_NONNULL (1);
5141 extern bool associative_tree_code (enum tree_code);
5142 extern bool commutative_tree_code (enum tree_code);
5143 extern bool commutative_ternary_tree_code (enum tree_code);
5144 extern bool operation_can_overflow (enum tree_code);
5145 extern bool operation_no_trapping_overflow (tree, enum tree_code);
5146 extern tree upper_bound_in_type (tree, tree);
5147 extern tree lower_bound_in_type (tree, tree);
5148 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
5149 extern tree create_artificial_label (location_t);
5150 extern const char *get_name (tree);
5151 extern bool stdarg_p (const_tree);
5152 extern bool prototype_p (const_tree);
5153 extern bool is_typedef_decl (const_tree x);
5154 extern bool typedef_variant_p (const_tree);
5155 extern bool auto_var_p (const_tree);
5156 extern bool auto_var_in_fn_p (const_tree, const_tree);
5157 extern tree build_low_bits_mask (tree, unsigned);
5158 extern bool tree_nop_conversion_p (const_tree, const_tree);
5159 extern tree tree_strip_nop_conversions (tree);
5160 extern tree tree_strip_sign_nop_conversions (tree);
5161 extern const_tree strip_invariant_refs (const_tree);
5162 extern tree lhd_gcc_personality (void);
5163 extern void assign_assembler_name_if_needed (tree);
5164 extern bool warn_deprecated_use (tree, tree);
5165 extern tree cache_integer_cst (tree, bool might_duplicate = false);
5166 extern const char *combined_fn_name (combined_fn);
5167
5168 /* Compare and hash for any structure which begins with a canonical
5169 pointer. Assumes all pointers are interchangeable, which is sort
5170 of already assumed by gcc elsewhere IIRC. */
5171
5172 static inline int
struct_ptr_eq(const void * a,const void * b)5173 struct_ptr_eq (const void *a, const void *b)
5174 {
5175 const void * const * x = (const void * const *) a;
5176 const void * const * y = (const void * const *) b;
5177 return *x == *y;
5178 }
5179
5180 static inline hashval_t
struct_ptr_hash(const void * a)5181 struct_ptr_hash (const void *a)
5182 {
5183 const void * const * x = (const void * const *) a;
5184 return (intptr_t)*x >> 4;
5185 }
5186
5187 /* Return nonzero if CODE is a tree code that represents a truth value. */
5188 static inline bool
truth_value_p(enum tree_code code)5189 truth_value_p (enum tree_code code)
5190 {
5191 return (TREE_CODE_CLASS (code) == tcc_comparison
5192 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5193 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5194 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5195 }
5196
5197 /* Return whether TYPE is a type suitable for an offset for
5198 a POINTER_PLUS_EXPR. */
5199 static inline bool
ptrofftype_p(tree type)5200 ptrofftype_p (tree type)
5201 {
5202 return (INTEGRAL_TYPE_P (type)
5203 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
5204 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
5205 }
5206
5207 /* Return true if the argument is a complete type or an array
5208 of unknown bound (whose type is incomplete but) whose elements
5209 have complete type. */
5210 static inline bool
complete_or_array_type_p(const_tree type)5211 complete_or_array_type_p (const_tree type)
5212 {
5213 return COMPLETE_TYPE_P (type)
5214 || (TREE_CODE (type) == ARRAY_TYPE
5215 && COMPLETE_TYPE_P (TREE_TYPE (type)));
5216 }
5217
5218 /* Return true if the value of T could be represented as a poly_widest_int. */
5219
5220 inline bool
poly_int_tree_p(const_tree t)5221 poly_int_tree_p (const_tree t)
5222 {
5223 return (TREE_CODE (t) == INTEGER_CST || POLY_INT_CST_P (t));
5224 }
5225
5226 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5227 to be a poly_uint64. (This is always true at the gimple level.) */
5228
5229 inline poly_uint64
bit_field_size(const_tree t)5230 bit_field_size (const_tree t)
5231 {
5232 return tree_to_poly_uint64 (TREE_OPERAND (t, 1));
5233 }
5234
5235 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5236 known to be a poly_uint64. (This is always true at the gimple level.) */
5237
5238 inline poly_uint64
bit_field_offset(const_tree t)5239 bit_field_offset (const_tree t)
5240 {
5241 return tree_to_poly_uint64 (TREE_OPERAND (t, 2));
5242 }
5243
5244 extern tree strip_float_extensions (tree);
5245 extern bool really_constant_p (const_tree);
5246 extern bool ptrdiff_tree_p (const_tree, poly_int64_pod *);
5247 extern bool decl_address_invariant_p (const_tree);
5248 extern bool decl_address_ip_invariant_p (const_tree);
5249 extern bool int_fits_type_p (const_tree, const_tree)
5250 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE;
5251 #ifndef GENERATOR_FILE
5252 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5253 #endif
5254 extern bool variably_modified_type_p (tree, tree);
5255 extern int tree_log2 (const_tree);
5256 extern int tree_floor_log2 (const_tree);
5257 extern unsigned int tree_ctz (const_tree);
5258 extern int simple_cst_equal (const_tree, const_tree);
5259
5260 namespace inchash
5261 {
5262
5263 extern void add_expr (const_tree, hash &, unsigned int = 0);
5264
5265 }
5266
5267 /* Compat version until all callers are converted. Return hash for
5268 TREE with SEED. */
iterative_hash_expr(const_tree tree,hashval_t seed)5269 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
5270 {
5271 inchash::hash hstate (seed);
5272 inchash::add_expr (tree, hstate);
5273 return hstate.end ();
5274 }
5275
5276 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5277 extern bool type_list_equal (const_tree, const_tree);
5278 extern bool chain_member (const_tree, const_tree);
5279 extern void dump_tree_statistics (void);
5280 extern void recompute_tree_invariant_for_addr_expr (tree);
5281 extern bool needs_to_live_in_memory (const_tree);
5282 extern tree reconstruct_complex_type (tree, tree);
5283 extern bool real_onep (const_tree);
5284 extern bool real_minus_onep (const_tree);
5285 extern void init_ttree (void);
5286 extern void build_common_tree_nodes (bool);
5287 extern void build_common_builtin_nodes (void);
5288 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5289 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
5290 extern tree build_range_type (tree, tree, tree);
5291 extern tree build_nonshared_range_type (tree, tree, tree);
5292 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5293 extern HOST_WIDE_INT int_cst_value (const_tree);
5294 extern tree tree_block (tree);
5295 extern void tree_set_block (tree, tree);
5296 extern location_t *block_nonartificial_location (tree);
5297 extern location_t tree_nonartificial_location (tree);
5298 extern location_t tree_inlined_location (tree, bool = true);
5299 extern tree block_ultimate_origin (const_tree);
5300 extern tree get_binfo_at_offset (tree, poly_int64, tree);
5301 extern bool virtual_method_call_p (const_tree, bool = false);
5302 extern tree obj_type_ref_class (const_tree ref, bool = false);
5303 extern bool types_same_for_odr (const_tree type1, const_tree type2);
5304 extern bool contains_bitfld_component_ref_p (const_tree);
5305 extern bool block_may_fallthru (const_tree);
5306 extern void using_eh_for_cleanups (void);
5307 extern bool using_eh_for_cleanups_p (void);
5308 extern const char *get_tree_code_name (enum tree_code);
5309 extern void set_call_expr_flags (tree, int);
5310 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
5311 walk_tree_lh);
5312 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5313 walk_tree_lh);
5314 #define walk_tree(a,b,c,d) \
5315 walk_tree_1 (a, b, c, d, NULL)
5316 #define walk_tree_without_duplicates(a,b,c) \
5317 walk_tree_without_duplicates_1 (a, b, c, NULL)
5318
5319 extern tree drop_tree_overflow (tree);
5320
5321 /* Given a memory reference expression T, return its base address.
5322 The base address of a memory reference expression is the main
5323 object being referenced. */
5324 extern tree get_base_address (tree t);
5325
5326 /* Return a tree of sizetype representing the size, in bytes, of the element
5327 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5328 extern tree array_ref_element_size (tree);
5329
5330 /* Return a typenode for the "standard" C type with a given name. */
5331 extern tree get_typenode_from_name (const char *);
5332
5333 /* Return a tree representing the upper bound of the array mentioned in
5334 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5335 extern tree array_ref_up_bound (tree);
5336
5337 /* Return a tree representing the lower bound of the array mentioned in
5338 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5339 extern tree array_ref_low_bound (tree);
5340
5341 /* Returns true if REF is an array reference or a component reference
5342 to an array at the end of a structure. If this is the case, the array
5343 may be allocated larger than its upper bound implies. */
5344 extern bool array_at_struct_end_p (tree);
5345
5346 /* Return a tree representing the offset, in bytes, of the field referenced
5347 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5348 extern tree component_ref_field_offset (tree);
5349
5350 /* Describes a "special" array member due to which component_ref_size
5351 returns null. */
5352 enum struct special_array_member
5353 {
5354 none, /* Not a special array member. */
5355 int_0, /* Interior array member with size zero. */
5356 trail_0, /* Trailing array member with size zero. */
5357 trail_1 /* Trailing array member with one element. */
5358 };
5359
5360 /* Return the size of the member referenced by the COMPONENT_REF, using
5361 its initializer expression if necessary in order to determine the size
5362 of an initialized flexible array member. The size might be zero for
5363 an object with an uninitialized flexible array member or null if it
5364 cannot be determined. */
5365 extern tree component_ref_size (tree, special_array_member * = NULL);
5366
5367 extern int tree_map_base_eq (const void *, const void *);
5368 extern unsigned int tree_map_base_hash (const void *);
5369 extern int tree_map_base_marked_p (const void *);
5370 extern void DEBUG_FUNCTION verify_type (const_tree t);
5371 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
5372 bool trust_type_canonical = true);
5373 extern bool type_with_interoperable_signedness (const_tree);
5374 extern bitmap get_nonnull_args (const_tree);
5375 extern int get_range_pos_neg (tree);
5376 extern bool valid_new_delete_pair_p (tree, tree);
5377
5378 /* Return simplified tree code of type that is used for canonical type
5379 merging. */
5380 inline enum tree_code
tree_code_for_canonical_type_merging(enum tree_code code)5381 tree_code_for_canonical_type_merging (enum tree_code code)
5382 {
5383 /* By C standard, each enumerated type shall be compatible with char,
5384 a signed integer, or an unsigned integer. The choice of type is
5385 implementation defined (in our case it depends on -fshort-enum).
5386
5387 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5388 type and compare only by their signedness and precision. */
5389 if (code == ENUMERAL_TYPE)
5390 return INTEGER_TYPE;
5391 /* To allow inter-operability between languages having references and
5392 C, we consider reference types and pointers alike. Note that this is
5393 not strictly necessary for C-Fortran 2008 interoperability because
5394 Fortran define C_PTR type that needs to be compatible with C pointers
5395 and we handle this one as ptr_type_node. */
5396 if (code == REFERENCE_TYPE)
5397 return POINTER_TYPE;
5398 return code;
5399 }
5400
5401 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5402 We don't define the types for pointers, arrays and vectors. The reason is
5403 that pointers are handled specially: ptr_type_node accesses conflict with
5404 accesses to all other pointers. This is done by alias.c.
5405 Because alias sets of arrays and vectors are the same as types of their
5406 elements, we can't compute canonical type either. Otherwise we could go
5407 form void *[10] to int *[10] (because they are equivalent for canonical type
5408 machinery) and get wrong TBAA. */
5409
5410 inline bool
canonical_type_used_p(const_tree t)5411 canonical_type_used_p (const_tree t)
5412 {
5413 return !(POINTER_TYPE_P (t)
5414 || TREE_CODE (t) == ARRAY_TYPE
5415 || TREE_CODE (t) == VECTOR_TYPE);
5416 }
5417
5418 /* Kinds of access to pass-by-reference arguments to functions. */
5419 enum access_mode
5420 {
5421 access_none = 0,
5422 access_read_only = 1,
5423 access_write_only = 2,
5424 access_read_write = access_read_only | access_write_only,
5425 access_deferred = 4
5426 };
5427
5428 #define tree_map_eq tree_map_base_eq
5429 extern unsigned int tree_map_hash (const void *);
5430 #define tree_map_marked_p tree_map_base_marked_p
5431
5432 #define tree_decl_map_eq tree_map_base_eq
5433 extern unsigned int tree_decl_map_hash (const void *);
5434 #define tree_decl_map_marked_p tree_map_base_marked_p
5435
5436 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
5437 {
hashtree_decl_map_cache_hasher5438 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
5439 static bool
equaltree_decl_map_cache_hasher5440 equal (tree_decl_map *a, tree_decl_map *b)
5441 {
5442 return tree_decl_map_eq (a, b);
5443 }
5444
5445 static int
keep_cache_entrytree_decl_map_cache_hasher5446 keep_cache_entry (tree_decl_map *&m)
5447 {
5448 return ggc_marked_p (m->base.from);
5449 }
5450 };
5451
5452 #define tree_int_map_eq tree_map_base_eq
5453 #define tree_int_map_hash tree_map_base_hash
5454 #define tree_int_map_marked_p tree_map_base_marked_p
5455
5456 #define tree_vec_map_eq tree_map_base_eq
5457 #define tree_vec_map_hash tree_decl_map_hash
5458 #define tree_vec_map_marked_p tree_map_base_marked_p
5459
5460 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5461 is a better hash than the pointer value and gives a predictable traversal
5462 order. Additionally it can be used across PCH save/restore. */
5463 struct tree_decl_hash : ggc_ptr_hash <tree_node>
5464 {
5465 static inline hashval_t hash (tree);
5466 };
5467
5468 inline hashval_t
hash(tree t)5469 tree_decl_hash::hash (tree t)
5470 {
5471 return DECL_UID (t);
5472 }
5473
5474 /* Similarly for types. Uses TYPE_UID as hash function. */
5475 struct tree_type_hash : ggc_ptr_hash <tree_node>
5476 {
5477 static inline hashval_t hash (tree);
5478 };
5479
5480 inline hashval_t
hash(tree t)5481 tree_type_hash::hash (tree t)
5482 {
5483 return TYPE_UID (t);
5484 }
5485
5486 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5487 here, but the SSA_NAME_VERSION is a better hash than the pointer
5488 value and gives a predictable traversal order. */
5489 struct tree_ssa_name_hash : ggc_ptr_hash <tree_node>
5490 {
5491 static inline hashval_t hash (tree);
5492 };
5493
5494 inline hashval_t
hash(tree t)5495 tree_ssa_name_hash::hash (tree t)
5496 {
5497 return SSA_NAME_VERSION (t);
5498 }
5499
5500 /* Hasher for general trees, based on their TREE_HASH. */
5501 struct tree_hash : ggc_ptr_hash <tree_node>
5502 {
5503 static hashval_t hash (tree);
5504 };
5505
5506 inline hashval_t
hash(tree t)5507 tree_hash::hash (tree t)
5508 {
5509 return TREE_HASH (t);
5510 }
5511
5512 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5513 such a map will not mark keys, and will mark values if the key is already
5514 marked. */
5515 struct tree_cache_traits
5516 : simple_cache_map_traits<default_hash_traits<tree>, tree> { };
5517 typedef hash_map<tree,tree,tree_cache_traits> tree_cache_map;
5518
5519 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5520 This is for hash_maps from decls to trees that need to work across PCH. */
5521 struct decl_tree_cache_traits
5522 : simple_cache_map_traits<tree_decl_hash, tree> { };
5523 typedef hash_map<tree,tree,decl_tree_cache_traits> decl_tree_cache_map;
5524
5525 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5526 This is for hash_maps from types to trees that need to work across PCH. */
5527 struct type_tree_cache_traits
5528 : simple_cache_map_traits<tree_type_hash, tree> { };
5529 typedef hash_map<tree,tree,type_tree_cache_traits> type_tree_cache_map;
5530
5531 /* Similarly to decl_tree_cache_map, but without caching. */
5532 struct decl_tree_traits
5533 : simple_hashmap_traits<tree_decl_hash, tree> { };
5534 typedef hash_map<tree,tree,decl_tree_traits> decl_tree_map;
5535
5536 /* Initialize the abstract argument list iterator object ITER with the
5537 arguments from CALL_EXPR node EXP. */
5538 static inline void
init_call_expr_arg_iterator(tree exp,call_expr_arg_iterator * iter)5539 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5540 {
5541 iter->t = exp;
5542 iter->n = call_expr_nargs (exp);
5543 iter->i = 0;
5544 }
5545
5546 static inline void
init_const_call_expr_arg_iterator(const_tree exp,const_call_expr_arg_iterator * iter)5547 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5548 {
5549 iter->t = exp;
5550 iter->n = call_expr_nargs (exp);
5551 iter->i = 0;
5552 }
5553
5554 /* Return the next argument from abstract argument list iterator object ITER,
5555 and advance its state. Return NULL_TREE if there are no more arguments. */
5556 static inline tree
next_call_expr_arg(call_expr_arg_iterator * iter)5557 next_call_expr_arg (call_expr_arg_iterator *iter)
5558 {
5559 tree result;
5560 if (iter->i >= iter->n)
5561 return NULL_TREE;
5562 result = CALL_EXPR_ARG (iter->t, iter->i);
5563 iter->i++;
5564 return result;
5565 }
5566
5567 static inline const_tree
next_const_call_expr_arg(const_call_expr_arg_iterator * iter)5568 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5569 {
5570 const_tree result;
5571 if (iter->i >= iter->n)
5572 return NULL_TREE;
5573 result = CALL_EXPR_ARG (iter->t, iter->i);
5574 iter->i++;
5575 return result;
5576 }
5577
5578 /* Initialize the abstract argument list iterator object ITER, then advance
5579 past and return the first argument. Useful in for expressions, e.g.
5580 for (arg = first_call_expr_arg (exp, &iter); arg;
5581 arg = next_call_expr_arg (&iter)) */
5582 static inline tree
first_call_expr_arg(tree exp,call_expr_arg_iterator * iter)5583 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5584 {
5585 init_call_expr_arg_iterator (exp, iter);
5586 return next_call_expr_arg (iter);
5587 }
5588
5589 static inline const_tree
first_const_call_expr_arg(const_tree exp,const_call_expr_arg_iterator * iter)5590 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5591 {
5592 init_const_call_expr_arg_iterator (exp, iter);
5593 return next_const_call_expr_arg (iter);
5594 }
5595
5596 /* Test whether there are more arguments in abstract argument list iterator
5597 ITER, without changing its state. */
5598 static inline bool
more_call_expr_args_p(const call_expr_arg_iterator * iter)5599 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5600 {
5601 return (iter->i < iter->n);
5602 }
5603
5604 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5605 (of type call_expr_arg_iterator) to hold the iteration state. */
5606 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5607 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5608 (arg) = next_call_expr_arg (&(iter)))
5609
5610 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5611 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5612 (arg) = next_const_call_expr_arg (&(iter)))
5613
5614 /* Return true if tree node T is a language-specific node. */
5615 static inline bool
is_lang_specific(const_tree t)5616 is_lang_specific (const_tree t)
5617 {
5618 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5619 }
5620
5621 /* Valid builtin number. */
5622 #define BUILTIN_VALID_P(FNCODE) \
5623 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5624
5625 /* Obtain a pointer to the identifier string holding the asm name for
5626 BUILTIN, a BUILT_IN code. This is handy if the target
5627 mangles/overrides the function name that implements the
5628 builtin. */
5629 #define BUILTIN_ASM_NAME_PTR(BUILTIN) \
5630 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
5631
5632 /* Return the tree node for an explicit standard builtin function or NULL. */
5633 static inline tree
builtin_decl_explicit(enum built_in_function fncode)5634 builtin_decl_explicit (enum built_in_function fncode)
5635 {
5636 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5637
5638 return builtin_info[(size_t)fncode].decl;
5639 }
5640
5641 /* Return the tree node for an implicit builtin function or NULL. */
5642 static inline tree
builtin_decl_implicit(enum built_in_function fncode)5643 builtin_decl_implicit (enum built_in_function fncode)
5644 {
5645 size_t uns_fncode = (size_t)fncode;
5646 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5647
5648 if (!builtin_info[uns_fncode].implicit_p)
5649 return NULL_TREE;
5650
5651 return builtin_info[uns_fncode].decl;
5652 }
5653
5654 /* Set explicit builtin function nodes and whether it is an implicit
5655 function. */
5656
5657 static inline void
set_builtin_decl(enum built_in_function fncode,tree decl,bool implicit_p)5658 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
5659 {
5660 size_t ufncode = (size_t)fncode;
5661
5662 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5663 && (decl != NULL_TREE || !implicit_p));
5664
5665 builtin_info[ufncode].decl = decl;
5666 builtin_info[ufncode].implicit_p = implicit_p;
5667 builtin_info[ufncode].declared_p = false;
5668 }
5669
5670 /* Set the implicit flag for a builtin function. */
5671
5672 static inline void
set_builtin_decl_implicit_p(enum built_in_function fncode,bool implicit_p)5673 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
5674 {
5675 size_t uns_fncode = (size_t)fncode;
5676
5677 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5678 && builtin_info[uns_fncode].decl != NULL_TREE);
5679
5680 builtin_info[uns_fncode].implicit_p = implicit_p;
5681 }
5682
5683 /* Set the declared flag for a builtin function. */
5684
5685 static inline void
set_builtin_decl_declared_p(enum built_in_function fncode,bool declared_p)5686 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
5687 {
5688 size_t uns_fncode = (size_t)fncode;
5689
5690 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5691 && builtin_info[uns_fncode].decl != NULL_TREE);
5692
5693 builtin_info[uns_fncode].declared_p = declared_p;
5694 }
5695
5696 /* Return whether the standard builtin function can be used as an explicit
5697 function. */
5698
5699 static inline bool
builtin_decl_explicit_p(enum built_in_function fncode)5700 builtin_decl_explicit_p (enum built_in_function fncode)
5701 {
5702 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5703 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
5704 }
5705
5706 /* Return whether the standard builtin function can be used implicitly. */
5707
5708 static inline bool
builtin_decl_implicit_p(enum built_in_function fncode)5709 builtin_decl_implicit_p (enum built_in_function fncode)
5710 {
5711 size_t uns_fncode = (size_t)fncode;
5712
5713 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5714 return (builtin_info[uns_fncode].decl != NULL_TREE
5715 && builtin_info[uns_fncode].implicit_p);
5716 }
5717
5718 /* Return whether the standard builtin function was declared. */
5719
5720 static inline bool
builtin_decl_declared_p(enum built_in_function fncode)5721 builtin_decl_declared_p (enum built_in_function fncode)
5722 {
5723 size_t uns_fncode = (size_t)fncode;
5724
5725 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5726 return (builtin_info[uns_fncode].decl != NULL_TREE
5727 && builtin_info[uns_fncode].declared_p);
5728 }
5729
5730 /* Determine if the function identified by FNDECL is one that
5731 makes sense to match by name, for those places where we detect
5732 "magic" functions by name.
5733
5734 Return true if FNDECL has a name and is an extern fndecl at file scope.
5735 FNDECL must be a non-NULL decl.
5736
5737 Avoid using this, as it's generally better to use attributes rather
5738 than to check for functions by name. */
5739
5740 static inline bool
maybe_special_function_p(const_tree fndecl)5741 maybe_special_function_p (const_tree fndecl)
5742 {
5743 tree name_decl = DECL_NAME (fndecl);
5744 if (name_decl
5745 /* Exclude functions not at the file scope, or not `extern',
5746 since they are not the magic functions we would otherwise
5747 think they are. */
5748 && (DECL_CONTEXT (fndecl) == NULL_TREE
5749 || TREE_CODE (DECL_CONTEXT (fndecl)) == TRANSLATION_UNIT_DECL)
5750 && TREE_PUBLIC (fndecl))
5751 return true;
5752 return false;
5753 }
5754
5755 /* Return true if T (assumed to be a DECL) is a global variable.
5756 A variable is considered global if its storage is not automatic. */
5757
5758 static inline bool
is_global_var(const_tree t)5759 is_global_var (const_tree t)
5760 {
5761 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5762 }
5763
5764 /* Return true if VAR may be aliased. A variable is considered as
5765 maybe aliased if it has its address taken by the local TU
5766 or possibly by another TU and might be modified through a pointer. */
5767
5768 static inline bool
may_be_aliased(const_tree var)5769 may_be_aliased (const_tree var)
5770 {
5771 return (TREE_CODE (var) != CONST_DECL
5772 && (TREE_PUBLIC (var)
5773 || DECL_EXTERNAL (var)
5774 || TREE_ADDRESSABLE (var))
5775 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
5776 && (TREE_READONLY (var)
5777 || (TREE_CODE (var) == VAR_DECL
5778 && DECL_NONALIASED (var)))));
5779 }
5780
5781 /* Return pointer to optimization flags of FNDECL. */
5782 static inline struct cl_optimization *
opts_for_fn(const_tree fndecl)5783 opts_for_fn (const_tree fndecl)
5784 {
5785 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
5786 if (fn_opts == NULL_TREE)
5787 fn_opts = optimization_default_node;
5788 return TREE_OPTIMIZATION (fn_opts);
5789 }
5790
5791 /* Return pointer to target flags of FNDECL. */
5792 static inline cl_target_option *
target_opts_for_fn(const_tree fndecl)5793 target_opts_for_fn (const_tree fndecl)
5794 {
5795 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
5796 if (fn_opts == NULL_TREE)
5797 fn_opts = target_option_default_node;
5798 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
5799 }
5800
5801 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5802 the optimization level of function fndecl. */
5803 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5804
5805 /* For anonymous aggregate types, we need some sort of name to
5806 hold on to. In practice, this should not appear, but it should
5807 not be harmful if it does. Identifiers returned will be
5808 IDENTIFIER_ANON_P. */
5809 extern tree make_anon_name ();
5810
5811 /* The tree and const_tree overload templates. */
5812 namespace wi
5813 {
5814 class unextended_tree
5815 {
5816 private:
5817 const_tree m_t;
5818
5819 public:
unextended_tree()5820 unextended_tree () {}
unextended_tree(const_tree t)5821 unextended_tree (const_tree t) : m_t (t) {}
5822
5823 unsigned int get_precision () const;
5824 const HOST_WIDE_INT *get_val () const;
5825 unsigned int get_len () const;
get_tree()5826 const_tree get_tree () const { return m_t; }
5827 };
5828
5829 template <>
5830 struct int_traits <unextended_tree>
5831 {
5832 static const enum precision_type precision_type = VAR_PRECISION;
5833 static const bool host_dependent_precision = false;
5834 static const bool is_sign_extended = false;
5835 };
5836
5837 template <int N>
5838 class extended_tree
5839 {
5840 private:
5841 const_tree m_t;
5842
5843 public:
5844 extended_tree () {}
5845 extended_tree (const_tree);
5846
5847 unsigned int get_precision () const;
5848 const HOST_WIDE_INT *get_val () const;
5849 unsigned int get_len () const;
5850 const_tree get_tree () const { return m_t; }
5851 };
5852
5853 template <int N>
5854 struct int_traits <extended_tree <N> >
5855 {
5856 static const enum precision_type precision_type = CONST_PRECISION;
5857 static const bool host_dependent_precision = false;
5858 static const bool is_sign_extended = true;
5859 static const unsigned int precision = N;
5860 };
5861
5862 typedef extended_tree <WIDE_INT_MAX_PRECISION> widest_extended_tree;
5863 typedef extended_tree <ADDR_MAX_PRECISION> offset_extended_tree;
5864
5865 typedef const generic_wide_int <widest_extended_tree> tree_to_widest_ref;
5866 typedef const generic_wide_int <offset_extended_tree> tree_to_offset_ref;
5867 typedef const generic_wide_int<wide_int_ref_storage<false, false> >
5868 tree_to_wide_ref;
5869
5870 tree_to_widest_ref to_widest (const_tree);
5871 tree_to_offset_ref to_offset (const_tree);
5872 tree_to_wide_ref to_wide (const_tree);
5873 wide_int to_wide (const_tree, unsigned int);
5874
5875 typedef const poly_int <NUM_POLY_INT_COEFFS,
5876 generic_wide_int <widest_extended_tree> >
5877 tree_to_poly_widest_ref;
5878 typedef const poly_int <NUM_POLY_INT_COEFFS,
5879 generic_wide_int <offset_extended_tree> >
5880 tree_to_poly_offset_ref;
5881 typedef const poly_int <NUM_POLY_INT_COEFFS,
5882 generic_wide_int <unextended_tree> >
5883 tree_to_poly_wide_ref;
5884
5885 tree_to_poly_widest_ref to_poly_widest (const_tree);
5886 tree_to_poly_offset_ref to_poly_offset (const_tree);
5887 tree_to_poly_wide_ref to_poly_wide (const_tree);
5888
5889 template <int N>
5890 struct ints_for <generic_wide_int <extended_tree <N> >, CONST_PRECISION>
5891 {
5892 typedef generic_wide_int <extended_tree <N> > extended;
5893 static extended zero (const extended &);
5894 };
5895
5896 template <>
5897 struct ints_for <generic_wide_int <unextended_tree>, VAR_PRECISION>
5898 {
5899 typedef generic_wide_int <unextended_tree> unextended;
5900 static unextended zero (const unextended &);
5901 };
5902 }
5903
5904 /* Used to convert a tree to a widest2_int like this:
5905 widest2_int foo = widest2_int_cst (some_tree). */
5906 typedef generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION * 2> >
5907 widest2_int_cst;
5908
5909 /* Refer to INTEGER_CST T as though it were a widest_int.
5910
5911 This function gives T's actual numerical value, influenced by the
5912 signedness of its type. For example, a signed byte with just the
5913 top bit set would be -128 while an unsigned byte with the same
5914 bit pattern would be 128.
5915
5916 This is the right choice when operating on groups of INTEGER_CSTs
5917 that might have different signedness or precision. It is also the
5918 right choice in code that specifically needs an approximation of
5919 infinite-precision arithmetic instead of normal modulo arithmetic.
5920
5921 The approximation of infinite precision is good enough for realistic
5922 numbers of additions and subtractions of INTEGER_CSTs (where
5923 "realistic" includes any number less than 1 << 31) but it cannot
5924 represent the result of multiplying the two largest supported
5925 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
5926 of multiplying two arbitrary INTEGER_CSTs and checking that the
5927 result is representable as a widest_int.
5928
5929 Note that any overflow checking done on these values is relative to
5930 the range of widest_int rather than the range of a TREE_TYPE.
5931
5932 Calling this function should have no overhead in release builds,
5933 so it is OK to call it several times for the same tree. If it is
5934 useful for readability reasons to reduce the number of calls,
5935 it is more efficient to use:
5936
5937 wi::tree_to_widest_ref wt = wi::to_widest (t);
5938
5939 instead of:
5940
5941 widest_int wt = wi::to_widest (t). */
5942
5943 inline wi::tree_to_widest_ref
5944 wi::to_widest (const_tree t)
5945 {
5946 return t;
5947 }
5948
5949 /* Refer to INTEGER_CST T as though it were an offset_int.
5950
5951 This function is an optimisation of wi::to_widest for cases
5952 in which T is known to be a bit or byte count in the range
5953 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
5954 the target's address size in bits.
5955
5956 This is the right choice when operating on bit or byte counts as
5957 untyped numbers rather than M-bit values. The wi::to_widest comments
5958 about addition, subtraction and multiplication apply here: sequences
5959 of 1 << 31 additions and subtractions do not induce overflow, but
5960 multiplying the largest sizes might. Again,
5961
5962 wi::tree_to_offset_ref wt = wi::to_offset (t);
5963
5964 is more efficient than:
5965
5966 offset_int wt = wi::to_offset (t). */
5967
5968 inline wi::tree_to_offset_ref
5969 wi::to_offset (const_tree t)
5970 {
5971 return t;
5972 }
5973
5974 /* Refer to INTEGER_CST T as though it were a wide_int.
5975
5976 In contrast to the approximation of infinite-precision numbers given
5977 by wi::to_widest and wi::to_offset, this function treats T as a
5978 signless collection of N bits, where N is the precision of T's type.
5979 As with machine registers, signedness is determined by the operation
5980 rather than the operands; for example, there is a distinction between
5981 signed and unsigned division.
5982
5983 This is the right choice when operating on values with the same type
5984 using normal modulo arithmetic. The overflow-checking forms of things
5985 like wi::add check whether the result can be represented in T's type.
5986
5987 Calling this function should have no overhead in release builds,
5988 so it is OK to call it several times for the same tree. If it is
5989 useful for readability reasons to reduce the number of calls,
5990 it is more efficient to use:
5991
5992 wi::tree_to_wide_ref wt = wi::to_wide (t);
5993
5994 instead of:
5995
5996 wide_int wt = wi::to_wide (t). */
5997
5998 inline wi::tree_to_wide_ref
5999 wi::to_wide (const_tree t)
6000 {
6001 return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t),
6002 TYPE_PRECISION (TREE_TYPE (t)));
6003 }
6004
6005 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6006 truncating as necessary. When extending, use sign extension if T's
6007 type is signed and zero extension if T's type is unsigned. */
6008
6009 inline wide_int
6010 wi::to_wide (const_tree t, unsigned int prec)
6011 {
6012 return wide_int::from (wi::to_wide (t), prec, TYPE_SIGN (TREE_TYPE (t)));
6013 }
6014
6015 template <int N>
6016 inline wi::extended_tree <N>::extended_tree (const_tree t)
6017 : m_t (t)
6018 {
6019 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
6020 }
6021
6022 template <int N>
6023 inline unsigned int
6024 wi::extended_tree <N>::get_precision () const
6025 {
6026 return N;
6027 }
6028
6029 template <int N>
6030 inline const HOST_WIDE_INT *
6031 wi::extended_tree <N>::get_val () const
6032 {
6033 return &TREE_INT_CST_ELT (m_t, 0);
6034 }
6035
6036 template <int N>
6037 inline unsigned int
6038 wi::extended_tree <N>::get_len () const
6039 {
6040 if (N == ADDR_MAX_PRECISION)
6041 return TREE_INT_CST_OFFSET_NUNITS (m_t);
6042 else if (N >= WIDE_INT_MAX_PRECISION)
6043 return TREE_INT_CST_EXT_NUNITS (m_t);
6044 else
6045 /* This class is designed to be used for specific output precisions
6046 and needs to be as fast as possible, so there is no fallback for
6047 other casees. */
6048 gcc_unreachable ();
6049 }
6050
6051 inline unsigned int
6052 wi::unextended_tree::get_precision () const
6053 {
6054 return TYPE_PRECISION (TREE_TYPE (m_t));
6055 }
6056
6057 inline const HOST_WIDE_INT *
6058 wi::unextended_tree::get_val () const
6059 {
6060 return &TREE_INT_CST_ELT (m_t, 0);
6061 }
6062
6063 inline unsigned int
6064 wi::unextended_tree::get_len () const
6065 {
6066 return TREE_INT_CST_NUNITS (m_t);
6067 }
6068
6069 /* Return the value of a POLY_INT_CST in its native precision. */
6070
6071 inline wi::tree_to_poly_wide_ref
6072 poly_int_cst_value (const_tree x)
6073 {
6074 poly_int <NUM_POLY_INT_COEFFS, generic_wide_int <wi::unextended_tree> > res;
6075 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6076 res.coeffs[i] = POLY_INT_CST_COEFF (x, i);
6077 return res;
6078 }
6079
6080 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6081 poly_widest_int. See wi::to_widest for more details. */
6082
6083 inline wi::tree_to_poly_widest_ref
6084 wi::to_poly_widest (const_tree t)
6085 {
6086 if (POLY_INT_CST_P (t))
6087 {
6088 poly_int <NUM_POLY_INT_COEFFS,
6089 generic_wide_int <widest_extended_tree> > res;
6090 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6091 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6092 return res;
6093 }
6094 return t;
6095 }
6096
6097 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6098 poly_offset_int. See wi::to_offset for more details. */
6099
6100 inline wi::tree_to_poly_offset_ref
6101 wi::to_poly_offset (const_tree t)
6102 {
6103 if (POLY_INT_CST_P (t))
6104 {
6105 poly_int <NUM_POLY_INT_COEFFS,
6106 generic_wide_int <offset_extended_tree> > res;
6107 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6108 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6109 return res;
6110 }
6111 return t;
6112 }
6113
6114 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6115 poly_wide_int. See wi::to_wide for more details. */
6116
6117 inline wi::tree_to_poly_wide_ref
6118 wi::to_poly_wide (const_tree t)
6119 {
6120 if (POLY_INT_CST_P (t))
6121 return poly_int_cst_value (t);
6122 return t;
6123 }
6124
6125 template <int N>
6126 inline generic_wide_int <wi::extended_tree <N> >
6127 wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6128 wi::CONST_PRECISION>::zero (const extended &x)
6129 {
6130 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6131 }
6132
6133 inline generic_wide_int <wi::unextended_tree>
6134 wi::ints_for <generic_wide_int <wi::unextended_tree>,
6135 wi::VAR_PRECISION>::zero (const unextended &x)
6136 {
6137 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6138 }
6139
6140 namespace wi
6141 {
6142 template <typename T>
6143 bool fits_to_boolean_p (const T &x, const_tree);
6144
6145 template <typename T>
6146 bool fits_to_tree_p (const T &x, const_tree);
6147
6148 wide_int min_value (const_tree);
6149 wide_int max_value (const_tree);
6150 wide_int from_mpz (const_tree, mpz_t, bool);
6151 }
6152
6153 template <typename T>
6154 bool
6155 wi::fits_to_boolean_p (const T &x, const_tree type)
6156 {
6157 typedef typename poly_int_traits<T>::int_type int_type;
6158 return (known_eq (x, int_type (0))
6159 || known_eq (x, int_type (TYPE_UNSIGNED (type) ? 1 : -1)));
6160 }
6161
6162 template <typename T>
6163 bool
6164 wi::fits_to_tree_p (const T &x, const_tree type)
6165 {
6166 /* Non-standard boolean types can have arbitrary precision but various
6167 transformations assume that they can only take values 0 and +/-1. */
6168 if (TREE_CODE (type) == BOOLEAN_TYPE)
6169 return fits_to_boolean_p (x, type);
6170
6171 if (TYPE_UNSIGNED (type))
6172 return known_eq (x, zext (x, TYPE_PRECISION (type)));
6173 else
6174 return known_eq (x, sext (x, TYPE_PRECISION (type)));
6175 }
6176
6177 /* Produce the smallest number that is represented in TYPE. The precision
6178 and sign are taken from TYPE. */
6179 inline wide_int
6180 wi::min_value (const_tree type)
6181 {
6182 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6183 }
6184
6185 /* Produce the largest number that is represented in TYPE. The precision
6186 and sign are taken from TYPE. */
6187 inline wide_int
6188 wi::max_value (const_tree type)
6189 {
6190 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6191 }
6192
6193 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6194 extending both according to their respective TYPE_SIGNs. */
6195
6196 inline bool
6197 tree_int_cst_lt (const_tree t1, const_tree t2)
6198 {
6199 return wi::to_widest (t1) < wi::to_widest (t2);
6200 }
6201
6202 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6203 extending both according to their respective TYPE_SIGNs. */
6204
6205 inline bool
6206 tree_int_cst_le (const_tree t1, const_tree t2)
6207 {
6208 return wi::to_widest (t1) <= wi::to_widest (t2);
6209 }
6210
6211 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6212 are both INTEGER_CSTs and their values are extended according to their
6213 respective TYPE_SIGNs. */
6214
6215 inline int
6216 tree_int_cst_compare (const_tree t1, const_tree t2)
6217 {
6218 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
6219 }
6220
6221 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6222 but none of these files are allowed to be included from front ends.
6223 They should be split in two. One suitable for the FEs, the other suitable
6224 for the BE. */
6225
6226 /* Assign the RTX to declaration. */
6227 extern void set_decl_rtl (tree, rtx);
6228 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
6229
6230 /* Given an expression EXP that is a handled_component_p,
6231 look for the ultimate containing object, which is returned and specify
6232 the access position and size. */
6233 extern tree get_inner_reference (tree, poly_int64_pod *, poly_int64_pod *,
6234 tree *, machine_mode *, int *, int *, int *);
6235
6236 extern tree build_personality_function (const char *);
6237
6238 struct GTY(()) int_n_trees_t {
6239 /* These parts are initialized at runtime */
6240 tree signed_type;
6241 tree unsigned_type;
6242 };
6243
6244 /* This is also in machmode.h */
6245 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
6246 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
6247
6248 /* Like bit_position, but return as an integer. It must be representable in
6249 that way (since it could be a signed value, we don't have the
6250 option of returning -1 like int_size_in_byte can. */
6251
6252 inline HOST_WIDE_INT
6253 int_bit_position (const_tree field)
6254 {
6255 return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT)
6256 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
6257 }
6258
6259 /* Return true if it makes sense to consider alias set for a type T. */
6260
6261 inline bool
6262 type_with_alias_set_p (const_tree t)
6263 {
6264 /* Function and method types are never accessed as memory locations. */
6265 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
6266 return false;
6267
6268 if (COMPLETE_TYPE_P (t))
6269 return true;
6270
6271 /* Incomplete types cannot be accessed in general except for arrays
6272 where we can fetch its element despite we have no array bounds. */
6273 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
6274 return true;
6275
6276 return false;
6277 }
6278
6279 extern location_t set_block (location_t loc, tree block);
6280
6281 extern void gt_ggc_mx (tree &);
6282 extern void gt_pch_nx (tree &);
6283 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
6284
6285 extern bool nonnull_arg_p (const_tree);
6286 extern bool is_empty_type (const_tree);
6287 extern bool default_is_empty_record (const_tree);
6288 extern bool flexible_array_type_p (const_tree);
6289 extern HOST_WIDE_INT arg_int_size_in_bytes (const_tree);
6290 extern tree arg_size_in_bytes (const_tree);
6291 extern bool expr_type_first_operand_type_p (tree_code);
6292
6293 extern location_t
6294 set_source_range (tree expr, location_t start, location_t finish);
6295
6296 extern location_t
6297 set_source_range (tree expr, source_range src_range);
6298
6299 /* Return true if it makes sense to promote/demote from_type to to_type. */
6300 inline bool
6301 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
6302 {
6303 unsigned int to_type_precision = TYPE_PRECISION (to_type);
6304
6305 /* OK to promote if to_type is no bigger than word_mode. */
6306 if (to_type_precision <= GET_MODE_PRECISION (word_mode))
6307 return true;
6308
6309 /* Otherwise, allow only if narrowing or same precision conversions. */
6310 return to_type_precision <= TYPE_PRECISION (from_type);
6311 }
6312
6313 /* Pointer type used to declare builtins before we have seen its real
6314 declaration. */
6315 class builtin_structptr_type
6316 {
6317 public:
6318 tree& node;
6319 tree& base;
6320 const char *str;
6321 };
6322 extern const builtin_structptr_type builtin_structptr_types[6];
6323
6324 /* Return true if type T has the same precision as its underlying mode. */
6325
6326 inline bool
6327 type_has_mode_precision_p (const_tree t)
6328 {
6329 return known_eq (TYPE_PRECISION (t), GET_MODE_PRECISION (TYPE_MODE (t)));
6330 }
6331
6332 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6333
6334 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6335 accessor, as this is impervious to user declaration. */
6336
6337 inline bool
6338 fndecl_built_in_p (const_tree node)
6339 {
6340 return DECL_BUILT_IN_CLASS (node) != NOT_BUILT_IN;
6341 }
6342
6343 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6344 of class KLASS. */
6345
6346 inline bool
6347 fndecl_built_in_p (const_tree node, built_in_class klass)
6348 {
6349 return fndecl_built_in_p (node) && DECL_BUILT_IN_CLASS (node) == klass;
6350 }
6351
6352 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6353 of class KLASS with name equal to NAME. */
6354
6355 inline bool
6356 fndecl_built_in_p (const_tree node, unsigned int name, built_in_class klass)
6357 {
6358 return (fndecl_built_in_p (node, klass)
6359 && DECL_UNCHECKED_FUNCTION_CODE (node) == name);
6360 }
6361
6362 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6363 of BUILT_IN_NORMAL class with name equal to NAME. */
6364
6365 inline bool
6366 fndecl_built_in_p (const_tree node, built_in_function name)
6367 {
6368 return (fndecl_built_in_p (node, BUILT_IN_NORMAL)
6369 && DECL_FUNCTION_CODE (node) == name);
6370 }
6371
6372 /* A struct for encapsulating location information about an operator
6373 and the operation built from it.
6374
6375 m_operator_loc is the location of the operator
6376 m_combined_loc is the location of the compound expression.
6377
6378 For example, given "a && b" the, operator location is:
6379 a && b
6380 ^~
6381 and the combined location is:
6382 a && b
6383 ~~^~~~
6384 Capturing this information allows for class binary_op_rich_location
6385 to provide detailed information about e.g. type mismatches in binary
6386 operations where enough location information is available:
6387
6388 arg_0 op arg_1
6389 ~~~~~ ^~ ~~~~~
6390 | |
6391 | arg1 type
6392 arg0 type
6393
6394 falling back to just showing the combined location:
6395
6396 arg_0 op arg_1
6397 ~~~~~~^~~~~~~~
6398
6399 where it is not. */
6400
6401 class op_location_t
6402 {
6403 public:
6404 location_t m_operator_loc;
6405 location_t m_combined_loc;
6406
6407 /* 1-argument ctor, for constructing from a combined location. */
6408 op_location_t (location_t combined_loc)
6409 : m_operator_loc (UNKNOWN_LOCATION), m_combined_loc (combined_loc)
6410 {}
6411
6412 /* 2-argument ctor, for distinguishing between the operator's location
6413 and the combined location. */
6414 op_location_t (location_t operator_loc, location_t combined_loc)
6415 : m_operator_loc (operator_loc), m_combined_loc (combined_loc)
6416 {}
6417
6418 /* Implicitly convert back to a location_t, using the combined location. */
6419 operator location_t () const { return m_combined_loc; }
6420 };
6421
6422 #endif /* GCC_TREE_H */
6423