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