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