cp-tree.def revision 117395
1/* This file contains the definitions and documentation for the 2 additional tree codes used in the GNU C++ compiler (see tree.def 3 for the standard codes). 4 Copyright (C) 1987, 1988, 1990, 1993, 1997, 1998, 5 1999, 2000, 2001 Free Software Foundation, Inc. 6 Hacked by Michael Tiemann (tiemann@cygnus.com) 7 8This file is part of GNU CC. 9 10GNU CC is free software; you can redistribute it and/or modify 11it under the terms of the GNU General Public License as published by 12the Free Software Foundation; either version 2, or (at your option) 13any later version. 14 15GNU CC is distributed in the hope that it will be useful, 16but WITHOUT ANY WARRANTY; without even the implied warranty of 17MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18GNU General Public License for more details. 19 20You should have received a copy of the GNU General Public License 21along with GNU CC; see the file COPYING. If not, write to 22the Free Software Foundation, 59 Temple Place - Suite 330, 23Boston, MA 02111-1307, USA. */ 24 25 26/* An OFFSET_REF is used in two situations: 27 28 1. An expression of the form `A::m' where `A' is a class and `m' is 29 a non-static data member. In this case, operand 0 will be a 30 TYPE (corresponding to `A') and operand 1 will be a FIELD_DECL 31 (corresponding to `m'. 32 33 The expression is a pointer-to-member if its address is taken, 34 but simply denotes a member of the object if its address isnot 35 taken. In the latter case, resolve_offset_ref is used to 36 convert it to a representation of the member referred to by the 37 OFFSET_REF. 38 39 2. An expression of the form `x.*p'. In this case, operand 0 will 40 be an expression corresponding to `x' and operand 1 will be an 41 expression with pointer-to-member type. 42 43 OFFSET_REFs are only used during the parsing phase; once semantic 44 analysis has taken place they are eliminated. */ 45DEFTREECODE (OFFSET_REF, "offset_ref", 'r', 2) 46 47/* A pointer-to-member constant. For a pointer-to-member constant 48 `X::Y' The PTRMEM_CST_CLASS is the RECORD_TYPE for `X' and the 49 PTRMEM_CST_MEMBER is the _DECL for `Y'. */ 50DEFTREECODE (PTRMEM_CST, "ptrmem_cst", 'c', 2) 51 52/* For NEW_EXPR, operand 0 is the placement list. 53 Operand 1 is the new-declarator. 54 Operand 2 is the initializer. */ 55DEFTREECODE (NEW_EXPR, "nw_expr", 'e', 3) 56DEFTREECODE (VEC_NEW_EXPR, "vec_nw_expr", 'e', 3) 57 58/* For DELETE_EXPR, operand 0 is the store to be destroyed. 59 Operand 1 is the value to pass to the destroying function 60 saying whether the store should be deallocated as well. */ 61DEFTREECODE (DELETE_EXPR, "dl_expr", 'e', 2) 62DEFTREECODE (VEC_DELETE_EXPR, "vec_dl_expr", 'e', 2) 63 64/* Value is reference to particular overloaded class method. 65 Operand 0 is the class name (an IDENTIFIER_NODE); 66 operand 1 is the field (also an IDENTIFIER_NODE). 67 The COMPLEXITY field holds the class level (usually 0). */ 68DEFTREECODE (SCOPE_REF, "scope_ref", 'r', 2) 69 70/* When composing an object with a member, this is the result. 71 Operand 0 is the object. Operand 1 is the member (usually 72 a dereferenced pointer to member). */ 73DEFTREECODE (MEMBER_REF, "member_ref", 'r', 2) 74 75/* Type conversion operator in C++. TREE_TYPE is type that this 76 operator converts to. Operand is expression to be converted. */ 77DEFTREECODE (TYPE_EXPR, "type_expr", 'e', 1) 78 79/* For AGGR_INIT_EXPR, operand 0 is function which performs initialization, 80 operand 1 is argument list to initialization function, 81 and operand 2 is the slot which was allocated for this expression. */ 82DEFTREECODE (AGGR_INIT_EXPR, "aggr_init_expr", 'e', 3) 83 84/* A throw expression. operand 0 is the expression, if there was one, 85 else it is NULL_TREE. */ 86DEFTREECODE (THROW_EXPR, "throw_expr", 'e', 1) 87 88/* An empty class object. The TREE_TYPE gives the class type. We use 89 these to avoid actually creating instances of the empty classes. */ 90DEFTREECODE (EMPTY_CLASS_EXPR, "empty_class_expr", 'e', 0) 91 92/* A reference to a member function or member functions from a base 93 class. BASELINK_FUNCTIONS gives the FUNCTION_DECL, 94 TEMPLATE_DECL, OVERLOAD, or TEMPLATE_ID_EXPR corresponding to the 95 functions. BASELINK_BINFO gives the base from which the functions 96 come, i.e., the base to which the `this' pointer must be converted 97 before the functions are called. BASELINK_ACCESS_BINFO gives the 98 base used to name the functions. 99 100 A BASELINK is an expression; the TREE_TYPE of the BASELINK gives 101 the type of the expression. This type is either a FUNCTION_TYPE, 102 METHOD_TYPE, or `unknown_type_node' indicating that the function is 103 overloaded. */ 104DEFTREECODE (BASELINK, "baselink", 'e', 3) 105 106/* Template definition. The following fields have the specified uses, 107 although there are other macros in cp-tree.h that should be used for 108 accessing this data. 109 DECL_ARGUMENTS template parm vector 110 DECL_TEMPLATE_INFO template text &c 111 DECL_VINDEX list of instantiations already produced; 112 only done for functions so far 113 For class template: 114 DECL_INITIAL associated templates (methods &c) 115 DECL_TEMPLATE_RESULT null 116 For non-class templates: 117 TREE_TYPE type of object to be constructed 118 DECL_TEMPLATE_RESULT decl for object to be created 119 (e.g., FUNCTION_DECL with tmpl parms used) 120 */ 121DEFTREECODE (TEMPLATE_DECL, "template_decl", 'd', 0) 122 123/* Index into a template parameter list. The TEMPLATE_PARM_IDX gives 124 the index (from 0) of the parameter, while the TEMPLATE_PARM_LEVEL 125 gives the level (from 1) of the parameter. 126 127 Here's an example: 128 129 template <class T> // Index 0, Level 1. 130 struct S 131 { 132 template <class U, // Index 0, Level 2. 133 class V> // Index 1, Level 2. 134 void f(); 135 }; 136 137 The DESCENDANTS will be a chain of TEMPLATE_PARM_INDEXs descended 138 from this one. The first descendant will have the same IDX, but 139 its LEVEL will be one less. The TREE_CHAIN field is used to chain 140 together the descendants. The TEMPLATE_PARM_DECL is the 141 declaration of this parameter, either a TYPE_DECL or CONST_DECL. 142 The TEMPLATE_PARM_ORIG_LEVEL is the LEVEL of the most distant 143 parent, i.e., the LEVEL that the parameter originally had when it 144 was declared. For example, if we instantiate S<int>, we will have: 145 146 struct S<int> 147 { 148 template <class U, // Index 0, Level 1, Orig Level 2 149 class V> // Index 1, Level 1, Orig Level 2 150 void f(); 151 }; 152 153 The LEVEL is the level of the parameter when we are worrying about 154 the types of things; the ORIG_LEVEL is the level when we are 155 worrying about instantiating things. */ 156DEFTREECODE (TEMPLATE_PARM_INDEX, "template_parm_index", 'x', 157 /* The addition of (sizeof(tree) - 1) in the next expression 158 is to handle the case when padding pushes us past an even 159 multiple of sizeof(tree). */ 160 /* We used to try to calculate this using 161 1+3*sizeof(HOST_WIDE_INT), but that fails if alignment 162 makes it bigger. */ 163 ((sizeof (template_parm_index) - sizeof (struct tree_common)) 164 + sizeof (tree) - 1) 165 / sizeof (tree)) 166 167/* Index into a template parameter list. This parameter must be a type. 168 The TYPE_FIELDS value will be a TEMPLATE_PARM_INDEX. */ 169DEFTREECODE (TEMPLATE_TYPE_PARM, "template_type_parm", 't', 0) 170 171/* Index into a template parameter list for template template parameters. 172 This parameter must be a type. The TYPE_FIELDS value will be a 173 TEMPLATE_PARM_INDEX. 174 175 It is used without template arguments like TT in C<TT>, 176 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO is NULL_TREE 177 and TYPE_NAME is a TEMPLATE_DECL. */ 178DEFTREECODE (TEMPLATE_TEMPLATE_PARM, "template_template_parm", 't', 0) 179 180/* Like TEMPLATE_TEMPLATE_PARM it is used with bound template arguments 181 like TT<int>. 182 In this case, TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO contains the 183 template name and its bound arguments. TYPE_NAME is a TYPE_DECL. */ 184DEFTREECODE (BOUND_TEMPLATE_TEMPLATE_PARM, "bound_template_template_parm", 't', 0) 185 186/* A type designated by `typename T::t'. TYPE_CONTEXT is `T', 187 TYPE_NAME is an IDENTIFIER_NODE for `t'. If the type was named via 188 template-id, TYPENAME_TYPE_FULLNAME will hold the TEMPLATE_ID_EXPR. 189 If TREE_TYPE is present, this type was generated by the implicit 190 typename extension, and the TREE_TYPE is a _TYPE from a baseclass 191 of `T'. */ 192DEFTREECODE (TYPENAME_TYPE, "typename_type", 't', 0) 193 194/* For template template argument of the form `T::template C'. 195 TYPE_CONTEXT is `T', the template parameter dependent object. 196 TYPE_NAME is an IDENTIFIER_NODE for `C', the member class template. */ 197DEFTREECODE (UNBOUND_CLASS_TEMPLATE, "unbound_class_template", 't', 0) 198 199/* A type designated by `__typeof (expr)'. TYPE_FIELDS is the 200 expression in question. */ 201DEFTREECODE (TYPEOF_TYPE, "typeof_type", 't', 0) 202 203/* A using declaration. DECL_INITIAL contains the specified scope. 204 This is not an alias, but is later expanded into multiple aliases. */ 205DEFTREECODE (USING_DECL, "using_decl", 'd', 0) 206 207/* A using directive. The operand is USING_STMT_NAMESPACE. */ 208DEFTREECODE (USING_STMT, "using_directive", 'e', 1) 209 210/* An un-parsed default argument. Looks like an IDENTIFIER_NODE. */ 211DEFTREECODE (DEFAULT_ARG, "default_arg", 'x', 2) 212 213/* A template-id, like foo<int>. The first operand is the template. 214 The second is the TREE_LIST or TREE_VEC of explicitly specified 215 arguments. The template will be a FUNCTION_DECL, TEMPLATE_DECL, or 216 an OVERLOAD. If the template-id refers to a member template, the 217 template may be an IDENTIFIER_NODE. In an uninstantiated template, 218 the template may be a LOOKUP_EXPR. */ 219DEFTREECODE (TEMPLATE_ID_EXPR, "template_id_expr", 'e', 2) 220 221/* A list-like node for chaining overloading candidates. TREE_TYPE is 222 the original name, and the parameter is the FUNCTION_DECL. */ 223DEFTREECODE (OVERLOAD, "overload", 'x', 1) 224 225/* A generic wrapper for something not tree that we want to include in 226 tree structure. */ 227DEFTREECODE (WRAPPER, "wrapper", 'x', 1) 228 229/* Used to represent deferred name lookup for dependent names while 230 parsing a template declaration. The first argument is an 231 IDENTIFIER_NODE for the name in question. The TREE_TYPE is 232 unused. */ 233DEFTREECODE (LOOKUP_EXPR, "lookup_expr", 'e', 1) 234 235/* A whole bunch of tree codes for the initial, superficial parsing of 236 templates. */ 237DEFTREECODE (MODOP_EXPR, "modop_expr", 'e', 3) 238DEFTREECODE (CAST_EXPR, "cast_expr", '1', 1) 239DEFTREECODE (REINTERPRET_CAST_EXPR, "reinterpret_cast_expr", '1', 1) 240DEFTREECODE (CONST_CAST_EXPR, "const_cast_expr", '1', 1) 241DEFTREECODE (STATIC_CAST_EXPR, "static_cast_expr", '1', 1) 242DEFTREECODE (DYNAMIC_CAST_EXPR, "dynamic_cast_expr", '1', 1) 243DEFTREECODE (DOTSTAR_EXPR, "dotstar_expr", 'e', 2) 244DEFTREECODE (TYPEID_EXPR, "typeid_expr", 'e', 1) 245DEFTREECODE (PSEUDO_DTOR_EXPR, "pseudo_dtor_expr", 'e', 3) 246 247/* CTOR_INITIALIZER is a placeholder in template code for a call to 248 setup_vtbl_pointer (and appears in all functions, not just ctors). */ 249DEFTREECODE (CTOR_INITIALIZER, "ctor_initializer", 'e', 1) 250DEFTREECODE (RETURN_INIT, "return_init", 'e', 2) 251DEFTREECODE (TRY_BLOCK, "try_block", 'e', 2) 252DEFTREECODE (EH_SPEC_BLOCK, "eh_spec_block", 'e', 2) 253/* A HANDLER wraps a catch handler for the HANDLER_TYPE. If this is 254 CATCH_ALL_TYPE, then the handler catches all types. The declaration of 255 the catch variable is in HANDLER_PARMS, and the body block in 256 HANDLER_BODY. */ 257DEFTREECODE (HANDLER, "handler", 'e', 2) 258 259/* A MUST_NOT_THROW_EXPR wraps an expression that may not 260 throw, and must call terminate if it does. */ 261DEFTREECODE (MUST_NOT_THROW_EXPR, "must_not_throw_expr", 'e', 1) 262 263DEFTREECODE (TAG_DEFN, "tag_defn", 'e', 0) 264 265/* The following codes are used to represent implicit conversion 266 sequences, in the sense of [over.best.ics]. The conversion 267 sequences are connected through their first operands, with the 268 first conversion to be performed at the end of the chain. 269 270 The innermost conversion (i.e, the one at the end of the chain) is 271 always an IDENTITY_CONV, corresponding to the identity conversion. */ 272 273DEFTREECODE (IDENTITY_CONV, "identity_conv", 'e', 1) 274DEFTREECODE (LVALUE_CONV, "lvalue_conv", 'e', 1) 275DEFTREECODE (QUAL_CONV, "qual_conv", 'e', 1) 276DEFTREECODE (STD_CONV, "std_conv", 'e', 1) 277DEFTREECODE (PTR_CONV, "ptr_conv", 'e', 1) 278DEFTREECODE (PMEM_CONV, "pmem_conv", 'e', 1) 279DEFTREECODE (BASE_CONV, "base_conv", 'e', 1) 280DEFTREECODE (REF_BIND, "ref_bind", 'e', 1) 281DEFTREECODE (USER_CONV, "user_conv", 'e', 2) 282DEFTREECODE (AMBIG_CONV, "ambig_conv", 'e', 1) 283DEFTREECODE (RVALUE_CONV, "rvalue_conv", 'e', 1) 284 285/* 286Local variables: 287mode:c 288End: 289*/ 290