* This code is derived from software copyrighted by the Free Software
* Modified 1991 by Donn Seeley at UUNET Technologies, Inc.
static char sccsid
[] = "@(#)c-typeck.c 6.3 (Berkeley) 5/8/91";
/* Build expressions with type checking for C compiler.
Copyright (C) 1987, 1988, 1989 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)
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. */
/* This file is part of the C front end.
It contains routines to build C expressions given their operands,
including computing the types of the result, C-specific error checks,
There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
and to process initializations in declarations (since they work
like a strange sort of assignment). */
static tree
convert_for_assignment ();
int comp_target_types ();
static tree
shorten_compare ();
static void binary_op_error ();
static tree
pointer_int_sum ();
static tree
pointer_diff ();
static tree
convert_sequence ();
static tree
unary_complex_lvalue ();
static tree
process_init_constructor ();
tree
truthvalue_conversion ();static tree
invert_truthvalue ();
void incomplete_type_error ();
void readonly_warning ();
/* Return the _TYPE node describing the data type
of the data which NODE represents as a C expression.
Arrays and functions are converted to pointers
just as they are when they appear as C expressions. */
register tree type
= TREE_TYPE (node
);
if (TREE_CODE (type
) == ARRAY_TYPE
)
return TYPE_POINTER_TO (TREE_TYPE (type
));
if (TREE_CODE (type
) == FUNCTION_TYPE
)
return build_pointer_type (type
);
/* Do `exp = require_complete_type (exp);' to make sure exp
does not have an incomplete type. (That includes void types.) */
require_complete_type (value
)
tree type
= TREE_TYPE (value
); /* First, detect a valid value with a complete type. */
if (TYPE_SIZE (type
) != 0
&& type
!= void_type_node
)
incomplete_type_error (value
, type
);
/* Print an error message for invalid use of an incomplete type.
VALUE is the expression that was used (or 0 if that isn't known)
and TYPE is the type that was invalid. */
incomplete_type_error (value
, type
)
/* Avoid duplicate error message. */
if (TREE_CODE (type
) == ERROR_MARK
)
if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == PARM_DECL
))
error ("`%s' has an incomplete type",
IDENTIFIER_POINTER (DECL_NAME (value
)));
/* We must print an error message. Be clever about what it says. */
switch (TREE_CODE (type
))
errmsg
= "invalid use of undefined type `struct %s'"; errmsg
= "invalid use of undefined type `union %s'"; errmsg
= "invalid use of undefined type `enum %s'"; error ("invalid use of void expression");
error ("invalid use of array with unspecified bounds");
if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
error (errmsg
, IDENTIFIER_POINTER (TYPE_NAME (type
)));
/* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
error ("invalid use of incomplete typedef `%s'",
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
))));
/* Return a variant of TYPE which has all the type qualifiers of LIKE
as well as those of TYPE. */
qualify_type (type
, like
)
int constflag
= TREE_READONLY (type
) || TREE_READONLY (like
);
int volflag
= TREE_VOLATILE (type
) || TREE_VOLATILE (like
);
return c_build_type_variant (type
, constflag
, volflag
);
/* Return the common type of two types.
We assume that comptypes has already been done and returned 1;
if that isn't so, this may crash.
This is the type for the result of most arithmetic operations
if the operands have the given two types.
We do not deal with enumeral types here because they have already been
converted to integer types. */
register enum tree_code form1
;
register enum tree_code form2
;
/* Save time if the two types are the same. */
/* If one type is nonsense, use the other. */
if (t1
== error_mark_node
)
if (t2
== error_mark_node
)
/* Treat an enum type as the unsigned integer type of the same width. */
if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
t1
= type_for_size (TYPE_PRECISION (t1
), 1); if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
t2
= type_for_size (TYPE_PRECISION (t2
), 1); /* If only one is real, use it as the result. */
if (form1
== REAL_TYPE
&& form2
!= REAL_TYPE
)
if (form2
== REAL_TYPE
&& form1
!= REAL_TYPE
)
/* Both real or both integers; use the one with greater precision. */
if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
/* Same precision. Prefer longs to ints even when same size. */
if (t1
== long_unsigned_type_node
|| t2
== long_unsigned_type_node
)
return long_unsigned_type_node
;
if (t1
== long_integer_type_node
|| t2
== long_integer_type_node
)
/* But preserve unsignedness from the other type,
since long cannot hold all the values of an unsigned int. */
if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
return long_unsigned_type_node
;
return long_integer_type_node
;
/* Otherwise prefer the unsigned one. */
/* For two pointers, do this recursively on the target type,
and combine the qualifiers of the two types' targets. */
tree target
= commontype (TYPE_MAIN_VARIANT (TREE_TYPE (t1
)), TYPE_MAIN_VARIANT (TREE_TYPE (t2
)));
= TREE_READ_ONLY (TREE_TYPE (t1
)) || TREE_READ_ONLY (TREE_TYPE (t2
));
= TREE_VOLATILE (TREE_TYPE (t1
)) || TREE_VOLATILE (TREE_TYPE (t2
));
return build_pointer_type (c_build_type_variant (target
, constp
, volatilep
));
return build_pointer_type (commontype (TREE_TYPE (t1
), TREE_TYPE (t2
)));
tree elt
= commontype (TREE_TYPE (t1
), TREE_TYPE (t2
)); /* Save space: see if the result is identical to one of the args. */
if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
/* Merge the element types, and have a size if either arg has one. */
return build_array_type (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
/* Function types: prefer the one that specified arg types.
If both do, merge the arg types. Also merge the return types. */
tree valtype
= commontype (TREE_TYPE (t1
), TREE_TYPE (t2
)); tree p1
= TYPE_ARG_TYPES (t1
); tree p2
= TYPE_ARG_TYPES (t2
); /* Save space: see if the result is identical to one of the args. */
if (valtype
== TREE_TYPE (t1
) && ! TYPE_ARG_TYPES (t2
))
if (valtype
== TREE_TYPE (t2
) && ! TYPE_ARG_TYPES (t1
))
/* Simple way if one arg fails to specify argument types. */
if (TYPE_ARG_TYPES (t1
) == 0)
return build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
if (TYPE_ARG_TYPES (t2
) == 0)
return build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
/* If both args specify argument types, we must merge the two
lists, argument by argument. */
for (i
= 0; i
< len
; i
++)
newargs
= tree_cons (0, 0, newargs
); p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
)) TREE_VALUE (n
) = commontype (TREE_VALUE (p1
), TREE_VALUE (p2
));
return build_function_type (valtype
, newargs
);
/* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
or various other operations. This is what ANSI C speaks of as
register tree t1
= type1
;
register tree t2
= type2
;
/* Suppress errors caused by previously reported errors */
if (t1
== t2
|| TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
/* Treat an enum type as the unsigned integer type of the same width. */
if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
t1
= type_for_size (TYPE_PRECISION (t1
), 1); if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
t2
= type_for_size (TYPE_PRECISION (t2
), 1); /* Different classes of types can't be compatible. */
if (TREE_CODE (t1
) != TREE_CODE (t2
)) return 0;
/* Qualifiers must match. */
if (TREE_READONLY (t1
) != TREE_READONLY (t2
))
if (TREE_THIS_VOLATILE (t1
) != TREE_THIS_VOLATILE (t2
))
return (TREE_TYPE (t1
) == TREE_TYPE (t2
)
|| comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
return ((TREE_TYPE (t1
) == TREE_TYPE (t2
)
|| comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)))
&& compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)));
/* Target types must match incl. qualifiers. */
if (!(TREE_TYPE (t1
) == TREE_TYPE (t2
)
|| comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
tree d1
= TYPE_DOMAIN (t1
); tree d2
= TYPE_DOMAIN (t2
); /* Sizes must match unless one is missing or variable. */
if (d1
== 0 || d2
== 0 || d1
== d2
|| TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
|| TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
|| TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
|| TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
return ((TREE_INT_CST_LOW (TYPE_MIN_VALUE (d1
))
== TREE_INT_CST_LOW (TYPE_MIN_VALUE (d2
)))
&& (TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d1
))
== TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d2
)))
&& (TREE_INT_CST_LOW (TYPE_MAX_VALUE (d1
))
== TREE_INT_CST_LOW (TYPE_MAX_VALUE (d2
)))
&& (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d1
))
== TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d2
))));
/* Return 1 if TTL and TTR are pointers to types that are equivalent,
ignoring their qualifiers. */
comp_target_types (ttl
, ttr
)
return comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl
)),
TYPE_MAIN_VARIANT (TREE_TYPE (ttr
)));
/* Subroutines of `comptypes'. */
/* Return 1 if two parameter type lists PARMS1 and PARMS2
are equivalent in the sense that functions with those parameter types
can have equivalent types.
If either list is empty, we win.
Otherwise, the two lists must be equivalent, element by element. */
compparms (parms1
, parms2
)
register tree t1
= parms1
, t2
= parms2
;
/* An unspecified parmlist matches any specified parmlist
whose argument types don't need default promotions. */
/* If one parmlist is shorter than the other,
if (! comptypes (TREE_VALUE (t1
), TREE_VALUE (t2
)))
/* Return 1 if PARMS specifies a fixed number of parameters
and none of their types is affected by default promotions. */
for (t
= parms
; t
; t
= TREE_CHAIN (t
))
register tree type
= TREE_VALUE (t
);
if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
if (type
== float_type_node
)
if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
/* Return an unsigned type the same as TYPE in other respects. */
if (type
== signed_char_type_node
|| type
== char_type_node
)
return unsigned_char_type_node
;
if (type
== integer_type_node
)
return unsigned_type_node
;
if (type
== short_integer_type_node
)
return short_unsigned_type_node
;
if (type
== long_integer_type_node
)
return long_unsigned_type_node
;
if (type
== long_long_integer_type_node
)
return long_long_unsigned_type_node
;
/* Return a signed type the same as TYPE in other respects. */
if (type
== unsigned_char_type_node
|| type
== char_type_node
)
return signed_char_type_node
;
if (type
== unsigned_type_node
)
return integer_type_node
;
if (type
== short_unsigned_type_node
)
return short_integer_type_node
;
if (type
== long_unsigned_type_node
)
return long_integer_type_node
;
if (type
== long_long_unsigned_type_node
)
return long_long_integer_type_node
;
/* Return a type the same as TYPE except unsigned or
signed according to UNSIGNEDP. */
signed_or_unsigned_type (unsignedp
, type
)
if (TREE_CODE (type
) != INTEGER_TYPE
)
if (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
))
return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
if (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
return unsignedp
? unsigned_type_node
: integer_type_node
;
if (TYPE_PRECISION (type
) == TYPE_PRECISION (short_integer_type_node
))
return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_integer_type_node
))
return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_long_integer_type_node
))
return (unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
);
/* Return an integer type with BITS bits of precision,
that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
type_for_size (bits
, unsignedp
)
if (bits
<= TYPE_PRECISION (signed_char_type_node
))
return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
if (bits
<= TYPE_PRECISION (short_integer_type_node
))
return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
if (bits
<= TYPE_PRECISION (integer_type_node
))
return unsignedp
? unsigned_type_node
: integer_type_node
;
if (bits
<= TYPE_PRECISION (long_integer_type_node
))
return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
if (bits
<= TYPE_PRECISION (long_long_integer_type_node
))
return (unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
);
if (mode
== TYPE_MODE (float_type_node
))
if (mode
== TYPE_MODE (double_type_node
))
if (mode
== TYPE_MODE (long_double_type_node
))
return long_double_type_node
;
enum tree_code code
= TREE_CODE (type
);
if (code
== FUNCTION_TYPE
)
if (pedantic
|| warn_pointer_arith
)
warning ("sizeof applied to a function type");
if (pedantic
|| warn_pointer_arith
)
warning ("sizeof applied to a void type");
/* Convert in case a char is more than one unit. */
return convert_units (size_in_bytes (type
), BITS_PER_UNIT
,
TYPE_PRECISION (char_type_node
));
enum tree_code code
= TREE_CODE (type
);
if (code
== FUNCTION_TYPE
/* Convert in case a char is more than one unit. */
return convert_units (size_in_bytes (type
), BITS_PER_UNIT
,
TYPE_PRECISION (char_type_node
));
/* Implement the __alignof keyword: Return the minimum required
alignment of TYPE, measured in bytes. */
enum tree_code code
= TREE_CODE (type
);
if (code
== FUNCTION_TYPE
)
return build_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
return build_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
/* Return either DECL or its known constant value (if it has one). */
decl_constant_value (decl
)
/* Don't change a variable array bound or initial value to a constant
in a place where a variable is invalid. */
&& current_function_decl
!= 0
&& ! TREE_THIS_VOLATILE (decl
)
&& DECL_INITIAL (decl
) != 0
&& TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
/* This is invalid if initial value is not constant.
If it has either a function call, a memory reference,
or a variable, then re-evaluating it could give different results. */
&& TREE_LITERAL (DECL_INITIAL (decl
))
/* Check for cases where this is sub-optimal, even though valid. */
&& TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
&& DECL_MODE (decl
) != BLKmode
)
return DECL_INITIAL (decl
);
/* Perform default promotions for C data used in expressions.
Arrays and functions are converted to pointers;
enumeral types or short or char, to int.
In addition, manifest constants symbols are replaced by their values. */
register tree dt
= TREE_TYPE (exp
);
register enum tree_code form
= TREE_CODE (dt
);
if (TREE_CODE (exp
) == CONST_DECL
)
exp
= DECL_INITIAL (exp
); /* Replace a nonvolatile const static variable with its value. */
&& TREE_CODE (exp
) == VAR_DECL
exp
= decl_constant_value (exp
); /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since EXP is being used in non-lvalue context. */
if (TREE_CODE (exp
) == NOP_EXPR
&& TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0)))
exp
= TREE_OPERAND (exp
, 0); if (form
== ENUMERAL_TYPE
< TYPE_PRECISION (integer_type_node
))))
/* Traditionally, unsignedness is preserved in default promotions. */
if (flag_traditional
&& TREE_UNSIGNED (dt
))
return convert (unsigned_type_node
, exp
);
return convert (integer_type_node
, exp
);
if (flag_traditional
&& dt
== float_type_node
)
return convert (double_type_node
, exp
);
error ("void value not ignored as it ought to be");
if (form
== FUNCTION_TYPE
)
return build_unary_op (ADDR_EXPR
, exp
, 0);
tree restype
= TREE_TYPE (dt
); if (TREE_CODE (exp
) == INDIRECT_REF
)
return convert (TYPE_POINTER_TO (restype
),
if (TREE_CODE (exp
) == COMPOUND_EXPR
)
tree op1
= default_conversion (TREE_OPERAND (exp
, 1)); return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
TREE_OPERAND (exp
, 0), op1
);
&& ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
error ("invalid use of non-lvalue array");
if (TREE_READONLY (exp
) || TREE_THIS_VOLATILE (exp
))
restype
= c_build_type_variant (restype
, TREE_READONLY (exp
), TREE_THIS_VOLATILE (exp
));
ptrtype
= build_pointer_type (restype
); if (TREE_CODE (exp
) == VAR_DECL
)
/* ??? This is not really quite correct
in that the type of the operand of ADDR_EXPR
is not the target type of the type of the ADDR_EXPR itself.
Question is, can this lossage be avoided? */
adr
= build (ADDR_EXPR
, ptrtype
, exp
); if (mark_addressable (exp
) == 0)
TREE_LITERAL (adr
) = staticp (exp
);
TREE_VOLATILE (adr
) = 0; /* Default would be, same as EXP. */
/* This way is better for a COMPONENT_REF since it can
simplify the offset for a component. */
adr
= build_unary_op (ADDR_EXPR
, exp
, 1); return convert (ptrtype
, adr
);
/* Make an expression to refer to the COMPONENT field of
structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
build_component_ref (datum
, component
)
register tree basename
= datum
;
register tree basetype
= TREE_TYPE (basename
);
register enum tree_code form
= TREE_CODE (basetype
);
register tree field
= NULL
;
/* First, see if there is a field or component with name COMPONENT. */
if (form
== RECORD_TYPE
|| form
== UNION_TYPE
)
if (TYPE_SIZE (basetype
) == 0)
incomplete_type_error (0, basetype
);
/* Look up component name in the structure type definition. */
for (field
= TYPE_FIELDS (basetype
); field
; field
= TREE_CHAIN (field
))
if (DECL_NAME (field
) == component
)
error (form
== RECORD_TYPE
? "structure has no member named `%s'"
: "union has no member named `%s'",
IDENTIFIER_POINTER (component
));
if (TREE_TYPE (field
) == error_mark_node
)
ref
= build (COMPONENT_REF
, TREE_TYPE (field
), basename
, field
); if (TREE_READONLY (basename
) || TREE_READONLY (field
))
if (TREE_THIS_VOLATILE (basename
) || TREE_VOLATILE (field
))
TREE_THIS_VOLATILE (ref
) = 1;
else if (form
!= ERROR_MARK
)
error ("request for member `%s' in something not a structure or union",
IDENTIFIER_POINTER (component
));
/* Given an expression PTR for a pointer, return an expression
for the value pointed to.
ERRORSTRING is the name of the operator to appear in error messages. */
build_indirect_ref (ptr
, errorstring
)
register tree pointer
= default_conversion (ptr
);
register tree dt
= TREE_TYPE (pointer
);
if (TREE_CODE (dt
) == POINTER_TYPE
)
if (TREE_CODE (pointer
) == ADDR_EXPR
&& (TREE_TYPE (TREE_OPERAND (pointer
, 0))
return TREE_OPERAND (pointer
, 0);
register tree ref
= build (INDIRECT_REF
,
TYPE_MAIN_VARIANT (t
), pointer
);
if (TREE_CODE (t
) == VOID_TYPE
|| (TYPE_SIZE (t
) == 0 && TREE_CODE (t
) != ARRAY_TYPE
))
error ("dereferencing pointer to incomplete type");
TREE_READONLY (ref
) = TREE_READONLY (t
);
TREE_VOLATILE (ref
) = TREE_VOLATILE (t
) || TREE_VOLATILE (pointer
);
TREE_THIS_VOLATILE (ref
) = TREE_VOLATILE (t
);
else if (TREE_CODE (pointer
) != ERROR_MARK
)
error ("invalid type argument of `%s'", errorstring
);
/* This handles expressions of the form "a[i]", which denotes
This is logically equivalent in C to *(a+i), but we may do it differently.
If A is a variable or a member, we generate a primitive ARRAY_REF.
This avoids forcing the array out of registers, and can work on
arrays that are not lvalues (for example, members of structures returned
build_array_ref (array
, index
)
error ("subscript missing in array reference");
if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
&& TREE_CODE (array
) != INDIRECT_REF
)
index
= default_conversion (index
); if (index
!= error_mark_node
&& TREE_CODE (TREE_TYPE (index
)) != INTEGER_TYPE
)
error ("array subscript is not an integer");
/* An array that is indexed by a non-constant
cannot be stored in a register; we must be able to do
address arithmetic on its address.
Likewise an array of elements of variable size. */
if (TREE_CODE (index
) != INTEGER_CST
|| (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))) != 0
&& TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
if (mark_addressable (array
) == 0)
if (pedantic
&& !lvalue_p (array
))
warning ("ANSI C forbids subscripting non-lvalue array");
while (TREE_CODE (foo
) == COMPONENT_REF
)
foo
= TREE_OPERAND (foo
, 0); if (TREE_CODE (foo
) == VAR_DECL
&& TREE_REGDECL (foo
))
warning ("ANSI C forbids subscripting non-lvalue array");
type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
))); rval
= build (ARRAY_REF
, type
, array
, index
); /* Array ref is const/volatile if the array elements are. */
TREE_READONLY (rval
) |= TREE_READONLY (TREE_TYPE (TREE_TYPE (array
)));
TREE_VOLATILE (rval
) |= TREE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)));
TREE_THIS_VOLATILE (rval
) |= TREE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)));
return require_complete_type (fold (rval
));
tree ar
= default_conversion (array
); tree ind
= default_conversion (index
); if ((TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
&& TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
|| (TREE_CODE (TREE_TYPE (ind
)) == POINTER_TYPE
&& TREE_CODE (TREE_TYPE (ar
)) != INTEGER_TYPE
))
error ("array subscript is not an integer");
return build_indirect_ref (build_binary_op_nodefault (PLUS_EXPR
, ar
, ind
, PLUS_EXPR
),
/* Build a function call to function FUNCTION with parameters PARAMS.
PARAMS is a list--a chain of TREE_LIST nodes--in which the
TREE_VALUE of each node is a parameter-expression.
FUNCTION's data type may be a function type or a pointer-to-function. */
build_function_call (function
, params
)
register tree value_type
;
register tree coerced_params
;
tree
actualparameterlist (); /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
if (TREE_CODE (function
) == NOP_EXPR
&& TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
function
= TREE_OPERAND (function
, 0); /* Convert anything with function type to a pointer-to-function. */
if (TREE_CODE (function
) == FUNCTION_DECL
)
name
= DECL_NAME (function
); /* Differs from default_conversion by not setting TREE_ADDRESSABLE
(because calling an inline function does not mean the function
needs to be separately compiled). */
function
= build (ADDR_EXPR
, build_pointer_type (TREE_TYPE (function
)), function
= default_conversion (function
); fntype
= TREE_TYPE (function
); if (TREE_CODE (fntype
) == ERROR_MARK
)
if (!(TREE_CODE (fntype
) == POINTER_TYPE
&& TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
error ("called object is not a function");
/* fntype now gets the type of function pointed to. */
fntype
= TREE_TYPE (fntype
); /* Convert the parameters to the types declared in the
function prototype, or apply default promotions. */
coerced_params
= actualparameterlist (TYPE_ARG_TYPES (fntype
), params
, name
); /* Recognize certain built-in functions so we can make tree-codes
other than CALL_EXPR. We do this when it enables fold-const.c
to do something useful. */
if (TREE_CODE (function
) == ADDR_EXPR
&& TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
switch (DECL_FUNCTION_CODE (TREE_OPERAND (function
, 0)))
return integer_zero_node
;
return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
value_type
= TREE_TYPE (fntype
) ? TREE_TYPE (fntype
) : void_type_node
; build (CALL_EXPR
, value_type
, function
, coerced_params
, NULL_TREE
);
TREE_VOLATILE (result
) = 1;
if (value_type
== void_type_node
)
return require_complete_type (result
);
/* Convert the actual parameter expressions in the list VALUES
to the types in the list TYPELIST.
If parmdecls is exhausted, or when an element has NULL as its type,
perform the default conversions.
NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
This is also where warnings about wrong number of args are generated.
Return a list of expressions for the parameters as converted.
Both VALUES and the returned value are chains of TREE_LIST nodes
with the elements of the list in the TREE_VALUE slots of those nodes. */
actualparameterlist (typelist
, values
, name
)
tree typelist
, values
, name
; register tree typetail
, valtail
;
register tree result
= NULL
;
for (valtail
= values
, typetail
= typelist
;
++ordinal
, valtail
= TREE_CHAIN (valtail
))
register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
register tree val
= TREE_VALUE (valtail
);
if (type
== void_type_node
)
error ("too many arguments to function `%s'",
IDENTIFIER_POINTER (name
));
error ("too many arguments to function");
/* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
if (TREE_CODE (val
) == NOP_EXPR
&& TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
val
= TREE_OPERAND (val
, 0); if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
|| TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
)
val
= default_conversion (val
); val
= require_complete_type (val
); /* Formal parm type is specified by a function prototype. */
if (TYPE_SIZE (type
) == 0)
error ("parameter type of called function is incomplete");
#ifdef PROMOTE_PROTOTYPES
/* Rather than truncating and then reextending,
convert directly to int, if that's the type we will want. */
&& TREE_CODE (type
) == INTEGER_TYPE
&& (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
type
= integer_type_node
; parmval
= convert_for_assignment (type
, val
, "argument passing",#ifdef PROMOTE_PROTOTYPES
if (TREE_CODE (type
) == INTEGER_TYPE
&& (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
parmval
= default_conversion (parmval
); parm
= build_tree_list (0, parmval
); else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
&& (TYPE_PRECISION (TREE_TYPE (val
))
< TYPE_PRECISION (double_type_node
)))
/* Convert `float' to `double'. */
parm
= build_tree_list (NULL_TREE
, convert (double_type_node
, val
)); /* Convert `short' and `char' to full-size `int'. */
parm
= build_tree_list (NULL_TREE
, default_conversion (val
)); result
= chainon (result
, parm
); typetail
= TREE_CHAIN (typetail
); if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
error ("too few arguments to function `%s'",
IDENTIFIER_POINTER (name
));
error ("too few arguments to function");
/* Build a binary-operation expression, after performing default
conversions on the operands. CODE is the kind of expression to build. */
build_binary_op (code
, arg1
, arg2
)
return build_binary_op_nodefault (code
, default_conversion (arg1
),
default_conversion (arg2
), code
);
/* Build a binary-operation expression without default conversions.
CODE is the kind of expression to build.
This function differs from `build' in several ways:
the data type of the result is computed and recorded in it,
warnings are generated if arg data types are invalid,
special handling for addition and subtraction of pointers is known,
and some optimization is done (operations on narrow ints
are done in the narrower type when that gives the same result).
Constant folding is also done before the result is returned.
ERROR_CODE is the code that determines what to say in error messages.
It is usually, but not always, the same as CODE.
Note that the operands will never have enumeral types
because either they have just had the default conversions performed
or they have both just been converted to some other type in which
the arithmetic is to be done. */
build_binary_op_nodefault (code
, op0
, op1
, error_code
)
enum tree_code error_code
;
tree dt0
= datatype (op0
), dt1
= datatype (op1
); /* The expression codes of the data types of the arguments tell us
whether the arguments are integers, floating, pointers, etc. */
register enum tree_code code0
= TREE_CODE (dt0
);
register enum tree_code code1
= TREE_CODE (dt1
);
/* Expression code to give to the expression when it is built.
Normally this is CODE, which is what the caller asked for,
but in some special cases we change it. */
register enum tree_code resultcode
= code
;
/* Data type in which the computation is to be performed.
In the simplest cases this is the common type of the arguments. */
register tree result_type
= NULL
;
/* Nonzero means operands have already been type-converted
in whatever way is necessary.
Zero means they need to be converted to RESULT_TYPE. */
/* Nonzero means after finally constructing the expression
give it this type. Otherwise, give it type RESULT_TYPE. */
/* Nonzero if this is an operation like MIN or MAX which can
safely be computed in short if both args are promoted shorts.
-1 indicates a bitwise operation; this makes a difference
in the exact conditions for when it is safe to do the operation
/* Nonzero if this is a comparison operation;
if both args are promoted shorts, compare the original shorts.
/* Nonzero if this is a right-shift operation, which can be computed on the
original short and then promoted if the operand is a promoted short. */
/* Nonzero means set RESULT_TYPE to the common type of the args. */
/* If an error was already reported for one of the arguments,
avoid reporting another error. */
if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
/* Handle the pointer + int case. */
if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
/* Subtraction of two similar pointers.
We must subtract them as integers, then divide by object size. */
if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
&& comp_target_types (dt0
, dt1
))
return pointer_diff (op0
, op1
);
/* Handle pointer minus int. Just like pointer plus int. */
else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
/* If one operand is a constant, and the other is a short type
that has been converted to an int,
really do the work in the short type and then convert the
result to int. If we are lucky, the constant will be 0 or 1
in the short type, making the entire operation go away. */
if (TREE_CODE (op0
) == INTEGER_CST
&& TREE_CODE (op1
) == NOP_EXPR
&& TYPE_PRECISION (dt1
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))
&& TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
final_type
= result_type
; op1
= TREE_OPERAND (op1
, 0); result_type
= TREE_TYPE (op1
); if (TREE_CODE (op1
) == INTEGER_CST
&& TREE_CODE (op0
) == NOP_EXPR
&& TYPE_PRECISION (dt0
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))
&& TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
final_type
= result_type
; op0
= TREE_OPERAND (op0
, 0); result_type
= TREE_TYPE (op0
); if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
|| code1
== REAL_TYPE
))
/* Result of these operations is always an int,
but that does not mean the operands should be
result_type
= integer_type_node
; op0
= truthvalue_conversion (op0
); op1
= truthvalue_conversion (op1
); /* Shift operations: result has same type as first operand;
always convert second operand to int.
Also set SHORT_SHIFT if shifting rightward. */
if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
if (TREE_CODE (op1
) == INTEGER_CST
&& TREE_INT_CST_LOW (op1
) > 0)
/* Convert the shift-count to an integer, regardless of
size of value being shifted. */
if (TREE_TYPE (op1
) != integer_type_node
)
op1
= convert (integer_type_node
, op1
); if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
if (TREE_CODE (op1
) == INTEGER_CST
&& TREE_INT_CST_LOW (op1
) < 0)
/* Convert the shift-count to an integer, regardless of
size of value being shifted. */
if (TREE_TYPE (op1
) != integer_type_node
)
op1
= convert (integer_type_node
, op1
); if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
/* Convert the shift-count to an integer, regardless of
size of value being shifted. */
if (TREE_TYPE (op1
) != integer_type_node
)
op1
= convert (integer_type_node
, op1
); /* Result of comparison is always int,
but don't convert the args to int! */
result_type
= integer_type_node
; if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
register tree tt0
= TREE_TYPE (dt0
);
register tree tt1
= TREE_TYPE (dt1
);
/* Anything compares with void *. void * compares with anything.
Otherwise, the targets must be the same. */
if (comp_target_types (dt0
, dt1
))
else if (TYPE_MAIN_VARIANT (tt0
) == void_type_node
)
if (pedantic
&& TREE_CODE (tt1
) == FUNCTION_TYPE
)
warning ("ANSI C forbids comparison of `void *' with function pointer");
else if (TYPE_MAIN_VARIANT (tt1
) == void_type_node
)
if (pedantic
&& TREE_CODE (tt0
) == FUNCTION_TYPE
)
warning ("ANSI C forbids comparison of `void *' with function pointer");
warning ("comparison of distinct pointer types lacks a cast");
else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
warning ("comparison between pointer and integer");
op1
= convert (TREE_TYPE (op0
), op1
); else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
warning ("comparison between pointer and integer");
op0
= convert (TREE_TYPE (op1
), op0
); /* If args are not valid, clear out RESULT_TYPE
to cause an error message later. */
if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
if (! comp_target_types (dt0
, dt1
))
warning ("comparison of distinct pointer types lacks a cast");
&& TREE_CODE (TREE_TYPE (dt0
)) == FUNCTION_TYPE
)
warning ("ANSI C forbids ordered comparisons of pointers to functions");
result_type
= commontype (dt0
, dt1
); if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
if (! comp_target_types (dt0
, dt1
))
warning ("comparison of distinct pointer types lacks a cast");
&& TREE_CODE (TREE_TYPE (dt0
)) == FUNCTION_TYPE
)
warning ("ANSI C forbids ordered comparisons of pointers to functions");
result_type
= integer_type_node
; else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
result_type
= integer_type_node
; warning ("ordered comparison of pointer with integer zero");
else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
result_type
= integer_type_node
; warning ("ordered comparison of pointer with integer zero");
else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
result_type
= integer_type_node
; warning ("comparison between pointer and integer");
op1
= convert (TREE_TYPE (op0
), op1
); else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
result_type
= integer_type_node
; warning ("comparison between pointer and integer");
op0
= convert (TREE_TYPE (op1
), op0
); if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
&& (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
if (shorten
|| common
|| short_compare
)
result_type
= commontype (dt0
, dt1
); /* For certain operations (which identify themselves by shorten != 0)
if both args were extended from the same smaller type,
do the arithmetic in that type and then extend.
shorten !=0 and !=1 indicates a bitwise operation.
For them, this optimization is safe only if
both args are zero-extended or both are sign-extended.
Otherwise, we might change the result.
Eg, (short)-1 | (unsigned short)-1 is (int)-1
but calculated in (unsigned short) it would be (unsigned short)-1. */
int unsigned0
, unsigned1
;
tree arg0
= get_narrower (op0
, &unsigned0
); tree arg1
= get_narrower (op1
, &unsigned1
); /* UNS is 1 if the operation to be done is an unsigned one. */
int uns
= TREE_UNSIGNED (result_type
);
final_type
= result_type
; /* Handle the case that OP0 does not *contain* a conversion
but it *requires* conversion to FINAL_TYPE. */
if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
)); if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
)); /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
/* For bitwise operations, signedness of nominal type
does not matter. Consider only how operands were extended. */
/* Note that in all three cases below we refrain from optimizing
an unsigned operation on sign-extended args.
That would not be valid. */
/* Both args variable: if both extended in same way
from same width, do it in that width.
Do it unsigned if args were zero-extended. */
if ((TYPE_PRECISION (TREE_TYPE (arg0
))
< TYPE_PRECISION (result_type
))
&& (TYPE_PRECISION (TREE_TYPE (arg1
))
== TYPE_PRECISION (TREE_TYPE (arg0
)))
&& unsigned0
== unsigned1
= signed_or_unsigned_type (unsigned0
,
commontype (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
else if (TREE_CODE (arg0
) == INTEGER_CST
&& (TYPE_PRECISION (TREE_TYPE (arg1
))
< TYPE_PRECISION (result_type
))
&& (type
= signed_or_unsigned_type (unsigned1
,
int_fits_type_p (arg0
, type
)))
else if (TREE_CODE (arg1
) == INTEGER_CST
&& (TYPE_PRECISION (TREE_TYPE (arg0
))
< TYPE_PRECISION (result_type
))
&& (type
= signed_or_unsigned_type (unsigned0
,
int_fits_type_p (arg1
, type
)))
/* Shifts can be shortened if shifting right. */
tree arg0
= get_narrower (op0
, &unsigned_arg
); final_type
= result_type
; if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
)); if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
/* If arg is sign-extended and then unsigned-shifted,
we can simulate this with a signed shift in arg's type
only if the extended result is at least twice as wide
as the arg. Otherwise, the shift could use up all the
ones made by sign-extension and bring in zeros.
We can't optimize that case at all, but in most machines
it never happens because available widths are 2**N. */
&& (!TREE_UNSIGNED (final_type
)
|| 2 * TYPE_PRECISION (TREE_TYPE (arg0
)) <= TYPE_PRECISION (result_type
)))
/* Do an unsigned shift if the operand was zero-extended. */
= signed_or_unsigned_type (unsigned_arg
,
/* Convert value-to-be-shifted to that type. */
if (TREE_TYPE (op0
) != result_type
)
op0
= convert (result_type
, op0
); /* Comparison operations are shortened too but differently.
They identify themselves by setting short_compare = 1. */
/* Don't write &op0, etc., because that would prevent op0
from being kept in a register.
Instead, make copies of the our local variables and
pass the copies by reference, then copy them back afterward. */
tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
; enum tree_code xresultcode
= resultcode
;
= shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
op0
= xop0
, op1
= xop1
, result_type
= xresult_type
; resultcode
= xresultcode
; /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
Then the expression will be built.
It will be given type FINAL_TYPE if that is nonzero;
otherwise, it will be given type RESULT_TYPE. */
binary_op_error (error_code
);
if (TREE_TYPE (op0
) != result_type
)
op0
= convert (result_type
, op0
); if (TREE_TYPE (op1
) != result_type
)
op1
= convert (result_type
, op1
); register tree result
= build (resultcode
, result_type
, op0
, op1
);
TREE_LITERAL (folded
) = TREE_LITERAL (op0
) & TREE_LITERAL (op1
);
return convert (final_type
, folded
);
/* Return a tree for the sum or difference (RESULTCODE says which)
of pointer PTROP and integer INTOP. */
pointer_int_sum (resultcode
, ptrop
, intop
)
enum tree_code resultcode
;
register tree ptrop
, intop
;
/* The result is a pointer of the same type that is being added. */
register tree result_type
= datatype (ptrop
);
if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
if (pedantic
|| warn_pointer_arith
)
warning ("pointer of type `void *' used in arithmetic");
size_exp
= integer_one_node
; else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
if (pedantic
|| warn_pointer_arith
)
warning ("pointer to a function used in arithmetic");
size_exp
= integer_one_node
; size_exp
= c_sizeof (TREE_TYPE (result_type
)); /* If what we are about to multiply by the size of the elements
contains a constant term, apply distributive law
and multiply that constant term separately.
This helps produce common subexpressions. */
if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
&& ! TREE_LITERAL (intop
)
&& TREE_LITERAL (TREE_OPERAND (intop
, 1))
&& TREE_LITERAL (size_exp
))
enum tree_code subcode
= resultcode
;
if (TREE_CODE (intop
) == MINUS_EXPR
)
subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
); ptrop
= build_binary_op (subcode
, ptrop
, TREE_OPERAND (intop
, 1)); intop
= TREE_OPERAND (intop
, 0); /* Convert the integer argument to a type the same size as a pointer
so the multiply won't overflow spuriously. */
if (TYPE_PRECISION (TREE_TYPE (intop
)) != POINTER_SIZE
)
intop
= convert (type_for_size (POINTER_SIZE
, 0), intop
); /* Replace the integer argument
with a suitable product by the object size. */
intop
= build_binary_op (MULT_EXPR
, intop
, size_exp
); /* Create the sum or difference. */
result
= build (resultcode
, result_type
, ptrop
, intop
); TREE_LITERAL (folded
) = TREE_LITERAL (ptrop
) & TREE_LITERAL (intop
);
/* Return a tree for the difference of pointers OP0 and OP1.
The resulting tree has type int. */
tree dt0
= datatype (op0
); enum tree_code resultcode
;
register tree result
, folded
;
tree restype
= type_for_size (POINTER_SIZE
, 0); if (TREE_CODE (TREE_TYPE (dt0
)) == VOID_TYPE
)
warning ("pointer of type `void *' used in subtraction");
if (TREE_CODE (TREE_TYPE (dt0
)) == FUNCTION_TYPE
)
warning ("pointer to a function used in subtraction");
/* First do the subtraction as integers;
then drop through to build the divide operator. */
op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
), convert (restype
, op1
));
op1
= c_sizeof_nowarn (TREE_TYPE (dt0
)); /* Create the sum or difference. */
result
= build (EXACT_DIV_EXPR
, restype
, op0
, op1
); TREE_LITERAL (folded
) = TREE_LITERAL (op0
) & TREE_LITERAL (op1
);
/* Print an error message for invalid operands to arith operation CODE.
NOP_EXPR is used as a special case (see truthvalue_conversion). */
error ("invalid truth-value expression");
error ("invalid operands to binary %s", opname
);
/* Subroutine of build_binary_op_nodefault, used for comparison operations.
See if the operands have both been converted from subword integer types
and, if so, perhaps change them both back to their original type.
The arguments of this function are all pointers to local variables
of build_binary_op_nodefault: OP0_PTR is &OP0, OP1_PTR is &OP1,
RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
If this function returns nonzero, it means that the comparison has
a constant value. What this function returns is an expression for
shorten_compare (op0_ptr
, op1_ptr
, restype_ptr
, rescode_ptr
)
enum tree_code
*rescode_ptr
;
int unsignedp0
, unsignedp1
;
enum tree_code code
= *rescode_ptr
;
/* Throw away any conversions to wider types
already present in the operands. */
primop0
= get_narrower (op0
, &unsignedp0
); primop1
= get_narrower (op1
, &unsignedp1
); /* Handle the case that OP0 does not *contain* a conversion
but it *requires* conversion to FINAL_TYPE. */
if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
unsignedp0
= TREE_UNSIGNED (TREE_TYPE (op0
)); if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
unsignedp1
= TREE_UNSIGNED (TREE_TYPE (op1
)); /* If one of the operands must be floated, we cannot optimize. */
real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
; real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
; /* If first arg is constant, swap the args (changing operation
so value is preserved), for canonicalization. */
if (TREE_LITERAL (primop0
))
register tree tem
= primop0
;
register int temi
= unsignedp0
;
/* If comparing an integer against a constant more bits wide,
maybe we can deduce a value of 1 or 0 independent of the data.
Or else truncate the constant now
rather than extend the variable at run time.
This is only interesting if the constant is the wider arg.
Also, it is not safe if the constant is unsigned and the
variable arg is signed, since in this case the variable
would be sign-extended and then regarded as unsigned.
Our technique fails in this case because the lowest/highest
possible unsigned results don't follow naturally from the
lowest/highest possible values of the variable operand.
For just EQ_EXPR and NE_EXPR there is another technique that
could be used: see if the constant can be faithfully represented
in the other operand's type, by truncating it and reextending it
and see if that preserves the constant's value. */
&& TREE_CODE (primop1
) == INTEGER_CST
&& TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
int min_gt
, max_gt
, min_lt
, max_lt
;
/* 1 if comparison is nominally unsigned. */
int unsignedp
= TREE_UNSIGNED (*restype_ptr
);
type
= signed_or_unsigned_type (unsignedp0
, TREE_TYPE (primop0
)); maxval
= TYPE_MAX_VALUE (type
); minval
= TYPE_MIN_VALUE (type
); if (unsignedp
&& !unsignedp0
)
*restype_ptr
= signed_type (*restype_ptr
);
if (TREE_TYPE (primop1
) != *restype_ptr
)
primop1
= convert (*restype_ptr
, primop1
); if (type
!= *restype_ptr
)
minval
= convert (*restype_ptr
, minval
); maxval
= convert (*restype_ptr
, maxval
); if (unsignedp
&& unsignedp0
)
min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
); max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
); min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
); max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
); min_gt
= INT_CST_LT (primop1
, minval
); max_gt
= INT_CST_LT (primop1
, maxval
); min_lt
= INT_CST_LT (minval
, primop1
); max_lt
= INT_CST_LT (maxval
, primop1
); /* This used to be a switch, but Genix compiler can't handle that. */
else if (code
== EQ_EXPR
)
else if (code
== LT_EXPR
)
else if (code
== GT_EXPR
)
else if (code
== LE_EXPR
)
else if (code
== GE_EXPR
)
/* If primop0 was sign-extended and unsigned comparison specd,
we did a signed comparison above using the signed type bounds.
But the comparison we output must be unsigned.
Also, for inequalities, VAL is no good; but if the signed
comparison had *any* fixed result, it follows that the
unsigned comparison just tests the sign in reverse
(positive values are LE, negative ones GE).
So we can generate an unsigned comparison
against an extreme value of the signed type. */
if (unsignedp
&& !unsignedp0
)
primop1
= TYPE_MIN_VALUE (type
); primop1
= TYPE_MAX_VALUE (type
); type
= unsigned_type (type
); if (max_lt
&& !unsignedp0
)
/* This is the case of (char)x >?< 0x80, which people used to use
expecting old C compilers to change the 0x80 into -0x80. */
if (val
== integer_zero_node
)
warning ("comparison is always 0 due to limited range of data type");
if (val
== integer_one_node
)
warning ("comparison is always 1 due to limited range of data type");
/* Don't forget to evaluate PRIMOP0 if it has side effects. */
if (TREE_VOLATILE (primop0
))
return build (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
/* Value is not predetermined, but do the comparison
in the type of the operand that is not constant.
TYPE is already properly set. */
&& TYPE_PRECISION (TREE_TYPE (primop0
)) == TYPE_PRECISION (TREE_TYPE (primop1
)))
type
= TREE_TYPE (primop0
); /* If args' natural types are both narrower than nominal type
and both extend in the same manner, compare them
in the type of the wider arg.
Otherwise must actually extend both to the nominal
common type lest different ways of extending
(eg, (short)-1 == (unsigned short)-1 should be 0.) */
else if (unsignedp0
== unsignedp1
&& real1
== real2
&& TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
&& TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
type
= commontype (TREE_TYPE (primop0
), TREE_TYPE (primop1
)); type
= signed_or_unsigned_type (unsignedp0
|| TREE_UNSIGNED (*restype_ptr
),
/* Make sure shorter operand is extended the right way
to match the longer operand. */
primop0
= convert (signed_or_unsigned_type (unsignedp0
, TREE_TYPE (primop0
)), primop1
= convert (signed_or_unsigned_type (unsignedp1
, TREE_TYPE (primop1
)), /* Here we must do the comparison on the nominal type
using the args exactly as we received them. */
*op0_ptr
= convert (type
, primop0
);
*op1_ptr
= convert (type
, primop1
);
*restype_ptr
= integer_type_node
;
/* Construct and perhaps optimize a tree representation
for a unary operation. CODE, a tree_code, specifies the operation
and XARG is the operand. NOCONVERT nonzero suppresses
the default promotions (such as from short to int). */
build_unary_op (code
, xarg
, noconvert
)
/* No default_conversion here. It causes trouble for ADDR_EXPR. */
register tree arg
= xarg
;
register tree argtype
= 0;
register enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
if (typecode
== ERROR_MARK
)
if (typecode
== ENUMERAL_TYPE
)
/* This is used for unary plus, because a CONVERT_EXPR
is enough to prevent anybody from looking inside for
associativity, but won't generate any code. */
if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
errstring
= "wrong type argument to unary plus"; arg
= default_conversion (arg
); if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
errstring
= "wrong type argument to unary minus"; arg
= default_conversion (arg
); if (typecode
!= INTEGER_TYPE
)
errstring
= "wrong type argument to bit-complement"; arg
= default_conversion (arg
); if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
errstring
= "wrong type argument to abs"; arg
= default_conversion (arg
); if (typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
/* This will convert to a pointer. */
&& typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
errstring
= "wrong type argument to unary exclamation mark"; arg
= truthvalue_conversion (arg
); val
= invert_truthvalue (arg
); /* Handle complex lvalues (when permitted)
by reduction to simpler cases. */
val
= unary_complex_lvalue (code
, arg
); /* Report invalid types. */
if (typecode
!= POINTER_TYPE
&& typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
errstring
="wrong type argument to increment"; errstring
="wrong type argument to decrement"; /* Report something read-only. */
((code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
? "increment" : "decrement"));
tree result_type
= TREE_TYPE (arg
); arg
= get_unwidened (arg
, 0); argtype
= TREE_TYPE (arg
); /* Compute the increment. */
if (typecode
== POINTER_TYPE
)
&& (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
|| TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
warning ("wrong type argument to %s",
((code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
? "increment" : "decrement"));
inc
= c_sizeof_nowarn (TREE_TYPE (result_type
)); inc
= convert (argtype
, inc
); /* Handle incrementing a cast-expression. */
tree incremented
, modify
, value
; arg
= stabilize_reference (arg
); if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
incremented
= build (((code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
? PLUS_EXPR
: MINUS_EXPR
),
TREE_VOLATILE (incremented
) = 1;
modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
); return build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
/* Complain about anything else that is not a true lvalue. */
if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
? "increment" : "decrement")))
val
= build (code
, TREE_TYPE (arg
), arg
, inc
); return convert (result_type
, val
);
/* Note that this operation never does default_conversion
regardless of NOCONVERT. */
/* Let &* cancel out to simplify resulting code. */
if (TREE_CODE (arg
) == INDIRECT_REF
)
/* Don't let this be an lvalue. */
if (lvalue_p (TREE_OPERAND (arg
, 0)))
return build (NOP_EXPR
, TREE_TYPE (TREE_OPERAND (arg
, 0)),
return TREE_OPERAND (arg
, 0);
/* For &x[y], return x+y */
if (TREE_CODE (arg
) == ARRAY_REF
)
if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
/* Handle complex lvalues (when permitted)
by reduction to simpler cases. */
val
= unary_complex_lvalue (code
, arg
); /* Address of a cast is just a cast of the address
of the operand of the cast. */
warning ("ANSI C forbids the address of a cast expression");
return convert (build_pointer_type (TREE_TYPE (arg
)),
build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0),
/* Allow the address of a constructor if all the elements
if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_LITERAL (arg
))
/* Anything not already handled and not a true memory reference
else if (typecode
!= FUNCTION_TYPE
&& !lvalue_or_else (arg
, "unary `&'"))
/* Ordinary case; arg is a COMPONENT_REF or a decl. */
argtype
= TREE_TYPE (arg
); if (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
))
argtype
= c_build_type_variant (argtype
, TREE_THIS_VOLATILE (arg
));
argtype
= build_pointer_type (argtype
); if (mark_addressable (arg
) == 0)
if (TREE_CODE (arg
) == COMPONENT_REF
)
tree field
= TREE_OPERAND (arg
, 1); addr
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0); error ("attempt to take address of bit-field structure member `%s'",
IDENTIFIER_POINTER (DECL_NAME (field
)));
addr
= convert (argtype
, addr
); if (DECL_OFFSET (field
) != 0)
tree offset
= build_int_2 ((DECL_OFFSET (field
) TREE_TYPE (offset
) = argtype
;
addr
= fold (build (PLUS_EXPR
, argtype
, addr
, offset
)); addr
= build (code
, argtype
, arg
); /* Address of a static or external variable or
function counts as a constant */
TREE_LITERAL (addr
) = staticp (arg
);
argtype
= TREE_TYPE (arg
); return fold (build (code
, argtype
, arg
));
/* If CONVERSIONS is a conversion expression or a nested sequence of such,
convert ARG with the same conversions in the same order
and return the result. */
convert_sequence (conversions
, arg
)
switch (TREE_CODE (conversions
))
return convert (TREE_TYPE (conversions
),
convert_sequence (TREE_OPERAND (conversions
, 0),
/* Apply unary lvalue-demanding operator CODE to the expression ARG
for certain kinds of expressions which are not really lvalues
but which we can accept as lvalues.
If ARG is not a kind of expression we can handle, return zero. */
unary_complex_lvalue (code
, arg
)
/* Handle (a, b) used as an "lvalue". */
if (TREE_CODE (arg
) == COMPOUND_EXPR
)
tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0); return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
TREE_OPERAND (arg
, 0), real_result
);
/* Handle (a ? b : c) used as an "lvalue". */
if (TREE_CODE (arg
) == COND_EXPR
)
return (build_conditional_expr
build_unary_op (code
, TREE_OPERAND (arg
, 1), 0),
build_unary_op (code
, TREE_OPERAND (arg
, 2), 0)));
/* Warn about storing in something that is `const'. */
readonly_warning (arg
, string
)
if (TREE_CODE (arg
) == COMPONENT_REF
)
if (TREE_READONLY (TREE_OPERAND (arg
, 0)))
readonly_warning (TREE_OPERAND (arg
, 0), string
);
strcat (buf
, " of read-only member `%s'");
warning (buf
, IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg
, 1))));
else if (TREE_CODE (arg
) == VAR_DECL
)
strcat (buf
, " of read-only variable `%s'");
warning (buf
, IDENTIFIER_POINTER (DECL_NAME (arg
)));
warning ("%s of read-only location", buf
);
/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
or validate its data type for an `if' or `while' statement or ?..: exp.
This preparation consists of taking the ordinary
representation of an expression expr and producing a valid tree
boolean expression describing whether expr is nonzero. We could
simply always do build_binary_op (NE_EXPR, expr, integer_zero_node),
but we optimize comparisons, &&, ||, and ! */
truthvalue_conversion (expr
)
register enum tree_code form
;
/* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since EXPR is being used in non-lvalue context. */
if (TREE_CODE (expr
) == NOP_EXPR
&& TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
expr
= TREE_OPERAND (expr
, 0); if (form
== EQ_EXPR
&& integer_zerop (TREE_OPERAND (expr
, 1)))
return build_unary_op (TRUTH_NOT_EXPR
, TREE_OPERAND (expr
, 0), 0);
/* A one-bit unsigned bit-field is already acceptable. */
if (form
== COMPONENT_REF
&& 1 == TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (expr
, 1)))
&& 1 == DECL_SIZE_UNIT (TREE_OPERAND (expr
, 1))
&& TREE_UNSIGNED (TREE_OPERAND (expr
, 1)))
if (form
== TRUTH_ANDIF_EXPR
|| form
== TRUTH_ORIF_EXPR
|| form
== TRUTH_AND_EXPR
|| form
== TRUTH_OR_EXPR
|| form
== TRUTH_NOT_EXPR
|| form
== EQ_EXPR
|| form
== NE_EXPR
|| form
== LE_EXPR
|| form
== GE_EXPR
|| form
== LT_EXPR
|| form
== GT_EXPR
/* Unary minus has no effect on whether its argument is nonzero. */
return truthvalue_conversion (TREE_OPERAND (expr
, 0));
/* Distribute the conversion into the arms of a COND_EXPR. */
return build (COND_EXPR
, integer_type_node
,
truthvalue_conversion (TREE_OPERAND (expr
, 1)),
truthvalue_conversion (TREE_OPERAND (expr
, 2)));
/* Sign-extension and zero-extension has no effect. */
&& TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
&& (TYPE_PRECISION (TREE_TYPE (expr
))
> TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
return truthvalue_conversion (TREE_OPERAND (expr
, 0));
return build_binary_op_nodefault (NE_EXPR
, default_conversion (expr
),
integer_zero_node
, NOP_EXPR
);/* Return a simplified tree node for the truth-negation of ARG
(perhaps by altering ARG).
If it can't be simplified, return 0. */
TREE_SET_CODE (arg
, EQ_EXPR
);
TREE_SET_CODE (arg
, NE_EXPR
);
TREE_SET_CODE (arg
, LT_EXPR
);
TREE_SET_CODE (arg
, LE_EXPR
);
TREE_SET_CODE (arg
, GT_EXPR
);
TREE_SET_CODE (arg
, GE_EXPR
);
return build (TRUTH_OR_EXPR
, TREE_TYPE (arg
),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 0), 0),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 1), 0));
return build (TRUTH_AND_EXPR
, TREE_TYPE (arg
),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 0), 0),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 1), 0));
return build (TRUTH_ORIF_EXPR
, TREE_TYPE (arg
),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 0), 0),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 1), 0));
return build (TRUTH_ANDIF_EXPR
, TREE_TYPE (arg
),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 0), 0),
build_unary_op (TRUTH_NOT_EXPR
,
TREE_OPERAND (arg
, 1), 0));
return TREE_OPERAND (arg
, 0);
return build (COND_EXPR
, TREE_TYPE (arg
), TREE_OPERAND (arg
, 0),
build_unary_op (TRUTH_NOT_EXPR
, TREE_OPERAND (arg
, 1), 0),
build_unary_op (TRUTH_NOT_EXPR
, TREE_OPERAND (arg
, 2), 0));
/* Mark EXP saying that we need to be able to take the
address of it; it should not be allocated in a register.
Value is 1 if successful. */
if (TREE_REGDECL (x
) && !TREE_ADDRESSABLE (x
))
error ("address of global register variable `%s' requested",
IDENTIFIER_POINTER (DECL_NAME (x
)));
warning ("address of register variable `%s' requested",
IDENTIFIER_POINTER (DECL_NAME (x
)));
TREE_ADDRESSABLE (x
) = 1;
TREE_ADDRESSABLE (DECL_NAME (x
)) = 1;
/* Build and return a conditional expression IFEXP ? OP1 : OP2. */
build_conditional_expr (ifexp
, op1
, op2
)
register enum tree_code code1
;
register enum tree_code code2
;
register tree result_type
= NULL
;
/* If second operand is omitted, it is the same as the first one;
make sure it is calculated only once. */
warning ("ANSI C forbids omitting the middle term of a ?: expression");
ifexp
= op1
= save_expr (ifexp
); ifexp
= truthvalue_conversion (default_conversion (ifexp
)); if (TREE_CODE (ifexp
) == ERROR_MARK
|| TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
|| TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
#if 0 /* Produces wrong result if within sizeof. */
/* Don't promote the operands separately if they promote
the same way. Return the unpromoted type and let the combined
value get promoted if necessary. */
if (TREE_TYPE (op1
) == TREE_TYPE (op2
)
&& TREE_CODE (TREE_TYPE (op1
)) != ARRAY_TYPE
&& TREE_CODE (TREE_TYPE (op1
)) != ENUMERAL_TYPE
&& TREE_CODE (TREE_TYPE (op1
)) != FUNCTION_TYPE
)
&& (TREE_CODE (ifexp
) == INTEGER_CST
|| TREE_CODE (ifexp
) == ADDR_EXPR
))
return (integer_zerop (ifexp
) ? op2
: op1
);
return build (COND_EXPR
, TREE_TYPE (op1
), ifexp
, op1
, op2
);
/* They don't match; promote them both and then try to reconcile them. */
if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
op1
= default_conversion (op1
); if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
op2
= default_conversion (op2
); code1
= TREE_CODE (type1
); code2
= TREE_CODE (type2
); /* Quickly detect the usual case where op1 and op2 have the same type
else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
)
&& (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
))
result_type
= commontype (type1
, type2
); else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
warning ("ANSI C forbids conditional expr with only one void side");
result_type
= void_type_node
; else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
if (comp_target_types (type1
, type2
))
result_type
= commontype (type1
, type2
); else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
)
result_type
= qualify_type (type2
, type1
); else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
)
result_type
= qualify_type (type1
, type2
); else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1
)) == void_type_node
)
if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
warning ("ANSI C forbids conditional expr between `void *' and function pointer");
result_type
= qualify_type (type1
, type2
); else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2
)) == void_type_node
)
if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
warning ("ANSI C forbids conditional expr between `void *' and function pointer");
result_type
= qualify_type (type2
, type1
); warning ("pointer type mismatch in conditional expression");
result_type
= build_pointer_type (void_type_node
); else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
if (!integer_zerop (op2
))
warning ("pointer/integer type mismatch in conditional expression");
#if 0 /* The spec seems to say this is permitted. */
if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
warning ("ANSI C forbids conditional expr between 0 and function pointer");
else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
if (!integer_zerop (op1
))
warning ("pointer/integer type mismatch in conditional expression");
#if 0 /* The spec seems to say this is permitted. */
if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
warning ("ANSI C forbids conditional expr between 0 and function pointer");
result_type
= void_type_node
; error ("type mismatch in conditional expression");
if (result_type
!= TREE_TYPE (op1
))
op1
= convert (result_type
, op1
); if (result_type
!= TREE_TYPE (op2
))
op2
= convert (result_type
, op2
); if (code1
== RECORD_TYPE
|| code1
== UNION_TYPE
)
result_type
= TREE_TYPE (op1
); if (TREE_LITERAL (ifexp
))
return (integer_zerop (ifexp
) ? op2
: op1
);
if (TYPE_MODE (result_type
) == BLKmode
)
= build_decl (VAR_DECL
, NULL_TREE
, result_type
);
register tree xop1
= build_modify_expr (tempvar
, op1
);
register tree xop2
= build_modify_expr (tempvar
, op2
);
register tree result
= build (COND_EXPR
, result_type
,
/* No way to handle variable-sized objects here.
I fear that the entire handling of BLKmode conditional exprs
if (! TREE_LITERAL (DECL_SIZE (tempvar
)))
= assign_stack_local (DECL_MODE (tempvar
),
(TREE_INT_CST_LOW (DECL_SIZE (tempvar
))
* DECL_SIZE_UNIT (tempvar
)
= TREE_VOLATILE (ifexp
) | TREE_VOLATILE (op1
)
return build (COMPOUND_EXPR
, result_type
, result
, tempvar
);
if (TREE_CODE (ifexp
) == INTEGER_CST
)
return (integer_zerop (ifexp
) ? op2
: op1
);
return build (COND_EXPR
, result_type
, ifexp
, op1
, op2
);
/* Given a list of expressions, return a compound expression
that performs them all and returns the value of the last of them. */
build_compound_expr (list
)
if (TREE_CHAIN (list
) == 0)
/* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
if (TREE_CODE (list
) == NOP_EXPR
&& TREE_TYPE (list
) == TREE_TYPE (TREE_OPERAND (list
, 0)))
list
= TREE_OPERAND (list
, 0); return TREE_VALUE (list
);
rest
= build_compound_expr (TREE_CHAIN (list
)); /* This is patched out so that sizeof (0, array) is distinguishable from
if (! TREE_VOLATILE (TREE_VALUE (list
)))
return build (COMPOUND_EXPR
, TREE_TYPE (rest
), TREE_VALUE (list
), rest
);
/* Build an expression representing a cast to type TYPE of expression EXPR. */
build_c_cast (type
, expr
)
register tree value
= expr
;
if (type
== error_mark_node
|| expr
== error_mark_node
)
type
= TYPE_MAIN_VARIANT (type
); /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since VALUE is being used in non-lvalue context. */
if (TREE_CODE (value
) == NOP_EXPR
&& TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
value
= TREE_OPERAND (value
, 0); if (TREE_CODE (type
) == ARRAY_TYPE
)
error ("cast specifies array type");
if (type
== TREE_TYPE (value
))
if (TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
)
warning ("ANSI C forbids casting nonscalar to the same type");
/* Convert functions and arrays to pointers,
but don't convert any other types. */
if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
|| TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
)
value
= default_conversion (value
); otype
= TREE_TYPE (value
); /* Optionally warn about potentially worrysome casts. */
&& TREE_CODE (type
) == POINTER_TYPE
&& TREE_CODE (otype
) == POINTER_TYPE
)
if (TREE_VOLATILE (TREE_TYPE (otype
))
&& ! TREE_VOLATILE (TREE_TYPE (type
)))
warning ("cast discards `volatile' from pointer target type");
if (TREE_READONLY (TREE_TYPE (otype
))
&& ! TREE_READONLY (TREE_TYPE (type
)))
warning ("cast discards `const' from pointer target type");
value
= convert (type
, value
); /* Always produce some operator for an explicit cast,
so we can tell (for -pedantic) that the cast is no lvalue. */
tree nvalue
= build (NOP_EXPR
, type
, value
); TREE_LITERAL (nvalue
) = TREE_LITERAL (value
);
/* Build an assignment expression of lvalue LHS from value RHS.
MODIFYCODE is the code for a binary operator that we use
to combine the old value of LHS with RHS to get the new value.
Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
build_modify_expr (lhs
, modifycode
, rhs
)
enum tree_code modifycode
;
tree lhstype
= TREE_TYPE (lhs
); /* Types that aren't fully specified cannot be used in assignments. */
lhs
= require_complete_type (lhs
); /* Avoid duplicate error messages from operands that had errors. */
if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
/* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since RHS is being used in non-lvalue context. */
if (TREE_CODE (rhs
) == NOP_EXPR
&& TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0)))
rhs
= TREE_OPERAND (rhs
, 0); /* Handle control structure constructs used as "lvalues". */
/* Handle (a, b) used as an "lvalue". */
return build (COMPOUND_EXPR
, lhstype
,
build_modify_expr (TREE_OPERAND (lhs
, 1),
/* Handle (a ? b : c) used as an "lvalue". */
/* Produce (a ? (b = rhs) : (c = rhs))
except that the RHS goes through a save-expr
so the code to compute it is only emitted once. */
build_modify_expr (TREE_OPERAND (lhs
, 1),
build_modify_expr (TREE_OPERAND (lhs
, 2),
/* Make sure the code to compute the rhs comes out
return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
/* Cast to void to suppress warning
from warn_if_unused_value. */
convert (void_type_node
, rhs
),
/* If a binary op has been requested, combine the old LHS value with the RHS
producing the value we should actually store into the LHS. */
if (modifycode
!= NOP_EXPR
)
lhs
= stabilize_reference (lhs
); newrhs
= build_binary_op (modifycode
, lhs
, rhs
); /* Handle a cast used as an "lvalue".
We have already performed any binary operator using the value as cast.
Now convert the result to the true type of the lhs and store there;
then cast the result back to the specified type to be the value
if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
|| TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
)
newrhs
= default_conversion (newrhs
); tree inner_lhs
= TREE_OPERAND (lhs
, 0); tree result
= build_modify_expr (inner_lhs
, NOP_EXPR
, convert (TREE_TYPE (inner_lhs
),
return convert (TREE_TYPE (lhs
), result
);
/* Now we have handled acceptable kinds of LHS that are not truly lvalues.
Reject anything strange now. */
if (!lvalue_or_else (lhs
, "assignment"))
/* Warn about storing in something that is `const'. */
|| ((TREE_CODE (lhstype
) == RECORD_TYPE
|| TREE_CODE (lhstype
) == UNION_TYPE
)
&& C_TYPE_FIELDS_READONLY (lhstype
)))
readonly_warning (lhs
, "assignment");
/* If storing into a structure or union member,
it has probably been given type `int'.
Compute the type that would go with
the actual amount of storage the member occupies. */
if (TREE_CODE (lhs
) == COMPONENT_REF
&& (TREE_CODE (lhstype
) == INTEGER_TYPE
|| TREE_CODE (lhstype
) == REAL_TYPE
|| TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
lhstype
= TREE_TYPE (get_unwidened (lhs
, 0)); /* If storing in a field that is in actuality a short or narrower than one,
we must store in the field in its actual type. */
if (lhstype
!= TREE_TYPE (lhs
))
TREE_TYPE (lhs
) = lhstype
;
/* Convert new value to destination type. */
newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment", 0); if (TREE_CODE (newrhs
) == ERROR_MARK
)
result
= build (MODIFY_EXPR
, lhstype
, lhs
, newrhs
); TREE_VOLATILE (result
) = 1;
/* If we got the LHS in a different type for storing in,
convert the result back to the nominal type of LHS
so that the value we return always has the same type
if (olhstype
== TREE_TYPE (result
))
return convert_for_assignment (olhstype
, result
, "assignment", 0);
/* Return 0 if EXP is not a valid lvalue in this language
even though `lvalue_or_else' would accept it. */
language_lvalue_valid (exp
)
/* Convert value RHS to type TYPE as preparation for an assignment
to an lvalue of type TYPE.
The real work of conversion is done by `convert'.
The purpose of this function is to generate error messages
for assignments that are not allowed in C.
ERRTYPE is a string to use in error messages:
"assignment", "return", etc.
If NUM is positive, ERRTYPE is a printf format
that contains a %d to print NUM. */
convert_for_assignment (type
, rhs
, errtype
, num
)
register enum tree_code codel
= TREE_CODE (type
);
register enum tree_code coder
;
/* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
if (TREE_CODE (rhs
) == NOP_EXPR
&& TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0)))
rhs
= TREE_OPERAND (rhs
, 0); if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
|| TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
rhs
= default_conversion (rhs
); rhstype
= TREE_TYPE (rhs
); coder
= TREE_CODE (rhstype
); if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
error ("void value not ignored as it ought to be");
/* Arithmetic types all interconvert, and enum is treated like int. */
if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
|| codel
== ENUMERAL_TYPE
)
(coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
|| coder
== ENUMERAL_TYPE
))
return convert (type
, rhs
);
/* Conversions among pointers */
else if (codel
== POINTER_TYPE
&& coder
== POINTER_TYPE
)
register tree ttl
= TREE_TYPE (type
);
register tree ttr
= TREE_TYPE (rhstype
);
/* Any non-function converts to a [const][volatile] void *
and vice versa; otherwise, targets must be the same.
Meanwhile, the lhs target must have all the qualifiers of the rhs. */
if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
|| TYPE_MAIN_VARIANT (ttr
) == void_type_node
|| comp_target_types (type
, rhstype
))
&& ((TYPE_MAIN_VARIANT (ttl
) == void_type_node
&& TREE_CODE (ttr
) == FUNCTION_TYPE
)
(TYPE_MAIN_VARIANT (ttr
) == void_type_node
&& TREE_CODE (ttl
) == FUNCTION_TYPE
)))
warning_with_arg ("%s between incompatible pointer types", errtype
, num
);
if (! TREE_READONLY (ttl
) && TREE_READONLY (ttr
))
warning_with_arg ("%s of non-const * pointer from const *", errtype
, num
);
if (! TREE_VOLATILE (ttl
) && TREE_VOLATILE (ttr
))
warning_with_arg ("%s of non-volatile * pointer from volatile *", errtype
, num
);
warning_with_arg ("%s between incompatible pointer types", errtype
, num
);
return convert (type
, rhs
);
else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
if (! integer_zerop (rhs
))
warning_with_arg ("%s of pointer from integer lacks a cast", errtype
, num
);
return convert (type
, rhs
);
return null_pointer_node
;
else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
warning_with_arg ("%s of integer from pointer lacks a cast", errtype
, num
);
return convert (type
, rhs
);
error_with_arg ("incompatible types in %s", errtype
, num
);
/* Return nonzero if VALUE is a valid constant-valued expression
for use in initializing a static variable; one that can be an
element of a "constant" initializer.
Return 1 if the value is absolute; return 2 if it is relocatable.
We assume that VALUE has been folded as much as possible;
therefore, we do not need to check for such things as
arithmetic-combinations of integers. */
initializer_constant_valid_p (value
)
switch (TREE_CODE (value
))
return TREE_STATIC (value
);
/* Allow conversions between types of the same kind. */
if (TREE_CODE (TREE_TYPE (value
))
== TREE_CODE (TREE_TYPE (TREE_OPERAND (value
, 0))))
return initializer_constant_valid_p (TREE_OPERAND (value
, 0));
if (TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (value
, 0))) == POINTER_TYPE
)
return initializer_constant_valid_p (TREE_OPERAND (value
, 0));
int valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0));
int valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1));
if (valid0
== 1 && valid1
== 2)
if (valid0
== 2 && valid1
== 1)
int valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0));
int valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1));
if (valid0
== 2 && valid1
== 1)
/* Perform appropriate conversions on the initial value of a variable,
store it in the declaration DECL,
and print any error messages that are appropriate.
If the init is invalid, store an ERROR_MARK. */
store_init_value (decl
, init
)
register tree value
, type
;
/* If variable's type was invalidly declared, just ignore it. */
if (TREE_CODE (type
) == ERROR_MARK
)
/* Digest the specified initializer into an expression. */
value
= digest_init (type
, init
, 0); /* Store the expression if valid; else report error. */
if (value
== error_mark_node
)
else if (TREE_STATIC (decl
) && ! TREE_LITERAL (value
))
error ("initializer for static variable is not constant");
else if (TREE_STATIC (decl
)
&& ! initializer_constant_valid_p (value
))
error ("initializer for static variable uses complicated arithmetic");
if (pedantic
&& TREE_CODE (value
) == CONSTRUCTOR
)
if (! TREE_LITERAL (value
))
warning ("aggregate initializer is not constant");
else if (! TREE_STATIC (value
))
warning ("aggregate initializer uses complicated arithmetic");
DECL_INITIAL (decl
) = value
;
/* Digest the parser output INIT as an initializer for type TYPE.
Return a C expression of type TYPE to represent the initial value.
If TAIL is nonzero, it points to a variable holding a list of elements
of which INIT is the first. We update the list stored there by
removing from the head all the elements that we use.
Normally this is only one; we use more than one element only if
TYPE is an aggregate and INIT is not a constructor. */
digest_init (type
, init
, tail
)
enum tree_code code
= TREE_CODE (type
);
/* Nonzero if INIT is a braced grouping, which comes in as a CONSTRUCTOR
tree node which has no TREE_TYPE. */
= TREE_CODE (init
) == CONSTRUCTOR
&& TREE_TYPE (init
) == 0;
/* By default, assume we use one element from a list.
We correct this later in the sole case where it is not true. */
old_tail_contents
= *tail
; *tail
= TREE_CHAIN (*tail
);
if (init
== error_mark_node
)
if (init
&& raw_constructor
&& CONSTRUCTOR_ELTS (init
) != 0
&& TREE_CHAIN (CONSTRUCTOR_ELTS (init
)) == 0)
element
= TREE_VALUE (CONSTRUCTOR_ELTS (init
)); /* Any type can be initialized from an expression of the same type,
optionally with braces. */
if (init
&& (TREE_TYPE (init
) == type
|| (code
== ARRAY_TYPE
&& TREE_TYPE (init
)
&& comptypes (TREE_TYPE (init
), type
))))
if (pedantic
&& code
== ARRAY_TYPE
&& TREE_CODE (init
) != STRING_CST
)
warning ("ANSI C forbids initializing array from array expression");
if (optimize
&& TREE_READONLY (init
) && TREE_CODE (init
) == VAR_DECL
)
return decl_constant_value (init
);
if (element
&& (TREE_TYPE (element
) == type
|| (code
== ARRAY_TYPE
&& TREE_TYPE (element
)
&& comptypes (TREE_TYPE (element
), type
))))
if (pedantic
&& code
== ARRAY_TYPE
)
warning ("ANSI C forbids initializing array from array expression");
if (pedantic
&& (code
== RECORD_TYPE
|| code
== UNION_TYPE
))
warning ("single-expression nonscalar initializer has braces");
if (optimize
&& TREE_READONLY (element
) && TREE_CODE (element
) == VAR_DECL
)
return decl_constant_value (element
);
/* Check for initializing a union by its first field.
Such an initializer must use braces. */
if (TYPE_FIELDS (type
) == 0)
error ("union with no members cannot be initialized");
return process_init_constructor (type
, init
, 0);
*tail
= old_tail_contents
;
return process_init_constructor (type
, 0, tail
);
/* Initialization of an array of chars from a string constant
optionally enclosed in braces. */
tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
)); if ((typ1
== char_type_node
|| typ1
== signed_char_type_node
|| typ1
== unsigned_char_type_node
|| typ1
== unsigned_type_node
|| typ1
== integer_type_node
)
&& ((init
&& TREE_CODE (init
) == STRING_CST
)
|| (element
&& TREE_CODE (element
) == STRING_CST
)))
tree string
= element
? element
: init
; if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (string
)))
&& TYPE_PRECISION (typ1
) == TYPE_PRECISION (char_type_node
))
error ("char-array initialized from wide string");
if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (string
)))
&& TYPE_PRECISION (typ1
) == TYPE_PRECISION (integer_type_node
))
error ("int-array initialized from non-wide string");
TREE_TYPE (string
) = type
;
if (TYPE_DOMAIN (type
) != 0
&& TREE_LITERAL (TYPE_SIZE (type
)))
= TREE_INT_CST_LOW (TYPE_SIZE (type
)) * TYPE_SIZE_UNIT (type
);
size
= (size
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
; /* Subtract 1 because it's ok to ignore the terminating null char
that is counted in the length of the constant. */
if (size
< TREE_STRING_LENGTH (string
) - 1)
warning ("initializer-string for array of chars is too long");
/* Handle scalar types, including conversions. */
if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
|| code
== ENUMERAL_TYPE
)
error ("initializer for scalar variable requires one element");
if (TREE_CODE (init
) == CONSTRUCTOR
)
error ("initializer for scalar has extra braces");
return convert_for_assignment (type
, default_conversion (init
),
/* Come here only for records and arrays. */
if (TYPE_SIZE (type
) && ! TREE_LITERAL (TYPE_SIZE (type
)))
error ("variable-sized object may not be initialized");
if (code
== ARRAY_TYPE
|| code
== RECORD_TYPE
)
return process_init_constructor (type
, init
, 0);
*tail
= old_tail_contents
;
return process_init_constructor (type
, 0, tail
);
else if (flag_traditional
)
/* Traditionally one can say `char x[100] = 0;'. */
return process_init_constructor (type
,
build_nt (CONSTRUCTOR
, 0,
error ("invalid initializer");
/* Process a constructor for a variable of type TYPE.
The constructor elements may be specified either with INIT or with ELTS,
only one of which should be non-null.
If INIT is specified, it is a CONSTRUCTOR node which is specifically
and solely for initializing this datum.
If ELTS is specified, it is the address of a variable containing
a list of expressions. We take as many elements as we need
from the head of the list and update the list.
In the resulting constructor, TREE_LITERAL is set if all elts are
constant, and TREE_STATIC is set if, in addition, all elts are simple enough
constants that the assembler and linker can compute them. */
process_init_constructor (type
, init
, elts
)
/* List of the elements of the result constructor,
register tree members
= NULL
;
/* Make TAIL be the list of elements to use for the initialization,
no matter how the data was given to us. */
tail
= CONSTRUCTOR_ELTS (init
); /* Gobble as many elements as needed, and make a constructor or initial value
for each element of this aggregate. Chain them together in result.
If there are too few, use 0 for each scalar ultimate component. */
if (TREE_CODE (type
) == ARRAY_TYPE
)
tree domain
= TYPE_DOMAIN (type
); len
= TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain
)) - TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain
))
len
= -1; /* Take as many as there are */ for (i
= 0; (len
< 0 || i
< len
) && tail
!= 0; i
++)
if (TREE_VALUE (tail
) != 0)
next1
= digest_init (TYPE_MAIN_VARIANT (TREE_TYPE (type
)), TREE_VALUE (tail
), &tail1
);
if (tail1
!= 0 && TREE_CODE (tail1
) != TREE_LIST
)
if (tail
== tail1
&& len
< 0)
error ("non-empty initializer for array of empty elements");
/* Just ignore what we were supposed to use. */
tail
= TREE_CHAIN (tail
); if (next1
== error_mark_node
)
else if (!TREE_LITERAL (next1
))
else if (! initializer_constant_valid_p (next1
))
members
= tree_cons (NULL_TREE
, next1
, members
); if (TREE_CODE (type
) == RECORD_TYPE
)
for (field
= TYPE_FIELDS (type
); field
&& tail
;
field
= TREE_CHAIN (field
)) members
= tree_cons (field
, integer_zero_node
, members
); if (TREE_VALUE (tail
) != 0)
next1
= digest_init (TREE_TYPE (field
), TREE_VALUE (tail
), &tail1
);
if (tail1
!= 0 && TREE_CODE (tail1
) != TREE_LIST
)
tail
= TREE_CHAIN (tail
); if (next1
== error_mark_node
)
else if (!TREE_LITERAL (next1
))
else if (! initializer_constant_valid_p (next1
))
members
= tree_cons (field
, next1
, members
); if (TREE_CODE (type
) == UNION_TYPE
)
register tree field
= TYPE_FIELDS (type
);
/* For a union, get the initializer for 1 fld. */
if (TREE_VALUE (tail
) != 0)
next1
= digest_init (TREE_TYPE (field
), TREE_VALUE (tail
), &tail1
);
if (tail1
!= 0 && TREE_CODE (tail1
) != TREE_LIST
)
tail
= TREE_CHAIN (tail
); if (next1
== error_mark_node
)
else if (!TREE_LITERAL (next1
))
else if (! initializer_constant_valid_p (next1
))
members
= tree_cons (field
, next1
, members
); /* If arguments were specified as a list, just remove the ones we used. */
/* If arguments were specified as a constructor,
complain unless we used all the elements of the constructor. */
warning ("excess elements in aggregate initializer");
result
= build (CONSTRUCTOR
, type
, NULL_TREE
, nreverse (members
)); if (allconstant
) TREE_LITERAL (result
) = 1;
if (allconstant
&& allsimple
) TREE_STATIC (result
) = 1;
/* Expand an ASM statement with operands, handling output operands
that are not variables or INDIRECT_REFS by transforming such
cases into cases that expand_asm_operands can handle.
Arguments are same as for expand_asm_operands. */
c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
tree string
, outputs
, inputs
, clobbers
; int noutputs
= list_length (outputs
);
/* o[I] is the place that output number I should be written. */
register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
/* Record the contents of OUTPUTS before it is modifed. */
for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
o
[i
] = TREE_VALUE (tail
);#if 0 /* Don't do this--it screws up operands expected to be in memory. */
/* Perform default conversions on all inputs. */
for (i
= 0, tail
= inputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
TREE_VALUE (tail
) = default_conversion (TREE_VALUE (tail
));
/* Generate the ASM_OPERANDS insn;
store into the TREE_VALUEs of OUTPUTS some trees for
where the values were actually stored. */
expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
/* Copy all the intermediate outputs into the specified outputs. */
for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
if (o
[i
] != TREE_VALUE (tail
))
expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
/* Detect modification of read-only values.
(Otherwise done by build_modify_expr.) */
tree type
= TREE_TYPE (o
[i
]); || ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
)
&& C_TYPE_FIELDS_READONLY (type
)))
readonly_warning (o
[i
], "modification by `asm'");
/* Those MODIFY_EXPRs could do autoincrements. */
/* Expand a C `return' statement.
RETVAL is the expression for what to return,
or a null pointer for `return;' with no value. */
tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
)); if (TREE_THIS_VOLATILE (current_function_decl
))
warning ("function declared `volatile' has a `return' statement");
current_function_returns_null
= 1; if (warn_return_type
&& valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
warning ("`return' with no value, in function returning non-void");
else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
current_function_returns_null
= 1; if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
warning ("`return' with a value, in function returning void");
tree t
= convert_for_assignment (valtype
, retval
, "return", 0); tree res
= DECL_RESULT (current_function_decl
); t
= build (MODIFY_EXPR
, TREE_TYPE (res
), res
, convert (TREE_TYPE (res
), t
)); current_function_returns_value
= 1;/* Start a C switch statement, testing expression EXP.
Return EXP if it is valid, an error node otherwise. */
c_expand_start_case (exp
)
register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
tree type
= TREE_TYPE (exp
); if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
error ("switch quantity not an integer");
exp
= default_conversion (exp
); index
= get_unwidened (exp
, 0); /* We can't strip a conversion from a signed type to an unsigned,
because if we did, int_fits_type_p would do the wrong thing
when checking case values for being in range,
and it's too hard to do the right thing. */
if (TREE_UNSIGNED (TREE_TYPE (exp
))
== TREE_UNSIGNED (TREE_TYPE (index
)))
expand_start_case (1, exp
, type
);
projects / unix-history / blob