gcc/ada/ada-tree.h

   1 /****************************************************************************
   2  *                                                                          *
   3  *                         GNAT COMPILER COMPONENTS                         *
   4  *                                                                          *
   5  *                             A D A - T R E E                              *
   6  *                                                                          *
   7  *                              C Header File                               *
   8  *                                                                          *
   9  *          Copyright (C) 1992-2004 Free Software Foundation, Inc.          *
  10  *                                                                          *
  11  * GNAT is free software;  you can  redistribute it  and/or modify it under *
  12  * terms of the  GNU General Public License as published  by the Free Soft- *
  13  * ware  Foundation;  either version 2,  or (at your option) any later ver- *
  14  * sion.  GNAT is distributed in the hope that it will be useful, but WITH- *
  15  * OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY *
  16  * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License *
  17  * for  more details.  You should have  received  a copy of the GNU General *
  18  * Public License  distributed with GNAT;  see file COPYING.  If not, write *
  19  * to  the Free Software Foundation,  59 Temple Place - Suite 330,  Boston, *
  20  * MA 02111-1307, USA.                                                      *
  21  *                                                                          *
  22  * GNAT was originally developed  by the GNAT team at  New York University. *
  23  * Extensive contributions were provided by Ada Core Technologies Inc.      *
  24  *                                                                          *
  25  ****************************************************************************/
  26
  27 /* Ada language-specific GC tree codes.  */
  28 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) SYM,
  29 enum gnat_tree_code {
  30   __DUMMY = LAST_AND_UNUSED_TREE_CODE,
  31 #include "ada-tree.def"
  32   LAST_GNAT_TREE_CODE
  33 };
  34 #undef DEFTREECODE
  35
  36 /* Ada uses the lang_decl and lang_type fields to hold a tree.  */
  37 union lang_tree_node GTY((desc ("0"))) {union tree_node GTY((tag ("0"))) t; };
  38 struct lang_decl GTY(()) {tree t; };
  39 struct lang_type GTY(()) {tree t; };
  40
  41 /* Define macros to get and set the tree in TYPE_ and DECL_LANG_SPECIFIC.  */
  42 #define GET_TYPE_LANG_SPECIFIC(NODE) \
  43   (TYPE_LANG_SPECIFIC (NODE) ? TYPE_LANG_SPECIFIC (NODE)->t : NULL_TREE)
  44 #define SET_TYPE_LANG_SPECIFIC(NODE, X) \
  45  (TYPE_LANG_SPECIFIC (NODE)                     \
  46   = (TYPE_LANG_SPECIFIC (NODE)                  \
  47      ? TYPE_LANG_SPECIFIC (NODE) : ggc_alloc (sizeof (struct lang_type))))   \
  48  ->t = X;
  49
  50 #define GET_DECL_LANG_SPECIFIC(NODE) \
  51   (DECL_LANG_SPECIFIC (NODE) ? DECL_LANG_SPECIFIC (NODE)->t : NULL_TREE)
  52 #define SET_DECL_LANG_SPECIFIC(NODE, VALUE)     \
  53  (DECL_LANG_SPECIFIC (NODE)                     \
  54   = (DECL_LANG_SPECIFIC (NODE)                  \
  55      ? DECL_LANG_SPECIFIC (NODE) : ggc_alloc (sizeof (struct lang_decl))))   \
  56  ->t = VALUE;
  57
  58 /* Flags added to GCC type nodes.  */
  59
  60 /* For RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE, nonzero if this is a
  61    record being used as a fat pointer (only true for RECORD_TYPE).  */
  62 #define TYPE_IS_FAT_POINTER_P(NODE) TYPE_LANG_FLAG_0 (NODE)
  63
  64 #define TYPE_FAT_POINTER_P(NODE)  \
  65   (TREE_CODE (NODE) == RECORD_TYPE && TYPE_IS_FAT_POINTER_P (NODE))
  66
  67 /* For integral types and array types, nonzero if this is a packed array type.
  68    Such types should not be extended to a larger size.  */
  69 #define TYPE_PACKED_ARRAY_TYPE_P(NODE) TYPE_LANG_FLAG_0 (NODE)
  70
  71 #define TYPE_IS_PACKED_ARRAY_TYPE_P(NODE) \
  72   ((TREE_CODE (NODE) == INTEGER_TYPE || TREE_CODE (NODE) == ARRAY_TYPE) \
  73    && TYPE_PACKED_ARRAY_TYPE_P (NODE))
  74
  75 /* For INTEGER_TYPE, nonzero if this is a modular type with a modulus that
  76    is not equal to two to the power of its mode's size.  */
  77 #define TYPE_MODULAR_P(NODE) TYPE_LANG_FLAG_1 (INTEGER_TYPE_CHECK (NODE))
  78
  79 /* For ARRAY_TYPE, nonzero if this type corresponds to a dimension of
  80    an Ada array other than the first.  */
  81 #define TYPE_MULTI_ARRAY_P(NODE)  TYPE_LANG_FLAG_1 (ARRAY_TYPE_CHECK (NODE))
  82
  83 /* For FUNCTION_TYPE, nonzero if this denotes a function returning an
  84    unconstrained array or record.  */
  85 #define TYPE_RETURNS_UNCONSTRAINED_P(NODE) \
  86   TYPE_LANG_FLAG_1 (FUNCTION_TYPE_CHECK (NODE))
  87
  88 /* For RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE, nonzero if this denotes
  89    a left-justified modular type (will only be true for RECORD_TYPE).  */
  90 #define TYPE_LEFT_JUSTIFIED_MODULAR_P(NODE) \
  91   TYPE_LANG_FLAG_1 (RECORD_OR_UNION_CHECK (NODE))
  92
  93 /* Nonzero in an arithmetic subtype if this is a subtype not known to the
  94    front-end.  */
  95 #define TYPE_EXTRA_SUBTYPE_P(NODE) TYPE_LANG_FLAG_2 (NODE)
  96
  97 /* Nonzero for composite types if this is a by-reference type.  */
  98 #define TYPE_BY_REFERENCE_P(NODE) TYPE_LANG_FLAG_2 (NODE)
  99
 100 /* For RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE, nonzero if this is the
 101    type for an object whose type includes its template in addition to
 102    its value (only true for RECORD_TYPE).  */
 103 #define TYPE_CONTAINS_TEMPLATE_P(NODE) \
 104   TYPE_LANG_FLAG_3 (RECORD_OR_UNION_CHECK (NODE))
 105
 106 /* For INTEGER_TYPE, nonzero if this really represents a VAX
 107    floating-point type.  */
 108 #define TYPE_VAX_FLOATING_POINT_P(NODE)  \
 109   TYPE_LANG_FLAG_3 (INTEGER_TYPE_CHECK (NODE))
 110
 111 /* True if NODE is a thin pointer.  */
 112 #define TYPE_THIN_POINTER_P(NODE)                       \
 113   (POINTER_TYPE_P (NODE)                                \
 114    && TREE_CODE (TREE_TYPE (NODE)) == RECORD_TYPE       \
 115    && TYPE_CONTAINS_TEMPLATE_P (TREE_TYPE (NODE)))
 116
 117 /* True if TYPE is either a fat or thin pointer to an unconstrained
 118    array.  */
 119 #define TYPE_FAT_OR_THIN_POINTER_P(NODE) \
 120   (TYPE_FAT_POINTER_P (NODE) || TYPE_THIN_POINTER_P (NODE))
 121
 122 /* For INTEGER_TYPEs, nonzero if the type has a biased representation.  */
 123 #define TYPE_BIASED_REPRESENTATION_P(NODE) \
 124   TYPE_LANG_FLAG_4 (INTEGER_TYPE_CHECK (NODE))
 125
 126 /* For ARRAY_TYPEs, nonzero if the array type has Convention_Fortran.  */
 127 #define TYPE_CONVENTION_FORTRAN_P(NODE) \
 128   TYPE_LANG_FLAG_4 (ARRAY_TYPE_CHECK (NODE))
 129
 130 /* For FUNCTION_TYPEs, nonzero if the function returns by reference.  */
 131 #define TYPE_RETURNS_BY_REF_P(NODE) \
 132   TYPE_LANG_FLAG_4 (FUNCTION_TYPE_CHECK (NODE))
 133
 134 /* For VOID_TYPE, ENUMERAL_TYPE, UNION_TYPE, and RECORD_TYPE, nonzero if this
 135    is a dummy type, made to correspond to a private or incomplete type.  */
 136 #define TYPE_DUMMY_P(NODE) TYPE_LANG_FLAG_4 (NODE)
 137
 138 /* True if TYPE is such a dummy type.  */
 139 #define TYPE_IS_DUMMY_P(NODE) \
 140   ((TREE_CODE (NODE) == VOID_TYPE || TREE_CODE (NODE) == RECORD_TYPE    \
 141     || TREE_CODE (NODE) == UNION_TYPE || TREE_CODE (NODE) == ENUMERAL_TYPE) \
 142    && TYPE_DUMMY_P (NODE))
 143
 144 /* For an INTEGER_TYPE, nonzero if TYPE_ACTUAL_BOUNDS is present.  */
 145 #define TYPE_HAS_ACTUAL_BOUNDS_P(NODE) \
 146   TYPE_LANG_FLAG_5 (INTEGER_TYPE_CHECK (NODE))
 147
 148 /* For a RECORD_TYPE, nonzero if this was made just to supply needed
 149    padding or alignment.  */
 150 #define TYPE_IS_PADDING_P(NODE) TYPE_LANG_FLAG_5 (RECORD_TYPE_CHECK (NODE))
 151
 152 /* This field is only defined for FUNCTION_TYPE nodes. If the Ada
 153    subprogram contains no parameters passed by copy in/copy out then this
 154    field is 0. Otherwise it points to a list of nodes used to specify the
 155    return values of the out (or in out) parameters that qualify to be passed
 156    by copy in copy out.  It is a CONSTRUCTOR.  For a full description of the
 157    cico parameter passing mechanism refer to the routine gnat_to_gnu_entity. */
 158 #define TYPE_CI_CO_LIST(NODE)  TYPE_LANG_SLOT_1 (FUNCTION_TYPE_CHECK (NODE))
 159
 160 /* For an INTEGER_TYPE with TYPE_MODULAR_P, this is the value of the
 161    modulus. */
 162 #define TYPE_MODULUS(NODE) GET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE))
 163 #define SET_TYPE_MODULUS(NODE, X)  \
 164   SET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE), X)
 165
 166 /* For an INTEGER_TYPE that is the TYPE_DOMAIN of some ARRAY_TYPE, points to
 167    the type corresponding to the Ada index type.  */
 168 #define TYPE_INDEX_TYPE(NODE) \
 169   GET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE))
 170 #define SET_TYPE_INDEX_TYPE(NODE, X) \
 171   SET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE), X)
 172
 173 /* For an INTEGER_TYPE with TYPE_VAX_FLOATING_POINT_P, stores the
 174    Digits_Value.  */
 175 #define TYPE_DIGITS_VALUE(NODE) \
 176   GET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE))
 177 #define SET_TYPE_DIGITS_VALUE(NODE, X)  \
 178   SET_TYPE_LANG_SPECIFIC (INTEGER_TYPE_CHECK (NODE), X)
 179
 180 /* For numeric types, stores the RM_Size of the type.  */
 181 #define TYPE_RM_SIZE_NUM(NODE)  TYPE_LANG_SLOT_1 (NUMERICAL_TYPE_CHECK (NODE))
 182
 183 #define TYPE_RM_SIZE(NODE)                                      \
 184   (INTEGRAL_TYPE_P (NODE) || TREE_CODE (NODE) == REAL_TYPE      \
 185    ? TYPE_RM_SIZE_NUM (NODE) : 0)
 186
 187 /* For a RECORD_TYPE that is a fat pointer, point to the type for the
 188    unconstrained object.  Likewise for a RECORD_TYPE that is pointed
 189    to by a thin pointer.  */
 190 #define TYPE_UNCONSTRAINED_ARRAY(NODE)  \
 191   GET_TYPE_LANG_SPECIFIC (RECORD_TYPE_CHECK (NODE))
 192 #define SET_TYPE_UNCONSTRAINED_ARRAY(NODE, X)  \
 193   SET_TYPE_LANG_SPECIFIC (RECORD_TYPE_CHECK (NODE), X)
 194
 195 /* For other RECORD_TYPEs and all UNION_TYPEs and QUAL_UNION_TYPEs, the Ada
 196    size of the object.  This differs from the GCC size in that it does not
 197    include any rounding up to the alignment of the type.  */
 198 #define TYPE_ADA_SIZE(NODE)   \
 199   GET_TYPE_LANG_SPECIFIC (RECORD_OR_UNION_CHECK (NODE))
 200 #define SET_TYPE_ADA_SIZE(NODE, X) \
 201   SET_TYPE_LANG_SPECIFIC (RECORD_OR_UNION_CHECK (NODE), X)
 202
 203 /* For an INTEGER_TYPE with TYPE_HAS_ACTUAL_BOUNDS_P or an ARRAY_TYPE, this is
 204    the index type that should be used when the actual bounds are required for
 205    a template.  This is used in the case of packed arrays.  */
 206 #define TYPE_ACTUAL_BOUNDS(NODE)   \
 207   GET_TYPE_LANG_SPECIFIC (TREE_CHECK2 (NODE, INTEGER_TYPE, ARRAY_TYPE))
 208 #define SET_TYPE_ACTUAL_BOUNDS(NODE, X) \
 209   SET_TYPE_LANG_SPECIFIC (TREE_CHECK2 (NODE, INTEGER_TYPE, ARRAY_TYPE), X)
 210
 211 /* In an UNCONSTRAINED_ARRAY_TYPE, points to the record containing both
 212    the template and object.
 213
 214    ??? We also put this on an ENUMERAL_TYPE that's dummy.  Technically,
 215    this is a conflict on the minval field, but there doesn't seem to be
 216    simple fix, so we'll live with this kludge for now.  */
 217 #define TYPE_OBJECT_RECORD_TYPE(NODE) \
 218   (TREE_CHECK2 ((NODE), UNCONSTRAINED_ARRAY_TYPE, ENUMERAL_TYPE)->type.minval)
 219
 220 /* Nonzero in a FUNCTION_DECL that represents a stubbed function
 221    discriminant.  */
 222 #define DECL_STUBBED_P(NODE) DECL_LANG_FLAG_0 (FUNCTION_DECL_CHECK (NODE))
 223
 224 /* Nonzero if this decl is always used by reference; i.e., an INDIRECT_REF
 225    is needed to access the object.  */
 226 #define DECL_BY_REF_P(NODE) DECL_LANG_FLAG_1 (NODE)
 227
 228 /* Nonzero if this decl is a PARM_DECL for an Ada array being passed to a
 229    foreign convention subprogram.  */
 230 #define DECL_BY_COMPONENT_PTR_P(NODE) DECL_LANG_FLAG_2 (PARM_DECL_CHECK (NODE))
 231
 232 /* Nonzero in a FIELD_DECL that is a dummy built for some internal reason.  */
 233 #define DECL_INTERNAL_P(NODE) DECL_LANG_FLAG_3 (FIELD_DECL_CHECK (NODE))
 234
 235 /* Nonzero in a FUNCTION_DECL that corresponds to an elaboration procedure.  */
 236 #define DECL_ELABORATION_PROC_P(NODE) \
 237   DECL_LANG_FLAG_3 (FUNCTION_DECL_CHECK (NODE))
 238
 239 /* Nonzero if this is a decl for a pointer that points to something which
 240    is readonly.  Used mostly for fat pointers.  */
 241 #define DECL_POINTS_TO_READONLY_P(NODE) DECL_LANG_FLAG_4 (NODE)
 242
 243 /* Nonzero in a FIELD_DECL if there was a record rep clause.  */
 244 #define DECL_HAS_REP_P(NODE) DECL_LANG_FLAG_5 (FIELD_DECL_CHECK (NODE))
 245
 246 /* Nonzero in a PARM_DECL if we are to pass by descriptor.  */
 247 #define DECL_BY_DESCRIPTOR_P(NODE) DECL_LANG_FLAG_5 (PARM_DECL_CHECK (NODE))
 248
 249 /* In a CONST_DECL, points to a VAR_DECL that is allocatable to
 250    memory.  Used when a scalar constant is aliased or has its
 251    address taken.  */
 252 #define DECL_CONST_CORRESPONDING_VAR(NODE) \
 253   GET_DECL_LANG_SPECIFIC (CONST_DECL_CHECK (NODE))
 254 #define SET_DECL_CONST_CORRESPONDING_VAR(NODE, X) \
 255   SET_DECL_LANG_SPECIFIC (CONST_DECL_CHECK (NODE), X)
 256
 257 /* In a FIELD_DECL, points to the FIELD_DECL that was the ultimate
 258    source of the decl.  */
 259 #define DECL_ORIGINAL_FIELD(NODE) \
 260   GET_DECL_LANG_SPECIFIC (FIELD_DECL_CHECK (NODE))
 261 #define SET_DECL_ORIGINAL_FIELD(NODE, X) \
 262   SET_DECL_LANG_SPECIFIC (FIELD_DECL_CHECK (NODE), X)
 263
 264 /* In a FIELD_DECL corresponding to a discriminant, contains the
 265    discriminant number.  */
 266 #define DECL_DISCRIMINANT_NUMBER(NODE) DECL_INITIAL (FIELD_DECL_CHECK (NODE))
 267
 268 /* Define fields and macros for statements.
 269
 270    Start by defining which tree codes are used for statements.  */
 271 #define IS_STMT(NODE)           (TREE_CODE_CLASS (TREE_CODE (NODE)) == 's')
 272 #define IS_ADA_STMT(NODE)       (IS_STMT (NODE)                         \
 273                                  && TREE_CODE (NODE) >= STMT_STMT)
 274
 275 #define STMT_STMT_STMT(NODE)    TREE_OPERAND_CHECK_CODE (NODE, STMT_STMT, 0)
 276 #define LOOP_STMT_TOP_COND(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_STMT, 0)
 277 #define LOOP_STMT_BOT_COND(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_STMT, 1)
 278 #define LOOP_STMT_UPDATE(NODE)  TREE_OPERAND_CHECK_CODE (NODE, LOOP_STMT, 2)
 279 #define LOOP_STMT_BODY(NODE)    TREE_OPERAND_CHECK_CODE (NODE, LOOP_STMT, 3)
 280 #define LOOP_STMT_LABEL(NODE)   TREE_OPERAND_CHECK_CODE (NODE, LOOP_STMT, 4)
 281 #define EXIT_STMT_COND(NODE)    TREE_OPERAND_CHECK_CODE (NODE, EXIT_STMT, 0)
 282 #define EXIT_STMT_LABEL(NODE)   TREE_OPERAND_CHECK_CODE (NODE, EXIT_STMT, 1)
 283 #define REGION_STMT_BODY(NODE)  TREE_OPERAND_CHECK_CODE (NODE, REGION_STMT, 0)
 284 #define REGION_STMT_HANDLE(NODE) TREE_OPERAND_CHECK_CODE (NODE, REGION_STMT, 1)
 285 #define REGION_STMT_BLOCK(NODE) TREE_OPERAND_CHECK_CODE (NODE, REGION_STMT, 2)
 286 #define HANDLER_STMT_ARG(NODE) TREE_OPERAND_CHECK_CODE (NODE, HANDLER_STMT, 0)
 287 #define HANDLER_STMT_LIST(NODE) TREE_OPERAND_CHECK_CODE (NODE, HANDLER_STMT, 1)
 288 #define HANDLER_STMT_BLOCK(NODE) TREE_OPERAND_CHECK_CODE (NODE, HANDLER_STMT, 2)