| /* Definitions for the ubiquitous 'tree' type for GNU compilers. |
| Copyright (C) 1989-2021 Free Software Foundation, Inc. |
| |
| This file is part of GCC. |
| |
| GCC is free software; you can redistribute it and/or modify it under |
| the terms of the GNU General Public License as published by the Free |
| Software Foundation; either version 3, or (at your option) any later |
| version. |
| |
| GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
| WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with GCC; see the file COPYING3. If not see |
| <http://www.gnu.org/licenses/>. */ |
| |
| #ifndef GCC_TREE_H |
| #define GCC_TREE_H |
| |
| #include "tree-core.h" |
| #include "options.h" |
| |
| /* Convert a target-independent built-in function code to a combined_fn. */ |
| |
| inline combined_fn |
| as_combined_fn (built_in_function fn) |
| { |
| return combined_fn (int (fn)); |
| } |
| |
| /* Convert an internal function code to a combined_fn. */ |
| |
| inline combined_fn |
| as_combined_fn (internal_fn fn) |
| { |
| return combined_fn (int (fn) + int (END_BUILTINS)); |
| } |
| |
| /* Return true if CODE is a target-independent built-in function. */ |
| |
| inline bool |
| builtin_fn_p (combined_fn code) |
| { |
| return int (code) < int (END_BUILTINS); |
| } |
| |
| /* Return the target-independent built-in function represented by CODE. |
| Only valid if builtin_fn_p (CODE). */ |
| |
| inline built_in_function |
| as_builtin_fn (combined_fn code) |
| { |
| gcc_checking_assert (builtin_fn_p (code)); |
| return built_in_function (int (code)); |
| } |
| |
| /* Return true if CODE is an internal function. */ |
| |
| inline bool |
| internal_fn_p (combined_fn code) |
| { |
| return int (code) >= int (END_BUILTINS); |
| } |
| |
| /* Return the internal function represented by CODE. Only valid if |
| internal_fn_p (CODE). */ |
| |
| inline internal_fn |
| as_internal_fn (combined_fn code) |
| { |
| gcc_checking_assert (internal_fn_p (code)); |
| return internal_fn (int (code) - int (END_BUILTINS)); |
| } |
| |
| /* Macros for initializing `tree_contains_struct'. */ |
| #define MARK_TS_BASE(C) \ |
| (tree_contains_struct[C][TS_BASE] = true) |
| |
| #define MARK_TS_TYPED(C) \ |
| (MARK_TS_BASE (C), \ |
| tree_contains_struct[C][TS_TYPED] = true) |
| |
| #define MARK_TS_COMMON(C) \ |
| (MARK_TS_TYPED (C), \ |
| tree_contains_struct[C][TS_COMMON] = true) |
| |
| #define MARK_TS_TYPE_COMMON(C) \ |
| (MARK_TS_COMMON (C), \ |
| tree_contains_struct[C][TS_TYPE_COMMON] = true) |
| |
| #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ |
| (MARK_TS_TYPE_COMMON (C), \ |
| tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true) |
| |
| #define MARK_TS_TYPE_NON_COMMON(C) \ |
| (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \ |
| tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \ |
| |
| #define MARK_TS_DECL_MINIMAL(C) \ |
| (MARK_TS_COMMON (C), \ |
| tree_contains_struct[C][TS_DECL_MINIMAL] = true) |
| |
| #define MARK_TS_DECL_COMMON(C) \ |
| (MARK_TS_DECL_MINIMAL (C), \ |
| tree_contains_struct[C][TS_DECL_COMMON] = true) |
| |
| #define MARK_TS_DECL_WRTL(C) \ |
| (MARK_TS_DECL_COMMON (C), \ |
| tree_contains_struct[C][TS_DECL_WRTL] = true) |
| |
| #define MARK_TS_DECL_WITH_VIS(C) \ |
| (MARK_TS_DECL_WRTL (C), \ |
| tree_contains_struct[C][TS_DECL_WITH_VIS] = true) |
| |
| #define MARK_TS_DECL_NON_COMMON(C) \ |
| (MARK_TS_DECL_WITH_VIS (C), \ |
| tree_contains_struct[C][TS_DECL_NON_COMMON] = true) |
| |
| #define MARK_TS_EXP(C) \ |
| (MARK_TS_TYPED (C), \ |
| tree_contains_struct[C][TS_EXP] = true) |
| |
| /* Returns the string representing CLASS. */ |
| |
| #define TREE_CODE_CLASS_STRING(CLASS)\ |
| tree_code_class_strings[(int) (CLASS)] |
| |
| #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] |
| |
| /* Nonzero if NODE represents an exceptional code. */ |
| |
| #define EXCEPTIONAL_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional) |
| |
| /* Nonzero if NODE represents a constant. */ |
| |
| #define CONSTANT_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant) |
| |
| /* Nonzero if NODE represents a constant, or is a location wrapper |
| around such a node. */ |
| |
| #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\ |
| (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE))) |
| |
| /* Nonzero if NODE represents a type. */ |
| |
| #define TYPE_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type) |
| |
| /* Nonzero if NODE represents a declaration. */ |
| |
| #define DECL_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration) |
| |
| /* True if NODE designates a variable declaration. */ |
| #define VAR_P(NODE) \ |
| (TREE_CODE (NODE) == VAR_DECL) |
| |
| /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ |
| |
| #define VAR_OR_FUNCTION_DECL_P(DECL)\ |
| (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) |
| |
| /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in |
| ascending code order. */ |
| |
| #define INDIRECT_REF_P(NODE)\ |
| (TREE_CODE (NODE) == INDIRECT_REF) |
| |
| /* Nonzero if NODE represents a reference. */ |
| |
| #define REFERENCE_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference) |
| |
| /* Nonzero if NODE represents a comparison. */ |
| |
| #define COMPARISON_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison) |
| |
| /* Nonzero if NODE represents a unary arithmetic expression. */ |
| |
| #define UNARY_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary) |
| |
| /* Nonzero if NODE represents a binary arithmetic expression. */ |
| |
| #define BINARY_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary) |
| |
| /* Nonzero if NODE represents a statement expression. */ |
| |
| #define STATEMENT_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement) |
| |
| /* Nonzero if NODE represents a function call-like expression with a |
| variable-length operand vector. */ |
| |
| #define VL_EXP_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp) |
| |
| /* Nonzero if NODE represents any other expression. */ |
| |
| #define EXPRESSION_CLASS_P(NODE)\ |
| (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression) |
| |
| /* Returns nonzero iff NODE represents a type or declaration. */ |
| |
| #define IS_TYPE_OR_DECL_P(NODE)\ |
| (TYPE_P (NODE) || DECL_P (NODE)) |
| |
| /* Returns nonzero iff CLASS is the tree-code class of an |
| expression. */ |
| |
| #define IS_EXPR_CODE_CLASS(CLASS)\ |
| ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) |
| |
| /* Returns nonzero iff NODE is an expression of some kind. */ |
| |
| #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) |
| |
| #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] |
| |
| |
| /* Helper macros for math builtins. */ |
| |
| #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L |
| #define CASE_FLT_FN_FLOATN_NX(FN) \ |
| case FN##F16: case FN##F32: case FN##F64: case FN##F128: \ |
| case FN##F32X: case FN##F64X: case FN##F128X |
| #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R |
| #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX |
| |
| #define NULL_TREE (tree) NULL |
| |
| /* Define accessors for the fields that all tree nodes have |
| (though some fields are not used for all kinds of nodes). */ |
| |
| /* The tree-code says what kind of node it is. |
| Codes are defined in tree.def. */ |
| #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) |
| #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) |
| |
| /* When checking is enabled, errors will be generated if a tree node |
| is accessed incorrectly. The macros die with a fatal error. */ |
| #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
| |
| #define TREE_CHECK(T, CODE) \ |
| (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) |
| |
| #define TREE_NOT_CHECK(T, CODE) \ |
| (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) |
| |
| #define TREE_CHECK2(T, CODE1, CODE2) \ |
| (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) |
| |
| #define TREE_NOT_CHECK2(T, CODE1, CODE2) \ |
| (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) |
| |
| #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ |
| (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) |
| |
| #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ |
| (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ |
| (CODE1), (CODE2), (CODE3))) |
| |
| #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ |
| (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ |
| (CODE1), (CODE2), (CODE3), (CODE4))) |
| |
| #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ |
| (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ |
| (CODE1), (CODE2), (CODE3), (CODE4))) |
| |
| #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ |
| (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ |
| (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) |
| |
| #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ |
| (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ |
| (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) |
| |
| #define CONTAINS_STRUCT_CHECK(T, STRUCT) \ |
| (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define TREE_CLASS_CHECK(T, CLASS) \ |
| (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define TREE_RANGE_CHECK(T, CODE1, CODE2) \ |
| (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ |
| (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ |
| (omp_clause_range_check ((T), (CODE1), (CODE2), \ |
| __FILE__, __LINE__, __FUNCTION__)) |
| |
| /* These checks have to be special cased. */ |
| #define EXPR_CHECK(T) \ |
| (expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) |
| |
| /* These checks have to be special cased. */ |
| #define NON_TYPE_CHECK(T) \ |
| (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) |
| |
| /* These checks have to be special cased. */ |
| #define ANY_INTEGRAL_TYPE_CHECK(T) \ |
| (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define TREE_INT_CST_ELT_CHECK(T, I) \ |
| (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)) |
| |
| #define TREE_VEC_ELT_CHECK(T, I) \ |
| (*(CONST_CAST2 (tree *, typeof (T)*, \ |
| tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) |
| |
| #define OMP_CLAUSE_ELT_CHECK(T, I) \ |
| (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) |
| |
| /* Special checks for TREE_OPERANDs. */ |
| #define TREE_OPERAND_CHECK(T, I) \ |
| (*(CONST_CAST2 (tree*, typeof (T)*, \ |
| tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) |
| |
| #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ |
| (*(tree_operand_check_code ((T), (CODE), (I), \ |
| __FILE__, __LINE__, __FUNCTION__))) |
| |
| /* Nodes are chained together for many purposes. |
| Types are chained together to record them for being output to the debugger |
| (see the function `chain_type'). |
| Decls in the same scope are chained together to record the contents |
| of the scope. |
| Statement nodes for successive statements used to be chained together. |
| Often lists of things are represented by TREE_LIST nodes that |
| are chained together. */ |
| |
| #define TREE_CHAIN(NODE) \ |
| (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) |
| |
| /* In all nodes that are expressions, this is the data type of the expression. |
| In POINTER_TYPE nodes, this is the type that the pointer points to. |
| In ARRAY_TYPE nodes, this is the type of the elements. |
| In VECTOR_TYPE nodes, this is the type of the elements. */ |
| #define TREE_TYPE(NODE) \ |
| (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) |
| |
| extern void tree_contains_struct_check_failed (const_tree, |
| const enum tree_node_structure_enum, |
| const char *, int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| |
| extern void tree_check_failed (const_tree, const char *, int, const char *, |
| ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_not_check_failed (const_tree, const char *, int, const char *, |
| ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_class_check_failed (const_tree, const enum tree_code_class, |
| const char *, int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_range_check_failed (const_tree, const char *, int, |
| const char *, enum tree_code, |
| enum tree_code) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_not_class_check_failed (const_tree, |
| const enum tree_code_class, |
| const char *, int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_int_cst_elt_check_failed (int, int, const char *, |
| int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_vec_elt_check_failed (int, int, const char *, |
| int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void phi_node_elt_check_failed (int, int, const char *, |
| int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void tree_operand_check_failed (int, const_tree, |
| const char *, int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void omp_clause_check_failed (const_tree, const char *, int, |
| const char *, enum omp_clause_code) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void omp_clause_operand_check_failed (int, const_tree, const char *, |
| int, const char *) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| extern void omp_clause_range_check_failed (const_tree, const char *, int, |
| const char *, enum omp_clause_code, |
| enum omp_clause_code) |
| ATTRIBUTE_NORETURN ATTRIBUTE_COLD; |
| |
| #else /* not ENABLE_TREE_CHECKING, or not gcc */ |
| |
| #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) |
| #define TREE_CHECK(T, CODE) (T) |
| #define TREE_NOT_CHECK(T, CODE) (T) |
| #define TREE_CHECK2(T, CODE1, CODE2) (T) |
| #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) |
| #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) |
| #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) |
| #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
| #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) |
| #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
| #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) |
| #define TREE_CLASS_CHECK(T, CODE) (T) |
| #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) |
| #define EXPR_CHECK(T) (T) |
| #define NON_TYPE_CHECK(T) (T) |
| #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I]) |
| #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) |
| #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) |
| #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) |
| #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) |
| #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) |
| #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) |
| #define ANY_INTEGRAL_TYPE_CHECK(T) (T) |
| |
| #define TREE_CHAIN(NODE) ((NODE)->common.chain) |
| #define TREE_TYPE(NODE) ((NODE)->typed.type) |
| |
| #endif |
| |
| #define TREE_BLOCK(NODE) (tree_block (NODE)) |
| #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) |
| |
| #include "tree-check.h" |
| |
| #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) |
| #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) |
| #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) |
| #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) |
| #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) |
| #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) |
| #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) |
| #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) |
| #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) |
| #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) |
| #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) |
| |
| #define RECORD_OR_UNION_CHECK(T) \ |
| TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
| #define NOT_RECORD_OR_UNION_CHECK(T) \ |
| TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) |
| #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \ |
| TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE) |
| |
| #define NUMERICAL_TYPE_CHECK(T) \ |
| TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ |
| FIXED_POINT_TYPE) |
| |
| /* Here is how primitive or already-canonicalized types' hash codes |
| are made. */ |
| #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) |
| |
| /* A simple hash function for an arbitrary tree node. This must not be |
| used in hash tables which are saved to a PCH. */ |
| #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) |
| |
| /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ |
| #define CONVERT_EXPR_CODE_P(CODE) \ |
| ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) |
| |
| /* Similarly, but accept an expression instead of a tree code. */ |
| #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) |
| |
| /* Generate case for NOP_EXPR, CONVERT_EXPR. */ |
| |
| #define CASE_CONVERT \ |
| case NOP_EXPR: \ |
| case CONVERT_EXPR |
| |
| /* Given an expression as a tree, strip any conversion that generates |
| no instruction. Accepts both tree and const_tree arguments since |
| we are not modifying the tree itself. */ |
| |
| #define STRIP_NOPS(EXP) \ |
| (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) |
| |
| /* Like STRIP_NOPS, but don't let the signedness change either. */ |
| |
| #define STRIP_SIGN_NOPS(EXP) \ |
| (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) |
| |
| /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ |
| |
| #define STRIP_TYPE_NOPS(EXP) \ |
| while ((CONVERT_EXPR_P (EXP) \ |
| || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ |
| && TREE_OPERAND (EXP, 0) != error_mark_node \ |
| && (TREE_TYPE (EXP) \ |
| == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ |
| (EXP) = TREE_OPERAND (EXP, 0) |
| |
| /* Remove unnecessary type conversions according to |
| tree_ssa_useless_type_conversion. */ |
| |
| #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ |
| (EXP) = tree_ssa_strip_useless_type_conversions (EXP) |
| |
| /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely |
| in use to provide a location_t. */ |
| |
| #define STRIP_ANY_LOCATION_WRAPPER(EXP) \ |
| (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP)) |
| |
| /* Nonzero if TYPE represents a vector type. */ |
| |
| #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE) |
| |
| /* Nonzero if TYPE represents a vector of booleans. */ |
| |
| #define VECTOR_BOOLEAN_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == VECTOR_TYPE \ |
| && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE) |
| |
| /* Nonzero if TYPE represents an integral type. Note that we do not |
| include COMPLEX types here. Keep these checks in ascending code |
| order. */ |
| |
| #define INTEGRAL_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == ENUMERAL_TYPE \ |
| || TREE_CODE (TYPE) == BOOLEAN_TYPE \ |
| || TREE_CODE (TYPE) == INTEGER_TYPE) |
| |
| /* Nonzero if TYPE represents an integral type, including complex |
| and vector integer types. */ |
| |
| #define ANY_INTEGRAL_TYPE_P(TYPE) \ |
| (INTEGRAL_TYPE_P (TYPE) \ |
| || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ |
| || VECTOR_TYPE_P (TYPE)) \ |
| && INTEGRAL_TYPE_P (TREE_TYPE (TYPE)))) |
| |
| /* Nonzero if TYPE represents a non-saturating fixed-point type. */ |
| |
| #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) |
| |
| /* Nonzero if TYPE represents a saturating fixed-point type. */ |
| |
| #define SAT_FIXED_POINT_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) |
| |
| /* Nonzero if TYPE represents a fixed-point type. */ |
| |
| #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) |
| |
| /* Nonzero if TYPE represents a scalar floating-point type. */ |
| |
| #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) |
| |
| /* Nonzero if TYPE represents a complex floating-point type. */ |
| |
| #define COMPLEX_FLOAT_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == COMPLEX_TYPE \ |
| && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) |
| |
| /* Nonzero if TYPE represents a vector integer type. */ |
| |
| #define VECTOR_INTEGER_TYPE_P(TYPE) \ |
| (VECTOR_TYPE_P (TYPE) \ |
| && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) |
| |
| |
| /* Nonzero if TYPE represents a vector floating-point type. */ |
| |
| #define VECTOR_FLOAT_TYPE_P(TYPE) \ |
| (VECTOR_TYPE_P (TYPE) \ |
| && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) |
| |
| /* Nonzero if TYPE represents a floating-point type, including complex |
| and vector floating-point types. The vector and complex check does |
| not use the previous two macros to enable early folding. */ |
| |
| #define FLOAT_TYPE_P(TYPE) \ |
| (SCALAR_FLOAT_TYPE_P (TYPE) \ |
| || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ |
| || VECTOR_TYPE_P (TYPE)) \ |
| && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) |
| |
| /* Nonzero if TYPE represents a decimal floating-point type. */ |
| #define DECIMAL_FLOAT_TYPE_P(TYPE) \ |
| (SCALAR_FLOAT_TYPE_P (TYPE) \ |
| && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) |
| |
| /* Nonzero if TYPE is a record or union type. */ |
| #define RECORD_OR_UNION_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == RECORD_TYPE \ |
| || TREE_CODE (TYPE) == UNION_TYPE \ |
| || TREE_CODE (TYPE) == QUAL_UNION_TYPE) |
| |
| /* Nonzero if TYPE represents an aggregate (multi-component) type. |
| Keep these checks in ascending code order. */ |
| |
| #define AGGREGATE_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) |
| |
| /* Nonzero if TYPE represents a pointer or reference type. |
| (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in |
| ascending code order. */ |
| |
| #define POINTER_TYPE_P(TYPE) \ |
| (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) |
| |
| /* Nonzero if TYPE represents a pointer to function. */ |
| #define FUNCTION_POINTER_TYPE_P(TYPE) \ |
| (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) |
| |
| /* Nonzero if this type is a complete type. */ |
| #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) |
| |
| /* Nonzero if this type is the (possibly qualified) void type. */ |
| #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) |
| |
| /* Nonzero if this type is complete or is cv void. */ |
| #define COMPLETE_OR_VOID_TYPE_P(NODE) \ |
| (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) |
| |
| /* Nonzero if this type is complete or is an array with unspecified bound. */ |
| #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ |
| (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) |
| |
| #define FUNC_OR_METHOD_TYPE_P(NODE) \ |
| (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE) |
| |
| #define OPAQUE_TYPE_P(NODE) \ |
| (TREE_CODE (NODE) == OPAQUE_TYPE) |
| |
| /* Define many boolean fields that all tree nodes have. */ |
| |
| /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address |
| of this is needed. So it cannot be in a register. |
| In a FUNCTION_DECL it has no meaning. |
| In LABEL_DECL nodes, it means a goto for this label has been seen |
| from a place outside all binding contours that restore stack levels. |
| In an artificial SSA_NAME that points to a stack partition with at least |
| two variables, it means that at least one variable has TREE_ADDRESSABLE. |
| In ..._TYPE nodes, it means that objects of this type must be fully |
| addressable. This means that pieces of this object cannot go into |
| register parameters, for example. If this a function type, this |
| means that the value must be returned in memory. |
| In CONSTRUCTOR nodes, it means object constructed must be in memory. |
| In IDENTIFIER_NODEs, this means that some extern decl for this name |
| had its address taken. That matters for inline functions. |
| In a STMT_EXPR, it means we want the result of the enclosed expression. */ |
| #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) |
| |
| /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the |
| exit of a function. Calls for which this is true are candidates for tail |
| call optimizations. */ |
| #define CALL_EXPR_TAILCALL(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.addressable_flag) |
| |
| /* Set on a CALL_EXPR if the call has been marked as requiring tail call |
| optimization for correctness. */ |
| #define CALL_EXPR_MUST_TAIL_CALL(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.static_flag) |
| |
| /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the |
| CASE_LOW operand has been processed. */ |
| #define CASE_LOW_SEEN(NODE) \ |
| (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) |
| |
| #define PREDICT_EXPR_OUTCOME(NODE) \ |
| ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag)) |
| #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ |
| (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME) |
| #define PREDICT_EXPR_PREDICTOR(NODE) \ |
| ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0))) |
| |
| /* In a VAR_DECL, nonzero means allocate static storage. |
| In a FUNCTION_DECL, nonzero if function has been defined. |
| In a CONSTRUCTOR, nonzero means allocate static storage. */ |
| #define TREE_STATIC(NODE) ((NODE)->base.static_flag) |
| |
| /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ |
| #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) |
| |
| /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup |
| should only be executed if an exception is thrown, not on normal exit |
| of its scope. */ |
| #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) |
| |
| /* In a TRY_CATCH_EXPR, means that the handler should be considered a |
| separate cleanup in honor_protect_cleanup_actions. */ |
| #define TRY_CATCH_IS_CLEANUP(NODE) \ |
| (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) |
| |
| /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the |
| CASE_HIGH operand has been processed. */ |
| #define CASE_HIGH_SEEN(NODE) \ |
| (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) |
| |
| /* Used to mark scoped enums. */ |
| #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) |
| |
| /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ |
| #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) |
| |
| /* In an expr node (usually a conversion) this means the node was made |
| implicitly and should not lead to any sort of warning. In a decl node, |
| warnings concerning the decl should be suppressed. This is used at |
| least for used-before-set warnings, and it set after one warning is |
| emitted. */ |
| #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) |
| |
| /* Nonzero if we should warn about the change in empty class parameter |
| passing ABI in this TU. */ |
| #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \ |
| (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0) |
| |
| /* Nonzero if this type is "empty" according to the particular psABI. */ |
| #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag) |
| |
| /* Used to indicate that this TYPE represents a compiler-generated entity. */ |
| #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) |
| |
| /* True if the type is indivisible at the source level, i.e. if its |
| component parts cannot be accessed directly. This is used to suppress |
| normal GNU extensions for target-specific vector types. */ |
| #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p) |
| |
| /* In an IDENTIFIER_NODE, this means that assemble_name was called with |
| this string as an argument. */ |
| #define TREE_SYMBOL_REFERENCED(NODE) \ |
| (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) |
| |
| /* Nonzero in a pointer or reference type means the data pointed to |
| by this type can alias anything. */ |
| #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ |
| (PTR_OR_REF_CHECK (NODE)->base.static_flag) |
| |
| /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means |
| there was an overflow in folding. */ |
| |
| #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) |
| |
| /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ |
| |
| #define TREE_OVERFLOW_P(EXPR) \ |
| (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) |
| |
| /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, |
| nonzero means name is to be accessible from outside this translation unit. |
| In an IDENTIFIER_NODE, nonzero means an external declaration |
| accessible from outside this translation unit was previously seen |
| for this name in an inner scope. */ |
| #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) |
| |
| /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector |
| of cached values, or is something else. */ |
| #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag) |
| |
| /* In a SAVE_EXPR, indicates that the original expression has already |
| been substituted with a VAR_DECL that contains the value. */ |
| #define SAVE_EXPR_RESOLVED_P(NODE) \ |
| (SAVE_EXPR_CHECK (NODE)->base.public_flag) |
| |
| /* Set on a CALL_EXPR if this stdarg call should be passed the argument |
| pack. */ |
| #define CALL_EXPR_VA_ARG_PACK(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.public_flag) |
| |
| /* In any expression, decl, or constant, nonzero means it has side effects or |
| reevaluation of the whole expression could produce a different value. |
| This is set if any subexpression is a function call, a side effect or a |
| reference to a volatile variable. In a ..._DECL, this is set only if the |
| declaration said `volatile'. This will never be set for a constant. */ |
| #define TREE_SIDE_EFFECTS(NODE) \ |
| (NON_TYPE_CHECK (NODE)->base.side_effects_flag) |
| |
| /* In a LABEL_DECL, nonzero means this label had its address taken |
| and therefore can never be deleted and is a jump target for |
| computed gotos. */ |
| #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) |
| |
| /* Whether a case or a user-defined label is allowed to fall through to. |
| This is used to implement -Wimplicit-fallthrough. */ |
| #define FALLTHROUGH_LABEL_P(NODE) \ |
| (LABEL_DECL_CHECK (NODE)->base.private_flag) |
| |
| /* Set on the artificial label created for break; stmt from a switch. |
| This is used to implement -Wimplicit-fallthrough. */ |
| #define SWITCH_BREAK_LABEL_P(NODE) \ |
| (LABEL_DECL_CHECK (NODE)->base.protected_flag) |
| |
| /* Nonzero means this expression is volatile in the C sense: |
| its address should be of type `volatile WHATEVER *'. |
| In other words, the declared item is volatile qualified. |
| This is used in _DECL nodes and _REF nodes. |
| On a FUNCTION_DECL node, this means the function does not |
| return normally. This is the same effect as setting |
| the attribute noreturn on the function in C. |
| |
| In a ..._TYPE node, means this type is volatile-qualified. |
| But use TYPE_VOLATILE instead of this macro when the node is a type, |
| because eventually we may make that a different bit. |
| |
| If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ |
| #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) |
| |
| /* Nonzero means this node will not trap. In an INDIRECT_REF, means |
| accessing the memory pointed to won't generate a trap. However, |
| this only applies to an object when used appropriately: it doesn't |
| mean that writing a READONLY mem won't trap. |
| |
| In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index |
| (or slice of the array) always belongs to the range of the array. |
| I.e. that the access will not trap, provided that the access to |
| the base to the array will not trap. */ |
| #define TREE_THIS_NOTRAP(NODE) \ |
| (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ |
| ARRAY_RANGE_REF)->base.nothrow_flag) |
| |
| /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, |
| nonzero means it may not be the lhs of an assignment. |
| Nonzero in a FUNCTION_DECL means this function should be treated |
| as "const" function (can only read its arguments). */ |
| #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) |
| |
| /* Value of expression is constant. Always on in all ..._CST nodes. May |
| also appear in an expression or decl where the value is constant. */ |
| #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) |
| |
| /* Nonzero if NODE, a type, has had its sizes gimplified. */ |
| #define TYPE_SIZES_GIMPLIFIED(NODE) \ |
| (TYPE_CHECK (NODE)->base.constant_flag) |
| |
| /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ |
| #define DECL_UNSIGNED(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) |
| |
| /* In integral and pointer types, means an unsigned type. */ |
| #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) |
| |
| /* Same as TYPE_UNSIGNED but converted to SIGNOP. */ |
| #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE)) |
| |
| /* True if overflow wraps around for the given integral or pointer type. That |
| is, TYPE_MAX + 1 == TYPE_MIN. */ |
| #define TYPE_OVERFLOW_WRAPS(TYPE) \ |
| (POINTER_TYPE_P (TYPE) \ |
| ? flag_wrapv_pointer \ |
| : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ |
| || flag_wrapv)) |
| |
| /* True if overflow is undefined for the given integral or pointer type. |
| We may optimize on the assumption that values in the type never overflow. |
| |
| IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED |
| must issue a warning based on warn_strict_overflow. In some cases |
| it will be appropriate to issue the warning immediately, and in |
| other cases it will be appropriate to simply set a flag and let the |
| caller decide whether a warning is appropriate or not. */ |
| #define TYPE_OVERFLOW_UNDEFINED(TYPE) \ |
| (POINTER_TYPE_P (TYPE) \ |
| ? !flag_wrapv_pointer \ |
| : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ |
| && !flag_wrapv && !flag_trapv)) |
| |
| /* True if overflow for the given integral type should issue a |
| trap. */ |
| #define TYPE_OVERFLOW_TRAPS(TYPE) \ |
| (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv) |
| |
| /* True if an overflow is to be preserved for sanitization. */ |
| #define TYPE_OVERFLOW_SANITIZED(TYPE) \ |
| (INTEGRAL_TYPE_P (TYPE) \ |
| && !TYPE_OVERFLOW_WRAPS (TYPE) \ |
| && (flag_sanitize & SANITIZE_SI_OVERFLOW)) |
| |
| /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. |
| Nonzero in a FUNCTION_DECL means that the function has been compiled. |
| This is interesting in an inline function, since it might not need |
| to be compiled separately. |
| Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE |
| or TYPE_DECL if the debugging info for the type has been written. |
| In a BLOCK node, nonzero if reorder_blocks has already seen this block. |
| In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal |
| PHI node. */ |
| #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) |
| |
| /* Nonzero in a _DECL if the name is used in its scope. |
| Nonzero in an expr node means inhibit warning if value is unused. |
| In IDENTIFIER_NODEs, this means that some extern decl for this name |
| was used. |
| In a BLOCK, this means that the block contains variables that are used. */ |
| #define TREE_USED(NODE) ((NODE)->base.used_flag) |
| |
| /* In a FUNCTION_DECL, nonzero means a call to the function cannot |
| throw an exception. In a CALL_EXPR, nonzero means the call cannot |
| throw. We can't easily check the node type here as the C++ |
| frontend also uses this flag (for AGGR_INIT_EXPR). */ |
| #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) |
| |
| /* In a CALL_EXPR, means that it's safe to use the target of the call |
| expansion as the return slot for a call that returns in memory. */ |
| #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.private_flag) |
| |
| /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is |
| passed by invisible reference (and the TREE_TYPE is a pointer to the true |
| type). */ |
| #define DECL_BY_REFERENCE(NODE) \ |
| (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ |
| RESULT_DECL)->decl_common.decl_by_reference_flag) |
| |
| /* In VAR_DECL and PARM_DECL, set when the decl has been used except for |
| being set. */ |
| #define DECL_READ_P(NODE) \ |
| (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) |
| |
| /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes |
| attempting to share the stack slot with some other variable. */ |
| #define DECL_NONSHAREABLE(NODE) \ |
| (TREE_CHECK2 (NODE, VAR_DECL, \ |
| RESULT_DECL)->decl_common.decl_nonshareable_flag) |
| |
| /* In a PARM_DECL, set for Fortran hidden string length arguments that some |
| buggy callers don't pass to the callee. */ |
| #define DECL_HIDDEN_STRING_LENGTH(NODE) \ |
| (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag) |
| |
| /* In a CALL_EXPR, means that the call is the jump from a thunk to the |
| thunked-to function. Be careful to avoid using this macro when one of the |
| next two applies instead. */ |
| #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) |
| |
| /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that |
| it has been built for the declaration of a variable-sized object and, if the |
| function being called is BUILT_IN_MEMCPY, means that it has been built for |
| the assignment of a variable-sized object. */ |
| #define CALL_ALLOCA_FOR_VAR_P(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.protected_flag) |
| |
| /* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or |
| DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete |
| expressions. Not set for C++20 destroying delete operators. */ |
| #define CALL_FROM_NEW_OR_DELETE_P(NODE) \ |
| (CALL_EXPR_CHECK (NODE)->base.protected_flag) |
| |
| /* Used in classes in C++. */ |
| #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) |
| /* Used in classes in C++. */ |
| #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) |
| |
| /* True if reference type NODE is a C++ rvalue reference. */ |
| #define TYPE_REF_IS_RVALUE(NODE) \ |
| (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) |
| |
| /* Nonzero in a _DECL if the use of the name is defined as a |
| deprecated feature by __attribute__((deprecated)). */ |
| #define TREE_DEPRECATED(NODE) \ |
| ((NODE)->base.deprecated_flag) |
| |
| /* Nonzero in a _DECL if the use of the name is defined as an |
| unavailable feature by __attribute__((unavailable)). */ |
| #define TREE_UNAVAILABLE(NODE) \ |
| ((NODE)->base.u.bits.unavailable_flag) |
| |
| /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous |
| aggregate, (as created by anon_aggr_name_format). */ |
| #define IDENTIFIER_ANON_P(NODE) \ |
| (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag) |
| |
| /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose |
| uses are to be substituted for uses of the TREE_CHAINed identifier. */ |
| #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ |
| (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) |
| |
| /* In an aggregate type, indicates that the scalar fields of the type are |
| stored in reverse order from the target order. This effectively |
| toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */ |
| #define TYPE_REVERSE_STORAGE_ORDER(NODE) \ |
| (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) |
| |
| /* In a non-aggregate type, indicates a saturating type. */ |
| #define TYPE_SATURATING(NODE) \ |
| (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag) |
| |
| /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group |
| of bits stored in reverse order from the target order. This effectively |
| toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference. |
| |
| The overall strategy is to preserve the invariant that every scalar in |
| memory is associated with a single storage order, i.e. all accesses to |
| this scalar are done with the same storage order. This invariant makes |
| it possible to factor out the storage order in most transformations, as |
| only the address and/or the value (in target order) matter for them. |
| But, of course, the storage order must be preserved when the accesses |
| themselves are rewritten or transformed. */ |
| #define REF_REVERSE_STORAGE_ORDER(NODE) \ |
| (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag) |
| |
| /* In an ADDR_EXPR, indicates that this is a pointer to nested function |
| represented by a descriptor instead of a trampoline. */ |
| #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \ |
| (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag) |
| |
| /* In a CALL_EXPR, indicates that this is an indirect call for which |
| pointers to nested function are descriptors instead of trampolines. */ |
| #define CALL_EXPR_BY_DESCRIPTOR(NODE) \ |
| (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag) |
| |
| /* These flags are available for each language front end to use internally. */ |
| #define TREE_LANG_FLAG_0(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) |
| #define TREE_LANG_FLAG_1(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) |
| #define TREE_LANG_FLAG_2(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) |
| #define TREE_LANG_FLAG_3(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) |
| #define TREE_LANG_FLAG_4(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) |
| #define TREE_LANG_FLAG_5(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) |
| #define TREE_LANG_FLAG_6(NODE) \ |
| (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) |
| |
| /* Define additional fields and accessors for nodes representing constants. */ |
| |
| #define TREE_INT_CST_NUNITS(NODE) \ |
| (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended) |
| #define TREE_INT_CST_EXT_NUNITS(NODE) \ |
| (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended) |
| #define TREE_INT_CST_OFFSET_NUNITS(NODE) \ |
| (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset) |
| #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I) |
| #define TREE_INT_CST_LOW(NODE) \ |
| ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0)) |
| |
| /* Return true if NODE is a POLY_INT_CST. This is only ever true on |
| targets with variable-sized modes. */ |
| #define POLY_INT_CST_P(NODE) \ |
| (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST) |
| |
| /* In a POLY_INT_CST node. */ |
| #define POLY_INT_CST_COEFF(NODE, I) \ |
| (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I]) |
| |
| #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) |
| #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) |
| |
| #define TREE_FIXED_CST_PTR(NODE) \ |
| (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) |
| #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) |
| |
| /* In a STRING_CST */ |
| /* In C terms, this is sizeof, not strlen. */ |
| #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) |
| #define TREE_STRING_POINTER(NODE) \ |
| ((const char *)(STRING_CST_CHECK (NODE)->string.str)) |
| |
| /* In a COMPLEX_CST node. */ |
| #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) |
| #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) |
| |
| /* In a VECTOR_CST node. See generic.texi for details. */ |
| #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE))) |
| #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX) |
| |
| #define VECTOR_CST_LOG2_NPATTERNS(NODE) \ |
| (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns) |
| #define VECTOR_CST_NPATTERNS(NODE) \ |
| (1U << VECTOR_CST_LOG2_NPATTERNS (NODE)) |
| #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \ |
| (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern) |
| #define VECTOR_CST_DUPLICATE_P(NODE) \ |
| (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1) |
| #define VECTOR_CST_STEPPED_P(NODE) \ |
| (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3) |
| #define VECTOR_CST_ENCODED_ELTS(NODE) \ |
| (VECTOR_CST_CHECK (NODE)->vector.elts) |
| #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \ |
| (VECTOR_CST_CHECK (NODE)->vector.elts[ELT]) |
| |
| /* Define fields and accessors for some special-purpose tree nodes. */ |
| |
| #define IDENTIFIER_LENGTH(NODE) \ |
| (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) |
| #define IDENTIFIER_POINTER(NODE) \ |
| ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) |
| #define IDENTIFIER_HASH_VALUE(NODE) \ |
| (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) |
| |
| /* Translate a hash table identifier pointer to a tree_identifier |
| pointer, and vice versa. */ |
| |
| #define HT_IDENT_TO_GCC_IDENT(NODE) \ |
| ((tree) ((char *) (NODE) - sizeof (struct tree_common))) |
| #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) |
| |
| /* In a TREE_LIST node. */ |
| #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) |
| #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) |
| |
| /* In a TREE_VEC node. */ |
| #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) |
| #define TREE_VEC_END(NODE) \ |
| ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) |
| |
| #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) |
| |
| /* In a CONSTRUCTOR node. */ |
| #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) |
| #define CONSTRUCTOR_ELT(NODE,IDX) \ |
| (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) |
| #define CONSTRUCTOR_NELTS(NODE) \ |
| (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) |
| #define CONSTRUCTOR_NO_CLEARING(NODE) \ |
| (CONSTRUCTOR_CHECK (NODE)->base.public_flag) |
| |
| /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the |
| value of each element (stored within VAL). IX must be a scratch variable |
| of unsigned integer type. */ |
| #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ |
| for (IX = 0; (IX >= vec_safe_length (V)) \ |
| ? false \ |
| : ((VAL = (*(V))[IX].value), \ |
| true); \ |
| (IX)++) |
| |
| /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both |
| the value of each element (stored within VAL) and its index (stored |
| within INDEX). IX must be a scratch variable of unsigned integer type. */ |
| #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ |
| for (IX = 0; (IX >= vec_safe_length (V)) \ |
| ? false \ |
| : (((void) (VAL = (*V)[IX].value)), \ |
| (INDEX = (*V)[IX].index), \ |
| true); \ |
| (IX)++) |
| |
| /* Append a new constructor element to V, with the specified INDEX and VAL. */ |
| #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ |
| do { \ |
| constructor_elt _ce___ = {INDEX, VALUE}; \ |
| vec_safe_push ((V), _ce___); \ |
| } while (0) |
| |
| /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for |
| constructor output purposes. */ |
| #define CONSTRUCTOR_BITFIELD_P(NODE) \ |
| (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) |
| |
| /* True if NODE is a clobber right hand side, an expression of indeterminate |
| value that clobbers the LHS in a copy instruction. We use a volatile |
| empty CONSTRUCTOR for this, as it matches most of the necessary semantic. |
| In particular the volatile flag causes us to not prematurely remove |
| such clobber instructions. */ |
| #define TREE_CLOBBER_P(NODE) \ |
| (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) |
| |
| /* Define fields and accessors for some nodes that represent expressions. */ |
| |
| /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ |
| #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ |
| && VOID_TYPE_P (TREE_TYPE (NODE)) \ |
| && integer_zerop (TREE_OPERAND (NODE, 0))) |
| |
| /* In ordinary expression nodes. */ |
| #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) |
| #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) |
| |
| /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand |
| length. Its value includes the length operand itself; that is, |
| the minimum valid length is 1. |
| Note that we have to bypass the use of TREE_OPERAND to access |
| that field to avoid infinite recursion in expanding the macros. */ |
| #define VL_EXP_OPERAND_LENGTH(NODE) \ |
| ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) |
| |
| /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */ |
| #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p |
| /* Nonzero if gimple_debug_bind_p() (and thus |
| gimple_debug_source_bind_p()) may possibly hold. */ |
| #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments |
| /* Nonzero if is_gimple_debug() may possibly hold. */ |
| #define MAY_HAVE_DEBUG_STMTS \ |
| (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS) |
| |
| /* In a LOOP_EXPR node. */ |
| #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) |
| |
| /* The source location of this expression. Non-tree_exp nodes such as |
| decls and constants can be shared among multiple locations, so |
| return nothing. */ |
| #define EXPR_LOCATION(NODE) \ |
| (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) |
| #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) |
| #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ |
| != UNKNOWN_LOCATION) |
| /* The location to be used in a diagnostic about this expression. Do not |
| use this macro if the location will be assigned to other expressions. */ |
| #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ |
| ? (NODE)->exp.locus : (LOCUS)) |
| #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) |
| #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) |
| |
| #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE)) |
| #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE)))) |
| |
| #define EXPR_HAS_RANGE(NODE) \ |
| (CAN_HAVE_RANGE_P (NODE) \ |
| ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \ |
| : false) |
| |
| /* True if a tree is an expression or statement that can have a |
| location. */ |
| #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) |
| |
| static inline source_range |
| get_expr_source_range (tree expr) |
| { |
| location_t loc = EXPR_LOCATION (expr); |
| return get_range_from_loc (line_table, loc); |
| } |
| |
| extern void protected_set_expr_location (tree, location_t); |
| extern void protected_set_expr_location_if_unset (tree, location_t); |
| |
| WARN_UNUSED_RESULT extern tree maybe_wrap_with_location (tree, location_t); |
| |
| extern int suppress_location_wrappers; |
| |
| /* A class for suppressing the creation of location wrappers. |
| Location wrappers will not be created during the lifetime |
| of an instance of this class. */ |
| |
| class auto_suppress_location_wrappers |
| { |
| public: |
| auto_suppress_location_wrappers () { ++suppress_location_wrappers; } |
| ~auto_suppress_location_wrappers () { --suppress_location_wrappers; } |
| }; |
| |
| /* In a TARGET_EXPR node. */ |
| #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) |
| #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) |
| #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) |
| /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR |
| on rhs of MODIFY_EXPR. */ |
| #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag) |
| |
| /* DECL_EXPR accessor. This gives access to the DECL associated with |
| the given declaration statement. */ |
| #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) |
| |
| #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) |
| |
| /* COMPOUND_LITERAL_EXPR accessors. */ |
| #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ |
| TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) |
| #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ |
| DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) |
| |
| /* SWITCH_EXPR accessors. These give access to the condition and body. */ |
| #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) |
| #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) |
| /* True if there are case labels for all possible values of SWITCH_COND, either |
| because there is a default: case label or because the case label ranges cover |
| all values. */ |
| #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag) |
| |
| /* CASE_LABEL_EXPR accessors. These give access to the high and low values |
| of a case label, respectively. */ |
| #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) |
| #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) |
| #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) |
| #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) |
| |
| /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match |
| corresponding MEM_REF operands. */ |
| #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) |
| #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) |
| #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) |
| #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) |
| #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) |
| |
| #define MR_DEPENDENCE_CLIQUE(NODE) \ |
| (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique) |
| #define MR_DEPENDENCE_BASE(NODE) \ |
| (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base) |
| |
| /* The operands of a BIND_EXPR. */ |
| #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) |
| #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) |
| #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) |
| |
| /* GOTO_EXPR accessor. This gives access to the label associated with |
| a goto statement. */ |
| #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0) |
| |
| /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the |
| instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and |
| ASM_CLOBBERS represent the outputs, inputs, and clobbers for the |
| statement. */ |
| #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) |
| #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) |
| #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) |
| #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) |
| #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) |
| /* Nonzero if we want to create an ASM_INPUT instead of an |
| ASM_OPERAND with no operands. */ |
| #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) |
| #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) |
| /* Nonzero if we want to consider this asm as minimum length and cost |
| for inlining decisions. */ |
| #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag) |
| |
| /* COND_EXPR accessors. */ |
| #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) |
| #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) |
| #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) |
| |
| /* Accessors for the chains of recurrences. */ |
| #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) |
| #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) |
| #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var |
| |
| /* LABEL_EXPR accessor. This gives access to the label associated with |
| the given label expression. */ |
| #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) |
| |
| /* CATCH_EXPR accessors. */ |
| #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) |
| #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) |
| |
| /* EH_FILTER_EXPR accessors. */ |
| #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) |
| #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) |
| |
| /* OBJ_TYPE_REF accessors. */ |
| #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) |
| #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) |
| #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) |
| |
| /* ASSERT_EXPR accessors. */ |
| #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) |
| #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) |
| |
| /* CALL_EXPR accessors. */ |
| #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) |
| #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) |
| #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) |
| #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3) |
| #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn) |
| |
| /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. |
| We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if |
| the argument count is zero when checking is enabled. Instead, do |
| the pointer arithmetic to advance past the 3 fixed operands in a |
| CALL_EXPR. That produces a valid pointer to just past the end of the |
| operand array, even if it's not valid to dereference it. */ |
| #define CALL_EXPR_ARGP(NODE) \ |
| (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) |
| |
| /* TM directives and accessors. */ |
| #define TRANSACTION_EXPR_BODY(NODE) \ |
| TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) |
| #define TRANSACTION_EXPR_OUTER(NODE) \ |
| (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) |
| #define TRANSACTION_EXPR_RELAXED(NODE) \ |
| (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) |
| |
| /* OpenMP and OpenACC directive and clause accessors. */ |
| |
| /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses |
| as operand 1. */ |
| #define OMP_BODY(NODE) \ |
| TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0) |
| #define OMP_CLAUSES(NODE) \ |
| TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1) |
| |
| /* Generic accessors for OMP nodes that keep clauses as operand 0. */ |
| #define OMP_STANDALONE_CLAUSES(NODE) \ |
| TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0) |
| |
| #define OACC_DATA_BODY(NODE) \ |
| TREE_OPERAND (OACC_DATA_CHECK (NODE), 0) |
| #define OACC_DATA_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_DATA_CHECK (NODE), 1) |
| |
| #define OACC_HOST_DATA_BODY(NODE) \ |
| TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0) |
| #define OACC_HOST_DATA_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1) |
| |
| #define OACC_CACHE_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0) |
| |
| #define OACC_DECLARE_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0) |
| |
| #define OACC_ENTER_DATA_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0) |
| |
| #define OACC_EXIT_DATA_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0) |
| |
| #define OACC_UPDATE_CLAUSES(NODE) \ |
| TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0) |
| |
| #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) |
| #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) |
| |
| #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) |
| #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) |
| |
| #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) |
| #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) |
| #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) |
| |
| #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP) |
| #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0) |
| #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1) |
| #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2) |
| #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3) |
| #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4) |
| #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5) |
| #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6) |
| |
| #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) |
| #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) |
| |
| #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) |
| |
| #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) |
| #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) |
| |
| #define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0) |
| #define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1) |
| |
| #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) |
| |
| #define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0) |
| #define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1) |
| |
| #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0) |
| #define OMP_TASKGROUP_CLAUSES(NODE) \ |
| TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1) |
| |
| #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) |
| #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1) |
| |
| #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) |
| #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) |
| #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2) |
| |
| #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0) |
| #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1) |
| |
| #define OMP_TARGET_DATA_BODY(NODE) \ |
| TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0) |
| #define OMP_TARGET_DATA_CLAUSES(NODE)\ |
| TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1) |
| |
| #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0) |
| #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1) |
| |
| #define OMP_TARGET_UPDATE_CLAUSES(NODE)\ |
| TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0) |
| |
| #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\ |
| TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0) |
| |
| #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\ |
| TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0) |
| |
| #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0) |
| #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1) |
| |
| #define OMP_CLAUSE_SIZE(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ |
| OMP_CLAUSE_FROM, \ |
| OMP_CLAUSE__CACHE_), 1) |
| |
| #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) |
| #define OMP_CLAUSE_DECL(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ |
| OMP_CLAUSE_PRIVATE, \ |
| OMP_CLAUSE__SCANTEMP_), 0) |
| #define OMP_CLAUSE_HAS_LOCATION(NODE) \ |
| (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ |
| != UNKNOWN_LOCATION) |
| #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus |
| |
| /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest |
| is non-rectangular. */ |
| #define OMP_FOR_NON_RECTANGULAR(NODE) \ |
| (OMP_LOOPING_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_SECTION statement that was the last lexical member. |
| This status is meaningful in the implementation of lastprivate. */ |
| #define OMP_SECTION_LAST(NODE) \ |
| (OMP_SECTION_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_PARALLEL statement if it represents an explicit |
| combined parallel work-sharing constructs. */ |
| #define OMP_PARALLEL_COMBINED(NODE) \ |
| (OMP_PARALLEL_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_TEAMS statement if it represents an explicit |
| combined teams distribute constructs. */ |
| #define OMP_TEAMS_COMBINED(NODE) \ |
| (OMP_TEAMS_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_TARGET statement if it represents explicit |
| combined target teams, target parallel or target simd constructs. */ |
| #define OMP_TARGET_COMBINED(NODE) \ |
| (OMP_TARGET_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_MASTER statement if it represents an explicit |
| combined master constructs. */ |
| #define OMP_MASTER_COMBINED(NODE) \ |
| (OMP_MASTER_CHECK (NODE)->base.private_flag) |
| |
| /* True on an OMP_MASKED statement if it represents an explicit |
| combined masked constructs. */ |
| #define OMP_MASKED_COMBINED(NODE) \ |
| (OMP_MASKED_CHECK (NODE)->base.private_flag) |
| |
| /* Memory order for OMP_ATOMIC*. */ |
| #define OMP_ATOMIC_MEMORY_ORDER(NODE) \ |
| (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \ |
| OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order) |
| |
| /* Weak clause on OMP_ATOMIC*. */ |
| #define OMP_ATOMIC_WEAK(NODE) \ |
| (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \ |
| OMP_ATOMIC_CAPTURE_NEW)->base.public_flag) |
| |
| /* True on a PRIVATE clause if its decl is kept around for debugging |
| information only and its DECL_VALUE_EXPR is supposed to point |
| to what it has been remapped to. */ |
| #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) |
| |
| /* True on a PRIVATE clause if ctor needs access to outer region's |
| variable. */ |
| #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) |
| |
| /* True if a PRIVATE clause is for a C++ class IV on taskloop construct |
| (thus should be private on the outer taskloop and firstprivate on |
| task). */ |
| #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) |
| |
| /* True on a FIRSTPRIVATE clause if it has been added implicitly. */ |
| #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag) |
| |
| /* True on a FIRSTPRIVATE clause if only the reference and not what it refers |
| to should be firstprivatized. */ |
| #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)) |
| |
| /* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also |
| set if target construct is the only one that accepts the clause. */ |
| #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)) |
| |
| /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same |
| decl is present in the chain. */ |
| #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) |
| #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ |
| OMP_CLAUSE_LASTPRIVATE),\ |
| 1) |
| #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ |
| (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init |
| |
| /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or |
| loop construct (thus should be lastprivate on the outer taskloop and |
| firstprivate on task for the taskloop construct and carefully handled |
| for loop construct). */ |
| #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)) |
| |
| /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */ |
| #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)) |
| |
| /* True on a SHARED clause if a FIRSTPRIVATE clause for the same |
| decl is present in the chain (this can happen only for taskloop |
| with FIRSTPRIVATE/LASTPRIVATE on it originally. */ |
| #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag) |
| |
| /* True on a SHARED clause if a scalar is not modified in the body and |
| thus could be optimized as firstprivate. */ |
| #define OMP_CLAUSE_SHARED_READONLY(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)) |
| |
| #define OMP_CLAUSE_IF_MODIFIER(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier) |
| |
| #define OMP_CLAUSE_FINAL_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) |
| #define OMP_CLAUSE_IF_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) |
| #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) |
| #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) |
| #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0) |
| #define OMP_CLAUSE_HINT_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0) |
| #define OMP_CLAUSE_FILTER_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0) |
| |
| #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0) |
| |
| #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0) |
| |
| #define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE)) |
| #define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS)) |
| |
| /* OpenACC clause expressions */ |
| #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0) |
| #define OMP_CLAUSE_GANG_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0) |
| #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1) |
| #define OMP_CLAUSE_ASYNC_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0) |
| #define OMP_CLAUSE_WAIT_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0) |
| #define OMP_CLAUSE_VECTOR_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0) |
| #define OMP_CLAUSE_WORKER_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0) |
| #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0) |
| #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0) |
| #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND ( \ |
| OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0) |
| |
| #define OMP_CLAUSE_DEPEND_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind) |
| |
| #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \ |
| TREE_PUBLIC (TREE_LIST_CHECK (NODE)) |
| |
| #define OMP_CLAUSE_MAP_KIND(NODE) \ |
| ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind) |
| #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \ |
| = (unsigned int) (MAP_KIND)) |
| |
| /* Nonzero if this map clause is for array (rather than pointer) based array |
| section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding |
| OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */ |
| #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag) |
| /* Nonzero if this is a mapped array section, that might need special |
| treatment if OMP_CLAUSE_SIZE is zero. */ |
| #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) |
| /* Nonzero if this map clause is for an OpenACC compute construct's reduction |
| variable or OpenMP map clause mentioned also in in_reduction clause on the |
| same construct. */ |
| #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)) |
| /* Nonzero on map clauses added implicitly for reduction clauses on combined |
| or composite constructs. They shall be removed if there is an explicit |
| map clause. */ |
| #define OMP_CLAUSE_MAP_IMPLICIT(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag) |
| |
| /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present' |
| clause. */ |
| #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag) |
| |
| #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind) |
| |
| #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind) |
| |
| /* True if there is a device clause with a device-modifier 'ancestor'. */ |
| #define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag) |
| |
| #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) |
| #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) |
| #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) |
| |
| #define OMP_CLAUSE_ORDERED_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0) |
| |
| /* True for unconstrained modifier on order(concurrent) clause. */ |
| #define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag) |
| /* True for reproducible modifier on order(concurrent) clause. */ |
| #define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)) |
| |
| #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ |
| (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code) |
| #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION), 1) |
| #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION), 2) |
| #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ |
| (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init |
| #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ |
| (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge |
| #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION), 3) |
| #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION), 4) |
| |
| /* True if a REDUCTION clause may reference the original list item (omp_orig) |
| in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */ |
| #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \ |
| (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \ |
| OMP_CLAUSE_IN_REDUCTION)->base.public_flag) |
| |
| /* True if a REDUCTION clause has task reduction-modifier. */ |
| #define OMP_CLAUSE_REDUCTION_TASK(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)) |
| |
| /* True if a REDUCTION clause has inscan reduction-modifier. */ |
| #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)) |
| |
| /* True if a LINEAR clause doesn't need copy in. True for iterator vars which |
| are always initialized inside of the loop construct, false otherwise. */ |
| #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag) |
| |
| /* True if a LINEAR clause doesn't need copy out. True for iterator vars which |
| are declared inside of the simd construct. */ |
| #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) |
| |
| /* True if a LINEAR clause has a stride that is variable. */ |
| #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \ |
| TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) |
| |
| /* True if a LINEAR clause is for an array or allocatable variable that |
| needs special handling by the frontend. */ |
| #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag) |
| |
| #define OMP_CLAUSE_LINEAR_STEP(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1) |
| |
| #define OMP_CLAUSE_LINEAR_STMT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2) |
| |
| #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \ |
| (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init |
| |
| #define OMP_CLAUSE_LINEAR_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind) |
| |
| #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1) |
| |
| #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1) |
| |
| #define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2) |
| |
| /* True if an ALLOCATE clause was present on a combined or composite |
| construct and the code for splitting the clauses has already performed |
| checking if the listed variable has explicit privatization on the |
| construct. */ |
| #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag) |
| |
| #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0) |
| |
| #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ |
| OMP_CLAUSE_THREAD_LIMIT), 0) |
| |
| #define OMP_CLAUSE_DEVICE_ID(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0) |
| |
| #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ |
| OMP_CLAUSE_DIST_SCHEDULE), 0) |
| |
| #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0) |
| |
| #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0) |
| |
| #define OMP_CLAUSE__SIMDUID__DECL(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0) |
| |
| #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) |
| |
| /* True if a SCHEDULE clause has the simd modifier on it. */ |
| #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag) |
| |
| #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) |
| |
| #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind) |
| #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \ |
| ((enum omp_clause_defaultmap_kind) \ |
| (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK)) |
| #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \ |
| ((enum omp_clause_defaultmap_kind) \ |
| (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK)) |
| #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \ |
| (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \ |
| = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR)) |
| |
| #define OMP_CLAUSE_BIND_KIND(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind) |
| |
| #define OMP_CLAUSE_TILE_LIST(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0) |
| #define OMP_CLAUSE_TILE_ITERVAR(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1) |
| #define OMP_CLAUSE_TILE_COUNT(NODE) \ |
| OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2) |
| |
| /* _CONDTEMP_ holding temporary with iteration count. */ |
| #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag) |
| |
| /* _SCANTEMP_ holding temporary with pointer to thread's local array; |
| allocation. */ |
| #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \ |
| (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag) |
| |
| /* _SCANTEMP_ holding temporary with a control variable for deallocation; |
| one boolean_type_node for test whether alloca was used, another one |
| to pass to __builtin_stack_restore or free. */ |
| #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \ |
| TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)) |
| |
| /* SSA_NAME accessors. */ |
| |
| /* Whether SSA_NAME NODE is a virtual operand. This simply caches the |
| information in the underlying SSA_NAME_VAR for efficiency. */ |
| #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \ |
| SSA_NAME_CHECK (NODE)->base.public_flag |
| |
| /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE |
| if there is no name associated with it. */ |
| #define SSA_NAME_IDENTIFIER(NODE) \ |
| (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ |
| ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ |
| ? (NODE)->ssa_name.var \ |
| : DECL_NAME ((NODE)->ssa_name.var)) \ |
| : NULL_TREE) |
| |
| /* Returns the variable being referenced. This can be NULL_TREE for |
| temporaries not associated with any user variable. |
| Once released, this is the only field that can be relied upon. */ |
| #define SSA_NAME_VAR(NODE) \ |
| (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ |
| || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ |
| ? NULL_TREE : (NODE)->ssa_name.var) |
| |
| #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ |
| do \ |
| { \ |
| tree var_ = (VAR); \ |
| SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \ |
| SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \ |
| = (var_ \ |
| && TREE_CODE (var_) == VAR_DECL \ |
| && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \ |
| } \ |
| while (0) |
| |
| /* Returns the statement which defines this SSA name. */ |
| #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt |
| |
| /* Returns the SSA version number of this SSA name. Note that in |
| tree SSA, version numbers are not per variable and may be recycled. */ |
| #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version |
| |
| /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are |
| never output, so we can safely use the ASM_WRITTEN_FLAG for this |
| status bit. */ |
| #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ |
| SSA_NAME_CHECK (NODE)->base.asm_written_flag |
| |
| /* Nonzero if this SSA_NAME expression is currently on the free list of |
| SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing |
| has no meaning for an SSA_NAME. */ |
| #define SSA_NAME_IN_FREE_LIST(NODE) \ |
| SSA_NAME_CHECK (NODE)->base.nothrow_flag |
| |
| /* Nonzero if this SSA_NAME is the default definition for the |
| underlying symbol. A default SSA name is created for symbol S if |
| the very first reference to S in the function is a read operation. |
| Default definitions are always created by an empty statement and |
| belong to no basic block. */ |
| #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ |
| SSA_NAME_CHECK (NODE)->base.default_def_flag |
| |
| /* Nonzero if this SSA_NAME is known to point to memory that may not |
| be written to. This is set for default defs of function parameters |
| that have a corresponding r or R specification in the functions |
| fn spec attribute. This is used by alias analysis. */ |
| #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \ |
| SSA_NAME_CHECK (NODE)->base.deprecated_flag |
| |
| /* Attributes for SSA_NAMEs for pointer-type variables. */ |
| #define SSA_NAME_PTR_INFO(N) \ |
| SSA_NAME_CHECK (N)->ssa_name.info.ptr_info |
| |
| /* True if SSA_NAME_RANGE_INFO describes an anti-range. */ |
| #define SSA_NAME_ANTI_RANGE_P(N) \ |
| SSA_NAME_CHECK (N)->base.static_flag |
| |
| /* The type of range described by SSA_NAME_RANGE_INFO. */ |
| #define SSA_NAME_RANGE_TYPE(N) \ |
| (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE) |
| |
| /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */ |
| #define SSA_NAME_RANGE_INFO(N) \ |
| SSA_NAME_CHECK (N)->ssa_name.info.range_info |
| |
| /* Return the immediate_use information for an SSA_NAME. */ |
| #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses |
| |
| #define OMP_CLAUSE_CODE(NODE) \ |
| (OMP_CLAUSE_CHECK (NODE))->omp_clause.code |
| |
| #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ |
| ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) |
| |
| #define OMP_CLAUSE_OPERAND(NODE, I) \ |
| OMP_CLAUSE_ELT_CHECK (NODE, I) |
| |
| /* In a BLOCK (scope) node: |
| Variables declared in the scope NODE. */ |
| #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) |
| #define BLOCK_NONLOCALIZED_VARS(NODE) \ |
| (BLOCK_CHECK (NODE)->block.nonlocalized_vars) |
| #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ |
| vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) |
| #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] |
| /* A chain of BLOCKs (scopes) nested within the scope NODE. */ |
| #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) |
| /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost" |
| function scope. Inlined functions are chained by this so that given |
| expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope |
| in which E has been made or into which E has been inlined. */ |
| #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) |
| /* Points to the next scope at the same level of nesting as scope NODE. */ |
| #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) |
| /* A BLOCK, or FUNCTION_DECL of the function from which a block has been |
| inlined. In a scope immediately enclosing an inlined leaf expression, |
| points to the outermost scope into which it has been inlined (thus |
| bypassing all intermediate BLOCK_SUPERCONTEXTs). */ |
| #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) |
| #define BLOCK_ORIGIN(NODE) \ |
| (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE)) |
| #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die) |
| |
| /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ |
| #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) |
| |
| /* True if BLOCK appears in cold section. */ |
| #define BLOCK_IN_COLD_SECTION_P(NODE) \ |
| (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag) |
| |
| /* An index number for this block. These values are not guaranteed to |
| be unique across functions -- whether or not they are depends on |
| the debugging output format in use. */ |
| #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) |
| |
| /* If block reordering splits a lexical block into discontiguous |
| address ranges, we'll make a copy of the original block. |
| |
| Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. |
| In that case, we have one source block that has been replicated |
| (through inlining or unrolling) into many logical blocks, and that |
| these logical blocks have different physical variables in them. |
| |
| In this case, we have one logical block split into several |
| non-contiguous address ranges. Most debug formats can't actually |
| represent this idea directly, so we fake it by creating multiple |
| logical blocks with the same variables in them. However, for those |
| that do support non-contiguous regions, these allow the original |
| logical block to be reconstructed, along with the set of address |
| ranges. |
| |
| One of the logical block fragments is arbitrarily chosen to be |
| the ORIGIN. The other fragments will point to the origin via |
| BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer |
| be null. The list of fragments will be chained through |
| BLOCK_FRAGMENT_CHAIN from the origin. */ |
| |
| #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) |
| #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) |
| |
| /* For an inlined function, this gives the location where it was called |
| from. This is only set in the top level block, which corresponds to the |
| inlined function scope. This is used in the debug output routines. */ |
| |
| #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) |
| |
| /* This gives the location of the end of the block, useful to attach |
| code implicitly generated for outgoing paths. */ |
| |
| #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus) |
| |
| /* Define fields and accessors for nodes representing data types. */ |
| |
| /* See tree.def for documentation of the use of these fields. |
| Look at the documentation of the various ..._TYPE tree codes. |
| |
| Note that the type.values, type.minval, and type.maxval fields are |
| overloaded and used for different macros in different kinds of types. |
| Each macro must check to ensure the tree node is of the proper kind of |
| type. Note also that some of the front-ends also overload these fields, |
| so they must be checked as well. */ |
| |
| #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) |
| /* Type size in bits as a tree expression. Need not be constant and may |
| be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base |
| class subobject with its own virtual base classes (which are laid out |
| separately). */ |
| #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) |
| /* Likewise, type size in bytes. */ |
| #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) |
| #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) |
| #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) |
| #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) |
| #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) |
| #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) |
| #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) |
| #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) |
| |
| #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode) |
| #define TYPE_MODE(NODE) \ |
| (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \ |
| ? vector_type_mode (NODE) : (NODE)->type_common.mode) |
| #define SCALAR_TYPE_MODE(NODE) \ |
| (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode)) |
| #define SCALAR_INT_TYPE_MODE(NODE) \ |
| (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode)) |
| #define SCALAR_FLOAT_TYPE_MODE(NODE) \ |
| (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode)) |
| #define SET_TYPE_MODE(NODE, MODE) \ |
| (TYPE_CHECK (NODE)->type_common.mode = (MODE)) |
| |
| extern machine_mode element_mode (const_tree); |
| extern machine_mode vector_type_mode (const_tree); |
| extern unsigned int vector_element_bits (const_tree); |
| extern tree vector_element_bits_tree (const_tree); |
| |
| /* The "canonical" type for this type node, which is used by frontends to |
| compare the type for equality with another type. If two types are |
| equal (based on the semantics of the language), then they will have |
| equivalent TYPE_CANONICAL entries. |
| |
| As a special case, if TYPE_CANONICAL is NULL_TREE, and thus |
| TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot |
| be used for comparison against other types. Instead, the type is |
| said to require structural equality checks, described in |
| TYPE_STRUCTURAL_EQUALITY_P. |
| |
| For unqualified aggregate and function types the middle-end relies on |
| TYPE_CANONICAL to tell whether two variables can be assigned |
| to each other without a conversion. The middle-end also makes sure |
| to assign the same alias-sets to the type partition with equal |
| TYPE_CANONICAL of their unqualified variants. */ |
| #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) |
| /* Indicates that the type node requires structural equality |
| checks. The compiler will need to look at the composition of the |
| type to determine whether it is equal to another type, rather than |
| just comparing canonical type pointers. For instance, we would need |
| to look at the return and parameter types of a FUNCTION_TYPE |
| node. */ |
| #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) |
| /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the |
| type node requires structural equality. */ |
| #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) |
| |
| #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) |
| #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) |
| |
| /* The (language-specific) typed-based alias set for this type. |
| Objects whose TYPE_ALIAS_SETs are different cannot alias each |
| other. If the TYPE_ALIAS_SET is -1, no alias set has yet been |
| assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this |
| type can alias objects of any type. */ |
| #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) |
| |
| /* Nonzero iff the typed-based alias set for this type has been |
| calculated. */ |
| #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.alias_set != -1) |
| |
| /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply |
| to this type. */ |
| #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) |
| |
| /* Raw access to the alignment field. */ |
| #define TYPE_ALIGN_RAW(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.align) |
| |
| /* The alignment necessary for objects of this type. |
| The value is an int, measured in bits and must be a power of two. |
| We support also an "alignment" of zero. */ |
| #define TYPE_ALIGN(NODE) \ |
| (TYPE_ALIGN_RAW (NODE) \ |
| ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0) |
| |
| /* Specify that TYPE_ALIGN(NODE) is X. */ |
| #define SET_TYPE_ALIGN(NODE, X) \ |
| (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X)) |
| |
| /* 1 if the alignment for this type was requested by "aligned" attribute, |
| 0 if it is the default for this type. */ |
| #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) |
| |
| /* The alignment for NODE, in bytes. */ |
| #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) |
| |
| /* The minimum alignment necessary for objects of this type without |
| warning. The value is an int, measured in bits. */ |
| #define TYPE_WARN_IF_NOT_ALIGN(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.warn_if_not_align \ |
| ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0) |
| |
| /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */ |
| #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \ |
| (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X)) |
| |
| /* If your language allows you to declare types, and you want debug info |
| for them, then you need to generate corresponding TYPE_DECL nodes. |
| These "stub" TYPE_DECL nodes have no name, and simply point at the |
| type node. You then set the TYPE_STUB_DECL field of the type node |
| to point back at the TYPE_DECL node. This allows the debug routines |
| to know that the two nodes represent the same type, so that we only |
| get one debug info record for them. */ |
| #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) |
| |
| /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means |
| the type has BLKmode only because it lacks the alignment required for |
| its size. */ |
| #define TYPE_NO_FORCE_BLK(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) |
| |
| /* Nonzero in a type considered volatile as a whole. */ |
| #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) |
| |
| /* Nonzero in a type considered atomic as a whole. */ |
| #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag) |
| |
| /* Means this type is const-qualified. */ |
| #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) |
| |
| /* If nonzero, this type is `restrict'-qualified, in the C sense of |
| the term. */ |
| #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) |
| |
| /* If nonzero, type's name shouldn't be emitted into debug info. */ |
| #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) |
| |
| /* The address space the type is in. */ |
| #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) |
| |
| /* Encode/decode the named memory support as part of the qualifier. If more |
| than 8 qualifiers are added, these macros need to be adjusted. */ |
| #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) |
| #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) |
| |
| /* Return all qualifiers except for the address space qualifiers. */ |
| #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) |
| |
| /* Only keep the address space out of the qualifiers and discard the other |
| qualifiers. */ |
| #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) |
| |
| /* The set of type qualifiers for this type. */ |
| #define TYPE_QUALS(NODE) \ |
| ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ |
| | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ |
| | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ |
| | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ |
| | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) |
| |
| /* The same as TYPE_QUALS without the address space qualifications. */ |
| #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ |
| ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ |
| | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ |
| | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ |
| | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) |
| |
| /* The same as TYPE_QUALS without the address space and atomic |
| qualifications. */ |
| #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \ |
| ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ |
| | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ |
| | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) |
| |
| /* These flags are available for each language front end to use internally. */ |
| #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) |
| #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) |
| #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) |
| #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) |
| #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) |
| #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) |
| #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) |
| #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7) |
| |
| /* Used to keep track of visited nodes in tree traversals. This is set to |
| 0 by copy_node and make_node. */ |
| #define TREE_VISITED(NODE) ((NODE)->base.visited) |
| |
| /* If set in an ARRAY_TYPE, indicates a string type (for languages |
| that distinguish string from array of char). |
| If set in a INTEGER_TYPE, indicates a character type. */ |
| #define TYPE_STRING_FLAG(NODE) \ |
| (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag) |
| |
| /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms |
| to the C++ one definition rule. This is used for LTO canonical type |
| computation. */ |
| #define TYPE_CXX_ODR_P(NODE) \ |
| (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag) |
| |
| /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings |
| about missing conversions to other vector types of the same size. */ |
| #define TYPE_VECTOR_OPAQUE(NODE) \ |
| (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) |
| |
| /* Indicates that objects of this type must be initialized by calling a |
| function when they are created. */ |
| #define TYPE_NEEDS_CONSTRUCTING(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) |
| |
| /* Indicates that a UNION_TYPE object should be passed the same way that |
| the first union alternative would be passed, or that a RECORD_TYPE |
| object should be passed the same way that the first (and only) member |
| would be passed. */ |
| #define TYPE_TRANSPARENT_AGGR(NODE) \ |
| (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) |
| |
| /* For an ARRAY_TYPE, indicates that it is not permitted to take the |
| address of a component of the type. This is the counterpart of |
| DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ |
| #define TYPE_NONALIASED_COMPONENT(NODE) \ |
| (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) |
| |
| /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE |
| whether the array is typeless storage or the type contains a member |
| with this flag set. Such types are exempt from type-based alias |
| analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types |
| the flag should be inherited from the element type, can change |
| when type is finalized and because of that should not be used in |
| type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types |
| the flag should not be changed after the array is created and should |
| be used in type hashing. */ |
| #define TYPE_TYPELESS_STORAGE(NODE) \ |
| (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \ |
| ARRAY_TYPE)->type_common.typeless_storage) |
| |
| /* Indicated that objects of this type should be laid out in as |
| compact a way as possible. */ |
| #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) |
| |
| /* Used by type_contains_placeholder_p to avoid recomputation. |
| Values are: 0 (unknown), 1 (false), 2 (true). Never access |
| this field directly. */ |
| #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) |
| |
| /* Nonzero if RECORD_TYPE represents a final derivation of class. */ |
| #define TYPE_FINAL_P(NODE) \ |
| (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag) |
| |
| /* The debug output functions use the symtab union field to store |
| information specific to the debugging format. The different debug |
| output hooks store different types in the union field. These three |
| macros are used to access different fields in the union. The debug |
| hooks are responsible for consistently using only a specific |
| macro. */ |
| |
| /* Symtab field as an integer. Used by stabs generator in dbxout.c to |
| hold the type's number in the generated stabs. */ |
| #define TYPE_SYMTAB_ADDRESS(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.symtab.address) |
| |
| /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator |
| in dwarf2out.c to point to the DIE generated for the type. */ |
| #define TYPE_SYMTAB_DIE(NODE) \ |
| (TYPE_CHECK (NODE)->type_common.symtab.die) |
| |
| /* The garbage collector needs to know the interpretation of the |
| symtab field. These constants represent the different types in the |
| union. */ |
| |
| #define TYPE_SYMTAB_IS_ADDRESS (0) |
| #define TYPE_SYMTAB_IS_DIE (1) |
| |
| #define TYPE_LANG_SPECIFIC(NODE) \ |
| (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) |
| |
| #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) |
| #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) |
| #define TYPE_FIELDS(NODE) \ |
| (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) |
| #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values) |
| #define TYPE_ARG_TYPES(NODE) \ |
| (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) |
| #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values) |
| |
| #define TYPE_MIN_VALUE(NODE) \ |
| (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) |
| #define TYPE_NEXT_PTR_TO(NODE) \ |
| (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) |
| #define TYPE_NEXT_REF_TO(NODE) \ |
| (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) |
| #define TYPE_VFIELD(NODE) \ |
| (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) |
| #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) |
| |
| #define TYPE_MAX_VALUE(NODE) \ |
| (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) |
| #define TYPE_METHOD_BASETYPE(NODE) \ |
| (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) |
| #define TYPE_OFFSET_BASETYPE(NODE) \ |
| (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) |
| /* If non-NULL, this is an upper bound of the size (in bytes) of an |
| object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be |
| allocated. */ |
| #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ |
| (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) |
| #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) |
| /* For record and union types, information about this type, as a base type |
| for itself. */ |
| #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) |
| |
| /* For types, used in a language-dependent way. */ |
| #define TYPE_LANG_SLOT_1(NODE) \ |
| (TYPE_CHECK (NODE)->type_non_common.lang_1) |
| |
| /* Define accessor macros for information about type inheritance |
| and basetypes. |
| |
| A "basetype" means a particular usage of a data type for inheritance |
| in another type. Each such basetype usage has its own "binfo" |
| object to describe it. The binfo object is a TREE_VEC node. |
| |
| Inheritance is represented by the binfo nodes allocated for a |
| given type. For example, given types C and D, such that D is |
| inherited by C, 3 binfo nodes will be allocated: one for describing |
| the binfo properties of C, similarly one for D, and one for |
| describing the binfo properties of D as a base type for C. |
| Thus, given a pointer to class C, one can get a pointer to the binfo |
| of D acting as a basetype for C by looking at C's binfo's basetypes. */ |
| |
| /* BINFO specific flags. */ |
| |
| /* Nonzero means that the derivation chain is via a `virtual' declaration. */ |
| #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) |
| |
| /* Flags for language dependent use. */ |
| #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE)) |
| #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE)) |
| |
| /* The actual data type node being inherited in this basetype. */ |
| #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE)) |
| |
| /* The offset where this basetype appears in its containing type. |
| BINFO_OFFSET slot holds the offset (in bytes) |
| from the base of the complete object to the base of the part of the |
| object that is allocated on behalf of this `type'. |
| This is always 0 except when there is multiple inheritance. */ |
| |
| #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset) |
| #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) |
| |
| /* The virtual function table belonging to this basetype. Virtual |
| function tables provide a mechanism for run-time method dispatching. |
| The entries of a virtual function table are language-dependent. */ |
| |
| #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable) |
| |
| /* The virtual functions in the virtual function table. This is |
| a TREE_LIST that is used as an initial approximation for building |
| a virtual function table for this basetype. */ |
| #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals) |
| |
| /* A vector of binfos for the direct basetypes inherited by this |
| basetype. |
| |
| If this basetype describes type D as inherited in C, and if the |
| basetypes of D are E and F, then this vector contains binfos for |
| inheritance of E and F by C. */ |
| #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos) |
| |
| /* The number of basetypes for NODE. */ |
| #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) |
| |
| /* Accessor macro to get to the Nth base binfo of this binfo. */ |
| #define BINFO_BASE_BINFO(NODE,N) \ |
| ((*BINFO_BASE_BINFOS (NODE))[(N)]) |
| #define BINFO_BASE_ITERATE(NODE,N,B) \ |
| (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) |
| #define BINFO_BASE_APPEND(NODE,T) \ |
| (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) |
| |
| /* For a BINFO record describing a virtual base class, i.e., one where |
| TREE_VIA_VIRTUAL is set, this field assists in locating the virtual |
| base. The actual contents are language-dependent. In the C++ |
| front-end this field is an INTEGER_CST giving an offset into the |
| vtable where the offset to the virtual base can be found. */ |
| #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field) |
| |
| /* Indicates the accesses this binfo has to its bases. The values are |
| access_public_node, access_protected_node or access_private_node. |
| If this array is not present, public access is implied. */ |
| #define BINFO_BASE_ACCESSES(NODE) \ |
| (TREE_BINFO_CHECK (NODE)->binfo.base_accesses) |
| |
| #define BINFO_BASE_ACCESS(NODE,N) \ |
| (*BINFO_BASE_ACCESSES (NODE))[(N)] |
| #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ |
| BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) |
| |
| /* The index in the VTT where this subobject's sub-VTT can be found. |
| NULL_TREE if there is no sub-VTT. */ |
| #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt) |
| |
| /* The index in the VTT where the vptr for this subobject can be |
| found. NULL_TREE if there is no secondary vptr in the VTT. */ |
| #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr) |
| |
| /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base |
| inheriting this base for non-virtual bases. For virtual bases it |
| points either to the binfo for which this is a primary binfo, or to |
| the binfo of the most derived type. */ |
| #define BINFO_INHERITANCE_CHAIN(NODE) \ |
| (TREE_BINFO_CHECK (NODE)->binfo.inheritance) |
| |
| |
| /* Define fields and accessors for nodes representing declared names. */ |
| |
| /* Nonzero if DECL represents an SSA name or a variable that can possibly |
| have an associated SSA name. */ |
| #define SSA_VAR_P(DECL) \ |
| (TREE_CODE (DECL) == VAR_DECL \ |
| || TREE_CODE (DECL) == PARM_DECL \ |
| || TREE_CODE (DECL) == RESULT_DECL \ |
| || TREE_CODE (DECL) == SSA_NAME) |
| |
| |
| #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) |
| |
| /* This is the name of the object as written by the user. |
| It is an IDENTIFIER_NODE. */ |
| #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) |
| |
| /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */ |
| #define TYPE_IDENTIFIER(NODE) \ |
| (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \ |
| ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE)) |
| |
| /* Every ..._DECL node gets a unique number. */ |
| #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) |
| |
| /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous |
| uses. */ |
| #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) |
| |
| /* Every ..._DECL node gets a unique number that stays the same even |
| when the decl is copied by the inliner once it is set. */ |
| #define DECL_PT_UID(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ |
| ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) |
| /* Initialize the ..._DECL node pt-uid to the decls uid. */ |
| #define SET_DECL_PT_UID(NODE, UID) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) |
| /* Whether the ..._DECL node pt-uid has been initialized and thus needs to |
| be preserved when copyin the decl. */ |
| #define DECL_PT_UID_SET_P(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) |
| |
| /* These two fields describe where in the source code the declaration |
| was. If the declaration appears in several places (as for a C |
| function that is declared first and then defined later), this |
| information should refer to the definition. */ |
| #define DECL_SOURCE_LOCATION(NODE) \ |
| (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) |
| #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) |
| #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) |
| #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) |
| /* This decl was created by a front-end or back-end rather than by |
| user code, and has not been explicitly declared by the user -- when |
| that happens the source location is updated to the user's |
| source. This includes decls with no location (!). */ |
| #define DECL_IS_UNDECLARED_BUILTIN(DECL) \ |
| (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) |
| |
| /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or |
| QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, |
| PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL |
| nodes, this points to either the FUNCTION_DECL for the containing |
| function, the RECORD_TYPE or UNION_TYPE for the containing type, or |
| NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file |
| scope". In particular, for VAR_DECLs which are virtual table pointers |
| (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type |
| they belong to. */ |
| #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) |
| #define DECL_FIELD_CONTEXT(NODE) \ |
| (FIELD_DECL_CHECK (NODE)->decl_minimal.context) |
| |
| /* If nonzero, decl's name shouldn't be emitted into debug info. */ |
| #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) |
| |
| /* For any sort of a ..._DECL node, this points to the original (abstract) |
| decl node which this decl is an inlined/cloned instance of, or else it |
| is NULL indicating that this decl is not an instance of some other decl. |
| |
| The C front-end also uses this in a nested declaration of an inline |
| function, to point back to the definition. */ |
| #define DECL_ABSTRACT_ORIGIN(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) |
| |
| /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract |
| origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ |
| #define DECL_ORIGIN(NODE) \ |
| (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) |
| |
| /* Nonzero for any sort of ..._DECL node means this decl node represents an |
| inline instance of some original (abstract) decl from an inline function; |
| suppress any warnings about shadowing some other variable. FUNCTION_DECL |
| nodes can also have their abstract origin set to themselves. */ |
| #define DECL_FROM_INLINE(NODE) \ |
| (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ |
| && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) |
| |
| /* In a DECL this is the field where attributes are stored. */ |
| #define DECL_ATTRIBUTES(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.attributes) |
| |
| /* For a FUNCTION_DECL, holds the tree of BINDINGs. |
| For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. |
| For a VAR_DECL, holds the initial value. |
| For a PARM_DECL, used for DECL_ARG_TYPE--default |
| values for parameters are encoded in the type of the function, |
| not in the PARM_DECL slot. |
| For a FIELD_DECL, this is used for enumeration values and the C |
| frontend uses it for temporarily storing bitwidth of bitfields. |
| |
| ??? Need to figure out some way to check this isn't a PARM_DECL. */ |
| #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) |
| |
| /* Holds the size of the datum, in bits, as a tree expression. |
| Need not be constant and may be null. May be less than TYPE_SIZE |
| for a C++ FIELD_DECL representing a base class subobject with its |
| own virtual base classes (which are laid out separately). */ |
| #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) |
| /* Likewise for the size in bytes. */ |
| #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) |
| #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) |
| /* Returns the alignment required for the datum, in bits. It must |
| be a power of two, but an "alignment" of zero is supported |
| (e.g. as "uninitialized" sentinel). */ |
| #define DECL_ALIGN(NODE) \ |
| (DECL_ALIGN_RAW (NODE) \ |
| ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0) |
| /* Specify that DECL_ALIGN(NODE) is X. */ |
| #define SET_DECL_ALIGN(NODE, X) \ |
| (DECL_ALIGN_RAW (NODE) = ffs_hwi (X)) |
| |
| /* The minimum alignment necessary for the datum, in bits, without |
| warning. */ |
| #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align) |
| #define DECL_WARN_IF_NOT_ALIGN(NODE) \ |
| (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \ |
| ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0) |
| |
| /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */ |
| #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \ |
| (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X)) |
| |
| /* The alignment of NODE, in bytes. */ |
| #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) |
| /* Set if the alignment of this DECL has been set by the user, for |
| example with an 'aligned' attribute. */ |
| #define DECL_USER_ALIGN(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) |
| /* Holds the machine mode corresponding to the declaration of a variable or |
| field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a |
| FIELD_DECL. */ |
| #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) |
| #define SET_DECL_MODE(NODE, MODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE)) |
| |
| /* For FUNCTION_DECL, if it is built-in, this identifies which built-in |
| operation it is. This is only intended for low-level accesses; |
| normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION |
| should be used instead. */ |
| #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \ |
| (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) |
| |
| /* Test if FCODE is a function code for an alloca operation. */ |
| #define ALLOCA_FUNCTION_CODE_P(FCODE) \ |
| ((FCODE) == BUILT_IN_ALLOCA \ |
| || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \ |
| || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX) |
| |
| /* Generate case for an alloca operation. */ |
| #define CASE_BUILT_IN_ALLOCA \ |
| case BUILT_IN_ALLOCA: \ |
| case BUILT_IN_ALLOCA_WITH_ALIGN: \ |
| case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX |
| |
| #define DECL_FUNCTION_PERSONALITY(NODE) \ |
| (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) |
| |
| /* Nonzero for a given ..._DECL node means that the name of this node should |
| be ignored for symbolic debug purposes. For a TYPE_DECL, this means that |
| the associated type should be ignored. For a FUNCTION_DECL, the body of |
| the function should also be ignored. */ |
| #define DECL_IGNORED_P(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) |
| |
| /* Nonzero for a given ..._DECL node means that this node represents an |
| "abstract instance" of the given declaration (e.g. in the original |
| declaration of an inline function). When generating symbolic debugging |
| information, we mustn't try to generate any address information for nodes |
| marked as "abstract instances" because we don't actually generate |
| any code or allocate any data space for such instances. */ |
| #define DECL_ABSTRACT_P(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) |
| |
| /* Language-specific decl information. */ |
| #define DECL_LANG_SPECIFIC(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) |
| |
| /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: |
| do not allocate storage, and refer to a definition elsewhere. Note that |
| this does not necessarily imply the entity represented by NODE |
| has no program source-level definition in this translation unit. For |
| example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and |
| DECL_EXTERNAL may be true simultaneously; that can be the case for |
| a C99 "extern inline" function. */ |
| #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) |
| |
| /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. |
| For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. |
| |
| For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. |
| |
| Also set in some languages for variables, etc., outside the normal |
| lexical scope, such as class instance variables. */ |
| #define DECL_NONLOCAL(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) |
| |
| /* Used in VAR_DECLs to indicate that the variable is a vtable. |
| Used in FIELD_DECLs for vtable pointers. |
| Used in FUNCTION_DECLs to indicate that the function is virtual. */ |
| #define DECL_VIRTUAL_P(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) |
| |
| /* Used to indicate that this DECL represents a compiler-generated entity. */ |
| #define DECL_ARTIFICIAL(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) |
| |
| /* Additional flags for language-specific uses. */ |
| #define DECL_LANG_FLAG_0(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) |
| #define DECL_LANG_FLAG_1(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) |
| #define DECL_LANG_FLAG_2(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) |
| #define DECL_LANG_FLAG_3(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) |
| #define DECL_LANG_FLAG_4(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) |
| #define DECL_LANG_FLAG_5(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) |
| #define DECL_LANG_FLAG_6(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) |
| #define DECL_LANG_FLAG_7(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) |
| #define DECL_LANG_FLAG_8(NODE) \ |
| (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) |
| |
| /* Nonzero for a scope which is equal to file scope. */ |
| #define SCOPE_FILE_SCOPE_P(EXP) \ |
| (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) |
| /* Nonzero for a decl which is at file scope. */ |
| #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) |
| /* Nonzero for a type which is at file scope. */ |
| #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) |
| |
| /* Nonzero for a decl that is decorated using attribute used. |
| This indicates to compiler tools that this decl needs to be preserved. */ |
| #define DECL_PRESERVE_P(DECL) \ |
| DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag |
| |
| /* Nonzero for a decl that is decorated with the "noinit" attribute. |
| decls with this attribute are placed into the ".noinit" section, so they are |
| not initialized by the target's startup code. */ |
| #define DECL_NOINIT_P(DECL) \ |
| (DECL_P (DECL) \ |
| && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE)) |
| |
| /* Nonzero for a decl that is decorated with the "persistent" attribute. |
| decls with this attribute are placed into the ".persistent" section, so they |
| are not initialized by the target's startup code. */ |
| #define DECL_PERSISTENT_P(DECL) \ |
| (DECL_P (DECL) \ |
| && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE)) |
| |
| /* For function local variables of COMPLEX and VECTOR types, |
| indicates that the variable is not aliased, and that all |
| modifications to the variable have been adjusted so that |
| they are killing assignments. Thus the variable may now |
| be treated as a GIMPLE register, and use real instead of |
| virtual ops in SSA form. */ |
| #define DECL_NOT_GIMPLE_REG_P(DECL) \ |
| DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag |
| |
| extern tree decl_value_expr_lookup (tree); |
| extern void decl_value_expr_insert (tree, tree); |
| |
| /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, |
| if transformations have made this more complicated than evaluating the |
| decl itself. */ |
| #define DECL_HAS_VALUE_EXPR_P(NODE) \ |
| (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ |
| ->decl_common.decl_flag_2) |
| #define DECL_VALUE_EXPR(NODE) \ |
| (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) |
| #define SET_DECL_VALUE_EXPR(NODE, VAL) \ |
| (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) |
| |
| /* Holds the RTL expression for the value of a variable or function. |
| This value can be evaluated lazily for functions, variables with |
| static storage duration, and labels. */ |
| #define DECL_RTL(NODE) \ |
| (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ |
| ? (NODE)->decl_with_rtl.rtl \ |
| : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) |
| |
| /* Set the DECL_RTL for NODE to RTL. */ |
| #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) |
| |
| /* Returns nonzero if NODE is a tree node that can contain RTL. */ |
| #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) |
| |
| /* Returns nonzero if the DECL_RTL for NODE has already been set. */ |
| #define DECL_RTL_SET_P(NODE) \ |
| (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) |
| |
| /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for |
| SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */ |
| #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \ |
| (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \ |
| = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl) |
| |
| /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ |
| #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) |
| |
| #if (GCC_VERSION >= 2007) |
| #define DECL_RTL_KNOWN_SET(decl) __extension__ \ |
| ({ tree const __d = (decl); \ |
| gcc_checking_assert (DECL_RTL_SET_P (__d)); \ |
| /* Dereference it so the compiler knows it can't be NULL even \ |
| without assertion checking. */ \ |
| &*DECL_RTL_IF_SET (__d); }) |
| #else |
| #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) |
| #endif |
| |
| /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ |
| #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) |
| |
| /* In a FIELD_DECL, this is the field position, counting in bytes, of the |
| DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning |
| of the structure. */ |
| #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) |
| |
| /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the |
| field from DECL_FIELD_OFFSET. This field may be nonzero even for fields |
| that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the |
| natural alignment of the field's type). */ |
| #define DECL_FIELD_BIT_OFFSET(NODE) \ |
| (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) |
| |
| /* In a FIELD_DECL, this indicates whether the field was a bit-field and |
| if so, the type that was originally specified for it. |
| TREE_TYPE may have been modified (in finish_struct). */ |
| #define DECL_BIT_FIELD_TYPE(NODE) \ |
| (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) |
| |
| /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage |
| representative FIELD_DECL. */ |
| #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ |
| (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) |
| |
| /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which |
| if nonzero, indicates that the field occupies the type. */ |
| #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) |
| |
| /* For FIELD_DECLs, off_align holds the number of low-order bits of |
| DECL_FIELD_OFFSET which are known to be always zero. |
| DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET |
| has. */ |
| #define DECL_OFFSET_ALIGN(NODE) \ |
| (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) |
| |
| /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */ |
| #define SET_DECL_OFFSET_ALIGN(NODE, X) \ |
| (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) |
| |
| /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in |
| which this FIELD_DECL is defined. This information is needed when |
| writing debugging information about vfield and vbase decls for C++. */ |
| #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) |
| |
| /* In a FIELD_DECL, indicates this field should be bit-packed. */ |
| #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag) |
| |
| /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed |
| specially. */ |
| #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) |
| |
| /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions |
| like passing/returning containing struct by value. |
| Set for C++17 empty base artificial FIELD_DECLs as well as |
| empty [[no_unique_address]] non-static data members. */ |
| #define DECL_FIELD_ABI_IGNORED(NODE) \ |
| (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0) |
| #define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \ |
| do { \ |
| gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \ |
| FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \ |
| } while (0) |
| |
| /* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be |
| removed from the IL since PR42217 until PR101539 and by that changed |
| the ABI on several targets. This flag is provided so that the backends |
| can decide on the ABI with zero-width bitfields and emit -Wpsabi |
| warnings. */ |
| #define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \ |
| (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0) |
| #define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \ |
| do { \ |
| gcc_checking_assert (DECL_BIT_FIELD (NODE)); \ |
| FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \ |
| } while (0) |
| |
| /* Used in a FIELD_DECL to indicate that we cannot form the address of |
| this component. This makes it possible for Type-Based Alias Analysis |
| to disambiguate accesses to this field with indirect accesses using |
| the field's type: |
| |
| struct S { int i; } s; |
| int *p; |
| |
| If the flag is set on 'i', TBAA computes that s.i and *p never conflict. |
| |
| From the implementation's viewpoint, the alias set of the type of the |
| field 'i' (int) will not be recorded as a subset of that of the type of |
| 's' (struct S) in record_component_aliases. The counterpart is that |
| accesses to s.i must not be given the alias set of the type of 'i' |
| (int) but instead directly that of the type of 's' (struct S). */ |
| #define DECL_NONADDRESSABLE_P(NODE) \ |
| (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) |
| |
| /* Used in a FIELD_DECL to indicate that this field is padding. */ |
| #define DECL_PADDING_P(NODE) \ |
|