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