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 77508024 : as_combined_fn (internal_fn fn)
39 : {
40 77149083 : 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 4040 : builtin_fn_p (combined_fn code)
47 : {
48 4040 : 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 13332977 : 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 58377964 : internal_fn_p (combined_fn code)
65 : {
66 37579524 : 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 24291317 : as_internal_fn (combined_fn code)
74 : {
75 24301243 : gcc_checking_assert (internal_fn_p (code));
76 24291317 : 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 1510770485 : code_helper () {}
85 3334973631 : code_helper (tree_code code) : rep ((int) code) {}
86 40093874 : code_helper (combined_fn fn) : rep (-(int) fn) {}
87 65151046 : code_helper (internal_fn fn) : rep (-(int) as_combined_fn (fn)) {}
88 323858678 : explicit operator tree_code () const { return (tree_code) rep; }
89 12527618 : explicit operator combined_fn () const { return (combined_fn) -rep; }
90 : explicit operator internal_fn () const;
91 : explicit operator built_in_function () const;
92 933386894 : bool is_tree_code () const { return rep > 0; }
93 2443518 : bool is_fn_code () const { return rep < 0; }
94 : bool is_internal_fn () const;
95 : bool is_builtin_fn () const;
96 685438509 : int get_rep () const { return rep; }
97 : tree_code safe_as_tree_code () const;
98 : combined_fn safe_as_fn_code () const;
99 482 : bool operator== (const code_helper &other) { return rep == other.rep; }
100 99815776 : bool operator!= (const code_helper &other) { return rep != other.rep; }
101 78030654 : bool operator== (tree_code c) { return rep == code_helper (c).rep; }
102 127515567 : 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 1298700 : code_helper::safe_as_tree_code () const
114 : {
115 1599016 : 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 3317055 : inline code_helper::operator internal_fn () const
128 : {
129 3317055 : 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 653633297 : code_helper::is_internal_fn () const
139 : {
140 653629175 : 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 257284364 : get_expr_source_range (tree expr)
1387 : {
1388 257284364 : location_t loc = EXPR_LOCATION (expr);
1389 257284364 : 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 1379127948 : 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 : #define OMP_CLAUSE_NUM_THREADS_STRICT(NODE) \
1868 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS))
1869 : #define OMP_CLAUSE_THREAD_LIMIT_STRICT(NODE) \
1870 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_THREAD_LIMIT))
1871 : #define OMP_CLAUSE_NUM_TEAMS_DIMS(NODE) \
1872 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS))
1873 : #define OMP_CLAUSE_NUM_THREADS_DIMS(NODE) \
1874 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS))
1875 : #define OMP_CLAUSE_THREAD_LIMIT_DIMS(NODE) \
1876 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_THREAD_LIMIT))
1877 :
1878 : /* OpenACC clause expressions */
1879 : #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1880 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1881 : #define OMP_CLAUSE_GANG_EXPR(NODE) \
1882 : OMP_CLAUSE_OPERAND ( \
1883 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1884 : #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1885 : OMP_CLAUSE_OPERAND ( \
1886 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1887 : #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1888 : OMP_CLAUSE_OPERAND ( \
1889 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1890 : #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1891 : OMP_CLAUSE_OPERAND ( \
1892 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1893 : #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1894 : OMP_CLAUSE_OPERAND ( \
1895 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1896 : #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1897 : OMP_CLAUSE_OPERAND ( \
1898 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1899 : #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1900 : OMP_CLAUSE_OPERAND ( \
1901 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1902 : #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1903 : OMP_CLAUSE_OPERAND ( \
1904 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1905 : #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1906 : OMP_CLAUSE_OPERAND ( \
1907 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1908 :
1909 : #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1910 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1911 :
1912 : #define OMP_CLAUSE_DOACROSS_KIND(NODE) \
1913 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS)->omp_clause.subcode.doacross_kind)
1914 :
1915 : #define OMP_CLAUSE_DOACROSS_SINK_NEGATIVE(NODE) \
1916 : TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1917 :
1918 : /* True if DOACROSS clause is spelled as DEPEND. */
1919 : #define OMP_CLAUSE_DOACROSS_DEPEND(NODE) \
1920 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS))
1921 :
1922 : /* If the string passed to the 'message' clause is not null terminated,
1923 : OMP_CLAUSE_MESSAGE_LEN must be set. */
1924 : #define OMP_CLAUSE_MESSAGE_EXPR(NODE) \
1925 : OMP_CLAUSE_OPERAND ( \
1926 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MESSAGE), 0)
1927 : #define OMP_CLAUSE_MESSAGE_LEN(NODE) \
1928 : OMP_CLAUSE_OPERAND ( \
1929 : OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MESSAGE), 1)
1930 : #define OMP_CLAUSE_MESSAGE_SEVERITY_WARN(NODE) \
1931 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MESSAGE)->base.public_flag)
1932 :
1933 : #define OMP_CLAUSE_MAP_KIND(NODE) \
1934 : ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1935 : #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1936 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1937 : = (unsigned int) (MAP_KIND))
1938 :
1939 : #define OMP_CLAUSE_MOTION_PRESENT(NODE) \
1940 : (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_FROM, OMP_CLAUSE_TO)->base.deprecated_flag)
1941 :
1942 : #define OMP_CLAUSE_INIT_TARGET(NODE) \
1943 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INIT)->base.public_flag)
1944 : #define OMP_CLAUSE_INIT_TARGETSYNC(NODE) \
1945 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INIT)->base.deprecated_flag)
1946 : #define OMP_CLAUSE_INIT_PREFER_TYPE(NODE) \
1947 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1948 : OMP_CLAUSE_INIT, \
1949 : OMP_CLAUSE_INIT), 1)
1950 :
1951 : /* Nonzero if this map clause is for array (rather than pointer) based array
1952 : section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1953 : OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1954 : #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1955 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1956 : /* Nonzero if this is a mapped array section, that might need special
1957 : treatment if OMP_CLAUSE_SIZE is zero. */
1958 : #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1959 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1960 : /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1961 : variable or OpenMP map clause mentioned also in in_reduction clause on the
1962 : same construct. */
1963 : #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1964 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1965 : /* Nonzero on map clauses added implicitly for reduction clauses on combined
1966 : or composite constructs. They shall be removed if there is an explicit
1967 : map clause. */
1968 : #define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1969 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1970 : /* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1971 : due to being created through implicit data-mapping rules in the middle-end.
1972 : NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1973 : #define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1974 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1975 : /* Nonzero for an attach/detach node whose decl was explicitly mapped on the
1976 : same directive. */
1977 : #define OMP_CLAUSE_ATTACHMENT_MAPPING_ERASED(NODE) \
1978 : TREE_STATIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1979 : /* Nonzero if this is a release/delete node which refers to a (Fortran) array
1980 : descriptor. */
1981 : #define OMP_CLAUSE_RELEASE_DESCRIPTOR(NODE) \
1982 : TREE_NOTHROW (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1983 :
1984 : /* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1985 : lowering. */
1986 : #define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1987 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1988 :
1989 : /* Nonzero if OpenACC 'readonly' modifier set, used for 'copyin'. */
1990 : #define OMP_CLAUSE_MAP_READONLY(NODE) \
1991 : TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1992 :
1993 : /* Nonzero if the size (or bias) is not known by the front end and needs to be
1994 : adjusted in the middle end. */
1995 : #define OMP_CLAUSE_MAP_SIZE_NEEDS_ADJUSTMENT(NODE) \
1996 : TREE_CONSTANT (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1997 :
1998 : /* Nonzero on a map clause that is only used internally by the gimplifier and
1999 : can thus be removed at the end of the GIMPLE pass. */
2000 : #define OMP_CLAUSE_MAP_GIMPLE_ONLY(NODE) \
2001 : TREE_USED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
2002 :
2003 : /* Same as above, for use in OpenACC cache directives. */
2004 : #define OMP_CLAUSE__CACHE__READONLY(NODE) \
2005 : TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CACHE_))
2006 :
2007 : /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
2008 : clause. */
2009 : #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
2010 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
2011 :
2012 : #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
2013 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
2014 :
2015 : #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
2016 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
2017 :
2018 : #define OMP_CLAUSE_INDIRECT_EXPR(NODE) \
2019 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INDIRECT), 0)
2020 :
2021 :
2022 : /* True if there is a device clause with a device-modifier 'ancestor'. */
2023 : #define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
2024 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
2025 :
2026 : #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
2027 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
2028 : #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
2029 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
2030 : #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
2031 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
2032 :
2033 : #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
2034 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
2035 :
2036 : /* True on an OMP_CLAUSE_ORDERED if stand-alone ordered construct is nested
2037 : inside of work-sharing loop the clause is on. */
2038 : #define OMP_CLAUSE_ORDERED_DOACROSS(NODE) \
2039 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED)->base.public_flag)
2040 :
2041 : /* True for unconstrained modifier on order(concurrent) clause. */
2042 : #define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
2043 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
2044 : /* True for reproducible modifier on order(concurrent) clause. */
2045 : #define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
2046 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
2047 :
2048 : #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
2049 : (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2050 : OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
2051 : #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
2052 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2053 : OMP_CLAUSE_IN_REDUCTION), 1)
2054 : #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
2055 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2056 : OMP_CLAUSE_IN_REDUCTION), 2)
2057 : #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
2058 : (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
2059 : #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
2060 : (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
2061 : #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
2062 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2063 : OMP_CLAUSE_IN_REDUCTION), 3)
2064 : #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
2065 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2066 : OMP_CLAUSE_IN_REDUCTION), 4)
2067 :
2068 : /* True if a REDUCTION clause may reference the original list item (omp_orig)
2069 : in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
2070 : #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
2071 : (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
2072 : OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
2073 :
2074 : /* True if a REDUCTION clause has task reduction-modifier. */
2075 : #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
2076 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
2077 :
2078 : /* True if a REDUCTION clause has inscan reduction-modifier. */
2079 : #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
2080 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
2081 :
2082 : /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
2083 : are always initialized inside of the loop construct, false otherwise. */
2084 : #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
2085 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
2086 :
2087 : /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
2088 : are declared inside of the simd construct. */
2089 : #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
2090 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
2091 :
2092 : /* True if a LINEAR clause has a stride that is variable. */
2093 : #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
2094 : TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
2095 :
2096 : /* True for a LINEAR clause with old style modifier syntax
2097 : linear(modifier(list)) or linear(modifier(list):step). */
2098 : #define OMP_CLAUSE_LINEAR_OLD_LINEAR_MODIFIER(NODE) \
2099 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.addressable_flag)
2100 :
2101 : /* True if a LINEAR clause is for an array or allocatable variable that
2102 : needs special handling by the frontend. */
2103 : #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
2104 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
2105 :
2106 : #define OMP_CLAUSE_LINEAR_STEP(NODE) \
2107 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
2108 :
2109 : #define OMP_CLAUSE_LINEAR_STMT(NODE) \
2110 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
2111 :
2112 : #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
2113 : (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
2114 :
2115 : #define OMP_CLAUSE_LINEAR_KIND(NODE) \
2116 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
2117 :
2118 : #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
2119 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
2120 :
2121 : #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
2122 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
2123 :
2124 : #define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
2125 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
2126 :
2127 : /* True if an ALLOCATE clause was present on a combined or composite
2128 : construct and the code for splitting the clauses has already performed
2129 : checking if the listed variable has explicit privatization on the
2130 : construct. */
2131 : #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
2132 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
2133 :
2134 : #define OMP_CLAUSE_USES_ALLOCATORS_ALLOCATOR(NODE) \
2135 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USES_ALLOCATORS), 0)
2136 :
2137 : #define OMP_CLAUSE_USES_ALLOCATORS_MEMSPACE(NODE) \
2138 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USES_ALLOCATORS), 1)
2139 :
2140 : #define OMP_CLAUSE_USES_ALLOCATORS_TRAITS(NODE) \
2141 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USES_ALLOCATORS), 2)
2142 :
2143 : #define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
2144 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
2145 :
2146 : #define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
2147 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
2148 :
2149 : #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
2150 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2151 : OMP_CLAUSE_THREAD_LIMIT), 0)
2152 :
2153 : #define OMP_CLAUSE_DEVICE_ID(NODE) \
2154 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
2155 :
2156 : #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
2157 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2158 : OMP_CLAUSE_DIST_SCHEDULE), 0)
2159 :
2160 : #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
2161 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
2162 :
2163 : #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
2164 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
2165 :
2166 : #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
2167 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
2168 :
2169 : #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
2170 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
2171 :
2172 : /* True if a SCHEDULE clause has the simd modifier on it. */
2173 : #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
2174 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
2175 :
2176 : #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
2177 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
2178 :
2179 : #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
2180 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
2181 : #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
2182 : ((enum omp_clause_defaultmap_kind) \
2183 : (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
2184 : #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
2185 : ((enum omp_clause_defaultmap_kind) \
2186 : (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
2187 : #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
2188 : (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
2189 : = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
2190 :
2191 : #define OMP_CLAUSE_BIND_KIND(NODE) \
2192 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
2193 :
2194 : #define OMP_CLAUSE_DYN_GROUPPRIVATE_EXPR(NODE) \
2195 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DYN_GROUPPRIVATE), 0)
2196 : #define OMP_CLAUSE_DYN_GROUPPRIVATE_KIND(NODE) \
2197 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DYN_GROUPPRIVATE)->omp_clause.subcode.fallback_kind)
2198 :
2199 : /* True if ENTER clause is spelled as TO. */
2200 : #define OMP_CLAUSE_ENTER_TO(NODE) \
2201 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ENTER)->base.public_flag)
2202 :
2203 : #define OMP_CLAUSE_TILE_LIST(NODE) \
2204 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
2205 : #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
2206 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
2207 : #define OMP_CLAUSE_TILE_COUNT(NODE) \
2208 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
2209 :
2210 : /* _CONDTEMP_ holding temporary with iteration count. */
2211 : #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
2212 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
2213 :
2214 : /* _SCANTEMP_ holding temporary with pointer to thread's local array;
2215 : allocation. */
2216 : #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
2217 : (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
2218 :
2219 : /* _SCANTEMP_ holding temporary with a control variable for deallocation;
2220 : one boolean_type_node for test whether alloca was used, another one
2221 : to pass to __builtin_stack_restore or free. */
2222 : #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
2223 : TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
2224 :
2225 : /* OpenMP OMP_NEXT_VARIANT accessors. */
2226 : #define OMP_NEXT_VARIANT_INDEX(NODE) \
2227 : TREE_OPERAND (OMP_NEXT_VARIANT_CHECK (NODE), 0)
2228 : #define OMP_NEXT_VARIANT_STATE(NODE) \
2229 : TREE_OPERAND (OMP_NEXT_VARIANT_CHECK (NODE), 1)
2230 :
2231 : /* OpenMP OMP_TARGET_DEVICE_MATCHES accessors. */
2232 : #define OMP_TARGET_DEVICE_MATCHES_SELECTOR(NODE) \
2233 : TREE_OPERAND (OMP_TARGET_DEVICE_MATCHES_CHECK (NODE), 0)
2234 : #define OMP_TARGET_DEVICE_MATCHES_PROPERTIES(NODE) \
2235 : TREE_OPERAND (OMP_TARGET_DEVICE_MATCHES_CHECK (NODE), 1)
2236 :
2237 : #define OMP_CLAUSE__MAPPER_BINDING__ID(NODE) \
2238 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2239 : OMP_CLAUSE__MAPPER_BINDING_), 0)
2240 :
2241 : #define OMP_CLAUSE__MAPPER_BINDING__DECL(NODE) \
2242 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2243 : OMP_CLAUSE__MAPPER_BINDING_), 1)
2244 :
2245 : #define OMP_CLAUSE__MAPPER_BINDING__MAPPER(NODE) \
2246 : OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2247 : OMP_CLAUSE__MAPPER_BINDING_), 2)
2248 :
2249 : /* SSA_NAME accessors. */
2250 :
2251 : /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
2252 : information in the underlying SSA_NAME_VAR for efficiency. */
2253 : #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
2254 : SSA_NAME_CHECK (NODE)->base.public_flag
2255 :
2256 : /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
2257 : if there is no name associated with it. */
2258 : #define SSA_NAME_IDENTIFIER(NODE) \
2259 : (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
2260 : ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2261 : ? (NODE)->ssa_name.var \
2262 : : DECL_NAME ((NODE)->ssa_name.var)) \
2263 : : NULL_TREE)
2264 :
2265 : /* Returns the variable being referenced. This can be NULL_TREE for
2266 : temporaries not associated with any user variable.
2267 : Once released, this is the only field that can be relied upon. */
2268 : #define SSA_NAME_VAR(NODE) \
2269 : (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
2270 : || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2271 : ? NULL_TREE : (NODE)->ssa_name.var)
2272 :
2273 : #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
2274 : do \
2275 : { \
2276 : tree var_ = (VAR); \
2277 : SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
2278 : SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
2279 : = (var_ \
2280 : && TREE_CODE (var_) == VAR_DECL \
2281 : && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
2282 : } \
2283 : while (0)
2284 :
2285 : /* Returns the statement which defines this SSA name. */
2286 : #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
2287 :
2288 : /* Returns the SSA version number of this SSA name. Note that in
2289 : tree SSA, version numbers are not per variable and may be recycled. */
2290 : #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
2291 :
2292 : /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
2293 : never output, so we can safely use the ASM_WRITTEN_FLAG for this
2294 : status bit. */
2295 : #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
2296 : SSA_NAME_CHECK (NODE)->base.asm_written_flag
2297 :
2298 : /* Nonzero if this SSA_NAME expression is currently on the free list of
2299 : SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
2300 : has no meaning for an SSA_NAME. */
2301 : #define SSA_NAME_IN_FREE_LIST(NODE) \
2302 : SSA_NAME_CHECK (NODE)->base.nothrow_flag
2303 :
2304 : /* Nonzero if this SSA_NAME is the default definition for the
2305 : underlying symbol. A default SSA name is created for symbol S if
2306 : the very first reference to S in the function is a read operation.
2307 : Default definitions are always created by an empty statement and
2308 : belong to no basic block. */
2309 : #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2310 : SSA_NAME_CHECK (NODE)->base.default_def_flag
2311 :
2312 : /* Nonzero if this SSA_NAME is known to point to memory that may not
2313 : be written to. This is set for default defs of function parameters
2314 : that have a corresponding r or R specification in the functions
2315 : fn spec attribute. This is used by alias analysis. */
2316 : #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
2317 : SSA_NAME_CHECK (NODE)->base.deprecated_flag
2318 :
2319 : /* Attributes for SSA_NAMEs for pointer-type variables. */
2320 : #define SSA_NAME_PTR_INFO(N) \
2321 : SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
2322 :
2323 : /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
2324 : #define SSA_NAME_RANGE_INFO(N) \
2325 : SSA_NAME_CHECK (N)->ssa_name.info.range_info
2326 :
2327 : /* Return the immediate_use information for an SSA_NAME. */
2328 : #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2329 :
2330 : #define OMP_CLAUSE_CODE(NODE) \
2331 : (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2332 :
2333 : #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2334 : ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2335 :
2336 : #define OMP_CLAUSE_OPERAND(NODE, I) \
2337 : OMP_CLAUSE_ELT_CHECK (NODE, I)
2338 :
2339 : /* True if the clause decl NODE contains an OpenMP iterator. */
2340 : #define OMP_ITERATOR_DECL_P(NODE) \
2341 : (TREE_CODE (NODE) == TREE_LIST \
2342 : && TREE_PURPOSE (NODE) \
2343 : && TREE_CODE (TREE_PURPOSE (NODE)) == TREE_VEC)
2344 :
2345 : /* In a BLOCK (scope) node:
2346 : Variables declared in the scope NODE. */
2347 : #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2348 : #define BLOCK_NONLOCALIZED_VARS(NODE) \
2349 : (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2350 : #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2351 : vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2352 : #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2353 : /* A chain of BLOCKs (scopes) nested within the scope NODE. */
2354 : #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2355 : /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2356 : function scope. Inlined functions are chained by this so that given
2357 : expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2358 : in which E has been made or into which E has been inlined. */
2359 : #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2360 : /* Points to the next scope at the same level of nesting as scope NODE. */
2361 : #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2362 : /* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2363 : inlined. In a scope immediately enclosing an inlined leaf expression,
2364 : points to the outermost scope into which it has been inlined (thus
2365 : bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2366 : #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2367 : #define BLOCK_ORIGIN(NODE) \
2368 : (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2369 : #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2370 :
2371 : /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2372 : #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2373 :
2374 : /* True if BLOCK appears in cold section. */
2375 : #define BLOCK_IN_COLD_SECTION_P(NODE) \
2376 : (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2377 :
2378 : /* An index number for this block. These values are not guaranteed to
2379 : be unique across functions -- whether or not they are depends on
2380 : the debugging output format in use. */
2381 : #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2382 :
2383 : /* If block reordering splits a lexical block into discontiguous
2384 : address ranges, we'll make a copy of the original block.
2385 :
2386 : Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2387 : In that case, we have one source block that has been replicated
2388 : (through inlining or unrolling) into many logical blocks, and that
2389 : these logical blocks have different physical variables in them.
2390 :
2391 : In this case, we have one logical block split into several
2392 : non-contiguous address ranges. Most debug formats can't actually
2393 : represent this idea directly, so we fake it by creating multiple
2394 : logical blocks with the same variables in them. However, for those
2395 : that do support non-contiguous regions, these allow the original
2396 : logical block to be reconstructed, along with the set of address
2397 : ranges.
2398 :
2399 : One of the logical block fragments is arbitrarily chosen to be
2400 : the ORIGIN. The other fragments will point to the origin via
2401 : BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2402 : be null. The list of fragments will be chained through
2403 : BLOCK_FRAGMENT_CHAIN from the origin. */
2404 :
2405 : #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2406 : #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2407 :
2408 : /* For an inlined function, this gives the location where it was called
2409 : from. This is only set in the top level block, which corresponds to the
2410 : inlined function scope. This is used in the debug output routines. */
2411 :
2412 : #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2413 :
2414 : /* This gives the location of the end of the block, useful to attach
2415 : code implicitly generated for outgoing paths. */
2416 :
2417 : #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2418 :
2419 : /* Define fields and accessors for nodes representing data types. */
2420 :
2421 : /* See tree.def for documentation of the use of these fields.
2422 : Look at the documentation of the various ..._TYPE tree codes.
2423 :
2424 : Note that the type.values, type.minval, and type.maxval fields are
2425 : overloaded and used for different macros in different kinds of types.
2426 : Each macro must check to ensure the tree node is of the proper kind of
2427 : type. Note also that some of the front-ends also overload these fields,
2428 : so they must be checked as well. */
2429 :
2430 : #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2431 : /* Type size in bits as a tree expression. Need not be constant and may
2432 : be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2433 : class subobject with its own virtual base classes (which are laid out
2434 : separately). */
2435 : #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2436 : /* Likewise, type size in bytes. */
2437 : #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2438 : #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2439 : #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2440 : #define TYPE_PRECISION(NODE) \
2441 : (TREE_NOT_CHECK (TYPE_CHECK (NODE), VECTOR_TYPE)->type_common.precision)
2442 : #define TYPE_PRECISION_RAW(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2443 : #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2444 : #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2445 : #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2446 : #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2447 :
2448 : #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2449 : #define TYPE_MODE(NODE) \
2450 : (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2451 : ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2452 : #define SCALAR_TYPE_MODE(NODE) \
2453 : (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2454 : #define SCALAR_INT_TYPE_MODE(NODE) \
2455 : (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2456 : #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2457 : (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2458 : #define SET_TYPE_MODE(NODE, MODE) \
2459 : (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2460 :
2461 : extern unsigned int element_precision (const_tree);
2462 : extern machine_mode element_mode (const_tree);
2463 : extern machine_mode vector_type_mode (const_tree);
2464 : extern unsigned int vector_element_bits (const_tree);
2465 : extern tree vector_element_bits_tree (const_tree);
2466 :
2467 : /* The "canonical" type for this type node, which is used by frontends to
2468 : compare the type for equality with another type. If two types are
2469 : equal (based on the semantics of the language), then they will have
2470 : equivalent TYPE_CANONICAL entries.
2471 :
2472 : As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2473 : TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2474 : be used for comparison against other types. Instead, the type is
2475 : said to require structural equality checks, described in
2476 : TYPE_STRUCTURAL_EQUALITY_P.
2477 :
2478 : For unqualified aggregate and function types the middle-end relies on
2479 : TYPE_CANONICAL to tell whether two variables can be assigned
2480 : to each other without a conversion. The middle-end also makes sure
2481 : to assign the same alias-sets to the type partition with equal
2482 : TYPE_CANONICAL of their unqualified variants. */
2483 : #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2484 : /* Indicates that the type node requires structural equality
2485 : checks. The compiler will need to look at the composition of the
2486 : type to determine whether it is equal to another type, rather than
2487 : just comparing canonical type pointers. For instance, we would need
2488 : to look at the return and parameter types of a FUNCTION_TYPE
2489 : node. */
2490 : #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2491 : /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2492 : type node requires structural equality. */
2493 : #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2494 :
2495 : #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2496 : #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2497 :
2498 : /* The (language-specific) typed-based alias set for this type.
2499 : Objects whose TYPE_ALIAS_SETs are different cannot alias each
2500 : other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2501 : assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2502 : type can alias objects of any type. */
2503 : #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2504 :
2505 : /* Nonzero iff the typed-based alias set for this type has been
2506 : calculated. */
2507 : #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2508 : (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2509 :
2510 : /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2511 : to this type. */
2512 : #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2513 :
2514 : /* Raw access to the alignment field. */
2515 : #define TYPE_ALIGN_RAW(NODE) \
2516 : (TYPE_CHECK (NODE)->type_common.align)
2517 :
2518 : /* The alignment necessary for objects of this type.
2519 : The value is an int, measured in bits and must be a power of two.
2520 : We support also an "alignment" of zero. */
2521 : #define TYPE_ALIGN(NODE) \
2522 : (TYPE_ALIGN_RAW (NODE) \
2523 : ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2524 :
2525 : /* Specify that TYPE_ALIGN(NODE) is X. */
2526 : #define SET_TYPE_ALIGN(NODE, X) \
2527 : (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2528 :
2529 : /* 1 if the alignment for this type was requested by "aligned" attribute,
2530 : 0 if it is the default for this type. */
2531 : #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2532 :
2533 : /* The alignment for NODE, in bytes. */
2534 : #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2535 :
2536 : /* The minimum alignment necessary for objects of this type without
2537 : warning. The value is an int, measured in bits. */
2538 : #define TYPE_WARN_IF_NOT_ALIGN_RAW(NODE) \
2539 : (TYPE_CHECK (NODE)->type_common.warn_if_not_align)
2540 : #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2541 : (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) \
2542 : ? ((unsigned)1) << (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2543 :
2544 : /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2545 : #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2546 : (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2547 :
2548 : /* If your language allows you to declare types, and you want debug info
2549 : for them, then you need to generate corresponding TYPE_DECL nodes.
2550 : These "stub" TYPE_DECL nodes have no name, and simply point at the
2551 : type node. You then set the TYPE_STUB_DECL field of the type node
2552 : to point back at the TYPE_DECL node. This allows the debug routines
2553 : to know that the two nodes represent the same type, so that we only
2554 : get one debug info record for them. */
2555 : #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2556 :
2557 : /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2558 : the type has BLKmode only because it lacks the alignment required for
2559 : its size. */
2560 : #define TYPE_NO_FORCE_BLK(NODE) \
2561 : (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2562 :
2563 : /* Nonzero in a type considered volatile as a whole. */
2564 : #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2565 :
2566 : /* Nonzero in a type considered atomic as a whole. */
2567 : #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2568 :
2569 : /* Means this type is const-qualified. */
2570 : #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2571 :
2572 : /* If nonzero, this type is `restrict'-qualified, in the C sense of
2573 : the term. */
2574 : #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2575 :
2576 : /* If nonzero, type's name shouldn't be emitted into debug info. */
2577 : #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2578 :
2579 : /* The address space the type is in. */
2580 : #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2581 :
2582 : /* Encode/decode the named memory support as part of the qualifier. If more
2583 : than 8 qualifiers are added, these macros need to be adjusted. */
2584 : #define ENCODE_QUAL_ADDR_SPACE(NUM) (((NUM) & 0xFF) << 8)
2585 : #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2586 :
2587 : /* Return all qualifiers except for the address space qualifiers. */
2588 : #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2589 :
2590 : /* Only keep the address space out of the qualifiers and discard the other
2591 : qualifiers. */
2592 : #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2593 :
2594 : /* The set of type qualifiers for this type. */
2595 : #define TYPE_QUALS(NODE) \
2596 : ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2597 : | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2598 : | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2599 : | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2600 : | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2601 :
2602 : /* The same as TYPE_QUALS without the address space qualifications. */
2603 : #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2604 : ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2605 : | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2606 : | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2607 : | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2608 :
2609 : /* The same as TYPE_QUALS without the address space and atomic
2610 : qualifications. */
2611 : #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2612 : ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2613 : | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2614 : | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2615 :
2616 : /* These flags are available for each language front end to use internally. */
2617 : #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2618 : #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2619 : #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2620 : #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2621 : #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2622 : #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2623 : #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2624 : #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2625 :
2626 : /* Used to keep track of visited nodes in tree traversals. This is set to
2627 : 0 by copy_node and make_node. */
2628 : #define TREE_VISITED(NODE) ((NODE)->base.visited)
2629 :
2630 : /* If set in an ARRAY_TYPE, indicates a string type (for languages
2631 : that distinguish string from array of char).
2632 : If set in a INTEGER_TYPE, indicates a character type. */
2633 : #define TYPE_STRING_FLAG(NODE) \
2634 : (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2635 :
2636 : /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2637 : to the C++ one definition rule. This is used for LTO canonical type
2638 : computation. */
2639 : #define TYPE_CXX_ODR_P(NODE) \
2640 : (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2641 :
2642 : /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2643 : about missing conversions to other vector types of the same size. */
2644 : #define TYPE_VECTOR_OPAQUE(NODE) \
2645 : (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2646 :
2647 : /* Indicates that objects of this type must be initialized by calling a
2648 : function when they are created. */
2649 : #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2650 : (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2651 :
2652 : /* Indicates that a UNION_TYPE object should be passed the same way that
2653 : the first union alternative would be passed, or that a RECORD_TYPE
2654 : object should be passed the same way that the first (and only) member
2655 : would be passed. */
2656 : #define TYPE_TRANSPARENT_AGGR(NODE) \
2657 : (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2658 :
2659 : /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2660 : address of a component of the type. This is the counterpart of
2661 : DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2662 : #define TYPE_NONALIASED_COMPONENT(NODE) \
2663 : (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2664 :
2665 : /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2666 : whether the array is typeless storage or the type contains a member
2667 : with this flag set. Such types are exempt from type-based alias
2668 : analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2669 : the flag should be inherited from the element type, can change
2670 : when type is finalized and because of that should not be used in
2671 : type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2672 : the flag should not be changed after the array is created and should
2673 : be used in type hashing. */
2674 : #define TYPE_TYPELESS_STORAGE(NODE) \
2675 : (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2676 : ARRAY_TYPE)->type_common.typeless_storage)
2677 :
2678 : /* Indicated that objects of this type should be laid out in as
2679 : compact a way as possible. */
2680 : #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2681 :
2682 : /* Used by type_contains_placeholder_p to avoid recomputation.
2683 : Values are: 0 (unknown), 1 (false), 2 (true). Never access
2684 : this field directly. */
2685 : #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2686 : (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2687 :
2688 : /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2689 : #define TYPE_FINAL_P(NODE) \
2690 : (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2691 :
2692 : /* The debug output functions use the symtab union field to store
2693 : information specific to the debugging format. The different debug
2694 : output hooks store different types in the union field. These three
2695 : macros are used to access different fields in the union. The debug
2696 : hooks are responsible for consistently using only a specific
2697 : macro. */
2698 :
2699 : /* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2700 : hold the type's number in the generated stabs. */
2701 : #define TYPE_SYMTAB_ADDRESS(NODE) \
2702 : (TYPE_CHECK (NODE)->type_common.symtab.address)
2703 :
2704 : /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2705 : in dwarf2out.cc to point to the DIE generated for the type. */
2706 : #define TYPE_SYMTAB_DIE(NODE) \
2707 : (TYPE_CHECK (NODE)->type_common.symtab.die)
2708 :
2709 : /* The garbage collector needs to know the interpretation of the
2710 : symtab field. These constants represent the different types in the
2711 : union. */
2712 :
2713 : #define TYPE_SYMTAB_IS_ADDRESS (0)
2714 : #define TYPE_SYMTAB_IS_DIE (1)
2715 :
2716 : #define TYPE_LANG_SPECIFIC(NODE) \
2717 : (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2718 :
2719 : #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2720 : #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2721 : #define TYPE_FIELDS(NODE) \
2722 : (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2723 : #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2724 : #define TYPE_ARG_TYPES(NODE) \
2725 : (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2726 : #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2727 :
2728 : #define TYPE_MIN_VALUE(NODE) \
2729 : (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2730 : #define TYPE_NEXT_PTR_TO(NODE) \
2731 : (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2732 : #define TYPE_NEXT_REF_TO(NODE) \
2733 : (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2734 : #define TYPE_VFIELD(NODE) \
2735 : (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2736 : #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2737 :
2738 : #define TYPE_MAX_VALUE(NODE) \
2739 : (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2740 : #define TYPE_METHOD_BASETYPE(NODE) \
2741 : (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2742 : #define TYPE_OFFSET_BASETYPE(NODE) \
2743 : (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2744 : /* If non-NULL, this is an upper bound of the size (in bytes) of an
2745 : object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2746 : allocated. */
2747 : #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2748 : (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2749 : #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2750 : /* For record and union types, information about this type, as a base type
2751 : for itself. */
2752 : #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2753 :
2754 : /* For types, used in a language-dependent way. */
2755 : #define TYPE_LANG_SLOT_1(NODE) \
2756 : (TYPE_CHECK (NODE)->type_non_common.lang_1)
2757 :
2758 : /* Define accessor macros for information about type inheritance
2759 : and basetypes.
2760 :
2761 : A "basetype" means a particular usage of a data type for inheritance
2762 : in another type. Each such basetype usage has its own "binfo"
2763 : object to describe it. The binfo object is a TREE_VEC node.
2764 :
2765 : Inheritance is represented by the binfo nodes allocated for a
2766 : given type. For example, given types C and D, such that D is
2767 : inherited by C, 3 binfo nodes will be allocated: one for describing
2768 : the binfo properties of C, similarly one for D, and one for
2769 : describing the binfo properties of D as a base type for C.
2770 : Thus, given a pointer to class C, one can get a pointer to the binfo
2771 : of D acting as a basetype for C by looking at C's binfo's basetypes. */
2772 :
2773 : /* BINFO specific flags. */
2774 :
2775 : /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2776 : #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2777 :
2778 : /* Flags for language dependent use. */
2779 : #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2780 : #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2781 : #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2782 : #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2783 : #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2784 : #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2785 : #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2786 :
2787 : /* The actual data type node being inherited in this basetype. */
2788 : #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2789 :
2790 : /* The offset where this basetype appears in its containing type.
2791 : BINFO_OFFSET slot holds the offset (in bytes)
2792 : from the base of the complete object to the base of the part of the
2793 : object that is allocated on behalf of this `type'.
2794 : This is always 0 except when there is multiple inheritance. */
2795 :
2796 : #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2797 : #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2798 :
2799 : /* The virtual function table belonging to this basetype. Virtual
2800 : function tables provide a mechanism for run-time method dispatching.
2801 : The entries of a virtual function table are language-dependent. */
2802 :
2803 : #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2804 :
2805 : /* The virtual functions in the virtual function table. This is
2806 : a TREE_LIST that is used as an initial approximation for building
2807 : a virtual function table for this basetype. */
2808 : #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2809 :
2810 : /* A vector of binfos for the direct basetypes inherited by this
2811 : basetype.
2812 :
2813 : If this basetype describes type D as inherited in C, and if the
2814 : basetypes of D are E and F, then this vector contains binfos for
2815 : inheritance of E and F by C. */
2816 : #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2817 :
2818 : /* The number of basetypes for NODE. */
2819 : #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2820 :
2821 : /* Accessor macro to get to the Nth base binfo of this binfo. */
2822 : #define BINFO_BASE_BINFO(NODE,N) \
2823 : ((*BINFO_BASE_BINFOS (NODE))[(N)])
2824 : #define BINFO_BASE_ITERATE(NODE,N,B) \
2825 : (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2826 : #define BINFO_BASE_APPEND(NODE,T) \
2827 : (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2828 :
2829 : /* For a BINFO record describing a virtual base class, i.e., one where
2830 : TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2831 : base. The actual contents are language-dependent. In the C++
2832 : front-end this field is an INTEGER_CST giving an offset into the
2833 : vtable where the offset to the virtual base can be found. */
2834 : #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2835 :
2836 : /* Indicates the accesses this binfo has to its bases. The values are
2837 : access_public_node, access_protected_node or access_private_node.
2838 : If this vector is not present, public access is implied. If present,
2839 : the vector should have BINFO_N_BASE_BINFOS or larger length. Elements
2840 : beyond BINFO_N_BASE_BINFOS are base attributes instead of the
2841 : access_p*_node values for base with index IDX at IDX + BINFO_N_BASE_BINFOS
2842 : index. If that is beyond the length of the vector, no attributes for
2843 : that base is implied. */
2844 : #define BINFO_BASE_ACCESSES(NODE) \
2845 : (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2846 :
2847 : #define BINFO_BASE_ACCESS(NODE,N) \
2848 : (*BINFO_BASE_ACCESSES (NODE))[(N)]
2849 : #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2850 : BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2851 :
2852 : /* The index in the VTT where this subobject's sub-VTT can be found.
2853 : NULL_TREE if there is no sub-VTT. */
2854 : #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2855 :
2856 : /* The index in the VTT where the vptr for this subobject can be
2857 : found. NULL_TREE if there is no secondary vptr in the VTT. */
2858 : #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2859 :
2860 : /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2861 : inheriting this base for non-virtual bases. For virtual bases it
2862 : points either to the binfo for which this is a primary binfo, or to
2863 : the binfo of the most derived type. */
2864 : #define BINFO_INHERITANCE_CHAIN(NODE) \
2865 : (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2866 :
2867 :
2868 : /* Define fields and accessors for nodes representing declared names. */
2869 :
2870 : /* Nonzero if DECL represents an SSA name or a variable that can possibly
2871 : have an associated SSA name. */
2872 : #define SSA_VAR_P(DECL) \
2873 : (TREE_CODE (DECL) == VAR_DECL \
2874 : || TREE_CODE (DECL) == PARM_DECL \
2875 : || TREE_CODE (DECL) == RESULT_DECL \
2876 : || TREE_CODE (DECL) == SSA_NAME)
2877 :
2878 :
2879 : #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2880 :
2881 : /* This is the name of the object as written by the user.
2882 : It is an IDENTIFIER_NODE. */
2883 : #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2884 :
2885 : /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2886 : #define TYPE_IDENTIFIER(NODE) \
2887 : (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2888 : ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2889 :
2890 : /* Every ..._DECL node gets a unique number. */
2891 : #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2892 :
2893 : /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2894 : uses. */
2895 : #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2896 :
2897 : /* Every ..._DECL node gets a unique number that stays the same even
2898 : when the decl is copied by the inliner once it is set. */
2899 : #define DECL_PT_UID(NODE) \
2900 : (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2901 : ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2902 : /* Initialize the ..._DECL node pt-uid to the decls uid. */
2903 : #define SET_DECL_PT_UID(NODE, UID) \
2904 : (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2905 : /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2906 : be preserved when copyin the decl. */
2907 : #define DECL_PT_UID_SET_P(NODE) \
2908 : (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2909 :
2910 : /* These two fields describe where in the source code the declaration
2911 : was. If the declaration appears in several places (as for a C
2912 : function that is declared first and then defined later), this
2913 : information should refer to the definition. */
2914 : #define DECL_SOURCE_LOCATION(NODE) \
2915 : (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2916 : #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2917 : #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2918 : #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2919 : /* This decl was created by a front-end or back-end rather than by
2920 : user code, and has not been explicitly declared by the user -- when
2921 : that happens the source location is updated to the user's
2922 : source. This includes decls with no location (!). */
2923 : #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2924 : (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2925 :
2926 : /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2927 : QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2928 : PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2929 : nodes, this points to either the FUNCTION_DECL for the containing
2930 : function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2931 : NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2932 : scope". In particular, for VAR_DECLs which are virtual table pointers
2933 : (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2934 : they belong to. */
2935 : #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2936 : #define DECL_FIELD_CONTEXT(NODE) \
2937 : (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2938 :
2939 : /* If nonzero, decl's name shouldn't be emitted into debug info. */
2940 : #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2941 :
2942 : /* For any sort of a ..._DECL node, this points to the original (abstract)
2943 : decl node which this decl is an inlined/cloned instance of, or else it
2944 : is NULL indicating that this decl is not an instance of some other decl.
2945 :
2946 : The C front-end also uses this in a nested declaration of an inline
2947 : function, to point back to the definition. */
2948 : #define DECL_ABSTRACT_ORIGIN(NODE) \
2949 : (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2950 :
2951 : /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2952 : origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2953 : #define DECL_ORIGIN(NODE) \
2954 : (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2955 :
2956 : /* Nonzero for any sort of ..._DECL node means this decl node represents an
2957 : inline instance of some original (abstract) decl from an inline function;
2958 : suppress any warnings about shadowing some other variable. FUNCTION_DECL
2959 : nodes can also have their abstract origin set to themselves. */
2960 : #define DECL_FROM_INLINE(NODE) \
2961 : (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2962 : && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2963 :
2964 : /* In a DECL this is the field where attributes are stored. */
2965 : #define DECL_ATTRIBUTES(NODE) \
2966 : (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2967 :
2968 : /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2969 : For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2970 : For a VAR_DECL, holds the initial value.
2971 : For a PARM_DECL, used for DECL_ARG_TYPE--default
2972 : values for parameters are encoded in the type of the function,
2973 : not in the PARM_DECL slot.
2974 : For a FIELD_DECL, this is used for enumeration values and the C
2975 : frontend uses it for temporarily storing bitwidth of bitfields.
2976 :
2977 : ??? Need to figure out some way to check this isn't a PARM_DECL. */
2978 : #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2979 :
2980 : /* Holds the size of the datum, in bits, as a tree expression.
2981 : Need not be constant and may be null. May be less than TYPE_SIZE
2982 : for a C++ FIELD_DECL representing a base class subobject with its
2983 : own virtual base classes (which are laid out separately). */
2984 : #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2985 : /* Likewise for the size in bytes. */
2986 : #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2987 : #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2988 : /* Returns the alignment required for the datum, in bits. It must
2989 : be a power of two, but an "alignment" of zero is supported
2990 : (e.g. as "uninitialized" sentinel). */
2991 : #define DECL_ALIGN(NODE) \
2992 : (DECL_ALIGN_RAW (NODE) \
2993 : ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2994 : /* Specify that DECL_ALIGN(NODE) is X. */
2995 : #define SET_DECL_ALIGN(NODE, X) \
2996 : (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2997 :
2998 : /* The minimum alignment necessary for the datum, in bits, without
2999 : warning. */
3000 : #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
3001 : (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
3002 : #define DECL_WARN_IF_NOT_ALIGN(NODE) \
3003 : (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
3004 : ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
3005 :
3006 : /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
3007 : #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
3008 : (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
3009 :
3010 : /* The alignment of NODE, in bytes. */
3011 : #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
3012 : /* Set if the alignment of this DECL has been set by the user, for
3013 : example with an 'aligned' attribute. */
3014 : #define DECL_USER_ALIGN(NODE) \
3015 : (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
3016 : /* Holds the machine mode corresponding to the declaration of a variable or
3017 : field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
3018 : FIELD_DECL. */
3019 : #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
3020 : #define SET_DECL_MODE(NODE, MODE) \
3021 : (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
3022 :
3023 : /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
3024 : operation it is. This is only intended for low-level accesses;
3025 : normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
3026 : should be used instead. */
3027 : #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
3028 : (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
3029 :
3030 : /* Test if FCODE is a function code for an alloca operation. */
3031 : #define ALLOCA_FUNCTION_CODE_P(FCODE) \
3032 : ((FCODE) == BUILT_IN_ALLOCA \
3033 : || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
3034 : || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
3035 :
3036 : /* Generate case for an alloca operation. */
3037 : #define CASE_BUILT_IN_ALLOCA \
3038 : case BUILT_IN_ALLOCA: \
3039 : case BUILT_IN_ALLOCA_WITH_ALIGN: \
3040 : case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
3041 :
3042 : #define DECL_FUNCTION_PERSONALITY(NODE) \
3043 : (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
3044 :
3045 : /* Nonzero for a given ..._DECL node means that the name of this node should
3046 : be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
3047 : the associated type should be ignored. For a FUNCTION_DECL, the body of
3048 : the function should also be ignored. */
3049 : #define DECL_IGNORED_P(NODE) \
3050 : (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
3051 :
3052 : /* Nonzero for a given ..._DECL node means that this node represents an
3053 : "abstract instance" of the given declaration (e.g. in the original
3054 : declaration of an inline function). When generating symbolic debugging
3055 : information, we mustn't try to generate any address information for nodes
3056 : marked as "abstract instances" because we don't actually generate
3057 : any code or allocate any data space for such instances. */
3058 : #define DECL_ABSTRACT_P(NODE) \
3059 : (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
3060 :
3061 : /* Language-specific decl information. */
3062 : #define DECL_LANG_SPECIFIC(NODE) \
3063 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
3064 :
3065 : /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
3066 : do not allocate storage, and refer to a definition elsewhere. Note that
3067 : this does not necessarily imply the entity represented by NODE
3068 : has no program source-level definition in this translation unit. For
3069 : example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
3070 : DECL_EXTERNAL may be true simultaneously; that can be the case for
3071 : a C99 "extern inline" function. */
3072 : #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
3073 :
3074 : /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
3075 : For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
3076 :
3077 : For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
3078 :
3079 : Also set in some languages for variables, etc., outside the normal
3080 : lexical scope, such as class instance variables. */
3081 : #define DECL_NONLOCAL(NODE) \
3082 : (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
3083 :
3084 : /* Used in VAR_DECLs to indicate that the variable is a vtable.
3085 : Used in FIELD_DECLs for vtable pointers.
3086 : Used in FUNCTION_DECLs to indicate that the function is virtual. */
3087 : #define DECL_VIRTUAL_P(NODE) \
3088 : (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
3089 :
3090 : /* Used to indicate that this DECL represents a compiler-generated entity. */
3091 : #define DECL_ARTIFICIAL(NODE) \
3092 : (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
3093 :
3094 : /* Additional flags for language-specific uses. */
3095 : #define DECL_LANG_FLAG_0(NODE) \
3096 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
3097 : #define DECL_LANG_FLAG_1(NODE) \
3098 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
3099 : #define DECL_LANG_FLAG_2(NODE) \
3100 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
3101 : #define DECL_LANG_FLAG_3(NODE) \
3102 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
3103 : #define DECL_LANG_FLAG_4(NODE) \
3104 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
3105 : #define DECL_LANG_FLAG_5(NODE) \
3106 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
3107 : #define DECL_LANG_FLAG_6(NODE) \
3108 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
3109 : #define DECL_LANG_FLAG_7(NODE) \
3110 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
3111 : #define DECL_LANG_FLAG_8(NODE) \
3112 : (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
3113 :
3114 : /* Nonzero for a scope which is equal to file scope. */
3115 : #define SCOPE_FILE_SCOPE_P(EXP) \
3116 : (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
3117 : /* Nonzero for a decl which is at file scope. */
3118 : #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
3119 : /* Nonzero for a type which is at file scope. */
3120 : #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
3121 :
3122 : /* Nonzero for a decl that is decorated using attribute used.
3123 : This indicates to compiler tools that this decl needs to be preserved. */
3124 : #define DECL_PRESERVE_P(DECL) \
3125 : DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
3126 :
3127 : /* Nonzero for a decl that is decorated with the "noinit" attribute.
3128 : decls with this attribute are placed into the ".noinit" section, so they are
3129 : not initialized by the target's startup code. */
3130 : #define DECL_NOINIT_P(DECL) \
3131 : (DECL_P (DECL) \
3132 : && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
3133 :
3134 : /* Nonzero for a decl that is decorated with the "persistent" attribute.
3135 : decls with this attribute are placed into the ".persistent" section, so they
3136 : are not initialized by the target's startup code. */
3137 : #define DECL_PERSISTENT_P(DECL) \
3138 : (DECL_P (DECL) \
3139 : && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
3140 :
3141 : /* For function local variables indicates that the variable
3142 : should not be treated as a GIMPLE register. In particular
3143 : this means that partial definitions can appear and the
3144 : variable cannot be written into SSA form and instead uses
3145 : virtual operands to represent the use-def dataflow. */
3146 : #define DECL_NOT_GIMPLE_REG_P(DECL) \
3147 : DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
3148 :
3149 : extern tree decl_value_expr_lookup (tree);
3150 : extern void decl_value_expr_insert (tree, tree);
3151 :
3152 : /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
3153 : if transformations have made this more complicated than evaluating the
3154 : decl itself. */
3155 : #define DECL_HAS_VALUE_EXPR_P(NODE) \
3156 : (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
3157 : ->decl_common.decl_flag_2)
3158 : #define DECL_VALUE_EXPR(NODE) \
3159 : (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
3160 : #define SET_DECL_VALUE_EXPR(NODE, VAL) \
3161 : (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
3162 :
3163 : /* Holds the RTL expression for the value of a variable or function.
3164 : This value can be evaluated lazily for functions, variables with
3165 : static storage duration, and labels. */
3166 : #define DECL_RTL(NODE) \
3167 : (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
3168 : ? (NODE)->decl_with_rtl.rtl \
3169 : : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
3170 :
3171 : /* Set the DECL_RTL for NODE to RTL. */
3172 : #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
3173 :
3174 : /* Returns nonzero if NODE is a tree node that can contain RTL. */
3175 : #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
3176 :
3177 : /* Returns nonzero if the DECL_RTL for NODE has already been set. */
3178 : #define DECL_RTL_SET_P(NODE) \
3179 : (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
3180 :
3181 : /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
3182 : SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
3183 : #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
3184 : (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
3185 : = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
3186 :
3187 : /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
3188 : #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
3189 :
3190 : #if (GCC_VERSION >= 2007)
3191 : #define DECL_RTL_KNOWN_SET(decl) __extension__ \
3192 : ({ tree const __d = (decl); \
3193 : gcc_checking_assert (DECL_RTL_SET_P (__d)); \
3194 : /* Dereference it so the compiler knows it can't be NULL even \
3195 : without assertion checking. */ \
3196 : &*DECL_RTL_IF_SET (__d); })
3197 : #else
3198 : #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
3199 : #endif
3200 :
3201 : /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
3202 : #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
3203 :
3204 : /* In a FIELD_DECL, this is the field position, counting in bytes, of the
3205 : DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
3206 : of the structure. */
3207 : #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
3208 :
3209 : /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
3210 : field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
3211 : that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
3212 : natural alignment of the field's type). */
3213 : #define DECL_FIELD_BIT_OFFSET(NODE) \
3214 : (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
3215 :
3216 : /* In a FIELD_DECL, this indicates whether the field was a bit-field and
3217 : if so, the type that was originally specified for it.
3218 : TREE_TYPE may have been modified (in finish_struct). */
3219 : #define DECL_BIT_FIELD_TYPE(NODE) \
3220 : (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3221 :
3222 : /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
3223 : representative FIELD_DECL. */
3224 : #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
3225 : (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3226 :
3227 : /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3228 : if nonzero, indicates that the field occupies the type. */
3229 : #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3230 :
3231 : /* For FIELD_DECLs, off_align holds the number of low-order bits of
3232 : DECL_FIELD_OFFSET which are known to be always zero.
3233 : DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3234 : has. */
3235 : #define DECL_OFFSET_ALIGN(NODE) \
3236 : (HOST_WIDE_INT_1U << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3237 :
3238 : /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
3239 : #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3240 : (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3241 :
3242 : /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3243 : which this FIELD_DECL is defined. This information is needed when
3244 : writing debugging information about vfield and vbase decls for C++. */
3245 : #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3246 :
3247 : /* In a FIELD_DECL, indicates this field should be bit-packed. */
3248 : #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3249 :
3250 : /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3251 : specially. */
3252 : #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3253 :
3254 : /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
3255 : like passing/returning containing struct by value.
3256 : Set for C++17 empty base artificial FIELD_DECLs as well as
3257 : empty [[no_unique_address]] non-static data members. */
3258 : #define DECL_FIELD_ABI_IGNORED(NODE) \
3259 : (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3260 : #define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
3261 : do { \
3262 : gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
3263 : FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3264 : } while (0)
3265 :
3266 : /* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
3267 : removed from the IL since PR42217 until PR101539 and by that changed
3268 : the ABI on several targets. This flag is provided so that the backends
3269 : can decide on the ABI with zero-width bitfields and emit -Wpsabi
3270 : warnings. */
3271 : #define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
3272 : (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3273 : #define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
3274 : do { \
3275 : gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
3276 : FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3277 : } while (0)
3278 :
3279 : /* Used in a FIELD_DECL to indicate that we cannot form the address of
3280 : this component. This makes it possible for Type-Based Alias Analysis
3281 : to disambiguate accesses to this field with indirect accesses using
3282 : the field's type:
3283 :
3284 : struct S { int i; } s;
3285 : int *p;
3286 :
3287 : If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3288 :
3289 : From the implementation's viewpoint, the alias set of the type of the
3290 : field 'i' (int) will not be recorded as a subset of that of the type of
3291 : 's' (struct S) in record_component_aliases. The counterpart is that
3292 : accesses to s.i must not be given the alias set of the type of 'i'
3293 : (int) but instead directly that of the type of 's' (struct S). */
3294 : #define DECL_NONADDRESSABLE_P(NODE) \
3295 : (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3296 :
3297 : /* Used in a FIELD_DECL to indicate that this field is padding. */
3298 : #define DECL_PADDING_P(NODE) \
3299 : (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3300 :
3301 : /* Used in a FIELD_DECL to indicate whether this field is not a flexible
3302 : array member. This is only valid for the last array type field of a
3303 : structure. */
3304 : #define DECL_NOT_FLEXARRAY(NODE) \
3305 : (FIELD_DECL_CHECK (NODE)->decl_common.decl_not_flexarray)
3306 :
3307 : /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3308 : dense, unique within any one function, and may be used to index arrays.
3309 : If the value is -1, then no UID has been assigned. */
3310 : #define LABEL_DECL_UID(NODE) \
3311 : (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3312 :
3313 : /* In a LABEL_DECL, the EH region number for which the label is the
3314 : post_landing_pad. */
3315 : #define EH_LANDING_PAD_NR(NODE) \
3316 : (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3317 :
3318 : /* For a PARM_DECL, records the data type used to pass the argument,
3319 : which may be different from the type seen in the program. */
3320 : #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3321 :
3322 : /* For PARM_DECL, holds an RTL for the stack slot or register
3323 : where the data was actually passed. */
3324 : #define DECL_INCOMING_RTL(NODE) \
3325 : (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3326 :
3327 : /* Nonzero for a given ..._DECL node means that no warnings should be
3328 : generated just because this node is unused. */
3329 : #define DECL_IN_SYSTEM_HEADER(NODE) \
3330 : (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3331 :
3332 : /* Used to indicate that the linkage status of this DECL is not yet known,
3333 : so it should not be output now. */
3334 : #define DECL_DEFER_OUTPUT(NODE) \
3335 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3336 :
3337 : /* In a VAR_DECL that's static,
3338 : nonzero if the space is in the text section. */
3339 : #define DECL_IN_TEXT_SECTION(NODE) \
3340 : (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3341 :
3342 : /* In a VAR_DECL that's static,
3343 : nonzero if it belongs to the global constant pool. */
3344 : #define DECL_IN_CONSTANT_POOL(NODE) \
3345 : (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3346 :
3347 : /* Nonzero for a given ..._DECL node means that this node should be
3348 : put in .common, if possible. If a DECL_INITIAL is given, and it
3349 : is not error_mark_node, then the decl cannot be put in .common. */
3350 : #define DECL_COMMON(NODE) \
3351 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3352 :
3353 : /* In a VAR_DECL, nonzero if the decl is a register variable with
3354 : an explicit asm specification. */
3355 : #define DECL_HARD_REGISTER(NODE) \
3356 : (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3357 :
3358 : /* Used to indicate that this DECL has weak linkage. */
3359 : #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3360 :
3361 : /* Used to indicate that the DECL is a dllimport. */
3362 : #define DECL_DLLIMPORT_P(NODE) \
3363 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3364 :
3365 : /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3366 : not be put out unless it is needed in this translation unit.
3367 : Entities like this are shared across translation units (like weak
3368 : entities), but are guaranteed to be generated by any translation
3369 : unit that needs them, and therefore need not be put out anywhere
3370 : where they are not needed. DECL_COMDAT is just a hint to the
3371 : back-end; it is up to front-ends which set this flag to ensure
3372 : that there will never be any harm, other than bloat, in putting out
3373 : something which is DECL_COMDAT. */
3374 : #define DECL_COMDAT(NODE) \
3375 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3376 :
3377 : #define DECL_COMDAT_GROUP(NODE) \
3378 : decl_comdat_group (NODE)
3379 :
3380 : /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3381 : multiple translation units should be merged. */
3382 : #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3383 : && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3384 :
3385 : /* The name of the object as the assembler will see it (but before any
3386 : translations made by ASM_OUTPUT_LABELREF). Often this is the same
3387 : as DECL_NAME. It is an IDENTIFIER_NODE.
3388 :
3389 : ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3390 : One Definition Rule based type merging at LTO. It is computed only for
3391 : LTO compilation and C++. */
3392 : #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3393 :
3394 : /* Raw accessor for DECL_ASSEMBLE_NAME. */
3395 : #define DECL_ASSEMBLER_NAME_RAW(NODE) \
3396 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3397 :
3398 : /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3399 : This is true of all DECL nodes except FIELD_DECL. */
3400 : #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3401 : (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3402 :
3403 : /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3404 : the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3405 : yet. */
3406 : #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3407 : (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3408 :
3409 : /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3410 : #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3411 : overwrite_decl_assembler_name (NODE, NAME)
3412 :
3413 : /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3414 : if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3415 : macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3416 : clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3417 : other words, the semantics of using this macro, are different than
3418 : saying:
3419 :
3420 : SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3421 :
3422 : which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3423 :
3424 : #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3425 : SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3426 :
3427 : /* Records the section name in a section attribute. Used to pass
3428 : the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3429 : #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3430 :
3431 : /* Nonzero in a decl means that the gimplifier has seen (or placed)
3432 : this variable in a BIND_EXPR. */
3433 : #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3434 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3435 :
3436 : /* Value of the decls's visibility attribute */
3437 : #define DECL_VISIBILITY(NODE) \
3438 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3439 :
3440 : /* Nonzero means that the decl (or an enclosing scope) had its
3441 : visibility specified rather than being inferred. */
3442 : #define DECL_VISIBILITY_SPECIFIED(NODE) \
3443 : (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3444 :
3445 : /* In a VAR_DECL, the model to use if the data should be allocated from
3446 : thread-local storage. */
3447 : #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3448 :
3449 : /* In a VAR_DECL, nonzero if the data should be allocated from
3450 : thread-local storage. */
3451 : #define DECL_THREAD_LOCAL_P(NODE) \
3452 : ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3453 :
3454 : /* In a non-local VAR_DECL with static storage duration, true if the
3455 : variable has an initialization priority. If false, the variable
3456 : will be initialized at the DEFAULT_INIT_PRIORITY. */
3457 : #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3458 : (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3459 :
3460 : extern tree decl_debug_expr_lookup (tree);
3461 : extern void decl_debug_expr_insert (tree, tree);
3462 :
3463 : /* For VAR_DECL, this is set to an expression that it was split from. */
3464 : #define DECL_HAS_DEBUG_EXPR_P(NODE) \
3465 : (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3466 : #define DECL_DEBUG_EXPR(NODE) \
3467 : (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3468 :
3469 : #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3470 : (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3471 :
3472 : extern priority_type decl_init_priority_lookup (tree);
3473 : extern priority_type decl_fini_priority_lookup (tree);
3474 : extern void decl_init_priority_insert (tree, priority_type);
3475 : extern void decl_fini_priority_insert (tree, priority_type);
3476 :
3477 : /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3478 : NODE. */
3479 : #define DECL_INIT_PRIORITY(NODE) \
3480 : (decl_init_priority_lookup (NODE))
3481 : /* Set the initialization priority for NODE to VAL. */
3482 : #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3483 : (decl_init_priority_insert (NODE, VAL))
3484 :
3485 : /* For a FUNCTION_DECL the finalization priority of NODE. */
3486 : #define DECL_FINI_PRIORITY(NODE) \
3487 : (decl_fini_priority_lookup (NODE))
3488 : /* Set the finalization priority for NODE to VAL. */
3489 : #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3490 : (decl_fini_priority_insert (NODE, VAL))
3491 :
3492 : /* The initialization priority for entities for which no explicit
3493 : initialization priority has been specified. */
3494 : #define DEFAULT_INIT_PRIORITY 65535
3495 :
3496 : /* The maximum allowed initialization priority. */
3497 : #define MAX_INIT_PRIORITY 65535
3498 :
3499 : /* The largest priority value reserved for use by system runtime
3500 : libraries. */
3501 : #define MAX_RESERVED_INIT_PRIORITY 100
3502 :
3503 : /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3504 : #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3505 : (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3506 :
3507 : /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3508 : #define DECL_NONLOCAL_FRAME(NODE) \
3509 : (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3510 :
3511 : /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3512 : #define DECL_NONALIASED(NODE) \
3513 : (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3514 :
3515 : /* In a VAR_DECL, nonzero if this variable is not required to have a distinct
3516 : address from other variables with the same constant value. In other words,
3517 : consider -fmerge-all-constants to be on for this VAR_DECL. */
3518 : #define DECL_MERGEABLE(NODE) \
3519 : (VAR_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3520 :
3521 : /* This field is used to reference anything in decl.result and is meant only
3522 : for use by the garbage collector. */
3523 : #define DECL_RESULT_FLD(NODE) \
3524 : (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3525 :
3526 : /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3527 : Before the struct containing the FUNCTION_DECL is laid out,
3528 : DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3529 : is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3530 : function. When the class is laid out, this pointer is changed
3531 : to an INTEGER_CST node which is suitable for use as an index
3532 : into the virtual function table. */
3533 : #define DECL_VINDEX(NODE) \
3534 : (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3535 :
3536 : /* In FUNCTION_DECL, holds the decl for the return value. */
3537 : #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3538 :
3539 : /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3540 : #define DECL_UNINLINABLE(NODE) \
3541 : (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3542 :
3543 : /* In a FUNCTION_DECL, the saved representation of the body of the
3544 : entire function. */
3545 : #define DECL_SAVED_TREE(NODE) \
3546 : (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3547 :
3548 : /* Nonzero in a FUNCTION_DECL means this function should be treated
3549 : as if it were a malloc, meaning it returns a pointer that is
3550 : not an alias. */
3551 : #define DECL_IS_MALLOC(NODE) \
3552 : (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3553 :
3554 : /* Macro for direct set and get of function_decl.decl_type. */
3555 : #define FUNCTION_DECL_DECL_TYPE(NODE) \
3556 : (NODE->function_decl.decl_type)
3557 :
3558 : /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3559 : it to NONE. */
3560 :
3561 : inline void
3562 3463222 : set_function_decl_type (tree decl, function_decl_type t, bool set)
3563 : {
3564 3463222 : if (set)
3565 : {
3566 2860035 : gcc_assert (FUNCTION_DECL_DECL_TYPE (decl) == function_decl_type::NONE
3567 : || FUNCTION_DECL_DECL_TYPE (decl) == t);
3568 2860035 : FUNCTION_DECL_DECL_TYPE (decl) = t;
3569 : }
3570 603187 : else if (FUNCTION_DECL_DECL_TYPE (decl) == t)
3571 60 : FUNCTION_DECL_DECL_TYPE (decl) = function_decl_type::NONE;
3572 3463222 : }
3573 :
3574 : /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3575 : function (like replaceable operators new or delete). */
3576 : #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3577 : (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3578 :
3579 : /* Nonzero in a FUNCTION_DECL means this function should be treated as
3580 : C++ operator new, meaning that it returns a pointer for which we
3581 : should not use type based aliasing. */
3582 : #define DECL_IS_OPERATOR_NEW_P(NODE) \
3583 : (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3584 : == function_decl_type::OPERATOR_NEW)
3585 :
3586 : #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3587 : (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3588 :
3589 : #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3590 : set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3591 : function_decl_type::OPERATOR_NEW, VAL)
3592 :
3593 : /* Nonzero in a FUNCTION_DECL means this function should be treated as
3594 : C++ operator delete. */
3595 : #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3596 : (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3597 : == function_decl_type::OPERATOR_DELETE)
3598 :
3599 : #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3600 : set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3601 : function_decl_type::OPERATOR_DELETE, VAL)
3602 :
3603 : /* Nonzero in a FUNCTION_DECL means this function may return more
3604 : than once. */
3605 : #define DECL_IS_RETURNS_TWICE(NODE) \
3606 : (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3607 :
3608 : /* Nonzero in a FUNCTION_DECL means this function should be treated
3609 : as "pure" function (like const function, but may read global memory).
3610 : Note that being pure or const for a function is orthogonal to being
3611 : nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3612 : cleared. */
3613 : #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3614 :
3615 : /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3616 : the const or pure function may not terminate. When this is nonzero
3617 : for a const or pure function, it can be dealt with by cse passes
3618 : but cannot be removed by dce passes since you are not allowed to
3619 : change an infinite looping program into one that terminates without
3620 : error. */
3621 : #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3622 : (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3623 :
3624 : /* Nonzero in a FUNCTION_DECL means this function should be treated
3625 : as "novops" function (function that does not read global memory,
3626 : but may have arbitrary side effects). */
3627 : #define DECL_IS_NOVOPS(NODE) \
3628 : (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3629 :
3630 : /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3631 : at the beginning or end of execution. */
3632 : #define DECL_STATIC_CONSTRUCTOR(NODE) \
3633 : (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3634 :
3635 : #define DECL_STATIC_DESTRUCTOR(NODE) \
3636 : (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3637 :
3638 : /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3639 : be instrumented with calls to support routines. */
3640 : #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3641 : (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3642 :
3643 : /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3644 : disabled in this function. */
3645 : #define DECL_NO_LIMIT_STACK(NODE) \
3646 : (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3647 :
3648 : /* In a FUNCTION_DECL indicates that a static chain is needed. */
3649 : #define DECL_STATIC_CHAIN(NODE) \
3650 : (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3651 :
3652 : /* Nonzero for a decl that cgraph has decided should be inlined into
3653 : at least one call site. It is not meaningful to look at this
3654 : directly; always use cgraph_function_possibly_inlined_p. */
3655 : #define DECL_POSSIBLY_INLINED(DECL) \
3656 : FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3657 :
3658 : /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3659 : such as via the `inline' keyword in C/C++. This flag controls the linkage
3660 : semantics of 'inline' */
3661 : #define DECL_DECLARED_INLINE_P(NODE) \
3662 : (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3663 :
3664 : /* Nonzero in a FUNCTION_DECL means this function should not get
3665 : -Winline warnings. */
3666 : #define DECL_NO_INLINE_WARNING_P(NODE) \
3667 : (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3668 :
3669 : /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3670 : #define BUILTIN_TM_LOAD_STORE_P(FN) \
3671 : ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3672 :
3673 : /* Nonzero if a FUNCTION_CODE is a TM load. */
3674 : #define BUILTIN_TM_LOAD_P(FN) \
3675 : ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3676 :
3677 : /* Nonzero if a FUNCTION_CODE is a TM store. */
3678 : #define BUILTIN_TM_STORE_P(FN) \
3679 : ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3680 :
3681 : #define CASE_BUILT_IN_TM_LOAD(FN) \
3682 : case BUILT_IN_TM_LOAD_##FN: \
3683 : case BUILT_IN_TM_LOAD_RAR_##FN: \
3684 : case BUILT_IN_TM_LOAD_RAW_##FN: \
3685 : case BUILT_IN_TM_LOAD_RFW_##FN
3686 :
3687 : #define CASE_BUILT_IN_TM_STORE(FN) \
3688 : case BUILT_IN_TM_STORE_##FN: \
3689 : case BUILT_IN_TM_STORE_WAR_##FN: \
3690 : case BUILT_IN_TM_STORE_WAW_##FN
3691 :
3692 : /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3693 : disregarding size and cost heuristics. This is equivalent to using
3694 : the always_inline attribute without the required diagnostics if the
3695 : function cannot be inlined. */
3696 : #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3697 : (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3698 :
3699 : extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
3700 : extern vec<tree, va_gc> **decl_debug_args_insert (tree);
3701 :
3702 : /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3703 : #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3704 : (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3705 :
3706 : /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3707 : that describes the status of this function. */
3708 : #define DECL_STRUCT_FUNCTION(NODE) \
3709 : (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3710 :
3711 : /* For a builtin function, identify which part of the compiler defined it. */
3712 : #define DECL_BUILT_IN_CLASS(NODE) \
3713 : ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3714 :
3715 : /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3716 : #define DECL_ARGUMENTS(NODE) \
3717 : (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3718 :
3719 : /* In FUNCTION_DECL, the function specific target options to use when compiling
3720 : this function. */
3721 : #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3722 : (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3723 :
3724 : /* In FUNCTION_DECL, the function specific optimization options to use when
3725 : compiling this function. */
3726 : #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3727 : (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3728 :
3729 : /* In FUNCTION_DECL, this is set if this function has other versions generated
3730 : to support different architecture feature sets, e.g. using "target" or
3731 : "target_version" attributes. */
3732 : #define DECL_FUNCTION_VERSIONED(NODE)\
3733 : (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3734 :
3735 : /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3736 : Devirtualization machinery uses this knowledge for determining type of the
3737 : object constructed. Also we assume that constructor address is not
3738 : important. */
3739 : #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3740 : (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3741 :
3742 : /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3743 : Devirtualization machinery uses this to track types in destruction. */
3744 : #define DECL_CXX_DESTRUCTOR_P(NODE)\
3745 : (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3746 :
3747 : /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3748 : #define DECL_LAMBDA_FUNCTION_P(NODE) \
3749 : (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3750 : == function_decl_type::LAMBDA_FUNCTION)
3751 :
3752 : #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3753 : set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3754 : function_decl_type::LAMBDA_FUNCTION, VAL)
3755 :
3756 : /* In FUNCTION_DECL that represent an virtual method this is set when
3757 : the method is final. */
3758 : #define DECL_FINAL_P(NODE)\
3759 : (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3760 :
3761 : /* The source language of the translation-unit. */
3762 : #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3763 : (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3764 :
3765 : /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3766 :
3767 : /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3768 : #define DECL_ORIGINAL_TYPE(NODE) \
3769 : (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3770 :
3771 : /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3772 : into stabs. Instead it will generate cross reference ('x') of names.
3773 : This uses the same flag as DECL_EXTERNAL. */
3774 : #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3775 : (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3776 :
3777 : /* Getter of the imported declaration associated to the
3778 : IMPORTED_DECL node. */
3779 : #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3780 : (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3781 :
3782 : /* Getter of the symbol declaration associated with the
3783 : NAMELIST_DECL node. */
3784 : #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3785 : (DECL_INITIAL (NODE))
3786 :
3787 : /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3788 : To reduce overhead, the nodes containing the statements are not trees.
3789 : This avoids the overhead of tree_common on all linked list elements.
3790 :
3791 : Use the interface in tree-iterator.h to access this node. */
3792 :
3793 : #define STATEMENT_LIST_HEAD(NODE) \
3794 : (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3795 : #define STATEMENT_LIST_TAIL(NODE) \
3796 : (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3797 :
3798 : #define TREE_OPTIMIZATION(NODE) \
3799 : (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3800 :
3801 : #define TREE_OPTIMIZATION_OPTABS(NODE) \
3802 : (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3803 :
3804 : #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3805 : (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3806 :
3807 : /* Return a tree node that encapsulates the optimization options in OPTS
3808 : and OPTS_SET. */
3809 : extern tree build_optimization_node (struct gcc_options *opts,
3810 : struct gcc_options *opts_set);
3811 :
3812 : #define TREE_TARGET_OPTION(NODE) \
3813 : (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3814 :
3815 : #define TREE_TARGET_GLOBALS(NODE) \
3816 : (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3817 :
3818 : /* Return a tree node that encapsulates the target options in OPTS and
3819 : OPTS_SET. */
3820 : extern tree build_target_option_node (struct gcc_options *opts,
3821 : struct gcc_options *opts_set);
3822 :
3823 : extern void prepare_target_option_nodes_for_pch (void);
3824 :
3825 : #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3826 :
3827 : inline tree
3828 >77818*10^7 : tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3829 : {
3830 >73017*10^7 : if (TREE_CODE (__t) != __c)
3831 0 : tree_check_failed (__t, __f, __l, __g, __c, 0);
3832 >66182*10^7 : return __t;
3833 : }
3834 :
3835 : inline tree
3836 >11395*10^7 : tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3837 : enum tree_code __c)
3838 : {
3839 68189758253 : if (TREE_CODE (__t) == __c)
3840 0 : tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3841 68099724635 : return __t;
3842 : }
3843 :
3844 : inline tree
3845 45149132911 : tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3846 : enum tree_code __c1, enum tree_code __c2)
3847 : {
3848 45149132911 : if (TREE_CODE (__t) != __c1
3849 19930015635 : && TREE_CODE (__t) != __c2)
3850 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3851 45149132911 : return __t;
3852 : }
3853 :
3854 : inline tree
3855 >21380*10^7 : tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3856 : enum tree_code __c1, enum tree_code __c2)
3857 : {
3858 >21380*10^7 : if (TREE_CODE (__t) == __c1
3859 >21380*10^7 : || TREE_CODE (__t) == __c2)
3860 0 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3861 >21380*10^7 : return __t;
3862 : }
3863 :
3864 : inline tree
3865 74745495478 : tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3866 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3867 : {
3868 74745495478 : if (TREE_CODE (__t) != __c1
3869 2744633714 : && TREE_CODE (__t) != __c2
3870 815196534 : && TREE_CODE (__t) != __c3)
3871 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3872 74745495478 : return __t;
3873 : }
3874 :
3875 : inline tree
3876 : tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3877 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3878 : {
3879 : if (TREE_CODE (__t) == __c1
3880 : || TREE_CODE (__t) == __c2
3881 : || TREE_CODE (__t) == __c3)
3882 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3883 : return __t;
3884 : }
3885 :
3886 : inline tree
3887 15056135341 : tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3888 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3889 : enum tree_code __c4)
3890 : {
3891 15056135341 : if (TREE_CODE (__t) != __c1
3892 12811974173 : && TREE_CODE (__t) != __c2
3893 12767440659 : && TREE_CODE (__t) != __c3
3894 12751979372 : && TREE_CODE (__t) != __c4)
3895 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3896 15056135341 : return __t;
3897 : }
3898 :
3899 : inline tree
3900 855268883 : tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3901 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3902 : enum tree_code __c4)
3903 : {
3904 855268883 : if (TREE_CODE (__t) == __c1
3905 855268883 : || TREE_CODE (__t) == __c2
3906 855268883 : || TREE_CODE (__t) == __c3
3907 855268883 : || TREE_CODE (__t) == __c4)
3908 0 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3909 855268883 : return __t;
3910 : }
3911 :
3912 : inline tree
3913 1331593400 : tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3914 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3915 : enum tree_code __c4, enum tree_code __c5)
3916 : {
3917 1331593400 : if (TREE_CODE (__t) != __c1
3918 1287561798 : && TREE_CODE (__t) != __c2
3919 461400187 : && TREE_CODE (__t) != __c3
3920 360429034 : && TREE_CODE (__t) != __c4
3921 459132 : && TREE_CODE (__t) != __c5)
3922 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3923 1331593400 : return __t;
3924 : }
3925 :
3926 : inline tree
3927 : tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3928 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3929 : enum tree_code __c4, enum tree_code __c5)
3930 : {
3931 : if (TREE_CODE (__t) == __c1
3932 : || TREE_CODE (__t) == __c2
3933 : || TREE_CODE (__t) == __c3
3934 : || TREE_CODE (__t) == __c4
3935 : || TREE_CODE (__t) == __c5)
3936 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3937 : return __t;
3938 : }
3939 :
3940 : inline tree
3941 9482645105 : tree_check6 (tree __t, const char *__f, int __l, const char *__g,
3942 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3943 : enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3944 : {
3945 9482645105 : if (TREE_CODE (__t) != __c1
3946 534332869 : && TREE_CODE (__t) != __c2
3947 438548445 : && TREE_CODE (__t) != __c3
3948 110075277 : && TREE_CODE (__t) != __c4
3949 624163 : && TREE_CODE (__t) != __c5
3950 624163 : && TREE_CODE (__t) != __c6)
3951 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
3952 : 0);
3953 9482645105 : return __t;
3954 : }
3955 :
3956 : inline tree
3957 : tree_not_check6 (tree __t, const char *__f, int __l, const char *__g,
3958 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3959 : enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3960 : {
3961 : if (TREE_CODE (__t) == __c1
3962 : || TREE_CODE (__t) == __c2
3963 : || TREE_CODE (__t) == __c3
3964 : || TREE_CODE (__t) == __c4
3965 : || TREE_CODE (__t) == __c5
3966 : || TREE_CODE (__t) == __c6)
3967 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
3968 : __c6, 0);
3969 : return __t;
3970 : }
3971 :
3972 : inline tree
3973 >14659*10^8 : contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3974 : const char *__f, int __l, const char *__g)
3975 : {
3976 >14659*10^8 : if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3977 0 : tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3978 >14659*10^8 : return __t;
3979 : }
3980 :
3981 : inline tree
3982 >93226*10^7 : tree_class_check (tree __t, const enum tree_code_class __class,
3983 : const char *__f, int __l, const char *__g)
3984 : {
3985 >93226*10^7 : if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3986 0 : tree_class_check_failed (__t, __class, __f, __l, __g);
3987 >93226*10^7 : return __t;
3988 : }
3989 :
3990 : inline tree
3991 4812764 : tree_range_check (tree __t,
3992 : enum tree_code __code1, enum tree_code __code2,
3993 : const char *__f, int __l, const char *__g)
3994 : {
3995 4812764 : if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3996 0 : tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3997 4812764 : return __t;
3998 : }
3999 :
4000 : inline tree
4001 7055194 : omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
4002 : const char *__f, int __l, const char *__g)
4003 : {
4004 7055194 : if (TREE_CODE (__t) != OMP_CLAUSE)
4005 0 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4006 7055194 : if (__t->omp_clause.code != __code)
4007 0 : omp_clause_check_failed (__t, __f, __l, __g, __code);
4008 7055194 : return __t;
4009 : }
4010 :
4011 : inline tree
4012 5576493 : omp_clause_range_check (tree __t,
4013 : enum omp_clause_code __code1,
4014 : enum omp_clause_code __code2,
4015 : const char *__f, int __l, const char *__g)
4016 : {
4017 5576493 : if (TREE_CODE (__t) != OMP_CLAUSE)
4018 0 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4019 5576493 : if ((int) __t->omp_clause.code < (int) __code1
4020 5576493 : || (int) __t->omp_clause.code > (int) __code2)
4021 0 : omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4022 5576493 : return __t;
4023 : }
4024 :
4025 : /* These checks have to be special cased. */
4026 :
4027 : inline tree
4028 >19929*10^7 : expr_check (tree __t, const char *__f, int __l, const char *__g)
4029 : {
4030 >19929*10^7 : char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
4031 >19929*10^7 : if (!IS_EXPR_CODE_CLASS (__c))
4032 0 : tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
4033 >19929*10^7 : return __t;
4034 : }
4035 :
4036 : /* These checks have to be special cased. */
4037 :
4038 : inline tree
4039 61250159962 : non_type_check (tree __t, const char *__f, int __l, const char *__g)
4040 : {
4041 61250159962 : if (TYPE_P (__t))
4042 0 : tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
4043 61250159962 : return __t;
4044 : }
4045 :
4046 : inline const HOST_WIDE_INT *
4047 58704632824 : tree_int_cst_elt_check (const_tree __t, int __i,
4048 : const char *__f, int __l, const char *__g)
4049 : {
4050 58704632824 : if (TREE_CODE (__t) != INTEGER_CST)
4051 0 : tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
4052 58704632824 : if (__i < 0 || __i >= __t->base.u.int_length.extended)
4053 0 : tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
4054 : __f, __l, __g);
4055 58704632824 : return &const_cast<tree> (__t)->int_cst.val[__i];
4056 : }
4057 :
4058 : inline HOST_WIDE_INT *
4059 34636596955 : tree_int_cst_elt_check (tree __t, int __i,
4060 : const char *__f, int __l, const char *__g)
4061 : {
4062 34636596955 : if (TREE_CODE (__t) != INTEGER_CST)
4063 0 : tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
4064 34636596955 : if (__i < 0 || __i >= __t->base.u.int_length.extended)
4065 0 : tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
4066 : __f, __l, __g);
4067 34636596955 : return &const_cast<tree> (__t)->int_cst.val[__i];
4068 : }
4069 :
4070 : /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
4071 :
4072 : # if GCC_VERSION >= 4006
4073 : #pragma GCC diagnostic push
4074 : #pragma GCC diagnostic ignored "-Wstrict-overflow"
4075 : #endif
4076 :
4077 : inline tree *
4078 >11337*10^7 : tree_vec_elt_check (tree __t, int __i,
4079 : const char *__f, int __l, const char *__g)
4080 : {
4081 >11337*10^7 : if (TREE_CODE (__t) != TREE_VEC)
4082 0 : tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
4083 >11337*10^7 : if (__i < 0 || __i >= __t->base.u.length)
4084 0 : tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
4085 >11337*10^7 : return &const_cast<tree> (__t)->vec.a[__i];
4086 : }
4087 :
4088 : # if GCC_VERSION >= 4006
4089 : #pragma GCC diagnostic pop
4090 : #endif
4091 :
4092 : inline tree *
4093 9435954 : omp_clause_elt_check (tree __t, int __i,
4094 : const char *__f, int __l, const char *__g)
4095 : {
4096 9435954 : if (TREE_CODE (__t) != OMP_CLAUSE)
4097 0 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4098 9435954 : if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
4099 0 : omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
4100 9435954 : return &__t->omp_clause.ops[__i];
4101 : }
4102 :
4103 : /* These checks have to be special cased. */
4104 :
4105 : inline tree
4106 2995577179 : any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
4107 : {
4108 2995577179 : if (!ANY_INTEGRAL_TYPE_P (__t))
4109 0 : tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
4110 : INTEGER_TYPE, BITINT_TYPE, 0);
4111 2995577179 : return __t;
4112 : }
4113 :
4114 : inline const_tree
4115 >14836*10^7 : tree_check (const_tree __t, const char *__f, int __l, const char *__g,
4116 : tree_code __c)
4117 : {
4118 89081432203 : if (TREE_CODE (__t) != __c)
4119 0 : tree_check_failed (__t, __f, __l, __g, __c, 0);
4120 92227912252 : return __t;
4121 : }
4122 :
4123 : inline const_tree
4124 20492226970 : tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
4125 : enum tree_code __c)
4126 : {
4127 17483321208 : if (TREE_CODE (__t) == __c)
4128 0 : tree_not_check_failed (__t, __f, __l, __g, __c, 0);
4129 9910226542 : return __t;
4130 : }
4131 :
4132 : inline const_tree
4133 16935347001 : tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
4134 : enum tree_code __c1, enum tree_code __c2)
4135 : {
4136 16935347001 : if (TREE_CODE (__t) != __c1
4137 9097241481 : && TREE_CODE (__t) != __c2)
4138 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
4139 16935347001 : return __t;
4140 : }
4141 :
4142 : inline const_tree
4143 3507788517 : tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
4144 : enum tree_code __c1, enum tree_code __c2)
4145 : {
4146 3507788517 : if (TREE_CODE (__t) == __c1
4147 3507788517 : || TREE_CODE (__t) == __c2)
4148 0 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
4149 3507788517 : return __t;
4150 : }
4151 :
4152 : inline const_tree
4153 10877603728 : tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
4154 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
4155 : {
4156 10877603728 : if (TREE_CODE (__t) != __c1
4157 362119465 : && TREE_CODE (__t) != __c2
4158 147671696 : && TREE_CODE (__t) != __c3)
4159 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
4160 10877603728 : return __t;
4161 : }
4162 :
4163 : inline const_tree
4164 : tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
4165 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
4166 : {
4167 : if (TREE_CODE (__t) == __c1
4168 : || TREE_CODE (__t) == __c2
4169 : || TREE_CODE (__t) == __c3)
4170 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
4171 : return __t;
4172 : }
4173 :
4174 : inline const_tree
4175 358610250 : tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
4176 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4177 : enum tree_code __c4)
4178 : {
4179 358610250 : if (TREE_CODE (__t) != __c1
4180 21859100 : && TREE_CODE (__t) != __c2
4181 2830805 : && TREE_CODE (__t) != __c3
4182 2830805 : && TREE_CODE (__t) != __c4)
4183 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
4184 358610250 : return __t;
4185 : }
4186 :
4187 : inline const_tree
4188 122319005 : tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
4189 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4190 : enum tree_code __c4)
4191 : {
4192 122319005 : if (TREE_CODE (__t) == __c1
4193 122319005 : || TREE_CODE (__t) == __c2
4194 122319005 : || TREE_CODE (__t) == __c3
4195 122319005 : || TREE_CODE (__t) == __c4)
4196 0 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
4197 122319005 : return __t;
4198 : }
4199 :
4200 : inline const_tree
4201 : tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4202 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4203 : enum tree_code __c4, enum tree_code __c5)
4204 : {
4205 : if (TREE_CODE (__t) != __c1
4206 : && TREE_CODE (__t) != __c2
4207 : && TREE_CODE (__t) != __c3
4208 : && TREE_CODE (__t) != __c4
4209 : && TREE_CODE (__t) != __c5)
4210 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4211 : return __t;
4212 : }
4213 :
4214 : inline const_tree
4215 : tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4216 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4217 : enum tree_code __c4, enum tree_code __c5)
4218 : {
4219 : if (TREE_CODE (__t) == __c1
4220 : || TREE_CODE (__t) == __c2
4221 : || TREE_CODE (__t) == __c3
4222 : || TREE_CODE (__t) == __c4
4223 : || TREE_CODE (__t) == __c5)
4224 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4225 : return __t;
4226 : }
4227 :
4228 : inline const_tree
4229 723326898 : tree_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4230 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4231 : enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4232 : {
4233 723326898 : if (TREE_CODE (__t) != __c1
4234 79577058 : && TREE_CODE (__t) != __c2
4235 72223322 : && TREE_CODE (__t) != __c3
4236 3899220 : && TREE_CODE (__t) != __c4
4237 55546 : && TREE_CODE (__t) != __c5
4238 55546 : && TREE_CODE (__t) != __c6)
4239 0 : tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
4240 : 0);
4241 723326898 : return __t;
4242 : }
4243 :
4244 : inline const_tree
4245 : tree_not_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4246 : enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4247 : enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4248 : {
4249 : if (TREE_CODE (__t) == __c1
4250 : || TREE_CODE (__t) == __c2
4251 : || TREE_CODE (__t) == __c3
4252 : || TREE_CODE (__t) == __c4
4253 : || TREE_CODE (__t) == __c5
4254 : || TREE_CODE (__t) == __c6)
4255 : tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
4256 : __c6, 0);
4257 : return __t;
4258 : }
4259 :
4260 : inline const_tree
4261 >28035*10^7 : contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
4262 : const char *__f, int __l, const char *__g)
4263 : {
4264 >28035*10^7 : if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
4265 0 : tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
4266 >28035*10^7 : return __t;
4267 : }
4268 :
4269 : inline const_tree
4270 >28843*10^7 : tree_class_check (const_tree __t, const enum tree_code_class __class,
4271 : const char *__f, int __l, const char *__g)
4272 : {
4273 >28843*10^7 : if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
4274 0 : tree_class_check_failed (__t, __class, __f, __l, __g);
4275 >28843*10^7 : return __t;
4276 : }
4277 :
4278 : inline const_tree
4279 : tree_range_check (const_tree __t,
4280 : enum tree_code __code1, enum tree_code __code2,
4281 : const char *__f, int __l, const char *__g)
4282 : {
4283 : if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
4284 : tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4285 : return __t;
4286 : }
4287 :
4288 : inline const_tree
4289 : omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
4290 : const char *__f, int __l, const char *__g)
4291 : {
4292 : if (TREE_CODE (__t) != OMP_CLAUSE)
4293 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4294 : if (__t->omp_clause.code != __code)
4295 : omp_clause_check_failed (__t, __f, __l, __g, __code);
4296 : return __t;
4297 : }
4298 :
4299 : inline const_tree
4300 : omp_clause_range_check (const_tree __t,
4301 : enum omp_clause_code __code1,
4302 : enum omp_clause_code __code2,
4303 : const char *__f, int __l, const char *__g)
4304 : {
4305 : if (TREE_CODE (__t) != OMP_CLAUSE)
4306 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4307 : if ((int) __t->omp_clause.code < (int) __code1
4308 : || (int) __t->omp_clause.code > (int) __code2)
4309 : omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4310 : return __t;
4311 : }
4312 :
4313 : inline const_tree
4314 32157437874 : expr_check (const_tree __t, const char *__f, int __l, const char *__g)
4315 : {
4316 32157437874 : char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
4317 32157437874 : if (!IS_EXPR_CODE_CLASS (__c))
4318 0 : tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
4319 32157437874 : return __t;
4320 : }
4321 :
4322 : inline const_tree
4323 9673561689 : non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
4324 : {
4325 9673561689 : if (TYPE_P (__t))
4326 0 : tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
4327 9673561689 : return __t;
4328 : }
4329 :
4330 : # if GCC_VERSION >= 4006
4331 : #pragma GCC diagnostic push
4332 : #pragma GCC diagnostic ignored "-Wstrict-overflow"
4333 : #endif
4334 :
4335 : inline const_tree *
4336 6091398527 : tree_vec_elt_check (const_tree __t, int __i,
4337 : const char *__f, int __l, const char *__g)
4338 : {
4339 6091398527 : if (TREE_CODE (__t) != TREE_VEC)
4340 0 : tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
4341 6091398527 : if (__i < 0 || __i >= __t->base.u.length)
4342 0 : tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
4343 6091398527 : return const_cast<const_tree *> (&__t->vec.a[__i]);
4344 : //return &__t->vec.a[__i];
4345 : }
4346 :
4347 : # if GCC_VERSION >= 4006
4348 : #pragma GCC diagnostic pop
4349 : #endif
4350 :
4351 : inline const_tree *
4352 : omp_clause_elt_check (const_tree __t, int __i,
4353 : const char *__f, int __l, const char *__g)
4354 : {
4355 : if (TREE_CODE (__t) != OMP_CLAUSE)
4356 : tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4357 : if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
4358 : omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
4359 : return const_cast<const_tree *> (&__t->omp_clause.ops[__i]);
4360 : }
4361 :
4362 : inline const_tree
4363 3555195 : any_integral_type_check (const_tree __t, const char *__f, int __l,
4364 : const char *__g)
4365 : {
4366 3555195 : if (!ANY_INTEGRAL_TYPE_P (__t))
4367 0 : tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
4368 : INTEGER_TYPE, BITINT_TYPE, 0);
4369 3555195 : return __t;
4370 : }
4371 :
4372 : #endif
4373 :
4374 : /* Compute the number of operands in an expression node NODE. For
4375 : tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4376 : otherwise it is looked up from the node's code. */
4377 : inline int
4378 >25538*10^7 : tree_operand_length (const_tree node)
4379 : {
4380 >25538*10^7 : if (VL_EXP_CLASS_P (node))
4381 15303718001 : return VL_EXP_OPERAND_LENGTH (node);
4382 : else
4383 >24008*10^7 : return TREE_CODE_LENGTH (TREE_CODE (node));
4384 : }
4385 :
4386 : #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4387 :
4388 : /* Special checks for TREE_OPERANDs. */
4389 : inline tree *
4390 >18577*10^7 : tree_operand_check (tree __t, int __i,
4391 : const char *__f, int __l, const char *__g)
4392 : {
4393 >18577*10^7 : const_tree __u = EXPR_CHECK (__t);
4394 >18577*10^7 : if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4395 0 : tree_operand_check_failed (__i, __u, __f, __l, __g);
4396 >18577*10^7 : return &const_cast<tree> (__u)->exp.operands[__i];
4397 : }
4398 :
4399 : inline tree *
4400 442196187 : tree_operand_check_code (tree __t, enum tree_code __code, int __i,
4401 : const char *__f, int __l, const char *__g)
4402 : {
4403 442196187 : if (TREE_CODE (__t) != __code)
4404 0 : tree_check_failed (__t, __f, __l, __g, __code, 0);
4405 442196187 : if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4406 0 : tree_operand_check_failed (__i, __t, __f, __l, __g);
4407 442196187 : return &__t->exp.operands[__i];
4408 : }
4409 :
4410 : inline const_tree *
4411 32157437857 : tree_operand_check (const_tree __t, int __i,
4412 : const char *__f, int __l, const char *__g)
4413 : {
4414 32157437857 : const_tree __u = EXPR_CHECK (__t);
4415 32157437857 : if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4416 0 : tree_operand_check_failed (__i, __u, __f, __l, __g);
4417 32157437857 : return const_cast<const_tree *> (&__u->exp.operands[__i]);
4418 : }
4419 :
4420 : inline const_tree *
4421 72 : tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
4422 : const char *__f, int __l, const char *__g)
4423 : {
4424 72 : if (TREE_CODE (__t) != __code)
4425 0 : tree_check_failed (__t, __f, __l, __g, __code, 0);
4426 72 : if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4427 0 : tree_operand_check_failed (__i, __t, __f, __l, __g);
4428 72 : return const_cast<const_tree *> (&__t->exp.operands[__i]);
4429 : }
4430 :
4431 : #endif
4432 :
4433 : /* True iff an identifier matches a C string. */
4434 :
4435 : inline bool
4436 4129532042 : id_equal (const_tree id, const char *str)
4437 : {
4438 4129532042 : return !strcmp (IDENTIFIER_POINTER (id), str);
4439 : }
4440 :
4441 : inline bool
4442 1862 : id_equal (const char *str, const_tree id)
4443 : {
4444 1862 : return id_equal (id, str);
4445 : }
4446 :
4447 : /* Return the number of elements in the VECTOR_TYPE given by NODE. */
4448 :
4449 : inline poly_uint64
4450 563513653 : TYPE_VECTOR_SUBPARTS (const_tree node)
4451 : {
4452 563513653 : STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4453 563513653 : unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision;
4454 563513653 : if (NUM_POLY_INT_COEFFS == 2)
4455 : {
4456 : /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4457 : description of the encoding. */
4458 : poly_uint64 res = 0;
4459 : res.coeffs[0] = HOST_WIDE_INT_1U << (precision & 0xff);
4460 : if (precision & 0x100)
4461 : res.coeffs[1] = HOST_WIDE_INT_1U << (precision & 0xff);
4462 : return res;
4463 : }
4464 : else
4465 563513653 : return HOST_WIDE_INT_1U << precision;
4466 : }
4467 :
4468 : /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4469 : satisfy valid_vector_subparts_p. */
4470 :
4471 : inline void
4472 74851160 : SET_TYPE_VECTOR_SUBPARTS (tree node, poly_uint64 subparts)
4473 : {
4474 74851160 : STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4475 74851160 : unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4476 74851160 : int index = exact_log2 (coeff0);
4477 0 : gcc_assert (index >= 0);
4478 74851160 : if (NUM_POLY_INT_COEFFS == 2)
4479 : {
4480 : /* We have two coefficients that are each in the range 1 << [0, 63],
4481 : so supporting all combinations would require 6 bits per coefficient
4482 : and 12 bits in total. Since the precision field is only 10 bits
4483 : in size, we need to be more restrictive than that.
4484 :
4485 : At present, coeff[1] is always either 0 (meaning that the number
4486 : of units is constant) or equal to coeff[0] (meaning that the number
4487 : of units is N + X * N for some target-dependent zero-based runtime
4488 : parameter X). We can therefore encode coeff[1] in a single bit.
4489 :
4490 : The most compact encoding would be to use mask 0x3f for coeff[0]
4491 : and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4492 : get slightly more efficient code on some hosts if we instead
4493 : treat the shift amount as an independent byte, so here we use
4494 : 0xff for coeff[0] and 0x100 for coeff[1]. */
4495 : unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4496 : gcc_assert (coeff1 == 0 || coeff1 == coeff0);
4497 : VECTOR_TYPE_CHECK (node)->type_common.precision
4498 : = index + (coeff1 != 0 ? 0x100 : 0);
4499 : }
4500 : else
4501 74851160 : VECTOR_TYPE_CHECK (node)->type_common.precision = index;
4502 74851160 : }
4503 :
4504 : /* Return true if we can construct vector types with the given number
4505 : of subparts. */
4506 :
4507 : inline bool
4508 34197 : valid_vector_subparts_p (poly_uint64 subparts)
4509 : {
4510 34197 : unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4511 8634702 : if (!pow2p_hwi (coeff0))
4512 : return false;
4513 : if (NUM_POLY_INT_COEFFS == 2)
4514 : {
4515 : unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4516 : if (coeff1 != 0 && coeff1 != coeff0)
4517 : return false;
4518 : }
4519 : return true;
4520 : }
4521 :
4522 : /* Return the built-in function that DECL represents, given that it is known
4523 : to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4524 : inline built_in_function
4525 2669376474 : DECL_FUNCTION_CODE (const_tree decl)
4526 : {
4527 2669376474 : const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4528 2669376474 : gcc_checking_assert (fndecl.built_in_class == BUILT_IN_NORMAL);
4529 2669376474 : return (built_in_function) fndecl.function_code;
4530 : }
4531 :
4532 : /* Return the target-specific built-in function that DECL represents,
4533 : given that it is known to be a FUNCTION_DECL with built-in class
4534 : BUILT_IN_MD. */
4535 : inline int
4536 69671538 : DECL_MD_FUNCTION_CODE (const_tree decl)
4537 : {
4538 69671538 : const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4539 69671538 : gcc_checking_assert (fndecl.built_in_class == BUILT_IN_MD);
4540 69671538 : return fndecl.function_code;
4541 : }
4542 :
4543 : /* Return the frontend-specific built-in function that DECL represents,
4544 : given that it is known to be a FUNCTION_DECL with built-in class
4545 : BUILT_IN_FRONTEND. */
4546 : inline int
4547 4250004 : DECL_FE_FUNCTION_CODE (const_tree decl)
4548 : {
4549 4250004 : const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4550 4250004 : gcc_checking_assert (fndecl.built_in_class == BUILT_IN_FRONTEND);
4551 4250004 : return fndecl.function_code;
4552 : }
4553 :
4554 : /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4555 : class FCLASS. */
4556 : inline void
4557 844163545 : set_decl_built_in_function (tree decl, built_in_class fclass,
4558 : unsigned int fcode)
4559 : {
4560 844163545 : tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4561 844163545 : fndecl.built_in_class = fclass;
4562 844163545 : fndecl.function_code = fcode;
4563 844163545 : }
4564 :
4565 : /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4566 : as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4567 : inline void
4568 8104526 : copy_decl_built_in_function (tree newdecl, const_tree olddecl)
4569 : {
4570 8104526 : tree_function_decl &newfndecl = FUNCTION_DECL_CHECK (newdecl)->function_decl;
4571 8104526 : const tree_function_decl &oldfndecl
4572 8104526 : = FUNCTION_DECL_CHECK (olddecl)->function_decl;
4573 8104526 : newfndecl.built_in_class = oldfndecl.built_in_class;
4574 8104526 : newfndecl.function_code = oldfndecl.function_code;
4575 8104526 : }
4576 :
4577 : /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4578 : wrapper added to express a location_t on behalf of the node's child
4579 : (e.g. by maybe_wrap_with_location). */
4580 :
4581 : #define EXPR_LOCATION_WRAPPER_P(NODE) \
4582 : (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4583 :
4584 : /* Test if EXP is merely a wrapper node, added to express a location_t
4585 : on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4586 :
4587 : inline bool
4588 84311379841 : location_wrapper_p (const_tree exp)
4589 : {
4590 : /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4591 : the flag EXPR_LOCATION_WRAPPER_P is set.
4592 : It normally has the same type as its operand, but it can have a
4593 : different one if the type of the operand has changed (e.g. when
4594 : merging duplicate decls).
4595 :
4596 : NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4597 : VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4598 84311379841 : if ((TREE_CODE (exp) == NON_LVALUE_EXPR
4599 83195199843 : || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4600 88483492702 : && EXPR_LOCATION_WRAPPER_P (exp))
4601 5051109283 : return true;
4602 : return false;
4603 : }
4604 :
4605 : /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4606 :
4607 : inline tree
4608 54951603002 : tree_strip_any_location_wrapper (tree exp)
4609 : {
4610 54951603002 : if (location_wrapper_p (exp))
4611 2863338638 : return TREE_OPERAND (exp, 0);
4612 : else
4613 : return exp;
4614 : }
4615 :
4616 : #define error_mark_node global_trees[TI_ERROR_MARK]
4617 :
4618 : #define intQI_type_node global_trees[TI_INTQI_TYPE]
4619 : #define intHI_type_node global_trees[TI_INTHI_TYPE]
4620 : #define intSI_type_node global_trees[TI_INTSI_TYPE]
4621 : #define intDI_type_node global_trees[TI_INTDI_TYPE]
4622 : #define intTI_type_node global_trees[TI_INTTI_TYPE]
4623 :
4624 : #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4625 : #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4626 : #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4627 : #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4628 : #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4629 :
4630 : #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4631 : #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4632 : #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4633 : #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4634 : #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4635 :
4636 : #define uint16_type_node global_trees[TI_UINT16_TYPE]
4637 : #define uint32_type_node global_trees[TI_UINT32_TYPE]
4638 : #define uint64_type_node global_trees[TI_UINT64_TYPE]
4639 : #define uint128_type_node global_trees[TI_UINT128_TYPE]
4640 :
4641 : #define void_node global_trees[TI_VOID]
4642 :
4643 : #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4644 : #define integer_one_node global_trees[TI_INTEGER_ONE]
4645 : #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4646 : #define size_zero_node global_trees[TI_SIZE_ZERO]
4647 : #define size_one_node global_trees[TI_SIZE_ONE]
4648 : #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4649 : #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4650 : #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4651 :
4652 : /* Base access nodes. */
4653 : #define access_public_node global_trees[TI_PUBLIC]
4654 : #define access_protected_node global_trees[TI_PROTECTED]
4655 : #define access_private_node global_trees[TI_PRIVATE]
4656 :
4657 : #define null_pointer_node global_trees[TI_NULL_POINTER]
4658 :
4659 : #define float_type_node global_trees[TI_FLOAT_TYPE]
4660 : #define double_type_node global_trees[TI_DOUBLE_TYPE]
4661 : #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4662 : #define bfloat16_type_node global_trees[TI_BFLOAT16_TYPE]
4663 :
4664 : /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4665 : #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4666 : #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4667 : #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4668 :
4669 : /* Names for individual types (code should normally iterate over all
4670 : such types; these are only for back-end use, or in contexts such as
4671 : *.def where iteration is not possible). */
4672 : #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4673 : #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4674 : #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4675 : #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4676 : #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4677 : #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4678 : #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4679 :
4680 : /* Type used by certain backends for __float128, which in C++ should be
4681 : distinct type from _Float128 for backwards compatibility reasons. */
4682 : #define float128t_type_node global_trees[TI_FLOAT128T_TYPE]
4683 :
4684 : #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4685 : #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4686 : #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4687 : #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4688 :
4689 : #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4690 : #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4691 : #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4692 : #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4693 :
4694 : #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4695 :
4696 : #define void_type_node global_trees[TI_VOID_TYPE]
4697 : /* The C type `void *'. */
4698 : #define ptr_type_node global_trees[TI_PTR_TYPE]
4699 : /* The C type `const void *'. */
4700 : #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4701 : /* The C type `size_t'. */
4702 : #define size_type_node global_trees[TI_SIZE_TYPE]
4703 : #define pid_type_node global_trees[TI_PID_TYPE]
4704 : #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4705 : #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4706 : #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4707 : #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4708 : /* The C type `FILE *'. */
4709 : #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4710 : /* The C type `const struct tm *'. */
4711 : #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4712 : /* The C type `fenv_t *'. */
4713 : #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4714 : #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4715 : /* The C type `fexcept_t *'. */
4716 : #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4717 : #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4718 : #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4719 :
4720 : #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4721 : #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4722 : #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4723 :
4724 : /* The decimal floating point types. */
4725 : #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4726 : #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4727 : #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4728 : #define dfloat64x_type_node global_trees[TI_DFLOAT64X_TYPE]
4729 :
4730 : /* The fixed-point types. */
4731 : #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4732 : #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4733 : #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4734 : #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4735 : #define sat_unsigned_short_fract_type_node \
4736 : global_trees[TI_SAT_USFRACT_TYPE]
4737 : #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4738 : #define sat_unsigned_long_fract_type_node \
4739 : global_trees[TI_SAT_ULFRACT_TYPE]
4740 : #define sat_unsigned_long_long_fract_type_node \
4741 : global_trees[TI_SAT_ULLFRACT_TYPE]
4742 : #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4743 : #define fract_type_node global_trees[TI_FRACT_TYPE]
4744 : #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4745 : #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4746 : #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4747 : #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4748 : #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4749 : #define unsigned_long_long_fract_type_node \
4750 : global_trees[TI_ULLFRACT_TYPE]
4751 : #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4752 : #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4753 : #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4754 : #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4755 : #define sat_unsigned_short_accum_type_node \
4756 : global_trees[TI_SAT_USACCUM_TYPE]
4757 : #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4758 : #define sat_unsigned_long_accum_type_node \
4759 : global_trees[TI_SAT_ULACCUM_TYPE]
4760 : #define sat_unsigned_long_long_accum_type_node \
4761 : global_trees[TI_SAT_ULLACCUM_TYPE]
4762 : #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4763 : #define accum_type_node global_trees[TI_ACCUM_TYPE]
4764 : #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4765 : #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4766 : #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4767 : #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4768 : #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4769 : #define unsigned_long_long_accum_type_node \
4770 : global_trees[TI_ULLACCUM_TYPE]
4771 : #define qq_type_node global_trees[TI_QQ_TYPE]
4772 : #define hq_type_node global_trees[TI_HQ_TYPE]
4773 : #define sq_type_node global_trees[TI_SQ_TYPE]
4774 : #define dq_type_node global_trees[TI_DQ_TYPE]
4775 : #define tq_type_node global_trees[TI_TQ_TYPE]
4776 : #define uqq_type_node global_trees[TI_UQQ_TYPE]
4777 : #define uhq_type_node global_trees[TI_UHQ_TYPE]
4778 : #define usq_type_node global_trees[TI_USQ_TYPE]
4779 : #define udq_type_node global_trees[TI_UDQ_TYPE]
4780 : #define utq_type_node global_trees[TI_UTQ_TYPE]
4781 : #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4782 : #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4783 : #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4784 : #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4785 : #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4786 : #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4787 : #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4788 : #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4789 : #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4790 : #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4791 : #define ha_type_node global_trees[TI_HA_TYPE]
4792 : #define sa_type_node global_trees[TI_SA_TYPE]
4793 : #define da_type_node global_trees[TI_DA_TYPE]
4794 : #define ta_type_node global_trees[TI_TA_TYPE]
4795 : #define uha_type_node global_trees[TI_UHA_TYPE]
4796 : #define usa_type_node global_trees[TI_USA_TYPE]
4797 : #define uda_type_node global_trees[TI_UDA_TYPE]
4798 : #define uta_type_node global_trees[TI_UTA_TYPE]
4799 : #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4800 : #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4801 : #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4802 : #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4803 : #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4804 : #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4805 : #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4806 : #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4807 :
4808 : /* The node that should be placed at the end of a parameter list to
4809 : indicate that the function does not take a variable number of
4810 : arguments. The TREE_VALUE will be void_type_node and there will be
4811 : no TREE_CHAIN. Language-independent code should not assume
4812 : anything else about this node. */
4813 : #define void_list_node global_trees[TI_VOID_LIST_NODE]
4814 :
4815 : #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4816 : #define MAIN_NAME_P(NODE) \
4817 : (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4818 :
4819 : /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4820 : functions. */
4821 : #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4822 : #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4823 :
4824 : /* Default/current target options (TARGET_OPTION_NODE). */
4825 : #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4826 : #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4827 :
4828 : /* Default tree list option(), optimize() pragmas to be linked into the
4829 : attribute list. */
4830 : #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4831 : #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4832 :
4833 : /* SCEV analyzer global shared trees. */
4834 : #define chrec_not_analyzed_yet NULL_TREE
4835 : #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4836 : #define chrec_known global_trees[TI_CHREC_KNOWN]
4837 :
4838 : #define char_type_node integer_types[itk_char]
4839 : #define signed_char_type_node integer_types[itk_signed_char]
4840 : #define unsigned_char_type_node integer_types[itk_unsigned_char]
4841 : #define short_integer_type_node integer_types[itk_short]
4842 : #define short_unsigned_type_node integer_types[itk_unsigned_short]
4843 : #define integer_type_node integer_types[itk_int]
4844 : #define unsigned_type_node integer_types[itk_unsigned_int]
4845 : #define long_integer_type_node integer_types[itk_long]
4846 : #define long_unsigned_type_node integer_types[itk_unsigned_long]
4847 : #define long_long_integer_type_node integer_types[itk_long_long]
4848 : #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4849 :
4850 : /* True if T is an erroneous expression. */
4851 :
4852 : inline bool
4853 30243273189 : error_operand_p (const_tree t)
4854 : {
4855 30243273189 : return (t == error_mark_node
4856 30243273189 : || (t && TREE_TYPE (t) == error_mark_node));
4857 : }
4858 :
4859 : /* Return the number of elements encoded directly in a VECTOR_CST. */
4860 :
4861 : inline unsigned int
4862 34801147 : vector_cst_encoded_nelts (const_tree t)
4863 : {
4864 34801147 : return VECTOR_CST_NPATTERNS (t) * VECTOR_CST_NELTS_PER_PATTERN (t);
4865 : }
4866 :
4867 : extern tree generate_internal_label (const char *);
4868 : extern const char *prefix_for_internal_label (tree label);
4869 : extern tree decl_assembler_name (tree);
4870 : extern void overwrite_decl_assembler_name (tree decl, tree name);
4871 : extern tree decl_comdat_group (const_tree);
4872 : extern tree decl_comdat_group_id (const_tree);
4873 : extern const char *decl_section_name (const_tree);
4874 : extern void set_decl_section_name (tree, const char *);
4875 : extern void set_decl_section_name (tree, const_tree);
4876 : extern enum tls_model decl_tls_model (const_tree);
4877 : extern void set_decl_tls_model (tree, enum tls_model);
4878 :
4879 : /* Compute the number of bytes occupied by 'node'. This routine only
4880 : looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4881 :
4882 : extern size_t tree_size (const_tree);
4883 :
4884 : /* Compute the number of bytes occupied by a tree with code CODE.
4885 : This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4886 : which are of variable length. */
4887 : extern size_t tree_code_size (enum tree_code);
4888 :
4889 : /* Allocate and return a new UID from the DECL_UID namespace. */
4890 : extern int allocate_decl_uid (void);
4891 :
4892 : /* Lowest level primitive for allocating a node.
4893 : The TREE_CODE is the only argument. Contents are initialized
4894 : to zero except for a few of the common fields. */
4895 :
4896 : extern tree make_node (enum tree_code CXX_MEM_STAT_INFO);
4897 :
4898 : /* Free tree node. */
4899 :
4900 : extern void free_node (tree);
4901 :
4902 : /* Make a copy of a node, with all the same contents. */
4903 :
4904 : extern tree copy_node (tree CXX_MEM_STAT_INFO);
4905 :
4906 : /* Make a copy of a chain of TREE_LIST nodes. */
4907 :
4908 : extern tree copy_list (tree);
4909 :
4910 : /* Make a CASE_LABEL_EXPR. */
4911 :
4912 : extern tree build_case_label (tree, tree, tree);
4913 :
4914 : /* Make a BINFO. */
4915 : extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO);
4916 :
4917 : /* Make an INTEGER_CST. */
4918 :
4919 : extern tree make_int_cst (int, int CXX_MEM_STAT_INFO);
4920 :
4921 : /* Make a TREE_VEC. */
4922 :
4923 : extern tree make_tree_vec (int CXX_MEM_STAT_INFO);
4924 :
4925 : /* Grow a TREE_VEC. */
4926 :
4927 : extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO);
4928 :
4929 : /* Treat a TREE_VEC as a range of trees, e.g.
4930 : for (tree e : tree_vec_range (v)) { ... } */
4931 :
4932 : class tree_vec_range
4933 : {
4934 : tree v;
4935 : public:
4936 6486380960 : tree_vec_range(tree v) : v(v) { }
4937 6486380960 : tree *begin() { return TREE_VEC_BEGIN (v); }
4938 6486380960 : tree *end() { return TREE_VEC_END (v); }
4939 : };
4940 :
4941 : /* Construct various types of nodes. */
4942 :
4943 : extern tree build_nt (enum tree_code, ...);
4944 : extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
4945 :
4946 : extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO);
4947 : extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO);
4948 : extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO);
4949 : extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO);
4950 : extern tree build4 (enum tree_code, tree, tree, tree, tree,
4951 : tree CXX_MEM_STAT_INFO);
4952 : extern tree build5 (enum tree_code, tree, tree, tree, tree, tree,
4953 : tree CXX_MEM_STAT_INFO);
4954 :
4955 : /* _loc versions of build[1-5]. */
4956 :
4957 : inline tree
4958 2739498773 : build1_loc (location_t loc, enum tree_code code, tree type,
4959 : tree arg1 CXX_MEM_STAT_INFO)
4960 : {
4961 2739498773 : tree t = build1 (code, type, arg1 PASS_MEM_STAT);
4962 2739498773 : if (CAN_HAVE_LOCATION_P (t))
4963 2739498773 : SET_EXPR_LOCATION (t, loc);
4964 2739498773 : return t;
4965 : }
4966 :
4967 : inline tree
4968 669559731 : build2_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4969 : tree arg1 CXX_MEM_STAT_INFO)
4970 : {
4971 669559731 : tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT);
4972 669559731 : if (CAN_HAVE_LOCATION_P (t))
4973 669559731 : SET_EXPR_LOCATION (t, loc);
4974 669559731 : return t;
4975 : }
4976 :
4977 : inline tree
4978 174905576 : build3_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4979 : tree arg1, tree arg2 CXX_MEM_STAT_INFO)
4980 : {
4981 174905576 : tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4982 174905576 : if (CAN_HAVE_LOCATION_P (t))
4983 174905576 : SET_EXPR_LOCATION (t, loc);
4984 174905576 : return t;
4985 : }
4986 :
4987 : inline tree
4988 13840661 : build4_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4989 : tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO)
4990 : {
4991 13840661 : tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4992 13840661 : if (CAN_HAVE_LOCATION_P (t))
4993 13840661 : SET_EXPR_LOCATION (t, loc);
4994 13840661 : return t;
4995 : }
4996 :
4997 : inline tree
4998 8591 : build5_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4999 : tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO)
5000 : {
5001 8591 : tree t = build5 (code, type, arg0, arg1, arg2, arg3,
5002 : arg4 PASS_MEM_STAT);
5003 8591 : if (CAN_HAVE_LOCATION_P (t))
5004 8591 : SET_EXPR_LOCATION (t, loc);
5005 8591 : return t;
5006 : }
5007 :
5008 : /* Constructs double_int from tree CST. */
5009 :
5010 : extern tree double_int_to_tree (tree, double_int);
5011 :
5012 : extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst);
5013 : extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool);
5014 :
5015 : /* Create an INT_CST node with a CST value zero extended. */
5016 :
5017 : /* static inline */
5018 : extern tree build_int_cst (tree, poly_int64);
5019 : extern tree build_int_cstu (tree type, poly_uint64);
5020 : extern tree build_int_cst_type (tree, poly_int64);
5021 : extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO);
5022 : extern tree build_vector_from_ctor (tree, const vec<constructor_elt, va_gc> *);
5023 : extern tree build_vector_from_val (tree, tree);
5024 : extern tree build_uniform_cst (tree, tree);
5025 : extern tree build_vec_series (tree, tree, tree);
5026 : extern tree build_index_vector (tree, poly_uint64, poly_uint64);
5027 : extern tree build_vector_a_then_b (tree, unsigned int, tree, tree);
5028 : extern void recompute_constructor_flags (tree);
5029 : extern void verify_constructor_flags (tree);
5030 : extern tree build_constructor (tree, vec<constructor_elt, va_gc> * CXX_MEM_STAT_INFO);
5031 : extern tree build_constructor_single (tree, tree, tree);
5032 : extern tree build_constructor_from_list (tree, tree);
5033 : extern tree build_constructor_from_vec (tree, const vec<tree, va_gc> *);
5034 : extern tree build_constructor_va (tree, int, ...);
5035 : extern tree build_clobber (tree, enum clobber_kind = CLOBBER_UNDEF);
5036 : extern tree build_real_from_int_cst (tree, const_tree);
5037 : extern tree build_real_from_wide (tree, const wide_int_ref &, signop);
5038 : extern tree build_complex (tree, tree, tree);
5039 : extern tree build_complex_inf (tree, bool);
5040 : extern tree build_each_one_cst (tree);
5041 : extern tree build_one_cst (tree);
5042 : extern tree build_minus_one_cst (tree);
5043 : extern tree build_all_ones_cst (tree);
5044 : extern tree build_zero_cst (tree);
5045 : extern tree build_replicated_int_cst (tree, unsigned, HOST_WIDE_INT);
5046 : extern tree sign_mask_for (tree);
5047 : extern tree build_string (unsigned, const char * = NULL);
5048 : extern tree build_poly_int_cst (tree, const poly_wide_int_ref &);
5049 : extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO);
5050 : extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO);
5051 : extern tree build_decl (location_t, enum tree_code,
5052 : tree, tree CXX_MEM_STAT_INFO);
5053 : extern tree build_debug_expr_decl (tree type);
5054 : extern tree build_fn_decl (const char *, tree);
5055 : extern tree build_translation_unit_decl (tree);
5056 : extern tree build_block (tree, tree, tree, tree);
5057 : extern tree build_empty_stmt (location_t);
5058 : extern tree build_omp_clause (location_t, enum omp_clause_code);
5059 :
5060 : extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO);
5061 :
5062 : extern tree build_call_valist (tree, tree, int, va_list);
5063 : extern tree build_call (tree, tree, std::initializer_list<tree>);
5064 :
5065 :
5066 : /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
5067 : FN and a null static chain slot. NARGS is the number of call arguments
5068 : which are specified as "..." arguments. */
5069 :
5070 : template <typename ...T>
5071 266 : inline tree build_call_nary (tree return_type, tree fn, int nargs, T... args)
5072 : {
5073 266 : std::initializer_list<tree> args_ = {args...};
5074 : gcc_checking_assert (sizeof...(args) == nargs);
5075 266 : return build_call (return_type, fn, args_);
5076 : }
5077 : #define build_call_array(T1,T2,N,T3)\
5078 : build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
5079 : extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
5080 : extern tree build_call_vec (tree, tree, const vec<tree, va_gc> *);
5081 : extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
5082 : extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
5083 : extern tree build_call_expr_loc (location_t, tree, int, ...);
5084 : extern tree build_call_expr (tree, int, ...);
5085 : extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
5086 : tree, int, ...);
5087 : extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn,
5088 : tree, int, const tree *);
5089 : extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
5090 : int, ...);
5091 : extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT);
5092 : extern tree build_string_literal (unsigned, const char * = NULL,
5093 : tree = char_type_node,
5094 : unsigned HOST_WIDE_INT = HOST_WIDE_INT_M1U);
5095 90874 : inline tree build_string_literal (const char *p)
5096 90874 : { return build_string_literal (strlen (p) + 1, p); }
5097 88757 : inline tree build_string_literal (tree t)
5098 : {
5099 88757 : return build_string_literal (IDENTIFIER_LENGTH (t) + 1,
5100 88757 : IDENTIFIER_POINTER (t));
5101 : }
5102 :
5103 : /* Construct various nodes representing data types. */
5104 :
5105 : extern tree signed_or_unsigned_type_for (int, tree);
5106 : extern tree signed_type_for (tree);
5107 : extern tree unsigned_type_for (tree);
5108 : extern bool is_truth_type_for (tree, tree);
5109 : extern bool tree_zero_one_valued_p (tree);
5110 : extern tree truth_type_for (tree);
5111 : extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
5112 : extern tree build_pointer_type (tree);
5113 : extern tree build_reference_type_for_mode (tree, machine_mode, bool);
5114 : extern tree build_reference_type (tree);
5115 : extern tree build_vector_type_for_mode (tree, machine_mode);
5116 : extern tree build_vector_type (tree, poly_int64);
5117 : extern tree build_truth_vector_type_for_mode (poly_uint64, machine_mode);
5118 : extern tree build_opaque_vector_type (tree, poly_int64);
5119 : extern tree build_index_type (tree);
5120 : extern tree build_array_type_1 (tree, tree, bool, bool, bool);
5121 : extern tree build_array_type (tree, tree, bool = false);
5122 : extern tree build_nonshared_array_type (tree, tree);
5123 : extern tree build_array_type_nelts (tree, poly_uint64);
5124 : extern tree build_function_type (tree, tree, bool = false);
5125 : extern tree build_function_type_list (tree, ...);
5126 : extern tree build_varargs_function_type_list (tree, ...);
5127 : extern tree build_function_type_array (tree, int, tree *);
5128 : extern tree build_varargs_function_type_array (tree, int, tree *);
5129 : #define build_function_type_vec(RET, V) \
5130 : build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
5131 : #define build_varargs_function_type_vec(RET, V) \
5132 : build_varargs_function_type_array (RET, vec_safe_length (V), \
5133 : vec_safe_address (V))
5134 : extern tree build_method_type_directly (tree, tree, tree);
5135 : extern tree build_method_type (tree, tree);
5136 : extern tree build_offset_type (tree, tree);
5137 : extern tree build_complex_type (tree, bool named = false);
5138 : extern tree array_type_nelts_minus_one (const_tree);
5139 : extern tree array_type_nelts_top (tree);
5140 :
5141 : extern tree value_member (tree, tree);
5142 : extern tree purpose_member (const_tree, tree);
5143 : extern bool vec_member (const_tree, vec<tree, va_gc> *);
5144 : extern tree chain_index (int, tree);
5145 :
5146 : /* Arguments may be null. */
5147 : extern bool tree_int_cst_equal (const_tree, const_tree);
5148 :
5149 : /* The following predicates are safe to call with a null argument. */
5150 : extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE;
5151 : extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE;
5152 : extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE;
5153 : extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE;
5154 : extern bool tree_fits_sanitize_code_type_p (const_tree) ATTRIBUTE_PURE;
5155 :
5156 :
5157 : extern HOST_WIDE_INT tree_to_shwi (const_tree)
5158 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5159 : extern poly_int64 tree_to_poly_int64 (const_tree)
5160 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5161 : extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree)
5162 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5163 : extern poly_uint64 tree_to_poly_uint64 (const_tree)
5164 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5165 : extern sanitize_code_type tree_to_sanitize_code_type (const_tree)
5166 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5167 : #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
5168 : extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
5169 : tree_to_shwi (const_tree t)
5170 : {
5171 : gcc_assert (tree_fits_shwi_p (t));
5172 : return TREE_INT_CST_LOW (t);
5173 : }
5174 :
5175 : extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
5176 : tree_to_uhwi (const_tree t)
5177 : {
5178 : gcc_assert (tree_fits_uhwi_p (t));
5179 : return TREE_INT_CST_LOW (t);
5180 : }
5181 : #if NUM_POLY_INT_COEFFS == 1
5182 : extern inline __attribute__ ((__gnu_inline__)) poly_int64
5183 : tree_to_poly_int64 (const_tree t)
5184 : {
5185 : gcc_assert (tree_fits_poly_int64_p (t));
5186 : return TREE_INT_CST_LOW (t);
5187 : }
5188 :
5189 : extern inline __attribute__ ((__gnu_inline__)) poly_uint64
5190 : tree_to_poly_uint64 (const_tree t)
5191 : {
5192 : gcc_assert (tree_fits_poly_uint64_p (t));
5193 : return TREE_INT_CST_LOW (t);
5194 : }
5195 : #endif
5196 : #endif
5197 : extern int tree_int_cst_sgn (const_tree);
5198 : extern int tree_int_cst_sign_bit (const_tree);
5199 : extern unsigned int tree_int_cst_min_precision (tree, signop);
5200 : extern tree excess_precision_type (tree);
5201 :
5202 : /* Recursively examines the array elements of TYPE, until a non-array
5203 : element type is found. */
5204 :
5205 : inline tree
5206 66316750543 : strip_array_types (tree type)
5207 : {
5208 66408041666 : while (TREE_CODE (type) == ARRAY_TYPE)
5209 91291123 : type = TREE_TYPE (type);
5210 :
5211 66316750543 : return type;
5212 : }
5213 :
5214 : /* Recursively traverse down pointer type layers to pointee type. */
5215 :
5216 : inline const_tree
5217 : strip_pointer_types (const_tree type)
5218 : {
5219 : while (POINTER_TYPE_P (type))
5220 : type = TREE_TYPE (type);
5221 :
5222 : return type;
5223 : }
5224 :
5225 : /* Description of the reason why the argument of valid_constant_size_p
5226 : is not a valid size. */
5227 : enum cst_size_error {
5228 : cst_size_ok,
5229 : cst_size_not_constant,
5230 : cst_size_negative,
5231 : cst_size_too_big,
5232 : cst_size_overflow
5233 : };
5234 :
5235 : extern bool valid_constant_size_p (const_tree, cst_size_error * = NULL);
5236 : extern tree max_object_size ();
5237 :
5238 : /* Return true if T holds a value that can be represented as a poly_int64
5239 : without loss of precision. Store the value in *VALUE if so. */
5240 :
5241 : inline bool
5242 508572907 : poly_int_tree_p (const_tree t, poly_int64 *value)
5243 : {
5244 508572907 : if (tree_fits_poly_int64_p (t))
5245 : {
5246 466821111 : *value = tree_to_poly_int64 (t);
5247 466821111 : return true;
5248 : }
5249 : return false;
5250 : }
5251 :
5252 : /* Return true if T holds a value that can be represented as a poly_uint64
5253 : without loss of precision. Store the value in *VALUE if so. */
5254 :
5255 : inline bool
5256 440942779 : poly_int_tree_p (const_tree t, poly_uint64 *value)
5257 : {
5258 440942779 : if (tree_fits_poly_uint64_p (t))
5259 : {
5260 439400834 : *value = tree_to_poly_uint64 (t);
5261 439400834 : return true;
5262 : }
5263 : return false;
5264 : }
5265 :
5266 : /* From expmed.cc. Since rtl.h is included after tree.h, we can't
5267 : put the prototype here. Rtl.h does declare the prototype if
5268 : tree.h had been included. */
5269 :
5270 : extern tree make_tree (tree, rtx);
5271 :
5272 : /* Returns true iff CAND and BASE have equivalent language-specific
5273 : qualifiers. */
5274 :
5275 : extern bool check_lang_type (const_tree cand, const_tree base);
5276 :
5277 : /* Returns true iff unqualified CAND and BASE are equivalent. */
5278 :
5279 : extern bool check_base_type (const_tree cand, const_tree base);
5280 :
5281 : /* Check whether CAND is suitable to be returned from get_qualified_type
5282 : (BASE, TYPE_QUALS). */
5283 :
5284 : extern bool check_qualified_type (const_tree, const_tree, int);
5285 :
5286 : /* Return a version of the TYPE, qualified as indicated by the
5287 : TYPE_QUALS, if one exists. If no qualified version exists yet,
5288 : return NULL_TREE. */
5289 :
5290 : extern tree get_qualified_type (tree, int);
5291 :
5292 : /* Like get_qualified_type, but creates the type if it does not
5293 : exist. This function never returns NULL_TREE. */
5294 :
5295 : extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO);
5296 :
5297 : /* Create a variant of type T with alignment ALIGN. */
5298 :
5299 : extern tree build_aligned_type (tree, unsigned int);
5300 :
5301 : /* Like build_qualified_type, but only deals with the `const' and
5302 : `volatile' qualifiers. This interface is retained for backwards
5303 : compatibility with the various front-ends; new code should use
5304 : build_qualified_type instead. */
5305 :
5306 : #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
5307 : build_qualified_type ((TYPE), \
5308 : ((CONST_P) ? TYPE_QUAL_CONST : 0) \
5309 : | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
5310 :
5311 : /* Make a copy of a type node. */
5312 :
5313 : extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO);
5314 : extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO);
5315 :
5316 : /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
5317 : return a canonicalized ..._TYPE node, so that duplicates are not made.
5318 : How the hash code is computed is up to the caller, as long as any two
5319 : callers that could hash identical-looking type nodes agree. */
5320 :
5321 : extern hashval_t type_hash_canon_hash (tree);
5322 : extern tree type_hash_canon (unsigned int, tree);
5323 :
5324 : extern tree convert (tree, tree);
5325 : extern tree size_in_bytes_loc (location_t, const_tree);
5326 : inline tree
5327 20098161 : size_in_bytes (const_tree t)
5328 : {
5329 20098161 : return size_in_bytes_loc (input_location, t);
5330 : }
5331 :
5332 : extern HOST_WIDE_INT int_size_in_bytes (const_tree);
5333 : extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
5334 : extern tree bit_position (const_tree);
5335 : extern tree byte_position (const_tree);
5336 : extern HOST_WIDE_INT int_byte_position (const_tree);
5337 :
5338 : /* Type for sizes of data-type. */
5339 :
5340 : #define sizetype sizetype_tab[(int) stk_sizetype]
5341 : #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
5342 : #define ssizetype sizetype_tab[(int) stk_ssizetype]
5343 : #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
5344 : #define size_int(L) size_int_kind (L, stk_sizetype)
5345 : #define ssize_int(L) size_int_kind (L, stk_ssizetype)
5346 : #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
5347 : #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
5348 :
5349 : /* Log2 of BITS_PER_UNIT. */
5350 :
5351 : #if BITS_PER_UNIT == 8
5352 : #define LOG2_BITS_PER_UNIT 3
5353 : #elif BITS_PER_UNIT == 16
5354 : #define LOG2_BITS_PER_UNIT 4
5355 : #else
5356 : #error Unknown BITS_PER_UNIT
5357 : #endif
5358 :
5359 : /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
5360 : by making the last node in X point to Y.
5361 : Returns X, except if X is 0 returns Y. */
5362 :
5363 : extern tree chainon (tree, tree);
5364 :
5365 : /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
5366 :
5367 : extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO);
5368 :
5369 : /* Return the last tree node in a chain. */
5370 :
5371 : extern tree tree_last (tree);
5372 :
5373 : /* Reverse the order of elements in a chain, and return the new head. */
5374 :
5375 : extern tree nreverse (tree);
5376 :
5377 : /* Returns the length of a chain of nodes
5378 : (number of chain pointers to follow before reaching a null pointer). */
5379 :
5380 : extern int list_length (const_tree);
5381 :
5382 : /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
5383 :
5384 : extern tree first_field (const_tree) ATTRIBUTE_NONNULL (1);
5385 : extern tree last_field (const_tree) ATTRIBUTE_NONNULL (1);
5386 :
5387 : /* Given an initializer INIT, return TRUE if INIT is zero or some
5388 : aggregate of zeros. Otherwise return FALSE. If NONZERO is not
5389 : null, set *NONZERO if and only if INIT is known not to be all
5390 : zeros. The combination of return value of false and *NONZERO
5391 : false implies that INIT may but need not be all zeros. Other
5392 : combinations indicate definitive answers. */
5393 :
5394 : extern bool initializer_zerop (const_tree, bool * = NULL);
5395 : extern bool initializer_each_zero_or_onep (const_tree);
5396 :
5397 : extern tree vector_cst_elt (const_tree, unsigned int);
5398 :
5399 : /* Given a vector VEC, return its first element if all elements are
5400 : the same. Otherwise return NULL_TREE. */
5401 :
5402 : extern tree uniform_vector_p (const_tree);
5403 :
5404 : /* Same as above, but if VEC is an SSA_NAME, inspect its definition. */
5405 :
5406 : extern tree ssa_uniform_vector_p (tree);
5407 :
5408 : /* If the argument is INTEGER_CST, return it. If the argument is vector
5409 : with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
5410 : return NULL_TREE. */
5411 :
5412 : extern tree uniform_integer_cst_p (tree);
5413 :
5414 : extern int single_nonzero_element (const_tree);
5415 :
5416 : /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
5417 :
5418 : extern vec<tree, va_gc> *ctor_to_vec (tree);
5419 :
5420 : /* zerop (tree x) is nonzero if X is a constant of value 0. */
5421 :
5422 : extern bool zerop (const_tree);
5423 :
5424 : /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
5425 :
5426 : extern bool integer_zerop (const_tree);
5427 :
5428 : /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
5429 :
5430 : extern bool integer_onep (const_tree);
5431 :
5432 : /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
5433 : a vector or complex where each part is 1. */
5434 :
5435 : extern bool integer_each_onep (const_tree);
5436 :
5437 : /* integer_all_onesp (tree x) is nonzero if X is an integer constant
5438 : all of whose significant bits are 1. */
5439 :
5440 : extern bool integer_all_onesp (const_tree);
5441 :
5442 : /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
5443 : value -1. */
5444 :
5445 : extern bool integer_minus_onep (const_tree);
5446 :
5447 : /* integer_pow2p (tree x) is nonzero is X is an integer constant with
5448 : exactly one bit 1. */
5449 :
5450 : extern bool integer_pow2p (const_tree);
5451 :
5452 : /* Checks to see if T is a constant or a constant vector and if each element E
5453 : adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
5454 :
5455 : extern tree bitmask_inv_cst_vector_p (tree);
5456 :
5457 : /* integer_nonzerop (tree x) is nonzero if X is an integer constant
5458 : with a nonzero value. */
5459 :
5460 : extern bool integer_nonzerop (const_tree);
5461 :
5462 : /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
5463 : a vector where each element is an integer constant of value -1. */
5464 :
5465 : extern bool integer_truep (const_tree);
5466 :
5467 : extern bool cst_and_fits_in_hwi (const_tree);
5468 : extern tree num_ending_zeros (const_tree);
5469 :
5470 : /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
5471 : value 0. */
5472 :
5473 : extern bool fixed_zerop (const_tree);
5474 :
5475 : /* staticp (tree x) is nonzero if X is a reference to data allocated
5476 : at a fixed address in memory. Returns the outermost data. */
5477 :
5478 : extern tree staticp (tree);
5479 :
5480 : /* save_expr (EXP) returns an expression equivalent to EXP
5481 : but it can be used multiple times within context CTX
5482 : and only evaluate EXP once. */
5483 :
5484 : extern tree save_expr (tree);
5485 :
5486 : /* Return true if T is an object with invariant address. */
5487 :
5488 : extern bool address_invariant_p (tree);
5489 :
5490 : /* Return true if T is function-invariant. */
5491 :
5492 : extern bool tree_invariant_p (tree);
5493 :
5494 : /* Look inside EXPR into any simple arithmetic operations. Return the
5495 : outermost non-arithmetic or non-invariant node. */
5496 :
5497 : extern tree skip_simple_arithmetic (tree);
5498 :
5499 : /* Look inside EXPR into simple arithmetic operations involving constants.
5500 : Return the outermost non-arithmetic or non-constant node. */
5501 :
5502 : extern tree skip_simple_constant_arithmetic (tree);
5503 :
5504 : /* Return which tree structure is used by T. */
5505 :
5506 : enum tree_node_structure_enum tree_node_structure (const_tree);
5507 :
5508 : /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
5509 : size or offset that depends on a field within a record. */
5510 :
5511 : extern bool contains_placeholder_p (const_tree);
5512 :
5513 : /* This macro calls the above function but short-circuits the common
5514 : case of a constant to save time. Also check for null. */
5515 :
5516 : #define CONTAINS_PLACEHOLDER_P(EXP) \
5517 : ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5518 :
5519 : /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5520 : directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5521 : field positions. */
5522 :
5523 : extern bool type_contains_placeholder_p (tree);
5524 :
5525 : /* Given a tree EXP, find all occurrences of references to fields
5526 : in a PLACEHOLDER_EXPR and place them in vector REFS without
5527 : duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5528 : we assume here that EXP contains only arithmetic expressions
5529 : or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5530 : argument list. */
5531 :
5532 : extern void find_placeholder_in_expr (tree, vec<tree> *);
5533 :
5534 : /* This macro calls the above function but short-circuits the common
5535 : case of a constant to save time and also checks for NULL. */
5536 :
5537 : #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5538 : do { \
5539 : if((EXP) && !TREE_CONSTANT (EXP)) \
5540 : find_placeholder_in_expr (EXP, V); \
5541 : } while (0)
5542 :
5543 : /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5544 : return a tree with all occurrences of references to F in a
5545 : PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5546 : CONST_DECLs. Note that we assume here that EXP contains only
5547 : arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5548 : occurring only in their argument list. */
5549 :
5550 : extern tree substitute_in_expr (tree, tree, tree);
5551 :
5552 : /* This macro calls the above function but short-circuits the common
5553 : case of a constant to save time and also checks for NULL. */
5554 :
5555 : #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5556 : ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5557 :
5558 : /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5559 : for it within OBJ, a tree that is an object or a chain of references. */
5560 :
5561 : extern tree substitute_placeholder_in_expr (tree, tree);
5562 :
5563 : /* This macro calls the above function but short-circuits the common
5564 : case of a constant to save time and also checks for NULL. */
5565 :
5566 : #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5567 : ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5568 : : substitute_placeholder_in_expr (EXP, OBJ))
5569 :
5570 :
5571 : /* stabilize_reference (EXP) returns a reference equivalent to EXP
5572 : but it can be used multiple times
5573 : and only evaluate the subexpressions once. */
5574 :
5575 : extern tree stabilize_reference (tree);
5576 :
5577 : /* Return EXP, stripped of any conversions to wider types
5578 : in such a way that the result of converting to type FOR_TYPE
5579 : is the same as if EXP were converted to FOR_TYPE.
5580 : If FOR_TYPE is 0, it signifies EXP's type. */
5581 :
5582 : extern tree get_unwidened (tree, tree);
5583 :
5584 : /* Return OP or a simpler expression for a narrower value
5585 : which can be sign-extended or zero-extended to give back OP.
5586 : Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5587 : or 0 if the value should be sign-extended. */
5588 :
5589 : extern tree get_narrower (tree, int *);
5590 :
5591 : /* Return true if T is an expression that get_inner_reference handles. */
5592 :
5593 : inline bool
5594 37098048593 : handled_component_p (const_tree t)
5595 : {
5596 36687676383 : switch (TREE_CODE (t))
5597 : {
5598 : case COMPONENT_REF:
5599 : case BIT_FIELD_REF:
5600 : case ARRAY_REF:
5601 : case ARRAY_RANGE_REF:
5602 : case REALPART_EXPR:
5603 : case IMAGPART_EXPR:
5604 : case VIEW_CONVERT_EXPR:
5605 : return true;
5606 :
5607 18479114663 : default:
5608 18479099851 : return false;
5609 : }
5610 : }
5611 :
5612 : /* Return true T is a component with reverse storage order. */
5613 :
5614 : inline bool
5615 3519489270 : reverse_storage_order_for_component_p (tree t)
5616 : {
5617 : /* The storage order only applies to scalar components. */
5618 6865144123 : if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5619 2694236574 : || POINTER_TYPE_P (TREE_TYPE (t))
5620 5353364397 : || VECTOR_TYPE_P (TREE_TYPE (t)))
5621 : return false;
5622 :
5623 1718743280 : if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
5624 9906835 : t = TREE_OPERAND (t, 0);
5625 :
5626 1718743280 : switch (TREE_CODE (t))
5627 : {
5628 1219620297 : case ARRAY_REF:
5629 1219620297 : case COMPONENT_REF:
5630 : /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
5631 : /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5632 2197401409 : return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
5633 2197401409 : && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
5634 :
5635 308726147 : case BIT_FIELD_REF:
5636 308726147 : case MEM_REF:
5637 308726147 : return REF_REVERSE_STORAGE_ORDER (t);
5638 :
5639 : case ARRAY_RANGE_REF:
5640 : case VIEW_CONVERT_EXPR:
5641 : default:
5642 : return false;
5643 : }
5644 : }
5645 :
5646 : /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5647 : that can modify the storage order of objects. Note that, even if the
5648 : TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5649 : outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5650 : it can change the partition of the aggregate object into scalars. */
5651 :
5652 : inline bool
5653 87052697 : storage_order_barrier_p (const_tree t)
5654 : {
5655 87052697 : if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
5656 : return false;
5657 :
5658 3538709 : if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5659 3455729 : && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
5660 : return true;
5661 :
5662 1959599 : tree op = TREE_OPERAND (t, 0);
5663 :
5664 3894507 : if (AGGREGATE_TYPE_P (TREE_TYPE (op))
5665 3456112 : && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
5666 : return true;
5667 :
5668 1959599 : return reverse_storage_order_for_component_p (op);
5669 : }
5670 :
5671 : /* Given a DECL or TYPE, return the scope in which it was declared, or
5672 : NUL_TREE if there is no containing scope. */
5673 :
5674 : extern tree get_containing_scope (const_tree);
5675 :
5676 : /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5677 :
5678 : extern const_tree get_ultimate_context (const_tree);
5679 :
5680 : /* Return the FUNCTION_DECL which provides this _DECL with its context,
5681 : or zero if none. */
5682 : extern tree decl_function_context (const_tree);
5683 :
5684 : /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5685 : this _DECL with its context, or zero if none. */
5686 : extern tree decl_type_context (const_tree);
5687 :
5688 : /* Return true if EXPR is the real constant zero. */
5689 : extern bool real_zerop (const_tree);
5690 :
5691 : /* Initialize the iterator I with arguments from function FNDECL */
5692 :
5693 : inline void
5694 1504797210 : function_args_iter_init (function_args_iterator *i, const_tree fntype)
5695 : {
5696 1504797210 : i->next = TYPE_ARG_TYPES (fntype);
5697 1504797210 : }
5698 :
5699 : /* Return a pointer that holds the next argument if there are more arguments to
5700 : handle, otherwise return NULL. */
5701 :
5702 : inline tree *
5703 : function_args_iter_cond_ptr (function_args_iterator *i)
5704 : {
5705 : return (i->next) ? &TREE_VALUE (i->next) : NULL;
5706 : }
5707 :
5708 : /* Return the next argument if there are more arguments to handle, otherwise
5709 : return NULL. */
5710 :
5711 : inline tree
5712 2351347433 : function_args_iter_cond (function_args_iterator *i)
5713 : {
5714 2351347433 : return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
5715 : }
5716 :
5717 : /* Advance to the next argument. */
5718 : inline void
5719 850150981 : function_args_iter_next (function_args_iterator *i)
5720 : {
5721 850150981 : gcc_assert (i->next != NULL_TREE);
5722 850150981 : i->next = TREE_CHAIN (i->next);
5723 850150981 : }
5724 :
5725 : /* Returns true if a BLOCK has a source location.
5726 : BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5727 : so the function returns true for all but the innermost and outermost
5728 : blocks into which an expression has been inlined. */
5729 :
5730 : inline bool
5731 49580217 : inlined_function_outer_scope_p (const_tree block)
5732 : {
5733 49580217 : return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
5734 : }
5735 :
5736 : /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5737 : to point to the next tree element. ITER is an instance of
5738 : function_args_iterator used to iterate the arguments. */
5739 : #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5740 : for (function_args_iter_init (&(ITER), (FNTYPE)); \
5741 : (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5742 : function_args_iter_next (&(ITER)))
5743 :
5744 : /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5745 : to the next tree element. ITER is an instance of function_args_iterator
5746 : used to iterate the arguments. */
5747 : #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5748 : for (function_args_iter_init (&(ITER), (FNTYPE)); \
5749 : (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5750 : function_args_iter_next (&(ITER)))
5751 :
5752 : /* In tree.cc */
5753 : extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5754 : extern unsigned crc32_string (unsigned, const char *);
5755 : inline unsigned
5756 954914 : crc32_unsigned (unsigned chksum, unsigned value)
5757 : {
5758 950948 : return crc32_unsigned_n (chksum, value, 4);
5759 : }
5760 : inline unsigned
5761 16090787 : crc32_byte (unsigned chksum, char byte)
5762 : {
5763 16090787 : return crc32_unsigned_n (chksum, byte, 1);
5764 : }
5765 : extern void clean_symbol_name (char *);
5766 : extern tree get_file_function_name (const char *);
5767 : extern tree get_callee_fndecl (const_tree);
5768 : extern combined_fn get_call_combined_fn (const_tree);
5769 : extern int type_num_arguments (const_tree);
5770 : extern tree type_argument_type (const_tree, unsigned) ATTRIBUTE_NONNULL (1);
5771 : extern bool associative_tree_code (enum tree_code);
5772 : extern bool commutative_tree_code (enum tree_code);
5773 : extern bool commutative_ternary_tree_code (enum tree_code);
5774 : extern bool operation_can_overflow (enum tree_code);
5775 : extern bool operation_no_trapping_overflow (tree, enum tree_code);
5776 : extern tree upper_bound_in_type (tree, tree);
5777 : extern tree lower_bound_in_type (tree, tree);
5778 : extern bool operand_equal_for_phi_arg_p (const_tree, const_tree);
5779 : extern tree create_artificial_label (location_t);
5780 : extern const char *get_name (tree);
5781 : extern bool stdarg_p (const_tree);
5782 : extern bool prototype_p (const_tree);
5783 : extern bool auto_var_p (const_tree);
5784 : extern bool auto_var_in_fn_p (const_tree, const_tree);
5785 : extern tree build_low_bits_mask (tree, unsigned);
5786 : extern bool tree_nop_conversion_p (const_tree, const_tree);
5787 : extern tree tree_strip_nop_conversions (tree);
5788 : extern tree tree_strip_sign_nop_conversions (tree);
5789 : extern const_tree strip_invariant_refs (const_tree);
5790 : extern tree strip_zero_offset_components (tree);
5791 : extern tree lhd_gcc_personality (void);
5792 : extern void assign_assembler_name_if_needed (tree);
5793 : extern bool warn_deprecated_use (tree, tree);
5794 : extern void error_unavailable_use (tree, tree);
5795 : extern tree cache_integer_cst (tree, bool might_duplicate = false);
5796 : extern const char *combined_fn_name (combined_fn);
5797 :
5798 : /* Returns true if X is a typedef decl. */
5799 :
5800 : inline bool
5801 33439477009 : is_typedef_decl (const_tree x)
5802 : {
5803 27291856309 : return (x && TREE_CODE (x) == TYPE_DECL
5804 28927786564 : && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
5805 : }
5806 :
5807 : /* Returns true iff TYPE is a type variant created for a typedef. */
5808 :
5809 : inline bool
5810 26152361246 : typedef_variant_p (const_tree type)
5811 : {
5812 26152361246 : return is_typedef_decl (TYPE_NAME (type));
5813 : }
5814 :
5815 : /* Compare and hash for any structure which begins with a canonical
5816 : pointer. Assumes all pointers are interchangeable, which is sort
5817 : of already assumed by gcc elsewhere IIRC. */
5818 :
5819 : inline int
5820 : struct_ptr_eq (const void *a, const void *b)
5821 : {
5822 : const void * const * x = (const void * const *) a;
5823 : const void * const * y = (const void * const *) b;
5824 : return *x == *y;
5825 : }
5826 :
5827 : inline hashval_t
5828 : struct_ptr_hash (const void *a)
5829 : {
5830 : const void * const * x = (const void * const *) a;
5831 : return (intptr_t)*x >> 4;
5832 : }
5833 :
5834 : /* Return true if CODE can be treated as a truncating division.
5835 :
5836 : EXACT_DIV_EXPR can be treated as a truncating division in which the
5837 : remainder is known to be zero. However, if trunc_div_p gates the
5838 : generation of new IL, the conservative choice for that new IL is
5839 : TRUNC_DIV_EXPR rather than CODE. Using CODE (EXACT_DIV_EXPR) would
5840 : only be correct if the transformation preserves exactness. */
5841 : inline bool
5842 814865 : trunc_or_exact_div_p (tree_code code)
5843 : {
5844 814865 : return code == TRUNC_DIV_EXPR || code == EXACT_DIV_EXPR;
5845 : }
5846 :
5847 : /* Return true if CODE is an integer division or integer mod code. */
5848 : inline bool
5849 9435 : int_divide_or_mod_p (const code_helper &code)
5850 : {
5851 9435 : switch (code.get_rep())
5852 : {
5853 : case TRUNC_DIV_EXPR:
5854 : case CEIL_DIV_EXPR:
5855 : case FLOOR_DIV_EXPR:
5856 : case ROUND_DIV_EXPR:
5857 : case EXACT_DIV_EXPR:
5858 : case TRUNC_MOD_EXPR:
5859 : case FLOOR_MOD_EXPR:
5860 : case CEIL_MOD_EXPR:
5861 : case ROUND_MOD_EXPR:
5862 : return true;
5863 : default:
5864 : return false;
5865 : }
5866 : }
5867 :
5868 : /* Return nonzero if CODE is a tree code that represents a truth value. */
5869 : inline bool
5870 189353022 : truth_value_p (enum tree_code code)
5871 : {
5872 189353022 : return (TREE_CODE_CLASS (code) == tcc_comparison
5873 174425494 : || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5874 174262366 : || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5875 363486551 : || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5876 : }
5877 :
5878 : /* Return whether TYPE is a type suitable for an offset for
5879 : a POINTER_PLUS_EXPR. */
5880 : inline bool
5881 275823541 : ptrofftype_p (tree type)
5882 : {
5883 275823541 : return (INTEGRAL_TYPE_P (type)
5884 270343539 : && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
5885 546137738 : && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
5886 : }
5887 :
5888 : /* Return true if the argument is a complete type or an array
5889 : of unknown bound (whose type is incomplete but) whose elements
5890 : have complete type. */
5891 : inline bool
5892 8813316 : complete_or_array_type_p (const_tree type)
5893 : {
5894 8813316 : return COMPLETE_TYPE_P (type)
5895 8813316 : || (TREE_CODE (type) == ARRAY_TYPE
5896 134430 : && COMPLETE_TYPE_P (TREE_TYPE (type)));
5897 : }
5898 :
5899 : /* Return true if the value of T could be represented as a poly_widest_int. */
5900 :
5901 : inline bool
5902 20897914441 : poly_int_tree_p (const_tree t)
5903 : {
5904 14711620258 : return (TREE_CODE (t) == INTEGER_CST || POLY_INT_CST_P (t));
5905 : }
5906 :
5907 : /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5908 : to be a poly_uint64. (This is always true at the gimple level.) */
5909 :
5910 : inline poly_uint64
5911 385765 : bit_field_size (const_tree t)
5912 : {
5913 385765 : return tree_to_poly_uint64 (TREE_OPERAND (t, 1));
5914 : }
5915 :
5916 : /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5917 : known to be a poly_uint64. (This is always true at the gimple level.) */
5918 :
5919 : inline poly_uint64
5920 1164081 : bit_field_offset (const_tree t)
5921 : {
5922 1164081 : return tree_to_poly_uint64 (TREE_OPERAND (t, 2));
5923 : }
5924 :
5925 : extern tree strip_float_extensions (tree);
5926 : extern bool really_constant_p (const_tree);
5927 : extern bool ptrdiff_tree_p (const_tree, poly_int64 *);
5928 : extern bool decl_address_invariant_p (const_tree);
5929 : extern bool decl_address_ip_invariant_p (const_tree);
5930 : extern bool int_fits_type_p (const_tree, const_tree)
5931 : ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE;
5932 : #ifndef GENERATOR_FILE
5933 : extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5934 : #endif
5935 : extern bool variably_modified_type_p (tree, tree);
5936 : extern int tree_log2 (const_tree);
5937 : extern int tree_floor_log2 (const_tree);
5938 : extern unsigned int tree_ctz (const_tree);
5939 : extern int simple_cst_equal (const_tree, const_tree);
5940 :
5941 : namespace inchash
5942 : {
5943 :
5944 : extern void add_expr (const_tree, hash &, unsigned int = 0);
5945 :
5946 : }
5947 :
5948 : /* Compat version until all callers are converted. Return hash for
5949 : TREE with SEED. */
5950 883332642 : inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
5951 : {
5952 877850677 : inchash::hash hstate (seed);
5953 877850677 : inchash::add_expr (tree, hstate);
5954 875374044 : return hstate.end ();
5955 : }
5956 :
5957 : extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5958 : extern bool type_list_equal (const_tree, const_tree);
5959 : extern bool chain_member (const_tree, const_tree);
5960 : extern void dump_tree_statistics (void);
5961 : extern void recompute_tree_invariant_for_addr_expr (tree);
5962 : extern bool needs_to_live_in_memory (const_tree);
5963 : extern tree reconstruct_complex_type (tree, tree);
5964 : extern bool real_onep (const_tree);
5965 : extern bool real_minus_onep (const_tree);
5966 : extern bool real_maybe_zerop (const_tree);
5967 : extern void init_ttree (void);
5968 : extern void build_common_tree_nodes (bool);
5969 : extern void build_common_builtin_nodes (void);
5970 : extern void tree_cc_finalize (void);
5971 : extern tree unsigned_integer_tree_node_for_type (const char *);
5972 : extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5973 : extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
5974 : extern tree build_bitint_type (unsigned HOST_WIDE_INT, int);
5975 : extern tree build_range_type (tree, tree, tree);
5976 : extern tree build_nonshared_range_type (tree, tree, tree);
5977 : extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5978 : extern HOST_WIDE_INT int_cst_value (const_tree);
5979 : extern tree tree_block (tree);
5980 : extern void tree_set_block (tree, tree);
5981 : extern location_t *block_nonartificial_location (tree);
5982 : extern location_t tree_nonartificial_location (tree);
5983 : extern location_t tree_inlined_location (tree, bool = true);
5984 : extern tree block_ultimate_origin (const_tree);
5985 : extern tree get_binfo_at_offset (tree, poly_int64, tree);
5986 : extern bool virtual_method_call_p (const_tree, bool = false);
5987 : extern tree obj_type_ref_class (const_tree ref, bool = false);
5988 : extern bool types_same_for_odr (const_tree type1, const_tree type2);
5989 : extern bool contains_bitfld_component_ref_p (const_tree);
5990 : extern bool block_may_fallthru (const_tree);
5991 : extern void using_eh_for_cleanups (void);
5992 : extern bool using_eh_for_cleanups_p (void);
5993 : extern const char *get_tree_code_name (enum tree_code);
5994 : extern void set_call_expr_flags (tree, int);
5995 : extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
5996 : walk_tree_lh);
5997 : extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5998 : walk_tree_lh);
5999 : #define walk_tree(a,b,c,d) \
6000 : walk_tree_1 (a, b, c, d, NULL)
6001 : #define walk_tree_without_duplicates(a,b,c) \
6002 : walk_tree_without_duplicates_1 (a, b, c, NULL)
6003 :
6004 : extern tree drop_tree_overflow (tree);
6005 :
6006 : /* Given a memory reference expression T, return its base address.
6007 : The base address of a memory reference expression is the main
6008 : object being referenced. */
6009 : extern tree get_base_address (tree t);
6010 :
6011 : /* Return a tree of sizetype representing the size, in bytes, of the element
6012 : of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6013 : extern tree array_ref_element_size (tree);
6014 :
6015 : /* Return a typenode for the "standard" C type with a given name. */
6016 : extern tree get_typenode_from_name (const char *);
6017 :
6018 : /* Return a tree representing the upper bound of the array mentioned in
6019 : EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6020 : extern tree array_ref_up_bound (tree);
6021 :
6022 : /* Return a tree representing the lower bound of the array mentioned in
6023 : EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6024 : extern tree array_ref_low_bound (tree);
6025 :
6026 : /* Returns true if REF is an array reference, a component reference,
6027 : or a memory reference to an array whose actual size might be larger
6028 : than its upper bound implies. */
6029 : extern bool array_ref_flexible_size_p (tree, bool * = NULL);
6030 :
6031 : /* Return a tree representing the offset, in bytes, of the field referenced
6032 : by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6033 : extern tree component_ref_field_offset (tree);
6034 :
6035 : /* Describes a "special" array member for a COMPONENT_REF. */
6036 : enum struct special_array_member
6037 : {
6038 : none, /* Not a special array member. */
6039 : int_0, /* Interior array member with zero elements. */
6040 : trail_0, /* Trailing array member with zero elements. */
6041 : trail_1, /* Trailing array member with one element. */
6042 : trail_n, /* Trailing array member with two or more elements. */
6043 : int_n /* Interior array member with one or more elements. */
6044 : };
6045 :
6046 : /* Determines the special array member type for a COMPONENT_REF. */
6047 : extern special_array_member component_ref_sam_type (tree);
6048 :
6049 : /* Return the size of the member referenced by the COMPONENT_REF, using
6050 : its initializer expression if necessary in order to determine the size
6051 : of an initialized flexible array member. The size might be zero for
6052 : an object with an uninitialized flexible array member or null if it
6053 : cannot be determined. */
6054 : extern tree component_ref_size (tree, special_array_member * = NULL);
6055 :
6056 : /* Return true if the given node is a call to a .ACCESS_WITH_SIZE
6057 : function. */
6058 : extern bool is_access_with_size_p (const_tree);
6059 :
6060 : /* Get the corresponding reference from the call to a .ACCESS_WITH_SIZE,
6061 : * i.e. the first argument of this call. Return NULL_TREE otherwise. */
6062 : extern tree get_ref_from_access_with_size (tree);
6063 :
6064 : extern int tree_map_base_eq (const void *, const void *);
6065 : extern unsigned int tree_map_base_hash (const void *);
6066 : extern bool tree_map_base_marked_p (const void *);
6067 : extern void DEBUG_FUNCTION verify_type (const_tree t);
6068 : extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
6069 : bool trust_type_canonical = true);
6070 : extern bool type_with_interoperable_signedness (const_tree);
6071 : extern bitmap get_nonnull_args (const_tree);
6072 : extern int get_range_pos_neg (tree, gimple * = NULL);
6073 :
6074 : /* Return true for a valid pair of new and delete operators. */
6075 : extern bool valid_new_delete_pair_p (tree, tree, bool * = NULL);
6076 :
6077 : /* Return whether the second argument is a subtree of the first one. */
6078 : extern bool find_tree (tree, tree);
6079 :
6080 : /* Return simplified tree code of type that is used for canonical type
6081 : merging. */
6082 : inline enum tree_code
6083 681175902 : tree_code_for_canonical_type_merging (enum tree_code code)
6084 : {
6085 : /* By C standard, each enumerated type shall be compatible with char,
6086 : a signed integer, or an unsigned integer. The choice of type is
6087 : implementation defined (in our case it depends on -fshort-enum).
6088 :
6089 : For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
6090 : type and compare only by their signedness and precision. */
6091 676897824 : if (code == ENUMERAL_TYPE)
6092 : return INTEGER_TYPE;
6093 : /* To allow inter-operability between languages having references and
6094 : C, we consider reference types and pointers alike. Note that this is
6095 : not strictly necessary for C-Fortran 2008 interoperability because
6096 : Fortran define C_PTR type that needs to be compatible with C pointers
6097 : and we handle this one as ptr_type_node. */
6098 672725759 : if (code == REFERENCE_TYPE)
6099 39732486 : return POINTER_TYPE;
6100 : return code;
6101 : }
6102 :
6103 : /* Return true if get_alias_set care about TYPE_CANONICAL of given type.
6104 : We don't define the types for pointers, arrays and vectors. The reason is
6105 : that pointers are handled specially: ptr_type_node accesses conflict with
6106 : accesses to all other pointers. This is done by alias.cc.
6107 : Because alias sets of arrays and vectors are the same as types of their
6108 : elements, we can't compute canonical type either. Otherwise we could go
6109 : form void *[10] to int *[10] (because they are equivalent for canonical type
6110 : machinery) and get wrong TBAA. */
6111 :
6112 : inline bool
6113 266790524 : canonical_type_used_p (const_tree t)
6114 : {
6115 270848777 : return !(POINTER_TYPE_P (t)
6116 4206884 : || TREE_CODE (t) == ARRAY_TYPE
6117 : || TREE_CODE (t) == VECTOR_TYPE);
6118 : }
6119 :
6120 : /* Kinds of access to pass-by-reference arguments to functions. */
6121 : enum access_mode
6122 : {
6123 : access_none = 0,
6124 : access_read_only = 1,
6125 : access_write_only = 2,
6126 : access_read_write = access_read_only | access_write_only,
6127 : access_deferred = 4
6128 : };
6129 :
6130 : #define tree_map_eq tree_map_base_eq
6131 : extern unsigned int tree_map_hash (const void *);
6132 : #define tree_map_marked_p tree_map_base_marked_p
6133 :
6134 : #define tree_decl_map_eq tree_map_base_eq
6135 : extern unsigned int tree_decl_map_hash (const void *);
6136 : #define tree_decl_map_marked_p tree_map_base_marked_p
6137 :
6138 : struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
6139 : {
6140 1290020051 : static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
6141 : static bool
6142 1887355149 : equal (tree_decl_map *a, tree_decl_map *b)
6143 : {
6144 1887355149 : return tree_decl_map_eq (a, b);
6145 : }
6146 :
6147 : static int
6148 34088201 : keep_cache_entry (tree_decl_map *&m)
6149 : {
6150 34088201 : return ggc_marked_p (m->base.from);
6151 : }
6152 : };
6153 :
6154 : #define tree_int_map_eq tree_map_base_eq
6155 : #define tree_int_map_hash tree_map_base_hash
6156 : #define tree_int_map_marked_p tree_map_base_marked_p
6157 :
6158 : #define tree_vec_map_eq tree_map_base_eq
6159 : #define tree_vec_map_hash tree_decl_map_hash
6160 : #define tree_vec_map_marked_p tree_map_base_marked_p
6161 :
6162 : struct tree_vec_map_cache_hasher : ggc_cache_ptr_hash<tree_vec_map>
6163 : {
6164 6150584 : static hashval_t hash (tree_vec_map *m) { return DECL_UID (m->base.from); }
6165 :
6166 : static bool
6167 7310748 : equal (tree_vec_map *a, tree_vec_map *b)
6168 : {
6169 7310748 : return a->base.from == b->base.from;
6170 : }
6171 :
6172 : static int
6173 892894 : keep_cache_entry (tree_vec_map *&m)
6174 : {
6175 892894 : return ggc_marked_p (m->base.from);
6176 : }
6177 : };
6178 :
6179 : /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
6180 : is a better hash than the pointer value and gives a predictable traversal
6181 : order. Additionally it can be used across PCH save/restore. */
6182 : struct tree_decl_hash : ggc_ptr_hash <tree_node>
6183 : {
6184 : static inline hashval_t hash (tree);
6185 : };
6186 :
6187 : inline hashval_t
6188 6551763726 : tree_decl_hash::hash (tree t)
6189 : {
6190 6551763726 : return DECL_UID (t);
6191 : }
6192 :
6193 : /* Similarly for types. Uses TYPE_UID as hash function. */
6194 : struct tree_type_hash : ggc_ptr_hash <tree_node>
6195 : {
6196 : static inline hashval_t hash (tree);
6197 : };
6198 :
6199 : inline hashval_t
6200 132387887 : tree_type_hash::hash (tree t)
6201 : {
6202 132387887 : return TYPE_UID (t);
6203 : }
6204 :
6205 : /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
6206 : here, but the SSA_NAME_VERSION is a better hash than the pointer
6207 : value and gives a predictable traversal order. */
6208 : struct tree_ssa_name_hash : ggc_ptr_hash <tree_node>
6209 : {
6210 : static inline hashval_t hash (tree);
6211 : };
6212 :
6213 : inline hashval_t
6214 228480 : tree_ssa_name_hash::hash (tree t)
6215 : {
6216 228480 : return SSA_NAME_VERSION (t);
6217 : }
6218 :
6219 : /* Hasher for general trees, based on their TREE_HASH. */
6220 : struct tree_hash : ggc_ptr_hash <tree_node>
6221 : {
6222 : static hashval_t hash (tree);
6223 : };
6224 :
6225 : inline hashval_t
6226 68357 : tree_hash::hash (tree t)
6227 : {
6228 68357 : return TREE_HASH (t);
6229 : }
6230 :
6231 : /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
6232 : such a map will not mark keys, and will mark values if the key is already
6233 : marked. */
6234 : struct tree_cache_traits
6235 : : simple_cache_map_traits<default_hash_traits<tree>, tree> { };
6236 : typedef hash_map<tree,tree,tree_cache_traits> tree_cache_map;
6237 :
6238 : /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
6239 : This is for hash_maps from decls to trees that need to work across PCH. */
6240 : struct decl_tree_cache_traits
6241 : : simple_cache_map_traits<tree_decl_hash, tree> { };
6242 : typedef hash_map<tree,tree,decl_tree_cache_traits> decl_tree_cache_map;
6243 :
6244 : /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
6245 : This is for hash_maps from types to trees that need to work across PCH. */
6246 : struct type_tree_cache_traits
6247 : : simple_cache_map_traits<tree_type_hash, tree> { };
6248 : typedef hash_map<tree,tree,type_tree_cache_traits> type_tree_cache_map;
6249 :
6250 : /* Similarly to decl_tree_cache_map, but without caching. */
6251 : struct decl_tree_traits
6252 : : simple_hashmap_traits<tree_decl_hash, tree> { };
6253 : typedef hash_map<tree,tree,decl_tree_traits> decl_tree_map;
6254 :
6255 : /* Initialize the abstract argument list iterator object ITER with the
6256 : arguments from CALL_EXPR node EXP. */
6257 : inline void
6258 192515893 : init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
6259 : {
6260 192515893 : iter->t = exp;
6261 192515893 : iter->n = call_expr_nargs (exp);
6262 192515893 : iter->i = 0;
6263 192515893 : }
6264 :
6265 : inline void
6266 2189765 : init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
6267 : {
6268 2189765 : iter->t = exp;
6269 2189765 : iter->n = call_expr_nargs (exp);
6270 2189765 : iter->i = 0;
6271 2189765 : }
6272 :
6273 : /* Return the next argument from abstract argument list iterator object ITER,
6274 : and advance its state. Return NULL_TREE if there are no more arguments. */
6275 : inline tree
6276 273992244 : next_call_expr_arg (call_expr_arg_iterator *iter)
6277 : {
6278 273992244 : tree result;
6279 273992244 : if (iter->i >= iter->n)
6280 : return NULL_TREE;
6281 130708498 : result = CALL_EXPR_ARG (iter->t, iter->i);
6282 130708498 : iter->i++;
6283 130708498 : return result;
6284 : }
6285 :
6286 : inline const_tree
6287 4283979 : next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
6288 : {
6289 4283979 : const_tree result;
6290 4283979 : if (iter->i >= iter->n)
6291 : return NULL_TREE;
6292 3466889 : result = CALL_EXPR_ARG (iter->t, iter->i);
6293 3466889 : iter->i++;
6294 3466889 : return result;
6295 : }
6296 :
6297 : /* Initialize the abstract argument list iterator object ITER, then advance
6298 : past and return the first argument. Useful in for expressions, e.g.
6299 : for (arg = first_call_expr_arg (exp, &iter); arg;
6300 : arg = next_call_expr_arg (&iter)) */
6301 : inline tree
6302 143283973 : first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
6303 : {
6304 143283973 : init_call_expr_arg_iterator (exp, iter);
6305 143283973 : return next_call_expr_arg (iter);
6306 : }
6307 :
6308 : inline const_tree
6309 1040145 : first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
6310 : {
6311 1040145 : init_const_call_expr_arg_iterator (exp, iter);
6312 1040145 : return next_const_call_expr_arg (iter);
6313 : }
6314 :
6315 : /* Test whether there are more arguments in abstract argument list iterator
6316 : ITER, without changing its state. */
6317 : inline bool
6318 26273661 : more_call_expr_args_p (const call_expr_arg_iterator *iter)
6319 : {
6320 26273661 : return (iter->i < iter->n);
6321 : }
6322 :
6323 : /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6324 : (of type call_expr_arg_iterator) to hold the iteration state. */
6325 : #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6326 : for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6327 : (arg) = next_call_expr_arg (&(iter)))
6328 :
6329 : #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6330 : for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6331 : (arg) = next_const_call_expr_arg (&(iter)))
6332 :
6333 : /* Return true if tree node T is a language-specific node. */
6334 : inline bool
6335 170198373 : is_lang_specific (const_tree t)
6336 : {
6337 170198373 : return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
6338 : }
6339 :
6340 : /* Valid builtin number. */
6341 : #define BUILTIN_VALID_P(FNCODE) \
6342 : (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6343 :
6344 : /* Obtain a pointer to the identifier string holding the asm name for
6345 : BUILTIN, a BUILT_IN code. This is handy if the target
6346 : mangles/overrides the function name that implements the
6347 : builtin. */
6348 : #define BUILTIN_ASM_NAME_PTR(BUILTIN) \
6349 : (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
6350 :
6351 : /* Return the tree node for an explicit standard builtin function or NULL. */
6352 : inline tree
6353 340454582 : builtin_decl_explicit (enum built_in_function fncode)
6354 : {
6355 317772223 : gcc_checking_assert (BUILTIN_VALID_P (fncode));
6356 :
6357 324920214 : return builtin_info[(size_t)fncode].decl;
6358 : }
6359 :
6360 : /* Return the tree node for an implicit builtin function or NULL. */
6361 : inline tree
6362 921205 : builtin_decl_implicit (enum built_in_function fncode)
6363 : {
6364 921205 : size_t uns_fncode = (size_t)fncode;
6365 411184 : gcc_checking_assert (BUILTIN_VALID_P (fncode));
6366 :
6367 921205 : if (!builtin_info[uns_fncode].implicit_p)
6368 : return NULL_TREE;
6369 :
6370 919494 : return builtin_info[uns_fncode].decl;
6371 : }
6372 :
6373 : /* For BUILTIN_UNREACHABLE, use one of these or
6374 : gimple_build_builtin_unreachable instead of one of the above. */
6375 : extern tree builtin_decl_unreachable ();
6376 : extern tree build_builtin_unreachable (location_t);
6377 :
6378 : /* Set explicit builtin function nodes and whether it is an implicit
6379 : function. */
6380 :
6381 : inline void
6382 369692269 : set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
6383 : {
6384 369692269 : size_t ufncode = (size_t)fncode;
6385 :
6386 369692269 : gcc_checking_assert (BUILTIN_VALID_P (fncode)
6387 : && (decl != NULL_TREE || !implicit_p));
6388 :
6389 369692269 : builtin_info[ufncode].decl = decl;
6390 369692269 : builtin_info[ufncode].implicit_p = implicit_p;
6391 369692269 : builtin_info[ufncode].declared_p = false;
6392 369692269 : }
6393 :
6394 : /* Set the implicit flag for a builtin function. */
6395 :
6396 : inline void
6397 1319053 : set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
6398 : {
6399 1319053 : size_t uns_fncode = (size_t)fncode;
6400 :
6401 1319053 : gcc_checking_assert (BUILTIN_VALID_P (fncode)
6402 : && builtin_info[uns_fncode].decl != NULL_TREE);
6403 :
6404 1319053 : builtin_info[uns_fncode].implicit_p = implicit_p;
6405 1319053 : }
6406 :
6407 : /* Set the declared flag for a builtin function. */
6408 :
6409 : inline void
6410 8087396 : set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
6411 : {
6412 8087396 : size_t uns_fncode = (size_t)fncode;
6413 :
6414 8087396 : gcc_checking_assert (BUILTIN_VALID_P (fncode)
6415 : && builtin_info[uns_fncode].decl != NULL_TREE);
6416 :
6417 8087396 : builtin_info[uns_fncode].declared_p = declared_p;
6418 8087396 : }
6419 :
6420 : /* Return whether the standard builtin function can be used as an explicit
6421 : function. */
6422 :
6423 : inline bool
6424 22279789 : builtin_decl_explicit_p (enum built_in_function fncode)
6425 : {
6426 22279789 : gcc_checking_assert (BUILTIN_VALID_P (fncode));
6427 19635494 : return (builtin_info[(size_t)fncode].decl != NULL_TREE);
6428 : }
6429 :
6430 : /* Return whether the standard builtin function can be used implicitly. */
6431 :
6432 : inline bool
6433 159065 : builtin_decl_implicit_p (enum built_in_function fncode)
6434 : {
6435 159065 : size_t uns_fncode = (size_t)fncode;
6436 :
6437 159065 : gcc_checking_assert (BUILTIN_VALID_P (fncode));
6438 159065 : return (builtin_info[uns_fncode].decl != NULL_TREE
6439 159059 : && builtin_info[uns_fncode].implicit_p);
6440 : }
6441 :
6442 : /* Return whether the standard builtin function was declared. */
6443 :
6444 : inline bool
6445 3945371 : builtin_decl_declared_p (enum built_in_function fncode)
6446 : {
6447 3945371 : size_t uns_fncode = (size_t)fncode;
6448 :
6449 3945371 : gcc_checking_assert (BUILTIN_VALID_P (fncode));
6450 3945371 : return (builtin_info[uns_fncode].decl != NULL_TREE
6451 3945371 : && builtin_info[uns_fncode].declared_p);
6452 : }
6453 :
6454 : /* Determine if the function identified by FNDECL is one that
6455 : makes sense to match by name, for those places where we detect
6456 : "magic" functions by name.
6457 :
6458 : Return true if FNDECL has a name and is an extern fndecl at file scope.
6459 : FNDECL must be a non-NULL decl.
6460 :
6461 : Avoid using this, as it's generally better to use attributes rather
6462 : than to check for functions by name. */
6463 :
6464 : inline bool
6465 4529223888 : maybe_special_function_p (const_tree fndecl)
6466 : {
6467 4529223888 : tree name_decl = DECL_NAME (fndecl);
6468 4529223888 : if (name_decl
6469 : /* Exclude functions not at the file scope, or not `extern',
6470 : since they are not the magic functions we would otherwise
6471 : think they are. */
6472 4529223888 : && (DECL_CONTEXT (fndecl) == NULL_TREE
6473 2902391382 : || TREE_CODE (DECL_CONTEXT (fndecl)) == TRANSLATION_UNIT_DECL)
6474 7816091539 : && TREE_PUBLIC (fndecl))
6475 3127113614 : return true;
6476 : return false;
6477 : }
6478 :
6479 : /* Return true if T (assumed to be a DECL) is a global variable.
6480 : A variable is considered global if its storage is not automatic. */
6481 :
6482 : inline bool
6483 2647372197 : is_global_var (const_tree t)
6484 : {
6485 2647372197 : return (TREE_STATIC (t) || DECL_EXTERNAL (t));
6486 : }
6487 :
6488 : /* Return true if VAR may be aliased. A variable is considered as
6489 : maybe aliased if it has its address taken by the local TU
6490 : or possibly by another TU and might be modified through a pointer. */
6491 :
6492 : inline bool
6493 719530641 : may_be_aliased (const_tree var)
6494 : {
6495 719530641 : return (TREE_CODE (var) != CONST_DECL
6496 718976330 : && (TREE_PUBLIC (var)
6497 693531385 : || DECL_EXTERNAL (var)
6498 693531274 : || TREE_ADDRESSABLE (var))
6499 968347791 : && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
6500 35169323 : && (TREE_READONLY (var)
6501 30038839 : || (TREE_CODE (var) == VAR_DECL
6502 29199866 : && DECL_NONALIASED (var)))));
6503 : }
6504 :
6505 : /* Return pointer to optimization flags of FNDECL. */
6506 : inline struct cl_optimization *
6507 3228516095 : opts_for_fn (const_tree fndecl)
6508 : {
6509 3228516095 : tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
6510 3228516095 : if (fn_opts == NULL_TREE)
6511 2942019659 : fn_opts = optimization_default_node;
6512 3228516095 : return TREE_OPTIMIZATION (fn_opts);
6513 : }
6514 :
6515 : /* Return pointer to target flags of FNDECL. */
6516 : inline cl_target_option *
6517 4109456 : target_opts_for_fn (const_tree fndecl)
6518 : {
6519 4109456 : tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
6520 4109456 : if (fn_opts == NULL_TREE)
6521 2361640 : fn_opts = target_option_default_node;
6522 6471096 : return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
6523 : }
6524 :
6525 : /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
6526 : the optimization level of function fndecl. */
6527 : #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
6528 :
6529 : /* For anonymous aggregate types, we need some sort of name to
6530 : hold on to. In practice, this should not appear, but it should
6531 : not be harmful if it does. Identifiers returned will be
6532 : IDENTIFIER_ANON_P. */
6533 : extern tree make_anon_name ();
6534 :
6535 : /* The tree and const_tree overload templates. */
6536 : namespace wi
6537 : {
6538 : class unextended_tree
6539 : {
6540 : private:
6541 : const_tree m_t;
6542 :
6543 : public:
6544 : unextended_tree () {}
6545 1292501774 : unextended_tree (const_tree t) : m_t (t) {}
6546 :
6547 : unsigned int get_precision () const;
6548 : const HOST_WIDE_INT *get_val () const;
6549 : unsigned int get_len () const;
6550 : const_tree get_tree () const { return m_t; }
6551 : };
6552 :
6553 : template <>
6554 : struct int_traits <unextended_tree>
6555 : {
6556 : static const enum precision_type precision_type = VAR_PRECISION;
6557 : static const bool host_dependent_precision = false;
6558 : static const bool is_sign_extended = false;
6559 : static const bool needs_write_val_arg = false;
6560 : };
6561 :
6562 : template <int N>
6563 : class extended_tree
6564 : {
6565 : private:
6566 : const_tree m_t;
6567 :
6568 : public:
6569 : extended_tree () {}
6570 : extended_tree (const_tree);
6571 :
6572 : unsigned int get_precision () const;
6573 : const HOST_WIDE_INT *get_val () const;
6574 : unsigned int get_len () const;
6575 : const_tree get_tree () const { return m_t; }
6576 : };
6577 :
6578 : template <int N>
6579 : struct int_traits <extended_tree <N> >
6580 : {
6581 : static const enum precision_type precision_type
6582 : = N == ADDR_MAX_PRECISION ? INL_CONST_PRECISION : CONST_PRECISION;
6583 : static const bool host_dependent_precision = false;
6584 : static const bool is_sign_extended = true;
6585 : static const bool needs_write_val_arg = false;
6586 : static const unsigned int precision = N;
6587 : };
6588 :
6589 : typedef extended_tree <WIDEST_INT_MAX_PRECISION> widest_extended_tree;
6590 : typedef extended_tree <ADDR_MAX_PRECISION> offset_extended_tree;
6591 :
6592 : typedef const generic_wide_int <widest_extended_tree> tree_to_widest_ref;
6593 : typedef const generic_wide_int <offset_extended_tree> tree_to_offset_ref;
6594 : typedef const generic_wide_int<wide_int_ref_storage<false, false> >
6595 : tree_to_wide_ref;
6596 :
6597 : tree_to_widest_ref to_widest (const_tree);
6598 : tree_to_offset_ref to_offset (const_tree);
6599 : tree_to_wide_ref to_wide (const_tree);
6600 : wide_int to_wide (const_tree, unsigned int);
6601 :
6602 : typedef const poly_int <NUM_POLY_INT_COEFFS,
6603 : generic_wide_int <widest_extended_tree> >
6604 : tree_to_poly_widest_ref;
6605 : typedef const poly_int <NUM_POLY_INT_COEFFS,
6606 : generic_wide_int <offset_extended_tree> >
6607 : tree_to_poly_offset_ref;
6608 : typedef const poly_int <NUM_POLY_INT_COEFFS,
6609 : generic_wide_int <unextended_tree> >
6610 : tree_to_poly_wide_ref;
6611 :
6612 : tree_to_poly_widest_ref to_poly_widest (const_tree);
6613 : tree_to_poly_offset_ref to_poly_offset (const_tree);
6614 : tree_to_poly_wide_ref to_poly_wide (const_tree);
6615 :
6616 : template <int N>
6617 : struct ints_for <generic_wide_int <extended_tree <N> >, INL_CONST_PRECISION>
6618 : {
6619 : typedef generic_wide_int <extended_tree <N> > extended;
6620 : static extended zero (const extended &);
6621 : };
6622 :
6623 : template <int N>
6624 : struct ints_for <generic_wide_int <extended_tree <N> >, CONST_PRECISION>
6625 : {
6626 : typedef generic_wide_int <extended_tree <N> > extended;
6627 : static extended zero (const extended &);
6628 : };
6629 :
6630 : template <>
6631 : struct ints_for <generic_wide_int <unextended_tree>, VAR_PRECISION>
6632 : {
6633 : typedef generic_wide_int <unextended_tree> unextended;
6634 : static unextended zero (const unextended &);
6635 : };
6636 : }
6637 :
6638 : /* Used to convert a tree to a widest2_int like this:
6639 : widest2_int foo = widest2_int_cst (some_tree). */
6640 : typedef generic_wide_int <wi::extended_tree <WIDEST_INT_MAX_PRECISION * 2> >
6641 : widest2_int_cst;
6642 :
6643 : /* Refer to INTEGER_CST T as though it were a widest_int.
6644 :
6645 : This function gives T's actual numerical value, influenced by the
6646 : signedness of its type. For example, a signed byte with just the
6647 : top bit set would be -128 while an unsigned byte with the same
6648 : bit pattern would be 128.
6649 :
6650 : This is the right choice when operating on groups of INTEGER_CSTs
6651 : that might have different signedness or precision. It is also the
6652 : right choice in code that specifically needs an approximation of
6653 : infinite-precision arithmetic instead of normal modulo arithmetic.
6654 :
6655 : The approximation of infinite precision is good enough for realistic
6656 : numbers of additions and subtractions of INTEGER_CSTs (where
6657 : "realistic" includes any number less than 1 << 31) but it cannot
6658 : represent the result of multiplying the two largest supported
6659 : INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
6660 : of multiplying two arbitrary INTEGER_CSTs and checking that the
6661 : result is representable as a widest_int.
6662 :
6663 : Note that any overflow checking done on these values is relative to
6664 : the range of widest_int rather than the range of a TREE_TYPE.
6665 :
6666 : Calling this function should have no overhead in release builds,
6667 : so it is OK to call it several times for the same tree. If it is
6668 : useful for readability reasons to reduce the number of calls,
6669 : it is more efficient to use:
6670 :
6671 : wi::tree_to_widest_ref wt = wi::to_widest (t);
6672 :
6673 : instead of:
6674 :
6675 : widest_int wt = wi::to_widest (t). */
6676 :
6677 : inline wi::tree_to_widest_ref
6678 4110640741 : wi::to_widest (const_tree t)
6679 : {
6680 13385621132 : return t;
6681 : }
6682 :
6683 : /* Refer to INTEGER_CST T as though it were an offset_int.
6684 :
6685 : This function is an optimisation of wi::to_widest for cases
6686 : in which T is known to be a bit or byte count in the range
6687 : (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
6688 : the target's address size in bits.
6689 :
6690 : This is the right choice when operating on bit or byte counts as
6691 : untyped numbers rather than M-bit values. The wi::to_widest comments
6692 : about addition, subtraction and multiplication apply here: sequences
6693 : of 1 << 31 additions and subtractions do not induce overflow, but
6694 : multiplying the largest sizes might. Again,
6695 :
6696 : wi::tree_to_offset_ref wt = wi::to_offset (t);
6697 :
6698 : is more efficient than:
6699 :
6700 : offset_int wt = wi::to_offset (t). */
6701 :
6702 : inline wi::tree_to_offset_ref
6703 3680024368 : wi::to_offset (const_tree t)
6704 : {
6705 3444237895 : return t;
6706 : }
6707 :
6708 : /* Refer to INTEGER_CST T as though it were a wide_int.
6709 :
6710 : In contrast to the approximation of infinite-precision numbers given
6711 : by wi::to_widest and wi::to_offset, this function treats T as a
6712 : signless collection of N bits, where N is the precision of T's type.
6713 : As with machine registers, signedness is determined by the operation
6714 : rather than the operands; for example, there is a distinction between
6715 : signed and unsigned division.
6716 :
6717 : This is the right choice when operating on values with the same type
6718 : using normal modulo arithmetic. The overflow-checking forms of things
6719 : like wi::add check whether the result can be represented in T's type.
6720 :
6721 : Calling this function should have no overhead in release builds,
6722 : so it is OK to call it several times for the same tree. If it is
6723 : useful for readability reasons to reduce the number of calls,
6724 : it is more efficient to use:
6725 :
6726 : wi::tree_to_wide_ref wt = wi::to_wide (t);
6727 :
6728 : instead of:
6729 :
6730 : wide_int wt = wi::to_wide (t). */
6731 :
6732 : inline wi::tree_to_wide_ref
6733 16498597082 : wi::to_wide (const_tree t)
6734 : {
6735 32997194164 : return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t),
6736 16498597082 : TYPE_PRECISION (TREE_TYPE (t)));
6737 : }
6738 :
6739 : /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6740 : truncating as necessary. When extending, use sign extension if T's
6741 : type is signed and zero extension if T's type is unsigned. */
6742 :
6743 : inline wide_int
6744 1559677425 : wi::to_wide (const_tree t, unsigned int prec)
6745 : {
6746 1559677425 : return wide_int::from (wi::to_wide (t), prec, TYPE_SIGN (TREE_TYPE (t)));
6747 : }
6748 :
6749 : template <int N>
6750 27560242504 : inline wi::extended_tree <N>::extended_tree (const_tree t)
6751 27560242504 : : m_t (t)
6752 : {
6753 27560242504 : gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
6754 27560242504 : }
6755 :
6756 : template <int N>
6757 : inline unsigned int
6758 : wi::extended_tree <N>::get_precision () const
6759 : {
6760 : return N;
6761 : }
6762 :
6763 : template <int N>
6764 : inline const HOST_WIDE_INT *
6765 27705628632 : wi::extended_tree <N>::get_val () const
6766 : {
6767 27705628632 : return &TREE_INT_CST_ELT (m_t, 0);
6768 : }
6769 :
6770 : template <int N>
6771 : inline unsigned int
6772 27690952454 : wi::extended_tree <N>::get_len () const
6773 : {
6774 : if (N == ADDR_MAX_PRECISION)
6775 : {
6776 : /* to_offset can only be applied to trees that are offset_int-sized
6777 : or smaller. EXT_LEN is correct if it fits, otherwise the constant
6778 : must be exactly the precision of offset_int and so LEN is correct. */
6779 11153099556 : unsigned int ext_len = TREE_INT_CST_EXT_NUNITS (m_t);
6780 11153099556 : if (ext_len <= OFFSET_INT_ELTS)
6781 : return ext_len;
6782 689 : return TREE_INT_CST_NUNITS (m_t);
6783 : }
6784 : else if (N >= WIDEST_INT_MAX_PRECISION)
6785 16537852898 : return TREE_INT_CST_EXT_NUNITS (m_t);
6786 : else
6787 : /* This class is designed to be used for specific output precisions
6788 : and needs to be as fast as possible, so there is no fallback for
6789 : other casees. */
6790 : gcc_unreachable ();
6791 : }
6792 :
6793 : inline unsigned int
6794 2653798797 : wi::unextended_tree::get_precision () const
6795 : {
6796 2653798797 : return TYPE_PRECISION (TREE_TYPE (m_t));
6797 : }
6798 :
6799 : inline const HOST_WIDE_INT *
6800 1330868412 : wi::unextended_tree::get_val () const
6801 : {
6802 1330868412 : return &TREE_INT_CST_ELT (m_t, 0);
6803 : }
6804 :
6805 : inline unsigned int
6806 1323469799 : wi::unextended_tree::get_len () const
6807 : {
6808 1323469799 : return TREE_INT_CST_NUNITS (m_t);
6809 : }
6810 :
6811 : /* Return the value of a POLY_INT_CST in its native precision. */
6812 :
6813 : inline wi::tree_to_poly_wide_ref
6814 0 : poly_int_cst_value (const_tree x)
6815 : {
6816 0 : poly_int <NUM_POLY_INT_COEFFS, generic_wide_int <wi::unextended_tree> > res;
6817 0 : for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6818 0 : res.coeffs[i] = POLY_INT_CST_COEFF (x, i);
6819 0 : return res;
6820 : }
6821 :
6822 : /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6823 : poly_widest_int. See wi::to_widest for more details. */
6824 :
6825 : inline wi::tree_to_poly_widest_ref
6826 102651959 : wi::to_poly_widest (const_tree t)
6827 : {
6828 80994635 : if (POLY_INT_CST_P (t))
6829 : {
6830 : poly_int <NUM_POLY_INT_COEFFS,
6831 : generic_wide_int <widest_extended_tree> > res;
6832 : for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6833 : res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6834 : return res;
6835 : }
6836 80994537 : return t;
6837 : }
6838 :
6839 : /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6840 : poly_offset_int. See wi::to_offset for more details. */
6841 :
6842 : inline wi::tree_to_poly_offset_ref
6843 7405614668 : wi::to_poly_offset (const_tree t)
6844 : {
6845 2078100355 : if (POLY_INT_CST_P (t))
6846 : {
6847 : poly_int <NUM_POLY_INT_COEFFS,
6848 : generic_wide_int <offset_extended_tree> > res;
6849 : for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6850 : res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6851 : return res;
6852 : }
6853 6471524334 : return t;
6854 : }
6855 :
6856 : /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6857 : poly_wide_int. See wi::to_wide for more details. */
6858 :
6859 : inline wi::tree_to_poly_wide_ref
6860 1292501774 : wi::to_poly_wide (const_tree t)
6861 : {
6862 1292501774 : if (POLY_INT_CST_P (t))
6863 : return poly_int_cst_value (t);
6864 1292501774 : return t;
6865 : }
6866 :
6867 : template <int N>
6868 : inline generic_wide_int <wi::extended_tree <N> >
6869 : wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6870 : wi::INL_CONST_PRECISION>::zero (const extended &x)
6871 : {
6872 : return build_zero_cst (TREE_TYPE (x.get_tree ()));
6873 : }
6874 :
6875 : template <int N>
6876 : inline generic_wide_int <wi::extended_tree <N> >
6877 : wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6878 : wi::CONST_PRECISION>::zero (const extended &x)
6879 : {
6880 : return build_zero_cst (TREE_TYPE (x.get_tree ()));
6881 : }
6882 :
6883 : inline generic_wide_int <wi::unextended_tree>
6884 : wi::ints_for <generic_wide_int <wi::unextended_tree>,
6885 : wi::VAR_PRECISION>::zero (const unextended &x)
6886 : {
6887 : return build_zero_cst (TREE_TYPE (x.get_tree ()));
6888 : }
6889 :
6890 : namespace wi
6891 : {
6892 : template <typename T>
6893 : bool fits_to_boolean_p (const T &x, const_tree);
6894 :
6895 : template <typename T>
6896 : bool fits_to_tree_p (const T &x, const_tree);
6897 :
6898 : wide_int min_value (const_tree);
6899 : wide_int max_value (const_tree);
6900 : #ifndef GENERATOR_FILE
6901 : wide_int from_mpz (const_tree, mpz_t, bool);
6902 : #endif
6903 : }
6904 :
6905 : template <typename T>
6906 : bool
6907 5272413 : wi::fits_to_boolean_p (const T &x, const_tree type)
6908 : {
6909 : typedef typename poly_int_traits<T>::int_type int_type;
6910 5272413 : return (known_eq (x, int_type (0))
6911 5309427 : || known_eq (x, int_type (TYPE_UNSIGNED (type) ? 1 : -1)));
6912 : }
6913 :
6914 : template <typename T>
6915 : bool
6916 3017219534 : wi::fits_to_tree_p (const T &x, const_tree type)
6917 : {
6918 : /* Non-standard boolean types can have arbitrary precision but various
6919 : transformations assume that they can only take values 0 and +/-1. */
6920 3017219534 : if (TREE_CODE (type) == BOOLEAN_TYPE)
6921 3999395 : return fits_to_boolean_p (x, type);
6922 :
6923 3013220139 : if (TYPE_UNSIGNED (type))
6924 2702700732 : return known_eq (x, zext (x, TYPE_PRECISION (type)));
6925 : else
6926 310519407 : return known_eq (x, sext (x, TYPE_PRECISION (type)));
6927 : }
6928 :
6929 : /* Produce the smallest number that is represented in TYPE. The precision
6930 : and sign are taken from TYPE. */
6931 : inline wide_int
6932 85857939 : wi::min_value (const_tree type)
6933 : {
6934 85857939 : return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6935 : }
6936 :
6937 : /* Produce the largest number that is represented in TYPE. The precision
6938 : and sign are taken from TYPE. */
6939 : inline wide_int
6940 86924127 : wi::max_value (const_tree type)
6941 : {
6942 86924127 : return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6943 : }
6944 :
6945 : /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6946 : extending both according to their respective TYPE_SIGNs. */
6947 :
6948 : inline bool
6949 1487135872 : tree_int_cst_lt (const_tree t1, const_tree t2)
6950 : {
6951 1487135872 : return wi::to_widest (t1) < wi::to_widest (t2);
6952 : }
6953 :
6954 : /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6955 : extending both according to their respective TYPE_SIGNs. */
6956 :
6957 : inline bool
6958 7530977 : tree_int_cst_le (const_tree t1, const_tree t2)
6959 : {
6960 7530977 : return wi::to_widest (t1) <= wi::to_widest (t2);
6961 : }
6962 :
6963 : /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6964 : are both INTEGER_CSTs and their values are extended according to their
6965 : respective TYPE_SIGNs. */
6966 :
6967 : inline int
6968 202810144 : tree_int_cst_compare (const_tree t1, const_tree t2)
6969 : {
6970 202810144 : return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
6971 : }
6972 :
6973 : /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6974 : but none of these files are allowed to be included from front ends.
6975 : They should be split in two. One suitable for the FEs, the other suitable
6976 : for the BE. */
6977 :
6978 : /* Assign the RTX to declaration. */
6979 : extern void set_decl_rtl (tree, rtx);
6980 : extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
6981 :
6982 : /* Given an expression EXP that is a handled_component_p,
6983 : look for the ultimate containing object, which is returned and specify
6984 : the access position and size. */
6985 : extern tree get_inner_reference (tree, poly_int64 *, poly_int64 *,
6986 : tree *, machine_mode *, int *, int *, int *);
6987 :
6988 : extern tree build_personality_function (const char *);
6989 :
6990 : struct GTY(()) int_n_trees_t {
6991 : /* These parts are initialized at runtime */
6992 : tree signed_type;
6993 : tree unsigned_type;
6994 : };
6995 :
6996 : /* This is also in machmode.h */
6997 : extern bool int_n_enabled_p[NUM_INT_N_ENTS];
6998 : extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
6999 :
7000 : /* Like bit_position, but return as an integer. It must be representable in
7001 : that way (since it could be a signed value, we don't have the
7002 : option of returning -1 like int_size_in_byte can. */
7003 :
7004 : inline HOST_WIDE_INT
7005 116816381 : int_bit_position (const_tree field)
7006 : {
7007 233632762 : return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT)
7008 116816381 : + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
7009 : }
7010 :
7011 : /* Return true if it makes sense to consider alias set for a type T. */
7012 :
7013 : inline bool
7014 203714373 : type_with_alias_set_p (const_tree t)
7015 : {
7016 : /* Function and method types are never accessed as memory locations. */
7017 203714373 : if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
7018 : return false;
7019 :
7020 203418025 : if (COMPLETE_TYPE_P (t))
7021 : return true;
7022 :
7023 : /* Incomplete types cannot be accessed in general except for arrays
7024 : where we can fetch its element despite we have no array bounds. */
7025 11912850 : if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
7026 94841 : return true;
7027 :
7028 : return false;
7029 : }
7030 :
7031 : extern location_t set_block (location_t loc, tree block);
7032 :
7033 : extern void gt_ggc_mx (tree &);
7034 : extern void gt_pch_nx (tree &);
7035 : extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
7036 : extern void gt_ggc_mx (tree_raw_data *);
7037 : extern void gt_pch_nx (tree_raw_data *);
7038 : extern void gt_pch_nx (tree_raw_data *, gt_pointer_operator, void *);
7039 :
7040 : extern bool nonnull_arg_p (const_tree);
7041 : extern bool is_empty_type (const_tree);
7042 : extern bool default_is_empty_record (const_tree);
7043 : extern bool flexible_array_member_type_p (const_tree);
7044 : extern bool flexible_array_type_p (const_tree);
7045 : extern HOST_WIDE_INT arg_int_size_in_bytes (const_tree);
7046 : extern tree arg_size_in_bytes (const_tree);
7047 : extern bool expr_type_first_operand_type_p (tree_code);
7048 :
7049 : extern location_t
7050 : set_source_range (tree expr, location_t start, location_t finish);
7051 :
7052 : extern location_t
7053 : set_source_range (tree expr, source_range src_range);
7054 :
7055 : /* Return true if it makes sense to promote/demote from_type to to_type. */
7056 : inline bool
7057 537091 : desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
7058 : {
7059 537091 : unsigned int to_type_precision = TYPE_PRECISION (to_type);
7060 :
7061 : /* OK to promote if to_type is no bigger than word_mode. */
7062 537091 : if (to_type_precision <= GET_MODE_PRECISION (word_mode))
7063 : return true;
7064 :
7065 : /* Otherwise, allow only if narrowing or same precision conversions. */
7066 35505 : return to_type_precision <= TYPE_PRECISION (from_type);
7067 : }
7068 :
7069 : /* Pointer type used to declare builtins before we have seen its real
7070 : declaration. */
7071 : class builtin_structptr_type
7072 : {
7073 : public:
7074 : tree& node;
7075 : tree& base;
7076 : const char *str;
7077 : };
7078 : extern const builtin_structptr_type builtin_structptr_types[6];
7079 :
7080 : /* Return true if type T has the same precision as its underlying mode. */
7081 :
7082 : inline bool
7083 345718081 : type_has_mode_precision_p (const_tree t)
7084 : {
7085 345718081 : return known_eq (TYPE_PRECISION (t), GET_MODE_PRECISION (TYPE_MODE (t)));
7086 : }
7087 :
7088 : /* Helper functions for fndecl_built_in_p. */
7089 :
7090 : inline bool
7091 : built_in_function_equal_p (built_in_function name0, built_in_function name1)
7092 : {
7093 : return name0 == name1;
7094 : }
7095 :
7096 : /* Recursive case for two or more names. */
7097 :
7098 : template <typename... F>
7099 : inline bool
7100 42913770 : built_in_function_equal_p (built_in_function name0, built_in_function name1,
7101 : built_in_function name2, F... names)
7102 : {
7103 38083471 : return name0 == name1 || built_in_function_equal_p (name0, name2, names...);
7104 : }
7105 :
7106 : /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
7107 :
7108 : Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
7109 : accessor, as this is impervious to user declaration. */
7110 :
7111 : inline bool
7112 4841014179 : fndecl_built_in_p (const_tree node)
7113 : {
7114 4841014179 : return DECL_BUILT_IN_CLASS (node) != NOT_BUILT_IN;
7115 : }
7116 :
7117 : /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
7118 : of class KLASS. */
7119 :
7120 : inline bool
7121 3455946755 : fndecl_built_in_p (const_tree node, built_in_class klass)
7122 : {
7123 4509434658 : return fndecl_built_in_p (node) && DECL_BUILT_IN_CLASS (node) == klass;
7124 : }
7125 :
7126 : /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
7127 : of class KLASS with name equal to NAME. */
7128 :
7129 : inline bool
7130 34943289 : fndecl_built_in_p (const_tree node, unsigned int name, built_in_class klass)
7131 : {
7132 34943289 : return (fndecl_built_in_p (node, klass)
7133 34971511 : && DECL_UNCHECKED_FUNCTION_CODE (node) == name);
7134 : }
7135 :
7136 : /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
7137 : of BUILT_IN_NORMAL class with name equal to NAME1 (or other mentioned
7138 : NAMES). */
7139 :
7140 : template <typename... F>
7141 : inline bool
7142 1198786105 : fndecl_built_in_p (const_tree node, built_in_function name1, F... names)
7143 : {
7144 1198786105 : return (fndecl_built_in_p (node, BUILT_IN_NORMAL)
7145 1198786105 : && built_in_function_equal_p (DECL_FUNCTION_CODE (node),
7146 1198786105 : name1, names...));
7147 : }
7148 :
7149 : /* Returns true if the function decl NODE is an alloca. */
7150 : inline bool
7151 510 : fndecl_builtin_alloc_p (const_tree node)
7152 : {
7153 510 : if (!fndecl_built_in_p (node, BUILT_IN_NORMAL))
7154 : return false;
7155 510 : return ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (node));
7156 : }
7157 :
7158 : /* A struct for encapsulating location information about an operator
7159 : and the operation built from it.
7160 :
7161 : m_operator_loc is the location of the operator
7162 : m_combined_loc is the location of the compound expression.
7163 :
7164 : For example, given "a && b" the, operator location is:
7165 : a && b
7166 : ^~
7167 : and the combined location is:
7168 : a && b
7169 : ~~^~~~
7170 : Capturing this information allows for class binary_op_rich_location
7171 : to provide detailed information about e.g. type mismatches in binary
7172 : operations where enough location information is available:
7173 :
7174 : arg_0 op arg_1
7175 : ~~~~~ ^~ ~~~~~
7176 : | |
7177 : | arg1 type
7178 : arg0 type
7179 :
7180 : falling back to just showing the combined location:
7181 :
7182 : arg_0 op arg_1
7183 : ~~~~~~^~~~~~~~
7184 :
7185 : where it is not. */
7186 :
7187 : class op_location_t
7188 : {
7189 : public:
7190 : location_t m_operator_loc;
7191 : location_t m_combined_loc;
7192 :
7193 : /* 1-argument ctor, for constructing from a combined location. */
7194 184924882 : op_location_t (location_t combined_loc)
7195 184837376 : : m_operator_loc (UNKNOWN_LOCATION), m_combined_loc (combined_loc)
7196 : {}
7197 :
7198 : /* 2-argument ctor, for distinguishing between the operator's location
7199 : and the combined location. */
7200 152789608 : op_location_t (location_t operator_loc, location_t combined_loc)
7201 152789608 : : m_operator_loc (operator_loc), m_combined_loc (combined_loc)
7202 : {}
7203 :
7204 : /* Implicitly convert back to a location_t, using the combined location. */
7205 511167049 : operator location_t () const { return m_combined_loc; }
7206 : };
7207 :
7208 : /* Code that doesn't refer to any warning. Has no effect on suppression
7209 : functions. */
7210 : constexpr opt_code no_warning = opt_code ();
7211 : /* Wildcard code that refers to all warnings. */
7212 : constexpr opt_code all_warnings = N_OPTS;
7213 :
7214 : /* Return the disposition for a warning (or all warnings by default)
7215 : at a location. */
7216 : extern bool warning_suppressed_at (location_t, opt_code = all_warnings);
7217 : /* Set the disposition for a warning (or all warnings by default)
7218 : at a location to disabled by default. */
7219 : extern bool suppress_warning_at (location_t, opt_code = all_warnings,
7220 : bool = true);
7221 : /* Overwrite warning disposition bitmap for a location with given spec. */
7222 : extern void put_warning_spec_at (location_t loc, unsigned);
7223 : /* Copy warning disposition from one location to another. */
7224 : extern void copy_warning (location_t, location_t);
7225 :
7226 : /* Return the disposition for a warning (or all warnings by default)
7227 : for an expression. */
7228 : extern bool warning_suppressed_p (const_tree, opt_code = all_warnings);
7229 : /* Set the disposition for a warning (or all warnings by default)
7230 : at a location to disabled by default. */
7231 : extern void suppress_warning (tree, opt_code = all_warnings, bool = true)
7232 : ATTRIBUTE_NONNULL (1);
7233 : /* Copy warning disposition from one expression to another. */
7234 : extern void copy_warning (tree, const_tree);
7235 :
7236 : /* Whether the tree might have a warning spec. */
7237 : extern bool has_warning_spec (const_tree);
7238 : /* Retrieve warning spec bitmap for tree streaming. */
7239 : extern unsigned get_warning_spec (const_tree);
7240 : /* Overwrite warning spec bitmap for a tree with given spec. */
7241 : extern void put_warning_spec (tree, unsigned);
7242 :
7243 : /* Return the zero-based number corresponding to the argument being
7244 : deallocated if FNDECL is a deallocation function or an out-of-bounds
7245 : value if it isn't. */
7246 : extern unsigned fndecl_dealloc_argno (tree);
7247 :
7248 : /* If an expression refers to a character array or pointer declared
7249 : attribute nonstring, return a decl for that array or pointer and
7250 : if nonnull, set the second argument to the referenced enclosing
7251 : object or pointer. Otherwise return null. */
7252 : extern tree get_attr_nonstring_decl (tree, tree * = NULL);
7253 :
7254 : /* Returns the version string for a decl with target_version attribute.
7255 : Returns an invalid string_slice if no attribute is present. */
7256 : extern string_slice get_target_version (const tree);
7257 : /* Returns a vector of the version strings from a target_clones attribute on
7258 : a decl. Can also record the number of default versions found.
7259 : Use bool to control whether or not the results should
7260 : be filtered with TARGET_CHECK_TARGET_CLONE_VERSION. */
7261 : extern auto_vec<string_slice> get_clone_versions
7262 : (const tree,int * = NULL, bool = true);
7263 : /* Returns a vector of the version strings from a target_clones attribute
7264 : directly. Additionally takes a bool to control whether or not the results
7265 : should be filtered with TARGET_CHECK_TARGET_CLONE_VERSION. */
7266 : extern auto_vec<string_slice> get_clone_attr_versions
7267 : (const tree, int *, bool = true);
7268 :
7269 : /* Checks if two decls define any overlapping versions. */
7270 : extern bool disjoint_version_decls (tree, tree);
7271 : /* Checks if two overlapping decls are not mergeable. */
7272 : extern bool diagnose_versioned_decls (tree, tree);
7273 :
7274 : /* Unshare tree if needed. */
7275 : extern tree unshare_expr (tree);
7276 :
7277 : /* Unshare tree if needed.
7278 : Removing the locations if an expr. */
7279 : extern tree unshare_expr_without_location (tree);
7280 :
7281 : extern void copy_if_shared (tree *, void * = NULL);
7282 :
7283 : /* Make a vector to hold an unexpanded omp iterator vector. */
7284 : inline tree
7285 902 : make_omp_iterator (void)
7286 : {
7287 902 : return make_tree_vec (6);
7288 : }
7289 :
7290 : /* Make a vector to hold an expanded omp iterator vector. */
7291 : inline tree
7292 263 : make_expanded_omp_iterator (void)
7293 : {
7294 263 : return make_tree_vec (10);
7295 : }
7296 :
7297 : #endif /* GCC_TREE_H */
|
