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