1/* Definitions for -*- C++ -*- parsing and type checking.
2 Copyright (C) 1987-2022 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify
8it under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 3, or (at your option)
10any later version.
11
12GCC is distributed in the hope that it will be useful,
13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3. If not see
19<http://www.gnu.org/licenses/>. */
20
21#ifndef GCC_CP_TREE_H
22#define GCC_CP_TREE_H
23
24#include "tm.h"
25#include "hard-reg-set.h"
26#include "function.h"
27#include "tristate.h"
28
29/* In order for the format checking to accept the C++ front end
30 diagnostic framework extensions, you must include this file before
31 diagnostic-core.h, not after. We override the definition of GCC_DIAG_STYLE
32 in c-common.h. */
33#undef GCC_DIAG_STYLE
34#define GCC_DIAG_STYLE __gcc_cxxdiag__
35#if defined(GCC_DIAGNOSTIC_CORE_H) || defined (GCC_C_COMMON_H)
36#error \
37In order for the format checking to accept the C++ front end diagnostic \
38framework extensions, you must include this file before diagnostic-core.h and \
39c-common.h, not after.
40#endif
41#include "c-family/c-common.h"
42#include "diagnostic.h"
43
44/* A tree node, together with a location, so that we can track locations
45 (and ranges) during parsing.
46
47 The location is redundant for node kinds that have locations,
48 but not all node kinds do (e.g. constants, and references to
49 params, locals, etc), so we stash a copy here. */
50
51extern location_t cp_expr_location (const_tree);
52
53class cp_expr
54{
55public:
56 cp_expr () :
57 m_value (NULL), m_loc (UNKNOWN_LOCATION) {}
58
59 cp_expr (tree value) :
60 m_value (value), m_loc (cp_expr_location (m_value)) {}
61
62 cp_expr (tree value, location_t loc):
63 m_value (value), m_loc (loc)
64 {
65 protected_set_expr_location (value, loc);
66 }
67
68 /* Implicit conversions to tree. */
69 operator tree () const { return m_value; }
70 tree & operator* () { return m_value; }
71 tree operator* () const { return m_value; }
72 tree & operator-> () { return m_value; }
73 tree operator-> () const { return m_value; }
74
75 tree get_value () const { return m_value; }
76 location_t get_location () const { return m_loc; }
77 location_t get_start () const
78 {
79 source_range src_range = get_range_from_loc (line_table, m_loc);
80 return src_range.m_start;
81 }
82 location_t get_finish () const
83 {
84 source_range src_range = get_range_from_loc (line_table, m_loc);
85 return src_range.m_finish;
86 }
87
88 void set_location (location_t loc)
89 {
90 protected_set_expr_location (m_value, loc);
91 m_loc = loc;
92 }
93
94 void set_range (location_t start, location_t finish)
95 {
96 set_location (make_location (m_loc, start, finish));
97 }
98
99 cp_expr& maybe_add_location_wrapper ()
100 {
101 m_value = maybe_wrap_with_location (m_value, m_loc);
102 return *this;
103 }
104
105 private:
106 tree m_value;
107 location_t m_loc;
108};
109
110inline bool
111operator == (const cp_expr &lhs, tree rhs)
112{
113 return lhs.get_value () == rhs;
114}
115
116
117enum cp_tree_index
118{
119 CPTI_WCHAR_DECL,
120 CPTI_VTABLE_ENTRY_TYPE,
121 CPTI_DELTA_TYPE,
122 CPTI_VTABLE_INDEX_TYPE,
123 CPTI_CLEANUP_TYPE,
124 CPTI_VTT_PARM_TYPE,
125
126 CPTI_CLASS_TYPE,
127 CPTI_UNKNOWN_TYPE,
128 CPTI_INIT_LIST_TYPE,
129 CPTI_EXPLICIT_VOID_LIST,
130 CPTI_VTBL_TYPE,
131 CPTI_VTBL_PTR_TYPE,
132 CPTI_GLOBAL,
133 CPTI_ABORT_FNDECL,
134 CPTI_AGGR_TAG,
135 CPTI_CONV_OP_MARKER,
136
137 CPTI_CTOR_IDENTIFIER,
138 CPTI_COMPLETE_CTOR_IDENTIFIER,
139 CPTI_BASE_CTOR_IDENTIFIER,
140 CPTI_DTOR_IDENTIFIER,
141 CPTI_COMPLETE_DTOR_IDENTIFIER,
142 CPTI_BASE_DTOR_IDENTIFIER,
143 CPTI_DELETING_DTOR_IDENTIFIER,
144 CPTI_CONV_OP_IDENTIFIER,
145 CPTI_DELTA_IDENTIFIER,
146 CPTI_IN_CHARGE_IDENTIFIER,
147 CPTI_VTT_PARM_IDENTIFIER,
148 CPTI_AS_BASE_IDENTIFIER,
149 CPTI_THIS_IDENTIFIER,
150 CPTI_PFN_IDENTIFIER,
151 CPTI_VPTR_IDENTIFIER,
152 CPTI_GLOBAL_IDENTIFIER,
153 CPTI_ANON_IDENTIFIER,
154 CPTI_AUTO_IDENTIFIER,
155 CPTI_DECLTYPE_AUTO_IDENTIFIER,
156 CPTI_INIT_LIST_IDENTIFIER,
157 CPTI_FOR_RANGE__IDENTIFIER,
158 CPTI_FOR_BEGIN__IDENTIFIER,
159 CPTI_FOR_END__IDENTIFIER,
160 CPTI_FOR_RANGE_IDENTIFIER,
161 CPTI_FOR_BEGIN_IDENTIFIER,
162 CPTI_FOR_END_IDENTIFIER,
163 CPTI_ABI_TAG_IDENTIFIER,
164 CPTI_ALIGNED_IDENTIFIER,
165 CPTI_BEGIN_IDENTIFIER,
166 CPTI_END_IDENTIFIER,
167 CPTI_GET_IDENTIFIER,
168 CPTI_GNU_IDENTIFIER,
169 CPTI_TUPLE_ELEMENT_IDENTIFIER,
170 CPTI_TUPLE_SIZE_IDENTIFIER,
171 CPTI_TYPE_IDENTIFIER,
172 CPTI_VALUE_IDENTIFIER,
173 CPTI_FUN_IDENTIFIER,
174 CPTI_CLOSURE_IDENTIFIER,
175 CPTI_HEAP_UNINIT_IDENTIFIER,
176 CPTI_HEAP_IDENTIFIER,
177 CPTI_HEAP_DELETED_IDENTIFIER,
178 CPTI_HEAP_VEC_UNINIT_IDENTIFIER,
179 CPTI_HEAP_VEC_IDENTIFIER,
180 CPTI_OMP_IDENTIFIER,
181
182 CPTI_LANG_NAME_C,
183 CPTI_LANG_NAME_CPLUSPLUS,
184
185 CPTI_EMPTY_EXCEPT_SPEC,
186 CPTI_NOEXCEPT_TRUE_SPEC,
187 CPTI_NOEXCEPT_FALSE_SPEC,
188 CPTI_NOEXCEPT_DEFERRED_SPEC,
189
190 CPTI_NULLPTR,
191 CPTI_NULLPTR_TYPE,
192
193 CPTI_ANY_TARG,
194
195 CPTI_MODULE_HWM,
196 /* Nodes after here change during compilation, or should not be in
197 the module's global tree table. Such nodes must be locatable
198 via name lookup or type-construction, as those are the only
199 cross-TU matching capabilities remaining. */
200
201 /* We must find these via the global namespace. */
202 CPTI_STD,
203 CPTI_ABI,
204
205 /* These are created at init time, but the library/headers provide
206 definitions. */
207 CPTI_ALIGN_TYPE,
208 CPTI_TERMINATE_FN,
209 CPTI_CALL_UNEXPECTED_FN,
210
211 /* These are lazily inited. */
212 CPTI_CONST_TYPE_INFO_TYPE,
213 CPTI_GET_EXCEPTION_PTR_FN,
214 CPTI_BEGIN_CATCH_FN,
215 CPTI_END_CATCH_FN,
216 CPTI_ALLOCATE_EXCEPTION_FN,
217 CPTI_FREE_EXCEPTION_FN,
218 CPTI_THROW_FN,
219 CPTI_RETHROW_FN,
220 CPTI_ATEXIT_FN_PTR_TYPE,
221 CPTI_ATEXIT,
222 CPTI_DSO_HANDLE,
223 CPTI_DCAST,
224
225 CPTI_SOURCE_LOCATION_IMPL,
226
227 CPTI_FALLBACK_DFLOAT32_TYPE,
228 CPTI_FALLBACK_DFLOAT64_TYPE,
229 CPTI_FALLBACK_DFLOAT128_TYPE,
230
231 CPTI_MAX
232};
233
234extern GTY(()) tree cp_global_trees[CPTI_MAX];
235
236#define wchar_decl_node cp_global_trees[CPTI_WCHAR_DECL]
237#define vtable_entry_type cp_global_trees[CPTI_VTABLE_ENTRY_TYPE]
238/* The type used to represent an offset by which to adjust the `this'
239 pointer in pointer-to-member types. */
240#define delta_type_node cp_global_trees[CPTI_DELTA_TYPE]
241/* The type used to represent an index into the vtable. */
242#define vtable_index_type cp_global_trees[CPTI_VTABLE_INDEX_TYPE]
243
244#define class_type_node cp_global_trees[CPTI_CLASS_TYPE]
245#define unknown_type_node cp_global_trees[CPTI_UNKNOWN_TYPE]
246#define init_list_type_node cp_global_trees[CPTI_INIT_LIST_TYPE]
247#define explicit_void_list_node cp_global_trees[CPTI_EXPLICIT_VOID_LIST]
248#define vtbl_type_node cp_global_trees[CPTI_VTBL_TYPE]
249#define vtbl_ptr_type_node cp_global_trees[CPTI_VTBL_PTR_TYPE]
250#define std_node cp_global_trees[CPTI_STD]
251#define abi_node cp_global_trees[CPTI_ABI]
252#define global_namespace cp_global_trees[CPTI_GLOBAL]
253#define const_type_info_type_node cp_global_trees[CPTI_CONST_TYPE_INFO_TYPE]
254#define conv_op_marker cp_global_trees[CPTI_CONV_OP_MARKER]
255#define abort_fndecl cp_global_trees[CPTI_ABORT_FNDECL]
256#define current_aggr cp_global_trees[CPTI_AGGR_TAG]
257#define nullptr_node cp_global_trees[CPTI_NULLPTR]
258#define nullptr_type_node cp_global_trees[CPTI_NULLPTR_TYPE]
259/* std::align_val_t */
260#define align_type_node cp_global_trees[CPTI_ALIGN_TYPE]
261
262/* We cache these tree nodes so as to call get_identifier less frequently.
263 For identifiers for functions, including special member functions such
264 as ctors and assignment operators, the nodes can be used (among other
265 things) to iterate over their overloads defined by/for a type. For
266 example:
267
268 tree ovlid = assign_op_identifier;
269 tree overloads = get_class_binding (type, ovlid);
270 for (ovl_iterator it (overloads); it; ++it) { ... }
271
272 iterates over the set of implicitly and explicitly defined overloads
273 of the assignment operator for type (including the copy and move
274 assignment operators, whether deleted or not). */
275
276/* The name of a constructor that takes an in-charge parameter to
277 decide whether or not to construct virtual base classes. */
278#define ctor_identifier cp_global_trees[CPTI_CTOR_IDENTIFIER]
279/* The name of a constructor that constructs virtual base classes. */
280#define complete_ctor_identifier cp_global_trees[CPTI_COMPLETE_CTOR_IDENTIFIER]
281/* The name of a constructor that does not construct virtual base classes. */
282#define base_ctor_identifier cp_global_trees[CPTI_BASE_CTOR_IDENTIFIER]
283/* The name of a destructor that takes an in-charge parameter to
284 decide whether or not to destroy virtual base classes and whether
285 or not to delete the object. */
286#define dtor_identifier cp_global_trees[CPTI_DTOR_IDENTIFIER]
287/* The name of a destructor that destroys virtual base classes. */
288#define complete_dtor_identifier cp_global_trees[CPTI_COMPLETE_DTOR_IDENTIFIER]
289/* The name of a destructor that does not destroy virtual base
290 classes. */
291#define base_dtor_identifier cp_global_trees[CPTI_BASE_DTOR_IDENTIFIER]
292/* The name of a destructor that destroys virtual base classes, and
293 then deletes the entire object. */
294#define deleting_dtor_identifier cp_global_trees[CPTI_DELETING_DTOR_IDENTIFIER]
295
296/* The name used for conversion operators -- but note that actual
297 conversion functions use special identifiers outside the identifier
298 table. */
299#define conv_op_identifier cp_global_trees[CPTI_CONV_OP_IDENTIFIER]
300
301#define delta_identifier cp_global_trees[CPTI_DELTA_IDENTIFIER]
302#define in_charge_identifier cp_global_trees[CPTI_IN_CHARGE_IDENTIFIER]
303/* The name of the parameter that contains a pointer to the VTT to use
304 for this subobject constructor or destructor. */
305#define vtt_parm_identifier cp_global_trees[CPTI_VTT_PARM_IDENTIFIER]
306#define as_base_identifier cp_global_trees[CPTI_AS_BASE_IDENTIFIER]
307#define this_identifier cp_global_trees[CPTI_THIS_IDENTIFIER]
308#define pfn_identifier cp_global_trees[CPTI_PFN_IDENTIFIER]
309#define vptr_identifier cp_global_trees[CPTI_VPTR_IDENTIFIER]
310/* The name of the ::, std & anon namespaces. */
311#define global_identifier cp_global_trees[CPTI_GLOBAL_IDENTIFIER]
312#define anon_identifier cp_global_trees[CPTI_ANON_IDENTIFIER]
313/* auto and declspec(auto) identifiers. */
314#define auto_identifier cp_global_trees[CPTI_AUTO_IDENTIFIER]
315#define decltype_auto_identifier cp_global_trees[CPTI_DECLTYPE_AUTO_IDENTIFIER]
316#define init_list_identifier cp_global_trees[CPTI_INIT_LIST_IDENTIFIER]
317#define for_range__identifier cp_global_trees[CPTI_FOR_RANGE__IDENTIFIER]
318#define for_begin__identifier cp_global_trees[CPTI_FOR_BEGIN__IDENTIFIER]
319#define for_end__identifier cp_global_trees[CPTI_FOR_END__IDENTIFIER]
320#define for_range_identifier cp_global_trees[CPTI_FOR_RANGE_IDENTIFIER]
321#define for_begin_identifier cp_global_trees[CPTI_FOR_BEGIN_IDENTIFIER]
322#define for_end_identifier cp_global_trees[CPTI_FOR_END_IDENTIFIER]
323#define abi_tag_identifier cp_global_trees[CPTI_ABI_TAG_IDENTIFIER]
324#define aligned_identifier cp_global_trees[CPTI_ALIGNED_IDENTIFIER]
325#define begin_identifier cp_global_trees[CPTI_BEGIN_IDENTIFIER]
326#define end_identifier cp_global_trees[CPTI_END_IDENTIFIER]
327#define get__identifier cp_global_trees[CPTI_GET_IDENTIFIER]
328#define gnu_identifier cp_global_trees[CPTI_GNU_IDENTIFIER]
329#define tuple_element_identifier cp_global_trees[CPTI_TUPLE_ELEMENT_IDENTIFIER]
330#define tuple_size_identifier cp_global_trees[CPTI_TUPLE_SIZE_IDENTIFIER]
331#define type_identifier cp_global_trees[CPTI_TYPE_IDENTIFIER]
332#define value_identifier cp_global_trees[CPTI_VALUE_IDENTIFIER]
333#define fun_identifier cp_global_trees[CPTI_FUN_IDENTIFIER]
334#define closure_identifier cp_global_trees[CPTI_CLOSURE_IDENTIFIER]
335#define heap_uninit_identifier cp_global_trees[CPTI_HEAP_UNINIT_IDENTIFIER]
336#define heap_identifier cp_global_trees[CPTI_HEAP_IDENTIFIER]
337#define heap_deleted_identifier cp_global_trees[CPTI_HEAP_DELETED_IDENTIFIER]
338#define heap_vec_uninit_identifier cp_global_trees[CPTI_HEAP_VEC_UNINIT_IDENTIFIER]
339#define heap_vec_identifier cp_global_trees[CPTI_HEAP_VEC_IDENTIFIER]
340#define omp_identifier cp_global_trees[CPTI_OMP_IDENTIFIER]
341#define lang_name_c cp_global_trees[CPTI_LANG_NAME_C]
342#define lang_name_cplusplus cp_global_trees[CPTI_LANG_NAME_CPLUSPLUS]
343
344/* Exception specifiers used for throw(), noexcept(true),
345 noexcept(false) and deferred noexcept. We rely on these being
346 uncloned. */
347#define empty_except_spec cp_global_trees[CPTI_EMPTY_EXCEPT_SPEC]
348#define noexcept_true_spec cp_global_trees[CPTI_NOEXCEPT_TRUE_SPEC]
349#define noexcept_false_spec cp_global_trees[CPTI_NOEXCEPT_FALSE_SPEC]
350#define noexcept_deferred_spec cp_global_trees[CPTI_NOEXCEPT_DEFERRED_SPEC]
351
352/* Exception handling function declarations. */
353#define terminate_fn cp_global_trees[CPTI_TERMINATE_FN]
354#define call_unexpected_fn cp_global_trees[CPTI_CALL_UNEXPECTED_FN]
355#define get_exception_ptr_fn cp_global_trees[CPTI_GET_EXCEPTION_PTR_FN]
356#define begin_catch_fn cp_global_trees[CPTI_BEGIN_CATCH_FN]
357#define end_catch_fn cp_global_trees[CPTI_END_CATCH_FN]
358#define allocate_exception_fn cp_global_trees[CPTI_ALLOCATE_EXCEPTION_FN]
359#define free_exception_fn cp_global_trees[CPTI_FREE_EXCEPTION_FN]
360#define throw_fn cp_global_trees[CPTI_THROW_FN]
361#define rethrow_fn cp_global_trees[CPTI_RETHROW_FN]
362
363/* The type of the function-pointer argument to "__cxa_atexit" (or
364 "std::atexit", if "__cxa_atexit" is not being used). */
365#define atexit_fn_ptr_type_node cp_global_trees[CPTI_ATEXIT_FN_PTR_TYPE]
366
367/* A pointer to `std::atexit'. */
368#define atexit_node cp_global_trees[CPTI_ATEXIT]
369
370/* A pointer to `__dso_handle'. */
371#define dso_handle_node cp_global_trees[CPTI_DSO_HANDLE]
372
373/* The declaration of the dynamic_cast runtime. */
374#define dynamic_cast_node cp_global_trees[CPTI_DCAST]
375
376/* The type of a destructor. */
377#define cleanup_type cp_global_trees[CPTI_CLEANUP_TYPE]
378
379/* The type of the vtt parameter passed to subobject constructors and
380 destructors. */
381#define vtt_parm_type cp_global_trees[CPTI_VTT_PARM_TYPE]
382
383/* A node which matches any template argument. */
384#define any_targ_node cp_global_trees[CPTI_ANY_TARG]
385
386/* std::source_location::__impl class. */
387#define source_location_impl cp_global_trees[CPTI_SOURCE_LOCATION_IMPL]
388
389/* Node to indicate default access. This must be distinct from the
390 access nodes in tree.h. */
391
392#define access_default_node null_node
393
394/* Variant of dfloat{32,64,128}_type_node only used for fundamental
395 rtti purposes if DFP is disabled. */
396#define fallback_dfloat32_type cp_global_trees[CPTI_FALLBACK_DFLOAT32_TYPE]
397#define fallback_dfloat64_type cp_global_trees[CPTI_FALLBACK_DFLOAT64_TYPE]
398#define fallback_dfloat128_type cp_global_trees[CPTI_FALLBACK_DFLOAT128_TYPE]
399
400
401#include "name-lookup.h"
402
403/* Usage of TREE_LANG_FLAG_?:
404 0: IDENTIFIER_KIND_BIT_0 (in IDENTIFIER_NODE)
405 NEW_EXPR_USE_GLOBAL (in NEW_EXPR).
406 COND_EXPR_IS_VEC_DELETE (in COND_EXPR).
407 DELETE_EXPR_USE_GLOBAL (in DELETE_EXPR).
408 CLEANUP_P (in TRY_BLOCK)
409 AGGR_INIT_VIA_CTOR_P (in AGGR_INIT_EXPR)
410 PTRMEM_OK_P (in ADDR_EXPR, OFFSET_REF, SCOPE_REF)
411 PAREN_STRING_LITERAL_P (in STRING_CST)
412 CP_DECL_THREAD_LOCAL_P (in VAR_DECL)
413 KOENIG_LOOKUP_P (in CALL_EXPR)
414 STATEMENT_LIST_NO_SCOPE (in STATEMENT_LIST).
415 EXPR_STMT_STMT_EXPR_RESULT (in EXPR_STMT)
416 STMT_EXPR_NO_SCOPE (in STMT_EXPR)
417 BIND_EXPR_TRY_BLOCK (in BIND_EXPR)
418 TYPENAME_IS_ENUM_P (in TYPENAME_TYPE)
419 OMP_FOR_GIMPLIFYING_P (in OMP_FOR, OMP_SIMD, OMP_DISTRIBUTE,
420 and OMP_TASKLOOP)
421 BASELINK_QUALIFIED_P (in BASELINK)
422 TARGET_EXPR_IMPLICIT_P (in TARGET_EXPR)
423 TEMPLATE_PARM_PARAMETER_PACK (in TEMPLATE_PARM_INDEX)
424 ATTR_IS_DEPENDENT (in the TREE_LIST for an attribute)
425 ABI_TAG_IMPLICIT (in the TREE_LIST for the argument of abi_tag)
426 LAMBDA_CAPTURE_EXPLICIT_P (in a TREE_LIST in LAMBDA_EXPR_CAPTURE_LIST)
427 PARENTHESIZED_LIST_P (in the TREE_LIST for a parameter-declaration-list)
428 CONSTRUCTOR_IS_DIRECT_INIT (in CONSTRUCTOR)
429 LAMBDA_EXPR_CAPTURES_THIS_P (in LAMBDA_EXPR)
430 DECLTYPE_FOR_LAMBDA_CAPTURE (in DECLTYPE_TYPE)
431 VEC_INIT_EXPR_IS_CONSTEXPR (in VEC_INIT_EXPR)
432 DECL_OVERRIDE_P (in FUNCTION_DECL)
433 IMPLICIT_CONV_EXPR_DIRECT_INIT (in IMPLICIT_CONV_EXPR)
434 TRANSACTION_EXPR_IS_STMT (in TRANSACTION_EXPR)
435 CONVERT_EXPR_VBASE_PATH (in CONVERT_EXPR)
436 PACK_EXPANSION_LOCAL_P (in *_PACK_EXPANSION)
437 TINFO_HAS_ACCESS_ERRORS (in TEMPLATE_INFO)
438 SIZEOF_EXPR_TYPE_P (in SIZEOF_EXPR)
439 COMPOUND_REQ_NOEXCEPT_P (in COMPOUND_REQ)
440 WILDCARD_PACK_P (in WILDCARD_DECL)
441 BLOCK_OUTER_CURLY_BRACE_P (in BLOCK)
442 FOLD_EXPR_MODOP_P (*_FOLD_EXPR)
443 IF_STMT_CONSTEXPR_P (IF_STMT)
444 DECL_NAMESPACE_INLINE_P (in NAMESPACE_DECL)
445 SWITCH_STMT_ALL_CASES_P (in SWITCH_STMT)
446 REINTERPRET_CAST_P (in NOP_EXPR)
447 ALIGNOF_EXPR_STD_P (in ALIGNOF_EXPR)
448 OVL_DEDUP_P (in OVERLOAD)
449 ATOMIC_CONSTR_MAP_INSTANTIATED_P (in ATOMIC_CONSTR)
450 1: IDENTIFIER_KIND_BIT_1 (in IDENTIFIER_NODE)
451 TI_PENDING_TEMPLATE_FLAG.
452 TEMPLATE_PARMS_FOR_INLINE.
453 DELETE_EXPR_USE_VEC (in DELETE_EXPR).
454 (TREE_CALLS_NEW) (in _EXPR or _REF) (commented-out).
455 ICS_ELLIPSIS_FLAG (in _CONV)
456 DECL_INITIALIZED_P (in VAR_DECL)
457 TYPENAME_IS_CLASS_P (in TYPENAME_TYPE)
458 STMT_IS_FULL_EXPR_P (in _STMT)
459 TARGET_EXPR_LIST_INIT_P (in TARGET_EXPR)
460 LAMBDA_EXPR_MUTABLE_P (in LAMBDA_EXPR)
461 DECL_FINAL_P (in FUNCTION_DECL)
462 QUALIFIED_NAME_IS_TEMPLATE (in SCOPE_REF)
463 CONSTRUCTOR_IS_DEPENDENT (in CONSTRUCTOR)
464 TINFO_USED_TEMPLATE_ID (in TEMPLATE_INFO)
465 PACK_EXPANSION_SIZEOF_P (in *_PACK_EXPANSION)
466 OVL_USING_P (in OVERLOAD)
467 IMPLICIT_CONV_EXPR_NONTYPE_ARG (in IMPLICIT_CONV_EXPR)
468 BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P (in BASELINK)
469 BIND_EXPR_VEC_DTOR (in BIND_EXPR)
470 ATOMIC_CONSTR_EXPR_FROM_CONCEPT_P (in ATOMIC_CONSTR)
471 2: IDENTIFIER_KIND_BIT_2 (in IDENTIFIER_NODE)
472 ICS_THIS_FLAG (in _CONV)
473 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (in VAR_DECL)
474 STATEMENT_LIST_TRY_BLOCK (in STATEMENT_LIST)
475 TYPENAME_IS_RESOLVING_P (in TYPENAME_TYPE)
476 TARGET_EXPR_DIRECT_INIT_P (in TARGET_EXPR)
477 FNDECL_USED_AUTO (in FUNCTION_DECL)
478 DECLTYPE_FOR_LAMBDA_PROXY (in DECLTYPE_TYPE)
479 REF_PARENTHESIZED_P (in COMPONENT_REF, INDIRECT_REF, SCOPE_REF,
480 VIEW_CONVERT_EXPR, PAREN_EXPR)
481 AGGR_INIT_ZERO_FIRST (in AGGR_INIT_EXPR)
482 CONSTRUCTOR_MUTABLE_POISON (in CONSTRUCTOR)
483 OVL_HIDDEN_P (in OVERLOAD)
484 IF_STMT_CONSTEVAL_P (in IF_STMT)
485 SWITCH_STMT_NO_BREAK_P (in SWITCH_STMT)
486 LAMBDA_EXPR_CAPTURE_OPTIMIZED (in LAMBDA_EXPR)
487 IMPLICIT_CONV_EXPR_BRACED_INIT (in IMPLICIT_CONV_EXPR)
488 PACK_EXPANSION_AUTO_P (in *_PACK_EXPANSION)
489 3: IMPLICIT_RVALUE_P (in NON_LVALUE_EXPR or STATIC_CAST_EXPR)
490 ICS_BAD_FLAG (in _CONV)
491 FN_TRY_BLOCK_P (in TRY_BLOCK)
492 BIND_EXPR_BODY_BLOCK (in BIND_EXPR)
493 CALL_EXPR_ORDERED_ARGS (in CALL_EXPR, AGGR_INIT_EXPR)
494 DECLTYPE_FOR_REF_CAPTURE (in DECLTYPE_TYPE)
495 CONSTRUCTOR_C99_COMPOUND_LITERAL (in CONSTRUCTOR)
496 OVL_NESTED_P (in OVERLOAD)
497 DECL_MODULE_EXPORT_P (in _DECL)
498 PACK_EXPANSION_FORCE_EXTRA_ARGS_P (in *_PACK_EXPANSION)
499 4: IDENTIFIER_MARKED (IDENTIFIER_NODEs)
500 TREE_HAS_CONSTRUCTOR (in INDIRECT_REF, SAVE_EXPR, CONSTRUCTOR,
501 CALL_EXPR, or FIELD_DECL).
502 DECL_TINFO_P (in VAR_DECL, TYPE_DECL)
503 FUNCTION_REF_QUALIFIED (in FUNCTION_TYPE, METHOD_TYPE)
504 OVL_LOOKUP_P (in OVERLOAD)
505 LOOKUP_FOUND_P (in RECORD_TYPE, UNION_TYPE, ENUMERAL_TYPE, NAMESPACE_DECL)
506 FNDECL_MANIFESTLY_CONST_EVALUATED (in FUNCTION_DECL)
507 5: IDENTIFIER_VIRTUAL_P (in IDENTIFIER_NODE)
508 FUNCTION_RVALUE_QUALIFIED (in FUNCTION_TYPE, METHOD_TYPE)
509 CALL_EXPR_REVERSE_ARGS (in CALL_EXPR, AGGR_INIT_EXPR)
510 CONSTRUCTOR_PLACEHOLDER_BOUNDARY (in CONSTRUCTOR)
511 OVL_EXPORT_P (in OVERLOAD)
512 6: TYPE_MARKED_P (in _TYPE)
513 DECL_NONTRIVIALLY_INITIALIZED_P (in VAR_DECL)
514 RANGE_FOR_IVDEP (in RANGE_FOR_STMT)
515 CALL_EXPR_OPERATOR_SYNTAX (in CALL_EXPR, AGGR_INIT_EXPR)
516 CONSTRUCTOR_IS_DESIGNATED_INIT (in CONSTRUCTOR)
517
518 Usage of TYPE_LANG_FLAG_?:
519 0: TYPE_DEPENDENT_P
520 1: TYPE_HAS_USER_CONSTRUCTOR.
521 2: TYPE_HAS_LATE_RETURN_TYPE (in FUNCTION_TYPE, METHOD_TYPE)
522 TYPE_PTRMEMFUNC_FLAG (in RECORD_TYPE)
523 4: TYPE_HAS_NONTRIVIAL_DESTRUCTOR
524 5: CLASS_TYPE_P (in RECORD_TYPE and UNION_TYPE)
525 ENUM_FIXED_UNDERLYING_TYPE_P (in ENUMERAL_TYPE)
526 AUTO_IS_DECLTYPE (in TEMPLATE_TYPE_PARM)
527 6: TYPE_DEPENDENT_P_VALID
528
529 Usage of DECL_LANG_FLAG_?:
530 0: DECL_TEMPLATE_PARM_P (in PARM_DECL, CONST_DECL, TYPE_DECL, or TEMPLATE_DECL)
531 DECL_LOCAL_DECL_P (in FUNCTION_DECL, VAR_DECL)
532 DECL_MUTABLE_P (in FIELD_DECL)
533 DECL_DEPENDENT_P (in USING_DECL)
534 LABEL_DECL_BREAK (in LABEL_DECL)
535 1: C_TYPEDEF_EXPLICITLY_SIGNED (in TYPE_DECL).
536 DECL_TEMPLATE_INSTANTIATED (in a VAR_DECL or a FUNCTION_DECL)
537 DECL_MEMBER_TEMPLATE_P (in TEMPLATE_DECL)
538 USING_DECL_TYPENAME_P (in USING_DECL)
539 DECL_VLA_CAPTURE_P (in FIELD_DECL)
540 DECL_ARRAY_PARAMETER_P (in PARM_DECL)
541 LABEL_DECL_CONTINUE (in LABEL_DECL)
542 2: DECL_THIS_EXTERN (in VAR_DECL, FUNCTION_DECL or PARM_DECL)
543 DECL_IMPLICIT_TYPEDEF_P (in a TYPE_DECL)
544 DECL_CONSTRAINT_VAR_P (in a PARM_DECL)
545 TEMPLATE_DECL_COMPLEX_ALIAS_P (in TEMPLATE_DECL)
546 DECL_INSTANTIATING_NSDMI_P (in a FIELD_DECL)
547 USING_DECL_UNRELATED_P (in USING_DECL)
548 3: DECL_IN_AGGR_P.
549 4: DECL_C_BIT_FIELD (in a FIELD_DECL)
550 DECL_ANON_UNION_VAR_P (in a VAR_DECL)
551 DECL_SELF_REFERENCE_P (in a TYPE_DECL)
552 DECL_INVALID_OVERRIDER_P (in a FUNCTION_DECL)
553 DECL_UNINSTANIATED_TEMPLATE_FRIEND_P (in TEMPLATE_DECL)
554 5: DECL_INTERFACE_KNOWN.
555 6: DECL_THIS_STATIC (in VAR_DECL, FUNCTION_DECL or PARM_DECL)
556 DECL_FIELD_IS_BASE (in FIELD_DECL)
557 TYPE_DECL_ALIAS_P (in TYPE_DECL)
558 7: DECL_THUNK_P (in a member FUNCTION_DECL)
559 DECL_NORMAL_CAPTURE_P (in FIELD_DECL)
560 DECL_DECLARED_CONSTINIT_P (in VAR_DECL)
561 8: DECL_DECLARED_CONSTEXPR_P (in VAR_DECL, FUNCTION_DECL)
562
563 Usage of language-independent fields in a language-dependent manner:
564
565 TYPE_ALIAS_SET
566 This field is used by TYPENAME_TYPEs, TEMPLATE_TYPE_PARMs, and so
567 forth as a substitute for the mark bits provided in `lang_type'.
568 At present, only the six low-order bits are used.
569
570 TYPE_LANG_SLOT_1
571 For a FUNCTION_TYPE or METHOD_TYPE, this is TYPE_RAISES_EXCEPTIONS.
572 For a POINTER_TYPE (to a METHOD_TYPE), this is TYPE_PTRMEMFUNC_TYPE.
573 For an ENUMERAL_TYPE, BOUND_TEMPLATE_TEMPLATE_PARM_TYPE,
574 RECORD_TYPE or UNION_TYPE this is TYPE_TEMPLATE_INFO,
575
576 BINFO_VIRTUALS
577 For a binfo, this is a TREE_LIST. There is an entry for each
578 virtual function declared either in BINFO or its direct and
579 indirect primary bases.
580
581 The BV_DELTA of each node gives the amount by which to adjust the
582 `this' pointer when calling the function. If the method is an
583 overridden version of a base class method, then it is assumed
584 that, prior to adjustment, the this pointer points to an object
585 of the base class.
586
587 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
588 index of the vcall offset for this entry.
589
590 The BV_FN is the declaration for the virtual function itself.
591
592 If BV_LOST_PRIMARY is set, it means that this entry is for a lost
593 primary virtual base and can be left null in the vtable.
594
595 BINFO_VTABLE
596 This is an expression with POINTER_TYPE that gives the value
597 to which the vptr should be initialized. Use get_vtbl_decl_for_binfo
598 to extract the VAR_DECL for the complete vtable.
599
600 DECL_VINDEX
601 This field is NULL for a non-virtual function. For a virtual
602 function, it is eventually set to an INTEGER_CST indicating the
603 index in the vtable at which this function can be found. When
604 a virtual function is declared, but before it is known what
605 function is overridden, this field is the error_mark_node.
606
607 Temporarily, it may be set to a TREE_LIST whose TREE_VALUE is
608 the virtual function this one overrides, and whose TREE_CHAIN is
609 the old DECL_VINDEX. */
610
611/* Language-specific tree checkers. */
612
613#define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
614 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
615
616#define TYPE_FUNCTION_OR_TEMPLATE_DECL_CHECK(NODE) \
617 TREE_CHECK3(NODE,TYPE_DECL,TEMPLATE_DECL,FUNCTION_DECL)
618
619#define TYPE_FUNCTION_OR_TEMPLATE_DECL_P(NODE) \
620 (TREE_CODE (NODE) == TYPE_DECL || TREE_CODE (NODE) == TEMPLATE_DECL \
621 || TREE_CODE (NODE) == FUNCTION_DECL)
622
623#define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
624 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
625
626#define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
627 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
628
629#define VAR_TEMPL_TYPE_FIELD_OR_FUNCTION_DECL_CHECK(NODE) \
630 TREE_CHECK5(NODE,VAR_DECL,FIELD_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
631
632#define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
633 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM)
634
635#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
636
637/* Returns t iff the node can have a TEMPLATE_INFO field. */
638
639inline tree
640template_info_decl_check (const_tree t, const char* f, int l, const char* fn)
641{
642 switch (TREE_CODE (t))
643 {
644 case VAR_DECL:
645 case FUNCTION_DECL:
646 case FIELD_DECL:
647 case TYPE_DECL:
648 case CONCEPT_DECL:
649 case TEMPLATE_DECL:
650 return const_cast<tree>(t);
651 default:
652 break;
653 }
654 tree_check_failed (t, f, l, fn,
655 VAR_DECL, FUNCTION_DECL, FIELD_DECL, TYPE_DECL,
656 CONCEPT_DECL, TEMPLATE_DECL, 0);
657 gcc_unreachable ();
658}
659
660#define TEMPLATE_INFO_DECL_CHECK(NODE) \
661 template_info_decl_check ((NODE), __FILE__, __LINE__, __FUNCTION__)
662
663#define THUNK_FUNCTION_CHECK(NODE) __extension__ \
664({ __typeof (NODE) const __t = (NODE); \
665 if (TREE_CODE (__t) != FUNCTION_DECL || !__t->decl_common.lang_specific \
666 || !__t->decl_common.lang_specific->u.fn.thunk_p) \
667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, 0); \
668 __t; })
669
670#else /* ENABLE_TREE_CHECKING */
671
672#define TEMPLATE_INFO_DECL_CHECK(NODE) (NODE)
673#define THUNK_FUNCTION_CHECK(NODE) (NODE)
674
675#endif /* ENABLE_TREE_CHECKING */
676
677/* Language-dependent contents of an identifier. */
678
679struct GTY(()) lang_identifier {
680 struct c_common_identifier c_common;
681 cxx_binding *bindings;
682};
683
684/* Return a typed pointer version of T if it designates a
685 C++ front-end identifier. */
686inline lang_identifier*
687identifier_p (tree t)
688{
689 if (TREE_CODE (t) == IDENTIFIER_NODE)
690 return (lang_identifier*) t;
691 return NULL;
692}
693
694#define LANG_IDENTIFIER_CAST(NODE) \
695 ((struct lang_identifier*)IDENTIFIER_NODE_CHECK (NODE))
696
697struct GTY(()) template_parm_index {
698 struct tree_common common;
699 int index;
700 int level;
701 int orig_level;
702 tree decl;
703};
704
705struct GTY(()) ptrmem_cst {
706 struct tree_common common;
707 tree member;
708 location_t locus;
709};
710typedef struct ptrmem_cst * ptrmem_cst_t;
711
712#define CLEANUP_P(NODE) TREE_LANG_FLAG_0 (TRY_BLOCK_CHECK (NODE))
713
714#define BIND_EXPR_TRY_BLOCK(NODE) \
715 TREE_LANG_FLAG_0 (BIND_EXPR_CHECK (NODE))
716
717/* This BIND_EXPR is from build_vec_delete_1. */
718#define BIND_EXPR_VEC_DTOR(NODE) \
719 TREE_LANG_FLAG_1 (BIND_EXPR_CHECK (NODE))
720
721/* Used to mark the block around the member initializers and cleanups. */
722#define BIND_EXPR_BODY_BLOCK(NODE) \
723 TREE_LANG_FLAG_3 (BIND_EXPR_CHECK (NODE))
724#define FUNCTION_NEEDS_BODY_BLOCK(NODE) \
725 (DECL_CONSTRUCTOR_P (NODE) || DECL_DESTRUCTOR_P (NODE) \
726 || LAMBDA_FUNCTION_P (NODE))
727
728#define STATEMENT_LIST_NO_SCOPE(NODE) \
729 TREE_LANG_FLAG_0 (STATEMENT_LIST_CHECK (NODE))
730#define STATEMENT_LIST_TRY_BLOCK(NODE) \
731 TREE_LANG_FLAG_2 (STATEMENT_LIST_CHECK (NODE))
732
733/* Mark the outer curly brace BLOCK. */
734#define BLOCK_OUTER_CURLY_BRACE_P(NODE) TREE_LANG_FLAG_0 (BLOCK_CHECK (NODE))
735
736/* Nonzero if this statement should be considered a full-expression,
737 i.e., if temporaries created during this statement should have
738 their destructors run at the end of this statement. */
739#define STMT_IS_FULL_EXPR_P(NODE) TREE_LANG_FLAG_1 ((NODE))
740
741/* Marks the result of a statement expression. */
742#define EXPR_STMT_STMT_EXPR_RESULT(NODE) \
743 TREE_LANG_FLAG_0 (EXPR_STMT_CHECK (NODE))
744
745/* Nonzero if this statement-expression does not have an associated scope. */
746#define STMT_EXPR_NO_SCOPE(NODE) \
747 TREE_LANG_FLAG_0 (STMT_EXPR_CHECK (NODE))
748
749#define COND_EXPR_IS_VEC_DELETE(NODE) \
750 TREE_LANG_FLAG_0 (COND_EXPR_CHECK (NODE))
751
752/* Nonzero if this NOP_EXPR is a reinterpret_cast. Such conversions
753 are not constexprs. Other NOP_EXPRs are. */
754#define REINTERPRET_CAST_P(NODE) \
755 TREE_LANG_FLAG_0 (NOP_EXPR_CHECK (NODE))
756
757/* Returns nonzero iff TYPE1 and TYPE2 are the same type, in the usual
758 sense of `same'. */
759#define same_type_p(TYPE1, TYPE2) \
760 comptypes ((TYPE1), (TYPE2), COMPARE_STRICT)
761
762/* Returns nonzero iff NODE is a declaration for the global function
763 `main'. */
764#define DECL_MAIN_P(NODE) \
765 (DECL_EXTERN_C_FUNCTION_P (NODE) \
766 && DECL_NAME (NODE) != NULL_TREE \
767 && MAIN_NAME_P (DECL_NAME (NODE)) \
768 && flag_hosted)
769
770/* Lookup walker marking. */
771#define LOOKUP_SEEN_P(NODE) TREE_VISITED (NODE)
772#define LOOKUP_FOUND_P(NODE) \
773 TREE_LANG_FLAG_4 (TREE_CHECK4 (NODE,RECORD_TYPE,UNION_TYPE,ENUMERAL_TYPE,\
774 NAMESPACE_DECL))
775
776/* These two accessors should only be used by OVL manipulators.
777 Other users should use iterators and convenience functions. */
778#define OVL_FUNCTION(NODE) \
779 (((struct tree_overload*)OVERLOAD_CHECK (NODE))->function)
780#define OVL_CHAIN(NODE) \
781 (((struct tree_overload*)OVERLOAD_CHECK (NODE))->common.chain)
782
783/* If set, this or a subsequent overload contains decls that need deduping. */
784#define OVL_DEDUP_P(NODE) TREE_LANG_FLAG_0 (OVERLOAD_CHECK (NODE))
785/* If set, this was imported in a using declaration. */
786#define OVL_USING_P(NODE) TREE_LANG_FLAG_1 (OVERLOAD_CHECK (NODE))
787/* If set, this overload is a hidden decl. */
788#define OVL_HIDDEN_P(NODE) TREE_LANG_FLAG_2 (OVERLOAD_CHECK (NODE))
789/* If set, this overload contains a nested overload. */
790#define OVL_NESTED_P(NODE) TREE_LANG_FLAG_3 (OVERLOAD_CHECK (NODE))
791/* If set, this overload was constructed during lookup. */
792#define OVL_LOOKUP_P(NODE) TREE_LANG_FLAG_4 (OVERLOAD_CHECK (NODE))
793/* If set, this OVL_USING_P overload is exported. */
794#define OVL_EXPORT_P(NODE) TREE_LANG_FLAG_5 (OVERLOAD_CHECK (NODE))
795
796/* The first decl of an overload. */
797#define OVL_FIRST(NODE) ovl_first (NODE)
798/* The name of the overload set. */
799#define OVL_NAME(NODE) DECL_NAME (OVL_FIRST (NODE))
800
801/* Whether this is a set of overloaded functions. TEMPLATE_DECLS are
802 always wrapped in an OVERLOAD, so we don't need to check them
803 here. */
804#define OVL_P(NODE) \
805 (TREE_CODE (NODE) == FUNCTION_DECL || TREE_CODE (NODE) == OVERLOAD)
806/* Whether this is a single member overload. */
807#define OVL_SINGLE_P(NODE) \
808 (TREE_CODE (NODE) != OVERLOAD || !OVL_CHAIN (NODE))
809
810/* OVL_HIDDEN_P nodes come before other nodes. */
811
812struct GTY(()) tree_overload {
813 struct tree_common common;
814 tree function;
815};
816
817/* Iterator for a 1 dimensional overload. Permits iterating over the
818 outer level of a 2-d overload when explicitly enabled. */
819
820class ovl_iterator {
821 tree ovl;
822 const bool allow_inner; /* Only used when checking. */
823
824 public:
825 explicit ovl_iterator (tree o, bool allow = false)
826 : ovl (o), allow_inner (allow)
827 {
828 }
829
830 public:
831 operator bool () const
832 {
833 return ovl;
834 }
835 ovl_iterator &operator++ ()
836 {
837 ovl = TREE_CODE (ovl) != OVERLOAD ? NULL_TREE : OVL_CHAIN (ovl);
838 return *this;
839 }
840 tree operator* () const
841 {
842 tree fn = TREE_CODE (ovl) != OVERLOAD ? ovl : OVL_FUNCTION (ovl);
843
844 /* Check this is not an unexpected 2-dimensional overload. */
845 gcc_checking_assert (allow_inner || TREE_CODE (fn) != OVERLOAD);
846
847 return fn;
848 }
849 bool operator== (const ovl_iterator &o) const
850 {
851 return ovl == o.ovl;
852 }
853 tree get_using () const
854 {
855 gcc_checking_assert (using_p ());
856 return ovl;
857 }
858
859 public:
860 /* Whether this overload was introduced by a using decl. */
861 bool using_p () const
862 {
863 return (TREE_CODE (ovl) == USING_DECL
864 || (TREE_CODE (ovl) == OVERLOAD && OVL_USING_P (ovl)));
865 }
866 /* Whether this using is being exported. */
867 bool exporting_p () const
868 {
869 return OVL_EXPORT_P (get_using ());
870 }
871
872 bool hidden_p () const
873 {
874 return TREE_CODE (ovl) == OVERLOAD && OVL_HIDDEN_P (ovl);
875 }
876
877 public:
878 tree remove_node (tree head)
879 {
880 return remove_node (head, ovl);
881 }
882 tree reveal_node (tree head)
883 {
884 return reveal_node (head, ovl);
885 }
886
887 protected:
888 /* If we have a nested overload, point at the inner overload and
889 return the next link on the outer one. */
890 tree maybe_push ()
891 {
892 tree r = NULL_TREE;
893
894 if (ovl && TREE_CODE (ovl) == OVERLOAD && OVL_NESTED_P (ovl))
895 {
896 r = OVL_CHAIN (ovl);
897 ovl = OVL_FUNCTION (ovl);
898 }
899 return r;
900 }
901 /* Restore an outer nested overload. */
902 void pop (tree outer)
903 {
904 gcc_checking_assert (!ovl);
905 ovl = outer;
906 }
907
908 private:
909 /* We make these static functions to avoid the address of the
910 iterator escaping the local context. */
911 static tree remove_node (tree head, tree node);
912 static tree reveal_node (tree ovl, tree node);
913};
914
915/* Treat a tree as a range of ovl_iterator, e.g.
916 for (tree f : ovl_range (fns)) { ... } */
917
918class ovl_range
919{
920 tree t;
921 bool allow;
922public:
923 explicit ovl_range (tree t, bool allow = false): t(t), allow(allow) { }
924 ovl_iterator begin() { return ovl_iterator (t, allow); }
925 ovl_iterator end() { return ovl_iterator (NULL_TREE, allow); }
926};
927
928/* Iterator over a (potentially) 2 dimensional overload, which is
929 produced by name lookup. */
930
931class lkp_iterator : public ovl_iterator {
932 typedef ovl_iterator parent;
933
934 tree outer;
935
936 public:
937 explicit lkp_iterator (tree o)
938 : parent (o, true), outer (maybe_push ())
939 {
940 }
941
942 public:
943 lkp_iterator &operator++ ()
944 {
945 bool repush = !outer;
946
947 if (!parent::operator++ () && !repush)
948 {
949 pop (outer);
950 repush = true;
951 }
952
953 if (repush)
954 outer = maybe_push ();
955
956 return *this;
957 }
958};
959
960/* Treat a tree as a range of lkp_iterator, e.g.
961 for (tree f : lkp_range (fns)) { ... } */
962
963class lkp_range
964{
965 tree t;
966public:
967 lkp_range (tree t): t(t) { }
968 lkp_iterator begin() { return lkp_iterator (t); }
969 lkp_iterator end() { return lkp_iterator (NULL_TREE); }
970};
971
972/* hash traits for declarations. Hashes potential overload sets via
973 DECL_NAME. */
974
975struct named_decl_hash : ggc_remove <tree> {
976 typedef tree value_type; /* A DECL or OVERLOAD */
977 typedef tree compare_type; /* An identifier. */
978
979 inline static hashval_t hash (const value_type decl);
980 inline static bool equal (const value_type existing, compare_type candidate);
981
982 static const bool empty_zero_p = true;
983 static inline void mark_empty (value_type &p) {p = NULL_TREE;}
984 static inline bool is_empty (value_type p) {return !p;}
985
986 /* Nothing is deletable. Everything is insertable. */
987 static bool is_deleted (value_type) { return false; }
988 static void mark_deleted (value_type) { gcc_unreachable (); }
989};
990
991/* Simplified unique_ptr clone to release a tree vec on exit. */
992
993class releasing_vec
994{
995public:
996 typedef vec<tree, va_gc> vec_t;
997
998 releasing_vec (vec_t *v): v(v) { }
999 releasing_vec (): v(make_tree_vector ()) { }
1000
1001 /* Copy ops are deliberately declared but not defined,
1002 copies must always be elided. */
1003 releasing_vec (const releasing_vec &);
1004 releasing_vec &operator= (const releasing_vec &);
1005
1006 vec_t &operator* () const { return *v; }
1007 vec_t *operator-> () const { return v; }
1008 vec_t *get() const { return v; }
1009 operator vec_t *() const { return v; }
1010 vec_t ** operator& () { return &v; }
1011
1012 /* Breaks pointer/value consistency for convenience. This takes ptrdiff_t
1013 rather than unsigned to avoid ambiguity with the built-in operator[]
1014 (bootstrap/91828). */
1015 tree& operator[] (ptrdiff_t i) const { return (*v)[i]; }
1016
1017 tree *begin() { return ::begin (v); }
1018 tree *end() { return ::end (v); }
1019
1020 void release () { release_tree_vector (v); v = NULL; }
1021
1022 ~releasing_vec () { release_tree_vector (v); }
1023private:
1024 vec_t *v;
1025};
1026/* Forwarding functions for vec_safe_* that might reallocate. */
1027inline tree* vec_safe_push (releasing_vec& r, const tree &t CXX_MEM_STAT_INFO)
1028{ return vec_safe_push (*&r, t PASS_MEM_STAT); }
1029inline bool vec_safe_reserve (releasing_vec& r, unsigned n, bool e = false CXX_MEM_STAT_INFO)
1030{ return vec_safe_reserve (*&r, n, e PASS_MEM_STAT); }
1031inline unsigned vec_safe_length (releasing_vec &r)
1032{ return r->length(); }
1033inline void vec_safe_splice (releasing_vec &r, vec<tree, va_gc> *p CXX_MEM_STAT_INFO)
1034{ vec_safe_splice (*&r, p PASS_MEM_STAT); }
1035void release_tree_vector (releasing_vec &); // cause link error
1036
1037struct GTY(()) tree_template_decl {
1038 struct tree_decl_common common;
1039 tree arguments;
1040 tree result;
1041};
1042
1043/* Returns true iff NODE is a BASELINK. */
1044#define BASELINK_P(NODE) \
1045 (TREE_CODE (NODE) == BASELINK)
1046/* The BINFO indicating the base in which lookup found the
1047 BASELINK_FUNCTIONS. */
1048#define BASELINK_BINFO(NODE) \
1049 (((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)
1050/* The functions referred to by the BASELINK; either a FUNCTION_DECL,
1051 a TEMPLATE_DECL, an OVERLOAD, or a TEMPLATE_ID_EXPR. */
1052#define BASELINK_FUNCTIONS(NODE) \
1053 (((struct tree_baselink*) BASELINK_CHECK (NODE))->functions)
1054/* If T is a BASELINK, grab the functions, otherwise just T, which is
1055 expected to already be a (list of) functions. */
1056#define MAYBE_BASELINK_FUNCTIONS(T) \
1057 (BASELINK_P (T) ? BASELINK_FUNCTIONS (T) : T)
1058/* The BINFO in which the search for the functions indicated by this baselink
1059 began. This base is used to determine the accessibility of functions
1060 selected by overload resolution. */
1061#define BASELINK_ACCESS_BINFO(NODE) \
1062 (((struct tree_baselink*) BASELINK_CHECK (NODE))->access_binfo)
1063/* For a type-conversion operator, the BASELINK_OPTYPE indicates the type
1064 to which the conversion should occur. This value is important if
1065 the BASELINK_FUNCTIONS include a template conversion operator --
1066 the BASELINK_OPTYPE can be used to determine what type the user
1067 requested. */
1068#define BASELINK_OPTYPE(NODE) \
1069 (TREE_CHAIN (BASELINK_CHECK (NODE)))
1070/* Nonzero if this baselink was from a qualified lookup. */
1071#define BASELINK_QUALIFIED_P(NODE) \
1072 TREE_LANG_FLAG_0 (BASELINK_CHECK (NODE))
1073/* Nonzero if the overload set for this baselink might be incomplete due
1074 to the lookup being performed from an incomplete-class context. */
1075#define BASELINK_FUNCTIONS_MAYBE_INCOMPLETE_P(NODE) \
1076 TREE_LANG_FLAG_1 (BASELINK_CHECK (NODE))
1077
1078struct GTY(()) tree_baselink {
1079 struct tree_common common;
1080 tree binfo;
1081 tree functions;
1082 tree access_binfo;
1083};
1084
1085/* The different kinds of ids that we encounter. */
1086
1087enum cp_id_kind
1088{
1089 /* Not an id at all. */
1090 CP_ID_KIND_NONE,
1091 /* An unqualified-id that is not a template-id. */
1092 CP_ID_KIND_UNQUALIFIED,
1093 /* An unqualified-id that is a dependent name. */
1094 CP_ID_KIND_UNQUALIFIED_DEPENDENT,
1095 /* An unqualified template-id. */
1096 CP_ID_KIND_TEMPLATE_ID,
1097 /* A qualified-id. */
1098 CP_ID_KIND_QUALIFIED
1099};
1100
1101
1102/* The various kinds of C++0x warnings we encounter. */
1103
1104enum cpp0x_warn_str
1105{
1106 /* extended initializer lists */
1107 CPP0X_INITIALIZER_LISTS,
1108 /* explicit conversion operators */
1109 CPP0X_EXPLICIT_CONVERSION,
1110 /* variadic templates */
1111 CPP0X_VARIADIC_TEMPLATES,
1112 /* lambda expressions */
1113 CPP0X_LAMBDA_EXPR,
1114 /* C++0x auto */
1115 CPP0X_AUTO,
1116 /* scoped enums */
1117 CPP0X_SCOPED_ENUMS,
1118 /* defaulted and deleted functions */
1119 CPP0X_DEFAULTED_DELETED,
1120 /* inline namespaces */
1121 CPP0X_INLINE_NAMESPACES,
1122 /* override controls, override/final */
1123 CPP0X_OVERRIDE_CONTROLS,
1124 /* non-static data member initializers */
1125 CPP0X_NSDMI,
1126 /* user defined literals */
1127 CPP0X_USER_DEFINED_LITERALS,
1128 /* delegating constructors */
1129 CPP0X_DELEGATING_CTORS,
1130 /* inheriting constructors */
1131 CPP0X_INHERITING_CTORS,
1132 /* C++11 attributes */
1133 CPP0X_ATTRIBUTES,
1134 /* ref-qualified member functions */
1135 CPP0X_REF_QUALIFIER
1136};
1137
1138/* The various kinds of operation used by composite_pointer_type. */
1139
1140enum composite_pointer_operation
1141{
1142 /* comparison */
1143 CPO_COMPARISON,
1144 /* conversion */
1145 CPO_CONVERSION,
1146 /* conditional expression */
1147 CPO_CONDITIONAL_EXPR
1148};
1149
1150/* Possible cases of expression list used by build_x_compound_expr_from_list. */
1151enum expr_list_kind {
1152 ELK_INIT, /* initializer */
1153 ELK_MEM_INIT, /* member initializer */
1154 ELK_FUNC_CAST /* functional cast */
1155};
1156
1157/* Possible cases of implicit bad rhs conversions. */
1158enum impl_conv_rhs {
1159 ICR_DEFAULT_ARGUMENT, /* default argument */
1160 ICR_CONVERTING, /* converting */
1161 ICR_INIT, /* initialization */
1162 ICR_ARGPASS, /* argument passing */
1163 ICR_RETURN, /* return */
1164 ICR_ASSIGN /* assignment */
1165};
1166
1167/* Possible cases of implicit or explicit bad conversions to void. */
1168enum impl_conv_void {
1169 ICV_CAST, /* (explicit) conversion to void */
1170 ICV_SECOND_OF_COND, /* second operand of conditional expression */
1171 ICV_THIRD_OF_COND, /* third operand of conditional expression */
1172 ICV_RIGHT_OF_COMMA, /* right operand of comma operator */
1173 ICV_LEFT_OF_COMMA, /* left operand of comma operator */
1174 ICV_STATEMENT, /* statement */
1175 ICV_THIRD_IN_FOR /* for increment expression */
1176};
1177
1178/* Possible invalid uses of an abstract class that might not have a
1179 specific associated declaration. */
1180enum GTY(()) abstract_class_use {
1181 ACU_UNKNOWN, /* unknown or decl provided */
1182 ACU_CAST, /* cast to abstract class */
1183 ACU_NEW, /* new-expression of abstract class */
1184 ACU_THROW, /* throw-expression of abstract class */
1185 ACU_CATCH, /* catch-parameter of abstract class */
1186 ACU_ARRAY, /* array of abstract class */
1187 ACU_RETURN, /* return type of abstract class */
1188 ACU_PARM /* parameter type of abstract class */
1189};
1190
1191/* Macros for access to language-specific slots in an identifier. */
1192
1193/* Identifiers map directly to block or class-scope bindings.
1194 Namespace-scope bindings are held in hash tables on the respective
1195 namespaces. The identifier bindings are the innermost active
1196 binding, from whence you can get the decl and/or implicit-typedef
1197 of an elaborated type. When not bound to a local entity the
1198 values are NULL. */
1199#define IDENTIFIER_BINDING(NODE) \
1200 (LANG_IDENTIFIER_CAST (NODE)->bindings)
1201#define REAL_IDENTIFIER_TYPE_VALUE(NODE) TREE_TYPE (NODE)
1202#define SET_IDENTIFIER_TYPE_VALUE(NODE,TYPE) (TREE_TYPE (NODE) = (TYPE))
1203
1204/* Kinds of identifiers. Values are carefully chosen. */
1205enum cp_identifier_kind {
1206 cik_normal = 0, /* Not a special identifier. */
1207 cik_keyword = 1, /* A keyword. */
1208 cik_ctor = 2, /* Constructor (in-chg, complete or base). */
1209 cik_dtor = 3, /* Destructor (in-chg, deleting, complete or
1210 base). */
1211 cik_simple_op = 4, /* Non-assignment operator name. */
1212 cik_assign_op = 5, /* An assignment operator name. */
1213 cik_conv_op = 6, /* Conversion operator name. */
1214 cik_reserved_for_udlit = 7, /* Not yet in use */
1215 cik_max
1216};
1217
1218/* Kind bits. */
1219#define IDENTIFIER_KIND_BIT_0(NODE) \
1220 TREE_LANG_FLAG_0 (IDENTIFIER_NODE_CHECK (NODE))
1221#define IDENTIFIER_KIND_BIT_1(NODE) \
1222 TREE_LANG_FLAG_1 (IDENTIFIER_NODE_CHECK (NODE))
1223#define IDENTIFIER_KIND_BIT_2(NODE) \
1224 TREE_LANG_FLAG_2 (IDENTIFIER_NODE_CHECK (NODE))
1225
1226/* Used by various search routines. */
1227#define IDENTIFIER_MARKED(NODE) \
1228 TREE_LANG_FLAG_4 (IDENTIFIER_NODE_CHECK (NODE))
1229
1230/* Nonzero if this identifier is used as a virtual function name somewhere
1231 (optimizes searches). */
1232#define IDENTIFIER_VIRTUAL_P(NODE) \
1233 TREE_LANG_FLAG_5 (IDENTIFIER_NODE_CHECK (NODE))
1234
1235/* True if this identifier is a reserved word. C_RID_CODE (node) is
1236 then the RID_* value of the keyword. Value 1. */
1237#define IDENTIFIER_KEYWORD_P(NODE) \
1238 ((!IDENTIFIER_KIND_BIT_2 (NODE)) \
1239 & (!IDENTIFIER_KIND_BIT_1 (NODE)) \
1240 & IDENTIFIER_KIND_BIT_0 (NODE))
1241
1242/* True if this identifier is the name of a constructor or
1243 destructor. Value 2 or 3. */
1244#define IDENTIFIER_CDTOR_P(NODE) \
1245 ((!IDENTIFIER_KIND_BIT_2 (NODE)) \
1246 & IDENTIFIER_KIND_BIT_1 (NODE))
1247
1248/* True if this identifier is the name of a constructor. Value 2. */
1249#define IDENTIFIER_CTOR_P(NODE) \
1250 (IDENTIFIER_CDTOR_P(NODE) \
1251 & (!IDENTIFIER_KIND_BIT_0 (NODE)))
1252
1253/* True if this identifier is the name of a destructor. Value 3. */
1254#define IDENTIFIER_DTOR_P(NODE) \
1255 (IDENTIFIER_CDTOR_P(NODE) \
1256 & IDENTIFIER_KIND_BIT_0 (NODE))
1257
1258/* True if this identifier is for any operator name (including
1259 conversions). Value 4, 5, 6 or 7. */
1260#define IDENTIFIER_ANY_OP_P(NODE) \
1261 (IDENTIFIER_KIND_BIT_2 (NODE))
1262
1263/* True if this identifier is for an overloaded operator. Values 4, 5. */
1264#define IDENTIFIER_OVL_OP_P(NODE) \
1265 (IDENTIFIER_ANY_OP_P (NODE) \
1266 & (!IDENTIFIER_KIND_BIT_1 (NODE)))
1267
1268/* True if this identifier is for any assignment. Values 5. */
1269#define IDENTIFIER_ASSIGN_OP_P(NODE) \
1270 (IDENTIFIER_OVL_OP_P (NODE) \
1271 & IDENTIFIER_KIND_BIT_0 (NODE))
1272
1273/* True if this identifier is the name of a type-conversion
1274 operator. Value 7. */
1275#define IDENTIFIER_CONV_OP_P(NODE) \
1276 (IDENTIFIER_ANY_OP_P (NODE) \
1277 & IDENTIFIER_KIND_BIT_1 (NODE) \
1278 & (!IDENTIFIER_KIND_BIT_0 (NODE)))
1279
1280/* True if this identifier is a new or delete operator. */
1281#define IDENTIFIER_NEWDEL_OP_P(NODE) \
1282 (IDENTIFIER_OVL_OP_P (NODE) \
1283 && IDENTIFIER_OVL_OP_FLAGS (NODE) & OVL_OP_FLAG_ALLOC)
1284
1285/* True if this identifier is a new operator. */
1286#define IDENTIFIER_NEW_OP_P(NODE) \
1287 (IDENTIFIER_OVL_OP_P (NODE) \
1288 && (IDENTIFIER_OVL_OP_FLAGS (NODE) \
1289 & (OVL_OP_FLAG_ALLOC | OVL_OP_FLAG_DELETE)) == OVL_OP_FLAG_ALLOC)
1290
1291/* Access a C++-specific index for identifier NODE.
1292 Used to optimize operator mappings etc. */
1293#define IDENTIFIER_CP_INDEX(NODE) \
1294 (IDENTIFIER_NODE_CHECK(NODE)->base.u.bits.address_space)
1295
1296/* In a RECORD_TYPE or UNION_TYPE, nonzero if any component is read-only. */
1297#define C_TYPE_FIELDS_READONLY(TYPE) \
1298 (LANG_TYPE_CLASS_CHECK (TYPE)->fields_readonly)
1299
1300/* The tokens stored in the unparsed operand. */
1301
1302#define DEFPARSE_TOKENS(NODE) \
1303 (((struct tree_deferred_parse *)DEFERRED_PARSE_CHECK (NODE))->tokens)
1304#define DEFPARSE_INSTANTIATIONS(NODE) \
1305 (((struct tree_deferred_parse *)DEFERRED_PARSE_CHECK (NODE))->instantiations)
1306
1307struct GTY (()) tree_deferred_parse {
1308 struct tree_base base;
1309 struct cp_token_cache *tokens;
1310 vec<tree, va_gc> *instantiations;
1311};
1312
1313
1314#define DEFERRED_NOEXCEPT_PATTERN(NODE) \
1315 (((struct tree_deferred_noexcept *)DEFERRED_NOEXCEPT_CHECK (NODE))->pattern)
1316#define DEFERRED_NOEXCEPT_ARGS(NODE) \
1317 (((struct tree_deferred_noexcept *)DEFERRED_NOEXCEPT_CHECK (NODE))->args)
1318#define DEFERRED_NOEXCEPT_SPEC_P(NODE) \
1319 ((NODE) && (TREE_PURPOSE (NODE)) \
1320 && (TREE_CODE (TREE_PURPOSE (NODE)) == DEFERRED_NOEXCEPT))
1321#define UNEVALUATED_NOEXCEPT_SPEC_P(NODE) \
1322 (DEFERRED_NOEXCEPT_SPEC_P (NODE) \
1323 && DEFERRED_NOEXCEPT_PATTERN (TREE_PURPOSE (NODE)) == NULL_TREE)
1324#define UNPARSED_NOEXCEPT_SPEC_P(NODE) \
1325 ((NODE) && (TREE_PURPOSE (NODE)) \
1326 && (TREE_CODE (TREE_PURPOSE (NODE)) == DEFERRED_PARSE))
1327
1328struct GTY (()) tree_deferred_noexcept {
1329 struct tree_base base;
1330 tree pattern;
1331 tree args;
1332};
1333
1334
1335/* The condition associated with the static assertion. This must be
1336 an integral constant expression. */
1337#define STATIC_ASSERT_CONDITION(NODE) \
1338 (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->condition)
1339
1340/* The message associated with the static assertion. This must be a
1341 string constant, which will be emitted as an error message when the
1342 static assert condition is false. */
1343#define STATIC_ASSERT_MESSAGE(NODE) \
1344 (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->message)
1345
1346/* Source location information for a static assertion. */
1347#define STATIC_ASSERT_SOURCE_LOCATION(NODE) \
1348 (((struct tree_static_assert *)STATIC_ASSERT_CHECK (NODE))->location)
1349
1350struct GTY (()) tree_static_assert {
1351 struct tree_common common;
1352 tree condition;
1353 tree message;
1354 location_t location;
1355};
1356
1357struct GTY (()) tree_argument_pack_select {
1358 struct tree_common common;
1359 tree argument_pack;
1360 int index;
1361};
1362
1363/* The different kinds of traits that we encounter. */
1364
1365enum cp_trait_kind
1366{
1367 CPTK_BASES,
1368 CPTK_DIRECT_BASES,
1369 CPTK_HAS_NOTHROW_ASSIGN,
1370 CPTK_HAS_NOTHROW_CONSTRUCTOR,
1371 CPTK_HAS_NOTHROW_COPY,
1372 CPTK_HAS_TRIVIAL_ASSIGN,
1373 CPTK_HAS_TRIVIAL_CONSTRUCTOR,
1374 CPTK_HAS_TRIVIAL_COPY,
1375 CPTK_HAS_TRIVIAL_DESTRUCTOR,
1376 CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS,
1377 CPTK_HAS_VIRTUAL_DESTRUCTOR,
1378 CPTK_IS_ABSTRACT,
1379 CPTK_IS_AGGREGATE,
1380 CPTK_IS_BASE_OF,
1381 CPTK_IS_CLASS,
1382 CPTK_IS_EMPTY,
1383 CPTK_IS_ENUM,
1384 CPTK_IS_FINAL,
1385 CPTK_IS_LAYOUT_COMPATIBLE,
1386 CPTK_IS_LITERAL_TYPE,
1387 CPTK_IS_POINTER_INTERCONVERTIBLE_BASE_OF,
1388 CPTK_IS_POD,
1389 CPTK_IS_POLYMORPHIC,
1390 CPTK_IS_SAME_AS,
1391 CPTK_IS_STD_LAYOUT,
1392 CPTK_IS_TRIVIAL,
1393 CPTK_IS_TRIVIALLY_ASSIGNABLE,
1394 CPTK_IS_TRIVIALLY_CONSTRUCTIBLE,
1395 CPTK_IS_TRIVIALLY_COPYABLE,
1396 CPTK_IS_UNION,
1397 CPTK_UNDERLYING_TYPE,
1398 CPTK_IS_ASSIGNABLE,
1399 CPTK_IS_CONSTRUCTIBLE,
1400 CPTK_IS_NOTHROW_ASSIGNABLE,
1401 CPTK_IS_NOTHROW_CONSTRUCTIBLE,
1402 CPTK_REF_CONSTRUCTS_FROM_TEMPORARY,
1403 CPTK_REF_CONVERTS_FROM_TEMPORARY
1404};
1405
1406/* The types that we are processing. */
1407#define TRAIT_EXPR_TYPE1(NODE) \
1408 (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->type1)
1409
1410#define TRAIT_EXPR_TYPE2(NODE) \
1411 (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->type2)
1412
1413/* The specific trait that we are processing. */
1414#define TRAIT_EXPR_KIND(NODE) \
1415 (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->kind)
1416
1417#define TRAIT_EXPR_LOCATION(NODE) \
1418 (((struct tree_trait_expr *)TRAIT_EXPR_CHECK (NODE))->locus)
1419
1420struct GTY (()) tree_trait_expr {
1421 struct tree_common common;
1422 tree type1;
1423 tree type2;
1424 location_t locus;
1425 enum cp_trait_kind kind;
1426};
1427
1428/* Identifiers used for lambda types are almost anonymous. Use this
1429 spare flag to distinguish them (they also have the anonymous flag). */
1430#define IDENTIFIER_LAMBDA_P(NODE) \
1431 (IDENTIFIER_NODE_CHECK(NODE)->base.protected_flag)
1432
1433/* Based off of TYPE_UNNAMED_P. */
1434#define LAMBDA_TYPE_P(NODE) \
1435 (TREE_CODE (NODE) == RECORD_TYPE \
1436 && TYPE_LINKAGE_IDENTIFIER (NODE) \
1437 && IDENTIFIER_LAMBDA_P (TYPE_LINKAGE_IDENTIFIER (NODE)))
1438
1439/* Test if FUNCTION_DECL is a lambda function. */
1440#define LAMBDA_FUNCTION_P(FNDECL) \
1441 (DECL_DECLARES_FUNCTION_P (FNDECL) \
1442 && DECL_OVERLOADED_OPERATOR_P (FNDECL) \
1443 && DECL_OVERLOADED_OPERATOR_IS (FNDECL, CALL_EXPR) \
1444 && LAMBDA_TYPE_P (CP_DECL_CONTEXT (FNDECL)))
1445
1446enum cp_lambda_default_capture_mode_type {
1447 CPLD_NONE,
1448 CPLD_COPY,
1449 CPLD_REFERENCE
1450};
1451
1452/* The method of default capture, if any. */
1453#define LAMBDA_EXPR_DEFAULT_CAPTURE_MODE(NODE) \
1454 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->default_capture_mode)
1455
1456/* The capture-list, including `this'. Each capture is stored as a FIELD_DECL
1457 * so that the name, type, and field are all together, whether or not it has
1458 * been added to the lambda's class type.
1459 TREE_LIST:
1460 TREE_PURPOSE: The FIELD_DECL for this capture.
1461 TREE_VALUE: The initializer. This is part of a GNU extension. */
1462#define LAMBDA_EXPR_CAPTURE_LIST(NODE) \
1463 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->capture_list)
1464
1465/* During parsing of the lambda-introducer, the node in the capture-list
1466 that holds the 'this' capture. During parsing of the body, the
1467 capture proxy for that node. */
1468#define LAMBDA_EXPR_THIS_CAPTURE(NODE) \
1469 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->this_capture)
1470
1471/* Predicate tracking whether `this' is in the effective capture set. */
1472#define LAMBDA_EXPR_CAPTURES_THIS_P(NODE) \
1473 LAMBDA_EXPR_THIS_CAPTURE(NODE)
1474
1475/* Predicate tracking whether the lambda was declared 'mutable'. */
1476#define LAMBDA_EXPR_MUTABLE_P(NODE) \
1477 TREE_LANG_FLAG_1 (LAMBDA_EXPR_CHECK (NODE))
1478
1479/* True iff uses of a const variable capture were optimized away. */
1480#define LAMBDA_EXPR_CAPTURE_OPTIMIZED(NODE) \
1481 TREE_LANG_FLAG_2 (LAMBDA_EXPR_CHECK (NODE))
1482
1483/* True if this TREE_LIST in LAMBDA_EXPR_CAPTURE_LIST is for an explicit
1484 capture. */
1485#define LAMBDA_CAPTURE_EXPLICIT_P(NODE) \
1486 TREE_LANG_FLAG_0 (TREE_LIST_CHECK (NODE))
1487
1488/* The source location of the lambda. */
1489#define LAMBDA_EXPR_LOCATION(NODE) \
1490 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->locus)
1491
1492/* The mangling scope for the lambda: FUNCTION_DECL, PARM_DECL, VAR_DECL,
1493 FIELD_DECL or NULL_TREE. If this is NULL_TREE, we have no linkage. */
1494#define LAMBDA_EXPR_EXTRA_SCOPE(NODE) \
1495 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->extra_scope)
1496
1497/* If EXTRA_SCOPE, this is the number of the lambda within that scope. */
1498#define LAMBDA_EXPR_DISCRIMINATOR(NODE) \
1499 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->discriminator)
1500
1501/* During parsing of the lambda, a vector of capture proxies which need
1502 to be pushed once we're done processing a nested lambda. */
1503#define LAMBDA_EXPR_PENDING_PROXIES(NODE) \
1504 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->pending_proxies)
1505
1506/* If NODE was regenerated via tsubst_lambda_expr, this is a TEMPLATE_INFO
1507 whose TI_TEMPLATE is the immediate LAMBDA_EXPR from which NODE was
1508 regenerated, and TI_ARGS is the full set of template arguments used
1509 to regenerate NODE from the most general lambda. */
1510#define LAMBDA_EXPR_REGEN_INFO(NODE) \
1511 (((struct tree_lambda_expr *)LAMBDA_EXPR_CHECK (NODE))->regen_info)
1512
1513/* The closure type of the lambda, which is also the type of the
1514 LAMBDA_EXPR. */
1515#define LAMBDA_EXPR_CLOSURE(NODE) \
1516 (TREE_TYPE (LAMBDA_EXPR_CHECK (NODE)))
1517
1518struct GTY (()) tree_lambda_expr
1519{
1520 struct tree_typed typed;
1521 tree capture_list;
1522 tree this_capture;
1523 tree extra_scope;
1524 tree regen_info;
1525 vec<tree, va_gc> *pending_proxies;
1526 location_t locus;
1527 enum cp_lambda_default_capture_mode_type default_capture_mode : 8;
1528 short int discriminator;
1529};
1530
1531/* Non-zero if this template specialization has access violations that
1532 should be rechecked when the function is instantiated outside argument
1533 deduction. */
1534#define TINFO_HAS_ACCESS_ERRORS(NODE) \
1535 (TREE_LANG_FLAG_0 (TEMPLATE_INFO_CHECK (NODE)))
1536#define FNDECL_HAS_ACCESS_ERRORS(NODE) \
1537 (TINFO_HAS_ACCESS_ERRORS (DECL_TEMPLATE_INFO (NODE)))
1538
1539/* Non-zero if this variable template specialization was specified using a
1540 template-id, so it's a partial or full specialization and not a definition
1541 of the member template of a particular class specialization. */
1542#define TINFO_USED_TEMPLATE_ID(NODE) \
1543 (TREE_LANG_FLAG_1 (TEMPLATE_INFO_CHECK (NODE)))
1544
1545/* The representation of a deferred access check. */
1546
1547struct GTY(()) deferred_access_check {
1548 /* The base class in which the declaration is referenced. */
1549 tree binfo;
1550 /* The declaration whose access must be checked. */
1551 tree decl;
1552 /* The declaration that should be used in the error message. */
1553 tree diag_decl;
1554 /* The location of this access. */
1555 location_t loc;
1556};
1557
1558struct GTY(()) tree_template_info {
1559 struct tree_base base;
1560 tree tmpl;
1561 tree args;
1562 vec<deferred_access_check, va_gc> *deferred_access_checks;
1563};
1564
1565// Constraint information for a C++ declaration. Constraint information is
1566// comprised of:
1567//
1568// - a constraint expression introduced by the template header
1569// - a constraint expression introduced by a function declarator
1570// - the associated constraints, which are the conjunction of those,
1571// and used for declaration matching
1572//
1573// The template and declarator requirements are kept to support pretty
1574// printing constrained declarations.
1575struct GTY(()) tree_constraint_info {
1576 struct tree_base base;
1577 tree template_reqs;
1578 tree declarator_reqs;
1579 tree associated_constr;
1580};
1581
1582// Require that pointer P is non-null before returning.
1583template<typename T>
1584inline T*
1585check_nonnull (T* p)
1586{
1587 gcc_assert (p);
1588 return p;
1589}
1590
1591/* Returns true iff T is non-null and represents constraint info. */
1592inline tree_constraint_info *
1593check_constraint_info (tree t)
1594{
1595 if (t && TREE_CODE (t) == CONSTRAINT_INFO)
1596 return (tree_constraint_info *)t;
1597 return NULL;
1598}
1599
1600/* Access the expression describing the template constraints. This may be
1601 null if no constraints were introduced in the template parameter list,
1602 a requirements clause after the template parameter list, or constraints
1603 through a constrained-type-specifier. */
1604#define CI_TEMPLATE_REQS(NODE) \
1605 check_constraint_info (check_nonnull (NODE))->template_reqs
1606
1607/* Access the expression describing the trailing constraints. This is non-null
1608 for any implicit instantiation of a constrained declaration. For a
1609 templated declaration it is non-null only when a trailing requires-clause
1610 was specified. */
1611#define CI_DECLARATOR_REQS(NODE) \
1612 check_constraint_info (check_nonnull (NODE))->declarator_reqs
1613
1614/* The computed associated constraint expression for a declaration. */
1615#define CI_ASSOCIATED_CONSTRAINTS(NODE) \
1616 check_constraint_info (check_nonnull (NODE))->associated_constr
1617
1618/* Access the constraint-expression introduced by the requires-clause
1619 associate the template parameter list NODE. */
1620#define TEMPLATE_PARMS_CONSTRAINTS(NODE) \
1621 TREE_TYPE (TREE_LIST_CHECK (NODE))
1622
1623/* Access the logical constraints on the template parameter declaration
1624 indicated by NODE. */
1625#define TEMPLATE_PARM_CONSTRAINTS(NODE) \
1626 TREE_TYPE (TREE_LIST_CHECK (NODE))
1627
1628/* Non-zero if the noexcept is present in a compound requirement. */
1629#define COMPOUND_REQ_NOEXCEPT_P(NODE) \
1630 TREE_LANG_FLAG_0 (TREE_CHECK (NODE, COMPOUND_REQ))
1631
1632/* A TREE_LIST whose TREE_VALUE is the constraints on the 'auto' placeholder
1633 type NODE, used in an argument deduction constraint. The TREE_PURPOSE
1634 holds the set of template parameters that were in-scope when this 'auto'
1635 was formed. */
1636#define PLACEHOLDER_TYPE_CONSTRAINTS_INFO(NODE) \
1637 DECL_SIZE_UNIT (TYPE_NAME (NODE))
1638
1639/* The constraints on the 'auto' placeholder type NODE. */
1640#define PLACEHOLDER_TYPE_CONSTRAINTS(NODE) \
1641 (PLACEHOLDER_TYPE_CONSTRAINTS_INFO (NODE) \
1642 ? TREE_VALUE (PLACEHOLDER_TYPE_CONSTRAINTS_INFO (NODE)) \
1643 : NULL_TREE)
1644
1645/* True if NODE is a constraint. */
1646#define CONSTR_P(NODE) \
1647 (TREE_CODE (NODE) == ATOMIC_CONSTR \
1648 || TREE_CODE (NODE) == CONJ_CONSTR \
1649 || TREE_CODE (NODE) == DISJ_CONSTR)
1650
1651/* Valid for any normalized constraint. */
1652#define CONSTR_CHECK(NODE) \
1653 TREE_CHECK3 (NODE, ATOMIC_CONSTR, CONJ_CONSTR, DISJ_CONSTR)
1654
1655/* The CONSTR_INFO stores normalization data for a constraint. It refers to
1656 the original expression and the expression or declaration
1657 from which the constraint was normalized.
1658
1659 This is TREE_LIST whose TREE_PURPOSE is the original expression and whose
1660 TREE_VALUE is a list of contexts. */
1661#define CONSTR_INFO(NODE) \
1662 TREE_TYPE (CONSTR_CHECK (NODE))
1663
1664/* The expression evaluated by the constraint. */
1665#define CONSTR_EXPR(NODE) \
1666 TREE_PURPOSE (CONSTR_INFO (NODE))
1667
1668/* The expression or declaration from which this constraint was normalized.
1669 This is a TREE_LIST whose TREE_VALUE is either a template-id expression
1670 denoting a concept check or the declaration introducing the constraint.
1671 These are chained to other context objects. */
1672#define CONSTR_CONTEXT(NODE) \
1673 TREE_VALUE (CONSTR_INFO (NODE))
1674
1675/* The parameter mapping for an atomic constraint. */
1676#define ATOMIC_CONSTR_MAP(NODE) \
1677 TREE_OPERAND (TREE_CHECK (NODE, ATOMIC_CONSTR), 0)
1678
1679/* Whether the parameter mapping of this atomic constraint
1680 is already instantiated with concrete template arguments.
1681 Used only in satisfy_atom and in the satisfaction cache. */
1682#define ATOMIC_CONSTR_MAP_INSTANTIATED_P(NODE) \
1683 TREE_LANG_FLAG_0 (ATOMIC_CONSTR_CHECK (NODE))
1684
1685/* Whether the expression for this atomic constraint belongs to a
1686 concept definition. */
1687#define ATOMIC_CONSTR_EXPR_FROM_CONCEPT_P(NODE) \
1688 TREE_LANG_FLAG_1 (ATOMIC_CONSTR_CHECK (NODE))
1689
1690/* The expression of an atomic constraint. */
1691#define ATOMIC_CONSTR_EXPR(NODE) \
1692 CONSTR_EXPR (ATOMIC_CONSTR_CHECK (NODE))
1693
1694/* The concept of a concept check. */
1695#define CHECK_CONSTR_CONCEPT(NODE) \
1696 TREE_OPERAND (TREE_CHECK (NODE, CHECK_CONSTR), 0)
1697
1698/* The template arguments of a concept check. */
1699#define CHECK_CONSTR_ARGS(NODE) \
1700 TREE_OPERAND (TREE_CHECK (NODE, CHECK_CONSTR), 1)
1701
1702/* Whether a PARM_DECL represents a local parameter in a
1703 requires-expression. */
1704#define CONSTRAINT_VAR_P(NODE) \
1705 DECL_LANG_FLAG_2 (TREE_CHECK (NODE, PARM_DECL))
1706
1707/* The concept constraining this constrained template-parameter. */
1708#define CONSTRAINED_PARM_CONCEPT(NODE) \
1709 DECL_SIZE_UNIT (TYPE_DECL_CHECK (NODE))
1710/* Any extra template arguments specified for a constrained
1711 template-parameter. */
1712#define CONSTRAINED_PARM_EXTRA_ARGS(NODE) \
1713 DECL_SIZE (TYPE_DECL_CHECK (NODE))
1714/* The first template parameter of CONSTRAINED_PARM_CONCEPT to be used as a
1715 prototype for the constrained parameter in finish_shorthand_constraint,
1716 attached for convenience. */
1717#define CONSTRAINED_PARM_PROTOTYPE(NODE) \
1718 DECL_INITIAL (TYPE_DECL_CHECK (NODE))
1719
1720/* Module flags on FUNCTION,VAR,TYPE,CONCEPT or NAMESPACE
1721 A TEMPLATE_DECL holds them on the DECL_TEMPLATE_RESULT object --
1722 it's just not practical to keep them consistent. */
1723#define DECL_MODULE_CHECK(NODE) \
1724 TREE_NOT_CHECK (NODE, TEMPLATE_DECL)
1725
1726/* In the purview of a named module (or in the purview of the
1727 header-unit being compiled). */
1728#define DECL_MODULE_PURVIEW_P(N) \
1729 (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (N))->u.base.module_purview_p)
1730
1731/* Attached to the named module it is in the purview of. Decls
1732 attached to the global module will have this false. */
1733#define DECL_MODULE_ATTACH_P(N) \
1734 (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (N))->u.base.module_attach_p)
1735
1736/* True if the live version of the decl was imported. */
1737#define DECL_MODULE_IMPORT_P(NODE) \
1738 (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (NODE))->u.base.module_import_p)
1739
1740/* True if this decl is in the entity hash & array. This means that
1741 some variant was imported, even if DECL_MODULE_IMPORT_P is false. */
1742#define DECL_MODULE_ENTITY_P(NODE) \
1743 (DECL_LANG_SPECIFIC (DECL_MODULE_CHECK (NODE))->u.base.module_entity_p)
1744
1745/* DECL that has attached decls for ODR-relatedness. */
1746#define DECL_MODULE_KEYED_DECLS_P(NODE) \
1747 (DECL_LANG_SPECIFIC (TREE_CHECK2(NODE,FUNCTION_DECL,VAR_DECL))\
1748 ->u.base.module_keyed_decls_p)
1749
1750/* Whether this is an exported DECL. Held on any decl that can appear
1751 at namespace scope (function, var, type, template, const or
1752 namespace). templates copy from their template_result, consts have
1753 it for unscoped enums. */
1754#define DECL_MODULE_EXPORT_P(NODE) TREE_LANG_FLAG_3 (NODE)
1755
1756
1757/* The list of local parameters introduced by this requires-expression,
1758 in the form of a chain of PARM_DECLs. */
1759#define REQUIRES_EXPR_PARMS(NODE) \
1760 TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 0)
1761
1762/* A TREE_LIST of the requirements for this requires-expression.
1763 The requirements are stored in lexical order within the TREE_VALUE
1764 of each TREE_LIST node. The TREE_PURPOSE of each node is unused. */
1765#define REQUIRES_EXPR_REQS(NODE) \
1766 TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 1)
1767
1768/* Like PACK_EXPANSION_EXTRA_ARGS, for requires-expressions. */
1769#define REQUIRES_EXPR_EXTRA_ARGS(NODE) \
1770 TREE_OPERAND (TREE_CHECK (NODE, REQUIRES_EXPR), 2)
1771
1772enum cp_tree_node_structure_enum {
1773 TS_CP_GENERIC,
1774 TS_CP_IDENTIFIER,
1775 TS_CP_TPI,
1776 TS_CP_PTRMEM,
1777 TS_CP_OVERLOAD,
1778 TS_CP_BINDING_VECTOR,
1779 TS_CP_BASELINK,
1780 TS_CP_TEMPLATE_DECL,
1781 TS_CP_DEFERRED_PARSE,
1782 TS_CP_DEFERRED_NOEXCEPT,
1783 TS_CP_STATIC_ASSERT,
1784 TS_CP_ARGUMENT_PACK_SELECT,
1785 TS_CP_TRAIT_EXPR,
1786 TS_CP_LAMBDA_EXPR,
1787 TS_CP_TEMPLATE_INFO,
1788 TS_CP_CONSTRAINT_INFO,
1789 TS_CP_USERDEF_LITERAL
1790};
1791
1792/* The resulting tree type. */
1793union GTY((desc ("cp_tree_node_structure (&%h)"),
1794 chain_next ("(union lang_tree_node *) c_tree_chain_next (&%h.generic)"))) lang_tree_node {
1795 union tree_node GTY ((tag ("TS_CP_GENERIC"),
1796 desc ("tree_node_structure (&%h)"))) generic;
1797 struct template_parm_index GTY ((tag ("TS_CP_TPI"))) tpi;
1798 struct ptrmem_cst GTY ((tag ("TS_CP_PTRMEM"))) ptrmem;
1799 struct tree_overload GTY ((tag ("TS_CP_OVERLOAD"))) overload;
1800 struct tree_binding_vec GTY ((tag ("TS_CP_BINDING_VECTOR"))) binding_vec;
1801 struct tree_baselink GTY ((tag ("TS_CP_BASELINK"))) baselink;
1802 struct tree_template_decl GTY ((tag ("TS_CP_TEMPLATE_DECL"))) template_decl;
1803 struct tree_deferred_parse GTY ((tag ("TS_CP_DEFERRED_PARSE"))) deferred_parse;
1804 struct tree_deferred_noexcept GTY ((tag ("TS_CP_DEFERRED_NOEXCEPT"))) deferred_noexcept;
1805 struct lang_identifier GTY ((tag ("TS_CP_IDENTIFIER"))) identifier;
1806 struct tree_static_assert GTY ((tag ("TS_CP_STATIC_ASSERT")))
1807 static_assertion;
1808 struct tree_argument_pack_select GTY ((tag ("TS_CP_ARGUMENT_PACK_SELECT")))
1809 argument_pack_select;
1810 struct tree_trait_expr GTY ((tag ("TS_CP_TRAIT_EXPR")))
1811 trait_expression;
1812 struct tree_lambda_expr GTY ((tag ("TS_CP_LAMBDA_EXPR")))
1813 lambda_expression;
1814 struct tree_template_info GTY ((tag ("TS_CP_TEMPLATE_INFO")))
1815 template_info;
1816 struct tree_constraint_info GTY ((tag ("TS_CP_CONSTRAINT_INFO")))
1817 constraint_info;
1818 struct tree_userdef_literal GTY ((tag ("TS_CP_USERDEF_LITERAL")))
1819 userdef_literal;
1820};
1821
1822
1823struct GTY(()) omp_declare_target_attr {
1824 bool attr_syntax;
1825};
1826
1827/* Global state. */
1828
1829struct GTY(()) saved_scope {
1830 vec<cxx_saved_binding, va_gc> *old_bindings;
1831 tree old_namespace;
1832 vec<tree, va_gc> *decl_ns_list;
1833 tree class_name;
1834 tree class_type;
1835 tree access_specifier;
1836 tree function_decl;
1837 vec<tree, va_gc> *lang_base;
1838 tree lang_name;
1839 tree template_parms;
1840 cp_binding_level *x_previous_class_level;
1841 tree x_saved_tree;
1842
1843 /* Only used for uses of this in trailing return type. */
1844 tree x_current_class_ptr;
1845 tree x_current_class_ref;
1846
1847 int x_processing_template_decl;
1848 int x_processing_specialization;
1849 int x_processing_constraint;
1850 int suppress_location_wrappers;
1851 BOOL_BITFIELD x_processing_explicit_instantiation : 1;
1852 BOOL_BITFIELD need_pop_function_context : 1;
1853
1854 /* Nonzero if we are parsing the discarded statement of a constexpr
1855 if-statement. */
1856 BOOL_BITFIELD discarded_stmt : 1;
1857 /* Nonzero if we are parsing or instantiating the compound-statement
1858 of consteval if statement. Also set while processing an immediate
1859 invocation. */
1860 BOOL_BITFIELD consteval_if_p : 1;
1861
1862 int unevaluated_operand;
1863 int inhibit_evaluation_warnings;
1864 int noexcept_operand;
1865 int ref_temp_count;
1866
1867 struct stmt_tree_s x_stmt_tree;
1868
1869 cp_binding_level *class_bindings;
1870 cp_binding_level *bindings;
1871
1872 hash_map<tree, tree> *GTY((skip)) x_local_specializations;
1873 vec<omp_declare_target_attr, va_gc> *omp_declare_target_attribute;
1874
1875 struct saved_scope *prev;
1876};
1877
1878extern GTY(()) struct saved_scope *scope_chain;
1879
1880/* The current open namespace. */
1881
1882#define current_namespace scope_chain->old_namespace
1883
1884/* The stack for namespaces of current declarations. */
1885
1886#define decl_namespace_list scope_chain->decl_ns_list
1887
1888/* IDENTIFIER_NODE: name of current class */
1889
1890#define current_class_name scope_chain->class_name
1891
1892/* _TYPE: the type of the current class */
1893
1894#define current_class_type scope_chain->class_type
1895
1896/* When parsing a class definition, the access specifier most recently
1897 given by the user, or, if no access specifier was given, the
1898 default value appropriate for the kind of class (i.e., struct,
1899 class, or union). */
1900
1901#define current_access_specifier scope_chain->access_specifier
1902
1903/* Pointer to the top of the language name stack. */
1904
1905#define current_lang_base scope_chain->lang_base
1906#define current_lang_name scope_chain->lang_name
1907
1908/* When parsing a template declaration, a TREE_LIST represents the
1909 active template parameters. Each node in the list represents one
1910 level of template parameters. The innermost level is first in the
1911 list. The depth of each level is stored as an INTEGER_CST in the
1912 TREE_PURPOSE of each node. The parameters for that level are
1913 stored in the TREE_VALUE. */
1914
1915#define current_template_parms scope_chain->template_parms
1916#define current_template_depth \
1917 (current_template_parms ? TMPL_PARMS_DEPTH (current_template_parms) : 0)
1918
1919#define processing_template_decl scope_chain->x_processing_template_decl
1920#define processing_specialization scope_chain->x_processing_specialization
1921#define processing_explicit_instantiation scope_chain->x_processing_explicit_instantiation
1922
1923#define in_discarded_stmt scope_chain->discarded_stmt
1924#define in_consteval_if_p scope_chain->consteval_if_p
1925
1926#define current_ref_temp_count scope_chain->ref_temp_count
1927
1928/* RAII sentinel to handle clearing processing_template_decl and restoring
1929 it when done. */
1930
1931class processing_template_decl_sentinel
1932{
1933public:
1934 int saved;
1935 processing_template_decl_sentinel (bool reset = true)
1936 : saved (processing_template_decl)
1937 {
1938 if (reset)
1939 processing_template_decl = 0;
1940 }
1941 ~processing_template_decl_sentinel()
1942 {
1943 processing_template_decl = saved;
1944 }
1945};
1946
1947/* RAII sentinel to disable certain warnings during template substitution
1948 and elsewhere. */
1949
1950class warning_sentinel
1951{
1952public:
1953 int &flag;
1954 int val;
1955 warning_sentinel(int& flag, bool suppress=true)
1956 : flag(flag), val(flag) { if (suppress) flag = 0; }
1957 ~warning_sentinel() { flag = val; }
1958};
1959
1960/* RAII sentinel to temporarily override input_location. This will not set
1961 input_location to UNKNOWN_LOCATION or BUILTINS_LOCATION. */
1962
1963class iloc_sentinel
1964{
1965 location_t saved_loc;
1966public:
1967 iloc_sentinel (location_t loc): saved_loc (input_location)
1968 {
1969 if (loc >= RESERVED_LOCATION_COUNT)
1970 input_location = loc;
1971 }
1972 ~iloc_sentinel ()
1973 {
1974 input_location = saved_loc;
1975 }
1976};
1977
1978/* RAII sentinel that saves the value of a variable, optionally
1979 overrides it right away, and restores its value when the sentinel
1980 id destructed. */
1981
1982template <typename T>
1983class temp_override
1984{
1985 T& overridden_variable;
1986 T saved_value;
1987public:
1988 temp_override(T& var) : overridden_variable (var), saved_value (var) {}
1989 temp_override(T& var, T overrider)
1990 : overridden_variable (var), saved_value (var)
1991 {
1992 overridden_variable = overrider;
1993 }
1994 ~temp_override() { overridden_variable = saved_value; }
1995};
1996
1997/* Wrapping a template parameter in type_identity_t hides it from template
1998 argument deduction. */
1999#if __cpp_lib_type_identity
2000using std::type_identity_t;
2001#else
2002template <typename T>
2003struct type_identity { typedef T type; };
2004template <typename T>
2005using type_identity_t = typename type_identity<T>::type;
2006#endif
2007
2008/* Object generator function for temp_override, so you don't need to write the
2009 type of the object as a template argument.
2010
2011 Use as auto x = make_temp_override (flag); */
2012
2013template <typename T>
2014inline temp_override<T>
2015make_temp_override (T& var)
2016{
2017 return { var };
2018}
2019
2020/* Likewise, but use as auto x = make_temp_override (flag, value); */
2021
2022template <typename T>
2023inline temp_override<T>
2024make_temp_override (T& var, type_identity_t<T> overrider)
2025{
2026 return { var, overrider };
2027}
2028
2029/* The cached class binding level, from the most recently exited
2030 class, or NULL if none. */
2031
2032#define previous_class_level scope_chain->x_previous_class_level
2033
2034/* A map from local variable declarations in the body of the template
2035 presently being instantiated to the corresponding instantiated
2036 local variables. */
2037
2038#define local_specializations scope_chain->x_local_specializations
2039
2040/* Nonzero if we are parsing the operand of a noexcept operator. */
2041
2042#define cp_noexcept_operand scope_chain->noexcept_operand
2043
2044struct named_label_entry; /* Defined in decl.cc. */
2045
2046struct named_label_hash : ggc_remove <named_label_entry *>
2047{
2048 typedef named_label_entry *value_type;
2049 typedef tree compare_type; /* An identifier. */
2050
2051 inline static hashval_t hash (value_type);
2052 inline static bool equal (const value_type, compare_type);
2053
2054 static const bool empty_zero_p = true;
2055 inline static void mark_empty (value_type &p) {p = NULL;}
2056 inline static bool is_empty (value_type p) {return !p;}
2057
2058 /* Nothing is deletable. Everything is insertable. */
2059 inline static bool is_deleted (value_type) { return false; }
2060 inline static void mark_deleted (value_type) { gcc_unreachable (); }
2061};
2062
2063/* Global state pertinent to the current function. */
2064
2065struct GTY(()) language_function {
2066 struct c_language_function base;
2067
2068 tree x_current_class_ptr;
2069 tree x_current_class_ref;
2070 tree x_eh_spec_block;
2071 tree x_in_charge_parm;
2072 tree x_vtt_parm;
2073 tree x_return_value;
2074
2075 BOOL_BITFIELD returns_value : 1;
2076 BOOL_BITFIELD returns_null : 1;
2077 BOOL_BITFIELD returns_abnormally : 1;
2078 BOOL_BITFIELD infinite_loop: 1;
2079 BOOL_BITFIELD x_in_function_try_handler : 1;
2080 BOOL_BITFIELD x_in_base_initializer : 1;
2081
2082 /* True if this function can throw an exception. */
2083 BOOL_BITFIELD can_throw : 1;
2084
2085 BOOL_BITFIELD invalid_constexpr : 1;
2086 BOOL_BITFIELD throwing_cleanup : 1;
2087
2088 hash_table<named_label_hash> *x_named_labels;
2089
2090 cp_binding_level *bindings;
2091
2092 /* Tracking possibly infinite loops. This is a vec<tree> only because
2093 vec<bool> doesn't work with gtype. */
2094 vec<tree, va_gc> *infinite_loops;
2095};
2096
2097/* The current C++-specific per-function global variables. */
2098
2099#define cp_function_chain (cfun->language)
2100
2101/* When we're processing a member function, current_class_ptr is the
2102 PARM_DECL for the `this' pointer. The current_class_ref is an
2103 expression for `*this'. */
2104
2105#define current_class_ptr \
2106 (*(cfun && cp_function_chain \
2107 ? &cp_function_chain->x_current_class_ptr \
2108 : &scope_chain->x_current_class_ptr))
2109#define current_class_ref \
2110 (*(cfun && cp_function_chain \
2111 ? &cp_function_chain->x_current_class_ref \
2112 : &scope_chain->x_current_class_ref))
2113
2114/* The EH_SPEC_BLOCK for the exception-specifiers for the current
2115 function, if any. */
2116
2117#define current_eh_spec_block cp_function_chain->x_eh_spec_block
2118
2119/* The `__in_chrg' parameter for the current function. Only used for
2120 constructors and destructors. */
2121
2122#define current_in_charge_parm cp_function_chain->x_in_charge_parm
2123
2124/* The `__vtt_parm' parameter for the current function. Only used for
2125 constructors and destructors. */
2126
2127#define current_vtt_parm cp_function_chain->x_vtt_parm
2128
2129/* A boolean flag to control whether we need to clean up the return value if a
2130 local destructor throws. Only used in functions that return by value a
2131 class with a destructor. Which 'tors don't, so we can use the same
2132 field as current_vtt_parm. */
2133
2134#define current_retval_sentinel current_vtt_parm
2135
2136/* Set to 0 at beginning of a function definition, set to 1 if
2137 a return statement that specifies a return value is seen. */
2138
2139#define current_function_returns_value cp_function_chain->returns_value
2140
2141/* Set to 0 at beginning of a function definition, set to 1 if
2142 a return statement with no argument is seen. */
2143
2144#define current_function_returns_null cp_function_chain->returns_null
2145
2146/* Set to 0 at beginning of a function definition, set to 1 if
2147 a call to a noreturn function is seen. */
2148
2149#define current_function_returns_abnormally \
2150 cp_function_chain->returns_abnormally
2151
2152/* Set to 0 at beginning of a function definition, set to 1 if we see an
2153 obvious infinite loop. This can have false positives and false
2154 negatives, so it should only be used as a heuristic. */
2155
2156#define current_function_infinite_loop cp_function_chain->infinite_loop
2157
2158/* Nonzero if we are processing a base initializer. Zero elsewhere. */
2159#define in_base_initializer cp_function_chain->x_in_base_initializer
2160
2161#define in_function_try_handler cp_function_chain->x_in_function_try_handler
2162
2163/* Expression always returned from function, or error_mark_node
2164 otherwise, for use by the automatic named return value optimization. */
2165
2166#define current_function_return_value \
2167 (cp_function_chain->x_return_value)
2168
2169/* In parser.cc. */
2170extern tree cp_literal_operator_id (const char *);
2171
2172#define NON_ERROR(NODE) ((NODE) == error_mark_node ? NULL_TREE : (NODE))
2173
2174/* TRUE if a tree code represents a statement. */
2175extern bool statement_code_p[MAX_TREE_CODES];
2176
2177#define STATEMENT_CODE_P(CODE) statement_code_p[(int) (CODE)]
2178
2179enum languages { lang_c, lang_cplusplus };
2180
2181/* Macros to make error reporting functions' lives easier. */
2182#define TYPE_LINKAGE_IDENTIFIER(NODE) \
2183 (TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (NODE)))
2184#define TYPE_NAME_STRING(NODE) (IDENTIFIER_POINTER (TYPE_IDENTIFIER (NODE)))
2185#define TYPE_NAME_LENGTH(NODE) (IDENTIFIER_LENGTH (TYPE_IDENTIFIER (NODE)))
2186
2187/* Any kind of anonymous type. */
2188#define TYPE_ANON_P(NODE) \
2189 (TYPE_LINKAGE_IDENTIFIER (NODE) \
2190 && IDENTIFIER_ANON_P (TYPE_LINKAGE_IDENTIFIER (NODE)))
2191
2192/* Nonzero if NODE, a TYPE, has no name for linkage purposes. */
2193#define TYPE_UNNAMED_P(NODE) \
2194 (TYPE_ANON_P (NODE) \
2195 && !IDENTIFIER_LAMBDA_P (TYPE_LINKAGE_IDENTIFIER (NODE)))
2196
2197/* The _DECL for this _TYPE. */
2198#define TYPE_MAIN_DECL(NODE) (TYPE_STUB_DECL (TYPE_MAIN_VARIANT (NODE)))
2199
2200/* Nonzero if T is a type that could resolve to any kind of concrete type
2201 at instantiation time. */
2202#define WILDCARD_TYPE_P(T) \
2203 (TREE_CODE (T) == TEMPLATE_TYPE_PARM \
2204 || TREE_CODE (T) == TYPENAME_TYPE \
2205 || TREE_CODE (T) == TYPEOF_TYPE \
2206 || TREE_CODE (T) == BOUND_TEMPLATE_TEMPLATE_PARM \
2207 || TREE_CODE (T) == DECLTYPE_TYPE \
2208 || TREE_CODE (T) == DEPENDENT_OPERATOR_TYPE)
2209
2210/* Nonzero if T is a class (or struct or union) type. Also nonzero
2211 for template type parameters, typename types, and instantiated
2212 template template parameters. Keep these checks in ascending code
2213 order. */
2214#define MAYBE_CLASS_TYPE_P(T) (WILDCARD_TYPE_P (T) || CLASS_TYPE_P (T))
2215
2216/* Set CLASS_TYPE_P for T to VAL. T must be a class, struct, or
2217 union type. */
2218#define SET_CLASS_TYPE_P(T, VAL) \
2219 (TYPE_LANG_FLAG_5 (RECORD_OR_UNION_CHECK (T)) = (VAL))
2220
2221/* Nonzero if T is a class type. Zero for template type parameters,
2222 typename types, and so forth. */
2223#define CLASS_TYPE_P(T) \
2224 (RECORD_OR_UNION_CODE_P (TREE_CODE (T)) && TYPE_LANG_FLAG_5 (T))
2225
2226/* Nonzero if T is a class type but not a union. */
2227#define NON_UNION_CLASS_TYPE_P(T) \
2228 (TREE_CODE (T) == RECORD_TYPE && TYPE_LANG_FLAG_5 (T))
2229
2230/* Keep these checks in ascending code order. */
2231#define RECORD_OR_UNION_CODE_P(T) \
2232 ((T) == RECORD_TYPE || (T) == UNION_TYPE)
2233#define OVERLOAD_TYPE_P(T) \
2234 (CLASS_TYPE_P (T) || TREE_CODE (T) == ENUMERAL_TYPE)
2235
2236/* True if this type is dependent. This predicate is only valid if
2237 TYPE_DEPENDENT_P_VALID is true. */
2238#define TYPE_DEPENDENT_P(NODE) TYPE_LANG_FLAG_0 (NODE)
2239
2240/* True if dependent_type_p has been called for this type, with the
2241 result that TYPE_DEPENDENT_P is valid. */
2242#define TYPE_DEPENDENT_P_VALID(NODE) TYPE_LANG_FLAG_6(NODE)
2243
2244/* Nonzero if this type is const-qualified. */
2245#define CP_TYPE_CONST_P(NODE) \
2246 ((cp_type_quals (NODE) & TYPE_QUAL_CONST) != 0)
2247
2248/* Nonzero if this type is volatile-qualified. */
2249#define CP_TYPE_VOLATILE_P(NODE) \
2250 ((cp_type_quals (NODE) & TYPE_QUAL_VOLATILE) != 0)
2251
2252/* Nonzero if this type is restrict-qualified. */
2253#define CP_TYPE_RESTRICT_P(NODE) \
2254 ((cp_type_quals (NODE) & TYPE_QUAL_RESTRICT) != 0)
2255
2256/* Nonzero if this type is const-qualified, but not
2257 volatile-qualified. Other qualifiers are ignored. This macro is
2258 used to test whether or not it is OK to bind an rvalue to a
2259 reference. */
2260#define CP_TYPE_CONST_NON_VOLATILE_P(NODE) \
2261 ((cp_type_quals (NODE) & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)) \
2262 == TYPE_QUAL_CONST)
2263
2264#define FUNCTION_ARG_CHAIN(NODE) \
2265 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (NODE)))
2266
2267/* Given a FUNCTION_DECL, returns the first TREE_LIST out of TYPE_ARG_TYPES
2268 which refers to a user-written parameter. */
2269#define FUNCTION_FIRST_USER_PARMTYPE(NODE) \
2270 skip_artificial_parms_for ((NODE), TYPE_ARG_TYPES (TREE_TYPE (NODE)))
2271
2272/* Similarly, but for DECL_ARGUMENTS. */
2273#define FUNCTION_FIRST_USER_PARM(NODE) \
2274 skip_artificial_parms_for ((NODE), DECL_ARGUMENTS (NODE))
2275
2276/* Nonzero iff TYPE is derived from PARENT. Ignores accessibility and
2277 ambiguity issues. */
2278#define DERIVED_FROM_P(PARENT, TYPE) \
2279 (lookup_base ((TYPE), (PARENT), ba_any, NULL, tf_none) != NULL_TREE)
2280
2281/* Gives the visibility specification for a class type. */
2282#define CLASSTYPE_VISIBILITY(TYPE) \
2283 DECL_VISIBILITY (TYPE_MAIN_DECL (TYPE))
2284#define CLASSTYPE_VISIBILITY_SPECIFIED(TYPE) \
2285 DECL_VISIBILITY_SPECIFIED (TYPE_MAIN_DECL (TYPE))
2286
2287struct GTY (()) tree_pair_s {
2288 tree purpose;
2289 tree value;
2290};
2291typedef tree_pair_s *tree_pair_p;
2292
2293/* This structure provides additional information above and beyond
2294 what is provide in the ordinary tree_type. In the past, we used it
2295 for the types of class types, template parameters types, typename
2296 types, and so forth. However, there can be many (tens to hundreds
2297 of thousands) of template parameter types in a compilation, and
2298 there's no need for this additional information in that case.
2299 Therefore, we now use this data structure only for class types.
2300
2301 In the past, it was thought that there would be relatively few
2302 class types. However, in the presence of heavy use of templates,
2303 many (i.e., thousands) of classes can easily be generated.
2304 Therefore, we should endeavor to keep the size of this structure to
2305 a minimum. */
2306struct GTY(()) lang_type {
2307 unsigned char align;
2308
2309 unsigned has_type_conversion : 1;
2310 unsigned has_copy_ctor : 1;
2311 unsigned has_default_ctor : 1;
2312 unsigned const_needs_init : 1;
2313 unsigned ref_needs_init : 1;
2314 unsigned has_const_copy_assign : 1;
2315 unsigned use_template : 2;
2316
2317 unsigned has_mutable : 1;
2318 unsigned com_interface : 1;
2319 unsigned non_pod_class : 1;
2320 unsigned nearly_empty_p : 1;
2321 unsigned user_align : 1;
2322 unsigned has_copy_assign : 1;
2323 unsigned has_new : 1;
2324 unsigned has_array_new : 1;
2325
2326 unsigned gets_delete : 2;
2327 unsigned interface_only : 1;
2328 unsigned interface_unknown : 1;
2329 unsigned contains_empty_class_p : 1;
2330 unsigned anon_aggr : 1;
2331 unsigned non_zero_init : 1;
2332 unsigned empty_p : 1;
2333 /* 32 bits allocated. */
2334
2335 unsigned vec_new_uses_cookie : 1;
2336 unsigned declared_class : 1;
2337 unsigned diamond_shaped : 1;
2338 unsigned repeated_base : 1;
2339 unsigned being_defined : 1;
2340 unsigned debug_requested : 1;
2341 unsigned fields_readonly : 1;
2342 unsigned ptrmemfunc_flag : 1;
2343
2344 unsigned lazy_default_ctor : 1;
2345 unsigned lazy_copy_ctor : 1;
2346 unsigned lazy_copy_assign : 1;
2347 unsigned lazy_destructor : 1;
2348 unsigned has_const_copy_ctor : 1;
2349 unsigned has_complex_copy_ctor : 1;
2350 unsigned has_complex_copy_assign : 1;
2351 unsigned non_aggregate : 1;
2352
2353 unsigned has_complex_dflt : 1;
2354 unsigned has_list_ctor : 1;
2355 unsigned non_std_layout : 1;
2356 unsigned is_literal : 1;
2357 unsigned lazy_move_ctor : 1;
2358 unsigned lazy_move_assign : 1;
2359 unsigned has_complex_move_ctor : 1;
2360 unsigned has_complex_move_assign : 1;
2361
2362 unsigned has_constexpr_ctor : 1;
2363 unsigned unique_obj_representations : 1;
2364 unsigned unique_obj_representations_set : 1;
2365 bool erroneous : 1;
2366 bool non_pod_aggregate : 1;
2367
2368 /* When adding a flag here, consider whether or not it ought to
2369 apply to a template instance if it applies to the template. If
2370 so, make sure to copy it in instantiate_class_template! */
2371
2372 /* There are some bits left to fill out a 32-bit word. Keep track
2373 of this by updating the size of this bitfield whenever you add or
2374 remove a flag. */
2375 unsigned dummy : 3;
2376
2377 tree primary_base;
2378 vec<tree_pair_s, va_gc> *vcall_indices;
2379 tree vtables;
2380 tree typeinfo_var;
2381 vec<tree, va_gc> *vbases;
2382 tree as_base;
2383 vec<tree, va_gc> *pure_virtuals;
2384 tree friend_classes;
2385 vec<tree, va_gc> * GTY((reorder ("resort_type_member_vec"))) members;
2386 tree key_method;
2387 tree decl_list;
2388 tree befriending_classes;
2389 /* In a RECORD_TYPE, information specific to Objective-C++, such
2390 as a list of adopted protocols or a pointer to a corresponding
2391 @interface. See objc/objc-act.h for details. */
2392 tree objc_info;
2393 /* FIXME reuse another field? */
2394 tree lambda_expr;
2395};
2396
2397/* We used to have a variant type for lang_type. Keep the name of the
2398 checking accessor for the sole survivor. */
2399#define LANG_TYPE_CLASS_CHECK(NODE) (TYPE_LANG_SPECIFIC (NODE))
2400
2401/* Nonzero for _CLASSTYPE means that operator delete is defined. */
2402#define TYPE_GETS_DELETE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->gets_delete)
2403#define TYPE_GETS_REG_DELETE(NODE) (TYPE_GETS_DELETE (NODE) & 1)
2404#define TYPE_GETS_VEC_DELETE(NODE) (TYPE_GETS_DELETE (NODE) & 2)
2405
2406/* Nonzero if `new NODE[x]' should cause the allocation of extra
2407 storage to indicate how many array elements are in use. */
2408#define TYPE_VEC_NEW_USES_COOKIE(NODE) \
2409 (CLASS_TYPE_P (NODE) \
2410 && LANG_TYPE_CLASS_CHECK (NODE)->vec_new_uses_cookie)
2411
2412/* Nonzero means that this _CLASSTYPE node defines ways of converting
2413 itself to other types. */
2414#define TYPE_HAS_CONVERSION(NODE) \
2415 (LANG_TYPE_CLASS_CHECK (NODE)->has_type_conversion)
2416
2417/* Nonzero means that NODE (a class type) has a default constructor --
2418 but that it has not yet been declared. */
2419#define CLASSTYPE_LAZY_DEFAULT_CTOR(NODE) \
2420 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_default_ctor)
2421
2422/* Nonzero means that NODE (a class type) has a copy constructor --
2423 but that it has not yet been declared. */
2424#define CLASSTYPE_LAZY_COPY_CTOR(NODE) \
2425 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_copy_ctor)
2426
2427/* Nonzero means that NODE (a class type) has a move constructor --
2428 but that it has not yet been declared. */
2429#define CLASSTYPE_LAZY_MOVE_CTOR(NODE) \
2430 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_move_ctor)
2431
2432/* Nonzero means that NODE (a class type) has an assignment operator
2433 -- but that it has not yet been declared. */
2434#define CLASSTYPE_LAZY_COPY_ASSIGN(NODE) \
2435 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_copy_assign)
2436
2437/* Nonzero means that NODE (a class type) has an assignment operator
2438 -- but that it has not yet been declared. */
2439#define CLASSTYPE_LAZY_MOVE_ASSIGN(NODE) \
2440 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_move_assign)
2441
2442/* Nonzero means that NODE (a class type) has a destructor -- but that
2443 it has not yet been declared. */
2444#define CLASSTYPE_LAZY_DESTRUCTOR(NODE) \
2445 (LANG_TYPE_CLASS_CHECK (NODE)->lazy_destructor)
2446
2447/* Nonzero means that NODE (a class type) is final */
2448#define CLASSTYPE_FINAL(NODE) \
2449 TYPE_FINAL_P (NODE)
2450
2451
2452/* Nonzero means that this _CLASSTYPE node overloads operator=(X&). */
2453#define TYPE_HAS_COPY_ASSIGN(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_copy_assign)
2454
2455/* True iff the class type NODE has an "operator =" whose parameter
2456 has a parameter of type "const X&". */
2457#define TYPE_HAS_CONST_COPY_ASSIGN(NODE) \
2458 (LANG_TYPE_CLASS_CHECK (NODE)->has_const_copy_assign)
2459
2460/* Nonzero means that this _CLASSTYPE node has an X(X&) constructor. */
2461#define TYPE_HAS_COPY_CTOR(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_copy_ctor)
2462#define TYPE_HAS_CONST_COPY_CTOR(NODE) \
2463 (LANG_TYPE_CLASS_CHECK (NODE)->has_const_copy_ctor)
2464
2465/* Nonzero if this class has an X(initializer_list<T>) constructor. */
2466#define TYPE_HAS_LIST_CTOR(NODE) \
2467 (LANG_TYPE_CLASS_CHECK (NODE)->has_list_ctor)
2468
2469/* Nonzero if this class has a constexpr constructor other than a copy/move
2470 constructor. Note that a class can have constexpr constructors for
2471 static initialization even if it isn't a literal class. */
2472#define TYPE_HAS_CONSTEXPR_CTOR(NODE) \
2473 (LANG_TYPE_CLASS_CHECK (NODE)->has_constexpr_ctor)
2474
2475/* Nonzero if this class defines an overloaded operator new. (An
2476 operator new [] doesn't count.) */
2477#define TYPE_HAS_NEW_OPERATOR(NODE) \
2478 (LANG_TYPE_CLASS_CHECK (NODE)->has_new)
2479
2480/* Nonzero if this class defines an overloaded operator new[]. */
2481#define TYPE_HAS_ARRAY_NEW_OPERATOR(NODE) \
2482 (LANG_TYPE_CLASS_CHECK (NODE)->has_array_new)
2483
2484/* Nonzero means that this type is being defined. I.e., the left brace
2485 starting the definition of this type has been seen. */
2486#define TYPE_BEING_DEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->being_defined)
2487
2488/* Nonzero means that this type is either complete or being defined, so we
2489 can do lookup in it. */
2490#define COMPLETE_OR_OPEN_TYPE_P(NODE) \
2491 (COMPLETE_TYPE_P (NODE) || (CLASS_TYPE_P (NODE) && TYPE_BEING_DEFINED (NODE)))
2492
2493/* Mark bits for repeated base checks. */
2494#define TYPE_MARKED_P(NODE) TREE_LANG_FLAG_6 (TYPE_CHECK (NODE))
2495
2496/* Nonzero if the class NODE has multiple paths to the same (virtual)
2497 base object. */
2498#define CLASSTYPE_DIAMOND_SHAPED_P(NODE) \
2499 (LANG_TYPE_CLASS_CHECK(NODE)->diamond_shaped)
2500
2501/* Nonzero if the class NODE has multiple instances of the same base
2502 type. */
2503#define CLASSTYPE_REPEATED_BASE_P(NODE) \
2504 (LANG_TYPE_CLASS_CHECK(NODE)->repeated_base)
2505
2506/* The member function with which the vtable will be emitted:
2507 the first noninline non-pure-virtual member function. NULL_TREE
2508 if there is no key function or if this is a class template */
2509#define CLASSTYPE_KEY_METHOD(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->key_method)
2510
2511/* Vector of members. During definition, it is unordered and only
2512 member functions are present. After completion it is sorted and
2513 contains both member functions and non-functions. STAT_HACK is
2514 involved to preserve oneslot per name invariant. */
2515#define CLASSTYPE_MEMBER_VEC(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->members)
2516
2517/* For class templates, this is a TREE_LIST of all member data,
2518 functions, types, and friends in the order of declaration.
2519 The TREE_PURPOSE of each TREE_LIST is NULL_TREE for a friend,
2520 and the RECORD_TYPE for the class template otherwise. */
2521#define CLASSTYPE_DECL_LIST(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->decl_list)
2522
2523/* A FUNCTION_DECL or OVERLOAD for the constructors for NODE. These
2524 are the constructors that take an in-charge parameter. */
2525#define CLASSTYPE_CONSTRUCTORS(NODE) \
2526 (get_class_binding_direct (NODE, ctor_identifier))
2527
2528/* A FUNCTION_DECL for the destructor for NODE. This is the
2529 destructors that take an in-charge parameter. If
2530 CLASSTYPE_LAZY_DESTRUCTOR is true, then this entry will be NULL
2531 until the destructor is created with lazily_declare_fn. */
2532#define CLASSTYPE_DESTRUCTOR(NODE) \
2533 (get_class_binding_direct (NODE, dtor_identifier))
2534
2535/* Nonzero if NODE has a primary base class, i.e., a base class with
2536 which it shares the virtual function table pointer. */
2537#define CLASSTYPE_HAS_PRIMARY_BASE_P(NODE) \
2538 (CLASSTYPE_PRIMARY_BINFO (NODE) != NULL_TREE)
2539
2540/* If non-NULL, this is the binfo for the primary base class, i.e.,
2541 the base class which contains the virtual function table pointer
2542 for this class. */
2543#define CLASSTYPE_PRIMARY_BINFO(NODE) \
2544 (LANG_TYPE_CLASS_CHECK (NODE)->primary_base)
2545
2546/* A vector of BINFOs for the direct and indirect virtual base classes
2547 that this type uses in a post-order depth-first left-to-right
2548 order. (In other words, these bases appear in the order that they
2549 should be initialized.) */
2550#define CLASSTYPE_VBASECLASSES(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vbases)
2551
2552/* The type corresponding to NODE when NODE is used as a base class,
2553 i.e., NODE without virtual base classes or tail padding. */
2554#define CLASSTYPE_AS_BASE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->as_base)
2555
2556/* True iff NODE is the CLASSTYPE_AS_BASE version of some type. */
2557#define IS_FAKE_BASE_TYPE(NODE) \
2558 (TREE_CODE (NODE) == RECORD_TYPE \
2559 && TYPE_CONTEXT (NODE) && CLASS_TYPE_P (TYPE_CONTEXT (NODE)) \
2560 && CLASSTYPE_AS_BASE (TYPE_CONTEXT (NODE)) == (NODE))
2561
2562/* These are the size and alignment of the type without its virtual
2563 base classes, for when we use this type as a base itself. */
2564#define CLASSTYPE_SIZE(NODE) TYPE_SIZE (CLASSTYPE_AS_BASE (NODE))
2565#define CLASSTYPE_SIZE_UNIT(NODE) TYPE_SIZE_UNIT (CLASSTYPE_AS_BASE (NODE))
2566#define CLASSTYPE_ALIGN(NODE) TYPE_ALIGN (CLASSTYPE_AS_BASE (NODE))
2567#define CLASSTYPE_USER_ALIGN(NODE) TYPE_USER_ALIGN (CLASSTYPE_AS_BASE (NODE))
2568
2569/* The alignment of NODE, without its virtual bases, in bytes. */
2570#define CLASSTYPE_ALIGN_UNIT(NODE) \
2571 (CLASSTYPE_ALIGN (NODE) / BITS_PER_UNIT)
2572
2573/* A vec<tree> of virtual functions which cannot be inherited by
2574 derived classes. When deriving from this type, the derived
2575 class must provide its own definition for each of these functions. */
2576#define CLASSTYPE_PURE_VIRTUALS(NODE) \
2577 (LANG_TYPE_CLASS_CHECK (NODE)->pure_virtuals)
2578
2579/* Nonzero means that this type is an abstract class type. */
2580#define ABSTRACT_CLASS_TYPE_P(NODE) \
2581 (CLASS_TYPE_P (NODE) && CLASSTYPE_PURE_VIRTUALS(NODE))
2582
2583/* Nonzero means that this type has an X() constructor. */
2584#define TYPE_HAS_DEFAULT_CONSTRUCTOR(NODE) \
2585 (LANG_TYPE_CLASS_CHECK (NODE)->has_default_ctor)
2586
2587/* Nonzero means that this type contains a mutable member. */
2588#define CLASSTYPE_HAS_MUTABLE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_mutable)
2589#define TYPE_HAS_MUTABLE_P(NODE) (cp_has_mutable_p (NODE))
2590
2591/* Nonzero means that this class type is not POD for the purpose of layout
2592 (as defined in the ABI). This is different from the language's POD. */
2593#define CLASSTYPE_NON_LAYOUT_POD_P(NODE) \
2594 (LANG_TYPE_CLASS_CHECK (NODE)->non_pod_class)
2595
2596/* Nonzero means that this class type is a non-standard-layout class. */
2597#define CLASSTYPE_NON_STD_LAYOUT(NODE) \
2598 (LANG_TYPE_CLASS_CHECK (NODE)->non_std_layout)
2599
2600/* Nonzero means that this class type does have unique object
2601 representations. */
2602#define CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS(NODE) \
2603 (LANG_TYPE_CLASS_CHECK (NODE)->unique_obj_representations)
2604
2605/* Nonzero means that this class type has
2606 CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS computed. */
2607#define CLASSTYPE_UNIQUE_OBJ_REPRESENTATIONS_SET(NODE) \
2608 (LANG_TYPE_CLASS_CHECK (NODE)->unique_obj_representations_set)
2609
2610/* Nonzero means that this class contains pod types whose default
2611 initialization is not a zero initialization (namely, pointers to
2612 data members). */
2613#define CLASSTYPE_NON_ZERO_INIT_P(NODE) \
2614 (LANG_TYPE_CLASS_CHECK (NODE)->non_zero_init)
2615
2616/* Nonzero if this class is "empty" in the sense of the C++ ABI. */
2617#define CLASSTYPE_EMPTY_P(NODE) \
2618 (LANG_TYPE_CLASS_CHECK (NODE)->empty_p)
2619
2620/* Nonzero if this class is "nearly empty", i.e., contains only a
2621 virtual function table pointer. */
2622#define CLASSTYPE_NEARLY_EMPTY_P(NODE) \
2623 (LANG_TYPE_CLASS_CHECK (NODE)->nearly_empty_p)
2624
2625/* Nonzero if this class contains an empty subobject. */
2626#define CLASSTYPE_CONTAINS_EMPTY_CLASS_P(NODE) \
2627 (LANG_TYPE_CLASS_CHECK (NODE)->contains_empty_class_p)
2628
2629/* A list of class types of which this type is a friend. The
2630 TREE_VALUE is normally a TYPE, but will be a TEMPLATE_DECL in the
2631 case of a template friend. */
2632#define CLASSTYPE_FRIEND_CLASSES(NODE) \
2633 (LANG_TYPE_CLASS_CHECK (NODE)->friend_classes)
2634
2635/* A list of the classes which grant friendship to this class. */
2636#define CLASSTYPE_BEFRIENDING_CLASSES(NODE) \
2637 (LANG_TYPE_CLASS_CHECK (NODE)->befriending_classes)
2638
2639/* The associated LAMBDA_EXPR that made this class. */
2640#define CLASSTYPE_LAMBDA_EXPR(NODE) \
2641 (LANG_TYPE_CLASS_CHECK (NODE)->lambda_expr)
2642/* The extra mangling scope for this closure type. */
2643#define LAMBDA_TYPE_EXTRA_SCOPE(NODE) \
2644 (LAMBDA_EXPR_EXTRA_SCOPE (CLASSTYPE_LAMBDA_EXPR (NODE)))
2645
2646/* Say whether this node was declared as a "class" or a "struct". */
2647#define CLASSTYPE_DECLARED_CLASS(NODE) \
2648 (LANG_TYPE_CLASS_CHECK (NODE)->declared_class)
2649
2650/* Nonzero if this class has const members
2651 which have no specified initialization. */
2652#define CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE) \
2653 (TYPE_LANG_SPECIFIC (NODE) \
2654 ? LANG_TYPE_CLASS_CHECK (NODE)->const_needs_init : 0)
2655#define SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE, VALUE) \
2656 (LANG_TYPE_CLASS_CHECK (NODE)->const_needs_init = (VALUE))
2657
2658/* Nonzero if this class has ref members
2659 which have no specified initialization. */
2660#define CLASSTYPE_REF_FIELDS_NEED_INIT(NODE) \
2661 (TYPE_LANG_SPECIFIC (NODE) \
2662 ? LANG_TYPE_CLASS_CHECK (NODE)->ref_needs_init : 0)
2663#define SET_CLASSTYPE_REF_FIELDS_NEED_INIT(NODE, VALUE) \
2664 (LANG_TYPE_CLASS_CHECK (NODE)->ref_needs_init = (VALUE))
2665
2666/* Nonzero if this class is included from a header file which employs
2667 `#pragma interface', and it is not included in its implementation file. */
2668#define CLASSTYPE_INTERFACE_ONLY(NODE) \
2669 (LANG_TYPE_CLASS_CHECK (NODE)->interface_only)
2670
2671/* True if we have already determined whether or not vtables, VTTs,
2672 typeinfo, and other similar per-class data should be emitted in
2673 this translation unit. This flag does not indicate whether or not
2674 these items should be emitted; it only indicates that we know one
2675 way or the other. */
2676#define CLASSTYPE_INTERFACE_KNOWN(NODE) \
2677 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown == 0)
2678/* The opposite of CLASSTYPE_INTERFACE_KNOWN. */
2679#define CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
2680 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown)
2681
2682#define SET_CLASSTYPE_INTERFACE_UNKNOWN_X(NODE,X) \
2683 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = !!(X))
2684#define SET_CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
2685 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 1)
2686#define SET_CLASSTYPE_INTERFACE_KNOWN(NODE) \
2687 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 0)
2688
2689/* Nonzero if a _DECL node requires us to output debug info for this class. */
2690#define CLASSTYPE_DEBUG_REQUESTED(NODE) \
2691 (LANG_TYPE_CLASS_CHECK (NODE)->debug_requested)
2692
2693/* True if we saw errors while instantiating this class. */
2694#define CLASSTYPE_ERRONEOUS(NODE) \
2695 (LANG_TYPE_CLASS_CHECK (NODE)->erroneous)
2696
2697/* True if this class is non-layout-POD only because it was not an aggregate
2698 before C++14. If we run out of bits in lang_type, this could be replaced
2699 with a hash_set only filled in when abi_version_crosses (17). */
2700#define CLASSTYPE_NON_POD_AGGREGATE(NODE) \
2701 (LANG_TYPE_CLASS_CHECK (NODE)->non_pod_aggregate)
2702
2703/* Additional macros for inheritance information. */
2704
2705/* Nonzero means that this class is on a path leading to a new vtable. */
2706#define BINFO_VTABLE_PATH_MARKED(NODE) BINFO_FLAG_1 (NODE)
2707
2708/* Nonzero means B (a BINFO) has its own vtable. Any copies will not
2709 have this flag set. */
2710#define BINFO_NEW_VTABLE_MARKED(B) (BINFO_FLAG_2 (B))
2711
2712/* Compare a BINFO_TYPE with another type for equality. For a binfo,
2713 this is functionally equivalent to using same_type_p, but
2714 measurably faster. At least one of the arguments must be a
2715 BINFO_TYPE. The other can be a BINFO_TYPE or a regular type. If
2716 BINFO_TYPE(T) ever stops being the main variant of the class the
2717 binfo is for, this macro must change. */
2718#define SAME_BINFO_TYPE_P(A, B) ((A) == (B))
2719
2720/* Any subobject that needs a new vtable must have a vptr and must not
2721 be a non-virtual primary base (since it would then use the vtable from a
2722 derived class and never become non-primary.) */
2723#define SET_BINFO_NEW_VTABLE_MARKED(B) \
2724 (BINFO_NEW_VTABLE_MARKED (B) = 1, \
2725 gcc_assert (!BINFO_PRIMARY_P (B) || BINFO_VIRTUAL_P (B)), \
2726 gcc_assert (TYPE_VFIELD (BINFO_TYPE (B))))
2727
2728/* Nonzero if this binfo is for a dependent base - one that should not
2729 be searched. */
2730#define BINFO_DEPENDENT_BASE_P(NODE) BINFO_FLAG_3 (NODE)
2731
2732/* Nonzero if this binfo has lost its primary base binfo (because that
2733 is a nearly-empty virtual base that has been taken by some other
2734 base in the complete hierarchy. */
2735#define BINFO_LOST_PRIMARY_P(NODE) BINFO_FLAG_4 (NODE)
2736
2737/* Nonzero if this BINFO is a primary base class. */
2738#define BINFO_PRIMARY_P(NODE) BINFO_FLAG_5(NODE)
2739
2740/* A vec<tree_pair_s> of the vcall indices associated with the class
2741 NODE. The PURPOSE of each element is a FUNCTION_DECL for a virtual
2742 function. The VALUE is the index into the virtual table where the
2743 vcall offset for that function is stored, when NODE is a virtual
2744 base. */
2745#define CLASSTYPE_VCALL_INDICES(NODE) \
2746 (LANG_TYPE_CLASS_CHECK (NODE)->vcall_indices)
2747
2748/* The various vtables for the class NODE. The primary vtable will be
2749 first, followed by the construction vtables and VTT, if any. */
2750#define CLASSTYPE_VTABLES(NODE) \
2751 (LANG_TYPE_CLASS_CHECK (NODE)->vtables)
2752
2753/* The std::type_info variable representing this class, or NULL if no
2754 such variable has been created. This field is only set for the
2755 TYPE_MAIN_VARIANT of the class. */
2756#define CLASSTYPE_TYPEINFO_VAR(NODE) \
2757 (LANG_TYPE_CLASS_CHECK (NODE)->typeinfo_var)
2758
2759/* Accessor macros for the BINFO_VIRTUALS list. */
2760
2761/* The number of bytes by which to adjust the `this' pointer when
2762 calling this virtual function. Subtract this value from the this
2763 pointer. Always non-NULL, might be constant zero though. */
2764#define BV_DELTA(NODE) (TREE_PURPOSE (NODE))
2765
2766/* If non-NULL, the vtable index at which to find the vcall offset
2767 when calling this virtual function. Add the value at that vtable
2768 index to the this pointer. */
2769#define BV_VCALL_INDEX(NODE) (TREE_TYPE (NODE))
2770
2771/* The function to call. */
2772#define BV_FN(NODE) (TREE_VALUE (NODE))
2773
2774/* Whether or not this entry is for a lost primary virtual base. */
2775#define BV_LOST_PRIMARY(NODE) (TREE_LANG_FLAG_0 (NODE))
2776
2777/* For FUNCTION_TYPE or METHOD_TYPE, a list of the exceptions that
2778 this type can raise. Each TREE_VALUE is a _TYPE. The TREE_VALUE
2779 will be NULL_TREE to indicate a throw specification of `()', or
2780 no exceptions allowed. For a noexcept specification, TREE_VALUE
2781 is NULL_TREE and TREE_PURPOSE is the constant-expression. For
2782 a deferred noexcept-specification, TREE_PURPOSE is a DEFERRED_NOEXCEPT
2783 (for templates) or an OVERLOAD list of functions (for implicitly
2784 declared functions). */
2785#define TYPE_RAISES_EXCEPTIONS(NODE) \
2786 TYPE_LANG_SLOT_1 (FUNC_OR_METHOD_CHECK (NODE))
2787
2788/* For FUNCTION_TYPE or METHOD_TYPE, return 1 iff it is declared `throw()'
2789 or noexcept(true). */
2790#define TYPE_NOTHROW_P(NODE) nothrow_spec_p (TYPE_RAISES_EXCEPTIONS (NODE))
2791
2792/* For FUNCTION_TYPE or METHOD_TYPE, true if NODE is noexcept. This is the
2793 case for things declared noexcept(true) and, with -fnothrow-opt, for
2794 throw() functions. */
2795#define TYPE_NOEXCEPT_P(NODE) type_noexcept_p (NODE)
2796
2797/* The binding level associated with the namespace. */
2798#define NAMESPACE_LEVEL(NODE) \
2799 (LANG_DECL_NS_CHECK (NODE)->level)
2800
2801/* Discriminator values for lang_decl. */
2802
2803enum lang_decl_selector
2804{
2805 lds_min,
2806 lds_fn,
2807 lds_ns,
2808 lds_parm,
2809 lds_decomp
2810};
2811
2812/* Flags shared by all forms of DECL_LANG_SPECIFIC.
2813
2814 Some of the flags live here only to make lang_decl_min/fn smaller. Do
2815 not make this struct larger than 32 bits. */
2816
2817struct GTY(()) lang_decl_base {
2818 ENUM_BITFIELD(lang_decl_selector) selector : 3;
2819 ENUM_BITFIELD(languages) language : 1;
2820 unsigned use_template : 2;
2821 unsigned not_really_extern : 1; /* var or fn */
2822 unsigned initialized_in_class : 1; /* var or fn */
2823
2824 unsigned threadprivate_or_deleted_p : 1; /* var or fn */
2825 /* anticipated_p is no longer used for anticipated_decls (fn, type
2826 or template). It is used as DECL_OMP_PRIVATIZED_MEMBER in
2827 var. */
2828 unsigned anticipated_p : 1;
2829 unsigned friend_or_tls : 1; /* var, fn, type or template */
2830 unsigned unknown_bound_p : 1; /* var */
2831 unsigned odr_used : 1; /* var or fn */
2832 unsigned concept_p : 1; /* applies to vars and functions */
2833 unsigned var_declared_inline_p : 1; /* var */
2834 unsigned dependent_init_p : 1; /* var */
2835
2836 /* The following apply to VAR, FUNCTION, TYPE, CONCEPT, & NAMESPACE
2837 decls. */
2838 unsigned module_purview_p : 1; // in named-module purview
2839 unsigned module_attach_p : 1; // attached to named module
2840 unsigned module_import_p : 1; /* from an import */
2841 unsigned module_entity_p : 1; /* is in the entitity ary &
2842 hash. */
2843 /* VAR_DECL or FUNCTION_DECL has keyed decls. */
2844 unsigned module_keyed_decls_p : 1;
2845
2846 /* 12 spare bits. */
2847};
2848
2849/* True for DECL codes which have template info and access. */
2850#define LANG_DECL_HAS_MIN(NODE) \
2851 (VAR_OR_FUNCTION_DECL_P (NODE) \
2852 || TREE_CODE (NODE) == FIELD_DECL \
2853 || TREE_CODE (NODE) == CONST_DECL \
2854 || TREE_CODE (NODE) == TYPE_DECL \
2855 || TREE_CODE (NODE) == TEMPLATE_DECL \
2856 || TREE_CODE (NODE) == USING_DECL \
2857 || TREE_CODE (NODE) == CONCEPT_DECL)
2858
2859/* DECL_LANG_SPECIFIC for the above codes. */
2860
2861struct GTY(()) lang_decl_min {
2862 struct lang_decl_base base; /* 32-bits. */
2863
2864 /* In a FUNCTION_DECL for which DECL_THUNK_P holds, this is
2865 THUNK_ALIAS.
2866 In a FUNCTION_DECL for which DECL_THUNK_P does not hold,
2867 VAR_DECL, TYPE_DECL, or TEMPLATE_DECL, this is
2868 DECL_TEMPLATE_INFO. */
2869 tree template_info;
2870
2871 /* In a DECL_THUNK_P FUNCTION_DECL, this is THUNK_VIRTUAL_OFFSET.
2872 In a lambda-capture proxy VAR_DECL, this is DECL_CAPTURED_VARIABLE.
2873 In a function-scope TREE_STATIC VAR_DECL or IMPLICIT_TYPEDEF_P TYPE_DECL,
2874 this is DECL_DISCRIMINATOR.
2875 In a DECL_LOCAL_DECL_P decl, this is the namespace decl it aliases.
2876 Otherwise, in a class-scope DECL, this is DECL_ACCESS. */
2877 tree access;
2878};
2879
2880/* Additional DECL_LANG_SPECIFIC information for functions. */
2881
2882struct GTY(()) lang_decl_fn {
2883 struct lang_decl_min min;
2884
2885 /* In a overloaded operator, this is the compressed operator code. */
2886 unsigned ovl_op_code : 6;
2887 unsigned global_ctor_p : 1;
2888 unsigned global_dtor_p : 1;
2889
2890 unsigned static_function : 1;
2891 unsigned pure_virtual : 1;
2892 unsigned defaulted_p : 1;
2893 unsigned has_in_charge_parm_p : 1;
2894 unsigned has_vtt_parm_p : 1;
2895 unsigned pending_inline_p : 1;
2896 unsigned nonconverting : 1;
2897 unsigned thunk_p : 1;
2898
2899 unsigned this_thunk_p : 1;
2900 unsigned omp_declare_reduction_p : 1;
2901 unsigned has_dependent_explicit_spec_p : 1;
2902 unsigned immediate_fn_p : 1;
2903 unsigned maybe_deleted : 1;
2904 unsigned coroutine_p : 1;
2905 unsigned implicit_constexpr : 1;
2906
2907 unsigned spare : 9;
2908
2909 /* 32-bits padding on 64-bit host. */
2910
2911 /* For a non-thunk function decl, this is a tree list of
2912 friendly classes. For a thunk function decl, it is the
2913 thunked to function decl. */
2914 tree befriending_classes;
2915
2916 /* For a virtual FUNCTION_DECL for which
2917 DECL_THIS_THUNK_P does not hold, this is DECL_THUNKS. Both
2918 this pointer and result pointer adjusting thunks are
2919 chained here. This pointer thunks to return pointer thunks
2920 will be chained on the return pointer thunk.
2921 For a DECL_CONSTUCTOR_P FUNCTION_DECL, this is the base from
2922 whence we inherit. Otherwise, it is the class in which a
2923 (namespace-scope) friend is defined (if any). */
2924 tree context;
2925
2926 union lang_decl_u5
2927 {
2928 /* In a non-thunk FUNCTION_DECL, this is DECL_CLONED_FUNCTION. */
2929 tree GTY ((tag ("0"))) cloned_function;
2930
2931 /* In a FUNCTION_DECL for which THUNK_P holds this is the
2932 THUNK_FIXED_OFFSET. */
2933 HOST_WIDE_INT GTY ((tag ("1"))) fixed_offset;
2934 } GTY ((desc ("%1.thunk_p"))) u5;
2935
2936 union lang_decl_u3
2937 {
2938 struct cp_token_cache * GTY ((tag ("1"))) pending_inline_info;
2939 tree GTY ((tag ("0"))) saved_auto_return_type;
2940 } GTY ((desc ("%1.pending_inline_p"))) u;
2941
2942};
2943
2944/* DECL_LANG_SPECIFIC for namespaces. */
2945
2946struct GTY(()) lang_decl_ns {
2947 struct lang_decl_base base; /* 32 bits. */
2948 cp_binding_level *level;
2949
2950 /* Inline children. Needs to be va_gc, because of PCH. */
2951 vec<tree, va_gc> *inlinees;
2952
2953 /* Hash table of bound decls. It'd be nice to have this inline, but
2954 as the hash_map has a dtor, we can't then put this struct into a
2955 union (until moving to c++11). */
2956 hash_table<named_decl_hash> *bindings;
2957};
2958
2959/* DECL_LANG_SPECIFIC for parameters. */
2960
2961struct GTY(()) lang_decl_parm {
2962 struct lang_decl_base base; /* 32 bits. */
2963 int level;
2964 int index;
2965};
2966
2967/* Additional DECL_LANG_SPECIFIC information for structured bindings. */
2968
2969struct GTY(()) lang_decl_decomp {
2970 struct lang_decl_min min;
2971 /* The artificial underlying "e" variable of the structured binding
2972 variable. */
2973 tree base;
2974};
2975
2976/* DECL_LANG_SPECIFIC for all types. It would be nice to just make this a
2977 union rather than a struct containing a union as its only field, but
2978 tree.h declares it as a struct. */
2979
2980struct GTY(()) lang_decl {
2981 union GTY((desc ("%h.base.selector"))) lang_decl_u {
2982 /* Nothing of only the base type exists. */
2983 struct lang_decl_base GTY ((default)) base;
2984 struct lang_decl_min GTY((tag ("lds_min"))) min;
2985 struct lang_decl_fn GTY ((tag ("lds_fn"))) fn;
2986 struct lang_decl_ns GTY((tag ("lds_ns"))) ns;
2987 struct lang_decl_parm GTY((tag ("lds_parm"))) parm;
2988 struct lang_decl_decomp GTY((tag ("lds_decomp"))) decomp;
2989 } u;
2990};
2991
2992/* Looks through a template (if present) to find what it declares. */
2993#define STRIP_TEMPLATE(NODE) \
2994 (TREE_CODE (NODE) == TEMPLATE_DECL ? DECL_TEMPLATE_RESULT (NODE) : NODE)
2995
2996#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2997
2998#define LANG_DECL_MIN_CHECK(NODE) __extension__ \
2999({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
3000 if (!LANG_DECL_HAS_MIN (NODE)) \
3001 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
3002 &lt->u.min; })
3003
3004/* We want to be able to check DECL_CONSTRUCTOR_P and such on a function
3005 template, not just on a FUNCTION_DECL. So when looking for things in
3006 lang_decl_fn, look down through a TEMPLATE_DECL into its result. */
3007#define LANG_DECL_FN_CHECK(NODE) __extension__ \
3008({ struct lang_decl *lt = DECL_LANG_SPECIFIC (STRIP_TEMPLATE (NODE)); \
3009 if (!DECL_DECLARES_FUNCTION_P (NODE) \
3010 || lt->u.base.selector != lds_fn) \
3011 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
3012 &lt->u.fn; })
3013
3014#define LANG_DECL_NS_CHECK(NODE) __extension__ \
3015({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
3016 if (TREE_CODE (NODE) != NAMESPACE_DECL \
3017 || lt->u.base.selector != lds_ns) \
3018 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
3019 &lt->u.ns; })
3020
3021#define LANG_DECL_PARM_CHECK(NODE) __extension__ \
3022({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
3023 if (TREE_CODE (NODE) != PARM_DECL \
3024 || lt->u.base.selector != lds_parm) \
3025 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
3026 &lt->u.parm; })
3027
3028#define LANG_DECL_DECOMP_CHECK(NODE) __extension__ \
3029({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
3030 if (!VAR_P (NODE) \
3031 || lt->u.base.selector != lds_decomp) \
3032 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
3033 &lt->u.decomp; })
3034
3035#else
3036
3037#define LANG_DECL_MIN_CHECK(NODE) \
3038 (&DECL_LANG_SPECIFIC (NODE)->u.min)
3039
3040#define LANG_DECL_FN_CHECK(NODE) \
3041 (&DECL_LANG_SPECIFIC (STRIP_TEMPLATE (NODE))->u.fn)
3042
3043#define LANG_DECL_NS_CHECK(NODE) \
3044 (&DECL_LANG_SPECIFIC (NODE)->u.ns)
3045
3046#define LANG_DECL_PARM_CHECK(NODE) \
3047 (&DECL_LANG_SPECIFIC (NODE)->u.parm)
3048
3049#define LANG_DECL_DECOMP_CHECK(NODE) \
3050 (&DECL_LANG_SPECIFIC (NODE)->u.decomp)
3051
3052#endif /* ENABLE_TREE_CHECKING */
3053
3054/* For a FUNCTION_DECL or a VAR_DECL, the language linkage for the
3055 declaration. Some entities (like a member function in a local
3056 class, or a local variable) do not have linkage at all, and this
3057 macro should not be used in those cases.
3058
3059 Implementation note: A FUNCTION_DECL without DECL_LANG_SPECIFIC was
3060 created by language-independent code, and has C linkage. Most
3061 VAR_DECLs have C++ linkage, and do not have DECL_LANG_SPECIFIC, but
3062 we do create DECL_LANG_SPECIFIC for variables with non-C++ linkage. */
3063#define DECL_LANGUAGE(NODE) \
3064 (DECL_LANG_SPECIFIC (NODE) \
3065 ? DECL_LANG_SPECIFIC (NODE)->u.base.language \
3066 : (TREE_CODE (NODE) == FUNCTION_DECL \
3067 ? lang_c : lang_cplusplus))
3068
3069/* Set the language linkage for NODE to LANGUAGE. */
3070#define SET_DECL_LANGUAGE(NODE, LANGUAGE) \
3071 (DECL_LANG_SPECIFIC (NODE)->u.base.language = (LANGUAGE))
3072
3073/* For FUNCTION_DECLs and TEMPLATE_DECLs: nonzero means that this function
3074 is a constructor. */
3075#define DECL_CONSTRUCTOR_P(NODE) \
3076 DECL_CXX_CONSTRUCTOR_P (STRIP_TEMPLATE (NODE))
3077
3078/* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a complete
3079 object. */
3080#define DECL_COMPLETE_CONSTRUCTOR_P(NODE) \
3081 (DECL_NAME (NODE) == complete_ctor_identifier)
3082
3083/* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a base
3084 object. */
3085#define DECL_BASE_CONSTRUCTOR_P(NODE) \
3086 (DECL_NAME (NODE) == base_ctor_identifier)
3087
3088/* Nonzero if NODE (a FUNCTION_DECL) is a constructor, but not either the
3089 specialized in-charge constructor or the specialized not-in-charge
3090 constructor. */
3091#define DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P(NODE) \
3092 (DECL_NAME (NODE) == ctor_identifier)
3093
3094/* Nonzero if NODE (a FUNCTION_DECL) is a copy constructor. */
3095#define DECL_COPY_CONSTRUCTOR_P(NODE) \
3096 (DECL_CONSTRUCTOR_P (NODE) && copy_fn_p (NODE) > 0)
3097
3098/* Nonzero if NODE (a FUNCTION_DECL) is a move constructor. */
3099#define DECL_MOVE_CONSTRUCTOR_P(NODE) \
3100 (DECL_CONSTRUCTOR_P (NODE) && move_fn_p (NODE))
3101
3102/* Nonzero if NODE (a FUNCTION_DECL or TEMPLATE_DECL)
3103 is a destructor. */
3104#define DECL_DESTRUCTOR_P(NODE) \
3105 DECL_CXX_DESTRUCTOR_P (STRIP_TEMPLATE (NODE))
3106
3107/* Nonzero if NODE (a FUNCTION_DECL) is a destructor, but not the
3108 specialized in-charge constructor, in-charge deleting constructor,
3109 or the base destructor. */
3110#define DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P(NODE) \
3111 (DECL_NAME (NODE) == dtor_identifier)
3112
3113/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
3114 object. */
3115#define DECL_COMPLETE_DESTRUCTOR_P(NODE) \
3116 (DECL_NAME (NODE) == complete_dtor_identifier)
3117
3118/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a base
3119 object. */
3120#define DECL_BASE_DESTRUCTOR_P(NODE) \
3121 (DECL_NAME (NODE) == base_dtor_identifier)
3122
3123/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
3124 object that deletes the object after it has been destroyed. */
3125#define DECL_DELETING_DESTRUCTOR_P(NODE) \
3126 (DECL_NAME (NODE) == deleting_dtor_identifier)
3127
3128/* Nonzero if either DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P or
3129 DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P is true of NODE. */
3130#define DECL_MAYBE_IN_CHARGE_CDTOR_P(NODE) \
3131 (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (NODE) \
3132 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (NODE))
3133
3134/* Nonzero if NODE (a _DECL) is a cloned constructor or
3135 destructor. */
3136#define DECL_CLONED_FUNCTION_P(NODE) \
3137 (DECL_NAME (NODE) \
3138 && IDENTIFIER_CDTOR_P (DECL_NAME (NODE)) \
3139 && !DECL_MAYBE_IN_CHARGE_CDTOR_P (NODE))
3140
3141/* If DECL_CLONED_FUNCTION_P holds, this is the function that was
3142 cloned. */
3143#define DECL_CLONED_FUNCTION(NODE) \
3144 (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE))->u.fn.u5.cloned_function)
3145
3146/* Perform an action for each clone of FN, if FN is a function with
3147 clones. This macro should be used like:
3148
3149 FOR_EACH_CLONE (clone, fn)
3150 { ... }
3151
3152 */
3153#define FOR_EACH_CLONE(CLONE, FN) \
3154 if (!(TREE_CODE (FN) == FUNCTION_DECL \
3155 && DECL_MAYBE_IN_CHARGE_CDTOR_P (FN))) \
3156 ; \
3157 else \
3158 for (CLONE = DECL_CHAIN (FN); \
3159 CLONE && DECL_CLONED_FUNCTION_P (CLONE); \
3160 CLONE = DECL_CHAIN (CLONE))
3161
3162/* Nonzero if NODE has DECL_DISCRIMINATOR and not DECL_ACCESS. */
3163#define DECL_DISCRIMINATOR_P(NODE) \
3164 (((TREE_CODE (NODE) == VAR_DECL && TREE_STATIC (NODE)) \
3165 || DECL_IMPLICIT_TYPEDEF_P (NODE)) \
3166 && DECL_FUNCTION_SCOPE_P (NODE))
3167
3168/* Discriminator for name mangling. */
3169#define DECL_DISCRIMINATOR(NODE) (LANG_DECL_MIN_CHECK (NODE)->access)
3170
3171/* The index of a user-declared parameter in its function, starting at 1.
3172 All artificial parameters will have index 0. */
3173#define DECL_PARM_INDEX(NODE) \
3174 (LANG_DECL_PARM_CHECK (NODE)->index)
3175
3176/* The level of a user-declared parameter in its function, starting at 1.
3177 A parameter of the function will have level 1; a parameter of the first
3178 nested function declarator (i.e. t in void f (void (*p)(T t))) will have
3179 level 2. */
3180#define DECL_PARM_LEVEL(NODE) \
3181 (LANG_DECL_PARM_CHECK (NODE)->level)
3182
3183/* Nonzero if the VTT parm has been added to NODE. */
3184#define DECL_HAS_VTT_PARM_P(NODE) \
3185 (LANG_DECL_FN_CHECK (NODE)->has_vtt_parm_p)
3186
3187/* Nonzero if NODE is a user-defined conversion operator. */
3188#define DECL_CONV_FN_P(NODE) IDENTIFIER_CONV_OP_P (DECL_NAME (NODE))
3189
3190/* The type to which conversion operator FN converts to. */
3191#define DECL_CONV_FN_TYPE(FN) \
3192 TREE_TYPE ((gcc_checking_assert (DECL_CONV_FN_P (FN)), DECL_NAME (FN)))
3193
3194/* Nonzero if NODE, a static data member, was declared in its class as an
3195 array of unknown bound. */
3196#define VAR_HAD_UNKNOWN_BOUND(NODE) \
3197 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \
3198 ? DECL_LANG_SPECIFIC (NODE)->u.base.unknown_bound_p \
3199 : false)
3200#define SET_VAR_HAD_UNKNOWN_BOUND(NODE) \
3201 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE))->u.base.unknown_bound_p = true)
3202
3203/* True iff decl NODE is for an overloaded operator. */
3204#define DECL_OVERLOADED_OPERATOR_P(NODE) \
3205 IDENTIFIER_ANY_OP_P (DECL_NAME (NODE))
3206
3207/* Nonzero if NODE is an assignment operator (including += and such). */
3208#define DECL_ASSIGNMENT_OPERATOR_P(NODE) \
3209 IDENTIFIER_ASSIGN_OP_P (DECL_NAME (NODE))
3210
3211/* NODE is a function_decl for an overloaded operator. Return its
3212 compressed (raw) operator code. Note that this is not a TREE_CODE. */
3213#define DECL_OVERLOADED_OPERATOR_CODE_RAW(NODE) \
3214 (LANG_DECL_FN_CHECK (NODE)->ovl_op_code)
3215
3216/* DECL is an overloaded operator. Test whether it is for TREE_CODE
3217 (a literal constant). */
3218#define DECL_OVERLOADED_OPERATOR_IS(DECL, CODE) \
3219 (DECL_OVERLOADED_OPERATOR_CODE_RAW (DECL) == OVL_OP_##CODE)
3220
3221/* For FUNCTION_DECLs: nonzero means that this function is a
3222 constructor or a destructor with an extra in-charge parameter to
3223 control whether or not virtual bases are constructed. */
3224#define DECL_HAS_IN_CHARGE_PARM_P(NODE) \
3225 (LANG_DECL_FN_CHECK (NODE)->has_in_charge_parm_p)
3226
3227/* Nonzero if DECL is a declaration of __builtin_constant_p. */
3228#define DECL_IS_BUILTIN_CONSTANT_P(NODE) \
3229 (TREE_CODE (NODE) == FUNCTION_DECL \
3230 && DECL_BUILT_IN_CLASS (NODE) == BUILT_IN_NORMAL \
3231 && DECL_FUNCTION_CODE (NODE) == BUILT_IN_CONSTANT_P)
3232
3233/* Nonzero for _DECL means that this decl appears in (or will appear
3234 in) as a member in a RECORD_TYPE or UNION_TYPE node. It is also for
3235 detecting circularity in case members are multiply defined. In the
3236 case of a VAR_DECL, it means that no definition has been seen, even
3237 if an initializer has been. */
3238#define DECL_IN_AGGR_P(NODE) (DECL_LANG_FLAG_3 (NODE))
3239
3240/* Nonzero for a VAR_DECL means that the variable's initialization (if
3241 any) has been processed. (In general, DECL_INITIALIZED_P is
3242 !DECL_EXTERNAL, but static data members may be initialized even if
3243 not defined.) */
3244#define DECL_INITIALIZED_P(NODE) \
3245 (TREE_LANG_FLAG_1 (VAR_DECL_CHECK (NODE)))
3246
3247/* Nonzero for a VAR_DECL iff an explicit initializer was provided
3248 or a non-trivial constructor is called. */
3249#define DECL_NONTRIVIALLY_INITIALIZED_P(NODE) \
3250 (TREE_LANG_FLAG_6 (VAR_DECL_CHECK (NODE)))
3251
3252/* Nonzero for a VAR_DECL that was initialized with a
3253 constant-expression. */
3254#define DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P(NODE) \
3255 (TREE_LANG_FLAG_2 (VAR_DECL_CHECK (NODE)))
3256
3257/* Nonzero if the DECL was initialized in the class definition itself,
3258 rather than outside the class. This is used for both static member
3259 VAR_DECLS, and FUNCTION_DECLS that are defined in the class. */
3260#define DECL_INITIALIZED_IN_CLASS_P(DECL) \
3261 (DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL)) \
3262 ->u.base.initialized_in_class)
3263
3264/* Nonzero if the DECL is used in the sense of 3.2 [basic.def.odr].
3265 Only available for decls with DECL_LANG_SPECIFIC. */
3266#define DECL_ODR_USED(DECL) \
3267 (DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL)) \
3268 ->u.base.odr_used)
3269
3270/* Nonzero for FUNCTION_DECL means that this is a friend that is
3271 either not pushed into a namespace/looked up in a class (because it
3272 is a dependent type, in an uninstantiated template), or it has
3273 /only/ been subject to hidden friend injection from one or more
3274 befriending classes. Once another decl matches, the flag is
3275 cleared. There are requirements on its default parms. */
3276#define DECL_UNIQUE_FRIEND_P(NODE) \
3277 (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE)) \
3278 ->u.base.friend_or_tls)
3279
3280/* True of a TEMPLATE_DECL that is a template class friend. Such
3281 decls are not pushed until instantiated (as they may depend on
3282 parameters of the befriending class). DECL_CHAIN is the
3283 befriending class. */
3284#define DECL_UNINSTANTIATED_TEMPLATE_FRIEND_P(NODE) \
3285 (DECL_LANG_FLAG_4 (TEMPLATE_DECL_CHECK (NODE)))
3286
3287/* Nonzero if the thread-local variable was declared with __thread as
3288 opposed to thread_local. */
3289#define DECL_GNU_TLS_P(NODE) \
3290 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \
3291 && DECL_LANG_SPECIFIC (NODE)->u.base.friend_or_tls)
3292#define SET_DECL_GNU_TLS_P(NODE) \
3293 (retrofit_lang_decl (VAR_DECL_CHECK (NODE)), \
3294 DECL_LANG_SPECIFIC (NODE)->u.base.friend_or_tls = true)
3295
3296/* A TREE_LIST of the types which have befriended this FUNCTION_DECL. */
3297#define DECL_BEFRIENDING_CLASSES(NODE) \
3298 (LANG_DECL_FN_CHECK (NODE)->befriending_classes)
3299
3300/* Nonzero for FUNCTION_DECL means that this decl is a static
3301 member function. */
3302#define DECL_STATIC_FUNCTION_P(NODE) \
3303 (LANG_DECL_FN_CHECK (NODE)->static_function)
3304
3305/* Nonzero for FUNCTION_DECL means that this decl is a non-static
3306 member function. */
3307#define DECL_NONSTATIC_MEMBER_FUNCTION_P(NODE) \
3308 (TREE_CODE (TREE_TYPE (NODE)) == METHOD_TYPE)
3309
3310/* Nonzero for FUNCTION_DECL means that this decl is a member function
3311 (static or non-static). */
3312#define DECL_FUNCTION_MEMBER_P(NODE) \
3313 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) || DECL_STATIC_FUNCTION_P (NODE))
3314
3315/* Nonzero for FUNCTION_DECL means that this member function
3316 has `this' as const X *const. */
3317#define DECL_CONST_MEMFUNC_P(NODE) \
3318 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
3319 && CP_TYPE_CONST_P (TREE_TYPE (TREE_VALUE \
3320 (TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
3321
3322/* Nonzero for FUNCTION_DECL means that this member function
3323 has `this' as volatile X *const. */
3324#define DECL_VOLATILE_MEMFUNC_P(NODE) \
3325 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
3326 && CP_TYPE_VOLATILE_P (TREE_TYPE (TREE_VALUE \
3327 (TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
3328
3329/* Nonzero for a DECL means that this member is a non-static member. */
3330#define DECL_NONSTATIC_MEMBER_P(NODE) \
3331 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
3332 || TREE_CODE (NODE) == FIELD_DECL)
3333
3334/* Nonzero for a FIELD_DECL means that this member object type
3335 is mutable. */
3336#define DECL_MUTABLE_P(NODE) (DECL_LANG_FLAG_0 (FIELD_DECL_CHECK (NODE)))
3337
3338/* Nonzero for _DECL means that this constructor or conversion function is
3339 non-converting. */
3340#define DECL_NONCONVERTING_P(NODE) \
3341 (LANG_DECL_FN_CHECK (NODE)->nonconverting)
3342
3343/* Nonzero for FUNCTION_DECL means that this member function is a pure
3344 virtual function. */
3345#define DECL_PURE_VIRTUAL_P(NODE) \
3346 (LANG_DECL_FN_CHECK (NODE)->pure_virtual)
3347
3348/* Nonzero for FUNCTION_DECL means that this member function (either
3349 a constructor or a conversion function) has an explicit specifier
3350 with a value-dependent expression. */
3351#define DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P(NODE) \
3352 (LANG_DECL_FN_CHECK (NODE)->has_dependent_explicit_spec_p)
3353
3354/* Nonzero for a defaulted FUNCTION_DECL for which we haven't decided yet if
3355 it's deleted; we will decide in synthesize_method. */
3356#define DECL_MAYBE_DELETED(NODE) \
3357 (LANG_DECL_FN_CHECK (NODE)->maybe_deleted)
3358
3359/* True (in a FUNCTION_DECL) if NODE is a virtual function that is an
3360 invalid overrider for a function from a base class. Once we have
3361 complained about an invalid overrider we avoid complaining about it
3362 again. */
3363#define DECL_INVALID_OVERRIDER_P(NODE) \
3364 (DECL_LANG_FLAG_4 (NODE))
3365
3366/* True (in a FUNCTION_DECL) if NODE is a function declared with
3367 an override virt-specifier */
3368#define DECL_OVERRIDE_P(NODE) (TREE_LANG_FLAG_0 (NODE))
3369
3370/* The thunks associated with NODE, a FUNCTION_DECL. */
3371#define DECL_THUNKS(NODE) \
3372 (DECL_VIRTUAL_P (NODE) ? LANG_DECL_FN_CHECK (NODE)->context : NULL_TREE)
3373
3374/* Set DECL_THUNKS. */
3375#define SET_DECL_THUNKS(NODE,THUNKS) \
3376 (LANG_DECL_FN_CHECK (NODE)->context = (THUNKS))
3377
3378/* If NODE, a FUNCTION_DECL, is a C++11 inheriting constructor, then this
3379 is the constructor it inherits from. */
3380#define DECL_INHERITED_CTOR(NODE) \
3381 (DECL_DECLARES_FUNCTION_P (NODE) && DECL_CONSTRUCTOR_P (NODE) \
3382 ? LANG_DECL_FN_CHECK (NODE)->context : NULL_TREE)
3383
3384/* And this is the base that constructor comes from. */
3385#define DECL_INHERITED_CTOR_BASE(NODE) \
3386 (DECL_INHERITED_CTOR (NODE) \
3387 ? DECL_CONTEXT (flag_new_inheriting_ctors \
3388 ? strip_inheriting_ctors (NODE) \
3389 : DECL_INHERITED_CTOR (NODE)) \
3390 : NULL_TREE)
3391
3392/* Set the inherited base. */
3393#define SET_DECL_INHERITED_CTOR(NODE,INH) \
3394 (LANG_DECL_FN_CHECK (NODE)->context = (INH))
3395
3396/* Nonzero if NODE is a thunk, rather than an ordinary function. */
3397#define DECL_THUNK_P(NODE) \
3398 (TREE_CODE (NODE) == FUNCTION_DECL \
3399 && DECL_LANG_SPECIFIC (NODE) \
3400 && LANG_DECL_FN_CHECK (NODE)->thunk_p)
3401
3402/* Set DECL_THUNK_P for node. */
3403#define SET_DECL_THUNK_P(NODE, THIS_ADJUSTING) \
3404 (LANG_DECL_FN_CHECK (NODE)->thunk_p = 1, \
3405 LANG_DECL_FN_CHECK (NODE)->this_thunk_p = (THIS_ADJUSTING))
3406
3407/* Nonzero if NODE is a this pointer adjusting thunk. */
3408#define DECL_THIS_THUNK_P(NODE) \
3409 (DECL_THUNK_P (NODE) && LANG_DECL_FN_CHECK (NODE)->this_thunk_p)
3410
3411/* Nonzero if NODE is a result pointer adjusting thunk. */
3412#define DECL_RESULT_THUNK_P(NODE) \
3413 (DECL_THUNK_P (NODE) && !LANG_DECL_FN_CHECK (NODE)->this_thunk_p)
3414
3415/* Nonzero if NODE is a FUNCTION_DECL, but not a thunk. */
3416#define DECL_NON_THUNK_FUNCTION_P(NODE) \
3417 (TREE_CODE (NODE) == FUNCTION_DECL && !DECL_THUNK_P (NODE))
3418
3419/* Nonzero if NODE is `extern "C"'. */
3420#define DECL_EXTERN_C_P(NODE) \
3421 (DECL_LANGUAGE (NODE) == lang_c)
3422
3423/* Nonzero if NODE is an `extern "C"' function. */
3424#define DECL_EXTERN_C_FUNCTION_P(NODE) \
3425 (DECL_NON_THUNK_FUNCTION_P (NODE) && DECL_EXTERN_C_P (NODE))
3426
3427/* Non-zero if this variable is declared `constinit' specifier. */
3428#define DECL_DECLARED_CONSTINIT_P(NODE) \
3429 (DECL_LANG_FLAG_7 (VAR_DECL_CHECK (NODE)))
3430
3431/* True if DECL is declared 'constexpr'. */
3432#define DECL_DECLARED_CONSTEXPR_P(DECL) \
3433 DECL_LANG_FLAG_8 (VAR_OR_FUNCTION_DECL_CHECK (STRIP_TEMPLATE (DECL)))
3434
3435/* True if FNDECL is an immediate function. */
3436#define DECL_IMMEDIATE_FUNCTION_P(NODE) \
3437 (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (STRIP_TEMPLATE (NODE))) \
3438 ? LANG_DECL_FN_CHECK (NODE)->immediate_fn_p \
3439 : false)
3440#define SET_DECL_IMMEDIATE_FUNCTION_P(NODE) \
3441 (retrofit_lang_decl (FUNCTION_DECL_CHECK (NODE)), \
3442 LANG_DECL_FN_CHECK (NODE)->immediate_fn_p = true)
3443
3444// True if NODE was declared as 'concept'. The flag implies that the
3445// declaration is constexpr, that the declaration cannot be specialized or
3446// refined, and that the result type must be convertible to bool.
3447#define DECL_DECLARED_CONCEPT_P(NODE) \
3448 (DECL_LANG_SPECIFIC (NODE)->u.base.concept_p)
3449
3450/* Nonzero if this DECL is the __PRETTY_FUNCTION__ variable in a
3451 template function. */
3452#define DECL_PRETTY_FUNCTION_P(NODE) \
3453 (DECL_NAME (NODE) \
3454 && id_equal (DECL_NAME (NODE), "__PRETTY_FUNCTION__"))
3455
3456/* For a DECL, true if it is __func__ or similar. */
3457#define DECL_FNAME_P(NODE) \
3458 (VAR_P (NODE) && DECL_NAME (NODE) && DECL_ARTIFICIAL (NODE) \
3459 && DECL_HAS_VALUE_EXPR_P (NODE) \
3460 && (id_equal (DECL_NAME (NODE), "__PRETTY_FUNCTION__") \
3461 || id_equal (DECL_NAME (NODE), "__FUNCTION__") \
3462 || id_equal (DECL_NAME (NODE), "__func__")))
3463
3464/* Nonzero if the variable was declared to be thread-local.
3465 We need a special C++ version of this test because the middle-end
3466 DECL_THREAD_LOCAL_P uses the symtab, so we can't use it for
3467 templates. */
3468#define CP_DECL_THREAD_LOCAL_P(NODE) \
3469 (TREE_LANG_FLAG_0 (VAR_DECL_CHECK (NODE)))
3470
3471/* The _TYPE context in which this _DECL appears. This field holds the
3472 class where a virtual function instance is actually defined. */
3473#define DECL_CLASS_CONTEXT(NODE) \
3474 (DECL_CLASS_SCOPE_P (NODE) ? DECL_CONTEXT (NODE) : NULL_TREE)
3475
3476/* For a non-member friend function, the class (if any) in which this
3477 friend was defined. For example, given:
3478
3479 struct S { friend void f () { ... } };
3480
3481 the DECL_FRIEND_CONTEXT for `f' will be `S'. */
3482#define DECL_FRIEND_CONTEXT(NODE) \
3483 ((DECL_DECLARES_FUNCTION_P (NODE) && !DECL_VIRTUAL_P (NODE) \
3484 && !DECL_CONSTRUCTOR_P (NODE)) \
3485 ? LANG_DECL_FN_CHECK (NODE)->context \
3486 : NULL_TREE)
3487
3488/* Set the DECL_FRIEND_CONTEXT for NODE to CONTEXT. */
3489#define SET_DECL_FRIEND_CONTEXT(NODE, CONTEXT) \
3490 (LANG_DECL_FN_CHECK (NODE)->context = (CONTEXT))
3491
3492#define CP_DECL_CONTEXT(NODE) \
3493 (!DECL_FILE_SCOPE_P (NODE) ? DECL_CONTEXT (NODE) : global_namespace)
3494#define CP_TYPE_CONTEXT(NODE) \
3495 (!TYPE_FILE_SCOPE_P (NODE) ? TYPE_CONTEXT (NODE) : global_namespace)
3496#define FROB_CONTEXT(NODE) \
3497 ((NODE) == global_namespace ? DECL_CONTEXT (NODE) : (NODE))
3498
3499/* 1 iff NODE has namespace scope, including the global namespace. */
3500#define DECL_NAMESPACE_SCOPE_P(NODE) \
3501 (!DECL_TEMPLATE_PARM_P (NODE) \
3502 && TREE_CODE (CP_DECL_CONTEXT (NODE)) == NAMESPACE_DECL)
3503
3504#define TYPE_NAMESPACE_SCOPE_P(NODE) \
3505 (TREE_CODE (CP_TYPE_CONTEXT (NODE)) == NAMESPACE_DECL)
3506
3507#define NAMESPACE_SCOPE_P(NODE) \
3508 ((DECL_P (NODE) && DECL_NAMESPACE_SCOPE_P (NODE)) \
3509 || (TYPE_P (NODE) && TYPE_NAMESPACE_SCOPE_P (NODE)))
3510
3511/* 1 iff NODE is a class member. */
3512#define DECL_CLASS_SCOPE_P(NODE) \
3513 (DECL_CONTEXT (NODE) && TYPE_P (DECL_CONTEXT (NODE)))
3514
3515#define TYPE_CLASS_SCOPE_P(NODE) \
3516 (TYPE_CONTEXT (NODE) && TYPE_P (TYPE_CONTEXT (NODE)))
3517
3518/* 1 iff NODE is function-local. */
3519#define DECL_FUNCTION_SCOPE_P(NODE) \
3520 (DECL_CONTEXT (NODE) \
3521 && TREE_CODE (DECL_CONTEXT (NODE)) == FUNCTION_DECL)
3522
3523#define TYPE_FUNCTION_SCOPE_P(NODE) \
3524 (TYPE_CONTEXT (NODE) && TREE_CODE (TYPE_CONTEXT (NODE)) == FUNCTION_DECL)
3525
3526/* 1 iff VAR_DECL node NODE is a type-info decl. This flag is set for
3527 both the primary typeinfo object and the associated NTBS name. */
3528#define DECL_TINFO_P(NODE) \
3529 TREE_LANG_FLAG_4 (TREE_CHECK2 (NODE,VAR_DECL,TYPE_DECL))
3530
3531/* 1 iff VAR_DECL node NODE is virtual table or VTT. We forward to
3532 DECL_VIRTUAL_P from the common code, as that has the semantics we
3533 need. But we want a more descriptive name. */
3534#define DECL_VTABLE_OR_VTT_P(NODE) DECL_VIRTUAL_P (VAR_DECL_CHECK (NODE))
3535
3536/* 1 iff FUNCTION_TYPE or METHOD_TYPE has a ref-qualifier (either & or &&). */
3537#define FUNCTION_REF_QUALIFIED(NODE) \
3538 TREE_LANG_FLAG_4 (FUNC_OR_METHOD_CHECK (NODE))
3539
3540/* 1 iff FUNCTION_TYPE or METHOD_TYPE has &&-ref-qualifier. */
3541#define FUNCTION_RVALUE_QUALIFIED(NODE) \
3542 TREE_LANG_FLAG_5 (FUNC_OR_METHOD_CHECK (NODE))
3543
3544/* 1 iff NODE is function-local, but for types. */
3545#define LOCAL_CLASS_P(NODE) \
3546 (decl_function_context (TYPE_MAIN_DECL (NODE)) != NULL_TREE)
3547
3548/* The nesting depth of namespace, class or function. Makes is_ancestor much
3549 simpler. Only 8 bits available. */
3550#define SCOPE_DEPTH(NODE) \
3551 (NAMESPACE_DECL_CHECK (NODE)->base.u.bits.address_space)
3552
3553/* Whether the namepace is an inline namespace. */
3554#define DECL_NAMESPACE_INLINE_P(NODE) \
3555 TREE_LANG_FLAG_0 (NAMESPACE_DECL_CHECK (NODE))
3556
3557/* In a NAMESPACE_DECL, a vector of inline namespaces. */
3558#define DECL_NAMESPACE_INLINEES(NODE) \
3559 (LANG_DECL_NS_CHECK (NODE)->inlinees)
3560
3561/* Pointer to hash_map from IDENTIFIERS to DECLS */
3562#define DECL_NAMESPACE_BINDINGS(NODE) \
3563 (LANG_DECL_NS_CHECK (NODE)->bindings)
3564
3565/* In a NAMESPACE_DECL, points to the original namespace if this is
3566 a namespace alias. */
3567#define DECL_NAMESPACE_ALIAS(NODE) \
3568 DECL_ABSTRACT_ORIGIN (NAMESPACE_DECL_CHECK (NODE))
3569#define ORIGINAL_NAMESPACE(NODE) \
3570 (DECL_NAMESPACE_ALIAS (NODE) ? DECL_NAMESPACE_ALIAS (NODE) : (NODE))
3571
3572/* Nonzero if NODE is the std namespace. */
3573#define DECL_NAMESPACE_STD_P(NODE) \
3574 ((NODE) == std_node)
3575
3576/* In a TREE_LIST in an attribute list, indicates that the attribute
3577 must be applied at instantiation time. */
3578#define ATTR_IS_DEPENDENT(NODE) TREE_LANG_FLAG_0 (TREE_LIST_CHECK (NODE))
3579
3580/* In a TREE_LIST in the argument of attribute abi_tag, indicates that the tag
3581 was inherited from a template parameter, not explicitly indicated. */
3582#define ABI_TAG_IMPLICIT(NODE) TREE_LANG_FLAG_0 (TREE_LIST_CHECK (NODE))
3583
3584/* In a TREE_LIST for a parameter-declaration-list, indicates that all the
3585 parameters in the list have declarators enclosed in (). */
3586#define PARENTHESIZED_LIST_P(NODE) TREE_LANG_FLAG_0 (TREE_LIST_CHECK (NODE))
3587
3588/* Non zero if this is a using decl for a dependent scope. */
3589#define DECL_DEPENDENT_P(NODE) DECL_LANG_FLAG_0 (USING_DECL_CHECK (NODE))
3590
3591/* The scope named in a using decl. */
3592#define USING_DECL_SCOPE(NODE) DECL_RESULT_FLD (USING_DECL_CHECK (NODE))
3593
3594/* The decls named by a using decl. */
3595#define USING_DECL_DECLS(NODE) DECL_INITIAL (USING_DECL_CHECK (NODE))
3596
3597/* Non zero if the using decl refers to a dependent type. */
3598#define USING_DECL_TYPENAME_P(NODE) DECL_LANG_FLAG_1 (USING_DECL_CHECK (NODE))
3599
3600/* True if member using decl NODE refers to a non-inherited NODE. */
3601#define USING_DECL_UNRELATED_P(NODE) DECL_LANG_FLAG_2 (USING_DECL_CHECK (NODE))
3602
3603/* True iff the CONST_DECL is a class-scope clone from C++20 using enum,
3604 created by handle_using_decl. */
3605#define CONST_DECL_USING_P(NODE) \
3606 (TREE_CODE (NODE) == CONST_DECL \
3607 && TREE_TYPE (NODE) \
3608 && TREE_CODE (TREE_TYPE (NODE)) == ENUMERAL_TYPE \
3609 && DECL_CONTEXT (NODE) != TREE_TYPE (NODE))
3610
3611/* In a FUNCTION_DECL, this is nonzero if this function was defined in
3612 the class definition. We have saved away the text of the function,
3613 but have not yet processed it. */
3614#define DECL_PENDING_INLINE_P(NODE) \
3615 (LANG_DECL_FN_CHECK (NODE)->pending_inline_p)
3616
3617/* If DECL_PENDING_INLINE_P holds, this is the saved text of the
3618 function. */
3619#define DECL_PENDING_INLINE_INFO(NODE) \
3620 (LANG_DECL_FN_CHECK (NODE)->u.pending_inline_info)
3621
3622/* Nonzero for TYPE_DECL means that it was written 'using name = type'. */
3623#define TYPE_DECL_ALIAS_P(NODE) \
3624 DECL_LANG_FLAG_6 (TYPE_DECL_CHECK (NODE))
3625
3626/* Nonzero for TEMPLATE_DECL means that it is a 'complex' alias template. */
3627#define TEMPLATE_DECL_COMPLEX_ALIAS_P(NODE) \
3628 DECL_LANG_FLAG_2 (TEMPLATE_DECL_CHECK (NODE))
3629
3630/* Nonzero for a type which is an alias for another type; i.e, a type
3631 which declaration was written 'using name-of-type =
3632 another-type'. */
3633#define TYPE_ALIAS_P(NODE) \
3634 (TYPE_P (NODE) \
3635 && TYPE_NAME (NODE) \
3636 && TREE_CODE (TYPE_NAME (NODE)) == TYPE_DECL \
3637 && TYPE_DECL_ALIAS_P (TYPE_NAME (NODE)))
3638
3639/* If non-NULL for a VAR_DECL, FUNCTION_DECL, TYPE_DECL, TEMPLATE_DECL,
3640 or CONCEPT_DECL, the entity is either a template specialization (if
3641 DECL_USE_TEMPLATE is nonzero) or the abstract instance of the
3642 template itself.
3643
3644 In either case, DECL_TEMPLATE_INFO is a TEMPLATE_INFO, whose
3645 TI_TEMPLATE is the TEMPLATE_DECL of which this entity is a
3646 specialization or abstract instance. The TI_ARGS is the
3647 template arguments used to specialize the template.
3648
3649 Consider:
3650
3651 template <typename T> struct S { friend void f(T) {} };
3652
3653 In this case, S<int>::f is, from the point of view of the compiler,
3654 an instantiation of a template -- but, from the point of view of
3655 the language, each instantiation of S results in a wholly unrelated
3656 global function f. In this case, DECL_TEMPLATE_INFO for S<int>::f
3657 will be non-NULL, but DECL_USE_TEMPLATE will be zero.
3658
3659 In a friend declaration, TI_TEMPLATE can be an overload set, or
3660 identifier. */
3661#define DECL_TEMPLATE_INFO(NODE) \
3662 (DECL_LANG_SPECIFIC (TEMPLATE_INFO_DECL_CHECK (NODE)) \
3663 ->u.min.template_info)
3664
3665/* For a lambda capture proxy, its captured variable. */
3666#define DECL_CAPTURED_VARIABLE(NODE) \
3667 (LANG_DECL_MIN_CHECK (NODE)->access)
3668
3669/* For a VAR_DECL, indicates that the variable is actually a
3670 non-static data member of anonymous union that has been promoted to
3671 variable status. */
3672#define DECL_ANON_UNION_VAR_P(NODE) \
3673 (DECL_LANG_FLAG_4 (VAR_DECL_CHECK (NODE)))
3674
3675/* Template information for a RECORD_TYPE or UNION_TYPE. */
3676#define CLASSTYPE_TEMPLATE_INFO(NODE) \
3677 (TYPE_LANG_SLOT_1 (RECORD_OR_UNION_CHECK (NODE)))
3678
3679/* Template information for a template template parameter. */
3680#define TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO(NODE) \
3681 (TYPE_LANG_SLOT_1 (BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK (NODE)))
3682
3683/* Template information for an ENUMERAL_, RECORD_, UNION_TYPE, or
3684 BOUND_TEMPLATE_TEMPLATE_PARM type. This ignores any alias
3685 templateness of NODE. It'd be nice if this could unconditionally
3686 access the slot, rather than return NULL if given a
3687 non-templatable type. */
3688#define TYPE_TEMPLATE_INFO(NODE) \
3689 (TREE_CODE (NODE) == ENUMERAL_TYPE \
3690 || TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
3691 || RECORD_OR_UNION_TYPE_P (NODE) \
3692 ? TYPE_LANG_SLOT_1 (NODE) : NULL_TREE)
3693
3694/* Template information (if any) for an alias type. */
3695#define TYPE_ALIAS_TEMPLATE_INFO(NODE) \
3696 (DECL_LANG_SPECIFIC (TYPE_NAME (NODE)) \
3697 ? DECL_TEMPLATE_INFO (TYPE_NAME (NODE)) \
3698 : NULL_TREE)
3699
3700/* If NODE is a type alias, this accessor returns the template info
3701 for the alias template (if any). Otherwise behave as
3702 TYPE_TEMPLATE_INFO. */
3703#define TYPE_TEMPLATE_INFO_MAYBE_ALIAS(NODE) \
3704 (typedef_variant_p (NODE) \
3705 ? TYPE_ALIAS_TEMPLATE_INFO (NODE) \
3706 : TYPE_TEMPLATE_INFO (NODE))
3707
3708/* Set the template information for a non-alias n ENUMERAL_, RECORD_,
3709 or UNION_TYPE to VAL. ALIAS's are dealt with separately. */
3710#define SET_TYPE_TEMPLATE_INFO(NODE, VAL) \
3711 (TREE_CODE (NODE) == ENUMERAL_TYPE \
3712 || (CLASS_TYPE_P (NODE) && !TYPE_ALIAS_P (NODE)) \
3713 ? (TYPE_LANG_SLOT_1 (NODE) = (VAL)) \
3714 : (DECL_TEMPLATE_INFO (TYPE_NAME (NODE)) = (VAL))) \
3715
3716#define TI_TEMPLATE(NODE) \
3717 ((struct tree_template_info*)TEMPLATE_INFO_CHECK (NODE))->tmpl
3718#define TI_ARGS(NODE) \
3719 ((struct tree_template_info*)TEMPLATE_INFO_CHECK (NODE))->args
3720#define TI_PENDING_TEMPLATE_FLAG(NODE) \
3721 TREE_LANG_FLAG_1 (TEMPLATE_INFO_CHECK (NODE))
3722/* For a given TREE_VEC containing a template argument list,
3723 this property contains the number of arguments that are not
3724 defaulted. */
3725#define NON_DEFAULT_TEMPLATE_ARGS_COUNT(NODE) \
3726 TREE_CHAIN (TREE_VEC_CHECK (NODE))
3727
3728/* Below are the setter and getter of the NON_DEFAULT_TEMPLATE_ARGS_COUNT
3729 property. */
3730#define SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT(NODE, INT_VALUE) \
3731 NON_DEFAULT_TEMPLATE_ARGS_COUNT(NODE) = build_int_cst (NULL_TREE, INT_VALUE)
3732#if CHECKING_P
3733#define GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT(NODE) \
3734 int_cst_value (NON_DEFAULT_TEMPLATE_ARGS_COUNT (NODE))
3735#else
3736#define GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT(NODE) \
3737 NON_DEFAULT_TEMPLATE_ARGS_COUNT (NODE) \
3738 ? int_cst_value (NON_DEFAULT_TEMPLATE_ARGS_COUNT (NODE)) \
3739 : TREE_VEC_LENGTH (INNERMOST_TEMPLATE_ARGS (NODE))
3740#endif
3741
3742/* The list of access checks that were deferred during parsing
3743 which need to be performed at template instantiation time.
3744
3745 FIXME this should be associated with the TEMPLATE_DECL, not the
3746 TEMPLATE_INFO. */
3747#define TI_DEFERRED_ACCESS_CHECKS(NODE) \
3748 ((struct tree_template_info*)TEMPLATE_INFO_CHECK \
3749 (NODE))->deferred_access_checks
3750
3751/* We use TREE_VECs to hold template arguments. If there is only one
3752 level of template arguments, then the TREE_VEC contains the
3753 arguments directly. If there is more than one level of template
3754 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
3755 containing the template arguments for a single level. The first
3756 entry in the outer TREE_VEC is the outermost level of template
3757 parameters; the last is the innermost.
3758
3759 It is incorrect to ever form a template argument vector containing
3760 only one level of arguments, but which is a TREE_VEC containing as
3761 its only entry the TREE_VEC for that level.
3762
3763 For each TREE_VEC containing the template arguments for a single
3764 level, it's possible to get or set the number of non defaulted
3765 template arguments by using the accessor macros
3766 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT or
3767 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT. */
3768
3769/* Nonzero if the template arguments is actually a vector of vectors,
3770 rather than just a vector. */
3771#define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
3772 (NODE && TREE_VEC_LENGTH (NODE) && TREE_VEC_ELT (NODE, 0) \
3773 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
3774
3775/* The depth of a template argument vector. When called directly by
3776 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
3777 template arguments. In that case, there is only one level of template
3778 arguments. We may even see NULL_TREE if there are 0 levels of
3779 template arguments, as in cp_parser_requires_expression. */
3780#define TMPL_ARGS_DEPTH(NODE) \
3781 ((NODE) == NULL_TREE ? 0 \
3782 : TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) \
3783 : 1)
3784
3785/* The LEVELth level of the template ARGS. The outermost level of
3786 args is level 1, not level 0. */
3787#define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
3788 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
3789 ? TREE_VEC_ELT (ARGS, (LEVEL) - 1) \
3790 : (gcc_checking_assert ((LEVEL) == 1), (ARGS)))
3791
3792/* Set the LEVELth level of the template ARGS to VAL. This macro does
3793 not work with single-level argument vectors. */
3794#define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
3795 (TREE_VEC_ELT (ARGS, (LEVEL) - 1) = (VAL))
3796
3797/* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
3798#define TMPL_ARG(ARGS, LEVEL, IDX) \
3799 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
3800
3801/* Given a single level of template arguments in NODE, return the
3802 number of arguments. */
3803#define NUM_TMPL_ARGS(NODE) \
3804 (TREE_VEC_LENGTH (NODE))
3805
3806/* Returns the innermost level of template arguments in ARGS. */
3807#define INNERMOST_TEMPLATE_ARGS(NODE) \
3808 (get_innermost_template_args ((NODE), 1))
3809
3810/* The number of levels of template parameters given by NODE. */
3811#define TMPL_PARMS_DEPTH(NODE) \
3812 ((HOST_WIDE_INT) TREE_INT_CST_LOW (TREE_PURPOSE (NODE)))
3813
3814/* The TEMPLATE_DECL instantiated or specialized by NODE. This
3815 TEMPLATE_DECL will be the immediate parent, not the most general
3816 template. For example, in:
3817
3818 template <class T> struct S { template <class U> void f(U); }
3819
3820 the FUNCTION_DECL for S<int>::f<double> will have, as its
3821 DECL_TI_TEMPLATE, `template <class U> S<int>::f<U>'.
3822
3823 As a special case, for a member friend template of a template
3824 class, this value will not be a TEMPLATE_DECL, but rather an
3825 IDENTIFIER_NODE or OVERLOAD indicating the name of the template and
3826 any explicit template arguments provided. For example, in:
3827
3828 template <class T> struct S { friend void f<int>(int, double); }
3829
3830 the DECL_TI_TEMPLATE will be an IDENTIFIER_NODE for `f' and the
3831 DECL_TI_ARGS will be {int}.
3832
3833 For a FIELD_DECL with a non-static data member initializer, this value
3834 is the FIELD_DECL it was instantiated from. */
3835#define DECL_TI_TEMPLATE(NODE) TI_TEMPLATE (DECL_TEMPLATE_INFO (NODE))
3836
3837/* The template arguments used to obtain this decl from the most
3838 general form of DECL_TI_TEMPLATE. For the example given for
3839 DECL_TI_TEMPLATE, the DECL_TI_ARGS will be {int, double}. These
3840 are always the full set of arguments required to instantiate this
3841 declaration from the most general template specialized here. */
3842#define DECL_TI_ARGS(NODE) TI_ARGS (DECL_TEMPLATE_INFO (NODE))
3843
3844/* The TEMPLATE_DECL associated with NODE, a class type. Even if NODE
3845 will be generated from a partial specialization, the TEMPLATE_DECL
3846 referred to here will be the original template. For example,
3847 given:
3848
3849 template <typename T> struct S {};
3850 template <typename T> struct S<T*> {};
3851
3852 the CLASSTYPE_TI_TEMPLATE for S<int*> will be S, not the S<T*>.
3853
3854 For a member class template, CLASSTYPE_TI_TEMPLATE always refers to the
3855 partial instantiation rather than the primary template. CLASSTYPE_TI_ARGS
3856 are for the primary template if the partial instantiation isn't
3857 specialized, or for the explicit specialization if it is, e.g.
3858
3859 template <class T> class C { template <class U> class D; }
3860 template <> template <class U> class C<int>::D; */
3861#define CLASSTYPE_TI_TEMPLATE(NODE) TI_TEMPLATE (CLASSTYPE_TEMPLATE_INFO (NODE))
3862#define CLASSTYPE_TI_ARGS(NODE) TI_ARGS (CLASSTYPE_TEMPLATE_INFO (NODE))
3863
3864/* For a template instantiation TYPE, returns the TYPE corresponding
3865 to the primary template. Otherwise returns TYPE itself. */
3866#define CLASSTYPE_PRIMARY_TEMPLATE_TYPE(TYPE) \
3867 ((CLASSTYPE_USE_TEMPLATE ((TYPE)) \
3868 && !CLASSTYPE_TEMPLATE_SPECIALIZATION ((TYPE))) \
3869 ? TREE_TYPE (DECL_TEMPLATE_RESULT (DECL_PRIMARY_TEMPLATE \
3870 (CLASSTYPE_TI_TEMPLATE ((TYPE))))) \
3871 : (TYPE))
3872
3873/* Like CLASS_TI_TEMPLATE, but also works for ENUMERAL_TYPEs. */
3874#define TYPE_TI_TEMPLATE(NODE) \
3875 (TI_TEMPLATE (TYPE_TEMPLATE_INFO (NODE)))
3876
3877/* Like DECL_TI_ARGS, but for an ENUMERAL_, RECORD_, or UNION_TYPE. */
3878#define TYPE_TI_ARGS(NODE) \
3879 (TI_ARGS (TYPE_TEMPLATE_INFO (NODE)))
3880
3881#define INNERMOST_TEMPLATE_PARMS(NODE) TREE_VALUE (NODE)
3882
3883/* Nonzero if NODE (a TEMPLATE_DECL) is a member template, in the
3884 sense of [temp.mem]. */
3885#define DECL_MEMBER_TEMPLATE_P(NODE) \
3886 (DECL_LANG_FLAG_1 (TEMPLATE_DECL_CHECK (NODE)))
3887
3888/* Nonzero if the NODE corresponds to the template parameters for a
3889 member template, whose inline definition is being processed after
3890 the class definition is complete. */
3891#define TEMPLATE_PARMS_FOR_INLINE(NODE) TREE_LANG_FLAG_1 (NODE)
3892
3893/* Determine if a declaration (PARM_DECL or FIELD_DECL) is a pack. */
3894#define DECL_PACK_P(NODE) \
3895 (DECL_P (NODE) && PACK_EXPANSION_P (TREE_TYPE (NODE)))
3896
3897/* Determines if NODE is an expansion of one or more parameter packs,
3898 e.g., a TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION. */
3899#define PACK_EXPANSION_P(NODE) \
3900 (TREE_CODE (NODE) == TYPE_PACK_EXPANSION \
3901 || TREE_CODE (NODE) == EXPR_PACK_EXPANSION)
3902
3903#define PACK_EXPANSION_CHECK(NODE) \
3904 TREE_CHECK2 (NODE, TYPE_PACK_EXPANSION, EXPR_PACK_EXPANSION)
3905
3906/* Extracts the type or expression pattern from a TYPE_PACK_EXPANSION or
3907 EXPR_PACK_EXPANSION. */
3908#define PACK_EXPANSION_PATTERN(NODE) \
3909 (TREE_CODE (PACK_EXPANSION_CHECK (NODE)) == TYPE_PACK_EXPANSION \
3910 ? TREE_TYPE (NODE) : TREE_OPERAND (NODE, 0))
3911
3912/* The list of parameter packs used in the PACK_EXPANSION_* node. The
3913 TREE_VALUE of each TREE_LIST contains the parameter packs. */
3914#define PACK_EXPANSION_PARAMETER_PACKS(NODE) \
3915 *(TREE_CODE (PACK_EXPANSION_CHECK (NODE)) == EXPR_PACK_EXPANSION \
3916 ? &TREE_OPERAND (NODE, 1) \
3917 : &TYPE_MIN_VALUE_RAW (TYPE_PACK_EXPANSION_CHECK (NODE)))
3918
3919/* Any additional template args to be applied when substituting into
3920 the pattern, set by tsubst_pack_expansion for partial instantiations.
3921 If this is a TREE_LIST, the TREE_VALUE of the first element is the
3922 usual template argument TREE_VEC, and the TREE_PURPOSE of later elements
3923 are enclosing functions that provided function parameter packs we'll need
3924 to map appropriately. */
3925#define PACK_EXPANSION_EXTRA_ARGS(NODE) \
3926 *(TREE_CODE (PACK_EXPANSION_CHECK (NODE)) == TYPE_PACK_EXPANSION \
3927 ? &TYPE_MAX_VALUE_RAW (NODE) \
3928 : &TREE_OPERAND ((NODE), 2))
3929
3930/* True iff this pack expansion is within a function context. */
3931#define PACK_EXPANSION_LOCAL_P(NODE) \
3932 TREE_LANG_FLAG_0 (PACK_EXPANSION_CHECK (NODE))
3933
3934/* True iff this pack expansion is for sizeof.... */
3935#define PACK_EXPANSION_SIZEOF_P(NODE) \
3936 TREE_LANG_FLAG_1 (PACK_EXPANSION_CHECK (NODE))
3937
3938/* True iff this pack expansion is for auto... in lambda init-capture. */
3939#define PACK_EXPANSION_AUTO_P(NODE) \
3940 TREE_LANG_FLAG_2 (PACK_EXPANSION_CHECK (NODE))
3941
3942/* True if we must use PACK_EXPANSION_EXTRA_ARGS and avoid partial
3943 instantiation of this pack expansion. */
3944#define PACK_EXPANSION_FORCE_EXTRA_ARGS_P(NODE) \
3945 TREE_LANG_FLAG_3 (PACK_EXPANSION_CHECK (NODE))
3946
3947/* True iff the wildcard can match a template parameter pack. */
3948#define WILDCARD_PACK_P(NODE) TREE_LANG_FLAG_0 (NODE)
3949
3950/* Determine if this is an argument pack. */
3951#define ARGUMENT_PACK_P(NODE) \
3952 (TREE_CODE (NODE) == TYPE_ARGUMENT_PACK \
3953 || TREE_CODE (NODE) == NONTYPE_ARGUMENT_PACK)
3954
3955#define ARGUMENT_PACK_CHECK(NODE) \
3956 TREE_CHECK2 (NODE, TYPE_ARGUMENT_PACK, NONTYPE_ARGUMENT_PACK)
3957
3958/* The arguments stored in an argument pack. Arguments are stored in a
3959 TREE_VEC, which may have length zero. */
3960#define ARGUMENT_PACK_ARGS(NODE) \
3961 (TREE_CODE (ARGUMENT_PACK_CHECK (NODE)) == TYPE_ARGUMENT_PACK \
3962 ? TREE_TYPE (NODE) : TREE_OPERAND (NODE, 0))
3963
3964/* Whether the argument pack is "incomplete", meaning that more
3965 arguments can still be deduced. Incomplete argument packs are only
3966 used when the user has provided an explicit template argument list
3967 for a variadic function template. Some of the explicit template
3968 arguments will be placed into the beginning of the argument pack,
3969 but additional arguments might still be deduced. */
3970#define ARGUMENT_PACK_INCOMPLETE_P(NODE) \
3971 TREE_ADDRESSABLE (ARGUMENT_PACK_ARGS (NODE))
3972
3973/* When ARGUMENT_PACK_INCOMPLETE_P, stores the explicit template
3974 arguments used to fill this pack. */
3975#define ARGUMENT_PACK_EXPLICIT_ARGS(NODE) \
3976 TREE_TYPE (ARGUMENT_PACK_ARGS (NODE))
3977
3978/* In an ARGUMENT_PACK_SELECT, the argument pack from which an
3979 argument will be selected. */
3980#define ARGUMENT_PACK_SELECT_FROM_PACK(NODE) \
3981 (((struct tree_argument_pack_select *)ARGUMENT_PACK_SELECT_CHECK (NODE))->argument_pack)
3982
3983/* In an ARGUMENT_PACK_SELECT, the index of the argument we want to
3984 select. */
3985#define ARGUMENT_PACK_SELECT_INDEX(NODE) \
3986 (((struct tree_argument_pack_select *)ARGUMENT_PACK_SELECT_CHECK (NODE))->index)
3987
3988#define FOLD_EXPR_CHECK(NODE) \
3989 TREE_CHECK4 (NODE, UNARY_LEFT_FOLD_EXPR, UNARY_RIGHT_FOLD_EXPR, \
3990 BINARY_LEFT_FOLD_EXPR, BINARY_RIGHT_FOLD_EXPR)
3991
3992#define BINARY_FOLD_EXPR_CHECK(NODE) \
3993 TREE_CHECK2 (NODE, BINARY_LEFT_FOLD_EXPR, BINARY_RIGHT_FOLD_EXPR)
3994
3995/* True if NODE is UNARY_FOLD_EXPR or a BINARY_FOLD_EXPR */
3996#define FOLD_EXPR_P(NODE) \
3997 (TREE_CODE (NODE) == UNARY_LEFT_FOLD_EXPR \
3998 || TREE_CODE (NODE) == UNARY_RIGHT_FOLD_EXPR \
3999 || TREE_CODE (NODE) == BINARY_LEFT_FOLD_EXPR \
4000 || TREE_CODE (NODE) == BINARY_RIGHT_FOLD_EXPR)
4001
4002/* True when NODE is a fold over a compound assignment operator. */
4003#define FOLD_EXPR_MODIFY_P(NODE) \
4004 TREE_LANG_FLAG_0 (FOLD_EXPR_CHECK (NODE))
4005
4006/* An INTEGER_CST containing the tree code of the folded operator. */
4007#define FOLD_EXPR_OP_RAW(NODE) \
4008 TREE_OPERAND (FOLD_EXPR_CHECK (NODE), 0)
4009
4010/* The tree code of the folded operator. */
4011#define FOLD_EXPR_OP(NODE) \
4012 ((enum tree_code) TREE_INT_CST_LOW (FOLD_EXPR_OP_RAW (NODE)))
4013
4014/* The expression containing an unexpanded parameter pack. */
4015#define FOLD_EXPR_PACK(NODE) \
4016 TREE_OPERAND (FOLD_EXPR_CHECK (NODE), 1)
4017
4018/* In a binary fold expression, the argument with no unexpanded
4019 parameter packs. */
4020#define FOLD_EXPR_INIT(NODE) \
4021 TREE_OPERAND (BINARY_FOLD_EXPR_CHECK (NODE), 2)
4022
4023/* In a FUNCTION_DECL, the saved auto-return pattern. */
4024#define DECL_SAVED_AUTO_RETURN_TYPE(NODE) \
4025 (LANG_DECL_FN_CHECK (FUNCTION_DECL_CHECK (NODE)) \
4026 ->u.saved_auto_return_type)
4027
4028/* True if NODE is an implicit INDIRECT_REF from convert_from_reference. */
4029#define REFERENCE_REF_P(NODE) \
4030 (INDIRECT_REF_P (NODE) \
4031 && TREE_TYPE (TREE_OPERAND (NODE, 0)) \
4032 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND ((NODE), 0))))
4033
4034/* True iff this represents an lvalue being treated as an rvalue during return
4035 or throw as per [class.copy.elision]. */
4036#define IMPLICIT_RVALUE_P(NODE) \
4037 TREE_LANG_FLAG_3 (TREE_CHECK2 ((NODE), NON_LVALUE_EXPR, STATIC_CAST_EXPR))
4038
4039#define NEW_EXPR_USE_GLOBAL(NODE) \
4040 TREE_LANG_FLAG_0 (NEW_EXPR_CHECK (NODE))
4041#define DELETE_EXPR_USE_GLOBAL(NODE) \
4042 TREE_LANG_FLAG_0 (DELETE_EXPR_CHECK (NODE))
4043#define DELETE_EXPR_USE_VEC(NODE) \
4044 TREE_LANG_FLAG_1 (DELETE_EXPR_CHECK (NODE))
4045
4046#define CALL_OR_AGGR_INIT_CHECK(NODE) \
4047 TREE_CHECK2 ((NODE), CALL_EXPR, AGGR_INIT_EXPR)
4048
4049/* In a CALL_EXPR appearing in a template, true if Koenig lookup
4050 should be performed at instantiation time. */
4051#define KOENIG_LOOKUP_P(NODE) TREE_LANG_FLAG_0 (CALL_EXPR_CHECK (NODE))
4052
4053/* True if the arguments to NODE should be evaluated in left-to-right
4054 order regardless of PUSH_ARGS_REVERSED. */
4055#define CALL_EXPR_ORDERED_ARGS(NODE) \
4056 TREE_LANG_FLAG_3 (CALL_OR_AGGR_INIT_CHECK (NODE))
4057
4058/* True if the arguments to NODE should be evaluated in right-to-left
4059 order regardless of PUSH_ARGS_REVERSED. */
4060#define CALL_EXPR_REVERSE_ARGS(NODE) \
4061 TREE_LANG_FLAG_5 (CALL_OR_AGGR_INIT_CHECK (NODE))
4062
4063/* True if CALL_EXPR was written as an operator expression, not a function
4064 call. */
4065#define CALL_EXPR_OPERATOR_SYNTAX(NODE) \
4066 TREE_LANG_FLAG_6 (CALL_OR_AGGR_INIT_CHECK (NODE))
4067
4068/* A TREE_LIST containing the result of phase 1 name lookup of the operator
4069 overloads that are pertinent to the dependent operator expression whose
4070 type is NODE. Each TREE_PURPOSE is an IDENTIFIER_NODE and TREE_VALUE is
4071 the corresponding (possibly empty) lookup result. The TREE_TYPE of the
4072 first TREE_LIST node points back to NODE. */
4073#define DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS(NODE) \
4074 TYPE_VALUES_RAW (DEPENDENT_OPERATOR_TYPE_CHECK (NODE))
4075
4076/* Guarded helper for the above accessor macro that takes a (templated)
4077 operator expression instead of the type thereof. */
4078inline tree
4079templated_operator_saved_lookups (tree t)
4080{
4081 tree type = TREE_TYPE (EXPR_CHECK (t));
4082 if (type && TREE_CODE (type) == DEPENDENT_OPERATOR_TYPE)
4083 return DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS (type);
4084 else
4085 return NULL_TREE;
4086}
4087
4088/* Indicates whether a string literal has been parenthesized. Such
4089 usages are disallowed in certain circumstances. */
4090
4091#define PAREN_STRING_LITERAL_P(NODE) \
4092 TREE_LANG_FLAG_0 (STRING_CST_CHECK (NODE))
4093
4094/* Indicates whether a COMPONENT_REF or a SCOPE_REF has been parenthesized, an
4095 INDIRECT_REF comes from parenthesizing a _DECL, or a PAREN_EXPR identifies a
4096 parenthesized initializer relevant for decltype(auto). Currently only set
4097 some of the time in C++14 mode. */
4098
4099#define REF_PARENTHESIZED_P(NODE) \
4100 TREE_LANG_FLAG_2 (TREE_CHECK5 ((NODE), COMPONENT_REF, INDIRECT_REF, SCOPE_REF, VIEW_CONVERT_EXPR, PAREN_EXPR))
4101
4102/* Nonzero if this AGGR_INIT_EXPR provides for initialization via a
4103 constructor call, rather than an ordinary function call. */
4104#define AGGR_INIT_VIA_CTOR_P(NODE) \
4105 TREE_LANG_FLAG_0 (AGGR_INIT_EXPR_CHECK (NODE))
4106
4107/* Nonzero if expanding this AGGR_INIT_EXPR should first zero-initialize
4108 the object. */
4109#define AGGR_INIT_ZERO_FIRST(NODE) \
4110 TREE_LANG_FLAG_2 (AGGR_INIT_EXPR_CHECK (NODE))
4111
4112/* Nonzero means that the call is the jump from a thunk to the
4113 thunked-to function. */
4114#define AGGR_INIT_FROM_THUNK_P(NODE) \
4115 (AGGR_INIT_EXPR_CHECK (NODE)->base.protected_flag)
4116
4117/* AGGR_INIT_EXPR accessors. These are equivalent to the CALL_EXPR
4118 accessors, except for AGGR_INIT_EXPR_SLOT (which takes the place of
4119 CALL_EXPR_STATIC_CHAIN). */
4120
4121#define AGGR_INIT_EXPR_FN(NODE) TREE_OPERAND (AGGR_INIT_EXPR_CHECK (NODE), 1)
4122#define AGGR_INIT_EXPR_SLOT(NODE) \
4123 TREE_OPERAND (AGGR_INIT_EXPR_CHECK (NODE), 2)
4124#define AGGR_INIT_EXPR_ARG(NODE, I) \
4125 TREE_OPERAND (AGGR_INIT_EXPR_CHECK (NODE), (I) + 3)
4126#define aggr_init_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
4127
4128/* AGGR_INIT_EXPR_ARGP returns a pointer to the argument vector for NODE.
4129 We can't use &AGGR_INIT_EXPR_ARG (NODE, 0) because that will complain if
4130 the argument count is zero when checking is enabled. Instead, do
4131 the pointer arithmetic to advance past the 3 fixed operands in a
4132 AGGR_INIT_EXPR. That produces a valid pointer to just past the end of
4133 the operand array, even if it's not valid to dereference it. */
4134#define AGGR_INIT_EXPR_ARGP(NODE) \
4135 (&(TREE_OPERAND (AGGR_INIT_EXPR_CHECK (NODE), 0)) + 3)
4136
4137/* Abstract iterators for AGGR_INIT_EXPRs. */
4138
4139/* Structure containing iterator state. */
4140struct aggr_init_expr_arg_iterator {
4141 tree t; /* the aggr_init_expr */
4142 int n; /* argument count */
4143 int i; /* next argument index */
4144};
4145
4146/* Initialize the abstract argument list iterator object ITER with the
4147 arguments from AGGR_INIT_EXPR node EXP. */
4148inline void
4149init_aggr_init_expr_arg_iterator (tree exp,
4150 aggr_init_expr_arg_iterator *iter)
4151{
4152 iter->t = exp;
4153 iter->n = aggr_init_expr_nargs (exp);
4154 iter->i = 0;
4155}
4156
4157/* Return the next argument from abstract argument list iterator object ITER,
4158 and advance its state. Return NULL_TREE if there are no more arguments. */
4159inline tree
4160next_aggr_init_expr_arg (aggr_init_expr_arg_iterator *iter)
4161{
4162 tree result;
4163 if (iter->i >= iter->n)
4164 return NULL_TREE;
4165 result = AGGR_INIT_EXPR_ARG (iter->t, iter->i);
4166 iter->i++;
4167 return result;
4168}
4169
4170/* Initialize the abstract argument list iterator object ITER, then advance
4171 past and return the first argument. Useful in for expressions, e.g.
4172 for (arg = first_aggr_init_expr_arg (exp, &iter); arg;
4173 arg = next_aggr_init_expr_arg (&iter)) */
4174inline tree
4175first_aggr_init_expr_arg (tree exp, aggr_init_expr_arg_iterator *iter)
4176{
4177 init_aggr_init_expr_arg_iterator (exp, iter);
4178 return next_aggr_init_expr_arg (iter);
4179}
4180
4181/* Test whether there are more arguments in abstract argument list iterator
4182 ITER, without changing its state. */
4183inline bool
4184more_aggr_init_expr_args_p (const aggr_init_expr_arg_iterator *iter)
4185{
4186 return (iter->i < iter->n);
4187}
4188
4189/* Iterate through each argument ARG of AGGR_INIT_EXPR CALL, using variable
4190 ITER (of type aggr_init_expr_arg_iterator) to hold the iteration state. */
4191#define FOR_EACH_AGGR_INIT_EXPR_ARG(arg, iter, call) \
4192 for ((arg) = first_aggr_init_expr_arg ((call), &(iter)); (arg); \
4193 (arg) = next_aggr_init_expr_arg (&(iter)))
4194
4195/* VEC_INIT_EXPR accessors. */
4196#define VEC_INIT_EXPR_SLOT(NODE) TREE_OPERAND (VEC_INIT_EXPR_CHECK (NODE), 0)
4197#define VEC_INIT_EXPR_INIT(NODE) TREE_OPERAND (VEC_INIT_EXPR_CHECK (NODE), 1)
4198
4199/* Indicates that a VEC_INIT_EXPR is a potential constant expression.
4200 Only set when the current function is constexpr. */
4201#define VEC_INIT_EXPR_IS_CONSTEXPR(NODE) \
4202 TREE_LANG_FLAG_0 (VEC_INIT_EXPR_CHECK (NODE))
4203
4204/* Indicates that a VEC_INIT_EXPR is expressing value-initialization. */
4205#define VEC_INIT_EXPR_VALUE_INIT(NODE) \
4206 TREE_LANG_FLAG_1 (VEC_INIT_EXPR_CHECK (NODE))
4207
4208/* If T is a VEC_INIT_EXPR, return it, possibly stripping a TARGET_EXPR
4209 wrapper. Otherwise, return null. */
4210inline tree
4211get_vec_init_expr (tree t)
4212{
4213 if (t && TREE_CODE (t) == TARGET_EXPR)
4214 t = TARGET_EXPR_INITIAL (t);
4215 if (t && TREE_CODE (t) == VEC_INIT_EXPR)
4216 return t;
4217 return NULL_TREE;
4218}
4219
4220/* The condition under which this MUST_NOT_THROW_EXPR actually blocks
4221 exceptions. NULL_TREE means 'true'. */
4222#define MUST_NOT_THROW_COND(NODE) \
4223 TREE_OPERAND (MUST_NOT_THROW_EXPR_CHECK (NODE), 1)
4224
4225/* The TYPE_MAIN_DECL for a class template type is a TYPE_DECL, not a
4226 TEMPLATE_DECL. This macro determines whether or not a given class
4227 type is really a template type, as opposed to an instantiation or
4228 specialization of one. */
4229#define CLASSTYPE_IS_TEMPLATE(NODE) \
4230 (CLASSTYPE_TEMPLATE_INFO (NODE) \
4231 && !CLASSTYPE_USE_TEMPLATE (NODE) \
4232 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE)))
4233
4234/* The name used by the user to name the typename type. Typically,
4235 this is an IDENTIFIER_NODE, and the same as the DECL_NAME on the
4236 corresponding TYPE_DECL. However, this may also be a
4237 TEMPLATE_ID_EXPR if we had something like `typename X::Y<T>'. */
4238#define TYPENAME_TYPE_FULLNAME(NODE) \
4239 (TYPE_VALUES_RAW (TYPENAME_TYPE_CHECK (NODE)))
4240
4241/* True if a TYPENAME_TYPE was declared as an "enum". */
4242#define TYPENAME_IS_ENUM_P(NODE) \
4243 (TREE_LANG_FLAG_0 (TYPENAME_TYPE_CHECK (NODE)))
4244
4245/* True if a TYPENAME_TYPE was declared as a "class", "struct", or
4246 "union". */
4247#define TYPENAME_IS_CLASS_P(NODE) \
4248 (TREE_LANG_FLAG_1 (TYPENAME_TYPE_CHECK (NODE)))
4249
4250/* True if a TYPENAME_TYPE is in the process of being resolved. */
4251#define TYPENAME_IS_RESOLVING_P(NODE) \
4252 (TREE_LANG_FLAG_2 (TYPENAME_TYPE_CHECK (NODE)))
4253
4254/* [class.virtual]
4255
4256 A class that declares or inherits a virtual function is called a
4257 polymorphic class. */
4258#define TYPE_POLYMORPHIC_P(NODE) (TREE_LANG_FLAG_2 (NODE))
4259
4260/* Nonzero if this class has a virtual function table pointer. */
4261#define TYPE_CONTAINS_VPTR_P(NODE) \
4262 (TYPE_POLYMORPHIC_P (NODE) || CLASSTYPE_VBASECLASSES (NODE))
4263
4264/* Nonzero if NODE is a FUNCTION_DECL or VARIABLE_DECL (for a decl
4265 with namespace scope) declared in a local scope. */
4266#define DECL_LOCAL_DECL_P(NODE) \
4267 DECL_LANG_FLAG_0 (VAR_OR_FUNCTION_DECL_CHECK (NODE))
4268
4269/* The namespace-scope decl a DECL_LOCAL_DECL_P aliases. */
4270#define DECL_LOCAL_DECL_ALIAS(NODE) \
4271 DECL_ACCESS ((gcc_checking_assert (DECL_LOCAL_DECL_P (NODE)), NODE))
4272
4273/* True if NODE was declared with auto in its return type, but it has
4274 started compilation and so the return type might have been changed by
4275 return type deduction; its declared return type should be found in
4276 DECL_SAVED_AUTO_RETURN_TYPE (NODE). */
4277#define FNDECL_USED_AUTO(NODE) \
4278 TREE_LANG_FLAG_2 (FUNCTION_DECL_CHECK (NODE))
4279
4280/* True if NODE is needed for a manifestly constant-evaluated expression.
4281 This doesn't especially need to be a flag, since currently it's only
4282 used for error recovery; if we run out of function flags it could move
4283 to an attribute. */
4284#define FNDECL_MANIFESTLY_CONST_EVALUATED(NODE) \
4285 TREE_LANG_FLAG_4 (FUNCTION_DECL_CHECK (NODE))
4286
4287/* True for artificial decls added for OpenMP privatized non-static
4288 data members. */
4289#define DECL_OMP_PRIVATIZED_MEMBER(NODE) \
4290 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE))->u.base.anticipated_p)
4291
4292/* Nonzero if NODE is an artificial FUNCTION_DECL for
4293 #pragma omp declare reduction. */
4294#define DECL_OMP_DECLARE_REDUCTION_P(NODE) \
4295 (LANG_DECL_FN_CHECK (DECL_COMMON_CHECK (NODE))->omp_declare_reduction_p)
4296
4297/* Nonzero if DECL has been declared threadprivate by
4298 #pragma omp threadprivate. */
4299#define CP_DECL_THREADPRIVATE_P(DECL) \
4300 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (DECL))->u.base.threadprivate_or_deleted_p)
4301
4302/* Nonzero if NODE is a VAR_DECL which has been declared inline. */
4303#define DECL_VAR_DECLARED_INLINE_P(NODE) \
4304 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \
4305 ? DECL_LANG_SPECIFIC (NODE)->u.base.var_declared_inline_p \
4306 : false)
4307#define SET_DECL_VAR_DECLARED_INLINE_P(NODE) \
4308 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE))->u.base.var_declared_inline_p \
4309 = true)
4310
4311/* True if NODE is a constant variable with a value-dependent initializer. */
4312#define DECL_DEPENDENT_INIT_P(NODE) \
4313 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE)) \
4314 && DECL_LANG_SPECIFIC (NODE)->u.base.dependent_init_p)
4315#define SET_DECL_DEPENDENT_INIT_P(NODE, X) \
4316 (DECL_LANG_SPECIFIC (VAR_DECL_CHECK (NODE))->u.base.dependent_init_p = (X))
4317
4318/* Nonzero if NODE is an artificial VAR_DECL for a C++17 structured binding
4319 declaration or one of VAR_DECLs for the user identifiers in it. */
4320#define DECL_DECOMPOSITION_P(NODE) \
4321 (VAR_P (NODE) && DECL_LANG_SPECIFIC (NODE) \
4322 ? DECL_LANG_SPECIFIC (NODE)->u.base.selector == lds_decomp \
4323 : false)
4324
4325/* The underlying artificial VAR_DECL for structured binding. */
4326#define DECL_DECOMP_BASE(NODE) \
4327 (LANG_DECL_DECOMP_CHECK (NODE)->base)
4328
4329/* Nonzero if NODE is an inline VAR_DECL. In C++17, static data members
4330 declared with constexpr specifier are implicitly inline variables. */
4331#define DECL_INLINE_VAR_P(NODE) \
4332 (DECL_VAR_DECLARED_INLINE_P (NODE) \
4333 || (cxx_dialect >= cxx17 \
4334 && DECL_DECLARED_CONSTEXPR_P (NODE) \
4335 && DECL_CLASS_SCOPE_P (NODE)))
4336
4337/* Nonzero if DECL was declared with '= delete'. */
4338#define DECL_DELETED_FN(DECL) \
4339 (LANG_DECL_FN_CHECK (DECL)->min.base.threadprivate_or_deleted_p)
4340
4341/* Nonzero if DECL was declared with '= default' (maybe implicitly). */
4342#define DECL_DEFAULTED_FN(DECL) \
4343 (LANG_DECL_FN_CHECK (DECL)->defaulted_p)
4344
4345/* Nonzero if DECL is explicitly defaulted in the class body. */
4346#define DECL_DEFAULTED_IN_CLASS_P(DECL) \
4347 (DECL_DEFAULTED_FN (DECL) && DECL_INITIALIZED_IN_CLASS_P (DECL))
4348/* Nonzero if DECL was defaulted outside the class body. */
4349#define DECL_DEFAULTED_OUTSIDE_CLASS_P(DECL) \
4350 (DECL_DEFAULTED_FN (DECL) \
4351 && !(DECL_ARTIFICIAL (DECL) || DECL_INITIALIZED_IN_CLASS_P (DECL)))
4352
4353/* Record whether a typedef for type `int' was actually `signed int'. */
4354#define C_TYPEDEF_EXPLICITLY_SIGNED(EXP) DECL_LANG_FLAG_1 (EXP)
4355
4356/* Returns nonzero if DECL has external linkage, as specified by the
4357 language standard. (This predicate may hold even when the
4358 corresponding entity is not actually given external linkage in the
4359 object file; see decl_linkage for details.) */
4360#define DECL_EXTERNAL_LINKAGE_P(DECL) \
4361 (decl_linkage (DECL) == lk_external)
4362
4363/* Keep these codes in ascending code order. */
4364
4365#define INTEGRAL_CODE_P(CODE) \
4366 ((CODE) == ENUMERAL_TYPE \
4367 || (CODE) == BOOLEAN_TYPE \
4368 || (CODE) == INTEGER_TYPE)
4369
4370/* [basic.fundamental]
4371
4372 Types bool, char, wchar_t, and the signed and unsigned integer types
4373 are collectively called integral types.
4374
4375 Note that INTEGRAL_TYPE_P, as defined in tree.h, allows enumeration
4376 types as well, which is incorrect in C++. Keep these checks in
4377 ascending code order. */
4378#define CP_INTEGRAL_TYPE_P(TYPE) \
4379 (TREE_CODE (TYPE) == BOOLEAN_TYPE \
4380 || TREE_CODE (TYPE) == INTEGER_TYPE)
4381
4382/* Returns true if TYPE is an integral or enumeration name. Keep
4383 these checks in ascending code order. */
4384#define INTEGRAL_OR_ENUMERATION_TYPE_P(TYPE) \
4385 (TREE_CODE (TYPE) == ENUMERAL_TYPE || CP_INTEGRAL_TYPE_P (TYPE))
4386
4387/* Returns true if TYPE is an integral or unscoped enumeration type. */
4388#define INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P(TYPE) \
4389 (UNSCOPED_ENUM_P (TYPE) || CP_INTEGRAL_TYPE_P (TYPE))
4390
4391/* True if the class type TYPE is a literal type. */
4392#define CLASSTYPE_LITERAL_P(TYPE) \
4393 (LANG_TYPE_CLASS_CHECK (TYPE)->is_literal)
4394
4395/* [basic.fundamental]
4396
4397 Integral and floating types are collectively called arithmetic
4398 types.
4399
4400 As a GNU extension, we also accept complex types.
4401
4402 Keep these checks in ascending code order. */
4403#define ARITHMETIC_TYPE_P(TYPE) \
4404 (CP_INTEGRAL_TYPE_P (TYPE) \
4405 || TREE_CODE (TYPE) == REAL_TYPE \
4406 || TREE_CODE (TYPE) == COMPLEX_TYPE)
4407
4408/* True iff TYPE is cv decltype(nullptr). */
4409#define NULLPTR_TYPE_P(TYPE) (TREE_CODE (TYPE) == NULLPTR_TYPE)
4410
4411/* [basic.types]
4412
4413 Arithmetic types, enumeration types, pointer types,
4414 pointer-to-member types, and std::nullptr_t are collectively called
4415 scalar types.
4416
4417 Keep these checks in ascending code order. */
4418#define SCALAR_TYPE_P(TYPE) \
4419 (TYPE_PTRDATAMEM_P (TYPE) \
4420 || TREE_CODE (TYPE) == ENUMERAL_TYPE \
4421 || ARITHMETIC_TYPE_P (TYPE) \
4422 || TYPE_PTR_P (TYPE) \
4423 || TYPE_PTRMEMFUNC_P (TYPE) \
4424 || NULLPTR_TYPE_P (TYPE))
4425
4426/* Determines whether this type is a C++0x scoped enumeration
4427 type. Scoped enumerations types are introduced via "enum class" or
4428 "enum struct", e.g.,
4429
4430 enum class Color {
4431 Red, Green, Blue
4432 };
4433
4434 Scoped enumeration types are different from normal (unscoped)
4435 enumeration types in several ways:
4436
4437 - The enumerators of a scoped enumeration type are only available
4438 within the scope of the enumeration type and not in the
4439 enclosing scope. For example, the Red color can be referred to
4440 with "Color::Red" but not "Red".
4441
4442 - Scoped enumerators and enumerations do not implicitly convert
4443 to integers or 'bool'.
4444
4445 - The underlying type of the enum is well-defined. */
4446#define SCOPED_ENUM_P(TYPE) \
4447 (TREE_CODE (TYPE) == ENUMERAL_TYPE && ENUM_IS_SCOPED (TYPE))
4448
4449/* Determine whether this is an unscoped enumeration type. */
4450#define UNSCOPED_ENUM_P(TYPE) \
4451 (TREE_CODE (TYPE) == ENUMERAL_TYPE && !ENUM_IS_SCOPED (TYPE))
4452
4453/* Set the flag indicating whether an ENUMERAL_TYPE is a C++0x scoped
4454 enumeration type (1) or a normal (unscoped) enumeration type
4455 (0). */
4456#define SET_SCOPED_ENUM_P(TYPE, VAL) \
4457 (ENUM_IS_SCOPED (TYPE) = (VAL))
4458
4459#define SET_OPAQUE_ENUM_P(TYPE, VAL) \
4460 (ENUM_IS_OPAQUE (TYPE) = (VAL))
4461
4462#define OPAQUE_ENUM_P(TYPE) \
4463 (TREE_CODE (TYPE) == ENUMERAL_TYPE && ENUM_IS_OPAQUE (TYPE))
4464
4465/* Determines whether an ENUMERAL_TYPE has an explicit
4466 underlying type. */
4467#define ENUM_FIXED_UNDERLYING_TYPE_P(NODE) (TYPE_LANG_FLAG_5 (NODE))
4468
4469/* Returns the underlying type of the given enumeration type. The
4470 underlying type is determined in different ways, depending on the
4471 properties of the enum:
4472
4473 - In C++0x, the underlying type can be explicitly specified, e.g.,
4474
4475 enum E1 : char { ... } // underlying type is char
4476
4477 - In a C++0x scoped enumeration, the underlying type is int
4478 unless otherwises specified:
4479
4480 enum class E2 { ... } // underlying type is int
4481
4482 - Otherwise, the underlying type is determined based on the
4483 values of the enumerators. In this case, the
4484 ENUM_UNDERLYING_TYPE will not be set until after the definition
4485 of the enumeration is completed by finish_enum. */
4486#define ENUM_UNDERLYING_TYPE(TYPE) \
4487 TREE_TYPE (ENUMERAL_TYPE_CHECK (TYPE))
4488
4489/* [dcl.init.aggr]
4490
4491 An aggregate is an array or a class with no user-provided
4492 constructors, no brace-or-equal-initializers for non-static data
4493 members, no private or protected non-static data members, no
4494 base classes, and no virtual functions.
4495
4496 As an extension, we also treat vectors as aggregates. Keep these
4497 checks in ascending code order. */
4498#define CP_AGGREGATE_TYPE_P(TYPE) \
4499 (gnu_vector_type_p (TYPE) \
4500 || TREE_CODE (TYPE) == ARRAY_TYPE \
4501 || (CLASS_TYPE_P (TYPE) && COMPLETE_TYPE_P (TYPE) && !CLASSTYPE_NON_AGGREGATE (TYPE)))
4502
4503/* Nonzero for a class type means that the class type has a
4504 user-declared constructor. */
4505#define TYPE_HAS_USER_CONSTRUCTOR(NODE) (TYPE_LANG_FLAG_1 (NODE))
4506
4507/* Nonzero means that the FUNCTION_TYPE or METHOD_TYPE has a
4508 late-specified return type. */
4509#define TYPE_HAS_LATE_RETURN_TYPE(NODE) \
4510 (TYPE_LANG_FLAG_2 (FUNC_OR_METHOD_CHECK (NODE)))
4511
4512/* When appearing in an INDIRECT_REF, it means that the tree structure
4513 underneath is actually a call to a constructor. This is needed
4514 when the constructor must initialize local storage (which can
4515 be automatically destroyed), rather than allowing it to allocate
4516 space from the heap.
4517
4518 When appearing in a SAVE_EXPR, it means that underneath
4519 is a call to a constructor.
4520
4521 When appearing in a CONSTRUCTOR, the expression is an unconverted
4522 compound literal.
4523
4524 When appearing in a FIELD_DECL, it means that this field
4525 has been duly initialized in its constructor. */
4526#define TREE_HAS_CONSTRUCTOR(NODE) (TREE_LANG_FLAG_4 (NODE))
4527
4528/* True if NODE is a brace-enclosed initializer. */
4529#define BRACE_ENCLOSED_INITIALIZER_P(NODE) \
4530 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_TYPE (NODE) == init_list_type_node)
4531
4532/* True if NODE is a compound-literal, i.e., a brace-enclosed
4533 initializer cast to a particular type. This is mostly only set during
4534 template parsing; once the initializer has been digested into an actual
4535 value of the type, the expression is represented by a TARGET_EXPR. */
4536#define COMPOUND_LITERAL_P(NODE) \
4537 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_HAS_CONSTRUCTOR (NODE))
4538
4539#define EMPTY_CONSTRUCTOR_P(NODE) (TREE_CODE (NODE) == CONSTRUCTOR \
4540 && vec_safe_is_empty(CONSTRUCTOR_ELTS(NODE))\
4541 && !TREE_HAS_CONSTRUCTOR (NODE))
4542
4543/* True if NODE is a init-list used as a direct-initializer, i.e.
4544 B b{1,2}, not B b({1,2}) or B b = {1,2}. */
4545#define CONSTRUCTOR_IS_DIRECT_INIT(NODE) (TREE_LANG_FLAG_0 (CONSTRUCTOR_CHECK (NODE)))
4546
4547/* True if this CONSTRUCTOR is instantiation-dependent and needs to be
4548 substituted. */
4549#define CONSTRUCTOR_IS_DEPENDENT(NODE) \
4550 (TREE_LANG_FLAG_1 (CONSTRUCTOR_CHECK (NODE)))
4551
4552/* True if this CONSTRUCTOR should not be used as a variable initializer
4553 because it was loaded from a constexpr variable with mutable fields. */
4554#define CONSTRUCTOR_MUTABLE_POISON(NODE) \
4555 (TREE_LANG_FLAG_2 (CONSTRUCTOR_CHECK (NODE)))
4556
4557/* True if this typed CONSTRUCTOR represents C99 compound-literal syntax rather
4558 than C++11 functional cast syntax. */
4559#define CONSTRUCTOR_C99_COMPOUND_LITERAL(NODE) \
4560 (TREE_LANG_FLAG_3 (CONSTRUCTOR_CHECK (NODE)))
4561
4562/* True if this CONSTRUCTOR contains PLACEHOLDER_EXPRs referencing the
4563 CONSTRUCTOR's type not nested inside another CONSTRUCTOR marked with
4564 CONSTRUCTOR_PLACEHOLDER_BOUNDARY. */
4565#define CONSTRUCTOR_PLACEHOLDER_BOUNDARY(NODE) \
4566 (TREE_LANG_FLAG_5 (CONSTRUCTOR_CHECK (NODE)))
4567
4568#define DIRECT_LIST_INIT_P(NODE) \
4569 (BRACE_ENCLOSED_INITIALIZER_P (NODE) && CONSTRUCTOR_IS_DIRECT_INIT (NODE))
4570
4571/* True if this is a designated initializer (when we allow initializer-clauses
4572 mixed with designated-initializer-clauses set whenever there is at least
4573 one designated-initializer-clause), or a C99 designator. */
4574#define CONSTRUCTOR_IS_DESIGNATED_INIT(NODE) \
4575 (TREE_LANG_FLAG_6 (CONSTRUCTOR_CHECK (NODE)))
4576
4577/* True if this CONSTRUCTOR comes from a parenthesized list of values, e.g.
4578 A(1, 2, 3). */
4579#define CONSTRUCTOR_IS_PAREN_INIT(NODE) \
4580 (CONSTRUCTOR_CHECK(NODE)->base.private_flag)
4581
4582/* True if reshape_init built this sub-CONSTRUCTOR to undo the brace elision
4583 of the original CONSTRUCTOR. This flag is used during C++20 aggregate
4584 CTAD. */
4585#define CONSTRUCTOR_BRACES_ELIDED_P(NODE) \
4586 (CONSTRUCTOR_CHECK (NODE)->base.protected_flag)
4587
4588/* True if NODE represents a conversion for direct-initialization in a
4589 template. Set by perform_implicit_conversion_flags. */
4590#define IMPLICIT_CONV_EXPR_DIRECT_INIT(NODE) \
4591 (TREE_LANG_FLAG_0 (IMPLICIT_CONV_EXPR_CHECK (NODE)))
4592
4593/* True if NODE represents a dependent conversion of a non-type template
4594 argument. Set by maybe_convert_nontype_argument. */
4595#define IMPLICIT_CONV_EXPR_NONTYPE_ARG(NODE) \
4596 (TREE_LANG_FLAG_1 (IMPLICIT_CONV_EXPR_CHECK (NODE)))
4597
4598/* True if NODE represents a conversion for braced-init-list in a
4599 template. Set by perform_implicit_conversion_flags. */
4600#define IMPLICIT_CONV_EXPR_BRACED_INIT(NODE) \
4601 (TREE_LANG_FLAG_2 (IMPLICIT_CONV_EXPR_CHECK (NODE)))
4602
4603/* Nonzero means that an object of this type cannot be initialized using
4604 an initializer list. */
4605#define CLASSTYPE_NON_AGGREGATE(NODE) \
4606 (LANG_TYPE_CLASS_CHECK (NODE)->non_aggregate)
4607#define TYPE_NON_AGGREGATE_CLASS(NODE) \
4608 (CLASS_TYPE_P (NODE) && CLASSTYPE_NON_AGGREGATE (NODE))
4609
4610/* Nonzero if there is a non-trivial X::op=(cv X&) for this class. */
4611#define TYPE_HAS_COMPLEX_COPY_ASSIGN(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_copy_assign)
4612
4613/* Nonzero if there is a non-trivial X::X(cv X&) for this class. */
4614#define TYPE_HAS_COMPLEX_COPY_CTOR(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_copy_ctor)
4615
4616/* Nonzero if there is a non-trivial X::op=(X&&) for this class. */
4617#define TYPE_HAS_COMPLEX_MOVE_ASSIGN(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_move_assign)
4618
4619/* Nonzero if there is a non-trivial X::X(X&&) for this class. */
4620#define TYPE_HAS_COMPLEX_MOVE_CTOR(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_move_ctor)
4621
4622/* Nonzero if there is no trivial default constructor for this class. */
4623#define TYPE_HAS_COMPLEX_DFLT(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_dflt)
4624
4625/* Nonzero if TYPE has a trivial destructor. From [class.dtor]:
4626
4627 A destructor is trivial if it is an implicitly declared
4628 destructor and if:
4629
4630 - all of the direct base classes of its class have trivial
4631 destructors,
4632
4633 - for all of the non-static data members of its class that are
4634 of class type (or array thereof), each such class has a
4635 trivial destructor. */
4636#define TYPE_HAS_TRIVIAL_DESTRUCTOR(NODE) \
4637 (!TYPE_HAS_NONTRIVIAL_DESTRUCTOR (NODE))
4638
4639/* Nonzero for _TYPE node means that this type does not have a trivial
4640 destructor. Therefore, destroying an object of this type will
4641 involve a call to a destructor. This can apply to objects of
4642 ARRAY_TYPE if the type of the elements needs a destructor. */
4643#define TYPE_HAS_NONTRIVIAL_DESTRUCTOR(NODE) \
4644 (TYPE_LANG_FLAG_4 (NODE))
4645
4646/* Nonzero for class type means that the default constructor is trivial. */
4647#define TYPE_HAS_TRIVIAL_DFLT(NODE) \
4648 (TYPE_HAS_DEFAULT_CONSTRUCTOR (NODE) && ! TYPE_HAS_COMPLEX_DFLT (NODE))
4649
4650/* Nonzero for class type means that copy initialization of this type can use
4651 a bitwise copy. */
4652#define TYPE_HAS_TRIVIAL_COPY_CTOR(NODE) \
4653 (TYPE_HAS_COPY_CTOR (NODE) && ! TYPE_HAS_COMPLEX_COPY_CTOR (NODE))
4654
4655/* Nonzero for class type means that assignment of this type can use
4656 a bitwise copy. */
4657#define TYPE_HAS_TRIVIAL_COPY_ASSIGN(NODE) \
4658 (TYPE_HAS_COPY_ASSIGN (NODE) && ! TYPE_HAS_COMPLEX_COPY_ASSIGN (NODE))
4659
4660/* Returns true if NODE is a pointer-to-data-member. */
4661#define TYPE_PTRDATAMEM_P(NODE) \
4662 (TREE_CODE (NODE) == OFFSET_TYPE)
4663
4664/* Returns true if NODE is a pointer. */
4665#define TYPE_PTR_P(NODE) \
4666 (TREE_CODE (NODE) == POINTER_TYPE)
4667
4668/* Returns true if NODE is a reference. */
4669#define TYPE_REF_P(NODE) \
4670 (TREE_CODE (NODE) == REFERENCE_TYPE)
4671
4672/* Returns true if NODE is a pointer or a reference. */
4673#define INDIRECT_TYPE_P(NODE) \
4674 (TYPE_PTR_P (NODE) || TYPE_REF_P (NODE))
4675
4676/* Returns true if NODE is an object type:
4677
4678 [basic.types]
4679
4680 An object type is a (possibly cv-qualified) type that is not a
4681 function type, not a reference type, and not a void type.
4682
4683 Keep these checks in ascending order, for speed. */
4684#define TYPE_OBJ_P(NODE) \
4685 (!TYPE_REF_P (NODE) \
4686 && !VOID_TYPE_P (NODE) \
4687 && !FUNC_OR_METHOD_TYPE_P (NODE))
4688
4689/* Returns true if NODE is a pointer to an object. Keep these checks
4690 in ascending tree code order. */
4691#define TYPE_PTROB_P(NODE) \
4692 (TYPE_PTR_P (NODE) && TYPE_OBJ_P (TREE_TYPE (NODE)))
4693
4694/* Returns true if NODE is a reference to an object. Keep these checks
4695 in ascending tree code order. */
4696#define TYPE_REF_OBJ_P(NODE) \
4697 (TYPE_REF_P (NODE) && TYPE_OBJ_P (TREE_TYPE (NODE)))
4698
4699/* Returns true if NODE is a pointer to an object, or a pointer to
4700 void. Keep these checks in ascending tree code order. */
4701#define TYPE_PTROBV_P(NODE) \
4702 (TYPE_PTR_P (NODE) \
4703 && !FUNC_OR_METHOD_TYPE_P (TREE_TYPE (NODE)))
4704
4705/* Returns true if NODE is a pointer to function type. */
4706#define TYPE_PTRFN_P(NODE) \
4707 (TYPE_PTR_P (NODE) \
4708 && TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
4709
4710/* Returns true if NODE is a reference to function type. */
4711#define TYPE_REFFN_P(NODE) \
4712 (TYPE_REF_P (NODE) \
4713 && TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
4714
4715/* Returns true if NODE is a pointer to member function type. */
4716#define TYPE_PTRMEMFUNC_P(NODE) \
4717 (TREE_CODE (NODE) == RECORD_TYPE \
4718 && TYPE_PTRMEMFUNC_FLAG (NODE))
4719
4720#define TYPE_PTRMEMFUNC_FLAG(NODE) \
4721 (TYPE_LANG_FLAG_2 (RECORD_TYPE_CHECK (NODE)))
4722
4723/* Returns true if NODE is a pointer-to-member. */
4724#define TYPE_PTRMEM_P(NODE) \
4725 (TYPE_PTRDATAMEM_P (NODE) || TYPE_PTRMEMFUNC_P (NODE))
4726
4727/* Returns true if NODE is a pointer or a pointer-to-member. */
4728#define TYPE_PTR_OR_PTRMEM_P(NODE) \
4729 (TYPE_PTR_P (NODE) || TYPE_PTRMEM_P (NODE))
4730
4731/* Indicates when overload resolution may resolve to a pointer to
4732 member function. [expr.unary.op]/3 */
4733#define PTRMEM_OK_P(NODE) \
4734 TREE_LANG_FLAG_0 (TREE_CHECK3 ((NODE), ADDR_EXPR, OFFSET_REF, SCOPE_REF))
4735
4736/* Get the POINTER_TYPE to the METHOD_TYPE associated with this
4737 pointer to member function. TYPE_PTRMEMFUNC_P _must_ be true,
4738 before using this macro. */
4739#define TYPE_PTRMEMFUNC_FN_TYPE(NODE) \
4740 (cp_build_qualified_type (TREE_TYPE (TYPE_FIELDS (NODE)),\
4741 cp_type_quals (NODE)))
4742
4743/* As above, but can be used in places that want an lvalue at the expense
4744 of not necessarily having the correct cv-qualifiers. */
4745#define TYPE_PTRMEMFUNC_FN_TYPE_RAW(NODE) \
4746 (TREE_TYPE (TYPE_FIELDS (NODE)))
4747
4748/* Returns `A' for a type like `int (A::*)(double)' */
4749#define TYPE_PTRMEMFUNC_OBJECT_TYPE(NODE) \
4750 TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
4751
4752/* The canonical internal RECORD_TYPE from the POINTER_TYPE to
4753 METHOD_TYPE. */
4754#define TYPE_PTRMEMFUNC_TYPE(NODE) \
4755 TYPE_LANG_SLOT_1 (NODE)
4756
4757/* For a pointer-to-member type of the form `T X::*', this is `X'.
4758 For a type like `void (X::*)() const', this type is `X', not `const
4759 X'. To get at the `const X' you have to look at the
4760 TYPE_PTRMEM_POINTED_TO_TYPE; there, the first parameter will have
4761 type `const X*'. */
4762#define TYPE_PTRMEM_CLASS_TYPE(NODE) \
4763 (TYPE_PTRDATAMEM_P (NODE) \
4764 ? TYPE_OFFSET_BASETYPE (NODE) \
4765 : TYPE_PTRMEMFUNC_OBJECT_TYPE (NODE))
4766
4767/* For a pointer-to-member type of the form `T X::*', this is `T'. */
4768#define TYPE_PTRMEM_POINTED_TO_TYPE(NODE) \
4769 (TYPE_PTRDATAMEM_P (NODE) \
4770 ? TREE_TYPE (NODE) \
4771 : TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
4772
4773/* For a pointer-to-member constant `X::Y' this is the RECORD_TYPE for
4774 `X'. */
4775#define PTRMEM_CST_CLASS(NODE) \
4776 TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (PTRMEM_CST_CHECK (NODE)))
4777
4778/* For a pointer-to-member constant `X::Y' this is the _DECL for
4779 `Y'. */
4780#define PTRMEM_CST_MEMBER(NODE) \
4781 (((ptrmem_cst_t)PTRMEM_CST_CHECK (NODE))->member)
4782
4783/* For a pointer-to-member constant `X::Y' this is a location where
4784 the address of the member has been taken. */
4785#define PTRMEM_CST_LOCATION(NODE) \
4786 (((ptrmem_cst_t)PTRMEM_CST_CHECK (NODE))->locus)
4787
4788/* The expression in question for a TYPEOF_TYPE. */
4789#define TYPEOF_TYPE_EXPR(NODE) (TYPE_VALUES_RAW (TYPEOF_TYPE_CHECK (NODE)))
4790
4791/* The type in question for an UNDERLYING_TYPE. */
4792#define UNDERLYING_TYPE_TYPE(NODE) \
4793 (TYPE_VALUES_RAW (UNDERLYING_TYPE_CHECK (NODE)))
4794
4795/* The type in question for BASES. */
4796#define BASES_TYPE(NODE) \
4797 (TYPE_VALUES_RAW (BASES_CHECK (NODE)))
4798
4799#define BASES_DIRECT(NODE) \
4800 TREE_LANG_FLAG_0 (BASES_CHECK (NODE))
4801
4802/* The expression in question for a DECLTYPE_TYPE. */
4803#define DECLTYPE_TYPE_EXPR(NODE) (TYPE_VALUES_RAW (DECLTYPE_TYPE_CHECK (NODE)))
4804
4805/* Whether the DECLTYPE_TYPE_EXPR of NODE was originally parsed as an
4806 id-expression or a member-access expression. When false, it was
4807 parsed as a full expression. */
4808#define DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P(NODE) \
4809 (DECLTYPE_TYPE_CHECK (NODE))->type_common.string_flag
4810
4811/* These flags indicate that we want different semantics from normal
4812 decltype: lambda capture just drops references,
4813 lambda proxies look through implicit dereference. */
4814#define DECLTYPE_FOR_LAMBDA_CAPTURE(NODE) \
4815 TREE_LANG_FLAG_0 (DECLTYPE_TYPE_CHECK (NODE))
4816#define DECLTYPE_FOR_LAMBDA_PROXY(NODE) \
4817 TREE_LANG_FLAG_2 (DECLTYPE_TYPE_CHECK (NODE))
4818#define DECLTYPE_FOR_REF_CAPTURE(NODE) \
4819 TREE_LANG_FLAG_3 (DECLTYPE_TYPE_CHECK (NODE))
4820
4821/* Nonzero for VAR_DECL and FUNCTION_DECL node means that `extern' was
4822 specified in its declaration. This can also be set for an
4823 erroneously declared PARM_DECL. */
4824#define DECL_THIS_EXTERN(NODE) \
4825 DECL_LANG_FLAG_2 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
4826
4827/* Nonzero for VAR_DECL and FUNCTION_DECL node means that `static' was
4828 specified in its declaration. This can also be set for an
4829 erroneously declared PARM_DECL. */
4830#define DECL_THIS_STATIC(NODE) \
4831 DECL_LANG_FLAG_6 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
4832
4833/* Nonzero for FIELD_DECL node means that this field is a lambda capture
4834 field for an array of runtime bound. */
4835#define DECL_VLA_CAPTURE_P(NODE) \
4836 DECL_LANG_FLAG_1 (FIELD_DECL_CHECK (NODE))
4837
4838/* Nonzero for PARM_DECL node means that this is an array function
4839 parameter, i.e, a[] rather than *a. */
4840#define DECL_ARRAY_PARAMETER_P(NODE) \
4841 DECL_LANG_FLAG_1 (PARM_DECL_CHECK (NODE))
4842
4843/* Nonzero for a FIELD_DECL who's NSMDI is currently being
4844 instantiated. */
4845#define DECL_INSTANTIATING_NSDMI_P(NODE) \
4846 DECL_LANG_FLAG_2 (FIELD_DECL_CHECK (NODE))
4847
4848/* Nonzero for FIELD_DECL node means that this field is a base class
4849 of the parent object, as opposed to a member field. */
4850#define DECL_FIELD_IS_BASE(NODE) \
4851 DECL_LANG_FLAG_6 (FIELD_DECL_CHECK (NODE))
4852
4853/* Nonzero for FIELD_DECL node means that this field is a simple (no
4854 explicit initializer) lambda capture field, making it invisible to
4855 name lookup in unevaluated contexts. */
4856#define DECL_NORMAL_CAPTURE_P(NODE) \
4857 DECL_LANG_FLAG_7 (FIELD_DECL_CHECK (NODE))
4858
4859/* Nonzero if TYPE is an anonymous union or struct type. We have to use a
4860 flag for this because "A union for which objects or pointers are
4861 declared is not an anonymous union" [class.union]. */
4862#define ANON_AGGR_TYPE_P(NODE) \
4863 (CLASS_TYPE_P (NODE) && LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr)
4864#define SET_ANON_AGGR_TYPE_P(NODE) \
4865 (LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr = 1)
4866
4867/* Nonzero if TYPE is an anonymous union type. */
4868#define ANON_UNION_TYPE_P(NODE) \
4869 (TREE_CODE (NODE) == UNION_TYPE && ANON_AGGR_TYPE_P (NODE))
4870
4871/* For an ANON_AGGR_TYPE_P the single FIELD_DECL it is used with. */
4872#define ANON_AGGR_TYPE_FIELD(NODE) \
4873 (LANG_TYPE_CLASS_CHECK (NODE)->typeinfo_var)
4874
4875/* Define fields and accessors for nodes representing declared names. */
4876
4877/* True if TYPE is an unnamed structured type with a typedef for
4878 linkage purposes. In that case TYPE_NAME and TYPE_STUB_DECL of the
4879 MAIN-VARIANT are different. */
4880#define TYPE_WAS_UNNAMED(NODE) \
4881 (TYPE_NAME (TYPE_MAIN_VARIANT (NODE)) \
4882 != TYPE_STUB_DECL (TYPE_MAIN_VARIANT (NODE)))
4883
4884/* C++: all of these are overloaded! These apply only to TYPE_DECLs. */
4885
4886/* The format of each node in the DECL_FRIENDLIST is as follows:
4887
4888 The TREE_PURPOSE will be the name of a function, i.e., an
4889 IDENTIFIER_NODE. The TREE_VALUE will be itself a TREE_LIST, whose
4890 TREE_VALUEs are friends with the given name. */
4891#define DECL_FRIENDLIST(NODE) (DECL_INITIAL (NODE))
4892#define FRIEND_NAME(LIST) (TREE_PURPOSE (LIST))
4893#define FRIEND_DECLS(LIST) (TREE_VALUE (LIST))
4894
4895/* The DECL_ACCESS, if non-NULL, is a TREE_LIST. The TREE_PURPOSE of
4896 each node is a type; the TREE_VALUE is the access granted for this
4897 DECL in that type. The DECL_ACCESS is set by access declarations.
4898 For example, if a member that would normally be public in a
4899 derived class is made protected, then the derived class and the
4900 protected_access_node will appear in the DECL_ACCESS for the node. */
4901#define DECL_ACCESS(NODE) (LANG_DECL_MIN_CHECK (NODE)->access)
4902
4903/* Nonzero if the FUNCTION_DECL is a global constructor. */
4904#define DECL_GLOBAL_CTOR_P(NODE) \
4905 (LANG_DECL_FN_CHECK (NODE)->global_ctor_p)
4906
4907/* Nonzero if the FUNCTION_DECL is a global destructor. */
4908#define DECL_GLOBAL_DTOR_P(NODE) \
4909 (LANG_DECL_FN_CHECK (NODE)->global_dtor_p)
4910
4911/* Accessor macros for C++ template decl nodes. */
4912
4913/* The DECL_TEMPLATE_PARMS are a list. The TREE_PURPOSE of each node
4914 is a INT_CST whose TREE_INT_CST_LOW indicates the level of the
4915 template parameters, with 1 being the outermost set of template
4916 parameters. The TREE_VALUE is a vector, whose elements are the
4917 template parameters at each level. Each element in the vector is a
4918 TREE_LIST, whose TREE_VALUE is a PARM_DECL (if the parameter is a
4919 non-type parameter), or a TYPE_DECL (if the parameter is a type
4920 parameter) or a TEMPLATE_DECL (if the parameter is a template
4921 parameter). The TREE_PURPOSE is the default value, if any. The
4922 TEMPLATE_PARM_INDEX for the parameter is available as the
4923 DECL_INITIAL (for a PARM_DECL) or as the TREE_TYPE (for a
4924 TYPE_DECL).
4925
4926 FIXME: CONST_CAST_TREE is a hack that hopefully will go away after
4927 tree is converted to C++ class hiearchy. */
4928#define DECL_TEMPLATE_PARMS(NODE) \
4929 ((struct tree_template_decl *)CONST_CAST_TREE (TEMPLATE_DECL_CHECK (NODE)))->arguments
4930#define DECL_INNERMOST_TEMPLATE_PARMS(NODE) \
4931 INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (NODE))
4932#define DECL_NTPARMS(NODE) \
4933 TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (NODE))
4934/* For function, method, class-data templates.
4935
4936 FIXME: CONST_CAST_TREE is a hack that hopefully will go away after
4937 tree is converted to C++ class hiearchy. */
4938#define DECL_TEMPLATE_RESULT(NODE) \
4939 ((struct tree_template_decl *)CONST_CAST_TREE(TEMPLATE_DECL_CHECK (NODE)))->result
4940/* For a function template at namespace scope, DECL_TEMPLATE_INSTANTIATIONS
4941 lists all instantiations and specializations of the function so that
4942 tsubst_friend_function can reassign them to another template if we find
4943 that the namespace-scope template is really a partial instantiation of a
4944 friend template.
4945
4946 For a class template the DECL_TEMPLATE_INSTANTIATIONS lists holds
4947 all instantiations and specializations of the class type, including
4948 partial instantiations and partial specializations, so that if we
4949 explicitly specialize a partial instantiation we can walk the list
4950 in maybe_process_partial_specialization and reassign them or complain
4951 as appropriate.
4952
4953 In both cases, the TREE_PURPOSE of each node contains the arguments
4954 used; the TREE_VALUE contains the generated variable. The template
4955 arguments are always complete. For example, given:
4956
4957 template <class T> struct S1 {
4958 template <class U> struct S2 {};
4959 template <class U> struct S2<U*> {};
4960 };
4961
4962 the record for the partial specialization will contain, as its
4963 argument list, { {T}, {U*} }, and will be on the
4964 DECL_TEMPLATE_INSTANTIATIONS list for `template <class T> template
4965 <class U> struct S1<T>::S2'.
4966
4967 This list is not used for other templates. */
4968#define DECL_TEMPLATE_INSTANTIATIONS(NODE) \
4969 DECL_SIZE_UNIT (TEMPLATE_DECL_CHECK (NODE))
4970
4971/* For a class template, this list contains the partial
4972 specializations of this template. (Full specializations are not
4973 recorded on this list.) The TREE_PURPOSE holds the arguments used
4974 in the partial specialization (e.g., for `template <class T> struct
4975 S<T*, int>' this will be `T*, int'.) The arguments will also include
4976 any outer template arguments. The TREE_VALUE holds the TEMPLATE_DECL
4977 for the partial specialization. The TREE_TYPE is the _TYPE node for
4978 the partial specialization.
4979
4980 This list is not used for other templates. */
4981#define DECL_TEMPLATE_SPECIALIZATIONS(NODE) \
4982 DECL_SIZE (TEMPLATE_DECL_CHECK (NODE))
4983
4984/* Nonzero for a DECL which is actually a template parameter. Keep
4985 these checks in ascending tree code order. */
4986#define DECL_TEMPLATE_PARM_P(NODE) \
4987 (DECL_LANG_FLAG_0 (NODE) \
4988 && (TREE_CODE (NODE) == CONST_DECL \
4989 || TREE_CODE (NODE) == PARM_DECL \
4990 || TREE_CODE (NODE) == TYPE_DECL \
4991 || TREE_CODE (NODE) == TEMPLATE_DECL))
4992
4993/* Nonzero for a raw template parameter node. */
4994#define TEMPLATE_PARM_P(NODE) \
4995 (TREE_CODE (NODE) == TEMPLATE_TYPE_PARM \
4996 || TREE_CODE (NODE) == TEMPLATE_TEMPLATE_PARM \
4997 || TREE_CODE (NODE) == TEMPLATE_PARM_INDEX)
4998
4999/* Mark NODE as a template parameter. */
5000#define SET_DECL_TEMPLATE_PARM_P(NODE) \
5001 (DECL_LANG_FLAG_0 (NODE) = 1)
5002
5003/* Nonzero if NODE is a template template parameter. */
5004#define DECL_TEMPLATE_TEMPLATE_PARM_P(NODE) \
5005 (TREE_CODE (NODE) == TEMPLATE_DECL && DECL_TEMPLATE_PARM_P (NODE))
5006
5007/* Nonzero for a DECL that represents a function template. */
5008#define DECL_FUNCTION_TEMPLATE_P(NODE) \
5009 (TREE_CODE (NODE) == TEMPLATE_DECL \
5010 && DECL_TEMPLATE_RESULT (NODE) != NULL_TREE \
5011 && TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == FUNCTION_DECL)
5012
5013/* Nonzero for a DECL that represents a class template or alias
5014 template. */
5015#define DECL_TYPE_TEMPLATE_P(NODE) \
5016 (TREE_CODE (NODE) == TEMPLATE_DECL \
5017 && DECL_TEMPLATE_RESULT (NODE) != NULL_TREE \
5018 && TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == TYPE_DECL)
5019
5020/* Nonzero for a DECL that represents a class template. */
5021#define DECL_CLASS_TEMPLATE_P(NODE) \
5022 (DECL_TYPE_TEMPLATE_P (NODE) \
5023 && DECL_IMPLICIT_TYPEDEF_P (DECL_TEMPLATE_RESULT (NODE)))
5024
5025/* Nonzero for a TEMPLATE_DECL that represents an alias template. */
5026#define DECL_ALIAS_TEMPLATE_P(NODE) \
5027 (DECL_TYPE_TEMPLATE_P (NODE) \
5028 && !DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (NODE)))
5029
5030/* Nonzero for a NODE which declares a type. */
5031#define DECL_DECLARES_TYPE_P(NODE) \
5032 (TREE_CODE (NODE) == TYPE_DECL || DECL_TYPE_TEMPLATE_P (NODE))
5033
5034/* Nonzero if NODE declares a function. */
5035#define DECL_DECLARES_FUNCTION_P(NODE) \
5036 (TREE_CODE (NODE) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (NODE))
5037
5038/* Nonzero if NODE is the typedef implicitly generated for a type when
5039 the type is declared. In C++, `struct S {};' is roughly
5040 equivalent to `struct S {}; typedef struct S S;' in C.
5041 DECL_IMPLICIT_TYPEDEF_P will hold for the typedef indicated in this
5042 example. In C++, there is a second implicit typedef for each
5043 class, called the injected-class-name, in the scope of `S' itself, so that
5044 you can say `S::S'. DECL_SELF_REFERENCE_P will hold for that typedef. */
5045#define DECL_IMPLICIT_TYPEDEF_P(NODE) \
5046 (TREE_CODE (NODE) == TYPE_DECL && DECL_LANG_FLAG_2 (NODE))
5047#define SET_DECL_IMPLICIT_TYPEDEF_P(NODE) \
5048 (DECL_LANG_FLAG_2 (NODE) = 1)
5049#define DECL_SELF_REFERENCE_P(NODE) \
5050 (TREE_CODE (NODE) == TYPE_DECL && DECL_LANG_FLAG_4 (NODE))
5051#define SET_DECL_SELF_REFERENCE_P(NODE) \
5052 (DECL_LANG_FLAG_4 (NODE) = 1)
5053
5054/* A `primary' template is one that has its own template header and is not
5055 a partial specialization. A member function of a class template is a
5056 template, but not primary. A member template is primary. Friend
5057 templates are primary, too. */
5058
5059/* Returns the primary template corresponding to these parameters. */
5060#define TPARMS_PRIMARY_TEMPLATE(NODE) (TREE_TYPE (NODE))
5061
5062#define DECL_PRIMARY_TEMPLATE(NODE) \
5063 (TPARMS_PRIMARY_TEMPLATE (DECL_INNERMOST_TEMPLATE_PARMS (NODE)))
5064
5065/* Returns nonzero if NODE is a primary template. */
5066#define PRIMARY_TEMPLATE_P(NODE) (DECL_PRIMARY_TEMPLATE (NODE) == (NODE))
5067
5068/* Nonzero iff NODE is a specialization of a template. The value
5069 indicates the type of specializations:
5070
5071 1=implicit instantiation
5072
5073 2=partial or explicit specialization, e.g.:
5074
5075 template <> int min<int> (int, int),
5076
5077 3=explicit instantiation, e.g.:
5078
5079 template int min<int> (int, int);
5080
5081 Note that NODE will be marked as a specialization even if the
5082 template it is instantiating is not a primary template. For
5083 example, given:
5084
5085 template <typename T> struct O {
5086 void f();
5087 struct I {};
5088 };
5089
5090 both O<int>::f and O<int>::I will be marked as instantiations.
5091
5092 If DECL_USE_TEMPLATE is nonzero, then DECL_TEMPLATE_INFO will also
5093 be non-NULL. */
5094#define DECL_USE_TEMPLATE(NODE) (DECL_LANG_SPECIFIC (NODE)->u.base.use_template)
5095
5096/* Like DECL_USE_TEMPLATE, but for class types. */
5097#define CLASSTYPE_USE_TEMPLATE(NODE) \
5098 (LANG_TYPE_CLASS_CHECK (NODE)->use_template)
5099
5100/* True if NODE is a specialization of a primary template. */
5101#define CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P(NODE) \
5102 (CLASS_TYPE_P (NODE) \
5103 && CLASSTYPE_USE_TEMPLATE (NODE) \
5104 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE)))
5105
5106#define DECL_TEMPLATE_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) & 1)
5107#define CLASSTYPE_TEMPLATE_INSTANTIATION(NODE) \
5108 (CLASSTYPE_USE_TEMPLATE (NODE) & 1)
5109
5110#define DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) == 2)
5111#define SET_DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) = 2)
5112
5113/* Returns true for an explicit or partial specialization of a class
5114 template. */
5115#define CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
5116 (CLASSTYPE_USE_TEMPLATE (NODE) == 2)
5117#define SET_CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
5118 (CLASSTYPE_USE_TEMPLATE (NODE) = 2)
5119
5120#define DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 1)
5121#define SET_DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 1)
5122#define CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
5123 (CLASSTYPE_USE_TEMPLATE (NODE) == 1)
5124#define SET_CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
5125 (CLASSTYPE_USE_TEMPLATE (NODE) = 1)
5126
5127#define DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 3)
5128#define SET_DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 3)
5129#define CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
5130 (CLASSTYPE_USE_TEMPLATE (NODE) == 3)
5131#define SET_CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
5132 (CLASSTYPE_USE_TEMPLATE (NODE) = 3)
5133
5134/* Nonzero if DECL is a friend function which is an instantiation
5135 from the point of view of the compiler, but not from the point of
5136 view of the language. For example given:
5137 template <class T> struct S { friend void f(T) {}; };
5138 the declaration of `void f(int)' generated when S<int> is
5139 instantiated will not be a DECL_TEMPLATE_INSTANTIATION, but will be
5140 a DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION. */
5141#define DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION(DECL) \
5142 (DECL_LANG_SPECIFIC (DECL) && DECL_TEMPLATE_INFO (DECL) \
5143 && !DECL_USE_TEMPLATE (DECL))
5144
5145/* Nonzero if DECL is a function generated from a function 'temploid',
5146 i.e. template, member of class template, or dependent friend. */
5147#define DECL_TEMPLOID_INSTANTIATION(DECL) \
5148 (DECL_TEMPLATE_INSTANTIATION (DECL) \
5149 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (DECL))
5150
5151/* Nonzero if DECL is either defined implicitly by the compiler or
5152 generated from a temploid. */
5153#define DECL_GENERATED_P(DECL) \
5154 (DECL_TEMPLOID_INSTANTIATION (DECL) || DECL_DEFAULTED_FN (DECL))
5155
5156/* Nonzero iff we are currently processing a declaration for an
5157 entity with its own template parameter list, and which is not a
5158 full specialization. */
5159#define PROCESSING_REAL_TEMPLATE_DECL_P() \
5160 (!processing_template_parmlist \
5161 && current_template_depth > template_class_depth (current_scope ()))
5162
5163/* Nonzero if this VAR_DECL or FUNCTION_DECL has already been
5164 instantiated, i.e. its definition has been generated from the
5165 pattern given in the template. */
5166#define DECL_TEMPLATE_INSTANTIATED(NODE) \
5167 DECL_LANG_FLAG_1 (VAR_OR_FUNCTION_DECL_CHECK (NODE))
5168
5169/* We know what we're doing with this decl now. */
5170#define DECL_INTERFACE_KNOWN(NODE) DECL_LANG_FLAG_5 (NODE)
5171
5172/* DECL_EXTERNAL must be set on a decl until the decl is actually emitted,
5173 so that assemble_external will work properly. So we have this flag to
5174 tell us whether the decl is really not external.
5175
5176 This flag does not indicate whether or not the decl is defined in the
5177 current translation unit; it indicates whether or not we should emit the
5178 decl at the end of compilation if it is defined and needed. */
5179#define DECL_NOT_REALLY_EXTERN(NODE) \
5180 (DECL_LANG_SPECIFIC (NODE)->u.base.not_really_extern)
5181
5182#define DECL_REALLY_EXTERN(NODE) \
5183 (DECL_EXTERNAL (NODE) \
5184 && (!DECL_LANG_SPECIFIC (NODE) || !DECL_NOT_REALLY_EXTERN (NODE)))
5185
5186/* A thunk is a stub function.
5187
5188 A thunk is an alternate entry point for an ordinary FUNCTION_DECL.
5189 The address of the ordinary FUNCTION_DECL is given by the
5190 DECL_INITIAL, which is always an ADDR_EXPR whose operand is a
5191 FUNCTION_DECL. The job of the thunk is to either adjust the this
5192 pointer before transferring control to the FUNCTION_DECL, or call
5193 FUNCTION_DECL and then adjust the result value. Note, the result
5194 pointer adjusting thunk must perform a call to the thunked
5195 function, (or be implemented via passing some invisible parameter
5196 to the thunked function, which is modified to perform the
5197 adjustment just before returning).
5198
5199 A thunk may perform either, or both, of the following operations:
5200
5201 o Adjust the this or result pointer by a constant offset.
5202 o Adjust the this or result pointer by looking up a vcall or vbase offset
5203 in the vtable.
5204
5205 A this pointer adjusting thunk converts from a base to a derived
5206 class, and hence adds the offsets. A result pointer adjusting thunk
5207 converts from a derived class to a base, and hence subtracts the
5208 offsets. If both operations are performed, then the constant
5209 adjustment is performed first for this pointer adjustment and last
5210 for the result pointer adjustment.
5211
5212 The constant adjustment is given by THUNK_FIXED_OFFSET. If the
5213 vcall or vbase offset is required, THUNK_VIRTUAL_OFFSET is
5214 used. For this pointer adjusting thunks, it is the vcall offset
5215 into the vtable. For result pointer adjusting thunks it is the
5216 binfo of the virtual base to convert to. Use that binfo's vbase
5217 offset.
5218
5219 It is possible to have equivalent covariant thunks. These are
5220 distinct virtual covariant thunks whose vbase offsets happen to
5221 have the same value. THUNK_ALIAS is used to pick one as the
5222 canonical thunk, which will get all the this pointer adjusting
5223 thunks attached to it. */
5224
5225/* An integer indicating how many bytes should be subtracted from the
5226 this or result pointer when this function is called. */
5227#define THUNK_FIXED_OFFSET(DECL) \
5228 (DECL_LANG_SPECIFIC (THUNK_FUNCTION_CHECK (DECL))->u.fn.u5.fixed_offset)
5229
5230/* A tree indicating how to perform the virtual adjustment. For a this
5231 adjusting thunk it is the number of bytes to be added to the vtable
5232 to find the vcall offset. For a result adjusting thunk, it is the
5233 binfo of the relevant virtual base. If NULL, then there is no
5234 virtual adjust. (The vptr is always located at offset zero from
5235 the this or result pointer.) (If the covariant type is within the
5236 class hierarchy being laid out, the vbase index is not yet known
5237 at the point we need to create the thunks, hence the need to use
5238 binfos.) */
5239
5240#define THUNK_VIRTUAL_OFFSET(DECL) \
5241 (LANG_DECL_MIN_CHECK (FUNCTION_DECL_CHECK (DECL))->access)
5242
5243/* A thunk which is equivalent to another thunk. */
5244#define THUNK_ALIAS(DECL) \
5245 (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (DECL))->u.min.template_info)
5246
5247/* For thunk NODE, this is the FUNCTION_DECL thunked to. It is
5248 possible for the target to be a thunk too. */
5249#define THUNK_TARGET(NODE) \
5250 (LANG_DECL_FN_CHECK (NODE)->befriending_classes)
5251
5252/* True for a SCOPE_REF iff the "template" keyword was used to
5253 indicate that the qualified name denotes a template. */
5254#define QUALIFIED_NAME_IS_TEMPLATE(NODE) \
5255 (TREE_LANG_FLAG_1 (SCOPE_REF_CHECK (NODE)))
5256
5257/* [coroutines]
5258*/
5259
5260/* True if NODE is a co-routine FUNCTION_DECL. */
5261#define DECL_COROUTINE_P(NODE) \
5262 (LANG_DECL_FN_CHECK (DECL_COMMON_CHECK (NODE))->coroutine_p)
5263
5264/* For a FUNCTION_DECL of a coroutine, this holds the ACTOR helper function
5265 decl. */
5266#define DECL_ACTOR_FN(NODE) \
5267 (coro_get_actor_function ((NODE)))
5268
5269/* For a FUNCTION_DECL of a coroutine, this holds the DESTROY helper function
5270 decl. */
5271#define DECL_DESTROY_FN(NODE) \
5272 (coro_get_destroy_function ((NODE)))
5273
5274/* For a FUNCTION_DECL of a coroutine helper (ACTOR or DESTROY), this points
5275 back to the original (ramp) function. */
5276#define DECL_RAMP_FN(NODE) \
5277 (coro_get_ramp_function (NODE))
5278
5279/* True for an OMP_ATOMIC that has dependent parameters. These are stored
5280 as an expr in operand 1, and integer_zero_node or clauses in operand 0. */
5281#define OMP_ATOMIC_DEPENDENT_P(NODE) \
5282 (TREE_CODE (TREE_OPERAND (OMP_ATOMIC_CHECK (NODE), 0)) == INTEGER_CST \
5283 || TREE_CODE (TREE_OPERAND (OMP_ATOMIC_CHECK (NODE), 0)) == OMP_CLAUSE)
5284
5285/* Used while gimplifying continue statements bound to OMP_FOR nodes. */
5286#define OMP_FOR_GIMPLIFYING_P(NODE) \
5287 (TREE_LANG_FLAG_0 (OMP_LOOPING_CHECK (NODE)))
5288
5289/* A language-specific token attached to the OpenMP data clauses to
5290 hold code (or code fragments) related to ctors, dtors, and op=.
5291 See semantics.cc for details. */
5292#define CP_OMP_CLAUSE_INFO(NODE) \
5293 TREE_TYPE (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_PRIVATE, \
5294 OMP_CLAUSE__CONDTEMP_))
5295
5296/* Nonzero if this transaction expression's body contains statements. */
5297#define TRANSACTION_EXPR_IS_STMT(NODE) \
5298 TREE_LANG_FLAG_0 (TRANSACTION_EXPR_CHECK (NODE))
5299
5300/* These macros provide convenient access to the various _STMT nodes
5301 created when parsing template declarations. */
5302#define TRY_STMTS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 0)
5303#define TRY_HANDLERS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 1)
5304
5305#define EH_SPEC_STMTS(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 0)
5306#define EH_SPEC_RAISES(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 1)
5307
5308#define USING_STMT_NAMESPACE(NODE) TREE_OPERAND (USING_STMT_CHECK (NODE), 0)
5309
5310/* Nonzero if this try block is a function try block. */
5311#define FN_TRY_BLOCK_P(NODE) TREE_LANG_FLAG_3 (TRY_BLOCK_CHECK (NODE))
5312#define HANDLER_PARMS(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 0)
5313#define HANDLER_BODY(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 1)
5314#define HANDLER_TYPE(NODE) TREE_TYPE (HANDLER_CHECK (NODE))
5315
5316/* CLEANUP_STMT accessors. The statement(s) covered, the cleanup to run
5317 and the VAR_DECL for which this cleanup exists. */
5318#define CLEANUP_BODY(NODE) TREE_OPERAND (CLEANUP_STMT_CHECK (NODE), 0)
5319#define CLEANUP_EXPR(NODE) TREE_OPERAND (CLEANUP_STMT_CHECK (NODE), 1)
5320#define CLEANUP_DECL(NODE) TREE_OPERAND (CLEANUP_STMT_CHECK (NODE), 2)
5321
5322/* IF_STMT accessors. These give access to the condition of the if
5323 statement, the then block of the if statement, and the else block
5324 of the if statement if it exists. */
5325#define IF_COND(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 0)
5326#define THEN_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 1)
5327#define ELSE_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 2)
5328#define IF_SCOPE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 3)
5329#define IF_STMT_CONSTEXPR_P(NODE) TREE_LANG_FLAG_0 (IF_STMT_CHECK (NODE))
5330#define IF_STMT_CONSTEVAL_P(NODE) TREE_LANG_FLAG_2 (IF_STMT_CHECK (NODE))
5331
5332/* Like PACK_EXPANSION_EXTRA_ARGS, for constexpr if. IF_SCOPE is used while
5333 building an IF_STMT; IF_STMT_EXTRA_ARGS is used after it is complete. */
5334#define IF_STMT_EXTRA_ARGS(NODE) IF_SCOPE (NODE)
5335
5336/* RANGE_FOR_STMT accessors. These give access to the declarator,
5337 expression, body, and scope of the statement, respectively. */
5338#define RANGE_FOR_DECL(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 0)
5339#define RANGE_FOR_EXPR(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 1)
5340#define RANGE_FOR_BODY(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 2)
5341#define RANGE_FOR_SCOPE(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 3)
5342#define RANGE_FOR_UNROLL(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 4)
5343#define RANGE_FOR_INIT_STMT(NODE) TREE_OPERAND (RANGE_FOR_STMT_CHECK (NODE), 5)
5344#define RANGE_FOR_IVDEP(NODE) TREE_LANG_FLAG_6 (RANGE_FOR_STMT_CHECK (NODE))
5345
5346/* STMT_EXPR accessor. */
5347#define STMT_EXPR_STMT(NODE) TREE_OPERAND (STMT_EXPR_CHECK (NODE), 0)
5348
5349/* EXPR_STMT accessor. This gives the expression associated with an
5350 expression statement. */
5351#define EXPR_STMT_EXPR(NODE) TREE_OPERAND (EXPR_STMT_CHECK (NODE), 0)
5352
5353/* True if this TARGET_EXPR was created by build_cplus_new, and so we can
5354 discard it if it isn't useful. */
5355#define TARGET_EXPR_IMPLICIT_P(NODE) \
5356 TREE_LANG_FLAG_0 (TARGET_EXPR_CHECK (NODE))
5357
5358/* True if this TARGET_EXPR is the result of list-initialization of a
5359 temporary. */
5360#define TARGET_EXPR_LIST_INIT_P(NODE) \
5361 TREE_LANG_FLAG_1 (TARGET_EXPR_CHECK (NODE))
5362
5363/* True if this TARGET_EXPR expresses direct-initialization of an object
5364 to be named later. */
5365#define TARGET_EXPR_DIRECT_INIT_P(NODE) \
5366 TREE_LANG_FLAG_2 (TARGET_EXPR_CHECK (NODE))
5367
5368/* True if NODE is a TARGET_EXPR that just expresses a copy of its INITIAL; if
5369 the initializer has void type, it's doing something more complicated. */
5370#define SIMPLE_TARGET_EXPR_P(NODE) \
5371 (TREE_CODE (NODE) == TARGET_EXPR \
5372 && TARGET_EXPR_INITIAL (NODE) \
5373 && !VOID_TYPE_P (TREE_TYPE (TARGET_EXPR_INITIAL (NODE))))
5374
5375/* True if T is a TARGET_EXPR for which we'll need to replace_decl to use it as
5376 an initializer. */
5377inline bool
5378target_expr_needs_replace (tree t)
5379{
5380 if (!t || TREE_CODE (t) != TARGET_EXPR)
5381 return false;
5382 tree init = TARGET_EXPR_INITIAL (t);
5383 if (!init || !VOID_TYPE_P (TREE_TYPE (init)))
5384 return false;
5385 while (TREE_CODE (init) == COMPOUND_EXPR)
5386 init = TREE_OPERAND (init, 1);
5387 return TREE_CODE (init) != AGGR_INIT_EXPR;
5388}
5389
5390/* True if EXPR expresses direct-initialization of a TYPE. */
5391#define DIRECT_INIT_EXPR_P(TYPE,EXPR) \
5392 (TREE_CODE (EXPR) == TARGET_EXPR && TREE_LANG_FLAG_2 (EXPR) \
5393 && same_type_ignoring_top_level_qualifiers_p (TYPE, TREE_TYPE (EXPR)))
5394
5395/* True if this CONVERT_EXPR is for a conversion to virtual base in
5396 an NSDMI, and should be re-evaluated when used in a constructor. */
5397#define CONVERT_EXPR_VBASE_PATH(NODE) \
5398 TREE_LANG_FLAG_0 (CONVERT_EXPR_CHECK (NODE))
5399
5400/* True if SIZEOF_EXPR argument is type. */
5401#define SIZEOF_EXPR_TYPE_P(NODE) \
5402 TREE_LANG_FLAG_0 (SIZEOF_EXPR_CHECK (NODE))
5403
5404/* True if the ALIGNOF_EXPR was spelled "alignof". */
5405#define ALIGNOF_EXPR_STD_P(NODE) \
5406 TREE_LANG_FLAG_0 (ALIGNOF_EXPR_CHECK (NODE))
5407
5408/* OMP_DEPOBJ accessors. These give access to the depobj expression of the
5409 #pragma omp depobj directive and the clauses, respectively. If
5410 OMP_DEPOBJ_CLAUSES is INTEGER_CST, it is instead the update clause kind
5411 or OMP_CLAUSE_DEPEND_LAST for destroy clause. */
5412#define OMP_DEPOBJ_DEPOBJ(NODE) TREE_OPERAND (OMP_DEPOBJ_CHECK (NODE), 0)
5413#define OMP_DEPOBJ_CLAUSES(NODE) TREE_OPERAND (OMP_DEPOBJ_CHECK (NODE), 1)
5414
5415/* An enumeration of the kind of tags that C++ accepts. */
5416enum tag_types {
5417 none_type = 0, /* Not a tag type. */
5418 record_type, /* "struct" types. */
5419 class_type, /* "class" types. */
5420 union_type, /* "union" types. */
5421 enum_type, /* "enum" types. */
5422 typename_type, /* "typename" types. */
5423 scope_type /* namespace or tagged type name followed by :: */
5424};
5425
5426/* The various kinds of lvalues we distinguish. */
5427enum cp_lvalue_kind_flags {
5428 clk_none = 0, /* Things that are not an lvalue. */
5429 clk_ordinary = 1, /* An ordinary lvalue. */
5430 clk_rvalueref = 2,/* An xvalue (rvalue formed using an rvalue reference) */
5431 clk_class = 4, /* A prvalue of class or array type. */
5432 clk_bitfield = 8, /* An lvalue for a bit-field. */
5433 clk_packed = 16, /* An lvalue for a packed field. */
5434 clk_implicit_rval = 1<<5 /* An lvalue being treated as an xvalue. */
5435};
5436
5437/* This type is used for parameters and variables which hold
5438 combinations of the flags in enum cp_lvalue_kind_flags. */
5439typedef int cp_lvalue_kind;
5440
5441/* Various kinds of template specialization, instantiation, etc. */
5442enum tmpl_spec_kind {
5443 tsk_none, /* Not a template at all. */
5444 tsk_invalid_member_spec, /* An explicit member template
5445 specialization, but the enclosing
5446 classes have not all been explicitly
5447 specialized. */
5448 tsk_invalid_expl_inst, /* An explicit instantiation containing
5449 template parameter lists. */
5450 tsk_excessive_parms, /* A template declaration with too many
5451 template parameter lists. */
5452 tsk_insufficient_parms, /* A template declaration with too few
5453 parameter lists. */
5454 tsk_template, /* A template declaration. */
5455 tsk_expl_spec, /* An explicit specialization. */
5456 tsk_expl_inst /* An explicit instantiation. */
5457};
5458
5459/* The various kinds of access. BINFO_ACCESS depends on these being
5460 two bit quantities. The numerical values are important; they are
5461 used to initialize RTTI data structures, so changing them changes
5462 the ABI. */
5463enum access_kind {
5464 ak_none = 0, /* Inaccessible. */
5465 ak_public = 1, /* Accessible, as a `public' thing. */
5466 ak_protected = 2, /* Accessible, as a `protected' thing. */
5467 ak_private = 3 /* Accessible, as a `private' thing. */
5468};
5469
5470/* The various kinds of special functions. If you add to this list,
5471 you should update special_function_p as well. */
5472enum special_function_kind {
5473 sfk_none = 0, /* Not a special function. This enumeral
5474 must have value zero; see
5475 special_function_p. */
5476 /* The following are ordered, for use by member synthesis fns. */
5477 sfk_destructor, /* A destructor. */
5478 sfk_constructor, /* A constructor. */
5479 sfk_inheriting_constructor, /* An inheriting constructor */
5480 sfk_copy_constructor, /* A copy constructor. */
5481 sfk_move_constructor, /* A move constructor. */
5482 sfk_copy_assignment, /* A copy assignment operator. */
5483 sfk_move_assignment, /* A move assignment operator. */
5484 /* The following are unordered. */
5485 sfk_complete_destructor, /* A destructor for complete objects. */
5486 sfk_base_destructor, /* A destructor for base subobjects. */
5487 sfk_deleting_destructor, /* A destructor for complete objects that
5488 deletes the object after it has been
5489 destroyed. */
5490 sfk_conversion, /* A conversion operator. */
5491 sfk_deduction_guide, /* A class template deduction guide. */
5492 sfk_comparison, /* A comparison operator (e.g. ==, <, <=>). */
5493 sfk_virtual_destructor /* Used by member synthesis fns. */
5494};
5495
5496/* The various kinds of linkage. From [basic.link],
5497
5498 A name is said to have linkage when it might denote the same
5499 object, reference, function, type, template, namespace or value
5500 as a name introduced in another scope:
5501
5502 -- When a name has external linkage, the entity it denotes can
5503 be referred to from scopes of other translation units or from
5504 other scopes of the same translation unit.
5505
5506 -- When a name has internal linkage, the entity it denotes can
5507 be referred to by names from other scopes in the same
5508 translation unit.
5509
5510 -- When a name has no linkage, the entity it denotes cannot be
5511 referred to by names from other scopes. */
5512
5513enum linkage_kind {
5514 lk_none, /* No linkage. */
5515 lk_internal, /* Internal linkage. */
5516 lk_external /* External linkage. */
5517};
5518
5519enum duration_kind {
5520 dk_static,
5521 dk_thread,
5522 dk_auto,
5523 dk_dynamic
5524};
5525
5526/* Bitmask flags to control type substitution. */
5527enum tsubst_flags {
5528 tf_none = 0, /* nothing special */
5529 tf_error = 1 << 0, /* give error messages */
5530 tf_warning = 1 << 1, /* give warnings too */
5531 tf_ignore_bad_quals = 1 << 2, /* ignore bad cvr qualifiers */
5532 tf_keep_type_decl = 1 << 3, /* retain typedef type decls
5533 (make_typename_type use) */
5534 tf_ptrmem_ok = 1 << 4, /* pointers to member ok (internal
5535 instantiate_type use) */
5536 tf_user = 1 << 5, /* found template must be a user template
5537 (lookup_template_class use) */
5538 tf_conv = 1 << 6, /* We are determining what kind of
5539 conversion might be permissible,
5540 not actually performing the
5541 conversion. */
5542 tf_decltype = 1 << 7, /* We are the operand of decltype.
5543 Used to implement the special rules
5544 for calls in decltype (5.2.2/11). */
5545 tf_partial = 1 << 8, /* Doing initial explicit argument
5546 substitution in fn_type_unification. */
5547 tf_fndecl_type = 1 << 9, /* Substituting the type of a function
5548 declaration. */
5549 tf_no_cleanup = 1 << 10, /* Do not build a cleanup
5550 (build_target_expr and friends) */
5551 tf_norm = 1 << 11, /* Build diagnostic information during
5552 constraint normalization. */
5553 tf_tst_ok = 1 << 12, /* Allow a typename-specifier to name
5554 a template (C++17 or later). */
5555 tf_dguide = 1 << 13, /* Building a deduction guide from a ctor. */
5556 /* Convenient substitution flags combinations. */
5557 tf_warning_or_error = tf_warning | tf_error
5558};
5559
5560/* This type is used for parameters and variables which hold
5561 combinations of the flags in enum tsubst_flags. */
5562typedef int tsubst_flags_t;
5563
5564/* The kind of checking we can do looking in a class hierarchy. */
5565enum base_access_flags {
5566 ba_any = 0, /* Do not check access, allow an ambiguous base,
5567 prefer a non-virtual base */
5568 ba_unique = 1 << 0, /* Must be a unique base. */
5569 ba_check_bit = 1 << 1, /* Check access. */
5570 ba_check = ba_unique | ba_check_bit,
5571 ba_ignore_scope = 1 << 2 /* Ignore access allowed by local scope. */
5572};
5573
5574/* This type is used for parameters and variables which hold
5575 combinations of the flags in enum base_access_flags. */
5576typedef int base_access;
5577
5578/* The various kinds of access check during parsing. */
5579enum deferring_kind {
5580 dk_no_deferred = 0, /* Check access immediately */
5581 dk_deferred = 1, /* Deferred check */
5582 dk_no_check = 2 /* No access check */
5583};
5584
5585/* The kind of base we can find, looking in a class hierarchy.
5586 Values <0 indicate we failed. */
5587enum base_kind {
5588 bk_inaccessible = -3, /* The base is inaccessible */
5589 bk_ambig = -2, /* The base is ambiguous */
5590 bk_not_base = -1, /* It is not a base */
5591 bk_same_type = 0, /* It is the same type */
5592 bk_proper_base = 1, /* It is a proper base */
5593 bk_via_virtual = 2 /* It is a proper base, but via a virtual
5594 path. This might not be the canonical
5595 binfo. */
5596};
5597
5598/* Node for "pointer to (virtual) function".
5599 This may be distinct from ptr_type_node so gdb can distinguish them. */
5600#define vfunc_ptr_type_node vtable_entry_type
5601
5602
5603/* For building calls to `delete'. */
5604extern GTY(()) tree integer_two_node;
5605
5606/* The number of function bodies which we are currently processing.
5607 (Zero if we are at namespace scope, one inside the body of a
5608 function, two inside the body of a function in a local class, etc.) */
5609extern int function_depth;
5610
5611/* Nonzero if we are inside spec_hasher::equal, which affects
5612 comparison of PARM_DECLs in cp_tree_equal. */
5613extern int comparing_specializations;
5614
5615/* Nonzero if we want different dependent aliases to compare as unequal.
5616 FIXME we should always do this except during deduction/ordering. */
5617extern int comparing_dependent_aliases;
5618
5619/* In parser.cc. */
5620
5621/* Nonzero if we are parsing an unevaluated operand: an operand to
5622 sizeof, typeof, or alignof. This is a count since operands to
5623 sizeof can be nested. */
5624
5625extern int cp_unevaluated_operand;
5626
5627/* RAII class used to inhibit the evaluation of operands during parsing
5628 and template instantiation. Evaluation warnings are also inhibited. */
5629
5630class cp_unevaluated
5631{
5632public:
5633 cp_unevaluated ();
5634 ~cp_unevaluated ();
5635};
5636
5637/* The reverse: an RAII class used for nested contexts that are evaluated even
5638 if the enclosing context is not. */
5639
5640class cp_evaluated
5641{
5642public:
5643 int uneval;
5644 int inhibit;
5645 cp_evaluated (bool reset = true)
5646 : uneval(cp_unevaluated_operand), inhibit(c_inhibit_evaluation_warnings)
5647 { if (reset)
5648 cp_unevaluated_operand = c_inhibit_evaluation_warnings = 0; }
5649 ~cp_evaluated ()
5650 { cp_unevaluated_operand = uneval;
5651 c_inhibit_evaluation_warnings = inhibit; }
5652};
5653
5654/* in pt.cc */
5655
5656/* These values are used for the `STRICT' parameter to type_unification and
5657 fn_type_unification. Their meanings are described with the
5658 documentation for fn_type_unification. */
5659
5660enum unification_kind_t {
5661 DEDUCE_CALL,
5662 DEDUCE_CONV,
5663 DEDUCE_EXACT
5664};
5665
5666// An RAII class used to create a new pointer map for local
5667// specializations. When the stack goes out of scope, the
5668// previous pointer map is restored.
5669enum lss_policy { lss_blank, lss_copy, lss_nop };
5670class local_specialization_stack
5671{
5672public:
5673 local_specialization_stack (lss_policy = lss_blank);
5674 ~local_specialization_stack ();
5675
5676 hash_map<tree, tree> *saved;
5677};
5678
5679/* Entry in the specialization hash table. */
5680struct GTY((for_user)) spec_entry
5681{
5682 tree tmpl; /* The general template this is a specialization of. */
5683 tree args; /* The args for this (maybe-partial) specialization. */
5684 tree spec; /* The specialization itself. */
5685};
5686
5687/* in class.cc */
5688
5689extern int current_class_depth;
5690
5691/* in decl.cc */
5692
5693/* An array of static vars & fns. */
5694extern GTY(()) vec<tree, va_gc> *static_decls;
5695
5696/* An array of vtable-needing types that have no key function, or have
5697 an emitted key function. */
5698extern GTY(()) vec<tree, va_gc> *keyed_classes;
5699
5700/* Here's where we control how name mangling takes place. */
5701
5702/* Cannot use '$' up front, because this confuses gdb
5703 (names beginning with '$' are gdb-local identifiers).
5704
5705 Note that all forms in which the '$' is significant are long enough
5706 for direct indexing (meaning that if we know there is a '$'
5707 at a particular location, we can index into the string at
5708 any other location that provides distinguishing characters). */
5709
5710/* Define NO_DOT_IN_LABEL in your favorite tm file if your assembler
5711 doesn't allow '.' in symbol names. */
5712#ifndef NO_DOT_IN_LABEL
5713
5714#define JOINER '.'
5715#define JOIN_STR "."
5716
5717#define AUTO_TEMP_NAME "_.tmp_"
5718#define VFIELD_BASE ".vf"
5719#define VFIELD_NAME "_vptr."
5720#define VFIELD_NAME_FORMAT "_vptr.%s"
5721
5722#else /* NO_DOT_IN_LABEL */
5723
5724#ifndef NO_DOLLAR_IN_LABEL
5725
5726#define JOINER '$'
5727#define JOIN_STR "$"
5728
5729#define AUTO_TEMP_NAME "_$tmp_"
5730#define VFIELD_BASE "$vf"
5731#define VFIELD_NAME "_vptr$"
5732#define VFIELD_NAME_FORMAT "_vptr$%s"
5733
5734#else /* NO_DOLLAR_IN_LABEL */
5735
5736#define JOIN_STR "_"
5737
5738#define VTABLE_NAME "__vt_"
5739#define VTABLE_NAME_P(ID_NODE) \
5740 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VTABLE_NAME, \
5741 sizeof (VTABLE_NAME) - 1))
5742#define VFIELD_BASE "__vfb"
5743#define VFIELD_NAME "__vptr_"
5744#define VFIELD_NAME_P(ID_NODE) \
5745 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, \
5746 sizeof (VFIELD_NAME) - 1))
5747#define VFIELD_NAME_FORMAT "__vptr_%s"
5748
5749#endif /* NO_DOLLAR_IN_LABEL */
5750#endif /* NO_DOT_IN_LABEL */
5751
5752#define UDLIT_OP_ANSI_PREFIX "operator\"\""
5753#define UDLIT_OP_ANSI_FORMAT UDLIT_OP_ANSI_PREFIX "%s"
5754#define UDLIT_OP_MANGLED_PREFIX "li"
5755#define UDLIT_OP_MANGLED_FORMAT UDLIT_OP_MANGLED_PREFIX "%s"
5756#define UDLIT_OPER_P(ID_NODE) \
5757 (!strncmp (IDENTIFIER_POINTER (ID_NODE), \
5758 UDLIT_OP_ANSI_PREFIX, \
5759 sizeof (UDLIT_OP_ANSI_PREFIX) - 1))
5760#define UDLIT_OP_SUFFIX(ID_NODE) \
5761 (IDENTIFIER_POINTER (ID_NODE) + sizeof (UDLIT_OP_ANSI_PREFIX) - 1)
5762
5763#if !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL)
5764
5765#define VTABLE_NAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[1] == 'v' \
5766 && IDENTIFIER_POINTER (ID_NODE)[2] == 't' \
5767 && IDENTIFIER_POINTER (ID_NODE)[3] == JOINER)
5768
5769#define VFIELD_NAME_P(ID_NODE) \
5770 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, sizeof(VFIELD_NAME)-1))
5771
5772#endif /* !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL) */
5773
5774
5775/* Nonzero if we're done parsing and into end-of-file activities.
5776 Two if we're done with front-end processing. */
5777
5778extern int at_eof;
5779
5780/* True if note_mangling_alias should enqueue mangling aliases for
5781 later generation, rather than emitting them right away. */
5782
5783extern bool defer_mangling_aliases;
5784
5785/* True if noexcept is part of the type (i.e. in C++17). */
5786
5787extern bool flag_noexcept_type;
5788
5789/* A list of namespace-scope objects which have constructors or
5790 destructors which reside in the global scope. The decl is stored
5791 in the TREE_VALUE slot and the initializer is stored in the
5792 TREE_PURPOSE slot. */
5793extern GTY(()) tree static_aggregates;
5794/* Likewise, for thread local storage. */
5795extern GTY(()) tree tls_aggregates;
5796
5797/* A hash-map mapping from variable decls to the dynamic initializer for
5798 the decl. This is currently only used by OpenMP. */
5799extern GTY(()) decl_tree_map *dynamic_initializers;
5800
5801enum overload_flags { NO_SPECIAL = 0, DTOR_FLAG, TYPENAME_FLAG };
5802
5803/* These are uses as bits in flags passed to various functions to
5804 control their behavior. Despite the LOOKUP_ prefix, many of these
5805 do not control name lookup. ??? Functions using these flags should
5806 probably be modified to accept explicit boolean flags for the
5807 behaviors relevant to them. */
5808/* Check for access violations. */
5809#define LOOKUP_PROTECT (1 << 0)
5810#define LOOKUP_NORMAL (LOOKUP_PROTECT)
5811/* Even if the function found by lookup is a virtual function, it
5812 should be called directly. */
5813#define LOOKUP_NONVIRTUAL (1 << 1)
5814/* Non-converting (i.e., "explicit") constructors are not tried. This flag
5815 indicates that we are not performing direct-initialization. */
5816#define LOOKUP_ONLYCONVERTING (1 << 2)
5817#define LOOKUP_IMPLICIT (LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING)
5818/* If a temporary is created, it should be created so that it lives
5819 as long as the current variable bindings; otherwise it only lives
5820 until the end of the complete-expression. It also forces
5821 direct-initialization in cases where other parts of the compiler
5822 have already generated a temporary, such as reference
5823 initialization and the catch parameter. */
5824#define DIRECT_BIND (1 << 3)
5825/* We're performing a user-defined conversion, so more user-defined
5826 conversions are not permitted (only built-in conversions). */
5827#define LOOKUP_NO_CONVERSION (1 << 4)
5828/* The user has explicitly called a destructor. (Therefore, we do
5829 not need to check that the object is non-NULL before calling the
5830 destructor.) */
5831#define LOOKUP_DESTRUCTOR (1 << 5)
5832/* Do not permit references to bind to temporaries. */
5833#define LOOKUP_NO_TEMP_BIND (1 << 6)
5834/* We're trying to treat an lvalue as an rvalue. */
5835/* FIXME remove when we extend the P1825 semantics to all standard modes, the
5836 C++20 approach uses IMPLICIT_RVALUE_P instead. */
5837#define LOOKUP_PREFER_RVALUE (LOOKUP_NO_TEMP_BIND << 1)
5838/* We're inside an init-list, so narrowing conversions are ill-formed. */
5839#define LOOKUP_NO_NARROWING (LOOKUP_PREFER_RVALUE << 1)
5840/* We're looking up a constructor for list-initialization. */
5841#define LOOKUP_LIST_INIT_CTOR (LOOKUP_NO_NARROWING << 1)
5842/* This is the first parameter of a copy constructor. */
5843#define LOOKUP_COPY_PARM (LOOKUP_LIST_INIT_CTOR << 1)
5844/* We only want to consider list constructors. */
5845#define LOOKUP_LIST_ONLY (LOOKUP_COPY_PARM << 1)
5846/* Return after determining which function to call and checking access.
5847 Used by sythesized_method_walk to determine which functions will
5848 be called to initialize subobjects, in order to determine exception
5849 specification and possible implicit delete.
5850 This is kind of a hack, but exiting early avoids problems with trying
5851 to perform argument conversions when the class isn't complete yet. */
5852#define LOOKUP_SPECULATIVE (LOOKUP_LIST_ONLY << 1)
5853/* Used by calls from defaulted functions to limit the overload set to avoid
5854 cycles trying to declare them (core issue 1092). */
5855#define LOOKUP_DEFAULTED (LOOKUP_SPECULATIVE << 1)
5856/* Used in calls to store_init_value to suppress its usual call to
5857 digest_init. */
5858#define LOOKUP_ALREADY_DIGESTED (LOOKUP_DEFAULTED << 1)
5859/* Like LOOKUP_NO_TEMP_BIND, but also prevent binding to xvalues. */
5860#define LOOKUP_NO_RVAL_BIND (LOOKUP_ALREADY_DIGESTED << 1)
5861/* Used by case_conversion to disregard non-integral conversions. */
5862#define LOOKUP_NO_NON_INTEGRAL (LOOKUP_NO_RVAL_BIND << 1)
5863/* Used for delegating constructors in order to diagnose self-delegation. */
5864#define LOOKUP_DELEGATING_CONS (LOOKUP_NO_NON_INTEGRAL << 1)
5865/* Allow initialization of a flexible array members. */
5866#define LOOKUP_ALLOW_FLEXARRAY_INIT (LOOKUP_DELEGATING_CONS << 1)
5867/* We're looking for either a rewritten comparison operator candidate or the
5868 operator to use on the former's result. We distinguish between the two by
5869 knowing that comparisons other than == and <=> must be the latter, as must
5870 a <=> expression trying to rewrite to <=> without reversing. */
5871#define LOOKUP_REWRITTEN (LOOKUP_ALLOW_FLEXARRAY_INIT << 1)
5872/* Reverse the order of the two arguments for comparison rewriting. First we
5873 swap the arguments in add_operator_candidates, then we swap the conversions
5874 in add_candidate (so that they correspond to the original order of the
5875 args), then we swap the conversions back in build_new_op_1 (so they
5876 correspond to the order of the args in the candidate). */
5877#define LOOKUP_REVERSED (LOOKUP_REWRITTEN << 1)
5878/* We're initializing an aggregate from a parenthesized list of values. */
5879#define LOOKUP_AGGREGATE_PAREN_INIT (LOOKUP_REVERSED << 1)
5880/* We're computing conversions as part of a first pass of overload resolution
5881 wherein we don't try to distinguish an unviable candidate from a
5882 non-strictly viable candidate and thus can avoid computing unnecessary
5883 bad conversions. */
5884#define LOOKUP_SHORTCUT_BAD_CONVS (LOOKUP_AGGREGATE_PAREN_INIT << 1)
5885
5886/* These flags are used by the conversion code.
5887 CONV_IMPLICIT : Perform implicit conversions (standard and user-defined).
5888 CONV_STATIC : Perform the explicit conversions for static_cast.
5889 CONV_CONST : Perform the explicit conversions for const_cast.
5890 CONV_REINTERPRET: Perform the explicit conversions for reinterpret_cast.
5891 CONV_PRIVATE : Perform upcasts to private bases.
5892 CONV_FORCE_TEMP : Require a new temporary when converting to the same
5893 aggregate type. */
5894
5895#define CONV_IMPLICIT 1
5896#define CONV_STATIC 2
5897#define CONV_CONST 4
5898#define CONV_REINTERPRET 8
5899#define CONV_PRIVATE 16
5900#define CONV_FORCE_TEMP 32
5901#define CONV_FOLD 64
5902#define CONV_OLD_CONVERT (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
5903 | CONV_REINTERPRET)
5904#define CONV_C_CAST (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
5905 | CONV_REINTERPRET | CONV_PRIVATE | CONV_FORCE_TEMP)
5906#define CONV_BACKEND_CONVERT (CONV_OLD_CONVERT | CONV_FOLD)
5907
5908/* Used by build_expr_type_conversion to indicate which types are
5909 acceptable as arguments to the expression under consideration. */
5910
5911#define WANT_INT 1 /* integer types, including bool */
5912#define WANT_FLOAT 2 /* floating point types */
5913#define WANT_ENUM 4 /* enumerated types */
5914#define WANT_POINTER 8 /* pointer types */
5915#define WANT_NULL 16 /* null pointer constant */
5916#define WANT_VECTOR_OR_COMPLEX 32 /* vector or complex types */
5917#define WANT_ARITH (WANT_INT | WANT_FLOAT | WANT_VECTOR_OR_COMPLEX)
5918
5919/* Used with comptypes, and related functions, to guide type
5920 comparison. */
5921
5922#define COMPARE_STRICT 0 /* Just check if the types are the
5923 same. */
5924#define COMPARE_BASE 1 /* Check to see if the second type is
5925 derived from the first. */
5926#define COMPARE_DERIVED 2 /* Like COMPARE_BASE, but in
5927 reverse. */
5928#define COMPARE_REDECLARATION 4 /* The comparison is being done when
5929 another declaration of an existing
5930 entity is seen. */
5931#define COMPARE_STRUCTURAL 8 /* The comparison is intended to be
5932 structural. The actual comparison
5933 will be identical to
5934 COMPARE_STRICT. */
5935
5936/* Used with start function. */
5937#define SF_DEFAULT 0 /* No flags. */
5938#define SF_PRE_PARSED 1 /* The function declaration has
5939 already been parsed. */
5940#define SF_INCLASS_INLINE 2 /* The function is an inline, defined
5941 in the class body. */
5942
5943/* Used with start_decl's initialized parameter. */
5944#define SD_UNINITIALIZED 0
5945#define SD_INITIALIZED 1
5946/* Like SD_INITIALIZED, but also mark the new decl as DECL_DECOMPOSITION_P. */
5947#define SD_DECOMPOSITION 2
5948#define SD_DEFAULTED 3
5949#define SD_DELETED 4
5950
5951/* Returns nonzero iff TYPE1 and TYPE2 are the same type, or if TYPE2
5952 is derived from TYPE1, or if TYPE2 is a pointer (reference) to a
5953 class derived from the type pointed to (referred to) by TYPE1. */
5954#define same_or_base_type_p(TYPE1, TYPE2) \
5955 comptypes ((TYPE1), (TYPE2), COMPARE_BASE)
5956
5957/* These macros are used to access a TEMPLATE_PARM_INDEX. */
5958#define TEMPLATE_PARM_INDEX_CAST(NODE) \
5959 ((template_parm_index*)TEMPLATE_PARM_INDEX_CHECK (NODE))
5960#define TEMPLATE_PARM_IDX(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->index)
5961#define TEMPLATE_PARM_LEVEL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->level)
5962#define TEMPLATE_PARM_DESCENDANTS(NODE) (TREE_CHAIN (NODE))
5963#define TEMPLATE_PARM_ORIG_LEVEL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->orig_level)
5964#define TEMPLATE_PARM_DECL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->decl)
5965#define TEMPLATE_PARM_PARAMETER_PACK(NODE) \
5966 (TREE_LANG_FLAG_0 (TEMPLATE_PARM_INDEX_CHECK (NODE)))
5967
5968/* These macros are for accessing the fields of TEMPLATE_TYPE_PARM,
5969 TEMPLATE_TEMPLATE_PARM and BOUND_TEMPLATE_TEMPLATE_PARM nodes. */
5970#define TEMPLATE_TYPE_PARM_INDEX(NODE) \
5971 (TYPE_VALUES_RAW (TREE_CHECK3 ((NODE), TEMPLATE_TYPE_PARM, \
5972 TEMPLATE_TEMPLATE_PARM, \
5973 BOUND_TEMPLATE_TEMPLATE_PARM)))
5974#define TEMPLATE_TYPE_IDX(NODE) \
5975 (TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (NODE)))
5976#define TEMPLATE_TYPE_LEVEL(NODE) \
5977 (TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
5978#define TEMPLATE_TYPE_ORIG_LEVEL(NODE) \
5979 (TEMPLATE_PARM_ORIG_LEVEL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
5980#define TEMPLATE_TYPE_DECL(NODE) \
5981 (TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
5982#define TEMPLATE_TYPE_PARAMETER_PACK(NODE) \
5983 (TEMPLATE_PARM_PARAMETER_PACK (TEMPLATE_TYPE_PARM_INDEX (NODE)))
5984
5985/* For a C++17 class deduction placeholder, the template it represents. */
5986#define CLASS_PLACEHOLDER_TEMPLATE(NODE) \
5987 (DECL_INITIAL (TYPE_NAME (TEMPLATE_TYPE_PARM_CHECK (NODE))))
5988
5989/* Contexts in which auto deduction occurs. These flags are
5990 used to control diagnostics in do_auto_deduction. */
5991
5992enum auto_deduction_context
5993{
5994 adc_unspecified, /* Not given */
5995 adc_variable_type, /* Variable initializer deduction */
5996 adc_return_type, /* Return type deduction */
5997 adc_unify, /* Template argument deduction */
5998 adc_requirement, /* Argument deduction constraint */
5999 adc_decomp_type /* Decomposition declaration initializer deduction */
6000};
6001
6002/* True iff this TEMPLATE_TYPE_PARM represents decltype(auto). */
6003#define AUTO_IS_DECLTYPE(NODE) \
6004 (TYPE_LANG_FLAG_5 (TEMPLATE_TYPE_PARM_CHECK (NODE)))
6005
6006/* These constants can used as bit flags in the process of tree formatting.
6007
6008 TFF_PLAIN_IDENTIFIER: unqualified part of a name.
6009 TFF_SCOPE: include the class and namespace scope of the name.
6010 TFF_CHASE_TYPEDEF: print the original type-id instead of the typedef-name.
6011 TFF_DECL_SPECIFIERS: print decl-specifiers.
6012 TFF_CLASS_KEY_OR_ENUM: precede a class-type name (resp. enum name) with
6013 a class-key (resp. `enum').
6014 TFF_RETURN_TYPE: include function return type.
6015 TFF_FUNCTION_DEFAULT_ARGUMENTS: include function default parameter values.
6016 TFF_EXCEPTION_SPECIFICATION: show function exception specification.
6017 TFF_TEMPLATE_HEADER: show the template<...> header in a
6018 template-declaration.
6019 TFF_TEMPLATE_NAME: show only template-name.
6020 TFF_EXPR_IN_PARENS: parenthesize expressions.
6021 TFF_NO_FUNCTION_ARGUMENTS: don't show function arguments.
6022 TFF_UNQUALIFIED_NAME: do not print the qualifying scope of the
6023 top-level entity.
6024 TFF_NO_OMIT_DEFAULT_TEMPLATE_ARGUMENTS: do not omit template arguments
6025 identical to their defaults.
6026 TFF_NO_TEMPLATE_BINDINGS: do not print information about the template
6027 arguments for a function template specialization.
6028 TFF_POINTER: we are printing a pointer type. */
6029
6030#define TFF_PLAIN_IDENTIFIER (0)
6031#define TFF_SCOPE (1)
6032#define TFF_CHASE_TYPEDEF (1 << 1)
6033#define TFF_DECL_SPECIFIERS (1 << 2)
6034#define TFF_CLASS_KEY_OR_ENUM (1 << 3)
6035#define TFF_RETURN_TYPE (1 << 4)
6036#define TFF_FUNCTION_DEFAULT_ARGUMENTS (1 << 5)
6037#define TFF_EXCEPTION_SPECIFICATION (1 << 6)
6038#define TFF_TEMPLATE_HEADER (1 << 7)
6039#define TFF_TEMPLATE_NAME (1 << 8)
6040#define TFF_EXPR_IN_PARENS (1 << 9)
6041#define TFF_NO_FUNCTION_ARGUMENTS (1 << 10)
6042#define TFF_UNQUALIFIED_NAME (1 << 11)
6043#define TFF_NO_OMIT_DEFAULT_TEMPLATE_ARGUMENTS (1 << 12)
6044#define TFF_NO_TEMPLATE_BINDINGS (1 << 13)
6045#define TFF_POINTER (1 << 14)
6046
6047/* These constants can be used as bit flags to control strip_typedefs.
6048
6049 STF_USER_VISIBLE: use heuristics to try to avoid stripping user-facing
6050 aliases of internal details. This is intended for diagnostics,
6051 where it should (for example) give more useful "aka" types.
6052
6053 STF_STRIP_DEPENDENT: allow the stripping of aliases with dependent
6054 template parameters, relying on code elsewhere to report any
6055 appropriate diagnostics. */
6056const unsigned int STF_USER_VISIBLE = 1U;
6057const unsigned int STF_STRIP_DEPENDENT = 1U << 1;
6058
6059/* Returns the TEMPLATE_DECL associated to a TEMPLATE_TEMPLATE_PARM
6060 node. */
6061#define TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL(NODE) \
6062 ((TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM) \
6063 ? TYPE_TI_TEMPLATE (NODE) \
6064 : TYPE_NAME (NODE))
6065
6066/* in lex.cc */
6067
6068extern void init_reswords (void);
6069
6070/* Various flags for the overloaded operator information. */
6071enum ovl_op_flags {
6072 OVL_OP_FLAG_NONE = 0, /* Don't care. */
6073 OVL_OP_FLAG_UNARY = 1, /* Is unary. */
6074 OVL_OP_FLAG_BINARY = 2, /* Is binary. */
6075 OVL_OP_FLAG_AMBIARY = 3, /* May be unary or binary. */
6076 OVL_OP_FLAG_ALLOC = 4, /* operator new or delete. */
6077 OVL_OP_FLAG_DELETE = 1, /* operator delete. */
6078 OVL_OP_FLAG_VEC = 2 /* vector new or delete. */
6079};
6080
6081/* Compressed operator codes. Order is determined by operators.def
6082 and does not match that of tree_codes. */
6083enum ovl_op_code {
6084 OVL_OP_ERROR_MARK,
6085 OVL_OP_NOP_EXPR,
6086#define DEF_OPERATOR(NAME, CODE, MANGLING, FLAGS) OVL_OP_##CODE,
6087#define DEF_ASSN_OPERATOR(NAME, CODE, MANGLING) /* NOTHING */
6088#include "operators.def"
6089 OVL_OP_MAX
6090};
6091
6092/* Make sure it fits in lang_decl_fn::ovl_op_code. */
6093STATIC_ASSERT (OVL_OP_MAX < (1 << 6));
6094
6095struct GTY(()) ovl_op_info_t {
6096 /* The IDENTIFIER_NODE for the operator. */
6097 tree identifier;
6098 /* The name of the operator. */
6099 const char *name;
6100 /* The mangled name of the operator. */
6101 const char *mangled_name;
6102 /* The (regular) tree code. */
6103 enum tree_code tree_code : 16;
6104 /* The (compressed) operator code. */
6105 enum ovl_op_code ovl_op_code : 8;
6106 /* The ovl_op_flags of the operator */
6107 unsigned flags : 8;
6108};
6109
6110/* Overloaded operator info indexed by ass_op_p & ovl_op_code. */
6111extern GTY(()) ovl_op_info_t ovl_op_info[2][OVL_OP_MAX];
6112/* Mapping from tree_codes to ovl_op_codes. */
6113extern GTY(()) unsigned char ovl_op_mapping[MAX_TREE_CODES];
6114/* Mapping for ambi-ary operators from the binary to the unary. */
6115extern GTY(()) unsigned char ovl_op_alternate[OVL_OP_MAX];
6116
6117/* Given an ass_op_p boolean and a tree code, return a pointer to its
6118 overloaded operator info. Tree codes for non-overloaded operators
6119 map to the error-operator. */
6120#define OVL_OP_INFO(IS_ASS_P, TREE_CODE) \
6121 (&ovl_op_info[(IS_ASS_P) != 0][ovl_op_mapping[(TREE_CODE)]])
6122/* Overloaded operator info for an identifier for which
6123 IDENTIFIER_OVL_OP_P is true. */
6124#define IDENTIFIER_OVL_OP_INFO(NODE) \
6125 (&ovl_op_info[IDENTIFIER_KIND_BIT_0 (NODE)][IDENTIFIER_CP_INDEX (NODE)])
6126#define IDENTIFIER_OVL_OP_FLAGS(NODE) \
6127 (IDENTIFIER_OVL_OP_INFO (NODE)->flags)
6128
6129inline tree ovl_op_identifier (bool isass, tree_code code)
6130{ return OVL_OP_INFO(isass, code)->identifier; }
6131inline tree ovl_op_identifier (tree_code code) { return ovl_op_identifier (false, code); }
6132#define assign_op_identifier (ovl_op_info[true][OVL_OP_NOP_EXPR].identifier)
6133#define call_op_identifier (ovl_op_info[false][OVL_OP_CALL_EXPR].identifier)
6134
6135/* A type-qualifier, or bitmask therefore, using the TYPE_QUAL
6136 constants. */
6137
6138typedef int cp_cv_quals;
6139
6140/* Non-static member functions have an optional virt-specifier-seq.
6141 There is a VIRT_SPEC value for each virt-specifier.
6142 They can be combined by bitwise-or to form the complete set of
6143 virt-specifiers for a member function. */
6144enum virt_specifier
6145 {
6146 VIRT_SPEC_UNSPECIFIED = 0x0,
6147 VIRT_SPEC_FINAL = 0x1,
6148 VIRT_SPEC_OVERRIDE = 0x2
6149 };
6150
6151/* A type-qualifier, or bitmask therefore, using the VIRT_SPEC
6152 constants. */
6153
6154typedef int cp_virt_specifiers;
6155
6156/* Wherever there is a function-cv-qual, there could also be a ref-qualifier:
6157
6158 [dcl.fct]
6159 The return type, the parameter-type-list, the ref-qualifier, and
6160 the cv-qualifier-seq, but not the default arguments or the exception
6161 specification, are part of the function type.
6162
6163 REF_QUAL_NONE Ordinary member function with no ref-qualifier
6164 REF_QUAL_LVALUE Member function with the &-ref-qualifier
6165 REF_QUAL_RVALUE Member function with the &&-ref-qualifier */
6166
6167enum cp_ref_qualifier {
6168 REF_QUAL_NONE = 0,
6169 REF_QUAL_LVALUE = 1,
6170 REF_QUAL_RVALUE = 2
6171};
6172
6173/* A storage class. */
6174
6175enum cp_storage_class {
6176 /* sc_none must be zero so that zeroing a cp_decl_specifier_seq
6177 sets the storage_class field to sc_none. */
6178 sc_none = 0,
6179 sc_auto,
6180 sc_register,
6181 sc_static,
6182 sc_extern,
6183 sc_mutable
6184};
6185
6186/* An individual decl-specifier. This is used to index the array of
6187 locations for the declspecs in struct cp_decl_specifier_seq
6188 below. */
6189
6190enum cp_decl_spec {
6191 ds_first,
6192 ds_signed = ds_first,
6193 ds_unsigned,
6194 ds_short,
6195 ds_long,
6196 ds_const,
6197 ds_volatile,
6198 ds_restrict,
6199 ds_inline,
6200 ds_virtual,
6201 ds_explicit,
6202 ds_friend,
6203 ds_typedef,
6204 ds_alias,
6205 ds_constexpr,
6206 ds_complex,
6207 ds_constinit,
6208 ds_consteval,
6209 ds_thread,
6210 ds_type_spec,
6211 ds_redefined_builtin_type_spec,
6212 ds_attribute,
6213 ds_std_attribute,
6214 ds_storage_class,
6215 ds_long_long,
6216 ds_concept,
6217 ds_last /* This enumerator must always be the last one. */
6218};
6219
6220/* A decl-specifier-seq. */
6221
6222struct cp_decl_specifier_seq {
6223 /* An array of locations for the declaration sepecifiers, indexed by
6224 enum cp_decl_spec_word. */
6225 location_t locations[ds_last];
6226 /* The primary type, if any, given by the decl-specifier-seq.
6227 Modifiers, like "short", "const", and "unsigned" are not
6228 reflected here. This field will be a TYPE, unless a typedef-name
6229 was used, in which case it will be a TYPE_DECL. */
6230 tree type;
6231 /* The attributes, if any, provided with the specifier sequence. */
6232 tree attributes;
6233 /* The c++11 attributes that follows the type specifier. */
6234 tree std_attributes;
6235 /* If non-NULL, a built-in type that the user attempted to redefine
6236 to some other type. */
6237 tree redefined_builtin_type;
6238 /* The explicit-specifier, if any. */
6239 tree explicit_specifier;
6240 /* The storage class specified -- or sc_none if no storage class was
6241 explicitly specified. */
6242 cp_storage_class storage_class;
6243 /* For the __intN declspec, this stores the index into the int_n_* arrays. */
6244 int int_n_idx;
6245 /* True iff TYPE_SPEC defines a class or enum. */
6246 BOOL_BITFIELD type_definition_p : 1;
6247 /* True iff multiple types were (erroneously) specified for this
6248 decl-specifier-seq. */
6249 BOOL_BITFIELD multiple_types_p : 1;
6250 /* True iff multiple storage classes were (erroneously) specified
6251 for this decl-specifier-seq or a combination of a storage class
6252 with a typedef specifier. */
6253 BOOL_BITFIELD conflicting_specifiers_p : 1;
6254 /* True iff at least one decl-specifier was found. */
6255 BOOL_BITFIELD any_specifiers_p : 1;
6256 /* True iff at least one type-specifier was found. */
6257 BOOL_BITFIELD any_type_specifiers_p : 1;
6258 /* True iff "int" was explicitly provided. */
6259 BOOL_BITFIELD explicit_int_p : 1;
6260 /* True iff "__intN" was explicitly provided. */
6261 BOOL_BITFIELD explicit_intN_p : 1;
6262 /* True iff "char" was explicitly provided. */
6263 BOOL_BITFIELD explicit_char_p : 1;
6264 /* True iff ds_thread is set for __thread, not thread_local. */
6265 BOOL_BITFIELD gnu_thread_keyword_p : 1;
6266 /* True iff the type is a decltype. */
6267 BOOL_BITFIELD decltype_p : 1;
6268 /* True iff the alternate "__intN__" form of the __intN type has been
6269 used. */
6270 BOOL_BITFIELD int_n_alt: 1;
6271};
6272
6273/* The various kinds of declarators. */
6274
6275enum cp_declarator_kind {
6276 cdk_id,
6277 cdk_function,
6278 cdk_array,
6279 cdk_pointer,
6280 cdk_reference,
6281 cdk_ptrmem,
6282 cdk_decomp,
6283 cdk_error
6284};
6285
6286/* A declarator. */
6287
6288typedef struct cp_declarator cp_declarator;
6289
6290typedef struct cp_parameter_declarator cp_parameter_declarator;
6291
6292/* A parameter, before it has been semantically analyzed. */
6293struct cp_parameter_declarator {
6294 /* The next parameter, or NULL_TREE if none. */
6295 cp_parameter_declarator *next;
6296 /* The decl-specifiers-seq for the parameter. */
6297 cp_decl_specifier_seq decl_specifiers;
6298 /* The declarator for the parameter. */
6299 cp_declarator *declarator;
6300 /* The default-argument expression, or NULL_TREE, if none. */
6301 tree default_argument;
6302 /* True iff this is a template parameter pack. */
6303 bool template_parameter_pack_p;
6304 /* Location within source. */
6305 location_t loc;
6306};
6307
6308/* A declarator. */
6309struct cp_declarator {
6310 /* The kind of declarator. */
6311 ENUM_BITFIELD (cp_declarator_kind) kind : 4;
6312 /* Whether we parsed an ellipsis (`...') just before the declarator,
6313 to indicate this is a parameter pack. */
6314 BOOL_BITFIELD parameter_pack_p : 1;
6315 /* If this declarator is parenthesized, this the open-paren. It is
6316 UNKNOWN_LOCATION when not parenthesized. */
6317 location_t parenthesized;
6318 /* Currently only set for cdk_id, cdk_decomp and cdk_function. */
6319 location_t id_loc;
6320 /* If this declarator is part of an init-declarator, the location of the
6321 initializer. */
6322 location_t init_loc;
6323 /* GNU Attributes that apply to this declarator. If the declarator
6324 is a pointer or a reference, these attribute apply to the type
6325 pointed to. */
6326 tree attributes;
6327 /* Standard C++11 attributes that apply to this declarator. If the
6328 declarator is a pointer or a reference, these attributes apply
6329 to the pointer, rather than to the type pointed to. */
6330 tree std_attributes;
6331 /* For all but cdk_id, cdk_decomp and cdk_error, the contained declarator.
6332 For cdk_id, cdk_decomp and cdk_error, guaranteed to be NULL. */
6333 cp_declarator *declarator;
6334 union {
6335 /* For identifiers. */
6336 struct {
6337 /* If non-NULL, the qualifying scope (a NAMESPACE_DECL or
6338 *_TYPE) for this identifier. */
6339 tree qualifying_scope;
6340 /* The unqualified name of the entity -- an IDENTIFIER_NODE,
6341 BIT_NOT_EXPR, or TEMPLATE_ID_EXPR. */
6342 tree unqualified_name;
6343 /* If this is the name of a function, what kind of special
6344 function (if any). */
6345 special_function_kind sfk;
6346 } id;
6347 /* For functions. */
6348 struct {
6349 /* The parameters to the function as a TREE_LIST of decl/default. */
6350 tree parameters;
6351 /* The cv-qualifiers for the function. */
6352 cp_cv_quals qualifiers;
6353 /* The virt-specifiers for the function. */
6354 cp_virt_specifiers virt_specifiers;
6355 /* The ref-qualifier for the function. */
6356 cp_ref_qualifier ref_qualifier;
6357 /* The transaction-safety qualifier for the function. */
6358 tree tx_qualifier;
6359 /* The exception-specification for the function. */
6360 tree exception_specification;
6361 /* The late-specified return type, if any. */
6362 tree late_return_type;
6363 /* The trailing requires-clause, if any. */
6364 tree requires_clause;
6365 location_t parens_loc;
6366 } function;
6367 /* For arrays. */
6368 struct {
6369 /* The bounds to the array. */
6370 tree bounds;
6371 } array;
6372 /* For cdk_pointer and cdk_ptrmem. */
6373 struct {
6374 /* The cv-qualifiers for the pointer. */
6375 cp_cv_quals qualifiers;
6376 /* For cdk_ptrmem, the class type containing the member. */
6377 tree class_type;
6378 } pointer;
6379 /* For cdk_reference */
6380 struct {
6381 /* The cv-qualifiers for the reference. These qualifiers are
6382 only used to diagnose ill-formed code. */
6383 cp_cv_quals qualifiers;
6384 /* Whether this is an rvalue reference */
6385 bool rvalue_ref;
6386 } reference;
6387 } u;
6388};
6389
6390/* A level of template instantiation. */
6391struct GTY((chain_next ("%h.next"))) tinst_level {
6392 /* The immediately deeper level in the chain. */
6393 struct tinst_level *next;
6394
6395 /* The original node. TLDCL can be a DECL (for a function or static
6396 data member), a TYPE (for a class), depending on what we were
6397 asked to instantiate, or a TREE_LIST with the template as PURPOSE
6398 and the template args as VALUE, if we are substituting for
6399 overload resolution. In all these cases, TARGS is NULL.
6400 However, to avoid creating TREE_LIST objects for substitutions if
6401 we can help, we store PURPOSE and VALUE in TLDCL and TARGS,
6402 respectively. So TLDCL stands for TREE_LIST or DECL (the
6403 template is a DECL too), whereas TARGS stands for the template
6404 arguments. */
6405 tree tldcl, targs;
6406
6407 /* For modules we need to know (a) the modules on the path of
6408 instantiation and (b) the transitive imports along that path.
6409 Note that these two bitmaps may be inherited from NEXT, if this
6410 decl is in the same module as NEXT (or has no new information). */
6411 bitmap path;
6412 bitmap visible;
6413
6414 private:
6415 /* Return TRUE iff the original node is a split list. */
6416 bool split_list_p () const { return targs; }
6417
6418 /* Return TRUE iff the original node is a TREE_LIST object. */
6419 bool tree_list_p () const
6420 {
6421 return !split_list_p () && TREE_CODE (tldcl) == TREE_LIST;
6422 }
6423
6424 /* Return TRUE iff the original node is not a list, split or not. */
6425 bool not_list_p () const
6426 {
6427 return !split_list_p () && !tree_list_p ();
6428 }
6429
6430 /* Convert (in place) the original node from a split list to a
6431 TREE_LIST. */
6432 tree to_list ();
6433
6434 public:
6435 /* Release storage for OBJ and node, if it's a TREE_LIST. */
6436 static void free (tinst_level *obj);
6437
6438 /* Return TRUE iff the original node is a list, split or not. */
6439 bool list_p () const { return !not_list_p (); }
6440
6441 /* Return the original node; if it's a split list, make it a
6442 TREE_LIST first, so that it can be returned as a single tree
6443 object. */
6444 tree get_node () {
6445 if (!split_list_p ()) return tldcl;
6446 else return to_list ();
6447 }
6448
6449 /* Return the original node if it's a DECL or a TREE_LIST, but do
6450 NOT convert a split list to a TREE_LIST: return NULL instead. */
6451 tree maybe_get_node () const {
6452 if (!split_list_p ()) return tldcl;
6453 else return NULL_TREE;
6454 }
6455
6456 /* The location where the template is instantiated. */
6457 location_t locus;
6458
6459 /* errorcount + sorrycount when we pushed this level. */
6460 unsigned short errors;
6461
6462 /* Count references to this object. If refcount reaches
6463 refcount_infinity value, we don't increment or decrement the
6464 refcount anymore, as the refcount isn't accurate anymore.
6465 The object can be still garbage collected if unreferenced from
6466 anywhere, which might keep referenced objects referenced longer than
6467 otherwise necessary. Hitting the infinity is rare though. */
6468 unsigned short refcount;
6469
6470 /* Infinity value for the above refcount. */
6471 static const unsigned short refcount_infinity = (unsigned short) ~0;
6472};
6473
6474/* BUILT_IN_FRONTEND function codes. */
6475enum cp_built_in_function {
6476 CP_BUILT_IN_IS_CONSTANT_EVALUATED,
6477 CP_BUILT_IN_INTEGER_PACK,
6478 CP_BUILT_IN_IS_CORRESPONDING_MEMBER,
6479 CP_BUILT_IN_IS_POINTER_INTERCONVERTIBLE_WITH_CLASS,
6480 CP_BUILT_IN_SOURCE_LOCATION,
6481 CP_BUILT_IN_LAST
6482};
6483
6484bool decl_spec_seq_has_spec_p (const cp_decl_specifier_seq *, cp_decl_spec);
6485
6486/* Return the type of the `this' parameter of FNTYPE. */
6487
6488inline tree
6489type_of_this_parm (const_tree fntype)
6490{
6491 function_args_iterator iter;
6492 gcc_assert (TREE_CODE (fntype) == METHOD_TYPE);
6493 function_args_iter_init (&iter, fntype);
6494 return function_args_iter_cond (&iter);
6495}
6496
6497/* Return the class of the `this' parameter of FNTYPE. */
6498
6499inline tree
6500class_of_this_parm (const_tree fntype)
6501{
6502 return TREE_TYPE (type_of_this_parm (fntype));
6503}
6504
6505/* A parameter list indicating for a function with no parameters,
6506 e.g "int f(void)". */
6507extern cp_parameter_declarator *no_parameters;
6508
6509/* Various dump ids. */
6510extern int class_dump_id;
6511extern int module_dump_id;
6512extern int raw_dump_id;
6513
6514/* in call.cc */
6515extern bool check_dtor_name (tree, tree);
6516int magic_varargs_p (tree);
6517
6518extern tree build_conditional_expr (const op_location_t &,
6519 tree, tree, tree,
6520 tsubst_flags_t);
6521extern tree build_addr_func (tree, tsubst_flags_t);
6522extern void set_flags_from_callee (tree);
6523extern tree build_call_a (tree, int, tree*);
6524extern tree build_call_n (tree, int, ...);
6525extern bool null_ptr_cst_p (tree);
6526extern bool null_member_pointer_value_p (tree);
6527extern bool sufficient_parms_p (const_tree);
6528extern tree type_decays_to (tree);
6529extern tree extract_call_expr (tree);
6530extern tree build_trivial_dtor_call (tree, bool = false);
6531extern tristate ref_conv_binds_directly (tree, tree, bool = false);
6532extern tree build_user_type_conversion (tree, tree, int,
6533 tsubst_flags_t);
6534extern tree build_new_function_call (tree, vec<tree, va_gc> **,
6535 tsubst_flags_t);
6536extern tree build_operator_new_call (tree, vec<tree, va_gc> **,
6537 tree *, tree *, tree, tree,
6538 tree *, tsubst_flags_t);
6539extern tree build_new_method_call (tree, tree,
6540 vec<tree, va_gc> **, tree,
6541 int, tree *, tsubst_flags_t);
6542extern tree build_special_member_call (tree, tree,
6543 vec<tree, va_gc> **,
6544 tree, int, tsubst_flags_t);
6545extern tree build_new_op (const op_location_t &,
6546 enum tree_code,
6547 int, tree, tree, tree, tree,
6548 tree *, tsubst_flags_t);
6549/* Wrapper that leaves out the usually-null op3 and overload parms. */
6550inline tree build_new_op (const op_location_t &loc, enum tree_code code,
6551 int flags, tree arg1, tree arg2,
6552 tsubst_flags_t complain)
6553{
6554 return build_new_op (loc, code, flags, arg1, arg2, NULL_TREE, NULL_TREE,
6555 NULL, complain);
6556}
6557extern tree build_op_call (tree, vec<tree, va_gc> **,
6558 tsubst_flags_t);
6559extern tree build_op_subscript (const op_location_t &, tree,
6560 vec<tree, va_gc> **, tree *,
6561 tsubst_flags_t);
6562extern bool aligned_allocation_fn_p (tree);
6563extern tree destroying_delete_p (tree);
6564extern bool usual_deallocation_fn_p (tree);
6565extern tree build_op_delete_call (enum tree_code, tree, tree,
6566 bool, tree, tree,
6567 tsubst_flags_t);
6568extern bool can_convert (tree, tree, tsubst_flags_t);
6569extern bool can_convert_standard (tree, tree, tsubst_flags_t);
6570extern bool can_convert_arg (tree, tree, tree, int,
6571 tsubst_flags_t);
6572extern bool can_convert_arg_bad (tree, tree, tree, int,
6573 tsubst_flags_t);
6574extern int conv_flags (int, int, tree, tree, int);
6575extern struct conversion * good_conversion (tree, tree, tree, int, tsubst_flags_t);
6576extern location_t get_fndecl_argument_location (tree, int);
6577extern void complain_about_bad_argument (location_t arg_loc,
6578 tree from_type, tree to_type,
6579 tree fndecl, int parmnum);
6580extern void maybe_inform_about_fndecl_for_bogus_argument_init (tree, int);
6581extern tree perform_dguide_overload_resolution (tree, const vec<tree, va_gc> *,
6582 tsubst_flags_t);
6583
6584
6585/* A class for recording information about access failures (e.g. private
6586 fields), so that we can potentially supply a fix-it hint about
6587 an accessor (from a context in which the constness of the object
6588 is known). */
6589
6590class access_failure_info
6591{
6592 public:
6593 access_failure_info () : m_was_inaccessible (false),
6594 m_basetype_path (NULL_TREE),
6595 m_decl (NULL_TREE), m_diag_decl (NULL_TREE) {}
6596
6597 void record_access_failure (tree basetype_path, tree decl, tree diag_decl);
6598
6599 bool was_inaccessible_p () const { return m_was_inaccessible; }
6600 tree get_decl () const { return m_decl; }
6601 tree get_diag_decl () const { return m_diag_decl; }
6602 tree get_any_accessor (bool const_p) const;
6603 void maybe_suggest_accessor (bool const_p) const;
6604 static void add_fixit_hint (rich_location *richloc, tree accessor);
6605
6606 private:
6607 bool m_was_inaccessible;
6608 tree m_basetype_path;
6609 tree m_decl;
6610 tree m_diag_decl;
6611};
6612
6613extern void complain_about_access (tree, tree, tree, bool,
6614 access_kind);
6615extern void push_defarg_context (tree);
6616extern void pop_defarg_context (void);
6617extern tree convert_default_arg (tree, tree, tree, int,
6618 tsubst_flags_t);
6619extern tree convert_arg_to_ellipsis (tree, tsubst_flags_t);
6620extern tree build_x_va_arg (location_t, tree, tree);
6621extern tree cxx_type_promotes_to (tree);
6622extern tree type_passed_as (tree);
6623extern tree convert_for_arg_passing (tree, tree, tsubst_flags_t);
6624extern bool is_properly_derived_from (tree, tree);
6625extern tree initialize_reference (tree, tree, int,
6626 tsubst_flags_t);
6627extern tree extend_ref_init_temps (tree, tree,
6628 vec<tree, va_gc>**,
6629 tree * = NULL);
6630extern tree make_temporary_var_for_ref_to_temp (tree, tree);
6631extern bool type_has_extended_temps (tree);
6632extern tree strip_top_quals (tree);
6633extern bool reference_related_p (tree, tree);
6634extern bool reference_compatible_p (tree, tree);
6635extern int remaining_arguments (tree);
6636extern tree build_implicit_conv_flags (tree, tree, int);
6637extern tree perform_implicit_conversion (tree, tree, tsubst_flags_t);
6638extern tree perform_implicit_conversion_flags (tree, tree, tsubst_flags_t, int);
6639extern tree build_converted_constant_expr (tree, tree, tsubst_flags_t);
6640extern tree build_converted_constant_bool_expr (tree, tsubst_flags_t);
6641extern tree perform_direct_initialization_if_possible (tree, tree, bool,
6642 tsubst_flags_t);
6643extern vec<tree,va_gc> *resolve_args (vec<tree,va_gc>*, tsubst_flags_t);
6644extern tree in_charge_arg_for_name (tree);
6645extern bool in_immediate_context ();
6646extern tree build_cxx_call (tree, int, tree *,
6647 tsubst_flags_t,
6648 tree = NULL_TREE);
6649extern bool is_std_init_list (tree);
6650extern bool is_list_ctor (tree);
6651extern void validate_conversion_obstack (void);
6652extern void mark_versions_used (tree);
6653extern int unsafe_return_slot_p (tree);
6654extern bool make_safe_copy_elision (tree, tree);
6655extern bool cp_handle_deprecated_or_unavailable (tree, tsubst_flags_t = tf_warning_or_error);
6656extern void cp_warn_deprecated_use_scopes (tree);
6657extern tree get_function_version_dispatcher (tree);
6658extern bool any_template_arguments_need_structural_equality_p (tree);
6659
6660/* in class.cc */
6661extern tree build_vfield_ref (tree, tree);
6662extern tree build_if_in_charge (tree true_stmt, tree false_stmt = void_node);
6663extern tree build_base_path (enum tree_code, tree,
6664 tree, int, tsubst_flags_t);
6665extern tree convert_to_base (tree, tree, bool, bool,
6666 tsubst_flags_t);
6667extern tree convert_to_base_statically (tree, tree);
6668extern bool is_empty_base_ref (tree);
6669extern tree build_vtbl_ref (tree, tree);
6670extern tree build_vfn_ref (tree, tree);
6671extern tree get_vtable_decl (tree, int);
6672extern bool add_method (tree, tree, bool);
6673extern tree declared_access (tree);
6674extern bool maybe_push_used_methods (tree);
6675extern tree currently_open_class (tree);
6676extern tree