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