1 /* Definitions for C++ parsing and type checking.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
29 #include "splay-tree.h"
33 #error "You should be using 'make bootstrap' -- see installation instructions"
38 struct diagnostic_context;
40 /* Usage of TREE_LANG_FLAG_?:
41 0: BINFO_MARKED (BINFO nodes).
42 IDENTIFIER_MARKED (IDENTIFIER_NODEs)
43 NEW_EXPR_USE_GLOBAL (in NEW_EXPR).
44 DELETE_EXPR_USE_GLOBAL (in DELETE_EXPR).
45 LOOKUP_EXPR_GLOBAL (in LOOKUP_EXPR).
46 TREE_INDIRECT_USING (in NAMESPACE_DECL).
47 LOCAL_BINDING_P (in CPLUS_BINDING)
48 ICS_USER_FLAG (in _CONV)
49 CLEANUP_P (in TRY_BLOCK)
50 AGGR_INIT_VIA_CTOR_P (in AGGR_INIT_EXPR)
51 PTRMEM_OK_P (in ADDR_EXPR, OFFSET_REF)
52 PARMLIST_ELLIPSIS_P (in PARMLIST)
53 1: IDENTIFIER_VIRTUAL_P.
54 TI_PENDING_TEMPLATE_FLAG.
55 TEMPLATE_PARMS_FOR_INLINE.
56 DELETE_EXPR_USE_VEC (in DELETE_EXPR).
57 (TREE_CALLS_NEW) (in _EXPR or _REF) (commented-out).
58 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (in _TYPE).
59 INHERITED_VALUE_BINDING_P (in CPLUS_BINDING)
60 ICS_ELLIPSIS_FLAG (in _CONV)
61 BINFO_DEPENDENT_BASE_P (in BINFO)
62 DECL_INITIALIZED_P (in VAR_DECL)
63 2: IDENTIFIER_OPNAME_P.
64 TYPE_POLYMORPHIC_P (in _TYPE)
65 ICS_THIS_FLAG (in _CONV)
66 BINDING_HAS_LEVEL_P (in CPLUS_BINDING)
67 BINFO_LOST_PRIMARY_P (in BINFO)
68 TREE_PARMLIST (in TREE_LIST)
69 3: TYPE_USES_VIRTUAL_BASECLASSES (in a class TYPE).
70 BINFO_VTABLE_PATH_MARKED.
71 BINFO_PUSHDECLS_MARKED.
72 (TREE_REFERENCE_EXPR) (in NON_LVALUE_EXPR) (commented-out).
73 ICS_BAD_FLAG (in _CONV)
74 FN_TRY_BLOCK_P (in TRY_BLOCK)
75 IDENTIFIER_CTOR_OR_DTOR_P (in IDENTIFIER_NODE)
76 4: BINFO_NEW_VTABLE_MARKED.
77 TREE_HAS_CONSTRUCTOR (in INDIRECT_REF, SAVE_EXPR, CONSTRUCTOR,
79 NEED_TEMPORARY_P (in REF_BIND, BASE_CONV)
80 IDENTIFIER_TYPENAME_P (in IDENTIFIER_NODE)
81 5: C_IS_RESERVED_WORD (in IDENTIFIER_NODE)
82 6: For future expansion
84 Usage of TYPE_LANG_FLAG_?:
86 1: TYPE_HAS_CONSTRUCTOR.
87 2: TYPE_HAS_DESTRUCTOR.
89 4: TYPE_HAS_NONTRIVIAL_DESTRUCTOR
91 6: TYPE_DEPENDENT_P_VALID
93 Usage of DECL_LANG_FLAG_?:
94 0: DECL_ERROR_REPORTED (in VAR_DECL).
95 DECL_TEMPLATE_PARM_P (in PARM_DECL, CONST_DECL, TYPE_DECL, or TEMPLATE_DECL)
96 DECL_LOCAL_FUNCTION_P (in FUNCTION_DECL)
97 DECL_MUTABLE_P (in FIELD_DECL)
98 1: C_TYPEDEF_EXPLICITLY_SIGNED (in TYPE_DECL).
99 DECL_TEMPLATE_INSTANTIATED (in a VAR_DECL or a FUNCTION_DECL)
100 2: DECL_THIS_EXTERN (in VAR_DECL or FUNCTION_DECL).
101 DECL_IMPLICIT_TYPEDEF_P (in a TYPE_DECL)
103 4: DECL_C_BIT_FIELD (in a FIELD_DECL)
104 DECL_MAYBE_TEMPLATE (in a FUNCTION_DECL)
105 5: DECL_INTERFACE_KNOWN.
106 6: DECL_THIS_STATIC (in VAR_DECL or FUNCTION_DECL).
107 7: DECL_DEAD_FOR_LOCAL (in VAR_DECL).
108 DECL_THUNK_P (in a member FUNCTION_DECL)
110 Usage of language-independent fields in a language-dependent manner:
113 This field is BINFO_INDIRECT_PRIMARY_P in a BINFO.
116 This field is used by TYPENAME_TYPEs, TEMPLATE_TYPE_PARMs, and so
117 forth as a substitute for the mark bits provided in `lang_type'.
118 At present, only the six low-order bits are used.
121 For an ENUMERAL_TYPE, this is ENUM_TEMPLATE_INFO.
122 For a FUNCTION_TYPE or METHOD_TYPE, this is TYPE_RAISES_EXCEPTIONS
125 For a binfo, this is a TREE_LIST. There is an entry for each
126 virtual function declared either in BINFO or its direct and
127 indirect primary bases.
129 The BV_DELTA of each node gives the amount by which to adjust the
130 `this' pointer when calling the function. If the method is an
131 overridden version of a base class method, then it is assumed
132 that, prior to adjustment, the this pointer points to an object
135 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
136 index of the vcall offset for this entry.
138 The BV_FN is the declaration for the virtual function itself.
141 This is an expression with POINTER_TYPE that gives the value
142 to which the vptr should be initialized. Use get_vtbl_decl_for_binfo
143 to extract the VAR_DECL for the complete vtable.
146 For a VAR_DECL this is DECL_ANON_UNION_ELEMS.
149 This field is NULL for a non-virtual function. For a virtual
150 function, it is eventually set to an INTEGER_CST indicating the
151 index in the vtable at which this function can be found. When
152 a virtual function is declared, but before it is known what
153 function is overridden, this field is the error_mark_node.
155 Temporarily, it may be set to a TREE_LIST whose TREE_VALUE is
156 the virtual function this one overrides, and whose TREE_CHAIN is
157 the old DECL_VINDEX. */
159 /* Language-specific tree checkers. */
161 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
163 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
164 ({ const tree __t = (NODE); \
165 enum tree_code const __c = TREE_CODE(__t); \
166 if (__c != VAR_DECL && __c != FUNCTION_DECL) \
167 tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
171 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
172 ({ const tree __t = (NODE); \
173 enum tree_code const __c = TREE_CODE(__t); \
174 if (__c != VAR_DECL \
175 && __c != FUNCTION_DECL \
176 && __c != PARM_DECL) \
177 tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
181 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
182 ({ const tree __t = (NODE); \
183 enum tree_code const __c = TREE_CODE(__t); \
184 if (__c != VAR_DECL \
185 && __c != FUNCTION_DECL \
186 && __c != TYPE_DECL \
187 && __c != TEMPLATE_DECL) \
188 tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
192 #define RECORD_OR_UNION_TYPE_CHECK(NODE) \
193 ({ const tree __t = (NODE); \
194 enum tree_code const __c = TREE_CODE(__t); \
195 if (__c != RECORD_TYPE && __c != UNION_TYPE) \
196 tree_check_failed (__t, RECORD_TYPE, __FILE__, __LINE__, \
200 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
201 ({ const tree __t = (NODE); \
202 enum tree_code const __c = TREE_CODE(__t); \
203 if (__c != BOUND_TEMPLATE_TEMPLATE_PARM) \
204 tree_check_failed (__t, BOUND_TEMPLATE_TEMPLATE_PARM, \
205 __FILE__, __LINE__, __FUNCTION__); \
208 #else /* not ENABLE_TREE_CHECKING, or not gcc */
210 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) (NODE)
211 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) (NODE)
212 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) (NODE)
213 #define RECORD_OR_UNION_TYPE_CHECK(NODE) (NODE)
214 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) (NODE)
218 /* Returns TRUE if generated code should match ABI version N or
219 greater is in use. */
221 #define abi_version_at_least(N) \
222 (flag_abi_version == 0 || flag_abi_version >= (N))
225 /* Datatype used to temporarily save C++ bindings (for implicit
226 instantiations purposes and like). Implemented in decl.c. */
227 typedef struct cxx_saved_binding cxx_saved_binding;
229 /* Language-dependent contents of an identifier. */
231 struct lang_identifier GTY(())
233 struct c_common_identifier c_common;
234 tree namespace_bindings;
237 tree class_template_info;
241 /* In an IDENTIFIER_NODE, nonzero if this identifier is actually a
242 keyword. C_RID_CODE (node) is then the RID_* value of the keyword,
243 and C_RID_YYCODE is the token number wanted by Yacc. */
245 #define C_IS_RESERVED_WORD(ID) TREE_LANG_FLAG_5 (ID)
247 #define LANG_IDENTIFIER_CAST(NODE) \
248 ((struct lang_identifier*)IDENTIFIER_NODE_CHECK (NODE))
250 struct lang_id2 GTY(())
257 typedef struct template_parm_index_s GTY(())
259 struct tree_common common;
262 HOST_WIDE_INT orig_level;
264 } template_parm_index;
266 struct ptrmem_cst GTY(())
268 struct tree_common common;
269 /* This isn't used, but the middle-end expects all constants to have
274 typedef struct ptrmem_cst * ptrmem_cst_t;
276 /* Nonzero if this binding is for a local scope, as opposed to a class
277 or namespace scope. */
278 #define LOCAL_BINDING_P(NODE) TREE_LANG_FLAG_0 (NODE)
280 /* Nonzero if BINDING_VALUE is from a base class of the class which is
281 currently being defined. */
282 #define INHERITED_VALUE_BINDING_P(NODE) TREE_LANG_FLAG_1 (NODE)
284 /* For a binding between a name and an entity at a non-local scope,
285 defines the scope where the binding is declared. (Either a class
286 _TYPE node, or a NAMESPACE_DECL.) This macro should be used only
287 for namespace-level bindings; on the IDENTIFIER_BINDING list
288 BINDING_LEVEL is used instead. */
289 #define BINDING_SCOPE(NODE) \
290 (((struct tree_binding*)CPLUS_BINDING_CHECK (NODE))->scope.scope)
292 /* Nonzero if NODE has BINDING_LEVEL, rather than BINDING_SCOPE. */
293 #define BINDING_HAS_LEVEL_P(NODE) TREE_LANG_FLAG_2 (NODE)
295 /* This is the declaration bound to the name. Possible values:
296 variable, overloaded function, namespace, template, enumerator. */
297 #define BINDING_VALUE(NODE) \
298 (((struct tree_binding*)CPLUS_BINDING_CHECK (NODE))->value)
300 /* If name is bound to a type, this is the type (struct, union, enum). */
301 #define BINDING_TYPE(NODE) TREE_TYPE (NODE)
303 #define IDENTIFIER_GLOBAL_VALUE(NODE) \
304 namespace_binding ((NODE), global_namespace)
305 #define SET_IDENTIFIER_GLOBAL_VALUE(NODE, VAL) \
306 set_namespace_binding ((NODE), global_namespace, (VAL))
307 #define IDENTIFIER_NAMESPACE_VALUE(NODE) \
308 namespace_binding ((NODE), current_namespace)
309 #define SET_IDENTIFIER_NAMESPACE_VALUE(NODE, VAL) \
310 set_namespace_binding ((NODE), current_namespace, (VAL))
312 #define CLEANUP_P(NODE) TREE_LANG_FLAG_0 (TRY_BLOCK_CHECK (NODE))
314 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, in the usual
316 #define same_type_p(TYPE1, TYPE2) \
317 comptypes ((TYPE1), (TYPE2), COMPARE_STRICT)
319 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
320 top-level qualifiers. */
321 #define same_type_ignoring_top_level_qualifiers_p(TYPE1, TYPE2) \
322 same_type_p (TYPE_MAIN_VARIANT (TYPE1), TYPE_MAIN_VARIANT (TYPE2))
324 /* Nonzero if we are presently building a statement tree, rather
325 than expanding each statement as we encounter it. */
326 #define building_stmt_tree() (last_tree != NULL_TREE)
328 /* Returns nonzero iff NODE is a declaration for the global function
330 #define DECL_MAIN_P(NODE) \
331 (DECL_EXTERN_C_FUNCTION_P (NODE) \
332 && DECL_NAME (NODE) != NULL_TREE \
333 && MAIN_NAME_P (DECL_NAME (NODE)))
336 struct tree_binding GTY(())
338 struct tree_common common;
339 union tree_binding_u {
340 tree GTY ((tag ("0"))) scope;
341 struct cp_binding_level * GTY ((tag ("1"))) level;
342 } GTY ((desc ("BINDING_HAS_LEVEL_P ((tree)&%0)"))) scope;
346 /* The overloaded FUNCTION_DECL. */
347 #define OVL_FUNCTION(NODE) \
348 (((struct tree_overload*)OVERLOAD_CHECK (NODE))->function)
349 #define OVL_CHAIN(NODE) TREE_CHAIN (NODE)
350 /* Polymorphic access to FUNCTION and CHAIN. */
351 #define OVL_CURRENT(NODE) \
352 ((TREE_CODE (NODE) == OVERLOAD) ? OVL_FUNCTION (NODE) : (NODE))
353 #define OVL_NEXT(NODE) \
354 ((TREE_CODE (NODE) == OVERLOAD) ? TREE_CHAIN (NODE) : NULL_TREE)
355 /* If set, this was imported in a using declaration.
356 This is not to confuse with being used somewhere, which
357 is not important for this node. */
358 #define OVL_USED(NODE) TREE_USED (NODE)
360 struct tree_overload GTY(())
362 struct tree_common common;
366 /* Returns true iff NODE is a BASELINK. */
367 #define BASELINK_P(NODE) \
368 (TREE_CODE (NODE) == BASELINK)
369 /* The BINFO indicating the base from which the BASELINK_FUNCTIONS came. */
370 #define BASELINK_BINFO(NODE) \
371 (((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)
372 /* The functions referred to by the BASELINK; either a FUNCTION_DECL,
373 a TEMPLATE_DECL, an OVERLOAD, or a TEMPLATE_ID_EXPR. */
374 #define BASELINK_FUNCTIONS(NODE) \
375 (((struct tree_baselink*) BASELINK_CHECK (NODE))->functions)
376 /* The BINFO in which the search for the functions indicated by this baselink
377 began. This base is used to determine the accessibility of functions
378 selected by overload resolution. */
379 #define BASELINK_ACCESS_BINFO(NODE) \
380 (((struct tree_baselink*) BASELINK_CHECK (NODE))->access_binfo)
381 /* For a type-conversion operator, the BASELINK_OPTYPE indicates the type
382 to which the conversion should occur. This value is important if
383 the BASELINK_FUNCTIONS include a template conversion operator --
384 the BASELINK_OPTYPE can be used to determine what type the user
386 #define BASELINK_OPTYPE(NODE) \
387 (TREE_CHAIN (BASELINK_CHECK (NODE)))
389 struct tree_baselink GTY(())
391 struct tree_common common;
397 #define WRAPPER_ZC(NODE) (((struct tree_wrapper*)WRAPPER_CHECK (NODE))->z_c)
399 struct tree_wrapper GTY(())
401 struct tree_common common;
402 struct z_candidate *z_c;
405 #define SOURCE_LOCUS(NODE) \
406 (((struct tree_srcloc*)SRCLOC_CHECK (NODE))->locus)
407 #define SRCLOC_FILE(NODE) SOURCE_LOCUS (NODE).file
408 #define SRCLOC_LINE(NODE) SOURCE_LOCUS (NODE).line
410 struct tree_srcloc GTY(())
412 struct tree_common common;
416 /* Macros for access to language-specific slots in an identifier. */
418 #define IDENTIFIER_NAMESPACE_BINDINGS(NODE) \
419 (LANG_IDENTIFIER_CAST (NODE)->namespace_bindings)
420 #define IDENTIFIER_TEMPLATE(NODE) \
421 (LANG_IDENTIFIER_CAST (NODE)->class_template_info)
423 /* The IDENTIFIER_BINDING is the innermost CPLUS_BINDING for the
424 identifier. It's TREE_CHAIN is the next outermost binding. Each
425 BINDING_VALUE is a DECL for the associated declaration. Thus,
426 name lookup consists simply of pulling off the node at the front
427 of the list (modulo oddities for looking up the names of types,
428 and such.) You can use BINDING_SCOPE or BINDING_LEVEL to
429 determine the scope that bound the name. */
430 #define IDENTIFIER_BINDING(NODE) \
431 (LANG_IDENTIFIER_CAST (NODE)->bindings)
433 /* The IDENTIFIER_VALUE is the value of the IDENTIFIER_BINDING, or
434 NULL_TREE if there is no binding. */
435 #define IDENTIFIER_VALUE(NODE) \
436 (IDENTIFIER_BINDING (NODE) \
437 ? BINDING_VALUE (IDENTIFIER_BINDING (NODE)) \
440 /* If IDENTIFIER_CLASS_VALUE is set, then NODE is bound in the current
441 class, and IDENTIFIER_CLASS_VALUE is the value binding. This is
442 just a pointer to the BINDING_VALUE of one of the bindings in the
443 IDENTIFIER_BINDINGs list, so any time that this is non-NULL so is
444 IDENTIFIER_BINDING. */
445 #define IDENTIFIER_CLASS_VALUE(NODE) \
446 (LANG_IDENTIFIER_CAST (NODE)->class_value)
448 /* TREE_TYPE only indicates on local and class scope the current
449 type. For namespace scope, the presence of a type in any namespace
450 is indicated with global_type_node, and the real type behind must
451 be found through lookup. */
452 #define IDENTIFIER_TYPE_VALUE(NODE) identifier_type_value (NODE)
453 #define REAL_IDENTIFIER_TYPE_VALUE(NODE) TREE_TYPE (NODE)
454 #define SET_IDENTIFIER_TYPE_VALUE(NODE,TYPE) (TREE_TYPE (NODE) = (TYPE))
455 #define IDENTIFIER_HAS_TYPE_VALUE(NODE) (IDENTIFIER_TYPE_VALUE (NODE) ? 1 : 0)
457 #define LANG_ID_FIELD(NAME, NODE) \
458 (LANG_IDENTIFIER_CAST (NODE)->x \
459 ? LANG_IDENTIFIER_CAST (NODE)->x->NAME : 0)
461 #define SET_LANG_ID(NODE, VALUE, NAME) \
462 (LANG_IDENTIFIER_CAST (NODE)->x == 0 \
463 ? LANG_IDENTIFIER_CAST (NODE)->x \
464 = (struct lang_id2 *)ggc_alloc_cleared (sizeof (struct lang_id2)) : 0, \
465 LANG_IDENTIFIER_CAST (NODE)->x->NAME = (VALUE))
467 #define IDENTIFIER_LABEL_VALUE(NODE) \
468 LANG_ID_FIELD (label_value, NODE)
469 #define SET_IDENTIFIER_LABEL_VALUE(NODE, VALUE) \
470 SET_LANG_ID (NODE, VALUE, label_value)
472 #define IDENTIFIER_IMPLICIT_DECL(NODE) \
473 LANG_ID_FIELD (implicit_decl, NODE)
474 #define SET_IDENTIFIER_IMPLICIT_DECL(NODE, VALUE) \
475 SET_LANG_ID (NODE, VALUE, implicit_decl)
477 #define IDENTIFIER_ERROR_LOCUS(NODE) \
478 LANG_ID_FIELD (error_locus, NODE)
479 #define SET_IDENTIFIER_ERROR_LOCUS(NODE, VALUE) \
480 SET_LANG_ID (NODE, VALUE, error_locus)
482 /* Nonzero if this identifier is used as a virtual function name somewhere
483 (optimizes searches). */
484 #define IDENTIFIER_VIRTUAL_P(NODE) TREE_LANG_FLAG_1 (NODE)
486 /* Nonzero if this identifier is the prefix for a mangled C++ operator
488 #define IDENTIFIER_OPNAME_P(NODE) TREE_LANG_FLAG_2 (NODE)
490 /* Nonzero if this identifier is the name of a type-conversion
492 #define IDENTIFIER_TYPENAME_P(NODE) \
493 TREE_LANG_FLAG_4 (NODE)
495 /* Nonzero if this identifier is the name of a constructor or
497 #define IDENTIFIER_CTOR_OR_DTOR_P(NODE) \
498 TREE_LANG_FLAG_3 (NODE)
500 /* In a RECORD_TYPE or UNION_TYPE, nonzero if any component is read-only. */
501 #define C_TYPE_FIELDS_READONLY(TYPE) \
502 (LANG_TYPE_CLASS_CHECK (TYPE)->fields_readonly)
504 /* Store a value in that field. */
505 #define C_SET_EXP_ORIGINAL_CODE(EXP, CODE) \
506 (TREE_COMPLEXITY (EXP) = (int)(CODE))
508 /* The tokens stored in the default argument. */
510 #define DEFARG_TOKENS(NODE) \
511 (((struct tree_default_arg *)DEFAULT_ARG_CHECK (NODE))->tokens)
513 struct tree_default_arg GTY (())
515 struct tree_common common;
516 struct cp_token_cache *tokens;
519 enum cp_tree_node_structure_enum {
534 /* The resulting tree type. */
535 union lang_tree_node GTY((desc ("cp_tree_node_structure (&%h)"),
536 chain_next ("(union lang_tree_node *)TREE_CHAIN (&%h.generic)")))
538 struct tree_common GTY ((tag ("TS_CP_COMMON"))) common;
539 union tree_node GTY ((tag ("TS_CP_GENERIC"),
540 desc ("tree_node_structure (&%h)"))) generic;
541 struct template_parm_index_s GTY ((tag ("TS_CP_TPI"))) tpi;
542 struct ptrmem_cst GTY ((tag ("TS_CP_PTRMEM"))) ptrmem;
543 struct tree_binding GTY ((tag ("TS_CP_BINDING"))) binding;
544 struct tree_overload GTY ((tag ("TS_CP_OVERLOAD"))) overload;
545 struct tree_baselink GTY ((tag ("TS_CP_BASELINK"))) baselink;
546 struct tree_wrapper GTY ((tag ("TS_CP_WRAPPER"))) wrapper;
547 struct tree_srcloc GTY ((tag ("TS_CP_SRCLOC"))) srcloc;
548 struct tree_default_arg GTY ((tag ("TS_CP_DEFAULT_ARG"))) default_arg;
549 struct lang_identifier GTY ((tag ("TS_CP_IDENTIFIER"))) identifier;
556 CPTI_JAVA_SHORT_TYPE,
559 CPTI_JAVA_FLOAT_TYPE,
560 CPTI_JAVA_DOUBLE_TYPE,
562 CPTI_JAVA_BOOLEAN_TYPE,
565 CPTI_VTABLE_ENTRY_TYPE,
567 CPTI_VTABLE_INDEX_TYPE,
577 CPTI_CLASS_DESC_TYPE,
578 CPTI_SI_CLASS_DESC_TYPE,
579 CPTI_VMI_CLASS_DESC_TYPE,
593 CPTI_TYPE_INFO_PTR_TYPE,
594 CPTI_TYPE_INFO_REF_TYPE,
596 CPTI_GLOBAL_DELETE_FNDECL,
599 CPTI_CTOR_IDENTIFIER,
600 CPTI_COMPLETE_CTOR_IDENTIFIER,
601 CPTI_BASE_CTOR_IDENTIFIER,
602 CPTI_DTOR_IDENTIFIER,
603 CPTI_COMPLETE_DTOR_IDENTIFIER,
604 CPTI_BASE_DTOR_IDENTIFIER,
605 CPTI_DELETING_DTOR_IDENTIFIER,
606 CPTI_DELTA_IDENTIFIER,
607 CPTI_IN_CHARGE_IDENTIFIER,
608 CPTI_VTT_PARM_IDENTIFIER,
609 CPTI_NELTS_IDENTIFIER,
610 CPTI_THIS_IDENTIFIER,
612 CPTI_VPTR_IDENTIFIER,
616 CPTI_LANG_NAME_CPLUSPLUS,
619 CPTI_EMPTY_EXCEPT_SPEC,
623 CPTI_CALL_UNEXPECTED,
633 extern GTY(()) tree cp_global_trees[CPTI_MAX];
635 #define java_byte_type_node cp_global_trees[CPTI_JAVA_BYTE_TYPE]
636 #define java_short_type_node cp_global_trees[CPTI_JAVA_SHORT_TYPE]
637 #define java_int_type_node cp_global_trees[CPTI_JAVA_INT_TYPE]
638 #define java_long_type_node cp_global_trees[CPTI_JAVA_LONG_TYPE]
639 #define java_float_type_node cp_global_trees[CPTI_JAVA_FLOAT_TYPE]
640 #define java_double_type_node cp_global_trees[CPTI_JAVA_DOUBLE_TYPE]
641 #define java_char_type_node cp_global_trees[CPTI_JAVA_CHAR_TYPE]
642 #define java_boolean_type_node cp_global_trees[CPTI_JAVA_BOOLEAN_TYPE]
644 #define wchar_decl_node cp_global_trees[CPTI_WCHAR_DECL]
645 #define vtable_entry_type cp_global_trees[CPTI_VTABLE_ENTRY_TYPE]
646 /* The type used to represent an offset by which to adjust the `this'
647 pointer in pointer-to-member types. */
648 #define delta_type_node cp_global_trees[CPTI_DELTA_TYPE]
649 /* The type used to represent an index into the vtable. */
650 #define vtable_index_type cp_global_trees[CPTI_VTABLE_INDEX_TYPE]
652 #define ti_desc_type_node cp_global_trees[CPTI_TI_DESC_TYPE]
653 #define bltn_desc_type_node cp_global_trees[CPTI_BLTN_DESC_TYPE]
654 #define ptr_desc_type_node cp_global_trees[CPTI_PTR_DESC_TYPE]
655 #define ary_desc_type_node cp_global_trees[CPTI_ARY_DESC_TYPE]
656 #define func_desc_type_node cp_global_trees[CPTI_FUNC_DESC_TYPE]
657 #define enum_desc_type_node cp_global_trees[CPTI_ENUM_DESC_TYPE]
658 #define class_desc_type_node cp_global_trees[CPTI_CLASS_DESC_TYPE]
659 #define si_class_desc_type_node cp_global_trees[CPTI_SI_CLASS_DESC_TYPE]
660 #define vmi_class_desc_type_node cp_global_trees[CPTI_VMI_CLASS_DESC_TYPE]
661 #define ptm_desc_type_node cp_global_trees[CPTI_PTM_DESC_TYPE]
662 #define base_desc_type_node cp_global_trees[CPTI_BASE_DESC_TYPE]
664 #define class_type_node cp_global_trees[CPTI_CLASS_TYPE]
665 #define record_type_node cp_global_trees[CPTI_RECORD_TYPE]
666 #define union_type_node cp_global_trees[CPTI_UNION_TYPE]
667 #define enum_type_node cp_global_trees[CPTI_ENUM_TYPE]
668 #define unknown_type_node cp_global_trees[CPTI_UNKNOWN_TYPE]
669 #define vtbl_type_node cp_global_trees[CPTI_VTBL_TYPE]
670 #define vtbl_ptr_type_node cp_global_trees[CPTI_VTBL_PTR_TYPE]
671 #define std_node cp_global_trees[CPTI_STD]
672 #define abi_node cp_global_trees[CPTI_ABI]
673 #define type_info_type_node cp_global_trees[CPTI_TYPE_INFO_TYPE]
674 #define type_info_ptr_type cp_global_trees[CPTI_TYPE_INFO_PTR_TYPE]
675 #define type_info_ref_type cp_global_trees[CPTI_TYPE_INFO_REF_TYPE]
676 #define abort_fndecl cp_global_trees[CPTI_ABORT_FNDECL]
677 #define global_delete_fndecl cp_global_trees[CPTI_GLOBAL_DELETE_FNDECL]
678 #define current_aggr cp_global_trees[CPTI_AGGR_TAG]
680 /* We cache these tree nodes so as to call get_identifier less
683 /* The name of a constructor that takes an in-charge parameter to
684 decide whether or not to construct virtual base classes. */
685 #define ctor_identifier cp_global_trees[CPTI_CTOR_IDENTIFIER]
686 /* The name of a constructor that constructs virtual base classes. */
687 #define complete_ctor_identifier cp_global_trees[CPTI_COMPLETE_CTOR_IDENTIFIER]
688 /* The name of a constructor that does not construct virtual base classes. */
689 #define base_ctor_identifier cp_global_trees[CPTI_BASE_CTOR_IDENTIFIER]
690 /* The name of a destructor that takes an in-charge parameter to
691 decide whether or not to destroy virtual base classes and whether
692 or not to delete the object. */
693 #define dtor_identifier cp_global_trees[CPTI_DTOR_IDENTIFIER]
694 /* The name of a destructor that destroys virtual base classes. */
695 #define complete_dtor_identifier cp_global_trees[CPTI_COMPLETE_DTOR_IDENTIFIER]
696 /* The name of a destructor that does not destroy virtual base
698 #define base_dtor_identifier cp_global_trees[CPTI_BASE_DTOR_IDENTIFIER]
699 /* The name of a destructor that destroys virtual base classes, and
700 then deletes the entire object. */
701 #define deleting_dtor_identifier cp_global_trees[CPTI_DELETING_DTOR_IDENTIFIER]
702 #define delta_identifier cp_global_trees[CPTI_DELTA_IDENTIFIER]
703 #define in_charge_identifier cp_global_trees[CPTI_IN_CHARGE_IDENTIFIER]
704 /* The name of the parameter that contains a pointer to the VTT to use
705 for this subobject constructor or destructor. */
706 #define vtt_parm_identifier cp_global_trees[CPTI_VTT_PARM_IDENTIFIER]
707 #define nelts_identifier cp_global_trees[CPTI_NELTS_IDENTIFIER]
708 #define this_identifier cp_global_trees[CPTI_THIS_IDENTIFIER]
709 #define pfn_identifier cp_global_trees[CPTI_PFN_IDENTIFIER]
710 #define vptr_identifier cp_global_trees[CPTI_VPTR_IDENTIFIER]
711 /* The name of the std namespace. */
712 #define std_identifier cp_global_trees[CPTI_STD_IDENTIFIER]
713 #define lang_name_c cp_global_trees[CPTI_LANG_NAME_C]
714 #define lang_name_cplusplus cp_global_trees[CPTI_LANG_NAME_CPLUSPLUS]
715 #define lang_name_java cp_global_trees[CPTI_LANG_NAME_JAVA]
717 /* Exception specifier used for throw(). */
718 #define empty_except_spec cp_global_trees[CPTI_EMPTY_EXCEPT_SPEC]
720 /* The node for `__null'. */
721 #define null_node cp_global_trees[CPTI_NULL]
723 /* If non-NULL, a POINTER_TYPE equivalent to (java::lang::Class*). */
724 #define jclass_node cp_global_trees[CPTI_JCLASS]
726 /* The declaration for `std::terminate'. */
727 #define terminate_node cp_global_trees[CPTI_TERMINATE]
729 /* The declaration for "__cxa_call_unexpected". */
730 #define call_unexpected_node cp_global_trees[CPTI_CALL_UNEXPECTED]
732 /* A pointer to `std::atexit'. */
733 #define atexit_node cp_global_trees[CPTI_ATEXIT]
735 /* A pointer to `__dso_handle'. */
736 #define dso_handle_node cp_global_trees[CPTI_DSO_HANDLE]
738 /* The declaration of the dynamic_cast runtime. */
739 #define dynamic_cast_node cp_global_trees[CPTI_DCAST]
741 /* The type of a destructor. */
742 #define cleanup_type cp_global_trees[CPTI_CLEANUP_TYPE]
744 /* The type of the vtt parameter passed to subobject constructors and
746 #define vtt_parm_type cp_global_trees[CPTI_VTT_PARM_TYPE]
748 /* A TREE_LIST of the dynamic classes whose vtables may have to be
749 emitted in this translation unit. */
751 #define keyed_classes cp_global_trees[CPTI_KEYED_CLASSES]
753 /* Node to indicate default access. This must be distinct from the
754 access nodes in tree.h. */
756 #define access_default_node null_node
760 struct saved_scope GTY(())
762 cxx_saved_binding *old_bindings;
767 tree access_specifier;
769 varray_type lang_base;
772 tree x_previous_class_type;
773 tree x_previous_class_values;
777 HOST_WIDE_INT x_processing_template_decl;
778 int x_processing_specialization;
779 bool x_processing_explicit_instantiation;
780 int need_pop_function_context;
783 struct stmt_tree_s x_stmt_tree;
785 struct cp_binding_level *class_bindings;
786 struct cp_binding_level *bindings;
788 struct saved_scope *prev;
791 /* The current open namespace. */
793 #define current_namespace scope_chain->old_namespace
795 /* The stack for namespaces of current declarations. */
797 #define decl_namespace_list scope_chain->decl_ns_list
799 /* IDENTIFIER_NODE: name of current class */
801 #define current_class_name scope_chain->class_name
803 /* _TYPE: the type of the current class */
805 #define current_class_type scope_chain->class_type
807 /* When parsing a class definition, the access specifier most recently
808 given by the user, or, if no access specifier was given, the
809 default value appropriate for the kind of class (i.e., struct,
812 #define current_access_specifier scope_chain->access_specifier
814 /* Pointer to the top of the language name stack. */
816 #define current_lang_base scope_chain->lang_base
817 #define current_lang_name scope_chain->lang_name
819 /* Parsing a function declarator leaves a list of parameter names
820 or a chain or parameter decls here. */
822 #define current_template_parms scope_chain->template_parms
824 #define processing_template_decl scope_chain->x_processing_template_decl
825 #define processing_specialization scope_chain->x_processing_specialization
826 #define processing_explicit_instantiation scope_chain->x_processing_explicit_instantiation
828 /* _TYPE: the previous type that was a class */
830 #define previous_class_type scope_chain->x_previous_class_type
832 /* This is a copy of the class_shadowed list of the previous class
833 binding contour when at global scope. It's used to reset
834 IDENTIFIER_CLASS_VALUEs when entering another class scope (i.e. a
837 #define previous_class_values scope_chain->x_previous_class_values
839 /* A list of private types mentioned, for deferred access checking. */
841 extern GTY(()) struct saved_scope *scope_chain;
843 /* Global state pertinent to the current function. */
845 struct language_function GTY(())
847 struct c_language_function base;
850 tree x_current_class_ptr;
851 tree x_current_class_ref;
852 tree x_eh_spec_block;
853 tree x_in_charge_parm;
859 int returns_abnormally;
860 int in_function_try_handler;
863 struct named_label_use_list *x_named_label_uses;
864 struct named_label_list *x_named_labels;
865 struct cp_binding_level *bindings;
866 varray_type x_local_names;
868 const char *cannot_inline;
871 /* The current C++-specific per-function global variables. */
873 #define cp_function_chain (cfun->language)
875 /* In a destructor, the point at which all derived class destroying
876 has been done, just before any base class destroying will be done. */
878 #define dtor_label cp_function_chain->x_dtor_label
880 /* When we're processing a member function, current_class_ptr is the
881 PARM_DECL for the `this' pointer. The current_class_ref is an
882 expression for `*this'. */
884 #define current_class_ptr \
885 (cfun ? cp_function_chain->x_current_class_ptr : NULL_TREE)
886 #define current_class_ref \
887 (cfun ? cp_function_chain->x_current_class_ref : NULL_TREE)
889 /* The EH_SPEC_BLOCK for the exception-specifiers for the current
892 #define current_eh_spec_block cp_function_chain->x_eh_spec_block
894 /* The `__in_chrg' parameter for the current function. Only used for
895 constructors and destructors. */
897 #define current_in_charge_parm cp_function_chain->x_in_charge_parm
899 /* The `__vtt_parm' parameter for the current function. Only used for
900 constructors and destructors. */
902 #define current_vtt_parm cp_function_chain->x_vtt_parm
904 /* Set to 0 at beginning of a function definition, set to 1 if
905 a return statement that specifies a return value is seen. */
907 #define current_function_returns_value cp_function_chain->returns_value
909 /* Set to 0 at beginning of a function definition, set to 1 if
910 a return statement with no argument is seen. */
912 #define current_function_returns_null cp_function_chain->returns_null
914 /* Set to 0 at beginning of a function definition, set to 1 if
915 a call to a noreturn function is seen. */
917 #define current_function_returns_abnormally \
918 cp_function_chain->returns_abnormally
920 /* Nonzero if we should generate RTL for functions that we process.
921 When this is zero, we just accumulate tree structure, without
922 interacting with the back end. */
924 #define expanding_p cp_function_chain->x_expanding_p
926 /* Nonzero if we are in the semantic analysis phase for the current
929 #define doing_semantic_analysis_p() (!expanding_p)
931 #define in_function_try_handler cp_function_chain->in_function_try_handler
933 /* Expression always returned from function, or error_mark_node
934 otherwise, for use by the automatic named return value optimization. */
936 #define current_function_return_value \
937 (cp_function_chain->x_return_value)
939 extern GTY(()) tree global_namespace;
941 #define ansi_opname(CODE) \
942 (operator_name_info[(int) (CODE)].identifier)
943 #define ansi_assopname(CODE) \
944 (assignment_operator_name_info[(int) (CODE)].identifier)
946 /* True if NODE is an erroneous expression. */
948 #define error_operand_p(NODE) \
949 ((NODE) == error_mark_node \
950 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
952 /* INTERFACE_ONLY nonzero means that we are in an "interface"
953 section of the compiler. INTERFACE_UNKNOWN nonzero means
954 we cannot trust the value of INTERFACE_ONLY. If INTERFACE_UNKNOWN
955 is zero and INTERFACE_ONLY is zero, it means that we are responsible
956 for exporting definitions that others might need. */
957 extern int interface_only, interface_unknown;
959 /* C++ language-specific tree codes. */
960 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) SYM,
961 enum cplus_tree_code {
962 CP_DUMMY_TREE_CODE = LAST_C_TREE_CODE,
963 #include "cp-tree.def"
968 enum languages { lang_c, lang_cplusplus, lang_java };
970 /* Macros to make error reporting functions' lives easier. */
971 #define TYPE_IDENTIFIER(NODE) (DECL_NAME (TYPE_NAME (NODE)))
972 #define TYPE_LINKAGE_IDENTIFIER(NODE) \
973 (TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (NODE)))
974 #define TYPE_NAME_STRING(NODE) (IDENTIFIER_POINTER (TYPE_IDENTIFIER (NODE)))
975 #define TYPE_NAME_LENGTH(NODE) (IDENTIFIER_LENGTH (TYPE_IDENTIFIER (NODE)))
977 #define TYPE_ASSEMBLER_NAME_STRING(NODE) \
978 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (TYPE_NAME (NODE))))
979 #define TYPE_ASSEMBLER_NAME_LENGTH(NODE) \
980 (IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (TYPE_NAME (NODE))))
982 /* Nonzero if NODE has no name for linkage purposes. */
983 #define TYPE_ANONYMOUS_P(NODE) \
984 (TAGGED_TYPE_P (NODE) && ANON_AGGRNAME_P (TYPE_LINKAGE_IDENTIFIER (NODE)))
986 /* The _DECL for this _TYPE. */
987 #define TYPE_MAIN_DECL(NODE) (TYPE_STUB_DECL (TYPE_MAIN_VARIANT (NODE)))
989 /* Nonzero if T is a class (or struct or union) type. Also nonzero
990 for template type parameters, typename types, and instantiated
991 template template parameters. Despite its name,
992 this macro has nothing to do with the definition of aggregate given
993 in the standard. Think of this macro as MAYBE_CLASS_TYPE_P. */
994 #define IS_AGGR_TYPE(T) \
995 (TREE_CODE (T) == TEMPLATE_TYPE_PARM \
996 || TREE_CODE (T) == TYPENAME_TYPE \
997 || TREE_CODE (T) == TYPEOF_TYPE \
998 || TREE_CODE (T) == BOUND_TEMPLATE_TEMPLATE_PARM \
999 || TYPE_LANG_FLAG_5 (T))
1001 /* Set IS_AGGR_TYPE for T to VAL. T must be a class, struct, or
1003 #define SET_IS_AGGR_TYPE(T, VAL) \
1004 (TYPE_LANG_FLAG_5 (T) = (VAL))
1006 /* Nonzero if T is a class type. Zero for template type parameters,
1007 typename types, and so forth. */
1008 #define CLASS_TYPE_P(T) \
1009 (IS_AGGR_TYPE_CODE (TREE_CODE (T)) && IS_AGGR_TYPE (T))
1011 #define IS_AGGR_TYPE_CODE(T) ((T) == RECORD_TYPE || (T) == UNION_TYPE)
1012 #define TAGGED_TYPE_P(T) \
1013 (CLASS_TYPE_P (T) || TREE_CODE (T) == ENUMERAL_TYPE)
1014 #define IS_OVERLOAD_TYPE(T) TAGGED_TYPE_P (T)
1016 /* True if this a "Java" type, defined in 'extern "Java"'. */
1017 #define TYPE_FOR_JAVA(NODE) TYPE_LANG_FLAG_3 (NODE)
1019 /* True if this type is dependent. This predicate is only valid if
1020 TYPE_DEPENDENT_P_VALID is true. */
1021 #define TYPE_DEPENDENT_P(NODE) TYPE_LANG_FLAG_0 (NODE)
1023 /* True if dependent_type_p has been called for this type, with the
1024 result that TYPE_DEPENDENT_P is valid. */
1025 #define TYPE_DEPENDENT_P_VALID(NODE) TYPE_LANG_FLAG_6(NODE)
1027 /* Nonzero if this type is const-qualified. */
1028 #define CP_TYPE_CONST_P(NODE) \
1029 ((cp_type_quals (NODE) & TYPE_QUAL_CONST) != 0)
1031 /* Nonzero if this type is volatile-qualified. */
1032 #define CP_TYPE_VOLATILE_P(NODE) \
1033 ((cp_type_quals (NODE) & TYPE_QUAL_VOLATILE) != 0)
1035 /* Nonzero if this type is restrict-qualified. */
1036 #define CP_TYPE_RESTRICT_P(NODE) \
1037 ((cp_type_quals (NODE) & TYPE_QUAL_RESTRICT) != 0)
1039 /* Nonzero if this type is const-qualified, but not
1040 volatile-qualified. Other qualifiers are ignored. This macro is
1041 used to test whether or not it is OK to bind an rvalue to a
1043 #define CP_TYPE_CONST_NON_VOLATILE_P(NODE) \
1044 ((cp_type_quals (NODE) & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)) \
1047 #define FUNCTION_ARG_CHAIN(NODE) \
1048 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (NODE)))
1050 /* Given a FUNCTION_DECL, returns the first TREE_LIST out of TYPE_ARG_TYPES
1051 which refers to a user-written parameter. */
1052 #define FUNCTION_FIRST_USER_PARMTYPE(NODE) \
1053 skip_artificial_parms_for ((NODE), TYPE_ARG_TYPES (TREE_TYPE (NODE)))
1055 /* Similarly, but for DECL_ARGUMENTS. */
1056 #define FUNCTION_FIRST_USER_PARM(NODE) \
1057 skip_artificial_parms_for ((NODE), DECL_ARGUMENTS (NODE))
1059 #define PROMOTES_TO_AGGR_TYPE(NODE, CODE) \
1060 (((CODE) == TREE_CODE (NODE) \
1061 && IS_AGGR_TYPE (TREE_TYPE (NODE))) \
1062 || IS_AGGR_TYPE (NODE))
1064 /* Nonzero iff TYPE is derived from PARENT. Ignores accessibility and
1065 ambiguity issues. */
1066 #define DERIVED_FROM_P(PARENT, TYPE) \
1067 lookup_base ((TYPE), PARENT, ba_any, NULL)
1068 /* Nonzero iff TYPE is uniquely derived from PARENT. Ignores
1070 #define UNIQUELY_DERIVED_FROM_P(PARENT, TYPE) \
1071 lookup_base ((TYPE), (PARENT), ba_ignore | ba_quiet, NULL)
1072 /* Nonzero iff TYPE is accessible in the current scope and uniquely
1073 derived from PARENT. */
1074 #define ACCESSIBLY_UNIQUELY_DERIVED_P(PARENT, TYPE) \
1075 lookup_base ((TYPE), (PARENT), ba_check | ba_quiet, NULL)
1076 /* Nonzero iff TYPE is publicly & uniquely derived from PARENT. */
1077 #define PUBLICLY_UNIQUELY_DERIVED_P(PARENT, TYPE) \
1078 lookup_base ((TYPE), (PARENT), ba_not_special | ba_quiet, NULL)
1080 /* This is a few header flags for 'struct lang_type'. Actually,
1081 all but the first are used only for lang_type_class; they
1082 are put in this structure to save space. */
1083 struct lang_type_header GTY(())
1085 unsigned char is_lang_type_class : 1;
1087 unsigned char has_type_conversion : 1;
1088 unsigned char has_init_ref : 1;
1089 unsigned char has_default_ctor : 1;
1090 unsigned char uses_multiple_inheritance : 1;
1091 unsigned char const_needs_init : 1;
1092 unsigned char ref_needs_init : 1;
1093 unsigned char has_const_assign_ref : 1;
1096 /* This structure provides additional information above and beyond
1097 what is provide in the ordinary tree_type. In the past, we used it
1098 for the types of class types, template parameters types, typename
1099 types, and so forth. However, there can be many (tens to hundreds
1100 of thousands) of template parameter types in a compilation, and
1101 there's no need for this additional information in that case.
1102 Therefore, we now use this data structure only for class types.
1104 In the past, it was thought that there would be relatively few
1105 class types. However, in the presence of heavy use of templates,
1106 many (i.e., thousands) of classes can easily be generated.
1107 Therefore, we should endeavor to keep the size of this structure to
1109 struct lang_type_class GTY(())
1111 struct lang_type_header h;
1113 unsigned char align;
1115 unsigned has_mutable : 1;
1116 unsigned com_interface : 1;
1117 unsigned non_pod_class : 1;
1118 unsigned nearly_empty_p : 1;
1119 unsigned user_align : 1;
1120 unsigned has_assign_ref : 1;
1121 unsigned has_new : 1;
1122 unsigned has_array_new : 1;
1124 unsigned gets_delete : 2;
1125 unsigned has_call_overloaded : 1;
1126 unsigned has_array_ref_overloaded : 1;
1127 unsigned has_arrow_overloaded : 1;
1128 unsigned interface_only : 1;
1129 unsigned interface_unknown : 1;
1130 unsigned contains_empty_class_p : 1;
1133 unsigned vec_new_uses_cookie : 1;
1134 unsigned declared_class : 1;
1136 unsigned being_defined : 1;
1137 unsigned redefined : 1;
1138 unsigned debug_requested : 1;
1139 unsigned use_template : 2;
1140 unsigned got_semicolon : 1;
1141 unsigned ptrmemfunc_flag : 1;
1142 unsigned was_anonymous : 1;
1144 unsigned has_real_assign_ref : 1;
1145 unsigned has_const_init_ref : 1;
1146 unsigned has_complex_init_ref : 1;
1147 unsigned has_complex_assign_ref : 1;
1148 unsigned has_abstract_assign_ref : 1;
1149 unsigned non_aggregate : 1;
1150 unsigned java_interface : 1;
1151 unsigned anon_aggr : 1;
1153 unsigned non_zero_init : 1;
1154 unsigned empty_p : 1;
1155 unsigned fields_readonly : 1;
1157 /* When adding a flag here, consider whether or not it ought to
1158 apply to a template instance if it applies to the template. If
1159 so, make sure to copy it in instantiate_class_template! */
1161 /* There are some bits left to fill out a 32-bit word. Keep track
1162 of this by updating the size of this bitfield whenever you add or
1175 tree friend_classes;
1176 tree GTY ((reorder ("resort_type_method_vec"))) methods;
1180 tree befriending_classes;
1183 struct lang_type_ptrmem GTY(())
1185 struct lang_type_header h;
1189 struct lang_type GTY(())
1193 struct lang_type_header GTY((tag ("2"))) h;
1194 struct lang_type_class GTY((tag ("1"))) c;
1195 struct lang_type_ptrmem GTY((tag ("0"))) ptrmem;
1196 } GTY((desc ("%h.h.is_lang_type_class"))) u;
1199 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
1201 #define LANG_TYPE_CLASS_CHECK(NODE) \
1202 ({ struct lang_type *lt = TYPE_LANG_SPECIFIC (NODE); \
1203 if (! lt->u.h.is_lang_type_class) \
1204 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
1207 #define LANG_TYPE_PTRMEM_CHECK(NODE) \
1208 ({ struct lang_type *lt = TYPE_LANG_SPECIFIC (NODE); \
1209 if (lt->u.h.is_lang_type_class) \
1210 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
1215 #define LANG_TYPE_CLASS_CHECK(NODE) (&TYPE_LANG_SPECIFIC (NODE)->u.c)
1216 #define LANG_TYPE_PTRMEM_CHECK(NODE) (&TYPE_LANG_SPECIFIC (NODE)->u.ptrmem)
1218 #endif /* ENABLE_TREE_CHECKING */
1220 /* Indicates whether or not (and how) a template was expanded for this class.
1221 0=no information yet/non-template class
1222 1=implicit template instantiation
1223 2=explicit template specialization
1224 3=explicit template instantiation */
1225 #define CLASSTYPE_USE_TEMPLATE(NODE) \
1226 (LANG_TYPE_CLASS_CHECK (NODE)->use_template)
1228 /* Fields used for storing information before the class is defined.
1229 After the class is defined, these fields hold other information. */
1231 /* List of friends which were defined inline in this class definition. */
1232 #define CLASSTYPE_INLINE_FRIENDS(NODE) CLASSTYPE_PURE_VIRTUALS (NODE)
1234 /* Nonzero for _CLASSTYPE means that operator delete is defined. */
1235 #define TYPE_GETS_DELETE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->gets_delete)
1236 #define TYPE_GETS_REG_DELETE(NODE) (TYPE_GETS_DELETE (NODE) & 1)
1238 /* Nonzero if `new NODE[x]' should cause the allocation of extra
1239 storage to indicate how many array elements are in use. */
1240 #define TYPE_VEC_NEW_USES_COOKIE(NODE) \
1241 (CLASS_TYPE_P (NODE) \
1242 && LANG_TYPE_CLASS_CHECK (NODE)->vec_new_uses_cookie)
1244 /* Nonzero means that this _CLASSTYPE node defines ways of converting
1245 itself to other types. */
1246 #define TYPE_HAS_CONVERSION(NODE) \
1247 (LANG_TYPE_CLASS_CHECK (NODE)->h.has_type_conversion)
1249 /* Nonzero means that this _CLASSTYPE node overloads operator=(X&). */
1250 #define TYPE_HAS_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_assign_ref)
1251 #define TYPE_HAS_CONST_ASSIGN_REF(NODE) \
1252 (LANG_TYPE_CLASS_CHECK (NODE)->h.has_const_assign_ref)
1254 /* Nonzero means that this _CLASSTYPE node has an X(X&) constructor. */
1255 #define TYPE_HAS_INIT_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->h.has_init_ref)
1256 #define TYPE_HAS_CONST_INIT_REF(NODE) \
1257 (LANG_TYPE_CLASS_CHECK (NODE)->has_const_init_ref)
1259 /* Nonzero if this class defines an overloaded operator new. (An
1260 operator new [] doesn't count.) */
1261 #define TYPE_HAS_NEW_OPERATOR(NODE) \
1262 (LANG_TYPE_CLASS_CHECK (NODE)->has_new)
1264 /* Nonzero if this class defines an overloaded operator new[]. */
1265 #define TYPE_HAS_ARRAY_NEW_OPERATOR(NODE) \
1266 (LANG_TYPE_CLASS_CHECK (NODE)->has_array_new)
1268 /* Nonzero means that this type is being defined. I.e., the left brace
1269 starting the definition of this type has been seen. */
1270 #define TYPE_BEING_DEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->being_defined)
1271 /* Nonzero means that this type has been redefined. In this case, if
1272 convenient, don't reprocess any methods that appear in its redefinition. */
1273 #define TYPE_REDEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->redefined)
1275 /* Nonzero means that this _CLASSTYPE node overloads operator(). */
1276 #define TYPE_OVERLOADS_CALL_EXPR(NODE) \
1277 (LANG_TYPE_CLASS_CHECK (NODE)->has_call_overloaded)
1279 /* Nonzero means that this _CLASSTYPE node overloads operator[]. */
1280 #define TYPE_OVERLOADS_ARRAY_REF(NODE) \
1281 (LANG_TYPE_CLASS_CHECK (NODE)->has_array_ref_overloaded)
1283 /* Nonzero means that this _CLASSTYPE node overloads operator->. */
1284 #define TYPE_OVERLOADS_ARROW(NODE) \
1285 (LANG_TYPE_CLASS_CHECK (NODE)->has_arrow_overloaded)
1287 /* Nonzero means that this _CLASSTYPE (or one of its ancestors) uses
1288 multiple inheritance. If this is 0 for the root of a type
1289 hierarchy, then we can use more efficient search techniques. */
1290 #define TYPE_USES_MULTIPLE_INHERITANCE(NODE) \
1291 (LANG_TYPE_CLASS_CHECK (NODE)->h.uses_multiple_inheritance)
1293 /* Nonzero means that this _CLASSTYPE (or one of its ancestors) uses
1294 virtual base classes. If this is 0 for the root of a type
1295 hierarchy, then we can use more efficient search techniques. */
1296 #define TYPE_USES_VIRTUAL_BASECLASSES(NODE) (TREE_LANG_FLAG_3 (NODE))
1298 /* The member function with which the vtable will be emitted:
1299 the first noninline non-pure-virtual member function. NULL_TREE
1300 if there is no key function or if this is a class template */
1301 #define CLASSTYPE_KEY_METHOD(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->key_method)
1303 /* Vector member functions defined in this class. Each element is
1304 either a FUNCTION_DECL, a TEMPLATE_DECL, or an OVERLOAD. All
1305 functions with the same name end up in the same slot. The first
1306 two elements are for constructors, and destructors, respectively.
1307 All template conversion operators to innermost template dependent
1308 types are overloaded on the next slot, if they exist. Note, the
1309 names for these functions will not all be the same. The
1310 non-template conversion operators & templated conversions to
1311 non-innermost template types are next, followed by ordinary member
1312 functions. There may be empty entries at the end of the vector.
1313 The conversion operators are unsorted. The ordinary member
1314 functions are sorted, once the class is complete. */
1315 #define CLASSTYPE_METHOD_VEC(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->methods)
1317 /* For class templates, this is a TREE_LIST of all member data,
1318 functions, types, and friends in the order of declaration.
1319 The TREE_PURPOSE of each TREE_LIST is NULL_TREE for a friend,
1320 and the RECORD_TYPE for the class template otherwise. */
1321 #define CLASSTYPE_DECL_LIST(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->decl_list)
1323 /* The slot in the CLASSTYPE_METHOD_VEC where constructors go. */
1324 #define CLASSTYPE_CONSTRUCTOR_SLOT 0
1326 /* The slot in the CLASSTYPE_METHOD_VEC where destructors go. */
1327 #define CLASSTYPE_DESTRUCTOR_SLOT 1
1329 /* The first slot in the CLASSTYPE_METHOD_VEC where conversion
1330 operators can appear. */
1331 #define CLASSTYPE_FIRST_CONVERSION_SLOT 2
1333 /* A FUNCTION_DECL or OVERLOAD for the constructors for NODE. These
1334 are the constructors that take an in-charge parameter. */
1335 #define CLASSTYPE_CONSTRUCTORS(NODE) \
1336 (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_CONSTRUCTOR_SLOT))
1338 /* A FUNCTION_DECL for the destructor for NODE. These are the
1339 destructors that take an in-charge parameter. */
1340 #define CLASSTYPE_DESTRUCTORS(NODE) \
1341 (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_DESTRUCTOR_SLOT))
1343 /* Mark bits for depth-first and breath-first searches. */
1345 /* Get the value of the Nth mark bit. */
1346 #define CLASSTYPE_MARKED_N(NODE, N) \
1347 (((CLASS_TYPE_P (NODE) ? LANG_TYPE_CLASS_CHECK (NODE)->marks \
1348 : ((unsigned) TYPE_ALIAS_SET (NODE))) & (1 << (N))) != 0)
1350 /* Set the Nth mark bit. */
1351 #define SET_CLASSTYPE_MARKED_N(NODE, N) \
1352 (CLASS_TYPE_P (NODE) \
1353 ? (void) (LANG_TYPE_CLASS_CHECK (NODE)->marks |= (1 << (N))) \
1354 : (void) (TYPE_ALIAS_SET (NODE) |= (1 << (N))))
1356 /* Clear the Nth mark bit. */
1357 #define CLEAR_CLASSTYPE_MARKED_N(NODE, N) \
1358 (CLASS_TYPE_P (NODE) \
1359 ? (void) (LANG_TYPE_CLASS_CHECK (NODE)->marks &= ~(1 << (N))) \
1360 : (void) (TYPE_ALIAS_SET (NODE) &= ~(1 << (N))))
1362 /* Get the value of the mark bits. */
1363 #define CLASSTYPE_MARKED(NODE) CLASSTYPE_MARKED_N (NODE, 0)
1364 #define CLASSTYPE_MARKED2(NODE) CLASSTYPE_MARKED_N (NODE, 1)
1365 #define CLASSTYPE_MARKED3(NODE) CLASSTYPE_MARKED_N (NODE, 2)
1366 #define CLASSTYPE_MARKED4(NODE) CLASSTYPE_MARKED_N (NODE, 3)
1367 #define CLASSTYPE_MARKED5(NODE) CLASSTYPE_MARKED_N (NODE, 4)
1368 #define CLASSTYPE_MARKED6(NODE) CLASSTYPE_MARKED_N (NODE, 5)
1370 /* Macros to modify the above flags */
1371 #define SET_CLASSTYPE_MARKED(NODE) SET_CLASSTYPE_MARKED_N (NODE, 0)
1372 #define CLEAR_CLASSTYPE_MARKED(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 0)
1373 #define SET_CLASSTYPE_MARKED2(NODE) SET_CLASSTYPE_MARKED_N (NODE, 1)
1374 #define CLEAR_CLASSTYPE_MARKED2(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 1)
1375 #define SET_CLASSTYPE_MARKED3(NODE) SET_CLASSTYPE_MARKED_N (NODE, 2)
1376 #define CLEAR_CLASSTYPE_MARKED3(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 2)
1377 #define SET_CLASSTYPE_MARKED4(NODE) SET_CLASSTYPE_MARKED_N (NODE, 3)
1378 #define CLEAR_CLASSTYPE_MARKED4(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 3)
1379 #define SET_CLASSTYPE_MARKED5(NODE) SET_CLASSTYPE_MARKED_N (NODE, 4)
1380 #define CLEAR_CLASSTYPE_MARKED5(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 4)
1381 #define SET_CLASSTYPE_MARKED6(NODE) SET_CLASSTYPE_MARKED_N (NODE, 5)
1382 #define CLEAR_CLASSTYPE_MARKED6(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 5)
1384 /* A list of the nested tag-types (class, struct, union, or enum)
1385 found within this class. The TREE_PURPOSE of each node is the name
1386 of the type; the TREE_VALUE is the type itself. This list includes
1387 nested member class templates. */
1388 #define CLASSTYPE_TAGS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->tags)
1390 /* Nonzero if NODE has a primary base class, i.e., a base class with
1391 which it shares the virtual function table pointer. */
1392 #define CLASSTYPE_HAS_PRIMARY_BASE_P(NODE) \
1393 (CLASSTYPE_PRIMARY_BINFO (NODE) != NULL_TREE)
1395 /* If non-NULL, this is the binfo for the primary base class, i.e.,
1396 the base class which contains the virtual function table pointer
1398 #define CLASSTYPE_PRIMARY_BINFO(NODE) \
1399 (LANG_TYPE_CLASS_CHECK (NODE)->primary_base)
1401 /* A chain of BINFOs for the direct and indirect virtual base classes
1402 that this type uses in a post-order depth-first left-to-right
1403 order. (In other words, these bases appear in the order that they
1404 should be initialized.) */
1405 #define CLASSTYPE_VBASECLASSES(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vbases)
1407 /* Number of direct baseclasses of NODE. */
1408 #define CLASSTYPE_N_BASECLASSES(NODE) \
1409 (BINFO_N_BASETYPES (TYPE_BINFO (NODE)))
1411 /* The type corresponding to NODE when NODE is used as a base class,
1412 i.e., NODE without virtual base classes. */
1414 #define CLASSTYPE_AS_BASE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->as_base)
1416 /* These are the size and alignment of the type without its virtual
1417 base classes, for when we use this type as a base itself. */
1418 #define CLASSTYPE_SIZE(NODE) TYPE_SIZE (CLASSTYPE_AS_BASE (NODE))
1419 #define CLASSTYPE_SIZE_UNIT(NODE) TYPE_SIZE_UNIT (CLASSTYPE_AS_BASE (NODE))
1420 #define CLASSTYPE_ALIGN(NODE) TYPE_ALIGN (CLASSTYPE_AS_BASE (NODE))
1421 #define CLASSTYPE_USER_ALIGN(NODE) TYPE_USER_ALIGN (CLASSTYPE_AS_BASE (NODE))
1423 /* The alignment of NODE, without its virtual bases, in bytes. */
1424 #define CLASSTYPE_ALIGN_UNIT(NODE) \
1425 (CLASSTYPE_ALIGN (NODE) / BITS_PER_UNIT)
1427 /* True if this a Java interface type, declared with
1428 '__attribute__ ((java_interface))'. */
1429 #define TYPE_JAVA_INTERFACE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->java_interface)
1431 /* A cons list of virtual functions which cannot be inherited by
1432 derived classes. When deriving from this type, the derived
1433 class must provide its own definition for each of these functions. */
1434 #define CLASSTYPE_PURE_VIRTUALS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->pure_virtuals)
1436 /* Nonzero means that this aggr type has been `closed' by a semicolon. */
1437 #define CLASSTYPE_GOT_SEMICOLON(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->got_semicolon)
1439 /* Nonzero means that this type has an X() constructor. */
1440 #define TYPE_HAS_DEFAULT_CONSTRUCTOR(NODE) \
1441 (LANG_TYPE_CLASS_CHECK (NODE)->h.has_default_ctor)
1443 /* Nonzero means that this type contains a mutable member */
1444 #define CLASSTYPE_HAS_MUTABLE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_mutable)
1445 #define TYPE_HAS_MUTABLE_P(NODE) (cp_has_mutable_p (NODE))
1447 /* Nonzero means that this class type is a non-POD class. */
1448 #define CLASSTYPE_NON_POD_P(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->non_pod_class)
1450 /* Nonzero means that this class contains pod types whose default
1451 initialization is not a zero initialization (namely, pointers to
1453 #define CLASSTYPE_NON_ZERO_INIT_P(NODE) \
1454 (LANG_TYPE_CLASS_CHECK (NODE)->non_zero_init)
1456 /* Nonzero if this class is "empty" in the sense of the C++ ABI. */
1457 #define CLASSTYPE_EMPTY_P(NODE) \
1458 (LANG_TYPE_CLASS_CHECK (NODE)->empty_p)
1460 /* Nonzero if this class is "nearly empty", i.e., contains only a
1461 virtual function table pointer. */
1462 #define CLASSTYPE_NEARLY_EMPTY_P(NODE) \
1463 (LANG_TYPE_CLASS_CHECK (NODE)->nearly_empty_p)
1465 /* Nonzero if this class contains an empty subobject. */
1466 #define CLASSTYPE_CONTAINS_EMPTY_CLASS_P(NODE) \
1467 (LANG_TYPE_CLASS_CHECK (NODE)->contains_empty_class_p)
1469 /* A list of class types of which this type is a friend. The
1470 TREE_VALUE is normally a TYPE, but will be a TEMPLATE_DECL in the
1471 case of a template friend. */
1472 #define CLASSTYPE_FRIEND_CLASSES(NODE) \
1473 (LANG_TYPE_CLASS_CHECK (NODE)->friend_classes)
1475 /* A list of the classes which grant friendship to this class. */
1476 #define CLASSTYPE_BEFRIENDING_CLASSES(NODE) \
1477 (LANG_TYPE_CLASS_CHECK (NODE)->befriending_classes)
1479 /* Say whether this node was declared as a "class" or a "struct". */
1480 #define CLASSTYPE_DECLARED_CLASS(NODE) \
1481 (LANG_TYPE_CLASS_CHECK (NODE)->declared_class)
1483 /* Nonzero if this class has const members
1484 which have no specified initialization. */
1485 #define CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE) \
1486 (TYPE_LANG_SPECIFIC (NODE) \
1487 ? LANG_TYPE_CLASS_CHECK (NODE)->h.const_needs_init : 0)
1488 #define SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE, VALUE) \
1489 (LANG_TYPE_CLASS_CHECK (NODE)->h.const_needs_init = (VALUE))
1491 /* Nonzero if this class has ref members
1492 which have no specified initialization. */
1493 #define CLASSTYPE_REF_FIELDS_NEED_INIT(NODE) \
1494 (TYPE_LANG_SPECIFIC (NODE) \
1495 ? LANG_TYPE_CLASS_CHECK (NODE)->h.ref_needs_init : 0)
1496 #define SET_CLASSTYPE_REF_FIELDS_NEED_INIT(NODE, VALUE) \
1497 (LANG_TYPE_CLASS_CHECK (NODE)->h.ref_needs_init = (VALUE))
1499 /* Nonzero if this class is included from a header file which employs
1500 `#pragma interface', and it is not included in its implementation file. */
1501 #define CLASSTYPE_INTERFACE_ONLY(NODE) \
1502 (LANG_TYPE_CLASS_CHECK (NODE)->interface_only)
1504 /* True if we have already determined whether or not vtables, VTTs,
1505 typeinfo, and other similar per-class data should be emitted in
1506 this translation unit. This flag does not indicate whether or not
1507 these items should be emitted; it only indicates that we know one
1508 way or the other. */
1509 #define CLASSTYPE_INTERFACE_KNOWN(NODE) \
1510 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown == 0)
1511 /* The opposite of CLASSTYPE_INTERFANCE_KNOWN. */
1512 #define CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
1513 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown)
1515 #define SET_CLASSTYPE_INTERFACE_UNKNOWN_X(NODE,X) \
1516 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = !!(X))
1517 #define SET_CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
1518 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 1)
1519 #define SET_CLASSTYPE_INTERFACE_KNOWN(NODE) \
1520 (LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 0)
1522 /* Nonzero if a _DECL node requires us to output debug info for this class. */
1523 #define CLASSTYPE_DEBUG_REQUESTED(NODE) \
1524 (LANG_TYPE_CLASS_CHECK (NODE)->debug_requested)
1526 /* Additional macros for inheritance information. */
1528 /* The BINFO_INHERITANCE_CHAIN is used opposite to the description in
1529 gcc/tree.h. In particular if D is non-virtually derived from B
1530 then the BINFO for B (in D) will have a BINFO_INHERITANCE_CHAIN
1531 pointing to D. If D is virtually derived, its
1532 BINFO_INHERITANCE_CHAIN will point to the most derived binfo. In
1533 tree.h, this pointer is described as pointing in other
1534 direction. The binfos of virtual bases are shared. */
1536 /* Nonzero means marked by DFS or BFS search. */
1537 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (NODE)
1539 /* Nonzero means that this class is on a path leading to a new vtable. */
1540 #define BINFO_VTABLE_PATH_MARKED(NODE) TREE_LANG_FLAG_3 (NODE)
1542 /* Nonzero means B (a BINFO) has its own vtable. Any copies will not
1543 have this flag set. */
1544 #define BINFO_NEW_VTABLE_MARKED(B) (TREE_LANG_FLAG_4 (B))
1546 /* Any subobject that needs a new vtable must have a vptr and must not
1547 be a non-virtual primary base (since it would then use the vtable from a
1548 derived class and never become non-primary.) */
1549 #define SET_BINFO_NEW_VTABLE_MARKED(B) \
1550 (BINFO_NEW_VTABLE_MARKED (B) = 1, \
1551 my_friendly_assert (!BINFO_PRIMARY_P (B) \
1552 || TREE_VIA_VIRTUAL (B), 20000517), \
1553 my_friendly_assert (CLASSTYPE_VFIELDS (BINFO_TYPE (B)) != NULL_TREE, \
1556 /* Nonzero means this class has done dfs_pushdecls. */
1557 #define BINFO_PUSHDECLS_MARKED(NODE) BINFO_VTABLE_PATH_MARKED (NODE)
1559 /* Nonzero if this BINFO is a primary base class. Note, this can be
1560 set for non-canononical virtual bases. For a virtual primary base
1561 you might also need to check whether it is canonical. */
1563 #define BINFO_PRIMARY_P(NODE) \
1564 (BINFO_PRIMARY_BASE_OF (NODE) != NULL_TREE)
1566 /* The index in the VTT where this subobject's sub-VTT can be found.
1567 NULL_TREE if there is no sub-VTT. */
1568 #define BINFO_SUBVTT_INDEX(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 0)
1570 /* The index in the VTT where the vptr for this subobject can be
1571 found. NULL_TREE if there is no secondary vptr in the VTT. */
1572 #define BINFO_VPTR_INDEX(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 1)
1574 /* The binfo of which NODE is a primary base. (This is different from
1575 BINFO_INHERITANCE_CHAIN for virtual base because a virtual base is
1576 sometimes a primary base for a class for which it is not an
1578 #define BINFO_PRIMARY_BASE_OF(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 2)
1580 /* C++ binfos have 3 additional entries. */
1582 #define BINFO_LANG_ELTS (BINFO_ELTS + 3)
1584 /* Nonzero if this binfo is for a dependent base - one that should not
1586 #define BINFO_DEPENDENT_BASE_P(NODE) TREE_LANG_FLAG_1(NODE)
1588 /* Nonzero if this binfo has lost its primary base binfo (because that
1589 is a nearly-empty virtual base that has been taken by some other
1590 base in the complete hierarchy. */
1591 #define BINFO_LOST_PRIMARY_P(NODE) TREE_LANG_FLAG_2 (NODE)
1593 /* Nonzero if this binfo is an indirect primary base, i.e. a virtual
1594 base that is a primary base of some of other class in the
1596 #define BINFO_INDIRECT_PRIMARY_P(NODE) TREE_USED (NODE)
1598 /* Used by various search routines. */
1599 #define IDENTIFIER_MARKED(NODE) TREE_LANG_FLAG_0 (NODE)
1601 /* A TREE_LIST of the vcall indices associated with the class NODE.
1602 The TREE_PURPOSE of each node is a FUNCTION_DECL for a virtual
1603 function. The TREE_VALUE is the index into the virtual table where
1604 the vcall offset for that function is stored, when NODE is a
1606 #define CLASSTYPE_VCALL_INDICES(NODE) \
1607 (LANG_TYPE_CLASS_CHECK (NODE)->vcall_indices)
1609 /* The various vtables for the class NODE. The primary vtable will be
1610 first, followed by the construction vtables and VTT, if any. */
1611 #define CLASSTYPE_VTABLES(NODE) \
1612 (LANG_TYPE_CLASS_CHECK (NODE)->vtables)
1614 /* The std::type_info variable representing this class, or NULL if no
1615 such variable has been created. This field is only set for the
1616 TYPE_MAIN_VARIANT of the class. */
1617 #define CLASSTYPE_TYPEINFO_VAR(NODE) \
1618 (LANG_TYPE_CLASS_CHECK (NODE)->typeinfo_var)
1620 /* Accessor macros for the vfield slots in structures. */
1622 /* List of virtual table fields that this type contains (both the primary
1623 and secondaries). The TREE_VALUE is the class type where the vtable
1624 field was introduced. For a vtable field inherited from the primary
1625 base, or introduced by this class, the TREE_PURPOSE is NULL. For
1626 other vtable fields (those from non-primary bases), the
1627 TREE_PURPOSE is the BINFO of the base through which the vtable was
1629 #define CLASSTYPE_VFIELDS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vfields)
1631 /* Get the BINFO that introduced this vtable into the hierarchy (will
1632 be NULL for those created at this level, or from a primary
1634 #define VF_BINFO_VALUE(NODE) TREE_PURPOSE (NODE)
1636 /* Get the TYPE that introduced this vtable into the hierarchy (always
1638 #define VF_BASETYPE_VALUE(NODE) TREE_VALUE (NODE)
1640 /* Accessor macros for the BINFO_VIRTUALS list. */
1642 /* The number of bytes by which to adjust the `this' pointer when
1643 calling this virtual function. Subtract this value from the this
1644 pointer. Always non-NULL, might be constant zero though. */
1645 #define BV_DELTA(NODE) (TREE_PURPOSE (NODE))
1647 /* If non-NULL, the vtable index at which to find the vcall offset
1648 when calling this virtual function. Add the value at that vtable
1649 index to the this pointer. */
1650 #define BV_VCALL_INDEX(NODE) (TREE_TYPE (NODE))
1652 /* The function to call. */
1653 #define BV_FN(NODE) (TREE_VALUE (NODE))
1656 /* Nonzero for TREE_LIST node means that this list of things
1657 is a list of parameters, as opposed to a list of expressions. */
1658 #define TREE_PARMLIST(NODE) (TREE_LANG_FLAG_2 (NODE))
1660 /* Nonzero for a parmlist means that this parmlist ended in ... */
1661 #define PARMLIST_ELLIPSIS_P(NODE) TREE_LANG_FLAG_0 (NODE)
1663 /* For FUNCTION_TYPE or METHOD_TYPE, a list of the exceptions that
1664 this type can raise. Each TREE_VALUE is a _TYPE. The TREE_VALUE
1665 will be NULL_TREE to indicate a throw specification of `()', or
1666 no exceptions allowed. */
1667 #define TYPE_RAISES_EXCEPTIONS(NODE) TYPE_BINFO (NODE)
1669 /* For FUNCTION_TYPE or METHOD_TYPE, return 1 iff it is declared `throw()'. */
1670 #define TYPE_NOTHROW_P(NODE) \
1671 (TYPE_RAISES_EXCEPTIONS (NODE) \
1672 && TREE_VALUE (TYPE_RAISES_EXCEPTIONS (NODE)) == NULL_TREE)
1674 /* The binding level associated with the namespace. */
1675 #define NAMESPACE_LEVEL(NODE) \
1676 (DECL_LANG_SPECIFIC (NODE)->decl_flags.u.level)
1679 /* If a DECL has DECL_LANG_SPECIFIC, it is either a lang_decl_flags or
1680 a lang_decl (which has lang_decl_flags as its initial prefix).
1681 This macro is nonzero for tree nodes whose DECL_LANG_SPECIFIC is
1682 the full lang_decl, and not just lang_decl_flags. */
1683 #define CAN_HAVE_FULL_LANG_DECL_P(NODE) \
1684 (!(TREE_CODE (NODE) == VAR_DECL \
1685 || TREE_CODE (NODE) == CONST_DECL \
1686 || TREE_CODE (NODE) == FIELD_DECL \
1687 || TREE_CODE (NODE) == USING_DECL))
1689 struct lang_decl_flags GTY(())
1691 struct c_lang_decl base;
1693 ENUM_BITFIELD(languages) language : 8;
1695 unsigned operator_attr : 1;
1696 unsigned constructor_attr : 1;
1697 unsigned destructor_attr : 1;
1698 unsigned friend_attr : 1;
1699 unsigned static_function : 1;
1700 unsigned pure_virtual : 1;
1701 unsigned has_in_charge_parm_p : 1;
1702 unsigned has_vtt_parm_p : 1;
1704 unsigned deferred : 1;
1705 unsigned use_template : 2;
1706 unsigned nonconverting : 1;
1707 unsigned not_really_extern : 1;
1708 unsigned needs_final_overrider : 1;
1709 unsigned initialized_in_class : 1;
1710 unsigned assignment_operator_p : 1;
1712 unsigned global_ctor_p : 1;
1713 unsigned global_dtor_p : 1;
1714 unsigned anticipated_p : 1;
1715 unsigned template_conv_p : 1;
1718 unsigned can_be_full : 1;
1719 unsigned this_thunk_p : 1;
1722 /* In a FUNCTION_DECL, VAR_DECL, TYPE_DECL, or TEMPLATE_DECL, this
1723 is DECL_TEMPLATE_INFO. */
1724 tree GTY ((tag ("0"))) template_info;
1726 /* In a NAMESPACE_DECL, this is NAMESPACE_LEVEL. */
1727 struct cp_binding_level * GTY ((tag ("1"))) level;
1728 } GTY ((desc ("%1.u1sel"))) u;
1730 union lang_decl_u2 {
1731 /* This is DECL_ACCESS. */
1732 tree GTY ((tag ("0"))) access;
1734 /* For VAR_DECL in function, this is DECL_DISCRIMINATOR. */
1735 int GTY ((tag ("1"))) discriminator;
1737 /* In a FUNCTION_DECL for which DECL_THUNK_P holds, this is
1738 THUNK_VIRTUAL_OFFSET. */
1739 tree GTY((tag ("2"))) virtual_offset;
1740 } GTY ((desc ("%1.u2sel"))) u2;
1743 /* sorted_fields is sorted based on a pointer, so we need to be able
1744 to resort it if pointers get rearranged. */
1746 struct lang_decl GTY(())
1748 struct lang_decl_flags decl_flags;
1752 struct full_lang_decl
1754 /* For a non-thunk function decl, this is a tree list of
1755 friendly classes. For a thunk function decl, it is the
1756 thunked to function decl. */
1757 tree befriending_classes;
1759 /* For a non-virtual FUNCTION_DECL, this is
1760 DECL_FRIEND_CONTEXT. For a virtual FUNCTION_DECL for which
1761 DECL_THIS_THUNK_P does not hold, this is DECL_THUNKS. Both
1762 this pointer and result pointer adjusting thunks are
1763 chained here. This pointer thunks to return pointer thunks
1764 will be chained on the return pointer thunk. */
1767 /* In a FUNCTION_DECL, this is DECL_CLONED_FUNCTION. */
1768 tree cloned_function;
1770 /* In a FUNCTION_DECL for which THUNK_P holds, this is
1771 THUNK_FIXED_OFFSET. */
1772 HOST_WIDE_INT fixed_offset;
1774 /* In an overloaded operator, this is the value of
1775 DECL_OVERLOADED_OPERATOR_P. */
1776 enum tree_code operator_code;
1779 unsigned pending_inline_p : 1;
1783 tree GTY ((tag ("0"), reorder ("resort_sorted_fields")))
1785 struct cp_token_cache * GTY ((tag ("2"))) pending_inline_info;
1786 struct language_function * GTY ((tag ("1")))
1787 saved_language_function;
1788 } GTY ((desc ("%1.u3sel + %1.pending_inline_p"))) u;
1789 } GTY ((tag ("1"))) f;
1790 } GTY ((desc ("%1.decl_flags.can_be_full"))) u;
1793 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
1795 #define LANG_DECL_U2_CHECK(NODE, TF) \
1796 ({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
1797 if (lt->decl_flags.u2sel != TF) \
1798 lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
1799 <->decl_flags.u2; })
1803 #define LANG_DECL_U2_CHECK(NODE, TF) \
1804 (&DECL_LANG_SPECIFIC (NODE)->decl_flags.u2)
1806 #endif /* ENABLE_TREE_CHECKING */
1808 /* DECL_NEEDED_P holds of a declaration when we need to emit its
1809 definition. This is true when the back-end tells us that
1810 the symbol has been referenced in the generated code. If, however,
1811 we are not generating code, then it is also true when a symbol has
1812 just been used somewhere, even if it's not really needed. We need
1813 anything that isn't comdat, but we don't know for sure whether or
1814 not something is comdat until end-of-file. */
1815 #define DECL_NEEDED_P(DECL) \
1816 ((at_eof && TREE_PUBLIC (DECL) && !DECL_COMDAT (DECL)) \
1817 || (DECL_ASSEMBLER_NAME_SET_P (DECL) \
1818 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (DECL))) \
1819 || (flag_syntax_only && TREE_USED (DECL)))
1821 /* For a FUNCTION_DECL or a VAR_DECL, the language linkage for the
1822 declaration. Some entities (like a member function in a local
1823 class, or a local variable) do not have linkage at all, and this
1824 macro should not be used in those cases.
1826 Implementation note: A FUNCTION_DECL without DECL_LANG_SPECIFIC was
1827 created by language-independent code, and has C linkage. Most
1828 VAR_DECLs have C++ linkage, and do not have DECL_LANG_SPECIFIC, but
1829 we do create DECL_LANG_SPECIFIC for variables with non-C++ linkage. */
1830 #define DECL_LANGUAGE(NODE) \
1831 (DECL_LANG_SPECIFIC (NODE) \
1832 ? DECL_LANG_SPECIFIC (NODE)->decl_flags.language \
1833 : (TREE_CODE (NODE) == FUNCTION_DECL \
1834 ? lang_c : lang_cplusplus))
1836 /* Set the language linkage for NODE to LANGUAGE. */
1837 #define SET_DECL_LANGUAGE(NODE, LANGUAGE) \
1838 (DECL_LANG_SPECIFIC (NODE)->decl_flags.language = (LANGUAGE))
1840 /* For FUNCTION_DECLs: nonzero means that this function is a constructor. */
1841 #define DECL_CONSTRUCTOR_P(NODE) \
1842 (DECL_LANG_SPECIFIC (NODE)->decl_flags.constructor_attr)
1844 /* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a complete
1846 #define DECL_COMPLETE_CONSTRUCTOR_P(NODE) \
1847 (DECL_CONSTRUCTOR_P (NODE) \
1848 && DECL_NAME (NODE) == complete_ctor_identifier)
1850 /* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a base
1852 #define DECL_BASE_CONSTRUCTOR_P(NODE) \
1853 (DECL_CONSTRUCTOR_P (NODE) \
1854 && DECL_NAME (NODE) == base_ctor_identifier)
1856 /* Nonzero if NODE (a FUNCTION_DECL) is a constructor, but not either the
1857 specialized in-charge constructor or the specialized not-in-charge
1859 #define DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P(NODE) \
1860 (DECL_CONSTRUCTOR_P (NODE) && !DECL_CLONED_FUNCTION_P (NODE))
1862 /* Nonzero if NODE (a FUNCTION_DECL) is a copy constructor. */
1863 #define DECL_COPY_CONSTRUCTOR_P(NODE) \
1864 (DECL_CONSTRUCTOR_P (NODE) && copy_fn_p (NODE) > 0)
1866 /* Nonzero if NODE is a destructor. */
1867 #define DECL_DESTRUCTOR_P(NODE) \
1868 (DECL_LANG_SPECIFIC (NODE)->decl_flags.destructor_attr)
1870 /* Nonzero if NODE (a FUNCTION_DECL) is a destructor, but not the
1871 specialized in-charge constructor, in-charge deleting constructor,
1872 or the the base destructor. */
1873 #define DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P(NODE) \
1874 (DECL_DESTRUCTOR_P (NODE) && !DECL_CLONED_FUNCTION_P (NODE))
1876 /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
1878 #define DECL_COMPLETE_DESTRUCTOR_P(NODE) \
1879 (DECL_DESTRUCTOR_P (NODE) \
1880 && DECL_NAME (NODE) == complete_dtor_identifier)
1882 /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a base
1884 #define DECL_BASE_DESTRUCTOR_P(NODE) \
1885 (DECL_DESTRUCTOR_P (NODE) \
1886 && DECL_NAME (NODE) == base_dtor_identifier)
1888 /* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
1889 object that deletes the object after it has been destroyed. */
1890 #define DECL_DELETING_DESTRUCTOR_P(NODE) \
1891 (DECL_DESTRUCTOR_P (NODE) \
1892 && DECL_NAME (NODE) == deleting_dtor_identifier)
1894 /* Nonzero if NODE (a FUNCTION_DECL) is a cloned constructor or
1896 #define DECL_CLONED_FUNCTION_P(NODE) \
1897 ((TREE_CODE (NODE) == FUNCTION_DECL \
1898 || TREE_CODE (NODE) == TEMPLATE_DECL) \
1899 && DECL_LANG_SPECIFIC (NODE) \
1900 && DECL_CLONED_FUNCTION (NODE) != NULL_TREE)
1902 /* If DECL_CLONED_FUNCTION_P holds, this is the function that was
1904 #define DECL_CLONED_FUNCTION(NODE) \
1905 (DECL_LANG_SPECIFIC (NODE)->u.f.cloned_function)
1907 /* Nonzero if NODE has DECL_DISCRIMINATOR and not DECL_ACCESS. */
1908 #define DECL_DISCRIMINATOR_P(NODE) \
1909 (TREE_CODE (NODE) == VAR_DECL \
1910 && DECL_FUNCTION_SCOPE_P (NODE))
1912 /* Discriminator for name mangling. */
1913 #define DECL_DISCRIMINATOR(NODE) (LANG_DECL_U2_CHECK (NODE, 1)->discriminator)
1915 /* Nonzero if the VTT parm has been added to NODE. */
1916 #define DECL_HAS_VTT_PARM_P(NODE) \
1917 (DECL_LANG_SPECIFIC (NODE)->decl_flags.has_vtt_parm_p)
1919 /* Nonzero if NODE is a FUNCTION_DECL for which a VTT parameter is
1921 #define DECL_NEEDS_VTT_PARM_P(NODE) \
1922 (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (NODE)) \
1923 && (DECL_BASE_CONSTRUCTOR_P (NODE) \
1924 || DECL_BASE_DESTRUCTOR_P (NODE)))
1926 /* Nonzero if NODE is a user-defined conversion operator. */
1927 #define DECL_CONV_FN_P(NODE) \
1928 (IDENTIFIER_TYPENAME_P (DECL_NAME (NODE)))
1930 /* Nonzero if NODE, which is a TEMPLATE_DECL, is a template
1931 conversion operator to a type dependent on the innermost template
1933 #define DECL_TEMPLATE_CONV_FN_P(NODE) \
1934 (DECL_LANG_SPECIFIC (NODE)->decl_flags.template_conv_p)
1936 /* Set the overloaded operator code for NODE to CODE. */
1937 #define SET_OVERLOADED_OPERATOR_CODE(NODE, CODE) \
1938 (DECL_LANG_SPECIFIC (NODE)->u.f.operator_code = (CODE))
1940 /* If NODE is an overloaded operator, then this returns the TREE_CODE
1941 associcated with the overloaded operator.
1942 DECL_ASSIGNMENT_OPERATOR_P must also be checked to determine
1943 whether or not NODE is an assignment operator. If NODE is not an
1944 overloaded operator, ERROR_MARK is returned. Since the numerical
1945 value of ERROR_MARK is zero, this macro can be used as a predicate
1946 to test whether or not NODE is an overloaded operator. */
1947 #define DECL_OVERLOADED_OPERATOR_P(NODE) \
1948 (IDENTIFIER_OPNAME_P (DECL_NAME (NODE)) \
1949 ? DECL_LANG_SPECIFIC (NODE)->u.f.operator_code : ERROR_MARK)
1951 /* Nonzero if NODE is an assignment operator. */
1952 #define DECL_ASSIGNMENT_OPERATOR_P(NODE) \
1953 (DECL_LANG_SPECIFIC (NODE)->decl_flags.assignment_operator_p)
1955 /* For FUNCTION_DECLs: nonzero means that this function is a
1956 constructor or a destructor with an extra in-charge parameter to
1957 control whether or not virtual bases are constructed. */
1958 #define DECL_HAS_IN_CHARGE_PARM_P(NODE) \
1959 (DECL_LANG_SPECIFIC (NODE)->decl_flags.has_in_charge_parm_p)
1961 /* Nonzero if NODE is an overloaded `operator delete[]' function. */
1962 #define DECL_ARRAY_DELETE_OPERATOR_P(NODE) \
1963 (DECL_OVERLOADED_OPERATOR_P (NODE) == VEC_DELETE_EXPR)
1965 /* Nonzero for _DECL means that this decl appears in (or will appear
1966 in) as a member in a RECORD_TYPE or UNION_TYPE node. It is also for
1967 detecting circularity in case members are multiply defined. In the
1968 case of a VAR_DECL, it is also used to determine how program storage
1969 should be allocated. */
1970 #define DECL_IN_AGGR_P(NODE) (DECL_LANG_FLAG_3 (NODE))
1972 /* Nonzero for a VAR_DECL means that the variable's initialization has
1974 #define DECL_INITIALIZED_P(NODE) \
1975 (TREE_LANG_FLAG_1 (VAR_DECL_CHECK (NODE)))
1977 /* Nonzero if the DECL was initialized in the class definition itself,
1978 rather than outside the class. */
1979 #define DECL_INITIALIZED_IN_CLASS_P(DECL) \
1980 (DECL_LANG_SPECIFIC (DECL)->decl_flags.initialized_in_class)
1982 /* Nonzero for FUNCTION_DECL means that this decl is just a
1983 friend declaration, and should not be added to the list of
1984 member functions for this class. */
1985 #define DECL_FRIEND_P(NODE) (DECL_LANG_SPECIFIC (NODE)->decl_flags.friend_attr)
1987 /* A TREE_LIST of the types which have befriended this FUNCTION_DECL. */
1988 #define DECL_BEFRIENDING_CLASSES(NODE) \
1989 (DECL_LANG_SPECIFIC (NODE)->u.f.befriending_classes)
1991 /* Nonzero for FUNCTION_DECL means that this decl is a static
1993 #define DECL_STATIC_FUNCTION_P(NODE) \
1994 (DECL_LANG_SPECIFIC (NODE)->decl_flags.static_function)
1996 /* Nonzero for FUNCTION_DECL means that this decl is a non-static
1998 #define DECL_NONSTATIC_MEMBER_FUNCTION_P(NODE) \
1999 (TREE_CODE (TREE_TYPE (NODE)) == METHOD_TYPE)
2001 /* Nonzero for FUNCTION_DECL means that this decl is a member function
2002 (static or non-static). */
2003 #define DECL_FUNCTION_MEMBER_P(NODE) \
2004 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) || DECL_STATIC_FUNCTION_P (NODE))
2006 /* Nonzero for FUNCTION_DECL means that this member function
2007 has `this' as const X *const. */
2008 #define DECL_CONST_MEMFUNC_P(NODE) \
2009 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
2010 && CP_TYPE_CONST_P (TREE_TYPE (TREE_VALUE \
2011 (TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
2013 /* Nonzero for FUNCTION_DECL means that this member function
2014 has `this' as volatile X *const. */
2015 #define DECL_VOLATILE_MEMFUNC_P(NODE) \
2016 (DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
2017 && CP_TYPE_VOLATILE_P (TREE_TYPE (TREE_VALUE \
2018 (TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
2020 /* Nonzero for a DECL means that this member is a non-static member. */
2021 #define DECL_NONSTATIC_MEMBER_P(NODE) \
2022 ((TREE_CODE (NODE) == FUNCTION_DECL \
2023 && DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE)) \
2024 || TREE_CODE (NODE) == FIELD_DECL)
2026 /* Nonzero for _DECL means that this member object type
2028 #define DECL_MUTABLE_P(NODE) (DECL_LANG_FLAG_0 (NODE))
2030 /* Nonzero for _DECL means that this constructor is a non-converting
2032 #define DECL_NONCONVERTING_P(NODE) \
2033 (DECL_LANG_SPECIFIC (NODE)->decl_flags.nonconverting)
2035 /* Nonzero for FUNCTION_DECL means that this member function is a pure
2036 virtual function. */
2037 #define DECL_PURE_VIRTUAL_P(NODE) \
2038 (DECL_LANG_SPECIFIC (NODE)->decl_flags.pure_virtual)
2040 /* Nonzero for FUNCTION_DECL means that this member function
2041 must be overridden by derived classes. */
2042 #define DECL_NEEDS_FINAL_OVERRIDER_P(NODE) \
2043 (DECL_LANG_SPECIFIC (NODE)->decl_flags.needs_final_overrider)
2045 /* The thunks associated with NODE, a FUNCTION_DECL. */
2046 #define DECL_THUNKS(NODE) \
2047 (DECL_LANG_SPECIFIC (NODE)->u.f.context)
2049 /* Nonzero if NODE is a thunk, rather than an ordinary function. */
2050 #define DECL_THUNK_P(NODE) \
2051 (TREE_CODE (NODE) == FUNCTION_DECL \
2052 && DECL_LANG_FLAG_7 (NODE))
2054 /* Nonzero if NODE is a this pointer adjusting thunk. */
2055 #define DECL_THIS_THUNK_P(NODE) \
2056 (DECL_THUNK_P (NODE) && DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p)
2058 /* Nonzero if NODE is a result pointer adjusting thunk. */
2059 #define DECL_RESULT_THUNK_P(NODE) \
2060 (DECL_THUNK_P (NODE) && !DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p)
2062 /* Nonzero if NODE is a FUNCTION_DECL, but not a thunk. */
2063 #define DECL_NON_THUNK_FUNCTION_P(NODE) \
2064 (TREE_CODE (NODE) == FUNCTION_DECL && !DECL_THUNK_P (NODE))
2066 /* Nonzero if NODE is `extern "C"'. */
2067 #define DECL_EXTERN_C_P(NODE) \
2068 (DECL_LANGUAGE (NODE) == lang_c)
2070 /* Nonzero if NODE is an `extern "C"' function. */
2071 #define DECL_EXTERN_C_FUNCTION_P(NODE) \
2072 (DECL_NON_THUNK_FUNCTION_P (NODE) && DECL_EXTERN_C_P (NODE))
2074 /* Set DECL_THUNK_P for node. */
2075 #define SET_DECL_THUNK_P(NODE, THIS_ADJUSTING) \
2076 (DECL_LANG_FLAG_7 (NODE) = 1, \
2077 DECL_LANG_SPECIFIC (NODE)->u.f.u3sel = 1, \
2078 DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p = (THIS_ADJUSTING))
2080 /* Nonzero if this DECL is the __PRETTY_FUNCTION__ variable in a
2081 template function. */
2082 #define DECL_PRETTY_FUNCTION_P(NODE) \
2083 (TREE_LANG_FLAG_0 (NODE))
2085 /* The _TYPE context in which this _DECL appears. This field holds the
2086 class where a virtual function instance is actually defined. */
2087 #define DECL_CLASS_CONTEXT(NODE) \
2088 (DECL_CLASS_SCOPE_P (NODE) ? DECL_CONTEXT (NODE) : NULL_TREE)
2090 /* For a non-member friend function, the class (if any) in which this
2091 friend was defined. For example, given:
2093 struct S { friend void f (); };
2095 the DECL_FRIEND_CONTEXT for `f' will be `S'. */
2096 #define DECL_FRIEND_CONTEXT(NODE) \
2097 ((DECL_FRIEND_P (NODE) && !DECL_FUNCTION_MEMBER_P (NODE)) \
2098 ? DECL_LANG_SPECIFIC (NODE)->u.f.context \
2101 /* Set the DECL_FRIEND_CONTEXT for NODE to CONTEXT. */
2102 #define SET_DECL_FRIEND_CONTEXT(NODE, CONTEXT) \
2103 (DECL_LANG_SPECIFIC (NODE)->u.f.context = (CONTEXT))
2105 /* NULL_TREE in DECL_CONTEXT represents the global namespace. */
2106 #define CP_DECL_CONTEXT(NODE) \
2107 (DECL_CONTEXT (NODE) ? DECL_CONTEXT (NODE) : global_namespace)
2108 #define FROB_CONTEXT(NODE) ((NODE) == global_namespace ? NULL_TREE : (NODE))
2110 /* 1 iff NODE has namespace scope, including the global namespace. */
2111 #define DECL_NAMESPACE_SCOPE_P(NODE) \
2112 (!DECL_TEMPLATE_PARM_P (NODE) \
2113 && TREE_CODE (CP_DECL_CONTEXT (NODE)) == NAMESPACE_DECL)
2115 /* 1 iff NODE is a class member. */
2116 #define DECL_CLASS_SCOPE_P(NODE) \
2117 (DECL_CONTEXT (NODE) && TYPE_P (DECL_CONTEXT (NODE)))
2119 /* 1 iff NODE is function-local. */
2120 #define DECL_FUNCTION_SCOPE_P(NODE) \
2121 (DECL_CONTEXT (NODE) \
2122 && TREE_CODE (DECL_CONTEXT (NODE)) == FUNCTION_DECL)
2124 /* 1 iff NODE is function-local, but for types. */
2125 #define LOCAL_CLASS_P(NODE) \
2126 (decl_function_context (TYPE_MAIN_DECL (NODE)) != NULL_TREE)
2128 /* For a NAMESPACE_DECL: the list of using namespace directives
2129 The PURPOSE is the used namespace, the value is the namespace
2130 that is the common ancestor. */
2131 #define DECL_NAMESPACE_USING(NODE) DECL_VINDEX (NAMESPACE_DECL_CHECK (NODE))
2133 /* In a NAMESPACE_DECL, the DECL_INITIAL is used to record all users
2134 of a namespace, to record the transitive closure of using namespace. */
2135 #define DECL_NAMESPACE_USERS(NODE) DECL_INITIAL (NAMESPACE_DECL_CHECK (NODE))
2137 /* In a NAMESPACE_DECL, points to the original namespace if this is
2138 a namespace alias. */
2139 #define DECL_NAMESPACE_ALIAS(NODE) \
2140 DECL_ABSTRACT_ORIGIN (NAMESPACE_DECL_CHECK (NODE))
2141 #define ORIGINAL_NAMESPACE(NODE) \
2142 (DECL_NAMESPACE_ALIAS (NODE) ? DECL_NAMESPACE_ALIAS (NODE) : (NODE))
2144 /* Nonzero if NODE is the std namespace. */
2145 #define DECL_NAMESPACE_STD_P(NODE) \
2146 (TREE_CODE (NODE) == NAMESPACE_DECL \
2147 && CP_DECL_CONTEXT (NODE) == global_namespace \
2148 && DECL_NAME (NODE) == std_identifier)
2150 /* In a non-local VAR_DECL with static storage duration, this is the
2151 initialization priority. If this value is zero, the NODE will be
2152 initialized at the DEFAULT_INIT_PRIORITY. */
2153 #define DECL_INIT_PRIORITY(NODE) (VAR_DECL_CHECK (NODE)->decl.u2.i)
2155 /* In a TREE_LIST concatenating using directives, indicate indirect
2157 #define TREE_INDIRECT_USING(NODE) (TREE_LIST_CHECK (NODE)->common.lang_flag_0)
2159 /* In a VAR_DECL for a variable declared in a for statement,
2160 this is the shadowed (local) variable. */
2161 #define DECL_SHADOWED_FOR_VAR(NODE) DECL_RESULT_FLD(VAR_DECL_CHECK (NODE))
2163 /* In a FUNCTION_DECL, this is nonzero if this function was defined in
2164 the class definition. We have saved away the text of the function,
2165 but have not yet processed it. */
2166 #define DECL_PENDING_INLINE_P(NODE) \
2167 (DECL_LANG_SPECIFIC (NODE)->u.f.pending_inline_p)
2169 /* If DECL_PENDING_INLINE_P holds, this is the saved text of the
2171 #define DECL_PENDING_INLINE_INFO(NODE) \
2172 (DECL_LANG_SPECIFIC (NODE)->u.f.u.pending_inline_info)
2174 /* For a TYPE_DECL: if this structure has many fields, we'll sort them
2175 and put them into a TREE_VEC. */
2176 #define DECL_SORTED_FIELDS(NODE) \
2177 (DECL_LANG_SPECIFIC (TYPE_DECL_CHECK (NODE))->u.f.u.sorted_fields)
2179 /* True if on the deferred_fns (see decl2.c) list. */
2180 #define DECL_DEFERRED_FN(DECL) \
2181 (DECL_LANG_SPECIFIC (DECL)->decl_flags.deferred)
2183 /* For a VAR_DECL, FUNCTION_DECL, TYPE_DECL or TEMPLATE_DECL:
2184 template-specific information. */
2185 #define DECL_TEMPLATE_INFO(NODE) \
2186 (DECL_LANG_SPECIFIC (VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK (NODE)) \
2187 ->decl_flags.u.template_info)
2189 /* Template information for a RECORD_TYPE or UNION_TYPE. */
2190 #define CLASSTYPE_TEMPLATE_INFO(NODE) \
2191 (LANG_TYPE_CLASS_CHECK (RECORD_OR_UNION_TYPE_CHECK (NODE))->template_info)
2193 /* Template information for an ENUMERAL_TYPE. Although an enumeration may
2194 not be a primary template, it may be declared within the scope of a
2195 primary template and the enumeration constants may depend on
2196 non-type template parameters. */
2197 #define ENUM_TEMPLATE_INFO(NODE) (TYPE_BINFO (ENUMERAL_TYPE_CHECK (NODE)))
2199 /* Template information for a template template parameter. */
2200 #define TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO(NODE) \
2201 (LANG_TYPE_CLASS_CHECK (BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK (NODE)) \
2204 /* Template information for an ENUMERAL_, RECORD_, or UNION_TYPE. */
2205 #define TYPE_TEMPLATE_INFO(NODE) \
2206 (TREE_CODE (NODE) == ENUMERAL_TYPE \
2207 ? ENUM_TEMPLATE_INFO (NODE) : \
2208 (TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
2209 ? TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (NODE) : \
2210 (TYPE_LANG_SPECIFIC (NODE) \
2211 ? CLASSTYPE_TEMPLATE_INFO (NODE) \
2214 /* Set the template information for an ENUMERAL_, RECORD_, or
2215 UNION_TYPE to VAL. */
2216 #define SET_TYPE_TEMPLATE_INFO(NODE, VAL) \
2217 (TREE_CODE (NODE) == ENUMERAL_TYPE \
2218 ? (ENUM_TEMPLATE_INFO (NODE) = (VAL)) \
2219 : (CLASSTYPE_TEMPLATE_INFO (NODE) = (VAL)))
2221 #define TI_TEMPLATE(NODE) (TREE_PURPOSE (NODE))
2222 #define TI_ARGS(NODE) (TREE_VALUE (NODE))
2223 #define TI_PENDING_TEMPLATE_FLAG(NODE) TREE_LANG_FLAG_1 (NODE)
2225 /* We use TREE_VECs to hold template arguments. If there is only one
2226 level of template arguments, then the TREE_VEC contains the
2227 arguments directly. If there is more than one level of template
2228 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
2229 containing the template arguments for a single level. The first
2230 entry in the outer TREE_VEC is the outermost level of template
2231 parameters; the last is the innermost.
2233 It is incorrect to ever form a template argument vector containing
2234 only one level of arguments, but which is a TREE_VEC containing as
2235 its only entry the TREE_VEC for that level. */
2237 /* Nonzero if the template arguments is actually a vector of vectors,
2238 rather than just a vector. */
2239 #define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
2240 ((NODE) != NULL_TREE \
2241 && TREE_CODE (NODE) == TREE_VEC \
2242 && TREE_VEC_LENGTH (NODE) > 0 \
2243 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
2244 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
2246 /* The depth of a template argument vector. When called directly by
2247 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
2248 template arguments. In fact, we may even see NULL_TREE if there
2249 are no template arguments. In both of those cases, there is only
2250 one level of template arguments. */
2251 #define TMPL_ARGS_DEPTH(NODE) \
2252 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
2254 /* The LEVELth level of the template ARGS. The outermost level of
2255 args is level 1, not level 0. */
2256 #define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
2257 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
2258 ? TREE_VEC_ELT (ARGS, (LEVEL) - 1) : (ARGS))
2260 /* Set the LEVELth level of the template ARGS to VAL. This macro does
2261 not work with single-level argument vectors. */
2262 #define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
2263 (TREE_VEC_ELT (ARGS, (LEVEL) - 1) = (VAL))
2265 /* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
2266 #define TMPL_ARG(ARGS, LEVEL, IDX) \
2267 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
2269 /* Set the IDXth element in the LEVELth level of ARGS to VAL. This
2270 macro does not work with single-level argument vectors. */
2271 #define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
2272 (TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
2274 /* Given a single level of template arguments in NODE, return the
2275 number of arguments. */
2276 #define NUM_TMPL_ARGS(NODE) \
2277 ((NODE) == NULL_TREE ? 0 \
2278 : (TREE_CODE (NODE) == TREE_VEC \
2279 ? TREE_VEC_LENGTH (NODE) : list_length (NODE)))
2281 /* Returns the innermost level of template arguments in ARGS. */
2282 #define INNERMOST_TEMPLATE_ARGS(NODE) \
2283 (get_innermost_template_args ((NODE), 1))
2285 /* The number of levels of template parameters given by NODE. */
2286 #define TMPL_PARMS_DEPTH(NODE) \
2287 ((HOST_WIDE_INT) TREE_INT_CST_LOW (TREE_PURPOSE (NODE)))
2289 /* The TEMPLATE_DECL instantiated or specialized by NODE. This
2290 TEMPLATE_DECL will be the immediate parent, not the most general
2291 template. For example, in:
2293 template <class T> struct S { template <class U> void f(U); }
2295 the FUNCTION_DECL for S<int>::f<double> will have, as its
2296 DECL_TI_TEMPLATE, `template <class U> S<int>::f<U>'.
2298 As a special case, for a member friend template of a template
2299 class, this value will not be a TEMPLATE_DECL, but rather a
2300 LOOKUP_EXPR, IDENTIFIER_NODE or OVERLOAD indicating the name of
2301 the template and any explicit template arguments provided. For
2304 template <class T> struct S { friend void f<int>(int, double); }
2306 the DECL_TI_TEMPLATE will be a LOOKUP_EXPR for `f' and the
2307 DECL_TI_ARGS will be {int}. */
2308 #define DECL_TI_TEMPLATE(NODE) TI_TEMPLATE (DECL_TEMPLATE_INFO (NODE))
2310 /* The template arguments used to obtain this decl from the most
2311 general form of DECL_TI_TEMPLATE. For the example given for
2312 DECL_TI_TEMPLATE, the DECL_TI_ARGS will be {int, double}. These
2313 are always the full set of arguments required to instantiate this
2314 declaration from the most general template specialized here. */
2315 #define DECL_TI_ARGS(NODE) TI_ARGS (DECL_TEMPLATE_INFO (NODE))
2316 #define CLASSTYPE_TI_TEMPLATE(NODE) TI_TEMPLATE (CLASSTYPE_TEMPLATE_INFO (NODE))
2317 #define CLASSTYPE_TI_ARGS(NODE) TI_ARGS (CLASSTYPE_TEMPLATE_INFO (NODE))
2318 #define ENUM_TI_TEMPLATE(NODE) \
2319 TI_TEMPLATE (ENUM_TEMPLATE_INFO (NODE))
2320 #define ENUM_TI_ARGS(NODE) \
2321 TI_ARGS (ENUM_TEMPLATE_INFO (NODE))
2323 /* For a template instantiation TYPE, returns the TYPE corresponding
2324 to the primary template. Otherwise returns TYPE itself. */
2325 #define CLASSTYPE_PRIMARY_TEMPLATE_TYPE(TYPE) \
2326 ((CLASSTYPE_USE_TEMPLATE ((TYPE)) && !CLASSTYPE_TEMPLATE_SPECIALIZATION ((TYPE))) \
2327 ? TREE_TYPE (DECL_TEMPLATE_RESULT (DECL_PRIMARY_TEMPLATE \
2328 (CLASSTYPE_TI_TEMPLATE ((TYPE))))) \
2331 /* Like DECL_TI_TEMPLATE, but for an ENUMERAL_, RECORD_, or UNION_TYPE. */
2332 #define TYPE_TI_TEMPLATE(NODE) \
2333 (TI_TEMPLATE (TYPE_TEMPLATE_INFO (NODE)))
2335 /* Like DECL_TI_ARGS, but for an ENUMERAL_, RECORD_, or UNION_TYPE. */
2336 #define TYPE_TI_ARGS(NODE) \
2337 (TI_ARGS (TYPE_TEMPLATE_INFO (NODE)))
2339 #define INNERMOST_TEMPLATE_PARMS(NODE) TREE_VALUE (NODE)
2341 /* Nonzero if the NODE corresponds to the template parameters for a
2342 member template, whose inline definition is being processed after
2343 the class definition is complete. */
2344 #define TEMPLATE_PARMS_FOR_INLINE(NODE) TREE_LANG_FLAG_1 (NODE)
2346 /* In a FUNCTION_DECL, the saved language-specific per-function data. */
2347 #define DECL_SAVED_FUNCTION_DATA(NODE) \
2348 (DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE)) \
2349 ->u.f.u.saved_language_function)
2351 #define NEW_EXPR_USE_GLOBAL(NODE) TREE_LANG_FLAG_0 (NODE)
2352 #define DELETE_EXPR_USE_GLOBAL(NODE) TREE_LANG_FLAG_0 (NODE)
2353 #define DELETE_EXPR_USE_VEC(NODE) TREE_LANG_FLAG_1 (NODE)
2354 #define LOOKUP_EXPR_GLOBAL(NODE) TREE_LANG_FLAG_0 (NODE)
2356 /* Nonzero if this AGGR_INIT_EXPR provides for initialization via a
2357 constructor call, rather than an ordinary function call. */
2358 #define AGGR_INIT_VIA_CTOR_P(NODE) \
2359 TREE_LANG_FLAG_0 (AGGR_INIT_EXPR_CHECK (NODE))
2361 /* The TYPE_MAIN_DECL for a class template type is a TYPE_DECL, not a
2362 TEMPLATE_DECL. This macro determines whether or not a given class
2363 type is really a template type, as opposed to an instantiation or
2364 specialization of one. */
2365 #define CLASSTYPE_IS_TEMPLATE(NODE) \
2366 (CLASSTYPE_TEMPLATE_INFO (NODE) \
2367 && !CLASSTYPE_USE_TEMPLATE (NODE) \
2368 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE)))
2370 /* The name used by the user to name the typename type. Typically,
2371 this is an IDENTIFIER_NODE, and the same as the DECL_NAME on the
2372 corresponding TYPE_DECL. However, this may also be a
2373 TEMPLATE_ID_EXPR if we had something like `typename X::Y<T>'. */
2374 #define TYPENAME_TYPE_FULLNAME(NODE) (TYPE_FIELDS (NODE))
2376 /* Nonzero in INTEGER_CST means that this int is negative by dint of
2377 using a twos-complement negated operand. */
2378 #define TREE_NEGATED_INT(NODE) TREE_LANG_FLAG_0 (INTEGER_CST_CHECK (NODE))
2380 /* Nonzero in any kind of _TYPE where conversions to base-classes may
2381 involve pointer arithmetic. If this is zero, then converting to
2382 a base-class never requires changing the value of the pointer. */
2383 #define TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P(NODE) (TREE_LANG_FLAG_1 (NODE))
2387 A class that declares or inherits a virtual function is called a
2388 polymorphic class. */
2389 #define TYPE_POLYMORPHIC_P(NODE) (TREE_LANG_FLAG_2 (NODE))
2391 /* Nonzero if this class has a virtual function table pointer. */
2392 #define TYPE_CONTAINS_VPTR_P(NODE) \
2393 (TYPE_POLYMORPHIC_P (NODE) \
2394 || TYPE_USES_VIRTUAL_BASECLASSES (NODE))
2396 /* This flag is true of a local VAR_DECL if it was declared in a for
2397 statement, but we are no longer in the scope of the for. */
2398 #define DECL_DEAD_FOR_LOCAL(NODE) DECL_LANG_FLAG_7 (VAR_DECL_CHECK (NODE))
2400 /* This flag is set on a VAR_DECL that is a DECL_DEAD_FOR_LOCAL
2401 if we already emitted a warning about using it. */
2402 #define DECL_ERROR_REPORTED(NODE) DECL_LANG_FLAG_0 (VAR_DECL_CHECK (NODE))
2404 /* Nonzero if NODE is a FUNCTION_DECL (for a function with global
2405 scope) declared in a local scope. */
2406 #define DECL_LOCAL_FUNCTION_P(NODE) \
2407 DECL_LANG_FLAG_0 (FUNCTION_DECL_CHECK (NODE))
2409 /* Nonzero if NODE is a FUNCTION_DECL for a built-in function, and we have
2410 not yet seen a prototype for that function. */
2411 #define DECL_ANTICIPATED(NODE) \
2412 (DECL_LANG_SPECIFIC (DECL_CHECK (NODE))->decl_flags.anticipated_p)
2414 /* Record whether a typedef for type `int' was actually `signed int'. */
2415 #define C_TYPEDEF_EXPLICITLY_SIGNED(EXP) DECL_LANG_FLAG_1 (EXP)
2417 /* Returns nonzero if DECL has external linkage, as specified by the
2418 language standard. (This predicate may hold even when the
2419 corresponding entity is not actually given external linkage in the
2420 object file; see decl_linkage for details.) */
2421 #define DECL_EXTERNAL_LINKAGE_P(DECL) \
2422 (decl_linkage (DECL) == lk_external)
2424 #define INTEGRAL_CODE_P(CODE) \
2425 ((CODE) == INTEGER_TYPE || (CODE) == ENUMERAL_TYPE || (CODE) == BOOLEAN_TYPE)
2427 /* [basic.fundamental]
2429 Types bool, char, wchar_t, and the signed and unsigned integer types
2430 are collectively called integral types.
2432 Note that INTEGRAL_TYPE_P, as defined in tree.h, allows enumeration
2433 types as well, which is incorrect in C++. */
2434 #define CP_INTEGRAL_TYPE_P(TYPE) \
2435 (TREE_CODE (TYPE) == BOOLEAN_TYPE \
2436 || TREE_CODE (TYPE) == INTEGER_TYPE)
2438 /* Returns true if TYPE is an integral or enumeration name. */
2439 #define INTEGRAL_OR_ENUMERATION_TYPE_P(TYPE) \
2440 (CP_INTEGRAL_TYPE_P (TYPE) || TREE_CODE (TYPE) == ENUMERAL_TYPE)
2442 /* [basic.fundamental]
2444 Integral and floating types are collectively called arithmetic
2446 #define ARITHMETIC_TYPE_P(TYPE) \
2447 (CP_INTEGRAL_TYPE_P (TYPE) || TREE_CODE (TYPE) == REAL_TYPE)
2451 Arithmetic types, enumeration types, pointer types, and
2452 pointer-to-member types, are collectively called scalar types. */
2453 #define SCALAR_TYPE_P(TYPE) \
2454 (ARITHMETIC_TYPE_P (TYPE) \
2455 || TREE_CODE (TYPE) == ENUMERAL_TYPE \
2456 || TYPE_PTR_P (TYPE) \
2457 || TYPE_PTRMEM_P (TYPE) \
2458 || TYPE_PTRMEMFUNC_P (TYPE))
2462 An aggregate is an array or a class with no user-declared
2463 constructors, no private or protected non-static data members, no
2464 base classes, and no virtual functions. */
2465 #define CP_AGGREGATE_TYPE_P(TYPE) \
2466 (TREE_CODE (TYPE) == ARRAY_TYPE \
2467 || (CLASS_TYPE_P (TYPE) \
2468 && !CLASSTYPE_NON_AGGREGATE (TYPE)))
2470 /* Nonzero for a class type means that the class type has a
2471 user-declared constructor. */
2472 #define TYPE_HAS_CONSTRUCTOR(NODE) (TYPE_LANG_FLAG_1 (NODE))
2474 /* When appearing in an INDIRECT_REF, it means that the tree structure
2475 underneath is actually a call to a constructor. This is needed
2476 when the constructor must initialize local storage (which can
2477 be automatically destroyed), rather than allowing it to allocate
2478 space from the heap.
2480 When appearing in a SAVE_EXPR, it means that underneath
2481 is a call to a constructor.
2483 When appearing in a CONSTRUCTOR, it means that it was
2484 a GNU C constructor expression.
2486 When appearing in a FIELD_DECL, it means that this field
2487 has been duly initialized in its constructor. */
2488 #define TREE_HAS_CONSTRUCTOR(NODE) (TREE_LANG_FLAG_4 (NODE))
2490 #define EMPTY_CONSTRUCTOR_P(NODE) (TREE_CODE (NODE) == CONSTRUCTOR \
2491 && CONSTRUCTOR_ELTS (NODE) == NULL_TREE \
2492 && ! TREE_HAS_CONSTRUCTOR (NODE))
2494 /* Nonzero for _TYPE means that the _TYPE defines a destructor. */
2495 #define TYPE_HAS_DESTRUCTOR(NODE) (TYPE_LANG_FLAG_2 (NODE))
2497 /* Nonzero means that an object of this type can not be initialized using
2498 an initializer list. */
2499 #define CLASSTYPE_NON_AGGREGATE(NODE) \
2500 (LANG_TYPE_CLASS_CHECK (NODE)->non_aggregate)
2501 #define TYPE_NON_AGGREGATE_CLASS(NODE) \
2502 (IS_AGGR_TYPE (NODE) && CLASSTYPE_NON_AGGREGATE (NODE))
2504 /* Nonzero if there is a user-defined X::op=(x&) for this class. */
2505 #define TYPE_HAS_REAL_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_real_assign_ref)
2506 #define TYPE_HAS_COMPLEX_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_assign_ref)
2507 #define TYPE_HAS_ABSTRACT_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_abstract_assign_ref)
2508 #define TYPE_HAS_COMPLEX_INIT_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_init_ref)
2510 /* Nonzero if TYPE has a trivial destructor. From [class.dtor]:
2512 A destructor is trivial if it is an implicitly declared
2515 - all of the direct base classes of its class have trivial
2518 - for all of the non-static data members of its class that are
2519 of class type (or array thereof), each such class has a
2520 trivial destructor. */
2521 #define TYPE_HAS_TRIVIAL_DESTRUCTOR(NODE) \
2522 (!TYPE_HAS_NONTRIVIAL_DESTRUCTOR (NODE))
2524 /* Nonzero for _TYPE node means that this type does not have a trivial
2525 destructor. Therefore, destroying an object of this type will
2526 involve a call to a destructor. This can apply to objects of
2527 ARRAY_TYPE is the type of the elements needs a destructor. */
2528 #define TYPE_HAS_NONTRIVIAL_DESTRUCTOR(NODE) \
2529 (TYPE_LANG_FLAG_4 (NODE))
2531 /* Nonzero for class type means that copy initialization of this type can use
2533 #define TYPE_HAS_TRIVIAL_INIT_REF(NODE) \
2534 (TYPE_HAS_INIT_REF (NODE) && ! TYPE_HAS_COMPLEX_INIT_REF (NODE))
2536 /* Nonzero for class type means that assignment of this type can use
2538 #define TYPE_HAS_TRIVIAL_ASSIGN_REF(NODE) \
2539 (TYPE_HAS_ASSIGN_REF (NODE) && ! TYPE_HAS_COMPLEX_ASSIGN_REF (NODE))
2541 #define TYPE_PTRMEM_P(NODE) \
2542 (TREE_CODE (NODE) == POINTER_TYPE \
2543 && TREE_CODE (TREE_TYPE (NODE)) == OFFSET_TYPE)
2544 #define TYPE_PTR_P(NODE) \
2545 (TREE_CODE (NODE) == POINTER_TYPE \
2546 && TREE_CODE (TREE_TYPE (NODE)) != OFFSET_TYPE)
2547 #define TYPE_PTROB_P(NODE) \
2548 (TYPE_PTR_P (NODE) && TREE_CODE (TREE_TYPE (NODE)) != FUNCTION_TYPE \
2549 && TREE_CODE (TREE_TYPE (NODE)) != VOID_TYPE)
2550 #define TYPE_PTROBV_P(NODE) \
2551 (TYPE_PTR_P (NODE) && TREE_CODE (TREE_TYPE (NODE)) != FUNCTION_TYPE)
2552 #define TYPE_PTRFN_P(NODE) \
2553 (TREE_CODE (NODE) == POINTER_TYPE \
2554 && TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
2555 #define TYPE_REFFN_P(NODE) \
2556 (TREE_CODE (NODE) == REFERENCE_TYPE \
2557 && TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
2559 /* Nonzero for _TYPE node means that this type is a pointer to member
2561 #define TYPE_PTRMEMFUNC_P(NODE) \
2562 (TREE_CODE (NODE) == RECORD_TYPE \
2563 && TYPE_LANG_SPECIFIC (NODE) \
2564 && TYPE_PTRMEMFUNC_FLAG (NODE))
2566 #define TYPE_PTRMEMFUNC_FLAG(NODE) \
2567 (LANG_TYPE_CLASS_CHECK (NODE)->ptrmemfunc_flag)
2569 /* Indicates when overload resolution may resolve to a pointer to
2570 member function. [expr.unary.op]/3 */
2571 #define PTRMEM_OK_P(NODE) TREE_LANG_FLAG_0 (NODE)
2573 /* Get the POINTER_TYPE to the METHOD_TYPE associated with this
2574 pointer to member function. TYPE_PTRMEMFUNC_P _must_ be true,
2575 before using this macro. */
2576 #define TYPE_PTRMEMFUNC_FN_TYPE(NODE) \
2577 (TREE_TYPE (TYPE_FIELDS (NODE)))
2579 /* Returns `A' for a type like `int (A::*)(double)' */
2580 #define TYPE_PTRMEMFUNC_OBJECT_TYPE(NODE) \
2581 TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
2583 /* These are use to manipulate the canonical RECORD_TYPE from the
2584 hashed POINTER_TYPE, and can only be used on the POINTER_TYPE. */
2585 #define TYPE_GET_PTRMEMFUNC_TYPE(NODE) \
2586 (TYPE_LANG_SPECIFIC (NODE) ? LANG_TYPE_PTRMEM_CHECK (NODE)->record : NULL)
2587 #define TYPE_SET_PTRMEMFUNC_TYPE(NODE, VALUE) \
2589 if (TYPE_LANG_SPECIFIC (NODE) == NULL) \
2591 TYPE_LANG_SPECIFIC (NODE) = \
2592 ggc_alloc_cleared (sizeof (struct lang_type_ptrmem)); \
2593 TYPE_LANG_SPECIFIC (NODE)->u.ptrmem.h.is_lang_type_class = 0; \
2595 TYPE_LANG_SPECIFIC (NODE)->u.ptrmem.record = (VALUE); \
2597 /* Returns the pfn field from a TYPE_PTRMEMFUNC_P. */
2598 #define PFN_FROM_PTRMEMFUNC(NODE) pfn_from_ptrmemfunc ((NODE))
2600 /* For a pointer-to-member type of the form `T X::*', this is `X'.
2601 For a type like `void (X::*)() const', this type is `X', not `const
2602 X'. To get at the `const X' you have to look at the
2603 TYPE_PTRMEM_POINTED_TO_TYPE; there, the first parameter will have
2605 #define TYPE_PTRMEM_CLASS_TYPE(NODE) \
2606 (TYPE_PTRMEM_P (NODE) \
2607 ? TYPE_OFFSET_BASETYPE (TREE_TYPE (NODE)) \
2608 : TYPE_PTRMEMFUNC_OBJECT_TYPE (NODE))
2610 /* For a pointer-to-member type of the form `T X::*', this is `T'. */
2611 #define TYPE_PTRMEM_POINTED_TO_TYPE(NODE) \
2612 (TYPE_PTRMEM_P (NODE) \
2613 ? TREE_TYPE (TREE_TYPE (NODE)) \
2614 : TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
2616 /* For a pointer-to-member constant `X::Y' this is the RECORD_TYPE for
2618 #define PTRMEM_CST_CLASS(NODE) \
2619 TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (PTRMEM_CST_CHECK (NODE)))
2621 /* For a pointer-to-member constant `X::Y' this is the _DECL for
2623 #define PTRMEM_CST_MEMBER(NODE) (((ptrmem_cst_t)PTRMEM_CST_CHECK (NODE))->member)
2625 /* Nonzero for VAR_DECL and FUNCTION_DECL node means that `extern' was
2626 specified in its declaration. This can also be set for an
2627 erroneously declared PARM_DECL. */
2628 #define DECL_THIS_EXTERN(NODE) \
2629 DECL_LANG_FLAG_2 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
2631 /* Nonzero for VAR_DECL and FUNCTION_DECL node means that `static' was
2632 specified in its declaration. This can also be set for an
2633 erroneously declared PARM_DECL. */
2634 #define DECL_THIS_STATIC(NODE) \
2635 DECL_LANG_FLAG_6 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
2637 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
2638 flag for this because "A union for which objects or pointers are
2639 declared is not an anonymous union" [class.union]. */
2640 #define ANON_AGGR_TYPE_P(NODE) \
2641 (CLASS_TYPE_P (NODE) && LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr)
2642 #define SET_ANON_AGGR_TYPE_P(NODE) \
2643 (LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr = 1)
2645 /* Nonzero if TYPE is an anonymous union type. */
2646 #define ANON_UNION_TYPE_P(NODE) \
2647 (TREE_CODE (NODE) == UNION_TYPE && ANON_AGGR_TYPE_P (NODE))
2649 #define UNKNOWN_TYPE LANG_TYPE
2651 /* Define fields and accessors for nodes representing declared names. */
2653 #define TYPE_WAS_ANONYMOUS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->was_anonymous)
2655 /* C++: all of these are overloaded! These apply only to TYPE_DECLs. */
2657 /* The format of each node in the DECL_FRIENDLIST is as follows:
2659 The TREE_PURPOSE will be the name of a function, i.e., an
2660 IDENTIFIER_NODE. The TREE_VALUE will be itself a TREE_LIST, the
2661 list of functions with that name which are friends. The
2662 TREE_PURPOSE of each node in this sublist will be error_mark_node,
2663 if the function was declared a friend individually, in which case
2664 the TREE_VALUE will be the function_decl. If, however, all
2665 functions with a given name in a class were declared to be friends,
2666 the TREE_PUROSE will be the class type, and the TREE_VALUE will be
2668 #define DECL_FRIENDLIST(NODE) (DECL_INITIAL (NODE))
2669 #define FRIEND_NAME(LIST) (TREE_PURPOSE (LIST))
2670 #define FRIEND_DECLS(LIST) (TREE_VALUE (LIST))
2672 /* The DECL_ACCESS, if non-NULL, is a TREE_LIST. The TREE_PURPOSE of
2673 each node is a type; the TREE_VALUE is the access granted for this
2674 DECL in that type. The DECL_ACCESS is set by access declarations.
2675 For example, if a member that would normally be public in a
2676 derived class is made protected, then the derived class and the
2677 protected_access_node will appear in the DECL_ACCESS for the node. */
2678 #define DECL_ACCESS(NODE) (LANG_DECL_U2_CHECK (NODE, 0)->access)
2680 /* Nonzero if the FUNCTION_DECL is a global constructor. */
2681 #define DECL_GLOBAL_CTOR_P(NODE) \
2682 (DECL_LANG_SPECIFIC (NODE)->decl_flags.global_ctor_p)
2684 /* Nonzero if the FUNCTION_DECL is a global destructor. */
2685 #define DECL_GLOBAL_DTOR_P(NODE) \
2686 (DECL_LANG_SPECIFIC (NODE)->decl_flags.global_dtor_p)
2688 /* Accessor macros for C++ template decl nodes. */
2690 /* The DECL_TEMPLATE_PARMS are a list. The TREE_PURPOSE of each node
2691 is a INT_CST whose TREE_INT_CST_LOW indicates the level of the
2692 template parameters, with 1 being the outermost set of template
2693 parameters. The TREE_VALUE is a vector, whose elements are the
2694 template parameters at each level. Each element in the vector is a
2695 TREE_LIST, whose TREE_VALUE is a PARM_DECL (if the parameter is a
2696 non-type parameter), or a TYPE_DECL (if the parameter is a type
2697 parameter). The TREE_PURPOSE is the default value, if any. The
2698 TEMPLATE_PARM_INDEX for the parameter is avilable as the
2699 DECL_INITIAL (for a PARM_DECL) or as the TREE_TYPE (for a
2701 #define DECL_TEMPLATE_PARMS(NODE) DECL_ARGUMENTS (NODE)
2702 #define DECL_INNERMOST_TEMPLATE_PARMS(NODE) \
2703 INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (NODE))
2704 #define DECL_NTPARMS(NODE) \
2705 TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (NODE))
2706 /* For function, method, class-data templates. */
2707 #define DECL_TEMPLATE_RESULT(NODE) DECL_RESULT_FLD (NODE)
2708 /* For a static member variable template, the
2709 DECL_TEMPLATE_INSTANTIATIONS list contains the explicitly and
2710 implicitly generated instantiations of the variable. There are no
2711 partial instantiations of static member variables, so all of these
2712 will be full instantiations.
2714 For a class template the DECL_TEMPLATE_INSTANTIATIONS lists holds
2715 all instantiations and specializations of the class type, including
2716 partial instantiations and partial specializations.
2718 In both cases, the TREE_PURPOSE of each node contains the arguments
2719 used; the TREE_VALUE contains the generated variable. The template
2720 arguments are always complete. For example, given:
2722 template <class T> struct S1 {
2723 template <class U> struct S2 {};
2724 template <class U> struct S2<U*> {};
2727 the record for the partial specialization will contain, as its
2728 argument list, { {T}, {U*} }, and will be on the
2729 DECL_TEMPLATE_INSTANTIATIONS list for `template <class T> template
2730 <class U> struct S1<T>::S2'.
2732 This list is not used for function templates. */
2733 #define DECL_TEMPLATE_INSTANTIATIONS(NODE) DECL_VINDEX (NODE)
2734 /* For a function template, the DECL_TEMPLATE_SPECIALIZATIONS lists
2735 contains all instantiations and specializations of the function,
2736 including partial instantiations. For a partial instantiation
2737 which is a specialization, this list holds only full
2738 specializations of the template that are instantiations of the
2739 partial instantiation. For example, given:
2741 template <class T> struct S {
2742 template <class U> void f(U);
2743 template <> void f(T);
2746 the `S<int>::f<int>(int)' function will appear on the
2747 DECL_TEMPLATE_SPECIALIZATIONS list for both `template <class T>
2748 template <class U> void S<T>::f(U)' and `template <class T> void
2749 S<int>::f(T)'. In the latter case, however, it will have only the
2750 innermost set of arguments (T, in this case). The DECL_TI_TEMPLATE
2751 for the function declaration will point at the specialization, not
2752 the fully general template.
2754 For a class template, this list contains the partial
2755 specializations of this template. (Full specializations are not
2756 recorded on this list.) The TREE_PURPOSE holds the innermost
2757 arguments used in the partial specialization (e.g., for `template
2758 <class T> struct S<T*, int>' this will be `T*'.) The TREE_VALUE
2759 holds the innermost template parameters for the specialization
2760 (e.g., `T' in the example above.) The TREE_TYPE is the _TYPE node
2761 for the partial specialization.
2763 This list is not used for static variable templates. */
2764 #define DECL_TEMPLATE_SPECIALIZATIONS(NODE) DECL_SIZE (NODE)
2766 /* Nonzero for a DECL which is actually a template parameter. */
2767 #define DECL_TEMPLATE_PARM_P(NODE) \
2768 (DECL_LANG_FLAG_0 (NODE) \
2769 && (TREE_CODE (NODE) == CONST_DECL \
2770 || TREE_CODE (NODE) == PARM_DECL \
2771 || TREE_CODE (NODE) == TYPE_DECL \
2772 || TREE_CODE (NODE) == TEMPLATE_DECL))
2774 /* Mark NODE as a template parameter. */
2775 #define SET_DECL_TEMPLATE_PARM_P(NODE) \
2776 (DECL_LANG_FLAG_0 (NODE) = 1)
2778 /* Nonzero if NODE is a template template parameter. */
2779 #define DECL_TEMPLATE_TEMPLATE_PARM_P(NODE) \
2780 (TREE_CODE (NODE) == TEMPLATE_DECL && DECL_TEMPLATE_PARM_P (NODE))
2782 #define DECL_FUNCTION_TEMPLATE_P(NODE) \
2783 (TREE_CODE (NODE) == TEMPLATE_DECL \
2784 && TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == FUNCTION_DECL)
2786 /* Nonzero for a DECL that represents a template class. */
2787 #define DECL_CLASS_TEMPLATE_P(NODE) \
2788 (TREE_CODE (NODE) == TEMPLATE_DECL \
2789 && TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == TYPE_DECL \
2790 && !DECL_TEMPLATE_TEMPLATE_PARM_P (NODE))
2792 /* Nonzero if NODE which declares a type. */
2793 #define DECL_DECLARES_TYPE_P(NODE) \
2794 (TREE_CODE (NODE) == TYPE_DECL || DECL_CLASS_TEMPLATE_P (NODE))
2796 /* Nonzero if NODE is the typedef implicitly generated for a type when
2797 the type is declared. (In C++, `struct S {};' is roughly equivalent
2798 to `struct S {}; typedef struct S S;' in C. This macro will hold
2799 for the typedef indicated in this example. Note that in C++, there
2800 is a second implicit typedef for each class, in the scope of `S'
2801 itself, so that you can say `S::S'. This macro does *not* hold for
2803 #define DECL_IMPLICIT_TYPEDEF_P(NODE) \
2804 (TREE_CODE (NODE) == TYPE_DECL && DECL_LANG_FLAG_2 (NODE))
2805 #define SET_DECL_IMPLICIT_TYPEDEF_P(NODE) \
2806 (DECL_LANG_FLAG_2 (NODE) = 1)
2808 /* A `primary' template is one that has its own template header. A
2809 member function of a class template is a template, but not primary.
2810 A member template is primary. Friend templates are primary, too. */
2812 /* Returns the primary template corresponding to these parameters. */
2813 #define DECL_PRIMARY_TEMPLATE(NODE) \
2814 (TREE_TYPE (DECL_INNERMOST_TEMPLATE_PARMS (NODE)))
2816 /* Returns nonzero if NODE is a primary template. */
2817 #define PRIMARY_TEMPLATE_P(NODE) (DECL_PRIMARY_TEMPLATE (NODE) == (NODE))
2819 #define CLASSTYPE_TEMPLATE_LEVEL(NODE) \
2820 (TREE_INT_CST_LOW (TREE_PURPOSE (CLASSTYPE_TI_TEMPLATE (NODE))))
2822 /* Indicates whether or not (and how) a template was expanded for this
2823 FUNCTION_DECL or VAR_DECL.
2824 0=normal declaration, e.g. int min (int, int);
2825 1=implicit template instantiation
2826 2=explicit template specialization, e.g. int min<int> (int, int);
2827 3=explicit template instantiation, e.g. template int min<int> (int, int); */
2828 #define DECL_USE_TEMPLATE(NODE) (DECL_LANG_SPECIFIC (NODE)->decl_flags.use_template)
2830 #define DECL_TEMPLATE_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) & 1)
2831 #define CLASSTYPE_TEMPLATE_INSTANTIATION(NODE) \
2832 (CLASSTYPE_USE_TEMPLATE (NODE) & 1)
2834 #define DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) == 2)
2835 #define SET_DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) = 2)
2836 #define CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
2837 (CLASSTYPE_USE_TEMPLATE (NODE) == 2)
2838 #define SET_CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
2839 (CLASSTYPE_USE_TEMPLATE (NODE) = 2)
2841 #define DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 1)
2842 #define SET_DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 1)
2843 #define CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
2844 (CLASSTYPE_USE_TEMPLATE (NODE) == 1)
2845 #define SET_CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
2846 (CLASSTYPE_USE_TEMPLATE (NODE) = 1)
2848 #define DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 3)
2849 #define SET_DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 3)
2850 #define CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
2851 (CLASSTYPE_USE_TEMPLATE (NODE) == 3)
2852 #define SET_CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
2853 (CLASSTYPE_USE_TEMPLATE (NODE) = 3)
2855 /* Nonzero if DECL is a friend function which is an instantiation
2856 from the point of view of the compiler, but not from the point of
2857 view of the language. For example given:
2858 template <class T> struct S { friend void f(T) {}; };
2859 the declaration of `void f(int)' generated when S<int> is
2860 instantiated will not be a DECL_TEMPLATE_INSTANTIATION, but will be
2861 a DECL_FRIEND_PSUEDO_TEMPLATE_INSTANTIATION. */
2862 #define DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION(DECL) \
2863 (DECL_TEMPLATE_INFO (DECL) && !DECL_USE_TEMPLATE (DECL))
2865 /* Nonzero iff we are currently processing a declaration for an
2866 entity with its own template parameter list, and which is not a
2867 full specialization. */
2868 #define PROCESSING_REAL_TEMPLATE_DECL_P() \
2869 (processing_template_decl > template_class_depth (current_class_type))
2871 /* This function may be a guiding decl for a template. */
2872 #define DECL_MAYBE_TEMPLATE(NODE) DECL_LANG_FLAG_4 (NODE)
2874 /* Nonzero if this VAR_DECL or FUNCTION_DECL has already been
2875 instantiated, i.e. its definition has been generated from the
2876 pattern given in the the template. */
2877 #define DECL_TEMPLATE_INSTANTIATED(NODE) \
2878 DECL_LANG_FLAG_1 (VAR_OR_FUNCTION_DECL_CHECK (NODE))
2880 /* We know what we're doing with this decl now. */
2881 #define DECL_INTERFACE_KNOWN(NODE) DECL_LANG_FLAG_5 (NODE)
2883 /* This function was declared inline. This flag controls the linkage
2884 semantics of 'inline'; whether or not the function is inlined is
2885 controlled by DECL_INLINE. */
2886 #define DECL_DECLARED_INLINE_P(NODE) \
2887 (DECL_LANG_SPECIFIC (NODE)->decl_flags.base.declared_inline)
2889 /* DECL_EXTERNAL must be set on a decl until the decl is actually emitted,
2890 so that assemble_external will work properly. So we have this flag to
2891 tell us whether the decl is really not external. */
2892 #define DECL_NOT_REALLY_EXTERN(NODE) \
2893 (DECL_LANG_SPECIFIC (NODE)->decl_flags.not_really_extern)
2895 #define DECL_REALLY_EXTERN(NODE) \
2896 (DECL_EXTERNAL (NODE) && ! DECL_NOT_REALLY_EXTERN (NODE))
2898 /* A thunk is a stub function.
2900 A thunk is an alternate entry point for an ordinary FUNCTION_DECL.
2901 The address of the ordinary FUNCTION_DECL is given by the
2902 DECL_INITIAL, which is always an ADDR_EXPR whose operand is a
2903 FUNCTION_DECL. The job of the thunk is to either adjust the this
2904 pointer before transferring control to the FUNCTION_DECL, or call
2905 FUNCTION_DECL and then adjust the result value. Note, the result
2906 pointer adjusting thunk must perform a call to the thunked
2907 function, (or be implemented via passing some invisible parameter
2908 to the thunked function, which is modified to perform the
2909 adjustment just before returning).
2911 A thunk may perform either, or both, of the following operations:
2913 o Adjust the this or result pointer by a constant offset.
2914 o Adjust the this or result pointer by looking up a vcall or vbase offset
2917 A this pointer adjusting thunk converts from a base to a derived
2918 class, and hence adds the offsets. A result pointer adjusting thunk
2919 converts from a derived class to a base, and hence subtracts the
2920 offsets. If both operations are performed, then the constant
2921 adjument is performed first for this pointer adjustment and last
2922 for the result pointer adjustment.
2924 The constant adjustment is given by THUNK_FIXED_OFFSET. If the
2925 vcall or vbase offset is required, the index into the vtable is given by
2926 THUNK_VIRTUAL_OFFSET. */
2928 /* An integer indicating how many bytes should be subtracted from the
2929 this or result pointer when this function is called. */
2930 #define THUNK_FIXED_OFFSET(DECL) \
2931 (DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL))->u.f.fixed_offset)
2933 /* A tree indicating how to perform the virtual adjustment. For a this
2934 adjusting thunk it is the number of bytes to be added to the vtable
2935 to find the vcall offset. For a result adjusting thunk, it is the
2936 binfo of the relevant virtual base. If NULL, then there is no
2937 virtual adjust. (The vptr is always located at offset zero from
2938 the this or result pointer.) (If the covariant type is within the
2939 class hierarchy being layed out, the vbase index is not yet known
2940 at the point we need to create the thunks, hence the need to use
2943 #define THUNK_VIRTUAL_OFFSET(DECL) \
2944 (LANG_DECL_U2_CHECK (VAR_OR_FUNCTION_DECL_CHECK (DECL), 0)->virtual_offset)
2946 /* For thunk NODE, this is the FUNCTION_DECL thunked to. */
2947 #define THUNK_TARGET(NODE) \
2948 (DECL_LANG_SPECIFIC (NODE)->u.f.befriending_classes)
2950 /* These macros provide convenient access to the various _STMT nodes
2951 created when parsing template declarations. */
2952 #define TRY_STMTS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 0)
2953 #define TRY_HANDLERS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 1)
2955 #define EH_SPEC_STMTS(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 0)
2956 #define EH_SPEC_RAISES(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 1)
2958 #define USING_STMT_NAMESPACE(NODE) TREE_OPERAND (USING_STMT_CHECK (NODE), 0)
2960 /* Nonzero if this try block is a function try block. */
2961 #define FN_TRY_BLOCK_P(NODE) TREE_LANG_FLAG_3 (TRY_BLOCK_CHECK (NODE))
2962 #define HANDLER_PARMS(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 0)
2963 #define HANDLER_BODY(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 1)
2964 #define HANDLER_TYPE(NODE) TREE_TYPE (HANDLER_CHECK (NODE))
2966 /* The parameters for a call-declarator. */
2967 #define CALL_DECLARATOR_PARMS(NODE) \
2968 (TREE_PURPOSE (TREE_OPERAND (NODE, 1)))
2970 /* The cv-qualifiers for a call-declarator. */
2971 #define CALL_DECLARATOR_QUALS(NODE) \
2972 (TREE_VALUE (TREE_OPERAND (NODE, 1)))
2974 /* The exception-specification for a call-declarator. */
2975 #define CALL_DECLARATOR_EXCEPTION_SPEC(NODE) \
2978 /* An enumeration of the kind of tags that C++ accepts. */
2980 none_type = 0, /* Not a tag type. */
2981 record_type, /* "struct" types. */
2982 class_type, /* "class" types. */
2983 union_type, /* "union" types. */
2984 enum_type, /* "enum" types. */
2985 typename_type /* "typename" types. */
2988 /* The various kinds of lvalues we distinguish. */
2989 typedef enum cp_lvalue_kind {
2990 clk_none = 0, /* Things that are not an lvalue. */
2991 clk_ordinary = 1, /* An ordinary lvalue. */
2992 clk_class = 2, /* An rvalue of class-type. */
2993 clk_bitfield = 4, /* An lvalue for a bit-field. */
2996 /* The kinds of scopes we recognize. */
2997 typedef enum scope_kind {
2998 sk_block, /* An ordinary block scope. */
2999 sk_try, /* A try-block. */
3000 sk_catch, /* A catch-block. */
3001 sk_for, /* The scope of the variable declared in a
3002 for-init-statement. */
3003 sk_template_parms, /* A scope for template parameters. */
3004 sk_template_spec /* A scope corresponding to a template
3005 specialization. There is never anything in
3009 /* Various kinds of template specialization, instantiation, etc. */
3010 typedef enum tmpl_spec_kind {
3011 tsk_none, /* Not a template at all. */
3012 tsk_invalid_member_spec, /* An explicit member template
3013 specialization, but the enclosing
3014 classes have not all been explicitly
3016 tsk_invalid_expl_inst, /* An explicit instantiation containing
3017 template parameter lists. */
3018 tsk_excessive_parms, /* A template declaration with too many
3019 template parameter lists. */
3020 tsk_insufficient_parms, /* A template declaration with too few
3022 tsk_template, /* A template declaration. */
3023 tsk_expl_spec, /* An explicit specialization. */
3024 tsk_expl_inst /* An explicit instantiation. */
3027 /* The various kinds of access. BINFO_ACCESS depends on these being
3028 two bit quantities. The numerical values are important; they are
3029 used to initialize RTTI data structures, so changing them changes
3031 typedef enum access_kind {
3032 ak_none = 0, /* Inaccessible. */
3033 ak_public = 1, /* Accessible, as a `public' thing. */
3034 ak_protected = 2, /* Accessible, as a `protected' thing. */
3035 ak_private = 3 /* Accessible, as a `private' thing. */
3038 /* The various kinds of special functions. If you add to this list,
3039 you should update special_function_p as well. */
3040 typedef enum special_function_kind {
3041 sfk_none = 0, /* Not a special function. This enumeral
3042 must have value zero; see
3043 special_function_p. */
3044 sfk_constructor, /* A constructor. */
3045 sfk_copy_constructor, /* A copy constructor. */
3046 sfk_assignment_operator, /* An assignment operator. */
3047 sfk_destructor, /* A destructor. */
3048 sfk_complete_destructor, /* A destructor for complete objects. */
3049 sfk_base_destructor, /* A destructor for base subobjects. */
3050 sfk_deleting_destructor, /* A destructor for complete objects that
3051 deletes the object after it has been
3053 sfk_conversion /* A conversion operator. */
3054 } special_function_kind;
3056 /* The various kinds of linkage. From [basic.link],
3058 A name is said to have linkage when it might denote the same
3059 object, reference, function, type, template, namespace or value
3060 as a name introduced in another scope:
3062 -- When a name has external linkage, the entity it denotes can
3063 be referred to from scopes of other translation units or from
3064 other scopes of the same translation unit.
3066 -- When a name has internal linkage, the entity it denotes can
3067 be referred to by names from other scopes in the same
3070 -- When a name has no linkage, the entity it denotes cannot be
3071 referred to by names from other scopes. */
3073 typedef enum linkage_kind {
3074 lk_none, /* No linkage. */
3075 lk_internal, /* Internal linkage. */
3076 lk_external /* External linkage. */
3079 /* Bitmask flags to control type substitution. */
3080 typedef enum tsubst_flags_t {
3081 tf_none = 0, /* nothing special */
3082 tf_error = 1 << 0, /* give error messages */
3083 tf_warning = 1 << 1, /* give warnings too */
3084 tf_no_attributes = 1 << 2, /* ignore attributes on comparisons
3085 (instantiate_type use) */
3086 tf_ignore_bad_quals = 1 << 3, /* ignore bad cvr qualifiers */
3087 tf_keep_type_decl = 1 << 4, /* retain typedef type decls
3088 (make_typename_type use) */
3089 tf_ptrmem_ok = 1 << 5, /* pointers to member ok (internal
3090 instantiate_type use) */
3091 tf_parsing = 1 << 6 /* called from parser
3092 (make_typename_type use) */
3095 /* The kind of checking we can do looking in a class hierarchy. */
3096 typedef enum base_access {
3097 ba_any = 0, /* Do not check access, allow an ambiguous base,
3098 prefer a non-virtual base */
3099 ba_ignore = 1, /* Do not check access */
3100 ba_check = 2, /* Check access */
3101 ba_not_special = 3, /* Do not consider special privilege
3102 current_class_type might give. */
3103 ba_quiet = 4, /* Do not issue error messages (bit mask). */
3106 /* The kind of base we can find, looking in a class hierarchy.
3107 Values <0 indicate we failed. */
3108 typedef enum base_kind {
3109 bk_inaccessible = -3, /* The base is inaccessible */
3110 bk_ambig = -2, /* The base is ambiguous */
3111 bk_not_base = -1, /* It is not a base */
3112 bk_same_type = 0, /* It is the same type */
3113 bk_proper_base = 1, /* It is a proper base */
3114 bk_via_virtual = 2 /* It is a proper base, but via a virtual
3115 path. This might not be the canonical
3119 /* Set by add_implicitly_declared_members() to keep those members from
3120 being flagged as deprecated or reported as using deprecated
3122 extern int adding_implicit_members;
3125 /* A node that is a list (length 1) of error_mark_nodes. */
3126 extern GTY(()) tree error_mark_list;
3128 /* Node for "pointer to (virtual) function".
3129 This may be distinct from ptr_type_node so gdb can distinguish them. */
3130 #define vfunc_ptr_type_node vtable_entry_type
3133 /* For building calls to `delete'. */
3134 extern GTY(()) tree integer_two_node;
3135 extern GTY(()) tree integer_three_node;
3137 extern GTY(()) tree anonymous_namespace_name;
3139 /* The number of function bodies which we are currently processing.
3140 (Zero if we are at namespace scope, one inside the body of a
3141 function, two inside the body of a function in a local class, etc.) */
3142 extern int function_depth;
3144 typedef struct deferred_access GTY(())
3146 /* A TREE_LIST representing name-lookups for which we have deferred
3147 checking access controls. We cannot check the accessibility of
3148 names used in a decl-specifier-seq until we know what is being
3149 declared because code like:
3156 A::B* A::f() { return 0; }
3158 is valid, even though `A::B' is not generally accessible.
3160 The TREE_PURPOSE of each node is the scope used to qualify the
3161 name being looked up; the TREE_VALUE is the DECL to which the
3162 name was resolved. */
3163 tree deferred_access_checks;
3164 /* TRUE iff we are deferring access checks. */
3165 bool deferring_access_checks_p;
3166 /* The next deferred access data in stack or linked-list. */
3167 struct deferred_access *next;
3172 /* These values are used for the `STRICT' parameter to type_unification and
3173 fn_type_unification. Their meanings are described with the
3174 documentation for fn_type_unification. */
3176 typedef enum unification_kind_t {
3181 } unification_kind_t;
3183 /* Macros for operating on a template instantiation level node, represented
3184 by an EXPR_WITH_FILE_LOCATION. */
3186 #define TINST_DECL(NODE) EXPR_WFL_NODE (NODE)
3187 #define TINST_LINE(NODE) EXPR_WFL_LINENO (NODE)
3188 #define TINST_FILE(NODE) EXPR_WFL_FILENAME (NODE)
3192 extern int current_class_depth;
3194 /* An array of all local classes present in this translation unit, in
3195 declaration order. */
3196 extern GTY(()) varray_type local_classes;
3198 /* Here's where we control how name mangling takes place. */
3200 /* Cannot use '$' up front, because this confuses gdb
3201 (names beginning with '$' are gdb-local identifiers).
3203 Note that all forms in which the '$' is significant are long enough
3204 for direct indexing (meaning that if we know there is a '$'
3205 at a particular location, we can index into the string at
3206 any other location that provides distinguishing characters). */
3208 /* Define NO_DOLLAR_IN_LABEL in your favorite tm file if your assembler
3209 doesn't allow '$' in symbol names. */
3210 #ifndef NO_DOLLAR_IN_LABEL
3214 #define VPTR_NAME "$v"
3215 #define THROW_NAME "$eh_throw"
3216 #define AUTO_VTABLE_NAME "__vtbl$me__"
3217 #define AUTO_TEMP_NAME "_$tmp_"
3218 #define AUTO_TEMP_FORMAT "_$tmp_%d"
3219 #define VTABLE_BASE "$vb"
3220 #define VTABLE_NAME_PREFIX "__vt_"
3221 #define VFIELD_BASE "$vf"
3222 #define VFIELD_NAME "_vptr$"
3223 #define VFIELD_NAME_FORMAT "_vptr$%s"
3224 #define STATIC_NAME_FORMAT "_%s$%s"
3225 #define ANON_AGGRNAME_FORMAT "$_%d"
3227 #else /* NO_DOLLAR_IN_LABEL */
3229 #ifndef NO_DOT_IN_LABEL
3233 #define VPTR_NAME ".v"
3234 #define THROW_NAME ".eh_throw"
3235 #define AUTO_VTABLE_NAME "__vtbl.me__"
3236 #define AUTO_TEMP_NAME "_.tmp_"
3237 #define AUTO_TEMP_FORMAT "_.tmp_%d"
3238 #define VTABLE_BASE ".vb"
3239 #define VTABLE_NAME_PREFIX "__vt_"
3240 #define VFIELD_BASE ".vf"
3241 #define VFIELD_NAME "_vptr."
3242 #define VFIELD_NAME_FORMAT "_vptr.%s"
3243 #define STATIC_NAME_FORMAT "_%s.%s"
3245 #define ANON_AGGRNAME_FORMAT "._%d"
3247 #else /* NO_DOT_IN_LABEL */
3249 #define VPTR_NAME "__vptr"
3250 #define VPTR_NAME_P(ID_NODE) \
3251 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VPTR_NAME, sizeof (VPTR_NAME) - 1))
3252 #define THROW_NAME "__eh_throw"
3253 #define IN_CHARGE_NAME "__in_chrg"
3254 #define AUTO_VTABLE_NAME "__vtbl_me__"
3255 #define AUTO_TEMP_NAME "__tmp_"
3256 #define TEMP_NAME_P(ID_NODE) \
3257 (!strncmp (IDENTIFIER_POINTER (ID_NODE), AUTO_TEMP_NAME, \
3258 sizeof (AUTO_TEMP_NAME) - 1))
3259 #define AUTO_TEMP_FORMAT "__tmp_%d"
3260 #define VTABLE_BASE "__vtb"
3261 #define VTABLE_NAME "__vt_"
3262 #define VTABLE_NAME_PREFIX "__vt_"
3263 #define VTABLE_NAME_P(ID_NODE) \
3264 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VTABLE_NAME, \
3265 sizeof (VTABLE_NAME) - 1))
3266 #define VFIELD_BASE "__vfb"
3267 #define VFIELD_NAME "__vptr_"
3268 #define VFIELD_NAME_P(ID_NODE) \
3269 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, \
3270 sizeof (VFIELD_NAME) - 1))
3271 #define VFIELD_NAME_FORMAT "__vptr_%s"
3272 #define STATIC_NAME_FORMAT "__static_%s_%s"
3274 #define ANON_AGGRNAME_PREFIX "__anon_"
3275 #define ANON_AGGRNAME_P(ID_NODE) \
3276 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
3277 sizeof (ANON_AGGRNAME_PREFIX) - 1))
3278 #define ANON_AGGRNAME_FORMAT "__anon_%d"
3280 #endif /* NO_DOT_IN_LABEL */
3281 #endif /* NO_DOLLAR_IN_LABEL */
3283 #define THIS_NAME "this"
3284 #define CTOR_NAME "__ct"
3285 #define DTOR_NAME "__dt"
3287 #define IN_CHARGE_NAME "__in_chrg"
3289 #define VTBL_PTR_TYPE "__vtbl_ptr_type"
3290 #define VTABLE_DELTA_NAME "__delta"
3291 #define VTABLE_PFN_NAME "__pfn"
3293 #define EXCEPTION_CLEANUP_NAME "exception cleanup"
3295 #if !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL)
3297 #define VPTR_NAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == JOINER \
3298 && IDENTIFIER_POINTER (ID_NODE)[1] == 'v')
3300 #define VTABLE_NAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[1] == 'v' \
3301 && IDENTIFIER_POINTER (ID_NODE)[2] == 't' \
3302 && IDENTIFIER_POINTER (ID_NODE)[3] == JOINER)
3304 #define TEMP_NAME_P(ID_NODE) \
3305 (!strncmp (IDENTIFIER_POINTER (ID_NODE), AUTO_TEMP_NAME, sizeof (AUTO_TEMP_NAME)-1))
3306 #define VFIELD_NAME_P(ID_NODE) \
3307 (!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, sizeof(VFIELD_NAME)-1))
3309 /* For anonymous aggregate types, we need some sort of name to
3310 hold on to. In practice, this should not appear, but it should
3311 not be harmful if it does. */
3312 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == JOINER \
3313 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
3314 #endif /* !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL) */
3316 /* Returns nonzero iff NODE is a declaration for the global function
3318 #define DECL_MAIN_P(NODE) \
3319 (DECL_EXTERN_C_FUNCTION_P (NODE) \
3320 && DECL_NAME (NODE) != NULL_TREE \
3321 && MAIN_NAME_P (DECL_NAME (NODE)))
3324 /* Nonzero if we're done parsing and into end-of-file activities. */
3328 /* Functions called along with real static constructors and destructors. */
3330 extern GTY(()) tree static_ctors;
3331 extern GTY(()) tree static_dtors;
3333 enum overload_flags { NO_SPECIAL = 0, DTOR_FLAG, OP_FLAG, TYPENAME_FLAG };
3335 /* Some macros for char-based bitfields. */
3336 #define B_SET(A,X) ((A)[(X)>>3] |= (1 << ((X)&7)))
3337 #define B_CLR(A,X) ((A)[(X)>>3] &= ~(1 << ((X)&7)))
3338 #define B_TST(A,X) ((A)[(X)>>3] & (1 << ((X)&7)))
3340 /* These are uses as bits in flags passed to build_method_call
3341 to control its error reporting behavior.
3343 LOOKUP_PROTECT means flag access violations.
3344 LOOKUP_COMPLAIN mean complain if no suitable member function
3345 matching the arguments is found.
3346 LOOKUP_NORMAL is just a combination of these two.
3347 LOOKUP_NONVIRTUAL means make a direct call to the member function found
3348 LOOKUP_GLOBAL means search through the space of overloaded functions,
3349 as well as the space of member functions.
3350 LOOKUP_ONLYCONVERTING means that non-conversion constructors are not tried.
3351 DIRECT_BIND means that if a temporary is created, it should be created so
3352 that it lives as long as the current variable bindings; otherwise it
3353 only lives until the end of the complete-expression. It also forces
3354 direct-initialization in cases where other parts of the compiler have
3355 already generated a temporary, such as reference initialization and the
3357 LOOKUP_SPECULATIVELY means return NULL_TREE if we cannot find what we are
3358 after. Note, LOOKUP_COMPLAIN is checked and error messages printed
3359 before LOOKUP_SPECULATIVELY is checked.
3360 LOOKUP_NO_CONVERSION means that user-defined conversions are not
3361 permitted. Built-in conversions are permitted.
3362 LOOKUP_DESTRUCTOR means explicit call to destructor.
3363 LOOKUP_NO_TEMP_BIND means temporaries will not be bound to references.
3365 These are used in global lookup to support elaborated types and
3368 LOOKUP_PREFER_TYPES means not to accept objects, and possibly namespaces.
3369 LOOKUP_PREFER_NAMESPACES means not to accept objects, and possibly types.
3370 LOOKUP_PREFER_BOTH means class-or-namespace-name. */
3372 #define LOOKUP_PROTECT (1)
3373 #define LOOKUP_COMPLAIN (2)
3374 #define LOOKUP_NORMAL (3)
3375 #define LOOKUP_NONVIRTUAL (8)
3376 #define LOOKUP_GLOBAL (16)
3377 #define LOOKUP_SPECULATIVELY (64)
3378 #define LOOKUP_ONLYCONVERTING (128)
3379 #define DIRECT_BIND (256)
3380 #define LOOKUP_NO_CONVERSION (512)
3381 #define LOOKUP_DESTRUCTOR (512)
3382 #define LOOKUP_NO_TEMP_BIND (1024)
3383 #define LOOKUP_PREFER_TYPES (2048)
3384 #define LOOKUP_PREFER_NAMESPACES (4096)
3385 #define LOOKUP_PREFER_BOTH (6144)
3387 #define LOOKUP_NAMESPACES_ONLY(F) \
3388 (((F) & LOOKUP_PREFER_NAMESPACES) && !((F) & LOOKUP_PREFER_TYPES))
3389 #define LOOKUP_TYPES_ONLY(F) \
3390 (!((F) & LOOKUP_PREFER_NAMESPACES) && ((F) & LOOKUP_PREFER_TYPES))
3391 #define LOOKUP_QUALIFIERS_ONLY(F) ((F) & LOOKUP_PREFER_BOTH)
3394 /* These flags are used by the conversion code.
3395 CONV_IMPLICIT : Perform implicit conversions (standard and user-defined).
3396 CONV_STATIC : Perform the explicit conversions for static_cast.
3397 CONV_CONST : Perform the explicit conversions for const_cast.
3398 CONV_REINTERPRET: Perform the explicit conversions for reinterpret_cast.
3399 CONV_PRIVATE : Perform upcasts to private bases.
3400 CONV_FORCE_TEMP : Require a new temporary when converting to the same
3403 #define CONV_IMPLICIT 1
3404 #define CONV_STATIC 2
3405 #define CONV_CONST 4
3406 #define CONV_REINTERPRET 8
3407 #define CONV_PRIVATE 16
3408 /* #define CONV_NONCONVERTING 32 */
3409 #define CONV_FORCE_TEMP 64
3410 #define CONV_STATIC_CAST (CONV_IMPLICIT | CONV_STATIC | CONV_FORCE_TEMP)
3411 #define CONV_OLD_CONVERT (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
3413 #define CONV_C_CAST (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
3414 | CONV_REINTERPRET | CONV_PRIVATE | CONV_FORCE_TEMP)
3416 /* Used by build_expr_type_conversion to indicate which types are
3417 acceptable as arguments to the expression under consideration. */
3419 #define WANT_INT 1 /* integer types, including bool */
3420 #define WANT_FLOAT 2 /* floating point types */
3421 #define WANT_ENUM 4 /* enumerated types */
3422 #define WANT_POINTER 8 /* pointer types */
3423 #define WANT_NULL 16 /* null pointer constant */
3424 #define WANT_ARITH (WANT_INT | WANT_FLOAT)
3426 /* Used with comptypes, and related functions, to guide type
3429 #define COMPARE_STRICT 0 /* Just check if the types are the
3431 #define COMPARE_BASE 1 /* Check to see if the second type is
3432 derived from the first, or if both
3433 are pointers (or references) and
3434 the types pointed to by the second
3435 type is derived from the pointed to
3437 #define COMPARE_RELAXED 2 /* Like COMPARE_DERIVED, but in
3438 reverse. Also treat enmeration
3439 types as the same as integer types
3440 of the same width. */
3441 #define COMPARE_REDECLARATION 4 /* The comparsion is being done when
3442 another declaration of an existing
3444 #define COMPARE_NO_ATTRIBUTES 8 /* The comparison should ignore
3445 extra-linguistic type attributes. */
3447 /* Used with push_overloaded_decl. */
3448 #define PUSH_GLOBAL 0 /* Push the DECL into namespace scope,
3449 regardless of the current scope. */
3450 #define PUSH_LOCAL 1 /* Push the DECL into the current
3452 #define PUSH_USING 2 /* We are pushing this DECL as the