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