gcc/tree.def

   1 /* This file contains the definitions and documentation for the
   2    tree codes used in the GNU C compiler.
   3    Copyright (C) 1987, 1988 Free Software Foundation, Inc.
   4
   5 This file is part of GNU CC.
   6
   7 GNU CC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GNU CC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GNU CC; see the file COPYING.  If not, write to
  19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */
  20
  21
  22 /* The third argument can be:
  23    "x" for an exceptional code (fits no category).
  24    "t" for a type object code.
  25    "b" for a lexical block.
  26    "c" for codes for constants.
  27    "d" for codes for declarations (also serving as variable refs).
  28    "r" for codes for references to storage.
  29    "<" for codes for comparison expressions.
  30    "1" for codes for unary arithmetic expressions.
  31    "2" for codes for binary arithmetic expressions.
  32    "s" for codes for expressions with inherent side effects.
  33    "e" for codes for other kinds of expressions.  */
  34
  35 /* For `r', `e', `<', `1', `2', `s' and `x' nodes,
  36    the 4th element is the number of argument slots to allocate.
  37    This determines the size of the tree node object.  */
  38
  39 /* Any erroneous construct is parsed into a node of this type.
  40    This type of node is accepted without complaint in all contexts
  41    by later parsing activities, to avoid multiple error messages
  42    for one error.
  43    No fields in these nodes are used except the TREE_CODE.  */
  44 DEFTREECODE (ERROR_MARK, "error_mark", "x", 0)
  45
  46 /* Used to represent a name (such as, in the DECL_NAME of a decl node).
  47    Internally it looks like a STRING_CST node.
  48    There is only one IDENTIFIER_NODE ever made for any particular name.
  49    Use `get_identifier' to get it (or create it, the first time).  */
  50 DEFTREECODE (IDENTIFIER_NODE, "identifier_node", "x", -1)
  51
  52 /* Used to hold information to identify an operator (or combination
  53    of two operators) considered as a `noun' rather than a `verb'.
  54    The first operand is encoded in the TREE_TYPE field.  */
  55 DEFTREECODE (OP_IDENTIFIER, "op_identifier", "x", 2)
  56
  57 /* Has the TREE_VALUE and TREE_PURPOSE fields.  */
  58 /* These nodes are made into lists by chaining through the
  59    TREE_CHAIN field.  The elements of the list live in the
  60    TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
  61    used as well to get the effect of Lisp association lists.  */
  62 DEFTREECODE (TREE_LIST, "tree_list", "x", 2)
  63
  64 /* These nodes contain an array of tree nodes.  */
  65 DEFTREECODE (TREE_VEC, "tree_vec", "x", 2)
  66
  67 /* A symbol binding block.  These are arranged in a tree,
  68    where the BLOCK_SUBBLOCKS field contains a chain of subblocks
  69    chained through the BLOCK_CHAIN field.
  70    BLOCK_SUPERCONTEXT points to the parent block.
  71      For a block which represents the outermost scope of a function, it
  72      points to the FUNCTION_DECL node.
  73    BLOCK_VARS points to a chain of decl nodes.
  74    BLOCK_TYPE_TAGS points to a chain of types which have their own names.
  75    BLOCK_CHAIN points to the next BLOCK at the same level.
  76    BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
  77    this block is an instance of, or else is NULL to indicate that this
  78    block is not an instance of anything else.  When non-NULL, the value
  79    could either point to another BLOCK node or it could point to a
  80    FUNCTION_DECL node (e.g. in the case of a block representing the
  81    outermost scope of a particular inlining of a function).
  82    BLOCK_ABSTRACT is non-zero if the block represents an abstract
  83    instance of a block (i.e. one which is nested within an abstract
  84    instance of a inline function. */
  85 DEFTREECODE (BLOCK, "block", "b", 0)
  86 \f
  87 /* Each data type is represented by a tree node whose code is one of
  88    the following:  */
  89 /* Each node that represents a data type has a component TYPE_SIZE
  90    containing a tree that is an expression for the size in bits.
  91    The TYPE_MODE contains the machine mode for values of this type.
  92    The TYPE_POINTER_TO field contains a type for a pointer to this type,
  93      or zero if no such has been created yet.
  94    The TYPE_NEXT_VARIANT field is used to chain together types
  95      that are variants made by type modifiers such as "const" and "volatile".
  96    The TYPE_MAIN_VARIANT field, in any member of such a chain,
  97      points to the start of the chain.
  98    The TYPE_NONCOPIED_PARTS field is a list specifying which parts
  99      of an object of this type should *not* be copied by assignment.
 100      The TREE_PURPOSE of each element is the offset of the part
 101      and the TREE_VALUE is the size in bits of the part.
 102    The TYPE_NAME field contains info on the name used in the program
 103      for this type (for GDB symbol table output).  It is either a
 104      TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
 105      in the case of structs, unions or enums that are known with a tag,
 106      or zero for types that have no special name.
 107    The TYPE_CONTEXT for any sort of type which could have a name or
 108     which could have named members (e.g. tagged types in C/C++) will
 109     point to the node which represents the scope of the given type, or
 110     will be NULL_TREE if the type has "file scope".  For most types, this
 111     will point to a BLOCK node or a FUNCTION_DECL node, but it could also
 112     point to a FUNCTION_TYPE node (for types whose scope is limited to the
 113     formal parameter list of some function type specification) or it
 114     could point to a RECORD_TYPE or UNION_TYPE node (for C++ "member" types).
 115     For non-tagged-types, TYPE_CONTEXT need not be set to anything in
 116     particular, since any type which is of some type category  (e.g.
 117     an array type or a function type) which cannot either have a name
 118     itself or have named members doesn't really have a "scope" per se.  */
 119 /* TREE_CHAIN is used for ENUMERAL_TYPE, RECORD_TYPE and UNION_TYPE
 120    nodes used as forward-references to names; see below.  */
 121
 122 DEFTREECODE (VOID_TYPE, "void_type", "t", 0)    /* The void type in C */
 123
 124 /* Integer types in all languages, including char in C.
 125    Also used for sub-ranges of other discrete types.
 126    Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
 127    and TYPE_PRECISION (number of bits used by this type).
 128    In the case of a subrange type in Pascal, the TREE_TYPE
 129    of this will point at the supertype (another INTEGER_TYPE,
 130    or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_TYPE).
 131    Otherwise, the TREE_TYPE is zero.  */
 132 DEFTREECODE (INTEGER_TYPE, "integer_type", "t", 0)
 133
 134 /* C's float and double.  Different floating types are distinguished
 135    by machine mode and by the TYPE_SIZE and the TYPE_PRECISION.  */
 136 DEFTREECODE (REAL_TYPE, "real_type", "t", 0)
 137
 138 /* Complex number types.  The TREE_TYPE field is the data type
 139    of the real and imaginary parts.  */
 140 DEFTREECODE (COMPLEX_TYPE, "complex_type", "t", 0)
 141
 142 /* C enums.  The type node looks just like an INTEGER_TYPE node.
 143    The symbols for the values of the enum type are defined by
 144    CONST_DECL nodes, but the type does not point to them;
 145    however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE
 146    is a name and the TREE_VALUE is the value (an INTEGER_CST node).  */
 147 /* A forward reference `enum foo' when no enum named foo is defined yet
 148    has zero (a null pointer) in its TYPE_SIZE.  The tag name is in
 149    the TYPE_NAME field.  If the type is later defined, the normal
 150    fields are filled in.
 151    RECORD_TYPE and UNION_TYPE forward refs are treated similarly.  */
 152 DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", "t", 0)
 153
 154 /* Pascal's boolean type (true or false are the only values);
 155    no special fields needed.  */
 156 DEFTREECODE (BOOLEAN_TYPE, "boolean_type", "t", 0)
 157
 158 /* CHAR in Pascal; not used in C.
 159    No special fields needed.  */
 160 DEFTREECODE (CHAR_TYPE, "char_type", "t", 0)
 161
 162 /* All pointer-to-x types have code POINTER_TYPE.
 163    The TREE_TYPE points to the node for the type pointed to.  */
 164 DEFTREECODE (POINTER_TYPE, "pointer_type", "t", 0)
 165
 166 /* An offset is a pointer relative to an object.
 167    The TREE_TYPE field is the type of the object at the offset.
 168    The TYPE_OFFSET_BASETYPE points to the node for the type of object
 169    that the offset is relative to.  */
 170 DEFTREECODE (OFFSET_TYPE, "offset_type", "t", 0)
 171
 172 /* A reference is like a pointer except that it is coerced
 173    automatically to the value it points to.  Used in C++.  */
 174 DEFTREECODE (REFERENCE_TYPE, "reference_type", "t", 0)
 175
 176 /* METHOD_TYPE is the type of a function which takes an extra first
 177    argument for "self", which is not present in the declared argument list.
 178    The TREE_TYPE is the return type of the method.  The TYPE_METHOD_BASETYPE
 179    is the type of "self".  TYPE_ARG_TYPES is the real argument list, which
 180    includes the hidden argument for "self".  */
 181 DEFTREECODE (METHOD_TYPE, "method_type", "t", 0)
 182
 183 /* Used for Pascal; details not determined right now.  */
 184 DEFTREECODE (FILE_TYPE, "file_type", "t", 0)
 185
 186 /* Types of arrays.  Special fields:
 187    TREE_TYPE              Type of an array element.
 188    TYPE_DOMAIN            Type to index by.
 189                             Its range of values specifies the array length.
 190    TYPE_SEP               Expression for units from one elt to the next.
 191    TYPE_SEP_UNIT          Number of bits in a unit for previous.
 192  The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
 193  and holds the type to coerce a value of that array type to in C.  */
 194 /* Array types in C or Pascal */
 195 DEFTREECODE (ARRAY_TYPE, "array_type", "t", 0)
 196
 197 /* Types of sets for Pascal.  Special fields are the same as
 198    in an array type.  The target type is always a boolean type.  */
 199 DEFTREECODE (SET_TYPE, "set_type", "t", 0)
 200
 201 /* Not known whether Pascal really needs this
 202    or what it should contain.  */
 203 DEFTREECODE (STRING_TYPE, "string_type", "t", 0)
 204
 205 /* Struct in C, or record in Pascal.  */
 206 /* Special fields:
 207    TYPE_FIELDS  chain of FIELD_DECLs for the fields of the struct.
 208    A few may need to be added for Pascal.  */
 209 /* See the comment above, before ENUMERAL_TYPE, for how
 210    forward references to struct tags are handled in C.  */
 211 DEFTREECODE (RECORD_TYPE, "record_type", "t", 0)
 212
 213 /* Union in C.  Like a struct, except that the offsets of the fields
 214    will all be zero.  */
 215 /* See the comment above, before ENUMERAL_TYPE, for how
 216    forward references to union tags are handled in C.  */
 217 DEFTREECODE (UNION_TYPE, "union_type", "t", 0)  /* C union type */
 218
 219 /* Type of functions.  Special fields:
 220    TREE_TYPE                type of value returned.
 221    TYPE_ARG_TYPES      list of types of arguments expected.
 222         this list is made of TREE_LIST nodes.
 223    Types of "Procedures" in languages where they are different from functions
 224    have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type.  */
 225 DEFTREECODE (FUNCTION_TYPE, "function_type", "t", 0)
 226
 227 /* This is a language-specific kind of type.
 228    Its meaning is defined by the language front end.
 229    layout_type does not know how to lay this out,
 230    so the front-end must do so manually.  */
 231 DEFTREECODE (LANG_TYPE, "lang_type", "t", 0)
 232 \f
 233 /* Expressions */
 234
 235 /* First, the constants.  */
 236
 237 /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
 238    32 bits each, giving us a 64 bit constant capability.
 239    Note: constants of type char in Pascal are INTEGER_CST,
 240    and so are pointer constants such as nil in Pascal or NULL in C.
 241    `(int *) 1' in C also results in an INTEGER_CST.  */
 242 DEFTREECODE (INTEGER_CST, "integer_cst", "c", 2)
 243
 244 /* Contents are in TREE_REAL_CST field.  Also there is TREE_CST_RTL.  */
 245 DEFTREECODE (REAL_CST, "real_cst", "c", 3)
 246
 247 /* Contents are in TREE_REALPART and TREE_IMAGPART fields,
 248    whose contents are other constant nodes.
 249    Also there is TREE_CST_RTL.  */
 250 DEFTREECODE (COMPLEX_CST, "complex_cst", "c", 3)
 251
 252 /* Contents are TREE_STRING_LENGTH and TREE_STRING_POINTER fields.
 253    Also there is TREE_CST_RTL.  */
 254 DEFTREECODE (STRING_CST, "string_cst", "c", 3)
 255
 256 /* Declarations.  All references to names are represented as ..._DECL nodes.
 257    The decls in one binding context are chained through the TREE_CHAIN field.
 258    Each DECL has a DECL_NAME field which contains an IDENTIFIER_NODE.
 259     (Some decls, most often labels, may have zero as the DECL_NAME).
 260    DECL_CONTEXT points to the node representing the context in which
 261     this declaration has its scope.  For FIELD_DECLs, this is the
 262     RECORD_TYPE or UNION_TYPE node that the field is a member of.  For
 263     VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes,
 264     this points to the FUNCTION_DECL for the containing function, or else
 265     yields NULL_TREE if the given decl has "file scope".
 266    DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
 267     ..._DECL node of which this decl is an (inlined or template expanded)
 268     instance.
 269    The TREE_TYPE field holds the data type of the object, when relevant.
 270     LABEL_DECLs have no data type.  For TYPE_DECL, the TREE_TYPE field
 271     contents are the type whose name is being declared.
 272    The DECL_ALIGN, DECL_SIZE,
 273     and DECL_MODE fields exist in decl nodes just as in type nodes.
 274     They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
 275
 276    DECL_OFFSET holds an integer number of bits offset for the location.
 277    DECL_VOFFSET holds an expression for a variable offset; it is
 278    to be multiplied by DECL_VOFFSET_UNIT (an integer).
 279    These fields are relevant only in FIELD_DECLs and PARM_DECLs.
 280
 281    DECL_INITIAL holds the value to initialize a variable to,
 282    or the value of a constant.  For a function, it holds the body
 283    (a node of type BLOCK representing the function's binding contour
 284    and whose body contains the function's statements.)  For a LABEL_DECL
 285    in C, it is a flag, nonzero if the label's definition has been seen.
 286
 287    PARM_DECLs use a special field:
 288    DECL_ARG_TYPE is the type in which the argument is actually
 289     passed, which may be different from its type within the function.
 290
 291    FUNCTION_DECLs use four special fields:
 292    DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
 293    DECL_RESULT holds a RESULT_DECL node for the value of a function,
 294     or it is 0 for a function that returns no value.
 295     (C functions returning void have zero here.)
 296    DECL_RESULT_TYPE holds the type in which the result is actually
 297     returned.  This is usually the same as the type of DECL_RESULT,
 298     but (1) it may be a wider integer type and
 299     (2) it remains valid, for the sake of inlining, even after the
 300     function's compilation is done.
 301    DECL_FUNCTION_CODE is a code number that is nonzero for
 302     built-in functions.  Its value is an enum built_in_function
 303     that says which built-in function it is.
 304
 305    DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
 306    holds a line number.  In some cases these can be the location of
 307    a reference, if no definition has been seen.
 308
 309    DECL_ABSTRACT is non-zero if the decl represents an abstract instance
 310    of a decl (i.e. one which is nested within an abstract instance of a
 311    inline function.  */
 312
 313 DEFTREECODE (FUNCTION_DECL, "function_decl", "d", 0)
 314 DEFTREECODE (LABEL_DECL, "label_decl", "d", 0)
 315 DEFTREECODE (CONST_DECL, "const_decl", "d", 0)
 316 DEFTREECODE (TYPE_DECL, "type_decl", "d", 0)
 317 DEFTREECODE (VAR_DECL, "var_decl", "d", 0)
 318 DEFTREECODE (PARM_DECL, "parm_decl", "d", 0)
 319 DEFTREECODE (RESULT_DECL, "result_decl", "d", 0)
 320 DEFTREECODE (FIELD_DECL, "field_decl", "d", 0)
 321 \f
 322 /* References to storage.  */
 323
 324 /* Value is structure or union component.
 325    Operand 0 is the structure or union (an expression);
 326    operand 1 is the field (a node of type FIELD_DECL).  */
 327 DEFTREECODE (COMPONENT_REF, "component_ref", "r", 2)
 328
 329 /* Reference to a group of bits within an object.  Similar to COMPONENT_REF
 330    except the position is given explicitly rather than via a FIELD_DECL.
 331    Operand 0 is the structure or union expression;
 332    operand 1 is a tree giving the number of bits being referenced;
 333    operand 2 is a tree giving the position of the first referenced bit.
 334    The field can be either a signed or unsigned field;
 335    TREE_UNSIGNED says which.  */
 336 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", "r", 3)
 337
 338 /* C unary `*' or Pascal `^'.  One operand, an expression for a pointer.  */
 339 DEFTREECODE (INDIRECT_REF, "indirect_ref", "r", 1)
 340
 341 /* Reference to the contents of an offset
 342    (a value whose type is an OFFSET_TYPE).
 343    Operand 0 is the object within which the offset is taken.
 344    Operand 1 is the offset.  */
 345 DEFTREECODE (OFFSET_REF, "offset_ref", "r", 2)
 346
 347 /* Pascal `^` on a file.  One operand, an expression for the file.  */
 348 DEFTREECODE (BUFFER_REF, "buffer_ref", "r", 1)
 349
 350 /* Array indexing in languages other than C.
 351    Operand 0 is the array; operand 1 is a list of indices
 352    stored as a chain of TREE_LIST nodes.  */
 353 DEFTREECODE (ARRAY_REF, "array_ref", "r", 2)
 354
 355 /* Constructor: return an aggregate value made from specified components.
 356    In C, this is used only for structure and array initializers.
 357    The first "operand" is really a pointer to the RTL,
 358    for constant constructors only.
 359    The second operand is a list of component values
 360    made out of a chain of TREE_LIST nodes.  */
 361 DEFTREECODE (CONSTRUCTOR, "constructor", "e", 2)
 362
 363 /* The expression types are mostly straightforward,
 364    with the fourth argument of DEFTREECODE saying
 365    how many operands there are.
 366    Unless otherwise specified, the operands are expressions.  */
 367
 368 /* Contains two expressions to compute, one followed by the other.
 369    the first value is ignored.  The second one's value is used.  */
 370 DEFTREECODE (COMPOUND_EXPR, "compound_expr", "e", 2)
 371
 372 /* Assignment expression.  Operand 0 is the what to set; 1, the new value.  */
 373 DEFTREECODE (MODIFY_EXPR, "modify_expr", "e", 2)
 374
 375 /* Initialization expression.  Operand 0 is the variable to initialize;
 376    Operand 1 is the initializer.  */
 377 DEFTREECODE (INIT_EXPR, "init_expr", "e", 2)
 378
 379 /* For TARGET_EXPR, operand 0 is the target of an initialization,
 380    operand 1 is the initializer for the target,
 381    and operand 2 is the cleanup for this node, if any.  */
 382 DEFTREECODE (TARGET_EXPR, "target_expr", "e", 3)
 383
 384 /* Conditional expression ( ... ? ... : ...  in C).
 385    Operand 0 is the condition.
 386    Operand 1 is the then-value.
 387    Operand 2 is the else-value.  */
 388 DEFTREECODE (COND_EXPR, "cond_expr", "e", 3)
 389
 390 /* Declare local variables, including making RTL and allocating space.
 391    Operand 0 is a chain of VAR_DECL nodes for the variables.
 392    Operand 1 is the body, the expression to be computed using
 393    the variables.  The value of operand 1 becomes that of the BIND_EXPR.
 394    Operand 2 is the BLOCK that corresponds to these bindings
 395    for debugging purposes.  If this BIND_EXPR is actually expanded,
 396    that sets the TREE_USED flag in the BLOCK.
 397
 398    The BIND_EXPR is not responsible for informing parsers
 399    about these variables.  If the body is coming from the input file,
 400    then the code that creates the BIND_EXPR is also responsible for
 401    informing the parser of the variables.
 402
 403    If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
 404    This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
 405    If the BIND_EXPR should be output for debugging but will not be expanded,
 406    set the TREE_USED flag by hand.
 407
 408    In order for the BIND_EXPR to be known at all, the code that creates it
 409    must also install it as a subblock in the tree of BLOCK
 410    nodes for the function.  */
 411 DEFTREECODE (BIND_EXPR, "bind_expr", "e", 3)
 412
 413 /* Function call.  Operand 0 is the function.
 414    Operand 1 is the argument list, a list of expressions
 415    made out of a chain of TREE_LIST nodes.
 416    There is no operand 2.  That slot is used for the
 417    CALL_EXPR_RTL macro (see preexpand_calls).  */
 418 DEFTREECODE (CALL_EXPR, "call_expr", "e", 3)
 419
 420 /* Call a method.  Operand 0 is the method, whose type is a METHOD_TYPE.
 421    Operand 1 is the expression for "self".
 422    Operand 2 is the list of explicit arguments.  */
 423 DEFTREECODE (METHOD_CALL_EXPR, "method_call_expr", "e", 4)
 424
 425 /* Specify a value to compute along with its corresponding cleanup.
 426    Operand 0 argument is an expression whose value needs a cleanup.
 427    Operand 1 is an RTL_EXPR which will eventually represent that value.
 428    Operand 2 is the cleanup expression for the object.
 429      The RTL_EXPR is used in this expression, which is how the expression
 430      manages to act on the proper value.
 431    The cleanup is executed when the value is no longer needed,
 432    which is not at precisely the same time that this value is computed.  */
 433 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", "e", 3)
 434
 435 /* Simple arithmetic.  Operands must have the same machine mode
 436    and the value shares that mode.  */
 437 DEFTREECODE (PLUS_EXPR, "plus_expr", "2", 2)
 438 DEFTREECODE (MINUS_EXPR, "minus_expr", "2", 2)
 439 DEFTREECODE (MULT_EXPR, "mult_expr", "2", 2)
 440
 441 /* Division for integer result that rounds the quotient toward zero.  */
 442 /* Operands must have the same machine mode.
 443    In principle they may be real, but that is not currently supported.
 444    The result is always fixed point, and it has the same type as the
 445    operands if they are fixed point.   */
 446 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", "2", 2)
 447
 448 /* Division for integer result that rounds the quotient toward infinity.  */
 449 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", "2", 2)
 450
 451 /* Division for integer result that rounds toward minus infinity.  */
 452 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", "2", 2)
 453
 454 /* Division for integer result that rounds toward nearest integer.  */
 455 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", "2", 2)
 456
 457 /* Four kinds of remainder that go with the four kinds of division.  */
 458 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", "2", 2)
 459 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", "2", 2)
 460 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", "2", 2)
 461 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", "2", 2)
 462
 463 /* Division for real result.  The two operands must have the same type.
 464    In principle they could be integers, but currently only real
 465    operands are supported.  The result must have the same type
 466    as the operands.  */
 467 DEFTREECODE (RDIV_EXPR, "rdiv_expr", "2", 2)
 468
 469 /* Division which is not supposed to need rounding.
 470    Used for pointer subtraction in C.  */
 471 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", "2", 2)
 472
 473 /* Conversion of real to fixed point: four ways to round,
 474    like the four ways to divide.
 475    CONVERT_EXPR can also be used to convert a real to an integer,
 476    and that is what is used in languages that do not have ways of
 477    specifying which of these is wanted.  Maybe these are not needed.  */
 478 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", "1", 1)
 479 DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", "1", 1)
 480 DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", "1", 1)
 481 DEFTREECODE (FIX_ROUND_EXPR, "fix_round_expr", "1", 1)
 482
 483 /* Conversion of an integer to a real.  */
 484 DEFTREECODE (FLOAT_EXPR, "float_expr", "1", 1)
 485
 486 /* Exponentiation.  Operands may have any types;
 487    constraints on value type are not known yet.  */
 488 DEFTREECODE (EXPON_EXPR, "expon_expr", "2", 2)
 489
 490 /* Unary negation.  Value has same type as operand.  */
 491 DEFTREECODE (NEGATE_EXPR, "negate_expr", "1", 1)
 492
 493 DEFTREECODE (MIN_EXPR, "min_expr", "2", 2)
 494 DEFTREECODE (MAX_EXPR, "max_expr", "2", 2)
 495 DEFTREECODE (ABS_EXPR, "abs_expr", "1", 1)
 496 DEFTREECODE (FFS_EXPR, "ffs_expr", "1", 1)
 497
 498 /* Shift operations for shift and rotate.
 499    Shift is supposed to mean logical shift if done on an
 500    unsigned type, arithmetic shift on a signed type.
 501    The second operand is the number of bits to
 502    shift by, and must always have mode SImode.
 503    The result has the same mode as the first operand.  */
 504 DEFTREECODE (LSHIFT_EXPR, "alshift_expr", "2", 2)
 505 DEFTREECODE (RSHIFT_EXPR, "arshift_expr", "2", 2)
 506 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", "2", 2)
 507 DEFTREECODE (RROTATE_EXPR, "rrotate_expr", "2", 2)
 508
 509 /* Bitwise operations.  Operands have same mode as result.  */
 510 DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", "2", 2)
 511 DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", "2", 2)
 512 DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", "2", 2)
 513 DEFTREECODE (BIT_ANDTC_EXPR, "bit_andtc_expr", "2", 2)
 514 DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", "1", 1)
 515
 516 /* Combination of boolean values or of integers considered only
 517    as zero or nonzero.  ANDIF and ORIF allow the second operand
 518    not to be computed if the value of the expression is determined
 519    from the first operand.  AND, OR, and XOR always compute the second
 520    operand whether its value is needed or not (for side effects).  */
 521 DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", "e", 2)
 522 DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", "e", 2)
 523 DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", "2", 2)
 524 DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", "2", 2)
 525 DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", "2", 2)
 526 DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", "e", 1)
 527
 528 /* Relational operators.
 529    `EQ_EXPR' and `NE_EXPR' are allowed for any types.
 530    The others are allowed only for integer (or pointer or enumeral)
 531    or real types.
 532    In all cases the operands will have the same type,
 533    and the value is always the type used by the language for booleans.  */
 534 DEFTREECODE (LT_EXPR, "lt_expr", "<", 2)
 535 DEFTREECODE (LE_EXPR, "le_expr", "<", 2)
 536 DEFTREECODE (GT_EXPR, "gt_expr", "<", 2)
 537 DEFTREECODE (GE_EXPR, "ge_expr", "<", 2)
 538 DEFTREECODE (EQ_EXPR, "eq_expr", "<", 2)
 539 DEFTREECODE (NE_EXPR, "ne_expr", "<", 2)
 540
 541 /* Operations for Pascal sets.  Not used now.  */
 542 DEFTREECODE (IN_EXPR, "in_expr", "2", 2)
 543 DEFTREECODE (SET_LE_EXPR, "set_le_expr", "<", 2)
 544 DEFTREECODE (CARD_EXPR, "card_expr", "1", 1)
 545 DEFTREECODE (RANGE_EXPR, "range_expr", "2", 2)
 546
 547 /* Represents a conversion of type of a value.
 548    All conversions, including implicit ones, must be
 549    represented by CONVERT_EXPR nodes.  */
 550 DEFTREECODE (CONVERT_EXPR, "convert_expr", "1", 1)
 551
 552 /* Represents a conversion expected to require no code to be generated.  */
 553 DEFTREECODE (NOP_EXPR, "nop_expr", "1", 1)
 554
 555 /* Value is same as argument, but guaranteed not an lvalue.  */
 556 DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", "1", 1)
 557
 558 /* Represents something we computed once and will use multiple times.
 559    First operand is that expression.  Second is the function decl
 560    in which the SAVE_EXPR was created.  The third operand is the RTL,
 561    nonzero only after the expression has been computed.  */
 562 DEFTREECODE (SAVE_EXPR, "save_expr", "e", 3)
 563
 564 /* Represents something whose RTL has already been expanded
 565    as a sequence which should be emitted when this expression is expanded.
 566    The first operand is the RTL to emit.  It is the first of a chain of insns.
 567    The second is the RTL expression for the result.  */
 568 DEFTREECODE (RTL_EXPR, "rtl_expr", "e", 2)
 569
 570 /* & in C.  Value is the address at which the operand's value resides.
 571    Operand may have any mode.  Result mode is Pmode.  */
 572 DEFTREECODE (ADDR_EXPR, "addr_expr", "e", 1)
 573
 574 /* Non-lvalue reference or pointer to an object.  */
 575 DEFTREECODE (REFERENCE_EXPR, "reference_expr", "e", 1)
 576
 577 /* Operand is a function constant; result is a function variable value
 578    of typeEPmode.  Used only for languages that need static chains.  */
 579 DEFTREECODE (ENTRY_VALUE_EXPR, "entry_value_expr", "e", 1)
 580
 581 /* Given two real or integer operands of the same type,
 582    returns a complex value of the corresponding complex type.  */
 583 DEFTREECODE (COMPLEX_EXPR, "complex_expr", "2", 2)
 584
 585 /* Complex conjugate of operand.  Used only on complex types.
 586    The value has the same type as the operand.  */
 587 DEFTREECODE (CONJ_EXPR, "conj_expr", "1", 1)
 588
 589 /* Used only on an operand of complex type, these return
 590    a value of the corresponding component type.  */
 591 DEFTREECODE (REALPART_EXPR, "realpart_expr", "1", 1)
 592 DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", "1", 1)
 593
 594 /* Nodes for ++ and -- in C.
 595    The second arg is how much to increment or decrement by.
 596    For a pointer, it would be the size of the object pointed to.  */
 597 DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", "e", 2)
 598 DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", "e", 2)
 599 DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", "e", 2)
 600 DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", "e", 2)
 601 \f
 602 /* These types of expressions have no useful value,
 603    and always have side effects.  */
 604
 605 /* A label definition, encapsulated as a statement.
 606    Operand 0 is the LABEL_DECL node for the label that appears here.
 607    The type should be void and the value should be ignored.  */
 608 DEFTREECODE (LABEL_EXPR, "label_expr", "s", 1)
 609
 610 /* GOTO.  Operand 0 is a LABEL_DECL node.
 611    The type should be void and the value should be ignored.  */
 612 DEFTREECODE (GOTO_EXPR, "goto_expr", "s", 1)
 613
 614 /* RETURN.  Evaluates operand 0, then returns from the current function.
 615    Presumably that operand is an assignment that stores into the
 616    RESULT_DECL that hold the value to be returned.
 617    The operand may be null.
 618    The type should be void and the value should be ignored.  */
 619 DEFTREECODE (RETURN_EXPR, "return_expr", "s", 1)
 620
 621 /* Exit the inner most loop conditionally.  Operand 0 is the condition.
 622    The type should be void and the value should be ignored.  */
 623 DEFTREECODE (EXIT_EXPR, "exit_expr", "s", 1)
 624
 625 /* A loop.  Operand 0 is the body of the loop.
 626    It must contain an EXIT_EXPR or is an infinite loop.
 627    The type should be void and the value should be ignored.  */
 628 DEFTREECODE (LOOP_EXPR, "loop_expr", "s", 1)
 629
 630 /*
 631 Local variables:
 632 mode:c
 633 version-control: t
 634 End:
 635 */