X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Ftree.def;h=3806f5b0043dcbe224e430a5aa5d74acb5c1ffc7;hb=c3c702dd3830537bdc32e5851651868789252231;hp=8068f266758f6c53e1b4a74a0ec847d9946c54db;hpb=6388f9f700c2179281798c832fa45aa1914706f8;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/tree.def b/gcc/tree.def index 8068f266758..3806f5b0043 100644 --- a/gcc/tree.def +++ b/gcc/tree.def @@ -1,6 +1,6 @@ /* This file contains the definitions and documentation for the tree codes used in GCC. - Copyright (C) 1987, 1988, 1993, 1995, 1997, 1998, 2000, 2001, 2004 + Copyright (C) 1987, 1988, 1993, 1995, 1997, 1998, 2000, 2001, 2004, 2005 Free Software Foundation, Inc. This file is part of GCC. @@ -20,50 +20,43 @@ along with GCC; see the file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ - -/* The third argument can be: - 'x' for an exceptional code (fits no category). - '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. - '<' for codes for comparison expressions. - '1' for codes for unary arithmetic expressions. - '2' for codes for binary arithmetic expressions. - 's' for codes for "statement" expressions, which have side-effects, - but usually no interesting value. - 'e' for codes for other kinds of expressions. */ - -/* For `r', `e', `<', `1', `2', and `s' nodes, which use struct - tree_exp, the 4th element is the number of argument slots to - allocate. This determines the size of the tree node object. - Other nodes use different structures, and the size is determined - by the tree_union member structure; the 4th element should be - zero. Languages that define language-specific 'x' or 'c' codes - must define the tree_size langhook to say how big they are. */ + +/* For tcc_references, tcc_expression, tcc_comparison, tcc_unary, + tcc_binary, and tcc_statement nodes, which use struct tree_exp, the + 4th element is the number of argument slots to allocate. This + determines the size of the tree node object. Other nodes use + different structures, and the size is determined by the tree_union + member structure; the 4th element should be zero. Languages that + define language-specific tcc_exceptional or tcc_constant codes must + define the tree_size langhook to say how big they are. + + These tree codes have been sorted so that the macros in tree.h that + check for various tree codes are optimized into range checks. This + gives a measurable performance improvement. When adding a new + code, consider its placement in relation to the other codes. */ /* 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) +DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 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', 0) +DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0) /* 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', 0) +DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0) /* These nodes contain an array of tree nodes. */ -DEFTREECODE (TREE_VEC, "tree_vec", 'x', 0) +DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0) /* A symbol binding block. These are arranged in a tree, where the BLOCK_SUBBLOCKS field contains a chain of subblocks @@ -82,10 +75,10 @@ DEFTREECODE (TREE_VEC, "tree_vec", 'x', 0) outermost scope of a particular inlining of a function). BLOCK_ABSTRACT is nonzero if the block represents an abstract instance of a block (i.e. one which is nested within an abstract - instance of an inline function). + instance of an inline function). TREE_ASM_WRITTEN is nonzero if the block was actually referenced in the generated assembly. */ -DEFTREECODE (BLOCK, "block", 'x', 0) +DEFTREECODE (BLOCK, "block", tcc_exceptional, 0) /* Each data type is represented by a tree node whose code is one of the following: */ @@ -130,29 +123,16 @@ DEFTREECODE (BLOCK, "block", 'x', 0) ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes; see below. */ -DEFTREECODE (VOID_TYPE, "void_type", 't', 0) /* The void type in C */ - -/* Integer types in all languages, including char in C. - Also used for sub-ranges of other discrete types. - 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, - or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_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) - -/* Vector types. The TREE_TYPE field is the data type of the vector - elements. */ -DEFTREECODE (VECTOR_TYPE, "vector_type", 't', 0) +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. OFFSET_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, CHAR_TYPE, + INTEGER_TYPE, REAL_TYPE, POINTER_TYPE. */ + +/* 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", tcc_type, 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 @@ -165,40 +145,60 @@ DEFTREECODE (VECTOR_TYPE, "vector_type", 't', 0) fields are filled in. RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are treated similarly. */ -DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", 't', 0) +DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0) -/* Pascal's boolean type (true or false are the only values); - no special fields needed. */ -DEFTREECODE (BOOLEAN_TYPE, "boolean_type", 't', 0) +/* Boolean type (true or false are the only values). Looks like an + INTEGRAL_TYPE. */ +DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0) -/* CHAR in Pascal; not used in C. - No special fields needed. */ -DEFTREECODE (CHAR_TYPE, "char_type", 't', 0) +/* CHAR in Java; not used in C. Looks like an INTEGRAL_TYPE. */ +DEFTREECODE (CHAR_TYPE, "char_type", tcc_type, 0) +/* Integer types in all languages, including char in C. + Also used for sub-ranges of other discrete types. + 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, + or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_TYPE). + Otherwise, the TREE_TYPE is zero. */ +DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 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", tcc_type, 0) + +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range + overlaps the previous range of ordered types. */ + /* 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) +DEFTREECODE (POINTER_TYPE, "pointer_type", tcc_type, 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) +DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0) -/* Used for Pascal; details not determined right now. */ -DEFTREECODE (FILE_TYPE, "file_type", 't', 0) +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. COMPLEX_TYPE, VECTOR_TYPE, ARRAY_TYPE. */ + +/* Complex number types. The TREE_TYPE field is the data type + of the real and imaginary parts. */ +DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0) +/* Vector types. The TREE_TYPE field is the data type of the vector + elements. The TYPE_PRECISION field is the number of subparts of + the vector. */ +DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0) + +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE. + Note that this range overlaps the previous range. */ + /* Types of arrays. Special fields: TREE_TYPE Type of an array element. TYPE_DOMAIN Type to index by. @@ -208,13 +208,7 @@ DEFTREECODE (FILE_TYPE, "file_type", 't', 0) TYPE_STRING_FLAG indicates a string (in contrast to an array of chars) in languages (such as Chill) that make a distinction. */ /* 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. - Used for both bitstrings and powersets in Chill; - TYPE_STRING_FLAG indicates a bitstring. */ -DEFTREECODE (SET_TYPE, "set_type", 't', 0) +DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0) /* Struct in C, or record in Pascal. */ /* Special fields: @@ -224,19 +218,26 @@ DEFTREECODE (SET_TYPE, "set_type", 't', 0) 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) +DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 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 */ +DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */ /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER in each FIELD_DECL determine what the union contains. The first field whose DECL_QUALIFIER expression is true is deemed to occupy the union. */ -DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", 't', 0) +DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0) + +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */ + +/* The void type in C */ +DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0) /* Type of functions. Special fields: TREE_TYPE type of value returned. @@ -244,37 +245,47 @@ DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", 't', 0) 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) +DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 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", tcc_type, 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) +DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0) /* 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', 0) + 32 bits each, giving us a 64 bit constant capability. INTEGER_CST + nodes can be shared, and therefore should be considered read only. + They should be copied, before setting a flag such as + TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW or + TREE_CONSTANT_OVERFLOW already set, it is known to be unique. + INTEGER_CST nodes are created for the integral types, for pointer + types and for vector and float types in some circumstances. */ +DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0) /* Contents are in TREE_REAL_CST field. */ -DEFTREECODE (REAL_CST, "real_cst", 'c', 0) +DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0) /* Contents are in TREE_REALPART and TREE_IMAGPART fields, whose contents are other constant nodes. */ -DEFTREECODE (COMPLEX_CST, "complex_cst", 'c', 0) +DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0) /* Contents are in TREE_VECTOR_CST_ELTS field. */ -DEFTREECODE (VECTOR_CST, "vector_cst", 'c', 0) +DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0) -/* Contents are TREE_STRING_LENGTH and TREE_STRING_POINTER fields. */ -DEFTREECODE (STRING_CST, "string_cst", 'c', 0) +/* Contents are TREE_STRING_LENGTH and the actual contents of the string. */ +DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0) /* Declarations. All references to names are represented as ..._DECL nodes. The decls in one binding context are chained through the @@ -334,22 +345,27 @@ DEFTREECODE (STRING_CST, "string_cst", 'c', 0) of a decl (i.e. one which is nested within an abstract instance of a inline function. */ -DEFTREECODE (FUNCTION_DECL, "function_decl", 'd', 0) -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', 0) -DEFTREECODE (RESULT_DECL, "result_decl", 'd', 0) -DEFTREECODE (FIELD_DECL, "field_decl", 'd', 0) +DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0) +DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0) +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. FIELD_DECL, VAR_DECL, CONST_DECL, PARM_DECL, + TYPE_DECL. */ +DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0) +DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0) +DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0) +DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0) +DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0) +DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0) /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other _DECLs, providing a hierarchy of names. */ -DEFTREECODE (NAMESPACE_DECL, "namespace_decl", 'd', 0) +DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0) /* A translation unit. This is not technically a declaration, since it can't be looked up, but it's close enough. */ -DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl", 'd', 0) +DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\ + tcc_declaration, 0) /* References to storage. */ @@ -358,7 +374,7 @@ DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl", 'd', 0) Operand 1 is the field (a node of type FIELD_DECL). Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */ -DEFTREECODE (COMPONENT_REF, "component_ref", 'r', 3) +DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3) /* Reference to a group of bits within an object. Similar to COMPONENT_REF except the position is given explicitly rather than via a FIELD_DECL. @@ -367,22 +383,37 @@ DEFTREECODE (COMPONENT_REF, "component_ref", 'r', 3) operand 2 is a tree giving the position of the first referenced bit. The field can be either a signed or unsigned field; BIT_FIELD_REF_UNSIGNED says which. */ -DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", 'r', 3) - +DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3) + +/* The ordering of the following codes is optimized for the checking + macros in tree.h. Changing the order will degrade the speed of the + compiler. INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */ + /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */ -DEFTREECODE (INDIRECT_REF, "indirect_ref", 'r', 1) +DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1) + +/* Like above, but aligns the referenced address (i.e, if the address + in P is not aligned on TYPE_ALIGN boundary, then &(*P) != P). */ +DEFTREECODE (ALIGN_INDIRECT_REF, "align_indirect_ref", tcc_reference, 1) + +/* Same as INDIRECT_REF, but also specifies the alignment of the referenced + address: + Operand 0 is the referenced address (a pointer); + Operand 1 is an INTEGER_CST which represents the alignment of the address, + or 0 if the alignment is unknown. */ +DEFTREECODE (MISALIGNED_INDIRECT_REF, "misaligned_indirect_ref", tcc_reference, 2) /* Array indexing. Operand 0 is the array; operand 1 is a (single) array index. Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index. Operand 3, if present, is the element size, measured in units of the alignment of the element type. */ -DEFTREECODE (ARRAY_REF, "array_ref", 'r', 4) +DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4) /* Likewise, except that the result is a range ("slice") of the array. The starting index of the resulting array is taken from operand 1 and the size of the range is taken from the type of the expression. */ -DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", 'r', 4) +DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4) /* Used to represent lookup of runtime type dependent data. Often this is a reference to a vtable, but it needn't be. Operands are: @@ -394,17 +425,16 @@ DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", 'r', 4) reference to something simpler, usually to the address of a DECL. Never touched by the middle-end. Good choices would be either an identifier or a vtable index. */ -DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", 'e', 3) +DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3) /* The exception object from the runtime. */ -DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", 'e', 0) +DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", tcc_expression, 0) /* The filter object from the runtime. */ -DEFTREECODE (FILTER_EXPR, "filter_expr", 'e', 0) +DEFTREECODE (FILTER_EXPR, "filter_expr", tcc_expression, 0) /* Constructor: return an aggregate value made from specified components. In C, this is used only for structure and array initializers. - Also used for SET_TYPE in Chill (and potentially Pascal). The operand is a list of component values made out of a chain of TREE_LIST nodes. @@ -416,13 +446,8 @@ DEFTREECODE (FILTER_EXPR, "filter_expr", 'e', 0) value in a SAVE_EXPR if you want to evaluate side effects only once.) For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE: - The TREE_PURPOSE of each node is a FIELD_DECL. - - For SET_TYPE: - The TREE_VALUE specifies a value (index) in the set that is true. - If TREE_PURPOSE is non-NULL, it specifies the lower limit of a - range of true values. Elements not listed are false (not in the set). */ -DEFTREECODE (CONSTRUCTOR, "constructor", 'e', 1) + The TREE_PURPOSE of each node is a FIELD_DECL. */ +DEFTREECODE (CONSTRUCTOR, "constructor", tcc_expression, 1) /* The expression types are mostly straightforward, with the fourth argument of DEFTREECODE saying how many operands there are. @@ -432,14 +457,14 @@ DEFTREECODE (CONSTRUCTOR, "constructor", 'e', 1) /* Contains two expressions to compute, one followed by the other. the first value is ignored. The second one's value is used. The type of the first expression need not agree with the other types. */ -DEFTREECODE (COMPOUND_EXPR, "compound_expr", 'e', 2) +DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2) /* Assignment expression. Operand 0 is the what to set; 1, the new value. */ -DEFTREECODE (MODIFY_EXPR, "modify_expr", 'e', 2) +DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2) /* Initialization expression. Operand 0 is the variable to initialize; Operand 1 is the initializer. */ -DEFTREECODE (INIT_EXPR, "init_expr", 'e', 2) +DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2) /* For TARGET_EXPR, operand 0 is the target of an initialization, operand 1 is the initializer for the target, which may be void @@ -447,7 +472,7 @@ DEFTREECODE (INIT_EXPR, "init_expr", 'e', 2) operand 2 is the cleanup for this node, if any. operand 3 is the saved initializer after this node has been expanded once; this is so we can re-expand the tree later. */ -DEFTREECODE (TARGET_EXPR, "target_expr", 'e', 4) +DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4) /* Conditional expression ( ... ? ... : ... in C). Operand 0 is the condition. @@ -457,11 +482,23 @@ DEFTREECODE (TARGET_EXPR, "target_expr", 'e', 4) Operand 1 must have the same type as the entire expression, unless it unconditionally throws an exception, in which case it should have VOID_TYPE. The same constraints apply to operand 2. */ -DEFTREECODE (COND_EXPR, "cond_expr", 'e', 3) +DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3) + +/* Vector conditional expression. It is like COND_EXPR, but with + vector operands. + + A = VEC_COND_EXPR ( X < Y, B, C) + + means + + for (i=0; i from the argument list. Each tuple contains the incoming reaching definition (SSA_NAME node) and the edge via which that definition - is coming through. */ -DEFTREECODE (PHI_NODE, "phi_node", 'x', 0) + is coming through. */ +DEFTREECODE (PHI_NODE, "phi_node", tcc_exceptional, 0) /* Used to represent a typed exception handler. CATCH_TYPES is the type (or list of types) handled, and CATCH_BODY is the code for the handler. */ -DEFTREECODE (CATCH_EXPR, "catch_expr", 's', 2) +DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2) /* Used to represent an exception specification. EH_FILTER_TYPES is a list of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on failure. EH_FILTER_MUST_NOT_THROW controls which range type to use when expanding. */ -DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", 's', 2) +DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2) /* Node used for describing a property that is known at compile time. */ -DEFTREECODE (SCEV_KNOWN, "scev_known", 'e', 0) +DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0) /* Node used for describing a property that is not known at compile time. */ -DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", 'e', 0) +DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0) /* Polynomial chains of recurrences. Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */ -DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", 'e', 3) +DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3) /* Used to chain children of container statements together. Use the interface in tree-iterator.h to access this node. */ -DEFTREECODE (STATEMENT_LIST, "statement_list", 'x', 0) +DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0) /* Value handles. Artificial nodes to represent expressions in partial redundancy elimination (tree-ssa-pre.c). These nodes are used for expression canonicalization. If two expressions compute the same value, they will be assigned the same value handle. */ -DEFTREECODE (VALUE_HANDLE, "value_handle", 'x', 0) +DEFTREECODE (VALUE_HANDLE, "value_handle", tcc_exceptional, 0) + +/* Predicate assertion. Artificial expression generated by the optimizers + to keep track of predicate values. This expression may only appear on + the RHS of assignments. + + Given X = ASSERT_EXPR , the optimizers can infer + two things: + + 1- X is a copy of Y. + 2- EXPR is a GIMPLE conditional expression (as defined by + is_gimple_condexpr) and is known to be true. + + The type of the expression is the same as Y. */ +DEFTREECODE (ASSERT_EXPR, "assert_expr", tcc_expression, 2) /* Base class information. Holds information about a class as a baseclass of itself or another class. */ -DEFTREECODE (TREE_BINFO, "tree_binfo", 'x', 0) +DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0) + +/* Records the size for an expression of variable size type. This is + for use in contexts in which we are accessing the entire object, + such as for a function call, or block copy. + Operand 0 is the real expression. + Operand 1 is the size of the type in the expression. */ +DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2) + +/* Extract elements from two input vectors Operand 0 and Operand 1 + size VS, according to the offset OFF defined by Operand 2 as + follows: + If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to + the first OFF elements of the vector OP1. + If OFF == 0, then the returned vector is OP1. + On different targets OFF may take different forms; It can be an address, in + which case its low log2(VS)-1 bits define the offset, or it can be a mask + generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */ +DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3) /* Local variables: