gcc/ada/ada-tree.def

   1 /****************************************************************************
   2  *                                                                          *
   3  *                         GNAT COMPILER COMPONENTS                         *
   4  *                                                                          *
   5  *                       GNAT-SPECIFIC GCC TREE CODES                       *
   6  *                                                                          *
   7  *                              Specification                               *
   8  *                                                                          *
   9  *          Copyright (C) 1992-2003 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 /* A GNAT tree node to transform to a GCC tree.  This is only used when the
  28    node would generate code, rather then just a tree, and we are in the global
  29    context.
  30
  31    The only field used is TREE_COMPLEXITY, which contains the GNAT node
  32    number.  */
  33
  34 DEFTREECODE (TRANSFORM_EXPR, "transform_expr", 'e', 0)
  35
  36 /* Dynamically allocate on the stack a number of bytes of memory given
  37    by operand 0 at the alignment given by operand 1 and return the
  38    address of the resulting memory.  */
  39
  40 DEFTREECODE (ALLOCATE_EXPR, "allocate_expr", '2', 2)
  41
  42 /* A type that is an unconstrained array itself.  This node is never passed
  43    to GCC. TREE_TYPE is the type of the fat pointer and TYPE_OBJECT_RECORD_TYPE
  44    is the type of a record containing the template and data.  */
  45
  46 DEFTREECODE (UNCONSTRAINED_ARRAY_TYPE, "unconstrained_array_type", 't', 0)
  47
  48 /* A reference to an unconstrained array.  This node only exists as an
  49    intermediate node during the translation of a GNAT tree to a GCC tree;
  50    it is never passed to GCC.  The only field used is operand 0, which
  51    is the fat pointer object.  */
  52
  53 DEFTREECODE (UNCONSTRAINED_ARRAY_REF, "unconstrained_array_ref", 'r', 1)
  54
  55 /* An expression that returns an RTL suitable for its type.  Operand 0
  56    is an expression to be evaluated for side effects only.  */
  57
  58 DEFTREECODE (NULL_EXPR, "null_expr", 'e', 1)
  59
  60 /* An expression that emits a USE for its single operand.  */
  61
  62 DEFTREECODE (USE_EXPR, "use_expr", 'e', 1)
  63
  64 /* Same as ADDR_EXPR, except that if the operand represents a bit field,
  65    return the address of the byte containing the bit.  This is used
  66    for the 'Address attribute and never shows up in the tree.  */
  67 DEFTREECODE (ATTR_ADDR_EXPR, "attr_addr_expr", 'r', 1)
  68
  69 /* An expression that is treated as a conversion while generating code, but is
  70    used to prevent infinite recursion when conversions of biased types are
  71    involved.  */
  72
  73 DEFTREECODE (GNAT_NOP_EXPR, "gnat_nop_expr", '1', 1)
  74
  75 /* This is used as a place to store the ID of a loop.
  76
  77    ??? This should be redone at some point.  */
  78
  79 DEFTREECODE (GNAT_LOOP_ID, "gnat_loop_id", 'x', 0)
  80
  81 /* Here are the tree codes for the statement types known to Ada.  These
  82    must be at the end of this file to allow IS_STMT to work.
  83
  84    We start with an expression statement, whose only operand is an
  85    expression, EXPR_STMT_EXPR, Execution of the statement means evaluation of
  86    the expression (such as a MODIFY_EXPR) and discarding its result.  */
  87 DEFTREECODE (EXPR_STMT, "expr_stmt", 's', 1)
  88
  89 /* This represents a list of statements.  BLOCK_STMT_LIST is a list
  90    statement tree, chained via TREE_CHAIN.  */
  91 DEFTREECODE (BLOCK_STMT, "block_stmt", 's', 1)
  92
  93 /* This is an IF statement.  IF_STMT_COND is the condition being tested,
  94    IF_STMT_TRUE is the statement to be executed if the condition is
  95    true; IF_STMT_ELSEIF, if non-null, is a list of more IF_STMT nodes (where
  96    we only look at IF_STMT_COND and IF_STMT_TRUE) that correspond to
  97    any "else if" parts; and IF_STMT_ELSE is the statement to be executed if
  98    all conditions are.  */
  99 DEFTREECODE (IF_STMT, "if_stmt", 's', 4)
 100
 101 /* A goto just points to the label: GOTO_STMT_LABEL.  */
 102 DEFTREECODE (GOTO_STMT, "goto_stmt", 's', 1)
 103
 104 /* A label: LABEL_STMT_LABEL is the label and LABEL_STMT_FIRST_IN_EH is set
 105    if this is the first label of an exception handler.  */
 106 DEFTREECODE (LABEL_STMT, "label_stmt", 's', 1)
 107
 108 /* A "return".  RETURN_STMT_EXPR is the value to return if non-null.  */
 109 DEFTREECODE (RETURN_STMT, "return_stmt", 's', 1)