No empty .Rs/.Re

[netbsd-mini2440.git] / gnu / usr.bin / g++ / cc1plus / tree.def

/* This file contains the definitions and documentation for the
   tree codes used in the GNU C compiler.
   Copyright (C) 1987, 1988 Free Software Foundation, Inc.

This file is part of GNU CC.

GNU CC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.

GNU CC is distributed in the hope that it will be useful,
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
along with GNU CC; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */

 
/* The third argument can be:
   "x" for an exceptional code (fits no category).
   "s" for a statement code.
   "t" for a type object code.

   "c" for codes for constants.
   "d" for codes for declarations (also serving as variable refs).
   "r" for codes for references to storage.
   "e" for codes for other kinds of expressions.  */

/* For `r', `e' and `x' nodes,
   the 4th element is the number of argument slots to allocate.
   This determines the size of the tree node object.  */

/* Any erroneous construct is parsed into a node of this type.
   This type of node is accepted without complaint in all contexts
   by later parsing activities, to avoid multiple error messages
   for one error.
   No fields in these nodes are used except the TREE_CODE.  */
DEFTREECODE (ERROR_MARK, "error_mark", "x", 0)

/* Used to represent a name (such as, in the DECL_NAME of a decl node).
   Internally it looks like a STRING_CST node.
   There is only one IDENTIFIER_NODE ever made for any particular name.
   Use `get_identifier' to get it (or create it, the first time).  */
DEFTREECODE (IDENTIFIER_NODE, "identifier_node", "x", 2)

/* Used to hold information to identify an operator (or combination
   of two operators) considered as a `noun' rather than a `verb'.
   The first operand is encoded in the TREE_TYPE field.  */
DEFTREECODE (OP_IDENTIFIER, "op_identifier", "x", 2)

/* Has the TREE_VALUE and TREE_PURPOSE fields.  */
/* These nodes are made into lists by chaining through the
   TREE_CHAIN field.  The elements of the list live in the
   TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
   used as well to get the effect of Lisp association lists.  */
DEFTREECODE (TREE_LIST, "tree_list", "x", 2)

/* These nodes contain an array of tree nodes.  */
DEFTREECODE (TREE_VEC, "tree_vec", "x", 2)

/* Each data type is represented by a tree node whose code is one of
   the following:  */
/* Each node that represents a data type has a component TYPE_SIZE
   containing a tree that is an expression for the size in some units.
   The TYPE_SIZE_UNIT component is the number of bits in a unit.
   The TYPE_MODE contains the machine mode for values of this type.
   The TYPE_POINTER_TO field contains a type for a pointer to this type,
     or zero if no such has been created yet.
   The TYPE_NEXT_VARIANT field is used to chain together types
     that are variants made by type modifiers such as "const" and "volatile".
   The TYPE_MAIN_VARIANT field, in any member of such a chain,
     points to the start of the chain.
   The TYPE_NONCOPIED_PARTS field is a list specifying which parts
     of an object of this type should *not* be copied by assignment.
     The TREE_PURPOSE of each element is the offset of the part
     and the TREE_VALUE is the size in bits of the part.
   The TYPE_NAME field contains info on the name used in the program
     for this type (for GDB symbol table output).  It is either a
     TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
     in the case of structs, unions or enums that are known with a tag,
     or zero for types that have no special name.  */
/* The TREE_CHAIN of a ..._TYPE node is normally used to put
   every type onto permanent_type_chain or temporary_type_chain (see tree.c).
   One exception is for ENUMERAL_TYPE, RECORD_TYPE and UNION_TYPE
   nodes used as forward-references to names; see below.  */

DEFTREECODE (VOID_TYPE, "void_type", "t", 0)    /* The void type in C */

/* Integer types in all languages, including char in C.  */
/* Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
   and TYPE_PRECISION (number of bits used by this type).
   In the case of a subrange type in Pascal, the TREE_TYPE
   of this will point at the supertype (another INTEGER_TYPE).
   Otherwise, the TREE_TYPE is zero.  */
DEFTREECODE (INTEGER_TYPE, "integer_type", "t", 0)

/* C's float and double.  Different floating types are distinguished
   by machine mode and by the TYPE_SIZE and the TYPE_PRECISION.  */
DEFTREECODE (REAL_TYPE, "real_type", "t", 0)

/* Complex number types.  The TREE_TYPE field is the data type
   of the real and imaginary parts.  */
DEFTREECODE (COMPLEX_TYPE, "complex_type", "t", 0)

/* C enums.  The type node looks just like an INTEGER_TYPE node.
   The symbols for the values of the enum type are defined by
   CONST_DECL nodes, but the type does not point to them;
   however, the TREE_VALUES is a list in which each elements' TREE_PURPOSE
   is a name and the TREE_VALUE is the value (an INTEGER_CST node).  */
/* A forward reference `enum foo' when no enum named foo is defined yet
   has zero (a null pointer) in its TYPE_SIZE.  The tag name is in
   the TYPE_NAME field.  If the type is later defined, the normal
   fields are filled in.
   RECORD_TYPE and UNION_TYPE forward refs are treated similarly.  */
DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", "t", 0)

/* Pascal's boolean type (true or false are the only values);
   no special fields needed.  */
DEFTREECODE (BOOLEAN_TYPE, "boolean_type", "t", 0)

/* CHAR in Pascal; not used in C.
   No special fields needed.  */
DEFTREECODE (CHAR_TYPE, "char_type", "t", 0)

/* All pointer-to-x types have code POINTER_TYPE.
   The TREE_TYPE points to the node for the type pointed to.  */
DEFTREECODE (POINTER_TYPE, "pointer_type", "t", 0)

/* An offset is a pointer relative to an object.
   The TREE_TYPE field is the type of the object at the offset.
   The TYPE_OFFSET_BASETYPE points to the node for the type of object
   that the offset is relative to.  */
DEFTREECODE (OFFSET_TYPE, "offset_type", "t", 0)

/* A reference is like a pointer except that it is coerced
   automatically to the value it points to.  Used in C++.  */
DEFTREECODE (REFERENCE_TYPE, "reference_type", "t", 0)

/* METHOD_TYPE is the type of a function which takes an extra first
   argument for "self", which is not present in the declared argument list.
   The TREE_TYPE is the return type of the method.  The TYPE_METHOD_BASETYPE
   is the type of "self".  TYPE_ARG_TYPES is the real argument list, which
   includes the hidden argument for "self".  */
DEFTREECODE (METHOD_TYPE, "method_type", "t", 0)

/* Used for Pascal; details not determined right now.  */
DEFTREECODE (FILE_TYPE, "file_type", "t", 0)

/* Types of arrays.  Special fields:
   TREE_TYPE              Type of an array element.
   TYPE_DOMAIN            Type to index by.
                            Its range of values specifies the array length.
   TYPE_SEP               Expression for units from one elt to the next.
   TYPE_SEP_UNIT          Number of bits in a unit for previous.
 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
 and holds the type to coerce a value of that array type to in C.  */
/* Array types in C or Pascal */
DEFTREECODE (ARRAY_TYPE, "array_type", "t", 0)

/* Types of sets for Pascal.  Special fields are the same as
   in an array type.  The target type is always a boolean type.  */
DEFTREECODE (SET_TYPE, "set_type", "t", 0)

/* Not known whether Pascal really needs this
   or what it should contain.  */
DEFTREECODE (STRING_TYPE, "string_type", "t", 0)

/* Struct in C, or record in Pascal.  */
/* Special fields:
   TYPE_FIELDS  chain of FIELD_DECLs for the fields of the struct.
   A few may need to be added for Pascal.  */
/* See the comment above, before ENUMERAL_TYPE, for how
   forward references to struct tags are handled in C.  */
DEFTREECODE (RECORD_TYPE, "record_type", "t", 0)

/* Union in C.  Like a struct, except that the offsets of the fields
   will all be zero.  */
/* See the comment above, before ENUMERAL_TYPE, for how
   forward references to union tags are handled in C.  */
DEFTREECODE (UNION_TYPE, "union_type", "t", 0)  /* C union type */

/* Type of functions.  Special fields:
   TREE_TYPE                type of value returned.
   TYPE_ARG_TYPES      list of types of arguments expected.
        this list is made of TREE_LIST nodes.
   Types of "Procedures" in languages where they are different from functions
   have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type.  */
DEFTREECODE (FUNCTION_TYPE, "function_type", "t", 0)

/* This is a language-specific kind of type.
   Its meaning is defined by the language front end.
   layout_type does not know how to lay this out,
   so the front-end must do so manually.  */
DEFTREECODE (LANG_TYPE, "lang_type", "t", 0)
\f
/* All statement types have fields STMT_SOURCE_FILE and STMT_SOURCE_LINE.  */
/* Consecutive statements within a compound statement are chained together
   through the TREE_CHAIN field.  */

/* A label definition, encapsulated as a statement.
   STMT_BODY is the LABEL_DECL node for the label that appears here.  */
DEFTREECODE (LABEL_STMT, "label_stmt", "s", 1)

/* GOTO, in any language.  STMT_BODY is a LABEL_DECL node.  */
DEFTREECODE (GOTO_STMT, "goto_stmt", "s", 1)

/* RETURN, in any language.
   Evaluates the expression STMT_BODY, then returns from the current function.
   Presumably STMT_BODY is an assignment that stores into the
   RESULT_DECL that hold the value to be returned.
   STMT_BODY may be zero.  */
DEFTREECODE (RETURN_STMT, "return_stmt", "s", 1)

/* Statement that evaluates an expression.  STMT_BODY is the expression.  */
DEFTREECODE (EXPR_STMT, "expr_stmt", "s", 1)

/* Pascal WITH statement.
   Contains a chain of variables (..._DECL nodes) in the STMT_VARS
   and a chain of statements (the STMT_BODY).
   STMT_SUPERCONTEXT points to the containing declaration scope.  */
DEFTREECODE (WITH_STMT, "with_stmt", "s", 5)

/* Declare variables whose scope is less than a function.
   This is used for C brace-pairs that contain declarations.
   Contains a chain of variables (..._DECL nodes) in the STMT_VARS
   and a chain of statements (the STMT_BODY).
   STMT_SUPERCONTEXT points to the containing declaration scope.
   STMT_BIND_SIZE is an expression for the size of local storage here.
   STMT_TYPE_TAGS is a list (chain of TREE_LIST nodes)
    pairing struct, union and enum tag names with the types they mean,
    for tags defined in this context.

   A LET_STMT can be used as an expression.  Its STMT_BODY is expanded
   in its stead.  Its TREE_USED is set if it is expanded.

   A LET_STMT whose TREE_USED is not set is ignored when symbols
   are output.  If the LET_STMT is passed to expand_expr but it
   should not be ignored, set its TREE_USED by hand.  */
DEFTREECODE (LET_STMT, "let_stmt", "s", 6)

/* if-then-else statements in C and other languages.
   STMT_COND is the condition (an expression).
   STMT_THEN is the then-branch (a statement or chain of statements).
   STMT_ELSE is the else-branch (a statement or chain of statements).  */
DEFTREECODE (IF_STMT, "if_stmt", "s", 3)

/* if-else-exit; used in building parts of iterations.
   STMT_BODY is the condition (an expression).
   Exit if the iteration if the condition is FALSE.  */
DEFTREECODE (EXIT_STMT, "exit_stmt", "s", 1)

/* STMT_CASE_INDEX is an expression for the value to dispatch on.
   STMT_CASE_LIST is a list (a chain of TREE_LIST nodes)
    of the branches of the dispatch.
   Each such TREE_LIST node has the case it is for (a constant expression)
   as the TREE_PURPOSE
   and the label to go to (a LABEL_DECL) as the TREE_VALUE. 

   Normally, the labels reside inside a COMPOUND_STMT
   which contains ths CASE_STMT as its first statement.  */
DEFTREECODE (CASE_STMT, "case_stmt", "s", 3)

/* STMT_LOOP_VARS are the variables to be used as iterators
   in the loop.
   STMT_LOOP_COND is the condition to test each time through
   the loop.  If TREE_READONLY is set, condition is tested
   before entering the loop; otherwise it is tested at the bottom.
   STMT_LOOP_BODY contains a chain of statements to be executed in loop.  */
DEFTREECODE (LOOP_STMT, "loop_stmt", "s", 3)

/* Contains as its STMT_BODY a chain of substatements.  */
DEFTREECODE (COMPOUND_STMT, "compound_stmt", "s", 1)

/* Contains as its STMT_BODY a string of assembly code.  */
DEFTREECODE (ASM_STMT, "asm_stmt", "s", 1)
\f
/* Expressions */

/* First, the constants.  */

/* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
   32 bits each, giving us a 64 bit constant capability.
   Note: constants of type char in Pascal are INTEGER_CST,
   and so are pointer constants such as nil in Pascal or NULL in C.
   `(int *) 1' in C also results in an INTEGER_CST.  */
DEFTREECODE (INTEGER_CST, "integer_cst", "c", 2)

/* Contents are in TREE_REAL_CST field.  Also there is TREE_CST_RTL.  */
DEFTREECODE (REAL_CST, "real_cst", "c", 3)

/* Contents are in TREE_REALPART and TREE_IMAGPART fields,
   whose contents are other constant nodes.
   Also there is TREE_CST_RTL.  */
DEFTREECODE (COMPLEX_CST, "complex_cst", "c", 3)

/* Contents are TREE_STRING_LENGTH and TREE_STRING_POINTER fields.
   Also there is TREE_CST_RTL.  */
DEFTREECODE (STRING_CST, "string_cst", "c", 3)

/* Declarations.  All references to names are represented as ..._DECL nodes.
   The decls in one binding context are chained through the TREE_CHAIN field.
   Each DECL has a DECL_NAME field which contains an IDENTIFIER_NODE.
    (Some decls, most often labels, may have zero as the DECL_NAME).
   DECL_CONTEXT points to the node representing the context in which
    this declaration has its scope.  For FIELD_DECLs, this is the
    RECORD_TYPE or UNION_TYPE node that the field belongs to;
    for VAR_DECL, PARM_DECL, FUNCTION_DECL and LABEL_DECL, this
    is the FUNCTION_DECL for the containing function, or 0 if global.
   The TREE_TYPE field holds the data type of the object, when relevant.
    LABEL_DECLs have no data type.  For TYPE_DECL, the TREE_TYPE field
    contents are the type whose name is being declared.
   The DECL_ALIGN, DECL_SIZE, DECL_SIZE_UNIT
    and DECL_MODE fields exist in decl nodes just as in type nodes.
    They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.

   DECL_OFFSET holds an integer number of bits offset for the location.
   DECL_VOFFSET holds an expression for a variable offset; it is
   to be multiplied by DECL_VOFFSET_UNIT (an integer).
   These fields are relevant only in FIELD_DECLs and PARM_DECLs.

   DECL_INITIAL holds the value to initialize a variable to,
   or the value of a constant.  For a function, it holds the body
   (a node of type LET_STMT representing the function's binding contour
   and whose body contains the function's statements.)  For a LABEL_DECL
   in C, it is a flag, nonzero if the label's definition has been seen.

   PARM_DECLs use a special field:
   DECL_ARG_TYPE is the type in which the argument is actually
    passed, which may be different from its type within the function.

   FUNCTION_DECLs use four special fields:
   DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
   DECL_RESULT holds a RESULT_DECL node for the value of a function,
    or it is 0 for a function that returns no value.
    (C functions returning void have zero here.)
   DECL_RESULT_TYPE holds the type in which the result is actually
    returned.  This is usually the same as the type of DECL_RESULT,
    but (1) it may be a wider integer type and
    (2) it remains valid, for the sake of inlining, even after the
    function's compilation is done.
   DECL_FUNCTION_CODE is a code number that is nonzero for
    built-in functions.  Its value is an enum built_in_function
    that says which built-in function it is.
   DECL_BLOCK_SYMTAB_ADDRESS records (after the symtab data for the function's
    body has been output) the address in the symtab file of the
    `struct block' for the function's top-level binding context.
    This must be stored in the symtab structure for the function name.
   Also, TREE_UNSIGNED (function_decl) is nonzero if the ({...})
    construct is used in the function.

   DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
   holds a line number.  In some cases these can be the location of
   a reference, if no definition has been seen.  */

DEFTREECODE (FUNCTION_DECL, "function_decl", "d", 5)
DEFTREECODE (LABEL_DECL, "label_decl", "d", 0)
DEFTREECODE (CONST_DECL, "const_decl", "d", 0)
DEFTREECODE (TYPE_DECL, "type_decl", "d", 0)
DEFTREECODE (VAR_DECL, "var_decl", "d", 0)
DEFTREECODE (PARM_DECL, "parm_decl", "d", -3)
DEFTREECODE (RESULT_DECL, "result_decl", "d", 0)
DEFTREECODE (FIELD_DECL, "field_decl", "d", 0)
\f
/* References to storage.  */

/* Value is structure or union component.
   Operand 0 is the structure or union (an expression);
   operand 1 is the field (a node of type FIELD_DECL).  */
DEFTREECODE (COMPONENT_REF, "component_ref", "r", 2)

/* C unary `*' or Pascal `^'.  One operand, an expression for a pointer.  */
DEFTREECODE (INDIRECT_REF, "indirect_ref", "r", 1)

/* Reference to the contents of an offset
   (a value whose type is an OFFSET_TYPE).
   Operand 0 is the object within which the offset is taken.
   Operand 1 is the offset.  */
DEFTREECODE (OFFSET_REF, "offset_ref", "r", 2)

/* Pascal `^` on a file.  One operand, an expression for the file.  */
DEFTREECODE (BUFFER_REF, "buffer_ref", "r", 1)

/* Array indexing in languages other than C.
   Operand 0 is the array; operand 1 is a list of indices
   stored as a chain of TREE_LIST nodes.  */
DEFTREECODE (ARRAY_REF, "array_ref", "r", 2)

/* Constructor: return an aggregate value made from specified components.
   In C, this is used only for structure and array initializers.
   The first "operand" is really a pointer to the RTL,
   for constant constructors only.
   The second operand is a list of component values
   made out of a chain of TREE_LIST nodes.  */
DEFTREECODE (CONSTRUCTOR, "constructor", "e", 2)

/* The expression types are mostly straightforward,
   with the fourth argument of DEFTREECODE saying
   how many operands there are.
   Unless otherwise specified, the operands are expressions.  */

/* Contains two expressions to compute, one followed by the other.
   the first value is ignored.  The second one's value is used.  */
DEFTREECODE (COMPOUND_EXPR, "compound_expr", "e", 2)

/* Assignment expression.  Operand 0 is the what to set; 1, the new value.  */
DEFTREECODE (MODIFY_EXPR, "modify_expr", "e", 2)

/* Initialization expression.  Operand 0 is the variable to initialize;
   Operand 1 is the initializer.  */
DEFTREECODE (INIT_EXPR, "init_expr", "e", 2)

/* For NEW_EXPR, operand 0 is function which performs initialization,
   operand 1 is argument list to initialization function,
   and operand 2 is the cleanup for this node, if any.  */
DEFTREECODE (NEW_EXPR, "new_expr", "e", 3)

/* Conditional expression ( ... ? ... : ...  in C).
   Operand 0 is the condition.
   Operand 1 is the then-value.
   Operand 2 is the else-value.  */
DEFTREECODE (COND_EXPR, "cond_expr", "e", 3)

/* Function call.  Operand 0 is the function.
   Operand 1 is the argument list, a list of expressions
   made out of a chain of TREE_LIST nodes.
   There is no operand 2.  That slot is used for the
   CALL_EXPR_RTL macro (see preexpand_calls).  */
DEFTREECODE (CALL_EXPR, "call_expr", "e", 3)

/* Call a method.  Operand 0 is the method, whose type is a METHOD_TYPE.
   Operand 1 is the expression for "self".
   Operand 2 is the list of explicit arguments.  */
DEFTREECODE (METHOD_CALL_EXPR, "method_call_expr", "e", 4)

/* Specify a value to compute along with its corresponding cleanup.
   Operand 0 argument is an expression whose value needs a cleanup.
   Operand 1 is an RTL_EXPR which will eventually represent that value.
   Operand 2 is the cleanup expression for the object.
     The RTL_EXPR is used in this expression, which is how the expression
     manages to act on the proper value.
   The cleanup is executed when the value is no longer needed,
   which is not at precisely the same time that this value is computed.  */
DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", "e", 3)

/* Simple arithmetic.  Operands must have the same machine mode
   and the value shares that mode.  */
DEFTREECODE (PLUS_EXPR, "plus_expr", "e", 2)
DEFTREECODE (MINUS_EXPR, "minus_expr", "e", 2)
DEFTREECODE (MULT_EXPR, "mult_expr", "e", 2)

/* Division for integer result that rounds the quotient toward zero.  */
/* Operands must have the same machine mode.
   In principle they may be real, but that is not currently supported.
   The result is always fixed point, and it has the same type as the
   operands if they are fixed point.   */
DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", "e", 2)

/* Division for integer result that rounds the quotient toward infinity.  */
DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", "e", 2)

/* Division for integer result that rounds toward minus infinity.  */
DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", "e", 2)

/* Division for integer result that rounds toward nearest integer.  */
DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", "e", 2)

/* Four kinds of remainder that go with the four kinds of division.  */
DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", "e", 2)
DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", "e", 2)
DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", "e", 2)
DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", "e", 2)

/* Division for real result.  The two operands must have the same type.
   In principle they could be integers, but currently only real
   operands are supported.  The result must have the same type
   as the operands.  */
DEFTREECODE (RDIV_EXPR, "rdiv_expr", "e", 2)

/* Division which is not supposed to need rounding.
   Used for pointer subtraction in C.  */
DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", "e", 2)

/* Conversion of real to fixed point: four ways to round,
   like the four ways to divide.
   CONVERT_EXPR can also be used to convert a real to an integer,
   and that is what is used in languages that do not have ways of
   specifying which of these is wanted.  Maybe these are not needed.  */
DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", "e", 1)
DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", "e", 1)
DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", "e", 1)
DEFTREECODE (FIX_ROUND_EXPR, "fix_round_expr", "e", 1)

/* Conversion of an integer to a real.  */
DEFTREECODE (FLOAT_EXPR, "float_expr", "e", 1)

/* Exponentiation.  Operands may have any types;
   constraints on value type are not known yet.  */
DEFTREECODE (EXPON_EXPR, "expon_expr", "e", 2)

/* Unary negation.  Value has same type as operand.  */
DEFTREECODE (NEGATE_EXPR, "negate_expr", "e", 1)

DEFTREECODE (MIN_EXPR, "min_expr", "e", 2)
DEFTREECODE (MAX_EXPR, "max_expr", "e", 2)
DEFTREECODE (ABS_EXPR, "abs_expr", "e", 1)
DEFTREECODE (FFS_EXPR, "ffs_expr", "e", 1)

/* Shift operations for shift and rotate.
   Shift is supposed to mean logical shift if done on an
   unsigned type, arithmetic shift on a signed type.
   The second operand is the number of bits to
   shift by, and must always have mode SImode.
   The result has the same mode as the first operand.  */
DEFTREECODE (LSHIFT_EXPR, "alshift_expr", "e", 2)
DEFTREECODE (RSHIFT_EXPR, "arshift_expr", "e", 2)
DEFTREECODE (LROTATE_EXPR, "lrotate_expr", "e", 2)
DEFTREECODE (RROTATE_EXPR, "rrotate_expr", "e", 2)

/* Bitwise operations.  Operands have same mode as result.  */
DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", "e", 2)
DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", "e", 2)
DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", "e", 2)
DEFTREECODE (BIT_ANDTC_EXPR, "bit_andtc_expr", "e", 2)
DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", "e", 1)

/* Combination of boolean values or of integers considered only
   as zero or nonzero.  ANDIF and ORIF allow the second operand
   not to be computed if the value of the expression is determined
   from the first operand.  AND and OR always compute the second
   operand whether its value is needed or not (for side effects).  */
DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", "e", 2)
DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", "e", 2)
DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", "e", 2)
DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", "e", 2)
DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", "e", 1)

/* Relational operators.
   `EQ_EXPR' and `NE_EXPR' are allowed for any types.
   The others are allowed only for integer (or pointer or enumeral)
   or real types.
   In all cases the operands will have the same type,
   and the value is always the type used by the language for booleans.  */
DEFTREECODE (LT_EXPR, "lt_expr", "e", 2)
DEFTREECODE (LE_EXPR, "le_expr", "e", 2)
DEFTREECODE (GT_EXPR, "gt_expr", "e", 2)
DEFTREECODE (GE_EXPR, "ge_expr", "e", 2)
DEFTREECODE (EQ_EXPR, "eq_expr", "e", 2)
DEFTREECODE (NE_EXPR, "ne_expr", "e", 2)

/* Operations for Pascal sets.  Not used now.  */
DEFTREECODE (IN_EXPR, "in_expr", "e", 2)
DEFTREECODE (SET_LE_EXPR, "set_le_expr", "e", 2)
DEFTREECODE (CARD_EXPR, "card_expr", "e", 1)
DEFTREECODE (RANGE_EXPR, "range_expr", "e", 2)

/* Represents a conversion of type of a value.
   All conversions, including implicit ones, must be
   represented by CONVERT_EXPR nodes.  */
DEFTREECODE (CONVERT_EXPR, "convert_expr", "e", 1)

/* Represents a conversion expected to require no code to be generated.  */
DEFTREECODE (NOP_EXPR, "nop_expr", "e", 1)

/* Represents something we computed once and will use multiple times.
   First operand is that expression.  Second is the RTL,
   nonzero only after the expression has been computed.
   TREE_UNSIGNED in a SAVE_EXPR is nonzero if that SAVE_EXPR
   has been seen already in assign_vars_1.  */
DEFTREECODE (SAVE_EXPR, "save_expr", "e", 2)

/* Represents something whose RTL has already been expanded
   as a sequence which should be emitted when this expression is expanded.
   The first operand is the RTL to emit.  It is the first of a chain of insns.
   The second is the RTL expression for the result.  */
DEFTREECODE (RTL_EXPR, "rtl_expr", "e", 2)

/* & in C.  Value is the address at which the operand's value resides.
   Operand may have any mode.  Result mode is Pmode.  */
DEFTREECODE (ADDR_EXPR, "addr_expr", "e", 1)

/* Non-lvalue reference or pointer to an object.  */
DEFTREECODE (REFERENCE_EXPR, "reference_expr", "e", 1)

/* A wrapper in C++.  Operand 0 is the type that the wrapper
   belongs to (if non-virtual).  Operand 1 is the function
   being wrapped.  An anti-wrapper means do not wrap the function
   (if it would be wrapped by default).  */
DEFTREECODE (WRAPPER_EXPR, "wrapper_expr", "e", 2)
DEFTREECODE (ANTI_WRAPPER_EXPR, "anti_wrapper_expr", "e", 2)

/* Operand is a function constant; result is a function variable value
   of typeEPmode.  Used only for languages that need static chains.  */
DEFTREECODE (ENTRY_VALUE_EXPR, "entry_value_expr", "e", 1)

/* Given two real or integer operands of the same type,
   returns a complex value of the corresponding complex type.  */
DEFTREECODE (COMPLEX_EXPR, "complex_expr", "e", 2)

/* Complex conjugate of operand.  Used only on complex types.
   The value has the same type as the operand.  */
DEFTREECODE (CONJ_EXPR, "conj_expr", "e", 1)

/* Used only on an operand of complex type, these return
   a value of the corresponding component type.  */
DEFTREECODE (REALPART_EXPR, "realpart_expr", "e", 1)
DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", "e", 1)

/* Nodes for ++ and -- in C.
   The second arg is how much to increment or decrement by.
   For a pointer, it would be the size of the object pointed to.  */
DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", "e", 2)
DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", "e", 2)
DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", "e", 2)
DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", "e", 2)

/*
Local variables:
mode:c
version-control: t
End:
*/