1996-09-18 05:35:50 +00:00
|
|
|
|
/* Definitions for C++ parsing and type checking.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
Contributed by Michael Tiemann (tiemann@cygnus.com)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
This file is part of GCC.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
GCC is free software; you can redistribute it and/or modify
|
1996-09-18 05:35:50 +00:00
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
|
any later version.
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
GCC is distributed in the hope that it will be useful,
|
1996-09-18 05:35:50 +00:00
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
2004-07-28 03:11:36 +00:00
|
|
|
|
along with GCC; see the file COPYING. If not, write to
|
1996-09-18 05:35:50 +00:00
|
|
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
|
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#ifndef GCC_CP_TREE_H
|
|
|
|
|
#define GCC_CP_TREE_H
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#include "ggc.h"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#include "function.h"
|
|
|
|
|
#include "hashtab.h"
|
|
|
|
|
#include "splay-tree.h"
|
|
|
|
|
#include "varray.h"
|
|
|
|
|
|
|
|
|
|
#include "c-common.h"
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#include "name-lookup.h"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct diagnostic_context;
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Usage of TREE_LANG_FLAG_?:
|
1999-10-16 06:09:09 +00:00
|
|
|
|
0: BINFO_MARKED (BINFO nodes).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
IDENTIFIER_MARKED (IDENTIFIER_NODEs)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
NEW_EXPR_USE_GLOBAL (in NEW_EXPR).
|
|
|
|
|
DELETE_EXPR_USE_GLOBAL (in DELETE_EXPR).
|
2004-07-28 03:11:36 +00:00
|
|
|
|
COMPOUND_EXPR_OVERLOADED (in COMPOUND_EXPR).
|
1999-10-16 06:09:09 +00:00
|
|
|
|
TREE_INDIRECT_USING (in NAMESPACE_DECL).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
ICS_USER_FLAG (in _CONV)
|
|
|
|
|
CLEANUP_P (in TRY_BLOCK)
|
|
|
|
|
AGGR_INIT_VIA_CTOR_P (in AGGR_INIT_EXPR)
|
|
|
|
|
PTRMEM_OK_P (in ADDR_EXPR, OFFSET_REF)
|
|
|
|
|
PARMLIST_ELLIPSIS_P (in PARMLIST)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_PRETTY_FUNCTION_P (in VAR_DECL)
|
|
|
|
|
KOENIG_LOOKUP_P (in CALL_EXPR)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
1: IDENTIFIER_VIRTUAL_P.
|
1999-08-26 09:30:50 +00:00
|
|
|
|
TI_PENDING_TEMPLATE_FLAG.
|
|
|
|
|
TEMPLATE_PARMS_FOR_INLINE.
|
|
|
|
|
DELETE_EXPR_USE_VEC (in DELETE_EXPR).
|
|
|
|
|
(TREE_CALLS_NEW) (in _EXPR or _REF) (commented-out).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (in _TYPE).
|
|
|
|
|
ICS_ELLIPSIS_FLAG (in _CONV)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
BINFO_DEPENDENT_BASE_P (in BINFO)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
DECL_INITIALIZED_P (in VAR_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
2: IDENTIFIER_OPNAME_P.
|
2003-07-11 03:40:53 +00:00
|
|
|
|
TYPE_POLYMORPHIC_P (in _TYPE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
ICS_THIS_FLAG (in _CONV)
|
|
|
|
|
BINFO_LOST_PRIMARY_P (in BINFO)
|
|
|
|
|
TREE_PARMLIST (in TREE_LIST)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (in VAR_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
3: TYPE_USES_VIRTUAL_BASECLASSES (in a class TYPE).
|
|
|
|
|
BINFO_VTABLE_PATH_MARKED.
|
1999-10-16 06:09:09 +00:00
|
|
|
|
BINFO_PUSHDECLS_MARKED.
|
1999-08-26 09:30:50 +00:00
|
|
|
|
(TREE_REFERENCE_EXPR) (in NON_LVALUE_EXPR) (commented-out).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
ICS_BAD_FLAG (in _CONV)
|
|
|
|
|
FN_TRY_BLOCK_P (in TRY_BLOCK)
|
|
|
|
|
IDENTIFIER_CTOR_OR_DTOR_P (in IDENTIFIER_NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
4: BINFO_NEW_VTABLE_MARKED.
|
|
|
|
|
TREE_HAS_CONSTRUCTOR (in INDIRECT_REF, SAVE_EXPR, CONSTRUCTOR,
|
|
|
|
|
or FIELD_DECL).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
NEED_TEMPORARY_P (in REF_BIND, BASE_CONV)
|
|
|
|
|
IDENTIFIER_TYPENAME_P (in IDENTIFIER_NODE)
|
|
|
|
|
5: C_IS_RESERVED_WORD (in IDENTIFIER_NODE)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_VTABLE_OR_VTT_P (in VAR_DECL)
|
|
|
|
|
6: For future expansion
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
Usage of TYPE_LANG_FLAG_?:
|
2004-07-28 03:11:36 +00:00
|
|
|
|
0: TYPE_DEPENDENT_P
|
1999-08-26 09:30:50 +00:00
|
|
|
|
1: TYPE_HAS_CONSTRUCTOR.
|
|
|
|
|
2: TYPE_HAS_DESTRUCTOR.
|
|
|
|
|
3: TYPE_FOR_JAVA.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
4: TYPE_HAS_NONTRIVIAL_DESTRUCTOR
|
1999-08-26 09:30:50 +00:00
|
|
|
|
5: IS_AGGR_TYPE.
|
2004-07-28 03:11:36 +00:00
|
|
|
|
6: TYPE_DEPENDENT_P_VALID
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
Usage of DECL_LANG_FLAG_?:
|
|
|
|
|
0: DECL_ERROR_REPORTED (in VAR_DECL).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_TEMPLATE_PARM_P (in PARM_DECL, CONST_DECL, TYPE_DECL, or TEMPLATE_DECL)
|
|
|
|
|
DECL_LOCAL_FUNCTION_P (in FUNCTION_DECL)
|
|
|
|
|
DECL_MUTABLE_P (in FIELD_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
1: C_TYPEDEF_EXPLICITLY_SIGNED (in TYPE_DECL).
|
1999-10-16 06:09:09 +00:00
|
|
|
|
DECL_TEMPLATE_INSTANTIATED (in a VAR_DECL or a FUNCTION_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
2: DECL_THIS_EXTERN (in VAR_DECL or FUNCTION_DECL).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_IMPLICIT_TYPEDEF_P (in a TYPE_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
3: DECL_IN_AGGR_P.
|
2003-07-11 03:40:53 +00:00
|
|
|
|
4: DECL_C_BIT_FIELD (in a FIELD_DECL)
|
|
|
|
|
DECL_VAR_MARKED_P (in a VAR_DECL)
|
2003-08-22 02:56:07 +00:00
|
|
|
|
DECL_SELF_REFERENCE_P (in a TYPE_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
5: DECL_INTERFACE_KNOWN.
|
|
|
|
|
6: DECL_THIS_STATIC (in VAR_DECL or FUNCTION_DECL).
|
|
|
|
|
7: DECL_DEAD_FOR_LOCAL (in VAR_DECL).
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_THUNK_P (in a member FUNCTION_DECL)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
Usage of language-independent fields in a language-dependent manner:
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
TREE_USED
|
|
|
|
|
This field is BINFO_INDIRECT_PRIMARY_P in a BINFO.
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
TYPE_ALIAS_SET
|
|
|
|
|
This field is used by TYPENAME_TYPEs, TEMPLATE_TYPE_PARMs, and so
|
|
|
|
|
forth as a substitute for the mark bits provided in `lang_type'.
|
|
|
|
|
At present, only the six low-order bits are used.
|
|
|
|
|
|
|
|
|
|
TYPE_BINFO
|
|
|
|
|
For an ENUMERAL_TYPE, this is ENUM_TEMPLATE_INFO.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
For a FUNCTION_TYPE or METHOD_TYPE, this is TYPE_RAISES_EXCEPTIONS
|
|
|
|
|
|
|
|
|
|
BINFO_VIRTUALS
|
2003-07-11 03:40:53 +00:00
|
|
|
|
For a binfo, this is a TREE_LIST. There is an entry for each
|
|
|
|
|
virtual function declared either in BINFO or its direct and
|
|
|
|
|
indirect primary bases.
|
|
|
|
|
|
|
|
|
|
The BV_DELTA of each node gives the amount by which to adjust the
|
|
|
|
|
`this' pointer when calling the function. If the method is an
|
2004-07-28 03:11:36 +00:00
|
|
|
|
overridden version of a base class method, then it is assumed
|
2003-07-11 03:40:53 +00:00
|
|
|
|
that, prior to adjustment, the this pointer points to an object
|
|
|
|
|
of the base class.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
|
2003-07-11 03:40:53 +00:00
|
|
|
|
index of the vcall offset for this entry.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
The BV_FN is the declaration for the virtual function itself.
|
|
|
|
|
|
|
|
|
|
BINFO_VTABLE
|
|
|
|
|
This is an expression with POINTER_TYPE that gives the value
|
|
|
|
|
to which the vptr should be initialized. Use get_vtbl_decl_for_binfo
|
|
|
|
|
to extract the VAR_DECL for the complete vtable.
|
|
|
|
|
|
|
|
|
|
DECL_ARGUMENTS
|
|
|
|
|
For a VAR_DECL this is DECL_ANON_UNION_ELEMS.
|
|
|
|
|
|
|
|
|
|
DECL_VINDEX
|
|
|
|
|
This field is NULL for a non-virtual function. For a virtual
|
|
|
|
|
function, it is eventually set to an INTEGER_CST indicating the
|
|
|
|
|
index in the vtable at which this function can be found. When
|
|
|
|
|
a virtual function is declared, but before it is known what
|
2004-07-28 03:11:36 +00:00
|
|
|
|
function is overridden, this field is the error_mark_node.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
Temporarily, it may be set to a TREE_LIST whose TREE_VALUE is
|
|
|
|
|
the virtual function this one overrides, and whose TREE_CHAIN is
|
|
|
|
|
the old DECL_VINDEX. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Language-specific tree checkers. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define VAR_OR_FUNCTION_DECL_CHECK(NODE) __extension__ \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
({ const tree __t = (NODE); \
|
|
|
|
|
enum tree_code const __c = TREE_CODE(__t); \
|
|
|
|
|
if (__c != VAR_DECL && __c != FUNCTION_DECL) \
|
|
|
|
|
tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
|
|
|
|
|
__FUNCTION__); \
|
|
|
|
|
__t; })
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) __extension__ \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
({ const tree __t = (NODE); \
|
|
|
|
|
enum tree_code const __c = TREE_CODE(__t); \
|
|
|
|
|
if (__c != VAR_DECL \
|
|
|
|
|
&& __c != FUNCTION_DECL \
|
|
|
|
|
&& __c != PARM_DECL) \
|
|
|
|
|
tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
|
|
|
|
|
__FUNCTION__); \
|
|
|
|
|
__t; })
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) __extension__ \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
({ const tree __t = (NODE); \
|
|
|
|
|
enum tree_code const __c = TREE_CODE(__t); \
|
|
|
|
|
if (__c != VAR_DECL \
|
|
|
|
|
&& __c != FUNCTION_DECL \
|
|
|
|
|
&& __c != TYPE_DECL \
|
|
|
|
|
&& __c != TEMPLATE_DECL) \
|
|
|
|
|
tree_check_failed (__t, VAR_DECL, __FILE__, __LINE__, \
|
|
|
|
|
__FUNCTION__); \
|
|
|
|
|
__t; })
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define RECORD_OR_UNION_TYPE_CHECK(NODE) __extension__ \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
({ const tree __t = (NODE); \
|
|
|
|
|
enum tree_code const __c = TREE_CODE(__t); \
|
|
|
|
|
if (__c != RECORD_TYPE && __c != UNION_TYPE) \
|
|
|
|
|
tree_check_failed (__t, RECORD_TYPE, __FILE__, __LINE__, \
|
|
|
|
|
__FUNCTION__); \
|
|
|
|
|
__t; })
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) __extension__ \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
({ const tree __t = (NODE); \
|
|
|
|
|
enum tree_code const __c = TREE_CODE(__t); \
|
|
|
|
|
if (__c != BOUND_TEMPLATE_TEMPLATE_PARM) \
|
|
|
|
|
tree_check_failed (__t, BOUND_TEMPLATE_TEMPLATE_PARM, \
|
|
|
|
|
__FILE__, __LINE__, __FUNCTION__); \
|
|
|
|
|
__t; })
|
|
|
|
|
|
|
|
|
|
#else /* not ENABLE_TREE_CHECKING, or not gcc */
|
|
|
|
|
|
|
|
|
|
#define VAR_OR_FUNCTION_DECL_CHECK(NODE) (NODE)
|
|
|
|
|
#define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) (NODE)
|
|
|
|
|
#define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) (NODE)
|
|
|
|
|
#define RECORD_OR_UNION_TYPE_CHECK(NODE) (NODE)
|
|
|
|
|
#define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#endif
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Language-dependent contents of an identifier. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_identifier GTY(())
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct c_common_identifier c_common;
|
|
|
|
|
cxx_binding *namespace_bindings;
|
|
|
|
|
cxx_binding *bindings;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree class_value;
|
|
|
|
|
tree class_template_info;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree label_value;
|
|
|
|
|
tree implicit_decl;
|
|
|
|
|
tree error_locus;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
};
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* In an IDENTIFIER_NODE, nonzero if this identifier is actually a
|
|
|
|
|
keyword. C_RID_CODE (node) is then the RID_* value of the keyword,
|
|
|
|
|
and C_RID_YYCODE is the token number wanted by Yacc. */
|
|
|
|
|
|
|
|
|
|
#define C_IS_RESERVED_WORD(ID) TREE_LANG_FLAG_5 (ID)
|
|
|
|
|
|
|
|
|
|
#define LANG_IDENTIFIER_CAST(NODE) \
|
|
|
|
|
((struct lang_identifier*)IDENTIFIER_NODE_CHECK (NODE))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
typedef struct template_parm_index_s GTY(())
|
1999-08-26 09:30:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
struct tree_common common;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
HOST_WIDE_INT index;
|
|
|
|
|
HOST_WIDE_INT level;
|
|
|
|
|
HOST_WIDE_INT orig_level;
|
|
|
|
|
tree decl;
|
|
|
|
|
} template_parm_index;
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct ptrmem_cst GTY(())
|
1999-10-16 06:09:09 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
struct tree_common common;
|
|
|
|
|
/* This isn't used, but the middle-end expects all constants to have
|
|
|
|
|
this field. */
|
|
|
|
|
rtx rtl;
|
1999-10-16 06:09:09 +00:00
|
|
|
|
tree member;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
};
|
|
|
|
|
typedef struct ptrmem_cst * ptrmem_cst_t;
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define IDENTIFIER_GLOBAL_VALUE(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
namespace_binding ((NODE), global_namespace)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define SET_IDENTIFIER_GLOBAL_VALUE(NODE, VAL) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
set_namespace_binding ((NODE), global_namespace, (VAL))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define IDENTIFIER_NAMESPACE_VALUE(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
namespace_binding ((NODE), current_namespace)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define SET_IDENTIFIER_NAMESPACE_VALUE(NODE, VAL) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
set_namespace_binding ((NODE), current_namespace, (VAL))
|
|
|
|
|
|
|
|
|
|
#define CLEANUP_P(NODE) TREE_LANG_FLAG_0 (TRY_BLOCK_CHECK (NODE))
|
|
|
|
|
|
|
|
|
|
/* Returns nonzero iff TYPE1 and TYPE2 are the same type, in the usual
|
|
|
|
|
sense of `same'. */
|
|
|
|
|
#define same_type_p(TYPE1, TYPE2) \
|
|
|
|
|
comptypes ((TYPE1), (TYPE2), COMPARE_STRICT)
|
|
|
|
|
|
|
|
|
|
/* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
|
|
|
|
|
top-level qualifiers. */
|
|
|
|
|
#define same_type_ignoring_top_level_qualifiers_p(TYPE1, TYPE2) \
|
|
|
|
|
same_type_p (TYPE_MAIN_VARIANT (TYPE1), TYPE_MAIN_VARIANT (TYPE2))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if we are presently building a statement tree, rather
|
2002-02-01 18:16:02 +00:00
|
|
|
|
than expanding each statement as we encounter it. */
|
|
|
|
|
#define building_stmt_tree() (last_tree != NULL_TREE)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns nonzero iff NODE is a declaration for the global function
|
2002-02-01 18:16:02 +00:00
|
|
|
|
`main'. */
|
|
|
|
|
#define DECL_MAIN_P(NODE) \
|
|
|
|
|
(DECL_EXTERN_C_FUNCTION_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) != NULL_TREE \
|
|
|
|
|
&& MAIN_NAME_P (DECL_NAME (NODE)))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The overloaded FUNCTION_DECL. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define OVL_FUNCTION(NODE) \
|
|
|
|
|
(((struct tree_overload*)OVERLOAD_CHECK (NODE))->function)
|
|
|
|
|
#define OVL_CHAIN(NODE) TREE_CHAIN (NODE)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Polymorphic access to FUNCTION and CHAIN. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define OVL_CURRENT(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((TREE_CODE (NODE) == OVERLOAD) ? OVL_FUNCTION (NODE) : (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define OVL_NEXT(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((TREE_CODE (NODE) == OVERLOAD) ? TREE_CHAIN (NODE) : NULL_TREE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* If set, this was imported in a using declaration.
|
|
|
|
|
This is not to confuse with being used somewhere, which
|
2003-07-11 03:40:53 +00:00
|
|
|
|
is not important for this node. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define OVL_USED(NODE) TREE_USED (NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct tree_overload GTY(())
|
1999-08-26 09:30:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
struct tree_common common;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
tree function;
|
|
|
|
|
};
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns true iff NODE is a BASELINK. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define BASELINK_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(TREE_CODE (NODE) == BASELINK)
|
|
|
|
|
/* The BINFO indicating the base from which the BASELINK_FUNCTIONS came. */
|
|
|
|
|
#define BASELINK_BINFO(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The functions referred to by the BASELINK; either a FUNCTION_DECL,
|
|
|
|
|
a TEMPLATE_DECL, an OVERLOAD, or a TEMPLATE_ID_EXPR. */
|
|
|
|
|
#define BASELINK_FUNCTIONS(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(((struct tree_baselink*) BASELINK_CHECK (NODE))->functions)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The BINFO in which the search for the functions indicated by this baselink
|
|
|
|
|
began. This base is used to determine the accessibility of functions
|
|
|
|
|
selected by overload resolution. */
|
|
|
|
|
#define BASELINK_ACCESS_BINFO(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(((struct tree_baselink*) BASELINK_CHECK (NODE))->access_binfo)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* For a type-conversion operator, the BASELINK_OPTYPE indicates the type
|
|
|
|
|
to which the conversion should occur. This value is important if
|
|
|
|
|
the BASELINK_FUNCTIONS include a template conversion operator --
|
|
|
|
|
the BASELINK_OPTYPE can be used to determine what type the user
|
|
|
|
|
requested. */
|
|
|
|
|
#define BASELINK_OPTYPE(NODE) \
|
|
|
|
|
(TREE_CHAIN (BASELINK_CHECK (NODE)))
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
struct tree_baselink GTY(())
|
|
|
|
|
{
|
|
|
|
|
struct tree_common common;
|
|
|
|
|
tree binfo;
|
|
|
|
|
tree functions;
|
|
|
|
|
tree access_binfo;
|
|
|
|
|
};
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define WRAPPER_ZC(NODE) (((struct tree_wrapper*)WRAPPER_CHECK (NODE))->z_c)
|
|
|
|
|
|
|
|
|
|
struct tree_wrapper GTY(())
|
1999-08-26 09:30:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
struct tree_common common;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct z_candidate *z_c;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
};
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* The different kinds of ids that we ecounter. */
|
|
|
|
|
|
|
|
|
|
typedef enum cp_id_kind
|
1999-08-26 09:30:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Not an id at all. */
|
|
|
|
|
CP_ID_KIND_NONE,
|
|
|
|
|
/* An unqualified-id that is not a template-id. */
|
|
|
|
|
CP_ID_KIND_UNQUALIFIED,
|
|
|
|
|
/* An unqualified-id that is a dependent name. */
|
|
|
|
|
CP_ID_KIND_UNQUALIFIED_DEPENDENT,
|
|
|
|
|
/* An unqualified template-id. */
|
|
|
|
|
CP_ID_KIND_TEMPLATE_ID,
|
|
|
|
|
/* A qualified-id. */
|
|
|
|
|
CP_ID_KIND_QUALIFIED
|
|
|
|
|
} cp_id_kind;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Macros for access to language-specific slots in an identifier. */
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define IDENTIFIER_NAMESPACE_BINDINGS(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->namespace_bindings)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define IDENTIFIER_TEMPLATE(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->class_template_info)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The IDENTIFIER_BINDING is the innermost cxx_binding for the
|
|
|
|
|
identifier. It's PREVIOUS is the next outermost binding. Each
|
2004-07-28 03:11:36 +00:00
|
|
|
|
VALUE field is a DECL for the associated declaration. Thus,
|
1999-10-16 06:09:09 +00:00
|
|
|
|
name lookup consists simply of pulling off the node at the front
|
|
|
|
|
of the list (modulo oddities for looking up the names of types,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
and such.) You can use SCOPE field to determine the scope
|
|
|
|
|
that bound the name. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define IDENTIFIER_BINDING(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->bindings)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* The IDENTIFIER_VALUE is the value of the IDENTIFIER_BINDING, or
|
|
|
|
|
NULL_TREE if there is no binding. */
|
|
|
|
|
#define IDENTIFIER_VALUE(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(IDENTIFIER_BINDING (NODE) ? IDENTIFIER_BINDING (NODE)->value : NULL)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* If IDENTIFIER_CLASS_VALUE is set, then NODE is bound in the current
|
|
|
|
|
class, and IDENTIFIER_CLASS_VALUE is the value binding. This is
|
2004-07-28 03:11:36 +00:00
|
|
|
|
just a pointer to the VALUE field of one of the bindings in the
|
1999-10-16 06:09:09 +00:00
|
|
|
|
IDENTIFIER_BINDINGs list, so any time that this is non-NULL so is
|
|
|
|
|
IDENTIFIER_BINDING. */
|
|
|
|
|
#define IDENTIFIER_CLASS_VALUE(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->class_value)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* TREE_TYPE only indicates on local and class scope the current
|
|
|
|
|
type. For namespace scope, the presence of a type in any namespace
|
|
|
|
|
is indicated with global_type_node, and the real type behind must
|
2003-07-11 03:40:53 +00:00
|
|
|
|
be found through lookup. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IDENTIFIER_TYPE_VALUE(NODE) identifier_type_value (NODE)
|
|
|
|
|
#define REAL_IDENTIFIER_TYPE_VALUE(NODE) TREE_TYPE (NODE)
|
|
|
|
|
#define SET_IDENTIFIER_TYPE_VALUE(NODE,TYPE) (TREE_TYPE (NODE) = (TYPE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define IDENTIFIER_HAS_TYPE_VALUE(NODE) (IDENTIFIER_TYPE_VALUE (NODE) ? 1 : 0)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IDENTIFIER_LABEL_VALUE(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->label_value)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_IDENTIFIER_LABEL_VALUE(NODE, VALUE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
IDENTIFIER_LABEL_VALUE (NODE) = (VALUE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IDENTIFIER_IMPLICIT_DECL(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->implicit_decl)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_IDENTIFIER_IMPLICIT_DECL(NODE, VALUE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
IDENTIFIER_IMPLICIT_DECL (NODE) = (VALUE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IDENTIFIER_ERROR_LOCUS(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(LANG_IDENTIFIER_CAST (NODE)->error_locus)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_IDENTIFIER_ERROR_LOCUS(NODE, VALUE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
IDENTIFIER_ERROR_LOCUS (NODE) = (VALUE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this identifier is used as a virtual function name somewhere
|
|
|
|
|
(optimizes searches). */
|
|
|
|
|
#define IDENTIFIER_VIRTUAL_P(NODE) TREE_LANG_FLAG_1 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this identifier is the prefix for a mangled C++ operator
|
|
|
|
|
name. */
|
|
|
|
|
#define IDENTIFIER_OPNAME_P(NODE) TREE_LANG_FLAG_2 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero if this identifier is the name of a type-conversion
|
|
|
|
|
operator. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IDENTIFIER_TYPENAME_P(NODE) \
|
|
|
|
|
TREE_LANG_FLAG_4 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this identifier is the name of a constructor or
|
|
|
|
|
destructor. */
|
|
|
|
|
#define IDENTIFIER_CTOR_OR_DTOR_P(NODE) \
|
|
|
|
|
TREE_LANG_FLAG_3 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* In a RECORD_TYPE or UNION_TYPE, nonzero if any component is read-only. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define C_TYPE_FIELDS_READONLY(TYPE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (TYPE)->fields_readonly)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Store a value in that field. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define C_SET_EXP_ORIGINAL_CODE(EXP, CODE) \
|
|
|
|
|
(TREE_COMPLEXITY (EXP) = (int)(CODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* The tokens stored in the default argument. */
|
|
|
|
|
|
|
|
|
|
#define DEFARG_TOKENS(NODE) \
|
|
|
|
|
(((struct tree_default_arg *)DEFAULT_ARG_CHECK (NODE))->tokens)
|
|
|
|
|
|
|
|
|
|
struct tree_default_arg GTY (())
|
|
|
|
|
{
|
|
|
|
|
struct tree_common common;
|
|
|
|
|
struct cp_token_cache *tokens;
|
|
|
|
|
};
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
enum cp_tree_node_structure_enum {
|
|
|
|
|
TS_CP_GENERIC,
|
|
|
|
|
TS_CP_IDENTIFIER,
|
|
|
|
|
TS_CP_TPI,
|
|
|
|
|
TS_CP_PTRMEM,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
TS_CP_BINDING,
|
2003-07-11 03:40:53 +00:00
|
|
|
|
TS_CP_OVERLOAD,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
TS_CP_BASELINK,
|
2003-07-11 03:40:53 +00:00
|
|
|
|
TS_CP_WRAPPER,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
TS_CP_DEFAULT_ARG,
|
2003-07-11 03:40:53 +00:00
|
|
|
|
LAST_TS_CP_ENUM
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The resulting tree type. */
|
|
|
|
|
union lang_tree_node GTY((desc ("cp_tree_node_structure (&%h)"),
|
|
|
|
|
chain_next ("(union lang_tree_node *)TREE_CHAIN (&%h.generic)")))
|
|
|
|
|
{
|
|
|
|
|
union tree_node GTY ((tag ("TS_CP_GENERIC"),
|
|
|
|
|
desc ("tree_node_structure (&%h)"))) generic;
|
|
|
|
|
struct template_parm_index_s GTY ((tag ("TS_CP_TPI"))) tpi;
|
|
|
|
|
struct ptrmem_cst GTY ((tag ("TS_CP_PTRMEM"))) ptrmem;
|
|
|
|
|
struct tree_overload GTY ((tag ("TS_CP_OVERLOAD"))) overload;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
struct tree_baselink GTY ((tag ("TS_CP_BASELINK"))) baselink;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct tree_wrapper GTY ((tag ("TS_CP_WRAPPER"))) wrapper;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
struct tree_default_arg GTY ((tag ("TS_CP_DEFAULT_ARG"))) default_arg;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_identifier GTY ((tag ("TS_CP_IDENTIFIER"))) identifier;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
enum cp_tree_index
|
|
|
|
|
{
|
|
|
|
|
CPTI_JAVA_BYTE_TYPE,
|
|
|
|
|
CPTI_JAVA_SHORT_TYPE,
|
|
|
|
|
CPTI_JAVA_INT_TYPE,
|
|
|
|
|
CPTI_JAVA_LONG_TYPE,
|
|
|
|
|
CPTI_JAVA_FLOAT_TYPE,
|
|
|
|
|
CPTI_JAVA_DOUBLE_TYPE,
|
|
|
|
|
CPTI_JAVA_CHAR_TYPE,
|
|
|
|
|
CPTI_JAVA_BOOLEAN_TYPE,
|
|
|
|
|
|
|
|
|
|
CPTI_WCHAR_DECL,
|
|
|
|
|
CPTI_VTABLE_ENTRY_TYPE,
|
|
|
|
|
CPTI_DELTA_TYPE,
|
|
|
|
|
CPTI_VTABLE_INDEX_TYPE,
|
|
|
|
|
CPTI_CLEANUP_TYPE,
|
|
|
|
|
CPTI_VTT_PARM_TYPE,
|
|
|
|
|
|
|
|
|
|
CPTI_TI_DESC_TYPE,
|
|
|
|
|
CPTI_BLTN_DESC_TYPE,
|
|
|
|
|
CPTI_PTR_DESC_TYPE,
|
|
|
|
|
CPTI_ARY_DESC_TYPE,
|
|
|
|
|
CPTI_FUNC_DESC_TYPE,
|
|
|
|
|
CPTI_ENUM_DESC_TYPE,
|
|
|
|
|
CPTI_CLASS_DESC_TYPE,
|
|
|
|
|
CPTI_SI_CLASS_DESC_TYPE,
|
|
|
|
|
CPTI_VMI_CLASS_DESC_TYPE,
|
|
|
|
|
CPTI_PTM_DESC_TYPE,
|
|
|
|
|
CPTI_BASE_DESC_TYPE,
|
|
|
|
|
|
|
|
|
|
CPTI_CLASS_TYPE,
|
|
|
|
|
CPTI_UNKNOWN_TYPE,
|
|
|
|
|
CPTI_VTBL_TYPE,
|
|
|
|
|
CPTI_VTBL_PTR_TYPE,
|
|
|
|
|
CPTI_STD,
|
|
|
|
|
CPTI_ABI,
|
|
|
|
|
CPTI_TYPE_INFO_TYPE,
|
2002-09-01 20:38:57 +00:00
|
|
|
|
CPTI_TYPE_INFO_PTR_TYPE,
|
2004-07-28 03:11:36 +00:00
|
|
|
|
CPTI_TYPE_INFO_REF_TYPE,
|
2002-02-01 18:16:02 +00:00
|
|
|
|
CPTI_ABORT_FNDECL,
|
|
|
|
|
CPTI_GLOBAL_DELETE_FNDECL,
|
|
|
|
|
CPTI_AGGR_TAG,
|
|
|
|
|
|
|
|
|
|
CPTI_CTOR_IDENTIFIER,
|
|
|
|
|
CPTI_COMPLETE_CTOR_IDENTIFIER,
|
|
|
|
|
CPTI_BASE_CTOR_IDENTIFIER,
|
|
|
|
|
CPTI_DTOR_IDENTIFIER,
|
|
|
|
|
CPTI_COMPLETE_DTOR_IDENTIFIER,
|
|
|
|
|
CPTI_BASE_DTOR_IDENTIFIER,
|
|
|
|
|
CPTI_DELETING_DTOR_IDENTIFIER,
|
|
|
|
|
CPTI_DELTA_IDENTIFIER,
|
|
|
|
|
CPTI_IN_CHARGE_IDENTIFIER,
|
|
|
|
|
CPTI_VTT_PARM_IDENTIFIER,
|
|
|
|
|
CPTI_NELTS_IDENTIFIER,
|
|
|
|
|
CPTI_THIS_IDENTIFIER,
|
|
|
|
|
CPTI_PFN_IDENTIFIER,
|
|
|
|
|
CPTI_VPTR_IDENTIFIER,
|
|
|
|
|
CPTI_STD_IDENTIFIER,
|
|
|
|
|
|
|
|
|
|
CPTI_LANG_NAME_C,
|
|
|
|
|
CPTI_LANG_NAME_CPLUSPLUS,
|
|
|
|
|
CPTI_LANG_NAME_JAVA,
|
|
|
|
|
|
|
|
|
|
CPTI_EMPTY_EXCEPT_SPEC,
|
|
|
|
|
CPTI_NULL,
|
|
|
|
|
CPTI_JCLASS,
|
|
|
|
|
CPTI_TERMINATE,
|
|
|
|
|
CPTI_CALL_UNEXPECTED,
|
|
|
|
|
CPTI_ATEXIT,
|
|
|
|
|
CPTI_DSO_HANDLE,
|
|
|
|
|
CPTI_DCAST,
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
CPTI_KEYED_CLASSES,
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
CPTI_MAX
|
|
|
|
|
};
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) tree cp_global_trees[CPTI_MAX];
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define java_byte_type_node cp_global_trees[CPTI_JAVA_BYTE_TYPE]
|
|
|
|
|
#define java_short_type_node cp_global_trees[CPTI_JAVA_SHORT_TYPE]
|
|
|
|
|
#define java_int_type_node cp_global_trees[CPTI_JAVA_INT_TYPE]
|
|
|
|
|
#define java_long_type_node cp_global_trees[CPTI_JAVA_LONG_TYPE]
|
|
|
|
|
#define java_float_type_node cp_global_trees[CPTI_JAVA_FLOAT_TYPE]
|
|
|
|
|
#define java_double_type_node cp_global_trees[CPTI_JAVA_DOUBLE_TYPE]
|
|
|
|
|
#define java_char_type_node cp_global_trees[CPTI_JAVA_CHAR_TYPE]
|
|
|
|
|
#define java_boolean_type_node cp_global_trees[CPTI_JAVA_BOOLEAN_TYPE]
|
|
|
|
|
|
|
|
|
|
#define wchar_decl_node cp_global_trees[CPTI_WCHAR_DECL]
|
|
|
|
|
#define vtable_entry_type cp_global_trees[CPTI_VTABLE_ENTRY_TYPE]
|
|
|
|
|
/* The type used to represent an offset by which to adjust the `this'
|
|
|
|
|
pointer in pointer-to-member types. */
|
|
|
|
|
#define delta_type_node cp_global_trees[CPTI_DELTA_TYPE]
|
|
|
|
|
/* The type used to represent an index into the vtable. */
|
|
|
|
|
#define vtable_index_type cp_global_trees[CPTI_VTABLE_INDEX_TYPE]
|
|
|
|
|
|
|
|
|
|
#define ti_desc_type_node cp_global_trees[CPTI_TI_DESC_TYPE]
|
|
|
|
|
#define bltn_desc_type_node cp_global_trees[CPTI_BLTN_DESC_TYPE]
|
|
|
|
|
#define ptr_desc_type_node cp_global_trees[CPTI_PTR_DESC_TYPE]
|
|
|
|
|
#define ary_desc_type_node cp_global_trees[CPTI_ARY_DESC_TYPE]
|
|
|
|
|
#define func_desc_type_node cp_global_trees[CPTI_FUNC_DESC_TYPE]
|
|
|
|
|
#define enum_desc_type_node cp_global_trees[CPTI_ENUM_DESC_TYPE]
|
|
|
|
|
#define class_desc_type_node cp_global_trees[CPTI_CLASS_DESC_TYPE]
|
|
|
|
|
#define si_class_desc_type_node cp_global_trees[CPTI_SI_CLASS_DESC_TYPE]
|
|
|
|
|
#define vmi_class_desc_type_node cp_global_trees[CPTI_VMI_CLASS_DESC_TYPE]
|
|
|
|
|
#define ptm_desc_type_node cp_global_trees[CPTI_PTM_DESC_TYPE]
|
|
|
|
|
#define base_desc_type_node cp_global_trees[CPTI_BASE_DESC_TYPE]
|
|
|
|
|
|
|
|
|
|
#define class_type_node cp_global_trees[CPTI_CLASS_TYPE]
|
|
|
|
|
#define unknown_type_node cp_global_trees[CPTI_UNKNOWN_TYPE]
|
|
|
|
|
#define vtbl_type_node cp_global_trees[CPTI_VTBL_TYPE]
|
|
|
|
|
#define vtbl_ptr_type_node cp_global_trees[CPTI_VTBL_PTR_TYPE]
|
|
|
|
|
#define std_node cp_global_trees[CPTI_STD]
|
|
|
|
|
#define abi_node cp_global_trees[CPTI_ABI]
|
|
|
|
|
#define type_info_type_node cp_global_trees[CPTI_TYPE_INFO_TYPE]
|
2002-09-01 20:38:57 +00:00
|
|
|
|
#define type_info_ptr_type cp_global_trees[CPTI_TYPE_INFO_PTR_TYPE]
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define type_info_ref_type cp_global_trees[CPTI_TYPE_INFO_REF_TYPE]
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define abort_fndecl cp_global_trees[CPTI_ABORT_FNDECL]
|
|
|
|
|
#define global_delete_fndecl cp_global_trees[CPTI_GLOBAL_DELETE_FNDECL]
|
|
|
|
|
#define current_aggr cp_global_trees[CPTI_AGGR_TAG]
|
|
|
|
|
|
|
|
|
|
/* We cache these tree nodes so as to call get_identifier less
|
|
|
|
|
frequently. */
|
|
|
|
|
|
|
|
|
|
/* The name of a constructor that takes an in-charge parameter to
|
|
|
|
|
decide whether or not to construct virtual base classes. */
|
|
|
|
|
#define ctor_identifier cp_global_trees[CPTI_CTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a constructor that constructs virtual base classes. */
|
|
|
|
|
#define complete_ctor_identifier cp_global_trees[CPTI_COMPLETE_CTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a constructor that does not construct virtual base classes. */
|
|
|
|
|
#define base_ctor_identifier cp_global_trees[CPTI_BASE_CTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a destructor that takes an in-charge parameter to
|
|
|
|
|
decide whether or not to destroy virtual base classes and whether
|
|
|
|
|
or not to delete the object. */
|
|
|
|
|
#define dtor_identifier cp_global_trees[CPTI_DTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a destructor that destroys virtual base classes. */
|
|
|
|
|
#define complete_dtor_identifier cp_global_trees[CPTI_COMPLETE_DTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a destructor that does not destroy virtual base
|
|
|
|
|
classes. */
|
|
|
|
|
#define base_dtor_identifier cp_global_trees[CPTI_BASE_DTOR_IDENTIFIER]
|
|
|
|
|
/* The name of a destructor that destroys virtual base classes, and
|
|
|
|
|
then deletes the entire object. */
|
|
|
|
|
#define deleting_dtor_identifier cp_global_trees[CPTI_DELETING_DTOR_IDENTIFIER]
|
|
|
|
|
#define delta_identifier cp_global_trees[CPTI_DELTA_IDENTIFIER]
|
|
|
|
|
#define in_charge_identifier cp_global_trees[CPTI_IN_CHARGE_IDENTIFIER]
|
|
|
|
|
/* The name of the parameter that contains a pointer to the VTT to use
|
|
|
|
|
for this subobject constructor or destructor. */
|
|
|
|
|
#define vtt_parm_identifier cp_global_trees[CPTI_VTT_PARM_IDENTIFIER]
|
|
|
|
|
#define nelts_identifier cp_global_trees[CPTI_NELTS_IDENTIFIER]
|
|
|
|
|
#define this_identifier cp_global_trees[CPTI_THIS_IDENTIFIER]
|
|
|
|
|
#define pfn_identifier cp_global_trees[CPTI_PFN_IDENTIFIER]
|
|
|
|
|
#define vptr_identifier cp_global_trees[CPTI_VPTR_IDENTIFIER]
|
|
|
|
|
/* The name of the std namespace. */
|
|
|
|
|
#define std_identifier cp_global_trees[CPTI_STD_IDENTIFIER]
|
|
|
|
|
#define lang_name_c cp_global_trees[CPTI_LANG_NAME_C]
|
|
|
|
|
#define lang_name_cplusplus cp_global_trees[CPTI_LANG_NAME_CPLUSPLUS]
|
|
|
|
|
#define lang_name_java cp_global_trees[CPTI_LANG_NAME_JAVA]
|
|
|
|
|
|
|
|
|
|
/* Exception specifier used for throw(). */
|
|
|
|
|
#define empty_except_spec cp_global_trees[CPTI_EMPTY_EXCEPT_SPEC]
|
|
|
|
|
|
|
|
|
|
/* The node for `__null'. */
|
|
|
|
|
#define null_node cp_global_trees[CPTI_NULL]
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* If non-NULL, a POINTER_TYPE equivalent to (java::lang::Class*). */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define jclass_node cp_global_trees[CPTI_JCLASS]
|
|
|
|
|
|
|
|
|
|
/* The declaration for `std::terminate'. */
|
|
|
|
|
#define terminate_node cp_global_trees[CPTI_TERMINATE]
|
|
|
|
|
|
|
|
|
|
/* The declaration for "__cxa_call_unexpected". */
|
|
|
|
|
#define call_unexpected_node cp_global_trees[CPTI_CALL_UNEXPECTED]
|
|
|
|
|
|
|
|
|
|
/* A pointer to `std::atexit'. */
|
|
|
|
|
#define atexit_node cp_global_trees[CPTI_ATEXIT]
|
|
|
|
|
|
|
|
|
|
/* A pointer to `__dso_handle'. */
|
|
|
|
|
#define dso_handle_node cp_global_trees[CPTI_DSO_HANDLE]
|
|
|
|
|
|
|
|
|
|
/* The declaration of the dynamic_cast runtime. */
|
|
|
|
|
#define dynamic_cast_node cp_global_trees[CPTI_DCAST]
|
|
|
|
|
|
|
|
|
|
/* The type of a destructor. */
|
|
|
|
|
#define cleanup_type cp_global_trees[CPTI_CLEANUP_TYPE]
|
|
|
|
|
|
|
|
|
|
/* The type of the vtt parameter passed to subobject constructors and
|
|
|
|
|
destructors. */
|
|
|
|
|
#define vtt_parm_type cp_global_trees[CPTI_VTT_PARM_TYPE]
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* A TREE_LIST of the dynamic classes whose vtables may have to be
|
|
|
|
|
emitted in this translation unit. */
|
|
|
|
|
|
|
|
|
|
#define keyed_classes cp_global_trees[CPTI_KEYED_CLASSES]
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Node to indicate default access. This must be distinct from the
|
|
|
|
|
access nodes in tree.h. */
|
|
|
|
|
|
|
|
|
|
#define access_default_node null_node
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Global state. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct saved_scope GTY(())
|
2002-02-01 18:16:02 +00:00
|
|
|
|
{
|
2003-07-11 03:40:53 +00:00
|
|
|
|
cxx_saved_binding *old_bindings;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree old_namespace;
|
|
|
|
|
tree decl_ns_list;
|
|
|
|
|
tree class_name;
|
|
|
|
|
tree class_type;
|
|
|
|
|
tree access_specifier;
|
|
|
|
|
tree function_decl;
|
|
|
|
|
varray_type lang_base;
|
|
|
|
|
tree lang_name;
|
|
|
|
|
tree template_parms;
|
|
|
|
|
tree x_previous_class_type;
|
|
|
|
|
tree x_previous_class_values;
|
|
|
|
|
tree x_saved_tree;
|
|
|
|
|
|
|
|
|
|
HOST_WIDE_INT x_processing_template_decl;
|
|
|
|
|
int x_processing_specialization;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
bool x_processing_explicit_instantiation;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
int need_pop_function_context;
|
|
|
|
|
|
|
|
|
|
struct stmt_tree_s x_stmt_tree;
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct cp_binding_level *class_bindings;
|
|
|
|
|
struct cp_binding_level *bindings;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
struct saved_scope *prev;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The current open namespace. */
|
|
|
|
|
|
|
|
|
|
#define current_namespace scope_chain->old_namespace
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The stack for namespaces of current declarations. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define decl_namespace_list scope_chain->decl_ns_list
|
|
|
|
|
|
|
|
|
|
/* IDENTIFIER_NODE: name of current class */
|
|
|
|
|
|
|
|
|
|
#define current_class_name scope_chain->class_name
|
|
|
|
|
|
|
|
|
|
/* _TYPE: the type of the current class */
|
|
|
|
|
|
|
|
|
|
#define current_class_type scope_chain->class_type
|
|
|
|
|
|
|
|
|
|
/* When parsing a class definition, the access specifier most recently
|
|
|
|
|
given by the user, or, if no access specifier was given, the
|
|
|
|
|
default value appropriate for the kind of class (i.e., struct,
|
|
|
|
|
class, or union). */
|
|
|
|
|
|
|
|
|
|
#define current_access_specifier scope_chain->access_specifier
|
|
|
|
|
|
|
|
|
|
/* Pointer to the top of the language name stack. */
|
|
|
|
|
|
|
|
|
|
#define current_lang_base scope_chain->lang_base
|
|
|
|
|
#define current_lang_name scope_chain->lang_name
|
|
|
|
|
|
|
|
|
|
/* Parsing a function declarator leaves a list of parameter names
|
|
|
|
|
or a chain or parameter decls here. */
|
|
|
|
|
|
|
|
|
|
#define current_template_parms scope_chain->template_parms
|
|
|
|
|
|
|
|
|
|
#define processing_template_decl scope_chain->x_processing_template_decl
|
|
|
|
|
#define processing_specialization scope_chain->x_processing_specialization
|
|
|
|
|
#define processing_explicit_instantiation scope_chain->x_processing_explicit_instantiation
|
|
|
|
|
|
|
|
|
|
/* _TYPE: the previous type that was a class */
|
|
|
|
|
|
|
|
|
|
#define previous_class_type scope_chain->x_previous_class_type
|
|
|
|
|
|
|
|
|
|
/* This is a copy of the class_shadowed list of the previous class
|
|
|
|
|
binding contour when at global scope. It's used to reset
|
|
|
|
|
IDENTIFIER_CLASS_VALUEs when entering another class scope (i.e. a
|
|
|
|
|
cache miss). */
|
|
|
|
|
|
|
|
|
|
#define previous_class_values scope_chain->x_previous_class_values
|
|
|
|
|
|
|
|
|
|
/* A list of private types mentioned, for deferred access checking. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) struct saved_scope *scope_chain;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Global state pertinent to the current function. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct language_function GTY(())
|
2002-02-01 18:16:02 +00:00
|
|
|
|
{
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct c_language_function base;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
tree x_dtor_label;
|
|
|
|
|
tree x_current_class_ptr;
|
|
|
|
|
tree x_current_class_ref;
|
|
|
|
|
tree x_eh_spec_block;
|
|
|
|
|
tree x_in_charge_parm;
|
|
|
|
|
tree x_vtt_parm;
|
|
|
|
|
tree x_return_value;
|
|
|
|
|
|
|
|
|
|
int returns_value;
|
|
|
|
|
int returns_null;
|
2002-05-09 20:02:13 +00:00
|
|
|
|
int returns_abnormally;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
int in_function_try_handler;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
int in_base_initializer;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* True if this function can throw an exception. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
BOOL_BITFIELD can_throw : 1;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
struct named_label_use_list *x_named_label_uses;
|
|
|
|
|
struct named_label_list *x_named_labels;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct cp_binding_level *bindings;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
varray_type x_local_names;
|
|
|
|
|
|
|
|
|
|
const char *cannot_inline;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The current C++-specific per-function global variables. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define cp_function_chain (cfun->language)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* In a destructor, the point at which all derived class destroying
|
|
|
|
|
has been done, just before any base class destroying will be done. */
|
|
|
|
|
|
|
|
|
|
#define dtor_label cp_function_chain->x_dtor_label
|
|
|
|
|
|
|
|
|
|
/* When we're processing a member function, current_class_ptr is the
|
|
|
|
|
PARM_DECL for the `this' pointer. The current_class_ref is an
|
|
|
|
|
expression for `*this'. */
|
|
|
|
|
|
|
|
|
|
#define current_class_ptr \
|
|
|
|
|
(cfun ? cp_function_chain->x_current_class_ptr : NULL_TREE)
|
|
|
|
|
#define current_class_ref \
|
|
|
|
|
(cfun ? cp_function_chain->x_current_class_ref : NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* The EH_SPEC_BLOCK for the exception-specifiers for the current
|
|
|
|
|
function, if any. */
|
|
|
|
|
|
|
|
|
|
#define current_eh_spec_block cp_function_chain->x_eh_spec_block
|
|
|
|
|
|
|
|
|
|
/* The `__in_chrg' parameter for the current function. Only used for
|
|
|
|
|
constructors and destructors. */
|
|
|
|
|
|
|
|
|
|
#define current_in_charge_parm cp_function_chain->x_in_charge_parm
|
|
|
|
|
|
|
|
|
|
/* The `__vtt_parm' parameter for the current function. Only used for
|
|
|
|
|
constructors and destructors. */
|
|
|
|
|
|
|
|
|
|
#define current_vtt_parm cp_function_chain->x_vtt_parm
|
|
|
|
|
|
|
|
|
|
/* Set to 0 at beginning of a function definition, set to 1 if
|
|
|
|
|
a return statement that specifies a return value is seen. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define current_function_returns_value cp_function_chain->returns_value
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Set to 0 at beginning of a function definition, set to 1 if
|
|
|
|
|
a return statement with no argument is seen. */
|
|
|
|
|
|
|
|
|
|
#define current_function_returns_null cp_function_chain->returns_null
|
|
|
|
|
|
2002-05-09 20:02:13 +00:00
|
|
|
|
/* Set to 0 at beginning of a function definition, set to 1 if
|
|
|
|
|
a call to a noreturn function is seen. */
|
|
|
|
|
|
|
|
|
|
#define current_function_returns_abnormally \
|
|
|
|
|
cp_function_chain->returns_abnormally
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Nonzero if we are processing a base initializer. Zero elsewhere. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define in_base_initializer cp_function_chain->in_base_initializer
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define in_function_try_handler cp_function_chain->in_function_try_handler
|
|
|
|
|
|
|
|
|
|
/* Expression always returned from function, or error_mark_node
|
|
|
|
|
otherwise, for use by the automatic named return value optimization. */
|
|
|
|
|
|
|
|
|
|
#define current_function_return_value \
|
|
|
|
|
(cp_function_chain->x_return_value)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* True if NAME is the IDENTIFIER_NODE for an overloaded "operator
|
|
|
|
|
new" or "operator delete". */
|
|
|
|
|
#define NEW_DELETE_OPNAME_P(NAME) \
|
|
|
|
|
((NAME) == ansi_opname (NEW_EXPR) \
|
|
|
|
|
|| (NAME) == ansi_opname (VEC_NEW_EXPR) \
|
|
|
|
|
|| (NAME) == ansi_opname (DELETE_EXPR) \
|
|
|
|
|
|| (NAME) == ansi_opname (VEC_DELETE_EXPR))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define ansi_opname(CODE) \
|
|
|
|
|
(operator_name_info[(int) (CODE)].identifier)
|
|
|
|
|
#define ansi_assopname(CODE) \
|
|
|
|
|
(assignment_operator_name_info[(int) (CODE)].identifier)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* True if NODE is an erroneous expression. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define error_operand_p(NODE) \
|
|
|
|
|
((NODE) == error_mark_node \
|
|
|
|
|
|| ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* INTERFACE_ONLY nonzero means that we are in an "interface"
|
|
|
|
|
section of the compiler. INTERFACE_UNKNOWN nonzero means
|
|
|
|
|
we cannot trust the value of INTERFACE_ONLY. If INTERFACE_UNKNOWN
|
|
|
|
|
is zero and INTERFACE_ONLY is zero, it means that we are responsible
|
|
|
|
|
for exporting definitions that others might need. */
|
|
|
|
|
extern int interface_only, interface_unknown;
|
|
|
|
|
|
|
|
|
|
/* C++ language-specific tree codes. */
|
|
|
|
|
#define DEFTREECODE(SYM, NAME, TYPE, LENGTH) SYM,
|
|
|
|
|
enum cplus_tree_code {
|
2002-02-01 18:16:02 +00:00
|
|
|
|
CP_DUMMY_TREE_CODE = LAST_C_TREE_CODE,
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#include "cp-tree.def"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
LAST_CPLUS_TREE_CODE
|
|
|
|
|
};
|
|
|
|
|
#undef DEFTREECODE
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define cp_stmt_codes \
|
|
|
|
|
CTOR_INITIALIZER, TRY_BLOCK, HANDLER, \
|
|
|
|
|
EH_SPEC_BLOCK, USING_STMT, TAG_DEFN
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
enum languages { lang_c, lang_cplusplus, lang_java };
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Macros to make error reporting functions' lives easier. */
|
|
|
|
|
#define TYPE_IDENTIFIER(NODE) (DECL_NAME (TYPE_NAME (NODE)))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_LINKAGE_IDENTIFIER(NODE) \
|
|
|
|
|
(TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (NODE)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define TYPE_NAME_STRING(NODE) (IDENTIFIER_POINTER (TYPE_IDENTIFIER (NODE)))
|
|
|
|
|
#define TYPE_NAME_LENGTH(NODE) (IDENTIFIER_LENGTH (TYPE_IDENTIFIER (NODE)))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_ASSEMBLER_NAME_STRING(NODE) \
|
|
|
|
|
(IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (TYPE_NAME (NODE))))
|
|
|
|
|
#define TYPE_ASSEMBLER_NAME_LENGTH(NODE) \
|
|
|
|
|
(IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (TYPE_NAME (NODE))))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE has no name for linkage purposes. */
|
|
|
|
|
#define TYPE_ANONYMOUS_P(NODE) \
|
|
|
|
|
(TAGGED_TYPE_P (NODE) && ANON_AGGRNAME_P (TYPE_LINKAGE_IDENTIFIER (NODE)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* The _DECL for this _TYPE. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define TYPE_MAIN_DECL(NODE) (TYPE_STUB_DECL (TYPE_MAIN_VARIANT (NODE)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero if T is a class (or struct or union) type. Also nonzero
|
2002-02-01 18:16:02 +00:00
|
|
|
|
for template type parameters, typename types, and instantiated
|
|
|
|
|
template template parameters. Despite its name,
|
1999-10-16 06:09:09 +00:00
|
|
|
|
this macro has nothing to do with the definition of aggregate given
|
|
|
|
|
in the standard. Think of this macro as MAYBE_CLASS_TYPE_P. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IS_AGGR_TYPE(T) \
|
|
|
|
|
(TREE_CODE (T) == TEMPLATE_TYPE_PARM \
|
|
|
|
|
|| TREE_CODE (T) == TYPENAME_TYPE \
|
|
|
|
|
|| TREE_CODE (T) == TYPEOF_TYPE \
|
|
|
|
|
|| TREE_CODE (T) == BOUND_TEMPLATE_TEMPLATE_PARM \
|
|
|
|
|
|| TYPE_LANG_FLAG_5 (T))
|
|
|
|
|
|
|
|
|
|
/* Set IS_AGGR_TYPE for T to VAL. T must be a class, struct, or
|
|
|
|
|
union type. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define SET_IS_AGGR_TYPE(T, VAL) \
|
|
|
|
|
(TYPE_LANG_FLAG_5 (T) = (VAL))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if T is a class type. Zero for template type parameters,
|
|
|
|
|
typename types, and so forth. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASS_TYPE_P(T) \
|
|
|
|
|
(IS_AGGR_TYPE_CODE (TREE_CODE (T)) && IS_AGGR_TYPE (T))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define IS_AGGR_TYPE_CODE(T) ((T) == RECORD_TYPE || (T) == UNION_TYPE)
|
|
|
|
|
#define TAGGED_TYPE_P(T) \
|
|
|
|
|
(CLASS_TYPE_P (T) || TREE_CODE (T) == ENUMERAL_TYPE)
|
|
|
|
|
#define IS_OVERLOAD_TYPE(T) TAGGED_TYPE_P (T)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* True if this a "Java" type, defined in 'extern "Java"'. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_FOR_JAVA(NODE) TYPE_LANG_FLAG_3 (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* True if this type is dependent. This predicate is only valid if
|
|
|
|
|
TYPE_DEPENDENT_P_VALID is true. */
|
|
|
|
|
#define TYPE_DEPENDENT_P(NODE) TYPE_LANG_FLAG_0 (NODE)
|
|
|
|
|
|
|
|
|
|
/* True if dependent_type_p has been called for this type, with the
|
|
|
|
|
result that TYPE_DEPENDENT_P is valid. */
|
|
|
|
|
#define TYPE_DEPENDENT_P_VALID(NODE) TYPE_LANG_FLAG_6(NODE)
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero if this type is const-qualified. */
|
|
|
|
|
#define CP_TYPE_CONST_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((cp_type_quals (NODE) & TYPE_QUAL_CONST) != 0)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this type is volatile-qualified. */
|
|
|
|
|
#define CP_TYPE_VOLATILE_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((cp_type_quals (NODE) & TYPE_QUAL_VOLATILE) != 0)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this type is restrict-qualified. */
|
|
|
|
|
#define CP_TYPE_RESTRICT_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((cp_type_quals (NODE) & TYPE_QUAL_RESTRICT) != 0)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this type is const-qualified, but not
|
|
|
|
|
volatile-qualified. Other qualifiers are ignored. This macro is
|
|
|
|
|
used to test whether or not it is OK to bind an rvalue to a
|
|
|
|
|
reference. */
|
|
|
|
|
#define CP_TYPE_CONST_NON_VOLATILE_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((cp_type_quals (NODE) & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)) \
|
1999-10-16 06:09:09 +00:00
|
|
|
|
== TYPE_QUAL_CONST)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define FUNCTION_ARG_CHAIN(NODE) \
|
|
|
|
|
TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (NODE)))
|
|
|
|
|
|
|
|
|
|
/* Given a FUNCTION_DECL, returns the first TREE_LIST out of TYPE_ARG_TYPES
|
|
|
|
|
which refers to a user-written parameter. */
|
|
|
|
|
#define FUNCTION_FIRST_USER_PARMTYPE(NODE) \
|
|
|
|
|
skip_artificial_parms_for ((NODE), TYPE_ARG_TYPES (TREE_TYPE (NODE)))
|
|
|
|
|
|
|
|
|
|
/* Similarly, but for DECL_ARGUMENTS. */
|
|
|
|
|
#define FUNCTION_FIRST_USER_PARM(NODE) \
|
|
|
|
|
skip_artificial_parms_for ((NODE), DECL_ARGUMENTS (NODE))
|
|
|
|
|
|
|
|
|
|
#define PROMOTES_TO_AGGR_TYPE(NODE, CODE) \
|
1996-09-18 05:35:50 +00:00
|
|
|
|
(((CODE) == TREE_CODE (NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
&& IS_AGGR_TYPE (TREE_TYPE (NODE))) \
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|| IS_AGGR_TYPE (NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero iff TYPE is derived from PARENT. Ignores accessibility and
|
|
|
|
|
ambiguity issues. */
|
|
|
|
|
#define DERIVED_FROM_P(PARENT, TYPE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(lookup_base ((TYPE), (PARENT), ba_any, NULL) != NULL_TREE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero iff TYPE is uniquely derived from PARENT. Ignores
|
|
|
|
|
accessibility. */
|
|
|
|
|
#define UNIQUELY_DERIVED_FROM_P(PARENT, TYPE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(lookup_base ((TYPE), (PARENT), ba_ignore | ba_quiet, NULL) != NULL_TREE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero iff TYPE is accessible in the current scope and uniquely
|
|
|
|
|
derived from PARENT. */
|
|
|
|
|
#define ACCESSIBLY_UNIQUELY_DERIVED_P(PARENT, TYPE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(lookup_base ((TYPE), (PARENT), ba_check | ba_quiet, NULL) != NULL_TREE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero iff TYPE is publicly & uniquely derived from PARENT. */
|
|
|
|
|
#define PUBLICLY_UNIQUELY_DERIVED_P(PARENT, TYPE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(lookup_base ((TYPE), (PARENT), ba_not_special | ba_quiet, NULL) \
|
|
|
|
|
!= NULL_TREE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* This is a few header flags for 'struct lang_type'. Actually,
|
|
|
|
|
all but the first are used only for lang_type_class; they
|
|
|
|
|
are put in this structure to save space. */
|
|
|
|
|
struct lang_type_header GTY(())
|
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
BOOL_BITFIELD is_lang_type_class : 1;
|
|
|
|
|
|
|
|
|
|
BOOL_BITFIELD has_type_conversion : 1;
|
|
|
|
|
BOOL_BITFIELD has_init_ref : 1;
|
|
|
|
|
BOOL_BITFIELD has_default_ctor : 1;
|
|
|
|
|
BOOL_BITFIELD uses_multiple_inheritance : 1;
|
|
|
|
|
BOOL_BITFIELD const_needs_init : 1;
|
|
|
|
|
BOOL_BITFIELD ref_needs_init : 1;
|
|
|
|
|
BOOL_BITFIELD has_const_assign_ref : 1;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
};
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* This structure provides additional information above and beyond
|
|
|
|
|
what is provide in the ordinary tree_type. In the past, we used it
|
|
|
|
|
for the types of class types, template parameters types, typename
|
|
|
|
|
types, and so forth. However, there can be many (tens to hundreds
|
|
|
|
|
of thousands) of template parameter types in a compilation, and
|
|
|
|
|
there's no need for this additional information in that case.
|
|
|
|
|
Therefore, we now use this data structure only for class types.
|
|
|
|
|
|
|
|
|
|
In the past, it was thought that there would be relatively few
|
|
|
|
|
class types. However, in the presence of heavy use of templates,
|
|
|
|
|
many (i.e., thousands) of classes can easily be generated.
|
|
|
|
|
Therefore, we should endeavor to keep the size of this structure to
|
|
|
|
|
a minimum. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_type_class GTY(())
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_type_header h;
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
unsigned char align;
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned has_mutable : 1;
|
|
|
|
|
unsigned com_interface : 1;
|
|
|
|
|
unsigned non_pod_class : 1;
|
|
|
|
|
unsigned nearly_empty_p : 1;
|
|
|
|
|
unsigned user_align : 1;
|
|
|
|
|
unsigned has_assign_ref : 1;
|
|
|
|
|
unsigned has_new : 1;
|
|
|
|
|
unsigned has_array_new : 1;
|
|
|
|
|
|
|
|
|
|
unsigned gets_delete : 2;
|
|
|
|
|
unsigned interface_only : 1;
|
|
|
|
|
unsigned interface_unknown : 1;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
unsigned contains_empty_class_p : 1;
|
|
|
|
|
unsigned anon_aggr : 1;
|
|
|
|
|
unsigned non_zero_init : 1;
|
|
|
|
|
unsigned empty_p : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
unsigned marks: 6;
|
|
|
|
|
unsigned vec_new_uses_cookie : 1;
|
|
|
|
|
unsigned declared_class : 1;
|
|
|
|
|
|
|
|
|
|
unsigned being_defined : 1;
|
|
|
|
|
unsigned redefined : 1;
|
|
|
|
|
unsigned debug_requested : 1;
|
|
|
|
|
unsigned use_template : 2;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
unsigned fields_readonly : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned ptrmemfunc_flag : 1;
|
|
|
|
|
unsigned was_anonymous : 1;
|
|
|
|
|
|
|
|
|
|
unsigned has_real_assign_ref : 1;
|
|
|
|
|
unsigned has_const_init_ref : 1;
|
|
|
|
|
unsigned has_complex_init_ref : 1;
|
|
|
|
|
unsigned has_complex_assign_ref : 1;
|
|
|
|
|
unsigned has_abstract_assign_ref : 1;
|
|
|
|
|
unsigned non_aggregate : 1;
|
|
|
|
|
unsigned java_interface : 1;
|
|
|
|
|
|
|
|
|
|
/* When adding a flag here, consider whether or not it ought to
|
|
|
|
|
apply to a template instance if it applies to the template. If
|
|
|
|
|
so, make sure to copy it in instantiate_class_template! */
|
|
|
|
|
|
|
|
|
|
/* There are some bits left to fill out a 32-bit word. Keep track
|
|
|
|
|
of this by updating the size of this bitfield whenever you add or
|
|
|
|
|
remove a flag. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
unsigned dummy : 9;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree primary_base;
|
|
|
|
|
tree vfields;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree vcall_indices;
|
|
|
|
|
tree vtables;
|
2003-02-10 05:41:50 +00:00
|
|
|
|
tree typeinfo_var;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree vbases;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
binding_table nested_udts;
|
|
|
|
|
tree as_base;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree pure_virtuals;
|
|
|
|
|
tree friend_classes;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree GTY ((reorder ("resort_type_method_vec"))) methods;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree key_method;
|
|
|
|
|
tree decl_list;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree template_info;
|
1999-10-16 06:09:09 +00:00
|
|
|
|
tree befriending_classes;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
};
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_type_ptrmem GTY(())
|
|
|
|
|
{
|
|
|
|
|
struct lang_type_header h;
|
|
|
|
|
tree record;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct lang_type GTY(())
|
|
|
|
|
{
|
|
|
|
|
union lang_type_u
|
|
|
|
|
{
|
|
|
|
|
struct lang_type_header GTY((tag ("2"))) h;
|
|
|
|
|
struct lang_type_class GTY((tag ("1"))) c;
|
|
|
|
|
struct lang_type_ptrmem GTY((tag ("0"))) ptrmem;
|
|
|
|
|
} GTY((desc ("%h.h.is_lang_type_class"))) u;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define LANG_TYPE_CLASS_CHECK(NODE) __extension__ \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
({ struct lang_type *lt = TYPE_LANG_SPECIFIC (NODE); \
|
|
|
|
|
if (! lt->u.h.is_lang_type_class) \
|
|
|
|
|
lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
|
|
|
|
|
<->u.c; })
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define LANG_TYPE_PTRMEM_CHECK(NODE) __extension__ \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
({ struct lang_type *lt = TYPE_LANG_SPECIFIC (NODE); \
|
|
|
|
|
if (lt->u.h.is_lang_type_class) \
|
|
|
|
|
lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
|
|
|
|
|
<->u.ptrmem; })
|
|
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
|
|
#define LANG_TYPE_CLASS_CHECK(NODE) (&TYPE_LANG_SPECIFIC (NODE)->u.c)
|
|
|
|
|
#define LANG_TYPE_PTRMEM_CHECK(NODE) (&TYPE_LANG_SPECIFIC (NODE)->u.ptrmem)
|
|
|
|
|
|
|
|
|
|
#endif /* ENABLE_TREE_CHECKING */
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Indicates whether or not (and how) a template was expanded for this class.
|
|
|
|
|
0=no information yet/non-template class
|
|
|
|
|
1=implicit template instantiation
|
|
|
|
|
2=explicit template specialization
|
|
|
|
|
3=explicit template instantiation */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_USE_TEMPLATE(NODE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->use_template)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Fields used for storing information before the class is defined.
|
|
|
|
|
After the class is defined, these fields hold other information. */
|
|
|
|
|
|
|
|
|
|
/* List of friends which were defined inline in this class definition. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_INLINE_FRIENDS(NODE) CLASSTYPE_PURE_VIRTUALS (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero for _CLASSTYPE means that operator delete is defined. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_GETS_DELETE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->gets_delete)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define TYPE_GETS_REG_DELETE(NODE) (TYPE_GETS_DELETE (NODE) & 1)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if `new NODE[x]' should cause the allocation of extra
|
|
|
|
|
storage to indicate how many array elements are in use. */
|
|
|
|
|
#define TYPE_VEC_NEW_USES_COOKIE(NODE) \
|
|
|
|
|
(CLASS_TYPE_P (NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
&& LANG_TYPE_CLASS_CHECK (NODE)->vec_new_uses_cookie)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this _CLASSTYPE node defines ways of converting
|
|
|
|
|
itself to other types. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_CONVERSION(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.has_type_conversion)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this _CLASSTYPE node overloads operator=(X&). */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_HAS_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_assign_ref)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_CONST_ASSIGN_REF(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.has_const_assign_ref)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this _CLASSTYPE node has an X(X&) constructor. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_HAS_INIT_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->h.has_init_ref)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_CONST_INIT_REF(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->has_const_init_ref)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this class defines an overloaded operator new. (An
|
|
|
|
|
operator new [] doesn't count.) */
|
|
|
|
|
#define TYPE_HAS_NEW_OPERATOR(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->has_new)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this class defines an overloaded operator new[]. */
|
|
|
|
|
#define TYPE_HAS_ARRAY_NEW_OPERATOR(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->has_array_new)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this type is being defined. I.e., the left brace
|
|
|
|
|
starting the definition of this type has been seen. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_BEING_DEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->being_defined)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero means that this type has been redefined. In this case, if
|
|
|
|
|
convenient, don't reprocess any methods that appear in its redefinition. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_REDEFINED(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->redefined)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this _CLASSTYPE (or one of its ancestors) uses
|
|
|
|
|
multiple inheritance. If this is 0 for the root of a type
|
|
|
|
|
hierarchy, then we can use more efficient search techniques. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_USES_MULTIPLE_INHERITANCE(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.uses_multiple_inheritance)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this _CLASSTYPE (or one of its ancestors) uses
|
|
|
|
|
virtual base classes. If this is 0 for the root of a type
|
|
|
|
|
hierarchy, then we can use more efficient search techniques. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_USES_VIRTUAL_BASECLASSES(NODE) (TREE_LANG_FLAG_3 (NODE))
|
2000-05-27 02:25:28 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The member function with which the vtable will be emitted:
|
|
|
|
|
the first noninline non-pure-virtual member function. NULL_TREE
|
|
|
|
|
if there is no key function or if this is a class template */
|
|
|
|
|
#define CLASSTYPE_KEY_METHOD(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->key_method)
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Vector member functions defined in this class. Each element is
|
|
|
|
|
either a FUNCTION_DECL, a TEMPLATE_DECL, or an OVERLOAD. All
|
|
|
|
|
functions with the same name end up in the same slot. The first
|
|
|
|
|
two elements are for constructors, and destructors, respectively.
|
2003-07-11 03:40:53 +00:00
|
|
|
|
All template conversion operators to innermost template dependent
|
|
|
|
|
types are overloaded on the next slot, if they exist. Note, the
|
|
|
|
|
names for these functions will not all be the same. The
|
|
|
|
|
non-template conversion operators & templated conversions to
|
|
|
|
|
non-innermost template types are next, followed by ordinary member
|
|
|
|
|
functions. There may be empty entries at the end of the vector.
|
|
|
|
|
The conversion operators are unsorted. The ordinary member
|
|
|
|
|
functions are sorted, once the class is complete. */
|
|
|
|
|
#define CLASSTYPE_METHOD_VEC(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->methods)
|
|
|
|
|
|
|
|
|
|
/* For class templates, this is a TREE_LIST of all member data,
|
|
|
|
|
functions, types, and friends in the order of declaration.
|
|
|
|
|
The TREE_PURPOSE of each TREE_LIST is NULL_TREE for a friend,
|
|
|
|
|
and the RECORD_TYPE for the class template otherwise. */
|
|
|
|
|
#define CLASSTYPE_DECL_LIST(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->decl_list)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* The slot in the CLASSTYPE_METHOD_VEC where constructors go. */
|
|
|
|
|
#define CLASSTYPE_CONSTRUCTOR_SLOT 0
|
|
|
|
|
|
|
|
|
|
/* The slot in the CLASSTYPE_METHOD_VEC where destructors go. */
|
|
|
|
|
#define CLASSTYPE_DESTRUCTOR_SLOT 1
|
|
|
|
|
|
|
|
|
|
/* The first slot in the CLASSTYPE_METHOD_VEC where conversion
|
|
|
|
|
operators can appear. */
|
|
|
|
|
#define CLASSTYPE_FIRST_CONVERSION_SLOT 2
|
|
|
|
|
|
|
|
|
|
/* A FUNCTION_DECL or OVERLOAD for the constructors for NODE. These
|
|
|
|
|
are the constructors that take an in-charge parameter. */
|
|
|
|
|
#define CLASSTYPE_CONSTRUCTORS(NODE) \
|
|
|
|
|
(TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_CONSTRUCTOR_SLOT))
|
|
|
|
|
|
|
|
|
|
/* A FUNCTION_DECL for the destructor for NODE. These are the
|
|
|
|
|
destructors that take an in-charge parameter. */
|
|
|
|
|
#define CLASSTYPE_DESTRUCTORS(NODE) \
|
|
|
|
|
(TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (NODE), CLASSTYPE_DESTRUCTOR_SLOT))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Mark bits for depth-first and breath-first searches. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Get the value of the Nth mark bit. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_MARKED_N(NODE, N) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(((CLASS_TYPE_P (NODE) ? LANG_TYPE_CLASS_CHECK (NODE)->marks \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: ((unsigned) TYPE_ALIAS_SET (NODE))) & (1 << (N))) != 0)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Set the Nth mark bit. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_CLASSTYPE_MARKED_N(NODE, N) \
|
|
|
|
|
(CLASS_TYPE_P (NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? (void) (LANG_TYPE_CLASS_CHECK (NODE)->marks |= (1 << (N))) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: (void) (TYPE_ALIAS_SET (NODE) |= (1 << (N))))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Clear the Nth mark bit. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED_N(NODE, N) \
|
|
|
|
|
(CLASS_TYPE_P (NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? (void) (LANG_TYPE_CLASS_CHECK (NODE)->marks &= ~(1 << (N))) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: (void) (TYPE_ALIAS_SET (NODE) &= ~(1 << (N))))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Get the value of the mark bits. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_MARKED(NODE) CLASSTYPE_MARKED_N (NODE, 0)
|
|
|
|
|
#define CLASSTYPE_MARKED2(NODE) CLASSTYPE_MARKED_N (NODE, 1)
|
|
|
|
|
#define CLASSTYPE_MARKED3(NODE) CLASSTYPE_MARKED_N (NODE, 2)
|
|
|
|
|
#define CLASSTYPE_MARKED4(NODE) CLASSTYPE_MARKED_N (NODE, 3)
|
|
|
|
|
#define CLASSTYPE_MARKED5(NODE) CLASSTYPE_MARKED_N (NODE, 4)
|
|
|
|
|
#define CLASSTYPE_MARKED6(NODE) CLASSTYPE_MARKED_N (NODE, 5)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Macros to modify the above flags */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_CLASSTYPE_MARKED(NODE) SET_CLASSTYPE_MARKED_N (NODE, 0)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 0)
|
|
|
|
|
#define SET_CLASSTYPE_MARKED2(NODE) SET_CLASSTYPE_MARKED_N (NODE, 1)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED2(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 1)
|
|
|
|
|
#define SET_CLASSTYPE_MARKED3(NODE) SET_CLASSTYPE_MARKED_N (NODE, 2)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED3(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 2)
|
|
|
|
|
#define SET_CLASSTYPE_MARKED4(NODE) SET_CLASSTYPE_MARKED_N (NODE, 3)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED4(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 3)
|
|
|
|
|
#define SET_CLASSTYPE_MARKED5(NODE) SET_CLASSTYPE_MARKED_N (NODE, 4)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED5(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 4)
|
|
|
|
|
#define SET_CLASSTYPE_MARKED6(NODE) SET_CLASSTYPE_MARKED_N (NODE, 5)
|
|
|
|
|
#define CLEAR_CLASSTYPE_MARKED6(NODE) CLEAR_CLASSTYPE_MARKED_N (NODE, 5)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* A dictionary of the nested user-defined-types (class-types, or enums)
|
|
|
|
|
found within this class. This table includes nested member class
|
|
|
|
|
templates. */
|
|
|
|
|
#define CLASSTYPE_NESTED_UTDS(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->nested_udts)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE has a primary base class, i.e., a base class with
|
|
|
|
|
which it shares the virtual function table pointer. */
|
|
|
|
|
#define CLASSTYPE_HAS_PRIMARY_BASE_P(NODE) \
|
|
|
|
|
(CLASSTYPE_PRIMARY_BINFO (NODE) != NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* If non-NULL, this is the binfo for the primary base class, i.e.,
|
|
|
|
|
the base class which contains the virtual function table pointer
|
|
|
|
|
for this class. */
|
|
|
|
|
#define CLASSTYPE_PRIMARY_BINFO(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->primary_base)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* A chain of BINFOs for the direct and indirect virtual base classes
|
|
|
|
|
that this type uses in a post-order depth-first left-to-right
|
|
|
|
|
order. (In other words, these bases appear in the order that they
|
2004-07-28 03:11:36 +00:00
|
|
|
|
should be initialized.) */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_VBASECLASSES(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vbases)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Number of direct baseclasses of NODE. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define CLASSTYPE_N_BASECLASSES(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(BINFO_N_BASETYPES (TYPE_BINFO (NODE)))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The type corresponding to NODE when NODE is used as a base class,
|
|
|
|
|
i.e., NODE without virtual base classes. */
|
|
|
|
|
|
|
|
|
|
#define CLASSTYPE_AS_BASE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->as_base)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* These are the size and alignment of the type without its virtual
|
|
|
|
|
base classes, for when we use this type as a base itself. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_SIZE(NODE) TYPE_SIZE (CLASSTYPE_AS_BASE (NODE))
|
|
|
|
|
#define CLASSTYPE_SIZE_UNIT(NODE) TYPE_SIZE_UNIT (CLASSTYPE_AS_BASE (NODE))
|
|
|
|
|
#define CLASSTYPE_ALIGN(NODE) TYPE_ALIGN (CLASSTYPE_AS_BASE (NODE))
|
|
|
|
|
#define CLASSTYPE_USER_ALIGN(NODE) TYPE_USER_ALIGN (CLASSTYPE_AS_BASE (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The alignment of NODE, without its virtual bases, in bytes. */
|
|
|
|
|
#define CLASSTYPE_ALIGN_UNIT(NODE) \
|
|
|
|
|
(CLASSTYPE_ALIGN (NODE) / BITS_PER_UNIT)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* True if this a Java interface type, declared with
|
2003-07-11 03:40:53 +00:00
|
|
|
|
'__attribute__ ((java_interface))'. */
|
|
|
|
|
#define TYPE_JAVA_INTERFACE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->java_interface)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* A cons list of virtual functions which cannot be inherited by
|
|
|
|
|
derived classes. When deriving from this type, the derived
|
|
|
|
|
class must provide its own definition for each of these functions. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_PURE_VIRTUALS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->pure_virtuals)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this type has an X() constructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_DEFAULT_CONSTRUCTOR(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.has_default_ctor)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Nonzero means that this type contains a mutable member. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_HAS_MUTABLE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_mutable)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define TYPE_HAS_MUTABLE_P(NODE) (cp_has_mutable_p (NODE))
|
|
|
|
|
|
2002-09-01 20:38:57 +00:00
|
|
|
|
/* Nonzero means that this class type is a non-POD class. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_NON_POD_P(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->non_pod_class)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2002-09-01 20:38:57 +00:00
|
|
|
|
/* Nonzero means that this class contains pod types whose default
|
|
|
|
|
initialization is not a zero initialization (namely, pointers to
|
|
|
|
|
data members). */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CLASSTYPE_NON_ZERO_INIT_P(NODE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->non_zero_init)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if this class is "empty" in the sense of the C++ ABI. */
|
|
|
|
|
#define CLASSTYPE_EMPTY_P(NODE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->empty_p)
|
2002-09-01 20:38:57 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this class is "nearly empty", i.e., contains only a
|
|
|
|
|
virtual function table pointer. */
|
|
|
|
|
#define CLASSTYPE_NEARLY_EMPTY_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->nearly_empty_p)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-12-04 15:42:16 +00:00
|
|
|
|
/* Nonzero if this class contains an empty subobject. */
|
|
|
|
|
#define CLASSTYPE_CONTAINS_EMPTY_CLASS_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->contains_empty_class_p)
|
2002-12-04 15:42:16 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* A list of class types of which this type is a friend. The
|
1999-08-26 09:30:50 +00:00
|
|
|
|
TREE_VALUE is normally a TYPE, but will be a TEMPLATE_DECL in the
|
|
|
|
|
case of a template friend. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_FRIEND_CLASSES(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->friend_classes)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* A list of the classes which grant friendship to this class. */
|
|
|
|
|
#define CLASSTYPE_BEFRIENDING_CLASSES(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->befriending_classes)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Say whether this node was declared as a "class" or a "struct". */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_DECLARED_CLASS(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->declared_class)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-12-04 15:42:16 +00:00
|
|
|
|
/* Nonzero if this class has const members
|
|
|
|
|
which have no specified initialization. */
|
|
|
|
|
#define CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE) \
|
|
|
|
|
(TYPE_LANG_SPECIFIC (NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? LANG_TYPE_CLASS_CHECK (NODE)->h.const_needs_init : 0)
|
2002-12-04 15:42:16 +00:00
|
|
|
|
#define SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT(NODE, VALUE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.const_needs_init = (VALUE))
|
2002-12-04 15:42:16 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this class has ref members
|
|
|
|
|
which have no specified initialization. */
|
|
|
|
|
#define CLASSTYPE_REF_FIELDS_NEED_INIT(NODE) \
|
|
|
|
|
(TYPE_LANG_SPECIFIC (NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? LANG_TYPE_CLASS_CHECK (NODE)->h.ref_needs_init : 0)
|
2002-12-04 15:42:16 +00:00
|
|
|
|
#define SET_CLASSTYPE_REF_FIELDS_NEED_INIT(NODE, VALUE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->h.ref_needs_init = (VALUE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this class is included from a header file which employs
|
|
|
|
|
`#pragma interface', and it is not included in its implementation file. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_INTERFACE_ONLY(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_only)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* True if we have already determined whether or not vtables, VTTs,
|
|
|
|
|
typeinfo, and other similar per-class data should be emitted in
|
|
|
|
|
this translation unit. This flag does not indicate whether or not
|
|
|
|
|
these items should be emitted; it only indicates that we know one
|
|
|
|
|
way or the other. */
|
|
|
|
|
#define CLASSTYPE_INTERFACE_KNOWN(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown == 0)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The opposite of CLASSTYPE_INTERFANCE_KNOWN. */
|
|
|
|
|
#define CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define SET_CLASSTYPE_INTERFACE_UNKNOWN_X(NODE,X) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = !!(X))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_CLASSTYPE_INTERFACE_UNKNOWN(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 1)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_CLASSTYPE_INTERFACE_KNOWN(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->interface_unknown = 0)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if a _DECL node requires us to output debug info for this class. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_DEBUG_REQUESTED(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->debug_requested)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Additional macros for inheritance information. */
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* The BINFO_INHERITANCE_CHAIN is used opposite to the description in
|
2004-07-28 03:11:36 +00:00
|
|
|
|
gcc/tree.h. In particular if D is non-virtually derived from B
|
|
|
|
|
then the BINFO for B (in D) will have a BINFO_INHERITANCE_CHAIN
|
|
|
|
|
pointing to D. If D is virtually derived, its
|
|
|
|
|
BINFO_INHERITANCE_CHAIN will point to the most derived binfo. In
|
|
|
|
|
tree.h, this pointer is described as pointing in other
|
|
|
|
|
direction. The binfos of virtual bases are shared. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero means marked by DFS or BFS search. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that this class is on a path leading to a new vtable. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BINFO_VTABLE_PATH_MARKED(NODE) TREE_LANG_FLAG_3 (NODE)
|
|
|
|
|
|
|
|
|
|
/* Nonzero means B (a BINFO) has its own vtable. Any copies will not
|
|
|
|
|
have this flag set. */
|
|
|
|
|
#define BINFO_NEW_VTABLE_MARKED(B) (TREE_LANG_FLAG_4 (B))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Any subobject that needs a new vtable must have a vptr and must not
|
|
|
|
|
be a non-virtual primary base (since it would then use the vtable from a
|
|
|
|
|
derived class and never become non-primary.) */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define SET_BINFO_NEW_VTABLE_MARKED(B) \
|
|
|
|
|
(BINFO_NEW_VTABLE_MARKED (B) = 1, \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
my_friendly_assert (!BINFO_PRIMARY_P (B) \
|
|
|
|
|
|| TREE_VIA_VIRTUAL (B), 20000517), \
|
|
|
|
|
my_friendly_assert (CLASSTYPE_VFIELDS (BINFO_TYPE (B)) != NULL_TREE, \
|
|
|
|
|
20000517))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero means this class has done dfs_pushdecls. */
|
|
|
|
|
#define BINFO_PUSHDECLS_MARKED(NODE) BINFO_VTABLE_PATH_MARKED (NODE)
|
|
|
|
|
|
2002-05-09 20:02:13 +00:00
|
|
|
|
/* Nonzero if this BINFO is a primary base class. Note, this can be
|
2004-07-28 03:11:36 +00:00
|
|
|
|
set for non-canonical virtual bases. For a virtual primary base
|
2002-05-09 20:02:13 +00:00
|
|
|
|
you might also need to check whether it is canonical. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define BINFO_PRIMARY_P(NODE) \
|
|
|
|
|
(BINFO_PRIMARY_BASE_OF (NODE) != NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* The index in the VTT where this subobject's sub-VTT can be found.
|
|
|
|
|
NULL_TREE if there is no sub-VTT. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BINFO_SUBVTT_INDEX(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 0)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* The index in the VTT where the vptr for this subobject can be
|
|
|
|
|
found. NULL_TREE if there is no secondary vptr in the VTT. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BINFO_VPTR_INDEX(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 1)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* The binfo of which NODE is a primary base. (This is different from
|
|
|
|
|
BINFO_INHERITANCE_CHAIN for virtual base because a virtual base is
|
|
|
|
|
sometimes a primary base for a class for which it is not an
|
|
|
|
|
immediate base.) */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define BINFO_PRIMARY_BASE_OF(NODE) TREE_VEC_ELT (NODE, BINFO_ELTS + 2)
|
|
|
|
|
|
|
|
|
|
/* C++ binfos have 3 additional entries. */
|
|
|
|
|
|
|
|
|
|
#define BINFO_LANG_ELTS (BINFO_ELTS + 3)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if this binfo is for a dependent base - one that should not
|
|
|
|
|
be searched. */
|
|
|
|
|
#define BINFO_DEPENDENT_BASE_P(NODE) TREE_LANG_FLAG_1(NODE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this binfo has lost its primary base binfo (because that
|
|
|
|
|
is a nearly-empty virtual base that has been taken by some other
|
|
|
|
|
base in the complete hierarchy. */
|
|
|
|
|
#define BINFO_LOST_PRIMARY_P(NODE) TREE_LANG_FLAG_2 (NODE)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if this binfo is an indirect primary base, i.e. a virtual
|
|
|
|
|
base that is a primary base of some of other class in the
|
|
|
|
|
hierarchy. */
|
|
|
|
|
#define BINFO_INDIRECT_PRIMARY_P(NODE) TREE_USED (NODE)
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Used by various search routines. */
|
|
|
|
|
#define IDENTIFIER_MARKED(NODE) TREE_LANG_FLAG_0 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* A TREE_LIST of the vcall indices associated with the class NODE.
|
|
|
|
|
The TREE_PURPOSE of each node is a FUNCTION_DECL for a virtual
|
|
|
|
|
function. The TREE_VALUE is the index into the virtual table where
|
|
|
|
|
the vcall offset for that function is stored, when NODE is a
|
|
|
|
|
virtual base. */
|
|
|
|
|
#define CLASSTYPE_VCALL_INDICES(NODE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->vcall_indices)
|
|
|
|
|
|
|
|
|
|
/* The various vtables for the class NODE. The primary vtable will be
|
|
|
|
|
first, followed by the construction vtables and VTT, if any. */
|
|
|
|
|
#define CLASSTYPE_VTABLES(NODE) \
|
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->vtables)
|
|
|
|
|
|
2003-02-10 05:41:50 +00:00
|
|
|
|
/* The std::type_info variable representing this class, or NULL if no
|
|
|
|
|
such variable has been created. This field is only set for the
|
|
|
|
|
TYPE_MAIN_VARIANT of the class. */
|
|
|
|
|
#define CLASSTYPE_TYPEINFO_VAR(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->typeinfo_var)
|
2003-02-10 05:41:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Accessor macros for the vfield slots in structures. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* List of virtual table fields that this type contains (both the primary
|
|
|
|
|
and secondaries). The TREE_VALUE is the class type where the vtable
|
|
|
|
|
field was introduced. For a vtable field inherited from the primary
|
|
|
|
|
base, or introduced by this class, the TREE_PURPOSE is NULL. For
|
|
|
|
|
other vtable fields (those from non-primary bases), the
|
|
|
|
|
TREE_PURPOSE is the BINFO of the base through which the vtable was
|
|
|
|
|
inherited. */
|
|
|
|
|
#define CLASSTYPE_VFIELDS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->vfields)
|
|
|
|
|
|
|
|
|
|
/* Get the BINFO that introduced this vtable into the hierarchy (will
|
|
|
|
|
be NULL for those created at this level, or from a primary
|
|
|
|
|
hierarchy). */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define VF_BINFO_VALUE(NODE) TREE_PURPOSE (NODE)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Get the TYPE that introduced this vtable into the hierarchy (always
|
|
|
|
|
non-NULL). */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define VF_BASETYPE_VALUE(NODE) TREE_VALUE (NODE)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Accessor macros for the BINFO_VIRTUALS list. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* The number of bytes by which to adjust the `this' pointer when
|
2003-07-11 03:40:53 +00:00
|
|
|
|
calling this virtual function. Subtract this value from the this
|
|
|
|
|
pointer. Always non-NULL, might be constant zero though. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define BV_DELTA(NODE) (TREE_PURPOSE (NODE))
|
|
|
|
|
|
|
|
|
|
/* If non-NULL, the vtable index at which to find the vcall offset
|
2003-07-11 03:40:53 +00:00
|
|
|
|
when calling this virtual function. Add the value at that vtable
|
|
|
|
|
index to the this pointer. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define BV_VCALL_INDEX(NODE) (TREE_TYPE (NODE))
|
|
|
|
|
|
|
|
|
|
/* The function to call. */
|
|
|
|
|
#define BV_FN(NODE) (TREE_VALUE (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Nonzero for TREE_LIST node means that this list of things
|
|
|
|
|
is a list of parameters, as opposed to a list of expressions. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TREE_PARMLIST(NODE) (TREE_LANG_FLAG_2 (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero for a parmlist means that this parmlist ended in ... */
|
|
|
|
|
#define PARMLIST_ELLIPSIS_P(NODE) TREE_LANG_FLAG_0 (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* For FUNCTION_TYPE or METHOD_TYPE, a list of the exceptions that
|
1999-10-16 06:09:09 +00:00
|
|
|
|
this type can raise. Each TREE_VALUE is a _TYPE. The TREE_VALUE
|
2002-02-01 18:16:02 +00:00
|
|
|
|
will be NULL_TREE to indicate a throw specification of `()', or
|
|
|
|
|
no exceptions allowed. */
|
|
|
|
|
#define TYPE_RAISES_EXCEPTIONS(NODE) TYPE_BINFO (NODE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* For FUNCTION_TYPE or METHOD_TYPE, return 1 iff it is declared `throw()'. */
|
|
|
|
|
#define TYPE_NOTHROW_P(NODE) \
|
|
|
|
|
(TYPE_RAISES_EXCEPTIONS (NODE) \
|
|
|
|
|
&& TREE_VALUE (TYPE_RAISES_EXCEPTIONS (NODE)) == NULL_TREE)
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* The binding level associated with the namespace. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define NAMESPACE_LEVEL(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.u.level)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* If a DECL has DECL_LANG_SPECIFIC, it is either a lang_decl_flags or
|
2002-02-01 18:16:02 +00:00
|
|
|
|
a lang_decl (which has lang_decl_flags as its initial prefix).
|
|
|
|
|
This macro is nonzero for tree nodes whose DECL_LANG_SPECIFIC is
|
|
|
|
|
the full lang_decl, and not just lang_decl_flags. */
|
|
|
|
|
#define CAN_HAVE_FULL_LANG_DECL_P(NODE) \
|
|
|
|
|
(!(TREE_CODE (NODE) == VAR_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == CONST_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == FIELD_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == USING_DECL))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_decl_flags GTY(())
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
ENUM_BITFIELD(languages) language : 8;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
unsigned operator_attr : 1;
|
|
|
|
|
unsigned constructor_attr : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned destructor_attr : 1;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
unsigned friend_attr : 1;
|
|
|
|
|
unsigned static_function : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned pure_virtual : 1;
|
|
|
|
|
unsigned has_in_charge_parm_p : 1;
|
|
|
|
|
unsigned has_vtt_parm_p : 1;
|
|
|
|
|
|
|
|
|
|
unsigned deferred : 1;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
unsigned use_template : 2;
|
|
|
|
|
unsigned nonconverting : 1;
|
|
|
|
|
unsigned not_really_extern : 1;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
unsigned needs_final_overrider : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned initialized_in_class : 1;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
unsigned assignment_operator_p : 1;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
unsigned global_ctor_p : 1;
|
|
|
|
|
unsigned global_dtor_p : 1;
|
|
|
|
|
unsigned anticipated_p : 1;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
unsigned template_conv_p : 1;
|
|
|
|
|
unsigned u1sel : 1;
|
|
|
|
|
unsigned u2sel : 1;
|
|
|
|
|
unsigned can_be_full : 1;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
unsigned this_thunk_p : 1;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
union lang_decl_u {
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* In a FUNCTION_DECL for which DECL_THUNK_P does not hold,
|
|
|
|
|
VAR_DECL, TYPE_DECL, or TEMPLATE_DECL, this is
|
|
|
|
|
DECL_TEMPLATE_INFO. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree GTY ((tag ("0"))) template_info;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* In a NAMESPACE_DECL, this is NAMESPACE_LEVEL. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct cp_binding_level * GTY ((tag ("1"))) level;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
|
|
|
|
/* In a FUNCTION_DECL for which DECL_THUNK_P holds, this is
|
|
|
|
|
THUNK_ALIAS. */
|
|
|
|
|
tree GTY ((tag ("2"))) thunk_alias;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
} GTY ((desc ("%1.u1sel"))) u;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
union lang_decl_u2 {
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* This is DECL_ACCESS. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree GTY ((tag ("0"))) access;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* For VAR_DECL in function, this is DECL_DISCRIMINATOR. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
int GTY ((tag ("1"))) discriminator;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* In a FUNCTION_DECL for which DECL_THUNK_P holds, this is
|
2004-07-28 03:11:36 +00:00
|
|
|
|
THUNK_VIRTUAL_OFFSET. */
|
|
|
|
|
tree GTY((tag ("2"))) virtual_offset;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
} GTY ((desc ("%1.u2sel"))) u2;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
};
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* sorted_fields is sorted based on a pointer, so we need to be able
|
|
|
|
|
to resort it if pointers get rearranged. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct lang_decl GTY(())
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
struct lang_decl_flags decl_flags;
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
union lang_decl_u4
|
|
|
|
|
{
|
|
|
|
|
struct full_lang_decl
|
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* For a non-thunk function decl, this is a tree list of
|
|
|
|
|
friendly classes. For a thunk function decl, it is the
|
|
|
|
|
thunked to function decl. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree befriending_classes;
|
|
|
|
|
|
|
|
|
|
/* For a non-virtual FUNCTION_DECL, this is
|
|
|
|
|
DECL_FRIEND_CONTEXT. For a virtual FUNCTION_DECL for which
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_THIS_THUNK_P does not hold, this is DECL_THUNKS. Both
|
|
|
|
|
this pointer and result pointer adjusting thunks are
|
|
|
|
|
chained here. This pointer thunks to return pointer thunks
|
|
|
|
|
will be chained on the return pointer thunk. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
tree context;
|
|
|
|
|
|
|
|
|
|
/* In a FUNCTION_DECL, this is DECL_CLONED_FUNCTION. */
|
|
|
|
|
tree cloned_function;
|
|
|
|
|
|
|
|
|
|
/* In a FUNCTION_DECL for which THUNK_P holds, this is
|
2004-07-28 03:11:36 +00:00
|
|
|
|
THUNK_FIXED_OFFSET. */
|
|
|
|
|
HOST_WIDE_INT fixed_offset;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|
|
|
|
|
/* In an overloaded operator, this is the value of
|
|
|
|
|
DECL_OVERLOADED_OPERATOR_P. */
|
|
|
|
|
enum tree_code operator_code;
|
|
|
|
|
|
|
|
|
|
unsigned u3sel : 1;
|
|
|
|
|
unsigned pending_inline_p : 1;
|
|
|
|
|
|
|
|
|
|
union lang_decl_u3
|
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
struct sorted_fields_type * GTY ((tag ("0"), reorder ("resort_sorted_fields")))
|
|
|
|
|
sorted_fields;
|
|
|
|
|
struct cp_token_cache * GTY ((tag ("2"))) pending_inline_info;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
struct language_function * GTY ((tag ("1")))
|
|
|
|
|
saved_language_function;
|
|
|
|
|
} GTY ((desc ("%1.u3sel + %1.pending_inline_p"))) u;
|
|
|
|
|
} GTY ((tag ("1"))) f;
|
|
|
|
|
} GTY ((desc ("%1.decl_flags.can_be_full"))) u;
|
|
|
|
|
};
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define LANG_DECL_U2_CHECK(NODE, TF) __extension__ \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
({ struct lang_decl *lt = DECL_LANG_SPECIFIC (NODE); \
|
|
|
|
|
if (lt->decl_flags.u2sel != TF) \
|
|
|
|
|
lang_check_failed (__FILE__, __LINE__, __FUNCTION__); \
|
|
|
|
|
<->decl_flags.u2; })
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#else
|
|
|
|
|
|
|
|
|
|
#define LANG_DECL_U2_CHECK(NODE, TF) \
|
|
|
|
|
(&DECL_LANG_SPECIFIC (NODE)->decl_flags.u2)
|
|
|
|
|
|
|
|
|
|
#endif /* ENABLE_TREE_CHECKING */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* DECL_NEEDED_P holds of a declaration when we need to emit its
|
|
|
|
|
definition. This is true when the back-end tells us that
|
|
|
|
|
the symbol has been referenced in the generated code. If, however,
|
|
|
|
|
we are not generating code, then it is also true when a symbol has
|
|
|
|
|
just been used somewhere, even if it's not really needed. We need
|
|
|
|
|
anything that isn't comdat, but we don't know for sure whether or
|
|
|
|
|
not something is comdat until end-of-file. */
|
|
|
|
|
#define DECL_NEEDED_P(DECL) \
|
|
|
|
|
((at_eof && TREE_PUBLIC (DECL) && !DECL_COMDAT (DECL)) \
|
|
|
|
|
|| (DECL_ASSEMBLER_NAME_SET_P (DECL) \
|
|
|
|
|
&& TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (DECL))) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|| (((flag_syntax_only || flag_unit_at_a_time) && TREE_USED (DECL))))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* For a FUNCTION_DECL or a VAR_DECL, the language linkage for the
|
|
|
|
|
declaration. Some entities (like a member function in a local
|
|
|
|
|
class, or a local variable) do not have linkage at all, and this
|
|
|
|
|
macro should not be used in those cases.
|
|
|
|
|
|
|
|
|
|
Implementation note: A FUNCTION_DECL without DECL_LANG_SPECIFIC was
|
|
|
|
|
created by language-independent code, and has C linkage. Most
|
|
|
|
|
VAR_DECLs have C++ linkage, and do not have DECL_LANG_SPECIFIC, but
|
|
|
|
|
we do create DECL_LANG_SPECIFIC for variables with non-C++ linkage. */
|
|
|
|
|
#define DECL_LANGUAGE(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE) \
|
|
|
|
|
? DECL_LANG_SPECIFIC (NODE)->decl_flags.language \
|
|
|
|
|
: (TREE_CODE (NODE) == FUNCTION_DECL \
|
|
|
|
|
? lang_c : lang_cplusplus))
|
|
|
|
|
|
|
|
|
|
/* Set the language linkage for NODE to LANGUAGE. */
|
|
|
|
|
#define SET_DECL_LANGUAGE(NODE, LANGUAGE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.language = (LANGUAGE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* For FUNCTION_DECLs: nonzero means that this function is a constructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_CONSTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.constructor_attr)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a complete
|
|
|
|
|
object. */
|
|
|
|
|
#define DECL_COMPLETE_CONSTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_CONSTRUCTOR_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) == complete_ctor_identifier)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a constructor for a base
|
|
|
|
|
object. */
|
|
|
|
|
#define DECL_BASE_CONSTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_CONSTRUCTOR_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) == base_ctor_identifier)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a constructor, but not either the
|
|
|
|
|
specialized in-charge constructor or the specialized not-in-charge
|
|
|
|
|
constructor. */
|
|
|
|
|
#define DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_CONSTRUCTOR_P (NODE) && !DECL_CLONED_FUNCTION_P (NODE))
|
2000-05-27 02:25:28 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a copy constructor. */
|
|
|
|
|
#define DECL_COPY_CONSTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_CONSTRUCTOR_P (NODE) && copy_fn_p (NODE) > 0)
|
2000-05-27 02:25:28 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE is a destructor. */
|
|
|
|
|
#define DECL_DESTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.destructor_attr)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a destructor, but not the
|
|
|
|
|
specialized in-charge constructor, in-charge deleting constructor,
|
|
|
|
|
or the the base destructor. */
|
|
|
|
|
#define DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_DESTRUCTOR_P (NODE) && !DECL_CLONED_FUNCTION_P (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
|
|
|
|
|
object. */
|
|
|
|
|
#define DECL_COMPLETE_DESTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_DESTRUCTOR_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) == complete_dtor_identifier)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a base
|
|
|
|
|
object. */
|
|
|
|
|
#define DECL_BASE_DESTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_DESTRUCTOR_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) == base_dtor_identifier)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a destructor for a complete
|
|
|
|
|
object that deletes the object after it has been destroyed. */
|
|
|
|
|
#define DECL_DELETING_DESTRUCTOR_P(NODE) \
|
|
|
|
|
(DECL_DESTRUCTOR_P (NODE) \
|
|
|
|
|
&& DECL_NAME (NODE) == deleting_dtor_identifier)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE (a FUNCTION_DECL) is a cloned constructor or
|
|
|
|
|
destructor. */
|
|
|
|
|
#define DECL_CLONED_FUNCTION_P(NODE) \
|
|
|
|
|
((TREE_CODE (NODE) == FUNCTION_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == TEMPLATE_DECL) \
|
|
|
|
|
&& DECL_LANG_SPECIFIC (NODE) \
|
|
|
|
|
&& DECL_CLONED_FUNCTION (NODE) != NULL_TREE)
|
2000-05-27 02:25:28 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* If DECL_CLONED_FUNCTION_P holds, this is the function that was
|
|
|
|
|
cloned. */
|
|
|
|
|
#define DECL_CLONED_FUNCTION(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.cloned_function)
|
2000-05-27 02:25:28 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE has DECL_DISCRIMINATOR and not DECL_ACCESS. */
|
|
|
|
|
#define DECL_DISCRIMINATOR_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == VAR_DECL \
|
|
|
|
|
&& DECL_FUNCTION_SCOPE_P (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Discriminator for name mangling. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define DECL_DISCRIMINATOR(NODE) (LANG_DECL_U2_CHECK (NODE, 1)->discriminator)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if the VTT parm has been added to NODE. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_HAS_VTT_PARM_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.has_vtt_parm_p)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if NODE is a FUNCTION_DECL for which a VTT parameter is
|
2002-02-01 18:16:02 +00:00
|
|
|
|
required. */
|
|
|
|
|
#define DECL_NEEDS_VTT_PARM_P(NODE) \
|
|
|
|
|
(TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (NODE)) \
|
|
|
|
|
&& (DECL_BASE_CONSTRUCTOR_P (NODE) \
|
|
|
|
|
|| DECL_BASE_DESTRUCTOR_P (NODE)))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if NODE is a user-defined conversion operator. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_CONV_FN_P(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(DECL_NAME (NODE) && IDENTIFIER_TYPENAME_P (DECL_NAME (NODE)))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* If FN is a conversion operator, the type to which it converts.
|
|
|
|
|
Otherwise, NULL_TREE. */
|
|
|
|
|
#define DECL_CONV_FN_TYPE(FN) \
|
|
|
|
|
(DECL_CONV_FN_P (FN) ? TREE_TYPE (DECL_NAME (FN)) : NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE, which is a TEMPLATE_DECL, is a template
|
|
|
|
|
conversion operator to a type dependent on the innermost template
|
|
|
|
|
args. */
|
|
|
|
|
#define DECL_TEMPLATE_CONV_FN_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.template_conv_p)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Set the overloaded operator code for NODE to CODE. */
|
|
|
|
|
#define SET_OVERLOADED_OPERATOR_CODE(NODE, CODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.operator_code = (CODE))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* If NODE is an overloaded operator, then this returns the TREE_CODE
|
2004-07-28 03:11:36 +00:00
|
|
|
|
associated with the overloaded operator.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_ASSIGNMENT_OPERATOR_P must also be checked to determine
|
|
|
|
|
whether or not NODE is an assignment operator. If NODE is not an
|
|
|
|
|
overloaded operator, ERROR_MARK is returned. Since the numerical
|
|
|
|
|
value of ERROR_MARK is zero, this macro can be used as a predicate
|
|
|
|
|
to test whether or not NODE is an overloaded operator. */
|
|
|
|
|
#define DECL_OVERLOADED_OPERATOR_P(NODE) \
|
|
|
|
|
(IDENTIFIER_OPNAME_P (DECL_NAME (NODE)) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? DECL_LANG_SPECIFIC (NODE)->u.f.operator_code : ERROR_MARK)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if NODE is an assignment operator. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_ASSIGNMENT_OPERATOR_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.assignment_operator_p)
|
|
|
|
|
|
|
|
|
|
/* For FUNCTION_DECLs: nonzero means that this function is a
|
|
|
|
|
constructor or a destructor with an extra in-charge parameter to
|
|
|
|
|
control whether or not virtual bases are constructed. */
|
|
|
|
|
#define DECL_HAS_IN_CHARGE_PARM_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.has_in_charge_parm_p)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is an overloaded `operator delete[]' function. */
|
|
|
|
|
#define DECL_ARRAY_DELETE_OPERATOR_P(NODE) \
|
|
|
|
|
(DECL_OVERLOADED_OPERATOR_P (NODE) == VEC_DELETE_EXPR)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for _DECL means that this decl appears in (or will appear
|
|
|
|
|
in) as a member in a RECORD_TYPE or UNION_TYPE node. It is also for
|
|
|
|
|
detecting circularity in case members are multiply defined. In the
|
|
|
|
|
case of a VAR_DECL, it is also used to determine how program storage
|
|
|
|
|
should be allocated. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_IN_AGGR_P(NODE) (DECL_LANG_FLAG_3 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero for a VAR_DECL means that the variable's initialization has
|
|
|
|
|
been processed. */
|
|
|
|
|
#define DECL_INITIALIZED_P(NODE) \
|
|
|
|
|
(TREE_LANG_FLAG_1 (VAR_DECL_CHECK (NODE)))
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Nonzero for a VAR_DECL that was initialized with a
|
|
|
|
|
constant-expression. */
|
|
|
|
|
#define DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P(NODE) \
|
|
|
|
|
(TREE_LANG_FLAG_2 (VAR_DECL_CHECK (NODE)))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if the DECL was initialized in the class definition itself,
|
2003-07-11 03:40:53 +00:00
|
|
|
|
rather than outside the class. This is used for both static member
|
2004-07-28 03:11:36 +00:00
|
|
|
|
VAR_DECLS, and FUNTION_DECLS that are defined in the class. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_INITIALIZED_IN_CLASS_P(DECL) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (DECL)->decl_flags.initialized_in_class)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this decl is just a
|
|
|
|
|
friend declaration, and should not be added to the list of
|
|
|
|
|
member functions for this class. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_FRIEND_P(NODE) (DECL_LANG_SPECIFIC (NODE)->decl_flags.friend_attr)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* A TREE_LIST of the types which have befriended this FUNCTION_DECL. */
|
|
|
|
|
#define DECL_BEFRIENDING_CLASSES(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.befriending_classes)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this decl is a static
|
|
|
|
|
member function. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_STATIC_FUNCTION_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.static_function)
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this decl is a non-static
|
|
|
|
|
member function. */
|
|
|
|
|
#define DECL_NONSTATIC_MEMBER_FUNCTION_P(NODE) \
|
|
|
|
|
(TREE_CODE (TREE_TYPE (NODE)) == METHOD_TYPE)
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this decl is a member function
|
|
|
|
|
(static or non-static). */
|
|
|
|
|
#define DECL_FUNCTION_MEMBER_P(NODE) \
|
1999-08-26 09:30:50 +00:00
|
|
|
|
(DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) || DECL_STATIC_FUNCTION_P (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this member function
|
|
|
|
|
has `this' as const X *const. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_CONST_MEMFUNC_P(NODE) \
|
|
|
|
|
(DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
|
|
|
|
|
&& CP_TYPE_CONST_P (TREE_TYPE (TREE_VALUE \
|
|
|
|
|
(TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this member function
|
|
|
|
|
has `this' as volatile X *const. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_VOLATILE_MEMFUNC_P(NODE) \
|
|
|
|
|
(DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE) \
|
|
|
|
|
&& CP_TYPE_VOLATILE_P (TREE_TYPE (TREE_VALUE \
|
|
|
|
|
(TYPE_ARG_TYPES (TREE_TYPE (NODE))))))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero for a DECL means that this member is a non-static member. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NONSTATIC_MEMBER_P(NODE) \
|
|
|
|
|
((TREE_CODE (NODE) == FUNCTION_DECL \
|
1999-10-16 06:09:09 +00:00
|
|
|
|
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (NODE)) \
|
|
|
|
|
|| TREE_CODE (NODE) == FIELD_DECL)
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero for _DECL means that this member object type
|
|
|
|
|
is mutable. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_MUTABLE_P(NODE) (DECL_LANG_FLAG_0 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for _DECL means that this constructor is a non-converting
|
|
|
|
|
constructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NONCONVERTING_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.nonconverting)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this member function is a pure
|
|
|
|
|
virtual function. */
|
|
|
|
|
#define DECL_PURE_VIRTUAL_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.pure_virtual)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Nonzero for FUNCTION_DECL means that this member function
|
|
|
|
|
must be overridden by derived classes. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NEEDS_FINAL_OVERRIDER_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.needs_final_overrider)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* The thunks associated with NODE, a FUNCTION_DECL. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define DECL_THUNKS(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.context)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE is a thunk, rather than an ordinary function. */
|
|
|
|
|
#define DECL_THUNK_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == FUNCTION_DECL \
|
|
|
|
|
&& DECL_LANG_FLAG_7 (NODE))
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Nonzero if NODE is a this pointer adjusting thunk. */
|
|
|
|
|
#define DECL_THIS_THUNK_P(NODE) \
|
|
|
|
|
(DECL_THUNK_P (NODE) && DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is a result pointer adjusting thunk. */
|
|
|
|
|
#define DECL_RESULT_THUNK_P(NODE) \
|
|
|
|
|
(DECL_THUNK_P (NODE) && !DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE is a FUNCTION_DECL, but not a thunk. */
|
|
|
|
|
#define DECL_NON_THUNK_FUNCTION_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == FUNCTION_DECL && !DECL_THUNK_P (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is `extern "C"'. */
|
|
|
|
|
#define DECL_EXTERN_C_P(NODE) \
|
|
|
|
|
(DECL_LANGUAGE (NODE) == lang_c)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is an `extern "C"' function. */
|
|
|
|
|
#define DECL_EXTERN_C_FUNCTION_P(NODE) \
|
|
|
|
|
(DECL_NON_THUNK_FUNCTION_P (NODE) && DECL_EXTERN_C_P (NODE))
|
|
|
|
|
|
|
|
|
|
/* Set DECL_THUNK_P for node. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define SET_DECL_THUNK_P(NODE, THIS_ADJUSTING) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_FLAG_7 (NODE) = 1, \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_LANG_SPECIFIC (NODE)->u.f.u3sel = 1, \
|
|
|
|
|
DECL_LANG_SPECIFIC (NODE)->decl_flags.this_thunk_p = (THIS_ADJUSTING))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this DECL is the __PRETTY_FUNCTION__ variable in a
|
|
|
|
|
template function. */
|
|
|
|
|
#define DECL_PRETTY_FUNCTION_P(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(TREE_LANG_FLAG_0 (VAR_DECL_CHECK (NODE)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* The _TYPE context in which this _DECL appears. This field holds the
|
2003-07-11 03:40:53 +00:00
|
|
|
|
class where a virtual function instance is actually defined. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_CLASS_CONTEXT(NODE) \
|
|
|
|
|
(DECL_CLASS_SCOPE_P (NODE) ? DECL_CONTEXT (NODE) : NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* For a non-member friend function, the class (if any) in which this
|
|
|
|
|
friend was defined. For example, given:
|
|
|
|
|
|
|
|
|
|
struct S { friend void f (); };
|
|
|
|
|
|
|
|
|
|
the DECL_FRIEND_CONTEXT for `f' will be `S'. */
|
|
|
|
|
#define DECL_FRIEND_CONTEXT(NODE) \
|
|
|
|
|
((DECL_FRIEND_P (NODE) && !DECL_FUNCTION_MEMBER_P (NODE)) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
? DECL_LANG_SPECIFIC (NODE)->u.f.context \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: NULL_TREE)
|
|
|
|
|
|
|
|
|
|
/* Set the DECL_FRIEND_CONTEXT for NODE to CONTEXT. */
|
|
|
|
|
#define SET_DECL_FRIEND_CONTEXT(NODE, CONTEXT) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.context = (CONTEXT))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* NULL_TREE in DECL_CONTEXT represents the global namespace. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define CP_DECL_CONTEXT(NODE) \
|
|
|
|
|
(DECL_CONTEXT (NODE) ? DECL_CONTEXT (NODE) : global_namespace)
|
|
|
|
|
#define FROB_CONTEXT(NODE) ((NODE) == global_namespace ? NULL_TREE : (NODE))
|
|
|
|
|
|
|
|
|
|
/* 1 iff NODE has namespace scope, including the global namespace. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NAMESPACE_SCOPE_P(NODE) \
|
|
|
|
|
(!DECL_TEMPLATE_PARM_P (NODE) \
|
|
|
|
|
&& TREE_CODE (CP_DECL_CONTEXT (NODE)) == NAMESPACE_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* 1 iff NODE is a class member. */
|
|
|
|
|
#define DECL_CLASS_SCOPE_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(DECL_CONTEXT (NODE) && TYPE_P (DECL_CONTEXT (NODE)))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* 1 iff NODE is function-local. */
|
|
|
|
|
#define DECL_FUNCTION_SCOPE_P(NODE) \
|
|
|
|
|
(DECL_CONTEXT (NODE) \
|
|
|
|
|
&& TREE_CODE (DECL_CONTEXT (NODE)) == FUNCTION_DECL)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* 1 iff VAR_DECL node NODE is virtual table or VTT. */
|
|
|
|
|
#define DECL_VTABLE_OR_VTT_P(NODE) TREE_LANG_FLAG_5 (VAR_DECL_CHECK (NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* 1 iff NODE is function-local, but for types. */
|
|
|
|
|
#define LOCAL_CLASS_P(NODE) \
|
|
|
|
|
(decl_function_context (TYPE_MAIN_DECL (NODE)) != NULL_TREE)
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* For a NAMESPACE_DECL: the list of using namespace directives
|
|
|
|
|
The PURPOSE is the used namespace, the value is the namespace
|
2003-07-11 03:40:53 +00:00
|
|
|
|
that is the common ancestor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NAMESPACE_USING(NODE) DECL_VINDEX (NAMESPACE_DECL_CHECK (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* In a NAMESPACE_DECL, the DECL_INITIAL is used to record all users
|
2003-07-11 03:40:53 +00:00
|
|
|
|
of a namespace, to record the transitive closure of using namespace. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NAMESPACE_USERS(NODE) DECL_INITIAL (NAMESPACE_DECL_CHECK (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* In a NAMESPACE_DECL, the list of namespaces which have associated
|
|
|
|
|
themselves with this one. */
|
|
|
|
|
#define DECL_NAMESPACE_ASSOCIATIONS(NODE) \
|
|
|
|
|
(NAMESPACE_DECL_CHECK (NODE)->decl.saved_tree)
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* In a NAMESPACE_DECL, points to the original namespace if this is
|
|
|
|
|
a namespace alias. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NAMESPACE_ALIAS(NODE) \
|
|
|
|
|
DECL_ABSTRACT_ORIGIN (NAMESPACE_DECL_CHECK (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define ORIGINAL_NAMESPACE(NODE) \
|
|
|
|
|
(DECL_NAMESPACE_ALIAS (NODE) ? DECL_NAMESPACE_ALIAS (NODE) : (NODE))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if NODE is the std namespace. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_NAMESPACE_STD_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == NAMESPACE_DECL \
|
|
|
|
|
&& CP_DECL_CONTEXT (NODE) == global_namespace \
|
|
|
|
|
&& DECL_NAME (NODE) == std_identifier)
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* In a non-local VAR_DECL with static storage duration, this is the
|
|
|
|
|
initialization priority. If this value is zero, the NODE will be
|
|
|
|
|
initialized at the DEFAULT_INIT_PRIORITY. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_INIT_PRIORITY(NODE) (VAR_DECL_CHECK (NODE)->decl.u2.i)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* In a TREE_LIST concatenating using directives, indicate indirect
|
1999-08-26 09:30:50 +00:00
|
|
|
|
directives */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TREE_INDIRECT_USING(NODE) (TREE_LIST_CHECK (NODE)->common.lang_flag_0)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* In a VAR_DECL for a variable declared in a for statement,
|
1999-08-26 09:30:50 +00:00
|
|
|
|
this is the shadowed (local) variable. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_SHADOWED_FOR_VAR(NODE) DECL_RESULT_FLD(VAR_DECL_CHECK (NODE))
|
|
|
|
|
|
|
|
|
|
/* In a FUNCTION_DECL, this is nonzero if this function was defined in
|
|
|
|
|
the class definition. We have saved away the text of the function,
|
|
|
|
|
but have not yet processed it. */
|
|
|
|
|
#define DECL_PENDING_INLINE_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.pending_inline_p)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* If DECL_PENDING_INLINE_P holds, this is the saved text of the
|
|
|
|
|
function. */
|
|
|
|
|
#define DECL_PENDING_INLINE_INFO(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.u.pending_inline_info)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* For a TYPE_DECL: if this structure has many fields, we'll sort them
|
|
|
|
|
and put them into a TREE_VEC. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_SORTED_FIELDS(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(DECL_LANG_SPECIFIC (TYPE_DECL_CHECK (NODE))->u.f.u.sorted_fields)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* True if on the deferred_fns (see decl2.c) list. */
|
|
|
|
|
#define DECL_DEFERRED_FN(DECL) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (DECL)->decl_flags.deferred)
|
|
|
|
|
|
|
|
|
|
/* For a VAR_DECL, FUNCTION_DECL, TYPE_DECL or TEMPLATE_DECL:
|
|
|
|
|
template-specific information. */
|
|
|
|
|
#define DECL_TEMPLATE_INFO(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK (NODE)) \
|
|
|
|
|
->decl_flags.u.template_info)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* For a VAR_DECL, indicates that the variable has been processed.
|
|
|
|
|
This flag is set and unset throughout the code; it is always
|
|
|
|
|
used for a temporary purpose. */
|
|
|
|
|
#define DECL_VAR_MARKED_P(NODE) \
|
|
|
|
|
(DECL_LANG_FLAG_4 (VAR_DECL_CHECK (NODE)))
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Template information for a RECORD_TYPE or UNION_TYPE. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define CLASSTYPE_TEMPLATE_INFO(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (RECORD_OR_UNION_TYPE_CHECK (NODE))->template_info)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Template information for an ENUMERAL_TYPE. Although an enumeration may
|
|
|
|
|
not be a primary template, it may be declared within the scope of a
|
|
|
|
|
primary template and the enumeration constants may depend on
|
|
|
|
|
non-type template parameters. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define ENUM_TEMPLATE_INFO(NODE) (TYPE_BINFO (ENUMERAL_TYPE_CHECK (NODE)))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Template information for a template template parameter. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK (NODE)) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
->template_info)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Template information for an ENUMERAL_, RECORD_, or UNION_TYPE. */
|
|
|
|
|
#define TYPE_TEMPLATE_INFO(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == ENUMERAL_TYPE \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
? ENUM_TEMPLATE_INFO (NODE) : \
|
|
|
|
|
(TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM \
|
|
|
|
|
? TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (NODE) : \
|
|
|
|
|
(TYPE_LANG_SPECIFIC (NODE) \
|
|
|
|
|
? CLASSTYPE_TEMPLATE_INFO (NODE) \
|
|
|
|
|
: NULL_TREE)))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Set the template information for an ENUMERAL_, RECORD_, or
|
|
|
|
|
UNION_TYPE to VAL. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_TYPE_TEMPLATE_INFO(NODE, VAL) \
|
|
|
|
|
(TREE_CODE (NODE) == ENUMERAL_TYPE \
|
|
|
|
|
? (ENUM_TEMPLATE_INFO (NODE) = (VAL)) \
|
|
|
|
|
: (CLASSTYPE_TEMPLATE_INFO (NODE) = (VAL)))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define TI_TEMPLATE(NODE) (TREE_PURPOSE (NODE))
|
|
|
|
|
#define TI_ARGS(NODE) (TREE_VALUE (NODE))
|
|
|
|
|
#define TI_PENDING_TEMPLATE_FLAG(NODE) TREE_LANG_FLAG_1 (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* We use TREE_VECs to hold template arguments. If there is only one
|
|
|
|
|
level of template arguments, then the TREE_VEC contains the
|
|
|
|
|
arguments directly. If there is more than one level of template
|
|
|
|
|
arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
|
|
|
|
|
containing the template arguments for a single level. The first
|
|
|
|
|
entry in the outer TREE_VEC is the outermost level of template
|
|
|
|
|
parameters; the last is the innermost.
|
|
|
|
|
|
|
|
|
|
It is incorrect to ever form a template argument vector containing
|
|
|
|
|
only one level of arguments, but which is a TREE_VEC containing as
|
|
|
|
|
its only entry the TREE_VEC for that level. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if the template arguments is actually a vector of vectors,
|
2002-02-01 18:16:02 +00:00
|
|
|
|
rather than just a vector. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
|
|
|
|
|
(NODE && TREE_VEC_ELT (NODE, 0) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
&& TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
|
|
|
|
|
|
|
|
|
|
/* The depth of a template argument vector. When called directly by
|
|
|
|
|
the parser, we use a TREE_LIST rather than a TREE_VEC to represent
|
|
|
|
|
template arguments. In fact, we may even see NULL_TREE if there
|
|
|
|
|
are no template arguments. In both of those cases, there is only
|
|
|
|
|
one level of template arguments. */
|
|
|
|
|
#define TMPL_ARGS_DEPTH(NODE) \
|
|
|
|
|
(TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The LEVELth level of the template ARGS. The outermost level of
|
2002-02-01 18:16:02 +00:00
|
|
|
|
args is level 1, not level 0. */
|
|
|
|
|
#define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
|
|
|
|
|
(TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
|
|
|
|
|
? TREE_VEC_ELT (ARGS, (LEVEL) - 1) : (ARGS))
|
|
|
|
|
|
|
|
|
|
/* Set the LEVELth level of the template ARGS to VAL. This macro does
|
|
|
|
|
not work with single-level argument vectors. */
|
|
|
|
|
#define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
|
|
|
|
|
(TREE_VEC_ELT (ARGS, (LEVEL) - 1) = (VAL))
|
|
|
|
|
|
|
|
|
|
/* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
|
|
|
|
|
#define TMPL_ARG(ARGS, LEVEL, IDX) \
|
|
|
|
|
(TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
|
|
|
|
|
|
|
|
|
|
/* Set the IDXth element in the LEVELth level of ARGS to VAL. This
|
|
|
|
|
macro does not work with single-level argument vectors. */
|
|
|
|
|
#define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
|
|
|
|
|
(TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
|
|
|
|
|
|
|
|
|
|
/* Given a single level of template arguments in NODE, return the
|
|
|
|
|
number of arguments. */
|
|
|
|
|
#define NUM_TMPL_ARGS(NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(TREE_VEC_LENGTH (NODE))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Returns the innermost level of template arguments in ARGS. */
|
|
|
|
|
#define INNERMOST_TEMPLATE_ARGS(NODE) \
|
|
|
|
|
(get_innermost_template_args ((NODE), 1))
|
|
|
|
|
|
|
|
|
|
/* The number of levels of template parameters given by NODE. */
|
|
|
|
|
#define TMPL_PARMS_DEPTH(NODE) \
|
|
|
|
|
((HOST_WIDE_INT) TREE_INT_CST_LOW (TREE_PURPOSE (NODE)))
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* The TEMPLATE_DECL instantiated or specialized by NODE. This
|
|
|
|
|
TEMPLATE_DECL will be the immediate parent, not the most general
|
|
|
|
|
template. For example, in:
|
|
|
|
|
|
|
|
|
|
template <class T> struct S { template <class U> void f(U); }
|
|
|
|
|
|
|
|
|
|
the FUNCTION_DECL for S<int>::f<double> will have, as its
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_TI_TEMPLATE, `template <class U> S<int>::f<U>'.
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
As a special case, for a member friend template of a template
|
2004-07-28 03:11:36 +00:00
|
|
|
|
class, this value will not be a TEMPLATE_DECL, but rather an
|
|
|
|
|
IDENTIFIER_NODE or OVERLOAD indicating the name of the template and
|
|
|
|
|
any explicit template arguments provided. For example, in:
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
template <class T> struct S { friend void f<int>(int, double); }
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
the DECL_TI_TEMPLATE will be an IDENTIFIER_NODE for `f' and the
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DECL_TI_ARGS will be {int}. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_TI_TEMPLATE(NODE) TI_TEMPLATE (DECL_TEMPLATE_INFO (NODE))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* The template arguments used to obtain this decl from the most
|
|
|
|
|
general form of DECL_TI_TEMPLATE. For the example given for
|
|
|
|
|
DECL_TI_TEMPLATE, the DECL_TI_ARGS will be {int, double}. These
|
|
|
|
|
are always the full set of arguments required to instantiate this
|
|
|
|
|
declaration from the most general template specialized here. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_TI_ARGS(NODE) TI_ARGS (DECL_TEMPLATE_INFO (NODE))
|
|
|
|
|
#define CLASSTYPE_TI_TEMPLATE(NODE) TI_TEMPLATE (CLASSTYPE_TEMPLATE_INFO (NODE))
|
|
|
|
|
#define CLASSTYPE_TI_ARGS(NODE) TI_ARGS (CLASSTYPE_TEMPLATE_INFO (NODE))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define ENUM_TI_TEMPLATE(NODE) \
|
1999-10-16 06:09:09 +00:00
|
|
|
|
TI_TEMPLATE (ENUM_TEMPLATE_INFO (NODE))
|
|
|
|
|
#define ENUM_TI_ARGS(NODE) \
|
|
|
|
|
TI_ARGS (ENUM_TEMPLATE_INFO (NODE))
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* For a template instantiation TYPE, returns the TYPE corresponding
|
|
|
|
|
to the primary template. Otherwise returns TYPE itself. */
|
|
|
|
|
#define CLASSTYPE_PRIMARY_TEMPLATE_TYPE(TYPE) \
|
|
|
|
|
((CLASSTYPE_USE_TEMPLATE ((TYPE)) && !CLASSTYPE_TEMPLATE_SPECIALIZATION ((TYPE))) \
|
|
|
|
|
? TREE_TYPE (DECL_TEMPLATE_RESULT (DECL_PRIMARY_TEMPLATE \
|
|
|
|
|
(CLASSTYPE_TI_TEMPLATE ((TYPE))))) \
|
|
|
|
|
: (TYPE))
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Like DECL_TI_TEMPLATE, but for an ENUMERAL_, RECORD_, or UNION_TYPE. */
|
|
|
|
|
#define TYPE_TI_TEMPLATE(NODE) \
|
|
|
|
|
(TI_TEMPLATE (TYPE_TEMPLATE_INFO (NODE)))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Like DECL_TI_ARGS, but for an ENUMERAL_, RECORD_, or UNION_TYPE. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define TYPE_TI_ARGS(NODE) \
|
|
|
|
|
(TI_ARGS (TYPE_TEMPLATE_INFO (NODE)))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define INNERMOST_TEMPLATE_PARMS(NODE) TREE_VALUE (NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero if the NODE corresponds to the template parameters for a
|
|
|
|
|
member template, whose inline definition is being processed after
|
|
|
|
|
the class definition is complete. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define TEMPLATE_PARMS_FOR_INLINE(NODE) TREE_LANG_FLAG_1 (NODE)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* In a FUNCTION_DECL, the saved language-specific per-function data. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define DECL_SAVED_FUNCTION_DATA(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE)) \
|
|
|
|
|
->u.f.u.saved_language_function)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define NEW_EXPR_USE_GLOBAL(NODE) TREE_LANG_FLAG_0 (NODE)
|
|
|
|
|
#define DELETE_EXPR_USE_GLOBAL(NODE) TREE_LANG_FLAG_0 (NODE)
|
|
|
|
|
#define DELETE_EXPR_USE_VEC(NODE) TREE_LANG_FLAG_1 (NODE)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
|
|
|
|
/* Indicates that this is a non-dependent COMPOUND_EXPR which will
|
|
|
|
|
resolve to a function call. */
|
|
|
|
|
#define COMPOUND_EXPR_OVERLOADED(NODE) TREE_LANG_FLAG_0 (NODE)
|
|
|
|
|
|
|
|
|
|
/* In a CALL_EXPR appearing in a template, true if Koenig lookup
|
|
|
|
|
should be performed at instantiation time. */
|
|
|
|
|
#define KOENIG_LOOKUP_P(NODE) TREE_LANG_FLAG_0(NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this AGGR_INIT_EXPR provides for initialization via a
|
|
|
|
|
constructor call, rather than an ordinary function call. */
|
|
|
|
|
#define AGGR_INIT_VIA_CTOR_P(NODE) \
|
|
|
|
|
TREE_LANG_FLAG_0 (AGGR_INIT_EXPR_CHECK (NODE))
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* The TYPE_MAIN_DECL for a class template type is a TYPE_DECL, not a
|
|
|
|
|
TEMPLATE_DECL. This macro determines whether or not a given class
|
|
|
|
|
type is really a template type, as opposed to an instantiation or
|
|
|
|
|
specialization of one. */
|
|
|
|
|
#define CLASSTYPE_IS_TEMPLATE(NODE) \
|
|
|
|
|
(CLASSTYPE_TEMPLATE_INFO (NODE) \
|
|
|
|
|
&& !CLASSTYPE_USE_TEMPLATE (NODE) \
|
|
|
|
|
&& PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (NODE)))
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* The name used by the user to name the typename type. Typically,
|
|
|
|
|
this is an IDENTIFIER_NODE, and the same as the DECL_NAME on the
|
|
|
|
|
corresponding TYPE_DECL. However, this may also be a
|
|
|
|
|
TEMPLATE_ID_EXPR if we had something like `typename X::Y<T>'. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPENAME_TYPE_FULLNAME(NODE) (TYPE_FIELDS (NODE))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Nonzero in INTEGER_CST means that this int is negative by dint of
|
1996-09-18 05:35:50 +00:00
|
|
|
|
using a twos-complement negated operand. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TREE_NEGATED_INT(NODE) TREE_LANG_FLAG_0 (INTEGER_CST_CHECK (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero in any kind of _TYPE where conversions to base-classes may
|
|
|
|
|
involve pointer arithmetic. If this is zero, then converting to
|
|
|
|
|
a base-class never requires changing the value of the pointer. */
|
|
|
|
|
#define TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P(NODE) (TREE_LANG_FLAG_1 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* [class.virtual]
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
A class that declares or inherits a virtual function is called a
|
|
|
|
|
polymorphic class. */
|
|
|
|
|
#define TYPE_POLYMORPHIC_P(NODE) (TREE_LANG_FLAG_2 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if this class has a virtual function table pointer. */
|
|
|
|
|
#define TYPE_CONTAINS_VPTR_P(NODE) \
|
|
|
|
|
(TYPE_POLYMORPHIC_P (NODE) \
|
|
|
|
|
|| TYPE_USES_VIRTUAL_BASECLASSES (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* This flag is true of a local VAR_DECL if it was declared in a for
|
1999-08-26 09:30:50 +00:00
|
|
|
|
statement, but we are no longer in the scope of the for. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_DEAD_FOR_LOCAL(NODE) DECL_LANG_FLAG_7 (VAR_DECL_CHECK (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* This flag is set on a VAR_DECL that is a DECL_DEAD_FOR_LOCAL
|
|
|
|
|
if we already emitted a warning about using it. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_ERROR_REPORTED(NODE) DECL_LANG_FLAG_0 (VAR_DECL_CHECK (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is a FUNCTION_DECL (for a function with global
|
|
|
|
|
scope) declared in a local scope. */
|
|
|
|
|
#define DECL_LOCAL_FUNCTION_P(NODE) \
|
|
|
|
|
DECL_LANG_FLAG_0 (FUNCTION_DECL_CHECK (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE is a FUNCTION_DECL for a built-in function, and we have
|
|
|
|
|
not yet seen a prototype for that function. */
|
|
|
|
|
#define DECL_ANTICIPATED(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (DECL_CHECK (NODE))->decl_flags.anticipated_p)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Record whether a typedef for type `int' was actually `signed int'. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define C_TYPEDEF_EXPLICITLY_SIGNED(EXP) DECL_LANG_FLAG_1 (EXP)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns nonzero if DECL has external linkage, as specified by the
|
2002-02-01 18:16:02 +00:00
|
|
|
|
language standard. (This predicate may hold even when the
|
|
|
|
|
corresponding entity is not actually given external linkage in the
|
|
|
|
|
object file; see decl_linkage for details.) */
|
|
|
|
|
#define DECL_EXTERNAL_LINKAGE_P(DECL) \
|
|
|
|
|
(decl_linkage (DECL) == lk_external)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#define INTEGRAL_CODE_P(CODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
((CODE) == INTEGER_TYPE || (CODE) == ENUMERAL_TYPE || (CODE) == BOOLEAN_TYPE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* [basic.fundamental]
|
|
|
|
|
|
|
|
|
|
Types bool, char, wchar_t, and the signed and unsigned integer types
|
|
|
|
|
are collectively called integral types.
|
|
|
|
|
|
|
|
|
|
Note that INTEGRAL_TYPE_P, as defined in tree.h, allows enumeration
|
|
|
|
|
types as well, which is incorrect in C++. */
|
|
|
|
|
#define CP_INTEGRAL_TYPE_P(TYPE) \
|
|
|
|
|
(TREE_CODE (TYPE) == BOOLEAN_TYPE \
|
|
|
|
|
|| TREE_CODE (TYPE) == INTEGER_TYPE)
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns true if TYPE is an integral or enumeration name. */
|
|
|
|
|
#define INTEGRAL_OR_ENUMERATION_TYPE_P(TYPE) \
|
|
|
|
|
(CP_INTEGRAL_TYPE_P (TYPE) || TREE_CODE (TYPE) == ENUMERAL_TYPE)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* [basic.fundamental]
|
|
|
|
|
|
|
|
|
|
Integral and floating types are collectively called arithmetic
|
|
|
|
|
types. */
|
|
|
|
|
#define ARITHMETIC_TYPE_P(TYPE) \
|
|
|
|
|
(CP_INTEGRAL_TYPE_P (TYPE) || TREE_CODE (TYPE) == REAL_TYPE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* [basic.types]
|
|
|
|
|
|
|
|
|
|
Arithmetic types, enumeration types, pointer types, and
|
|
|
|
|
pointer-to-member types, are collectively called scalar types. */
|
|
|
|
|
#define SCALAR_TYPE_P(TYPE) \
|
|
|
|
|
(ARITHMETIC_TYPE_P (TYPE) \
|
|
|
|
|
|| TREE_CODE (TYPE) == ENUMERAL_TYPE \
|
|
|
|
|
|| TYPE_PTR_P (TYPE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|| TYPE_PTR_TO_MEMBER_P (TYPE))
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|
|
|
|
|
/* [dcl.init.aggr]
|
|
|
|
|
|
|
|
|
|
An aggregate is an array or a class with no user-declared
|
|
|
|
|
constructors, no private or protected non-static data members, no
|
2004-07-28 03:11:36 +00:00
|
|
|
|
base classes, and no virtual functions.
|
|
|
|
|
|
|
|
|
|
As an extension, we also treat vectors as aggregates. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define CP_AGGREGATE_TYPE_P(TYPE) \
|
|
|
|
|
(TREE_CODE (TYPE) == ARRAY_TYPE \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|| TREE_CODE (TYPE) == VECTOR_TYPE \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|| (CLASS_TYPE_P (TYPE) \
|
|
|
|
|
&& !CLASSTYPE_NON_AGGREGATE (TYPE)))
|
|
|
|
|
|
|
|
|
|
/* Nonzero for a class type means that the class type has a
|
|
|
|
|
user-declared constructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_CONSTRUCTOR(NODE) (TYPE_LANG_FLAG_1 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* When appearing in an INDIRECT_REF, it means that the tree structure
|
|
|
|
|
underneath is actually a call to a constructor. This is needed
|
|
|
|
|
when the constructor must initialize local storage (which can
|
|
|
|
|
be automatically destroyed), rather than allowing it to allocate
|
|
|
|
|
space from the heap.
|
|
|
|
|
|
|
|
|
|
When appearing in a SAVE_EXPR, it means that underneath
|
|
|
|
|
is a call to a constructor.
|
|
|
|
|
|
|
|
|
|
When appearing in a CONSTRUCTOR, it means that it was
|
|
|
|
|
a GNU C constructor expression.
|
|
|
|
|
|
|
|
|
|
When appearing in a FIELD_DECL, it means that this field
|
|
|
|
|
has been duly initialized in its constructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TREE_HAS_CONSTRUCTOR(NODE) (TREE_LANG_FLAG_4 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define EMPTY_CONSTRUCTOR_P(NODE) (TREE_CODE (NODE) == CONSTRUCTOR \
|
|
|
|
|
&& CONSTRUCTOR_ELTS (NODE) == NULL_TREE \
|
|
|
|
|
&& ! TREE_HAS_CONSTRUCTOR (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for _TYPE means that the _TYPE defines a destructor. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_HAS_DESTRUCTOR(NODE) (TYPE_LANG_FLAG_2 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero means that an object of this type can not be initialized using
|
|
|
|
|
an initializer list. */
|
|
|
|
|
#define CLASSTYPE_NON_AGGREGATE(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->non_aggregate)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define TYPE_NON_AGGREGATE_CLASS(NODE) \
|
|
|
|
|
(IS_AGGR_TYPE (NODE) && CLASSTYPE_NON_AGGREGATE (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if there is a user-defined X::op=(x&) for this class. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_HAS_REAL_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_real_assign_ref)
|
|
|
|
|
#define TYPE_HAS_COMPLEX_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_assign_ref)
|
|
|
|
|
#define TYPE_HAS_ABSTRACT_ASSIGN_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_abstract_assign_ref)
|
|
|
|
|
#define TYPE_HAS_COMPLEX_INIT_REF(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_complex_init_ref)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if TYPE has a trivial destructor. From [class.dtor]:
|
|
|
|
|
|
|
|
|
|
A destructor is trivial if it is an implicitly declared
|
|
|
|
|
destructor and if:
|
|
|
|
|
|
|
|
|
|
- all of the direct base classes of its class have trivial
|
|
|
|
|
destructors,
|
|
|
|
|
|
|
|
|
|
- for all of the non-static data members of its class that are
|
|
|
|
|
of class type (or array thereof), each such class has a
|
|
|
|
|
trivial destructor. */
|
|
|
|
|
#define TYPE_HAS_TRIVIAL_DESTRUCTOR(NODE) \
|
|
|
|
|
(!TYPE_HAS_NONTRIVIAL_DESTRUCTOR (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero for _TYPE node means that this type does not have a trivial
|
|
|
|
|
destructor. Therefore, destroying an object of this type will
|
|
|
|
|
involve a call to a destructor. This can apply to objects of
|
|
|
|
|
ARRAY_TYPE is the type of the elements needs a destructor. */
|
|
|
|
|
#define TYPE_HAS_NONTRIVIAL_DESTRUCTOR(NODE) \
|
|
|
|
|
(TYPE_LANG_FLAG_4 (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero for class type means that copy initialization of this type can use
|
1996-09-18 05:35:50 +00:00
|
|
|
|
a bitwise copy. */
|
|
|
|
|
#define TYPE_HAS_TRIVIAL_INIT_REF(NODE) \
|
|
|
|
|
(TYPE_HAS_INIT_REF (NODE) && ! TYPE_HAS_COMPLEX_INIT_REF (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero for class type means that assignment of this type can use
|
|
|
|
|
a bitwise copy. */
|
|
|
|
|
#define TYPE_HAS_TRIVIAL_ASSIGN_REF(NODE) \
|
|
|
|
|
(TYPE_HAS_ASSIGN_REF (NODE) && ! TYPE_HAS_COMPLEX_ASSIGN_REF (NODE))
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Returns true if NODE is a pointer-to-data-member. */
|
|
|
|
|
#define TYPE_PTRMEM_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == OFFSET_TYPE)
|
|
|
|
|
#define TYPE_PTR_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == POINTER_TYPE)
|
|
|
|
|
#define TYPE_PTROB_P(NODE) \
|
|
|
|
|
(TYPE_PTR_P (NODE) \
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (NODE)) != FUNCTION_TYPE \
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (NODE)) != METHOD_TYPE \
|
1999-08-26 09:30:50 +00:00
|
|
|
|
&& TREE_CODE (TREE_TYPE (NODE)) != VOID_TYPE)
|
|
|
|
|
#define TYPE_PTROBV_P(NODE) \
|
|
|
|
|
(TYPE_PTR_P (NODE) && TREE_CODE (TREE_TYPE (NODE)) != FUNCTION_TYPE)
|
|
|
|
|
#define TYPE_PTRFN_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == POINTER_TYPE \
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_REFFN_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == REFERENCE_TYPE \
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (NODE)) == FUNCTION_TYPE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Nonzero for _TYPE node means that this type is a pointer to member
|
1999-08-26 09:30:50 +00:00
|
|
|
|
function type. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_PTRMEMFUNC_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == RECORD_TYPE \
|
|
|
|
|
&& TYPE_LANG_SPECIFIC (NODE) \
|
|
|
|
|
&& TYPE_PTRMEMFUNC_FLAG (NODE))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_PTRMEMFUNC_FLAG(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->ptrmemfunc_flag)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Returns true if NODE is a pointer-to-member. */
|
|
|
|
|
#define TYPE_PTR_TO_MEMBER_P(NODE) \
|
|
|
|
|
(TYPE_PTRMEM_P (NODE) || TYPE_PTRMEMFUNC_P (NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Indicates when overload resolution may resolve to a pointer to
|
|
|
|
|
member function. [expr.unary.op]/3 */
|
|
|
|
|
#define PTRMEM_OK_P(NODE) TREE_LANG_FLAG_0 (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Get the POINTER_TYPE to the METHOD_TYPE associated with this
|
|
|
|
|
pointer to member function. TYPE_PTRMEMFUNC_P _must_ be true,
|
1999-08-26 09:30:50 +00:00
|
|
|
|
before using this macro. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_PTRMEMFUNC_FN_TYPE(NODE) \
|
|
|
|
|
(TREE_TYPE (TYPE_FIELDS (NODE)))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* Returns `A' for a type like `int (A::*)(double)' */
|
|
|
|
|
#define TYPE_PTRMEMFUNC_OBJECT_TYPE(NODE) \
|
|
|
|
|
TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
|
|
|
|
|
|
|
|
|
|
/* These are use to manipulate the canonical RECORD_TYPE from the
|
|
|
|
|
hashed POINTER_TYPE, and can only be used on the POINTER_TYPE. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TYPE_GET_PTRMEMFUNC_TYPE(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(TYPE_LANG_SPECIFIC (NODE) ? LANG_TYPE_PTRMEM_CHECK (NODE)->record : NULL)
|
|
|
|
|
#define TYPE_SET_PTRMEMFUNC_TYPE(NODE, VALUE) \
|
|
|
|
|
do { \
|
|
|
|
|
if (TYPE_LANG_SPECIFIC (NODE) == NULL) \
|
|
|
|
|
{ \
|
|
|
|
|
TYPE_LANG_SPECIFIC (NODE) = \
|
|
|
|
|
ggc_alloc_cleared (sizeof (struct lang_type_ptrmem)); \
|
|
|
|
|
TYPE_LANG_SPECIFIC (NODE)->u.ptrmem.h.is_lang_type_class = 0; \
|
|
|
|
|
} \
|
|
|
|
|
TYPE_LANG_SPECIFIC (NODE)->u.ptrmem.record = (VALUE); \
|
|
|
|
|
} while (0)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Returns the pfn field from a TYPE_PTRMEMFUNC_P. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define PFN_FROM_PTRMEMFUNC(NODE) pfn_from_ptrmemfunc ((NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* For a pointer-to-member type of the form `T X::*', this is `X'.
|
|
|
|
|
For a type like `void (X::*)() const', this type is `X', not `const
|
|
|
|
|
X'. To get at the `const X' you have to look at the
|
|
|
|
|
TYPE_PTRMEM_POINTED_TO_TYPE; there, the first parameter will have
|
|
|
|
|
type `const X*'. */
|
|
|
|
|
#define TYPE_PTRMEM_CLASS_TYPE(NODE) \
|
|
|
|
|
(TYPE_PTRMEM_P (NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
? TYPE_OFFSET_BASETYPE (NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: TYPE_PTRMEMFUNC_OBJECT_TYPE (NODE))
|
|
|
|
|
|
|
|
|
|
/* For a pointer-to-member type of the form `T X::*', this is `T'. */
|
|
|
|
|
#define TYPE_PTRMEM_POINTED_TO_TYPE(NODE) \
|
|
|
|
|
(TYPE_PTRMEM_P (NODE) \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
? TREE_TYPE (NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
: TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (NODE)))
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* For a pointer-to-member constant `X::Y' this is the RECORD_TYPE for
|
|
|
|
|
`X'. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define PTRMEM_CST_CLASS(NODE) \
|
|
|
|
|
TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (PTRMEM_CST_CHECK (NODE)))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* For a pointer-to-member constant `X::Y' this is the _DECL for
|
1999-10-16 06:09:09 +00:00
|
|
|
|
`Y'. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define PTRMEM_CST_MEMBER(NODE) (((ptrmem_cst_t)PTRMEM_CST_CHECK (NODE))->member)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for VAR_DECL and FUNCTION_DECL node means that `extern' was
|
2002-02-01 18:16:02 +00:00
|
|
|
|
specified in its declaration. This can also be set for an
|
|
|
|
|
erroneously declared PARM_DECL. */
|
|
|
|
|
#define DECL_THIS_EXTERN(NODE) \
|
|
|
|
|
DECL_LANG_FLAG_2 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero for VAR_DECL and FUNCTION_DECL node means that `static' was
|
2002-02-01 18:16:02 +00:00
|
|
|
|
specified in its declaration. This can also be set for an
|
|
|
|
|
erroneously declared PARM_DECL. */
|
|
|
|
|
#define DECL_THIS_STATIC(NODE) \
|
|
|
|
|
DECL_LANG_FLAG_6 (VAR_FUNCTION_OR_PARM_DECL_CHECK (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if TYPE is an anonymous union or struct type. We have to use a
|
|
|
|
|
flag for this because "A union for which objects or pointers are
|
|
|
|
|
declared is not an anonymous union" [class.union]. */
|
|
|
|
|
#define ANON_AGGR_TYPE_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(CLASS_TYPE_P (NODE) && LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define SET_ANON_AGGR_TYPE_P(NODE) \
|
2003-07-11 03:40:53 +00:00
|
|
|
|
(LANG_TYPE_CLASS_CHECK (NODE)->anon_aggr = 1)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if TYPE is an anonymous union type. */
|
|
|
|
|
#define ANON_UNION_TYPE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == UNION_TYPE && ANON_AGGR_TYPE_P (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define UNKNOWN_TYPE LANG_TYPE
|
|
|
|
|
|
|
|
|
|
/* Define fields and accessors for nodes representing declared names. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define TYPE_WAS_ANONYMOUS(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->was_anonymous)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* C++: all of these are overloaded! These apply only to TYPE_DECLs. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* The format of each node in the DECL_FRIENDLIST is as follows:
|
|
|
|
|
|
|
|
|
|
The TREE_PURPOSE will be the name of a function, i.e., an
|
2004-07-28 03:11:36 +00:00
|
|
|
|
IDENTIFIER_NODE. The TREE_VALUE will be itself a TREE_LIST, whose
|
|
|
|
|
TREE_VALUEs are friends with the given name. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define DECL_FRIENDLIST(NODE) (DECL_INITIAL (NODE))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
#define FRIEND_NAME(LIST) (TREE_PURPOSE (LIST))
|
|
|
|
|
#define FRIEND_DECLS(LIST) (TREE_VALUE (LIST))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* The DECL_ACCESS, if non-NULL, is a TREE_LIST. The TREE_PURPOSE of
|
|
|
|
|
each node is a type; the TREE_VALUE is the access granted for this
|
|
|
|
|
DECL in that type. The DECL_ACCESS is set by access declarations.
|
|
|
|
|
For example, if a member that would normally be public in a
|
|
|
|
|
derived class is made protected, then the derived class and the
|
|
|
|
|
protected_access_node will appear in the DECL_ACCESS for the node. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define DECL_ACCESS(NODE) (LANG_DECL_U2_CHECK (NODE, 0)->access)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if the FUNCTION_DECL is a global constructor. */
|
|
|
|
|
#define DECL_GLOBAL_CTOR_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.global_ctor_p)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if the FUNCTION_DECL is a global destructor. */
|
|
|
|
|
#define DECL_GLOBAL_DTOR_P(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.global_dtor_p)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Accessor macros for C++ template decl nodes. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* The DECL_TEMPLATE_PARMS are a list. The TREE_PURPOSE of each node
|
2002-02-01 18:16:02 +00:00
|
|
|
|
is a INT_CST whose TREE_INT_CST_LOW indicates the level of the
|
1999-10-16 06:09:09 +00:00
|
|
|
|
template parameters, with 1 being the outermost set of template
|
|
|
|
|
parameters. The TREE_VALUE is a vector, whose elements are the
|
|
|
|
|
template parameters at each level. Each element in the vector is a
|
|
|
|
|
TREE_LIST, whose TREE_VALUE is a PARM_DECL (if the parameter is a
|
|
|
|
|
non-type parameter), or a TYPE_DECL (if the parameter is a type
|
|
|
|
|
parameter). The TREE_PURPOSE is the default value, if any. The
|
2004-07-28 03:11:36 +00:00
|
|
|
|
TEMPLATE_PARM_INDEX for the parameter is available as the
|
1999-10-16 06:09:09 +00:00
|
|
|
|
DECL_INITIAL (for a PARM_DECL) or as the TREE_TYPE (for a
|
|
|
|
|
TYPE_DECL). */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_PARMS(NODE) DECL_ARGUMENTS (NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_INNERMOST_TEMPLATE_PARMS(NODE) \
|
|
|
|
|
INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (NODE))
|
|
|
|
|
#define DECL_NTPARMS(NODE) \
|
|
|
|
|
TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* For function, method, class-data templates. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_RESULT(NODE) DECL_RESULT_FLD (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* For a static member variable template, the
|
|
|
|
|
DECL_TEMPLATE_INSTANTIATIONS list contains the explicitly and
|
|
|
|
|
implicitly generated instantiations of the variable. There are no
|
|
|
|
|
partial instantiations of static member variables, so all of these
|
|
|
|
|
will be full instantiations.
|
|
|
|
|
|
|
|
|
|
For a class template the DECL_TEMPLATE_INSTANTIATIONS lists holds
|
|
|
|
|
all instantiations and specializations of the class type, including
|
|
|
|
|
partial instantiations and partial specializations.
|
|
|
|
|
|
|
|
|
|
In both cases, the TREE_PURPOSE of each node contains the arguments
|
|
|
|
|
used; the TREE_VALUE contains the generated variable. The template
|
|
|
|
|
arguments are always complete. For example, given:
|
|
|
|
|
|
|
|
|
|
template <class T> struct S1 {
|
|
|
|
|
template <class U> struct S2 {};
|
|
|
|
|
template <class U> struct S2<U*> {};
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
the record for the partial specialization will contain, as its
|
|
|
|
|
argument list, { {T}, {U*} }, and will be on the
|
|
|
|
|
DECL_TEMPLATE_INSTANTIATIONS list for `template <class T> template
|
|
|
|
|
<class U> struct S1<T>::S2'.
|
|
|
|
|
|
|
|
|
|
This list is not used for function templates. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_INSTANTIATIONS(NODE) DECL_VINDEX (NODE)
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* For a function template, the DECL_TEMPLATE_SPECIALIZATIONS lists
|
|
|
|
|
contains all instantiations and specializations of the function,
|
|
|
|
|
including partial instantiations. For a partial instantiation
|
|
|
|
|
which is a specialization, this list holds only full
|
|
|
|
|
specializations of the template that are instantiations of the
|
|
|
|
|
partial instantiation. For example, given:
|
|
|
|
|
|
|
|
|
|
template <class T> struct S {
|
|
|
|
|
template <class U> void f(U);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
template <> void f(T);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
the `S<int>::f<int>(int)' function will appear on the
|
|
|
|
|
DECL_TEMPLATE_SPECIALIZATIONS list for both `template <class T>
|
|
|
|
|
template <class U> void S<T>::f(U)' and `template <class T> void
|
|
|
|
|
S<int>::f(T)'. In the latter case, however, it will have only the
|
|
|
|
|
innermost set of arguments (T, in this case). The DECL_TI_TEMPLATE
|
|
|
|
|
for the function declaration will point at the specialization, not
|
|
|
|
|
the fully general template.
|
|
|
|
|
|
|
|
|
|
For a class template, this list contains the partial
|
|
|
|
|
specializations of this template. (Full specializations are not
|
|
|
|
|
recorded on this list.) The TREE_PURPOSE holds the innermost
|
|
|
|
|
arguments used in the partial specialization (e.g., for `template
|
|
|
|
|
<class T> struct S<T*, int>' this will be `T*'.) The TREE_VALUE
|
|
|
|
|
holds the innermost template parameters for the specialization
|
|
|
|
|
(e.g., `T' in the example above.) The TREE_TYPE is the _TYPE node
|
|
|
|
|
for the partial specialization.
|
|
|
|
|
|
|
|
|
|
This list is not used for static variable templates. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_SPECIALIZATIONS(NODE) DECL_SIZE (NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Nonzero for a DECL which is actually a template parameter. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_PARM_P(NODE) \
|
|
|
|
|
(DECL_LANG_FLAG_0 (NODE) \
|
|
|
|
|
&& (TREE_CODE (NODE) == CONST_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == PARM_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == TYPE_DECL \
|
|
|
|
|
|| TREE_CODE (NODE) == TEMPLATE_DECL))
|
|
|
|
|
|
|
|
|
|
/* Mark NODE as a template parameter. */
|
|
|
|
|
#define SET_DECL_TEMPLATE_PARM_P(NODE) \
|
|
|
|
|
(DECL_LANG_FLAG_0 (NODE) = 1)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE is a template template parameter. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_TEMPLATE_TEMPLATE_PARM_P(NODE) \
|
1999-10-16 06:09:09 +00:00
|
|
|
|
(TREE_CODE (NODE) == TEMPLATE_DECL && DECL_TEMPLATE_PARM_P (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Nonzero if NODE is a TEMPLATE_DECL representing an
|
|
|
|
|
UNBOUND_CLASS_TEMPLATE tree node. */
|
|
|
|
|
#define DECL_UNBOUND_CLASS_TEMPLATE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TEMPLATE_DECL && !DECL_TEMPLATE_RESULT (NODE))
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_FUNCTION_TEMPLATE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TEMPLATE_DECL \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
&& !DECL_UNBOUND_CLASS_TEMPLATE_P (NODE) \
|
1999-08-26 09:30:50 +00:00
|
|
|
|
&& TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == FUNCTION_DECL)
|
|
|
|
|
|
|
|
|
|
/* Nonzero for a DECL that represents a template class. */
|
|
|
|
|
#define DECL_CLASS_TEMPLATE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TEMPLATE_DECL \
|
2004-07-28 03:11:36 +00:00
|
|
|
|
&& !DECL_UNBOUND_CLASS_TEMPLATE_P (NODE) \
|
1999-08-26 09:30:50 +00:00
|
|
|
|
&& TREE_CODE (DECL_TEMPLATE_RESULT (NODE)) == TYPE_DECL \
|
|
|
|
|
&& !DECL_TEMPLATE_TEMPLATE_PARM_P (NODE))
|
|
|
|
|
|
|
|
|
|
/* Nonzero if NODE which declares a type. */
|
|
|
|
|
#define DECL_DECLARES_TYPE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TYPE_DECL || DECL_CLASS_TEMPLATE_P (NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Nonzero if NODE is the typedef implicitly generated for a type when
|
2003-08-22 02:56:07 +00:00
|
|
|
|
the type is declared. In C++, `struct S {};' is roughly
|
|
|
|
|
equivalent to `struct S {}; typedef struct S S;' in C.
|
|
|
|
|
DECL_IMPLICIT_TYPEDEF_P will hold for the typedef indicated in this
|
|
|
|
|
example. In C++, there is a second implicit typedef for each
|
|
|
|
|
class, in the scope of `S' itself, so that you can say `S::S'.
|
|
|
|
|
DECL_SELF_REFERENCE_P will hold for that second typedef. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_IMPLICIT_TYPEDEF_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TYPE_DECL && DECL_LANG_FLAG_2 (NODE))
|
|
|
|
|
#define SET_DECL_IMPLICIT_TYPEDEF_P(NODE) \
|
|
|
|
|
(DECL_LANG_FLAG_2 (NODE) = 1)
|
2003-08-22 02:56:07 +00:00
|
|
|
|
#define DECL_SELF_REFERENCE_P(NODE) \
|
|
|
|
|
(TREE_CODE (NODE) == TYPE_DECL && DECL_LANG_FLAG_4 (NODE))
|
|
|
|
|
#define SET_DECL_SELF_REFERENCE_P(NODE) \
|
|
|
|
|
(DECL_LANG_FLAG_4 (NODE) = 1)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* A `primary' template is one that has its own template header. A
|
|
|
|
|
member function of a class template is a template, but not primary.
|
|
|
|
|
A member template is primary. Friend templates are primary, too. */
|
|
|
|
|
|
|
|
|
|
/* Returns the primary template corresponding to these parameters. */
|
|
|
|
|
#define DECL_PRIMARY_TEMPLATE(NODE) \
|
|
|
|
|
(TREE_TYPE (DECL_INNERMOST_TEMPLATE_PARMS (NODE)))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns nonzero if NODE is a primary template. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define PRIMARY_TEMPLATE_P(NODE) (DECL_PRIMARY_TEMPLATE (NODE) == (NODE))
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
#define CLASSTYPE_TEMPLATE_LEVEL(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(TREE_INT_CST_LOW (TREE_PURPOSE (CLASSTYPE_TI_TEMPLATE (NODE))))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Indicates whether or not (and how) a template was expanded for this
|
|
|
|
|
FUNCTION_DECL or VAR_DECL.
|
|
|
|
|
0=normal declaration, e.g. int min (int, int);
|
|
|
|
|
1=implicit template instantiation
|
|
|
|
|
2=explicit template specialization, e.g. int min<int> (int, int);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
3=explicit template instantiation, e.g. template int min<int> (int, int); */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_USE_TEMPLATE(NODE) (DECL_LANG_SPECIFIC (NODE)->decl_flags.use_template)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#define DECL_TEMPLATE_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) & 1)
|
|
|
|
|
#define CLASSTYPE_TEMPLATE_INSTANTIATION(NODE) \
|
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) & 1)
|
|
|
|
|
|
|
|
|
|
#define DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) == 2)
|
|
|
|
|
#define SET_DECL_TEMPLATE_SPECIALIZATION(NODE) (DECL_USE_TEMPLATE (NODE) = 2)
|
|
|
|
|
#define CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
|
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) == 2)
|
|
|
|
|
#define SET_CLASSTYPE_TEMPLATE_SPECIALIZATION(NODE) \
|
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) = 2)
|
|
|
|
|
|
|
|
|
|
#define DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 1)
|
|
|
|
|
#define SET_DECL_IMPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 1)
|
|
|
|
|
#define CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) == 1)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define SET_CLASSTYPE_IMPLICIT_INSTANTIATION(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) = 1)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#define DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) == 3)
|
|
|
|
|
#define SET_DECL_EXPLICIT_INSTANTIATION(NODE) (DECL_USE_TEMPLATE (NODE) = 3)
|
|
|
|
|
#define CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) == 3)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define SET_CLASSTYPE_EXPLICIT_INSTANTIATION(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(CLASSTYPE_USE_TEMPLATE (NODE) = 3)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero if DECL is a friend function which is an instantiation
|
1999-10-16 06:09:09 +00:00
|
|
|
|
from the point of view of the compiler, but not from the point of
|
|
|
|
|
view of the language. For example given:
|
|
|
|
|
template <class T> struct S { friend void f(T) {}; };
|
|
|
|
|
the declaration of `void f(int)' generated when S<int> is
|
|
|
|
|
instantiated will not be a DECL_TEMPLATE_INSTANTIATION, but will be
|
|
|
|
|
a DECL_FRIEND_PSUEDO_TEMPLATE_INSTANTIATION. */
|
|
|
|
|
#define DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION(DECL) \
|
|
|
|
|
(DECL_TEMPLATE_INFO (DECL) && !DECL_USE_TEMPLATE (DECL))
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Nonzero iff we are currently processing a declaration for an
|
1999-10-16 06:09:09 +00:00
|
|
|
|
entity with its own template parameter list, and which is not a
|
|
|
|
|
full specialization. */
|
|
|
|
|
#define PROCESSING_REAL_TEMPLATE_DECL_P() \
|
2003-08-22 02:56:07 +00:00
|
|
|
|
(processing_template_decl > template_class_depth (current_scope ()))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Nonzero if this VAR_DECL or FUNCTION_DECL has already been
|
|
|
|
|
instantiated, i.e. its definition has been generated from the
|
|
|
|
|
pattern given in the the template. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define DECL_TEMPLATE_INSTANTIATED(NODE) \
|
|
|
|
|
DECL_LANG_FLAG_1 (VAR_OR_FUNCTION_DECL_CHECK (NODE))
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* We know what we're doing with this decl now. */
|
|
|
|
|
#define DECL_INTERFACE_KNOWN(NODE) DECL_LANG_FLAG_5 (NODE)
|
|
|
|
|
|
|
|
|
|
/* DECL_EXTERNAL must be set on a decl until the decl is actually emitted,
|
|
|
|
|
so that assemble_external will work properly. So we have this flag to
|
|
|
|
|
tell us whether the decl is really not external. */
|
|
|
|
|
#define DECL_NOT_REALLY_EXTERN(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->decl_flags.not_really_extern)
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define DECL_REALLY_EXTERN(NODE) \
|
|
|
|
|
(DECL_EXTERNAL (NODE) && ! DECL_NOT_REALLY_EXTERN (NODE))
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* A thunk is a stub function.
|
|
|
|
|
|
|
|
|
|
A thunk is an alternate entry point for an ordinary FUNCTION_DECL.
|
|
|
|
|
The address of the ordinary FUNCTION_DECL is given by the
|
|
|
|
|
DECL_INITIAL, which is always an ADDR_EXPR whose operand is a
|
2004-07-28 03:11:36 +00:00
|
|
|
|
FUNCTION_DECL. The job of the thunk is to either adjust the this
|
|
|
|
|
pointer before transferring control to the FUNCTION_DECL, or call
|
|
|
|
|
FUNCTION_DECL and then adjust the result value. Note, the result
|
|
|
|
|
pointer adjusting thunk must perform a call to the thunked
|
|
|
|
|
function, (or be implemented via passing some invisible parameter
|
|
|
|
|
to the thunked function, which is modified to perform the
|
|
|
|
|
adjustment just before returning).
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
A thunk may perform either, or both, of the following operations:
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
o Adjust the this or result pointer by a constant offset.
|
|
|
|
|
o Adjust the this or result pointer by looking up a vcall or vbase offset
|
2002-02-01 18:16:02 +00:00
|
|
|
|
in the vtable.
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
A this pointer adjusting thunk converts from a base to a derived
|
|
|
|
|
class, and hence adds the offsets. A result pointer adjusting thunk
|
|
|
|
|
converts from a derived class to a base, and hence subtracts the
|
|
|
|
|
offsets. If both operations are performed, then the constant
|
|
|
|
|
adjustment is performed first for this pointer adjustment and last
|
|
|
|
|
for the result pointer adjustment.
|
|
|
|
|
|
|
|
|
|
The constant adjustment is given by THUNK_FIXED_OFFSET. If the
|
|
|
|
|
vcall or vbase offset is required, THUNK_VIRTUAL_OFFSET is
|
|
|
|
|
used. For this pointer adjusting thunks, it is the vcall offset
|
|
|
|
|
into the vtable. For result pointer adjusting thunks it is the
|
|
|
|
|
binfo of the virtual base to convert to. Use that binfo's vbase
|
|
|
|
|
offset.
|
|
|
|
|
|
|
|
|
|
It is possible to have equivalent covariant thunks. These are
|
|
|
|
|
distinct virtual covariant thunks whose vbase offsets happen to
|
|
|
|
|
have the same value. THUNK_ALIAS is used to pick one as the
|
|
|
|
|
canonical thunk, which will get all the this pointer adjusting
|
|
|
|
|
thunks attached to it. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* An integer indicating how many bytes should be subtracted from the
|
2004-07-28 03:11:36 +00:00
|
|
|
|
this or result pointer when this function is called. */
|
|
|
|
|
#define THUNK_FIXED_OFFSET(DECL) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (VAR_OR_FUNCTION_DECL_CHECK (DECL))->u.f.fixed_offset)
|
|
|
|
|
|
|
|
|
|
/* A tree indicating how to perform the virtual adjustment. For a this
|
|
|
|
|
adjusting thunk it is the number of bytes to be added to the vtable
|
|
|
|
|
to find the vcall offset. For a result adjusting thunk, it is the
|
|
|
|
|
binfo of the relevant virtual base. If NULL, then there is no
|
|
|
|
|
virtual adjust. (The vptr is always located at offset zero from
|
|
|
|
|
the this or result pointer.) (If the covariant type is within the
|
|
|
|
|
class hierarchy being laid out, the vbase index is not yet known
|
|
|
|
|
at the point we need to create the thunks, hence the need to use
|
|
|
|
|
binfos.) */
|
|
|
|
|
|
|
|
|
|
#define THUNK_VIRTUAL_OFFSET(DECL) \
|
|
|
|
|
(LANG_DECL_U2_CHECK (FUNCTION_DECL_CHECK (DECL), 0)->virtual_offset)
|
|
|
|
|
|
|
|
|
|
/* A thunk which is equivalent to another thunk. */
|
|
|
|
|
#define THUNK_ALIAS(DECL) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (DECL))->decl_flags.u.thunk_alias)
|
|
|
|
|
|
|
|
|
|
/* For thunk NODE, this is the FUNCTION_DECL thunked to. */
|
|
|
|
|
#define THUNK_TARGET(NODE) \
|
|
|
|
|
(DECL_LANG_SPECIFIC (NODE)->u.f.befriending_classes)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* These macros provide convenient access to the various _STMT nodes
|
|
|
|
|
created when parsing template declarations. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TRY_STMTS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 0)
|
|
|
|
|
#define TRY_HANDLERS(NODE) TREE_OPERAND (TRY_BLOCK_CHECK (NODE), 1)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define EH_SPEC_STMTS(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 0)
|
|
|
|
|
#define EH_SPEC_RAISES(NODE) TREE_OPERAND (EH_SPEC_BLOCK_CHECK (NODE), 1)
|
|
|
|
|
|
|
|
|
|
#define USING_STMT_NAMESPACE(NODE) TREE_OPERAND (USING_STMT_CHECK (NODE), 0)
|
|
|
|
|
|
|
|
|
|
/* Nonzero if this try block is a function try block. */
|
|
|
|
|
#define FN_TRY_BLOCK_P(NODE) TREE_LANG_FLAG_3 (TRY_BLOCK_CHECK (NODE))
|
|
|
|
|
#define HANDLER_PARMS(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 0)
|
|
|
|
|
#define HANDLER_BODY(NODE) TREE_OPERAND (HANDLER_CHECK (NODE), 1)
|
|
|
|
|
#define HANDLER_TYPE(NODE) TREE_TYPE (HANDLER_CHECK (NODE))
|
|
|
|
|
|
|
|
|
|
/* The parameters for a call-declarator. */
|
|
|
|
|
#define CALL_DECLARATOR_PARMS(NODE) \
|
|
|
|
|
(TREE_PURPOSE (TREE_OPERAND (NODE, 1)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The cv-qualifiers for a call-declarator. */
|
|
|
|
|
#define CALL_DECLARATOR_QUALS(NODE) \
|
|
|
|
|
(TREE_VALUE (TREE_OPERAND (NODE, 1)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The exception-specification for a call-declarator. */
|
|
|
|
|
#define CALL_DECLARATOR_EXCEPTION_SPEC(NODE) \
|
|
|
|
|
(TREE_TYPE (NODE))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* An enumeration of the kind of tags that C++ accepts. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
enum tag_types {
|
|
|
|
|
none_type = 0, /* Not a tag type. */
|
|
|
|
|
record_type, /* "struct" types. */
|
|
|
|
|
class_type, /* "class" types. */
|
|
|
|
|
union_type, /* "union" types. */
|
|
|
|
|
enum_type, /* "enum" types. */
|
|
|
|
|
typename_type /* "typename" types. */
|
|
|
|
|
};
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* The various kinds of lvalues we distinguish. */
|
|
|
|
|
typedef enum cp_lvalue_kind {
|
|
|
|
|
clk_none = 0, /* Things that are not an lvalue. */
|
|
|
|
|
clk_ordinary = 1, /* An ordinary lvalue. */
|
|
|
|
|
clk_class = 2, /* An rvalue of class-type. */
|
|
|
|
|
clk_bitfield = 4, /* An lvalue for a bit-field. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
clk_packed = 8 /* An lvalue for a packed field. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
} cp_lvalue_kind;
|
|
|
|
|
|
|
|
|
|
/* Various kinds of template specialization, instantiation, etc. */
|
|
|
|
|
typedef enum tmpl_spec_kind {
|
|
|
|
|
tsk_none, /* Not a template at all. */
|
|
|
|
|
tsk_invalid_member_spec, /* An explicit member template
|
|
|
|
|
specialization, but the enclosing
|
|
|
|
|
classes have not all been explicitly
|
|
|
|
|
specialized. */
|
|
|
|
|
tsk_invalid_expl_inst, /* An explicit instantiation containing
|
|
|
|
|
template parameter lists. */
|
|
|
|
|
tsk_excessive_parms, /* A template declaration with too many
|
|
|
|
|
template parameter lists. */
|
|
|
|
|
tsk_insufficient_parms, /* A template declaration with too few
|
|
|
|
|
parameter lists. */
|
|
|
|
|
tsk_template, /* A template declaration. */
|
|
|
|
|
tsk_expl_spec, /* An explicit specialization. */
|
|
|
|
|
tsk_expl_inst /* An explicit instantiation. */
|
|
|
|
|
} tmpl_spec_kind;
|
|
|
|
|
|
|
|
|
|
/* The various kinds of access. BINFO_ACCESS depends on these being
|
|
|
|
|
two bit quantities. The numerical values are important; they are
|
|
|
|
|
used to initialize RTTI data structures, so changing them changes
|
|
|
|
|
the ABI. */
|
|
|
|
|
typedef enum access_kind {
|
|
|
|
|
ak_none = 0, /* Inaccessible. */
|
|
|
|
|
ak_public = 1, /* Accessible, as a `public' thing. */
|
|
|
|
|
ak_protected = 2, /* Accessible, as a `protected' thing. */
|
|
|
|
|
ak_private = 3 /* Accessible, as a `private' thing. */
|
|
|
|
|
} access_kind;
|
|
|
|
|
|
|
|
|
|
/* The various kinds of special functions. If you add to this list,
|
|
|
|
|
you should update special_function_p as well. */
|
|
|
|
|
typedef enum special_function_kind {
|
|
|
|
|
sfk_none = 0, /* Not a special function. This enumeral
|
|
|
|
|
must have value zero; see
|
|
|
|
|
special_function_p. */
|
|
|
|
|
sfk_constructor, /* A constructor. */
|
|
|
|
|
sfk_copy_constructor, /* A copy constructor. */
|
|
|
|
|
sfk_assignment_operator, /* An assignment operator. */
|
|
|
|
|
sfk_destructor, /* A destructor. */
|
|
|
|
|
sfk_complete_destructor, /* A destructor for complete objects. */
|
|
|
|
|
sfk_base_destructor, /* A destructor for base subobjects. */
|
|
|
|
|
sfk_deleting_destructor, /* A destructor for complete objects that
|
|
|
|
|
deletes the object after it has been
|
|
|
|
|
destroyed. */
|
|
|
|
|
sfk_conversion /* A conversion operator. */
|
|
|
|
|
} special_function_kind;
|
|
|
|
|
|
|
|
|
|
/* The various kinds of linkage. From [basic.link],
|
|
|
|
|
|
|
|
|
|
A name is said to have linkage when it might denote the same
|
|
|
|
|
object, reference, function, type, template, namespace or value
|
|
|
|
|
as a name introduced in another scope:
|
|
|
|
|
|
|
|
|
|
-- When a name has external linkage, the entity it denotes can
|
|
|
|
|
be referred to from scopes of other translation units or from
|
|
|
|
|
other scopes of the same translation unit.
|
|
|
|
|
|
|
|
|
|
-- When a name has internal linkage, the entity it denotes can
|
|
|
|
|
be referred to by names from other scopes in the same
|
|
|
|
|
translation unit.
|
|
|
|
|
|
|
|
|
|
-- When a name has no linkage, the entity it denotes cannot be
|
|
|
|
|
referred to by names from other scopes. */
|
|
|
|
|
|
|
|
|
|
typedef enum linkage_kind {
|
|
|
|
|
lk_none, /* No linkage. */
|
|
|
|
|
lk_internal, /* Internal linkage. */
|
|
|
|
|
lk_external /* External linkage. */
|
|
|
|
|
} linkage_kind;
|
|
|
|
|
|
2002-05-09 20:02:13 +00:00
|
|
|
|
/* Bitmask flags to control type substitution. */
|
|
|
|
|
typedef enum tsubst_flags_t {
|
|
|
|
|
tf_none = 0, /* nothing special */
|
|
|
|
|
tf_error = 1 << 0, /* give error messages */
|
|
|
|
|
tf_warning = 1 << 1, /* give warnings too */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tf_ignore_bad_quals = 1 << 2, /* ignore bad cvr qualifiers */
|
|
|
|
|
tf_keep_type_decl = 1 << 3, /* retain typedef type decls
|
2002-05-09 20:02:13 +00:00
|
|
|
|
(make_typename_type use) */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tf_ptrmem_ok = 1 << 4, /* pointers to member ok (internal
|
|
|
|
|
instantiate_type use) */
|
|
|
|
|
tf_user = 1 << 5, /* found template must be a user template
|
|
|
|
|
(lookup_template_class use) */
|
|
|
|
|
tf_stmt_expr_cmpd = 1 << 6, /* tsubsting the compound statement of
|
|
|
|
|
a statement expr. */
|
|
|
|
|
tf_stmt_expr_body = 1 << 7, /* tsubsting the statements in the
|
|
|
|
|
body of the compound statement of a
|
|
|
|
|
statement expr. */
|
|
|
|
|
tf_conv = 1 << 8 /* We are determining what kind of
|
|
|
|
|
conversion might be permissible,
|
|
|
|
|
not actually performing the
|
|
|
|
|
conversion. */
|
2002-05-09 20:02:13 +00:00
|
|
|
|
} tsubst_flags_t;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The kind of checking we can do looking in a class hierarchy. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
typedef enum base_access {
|
|
|
|
|
ba_any = 0, /* Do not check access, allow an ambiguous base,
|
|
|
|
|
prefer a non-virtual base */
|
|
|
|
|
ba_ignore = 1, /* Do not check access */
|
|
|
|
|
ba_check = 2, /* Check access */
|
|
|
|
|
ba_not_special = 3, /* Do not consider special privilege
|
2003-07-11 03:40:53 +00:00
|
|
|
|
current_class_type might give. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ba_quiet = 4 /* Do not issue error messages (bit mask). */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
} base_access;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* The various kinds of access check during parsing. */
|
|
|
|
|
typedef enum deferring_kind {
|
|
|
|
|
dk_no_deferred = 0, /* Check access immediately */
|
|
|
|
|
dk_deferred = 1, /* Deferred check */
|
|
|
|
|
dk_no_check = 2 /* No access check */
|
|
|
|
|
} deferring_kind;
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The kind of base we can find, looking in a class hierarchy.
|
2003-07-11 03:40:53 +00:00
|
|
|
|
Values <0 indicate we failed. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
typedef enum base_kind {
|
|
|
|
|
bk_inaccessible = -3, /* The base is inaccessible */
|
|
|
|
|
bk_ambig = -2, /* The base is ambiguous */
|
|
|
|
|
bk_not_base = -1, /* It is not a base */
|
|
|
|
|
bk_same_type = 0, /* It is the same type */
|
|
|
|
|
bk_proper_base = 1, /* It is a proper base */
|
|
|
|
|
bk_via_virtual = 2 /* It is a proper base, but via a virtual
|
|
|
|
|
path. This might not be the canonical
|
2003-07-11 03:40:53 +00:00
|
|
|
|
binfo. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
} base_kind;
|
|
|
|
|
|
|
|
|
|
/* Set by add_implicitly_declared_members() to keep those members from
|
|
|
|
|
being flagged as deprecated or reported as using deprecated
|
|
|
|
|
types. */
|
|
|
|
|
extern int adding_implicit_members;
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* in decl{2}.c */
|
|
|
|
|
/* A node that is a list (length 1) of error_mark_nodes. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) tree error_mark_list;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Node for "pointer to (virtual) function".
|
1999-08-26 09:30:50 +00:00
|
|
|
|
This may be distinct from ptr_type_node so gdb can distinguish them. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define vfunc_ptr_type_node vtable_entry_type
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* For building calls to `delete'. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) tree integer_two_node;
|
|
|
|
|
extern GTY(()) tree integer_three_node;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* The number of function bodies which we are currently processing.
|
|
|
|
|
(Zero if we are at namespace scope, one inside the body of a
|
|
|
|
|
function, two inside the body of a function in a local class, etc.) */
|
|
|
|
|
extern int function_depth;
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
typedef struct deferred_access GTY(())
|
|
|
|
|
{
|
|
|
|
|
/* A TREE_LIST representing name-lookups for which we have deferred
|
|
|
|
|
checking access controls. We cannot check the accessibility of
|
|
|
|
|
names used in a decl-specifier-seq until we know what is being
|
|
|
|
|
declared because code like:
|
|
|
|
|
|
|
|
|
|
class A {
|
|
|
|
|
class B {};
|
|
|
|
|
B* f();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
A::B* A::f() { return 0; }
|
|
|
|
|
|
|
|
|
|
is valid, even though `A::B' is not generally accessible.
|
|
|
|
|
|
|
|
|
|
The TREE_PURPOSE of each node is the scope used to qualify the
|
|
|
|
|
name being looked up; the TREE_VALUE is the DECL to which the
|
|
|
|
|
name was resolved. */
|
|
|
|
|
tree deferred_access_checks;
|
|
|
|
|
/* The current mode of access checks. */
|
|
|
|
|
enum deferring_kind deferring_access_checks_kind;
|
|
|
|
|
/* The next deferred access data in stack or linked-list. */
|
|
|
|
|
struct deferred_access *next;
|
|
|
|
|
} deferred_access;
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* in pt.c */
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* These values are used for the `STRICT' parameter to type_unification and
|
1999-08-26 09:30:50 +00:00
|
|
|
|
fn_type_unification. Their meanings are described with the
|
|
|
|
|
documentation for fn_type_unification. */
|
|
|
|
|
|
|
|
|
|
typedef enum unification_kind_t {
|
|
|
|
|
DEDUCE_CALL,
|
|
|
|
|
DEDUCE_CONV,
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DEDUCE_EXACT,
|
|
|
|
|
DEDUCE_ORDER
|
1999-08-26 09:30:50 +00:00
|
|
|
|
} unification_kind_t;
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Macros for operating on a template instantiation level node, represented
|
|
|
|
|
by an EXPR_WITH_FILE_LOCATION. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TINST_DECL(NODE) EXPR_WFL_NODE (NODE)
|
|
|
|
|
#define TINST_LINE(NODE) EXPR_WFL_LINENO (NODE)
|
|
|
|
|
#define TINST_FILE(NODE) EXPR_WFL_FILENAME (NODE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* in class.c */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
extern int current_class_depth;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* An array of all local classes present in this translation unit, in
|
|
|
|
|
declaration order. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) varray_type local_classes;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Here's where we control how name mangling takes place. */
|
|
|
|
|
|
|
|
|
|
/* Cannot use '$' up front, because this confuses gdb
|
|
|
|
|
(names beginning with '$' are gdb-local identifiers).
|
|
|
|
|
|
|
|
|
|
Note that all forms in which the '$' is significant are long enough
|
|
|
|
|
for direct indexing (meaning that if we know there is a '$'
|
|
|
|
|
at a particular location, we can index into the string at
|
|
|
|
|
any other location that provides distinguishing characters). */
|
|
|
|
|
|
|
|
|
|
/* Define NO_DOLLAR_IN_LABEL in your favorite tm file if your assembler
|
|
|
|
|
doesn't allow '$' in symbol names. */
|
|
|
|
|
#ifndef NO_DOLLAR_IN_LABEL
|
|
|
|
|
|
|
|
|
|
#define JOINER '$'
|
|
|
|
|
|
|
|
|
|
#define VPTR_NAME "$v"
|
|
|
|
|
#define THROW_NAME "$eh_throw"
|
|
|
|
|
#define AUTO_VTABLE_NAME "__vtbl$me__"
|
|
|
|
|
#define AUTO_TEMP_NAME "_$tmp_"
|
|
|
|
|
#define AUTO_TEMP_FORMAT "_$tmp_%d"
|
|
|
|
|
#define VTABLE_BASE "$vb"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define VTABLE_NAME_PREFIX "__vt_"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define VFIELD_BASE "$vf"
|
|
|
|
|
#define VFIELD_NAME "_vptr$"
|
|
|
|
|
#define VFIELD_NAME_FORMAT "_vptr$%s"
|
|
|
|
|
#define STATIC_NAME_FORMAT "_%s$%s"
|
|
|
|
|
#define ANON_AGGRNAME_FORMAT "$_%d"
|
|
|
|
|
|
|
|
|
|
#else /* NO_DOLLAR_IN_LABEL */
|
|
|
|
|
|
|
|
|
|
#ifndef NO_DOT_IN_LABEL
|
|
|
|
|
|
|
|
|
|
#define JOINER '.'
|
|
|
|
|
|
|
|
|
|
#define VPTR_NAME ".v"
|
|
|
|
|
#define THROW_NAME ".eh_throw"
|
|
|
|
|
#define AUTO_VTABLE_NAME "__vtbl.me__"
|
|
|
|
|
#define AUTO_TEMP_NAME "_.tmp_"
|
|
|
|
|
#define AUTO_TEMP_FORMAT "_.tmp_%d"
|
|
|
|
|
#define VTABLE_BASE ".vb"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define VTABLE_NAME_PREFIX "__vt_"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define VFIELD_BASE ".vf"
|
|
|
|
|
#define VFIELD_NAME "_vptr."
|
|
|
|
|
#define VFIELD_NAME_FORMAT "_vptr.%s"
|
|
|
|
|
#define STATIC_NAME_FORMAT "_%s.%s"
|
|
|
|
|
|
|
|
|
|
#define ANON_AGGRNAME_FORMAT "._%d"
|
|
|
|
|
|
|
|
|
|
#else /* NO_DOT_IN_LABEL */
|
|
|
|
|
|
|
|
|
|
#define VPTR_NAME "__vptr"
|
|
|
|
|
#define VPTR_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), VPTR_NAME, sizeof (VPTR_NAME) - 1))
|
|
|
|
|
#define THROW_NAME "__eh_throw"
|
|
|
|
|
#define IN_CHARGE_NAME "__in_chrg"
|
|
|
|
|
#define AUTO_VTABLE_NAME "__vtbl_me__"
|
|
|
|
|
#define AUTO_TEMP_NAME "__tmp_"
|
|
|
|
|
#define TEMP_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), AUTO_TEMP_NAME, \
|
|
|
|
|
sizeof (AUTO_TEMP_NAME) - 1))
|
|
|
|
|
#define AUTO_TEMP_FORMAT "__tmp_%d"
|
|
|
|
|
#define VTABLE_BASE "__vtb"
|
|
|
|
|
#define VTABLE_NAME "__vt_"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define VTABLE_NAME_PREFIX "__vt_"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define VTABLE_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), VTABLE_NAME, \
|
|
|
|
|
sizeof (VTABLE_NAME) - 1))
|
|
|
|
|
#define VFIELD_BASE "__vfb"
|
|
|
|
|
#define VFIELD_NAME "__vptr_"
|
|
|
|
|
#define VFIELD_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, \
|
|
|
|
|
sizeof (VFIELD_NAME) - 1))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define VFIELD_NAME_FORMAT "__vptr_%s"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define STATIC_NAME_FORMAT "__static_%s_%s"
|
|
|
|
|
|
|
|
|
|
#define ANON_AGGRNAME_PREFIX "__anon_"
|
|
|
|
|
#define ANON_AGGRNAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
|
|
|
|
|
sizeof (ANON_AGGRNAME_PREFIX) - 1))
|
|
|
|
|
#define ANON_AGGRNAME_FORMAT "__anon_%d"
|
|
|
|
|
|
|
|
|
|
#endif /* NO_DOT_IN_LABEL */
|
|
|
|
|
#endif /* NO_DOLLAR_IN_LABEL */
|
|
|
|
|
|
|
|
|
|
#define THIS_NAME "this"
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define CTOR_NAME "__ct"
|
|
|
|
|
#define DTOR_NAME "__dt"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#define IN_CHARGE_NAME "__in_chrg"
|
|
|
|
|
|
|
|
|
|
#define VTBL_PTR_TYPE "__vtbl_ptr_type"
|
|
|
|
|
#define VTABLE_DELTA_NAME "__delta"
|
|
|
|
|
#define VTABLE_PFN_NAME "__pfn"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define EXCEPTION_CLEANUP_NAME "exception cleanup"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#if !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL)
|
|
|
|
|
|
|
|
|
|
#define VPTR_NAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == JOINER \
|
|
|
|
|
&& IDENTIFIER_POINTER (ID_NODE)[1] == 'v')
|
|
|
|
|
|
|
|
|
|
#define VTABLE_NAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[1] == 'v' \
|
|
|
|
|
&& IDENTIFIER_POINTER (ID_NODE)[2] == 't' \
|
|
|
|
|
&& IDENTIFIER_POINTER (ID_NODE)[3] == JOINER)
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TEMP_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), AUTO_TEMP_NAME, sizeof (AUTO_TEMP_NAME)-1))
|
|
|
|
|
#define VFIELD_NAME_P(ID_NODE) \
|
|
|
|
|
(!strncmp (IDENTIFIER_POINTER (ID_NODE), VFIELD_NAME, sizeof(VFIELD_NAME)-1))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* For anonymous aggregate types, we need some sort of name to
|
|
|
|
|
hold on to. In practice, this should not appear, but it should
|
|
|
|
|
not be harmful if it does. */
|
|
|
|
|
#define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == JOINER \
|
|
|
|
|
&& IDENTIFIER_POINTER (ID_NODE)[1] == '_')
|
|
|
|
|
#endif /* !defined(NO_DOLLAR_IN_LABEL) || !defined(NO_DOT_IN_LABEL) */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Returns nonzero iff NODE is a declaration for the global function
|
1999-08-26 09:30:50 +00:00
|
|
|
|
`main'. */
|
|
|
|
|
#define DECL_MAIN_P(NODE) \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
(DECL_EXTERN_C_FUNCTION_P (NODE) \
|
1999-08-26 09:30:50 +00:00
|
|
|
|
&& DECL_NAME (NODE) != NULL_TREE \
|
|
|
|
|
&& MAIN_NAME_P (DECL_NAME (NODE)))
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Nonzero if we're done parsing and into end-of-file activities. */
|
|
|
|
|
|
|
|
|
|
extern int at_eof;
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* A list of namespace-scope objects which have constructors or
|
|
|
|
|
destructors which reside in the global scope. The decl is stored
|
|
|
|
|
in the TREE_VALUE slot and the initializer is stored in the
|
|
|
|
|
TREE_PURPOSE slot. */
|
|
|
|
|
extern GTY(()) tree static_aggregates;
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Functions called along with real static constructors and destructors. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern GTY(()) tree static_ctors;
|
|
|
|
|
extern GTY(()) tree static_dtors;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
enum overload_flags { NO_SPECIAL = 0, DTOR_FLAG, OP_FLAG, TYPENAME_FLAG };
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Some macros for char-based bitfields. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define B_SET(A,X) ((A)[(X)>>3] |= (1 << ((X)&7)))
|
|
|
|
|
#define B_CLR(A,X) ((A)[(X)>>3] &= ~(1 << ((X)&7)))
|
|
|
|
|
#define B_TST(A,X) ((A)[(X)>>3] & (1 << ((X)&7)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* These are uses as bits in flags passed to build_new_method_call
|
1996-09-18 05:35:50 +00:00
|
|
|
|
to control its error reporting behavior.
|
|
|
|
|
|
|
|
|
|
LOOKUP_PROTECT means flag access violations.
|
|
|
|
|
LOOKUP_COMPLAIN mean complain if no suitable member function
|
|
|
|
|
matching the arguments is found.
|
|
|
|
|
LOOKUP_NORMAL is just a combination of these two.
|
|
|
|
|
LOOKUP_NONVIRTUAL means make a direct call to the member function found
|
|
|
|
|
LOOKUP_GLOBAL means search through the space of overloaded functions,
|
|
|
|
|
as well as the space of member functions.
|
|
|
|
|
LOOKUP_ONLYCONVERTING means that non-conversion constructors are not tried.
|
1999-08-26 09:30:50 +00:00
|
|
|
|
DIRECT_BIND means that if a temporary is created, it should be created so
|
|
|
|
|
that it lives as long as the current variable bindings; otherwise it
|
2002-02-01 18:16:02 +00:00
|
|
|
|
only lives until the end of the complete-expression. It also forces
|
|
|
|
|
direct-initialization in cases where other parts of the compiler have
|
|
|
|
|
already generated a temporary, such as reference initialization and the
|
|
|
|
|
catch parameter.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
LOOKUP_SPECULATIVELY means return NULL_TREE if we cannot find what we are
|
|
|
|
|
after. Note, LOOKUP_COMPLAIN is checked and error messages printed
|
|
|
|
|
before LOOKUP_SPECULATIVELY is checked.
|
|
|
|
|
LOOKUP_NO_CONVERSION means that user-defined conversions are not
|
|
|
|
|
permitted. Built-in conversions are permitted.
|
1999-08-26 09:30:50 +00:00
|
|
|
|
LOOKUP_DESTRUCTOR means explicit call to destructor.
|
|
|
|
|
LOOKUP_NO_TEMP_BIND means temporaries will not be bound to references.
|
|
|
|
|
|
|
|
|
|
These are used in global lookup to support elaborated types and
|
|
|
|
|
qualifiers.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
LOOKUP_PREFER_TYPES means not to accept objects, and possibly namespaces.
|
|
|
|
|
LOOKUP_PREFER_NAMESPACES means not to accept objects, and possibly types.
|
2004-07-28 03:11:36 +00:00
|
|
|
|
LOOKUP_PREFER_BOTH means class-or-namespace-name. */
|
|
|
|
|
|
|
|
|
|
#define LOOKUP_PROTECT (1 << 0)
|
|
|
|
|
#define LOOKUP_COMPLAIN (1 << 1)
|
|
|
|
|
#define LOOKUP_NORMAL (LOOKUP_PROTECT | LOOKUP_COMPLAIN)
|
|
|
|
|
#define LOOKUP_NONVIRTUAL (1 << 2)
|
|
|
|
|
#define LOOKUP_GLOBAL (1 << 3)
|
|
|
|
|
#define LOOKUP_SPECULATIVELY (1 << 4)
|
|
|
|
|
#define LOOKUP_ONLYCONVERTING (1 << 5)
|
|
|
|
|
#define DIRECT_BIND (1 << 6)
|
|
|
|
|
#define LOOKUP_NO_CONVERSION (1 << 7)
|
|
|
|
|
#define LOOKUP_DESTRUCTOR (1 << 8)
|
|
|
|
|
#define LOOKUP_NO_TEMP_BIND (1 << 9)
|
|
|
|
|
#define LOOKUP_PREFER_TYPES (1 << 10)
|
|
|
|
|
#define LOOKUP_PREFER_NAMESPACES (1 << 11)
|
|
|
|
|
#define LOOKUP_PREFER_BOTH (LOOKUP_PREFER_TYPES | LOOKUP_PREFER_NAMESPACES)
|
|
|
|
|
#define LOOKUP_CONSTRUCTOR_CALLABLE (1 << 12)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define LOOKUP_NAMESPACES_ONLY(F) \
|
|
|
|
|
(((F) & LOOKUP_PREFER_NAMESPACES) && !((F) & LOOKUP_PREFER_TYPES))
|
|
|
|
|
#define LOOKUP_TYPES_ONLY(F) \
|
|
|
|
|
(!((F) & LOOKUP_PREFER_NAMESPACES) && ((F) & LOOKUP_PREFER_TYPES))
|
|
|
|
|
#define LOOKUP_QUALIFIERS_ONLY(F) ((F) & LOOKUP_PREFER_BOTH)
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* These flags are used by the conversion code.
|
|
|
|
|
CONV_IMPLICIT : Perform implicit conversions (standard and user-defined).
|
|
|
|
|
CONV_STATIC : Perform the explicit conversions for static_cast.
|
|
|
|
|
CONV_CONST : Perform the explicit conversions for const_cast.
|
|
|
|
|
CONV_REINTERPRET: Perform the explicit conversions for reinterpret_cast.
|
|
|
|
|
CONV_PRIVATE : Perform upcasts to private bases.
|
|
|
|
|
CONV_FORCE_TEMP : Require a new temporary when converting to the same
|
2002-02-01 18:16:02 +00:00
|
|
|
|
aggregate type. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#define CONV_IMPLICIT 1
|
|
|
|
|
#define CONV_STATIC 2
|
|
|
|
|
#define CONV_CONST 4
|
|
|
|
|
#define CONV_REINTERPRET 8
|
|
|
|
|
#define CONV_PRIVATE 16
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* #define CONV_NONCONVERTING 32 */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#define CONV_FORCE_TEMP 64
|
|
|
|
|
#define CONV_STATIC_CAST (CONV_IMPLICIT | CONV_STATIC | CONV_FORCE_TEMP)
|
|
|
|
|
#define CONV_OLD_CONVERT (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
|
|
|
|
|
| CONV_REINTERPRET)
|
|
|
|
|
#define CONV_C_CAST (CONV_IMPLICIT | CONV_STATIC | CONV_CONST \
|
|
|
|
|
| CONV_REINTERPRET | CONV_PRIVATE | CONV_FORCE_TEMP)
|
|
|
|
|
|
|
|
|
|
/* Used by build_expr_type_conversion to indicate which types are
|
|
|
|
|
acceptable as arguments to the expression under consideration. */
|
|
|
|
|
|
|
|
|
|
#define WANT_INT 1 /* integer types, including bool */
|
|
|
|
|
#define WANT_FLOAT 2 /* floating point types */
|
|
|
|
|
#define WANT_ENUM 4 /* enumerated types */
|
|
|
|
|
#define WANT_POINTER 8 /* pointer types */
|
|
|
|
|
#define WANT_NULL 16 /* null pointer constant */
|
|
|
|
|
#define WANT_ARITH (WANT_INT | WANT_FLOAT)
|
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* Used with comptypes, and related functions, to guide type
|
|
|
|
|
comparison. */
|
|
|
|
|
|
|
|
|
|
#define COMPARE_STRICT 0 /* Just check if the types are the
|
|
|
|
|
same. */
|
|
|
|
|
#define COMPARE_BASE 1 /* Check to see if the second type is
|
2004-07-28 03:11:36 +00:00
|
|
|
|
derived from the first. */
|
|
|
|
|
#define COMPARE_DERIVED 2 /* Like COMPARE_BASE, but in
|
|
|
|
|
reverse. */
|
|
|
|
|
#define COMPARE_REDECLARATION 4 /* The comparison is being done when
|
1999-10-16 06:09:09 +00:00
|
|
|
|
another declaration of an existing
|
|
|
|
|
entity is seen. */
|
|
|
|
|
|
|
|
|
|
/* Used with push_overloaded_decl. */
|
|
|
|
|
#define PUSH_GLOBAL 0 /* Push the DECL into namespace scope,
|
|
|
|
|
regardless of the current scope. */
|
|
|
|
|
#define PUSH_LOCAL 1 /* Push the DECL into the current
|
|
|
|
|
scope. */
|
|
|
|
|
#define PUSH_USING 2 /* We are pushing this DECL as the
|
|
|
|
|
result of a using declaration. */
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Used with start function. */
|
|
|
|
|
#define SF_DEFAULT 0 /* No flags. */
|
|
|
|
|
#define SF_PRE_PARSED 1 /* The function declaration has
|
|
|
|
|
already been parsed. */
|
|
|
|
|
#define SF_INCLASS_INLINE 2 /* The function is an inline, defined
|
|
|
|
|
in the class body. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
|
|
|
|
/* Returns nonzero iff TYPE1 and TYPE2 are the same type, or if TYPE2
|
|
|
|
|
is derived from TYPE1, or if TYPE2 is a pointer (reference) to a
|
|
|
|
|
class derived from the type pointed to (referred to) by TYPE1. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define same_or_base_type_p(TYPE1, TYPE2) \
|
|
|
|
|
comptypes ((TYPE1), (TYPE2), COMPARE_BASE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* These macros are used to access a TEMPLATE_PARM_INDEX. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TEMPLATE_PARM_INDEX_CAST(NODE) \
|
|
|
|
|
((template_parm_index*)TEMPLATE_PARM_INDEX_CHECK (NODE))
|
|
|
|
|
#define TEMPLATE_PARM_IDX(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->index)
|
|
|
|
|
#define TEMPLATE_PARM_LEVEL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->level)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define TEMPLATE_PARM_DESCENDANTS(NODE) (TREE_CHAIN (NODE))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define TEMPLATE_PARM_ORIG_LEVEL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->orig_level)
|
|
|
|
|
#define TEMPLATE_PARM_DECL(NODE) (TEMPLATE_PARM_INDEX_CAST (NODE)->decl)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* These macros are for accessing the fields of TEMPLATE_TYPE_PARM,
|
|
|
|
|
TEMPLATE_TEMPLATE_PARM and BOUND_TEMPLATE_TEMPLATE_PARM nodes. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#define TEMPLATE_TYPE_PARM_INDEX(NODE) (TYPE_FIELDS (NODE))
|
|
|
|
|
#define TEMPLATE_TYPE_IDX(NODE) \
|
|
|
|
|
(TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (NODE)))
|
|
|
|
|
#define TEMPLATE_TYPE_LEVEL(NODE) \
|
|
|
|
|
(TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
|
|
|
|
|
#define TEMPLATE_TYPE_ORIG_LEVEL(NODE) \
|
|
|
|
|
(TEMPLATE_PARM_ORIG_LEVEL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
|
|
|
|
|
#define TEMPLATE_TYPE_DECL(NODE) \
|
|
|
|
|
(TEMPLATE_PARM_DECL (TEMPLATE_TYPE_PARM_INDEX (NODE)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* These constants can used as bit flags in the process of tree formatting.
|
|
|
|
|
|
|
|
|
|
TFF_PLAIN_IDENTIFIER: unqualified part of a name.
|
|
|
|
|
TFF_SCOPE: include the class and namespace scope of the name.
|
|
|
|
|
TFF_CHASE_TYPEDEF: print the original type-id instead of the typedef-name.
|
|
|
|
|
TFF_DECL_SPECIFIERS: print decl-specifiers.
|
|
|
|
|
TFF_CLASS_KEY_OR_ENUM: precede a class-type name (resp. enum name) with
|
|
|
|
|
a class-key (resp. `enum').
|
|
|
|
|
TFF_RETURN_TYPE: include function return type.
|
|
|
|
|
TFF_FUNCTION_DEFAULT_ARGUMENTS: include function default parameter values.
|
|
|
|
|
TFF_EXCEPTION_SPECIFICATION: show function exception specification.
|
|
|
|
|
TFF_TEMPLATE_HEADER: show the template<...> header in a
|
|
|
|
|
template-declaration.
|
|
|
|
|
TFF_TEMPLATE_NAME: show only template-name.
|
2004-07-28 03:11:36 +00:00
|
|
|
|
TFF_EXPR_IN_PARENS: parenthesize expressions.
|
|
|
|
|
TFF_NO_FUNCTION_ARGUMENTS: don't show function arguments. */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
#define TFF_PLAIN_IDENTIFIER (0)
|
|
|
|
|
#define TFF_SCOPE (1)
|
|
|
|
|
#define TFF_CHASE_TYPEDEF (1 << 1)
|
|
|
|
|
#define TFF_DECL_SPECIFIERS (1 << 2)
|
|
|
|
|
#define TFF_CLASS_KEY_OR_ENUM (1 << 3)
|
|
|
|
|
#define TFF_RETURN_TYPE (1 << 4)
|
|
|
|
|
#define TFF_FUNCTION_DEFAULT_ARGUMENTS (1 << 5)
|
|
|
|
|
#define TFF_EXCEPTION_SPECIFICATION (1 << 6)
|
|
|
|
|
#define TFF_TEMPLATE_HEADER (1 << 7)
|
|
|
|
|
#define TFF_TEMPLATE_NAME (1 << 8)
|
|
|
|
|
#define TFF_EXPR_IN_PARENS (1 << 9)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define TFF_NO_FUNCTION_ARGUMENTS (1 << 10)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* Returns the TEMPLATE_DECL associated to a TEMPLATE_TEMPLATE_PARM
|
|
|
|
|
node. */
|
|
|
|
|
#define TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL(NODE) \
|
|
|
|
|
((TREE_CODE (NODE) == BOUND_TEMPLATE_TEMPLATE_PARM) \
|
|
|
|
|
? TYPE_TI_TEMPLATE (NODE) \
|
|
|
|
|
: TYPE_NAME (NODE))
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* in lex.c */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void init_reswords (void);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Indexed by TREE_CODE, these tables give C-looking names to
|
|
|
|
|
operators represented by TREE_CODES. For example,
|
|
|
|
|
opname_tab[(int) MINUS_EXPR] == "-". */
|
2002-02-01 18:16:02 +00:00
|
|
|
|
extern const char **opname_tab, **assignop_tab;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
typedef struct operator_name_info_t GTY(())
|
2002-02-01 18:16:02 +00:00
|
|
|
|
{
|
|
|
|
|
/* The IDENTIFIER_NODE for the operator. */
|
|
|
|
|
tree identifier;
|
|
|
|
|
/* The name of the operator. */
|
|
|
|
|
const char *name;
|
|
|
|
|
/* The mangled name of the operator. */
|
|
|
|
|
const char *mangled_name;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* The arity of the operator. */
|
|
|
|
|
int arity;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
} operator_name_info_t;
|
|
|
|
|
|
|
|
|
|
/* A mapping from tree codes to operator name information. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern GTY(()) operator_name_info_t operator_name_info
|
|
|
|
|
[(int) LAST_CPLUS_TREE_CODE];
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Similar, but for assignment operators. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern GTY(()) operator_name_info_t assignment_operator_name_info
|
|
|
|
|
[(int) LAST_CPLUS_TREE_CODE];
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* in call.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern bool check_dtor_name (tree, tree);
|
|
|
|
|
|
|
|
|
|
extern tree build_vfield_ref (tree, tree);
|
|
|
|
|
extern tree build_conditional_expr (tree, tree, tree);
|
|
|
|
|
extern tree build_addr_func (tree);
|
|
|
|
|
extern tree build_call (tree, tree);
|
|
|
|
|
extern bool null_ptr_cst_p (tree);
|
|
|
|
|
extern bool sufficient_parms_p (tree);
|
|
|
|
|
extern tree type_decays_to (tree);
|
|
|
|
|
extern tree build_user_type_conversion (tree, tree, int);
|
|
|
|
|
extern tree build_new_function_call (tree, tree);
|
|
|
|
|
extern tree build_operator_new_call (tree, tree, tree *, tree *);
|
|
|
|
|
extern tree build_new_method_call (tree, tree, tree, tree, int);
|
|
|
|
|
extern tree build_special_member_call (tree, tree, tree, tree, int);
|
|
|
|
|
extern tree build_new_op (enum tree_code, int, tree, tree, tree, bool *);
|
|
|
|
|
extern tree build_op_delete_call (enum tree_code, tree, tree, int, tree);
|
|
|
|
|
extern bool can_convert (tree, tree);
|
|
|
|
|
extern bool can_convert_arg (tree, tree, tree);
|
|
|
|
|
extern bool can_convert_arg_bad (tree, tree, tree);
|
|
|
|
|
extern bool enforce_access (tree, tree);
|
|
|
|
|
extern tree convert_default_arg (tree, tree, tree, int);
|
|
|
|
|
extern tree convert_arg_to_ellipsis (tree);
|
|
|
|
|
extern tree build_x_va_arg (tree, tree);
|
|
|
|
|
extern tree cxx_type_promotes_to (tree);
|
|
|
|
|
extern tree type_passed_as (tree);
|
|
|
|
|
extern tree convert_for_arg_passing (tree, tree);
|
|
|
|
|
extern tree cp_convert_parm_for_inlining (tree, tree, tree);
|
|
|
|
|
extern bool is_properly_derived_from (tree, tree);
|
|
|
|
|
extern tree initialize_reference (tree, tree, tree, tree *);
|
|
|
|
|
extern tree make_temporary_var_for_ref_to_temp (tree, tree);
|
|
|
|
|
extern tree strip_top_quals (tree);
|
|
|
|
|
extern tree perform_implicit_conversion (tree, tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree perform_direct_initialization_if_possible (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree in_charge_arg_for_name (tree);
|
|
|
|
|
extern tree build_cxx_call (tree, tree, tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in class.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_base_path (enum tree_code, tree, tree, int);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree convert_to_base (tree, tree, bool);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree convert_to_base_statically (tree, tree);
|
|
|
|
|
extern tree build_vtbl_ref (tree, tree);
|
|
|
|
|
extern tree build_vfn_ref (tree, tree);
|
|
|
|
|
extern tree get_vtable_decl (tree, int);
|
|
|
|
|
extern void resort_type_method_vec
|
|
|
|
|
(void *, void *, gt_pointer_operator, void *);
|
|
|
|
|
extern void add_method (tree, tree, int);
|
|
|
|
|
extern int currently_open_class (tree);
|
|
|
|
|
extern tree currently_open_derived_class (tree);
|
|
|
|
|
extern tree finish_struct (tree, tree);
|
|
|
|
|
extern void finish_struct_1 (tree);
|
|
|
|
|
extern int resolves_to_fixed_type_p (tree, int *);
|
|
|
|
|
extern void init_class_processing (void);
|
|
|
|
|
extern int is_empty_class (tree);
|
|
|
|
|
extern void pushclass (tree);
|
|
|
|
|
extern void popclass (void);
|
|
|
|
|
extern void push_nested_class (tree);
|
|
|
|
|
extern void pop_nested_class (void);
|
|
|
|
|
extern int current_lang_depth (void);
|
|
|
|
|
extern void push_lang_context (tree);
|
|
|
|
|
extern void pop_lang_context (void);
|
|
|
|
|
extern tree instantiate_type (tree, tree, tsubst_flags_t);
|
|
|
|
|
extern void print_class_statistics (void);
|
|
|
|
|
extern void cxx_print_statistics (void);
|
|
|
|
|
extern void cxx_print_xnode (FILE *, tree, int);
|
|
|
|
|
extern void cxx_print_decl (FILE *, tree, int);
|
|
|
|
|
extern void cxx_print_type (FILE *, tree, int);
|
|
|
|
|
extern void cxx_print_identifier (FILE *, tree, int);
|
|
|
|
|
extern void cxx_print_error_function (struct diagnostic_context *,
|
|
|
|
|
const char *);
|
|
|
|
|
extern void build_self_reference (void);
|
|
|
|
|
extern int same_signature_p (tree, tree);
|
|
|
|
|
extern void warn_hidden (tree);
|
|
|
|
|
extern void maybe_add_class_template_decl_list (tree, tree, int);
|
|
|
|
|
extern tree get_enclosing_class (tree);
|
|
|
|
|
extern void unreverse_member_declarations (tree);
|
|
|
|
|
extern void invalidate_class_lookup_cache (void);
|
|
|
|
|
extern void maybe_note_name_used_in_class (tree, tree);
|
|
|
|
|
extern void note_name_declared_in_class (tree, tree);
|
|
|
|
|
extern tree get_vtbl_decl_for_binfo (tree);
|
|
|
|
|
extern tree get_vtt_name (tree);
|
|
|
|
|
extern tree get_primary_binfo (tree);
|
|
|
|
|
extern void debug_class (tree);
|
|
|
|
|
extern void debug_thunks (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in cvt.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree convert_to_reference (tree, tree, int, int, tree);
|
|
|
|
|
extern tree convert_from_reference (tree);
|
|
|
|
|
extern tree convert_lvalue (tree, tree);
|
|
|
|
|
extern tree force_rvalue (tree);
|
|
|
|
|
extern tree ocp_convert (tree, tree, int, int);
|
|
|
|
|
extern tree cp_convert (tree, tree);
|
|
|
|
|
extern tree convert_to_void (tree, const char */*implicit context*/);
|
|
|
|
|
extern tree convert_force (tree, tree, int);
|
|
|
|
|
extern tree build_type_conversion (tree, tree);
|
|
|
|
|
extern tree build_expr_type_conversion (int, tree, bool);
|
|
|
|
|
extern tree type_promotes_to (tree);
|
|
|
|
|
extern tree perform_qualification_conversions (tree, tree);
|
|
|
|
|
extern void clone_function_decl (tree, int);
|
|
|
|
|
extern void adjust_clone_args (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* decl.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void insert_block (tree);
|
|
|
|
|
extern void set_block (tree);
|
|
|
|
|
extern tree pushdecl (tree);
|
|
|
|
|
extern void cxx_init_decl_processing (void);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
enum cp_tree_node_structure_enum cp_tree_node_structure
|
2004-07-28 03:11:36 +00:00
|
|
|
|
(union lang_tree_node *);
|
|
|
|
|
extern bool cxx_mark_addressable (tree);
|
|
|
|
|
extern void cxx_push_function_context (struct function *);
|
|
|
|
|
extern void cxx_pop_function_context (struct function *);
|
|
|
|
|
extern void cxx_mark_function_context (struct function *);
|
|
|
|
|
extern void maybe_push_cleanup_level (tree);
|
|
|
|
|
extern void finish_scope (void);
|
|
|
|
|
extern void delete_block (tree);
|
|
|
|
|
extern void add_block_current_level (tree);
|
|
|
|
|
extern void push_switch (tree);
|
|
|
|
|
extern void pop_switch (void);
|
|
|
|
|
extern void pushtag (tree, tree, int);
|
|
|
|
|
extern tree make_anon_name (void);
|
|
|
|
|
extern void clear_anon_tags (void);
|
|
|
|
|
extern int decls_match (tree, tree);
|
|
|
|
|
extern tree duplicate_decls (tree, tree);
|
|
|
|
|
extern tree pushdecl_top_level (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree pushdecl_top_level_and_finish (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree push_using_decl (tree, tree);
|
|
|
|
|
extern tree implicitly_declare (tree);
|
|
|
|
|
extern tree declare_local_label (tree);
|
|
|
|
|
extern tree define_label (location_t, tree);
|
|
|
|
|
extern void check_goto (tree);
|
|
|
|
|
extern void define_case_label (void);
|
|
|
|
|
extern tree make_typename_type (tree, tree, tsubst_flags_t);
|
|
|
|
|
extern tree make_unbound_class_template (tree, tree, tsubst_flags_t);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree check_for_out_of_scope_variable (tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_library_fn (tree, tree);
|
|
|
|
|
extern tree build_library_fn_ptr (const char *, tree);
|
|
|
|
|
extern tree build_cp_library_fn_ptr (const char *, tree);
|
|
|
|
|
extern tree push_library_fn (tree, tree);
|
|
|
|
|
extern tree push_void_library_fn (tree, tree);
|
|
|
|
|
extern tree push_throw_library_fn (tree, tree);
|
|
|
|
|
extern int init_type_desc (void);
|
|
|
|
|
extern tree check_tag_decl (tree);
|
|
|
|
|
extern tree shadow_tag (tree);
|
|
|
|
|
extern tree groktypename (tree);
|
|
|
|
|
extern tree start_decl (tree, tree, int, tree, tree);
|
|
|
|
|
extern void start_decl_1 (tree);
|
|
|
|
|
extern void cp_finish_decl (tree, tree, tree, int);
|
|
|
|
|
extern void finish_decl (tree, tree, tree);
|
|
|
|
|
extern void maybe_inject_for_scope_var (tree);
|
|
|
|
|
extern tree start_handler_parms (tree, tree);
|
|
|
|
|
extern int complete_array_type (tree, tree, int);
|
|
|
|
|
extern tree build_ptrmemfunc_type (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree build_ptrmem_type (tree, tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* the grokdeclarator prototype is in decl.h */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern int copy_fn_p (tree);
|
|
|
|
|
extern tree get_scope_of_declarator (tree);
|
|
|
|
|
extern void grok_special_member_properties (tree);
|
|
|
|
|
extern int grok_ctor_properties (tree, tree);
|
|
|
|
|
extern bool grok_op_properties (tree, int, bool);
|
|
|
|
|
extern tree xref_tag (enum tag_types, tree, bool, bool);
|
|
|
|
|
extern tree xref_tag_from_type (tree, tree, int);
|
|
|
|
|
extern void xref_basetypes (tree, tree);
|
|
|
|
|
extern tree start_enum (tree);
|
|
|
|
|
extern void finish_enum (tree);
|
|
|
|
|
extern void build_enumerator (tree, tree, tree);
|
|
|
|
|
extern int start_function (tree, tree, tree, int);
|
|
|
|
|
extern tree begin_function_body (void);
|
|
|
|
|
extern void finish_function_body (tree);
|
|
|
|
|
extern tree finish_function (int);
|
|
|
|
|
extern tree start_method (tree, tree, tree);
|
|
|
|
|
extern tree finish_method (tree);
|
|
|
|
|
extern void maybe_register_incomplete_var (tree);
|
|
|
|
|
extern void complete_vars (tree);
|
|
|
|
|
extern void finish_stmt (void);
|
|
|
|
|
extern void print_other_binding_stack (struct cp_binding_level *);
|
|
|
|
|
extern void revert_static_member_fn (tree);
|
|
|
|
|
extern void fixup_anonymous_aggr (tree);
|
|
|
|
|
extern int check_static_variable_definition (tree, tree);
|
|
|
|
|
extern tree compute_array_index_type (tree, tree);
|
|
|
|
|
extern tree check_default_argument (tree, tree);
|
|
|
|
|
extern int vtable_decl_p (tree, void *);
|
|
|
|
|
extern int vtype_decl_p (tree, void *);
|
|
|
|
|
extern int sigtable_decl_p (tree, void *);
|
|
|
|
|
typedef bool (*walk_globals_pred) (tree, void *);
|
|
|
|
|
typedef bool (*walk_globals_fn) (tree *, void *);
|
|
|
|
|
extern bool walk_globals (walk_globals_pred, walk_globals_fn, void *);
|
|
|
|
|
extern bool walk_vtables (walk_globals_pred, walk_globals_fn, void *);
|
|
|
|
|
typedef int (*walk_namespaces_fn) (tree, void *);
|
|
|
|
|
extern int walk_namespaces (walk_namespaces_fn,
|
|
|
|
|
void *);
|
|
|
|
|
extern int wrapup_globals_for_namespace (tree, void *);
|
|
|
|
|
extern tree create_implicit_typedef (tree, tree);
|
|
|
|
|
extern tree maybe_push_decl (tree);
|
|
|
|
|
extern tree force_target_expr (tree, tree);
|
|
|
|
|
extern tree build_target_expr_with_type (tree, tree);
|
|
|
|
|
extern int local_variable_p (tree);
|
|
|
|
|
extern int nonstatic_local_decl_p (tree);
|
|
|
|
|
extern tree declare_global_var (tree, tree);
|
|
|
|
|
extern void register_dtor_fn (tree);
|
|
|
|
|
extern tmpl_spec_kind current_tmpl_spec_kind (int);
|
|
|
|
|
extern tree cp_fname_init (const char *, tree *);
|
|
|
|
|
extern tree check_elaborated_type_specifier (enum tag_types, tree, bool);
|
|
|
|
|
extern tree cxx_builtin_type_decls (void);
|
|
|
|
|
extern void warn_extern_redeclared_static (tree, tree);
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern bool have_extern_spec;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in decl2.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern bool check_java_method (tree);
|
|
|
|
|
extern int grok_method_quals (tree, tree, tree);
|
|
|
|
|
extern void grok_x_components (tree);
|
|
|
|
|
extern void maybe_retrofit_in_chrg (tree);
|
|
|
|
|
extern void maybe_make_one_only (tree);
|
|
|
|
|
extern void grokclassfn (tree, tree, enum overload_flags, tree);
|
|
|
|
|
extern tree grok_array_decl (tree, tree);
|
|
|
|
|
extern tree delete_sanity (tree, tree, bool, int);
|
|
|
|
|
extern tree check_classfn (tree, tree, bool);
|
|
|
|
|
extern void check_member_template (tree);
|
|
|
|
|
extern tree grokfield (tree, tree, tree, tree, tree);
|
|
|
|
|
extern tree grokbitfield (tree, tree, tree);
|
|
|
|
|
extern tree groktypefield (tree, tree);
|
|
|
|
|
extern void cplus_decl_attributes (tree *, tree, int);
|
|
|
|
|
extern void defer_fn (tree);
|
|
|
|
|
extern void finish_anon_union (tree);
|
|
|
|
|
extern tree finish_table (tree, tree, tree, int);
|
|
|
|
|
extern tree coerce_new_type (tree);
|
|
|
|
|
extern tree coerce_delete_type (tree);
|
|
|
|
|
extern void comdat_linkage (tree);
|
|
|
|
|
extern void import_export_vtable (tree, tree, int);
|
|
|
|
|
extern void import_export_decl (tree);
|
|
|
|
|
extern void import_export_tinfo (tree, tree, bool);
|
|
|
|
|
extern tree build_cleanup (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree build_offset_ref_call_from_tree (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void check_default_args (tree);
|
|
|
|
|
extern void mark_used (tree);
|
|
|
|
|
extern void finish_static_data_member_decl (tree, tree, tree, int);
|
|
|
|
|
extern tree cp_build_parm_decl (tree, tree);
|
|
|
|
|
extern tree build_artificial_parm (tree, tree);
|
|
|
|
|
extern tree get_guard (tree);
|
|
|
|
|
extern tree get_guard_cond (tree);
|
|
|
|
|
extern tree set_guard (tree);
|
|
|
|
|
extern tree cxx_callgraph_analyze_expr (tree *, int *, tree);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* XXX Not i18n clean. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#define cp_deprecated(STR) \
|
|
|
|
|
do { \
|
|
|
|
|
if (warn_deprecated) \
|
|
|
|
|
warning ("%s is deprecated, please see the documentation for details", \
|
|
|
|
|
(STR)); \
|
2002-02-01 18:16:02 +00:00
|
|
|
|
} while (0)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* in error.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void init_error (void);
|
|
|
|
|
extern const char *type_as_string (tree, int);
|
|
|
|
|
extern const char *decl_as_string (tree, int);
|
|
|
|
|
extern const char *expr_as_string (tree, int);
|
|
|
|
|
extern const char *context_as_string (tree, int);
|
|
|
|
|
extern const char *lang_decl_name (tree, int);
|
|
|
|
|
extern const char *language_to_string (enum languages);
|
|
|
|
|
extern void print_instantiation_context (void);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in except.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void init_exception_processing (void);
|
|
|
|
|
extern tree expand_start_catch_block (tree);
|
|
|
|
|
extern void expand_end_catch_block (void);
|
|
|
|
|
extern void expand_builtin_throw (void);
|
|
|
|
|
extern void expand_eh_spec_block (tree);
|
|
|
|
|
extern void expand_exception_blocks (void);
|
|
|
|
|
extern tree build_exc_ptr (void);
|
|
|
|
|
extern tree build_throw (tree);
|
|
|
|
|
extern void mark_all_runtime_matches (void);
|
|
|
|
|
extern int nothrow_libfn_p (tree);
|
|
|
|
|
extern void check_handlers (tree);
|
|
|
|
|
extern void choose_personality_routine (enum languages);
|
|
|
|
|
extern tree eh_type_info (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in expr.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern rtx cxx_expand_expr (tree, rtx,
|
|
|
|
|
enum machine_mode,
|
|
|
|
|
int, rtx *);
|
|
|
|
|
extern tree cplus_expand_constant (tree);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* friend.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern int is_friend (tree, tree);
|
|
|
|
|
extern void make_friend_class (tree, tree, bool);
|
|
|
|
|
extern void add_friend (tree, tree, bool);
|
|
|
|
|
extern tree do_friend (tree, tree, tree, tree, enum overload_flags, tree, int);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in init.c */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree expand_member_init (tree);
|
|
|
|
|
extern void emit_mem_initializers (tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_aggr_init (tree, tree, int);
|
|
|
|
|
extern tree build_init (tree, tree, int);
|
|
|
|
|
extern int is_aggr_type (tree, int);
|
|
|
|
|
extern tree get_aggr_from_typedef (tree, int);
|
|
|
|
|
extern tree get_type_value (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree build_zero_init (tree, tree, bool);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_offset_ref (tree, tree, bool);
|
|
|
|
|
extern tree build_new (tree, tree, tree, int);
|
|
|
|
|
extern tree build_vec_init (tree, tree, tree, int);
|
|
|
|
|
extern tree build_x_delete (tree, int, tree);
|
|
|
|
|
extern tree build_delete (tree, tree, special_function_kind, int, int);
|
|
|
|
|
extern void push_base_cleanups (void);
|
|
|
|
|
extern tree build_vbase_delete (tree, tree);
|
|
|
|
|
extern tree build_vec_delete (tree, tree, special_function_kind, int);
|
|
|
|
|
extern tree create_temporary_var (tree);
|
|
|
|
|
extern void initialize_vtbl_ptrs (tree);
|
|
|
|
|
extern tree build_java_class_ref (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in input.c */
|
|
|
|
|
|
|
|
|
|
/* in lex.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void cxx_dup_lang_specific_decl (tree);
|
|
|
|
|
extern tree make_pointer_declarator (tree, tree);
|
|
|
|
|
extern tree make_reference_declarator (tree, tree);
|
|
|
|
|
extern tree make_call_declarator (tree, tree, tree, tree);
|
|
|
|
|
extern void set_quals_and_spec (tree, tree, tree);
|
|
|
|
|
extern void print_parse_statistics (void);
|
|
|
|
|
extern void do_pending_inlines (void);
|
|
|
|
|
extern void yyungetc (int, int);
|
|
|
|
|
extern void snarf_method (tree);
|
|
|
|
|
|
|
|
|
|
extern void see_typename (void);
|
|
|
|
|
extern tree unqualified_name_lookup_error (tree);
|
|
|
|
|
extern tree unqualified_fn_lookup_error (tree);
|
|
|
|
|
extern tree build_lang_decl (enum tree_code, tree, tree);
|
|
|
|
|
extern void retrofit_lang_decl (tree);
|
|
|
|
|
extern tree copy_decl (tree);
|
|
|
|
|
extern tree copy_type (tree);
|
|
|
|
|
extern tree cxx_make_type (enum tree_code);
|
|
|
|
|
extern tree make_aggr_type (enum tree_code);
|
|
|
|
|
extern void yyerror (const char *);
|
|
|
|
|
extern void yyhook (int);
|
|
|
|
|
extern int cp_type_qual_from_rid (tree);
|
|
|
|
|
extern bool cxx_init (void);
|
|
|
|
|
extern void cxx_finish (void);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in method.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void init_method (void);
|
|
|
|
|
extern void set_mangled_name_for_decl (tree);
|
|
|
|
|
extern tree make_thunk (tree, bool, tree, tree);
|
|
|
|
|
extern void finish_thunk (tree);
|
|
|
|
|
extern void use_thunk (tree, bool);
|
|
|
|
|
extern void synthesize_method (tree);
|
|
|
|
|
extern tree implicitly_declare_fn (special_function_kind, tree, bool);
|
|
|
|
|
extern tree skip_artificial_parms_for (tree, tree);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* In optimize.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void optimize_function (tree);
|
|
|
|
|
extern bool calls_setjmp_p (tree);
|
|
|
|
|
extern bool maybe_clone_body (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in pt.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void check_template_shadow (tree);
|
|
|
|
|
extern tree get_innermost_template_args (tree, int);
|
|
|
|
|
extern void maybe_begin_member_template_processing (tree);
|
|
|
|
|
extern void maybe_end_member_template_processing (void);
|
|
|
|
|
extern tree finish_member_template_decl (tree);
|
|
|
|
|
extern void begin_template_parm_list (void);
|
|
|
|
|
extern void begin_specialization (void);
|
|
|
|
|
extern void reset_specialization (void);
|
|
|
|
|
extern void end_specialization (void);
|
|
|
|
|
extern void begin_explicit_instantiation (void);
|
|
|
|
|
extern void end_explicit_instantiation (void);
|
|
|
|
|
extern tree check_explicit_specialization (tree, tree, int, int);
|
|
|
|
|
extern tree process_template_parm (tree, tree);
|
|
|
|
|
extern tree end_template_parm_list (tree);
|
|
|
|
|
extern void end_template_decl (void);
|
|
|
|
|
extern tree current_template_args (void);
|
|
|
|
|
extern tree push_template_decl (tree);
|
|
|
|
|
extern tree push_template_decl_real (tree, int);
|
|
|
|
|
extern void redeclare_class_template (tree, tree);
|
|
|
|
|
extern tree lookup_template_class (tree, tree, tree, tree, int, tsubst_flags_t);
|
|
|
|
|
extern tree lookup_template_function (tree, tree);
|
|
|
|
|
extern int uses_template_parms (tree);
|
|
|
|
|
extern int uses_template_parms_level (tree, int);
|
|
|
|
|
extern tree instantiate_class_template (tree);
|
|
|
|
|
extern tree instantiate_template (tree, tree, tsubst_flags_t);
|
|
|
|
|
extern int fn_type_unification (tree, tree, tree, tree, tree, unification_kind_t, int);
|
|
|
|
|
extern tree tinst_for_decl (void);
|
|
|
|
|
extern void mark_decl_instantiated (tree, int);
|
|
|
|
|
extern int more_specialized (tree, tree, int, int);
|
|
|
|
|
extern void mark_class_instantiated (tree, int);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern void do_decl_instantiation (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void do_type_instantiation (tree, tree, tsubst_flags_t);
|
|
|
|
|
extern tree instantiate_decl (tree, int);
|
|
|
|
|
extern int push_tinst_level (tree);
|
|
|
|
|
extern void pop_tinst_level (void);
|
|
|
|
|
extern int more_specialized_class (tree, tree, tree);
|
|
|
|
|
extern int is_member_template (tree);
|
|
|
|
|
extern int comp_template_parms (tree, tree);
|
|
|
|
|
extern int template_class_depth (tree);
|
|
|
|
|
extern int is_specialization_of (tree, tree);
|
|
|
|
|
extern bool is_specialization_of_friend (tree, tree);
|
|
|
|
|
extern int comp_template_args (tree, tree);
|
|
|
|
|
extern void maybe_process_partial_specialization (tree);
|
|
|
|
|
extern void maybe_check_template_type (tree);
|
|
|
|
|
extern tree most_specialized_instantiation (tree);
|
|
|
|
|
extern void print_candidates (tree);
|
|
|
|
|
extern int instantiate_pending_templates (void);
|
|
|
|
|
extern tree tsubst_default_argument (tree, tree, tree);
|
|
|
|
|
extern tree tsubst_copy_and_build (tree, tree, tsubst_flags_t, tree, bool);
|
|
|
|
|
extern tree most_general_template (tree);
|
|
|
|
|
extern tree get_mostly_instantiated_function_type (tree);
|
|
|
|
|
extern int problematic_instantiation_changed (void);
|
|
|
|
|
extern void record_last_problematic_instantiation (void);
|
|
|
|
|
extern tree current_instantiation (void);
|
|
|
|
|
extern tree maybe_get_template_decl_from_type_decl (tree);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
extern int processing_template_parmlist;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern bool dependent_type_p (tree);
|
|
|
|
|
extern bool any_dependent_template_arguments_p (tree);
|
|
|
|
|
extern bool dependent_template_p (tree);
|
|
|
|
|
extern bool dependent_template_id_p (tree, tree);
|
|
|
|
|
extern bool type_dependent_expression_p (tree);
|
|
|
|
|
extern bool any_type_dependent_arguments_p (tree);
|
|
|
|
|
extern bool value_dependent_expression_p (tree);
|
|
|
|
|
extern tree resolve_typename_type (tree, bool);
|
|
|
|
|
extern tree template_for_substitution (tree);
|
|
|
|
|
extern tree build_non_dependent_expr (tree);
|
|
|
|
|
extern tree build_non_dependent_args (tree);
|
|
|
|
|
extern bool reregister_specialization (tree, tree, tree);
|
|
|
|
|
extern tree fold_non_dependent_expr (tree);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* in repo.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void repo_template_used (tree);
|
|
|
|
|
extern void repo_template_instantiated (tree, bool);
|
|
|
|
|
extern void init_repo (const char *);
|
|
|
|
|
extern void finish_repo (void);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
/* in rtti.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* A varray of all tinfo decls that haven't been emitted yet. */
|
|
|
|
|
extern GTY(()) varray_type unemitted_tinfo_decls;
|
|
|
|
|
|
|
|
|
|
extern void init_rtti_processing (void);
|
|
|
|
|
extern tree build_typeid (tree);
|
|
|
|
|
extern tree get_tinfo_decl (tree);
|
|
|
|
|
extern tree get_typeid (tree);
|
|
|
|
|
extern tree build_dynamic_cast (tree, tree);
|
|
|
|
|
extern void emit_support_tinfos (void);
|
|
|
|
|
extern bool emit_tinfo_decl (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in search.c */
|
2003-08-22 02:56:07 +00:00
|
|
|
|
extern bool accessible_base_p (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree lookup_base (tree, tree, base_access, base_kind *);
|
|
|
|
|
extern int types_overlap_p (tree, tree);
|
|
|
|
|
extern tree get_dynamic_cast_base_type (tree, tree);
|
|
|
|
|
extern int accessible_p (tree, tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree lookup_field_1 (tree, tree, bool);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree lookup_field (tree, tree, int, bool);
|
|
|
|
|
extern int lookup_fnfields_1 (tree, tree);
|
|
|
|
|
extern tree lookup_fnfields (tree, tree, int);
|
|
|
|
|
extern tree lookup_member (tree, tree, int, bool);
|
|
|
|
|
extern int look_for_overrides (tree, tree);
|
|
|
|
|
extern void get_pure_virtuals (tree);
|
|
|
|
|
extern void maybe_suppress_debug_info (tree);
|
|
|
|
|
extern void note_debug_info_needed (tree);
|
|
|
|
|
extern void push_class_decls (tree);
|
|
|
|
|
extern void pop_class_decls (void);
|
|
|
|
|
extern void unuse_fields (tree);
|
|
|
|
|
extern void print_search_statistics (void);
|
|
|
|
|
extern void init_search_processing (void);
|
|
|
|
|
extern void reinit_search_statistics (void);
|
|
|
|
|
extern tree current_scope (void);
|
|
|
|
|
extern int at_function_scope_p (void);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern bool at_class_scope_p (void);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern bool at_namespace_scope_p (void);
|
|
|
|
|
extern tree context_for_name_lookup (tree);
|
|
|
|
|
extern tree lookup_conversions (tree);
|
|
|
|
|
extern tree binfo_for_vtable (tree);
|
|
|
|
|
extern tree binfo_from_vbase (tree);
|
|
|
|
|
extern tree look_for_overrides_here (tree, tree);
|
|
|
|
|
extern int check_final_overrider (tree, tree);
|
|
|
|
|
extern tree dfs_walk (tree,
|
|
|
|
|
tree (*) (tree, void *),
|
|
|
|
|
tree (*) (tree, int, void *),
|
|
|
|
|
void *);
|
|
|
|
|
extern tree dfs_walk_real (tree,
|
|
|
|
|
tree (*) (tree, void *),
|
|
|
|
|
tree (*) (tree, void *),
|
|
|
|
|
tree (*) (tree, int, void *),
|
|
|
|
|
void *);
|
|
|
|
|
extern tree dfs_unmark (tree, void *);
|
|
|
|
|
extern tree markedp (tree, int, void *);
|
|
|
|
|
extern tree unmarkedp (tree, int, void *);
|
|
|
|
|
extern tree binfo_via_virtual (tree, tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree build_baselink (tree, tree, tree, tree);
|
|
|
|
|
extern tree adjust_result_of_qualified_name_lookup
|
|
|
|
|
(tree, tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree copied_binfo (tree, tree);
|
|
|
|
|
extern tree original_binfo (tree, tree);
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* in semantics.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void push_deferring_access_checks (deferring_kind);
|
|
|
|
|
extern void resume_deferring_access_checks (void);
|
|
|
|
|
extern void stop_deferring_access_checks (void);
|
|
|
|
|
extern void pop_deferring_access_checks (void);
|
|
|
|
|
extern tree get_deferred_access_checks (void);
|
|
|
|
|
extern void pop_to_parent_deferring_access_checks (void);
|
|
|
|
|
extern void perform_deferred_access_checks (void);
|
|
|
|
|
extern void perform_or_defer_access_check (tree, tree);
|
|
|
|
|
extern void init_cp_semantics (void);
|
|
|
|
|
extern tree finish_expr_stmt (tree);
|
|
|
|
|
extern tree begin_if_stmt (void);
|
|
|
|
|
extern void finish_if_stmt_cond (tree, tree);
|
|
|
|
|
extern tree finish_then_clause (tree);
|
|
|
|
|
extern void begin_else_clause (void);
|
|
|
|
|
extern void finish_else_clause (tree);
|
|
|
|
|
extern void finish_if_stmt (void);
|
|
|
|
|
extern tree begin_while_stmt (void);
|
|
|
|
|
extern void finish_while_stmt_cond (tree, tree);
|
|
|
|
|
extern void finish_while_stmt (tree);
|
|
|
|
|
extern tree begin_do_stmt (void);
|
|
|
|
|
extern void finish_do_body (tree);
|
|
|
|
|
extern void finish_do_stmt (tree, tree);
|
|
|
|
|
extern tree finish_return_stmt (tree);
|
|
|
|
|
extern tree begin_for_stmt (void);
|
|
|
|
|
extern void finish_for_init_stmt (tree);
|
|
|
|
|
extern void finish_for_cond (tree, tree);
|
|
|
|
|
extern void finish_for_expr (tree, tree);
|
|
|
|
|
extern void finish_for_stmt (tree);
|
|
|
|
|
extern tree finish_break_stmt (void);
|
|
|
|
|
extern tree finish_continue_stmt (void);
|
|
|
|
|
extern tree begin_switch_stmt (void);
|
|
|
|
|
extern void finish_switch_cond (tree, tree);
|
|
|
|
|
extern void finish_switch_stmt (tree);
|
|
|
|
|
extern tree finish_case_label (tree, tree);
|
|
|
|
|
extern tree finish_goto_stmt (tree);
|
|
|
|
|
extern tree begin_try_block (void);
|
|
|
|
|
extern void finish_try_block (tree);
|
|
|
|
|
extern tree begin_eh_spec_block (void);
|
|
|
|
|
extern void finish_eh_spec_block (tree, tree);
|
|
|
|
|
extern void finish_handler_sequence (tree);
|
|
|
|
|
extern tree begin_function_try_block (void);
|
|
|
|
|
extern void finish_function_try_block (tree);
|
|
|
|
|
extern void finish_function_handler_sequence (tree);
|
|
|
|
|
extern void finish_cleanup_try_block (tree);
|
|
|
|
|
extern tree begin_handler (void);
|
|
|
|
|
extern void finish_handler_parms (tree, tree);
|
|
|
|
|
extern void begin_catch_block (tree);
|
|
|
|
|
extern void finish_handler (tree);
|
|
|
|
|
extern void finish_cleanup (tree, tree);
|
|
|
|
|
extern tree begin_compound_stmt (bool);
|
|
|
|
|
extern tree finish_compound_stmt (tree);
|
|
|
|
|
extern tree finish_asm_stmt (tree, tree, tree, tree, tree);
|
|
|
|
|
extern tree finish_label_stmt (tree);
|
|
|
|
|
extern void finish_label_decl (tree);
|
|
|
|
|
extern void finish_subobject (tree);
|
|
|
|
|
extern tree finish_parenthesized_expr (tree);
|
|
|
|
|
extern tree finish_non_static_data_member (tree, tree, tree);
|
|
|
|
|
extern tree begin_stmt_expr (void);
|
|
|
|
|
extern tree finish_stmt_expr_expr (tree);
|
|
|
|
|
extern tree finish_stmt_expr (tree, bool);
|
|
|
|
|
extern tree perform_koenig_lookup (tree, tree);
|
|
|
|
|
extern tree finish_call_expr (tree, tree, bool, bool);
|
|
|
|
|
extern tree finish_increment_expr (tree, enum tree_code);
|
|
|
|
|
extern tree finish_this_expr (void);
|
|
|
|
|
extern tree finish_pseudo_destructor_expr (tree, tree, tree);
|
|
|
|
|
extern tree finish_unary_op_expr (enum tree_code, tree);
|
|
|
|
|
extern tree finish_compound_literal (tree, tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree finish_fname (tree);
|
|
|
|
|
extern int begin_function_definition (tree, tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void finish_translation_unit (void);
|
|
|
|
|
extern tree finish_template_type_parm (tree, tree);
|
|
|
|
|
extern tree finish_template_template_parm (tree, tree);
|
|
|
|
|
extern tree finish_parmlist (tree, int);
|
|
|
|
|
extern tree begin_class_definition (tree);
|
|
|
|
|
extern void finish_default_args (void);
|
|
|
|
|
extern tree finish_member_class_template (tree);
|
|
|
|
|
extern void finish_template_decl (tree);
|
|
|
|
|
extern tree finish_template_type (tree, tree, int);
|
|
|
|
|
extern tree finish_base_specifier (tree, tree, bool);
|
|
|
|
|
extern void finish_member_declaration (tree);
|
|
|
|
|
extern void check_multiple_declarators (void);
|
|
|
|
|
extern void qualified_name_lookup_error (tree, tree);
|
|
|
|
|
extern tree finish_id_expression (tree, tree, tree,
|
|
|
|
|
cp_id_kind *, tree *,
|
|
|
|
|
bool, bool, bool *,
|
|
|
|
|
const char **);
|
|
|
|
|
extern tree finish_typeof (tree);
|
|
|
|
|
extern void finish_decl_cleanup (tree, tree);
|
|
|
|
|
extern void finish_eh_cleanup (tree);
|
|
|
|
|
extern void expand_body (tree);
|
|
|
|
|
extern void cxx_expand_function_start (void);
|
|
|
|
|
extern tree nullify_returns_r (tree *, int *, void *);
|
|
|
|
|
extern void do_pushlevel (scope_kind);
|
|
|
|
|
extern tree do_poplevel (void);
|
|
|
|
|
extern void finish_mem_initializers (tree);
|
|
|
|
|
extern void setup_vtbl_ptr (tree, tree);
|
|
|
|
|
extern void clear_out_block (void);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree check_template_template_default_arg (tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void expand_or_defer_fn (tree);
|
|
|
|
|
extern void check_accessibility_of_qualified_id (tree, tree, tree);
|
|
|
|
|
extern tree finish_qualified_id_expr (tree, tree, bool, bool);
|
|
|
|
|
extern void simplify_aggr_init_expr (tree *);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in tree.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void lang_check_failed (const char *, int,
|
|
|
|
|
const char *);
|
|
|
|
|
extern tree stabilize_expr (tree, tree *);
|
|
|
|
|
extern void stabilize_call (tree, tree *);
|
|
|
|
|
extern bool stabilize_init (tree, tree *);
|
|
|
|
|
extern tree cxx_unsave_expr_now (tree);
|
|
|
|
|
extern tree cxx_maybe_build_cleanup (tree);
|
|
|
|
|
extern void init_tree (void);
|
|
|
|
|
extern int pod_type_p (tree);
|
|
|
|
|
extern int zero_init_p (tree);
|
|
|
|
|
extern tree canonical_type_variant (tree);
|
|
|
|
|
extern tree copy_base_binfos (tree, tree, tree);
|
|
|
|
|
extern int member_p (tree);
|
|
|
|
|
extern cp_lvalue_kind real_lvalue_p (tree);
|
|
|
|
|
extern tree build_min (enum tree_code, tree, ...);
|
|
|
|
|
extern tree build_min_nt (enum tree_code, ...);
|
|
|
|
|
extern tree build_min_non_dep (enum tree_code, tree, ...);
|
|
|
|
|
extern tree build_cplus_new (tree, tree);
|
|
|
|
|
extern tree get_target_expr (tree);
|
|
|
|
|
extern tree build_cplus_staticfn_type (tree, tree, tree);
|
|
|
|
|
extern tree build_cplus_array_type (tree, tree);
|
|
|
|
|
extern tree hash_tree_cons (tree, tree, tree);
|
|
|
|
|
extern tree hash_tree_chain (tree, tree);
|
|
|
|
|
extern tree hash_chainon (tree, tree);
|
|
|
|
|
extern tree make_binfo (tree, tree, tree, tree);
|
|
|
|
|
extern int count_functions (tree);
|
|
|
|
|
extern int is_overloaded_fn (tree);
|
|
|
|
|
extern tree get_first_fn (tree);
|
|
|
|
|
extern int bound_pmf_p (tree);
|
|
|
|
|
extern tree ovl_cons (tree, tree);
|
|
|
|
|
extern tree build_overload (tree, tree);
|
|
|
|
|
extern tree function_arg_chain (tree);
|
|
|
|
|
extern int promotes_to_aggr_type (tree, enum tree_code);
|
|
|
|
|
extern const char *cxx_printable_name (tree, int);
|
|
|
|
|
extern tree build_exception_variant (tree, tree);
|
|
|
|
|
extern tree bind_template_template_parm (tree, tree);
|
|
|
|
|
extern tree array_type_nelts_total (tree);
|
|
|
|
|
extern tree array_type_nelts_top (tree);
|
|
|
|
|
extern tree break_out_target_exprs (tree);
|
|
|
|
|
extern tree get_type_decl (tree);
|
|
|
|
|
extern tree vec_binfo_member (tree, tree);
|
|
|
|
|
extern tree decl_namespace_context (tree);
|
|
|
|
|
extern tree lvalue_type (tree);
|
|
|
|
|
extern tree error_type (tree);
|
|
|
|
|
extern tree build_zc_wrapper (struct z_candidate *);
|
|
|
|
|
extern int varargs_function_p (tree);
|
|
|
|
|
extern int really_overloaded_fn (tree);
|
|
|
|
|
extern bool cp_tree_equal (tree, tree);
|
|
|
|
|
extern tree no_linkage_check (tree);
|
|
|
|
|
extern void debug_binfo (tree);
|
|
|
|
|
extern tree build_dummy_object (tree);
|
|
|
|
|
extern tree maybe_dummy_object (tree, tree *);
|
|
|
|
|
extern int is_dummy_object (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern const struct attribute_spec cxx_attribute_table[];
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree make_ptrmem_cst (tree, tree);
|
|
|
|
|
extern tree cp_build_type_attribute_variant (tree, tree);
|
|
|
|
|
extern tree cp_build_qualified_type_real (tree, int, tsubst_flags_t);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define cp_build_qualified_type(TYPE, QUALS) \
|
2002-05-09 20:02:13 +00:00
|
|
|
|
cp_build_qualified_type_real ((TYPE), (QUALS), tf_error | tf_warning)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_shared_int_cst (int);
|
|
|
|
|
extern special_function_kind special_function_p (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern bool name_p (tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern int count_trees (tree);
|
|
|
|
|
extern int char_type_p (tree);
|
|
|
|
|
extern void verify_stmt_tree (tree);
|
|
|
|
|
extern tree find_tree (tree, tree);
|
|
|
|
|
extern linkage_kind decl_linkage (tree);
|
|
|
|
|
extern tree cp_walk_subtrees (tree*, int*, walk_tree_fn,
|
|
|
|
|
void*, void*);
|
|
|
|
|
extern int cp_cannot_inline_tree_fn (tree*);
|
|
|
|
|
extern tree cp_add_pending_fn_decls (void*,tree);
|
|
|
|
|
extern int cp_is_overload_p (tree);
|
|
|
|
|
extern int cp_auto_var_in_fn_p (tree,tree);
|
|
|
|
|
extern tree cp_copy_res_decl_for_inlining (tree, tree, tree, void*,
|
|
|
|
|
int*, tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in typeck.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern int string_conv_p (tree, tree, int);
|
|
|
|
|
extern tree cp_truthvalue_conversion (tree);
|
|
|
|
|
extern tree condition_conversion (tree);
|
|
|
|
|
extern tree target_type (tree);
|
|
|
|
|
extern tree require_complete_type (tree);
|
|
|
|
|
extern tree complete_type (tree);
|
|
|
|
|
extern tree complete_type_or_diagnostic (tree, tree, int);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define complete_type_or_else(T,V) (complete_type_or_diagnostic ((T), (V), 0))
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern int type_unknown_p (tree);
|
|
|
|
|
extern tree commonparms (tree, tree);
|
|
|
|
|
extern tree original_type (tree);
|
|
|
|
|
extern bool comp_except_specs (tree, tree, bool);
|
|
|
|
|
extern bool comptypes (tree, tree, int);
|
|
|
|
|
extern bool compparms (tree, tree);
|
|
|
|
|
extern int comp_cv_qualification (tree, tree);
|
|
|
|
|
extern int comp_cv_qual_signature (tree, tree);
|
|
|
|
|
extern tree cxx_sizeof_or_alignof_expr (tree, enum tree_code);
|
|
|
|
|
extern tree cxx_sizeof_or_alignof_type (tree, enum tree_code, bool);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define cxx_sizeof_nowarn(T) cxx_sizeof_or_alignof_type (T, SIZEOF_EXPR, false)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree inline_conversion (tree);
|
|
|
|
|
extern tree decay_conversion (tree);
|
|
|
|
|
extern tree perform_integral_promotions (tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
extern tree build_class_member_access_expr (tree, tree, tree, bool);
|
|
|
|
|
extern tree finish_class_member_access_expr (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree build_x_indirect_ref (tree, const char *);
|
|
|
|
|
extern tree build_indirect_ref (tree, const char *);
|
|
|
|
|
extern tree build_array_ref (tree, tree);
|
|
|
|
|
extern tree get_member_function_from_ptrfunc (tree *, tree);
|
|
|
|
|
extern tree convert_arguments (tree, tree, tree, int);
|
|
|
|
|
extern tree build_x_binary_op (enum tree_code, tree, tree,
|
|
|
|
|
bool *);
|
|
|
|
|
extern tree build_x_unary_op (enum tree_code, tree);
|
|
|
|
|
extern tree unary_complex_lvalue (enum tree_code, tree);
|
|
|
|
|
extern tree build_x_conditional_expr (tree, tree, tree);
|
|
|
|
|
extern tree build_x_compound_expr_from_list (tree, const char *);
|
|
|
|
|
extern tree build_x_compound_expr (tree, tree);
|
|
|
|
|
extern tree build_compound_expr (tree, tree);
|
|
|
|
|
extern tree build_static_cast (tree, tree);
|
|
|
|
|
extern tree build_reinterpret_cast (tree, tree);
|
|
|
|
|
extern tree build_const_cast (tree, tree);
|
|
|
|
|
extern tree build_c_cast (tree, tree);
|
|
|
|
|
extern tree build_x_modify_expr (tree, enum tree_code, tree);
|
|
|
|
|
extern tree build_modify_expr (tree, enum tree_code, tree);
|
|
|
|
|
extern tree dubious_conversion_warnings (tree, tree, const char *, tree, int);
|
|
|
|
|
extern tree convert_for_initialization (tree, tree, tree, int, const char *, tree, int);
|
|
|
|
|
extern int comp_ptr_ttypes (tree, tree);
|
|
|
|
|
extern int ptr_reasonably_similar (tree, tree);
|
|
|
|
|
extern tree build_ptrmemfunc (tree, tree, int);
|
|
|
|
|
extern int cp_type_quals (tree);
|
|
|
|
|
extern bool cp_has_mutable_p (tree);
|
|
|
|
|
extern bool at_least_as_qualified_p (tree, tree);
|
|
|
|
|
extern bool more_qualified_p (tree, tree);
|
|
|
|
|
extern tree build_ptrmemfunc1 (tree, tree, tree);
|
|
|
|
|
extern void expand_ptrmemfunc_cst (tree, tree *, tree *);
|
|
|
|
|
extern tree pfn_from_ptrmemfunc (tree);
|
|
|
|
|
extern tree type_after_usual_arithmetic_conversions (tree, tree);
|
|
|
|
|
extern tree composite_pointer_type (tree, tree, tree, tree,
|
|
|
|
|
const char*);
|
|
|
|
|
extern tree merge_types (tree, tree);
|
|
|
|
|
extern tree check_return_expr (tree);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#define cp_build_binary_op(code, arg1, arg2) \
|
|
|
|
|
build_binary_op(code, arg1, arg2, 1)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define cxx_sizeof(T) cxx_sizeof_or_alignof_type (T, SIZEOF_EXPR, true)
|
|
|
|
|
#define cxx_alignof(T) cxx_sizeof_or_alignof_type (T, ALIGNOF_EXPR, true)
|
|
|
|
|
extern tree build_ptrmemfunc_access_expr (tree, tree);
|
|
|
|
|
extern tree build_address (tree);
|
|
|
|
|
extern tree build_nop (tree, tree);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree non_reference (tree);
|
|
|
|
|
extern tree lookup_anon_field (tree, tree);
|
|
|
|
|
extern bool invalid_nonstatic_memfn_p (tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* in typeck2.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void require_complete_eh_spec_types (tree, tree);
|
|
|
|
|
extern void cxx_incomplete_type_diagnostic (tree, tree, int);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#undef cxx_incomplete_type_error
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void cxx_incomplete_type_error (tree, tree);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
#define cxx_incomplete_type_error(V,T) \
|
|
|
|
|
(cxx_incomplete_type_diagnostic ((V), (T), 0))
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern tree error_not_base_type (tree, tree);
|
|
|
|
|
extern tree binfo_or_else (tree, tree);
|
|
|
|
|
extern void readonly_error (tree, const char *, int);
|
|
|
|
|
extern int abstract_virtuals_error (tree, tree);
|
|
|
|
|
|
|
|
|
|
extern tree store_init_value (tree, tree);
|
|
|
|
|
extern tree digest_init (tree, tree, tree *);
|
|
|
|
|
extern tree build_scoped_ref (tree, tree, tree *);
|
|
|
|
|
extern tree build_x_arrow (tree);
|
|
|
|
|
extern tree build_m_component_ref (tree, tree);
|
|
|
|
|
extern tree build_functional_cast (tree, tree);
|
|
|
|
|
extern tree add_exception_specifier (tree, tree, int);
|
|
|
|
|
extern tree merge_exception_specifiers (tree, tree);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* in mangle.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern void init_mangle (void);
|
|
|
|
|
extern void mangle_decl (tree);
|
|
|
|
|
extern const char *mangle_type_string (tree);
|
|
|
|
|
extern tree mangle_type (tree);
|
|
|
|
|
extern tree mangle_typeinfo_for_type (tree);
|
|
|
|
|
extern tree mangle_typeinfo_string_for_type (tree);
|
|
|
|
|
extern tree mangle_vtbl_for_type (tree);
|
|
|
|
|
extern tree mangle_vtt_for_type (tree);
|
|
|
|
|
extern tree mangle_ctor_vtbl_for_type (tree, tree);
|
|
|
|
|
extern tree mangle_thunk (tree, int, tree, tree);
|
|
|
|
|
extern tree mangle_conv_op_name_for_type (tree);
|
|
|
|
|
extern tree mangle_guard_variable (tree);
|
|
|
|
|
extern tree mangle_ref_init_variable (tree);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* in dump.c */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
extern bool cp_dump_tree (void *, tree);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* -- end of C++ */
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* In order for the format checking to accept the C++ frontend
|
|
|
|
|
diagnostic framework extensions, you must include this file before
|
|
|
|
|
toplev.h, not after. */
|
|
|
|
|
#define GCC_DIAG_STYLE __gcc_cxxdiag__
|
|
|
|
|
#if GCC_VERSION >= 3004
|
|
|
|
|
#define ATTRIBUTE_GCC_CXXDIAG(m, n) __attribute__ ((__format__ (GCC_DIAG_STYLE, m, n))) ATTRIBUTE_NONNULL(m)
|
|
|
|
|
#else
|
|
|
|
|
#define ATTRIBUTE_GCC_CXXDIAG(m, n) ATTRIBUTE_NONNULL(m)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
extern void cp_error_at (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1, 2);
|
|
|
|
|
extern void cp_warning_at (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1, 2);
|
|
|
|
|
extern void cp_pedwarn_at (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1, 2);
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#endif /* ! GCC_CP_TREE_H */
|