| /* Definitions for -*- C++ -*- parsing and type checking. |
| Copyright (C) 1987-2021 Free Software Foundation, Inc. |
| Contributed by Michael Tiemann (tiemann@cygnus.com) |
| |
| 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_CP_TREE_H |
| #define GCC_CP_TREE_H |
| |
| #include "tm.h" |
| #include "hard-reg-set.h" |
| #include "function.h" |
| |
| /* In order for the format checking to accept the C++ front end |
| diagnostic framework extensions, you must include this file before |
| diagnostic-core.h, not after. We override the definition of GCC_DIAG_STYLE |
| in c-common.h. */ |
| #undef GCC_DIAG_STYLE |
| #define GCC_DIAG_STYLE __gcc_cxxdiag__ |
| #if defined(GCC_DIAGNOSTIC_CORE_H) || defined (GCC_C_COMMON_H) |
| #error \ |
| In order for the format checking to accept the C++ front end diagnostic \ |
| framework extensions, you must include this file before diagnostic-core.h and \ |
| c-common.h, not after. |
| #endif |
| #include "c-family/c-common.h" |
| #include "diagnostic.h" |
| |
| /* A tree node, together with a location, so that we can track locations |
| (and ranges) during parsing. |
| |
| The location is redundant for node kinds that have locations, |
| but not all node kinds do (e.g. constants, and references to |
| params, locals, etc), so we stash a copy here. */ |
| |
| extern location_t cp_expr_location (const_tree); |
| |
| class cp_expr |
| { |
| public: |
| cp_expr () : |
| m_value (NULL), m_loc (UNKNOWN_LOCATION) {} |
| |
| cp_expr (tree value) : |
| m_value (value), m_loc (cp_expr_location (m_value)) {} |
| |
| cp_expr (tree value, location_t loc): |
| m_value (value), m_loc (loc) |
| { |
| protected_set_expr_location (value, loc); |
| } |
| |
| /* Implicit conversions to tree. */ |
| operator tree () const { return m_value; } |
| tree & operator* () { return m_value; } |
| tree operator* () const { return m_value; } |
| tree & operator-> () { return m_value; } |
| tree operator-> () const { return m_value; } |
| |
| tree get_value () const { return m_value; } |
| location_t get_location () const { return m_loc; } |
| location_t get_start () const |
| { |
| source_range src_range = get_range_from_loc (line_table, m_loc); |
| return src_range.m_start; |
| } |
| location_t get_finish () const |
| { |
| source_range src_range = get_range_from_loc (line_table, m_loc); |
| return src_range.m_finish; |
| } |
| |
| void set_location (location_t loc) |
| { |
| protected_set_expr_location (m_value, loc); |
| m_loc = loc; |
| } |
| |
| void set_range (location_t start, location_t finish) |
| { |
| set_location (make_location (m_loc, start, finish)); |
| } |
| |
| cp_expr& maybe_add_location_wrapper () |
| { |
| m_value = maybe_wrap_with_location (m_value, m_loc); |
| return *this; |
| } |
| |
| private: |
| tree m_value; |
| location_t m_loc; |
| }; |
| |
| inline bool |
| operator == (const cp_expr &lhs, tree rhs) |
| { |
| return lhs.get_value () == rhs; |
| } |
| |
| |
| enum cp_tree_index |
| { |
| CPTI_WCHAR_DECL, |
| CPTI_VTABLE_ENTRY_TYPE, |
| CPTI_DELTA_TYPE, |
| CPTI_VTABLE_INDEX_TYPE, |
| CPTI_CLEANUP_TYPE, |
| CPTI_VTT_PARM_TYPE, |
| |
| CPTI_CLASS_TYPE, |
| CPTI_UNKNOWN_TYPE, |
| CPTI_INIT_LIST_TYPE, |
| CPTI_EXPLICIT_VOID_LIST, |
| CPTI_VTBL_TYPE, |
| CPTI_VTBL_PTR_TYPE, |
| CPTI_GLOBAL, |
| CPTI_ABORT_FNDECL, |
| CPTI_AGGR_TAG, |
| CPTI_CONV_OP_MARKER, |
| |
| CPTI_CTOR_IDENTIFIER, |
| CPTI_COMPLETE_CTOR_IDENTIFIER, |
| CPTI_BASE_CTOR_IDENTIFIER, |
| CPTI_DTOR_IDENTIFIER, |
| CPTI_COMPLETE_DTOR_IDENTIFIER, |
| CPTI_BASE_DTOR_IDENTIFIER, |
| CPTI_DELETING_DTOR_IDENTIFIER, |
| CPTI_CONV_OP_IDENTIFIER, |
| CPTI_DELTA_IDENTIFIER, |
| CPTI_IN_CHARGE_IDENTIFIER, |
| CPTI_VTT_PARM_IDENTIFIER, |
| CPTI_AS_BASE_IDENTIFIER, |
| CPTI_THIS_IDENTIFIER, |
| CPTI_PFN_IDENTIFIER, |
| CPTI_VPTR_IDENTIFIER, |
| CPTI_GLOBAL_IDENTIFIER, |
| CPTI_ANON_IDENTIFIER, |
| CPTI_AUTO_IDENTIFIER, |
| CPTI_DECLTYPE_AUTO_IDENTIFIER, |
| CPTI_INIT_LIST_IDENTIFIER, |
| CPTI_FOR_RANGE__IDENTIFIER, |
| CPTI_FOR_BEGIN__IDENTIFIER, |
| CPTI_FOR_END__IDENTIFIER, |
| CPTI_FOR_RANGE_IDENTIFIER, |
| CPTI_FOR_BEGIN_IDENTIFIER, |
| CPTI_FOR_END_IDENTIFIER, |
| CPTI_ABI_TAG_IDENTIFIER, |
| CPTI_ALIGNED_IDENTIFIER, |
| CPTI_BEGIN_IDENTIFIER, |
| CPTI_END_IDENTIFIER, |
| CPTI_GET_IDENTIFIER, |
| CPTI_GNU_IDENTIFIER, |
| CPTI_TUPLE_ELEMENT_IDENTIFIER, |
| CPTI_TUPLE_SIZE_IDENTIFIER, |
| CPTI_TYPE_IDENTIFIER, |
| CPTI_VALUE_IDENTIFIER, |
| CPTI_FUN_IDENTIFIER, |
| CPTI_CLOSURE_IDENTIFIER, |
| CPTI_HEAP_UNINIT_IDENTIFIER, |
| CPTI_HEAP_IDENTIFIER, |
| CPTI_HEAP_DELETED_IDENTIFIER, |
| CPTI_HEAP_VEC_UNINIT_IDENTIFIER, |
| CPTI_HEAP_VEC_IDENTIFIER, |
| CPTI_OMP_IDENTIFIER, |
| |
| CPTI_LANG_NAME_C, |
| CPTI_LANG_NAME_CPLUSPLUS, |
| |
| CPTI_EMPTY_EXCEPT_SPEC, |
| CPTI_NOEXCEPT_TRUE_SPEC, |
| CPTI_NOEXCEPT_FALSE_SPEC, |
| CPTI_NOEXCEPT_DEFERRED_SPEC, |
| |
| CPTI_NULLPTR, |
| CPTI_NULLPTR_TYPE, |
| |
| CPTI_ANY_TARG, |
| |
| CPTI_MODULE_HWM, |
| /* Nodes after here change during compilation, or should not be in |
| the module's global tree table. Such nodes must be locatable |
| via name lookup or type-construction, as those are the only |
| cross-TU matching capabilities remaining. */ |
| |
| /* We must find these via the global namespace. */ |
| CPTI_STD, |
| CPTI_ABI, |
| |
| /* These are created at init time, but the library/headers provide |
| definitions. */ |
| CPTI_ALIGN_TYPE, |
| CPTI_TERMINATE_FN, |
| CPTI_CALL_UNEXPECTED_FN, |
| |
| /* These are lazily inited. */ |
| CPTI_CONST_TYPE_INFO_TYPE, |
| CPTI_GET_EXCEPTION_PTR_FN, |
| CPTI_BEGIN_CATCH_FN, |
| CPTI_END_CATCH_FN, |
| CPTI_ALLOCATE_EXCEPTION_FN, |
| CPTI_FREE_EXCEPTION_FN, |
| CPTI_THROW_FN, |
| CPTI_RETHROW_FN, |
| CPTI_ATEXIT_FN_PTR_TYPE, |
| CPTI_ATEXIT, |
| CPTI_DSO_HANDLE, |
| CPTI_DCAST, |
| |
| CPTI_SOURCE_LOCATION_IMPL, |
| |
| CPTI_FALLBACK_DFLOAT32_TYPE, |
| CPTI_FALLBACK_DFLOAT64_TYPE, |
| CPTI_FALLBACK_DFLOAT128_TYPE, |
| |
| CPTI_MAX |
| }; |
| |
| extern GTY(()) tree cp_global_trees[CPTI_MAX]; |
| |
| #define wchar_decl_node cp_global_trees[CPTI_WCHAR_DECL] |
| #define vtable_entry_type cp_global_trees[CPTI_VTABLE_ENTRY_TYPE] |
| /* The type used to represent an offset by which to adjust the `this' |
| pointer in pointer-to-member types. */ |
| #define delta_type_node cp_global_trees[CPTI_DELTA_TYPE] |
| /* The type used to represent an index into the vtable. */ |
| #define vtable_index_type cp_global_trees[CPTI_VTABLE_INDEX_TYPE] |
| |
| #define class_type_node cp_global_trees[CPTI_CLASS_TYPE] |
| #define unknown_type_node cp_global_trees[CPTI_UNKNOWN_TYPE] |
| #define init_list_type_node cp_global_trees[CPTI_INIT_LIST_TYPE] |
| #define explicit_void_list_node cp_global_trees[CPTI_EXPLICIT_VOID_LIST] |
| #define vtbl_type_node cp_global_trees[CPTI_VTBL_TYPE] |
| #define vtbl_ptr_type_node cp_global_trees[CPTI_VTBL_PTR_TYPE] |
| #define std_node cp_global_trees[CPTI_STD] |
| #define abi_node cp_global_trees[CPTI_ABI] |
| #define global_namespace cp_global_trees[CPTI_GLOBAL] |
| #define const_type_info_type_node cp_global_trees[CPTI_CONST_TYPE_INFO_TYPE] |
| #define conv_op_marker cp_global_trees[CPTI_CONV_OP_MARKER] |
| #define abort_fndecl cp_global_trees[CPTI_ABORT_FNDECL] |
| #define current_aggr cp_global_trees[CPTI_AGGR_TAG] |
| #define nullptr_node cp_global_trees[CPTI_NULLPTR] |
| #define nullptr_type_node cp_global_trees[CPTI_NULLPTR_TYPE] |
| /* std::align_val_t */ |
| #define align_type_node cp_global_trees[CPTI_ALIGN_TYPE] |
| |
| /* We cache these tree nodes so as to call get_identifier less frequently. |
| For identifiers for functions, including special member functions such |
| as ctors and assignment operators, the nodes can be used (among other |
| things) to iterate over their overloads defined by/for a type. For |
| example: |
| |
| tree ovlid = assign_op_identifier; |
| tree overloads = get_class_binding (type, ovlid); |
| for (ovl_iterator it (overloads); it; ++it) { ... } |
| |
| iterates over the set of implicitly and explicitly defined overloads |
| of the assignment operator for type (including the copy and move |
| assignment operators, whether deleted or not). */ |
| |
| /* The name of a constructor that takes an in-charge parameter to |
| decide whether or not to construct virtual base classes. */ |
| #define ctor_identifier cp_global_trees[CPTI_CTOR_IDENTIFIER] |
| /* The name of a constructor that constructs virtual base classes. */ |
| #define complete_ctor_identifier cp_global_trees[CPTI_COMPLETE_CTOR_IDENTIFIER] |
| /* The name of a constructor that does not construct virtual base classes. */ |
| #define base_ctor_identifier cp_global_trees[CPTI_BASE_CTOR_IDENTIFIER] |
| /* The name of a destructor that takes an in-charge parameter to |
| decide whether or not to destroy virtual base classes and whether |
| or not to delete the object. */ |
| #define dtor_identifier cp_global_trees[CPTI_DTOR_IDENTIFIER] |
| /* The name of a destructor that destroys virtual base classes. */ |
| #define complete_dtor_identifier cp_global_trees[CPTI_COMPLETE_DTOR_IDENTIFIER] |
| /* The name of a destructor that does not destroy virtual base |
| classes. */ |
| #define base_dtor_identifier cp_global_trees[CPTI_BASE_DTOR_IDENTIFIER] |
| /* The name of a destructor that destroys virtual base classes, and |
| then deletes the entire object. */ |
| #define deleting_dtor_identifier cp_global_trees[CPTI_DELETING_DTOR_IDENTIFIER] |
| |
| /* The name used for conversion operators -- but note that actual |
| conversion functions use special identifiers outside the identifier |
| table. */ |
| #define conv_op_identifier cp_global_trees[CPTI_CONV_OP_IDENTIFIER] |
| |
| #define delta_identifier cp_global_trees[CPTI_DELTA_IDENTIFIER] |
| #define in_charge_identifier cp_global_trees[CPTI_IN_CHARGE_IDENTIFIER] |
| /* The name of the parameter that contains a pointer to the VTT to use |
| for this subobject constructor or destructor. */ |
| #define vtt_parm_identifier cp_global_trees[CPTI_VTT_PARM_IDENTIFIER] |
| #define as_base_identifier cp_global_trees[CPTI_AS_BASE_IDENTIFIER] |
| #define this_identifier cp_global_trees[CPTI_THIS_IDENTIFIER] |
| #define pfn_identifier cp_global_trees[CPTI_PFN_IDENTIFIER] |
| #define vptr_identifier cp_global_trees[CPTI_VPTR_IDENTIFIER] |
| /* The name of the ::, std & anon namespaces. */ |
| #define global_identifier cp_global_trees[CPTI_GLOBAL_IDENTIFIER] |
| #define anon_identifier cp_global_trees[CPTI_ANON_IDENTIFIER] |
| /* auto and declspec(auto) identifiers. */ |
| #define auto_identifier cp_global_trees[CPTI_AUTO_IDENTIFIER] |
| #define decltype_auto_identifier cp_global_trees[CPTI_DECLTYPE_AUTO_IDENTIFIER] |
| #define init_list_identifier cp_global_trees[CPTI_INIT_LIST_IDENTIFIER] |
| #define for_range__identifier cp_global_trees[CPTI_FOR_RANGE__IDENTIFIER] |
| #define for_begin__identifier cp_global_trees[CPTI_FOR_BEGIN__IDENTIFIER] |
| #define for_end__identifier cp_global_trees[CPTI_FOR_END__IDENTIFIER] |
| #define for_range_identifier cp_global_trees[CPTI_FOR_RANGE_IDENTIFIER] |
| #define for_begin_identifier cp_global_trees[CPTI_FOR_BEGIN_IDENTIFIER] |
| #define for_end_identifier cp_global_trees[CPTI_FOR_END_IDENTIFIER] |
| #define abi_tag_identifier cp_global_trees[CPTI_ABI_TAG_IDENTIFIER] |
| #define aligned_identifier cp_global_trees[CPTI_ALIGNED_IDENTIFIER] |
| #define begin_identifier cp_global_trees[CPTI_BEGIN_IDENTIFIER] |
| #define end_identifier cp_global_trees[CPTI_END_IDENTIFIER] |
| #define get__identifier cp_global_trees[CPTI_GET_IDENTIFIER] |
| #define gnu_identifier cp_global_trees[CPTI_GNU_IDENTIFIER] |
| #define tuple_element_identifier cp_global_trees[CPTI_TUPLE_ELEMENT_IDENTIFIER] |
| #define tuple_size_identifier cp_global_trees[CPTI_TUPLE_SIZE_IDENTIFIER] |
| #define type_identifier cp_global_trees[CPTI_TYPE_IDENTIFIER] |
| #define value_identifier cp_global_trees[CPTI_VALUE_IDENTIFIER] |
| #define fun_identifier cp_global_trees[CPTI_FUN_IDENTIFIER] |
| #define closure_identifier cp_global_trees[CPTI_CLOSURE_IDENTIFIER] |
| #define heap_uninit_identifier cp_global_trees[CPTI_HEAP_UNINIT_IDENTIFIER] |
| #define heap_identifier cp_global_trees[CPTI_HEAP_IDENTIFIER] |
| #define heap_deleted_identifier cp_global_trees[CPTI_HEAP_DELETED_IDENTIFIER] |
| #define heap_vec_uninit_identifier cp_global_trees[CPTI_HEAP_VEC_UNINIT_IDENTIFIER] |
| #define heap_vec_identifier cp_global_trees[CPTI_HEAP_VEC_IDENTIFIER] |
| #define omp_identifier cp_global_trees[CPTI_OMP_IDENTIFIER] |
| #define lang_name_c cp_global_trees[CPTI_LANG_NAME_C] |
| #define lang_name_cplusplus cp_global_trees[CPTI_LANG_NAME_CPLUSPLUS] |
| |
| /* Exception specifiers used for throw(), noexcept(true), |
| noexcept(false) and deferred noexcept. We rely on these being |
| uncloned. */ |
| #define empty_except_spec cp_global_trees[CPTI_EMPTY_EXCEPT_SPEC] |
| #define noexcept_true_spec cp_global_trees[CPTI_NOEXCEPT_TRUE_SPEC] |
| #define noexcept_false_spec cp_global_trees[CPTI_NOEXCEPT_FALSE_SPEC] |
| #define noexcept_deferred_spec cp_global_trees[CPTI_NOEXCEPT_DEFERRED_SPEC] |
| |
| /* Exception handling function declarations. */ |
| #define terminate_fn cp_global_trees[CPTI_TERMINATE_FN] |
| #define call_unexpected_fn cp_global_trees[CPTI_CALL_UNEXPECTED_FN] |
| #define get_exception_ptr_fn cp_global_trees[CPTI_GET_EXCEPTION_PTR_FN] |
| #define begin_catch_fn cp_global_trees[CPTI_BEGIN_CATCH_FN] |
| #define end_catch_fn cp_global_trees[CPTI_END_CATCH_FN] |
| #define allocate_exception_fn cp_global_trees[CPTI_ALLOCATE_EXCEPTION_FN] |
| #define free_exception_fn cp_global_trees[CPTI_FREE_EXCEPTION_FN] |
| #define throw_fn cp_global_trees[CPTI_THROW_FN] |
| #define rethrow_fn cp_global_trees[CPTI_RETHROW_FN] |
| |
| /* The type of the function-pointer argument to "__cxa_atexit" (or |
| "std::atexit", if "__cxa_atexit" is not being used). */ |
| #define atexit_fn_ptr_type_node cp_global_trees[CPTI_ATEXIT_FN_PTR_TYPE] |
| |
| /* A pointer to `std::atexit'. */ |
| #define atexit_node cp_global_trees[CPTI_ATEXIT] |
| |
| /* A pointer to `__dso_handle'. */ |
| #define dso_handle_node cp_global_trees[CPTI_DSO_HANDLE] |
| |
| /* The declaration of the dynamic_cast runtime. */ |
| #define dynamic_cast_node cp_global_trees[CPTI_DCAST] |
| |
| /* The type of a destructor. */ |
| #define cleanup_type cp_global_trees[CPTI_CLEANUP_TYPE] |
| |
| /* The type of the vtt parameter passed to subobject constructors and |
| destructors. */ |
| #define vtt_parm_type cp_global_trees[CPTI_VTT_PARM_TYPE] |
| |
| /* A node which matches any template argument. */ |
| #define any_targ_node cp_global_trees[CPTI_ANY_TARG] |
| |
| /* std::source_location::__impl class. */ |
| #define source_location_impl cp_global_trees[CPTI_SOURCE_LOCATION_IMPL] |
| |
| /* Node to indicate default access. This must be distinct from the |
| access nodes in tree.h. */ |
| |
| #define access_default_node null_node |
| |
| /* Variant of dfloat{32,64,128}_type_node only used for fundamental |
| rtti purposes if DFP is disabled. */ |
| #define fallback_dfloat32_type cp_global_trees[CPTI_FALLBACK_DFLOAT32_TYPE] |
| #define fallback_dfloat64_type cp_global_trees[CPTI_FALLBACK_DFLOAT64_TYPE] |
| #define fallback_dfloat128_type cp_global_trees[CPTI_FALLBACK_DFLOAT128_TYPE] |
| |
| |
| #include "name-lookup.h" |
| |
| /* Usage of TREE_LANG_FLAG_?: |
| 0: IDENTIFIER_KIND_BIT_0 (in IDENTIFIER_NODE) |
| NEW_EXPR_USE_GLOBAL (in NEW_EXPR). |
| COND_EXPR_IS_VEC_DELETE (in COND_EXPR). |
| DELETE_EXPR_USE_GLOBAL (in DELETE_EXPR). |
| COMPOUND_EXPR_OVERLOADED (in COMPOUND_EXPR). |
| CLEANUP_P (in TRY_BLOCK) |
| AGGR_INIT_VIA_CTOR_P (in AGGR_INIT_EXPR) |
| PTRMEM_OK_P (in ADDR_EXPR, OFFSET_REF, SCOPE_REF) |
| PAREN_STRING_LITERAL_P (in STRING_CST) |
| CP_DECL_THREAD_LOCAL_P (in VAR_DECL) |
| KOENIG_LOOKUP_P (in CALL_EXPR) |
| STATEMENT_LIST_NO_SCOPE (in STATEMENT_LIST). |
| EXPR_STMT_STMT_EXPR_RESULT (in EXPR_STMT) |
| STMT_EXPR_NO_SCOPE (in STMT_EXPR) |
| BIND_EXPR_TRY_BLOCK (in BIND_EXPR) |
| TYPENAME_IS_ENUM_P (in TYPENAME_TYPE) |
| OMP_FOR_GIMPLIFYING_P (in OMP_FOR, OMP_SIMD, OMP_DISTRIBUTE, |
| and OMP_TASKLOOP) |
| BASELINK_QUALIFIED_P (in BASELINK) |
| TARGET_EXPR_IMPLICIT_P (in TARGET_EXPR) |
| TEMPLATE_PARM_PARAMETER_PACK (in TEMPLATE_PARM_INDEX) |
| ATTR_IS_DEPENDENT (in the TREE_LIST for an attribute) |
| ABI_TAG_IMPLICIT (in the TREE_LIST for the argument of abi_tag) |
| LAMBDA_CAPTURE_EXPLICIT_P (in a TREE_LIST in LAMBDA_EXPR_CAPTURE_LIST) |
| PARENTHESIZED_LIST_P (in the TREE_LIST for a parameter-declaration-list) |
| CONSTRUCTOR_IS_DIRECT_INIT (in CONSTRUCTOR) |
| LAMBDA_EXPR_CAPTURES_THIS_P (in LAMBDA_EXPR) |
| DECLTYPE_FOR_LAMBDA_CAPTURE (in DECLTYPE_TYPE) |
| VEC_INIT_EXPR_IS_CONSTEXPR (in VEC_INIT_EXPR) |
| DECL_OVERRIDE_P (in FUNCTION_DECL) |
| IMPLICIT_CONV_EXPR_DIRECT_INIT (in IMPLICIT_CONV_EXPR) |
| TRANSACTION_EXPR_IS_STMT (in TRANSACTION_EXPR) |
| CONVERT_EXPR_VBASE_PATH (in CONVERT_EXPR) |
| PACK_EXPANSION_LOCAL_P (in *_PACK_EXPANSION) |
| TINFO_HAS_ACCESS_ERRORS (in TEMPLATE_INFO) |
| SIZEOF_EXPR_TYPE_P (in SIZEOF_EXPR) |
| COMPOUND_REQ_NOEXCEPT_P (in COMPOUND_REQ) |
| WILDCARD_PACK_P (in WILDCARD_DECL) |
| BLOCK_OUTER_CURLY_BRACE_P (in BLOCK) |
| FOLD_EXPR_MODOP_P (*_FOLD_EXPR) |
| IF_STMT_CONSTEXPR_P (IF_STMT) |
| DECL_NAMESPACE_INLINE_P (in NAMESPACE_DECL) |
| SWITCH_STMT_ALL_CASES_P (in SWITCH_STMT) |
| REINTERPRET_CAST_P (in NOP_EXPR) |
| ALIGNOF_EXPR_STD_P (in ALIGNOF_EXPR) |
| OVL_DEDUP_P (in OVERLOAD) |
| ATOMIC_CONSTR_MAP_INSTANTIATED_P (in ATOMIC_CONSTR) |
| 1: IDENTIFIER_KIND_BIT_1 (in IDENTIFIER_NODE) |
| TI_PENDING_TEMPLATE_FLAG. |
| TEMPLATE_PARMS_FOR_INLINE. |
| DELETE_EXPR_USE_VEC (in DELETE_EXPR). |
| (TREE_CALLS_NEW) (in _EXPR or _REF) (commented-out). |
| ICS_ELLIPSIS_FLAG (in _CONV) |
| DECL_INITIALIZED_P (in VAR_DECL) |
| TYPENAME_IS_CLASS_P (in TYPENAME_TYPE) |
| STMT_IS_FULL_EXPR_P (in _STMT) |
| TARGET_EXPR_LIST_INIT_P (in TARGET_EXPR) |
| LAMBDA_EXPR_MUTABLE_P (in LAMBDA_EXPR) |
| DECL_FINAL_P (in FUNCTION_DECL) |
| QUALIFIED_NAME_IS_TEMPLATE (in SCOPE_REF) |
| CONSTRUCTOR_IS_DEPENDENT (in CONSTRUCTOR) |
| TINFO_USED_TEMPLATE_ID (in TEMPLATE_INFO) |
| PACK_EXPANSION_SIZEOF_P (in *_PACK_EXPANSION) |
| OVL_USING_P (in OVERLOAD) |
| IMPLICIT_CONV_EXPR_NONTYPE_ARG (in IMPLICIT_CONV_EXPR) |
| 2: IDENTIFIER_KIND_BIT_2 (in IDENTIFIER_NODE) |
| ICS_THIS_FLAG (in _CONV) |
| DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (in VAR_DECL) |
| STATEMENT_LIST_TRY_BLOCK (in STATEMENT_LIST) |
| TYPENAME_IS_RESOLVING_P (in TYPENAME_TYPE) |
| TARGET_EXPR_DIRECT_INIT_P (in TARGET_EXPR) |
| FNDECL_USED_AUTO (in FUNCTION_DECL) |
| DECLTYPE_FOR_LAMBDA_PROXY (in DECLTYPE_TYPE) |
| REF_PARENTHESIZED_P (in COMPONENT_REF, INDIRECT_REF, SCOPE_REF, VIEW_CONVERT_EXPR) |
| AGGR_INIT_ZERO_FIRST (in AGGR_INIT_EXPR) |
| CONSTRUCTOR_MUTABLE_POISON (in CONSTRUCTOR) |
| OVL_HIDDEN_P (in OVERLOAD) |
| IF_STMT_CONSTEVAL_P (in IF_STMT) |
| SWITCH_STMT_NO_BREAK_P (in SWITCH_STMT) |
| LAMBDA_EXPR_CAPTURE_OPTIMIZED (in LAMBDA_EXPR) |
| IMPLICIT_CONV_EXPR_BRACED_INIT (in IMPLICIT_CONV_EXPR) |
| PACK_EXPANSION_AUTO_P (in *_PACK_EXPANSION) |
| 3: IMPLICIT_RVALUE_P (in NON_LVALUE_EXPR or STATIC_CAST_EXPR) |
| ICS_BAD_FLAG (in _CONV) |
| FN_TRY_BLOCK_P (in TRY_BLOCK) |
| BIND_EXPR_BODY_BLOCK (in BIND_EXPR) |
| CALL_EXPR_ORDERED_ARGS (in CALL_EXPR, AGGR_INIT_EXPR) |
| DECLTYPE_FOR_REF_CAPTURE (in DECLTYPE_TYPE) |
| CONSTRUCTOR_C99_COMPOUND_LITERAL (in CONSTRUCTOR) |
| OVL_NESTED_P (in OVERLOAD) |
| DECL_MODULE_EXPORT_P (in _DECL) |
| PACK_EXPANSION_FORCE_EXTRA_ARGS_P (in *_PACK_EXPANSION) |
| 4: IDENTIFIER_MARKED (IDENTIFIER_NODEs) |
| TREE_HAS_CONSTRUCTOR (in INDIRECT_REF, SAVE_EXPR, CONSTRUCTOR, |
| CALL_EXPR, or FIELD_DECL). |
| DECL_TINFO_P (in VAR_DECL, TYPE_DECL) |
| FUNCTION_REF_QUALIFIED (in FUNCTION_TYPE, METHOD_TYPE) |
| OVL_LOOKUP_P (in OVERLOAD) |
| LOOKUP_FOUND_P (in RECORD_TYPE, UNION_TYPE, ENUMERAL_TYPE, NAMESPACE_DECL) |
| FNDECL_MANIFESTLY_CONST_EVALUATED (in FUNCTION_DECL) |
| 5: IDENTIFIER_VIRTUAL_P (in IDENTIFIER_NODE) |
| FUNCTION_RVALUE_QUALIFIED (in FUNCTION_TYPE, METHOD_TYPE) |
| CALL_EXPR_REVERSE_ARGS (in CALL_EXPR, AGGR_INIT_EXPR) |
| CONSTRUCTOR_PLACEHOLDER_BOUNDARY (in CONSTRUCTOR) |
| OVL_EXPORT_P (in OVERLOAD) |
| 6: TYPE_MARKED_P (in _TYPE) |
| DECL_NONTRIVIALLY_INITIALIZED_P (in VAR_DECL) |
| RANGE_FOR_IVDEP (in RANGE_FOR_STMT) |
| CALL_EXPR_OPERATOR_SYNTAX (in CALL_EXPR, AGGR_INIT_EXPR) |
| CONSTRUCTOR_IS_DESIGNATED_INIT (in CONSTRUCTOR) |
| |
| Usage of TYPE_LANG_FLAG_?: |
| 0: TYPE_DEPENDENT_P |
| 1: TYPE_HAS_USER_CONSTRUCTOR. |
| 2: TYPE_HAS_LATE_RETURN_TYPE (in FUNCTION_TYPE, METHOD_TYPE) |
| TYPE_PTRMEMFUNC_FLAG (in RECORD_TYPE) |
| 4: TYPE_HAS_NONTRIVIAL_DESTRUCTOR |
| 5: CLASS_TYPE_P (in RECORD_TYPE and UNION_TYPE) |
| ENUM_FIXED_UNDERLYING_TYPE_P (in ENUMERAL_TYPE) |
| AUTO_IS_DECLTYPE (in TEMPLATE_TYPE_PARM) |
| 6: TYPE_DEPENDENT_P_VALID |
| |
| Usage of DECL_LANG_FLAG_?: |
| 0: DECL_TEMPLATE_PARM_P (in PARM_DECL, CONST_DECL, TYPE_DECL, or TEMPLATE_DECL) |
| DECL_LOCAL_DECL_P (in FUNCTION_DECL, VAR_DECL) |
| DECL_MUTABLE_P (in FIELD_DECL) |
| DECL_DEPENDENT_P (in USING_DECL) |
| LABEL_DECL_BREAK (in LABEL_DECL) |
| 1: C_TYPEDEF_EXPLICITLY_SIGNED (in TYPE_DECL). |
| DECL_TEMPLATE_INSTANTIATED (in a VAR_DECL or a FUNCTION_DECL) |
| DECL_MEMBER_TEMPLATE_P (in TEMPLATE_DECL) |
| USING_DECL_TYPENAME_P (in USING_DECL) |
| DECL_VLA_CAPTURE_P (in FIELD_DECL) |
| DECL_ARRAY_PARAMETER_P (in PARM_DECL) |
| LABEL_DECL_CONTINUE (in LABEL_DECL) |
| 2: DECL_THIS_EXTERN (in VAR_DECL, FUNCTION_DECL or PARM_DECL) |
| DECL_IMPLICIT_TYPEDEF_P (in a TYPE_DECL) |
| DECL_CONSTRAINT_VAR_P (in a PARM_DECL) |
| TEMPLATE_DECL_COMPLEX_ALIAS_P (in TEMPLATE_DECL) |
| DECL_INSTANTIATING_NSDMI_P (in a FIELD_DECL) |
| LABEL_DECL_CDTOR (in LABEL_DECL) |
| USING_DECL_UNRELATED_P (in USING_DECL) |
| 3: DECL_IN_AGGR_P. |
| 4: DECL_C_BIT_FIELD (in a FIELD_DECL) |
| DECL_ANON_UNION_VAR_P (in a VAR_DECL) |
| DECL_SELF_REFERENCE_P (in a TYPE_DECL) |
| DECL_INVALID_OVERRIDER_P (in a FUNCTION_DECL) |
| DECL_UNINSTANIATED_TEMPLATE_FRIEND_P (in TEMPLATE_DECL) |
| 5: DECL_INTERFACE_KNOWN. |
| 6: DECL_THIS_STATIC (in VAR_DECL, FUNCTION_DECL or PARM_DECL) |
| DECL_FIELD_IS_BASE (in FIELD_DECL) |
| TYPE_DECL_ALIAS_P (in TYPE_DECL) |
| 7: DECL_THUNK_P (in a member FUNCTION_DECL) |
| DECL_NORMAL_CAPTURE_P (in FIELD_DECL) |
| DECL_DECLARED_CONSTINIT_P (in VAR_DECL) |
| 8: DECL_DECLARED_CONSTEXPR_P (in VAR_DECL, FUNCTION_DECL) |
| |
| Usage of language-independent fields in a language-dependent manner: |
| |
| TYPE_ALIAS_SET |
| This field is used by TYPENAME_TYPEs, TEMPLATE_TYPE_PARMs, and so |
| forth as a substitute for the mark bits provided in `lang_type'. |
| At present, only the six low-order bits are used. |
| |
| TYPE_LANG_SLOT_1 |
| For a FUNCTION_TYPE or METHOD_TYPE, this is TYPE_RAISES_EXCEPTIONS. |
| For a POINTER_TYPE (to a METHOD_TYPE), this is TYPE_PTRMEMFUNC_TYPE. |
| For an ENUMERAL_TYPE, BOUND_TEMPLATE_TEMPLATE_PARM_TYPE, |
| RECORD_TYPE or UNION_TYPE this is TYPE_TEMPLATE_INFO, |
| |
| BINFO_VIRTUALS |
| For a binfo, this is a TREE_LIST. There is an entry for each |
| virtual function declared either in BINFO or its direct and |
| indirect primary bases. |
| |
| The BV_DELTA of each node gives the amount by which to adjust the |
| `this' pointer when calling the function. If the method is an |
| overridden version of a base class method, then it is assumed |
| that, prior to adjustment, the this pointer points to an object |
| of the base class. |
| |
| The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable |
| index of the vcall offset for this entry. |
| |
| The BV_FN is the declaration for the virtual function itself. |
| |
| If BV_LOST_PRIMARY is set, it means that this entry is for a lost |
| primary virtual base and can be left null in the vtable. |
| |
| BINFO_VTABLE |
| This is an expression with POINTER_TYPE that gives the value |
| to which the vptr should be initialized. Use get_vtbl_decl_for_binfo |
| to extract the VAR_DECL for the complete vtable. |
| |
| DECL_VINDEX |
| This field is NULL for a non-virtual function. For a virtual |
| function, it is eventually set to an INTEGER_CST indicating the |
| index in the vtable at which this function can be found. When |
| a virtual function is declared, but before it is known what |
| function is overridden, this field is the error_mark_node. |
| |
| Temporarily, it may be set to a TREE_LIST whose TREE_VALUE is |
| the virtual function this one overrides, and whose TREE_CHAIN is |
| the old DECL_VINDEX. */ |
| |
| /* Language-specific tree checkers. */ |
| |
| #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \ |
| TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL) |
| |
| #define TYPE_FUNCTION_OR_TEMPLATE_DECL_CHECK(NODE) \ |
| TREE_CHECK3(NODE,TYPE_DECL,TEMPLATE_DECL,FUNCTION_DECL) |
| |
| #define TYPE_FUNCTION_OR_TEMPLATE_DECL_P(NODE) \ |
| (TREE_CODE (NODE) == TYPE_DECL || TREE_CODE (NODE) == TEMPLATE_DECL \ |
| || TREE_CODE (NODE) == FUNCTION_DECL) |
| |
| #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \ |
| TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL) |
| |
| #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \ |
| TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL) |
| |
| #define VAR_TEMPL_TYPE_FIELD_OR_FUNCTION_DECL_CHECK(NODE) \ |
| TREE_CHECK5(NODE,VAR_DECL,FIELD_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL) |
| |
| #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \ |
| TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM) |
| |
| #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
| |
| /* Returns t iff the node can have a TEMPLATE_INFO field. */ |
| |
| inline tree |
| template_info_decl_check (const_tree t, const char* f, int l, const char* fn) |
| { |
| switch (TREE_CODE (t)) |
| { |
| case VAR_DECL: |
| case FUNCTION_DECL: |
| case FIELD_DECL: |
| case TYPE_DECL: |
| case CONCEPT_DECL: |
| case TEMPLATE_DECL: |
| return const_cast<tree>(t); |
| default: |
| break; |
| } |
| tree_check_failed (t, f, l, fn, |
| VAR_DECL, FUNCTION_DECL, FIELD_DECL, TYPE_DECL, |
| CONCEPT_DECL, TEMPLATE_DECL, 0); |
| gcc_unreachable (); |
| } |
| |
| #define TEMPLATE_INFO_DECL_CHECK(NODE) \ |
| template_info_decl_check ((NODE), __FILE__, __LINE__, __FUNCTION__) |
| |
| #define THUNK_FUNCTION_CHECK(NODE) __extension__ \ |
| ({ __typeof (NODE) const __t = (NODE); \ |
| if (TREE_CODE (__t) != FUNCTION_DECL || !__t->decl_common.lang_specific \ |
| || !__t->decl_common.lang_specific->u.fn.thunk_p) \ |
| tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, 0); \ |
| __t; }) |
| |
| #else /* ENABLE_TREE_CHECKING */ |
| |
| #define TEMPLATE_INFO_DECL_CHECK(NODE) (NODE) |
| #define THUNK_FUNCTION_CHECK(NODE) (NODE) |
| |
| #endif /* ENABLE_TREE_CHECKING */ |
| |
| /* Language-dependent contents of an identifier. */ |
| |
| struct GTY(()) lang_identifier { |
| struct c_common_identifier c_common; |
| cxx_binding *bindings; |
| }; |
| |
| /* Return a typed pointer version of T if it designates a |
| C++ front-end identifier. */ |
| inline lang_identifier* |
| identifier_p (tree t) |
| { |
| if (TREE_CODE (t) == IDENTIFIER_NODE) |
| return (lang_identifier*) t; |
| return NULL; |
| } |
| |
| #define LANG_IDENTIFIER_CAST(NODE) \ |
| ((struct lang_identifier*)IDENTIFIER_NODE_CHECK (NODE)) |
| |
| struct GTY(()) template_parm_index { |
| struct tree_common common; |
| int index; |
| int level; |
| int orig_level; |
| tree decl; |
| }; |
| |
| struct GTY(()) ptrmem_cst { |
| struct tree_common common; |
| tree member; |
| }; |
| typedef struct ptrmem_cst * ptrmem_cst_t; |
| |
| #define CLEANUP_P(NODE) TREE_LANG_FLAG_0 (TRY_BLOCK_CHECK (NODE)) |
| |
| #define BIND_EXPR_TRY_BLOCK(NODE) \ |
| TREE_LANG_FLAG_0 (BIND_EXPR_CHECK (NODE)) |
| |
| /* Used to mark the block around the member initializers and cleanups. */ |
| #define BIND_EXPR_BODY_BLOCK(NODE) \ |
| TREE_LANG_FLAG_3 (BIND_EXPR_CHECK (NODE)) |
| #define FUNCTION_NEEDS_BODY_BLOCK(NODE) \ |
| (DECL_CONSTRUCTOR_P (NODE) || DECL_DESTRUCTOR_P (NODE) \ |
| || LAMBDA_FUNCTION_P (NODE)) |
| |
| #define STATEMENT_LIST_NO_SCOPE(NODE) \ |
| TREE_LANG_FLAG_0 (STATEMENT_LIST_CHECK (NODE)) |
| #define STATEMENT_LIST_TRY_BLOCK(NODE) \ |
| TREE_LANG_FLAG_2 (STATEMENT_LIST_CHECK (NODE)) |
| |
| /* Mark the outer curly brace BLOCK. */ |
| #define BLOCK_OUTER_CURLY_BRACE_P(NODE) TREE_LANG_FLAG_0 (BLOCK_CHECK (NODE)) |
| |
| /* Nonzero if this statement should be considered a full-expression, |
| i.e., if temporaries created during this statement should have |
| their destructors run at the end of this statement. */ |
| #define STMT_IS_FULL_EXPR_P(NODE) TREE_LANG_FLAG_1 ((NODE)) |
| |
| /* Marks the result of a statement expression. */ |
| #define EXPR_STMT_STMT_EXPR_RESULT(NODE) \ |
| TREE_LANG_FLAG_0 (EXPR_STMT_CHECK (NODE)) |
| |
| /* Nonzero if this statement-expression does not have an associated scope. */ |
| #define STMT_EXPR_NO_SCOPE(NODE) \ |
| TREE_LANG_FLAG_0 (STMT_EXPR_CHECK (NODE)) |
| |
| #define COND_EXPR_IS_VEC_DELETE(NODE) \ |
| TREE_LANG_FLAG_0 (COND_EXPR_CHECK (NODE)) |
| |
| /* Nonzero if this NOP_EXPR is a reinterpret_cast. Such conversions |
| are not constexprs. Other NOP_EXPRs are. */ |
| #define REINTERPRET_CAST_P(NODE) \ |
| TREE_LANG_FLAG_0 (NOP_EXPR_CHECK (NODE)) |
| |
| /* Returns nonzero iff TYPE1 and TYPE2 are the same type, in the usual |
| sense of `same'. */ |
| #define same_type_p(TYPE1, TYPE2) \ |
| comptypes ((TYPE1), (TYPE2), COMPARE_STRICT) |
| |
| /* Returns nonzero iff NODE is a declaration for the global function |
| `main'. */ |
| #define DECL_MAIN_P(NODE) \ |
| (DECL_EXTERN_C_FUNCTION_P (NODE) \ |
| && DECL_NAME (NODE) != NULL_TREE \ |
| && MAIN_NAME_P (DECL_NAME (NODE)) \ |
| && flag_hosted) |
| |
| /* Lookup walker marking. */ |
| #define LOOKUP_SEEN_P(NODE) TREE_VISITED (NODE) |
| #define LOOKUP_FOUND_P(NODE) \ |
| TREE_LANG_FLAG_4 (TREE_CHECK4 (NODE,RECORD_TYPE,UNION_TYPE,ENUMERAL_TYPE,\ |
| NAMESPACE_DECL)) |
| |
| /* These two accessors should only be used by OVL manipulators. |
| Other users should use iterators and convenience functions. */ |
| #define OVL_FUNCTION(NODE) \ |
| (((struct tree_overload*)OVERLOAD_CHECK (NODE))->function) |
| #define OVL_CHAIN(NODE) \ |
| (((struct tree_overload*)OVERLOAD_CHECK (NODE))->common.chain) |
| |
| /* If set, this or a subsequent overload contains decls that need deduping. */ |
| #define OVL_DEDUP_P(NODE) TREE_LANG_FLAG_0 (OVERLOAD_CHECK (NODE)) |
| /* If set, this was imported in a using declaration. */ |
| #define OVL_USING_P(NODE) TREE_LANG_FLAG_1 (OVERLOAD_CHECK (NODE)) |
| /* If set, this overload is a hidden decl. */ |
| #define OVL_HIDDEN_P(NODE) TREE_LANG_FLAG_2 (OVERLOAD_CHECK (NODE)) |
| /* If set, this overload contains a nested overload. */ |
| #define OVL_NESTED_P(NODE) TREE_LANG_FLAG_3 (OVERLOAD_CHECK (NODE)) |
| /* If set, this overload was constructed during lookup. */ |
| #define OVL_LOOKUP_P(NODE) TREE_LANG_FLAG_4 (OVERLOAD_CHECK (NODE)) |
| /* If set, this OVL_USING_P overload is exported. */ |
| #define OVL_EXPORT_P(NODE) TREE_LANG_FLAG_5 (OVERLOAD_CHECK (NODE)) |
| |
| /* The first decl of an overload. */ |
| #define OVL_FIRST(NODE) ovl_first (NODE) |
| /* The name of the overload set. */ |
| #define OVL_NAME(NODE) DECL_NAME (OVL_FIRST (NODE)) |
| |
| /* Whether this is a set of overloaded functions. TEMPLATE_DECLS are |
| always wrapped in an OVERLOAD, so we don't need to check them |
| here. */ |
| #define OVL_P(NODE) \ |
| (TREE_CODE (NODE) == FUNCTION_DECL || TREE_CODE (NODE) == OVERLOAD) |
| /* Whether this is a single member overload. */ |
| #define OVL_SINGLE_P(NODE) \ |
| (TREE_CODE (NODE) != OVERLOAD || !OVL_CHAIN (NODE)) |
| |
| /* OVL_HIDDEN_P nodes come before other nodes. */ |
| |
| struct GTY(()) tree_overload { |
| struct tree_common common; |
| tree function; |
| }; |
| |
| /* Iterator for a 1 dimensional overload. Permits iterating over the |
| outer level of a 2-d overload when explicitly enabled. */ |
| |
| class ovl_iterator { |
| tree ovl; |
| const bool allow_inner; /* Only used when checking. */ |
| |
| public: |
| explicit ovl_iterator (tree o, bool allow = false) |
| : ovl (o), allow_inner (allow) |
| { |
| } |
| |
| public: |
| operator bool () const |
| { |
| return ovl; |
| } |
| ovl_iterator &operator++ () |
| { |
| ovl = TREE_CODE (ovl) != OVERLOAD ? NULL_TREE : OVL_CHAIN (ovl); |
| return *this; |
| } |
| tree operator* () const |
| { |
| tree fn = TREE_CODE (ovl) != OVERLOAD ? ovl : OVL_FUNCTION (ovl); |
| |
| /* Check this is not an unexpected 2-dimensional overload. */ |
| gcc_checking_assert (allow_inner || TREE_CODE (fn) != OVERLOAD); |
| |
| return fn; |
| } |
| bool operator== (const ovl_iterator &o) const |
| { |
| return ovl == o.ovl; |
| } |
| tree get_using () const |
| { |
| gcc_checking_assert (using_p ()); |
| return ovl; |
| } |
| |
| public: |
| /* Whether this overload was introduced by a using decl. */ |
| bool using_p () const |
| { |
| return (TREE_CODE (ovl) == USING_DECL |
| || (TREE_CODE (ovl) == OVERLOAD && OVL_USING_P (ovl))); |
| } |
| /* Whether this using is being exported. */ |
| bool exporting_p () const |
| { |
| return OVL_EXPORT_P (get_using ()); |
| } |
| |
| bool hidden_p () const |
| { |
| return TREE_CODE (ovl) == OVERLOAD && OVL_HIDDEN_P (ovl); |
| } |
| |
| public: |
| tree remove_node (tree head) |
| { |
| return remove_node (head, ovl); |
| } |
| tree reveal_node (tree head) |
| { |
| return reveal_node (head, ovl); |
| } |
| |
| protected: |
| /* If we have a nested overload, point at the inner overload and |
| return the next link on the outer one. */ |
| tree maybe_push () |
| { |
| tree r = NULL_TREE; |
| |
| if (ovl && TREE_CODE (ovl) == OVERLOAD && OVL_NESTED_P (ovl)) |
| { |
| r = OVL_CHAIN (ovl); |
| ovl = OVL_FUNCTION (ovl); |
| } |
| return r; |
| } |
| /* Restore an outer nested overload. */ |
| void pop (tree outer) |
| { |
| gcc_checking_assert (!ovl); |
| ovl = outer; |
| } |
| |
| private: |
| /* We make these static functions to avoid the address of the |
| iterator escaping the local context. */ |
| static tree remove_node (tree head, tree node); |
| static tree reveal_node (tree ovl, tree node); |
| }; |
| |
| /* Treat a tree as a range of ovl_iterator, e.g. |
| for (tree f : ovl_range (fns)) { ... } */ |
| |
| class ovl_range |
| { |
| tree t; |
| bool allow; |
| public: |
| explicit ovl_range (tree t, bool allow = false): t(t), allow(allow) { } |
| ovl_iterator begin() { return ovl_iterator (t, allow); } |
| ovl_iterator end() { return ovl_iterator (NULL_TREE, allow); } |
| }; |
| |
| /* Iterator over a (potentially) 2 dimensional overload, which is |
| produced by name lookup. */ |
| |
| class lkp_iterator : public ovl_iterator { |
| typedef ovl_iterator parent; |
| |
| tree outer; |
| |
| public: |
| explicit lkp_iterator (tree o) |
| : parent (o, true), outer (maybe_push ()) |
| { |
| } |
| |
| public: |
| lkp_iterator &operator++ () |
| { |
| bool repush = !outer; |
| |
| if (!parent::operator++ () && !repush) |
| { |
| pop (outer); |
| repush = true; |
| } |
| |
| if (repush) |
| outer = maybe_push (); |
| |
| return *this; |
| } |
| }; |
| |
| /* Treat a tree as a range of lkp_iterator, e.g. |
| for (tree f : lkp_range (fns)) { ... } */ |
| |
| class lkp_range |
| { |
| tree t; |
| public: |
| lkp_range (tree t): t(t) { } |
| lkp_iterator begin() { return lkp_iterator (t); } |
| lkp_iterator end() { return lkp_iterator (NULL_TREE); } |
| }; |
| |
| /* hash traits for declarations. Hashes potential overload sets via |
| DECL_NAME. */ |
| |
| struct named_decl_hash : ggc_remove <tree> { |
| typedef tree value_type; /* A DECL or OVERLOAD */ |
| typedef tree compare_type; /* An identifier. */ |
| |
| inline static hashval_t hash (const value_type decl); |
| inline static bool equal (const value_type existing, compare_type candidate); |
| |
| static const bool empty_zero_p = true; |
| static inline void mark_empty (value_type &p) {p = NULL_TREE;} |
| static inline bool is_empty (value_type p) {return !p;} |
| |
| /* Nothing is deletable. Everything is insertable. */ |
| static bool is_deleted (value_type) { return false; } |
| static void mark_deleted (value_type) { gcc_unreachable (); } |
| }; |
| |
| /* Simplified unique_ptr clone to release a tree vec on exit. */ |
| |
| class releasing_vec |
| { |
| public: |
| typedef vec<tree, va_gc> vec_t; |
| |
| releasing_vec (vec_t *v): v(v) { } |
| releasing_vec (): v(make_tree_vector ()) { } |
| |
| /* Copy ops are deliberately declared but not defined, |
| copies must always be elided. */ |
| releasing_vec (const releasing_vec &); |
| releasing_vec &operator= (const releasing_vec &); |
| |
| vec_t &operator* () const { return *v; } |
| vec_t *operator-> () const { return v; } |
| vec_t *get() const { return v; } |
| operator vec_t *() const { return v; } |
| vec_t ** operator& () { return &v; } |
| |
| /* Breaks pointer/value consistency for convenience. This takes ptrdiff_t |
| rather than unsigned to avoid ambiguity with the built-in operator[] |
| (bootstrap/91828). */ |
| tree& operator[] (ptrdiff_t i) const { return (*v)[i]; } |
| |
| ~releasing_vec() { release_tree_vector (v); } |
| private: |
| vec_t *v; |
| }; |
| /* Forwarding functions for vec_safe_* that might reallocate. */ |
| inline tree* vec_safe_push (releasing_vec& r, const tree &t CXX_MEM_STAT_INFO) |
| { return vec_safe_push (*&r, t PASS_MEM_STAT); } |
| inline bool vec_safe_reserve (releasing_vec& r, unsigned n, bool e = false CXX_MEM_STAT_INFO) |
| { return vec_safe_reserve (*&r, n, e PASS_MEM_STAT); } |
| inline unsigned vec_safe_length (releasing_vec &r) |
| { return r->length(); } |
| inline void vec_safe_splice (releasing_vec &r, vec<tree, va_gc> *p CXX_MEM_STAT_INFO) |
| { vec_safe_splice (*&r, p PASS_MEM_STAT); } |
| void release_tree_vector (releasing_vec &); // cause link error |
| |
| struct GTY(()) tree_template_decl { |
| struct tree_decl_common common; |
| tree arguments; |
| tree result; |
| }; |
| |
| /* Returns true iff NODE is a BASELINK. */ |
| #define BASELINK_P(NODE) \ |
| (TREE_CODE (NODE) == BASELINK) |
| /* The BINFO indicating the base in which lookup found the |
| BASELINK_FUNCTIONS. */ |
| #define BASELINK_BINFO(NODE) \ |
| (((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo) |
| /* The functions referred to by the BASELINK; either a FUNCTION_DECL, |
| a TEMPLATE_DECL, an OVERLOAD, or a TEMPLATE_ID_EXPR. */ |
| #define BASELINK_FUNCTIONS(NODE) \ |
| (((struct tree_baselink*) BASELINK_CHECK (NODE))->functions) |
| /* If T is a BASELINK, grab the functions, otherwise just T, which is |
| expected to already be a (list of) functions. */ |
| #define MAYBE_BASELINK_FUNCTIONS(T) \ |
| (BASELINK_P (T) ? BASELINK_FUNCTIONS (T) : T) |
| /* The BINFO in which the search for the functions indicated by this baselink |
| began. This base is used to determine the accessibility of functions |
| selected by overload resolution. */ |
| #define BASELINK_ACCESS_BINFO(NODE) \ |
| (((struct tree_baselink*) BASELINK_CHECK (NODE))->access_binfo) |
| /* For a type-conversion operator, the BASELINK_OPTYPE indicates the type |
| to which the conversion should occur. This value is important if |
| the BASELINK_FUNCTIONS include a template conversion operator -- |
| the BASELINK_OPTYPE can be used to determine what type the user |
| requested. */ |
| #define BASELINK_OPTYPE(NODE) \ |
| (TREE_CHAIN (BASELINK_CHECK (NODE))) |
| /* Nonzero if this baselink was from a qualified lookup. */ |
| #define BASELINK_QUALIFIED_P(NODE) \ |
| TREE_LANG_FLAG_0 (BASELINK_CHECK (NODE)) |
| |
| struct GTY(()) tree_baselink { |
| struct tree_common common; |
| tree binfo; |
| tree functions; |
| tree access_binfo; |
| }; |
| |
| /* The different kinds of ids that we encounter. */ |
| |
| enum cp_id_kind |
| { |
| /* Not an id at all. */ |
| CP_ID_KIND_NONE, |
| /* An unqualified-id that is not a template-id. */ |
| CP_ID_KIND_UNQUALIFIED, |
| /* An unqualified-id that is a dependent name. */ |
| CP_ID_KIND_UNQUALIFIED_DEPENDENT, |
| /* An unqualified template-id. */ |
| CP_ID_KIND_TEMPLATE_ID, |
| /* A qualified-id. */ |
| CP_ID_KIND_QUALIFIED |
| }; |
| |
| |
| /* The various kinds of C++0x warnings we encounter. */ |
| |
| enum cpp0x_warn_str |
| { |
| /* extended initializer lists */ |
| CPP0X_INITIALIZER_LISTS, |
| /* explicit conversion operators */ |
| CPP0X_EXPLICIT_CONVERSION, |
| /* variadic templates */ |
| CPP0X_VARIADIC_TEMPLATES, |
| /* lambda expressions */ |
| CPP0X_LAMBDA_EXPR, |
| /* C++0x auto */ |
| CPP0X_AUTO, |
| /* scoped enums */ |
| CPP0X_SCOPED_ENUMS, |
| /* defaulted and deleted functions */ |
| CPP0X_DEFAULTED_DELETED, |
| /* inline namespaces */ |
| CPP0X_INLINE_NAMESPACES, |
| /* override controls, override/final */ |
| CPP0X_OVERRIDE_CONTROLS, |
| /* non-static data member initializers */ |
| CPP0X_NSDMI, |
| /* user defined literals */ |
| CPP0X_USER_DEFINED_LITERALS, |
| /* delegating constructors */ |
| CPP0X_DELEGATING_CTORS, |
| /* inheriting constructors */ |
| CPP0X_INHERITING_CTORS, |
| /* C++11 attributes */ |
| CPP0X_ATTRIBUTES, |
| /* ref-qualified member functions */ |
| CPP0X_REF_QUALIFIER |
| }; |
| |
| /* The various kinds of operation used by composite_pointer_type. */ |
| |
| enum composite_pointer_operation |
| { |
| /* comparison */ |
| CPO_COMPARISON, |
| /* conversion */ |
| CPO_CONVERSION, |
| /* conditional expression */ |
| CPO_CONDITIONAL_EXPR |
| }; |
| |
| /* Possible cases of expression list used by build_x_compound_expr_from_list. */ |
| enum expr_list_kind { |
| ELK_INIT, /* initializer */ |
| ELK_MEM_INIT, /* member initializer */ |
| ELK_FUNC_CAST /* functional cast */ |
| }; |
| |
| /* Possible cases of implicit bad rhs conversions. */ |
| enum impl_conv_rhs { |
| ICR_DEFAULT_ARGUMENT, /* default argument */ |
| ICR_CONVERTING, /* converting */ |
| ICR_INIT, /* initialization */ |
| ICR_ARGPASS, /* argument passing */ |
| ICR_RETURN, /* return */ |
| ICR_ASSIGN /* assignment */ |
| }; |
| |
| /* Possible cases of implicit or explicit bad conversions to void. */ |
| enum impl_conv_void { |
| ICV_CAST, /* (explicit) conversion to void */ |
| ICV_SECOND_OF_COND, /* second operand of conditional expression */ |
| ICV_THIRD_OF_COND, /* third operand of conditional expression */ |
| ICV_RIGHT_OF_COMMA, /* right operand of comma operator */ |
| ICV_LEFT_OF_COMMA, /* left operand of comma operator */ |
| ICV_STATEMENT, /* statement */ |
| ICV_THIRD_IN_FOR /* for increment expression */ |
| }; |
| |
| /* Possible invalid uses of an abstract class that might not have a |
| specific associated declaration. */ |
| enum GTY(()) abstract_class_use { |
| ACU_UNKNOWN, /* unknown or decl provided */ |
| ACU_CAST, /* cast to abstract class */ |
| ACU_NEW, /* new-expression of abstract class */ |
| ACU_THROW, /* throw-expression of abstract class */ |
| ACU_CATCH, /* catch-parameter of abstract class */ |
| ACU_ARRAY, /* array of abstract class */ |
| ACU_RETURN, /* return type of abstract class */ |
| ACU_PARM /* parameter type of abstract class */ |
| }; |
| |
| /* Macros for access to language-specific slots in an identifier. */ |
| |
| /* Identifiers map directly to block or class-scope bindings. |
| Namespace-scope bindings are held in hash tables on the respective |
| namespaces. The identifier bindings are the innermost active |
| binding, from whence you can get the decl and/or implicit-typedef |
| of an elaborated type. When not bound to a local entity the |
| values are NULL. */ |
| #define IDENTIFIER_BINDING(NODE) \ |
| (LANG_IDENTIFIER_CAST (NODE)->bindings) |
| #define REAL_IDENTIFIER_TYPE_VALUE(NODE) TREE_TYPE (NODE) |
| #define SET_IDENTIFIER_TYPE_VALUE(NODE,TYPE) (TREE_TYPE (NODE) = (TYPE)) |
| |
| /* Kinds of identifiers. Values are carefully chosen. */ |
| enum cp_identifier_kind { |
| cik_normal = 0, /* Not a special identifier. */ |
| cik_keyword = 1, /* A keyword. */ |
| cik_ctor = 2, /* Constructor (in-chg, complete or base). */ |
| cik_dtor = 3, /* Destructor (in-chg, deleting, complete or |
| base). */ |
| cik_simple_op = 4, /* Non-assignment operator name. */ |
| cik_assign_op = 5, /* An assignment operator name. */ |
| cik_conv_op = 6, /* Conversion operator name. */ |
| cik_reserved_for_udlit = 7, /* Not yet in use */ |
| cik_max |
| }; |
| |
| /* Kind bits. */ |
| #define IDENTIFIER_KIND_BIT_0(NODE) \ |
| TREE_LANG_FLAG_0 (IDENTIFIER_NODE_CHECK (NODE)) |
| #define IDENTIFIER_KIND_BIT_1(NODE) \ |
| TREE_LANG_FLAG_1 (IDENTIFIER_NODE_CHECK (NODE)) |
| #define IDENTIFIER_KIND_BIT_2(NODE) \ |
| TREE_LANG_FLAG_2 (IDENTIFIER_NODE_CHECK (NODE)) |
| |
| /* Used by various search routines. */ |
| #define IDENTIFIER_MARKED(NODE) \ |
| TREE_LANG_FLAG_4 (IDENTIFIER_NODE_CHECK (NODE)) |
| |
| /* Nonzero if this identifier is used as a virtual function name somewhere |
| (optimizes searches). */ |
| #define IDENTIFIER_VIRTUAL_P(NODE) \ |
| TREE_LANG_FLAG_5 (IDENTIFIER_NODE_CHECK (NODE)) |
| |
| /* True if this identifier is a reserved word. C_RID_CODE (node) is |
| then the RID_* value of the keyword. Value 1. */ |
| #define IDENTIFIER_KEYWORD_P(NODE) \ |
| ((!IDENTIFIER_KIND_BIT_2 (NODE)) \ |
| & (!IDENTIFIER_KIND_BIT_1 (NODE)) \ |
| & IDENTIFIER_KIND_BIT_0 (NODE)) |
| |
| /* True if this identifier is the name of a constructor or |
| destructor. Value 2 or 3. */ |
| #define IDENTIFIER_CDTOR_P(NODE) \ |
| ((!IDENTIFIER_KIND_BIT_2 (NODE)) \ |
| & IDENTIFIER_KIND_BIT_1 (NODE)) |
| |
| /* True if this identifier is the name of a constructor. Value 2. */ |
| #define IDENTIFIER_CTOR_P(NODE) \ |
| (IDENTIFIER_CDTOR_P(NODE) \ |
| & (!IDENTIFIER_KIND_BIT_0 (NODE))) |
| |
| /* True if this identifier is the name of a destructor. Value 3. */ |
| #define IDENTIFIER_DTOR_P(NODE) \ |
| (IDENTIFIER_CDTOR_P(NODE) \ |
| & IDENTIFIER_KIND_BIT_0 (NODE)) |
| |
| /* True if this identifier is for any operator name (including |
| conversions). Value 4, 5, 6 or 7. */ |
| #define IDENTIFIER_ANY_OP_P(NODE) \ |
| (IDENTIFIER_KIND_BIT_2 (NODE)) |
| |
| /* True if this identifier is for an overloaded operator. Values 4, 5. */ |
| #define IDENTIFIER_OVL_OP_P(NODE) \ |
| (IDENTIFIER_ANY_OP_P (NODE) \ |
| & (!IDENTIFIER_KIND_BIT_1 (NODE))) |
| |
| /* True if this identifier is for any assignment. Values 5. */ |
| #define IDENTIFIER_ASSIGN_OP_P(NODE) \ |
| (IDENTIFIER_OVL_OP_P (NODE) \ |
| & IDENTIFIER_KIND_BIT_0 (NODE)) |
| |
| /* True if this identifier is the name of a type-conversion |
| operator. Value 7. */ |
| #define IDENTIFIER_CONV_OP_P(NODE) \ |
| (IDENTIFIER_ANY_OP_P (NODE) \ |
| & IDENTIFIER_KIND_BIT_1 (NODE) \ |
| & (!IDENTIFIER_KIND_BIT_0 (NODE))) |
| |
| /* True if this identifier is a new or delete operator. */ |
| #define IDENTIFIER_NEWDEL_OP_P(NODE) \ |
| (IDENTIFIER_OVL_OP_P (NODE) \ |
| && IDENTIFIER_OVL_OP_FLAGS (NODE) & OVL_OP_FLAG_ALLOC) |
| |
| /* True if this identifier is a new operator. */ |
| #define IDENTIFIER_NEW_OP_P(NODE) \ |
| (IDENTIFIER_OVL_OP_P (NODE) \ |
| && (IDENTIFIER_OVL_OP_FLAGS (NODE) \ |
| & (OVL_OP_FLAG_ALLOC | OVL_OP_FLAG_DELETE)) == OVL_OP_FLAG_ALLOC) |
| |
| /* Access a C++-specific index for identifier NODE. |
| Used to optimize operator mappings etc. */ |
| #define IDENTIFIER_CP_INDEX(NODE) \ |
| (IDENTIFIER_NODE_CHECK(NODE)->base.u.bits.address_space) |
| |
| /* In a RECORD_TYPE or UNION_TYPE, nonzero if any component is read-only. */ |
| #define C_TYPE_FIELDS_READONLY(TYPE) \ |
| (LANG_TYPE_CLASS_CHECK (TYPE)->fields_readonly) |
| |
| /* The tokens stored in the unparsed operand. */ |
| |
| #define DEFPARSE_TOKENS(NODE) \ |
| (((struct tree_deferred_parse *)DEFERRED_PARSE_CHECK (NODE))->tokens) |
| #define DEFPARSE_INSTANTIATIONS(NODE) \ |
| (((struct tree_deferred_parse *)DEFERRED_PARSE_CHECK (NODE))->instantiations) |
| |
| struct GTY (()) tree_deferred_parse { |
| struct tree_base base; |
| struct cp_token_cache *tokens; |
| vec<tree, va_gc> *instantiations; |
| }; |
| |
| |
| #define DEFERRED_NOEXCEPT_PATTERN(NODE) \ |
| (((struct tree_deferred_noexcept *)DEFERRED_NOEXCEPT_CHECK (NODE))->pattern) |
| #define DEFERRED_NOEXCEPT_ARGS(NODE) \ |
| (((struct tree_deferred_noexcept *)DEFERRED_NOEXCEPT_CHECK (NODE))->args) |
| #define DEFERRED_NOEXCEPT_SPEC_P(NODE) \ |
| ((NODE) && (TREE_PURPOSE (NODE)) \ |
| && (TREE_CODE (TREE_PURPOSE (NODE)) == DEFERRED_NOEXCEPT)) |
| #define UNEVALUATED_NOEXCEPT_SPEC_P(NODE) \ |
| (DEFERRED_NOEXCEPT_SPEC_P (NODE) \ |
| && DEFERRED_NOEXCEPT_PATTERN (TREE_PURPOSE (NODE)) == NULL_TREE) |
| #define UNPARSED_NOEXCEPT_SPEC_P(NODE) \ |
| ((NODE) && (TREE_PURPOSE (NODE)) \ |
| && (TREE_CODE (TREE_PURPOSE (NODE)) == DEFERRED_PARSE)) |
| |
| struct GTY (()) tree_deferred_noexcept { |
| struct tree_base base; |
| tree pattern; |
| tree args; |
| }; |
| |
| |
| /* The condition associated with the static assertion. This must be |
| an integral constant expression. */ |
| #define STATIC_ASSERT_CONDITION(NODE) \ |
| (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->condition) |
| |
| /* The message associated with the static assertion. This must be a |
| string constant, which will be emitted as an error message when the |
| static assert condition is false. */ |
| #define STATIC_ASSERT_MESSAGE(NODE) \ |
| (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->message) |
| |
| /* Source location information for a static assertion. */ |
| #define STATIC_ASSERT_SOURCE_LOCATION(NODE) \ |
| (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->location) |
| |
| struct GTY (()) tree_static_assert { |
| struct tree_common common; |
| tree condition; |
| tree message; |
| location_t location; |
| }; |
| |
| struct GTY (()) tree_argument_pack_select { |
| struct tree_common common; |
| tree argument_pack; |
| int index; |
| }; |
| |
| /* The different kinds of traits that we encounter. */ |
| |
| enum cp_trait_kind |
| { |
| CPTK_BASES, |
| CPTK_DIRECT_BASES, |
| CPTK_HAS_NOTHROW_ASSIGN, |
| CPTK_HAS_NOTHROW_CONSTRUCTOR, |
| CPTK_HAS_NOTHROW_COPY, |
| CPTK_HAS_TRIVIAL_ASSIGN, |
| CPTK_HAS_TRIVIAL_CONSTRUCTOR, |
| CPTK_HAS_TRIVIAL_COPY, |
| CPTK_HAS_TRIVIAL_DESTRUCTOR, |
| CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS, |
| CPTK_HAS_VIRTUAL_DESTRUCTOR, |
| CPTK_IS_ABSTRACT, |
| CPTK_IS_AGGREGATE, |
| CPTK_IS_BASE_OF, |
| CPTK_IS_CLASS, |
| CPTK_IS_EMPTY, |
| CPTK_IS_ENUM, |
| CPTK_IS_FINAL, |
| CPTK_IS_LAYOUT_COMPATIBLE, |
| CPTK_IS_LITERAL_TYPE, |
| CPTK_IS_POINTER_INTERCONVERTIBLE_BASE_OF, |
| CPTK_IS_POD, |
| CPTK_IS_POLYMORPHIC, |
| CPTK_IS_SAME_AS, |
| CPTK_IS_STD_LAYOUT, |
| CPTK_IS_TRIVIAL, |
| CPTK_IS_TRIVIALLY_ASSIGNABLE, |
| CPTK_IS_TRIVIALLY_CONSTRUCTIBLE, |
| CPTK_IS_TRIVIALLY_COPYABLE, |
| CPTK_IS_UNION, |
| CPTK_UNDERLYING_TYPE, |
| CPTK_IS_ASSIGNABLE, |
| CPTK_IS_CONSTRUCTIBLE, |
| CPTK_IS_NOTHROW_ASSIGNABLE, |
| CPTK_IS_NOTHROW_CONSTRUCTIBLE |
| }; |
| |
| /* The types that we are processing. */ |
| #define TRAIT_EXPR_TYPE1(NODE) \ |
| (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->type1) |
| |
| #define TRAIT_EXPR_TYPE2(NODE) \ |
| (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->type2) |
| |
| /* The specific trait that we are processing. */ |
| #define TRAIT_EXPR_KIND(NODE) \ |
| (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->kind) |
| |
| #define TRAIT_EXPR_LOCATION(NODE) \ |
| (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->locus) |
| |
| struct GTY (()) tree_trait_expr { |
| struct tree_common common; |
| tree type1; |
| tree type2; |
| location_t locus; |
| enum cp_trait_kind kind; |
| }; |
| |
| /* Identifiers used for lambda types are almost anonymous. Use this |
| spare flag to distinguish them (they also have the anonymous flag). */ |
| #define IDENTIFIER_LAMBDA_P(NODE) \ |
| (IDENTIFIER_NODE_CHECK(NODE)->base.protected_flag) |
| |
| /* Based off of TYPE_UNNAMED_P. */ |
| #define LAMBDA_TYPE_P(NODE) \ |
| (TREE_CODE (NODE) == RECORD_TYPE \ |
| && TYPE_LINKAGE_IDENTIFIER (NODE) \ |
| && IDENTIFIER_LAMBDA_P (TYPE_LINKAGE_IDENTIFIER (NODE))) |
| |
| /* Test if FUNCTION_DECL is a lambda function. */ |
| #define LAMBDA_FUNCTION_P(FNDECL) \ |
| (DECL_DECLARES_FUNCTION_P (FNDECL) \ |
| && DECL_OVERLOADED_OPERATOR_P (FNDECL) \ |
| && DECL_OVERLOADED_OPERATOR_IS (FNDECL, CALL_EXPR) \ |
| && LAMBDA_TYPE_P (CP_DECL_CONTEXT (FNDECL))) |
| |
| enum cp_lambda_default_capture_mode_type { |
| CPLD_NONE, |
| CPLD_COPY, |
| CPLD_REFERENCE |
| }; |
| |
| /* The method of default capture, if any. */ |
| #define LAMBDA_EXPR_DEFAULT_CAPTURE_MODE(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->default_capture_mode) |
| |
| /* The capture-list, including `this'. Each capture is stored as a FIELD_DECL |
| * so that the name, type, and field are all together, whether or not it has |
| * been added to the lambda's class type. |
| TREE_LIST: |
| TREE_PURPOSE: The FIELD_DECL for this capture. |
| TREE_VALUE: The initializer. This is part of a GNU extension. */ |
| #define LAMBDA_EXPR_CAPTURE_LIST(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->capture_list) |
| |
| /* During parsing of the lambda-introducer, the node in the capture-list |
| that holds the 'this' capture. During parsing of the body, the |
| capture proxy for that node. */ |
| #define LAMBDA_EXPR_THIS_CAPTURE(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->this_capture) |
| |
| /* Predicate tracking whether `this' is in the effective capture set. */ |
| #define LAMBDA_EXPR_CAPTURES_THIS_P(NODE) \ |
| LAMBDA_EXPR_THIS_CAPTURE(NODE) |
| |
| /* Predicate tracking whether the lambda was declared 'mutable'. */ |
| #define LAMBDA_EXPR_MUTABLE_P(NODE) \ |
| TREE_LANG_FLAG_1 (LAMBDA_EXPR_CHECK (NODE)) |
| |
| /* True iff uses of a const variable capture were optimized away. */ |
| #define LAMBDA_EXPR_CAPTURE_OPTIMIZED(NODE) \ |
| TREE_LANG_FLAG_2 (LAMBDA_EXPR_CHECK (NODE)) |
| |
| /* True if this TREE_LIST in LAMBDA_EXPR_CAPTURE_LIST is for an explicit |
| capture. */ |
| #define LAMBDA_CAPTURE_EXPLICIT_P(NODE) \ |
| TREE_LANG_FLAG_0 (TREE_LIST_CHECK (NODE)) |
| |
| /* The source location of the lambda. */ |
| #define LAMBDA_EXPR_LOCATION(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->locus) |
| |
| /* The mangling scope for the lambda: FUNCTION_DECL, PARM_DECL, VAR_DECL, |
| FIELD_DECL or NULL_TREE. If this is NULL_TREE, we have no linkage. */ |
| #define LAMBDA_EXPR_EXTRA_SCOPE(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->extra_scope) |
| |
| /* If EXTRA_SCOPE, this is the number of the lambda within that scope. */ |
| #define LAMBDA_EXPR_DISCRIMINATOR(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->discriminator) |
| |
| /* During parsing of the lambda, a vector of capture proxies which need |
| to be pushed once we're done processing a nested lambda. */ |
| #define LAMBDA_EXPR_PENDING_PROXIES(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->pending_proxies) |
| |
| /* If NODE was regenerated via tsubst_lambda_expr, this is a TEMPLATE_INFO |
| whose TI_TEMPLATE is the immediate LAMBDA_EXPR from which NODE was |
| regenerated, and TI_ARGS is the full set of template arguments used |
| to regenerate NODE from the most general lambda. */ |
| #define LAMBDA_EXPR_REGEN_INFO(NODE) \ |
| (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->regen_info) |
| |
| /* The closure type of the lambda, which is also the type of the |
| LAMBDA_EXPR. */ |
| #define LAMBDA_EXPR_CLOSURE(NODE) \ |
| (TREE_TYPE (LAMBDA_EXPR_CHECK (NODE))) |
| |
| struct GTY (()) tree_lambda_expr |
| { |
| struct tree_typed typed; |
| tree capture_list; |
| tree this_capture; |
| tree extra_scope; |
| tree regen_info; |
| vec<tree, va_gc> *pending_proxies; |
| location_t locus; |
| enum cp_lambda_default_capture_mode_type default_capture_mode : 8; |
| short int discriminator; |
| }; |
| |
| /* Non-zero if this template specialization has access violations that |
| should be rechecked when the function is instantiated outside argument |
| deduction. */ |
| #define TINFO_HAS_ACCESS_ERRORS(NODE) \ |
| (TREE_LANG_FLAG_0 (TEMPLATE_INFO_CHECK (NODE))) |
| #define FNDECL_HAS_ACCESS_ERRORS(NODE) \ |
| (TINFO_HAS_ACCESS_ERRORS (DECL_TEMPLATE_INFO (NODE))) |
| |
| /* Non-zero if this variable template specialization was specified using a |
| template-id, so it's a partial or full specialization and not a definition |
| of the member template of a particular class specialization. */ |
| #define TINFO_USED_TEMPLATE_ID(NODE) \ |
| (TREE_LANG_FLAG_1 (TEMPLATE_INFO_CHECK (NODE))) |
| |
| /* The representation of a deferred access check. */ |
| |
| struct GTY(()) deferred_access_check { |
| /* The base class in which the declaration is referenced. */ |
| tree binfo; |
| /* The declaration whose access must be checked. */ |
| tree decl; |
| /* The declaration that should be used in the error message. */ |
| tree diag_decl; |
| /* The location of this access. */ |
| location_t loc; |
| }; |
| |
| struct GTY(()) tree_template_info { |
| struct tree_base base; |
| tree tmpl; |
| tree args; |
| vec<deferred_access_check, va_gc> *deferred_access_checks; |
| }; |
| |
| // Constraint information for a C++ declaration. Constraint information is |
| // comprised of: |
| // |
| // - a constraint expression introduced by the template header |
| // - a constraint expression introduced by a function declarator |
| // - the associated constraints, which are the conjunction of those, |
| // and used for declaration matching |
| // |
| // The template and declarator requirements are kept to support pretty |
| // printing constrained declarations. |
| struct GTY(()) tree_constraint_info { |
| struct tree_base base; |
| tree template_reqs; |
| tree declarator_reqs; |
| tree associated_constr; |
| }; |
| |
| // Require that pointer P is non-null before returning. |
| template<typename T> |
| inline T* |
| check_nonnull (T* p) |
| { |
| gcc_assert (p); |
| return p; |
| } |
| |
| /* Returns true iff T is non-null and represents constraint info. */ |
| inline tree_constraint_info * |
| check_constraint_info (tree t) |
| { |
| if (t && TREE_CODE (t) == CONSTRAINT_INFO) |
| return (tree_constraint_info *)t; |
| return NULL; |
| } |
| |
| /* Access the expression describing the template constraints. This may be |
| null if no constraints were introduced in the template parameter list, |
| a requirements clause after the template parameter list, or constraints |
| through a constrained-type-specifier. */ |
| #define CI_TEMPLATE_REQS(NODE) \ |
| check_constraint_info (check_nonnull (NODE))->template_reqs |
| |
| /* Access the expression describing the trailing constraints. This is non-null |
| for any implicit instantiation of a constrained declaration. For a |
| templated declaration it is non-null only when a trailing requires-clause |
| was specified. */ |
| #define CI_DECLARATOR_REQS(NODE) \ |
| check_constraint_info (check_nonnull (NODE))->declarator_reqs |
| |
| /* The computed associated constraint expression for a declaration. */ |
| #define CI_ASSOCIATED_CONSTRAINTS(NODE) \ |
| check_constraint_info (check_nonnull (NODE))->associated_constr |
| |
| /* Access the constraint-expression introduced by the requires-clause |
| associate the template parameter list NODE. */ |
| #define TEMPLATE_PARMS_CONSTRAINTS(NODE) \ |
| TREE_TYPE (TREE_LIST_CHECK (NODE)) |
| |
| /* Access the logical constraints on the template parameter declaration |
| indicated by NODE. */ |
| #define TEMPLATE_PARM_CONSTRAINTS(NODE) \ |
| TREE_TYPE (TREE_LIST_CHECK (NODE)) |
| |
| /* Non-zero if the noexcept is present in a compound requirement. */ |
| #define COMPOUND_REQ_NOEXCEPT_P(NODE) \ |
| TREE_LANG_FLAG_0 (TREE_CHECK (NODE, COMPOUND_REQ)) |
| |
| /* A TREE_LIST whose TREE_VALUE is the constraints on the 'auto' placeholder |
| type NODE, used in an argument deduction constraint. The TREE_PURPOSE |
| holds the set of template parameters that were in-scope when this 'auto' |
| was formed. */ |
| #define PLACEHOLDER_TYPE_CONSTRAINTS_INFO(NODE) \ |
| DECL_SIZE_UNIT (TYPE_NAME (NODE)) |
| |
| /* The constraints on the 'auto' placeholder type NODE. */ |
| #define PLACEHOLDER_TYPE_CONSTRAINTS(NODE) \ |
| (PLACEHOLDER_TYPE_CONSTRAINTS_INFO (NODE) \ |
| ? TREE_VALUE (PLACEHOLDER_TYPE_CONSTRAINTS_INFO (NODE)) \ |
| : NULL_TREE) |
| |
| /* True if NODE is a constraint. */ |
| #define CONSTR_P(NODE) \ |
| (TREE_CODE (NODE) == ATOMIC_CONSTR \ |
| || TREE_CODE (NODE) == CONJ_CONSTR \ |
| || TREE_CODE (NODE) == DISJ_CONSTR) |
| |
| /* Valid for any normalized constraint. */ |
| #define CONSTR_CHECK(NODE) \ |
| TREE_CHECK3 (NODE, ATOMIC_CONSTR, CONJ_CONSTR, DISJ_CONSTR) |
| |
| /* The CONSTR_INFO stores normalization data for a constraint. It refers to |
| the original expression and the expression or declaration |
| from which the constraint was normalized. |
| |
| This is TREE_LIST whose TREE_PURPOSE is the original expression and whose |
| TREE_VALUE is a list of contexts. */ |
| #define CONSTR_INFO(NODE) \ |
| TREE_TYPE (CONSTR_CHECK (NODE)) |
| |
| /* The expression evaluated by the constraint. */ |
| #define CONSTR_EXPR(NODE) \ |
| TREE_PURPOSE (CONSTR_INFO (NODE)) |
| |
| /* The expression or declaration from which this constraint was normalized. |
| This is a TREE_LIST whose TREE_VALUE is either a template-id expression |
| denoting a concept check or the declaration introducing the constraint. |
| These are chained to other context objects. */ |
| #define CONSTR_CONTEXT(NODE) \ |
| TREE_VALUE (CONSTR_INFO (NODE)) |
| |
| /* The parameter mapping for an atomic constraint. */ |
| #define ATOMIC_CONSTR_MAP(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, ATOMIC_CONSTR), 0) |
| |
| /* Whether the parameter mapping of this atomic constraint |
| is already instantiated with concrete template arguments. |
| Used only in satisfy_atom and in the satisfaction cache. */ |
| #define ATOMIC_CONSTR_MAP_INSTANTIATED_P(NODE) \ |
| TREE_LANG_FLAG_0 (ATOMIC_CONSTR_CHECK (NODE)) |
| |
| /* The expression of an atomic constraint. */ |
| #define ATOMIC_CONSTR_EXPR(NODE) \ |
| CONSTR_EXPR (ATOMIC_CONSTR_CHECK (NODE)) |
| |
| /* The concept of a concept check. */ |
| #define CHECK_CONSTR_CONCEPT(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, CHECK_CONSTR), 0) |
| |
| /* The template arguments of a concept check. */ |
| #define CHECK_CONSTR_ARGS(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, CHECK_CONSTR), 1) |
| |
| /* Whether a PARM_DECL represents a local parameter in a |
| requires-expression. */ |
| #define CONSTRAINT_VAR_P(NODE) \ |
| DECL_LANG_FLAG_2 (TREE_CHECK (NODE, PARM_DECL)) |
| |
| /* The concept constraining this constrained template-parameter. */ |
| #define CONSTRAINED_PARM_CONCEPT(NODE) \ |
| DECL_SIZE_UNIT (TYPE_DECL_CHECK (NODE)) |
| /* Any extra template arguments specified for a constrained |
| template-parameter. */ |
| #define CONSTRAINED_PARM_EXTRA_ARGS(NODE) \ |
| DECL_SIZE (TYPE_DECL_CHECK (NODE)) |
| /* The first template parameter of CONSTRAINED_PARM_CONCEPT to be used as a |
| prototype for the constrained parameter in finish_shorthand_constraint, |
| attached for convenience. */ |
| #define CONSTRAINED_PARM_PROTOTYPE(NODE) \ |
| DECL_INITIAL (TYPE_DECL_CHECK (NODE)) |
| |
| /* Module flags on FUNCTION,VAR,TYPE,CONCEPT or NAMESPACE |
| A TEMPLATE_DECL holds them on the DECL_TEMPLATE_RESULT object -- |
| it's just not practical to keep them consistent. */ |
| #define DECL_MODULE_CHECK(NODE) \ |
| TREE_NOT_CHECK (NODE, TEMPLATE_DECL) |
| |
| /* In the purview of a module (including header unit). */ |
| #define DECL_MODULE_PURVIEW_P(N) \ |
| (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (N))->u.base.module_purview_p) |
| |
| /* True if the live version of the decl was imported. */ |
| #define DECL_MODULE_IMPORT_P(NODE) \ |
| (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (NODE))->u.base.module_import_p) |
| |
| /* True if this decl is in the entity hash & array. This means that |
| some variant was imported, even if DECL_MODULE_IMPORT_P is false. */ |
| #define DECL_MODULE_ENTITY_P(NODE) \ |
| (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (NODE))->u.base.module_entity_p) |
| |
| /* DECL that has attached decls for ODR-relatedness. */ |
| #define DECL_MODULE_ATTACHMENTS_P(NODE) \ |
| (DECL_LANG_SPECIFIC (TREE_CHECK2(NODE,FUNCTION_DECL,VAR_DECL))\ |
| ->u.base.module_attached_p) |
| |
| /* Whether this is an exported DECL. Held on any decl that can appear |
| at namespace scope (function, var, type, template, const or |
| namespace). templates copy from their template_result, consts have |
| it for unscoped enums. */ |
| #define DECL_MODULE_EXPORT_P(NODE) TREE_LANG_FLAG_3 (NODE) |
| |
| |
| /* The list of local parameters introduced by this requires-expression, |
| in the form of a chain of PARM_DECLs. */ |
| #define REQUIRES_EXPR_PARMS(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 0) |
| |
| /* A TREE_LIST of the requirements for this requires-expression. |
| The requirements are stored in lexical order within the TREE_VALUE |
| of each TREE_LIST node. The TREE_PURPOSE of each node is unused. */ |
| #define REQUIRES_EXPR_REQS(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 1) |
| |
| /* Like PACK_EXPANSION_EXTRA_ARGS, for requires-expressions. */ |
| #define REQUIRES_EXPR_EXTRA_ARGS(NODE) \ |
| TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 2) |
| |
| enum cp_tree_node_structure_enum { |
| TS_CP_GENERIC, |
| TS_CP_IDENTIFIER, |
| TS_CP_TPI, |
| TS_CP_PTRMEM, |
| TS_CP_OVERLOAD, |
| TS_CP_BINDING_VECTOR, |
| TS_CP_BASELINK, |
| TS_CP_TEMPLATE_DECL, |
| TS_CP_DEFERRED_PARSE, |
| TS_CP_DEFERRED_NOEXCEPT, |
| TS_CP_STATIC_ASSERT, |
| TS_CP_ARGUMENT_PACK_SELECT, |
| TS_CP_TRAIT_EXPR, |
| TS_CP_LAMBDA_EXPR, |
| TS_CP_TEMPLATE_INFO, |
| TS_CP_CONSTRAINT_INFO, |
| TS_CP_USERDEF_LITERAL |
| }; |
| |
| /* The resulting tree type. */ |
| union GTY((desc ("cp_tree_node_structure (&%h)"), |
| chain_next ("(union lang_tree_node *) c_tree_chain_next (&%h.generic)"))) lang_tree_node { |
| union tree_node GTY ((tag ("TS_CP_GENERIC"), |
| desc ("tree_node_structure (&%h)"))) generic; |
| struct template_parm_index GTY ((tag ("TS_CP_TPI"))) tpi; |
| struct ptrmem_cst GTY ((tag ("TS_CP_PTRMEM"))) ptrmem; |
| struct tree_overload GTY ((tag ("TS_CP_OVERLOAD"))) overload; |
| struct tree_binding_vec GTY ((tag ("TS_CP_BINDING_VECTOR"))) binding_vec; |
| struct tree_baselink GTY ((tag ("TS_CP_BASELINK"))) baselink; |
| struct tree_template_decl GTY ((tag ("TS_CP_TEMPLATE_DECL"))) template_decl; |
| struct tree_deferred_parse GTY ((tag ("TS_CP_DEFERRED_PARSE"))) deferred_parse; |
| struct tree_deferred_noexcept GTY ((tag ("TS_CP_DEFERRED_NOEXCEPT"))) deferred_noexcept; |
| struct lang_identifier GTY ((tag ("TS_CP_IDENTIFIER"))) identifier; |
| struct tree_static_assert GTY ((tag ("TS_CP_STATIC_ASSERT"))) |
| static_assertion; |
| struct tree_argument_pack_select GTY ((tag ("TS_CP_ARGUMENT_PACK_SELECT"))) |
| argument_pack_select; |
| struct tree_trait_expr GTY ((tag ("TS_CP_TRAIT_EXPR"))) |
| trait_expression; |
| struct tree_lambda_expr GTY ((tag ("TS_CP_LAMBDA_EXPR"))) |
| lambda_expression; |
| struct tree_template_info GTY ((tag ("TS_CP_TEMPLATE_INFO"))) |
| template_info; |
| struct tree_constraint_info GTY ((tag ("TS_CP_CONSTRAINT_INFO"))) |
| constraint_info; |
| struct tree_userdef_literal GTY ((tag ("TS_CP_USERDEF_LITERAL"))) |
| userdef_literal; |
| }; |
| |
| |
| struct GTY(()) omp_declare_target_attr { |
| bool attr_syntax; |
| }; |
| |
| /* Global state. */ |
| |
| struct GTY(()) saved_scope { |
| vec<cxx_saved_binding, va_gc> *old_bindings; |
| tree old_namespace; |
| vec<tree, va_gc> *decl_ns_list; |
| tree class_name; |
| tree class_type; |
| tree access_specifier; |
| tree function_decl; |
| vec<tree, va_gc> *lang_base; |
| tree lang_name; |
| tree template_parms; |
| cp_binding_level *x_previous_class_level; |
| tree x_saved_tree; |
| |
| /* Only used for uses of this in trailing return type. */ |
| tree x_current_class_ptr; |
| tree x_current_class_ref; |
| |
| int x_processing_template_decl; |
| int x_processing_specialization; |
| int x_processing_constraint; |
| int suppress_location_wrappers; |
| BOOL_BITFIELD x_processing_explicit_instantiation : 1; |
| BOOL_BITFIELD need_pop_function_context : 1; |
| |
| /* Nonzero if we are parsing the discarded statement of a constexpr |
| if-statement. */ |
| BOOL_BITFIELD discarded_stmt : 1; |
| /* Nonzero if we are parsing or instantiating the compound-statement |
| of consteval if statement. */ |
| BOOL_BITFIELD consteval_if_p : 1; |
| |
| int unevaluated_operand; |
| int inhibit_evaluation_warnings; |
| int noexcept_operand; |
| int ref_temp_count; |
| |
| struct stmt_tree_s x_stmt_tree; |
| |
| cp_binding_level *class_bindings; |
| cp_binding_level *bindings; |
| |
| hash_map<tree, tree> *GTY((skip)) x_local_specializations; |
| vec<omp_declare_target_attr, va_gc> *omp_declare_target_attribute; |
| |
| struct saved_scope *prev; |
| }; |
| |
| extern GTY(()) struct saved_scope *scope_chain; |
| |
| /* The current open namespace. */ |
| |
| #define current_namespace scope_chain->old_namespace |
| |
| /* The stack for namespaces of current declarations. */ |
| |
| #define decl_namespace_list scope_chain->decl_ns_list |
| |
| /* IDENTIFIER_NODE: name of current class */ |
| |
| #define current_class_name scope_chain->class_name |
| |
| /* _TYPE: the type of the current class */ |
| |
| #define current_class_type scope_chain->class_type |
| |
| /* When parsing a class definition, the access specifier most recently |
| given by the user, or, if no access specifier was given, the |
| default value appropriate for the kind of class (i.e., struct, |
| class, or union). */ |
| |
| #define current_access_specifier scope_chain->access_specifier |
| |
| /* Pointer to the top of the language name stack. */ |
| |
| #define current_lang_base scope_chain->lang_base |
| #define current_lang_name scope_chain->lang_name |
| |
| /* When parsing a template declaration, a TREE_LIST represents the |
| active template parameters. Each node in the list represents one |
| level of template parameters. The innermost level is first in the |
| list. The depth of each level is stored as an INTEGER_CST in the |
| TREE_PURPOSE of each node. The parameters for that level are |
| stored in the TREE_VALUE. */ |
| |
| #define current_template_parms scope_chain->template_parms |
| |
| #define processing_template_decl scope_chain->x_processing_template_decl |
| #define processing_specialization scope_chain->x_processing_specialization |
| #define processing_explicit_instantiation scope_chain->x_processing_explicit_instantiation |
| |
| #define in_discarded_stmt scope_chain->discarded_stmt |
| #define in_consteval_if_p scope_chain->consteval_if_p |
| |
| #define current_ref_temp_count scope_chain->ref_temp_count |
| |
| /* RAII sentinel to handle clearing processing_template_decl and restoring |
| it when done. */ |
| |
| class processing_template_decl_sentinel |
| { |
| public: |
| int saved; |
| processing_template_decl_sentinel (bool reset = true) |
| : saved (processing_template_decl) |
| { |
| if (reset) |
| processing_template_decl = 0; |
| } |
| ~processing_template_decl_sentinel() |
| { |
| processing_template_decl = saved; |
| } |
| }; |
| |
| /* RAII sentinel to disable certain warnings during template substitution |
| and elsewhere. */ |
| |
| class warning_sentinel |
| { |
| public: |
| int &flag; |
| int val; |
| warning_sentinel(int& flag, bool suppress=true) |
| : flag(flag), val(flag) { if (suppress) flag = 0; } |
| ~warning_sentinel() { flag = val; } |
| }; |
| |
| /* RAII sentinel to temporarily override input_location. This will not set |
| input_location to UNKNOWN_LOCATION or BUILTINS_LOCATION. */ |
| |
| class iloc_sentinel |
| { |
| location_t saved_loc; |
| public: |
| iloc_sentinel (location_t loc): saved_loc (input_location) |
| { |
| if (loc >= RESERVED_LOCATION_COUNT) |
| input_location = loc; |
| } |
| ~iloc_sentinel () |
| { |
| input_location = saved_loc; |
| } |
| }; |
| |
| /* RAII sentinel that saves the value of a variable, optionally |
| overrides it right away, and restores its value when the sentinel |
| id destructed. */ |
| |
| template <typename T> |
| class temp_override |
| { |
| T& overridden_variable; |
| T saved_value; |
| public: |
| temp_override(T& var) : overridden_variable (var), saved_value (var) {} |
| temp_override(T& var, T overrider) |
| : overridden_variable (var), saved_value (var) |
| { |
| overridden_variable = overrider; |
| } |
| ~temp_override() { overridden_variable = saved_value; } |
| }; |
| |
| /* Wrapping a template parameter in type_identity_t hides it from template |
| argument deduction. */ |
| #if __cpp_lib_type_identity |
| using std::type_identity_t; |
| #else |
| template <typename T> |
| struct type_identity { typedef T type; }; |
| template <typename T> |
| using type_identity_t = typename type_identity<T>::type; |
| #endif |
| |
| /* Object generator function for temp_override, so you don't need to write the |
| type of the object as a template argument. |
| |
| Use as auto x = make_temp_override (flag); */ |
| |
| template <typename T> |
| inline temp_override<T> |
| make_temp_override (T& var) |
| { |
| return { var }; |
| } |
| |
| /* Likewise, but use as auto x = make_temp_override (flag, value); */ |
| |
| template <typename T> |
| inline temp_override<T> |
| make_temp_override (T& var, type_identity_t<T> overrider) |
| { |
| return { var, overrider }; |
| } |
| |
| /* The cached class binding level, from the most recently exited |
| class, or NULL if none. */ |
| |
| #define previous_class_level scope_chain->x_previous_class_level |
| |
| /* A map from local variable declarations in the body of the template |
| presently being instantiated to the corresponding instantiated |
| local variables. */ |
| |
| #define local_specializations scope_chain->x_local_specializations |
| |
| /* Nonzero if we are parsing the operand of a noexcept operator. */ |
| |
| #define cp_noexcept_operand scope_chain->noexcept_operand |
| |
| struct named_label_entry; /* Defined in decl.c. */ |
| |
| struct named_label_hash : ggc_remove <named_label_entry *> |
| { |
| typedef named_label_entry *value_type; |
| typedef tree compare_type; /* An identifier. */ |
| |
| inline static hashval_t hash (value_type); |
| inline static bool equal (const value_type, compare_type); |
| |
| static const bool empty_zero_p = true; |
| inline static void mark_empty (value_type &p) {p = NULL;} |
| inline static bool is_empty (value_type p) {return !p;} |
| |
| /* Nothing is deletable. Everything is insertable. */ |
| inline static bool is_deleted (value_type) { return false; } |
| inline static void mark_deleted (value_type) { gcc_unreachable (); } |
| }; |
| |
| /* Global state pertinent to the current function. */ |
| |
| struct GTY(()) language_function { |
| struct c_language_function base; |
| |
| tree x_cdtor_label; |
| tree x_current_class_ptr; |
| tree x_current_class_ref; |
| tree x_eh_spec_block; |
| tree x_in_charge_parm; |
| tree x_vtt_parm; |
| tree x_return_value; |
| |
| BOOL_BITFIELD returns_value : 1; |
| BOOL_BITFIELD returns_null : 1; |
| BOOL_BITFIELD returns_abnormally : 1; |
| BOOL_BITFIELD infinite_loop: 1; |
| BOOL_BITFIELD x_in_function_try_handler : 1; |
| BOOL_BITFIELD x_in_base_initializer : 1; |
| |
| /* True if this function can throw an exception. */ |
| BOOL_BITFIELD can_throw : 1; |
| |
| BOOL_BITFIELD invalid_constexpr : 1; |
| BOOL_BITFIELD throwing_cleanup : 1; |
| |
| hash_table<named_label_hash> *x_named_labels; |
| |
| cp_binding_level *bindings; |
| |
| /* Tracking possibly infinite loops. This is a vec<tree> only because |
| vec<bool> doesn't work with gtype. */ |
| vec<tree, va_gc> *infinite_loops; |
| }; |
| |
| /* The current C++-specific per-function global variables. */ |
| |
| #define cp_function_chain (cfun->language) |
| |
| /* In a constructor destructor, the point at which all derived class |
| destroying/construction has been done. I.e., just before a |
| constructor returns, or before any base class destroying will be done |
| in a destructor. */ |
| |
| #define cdtor_label cp_function_chain->x_cdtor_label |
| |
| /* When we're processing a member function, current_class_ptr is the |
| PARM_DECL for the `this' pointer. The current_class_ref is an |
| expression for `*this'. */ |
| |
| #define current_class_ptr \ |
| (*(cfun && cp_function_chain \ |
| ? &cp_function_chain->x_current_class_ptr \ |
| : &scope_chain->x_current_class_ptr)) |
| #define current_class_ref \ |
| (*(cfun && cp_function_chain \ |
| ? &cp_function_chain->x_current_class_ref \ |
| : &scope_chain->x_current_class_ref)) |
| |
| /* The EH_SPEC_BLOCK for the exception-specifiers for the current |
| function, if any. */ |
| |
| #define current_eh_spec_block cp_function_chain->x_eh_spec_block |
| |
| /* The `__in_chrg' parameter for the current function. Only used for |
| constructors and destructors. */ |
| |
| #define current_in_charge_parm cp_function_chain->x_in_charge_parm |
| |
| /* The `__vtt_parm' parameter for the current function. Only used for |
| constructors and destructors. */ |
| |
| #define current_vtt_parm cp_function_chain->x_vtt_parm |
| |
| /* A boolean flag to control whether we need to clean up the return value if a |
| local destructor throws. Only used in functions that return by value a |
| class with a destructor. Which 'tors don't, so we can use the same |
| field as current_vtt_parm. */ |
| |
| #define current_retval_sentinel current_vtt_parm |
| |
| /* Set to 0 at beginning of a function definition, set to 1 if |
| a return statement that specifies a return value is seen. */ |
| |
| #define current_function_returns_value cp_function_chain->returns_value |
| |
| /* Set to 0 at beginning of a function definition, set to 1 if |
| a return statement with no argument is seen. */ |
| |
| #define current_function_returns_null cp_function_chain->returns_null |
| |
| /* Set to 0 at beginning of a function definition, set to 1 if |
| a call to a noreturn function is seen. */ |
| |
| #define current_function_returns_abnormally \ |
| cp_function_chain->returns_abnormally |
| |
| /* Set to 0 at beginning of a function definition, set to 1 if we see an |
| obvious infinite loop. This can have false positives and false |
| negatives, so it should only be used as a heuristic. */ |
| |
| #define current_function_infinite_loop cp_function_chain->infinite_loop |
| |
| /* Nonzero if we are processing a base initializer. Zero elsewhere. */ |
| #define in_base_initializer cp_function_chain->x_in_base_initializer |
| |
| #define in_function_try_handler cp_function_chain->x_in_function_try_handler |
| |
| /* Expression always returned from function, or error_mark_node |
| otherwise, for use by the automatic named return value optimization. */ |
| |
| #define current_function_return_value \ |
| (cp_function_chain->x_return_value) |
| |
| /* In parser.c. */ |
| extern tree cp_literal_operator_id (const char *); |
| |
| #define NON_ERROR(NODE) ((NODE) == error_mark_node ? NULL_TREE : (NODE)) |
| |
| /* TRUE if a tree code represents a statement. */ |
| extern bool statement_code_p[MAX_TREE_CODES]; |
| |
| #define STATEMENT_CODE_P(CODE) statement_code_p[(int) (CODE)] |
| |
| enum languages { lang_c, lang_cplusplus }; |
| |
| /* Macros to make error reporting functions' lives easier. */ |
| #define TYPE_LINKAGE_IDENTIFIER(NODE) \ |
| (TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (NODE))) |
| #define TYPE_NAME_STRING(NODE) (IDENTIFIER_POINTER (TYPE_IDENTIFIER (NODE))) |
| #define TYPE_NAME_LENGTH(NODE) (IDENTIFIER_LENGTH (TYPE_IDENTIFIER (NODE))) |
| |
| /* Any kind of anonymous type. */ |
| #define TYPE_ANON_P(NODE) \ |
| (TYPE_LINKAGE_IDENTIFIER (NODE) \ |
| && IDENTIFIER_ANON_P (TYPE_LINKAGE_IDENTIFIER (NODE))) |
| |
| /* Nonzero if NODE, a TYPE, has no name for linkage purposes. */ |
| #define TYPE_UNNAMED_P(NODE) \ |
| (TYPE_ANON_P (NODE) \ |
| && !IDENTIFIER_LAMBDA_P (TYPE_LINKAGE_IDENTIFIER (NODE))) |
| |
| /* The _DECL for this _TYPE. */ |
| #define TYPE_MAIN_DECL(NODE) (TYPE_STUB_DECL (TYPE_MAIN_VARIANT (NODE))) |
| |
| /* Nonzero if T is a type that could resolve to any kind of concrete type |
| at instantiation time. */ |
| #define WILDCARD_TYPE_P(T) \ |
| (TREE_CODE (T) == TEMPLATE_TYPE_PARM \ |
| || TREE_CODE (T) == TYPENAME_TYPE \ |
| || TREE_CODE (T) == TYPEOF_TYPE \ |
| || TREE_CODE (T) == BOUND_TEMPLATE_TEMPLATE_PARM \ |
| || TREE_CODE (T) == DECLTYPE_TYPE) |
| |
| /* Nonzero if T is a class (or struct or union) type. Also nonzero |
| for template type parameters, typename types, and instantiated |
| template template parameters. Keep these checks in ascending code |
| order. */ |
| #define MAYBE_CLASS_TYPE_P(T) (WILDCARD_TYPE_P (T) || CLASS_TYPE_P (T)) |
| |
| /* Set CLASS_TYPE_P for T to VAL. T must be a class, struct, or |
| union type. */ |
| #define SET_CLASS_TYPE_P(T, VAL) \ |
| (TYPE_LANG_FLAG_5 (RECORD_OR_UNION_CHECK (T)) = (VAL)) |
| |
| /* Nonzero if T is a class type. Zero for template type parameters, |
| typename types, and so forth. */ |
| #define CLASS_TYPE_P(T) \ |
| (RECORD_OR_UNION_CODE_P (TREE_CODE (T)) && TYPE_LANG_FLAG_5 (T)) |
| |
| /* Nonzero if T is a class type but not a union. */ |
| #define NON_UNION_CLASS_TYPE_P(T) \ |
| (TREE_CODE (T) == RECORD_TYPE && TYPE_LANG_FLAG_5 (T)) |
| |
| /* Keep these checks in ascending code order. */ |
| #define RECORD_OR_UNION_CODE_P(T) \ |
| ((T) == RECORD_TYPE || (T) == UNION_TYPE) |
| #define OVERLOAD_TYPE_P(T) \ |
| (CLASS_TYPE_P (T) || TREE_CODE (T) == ENUMERAL_TYPE) |
| |
| /* True if this type is dependent. This predicate is only valid if |
| TYPE_DEPENDENT_P_VALID is true. */ |
| #define TYPE_DEPENDENT_P(NODE) TYPE_LANG_FLAG_0 (NODE) |
| |
| /* True if dependent_type_p has been called for this type, with the |
| result that TYPE_DEPENDENT_P is valid. */ |
| #define TYPE_DEPENDENT_P_VALID(NODE) TYPE_LANG_FLAG_6(NODE) |
| |
| /* Nonzero if this type is const-qualified. */ |
| #define CP_TYPE_CONST_P(NODE) \ |
| ((cp_type_quals (NODE) & TYPE_QUAL_CONST) != 0) |
| |
| /* Nonzero if this type is volatile-qualified. */ |
| #define CP_TYPE_VOLATILE_P(NODE) \ |
| ((cp_type_quals (NODE) & TYPE_QUAL_VOLATILE) != 0) |
| |
| /* Nonzero if this type is restrict-qualified. */ |
| #define CP_TYPE_RESTRICT_P(NODE) \ |
| ((cp_type_quals (NODE) & TYPE_QUAL_RESTRICT) != 0) |
| |
| /* Nonzero if this type is const-qualified, but not |
| volatile-qualified. Other qualifiers are ignored. This macro is |
| used to test whether or not it is OK to bind an rvalue to a |
| reference. */ |
| #define CP_TYPE_CONST_NON_VOLATILE_P(NODE) \ |
| ((cp_type_quals (NODE) & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)) \ |
| == TYPE_QUAL_CONST) |
| |
| #define FUNCTION_ARG_CHAIN(NODE) \ |
| TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (NODE))) |
| |
| /* Given a FUNCTION_DECL, returns the first TREE_LIST out of TYPE_ARG_TYPES |
| which refers to a user-written parameter. */ |
| #define FUNCTION_FIRST_USER_PARMTYPE(NODE) \ |
| skip_artificial_parms_for ((NODE), TYPE_ARG_TYPES (TREE_TYPE (NODE))) |
| |
| /* Similarly, but for DECL_ARGUMENTS. */ |
| #define FUNCTION_FIRST_USER_PARM(NODE) \ |
| skip_artificial_parms_for ((NODE), DECL_ARGUMENTS (NODE)) |
| |
| /* Nonzero iff TYPE is derived from PARENT. Ignores accessibility and |
| ambiguity issues. */ |
| #define DERIVED_FROM_P(PARENT, TYPE) \ |
| (lookup_base ((TYPE), (PARENT), ba_any, NULL, tf_none) != NULL_TREE) |
| |
| /* Gives the visibility specification for a class type. */ |
| #define CLASSTYPE_VISIBILITY(TYPE) \ |
| DECL_VISIBILITY (TYPE_MAIN_DECL (TYPE)) |
| #define CLASSTYPE_VISIBILITY_SPECIFIED(TYPE) \ |
| DECL_VISIBILITY_SPECIFIED (TYPE_MAIN_DECL (TYPE)) |
| |
| struct GTY (()) tree_pair_s { |
| tree purpose; |
| tree value; |
| }; |
| typedef tree_pair_s *tree_pair_p; |
| |
| /* This structure provides additional information above and beyond |
| what is provide in the ordinary tree_type. In the past, we used it |
| for the types of class types, template parameters types, typename |
| types, and so forth. However, there can be many (tens to hundreds |
| of thousands) of template parameter types in a compilation, and |
| there's no need for this additional information in that case. |
| Therefore, we now use this data structure only for class types. |
| |
| In the past, it was thought that there would be relatively few |
| class types. However, in the presence of heavy use of templates, |
| many (i.e., thousands) of classes can easily be generated. |
| Therefore, we should endeavor to keep the size of this structure to |
| a minimum. */ |
| struct GTY(()) lang_type { |
| unsigned char align; |
| |
| unsigned has_type_conversion : 1; |
| unsigned has_copy_ctor : 1; |
| unsigned has_default_ctor : 1; |
| unsigned const_needs_init : 1; |
| unsigned ref_needs_init : 1; |
| unsigned has_const_copy_assign : 1; |
| unsigned use_template : 2; |
| |
| unsigned has_mutable : 1; |
| unsigned com_interface : 1; |
| unsigned non_pod_class : 1; |
| unsigned nearly_empty_p : 1; |
| unsigned user_align : 1; |
| unsigned has_copy_assign : 1; |
| unsigned has_new : 1; |
| unsigned has_array_new : 1; |
| |
| unsigned gets_delete : 2; |
| unsigned interface_only : 1; |
| unsigned interface_unknown : 1; |
| unsigned contains_empty_class_p : 1; |
| unsigned anon_aggr : 1; |
| unsigned non_zero_init : 1; |
| unsigned empty_p : 1; |
| /* 32 bits allocated. */ |
| |
| unsigned vec_new_uses_cookie : 1; |
| unsigned declared_class : 1; |
| unsigned diamond_shaped : 1; |
| unsigned repeated_base : 1; |
| unsigned being_defined : 1; |
| unsigned debug_requested : 1; |
| unsigned fields_readonly : 1; |
| unsigned ptrmemfunc_flag : 1; |
| |
| unsigned lazy_default_ctor : 1; |
| unsigned lazy_copy_ctor : 1; |
| unsigned lazy_copy_assign : 1; |
| unsigned lazy_destructor : 1; |
| unsigned has_const_copy_ctor : 1; |
| unsigned has_complex_copy_ctor : 1; |
| unsigned has_complex_copy_assign : 1; |
| unsigned non_aggregate : 1; |
| |
| unsigned has_complex_dflt : 1; |
| unsigned has_list_ctor : 1; |
| unsigned non_std_layout : 1; |
| unsigned is_literal : 1; |
| unsigned lazy_move_ctor : 1; |
| unsigned lazy_move_assign : 1; |
| unsigned has_complex_move_ctor : 1; |
| unsigned has_complex_move_assign : 1; |
| |
| unsigned has_constexpr_ctor : 1; |
| unsigned unique_obj_representations : 1; |
| unsigned unique_obj_representations_set : 1; |
| bool erroneous : 1; |
| |
| /* When adding a flag here, consider whether or not it ought to |
| apply to a template instance if it applies to the template. If |
| so, make sure to copy it in instantiate_class_template! */ |
| |
| /* There are some bits left to fill out a 32-bit word. Keep track |
| of this by updating the size of this bitfield whenever you add or |
| remove a flag. */ |
| unsigned dummy : 4; |
| |
| tree primary_base; |
| vec<tree_pair_s, va_gc> *vcall_indices; |
| tree vtables; |
| tree typeinfo_var; |
| vec<tree, va_gc> *vbases; |
| tree as_base; |
| vec<tree, va_gc> *pure_virtuals; |
| tree friend_classes; |
| vec<tree, va_gc> * GTY((reorder ("resort_type_member_vec"))) members; |
| tree key_method; |
| tree decl_list; |
| tree befriending_classes; |
| /* In a RECORD_TYPE, information specific to Objective-C++, such |
| as a list of adopted protocols or a pointer to a corresponding |
| @interface. See objc/objc-act.h for details. */ |
| tree objc_info; |
| /* FIXME reuse another field? */ |
| tree lambda_expr; |
| }; |
| |
| /* We used to have a variant type for lang_type. Keep the name of the |
| checking accessor for the sole survivor. */ |
| #define LANG_TYPE_CLASS_CHECK(NODE) (TYPE_LANG_SPECIFIC (NODE)) |
| |
| /* Nonzero for _CLASSTYPE means that operator delete is defined. */ |
| #define TYPE_GETS_DELETE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->gets_delete) |
| #define TYPE_GETS_REG_DELETE(NODE) (TYPE_GETS_DELETE (NODE) & 1) |
| |
| /* Nonzero if `new NODE[x]' should cause the allocation of extra |
| storage to indicate how many array elements are in use. */ |
| #define TYPE_VEC_NEW_USES_COOKIE(NODE) \ |
| (CLASS_TYPE_P (NODE) \ |
| && LANG_TYPE_CLASS_CHECK (NODE)->vec_new_uses_cookie) |
| |
| /* Nonzero means that this _CLASSTYPE node defines ways of converting |
| itself to other types. */ |
| #define TYPE_HAS_CONVERSION(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_type_conversion) |
| |
| /* Nonzero means that NODE (a class type) has a default constructor -- |
| but that it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_DEFAULT_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_default_ctor) |
| |
| /* Nonzero means that NODE (a class type) has a copy constructor -- |
| but that it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_COPY_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_copy_ctor) |
| |
| /* Nonzero means that NODE (a class type) has a move constructor -- |
| but that it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_MOVE_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_move_ctor) |
| |
| /* Nonzero means that NODE (a class type) has an assignment operator |
| -- but that it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_COPY_ASSIGN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_copy_assign) |
| |
| /* Nonzero means that NODE (a class type) has an assignment operator |
| -- but that it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_MOVE_ASSIGN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_move_assign) |
| |
| /* Nonzero means that NODE (a class type) has a destructor -- but that |
| it has not yet been declared. */ |
| #define CLASSTYPE_LAZY_DESTRUCTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lazy_destructor) |
| |
| /* Nonzero means that NODE (a class type) is final */ |
| #define CLASSTYPE_FINAL(NODE) \ |
| TYPE_FINAL_P (NODE) |
| |
| |
| /* Nonzero means that this _CLASSTYPE node overloads operator=(X&). */ |
| #define TYPE_HAS_COPY_ASSIGN(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_copy_assign) |
| |
| /* True iff the class type NODE has an "operator =" whose parameter |
| has a parameter of type "const X&". */ |
| #define TYPE_HAS_CONST_COPY_ASSIGN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_const_copy_assign) |
| |
| /* Nonzero means that this _CLASSTYPE node has an X(X&) constructor. */ |
| #define TYPE_HAS_COPY_CTOR(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_copy_ctor) |
| #define TYPE_HAS_CONST_COPY_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_const_copy_ctor) |
| |
| /* Nonzero if this class has an X(initializer_list<T>) constructor. */ |
| #define TYPE_HAS_LIST_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_list_ctor) |
| |
| /* Nonzero if this class has a constexpr constructor other than a copy/move |
| constructor. Note that a class can have constexpr constructors for |
| static initialization even if it isn't a literal class. */ |
| #define TYPE_HAS_CONSTEXPR_CTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_constexpr_ctor) |
| |
| /* Nonzero if this class defines an overloaded operator new. (An |
| operator new [] doesn't count.) */ |
| #define TYPE_HAS_NEW_OPERATOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_new) |
| |
| /* Nonzero if this class defines an overloaded operator new[]. */ |
| #define TYPE_HAS_ARRAY_NEW_OPERATOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_array_new) |
| |
| /* Nonzero means that this type is being defined. I.e., the left brace |
| starting the definition of this type has been seen. */ |
| #define TYPE_BEING_DEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->being_defined) |
| |
| /* Nonzero means that this type is either complete or being defined, so we |
| can do lookup in it. */ |
| #define COMPLETE_OR_OPEN_TYPE_P(NODE) \ |
| (COMPLETE_TYPE_P (NODE) || (CLASS_TYPE_P (NODE) && TYPE_BEING_DEFINED (NODE))) |
| |
| /* Mark bits for repeated base checks. */ |
| #define TYPE_MARKED_P(NODE) TREE_LANG_FLAG_6 (TYPE_CHECK (NODE)) |
| |
| /* Nonzero if the class NODE has multiple paths to the same (virtual) |
| base object. */ |
| #define CLASSTYPE_DIAMOND_SHAPED_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK(NODE)->diamond_shaped) |
| |
| /* Nonzero if the class NODE has multiple instances of the same base |
| type. */ |
| #define CLASSTYPE_REPEATED_BASE_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK(NODE)->repeated_base) |
| |
| /* The member function with which the vtable will be emitted: |
| the first noninline non-pure-virtual member function. NULL_TREE |
| if there is no key function or if this is a class template */ |
| #define CLASSTYPE_KEY_METHOD(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->key_method) |
| |
| /* Vector of members. During definition, it is unordered and only |
| member functions are present. After completion it is sorted and |
| contains both member functions and non-functions. STAT_HACK is |
| involved to preserve oneslot per name invariant. */ |
| #define CLASSTYPE_MEMBER_VEC(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->members) |
| |
| /* For class templates, this is a TREE_LIST of all member data, |
| functions, types, and friends in the order of declaration. |
| The TREE_PURPOSE of each TREE_LIST is NULL_TREE for a friend, |
| and the RECORD_TYPE for the class template otherwise. */ |
| #define CLASSTYPE_DECL_LIST(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->decl_list) |
| |
| /* A FUNCTION_DECL or OVERLOAD for the constructors for NODE. These |
| are the constructors that take an in-charge parameter. */ |
| #define CLASSTYPE_CONSTRUCTORS(NODE) \ |
| (get_class_binding_direct (NODE, ctor_identifier)) |
| |
| /* A FUNCTION_DECL for the destructor for NODE. This is the |
| destructors that take an in-charge parameter. If |
| CLASSTYPE_LAZY_DESTRUCTOR is true, then this entry will be NULL |
| until the destructor is created with lazily_declare_fn. */ |
| #define CLASSTYPE_DESTRUCTOR(NODE) \ |
| (get_class_binding_direct (NODE, dtor_identifier)) |
| |
| /* Nonzero if NODE has a primary base class, i.e., a base class with |
| which it shares the virtual function table pointer. */ |
| #define CLASSTYPE_HAS_PRIMARY_BASE_P(NODE) \ |
| (CLASSTYPE_PRIMARY_BINFO (NODE) != NULL_TREE) |
| |
| /* If non-NULL, this is the binfo for the primary base class, i.e., |
| the base class which contains the virtual function table pointer |
| for this class. */ |
| #define CLASSTYPE_PRIMARY_BINFO(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->primary_base) |
| |
| /* A vector of BINFOs for the direct and indirect virtual base classes |
| that this type uses in a post-order depth-first left-to-right |
| order. (In other words, these bases appear in the order that they |
| should be initialized.) */ |
| #define CLASSTYPE_VBASECLASSES(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vbases) |
| |
| /* The type corresponding to NODE when NODE is used as a base class, |
| i.e., NODE without virtual base classes or tail padding. */ |
| #define CLASSTYPE_AS_BASE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->as_base) |
| |
| /* True iff NODE is the CLASSTYPE_AS_BASE version of some type. */ |
| #define IS_FAKE_BASE_TYPE(NODE) \ |
| (TREE_CODE (NODE) == RECORD_TYPE \ |
| && TYPE_CONTEXT (NODE) && CLASS_TYPE_P (TYPE_CONTEXT (NODE)) \ |
| && CLASSTYPE_AS_BASE (TYPE_CONTEXT (NODE)) == (NODE)) |
| |
| /* These are the size and alignment of the type without its virtual |
| base classes, for when we use this type as a base itself. */ |
| #define CLASSTYPE_SIZE(NODE) TYPE_SIZE (CLASSTYPE_AS_BASE (NODE)) |
| #define CLASSTYPE_SIZE_UNIT(NODE) TYPE_SIZE_UNIT (CLASSTYPE_AS_BASE (NODE)) |
| #define CLASSTYPE_ALIGN(NODE) TYPE_ALIGN (CLASSTYPE_AS_BASE (NODE)) |
| #define CLASSTYPE_USER_ALIGN(NODE) TYPE_USER_ALIGN (CLASSTYPE_AS_BASE (NODE)) |
| |
| /* The alignment of NODE, without its virtual bases, in bytes. */ |
| #define CLASSTYPE_ALIGN_UNIT(NODE) \ |
| (CLASSTYPE_ALIGN (NODE) / BITS_PER_UNIT) |
| |
| /* A vec<tree> of virtual functions which cannot be inherited by |
| derived classes. When deriving from this type, the derived |
| class must provide its own definition for each of these functions. */ |
| #define CLASSTYPE_PURE_VIRTUALS(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->pure_virtuals) |
| |
| /* Nonzero means that this type is an abstract class type. */ |
| #define ABSTRACT_CLASS_TYPE_P(NODE) \ |
| (CLASS_TYPE_P (NODE) && CLASSTYPE_PURE_VIRTUALS(NODE)) |
| |
| /* Nonzero means that this type has an X() constructor. */ |
| #define TYPE_HAS_DEFAULT_CONSTRUCTOR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->has_default_ctor) |
| |
| /* Nonzero means that this type contains a mutable member. */ |
| #define CLASSTYPE_HAS_MUTABLE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_mutable) |
| #define TYPE_HAS_MUTABLE_P(NODE) (cp_has_mutable_p (NODE)) |
| |
| /* Nonzero means that this class type is not POD for the purpose of layout |
| (as defined in the ABI). This is different from the language's POD. */ |
| #define CLASSTYPE_NON_LAYOUT_POD_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->non_pod_class) |
| |
| /* Nonzero means that this class type is a non-standard-layout class. */ |
| #define CLASSTYPE_NON_STD_LAYOUT(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->non_std_layout) |
| |
| /* Nonzero means that this class type does have unique object |
| representations. */ |
| #define CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->unique_obj_representations) |
| |
| /* Nonzero means that this class type has |
| CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS computed. */ |
| #define CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->unique_obj_representations_set) |
| |
| /* Nonzero means that this class contains pod types whose default |
| initialization is not a zero initialization (namely, pointers to |
| data members). */ |
| #define CLASSTYPE_NON_ZERO_INIT_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->non_zero_init) |
| |
| /* Nonzero if this class is "empty" in the sense of the C++ ABI. */ |
| #define CLASSTYPE_EMPTY_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->empty_p) |
| |
| /* Nonzero if this class is "nearly empty", i.e., contains only a |
| virtual function table pointer. */ |
| #define CLASSTYPE_NEARLY_EMPTY_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->nearly_empty_p) |
| |
| /* Nonzero if this class contains an empty subobject. */ |
| #define CLASSTYPE_CONTAINS_EMPTY_CLASS_P(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->contains_empty_class_p) |
| |
| /* A list of class types of which this type is a friend. The |
| TREE_VALUE is normally a TYPE, but will be a TEMPLATE_DECL in the |
| case of a template friend. */ |
| #define CLASSTYPE_FRIEND_CLASSES(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->friend_classes) |
| |
| /* A list of the classes which grant friendship to this class. */ |
| #define CLASSTYPE_BEFRIENDING_CLASSES(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->befriending_classes) |
| |
| /* The associated LAMBDA_EXPR that made this class. */ |
| #define CLASSTYPE_LAMBDA_EXPR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->lambda_expr) |
| /* The extra mangling scope for this closure type. */ |
| #define LAMBDA_TYPE_EXTRA_SCOPE(NODE) \ |
| (LAMBDA_EXPR_EXTRA_SCOPE (CLASSTYPE_LAMBDA_EXPR (NODE))) |
| |
| /* Say whether this node was declared as a "class" or a "struct". */ |
| #define CLASSTYPE_DECLARED_CLASS(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->declared_class) |
| |
| /* Nonzero if this class has const members |
| which have no specified initialization. */ |
| #define CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE) \ |
| (TYPE_LANG_SPECIFIC (NODE) \ |
| ? LANG_TYPE_CLASS_CHECK (NODE)->const_needs_init : 0) |
| #define SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE, VALUE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->const_needs_init = (VALUE)) |
| |
| /* Nonzero if this class has ref members |
| which have no specified initialization. */ |
| #define CLASSTYPE_REF_FIELDS_NEED_INIT(NODE) \ |
| (TYPE_LANG_SPECIFIC (NODE) \ |
| ? LANG_TYPE_CLASS_CHECK (NODE)->ref_needs_init : 0) |
| #define SET_CLASSTYPE_REF_FIELDS_NEED_INIT(NODE, VALUE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->ref_needs_init = (VALUE)) |
| |
| /* Nonzero if this class is included from a header file which employs |
| `#pragma interface', and it is not included in its implementation file. */ |
| #define CLASSTYPE_INTERFACE_ONLY(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_only) |
| |
| /* True if we have already determined whether or not vtables, VTTs, |
| typeinfo, and other similar per-class data should be emitted in |
| this translation unit. This flag does not indicate whether or not |
| these items should be emitted; it only indicates that we know one |
| way or the other. */ |
| #define CLASSTYPE_INTERFACE_KNOWN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown == 0) |
| /* The opposite of CLASSTYPE_INTERFACE_KNOWN. */ |
| #define CLASSTYPE_INTERFACE_UNKNOWN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown) |
| |
| #define SET_CLASSTYPE_INTERFACE_UNKNOWN_X(NODE,X) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = !!(X)) |
| #define SET_CLASSTYPE_INTERFACE_UNKNOWN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 1) |
| #define SET_CLASSTYPE_INTERFACE_KNOWN(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 0) |
| |
| /* Nonzero if a _DECL node requires us to output debug info for this class. */ |
| #define CLASSTYPE_DEBUG_REQUESTED(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->debug_requested) |
| |
| /* True if we saw errors while instantiating this class. */ |
| #define CLASSTYPE_ERRONEOUS(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->erroneous) |
| |
| /* Additional macros for inheritance information. */ |
| |
| /* Nonzero means that this class is on a path leading to a new vtable. */ |
| #define BINFO_VTABLE_PATH_MARKED(NODE) BINFO_FLAG_1 (NODE) |
| |
| /* Nonzero means B (a BINFO) has its own vtable. Any copies will not |
| have this flag set. */ |
| #define BINFO_NEW_VTABLE_MARKED(B) (BINFO_FLAG_2 (B)) |
| |
| /* Compare a BINFO_TYPE with another type for equality. For a binfo, |
| this is functionally equivalent to using same_type_p, but |
| measurably faster. At least one of the arguments must be a |
| BINFO_TYPE. The other can be a BINFO_TYPE or a regular type. If |
| BINFO_TYPE(T) ever stops being the main variant of the class the |
| binfo is for, this macro must change. */ |
| #define SAME_BINFO_TYPE_P(A, B) ((A) == (B)) |
| |
| /* Any subobject that needs a new vtable must have a vptr and must not |
| be a non-virtual primary base (since it would then use the vtable from a |
| derived class and never become non-primary.) */ |
| #define SET_BINFO_NEW_VTABLE_MARKED(B) \ |
| (BINFO_NEW_VTABLE_MARKED (B) = 1, \ |
| gcc_assert (!BINFO_PRIMARY_P (B) || BINFO_VIRTUAL_P (B)), \ |
| gcc_assert (TYPE_VFIELD (BINFO_TYPE (B)))) |
| |
| /* Nonzero if this binfo is for a dependent base - one that should not |
| be searched. */ |
| #define BINFO_DEPENDENT_BASE_P(NODE) BINFO_FLAG_3 (NODE) |
| |
| /* Nonzero if this binfo has lost its primary base binfo (because that |
| is a nearly-empty virtual base that has been taken by some other |
| base in the complete hierarchy. */ |
| #define BINFO_LOST_PRIMARY_P(NODE) BINFO_FLAG_4 (NODE) |
| |
| /* Nonzero if this BINFO is a primary base class. */ |
| #define BINFO_PRIMARY_P(NODE) BINFO_FLAG_5(NODE) |
| |
| /* A vec<tree_pair_s> of the vcall indices associated with the class |
| NODE. The PURPOSE of each element is a FUNCTION_DECL for a virtual |
| function. The VALUE is the index into the virtual table where the |
| vcall offset for that function is stored, when NODE is a virtual |
| base. */ |
| #define CLASSTYPE_VCALL_INDICES(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->vcall_indices) |
| |
| /* The various vtables for the class NODE. The primary vtable will be |
| first, followed by the construction vtables and VTT, if any. */ |
| #define CLASSTYPE_VTABLES(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->vtables) |
| |
| /* The std::type_info variable representing this class, or NULL if no |
| such variable has been created. This field is only set for the |
| TYPE_MAIN_VARIANT of the class. */ |
| #define CLASSTYPE_TYPEINFO_VAR(NODE) \ |
| (LANG_TYPE_CLASS_CHECK (NODE)->typeinfo_var) |
| |
| /* Accessor macros for the BINFO_VIRTUALS list. */ |
| |
| /* The number of bytes by which to adjust the `this' pointer when |
| calling this virtual function. Subtract this value from the this |
| pointer. Always non-NULL, might be constant zero though. */ |
| #define BV_DELTA(NODE) (TREE_PURPOSE (NODE)) |
| |
| /* If non-NULL, the vtable index at which to find the vcall offset |
| when calling this virtual function. Add the value at that vtable |
| index to the this pointer. */ |
| #define BV_VCALL_INDEX(NODE) (TREE_TYPE (NODE)) |
| |
| /* The function to call. */ |
| #define BV_FN(NODE) (TREE_VALUE (NODE)) |
| |
| /* Whether or not this entry is for a lost primary virtual base. */ |
| #define BV_LOST_PRIMARY(NODE) (TREE_LANG_FLAG_0 (NODE)) |
| |
| /* For FUNCTION_TYPE or METHOD_TYPE, a list of the exceptions that |
| this type can raise. Each TREE_VALUE is a _TYPE. The TREE_VALUE |
| will be NULL_TREE to indicate a throw specification of `()', or |
| no exceptions allowed. For a noexcept specification, TREE_VALUE |
| is NULL_TREE and TREE_PURPOSE is the constant-expression. For |
| a deferred noexcept-specification, TREE_PURPOSE is a DEFERRED_NOEXCEPT |
| (for templates) or an OVERLOAD list of functions (for implicitly |
| declared functions). */ |
| #define TYPE_RAISES_EXCEPTIONS(NODE) \ |
| TYPE_LANG_SLOT_1 (FUNC_OR_METHOD_CHECK (NODE)) |
| |
| /* For FUNCTION_TYPE or METHOD_TYPE, return 1 iff it is declared `throw()' |
| or noexcept(true). */ |
| #define TYPE_NOTHROW_P(NODE) nothrow_spec_p (TYPE_RAISES_EXCEPTIONS (NODE)) |
| |
| /* For FUNCTION_TYPE or METHOD_TYPE, true if NODE is noexcept. This is the |
| case for things declared noexcept(true) and, with -fnothrow-opt, for |
| throw() functions. */ |
| #define TYPE_NOEXCEPT_P(NODE) type_noexcept_p (NODE) |
| |
| /* The binding level associated with the namespace. */ |
| #define NAMESPACE_LEVEL(NODE) \ |
| (LANG_DECL_NS_CHECK (NODE)->level) |
| |
| /* Discriminator values for lang_decl. */ |
| |
| enum lang_decl_selector |
| { |
| lds_min, |
| lds_fn, |
| lds_ns, |
| lds_parm, |
| lds_decomp |
| }; |
| |
| /* Flags shared by all forms of DECL_LANG_SPECIFIC. |
| |
| Some of the flags live here only to make lang_decl_min/fn smaller. Do |
| not make this struct larger than 32 bits. */ |
| |
| struct GTY(()) lang_decl_base { |
| ENUM_BITFIELD(lang_decl_selector) selector : 3; |
| ENUM_BITFIELD(languages) language : 1; |
| unsigned use_template : 2; |
| unsigned not_really_extern : 1; /* var or fn */ |
| unsigned initialized_in_class : 1; /* var or fn */ |
| |
| unsigned threadprivate_or_deleted_p : 1; /* var or fn */ |
| /* anticipated_p is no longer used for anticipated_decls (fn, type |
| or template). It is used as DECL_OMP_PRIVATIZED_MEMBER in |
| var. */ |
| unsigned anticipated_p : 1; |
| unsigned friend_or_tls : 1; /* var, fn, type or template */ |
| unsigned unknown_bound_p : 1; /* var */ |
| unsigned odr_used : 1; /* var or fn */ |
| unsigned concept_p : 1; /* applies to vars and functions */ |
| unsigned var_declared_inline_p : 1; /* var */ |
| unsigned dependent_init_p : 1; /* var */ |
| |
| /* The following apply to VAR, FUNCTION, TYPE, CONCEPT, & NAMESPACE |
| decls. */ |
| unsigned module_purview_p : 1; /* in module purview (not GMF) */ |
| unsigned module_import_p : 1; /* from an import */ |
| unsigned module_entity_p : 1; /* is in the entitity ary & |
| hash. */ |
| /* VAR_DECL or FUNCTION_DECL has attached decls. */ |
| unsigned module_attached_p : 1; |
| |
| /* 12 spare bits. */ |
| }; |
| |
| /* True for DECL codes which have template info and access. */ |
| #define LANG_DECL_HAS_MIN(NODE) \ |
| (VAR_OR_FUNCTION_DECL_P (NODE) \ |
| || TREE_CODE (NODE) == FIELD_DECL \ |
| || TREE_CODE (NODE) == CONST_DECL \ |
| || TREE_CODE (NODE) == TYPE_DECL \ |
| || TREE_CODE (NODE) == TEMPLATE_DECL \ |
| || TREE_CODE (NODE) == USING_DECL \ |
| || TREE_CODE (NODE) == CONCEPT_DECL) |
| |
| /* DECL_LANG_SPECIFIC for the above codes. */ |
| |
| struct GTY(()) lang_decl_min { |
| struct lang_decl_base base; /* 32-bits. */ |
| |
| /* In a FUNCTION_DECL for which DECL_THUNK_P holds, this is |
| THUNK_ALIAS. |
| In a FUNCTION_DECL for which DECL_THUNK_P does not hold, |
| VAR_DECL, TYPE_DECL, or TEMPLATE_DECL, this is |
| DECL_TEMPLATE_INFO. */ |
| tree template_info; |
| |
| /* In a DECL_THUNK_P FUNCTION_DECL, this is THUNK_VIRTUAL_OFFSET. |
| In a lambda-capture proxy VAR_DECL, this is DECL_CAPTURED_VARIABLE. |
| In a function-scope TREE_STATIC VAR_DECL or IMPLICIT_TYPEDEF_P TYPE_DECL, |
| this is DECL_DISCRIMINATOR. |
| In a DECL_LOCAL_DECL_P decl, this is the namespace decl it aliases. |
| Otherwise, in a class-scope DECL, this is DECL_ACCESS. */ |
| tree access; |
| }; |
| |
| /* Additional DECL_LANG_SPECIFIC information for functions. */ |
| |
| struct GTY(()) lang_decl_fn { |
| struct lang_decl_min min; |
| |
| /* In a overloaded operator, this is the compressed operator code. */ |
| unsigned ovl_op_code : 6; |
| unsigned global_ctor_p : 1; |
| unsigned global_dtor_p : 1; |
| |
| unsigned static_function : 1; |
| unsigned pure_virtual : 1; |
| unsigned defaulted_p : 1; |
| unsigned has_in_charge_parm_p : 1; |
| unsigned has_vtt_parm_p : 1; |
| unsigned pending_inline_p : 1; |
| unsigned nonconverting : 1; |
| unsigned thunk_p : 1; |
| |
| unsigned this_thunk_p : 1; |
| unsigned omp_declare_reduction_p : 1; |
| unsigned has_dependent_explicit_spec_p : 1; |
| unsigned immediate_fn_p : 1; |
| unsigned maybe_deleted : 1; |
| unsigned coroutine_p : 1; |
| |
| unsigned spare : 10; |
| |
| /* 32-bits padding on 64-bit host. */ |
| |
| /* For a non-thunk function decl, this is a tree list of |
| friendly classes. For a thunk function decl, it is the |
| thunked to function decl. */ |
| tree befriending_classes; |
| |
| /* For a virtual FUNCTION_DECL for which |
| DECL_THIS_THUNK_P does not hold, this is DECL_THUNKS. Both |
| this pointer and result pointer adjusting thunks are |
| chained here. This pointer thunks to return pointer thunks |
| will be chained on the return pointer thunk. |
| For a DECL_CONSTUCTOR_P FUNCTION_DECL, this is the base from |
| whence we inherit. Otherwise, it is the class in which a |
| (namespace-scope) friend is defined (if any). */ |
| tree context; |
| |
| union lang_decl_u5 |
| { |
| /* In a non-thunk FUNCTION_DECL, this is DECL_CLONED_FUNCTION. */ |
| tree GTY ((tag ("0"))) cloned_function; |
| |
| /* In a FUNCTION_DECL for which THUNK_P holds this is the |
| THUNK_FIXED_OFFSET. */ |
| HOST_WIDE_INT GTY ((tag ("1"))) fixed_offset; |
| } GTY ((desc ("%1.thunk_p"))) u5; |
| |
| union lang_decl_u3 |
| { |
| struct cp_token_cache * GTY ((tag ("1"))) pending_inline_info; |
| tree GTY ((tag ("0"))) saved_auto_return_type; |
| } GTY ((desc ("%1.pending_inline_p"))) u; |
| |
| }; |
| |
| /* DECL_LANG_SPECIFIC for namespaces. */ |
| |
| struct GTY(()) lang_decl_ns { |
| struct lang_decl_base base; /* 32 bits. */ |
| cp_binding_level *level; |
| |
| /* Inline children. Needs to be va_gc, because of PCH. */ |
| vec<tree, va_gc> *inlinees; |
| |
| /* Hash table of bound decls. It'd be nice to have this inline, but |
| as the hash_map has a dtor, we can't then put this struct into a |
| union (until moving to c++11). */ |
| hash_table<named_decl_hash> *bindings; |
| }; |
| |
| /* DECL_LANG_SPECIFIC for parameters. */ |
| |
| struct GTY(()) lang_decl_parm { |
| struct lang_decl_base base; /* 32 bits. */ |
| int level; |
| int index; |
| }; |
| |
| /* Additional DECL_LANG_SPECIFIC information for structured bindings. */ |
| |
| struct GTY(()) lang_decl_decomp { |
| struct lang_decl_min min; |
| /* The artificial underlying "e" variable of the structured binding |
| variable. */ |
| tree base; |
| }; |
| |
| /* DECL_LANG_SPECIFIC for all types. It would be nice to just make this a |
| union rather than a struct containing a union as its only field, but |
| tree.h declares it as a struct. */ |
| |
| struct GTY(()) lang_decl { |
| union GTY((desc ("%h.base.selector"))) lang_decl_u { |
| /* Nothing of only the base type exists. */ |
| struct lang_decl_base GTY ((default)) base; |
| struct lang_decl_min GTY((tag ("lds_min"))) min; |
| struct lang_decl_fn GTY ((tag ("lds_fn"))) fn; |
| struct lang_decl_ns GTY((tag ("lds_ns"))) ns; |
| struct lang_decl_parm GTY((tag ("lds_parm"))) parm; |
| struct lang_decl_decomp GTY((tag ("lds_decomp"))) decomp; |
| } u; |
| }; |
| |
| /* Looks through a template (if present) to find what it declares. */ |
| #define STRIP_TEMPLATE(NODE) \ |
| (TREE_CODE (NODE) == TEMPLATE_DECL ? DECL_TEMPLATE_RESULT (NODE) : NODE) |
| |
| #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
| |
| #define LANG_DECL_MIN_CHECK(NODE) __extension__ \ |
| ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \ |
| if (!LANG_DECL_HAS_MIN (NODE)) \ |
| lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \ |
| <->u.min; }) |
| |
| /* We want to be able to check DECL_CONSTRUCTOR_P and such on a function |
| template, not just on a FUNCTION_DECL. So when looking for things in |
| lang_decl_fn, look down through a TEMPLATE_DECL into its result. */ |
| #define LANG_DECL_FN_CHECK(NODE) __extension__ \ |
| ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (STRIP_TEMPLATE (NODE)); \ |
| if (!DECL_DECLARES_FUNCTION_P (NODE) \ |
| || lt->u.base.selector != lds_fn) \ |
| lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \ |
| <->u.fn; }) |
| |
| #define LANG_DECL_NS_CHECK(NODE) __extension__ \ |
| ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \ |
| if (TREE_CODE (NODE) != NAMESPACE_DECL \ |
| || lt->u.base.selector != lds_ns) \ |
| lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \ |
| <->u.ns; }) |
| |
| #define LANG_DECL_PARM_CHECK(NODE) __extension__ \ |
| ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \ |
| if (TREE_CODE (NODE) != PARM_DECL \ |
| || lt->u.base.selector != lds_parm) \ |
| lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \ |
| <->u.parm; }) |
| |
| #define LANG_DECL_DECOMP_CHECK(NODE) __extension__ \ |
| ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \ |
| if (!VAR_P (NODE) \ |
| || lt->u.base.selector != lds_decomp) \ |
| lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \ |
| <->u.decomp; }) |
| |
| #else |
| |
| #define LANG_DECL_MIN_CHECK(NODE) \ |
| (&DECL_LANG_SPECIFIC (NODE)->u.min) |
| |
| #define LANG_DECL_FN_CHECK(NODE) \ |
| (&DECL_LANG_SPECIFIC (STRIP_TEMPLATE (NODE))->u.fn) |
| |
| #define LANG_DECL_NS_CHECK(NODE) \ |
| (&DECL_LANG_SPECIFIC (NODE)->u.ns) |
| |
| #define LANG_DECL_PARM_CHECK(NODE) \ |
| (&DECL_LANG_SPECIFIC (NODE)->u.parm) |
| |
| #define LANG_DECL_DECOMP_CHECK(NODE) \ |
| (&DECL_LANG_SPECIFIC (NODE)->u.decomp) |
| |
| #endif /* ENABLE_TREE_CHECKING */ |
| |
| /* For a FUNCTION_DECL or a VAR_DECL, the language linkage for the |
| declaration. Some entities (like a member function in a local |
| class, or a local variable) do not have linkage at all, and this |
| macro should not be used in those cases. |
| |
| Implementation note: A FUNCTION_DECL without DECL_LANG_SPECIFIC was |
| created by language-independent code, and has C linkage. Most |
| VAR_DECLs have C++ linkage, and do not have DECL_LANG_SPECIFIC, but |
| we do create DECL_LANG_SPECIFIC for variables with non-C++ linkage. */ |
| #define DECL_LANGUAGE(NODE) \ |
| (DECL_LANG_SPECIFIC (NODE) \ |
| ? DECL_LANG_SPECIFIC (NODE)->u.base.language \ |
| : (TREE_CODE (NODE) == FUNCTION_DECL \ |
| ? lang_c : lang_cplusplus)) |
| |
| /* Set the language linkage for NODE to LANGUAGE. */ |
| #define SET_DECL_LANGUAGE(NODE, LANGUAGE) \ |
| (DECL_LANG_SPECIFIC (NODE)->u.base.language = (LANGUAGE)) |
| |
| /* For FUNCTION_DECLs and TEMPLATE_DECLs: nonzero means that this function |
| is a constructor. */ |
| #define DECL_CONSTRUCTOR_P(NODE) \ |
| DECL_CXX_CONSTRUCTOR_P (STRIP_TEMPLATE (NODE)) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a complete |
| object. */ |
| #define DECL_COMPLETE_CONSTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == complete_ctor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a base |
| object. */ |
| #define DECL_BASE_CONSTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == base_ctor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a constructor, but not either the |
| specialized in-charge constructor or the specialized not-in-charge |
| constructor. */ |
| #define DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == ctor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a copy constructor. */ |
| #define DECL_COPY_CONSTRUCTOR_P(NODE) \ |
| (DECL_CONSTRUCTOR_P (NODE) && copy_fn_p (NODE) > 0) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a move constructor. */ |
| #define DECL_MOVE_CONSTRUCTOR_P(NODE) \ |
| (DECL_CONSTRUCTOR_P (NODE) && move_fn_p (NODE)) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL or TEMPLATE_DECL) |
| is a destructor. */ |
| #define DECL_DESTRUCTOR_P(NODE) \ |
| DECL_CXX_DESTRUCTOR_P (STRIP_TEMPLATE (NODE)) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a destructor, but not the |
| specialized in-charge constructor, in-charge deleting constructor, |
| or the base destructor. */ |
| #define DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == dtor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete |
| object. */ |
| #define DECL_COMPLETE_DESTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == complete_dtor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a base |
| object. */ |
| #define DECL_BASE_DESTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == base_dtor_identifier) |
| |
| /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete |
| object that deletes the object after it has been destroyed. */ |
| #define DECL_DELETING_DESTRUCTOR_P(NODE) \ |
| (DECL_NAME (NODE) == deleting_dtor_identifier) |
| |
| /* Nonzero if either DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P or |
| DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P is true of NODE. */ |
| #define DECL_MAYBE_IN_CHARGE_CDTOR_P(NODE) \ |
| (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (NODE) \ |
| || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (NODE)) |
| |
| /* Nonzero if NODE (a _DECL) is a cloned constructor or |
| destructor. */ |
| #define DECL_CLONED_FUNCTION_P(NODE) \ |
| (DECL_NAME (NODE) \ |
| && IDENTIFIER_CDTOR_P (DECL_NAME (NODE)) \ |
| && !DECL_MAYBE_IN_CHARGE_CDTOR_P (NODE)) |
| |
| /* If DECL_CLONED_FUNCTION_P holds, this is the function that was |
| cloned. */ |
| #define DECL_CLONED_FUNCTION(NODE) \ |
| (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE))->u.fn.u5.cloned_function) |
| |
| /* Perform an action for each clone of FN, if FN is a function with |
| clones. This macro should be used like: |
| |
| FOR_EACH_CLONE (clone, fn) |
| { ... } |
| |
| */ |
| #define FOR_EACH_CLONE(CLONE, FN) \ |
| if (!(TREE_CODE (FN) == FUNCTION_DECL \ |
| && DECL_MAYBE_IN_CHARGE_CDTOR_P (FN))) \ |
| ; \ |
| else \ |
| for (CLONE = DECL_CHAIN (FN); \ |
| CLONE && DECL_CLONED_FUNCTION_P (CLONE); \ |
| CLONE = DECL_CHAIN (CLONE)) |
| |
| /* Nonzero if NODE has DECL_DISCRIMINATOR and not DECL_ACCESS. */ |
| #define DECL_DISCRIMINATOR_P(NODE) \ |
| (((TREE_CODE (NODE) == VAR_DECL && TREE_STATIC (NODE)) \ |
| || DECL_IMPLICIT_TYPEDEF_P (NODE)) \ |
| && DECL_FUNCTION_SCOPE_P (NODE)) |
| |
| /* Discriminator for name mangling. */ |
| #define DECL_DISCRIMINATOR(NODE) (LANG_DECL_MIN_CHECK (NODE)->access) |
| |
| /* The index of a user-declared parameter in its function, starting at 1. |
| All artificial parameters will have index 0. */ |
| #define DECL_PARM_INDEX(NODE) \ |
| (LANG_DECL_PARM_CHECK (NODE)->index) |
| |
| /* The level of a user-declared parameter in its function, starting at 1. |
| A parameter of the function will have level 1; a parameter of the first |
| nested function declarator (i.e. t in void f (void (*p)(T t))) will have |
| level 2. */ |
| #define DECL_PARM_LEVEL(NODE) \ |
| (LANG_DECL_PARM_CHECK (NODE)->level) |
| |
| /* Nonzero if the VTT parm has been added to NODE. */ |
| #define DECL_HAS_VTT_PARM_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->has_vtt_parm_p) |
| |
| /* Nonzero if NODE is a user-defined conversion operator. */ |
| #define DECL_CONV_FN_P(NODE) IDENTIFIER_CONV_OP_P (DECL_NAME (NODE)) |
| |
| /* The type to which conversion operator FN converts to. */ |
| #define DECL_CONV_FN_TYPE(FN) \ |
| TREE_TYPE ((gcc_checking_assert (DECL_CONV_FN_P (FN)), DECL_NAME (FN))) |
| |
| /* Nonzero if NODE, a static data member, was declared in its class as an |
| array of unknown bound. */ |
| #define VAR_HAD_UNKNOWN_BOUND(NODE) \ |
| (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \ |
| ? DECL_LANG_SPECIFIC (NODE)->u.base.unknown_bound_p \ |
| : false) |
| #define SET_VAR_HAD_UNKNOWN_BOUND(NODE) \ |
| (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE))->u.base.unknown_bound_p = true) |
| |
| /* True iff decl NODE is for an overloaded operator. */ |
| #define DECL_OVERLOADED_OPERATOR_P(NODE) \ |
| IDENTIFIER_ANY_OP_P (DECL_NAME (NODE)) |
| |
| /* Nonzero if NODE is an assignment operator (including += and such). */ |
| #define DECL_ASSIGNMENT_OPERATOR_P(NODE) \ |
| IDENTIFIER_ASSIGN_OP_P (DECL_NAME (NODE)) |
| |
| /* NODE is a function_decl for an overloaded operator. Return its |
| compressed (raw) operator code. Note that this is not a TREE_CODE. */ |
| #define DECL_OVERLOADED_OPERATOR_CODE_RAW(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->ovl_op_code) |
| |
| /* DECL is an overloaded operator. Test whether it is for TREE_CODE |
| (a literal constant). */ |
| #define DECL_OVERLOADED_OPERATOR_IS(DECL, CODE) \ |
| (DECL_OVERLOADED_OPERATOR_CODE_RAW (DECL) == OVL_OP_##CODE) |
| |
| /* For FUNCTION_DECLs: nonzero means that this function is a |
| constructor or a destructor with an extra in-charge parameter to |
| control whether or not virtual bases are constructed. */ |
| #define DECL_HAS_IN_CHARGE_PARM_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->has_in_charge_parm_p) |
| |
| /* Nonzero if DECL is a declaration of __builtin_constant_p. */ |
| #define DECL_IS_BUILTIN_CONSTANT_P(NODE) \ |
| (TREE_CODE (NODE) == FUNCTION_DECL \ |
| && DECL_BUILT_IN_CLASS (NODE) == BUILT_IN_NORMAL \ |
| && DECL_FUNCTION_CODE (NODE) == BUILT_IN_CONSTANT_P) |
| |
| /* Nonzero for _DECL means that this decl appears in (or will appear |
| in) as a member in a RECORD_TYPE or UNION_TYPE node. It is also for |
| detecting circularity in case members are multiply defined. In the |
| case of a VAR_DECL, it means that no definition has been seen, even |
| if an initializer has been. */ |
| #define DECL_IN_AGGR_P(NODE) (DECL_LANG_FLAG_3 (NODE)) |
| |
| /* Nonzero for a VAR_DECL means that the variable's initialization (if |
| any) has been processed. (In general, DECL_INITIALIZED_P is |
| !DECL_EXTERNAL, but static data members may be initialized even if |
| not defined.) */ |
| #define DECL_INITIALIZED_P(NODE) \ |
| (TREE_LANG_FLAG_1 (VAR_DECL_CHECK (NODE))) |
| |
| /* Nonzero for a VAR_DECL iff an explicit initializer was provided |
| or a non-trivial constructor is called. */ |
| #define DECL_NONTRIVIALLY_INITIALIZED_P(NODE) \ |
| (TREE_LANG_FLAG_6 (VAR_DECL_CHECK (NODE))) |
| |
| /* Nonzero for a VAR_DECL that was initialized with a |
| constant-expression. */ |
| #define DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P(NODE) \ |
| (TREE_LANG_FLAG_2 (VAR_DECL_CHECK (NODE))) |
| |
| /* Nonzero if the DECL was initialized in the class definition itself, |
| rather than outside the class. This is used for both static member |
| VAR_DECLS, and FUNCTION_DECLS that are defined in the class. */ |
| #define DECL_INITIALIZED_IN_CLASS_P(DECL) \ |
| (DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL)) \ |
| ->u.base.initialized_in_class) |
| |
| /* Nonzero if the DECL is used in the sense of 3.2 [basic.def.odr]. |
| Only available for decls with DECL_LANG_SPECIFIC. */ |
| #define DECL_ODR_USED(DECL) \ |
| (DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL)) \ |
| ->u.base.odr_used) |
| |
| /* Nonzero for FUNCTION_DECL means that this is a friend that is |
| either not pushed into a namespace/looked up in a class (because it |
| is a dependent type, in an uninstantiated template), or it has |
| /only/ been subject to hidden friend injection from one or more |
| befriending classes. Once another decl matches, the flag is |
| cleared. There are requirements on its default parms. */ |
| #define DECL_UNIQUE_FRIEND_P(NODE) \ |
| (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE)) \ |
| ->u.base.friend_or_tls) |
| |
| /* True of a TEMPLATE_DECL that is a template class friend. Such |
| decls are not pushed until instantiated (as they may depend on |
| parameters of the befriending class). DECL_CHAIN is the |
| befriending class. */ |
| #define DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P(NODE) \ |
| (DECL_LANG_FLAG_4 (TEMPLATE_DECL_CHECK (NODE))) |
| |
| /* Nonzero if the thread-local variable was declared with __thread as |
| opposed to thread_local. */ |
| #define DECL_GNU_TLS_P(NODE) \ |
| (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \ |
| && DECL_LANG_SPECIFIC (NODE)->u.base.friend_or_tls) |
| #define SET_DECL_GNU_TLS_P(NODE) \ |
| (retrofit_lang_decl (VAR_DECL_CHECK (NODE)), \ |
| DECL_LANG_SPECIFIC (NODE)->u.base.friend_or_tls = true) |
| |
| /* A TREE_LIST of the types which have befriended this FUNCTION_DECL. */ |
| #define DECL_BEFRIENDING_CLASSES(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->befriending_classes) |
| |
| /* Nonzero for FUNCTION_DECL means that this decl is a static |
| member function. */ |
| #define DECL_STATIC_FUNCTION_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->static_function) |
| |
| /* Nonzero for FUNCTION_DECL means that this decl is a non-static |
| member function. */ |
| #define DECL_NONSTATIC_MEMBER_FUNCTION_P(NODE) \ |
| (TREE_CODE (TREE_TYPE (NODE)) == METHOD_TYPE) |
| |
| /* Nonzero for FUNCTION_DECL means that this decl is a member function |
| (static or non-static). */ |
| #define DECL_FUNCTION_MEMBER_P(NODE) \ |
| (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) || DECL_STATIC_FUNCTION_P (NODE)) |
| |
| /* Nonzero for FUNCTION_DECL means that this member function |
| has `this' as const X *const. */ |
| #define DECL_CONST_MEMFUNC_P(NODE) \ |
| (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \ |
| && CP_TYPE_CONST_P (TREE_TYPE (TREE_VALUE \ |
| (TYPE_ARG_TYPES (TREE_TYPE (NODE)))))) |
| |
| /* Nonzero for FUNCTION_DECL means that this member function |
| has `this' as volatile X *const. */ |
| #define DECL_VOLATILE_MEMFUNC_P(NODE) \ |
| (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \ |
| && CP_TYPE_VOLATILE_P (TREE_TYPE (TREE_VALUE \ |
| (TYPE_ARG_TYPES (TREE_TYPE (NODE)))))) |
| |
| /* Nonzero for a DECL means that this member is a non-static member. */ |
| #define DECL_NONSTATIC_MEMBER_P(NODE) \ |
| (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \ |
| || TREE_CODE (NODE) == FIELD_DECL) |
| |
| /* Nonzero for a FIELD_DECL means that this member object type |
| is mutable. */ |
| #define DECL_MUTABLE_P(NODE) (DECL_LANG_FLAG_0 (FIELD_DECL_CHECK (NODE))) |
| |
| /* Nonzero for _DECL means that this constructor or conversion function is |
| non-converting. */ |
| #define DECL_NONCONVERTING_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->nonconverting) |
| |
| /* Nonzero for FUNCTION_DECL means that this member function is a pure |
| virtual function. */ |
| #define DECL_PURE_VIRTUAL_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->pure_virtual) |
| |
| /* Nonzero for FUNCTION_DECL means that this member function (either |
| a constructor or a conversion function) has an explicit specifier |
| with a value-dependent expression. */ |
| #define DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->has_dependent_explicit_spec_p) |
| |
| /* Nonzero for a defaulted FUNCTION_DECL for which we haven't decided yet if |
| it's deleted; we will decide in synthesize_method. */ |
| #define DECL_MAYBE_DELETED(NODE) \ |
| (LANG_DECL_FN_CHECK (NODE)->maybe_deleted) |
| |
| /* True (in a FUNCTION_DECL) if NODE is a virtual function that is an |
| invalid overrider for a function from a base class. Once we have |
| complained about an invalid overrider we avoid complaining about it |
| again. */ |
| #define DECL_INVALID_OVERRIDER_P(NODE) \ |
| (DECL_LANG_FLAG_4 (NODE)) |
| |
| /* True (in a FUNCTION_DECL) if NODE is a function declared with |
| an override virt-specifier */ |
| #define DECL_OVERRIDE_P(NODE) (TREE_LANG_FLAG_0 (NODE)) |
| |
| /* The thunks associated with NODE, a FUNCTION_DECL. */ |
| #define DECL_THUNKS(NODE) \ |
| (DECL_VIRTUAL_P (NODE) ? LANG_DECL_FN_CHECK (NODE)->context : NULL_TREE) |
| |
| /* Set DECL_THUNKS. */ |
| #define SET_DECL_THUNKS(NODE,THUNKS) \ |
| (LANG_DECL_FN_CHECK (NODE)->context = (THUNKS)) |
| |
| /* If NODE, a FUNCTION_DECL, is a C++11 inheriting constructor, then this |
| is the constructor it inherits from. */ |
| #define DECL_INHERITED_CTOR(NODE) \ |
| (DECL_DECLARES_FUNCTION_P (NODE) && DECL_CONSTRUCTOR_P (NODE) \ |
| ? LANG_DECL_FN_CHECK (NODE)->context : NULL_TREE) |
| |
| /* And this is the base that constructor comes from. */ |
| #define DECL_INHERITED_CTOR_BASE(NODE) \ |
| (DECL_INHERITED_CTOR (NODE) \ |
<