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