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