gcc/ada/gcc-interface/ada-tree.def

   1 /****************************************************************************
   2  *                                                                          *
   3  *                         GNAT COMPILER COMPONENTS                         *
   4  *                                                                          *
   5  *                       GNAT-SPECIFIC GCC TREE CODES                       *
   6  *                                                                          *
   7  *                              Specification                               *
   8  *                                                                          *
   9  *            Copyright (C) 1992-2008, 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 3,  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 along with GCC; see the file COPYING3.  If not see        *
  19  * <http://www.gnu.org/licenses/>.                                          *
  20  *                                                                          *
  21  * GNAT was originally developed  by the GNAT team at  New York University. *
  22  * Extensive contributions were provided by Ada Core Technologies Inc.      *
  23  *                                                                          *
  24  ****************************************************************************/
  25
  26 /* A type that is an unconstrained array itself.  This node is never passed
  27    to GCC. TREE_TYPE is the type of the fat pointer and TYPE_OBJECT_RECORD_TYPE
  28    is the type of a record containing the template and data.  */
  29
  30 DEFTREECODE (UNCONSTRAINED_ARRAY_TYPE, "unconstrained_array_type", tcc_type, 0)
  31
  32 /* A reference to an unconstrained array.  This node only exists as an
  33    intermediate node during the translation of a GNAT tree to a GCC tree;
  34    it is never passed to GCC.  The only field used is operand 0, which
  35    is the fat pointer object.  */
  36
  37 DEFTREECODE (UNCONSTRAINED_ARRAY_REF, "unconstrained_array_ref",
  38             tcc_reference, 1)
  39
  40 /* An expression that returns an RTL suitable for its type.  Operand 0
  41    is an expression to be evaluated for side effects only.  */
  42 DEFTREECODE (NULL_EXPR, "null_expr", tcc_expression, 1)
  43
  44 /* Same as PLUS_EXPR, except that no modulo reduction is applied.
  45    This is used for loops and never shows up in the tree.  */
  46 DEFTREECODE (PLUS_NOMOD_EXPR, "plus_nomod_expr", tcc_binary, 2)
  47
  48 /* Same as MINUS_EXPR, except that no modulo reduction is applied.
  49    This is used for loops and never shows up in the tree.  */
  50 DEFTREECODE (MINUS_NOMOD_EXPR, "minus_nomod_expr", tcc_binary, 2)
  51
  52 /* Same as ADDR_EXPR, except that if the operand represents a bit field,
  53    return the address of the byte containing the bit.  This is used
  54    for the 'Address attribute and never shows up in the tree.  */
  55 DEFTREECODE (ATTR_ADDR_EXPR, "attr_addr_expr", tcc_reference, 1)
  56
  57 /* Here are the tree codes for the statement types known to Ada.  These
  58    must be at the end of this file to allow IS_ADA_STMT to work.  */
  59
  60 /* This is how record_code_position and insert_code_for work.  The former
  61    makes this tree node, whose operand is a statement.  The latter inserts
  62    the actual statements into this node.  Gimplification consists of
  63    just returning the inner statement.  */
  64 DEFTREECODE (STMT_STMT, "stmt_stmt", tcc_statement, 1)
  65
  66 /* A loop.  LOOP_STMT_TOP_COND and LOOP_STMT_BOT_COND are the tests to exit a
  67    loop at the top and bottom, respectively.  LOOP_STMT_UPDATE is the statement
  68    to update the loop iterator at the continue point.  LOOP_STMT_BODY are the
  69    statements in the body of the loop.  LOOP_STMT_LABEL points to the LABEL_DECL
  70    of the end label of the loop.  */
  71 DEFTREECODE (LOOP_STMT, "loop_stmt", tcc_statement, 5)
  72
  73 /* Conditionally exit a loop.  EXIT_STMT_COND is the condition, which, if
  74    true, will cause the loop to be exited.  If no condition is specified,
  75    the loop is unconditionally exited.  EXIT_STMT_LABEL is the end label
  76    corresponding to the loop to exit.  */
  77 DEFTREECODE (EXIT_STMT, "exit_stmt", tcc_statement, 2)
  78
  79 /* A exception region.  REGION_STMT_BODY is the statement to be executed
  80    inside the region.  REGION_STMT_HANDLE is a statement that represents
  81    the exception handlers (usually a BLOCK_STMT of HANDLE_STMTs).
  82    REGION_STMT_BLOCK is the BLOCK node for the declarative region, if any.  */
  83 DEFTREECODE (REGION_STMT, "region_stmt", tcc_statement, 3)
  84
  85 /* An exception handler.  HANDLER_STMT_ARG is the value to pass to
  86    expand_start_catch, HANDLER_STMT_LIST is the list of statements for the
  87    handler itself, and HANDLER_STMT_BLOCK is the BLOCK node for this
  88    binding. */
  89 DEFTREECODE (HANDLER_STMT, "handler_stmt", tcc_statement, 3)