1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization.
28 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
29 and to process initializations in declarations (since they work
30 like a strange sort of assignment). */
46 /* Nonzero if we've already printed a "missing braces around initializer"
47 message within this initializer. */
48 static int missing_braces_mentioned;
50 /* 1 if we explained undeclared var errors. */
51 static int undeclared_variable_notice;
53 static tree qualify_type PARAMS ((tree, tree));
54 static int comp_target_types PARAMS ((tree, tree));
55 static int function_types_compatible_p PARAMS ((tree, tree));
56 static int type_lists_compatible_p PARAMS ((tree, tree));
57 static tree decl_constant_value_for_broken_optimization PARAMS ((tree));
58 static tree default_function_array_conversion PARAMS ((tree));
59 static tree lookup_field PARAMS ((tree, tree));
60 static tree convert_arguments PARAMS ((tree, tree, tree, tree));
61 static tree pointer_int_sum PARAMS ((enum tree_code, tree, tree));
62 static tree pointer_diff PARAMS ((tree, tree));
63 static tree unary_complex_lvalue PARAMS ((enum tree_code, tree, int));
64 static void pedantic_lvalue_warning PARAMS ((enum tree_code));
65 static tree internal_build_compound_expr PARAMS ((tree, int));
66 static tree convert_for_assignment PARAMS ((tree, tree, const char *,
68 static void warn_for_assignment PARAMS ((const char *, const char *,
70 static tree valid_compound_expr_initializer PARAMS ((tree, tree));
71 static void push_string PARAMS ((const char *));
72 static void push_member_name PARAMS ((tree));
73 static void push_array_bounds PARAMS ((int));
74 static int spelling_length PARAMS ((void));
75 static char *print_spelling PARAMS ((char *));
76 static void warning_init PARAMS ((const char *));
77 static tree digest_init PARAMS ((tree, tree, int, int));
78 static void output_init_element PARAMS ((tree, tree, tree, int));
79 static void output_pending_init_elements PARAMS ((int));
80 static int set_designator PARAMS ((int));
81 static void push_range_stack PARAMS ((tree));
82 static void add_pending_init PARAMS ((tree, tree));
83 static void set_nonincremental_init PARAMS ((void));
84 static void set_nonincremental_init_from_string PARAMS ((tree));
85 static tree find_init_member PARAMS ((tree));
87 /* Do `exp = require_complete_type (exp);' to make sure exp
88 does not have an incomplete type. (That includes void types.) */
91 require_complete_type (value)
94 tree type = TREE_TYPE (value);
96 if (value == error_mark_node || type == error_mark_node)
97 return error_mark_node;
99 /* First, detect a valid value with a complete type. */
100 if (COMPLETE_TYPE_P (type))
103 incomplete_type_error (value, type);
104 return error_mark_node;
107 /* Print an error message for invalid use of an incomplete type.
108 VALUE is the expression that was used (or 0 if that isn't known)
109 and TYPE is the type that was invalid. */
112 incomplete_type_error (value, type)
116 const char *type_code_string;
118 /* Avoid duplicate error message. */
119 if (TREE_CODE (type) == ERROR_MARK)
122 if (value != 0 && (TREE_CODE (value) == VAR_DECL
123 || TREE_CODE (value) == PARM_DECL))
124 error ("`%s' has an incomplete type",
125 IDENTIFIER_POINTER (DECL_NAME (value)));
129 /* We must print an error message. Be clever about what it says. */
131 switch (TREE_CODE (type))
134 type_code_string = "struct";
138 type_code_string = "union";
142 type_code_string = "enum";
146 error ("invalid use of void expression");
150 if (TYPE_DOMAIN (type))
152 type = TREE_TYPE (type);
155 error ("invalid use of array with unspecified bounds");
162 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
163 error ("invalid use of undefined type `%s %s'",
164 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
166 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
167 error ("invalid use of incomplete typedef `%s'",
168 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
172 /* Return a variant of TYPE which has all the type qualifiers of LIKE
173 as well as those of TYPE. */
176 qualify_type (type, like)
179 return c_build_qualified_type (type,
180 TYPE_QUALS (type) | TYPE_QUALS (like));
183 /* Return the common type of two types.
184 We assume that comptypes has already been done and returned 1;
185 if that isn't so, this may crash. In particular, we assume that qualifiers
188 This is the type for the result of most arithmetic operations
189 if the operands have the given two types. */
195 enum tree_code code1;
196 enum tree_code code2;
199 /* Save time if the two types are the same. */
201 if (t1 == t2) return t1;
203 /* If one type is nonsense, use the other. */
204 if (t1 == error_mark_node)
206 if (t2 == error_mark_node)
209 /* Merge the attributes. */
210 attributes = (*targetm.merge_type_attributes) (t1, t2);
212 /* Treat an enum type as the unsigned integer type of the same width. */
214 if (TREE_CODE (t1) == ENUMERAL_TYPE)
215 t1 = type_for_size (TYPE_PRECISION (t1), 1);
216 if (TREE_CODE (t2) == ENUMERAL_TYPE)
217 t2 = type_for_size (TYPE_PRECISION (t2), 1);
219 code1 = TREE_CODE (t1);
220 code2 = TREE_CODE (t2);
222 /* If one type is complex, form the common type of the non-complex
223 components, then make that complex. Use T1 or T2 if it is the
225 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
227 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
228 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
229 tree subtype = common_type (subtype1, subtype2);
231 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
232 return build_type_attribute_variant (t1, attributes);
233 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
234 return build_type_attribute_variant (t2, attributes);
236 return build_type_attribute_variant (build_complex_type (subtype),
244 /* If only one is real, use it as the result. */
246 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
247 return build_type_attribute_variant (t1, attributes);
249 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
250 return build_type_attribute_variant (t2, attributes);
252 /* Both real or both integers; use the one with greater precision. */
254 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
255 return build_type_attribute_variant (t1, attributes);
256 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
257 return build_type_attribute_variant (t2, attributes);
259 /* Same precision. Prefer longs to ints even when same size. */
261 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
262 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
263 return build_type_attribute_variant (long_unsigned_type_node,
266 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
267 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
269 /* But preserve unsignedness from the other type,
270 since long cannot hold all the values of an unsigned int. */
271 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
272 t1 = long_unsigned_type_node;
274 t1 = long_integer_type_node;
275 return build_type_attribute_variant (t1, attributes);
278 /* Likewise, prefer long double to double even if same size. */
279 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
280 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
281 return build_type_attribute_variant (long_double_type_node,
284 /* Otherwise prefer the unsigned one. */
286 if (TREE_UNSIGNED (t1))
287 return build_type_attribute_variant (t1, attributes);
289 return build_type_attribute_variant (t2, attributes);
292 /* For two pointers, do this recursively on the target type,
293 and combine the qualifiers of the two types' targets. */
294 /* This code was turned off; I don't know why.
295 But ANSI C specifies doing this with the qualifiers.
296 So I turned it on again. */
298 tree pointed_to_1 = TREE_TYPE (t1);
299 tree pointed_to_2 = TREE_TYPE (t2);
300 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
301 TYPE_MAIN_VARIANT (pointed_to_2));
302 t1 = build_pointer_type (c_build_qualified_type
304 TYPE_QUALS (pointed_to_1) |
305 TYPE_QUALS (pointed_to_2)));
306 return build_type_attribute_variant (t1, attributes);
309 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
310 return build_type_attribute_variant (t1, attributes);
315 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
316 /* Save space: see if the result is identical to one of the args. */
317 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
318 return build_type_attribute_variant (t1, attributes);
319 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
320 return build_type_attribute_variant (t2, attributes);
321 /* Merge the element types, and have a size if either arg has one. */
322 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
323 return build_type_attribute_variant (t1, attributes);
327 /* Function types: prefer the one that specified arg types.
328 If both do, merge the arg types. Also merge the return types. */
330 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
331 tree p1 = TYPE_ARG_TYPES (t1);
332 tree p2 = TYPE_ARG_TYPES (t2);
337 /* Save space: see if the result is identical to one of the args. */
338 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
339 return build_type_attribute_variant (t1, attributes);
340 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
341 return build_type_attribute_variant (t2, attributes);
343 /* Simple way if one arg fails to specify argument types. */
344 if (TYPE_ARG_TYPES (t1) == 0)
346 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
347 return build_type_attribute_variant (t1, attributes);
349 if (TYPE_ARG_TYPES (t2) == 0)
351 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
352 return build_type_attribute_variant (t1, attributes);
355 /* If both args specify argument types, we must merge the two
356 lists, argument by argument. */
359 declare_parm_level (1);
361 len = list_length (p1);
364 for (i = 0; i < len; i++)
365 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
370 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
372 /* A null type means arg type is not specified.
373 Take whatever the other function type has. */
374 if (TREE_VALUE (p1) == 0)
376 TREE_VALUE (n) = TREE_VALUE (p2);
379 if (TREE_VALUE (p2) == 0)
381 TREE_VALUE (n) = TREE_VALUE (p1);
385 /* Given wait (union {union wait *u; int *i} *)
386 and wait (union wait *),
387 prefer union wait * as type of parm. */
388 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
389 && TREE_VALUE (p1) != TREE_VALUE (p2))
392 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
393 memb; memb = TREE_CHAIN (memb))
394 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
396 TREE_VALUE (n) = TREE_VALUE (p2);
398 pedwarn ("function types not truly compatible in ISO C");
402 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
403 && TREE_VALUE (p2) != TREE_VALUE (p1))
406 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
407 memb; memb = TREE_CHAIN (memb))
408 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
410 TREE_VALUE (n) = TREE_VALUE (p1);
412 pedwarn ("function types not truly compatible in ISO C");
416 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
422 t1 = build_function_type (valtype, newargs);
423 /* ... falls through ... */
427 return build_type_attribute_variant (t1, attributes);
432 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
433 or various other operations. Return 2 if they are compatible
434 but a warning may be needed if you use them together. */
437 comptypes (type1, type2)
444 /* Suppress errors caused by previously reported errors. */
446 if (t1 == t2 || !t1 || !t2
447 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
450 /* If either type is the internal version of sizetype, return the
452 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
453 && TYPE_DOMAIN (t1) != 0)
454 t1 = TYPE_DOMAIN (t1);
456 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
457 && TYPE_DOMAIN (t2) != 0)
458 t2 = TYPE_DOMAIN (t2);
460 /* Treat an enum type as the integer type of the same width and
463 if (TREE_CODE (t1) == ENUMERAL_TYPE)
464 t1 = type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
465 if (TREE_CODE (t2) == ENUMERAL_TYPE)
466 t2 = type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
471 /* Different classes of types can't be compatible. */
473 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
475 /* Qualifiers must match. */
477 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
480 /* Allow for two different type nodes which have essentially the same
481 definition. Note that we already checked for equality of the type
482 qualifiers (just above). */
484 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
487 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
488 if (! (attrval = (*targetm.comp_type_attributes) (t1, t2)))
491 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
494 switch (TREE_CODE (t1))
497 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
498 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
502 val = function_types_compatible_p (t1, t2);
507 tree d1 = TYPE_DOMAIN (t1);
508 tree d2 = TYPE_DOMAIN (t2);
509 bool d1_variable, d2_variable;
510 bool d1_zero, d2_zero;
513 /* Target types must match incl. qualifiers. */
514 if (TREE_TYPE (t1) != TREE_TYPE (t2)
515 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
518 /* Sizes must match unless one is missing or variable. */
519 if (d1 == 0 || d2 == 0 || d1 == d2)
522 d1_zero = ! TYPE_MAX_VALUE (d1);
523 d2_zero = ! TYPE_MAX_VALUE (d2);
525 d1_variable = (! d1_zero
526 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
527 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
528 d2_variable = (! d2_zero
529 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
530 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
532 if (d1_variable || d2_variable)
534 if (d1_zero && d2_zero)
536 if (d1_zero || d2_zero
537 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
538 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
545 if (maybe_objc_comptypes (t1, t2, 0) == 1)
552 return attrval == 2 && val == 1 ? 2 : val;
555 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
556 ignoring their qualifiers. */
559 comp_target_types (ttl, ttr)
564 /* Give maybe_objc_comptypes a crack at letting these types through. */
565 if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0)
568 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
569 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
571 if (val == 2 && pedantic)
572 pedwarn ("types are not quite compatible");
576 /* Subroutines of `comptypes'. */
578 /* Return 1 if two function types F1 and F2 are compatible.
579 If either type specifies no argument types,
580 the other must specify a fixed number of self-promoting arg types.
581 Otherwise, if one type specifies only the number of arguments,
582 the other must specify that number of self-promoting arg types.
583 Otherwise, the argument types must match. */
586 function_types_compatible_p (f1, f2)
590 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
594 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
595 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
598 args1 = TYPE_ARG_TYPES (f1);
599 args2 = TYPE_ARG_TYPES (f2);
601 /* An unspecified parmlist matches any specified parmlist
602 whose argument types don't need default promotions. */
606 if (!self_promoting_args_p (args2))
608 /* If one of these types comes from a non-prototype fn definition,
609 compare that with the other type's arglist.
610 If they don't match, ask for a warning (but no error). */
611 if (TYPE_ACTUAL_ARG_TYPES (f1)
612 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
618 if (!self_promoting_args_p (args1))
620 if (TYPE_ACTUAL_ARG_TYPES (f2)
621 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
626 /* Both types have argument lists: compare them and propagate results. */
627 val1 = type_lists_compatible_p (args1, args2);
628 return val1 != 1 ? val1 : val;
631 /* Check two lists of types for compatibility,
632 returning 0 for incompatible, 1 for compatible,
633 or 2 for compatible with warning. */
636 type_lists_compatible_p (args1, args2)
639 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
645 if (args1 == 0 && args2 == 0)
647 /* If one list is shorter than the other,
648 they fail to match. */
649 if (args1 == 0 || args2 == 0)
651 /* A null pointer instead of a type
652 means there is supposed to be an argument
653 but nothing is specified about what type it has.
654 So match anything that self-promotes. */
655 if (TREE_VALUE (args1) == 0)
657 if (simple_type_promotes_to (TREE_VALUE (args2)) != NULL_TREE)
660 else if (TREE_VALUE (args2) == 0)
662 if (simple_type_promotes_to (TREE_VALUE (args1)) != NULL_TREE)
665 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
666 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
668 /* Allow wait (union {union wait *u; int *i} *)
669 and wait (union wait *) to be compatible. */
670 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
671 && (TYPE_NAME (TREE_VALUE (args1)) == 0
672 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
673 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
674 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
675 TYPE_SIZE (TREE_VALUE (args2))))
678 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
679 memb; memb = TREE_CHAIN (memb))
680 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
685 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
686 && (TYPE_NAME (TREE_VALUE (args2)) == 0
687 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
688 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
689 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
690 TYPE_SIZE (TREE_VALUE (args1))))
693 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
694 memb; memb = TREE_CHAIN (memb))
695 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
704 /* comptypes said ok, but record if it said to warn. */
708 args1 = TREE_CHAIN (args1);
709 args2 = TREE_CHAIN (args2);
713 /* Compute the value of the `sizeof' operator. */
719 enum tree_code code = TREE_CODE (type);
722 if (code == FUNCTION_TYPE)
724 if (pedantic || warn_pointer_arith)
725 pedwarn ("sizeof applied to a function type");
726 size = size_one_node;
728 else if (code == VOID_TYPE)
730 if (pedantic || warn_pointer_arith)
731 pedwarn ("sizeof applied to a void type");
732 size = size_one_node;
734 else if (code == ERROR_MARK)
735 size = size_one_node;
736 else if (!COMPLETE_TYPE_P (type))
738 error ("sizeof applied to an incomplete type");
739 size = size_zero_node;
742 /* Convert in case a char is more than one unit. */
743 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
744 size_int (TYPE_PRECISION (char_type_node)
747 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
748 TYPE_IS_SIZETYPE means that certain things (like overflow) will
749 never happen. However, this node should really have type
750 `size_t', which is just a typedef for an ordinary integer type. */
751 return fold (build1 (NOP_EXPR, c_size_type_node, size));
755 c_sizeof_nowarn (type)
758 enum tree_code code = TREE_CODE (type);
761 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
762 size = size_one_node;
763 else if (!COMPLETE_TYPE_P (type))
764 size = size_zero_node;
766 /* Convert in case a char is more than one unit. */
767 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
768 size_int (TYPE_PRECISION (char_type_node)
771 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
772 TYPE_IS_SIZETYPE means that certain things (like overflow) will
773 never happen. However, this node should really have type
774 `size_t', which is just a typedef for an ordinary integer type. */
775 return fold (build1 (NOP_EXPR, c_size_type_node, size));
778 /* Compute the size to increment a pointer by. */
781 c_size_in_bytes (type)
784 enum tree_code code = TREE_CODE (type);
786 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
787 return size_one_node;
789 if (!COMPLETE_OR_VOID_TYPE_P (type))
791 error ("arithmetic on pointer to an incomplete type");
792 return size_one_node;
795 /* Convert in case a char is more than one unit. */
796 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
797 size_int (TYPE_PRECISION (char_type_node)
801 /* Return either DECL or its known constant value (if it has one). */
804 decl_constant_value (decl)
807 if (/* Don't change a variable array bound or initial value to a constant
808 in a place where a variable is invalid. */
809 current_function_decl != 0
810 && ! TREE_THIS_VOLATILE (decl)
811 && TREE_READONLY (decl)
812 && DECL_INITIAL (decl) != 0
813 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
814 /* This is invalid if initial value is not constant.
815 If it has either a function call, a memory reference,
816 or a variable, then re-evaluating it could give different results. */
817 && TREE_CONSTANT (DECL_INITIAL (decl))
818 /* Check for cases where this is sub-optimal, even though valid. */
819 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
820 return DECL_INITIAL (decl);
824 /* Return either DECL or its known constant value (if it has one), but
825 return DECL if pedantic or DECL has mode BLKmode. This is for
826 bug-compatibility with the old behavior of decl_constant_value
827 (before GCC 3.0); every use of this function is a bug and it should
828 be removed before GCC 3.1. It is not appropriate to use pedantic
829 in a way that affects optimization, and BLKmode is probably not the
830 right test for avoiding misoptimizations either. */
833 decl_constant_value_for_broken_optimization (decl)
836 if (pedantic || DECL_MODE (decl) == BLKmode)
839 return decl_constant_value (decl);
843 /* Perform the default conversion of arrays and functions to pointers.
844 Return the result of converting EXP. For any other expression, just
848 default_function_array_conversion (exp)
852 tree type = TREE_TYPE (exp);
853 enum tree_code code = TREE_CODE (type);
856 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
859 Do not use STRIP_NOPS here! It will remove conversions from pointer
860 to integer and cause infinite recursion. */
862 while (TREE_CODE (exp) == NON_LVALUE_EXPR
863 || (TREE_CODE (exp) == NOP_EXPR
864 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
866 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
868 exp = TREE_OPERAND (exp, 0);
871 /* Preserve the original expression code. */
872 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
873 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
875 if (code == FUNCTION_TYPE)
877 return build_unary_op (ADDR_EXPR, exp, 0);
879 if (code == ARRAY_TYPE)
882 tree restype = TREE_TYPE (type);
888 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
890 constp = TREE_READONLY (exp);
891 volatilep = TREE_THIS_VOLATILE (exp);
894 if (TYPE_QUALS (type) || constp || volatilep)
896 = c_build_qualified_type (restype,
898 | (constp * TYPE_QUAL_CONST)
899 | (volatilep * TYPE_QUAL_VOLATILE));
901 if (TREE_CODE (exp) == INDIRECT_REF)
902 return convert (TYPE_POINTER_TO (restype),
903 TREE_OPERAND (exp, 0));
905 if (TREE_CODE (exp) == COMPOUND_EXPR)
907 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
908 return build (COMPOUND_EXPR, TREE_TYPE (op1),
909 TREE_OPERAND (exp, 0), op1);
912 lvalue_array_p = !not_lvalue && lvalue_p (exp);
913 if (!flag_isoc99 && !lvalue_array_p)
915 /* Before C99, non-lvalue arrays do not decay to pointers.
916 Normally, using such an array would be invalid; but it can
917 be used correctly inside sizeof or as a statement expression.
918 Thus, do not give an error here; an error will result later. */
922 ptrtype = build_pointer_type (restype);
924 if (TREE_CODE (exp) == VAR_DECL)
926 /* ??? This is not really quite correct
927 in that the type of the operand of ADDR_EXPR
928 is not the target type of the type of the ADDR_EXPR itself.
929 Question is, can this lossage be avoided? */
930 adr = build1 (ADDR_EXPR, ptrtype, exp);
931 if (mark_addressable (exp) == 0)
932 return error_mark_node;
933 TREE_CONSTANT (adr) = staticp (exp);
934 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
937 /* This way is better for a COMPONENT_REF since it can
938 simplify the offset for a component. */
939 adr = build_unary_op (ADDR_EXPR, exp, 1);
940 return convert (ptrtype, adr);
945 /* Perform default promotions for C data used in expressions.
946 Arrays and functions are converted to pointers;
947 enumeral types or short or char, to int.
948 In addition, manifest constants symbols are replaced by their values. */
951 default_conversion (exp)
955 tree type = TREE_TYPE (exp);
956 enum tree_code code = TREE_CODE (type);
958 if (code == FUNCTION_TYPE || code == ARRAY_TYPE)
959 return default_function_array_conversion (exp);
961 /* Constants can be used directly unless they're not loadable. */
962 if (TREE_CODE (exp) == CONST_DECL)
963 exp = DECL_INITIAL (exp);
965 /* Replace a nonvolatile const static variable with its value unless
966 it is an array, in which case we must be sure that taking the
967 address of the array produces consistent results. */
968 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
970 exp = decl_constant_value_for_broken_optimization (exp);
971 type = TREE_TYPE (exp);
974 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
977 Do not use STRIP_NOPS here! It will remove conversions from pointer
978 to integer and cause infinite recursion. */
980 while (TREE_CODE (exp) == NON_LVALUE_EXPR
981 || (TREE_CODE (exp) == NOP_EXPR
982 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
983 exp = TREE_OPERAND (exp, 0);
985 /* Preserve the original expression code. */
986 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
987 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
989 /* Normally convert enums to int,
990 but convert wide enums to something wider. */
991 if (code == ENUMERAL_TYPE)
993 type = type_for_size (MAX (TYPE_PRECISION (type),
994 TYPE_PRECISION (integer_type_node)),
996 || (TYPE_PRECISION (type)
997 >= TYPE_PRECISION (integer_type_node)))
998 && TREE_UNSIGNED (type)));
1000 return convert (type, exp);
1003 if (TREE_CODE (exp) == COMPONENT_REF
1004 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1005 /* If it's thinner than an int, promote it like a
1006 c_promoting_integer_type_p, otherwise leave it alone. */
1007 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1008 TYPE_PRECISION (integer_type_node)))
1009 return convert (flag_traditional && TREE_UNSIGNED (type)
1010 ? unsigned_type_node : integer_type_node,
1013 if (c_promoting_integer_type_p (type))
1015 /* Traditionally, unsignedness is preserved in default promotions.
1016 Also preserve unsignedness if not really getting any wider. */
1017 if (TREE_UNSIGNED (type)
1018 && (flag_traditional
1019 || TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
1020 return convert (unsigned_type_node, exp);
1022 return convert (integer_type_node, exp);
1025 if (flag_traditional && !flag_allow_single_precision
1026 && TYPE_MAIN_VARIANT (type) == float_type_node)
1027 return convert (double_type_node, exp);
1029 if (code == VOID_TYPE)
1031 error ("void value not ignored as it ought to be");
1032 return error_mark_node;
1037 /* Look up COMPONENT in a structure or union DECL.
1039 If the component name is not found, returns NULL_TREE. Otherwise,
1040 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1041 stepping down the chain to the component, which is in the last
1042 TREE_VALUE of the list. Normally the list is of length one, but if
1043 the component is embedded within (nested) anonymous structures or
1044 unions, the list steps down the chain to the component. */
1047 lookup_field (decl, component)
1048 tree decl, component;
1050 tree type = TREE_TYPE (decl);
1053 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1054 to the field elements. Use a binary search on this array to quickly
1055 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1056 will always be set for structures which have many elements. */
1058 if (TYPE_LANG_SPECIFIC (type))
1061 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1063 field = TYPE_FIELDS (type);
1065 top = TYPE_LANG_SPECIFIC (type)->len;
1066 while (top - bot > 1)
1068 half = (top - bot + 1) >> 1;
1069 field = field_array[bot+half];
1071 if (DECL_NAME (field) == NULL_TREE)
1073 /* Step through all anon unions in linear fashion. */
1074 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1076 field = field_array[bot++];
1077 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1078 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1080 tree anon = lookup_field (field, component);
1083 return tree_cons (NULL_TREE, field, anon);
1087 /* Entire record is only anon unions. */
1091 /* Restart the binary search, with new lower bound. */
1095 if (DECL_NAME (field) == component)
1097 if (DECL_NAME (field) < component)
1103 if (DECL_NAME (field_array[bot]) == component)
1104 field = field_array[bot];
1105 else if (DECL_NAME (field) != component)
1110 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1112 if (DECL_NAME (field) == NULL_TREE
1113 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1114 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1116 tree anon = lookup_field (field, component);
1119 return tree_cons (NULL_TREE, field, anon);
1122 if (DECL_NAME (field) == component)
1126 if (field == NULL_TREE)
1130 return tree_cons (NULL_TREE, field, NULL_TREE);
1133 /* Make an expression to refer to the COMPONENT field of
1134 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1137 build_component_ref (datum, component)
1138 tree datum, component;
1140 tree type = TREE_TYPE (datum);
1141 enum tree_code code = TREE_CODE (type);
1145 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1146 If pedantic ensure that the arguments are not lvalues; otherwise,
1147 if the component is an array, it would wrongly decay to a pointer in
1149 We cannot do this with a COND_EXPR, because in a conditional expression
1150 the default promotions are applied to both sides, and this would yield
1151 the wrong type of the result; for example, if the components have
1153 switch (TREE_CODE (datum))
1157 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1158 return build (COMPOUND_EXPR, TREE_TYPE (value),
1159 TREE_OPERAND (datum, 0), pedantic_non_lvalue (value));
1165 /* See if there is a field or component with name COMPONENT. */
1167 if (code == RECORD_TYPE || code == UNION_TYPE)
1169 if (!COMPLETE_TYPE_P (type))
1171 incomplete_type_error (NULL_TREE, type);
1172 return error_mark_node;
1175 field = lookup_field (datum, component);
1179 error ("%s has no member named `%s'",
1180 code == RECORD_TYPE ? "structure" : "union",
1181 IDENTIFIER_POINTER (component));
1182 return error_mark_node;
1185 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1186 This might be better solved in future the way the C++ front
1187 end does it - by giving the anonymous entities each a
1188 separate name and type, and then have build_component_ref
1189 recursively call itself. We can't do that here. */
1190 for (; field; field = TREE_CHAIN (field))
1192 tree subdatum = TREE_VALUE (field);
1194 if (TREE_TYPE (subdatum) == error_mark_node)
1195 return error_mark_node;
1197 ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum);
1198 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1199 TREE_READONLY (ref) = 1;
1200 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1201 TREE_THIS_VOLATILE (ref) = 1;
1203 if (TREE_DEPRECATED (subdatum))
1204 warn_deprecated_use (subdatum);
1211 else if (code != ERROR_MARK)
1212 error ("request for member `%s' in something not a structure or union",
1213 IDENTIFIER_POINTER (component));
1215 return error_mark_node;
1218 /* Given an expression PTR for a pointer, return an expression
1219 for the value pointed to.
1220 ERRORSTRING is the name of the operator to appear in error messages. */
1223 build_indirect_ref (ptr, errorstring)
1225 const char *errorstring;
1227 tree pointer = default_conversion (ptr);
1228 tree type = TREE_TYPE (pointer);
1230 if (TREE_CODE (type) == POINTER_TYPE)
1232 if (TREE_CODE (pointer) == ADDR_EXPR
1234 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1235 == TREE_TYPE (type)))
1236 return TREE_OPERAND (pointer, 0);
1239 tree t = TREE_TYPE (type);
1240 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1242 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1244 error ("dereferencing pointer to incomplete type");
1245 return error_mark_node;
1247 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1248 warning ("dereferencing `void *' pointer");
1250 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1251 so that we get the proper error message if the result is used
1252 to assign to. Also, &* is supposed to be a no-op.
1253 And ANSI C seems to specify that the type of the result
1254 should be the const type. */
1255 /* A de-reference of a pointer to const is not a const. It is valid
1256 to change it via some other pointer. */
1257 TREE_READONLY (ref) = TYPE_READONLY (t);
1258 TREE_SIDE_EFFECTS (ref)
1259 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1260 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1264 else if (TREE_CODE (pointer) != ERROR_MARK)
1265 error ("invalid type argument of `%s'", errorstring);
1266 return error_mark_node;
1269 /* This handles expressions of the form "a[i]", which denotes
1272 This is logically equivalent in C to *(a+i), but we may do it differently.
1273 If A is a variable or a member, we generate a primitive ARRAY_REF.
1274 This avoids forcing the array out of registers, and can work on
1275 arrays that are not lvalues (for example, members of structures returned
1279 build_array_ref (array, index)
1284 error ("subscript missing in array reference");
1285 return error_mark_node;
1288 if (TREE_TYPE (array) == error_mark_node
1289 || TREE_TYPE (index) == error_mark_node)
1290 return error_mark_node;
1292 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1293 && TREE_CODE (array) != INDIRECT_REF)
1297 /* Subscripting with type char is likely to lose
1298 on a machine where chars are signed.
1299 So warn on any machine, but optionally.
1300 Don't warn for unsigned char since that type is safe.
1301 Don't warn for signed char because anyone who uses that
1302 must have done so deliberately. */
1303 if (warn_char_subscripts
1304 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1305 warning ("array subscript has type `char'");
1307 /* Apply default promotions *after* noticing character types. */
1308 index = default_conversion (index);
1310 /* Require integer *after* promotion, for sake of enums. */
1311 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1313 error ("array subscript is not an integer");
1314 return error_mark_node;
1317 /* An array that is indexed by a non-constant
1318 cannot be stored in a register; we must be able to do
1319 address arithmetic on its address.
1320 Likewise an array of elements of variable size. */
1321 if (TREE_CODE (index) != INTEGER_CST
1322 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1323 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1325 if (mark_addressable (array) == 0)
1326 return error_mark_node;
1328 /* An array that is indexed by a constant value which is not within
1329 the array bounds cannot be stored in a register either; because we
1330 would get a crash in store_bit_field/extract_bit_field when trying
1331 to access a non-existent part of the register. */
1332 if (TREE_CODE (index) == INTEGER_CST
1333 && TYPE_VALUES (TREE_TYPE (array))
1334 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1336 if (mark_addressable (array) == 0)
1337 return error_mark_node;
1343 while (TREE_CODE (foo) == COMPONENT_REF)
1344 foo = TREE_OPERAND (foo, 0);
1345 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1346 pedwarn ("ISO C forbids subscripting `register' array");
1347 else if (! flag_isoc99 && ! lvalue_p (foo))
1348 pedwarn ("ISO C89 forbids subscripting non-lvalue array");
1351 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1352 rval = build (ARRAY_REF, type, array, index);
1353 /* Array ref is const/volatile if the array elements are
1354 or if the array is. */
1355 TREE_READONLY (rval)
1356 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1357 | TREE_READONLY (array));
1358 TREE_SIDE_EFFECTS (rval)
1359 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1360 | TREE_SIDE_EFFECTS (array));
1361 TREE_THIS_VOLATILE (rval)
1362 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1363 /* This was added by rms on 16 Nov 91.
1364 It fixes vol struct foo *a; a->elts[1]
1365 in an inline function.
1366 Hope it doesn't break something else. */
1367 | TREE_THIS_VOLATILE (array));
1368 return require_complete_type (fold (rval));
1372 tree ar = default_conversion (array);
1373 tree ind = default_conversion (index);
1375 /* Do the same warning check as above, but only on the part that's
1376 syntactically the index and only if it is also semantically
1378 if (warn_char_subscripts
1379 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1380 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1381 warning ("subscript has type `char'");
1383 /* Put the integer in IND to simplify error checking. */
1384 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1391 if (ar == error_mark_node)
1394 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1395 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1397 error ("subscripted value is neither array nor pointer");
1398 return error_mark_node;
1400 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1402 error ("array subscript is not an integer");
1403 return error_mark_node;
1406 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1411 /* Build an external reference to identifier ID. FUN indicates
1412 whether this will be used for a function call. */
1414 build_external_ref (id, fun)
1419 tree decl = lookup_name (id);
1420 tree objc_ivar = lookup_objc_ivar (id);
1422 if (decl && TREE_DEPRECATED (decl))
1423 warn_deprecated_use (decl);
1425 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1431 if (!decl || decl == error_mark_node)
1432 /* Ordinary implicit function declaration. */
1433 ref = implicitly_declare (id);
1436 /* Implicit declaration of built-in function. Don't
1437 change the built-in declaration, but don't let this
1438 go by silently, either. */
1439 implicit_decl_warning (id);
1441 /* only issue this warning once */
1442 C_DECL_ANTICIPATED (decl) = 0;
1448 /* Reference to undeclared variable, including reference to
1449 builtin outside of function-call context. */
1450 if (current_function_decl == 0)
1451 error ("`%s' undeclared here (not in a function)",
1452 IDENTIFIER_POINTER (id));
1455 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1456 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1458 error ("`%s' undeclared (first use in this function)",
1459 IDENTIFIER_POINTER (id));
1461 if (! undeclared_variable_notice)
1463 error ("(Each undeclared identifier is reported only once");
1464 error ("for each function it appears in.)");
1465 undeclared_variable_notice = 1;
1468 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1469 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1471 return error_mark_node;
1476 /* Properly declared variable or function reference. */
1479 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1481 warning ("local declaration of `%s' hides instance variable",
1482 IDENTIFIER_POINTER (id));
1489 if (TREE_TYPE (ref) == error_mark_node)
1490 return error_mark_node;
1492 assemble_external (ref);
1493 TREE_USED (ref) = 1;
1495 if (TREE_CODE (ref) == CONST_DECL)
1497 ref = DECL_INITIAL (ref);
1498 TREE_CONSTANT (ref) = 1;
1504 /* Build a function call to function FUNCTION with parameters PARAMS.
1505 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1506 TREE_VALUE of each node is a parameter-expression.
1507 FUNCTION's data type may be a function type or a pointer-to-function. */
1510 build_function_call (function, params)
1511 tree function, params;
1513 tree fntype, fundecl = 0;
1514 tree coerced_params;
1515 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1517 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1518 STRIP_TYPE_NOPS (function);
1520 /* Convert anything with function type to a pointer-to-function. */
1521 if (TREE_CODE (function) == FUNCTION_DECL)
1523 name = DECL_NAME (function);
1524 assembler_name = DECL_ASSEMBLER_NAME (function);
1526 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1527 (because calling an inline function does not mean the function
1528 needs to be separately compiled). */
1529 fntype = build_type_variant (TREE_TYPE (function),
1530 TREE_READONLY (function),
1531 TREE_THIS_VOLATILE (function));
1533 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1536 function = default_conversion (function);
1538 fntype = TREE_TYPE (function);
1540 if (TREE_CODE (fntype) == ERROR_MARK)
1541 return error_mark_node;
1543 if (!(TREE_CODE (fntype) == POINTER_TYPE
1544 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1546 error ("called object is not a function");
1547 return error_mark_node;
1550 /* fntype now gets the type of function pointed to. */
1551 fntype = TREE_TYPE (fntype);
1553 /* Convert the parameters to the types declared in the
1554 function prototype, or apply default promotions. */
1557 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1559 /* Check for errors in format strings. */
1562 check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params);
1564 /* Recognize certain built-in functions so we can make tree-codes
1565 other than CALL_EXPR. We do this when it enables fold-const.c
1566 to do something useful. */
1568 if (TREE_CODE (function) == ADDR_EXPR
1569 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1570 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1572 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1573 params, coerced_params);
1578 result = build (CALL_EXPR, TREE_TYPE (fntype),
1579 function, coerced_params, NULL_TREE);
1580 TREE_SIDE_EFFECTS (result) = 1;
1581 result = fold (result);
1583 if (VOID_TYPE_P (TREE_TYPE (result)))
1585 return require_complete_type (result);
1588 /* Convert the argument expressions in the list VALUES
1589 to the types in the list TYPELIST. The result is a list of converted
1590 argument expressions.
1592 If TYPELIST is exhausted, or when an element has NULL as its type,
1593 perform the default conversions.
1595 PARMLIST is the chain of parm decls for the function being called.
1596 It may be 0, if that info is not available.
1597 It is used only for generating error messages.
1599 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1601 This is also where warnings about wrong number of args are generated.
1603 Both VALUES and the returned value are chains of TREE_LIST nodes
1604 with the elements of the list in the TREE_VALUE slots of those nodes. */
1607 convert_arguments (typelist, values, name, fundecl)
1608 tree typelist, values, name, fundecl;
1610 tree typetail, valtail;
1614 /* Scan the given expressions and types, producing individual
1615 converted arguments and pushing them on RESULT in reverse order. */
1617 for (valtail = values, typetail = typelist, parmnum = 0;
1619 valtail = TREE_CHAIN (valtail), parmnum++)
1621 tree type = typetail ? TREE_VALUE (typetail) : 0;
1622 tree val = TREE_VALUE (valtail);
1624 if (type == void_type_node)
1627 error ("too many arguments to function `%s'",
1628 IDENTIFIER_POINTER (name));
1630 error ("too many arguments to function");
1634 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1635 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1636 to convert automatically to a pointer. */
1637 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1638 val = TREE_OPERAND (val, 0);
1640 val = default_function_array_conversion (val);
1642 val = require_complete_type (val);
1646 /* Formal parm type is specified by a function prototype. */
1649 if (!COMPLETE_TYPE_P (type))
1651 error ("type of formal parameter %d is incomplete", parmnum + 1);
1656 /* Optionally warn about conversions that
1657 differ from the default conversions. */
1658 if (warn_conversion || warn_traditional)
1660 int formal_prec = TYPE_PRECISION (type);
1662 if (INTEGRAL_TYPE_P (type)
1663 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1664 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1665 if (INTEGRAL_TYPE_P (type)
1666 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1667 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1668 else if (TREE_CODE (type) == COMPLEX_TYPE
1669 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1670 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1671 else if (TREE_CODE (type) == REAL_TYPE
1672 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1673 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1674 else if (TREE_CODE (type) == COMPLEX_TYPE
1675 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1676 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1677 else if (TREE_CODE (type) == REAL_TYPE
1678 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1679 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1680 /* ??? At some point, messages should be written about
1681 conversions between complex types, but that's too messy
1683 else if (TREE_CODE (type) == REAL_TYPE
1684 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1686 /* Warn if any argument is passed as `float',
1687 since without a prototype it would be `double'. */
1688 if (formal_prec == TYPE_PRECISION (float_type_node))
1689 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1691 /* Detect integer changing in width or signedness.
1692 These warnings are only activated with
1693 -Wconversion, not with -Wtraditional. */
1694 else if (warn_conversion && INTEGRAL_TYPE_P (type)
1695 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1697 tree would_have_been = default_conversion (val);
1698 tree type1 = TREE_TYPE (would_have_been);
1700 if (TREE_CODE (type) == ENUMERAL_TYPE
1701 && (TYPE_MAIN_VARIANT (type)
1702 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
1703 /* No warning if function asks for enum
1704 and the actual arg is that enum type. */
1706 else if (formal_prec != TYPE_PRECISION (type1))
1707 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1708 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1710 /* Don't complain if the formal parameter type
1711 is an enum, because we can't tell now whether
1712 the value was an enum--even the same enum. */
1713 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1715 else if (TREE_CODE (val) == INTEGER_CST
1716 && int_fits_type_p (val, type))
1717 /* Change in signedness doesn't matter
1718 if a constant value is unaffected. */
1720 /* Likewise for a constant in a NOP_EXPR. */
1721 else if (TREE_CODE (val) == NOP_EXPR
1722 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1723 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1725 #if 0 /* We never get such tree structure here. */
1726 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1727 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1728 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1729 /* Change in signedness doesn't matter
1730 if an enum value is unaffected. */
1733 /* If the value is extended from a narrower
1734 unsigned type, it doesn't matter whether we
1735 pass it as signed or unsigned; the value
1736 certainly is the same either way. */
1737 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1738 && TREE_UNSIGNED (TREE_TYPE (val)))
1740 else if (TREE_UNSIGNED (type))
1741 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1743 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1747 parmval = convert_for_assignment (type, val,
1748 (char *) 0, /* arg passing */
1749 fundecl, name, parmnum + 1);
1751 if (PROMOTE_PROTOTYPES
1752 && INTEGRAL_TYPE_P (type)
1753 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1754 parmval = default_conversion (parmval);
1756 result = tree_cons (NULL_TREE, parmval, result);
1758 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1759 && (TYPE_PRECISION (TREE_TYPE (val))
1760 < TYPE_PRECISION (double_type_node)))
1761 /* Convert `float' to `double'. */
1762 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1764 /* Convert `short' and `char' to full-size `int'. */
1765 result = tree_cons (NULL_TREE, default_conversion (val), result);
1768 typetail = TREE_CHAIN (typetail);
1771 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1774 error ("too few arguments to function `%s'",
1775 IDENTIFIER_POINTER (name));
1777 error ("too few arguments to function");
1780 return nreverse (result);
1783 /* This is the entry point used by the parser
1784 for binary operators in the input.
1785 In addition to constructing the expression,
1786 we check for operands that were written with other binary operators
1787 in a way that is likely to confuse the user. */
1790 parser_build_binary_op (code, arg1, arg2)
1791 enum tree_code code;
1794 tree result = build_binary_op (code, arg1, arg2, 1);
1797 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1798 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1799 enum tree_code code1 = ERROR_MARK;
1800 enum tree_code code2 = ERROR_MARK;
1802 if (TREE_CODE (result) == ERROR_MARK)
1803 return error_mark_node;
1805 if (IS_EXPR_CODE_CLASS (class1))
1806 code1 = C_EXP_ORIGINAL_CODE (arg1);
1807 if (IS_EXPR_CODE_CLASS (class2))
1808 code2 = C_EXP_ORIGINAL_CODE (arg2);
1810 /* Check for cases such as x+y<<z which users are likely
1811 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1812 is cleared to prevent these warnings. */
1813 if (warn_parentheses)
1815 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1817 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1818 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1819 warning ("suggest parentheses around + or - inside shift");
1822 if (code == TRUTH_ORIF_EXPR)
1824 if (code1 == TRUTH_ANDIF_EXPR
1825 || code2 == TRUTH_ANDIF_EXPR)
1826 warning ("suggest parentheses around && within ||");
1829 if (code == BIT_IOR_EXPR)
1831 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1832 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1833 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1834 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1835 warning ("suggest parentheses around arithmetic in operand of |");
1836 /* Check cases like x|y==z */
1837 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1838 warning ("suggest parentheses around comparison in operand of |");
1841 if (code == BIT_XOR_EXPR)
1843 if (code1 == BIT_AND_EXPR
1844 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1845 || code2 == BIT_AND_EXPR
1846 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1847 warning ("suggest parentheses around arithmetic in operand of ^");
1848 /* Check cases like x^y==z */
1849 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1850 warning ("suggest parentheses around comparison in operand of ^");
1853 if (code == BIT_AND_EXPR)
1855 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1856 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1857 warning ("suggest parentheses around + or - in operand of &");
1858 /* Check cases like x&y==z */
1859 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1860 warning ("suggest parentheses around comparison in operand of &");
1864 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1865 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1866 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1867 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1869 unsigned_conversion_warning (result, arg1);
1870 unsigned_conversion_warning (result, arg2);
1871 overflow_warning (result);
1873 class = TREE_CODE_CLASS (TREE_CODE (result));
1875 /* Record the code that was specified in the source,
1876 for the sake of warnings about confusing nesting. */
1877 if (IS_EXPR_CODE_CLASS (class))
1878 C_SET_EXP_ORIGINAL_CODE (result, code);
1881 int flag = TREE_CONSTANT (result);
1882 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1883 so that convert_for_assignment wouldn't strip it.
1884 That way, we got warnings for things like p = (1 - 1).
1885 But it turns out we should not get those warnings. */
1886 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1887 C_SET_EXP_ORIGINAL_CODE (result, code);
1888 TREE_CONSTANT (result) = flag;
1894 /* Build a binary-operation expression without default conversions.
1895 CODE is the kind of expression to build.
1896 This function differs from `build' in several ways:
1897 the data type of the result is computed and recorded in it,
1898 warnings are generated if arg data types are invalid,
1899 special handling for addition and subtraction of pointers is known,
1900 and some optimization is done (operations on narrow ints
1901 are done in the narrower type when that gives the same result).
1902 Constant folding is also done before the result is returned.
1904 Note that the operands will never have enumeral types, or function
1905 or array types, because either they will have the default conversions
1906 performed or they have both just been converted to some other type in which
1907 the arithmetic is to be done. */
1910 build_binary_op (code, orig_op0, orig_op1, convert_p)
1911 enum tree_code code;
1912 tree orig_op0, orig_op1;
1916 enum tree_code code0, code1;
1919 /* Expression code to give to the expression when it is built.
1920 Normally this is CODE, which is what the caller asked for,
1921 but in some special cases we change it. */
1922 enum tree_code resultcode = code;
1924 /* Data type in which the computation is to be performed.
1925 In the simplest cases this is the common type of the arguments. */
1926 tree result_type = NULL;
1928 /* Nonzero means operands have already been type-converted
1929 in whatever way is necessary.
1930 Zero means they need to be converted to RESULT_TYPE. */
1933 /* Nonzero means create the expression with this type, rather than
1935 tree build_type = 0;
1937 /* Nonzero means after finally constructing the expression
1938 convert it to this type. */
1939 tree final_type = 0;
1941 /* Nonzero if this is an operation like MIN or MAX which can
1942 safely be computed in short if both args are promoted shorts.
1943 Also implies COMMON.
1944 -1 indicates a bitwise operation; this makes a difference
1945 in the exact conditions for when it is safe to do the operation
1946 in a narrower mode. */
1949 /* Nonzero if this is a comparison operation;
1950 if both args are promoted shorts, compare the original shorts.
1951 Also implies COMMON. */
1952 int short_compare = 0;
1954 /* Nonzero if this is a right-shift operation, which can be computed on the
1955 original short and then promoted if the operand is a promoted short. */
1956 int short_shift = 0;
1958 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1963 op0 = default_conversion (orig_op0);
1964 op1 = default_conversion (orig_op1);
1972 type0 = TREE_TYPE (op0);
1973 type1 = TREE_TYPE (op1);
1975 /* The expression codes of the data types of the arguments tell us
1976 whether the arguments are integers, floating, pointers, etc. */
1977 code0 = TREE_CODE (type0);
1978 code1 = TREE_CODE (type1);
1980 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1981 STRIP_TYPE_NOPS (op0);
1982 STRIP_TYPE_NOPS (op1);
1984 /* If an error was already reported for one of the arguments,
1985 avoid reporting another error. */
1987 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1988 return error_mark_node;
1993 /* Handle the pointer + int case. */
1994 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1995 return pointer_int_sum (PLUS_EXPR, op0, op1);
1996 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1997 return pointer_int_sum (PLUS_EXPR, op1, op0);
2003 /* Subtraction of two similar pointers.
2004 We must subtract them as integers, then divide by object size. */
2005 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
2006 && comp_target_types (type0, type1))
2007 return pointer_diff (op0, op1);
2008 /* Handle pointer minus int. Just like pointer plus int. */
2009 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2010 return pointer_int_sum (MINUS_EXPR, op0, op1);
2019 case TRUNC_DIV_EXPR:
2021 case FLOOR_DIV_EXPR:
2022 case ROUND_DIV_EXPR:
2023 case EXACT_DIV_EXPR:
2024 /* Floating point division by zero is a legitimate way to obtain
2025 infinities and NaNs. */
2026 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2027 warning ("division by zero");
2029 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2030 || code0 == COMPLEX_TYPE)
2031 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2032 || code1 == COMPLEX_TYPE))
2034 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
2035 resultcode = RDIV_EXPR;
2037 /* Although it would be tempting to shorten always here, that
2038 loses on some targets, since the modulo instruction is
2039 undefined if the quotient can't be represented in the
2040 computation mode. We shorten only if unsigned or if
2041 dividing by something we know != -1. */
2042 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2043 || (TREE_CODE (op1) == INTEGER_CST
2044 && ! integer_all_onesp (op1)));
2050 case BIT_ANDTC_EXPR:
2053 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2055 /* If one operand is a constant, and the other is a short type
2056 that has been converted to an int,
2057 really do the work in the short type and then convert the
2058 result to int. If we are lucky, the constant will be 0 or 1
2059 in the short type, making the entire operation go away. */
2060 if (TREE_CODE (op0) == INTEGER_CST
2061 && TREE_CODE (op1) == NOP_EXPR
2062 && TYPE_PRECISION (type1) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))
2063 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
2065 final_type = result_type;
2066 op1 = TREE_OPERAND (op1, 0);
2067 result_type = TREE_TYPE (op1);
2069 if (TREE_CODE (op1) == INTEGER_CST
2070 && TREE_CODE (op0) == NOP_EXPR
2071 && TYPE_PRECISION (type0) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))
2072 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2074 final_type = result_type;
2075 op0 = TREE_OPERAND (op0, 0);
2076 result_type = TREE_TYPE (op0);
2080 case TRUNC_MOD_EXPR:
2081 case FLOOR_MOD_EXPR:
2082 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2083 warning ("division by zero");
2085 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2087 /* Although it would be tempting to shorten always here, that loses
2088 on some targets, since the modulo instruction is undefined if the
2089 quotient can't be represented in the computation mode. We shorten
2090 only if unsigned or if dividing by something we know != -1. */
2091 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2092 || (TREE_CODE (op1) == INTEGER_CST
2093 && ! integer_all_onesp (op1)));
2098 case TRUTH_ANDIF_EXPR:
2099 case TRUTH_ORIF_EXPR:
2100 case TRUTH_AND_EXPR:
2102 case TRUTH_XOR_EXPR:
2103 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2104 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2105 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2106 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2108 /* Result of these operations is always an int,
2109 but that does not mean the operands should be
2110 converted to ints! */
2111 result_type = integer_type_node;
2112 op0 = truthvalue_conversion (op0);
2113 op1 = truthvalue_conversion (op1);
2118 /* Shift operations: result has same type as first operand;
2119 always convert second operand to int.
2120 Also set SHORT_SHIFT if shifting rightward. */
2123 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2125 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2127 if (tree_int_cst_sgn (op1) < 0)
2128 warning ("right shift count is negative");
2131 if (! integer_zerop (op1))
2134 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2135 warning ("right shift count >= width of type");
2139 /* Use the type of the value to be shifted.
2140 This is what most traditional C compilers do. */
2141 result_type = type0;
2142 /* Unless traditional, convert the shift-count to an integer,
2143 regardless of size of value being shifted. */
2144 if (! flag_traditional)
2146 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2147 op1 = convert (integer_type_node, op1);
2148 /* Avoid converting op1 to result_type later. */
2155 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2157 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2159 if (tree_int_cst_sgn (op1) < 0)
2160 warning ("left shift count is negative");
2162 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2163 warning ("left shift count >= width of type");
2166 /* Use the type of the value to be shifted.
2167 This is what most traditional C compilers do. */
2168 result_type = type0;
2169 /* Unless traditional, convert the shift-count to an integer,
2170 regardless of size of value being shifted. */
2171 if (! flag_traditional)
2173 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2174 op1 = convert (integer_type_node, op1);
2175 /* Avoid converting op1 to result_type later. */
2183 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2185 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2187 if (tree_int_cst_sgn (op1) < 0)
2188 warning ("shift count is negative");
2189 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2190 warning ("shift count >= width of type");
2193 /* Use the type of the value to be shifted.
2194 This is what most traditional C compilers do. */
2195 result_type = type0;
2196 /* Unless traditional, convert the shift-count to an integer,
2197 regardless of size of value being shifted. */
2198 if (! flag_traditional)
2200 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2201 op1 = convert (integer_type_node, op1);
2202 /* Avoid converting op1 to result_type later. */
2210 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2211 warning ("comparing floating point with == or != is unsafe");
2212 /* Result of comparison is always int,
2213 but don't convert the args to int! */
2214 build_type = integer_type_node;
2215 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2216 || code0 == COMPLEX_TYPE)
2217 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2218 || code1 == COMPLEX_TYPE))
2220 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2222 tree tt0 = TREE_TYPE (type0);
2223 tree tt1 = TREE_TYPE (type1);
2224 /* Anything compares with void *. void * compares with anything.
2225 Otherwise, the targets must be compatible
2226 and both must be object or both incomplete. */
2227 if (comp_target_types (type0, type1))
2228 result_type = common_type (type0, type1);
2229 else if (VOID_TYPE_P (tt0))
2231 /* op0 != orig_op0 detects the case of something
2232 whose value is 0 but which isn't a valid null ptr const. */
2233 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2234 && TREE_CODE (tt1) == FUNCTION_TYPE)
2235 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2237 else if (VOID_TYPE_P (tt1))
2239 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2240 && TREE_CODE (tt0) == FUNCTION_TYPE)
2241 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2244 pedwarn ("comparison of distinct pointer types lacks a cast");
2246 if (result_type == NULL_TREE)
2247 result_type = ptr_type_node;
2249 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2250 && integer_zerop (op1))
2251 result_type = type0;
2252 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2253 && integer_zerop (op0))
2254 result_type = type1;
2255 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2257 result_type = type0;
2258 if (! flag_traditional)
2259 pedwarn ("comparison between pointer and integer");
2261 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2263 result_type = type1;
2264 if (! flag_traditional)
2265 pedwarn ("comparison between pointer and integer");
2271 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2272 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2274 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2276 if (comp_target_types (type0, type1))
2278 result_type = common_type (type0, type1);
2280 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2281 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2285 result_type = ptr_type_node;
2286 pedwarn ("comparison of distinct pointer types lacks a cast");
2295 build_type = integer_type_node;
2296 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2297 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2299 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2301 if (comp_target_types (type0, type1))
2303 result_type = common_type (type0, type1);
2304 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2305 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2306 pedwarn ("comparison of complete and incomplete pointers");
2308 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2309 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2313 result_type = ptr_type_node;
2314 pedwarn ("comparison of distinct pointer types lacks a cast");
2317 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2318 && integer_zerop (op1))
2320 result_type = type0;
2321 if (pedantic || extra_warnings)
2322 pedwarn ("ordered comparison of pointer with integer zero");
2324 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2325 && integer_zerop (op0))
2327 result_type = type1;
2329 pedwarn ("ordered comparison of pointer with integer zero");
2331 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2333 result_type = type0;
2334 if (! flag_traditional)
2335 pedwarn ("comparison between pointer and integer");
2337 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2339 result_type = type1;
2340 if (! flag_traditional)
2341 pedwarn ("comparison between pointer and integer");
2345 case UNORDERED_EXPR:
2352 build_type = integer_type_node;
2353 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2355 error ("unordered comparison on non-floating point argument");
2356 return error_mark_node;
2365 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2367 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2369 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2371 if (shorten || common || short_compare)
2372 result_type = common_type (type0, type1);
2374 /* For certain operations (which identify themselves by shorten != 0)
2375 if both args were extended from the same smaller type,
2376 do the arithmetic in that type and then extend.
2378 shorten !=0 and !=1 indicates a bitwise operation.
2379 For them, this optimization is safe only if
2380 both args are zero-extended or both are sign-extended.
2381 Otherwise, we might change the result.
2382 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2383 but calculated in (unsigned short) it would be (unsigned short)-1. */
2385 if (shorten && none_complex)
2387 int unsigned0, unsigned1;
2388 tree arg0 = get_narrower (op0, &unsigned0);
2389 tree arg1 = get_narrower (op1, &unsigned1);
2390 /* UNS is 1 if the operation to be done is an unsigned one. */
2391 int uns = TREE_UNSIGNED (result_type);
2394 final_type = result_type;
2396 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2397 but it *requires* conversion to FINAL_TYPE. */
2399 if ((TYPE_PRECISION (TREE_TYPE (op0))
2400 == TYPE_PRECISION (TREE_TYPE (arg0)))
2401 && TREE_TYPE (op0) != final_type)
2402 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2403 if ((TYPE_PRECISION (TREE_TYPE (op1))
2404 == TYPE_PRECISION (TREE_TYPE (arg1)))
2405 && TREE_TYPE (op1) != final_type)
2406 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2408 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2410 /* For bitwise operations, signedness of nominal type
2411 does not matter. Consider only how operands were extended. */
2415 /* Note that in all three cases below we refrain from optimizing
2416 an unsigned operation on sign-extended args.
2417 That would not be valid. */
2419 /* Both args variable: if both extended in same way
2420 from same width, do it in that width.
2421 Do it unsigned if args were zero-extended. */
2422 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2423 < TYPE_PRECISION (result_type))
2424 && (TYPE_PRECISION (TREE_TYPE (arg1))
2425 == TYPE_PRECISION (TREE_TYPE (arg0)))
2426 && unsigned0 == unsigned1
2427 && (unsigned0 || !uns))
2429 = signed_or_unsigned_type (unsigned0,
2430 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2431 else if (TREE_CODE (arg0) == INTEGER_CST
2432 && (unsigned1 || !uns)
2433 && (TYPE_PRECISION (TREE_TYPE (arg1))
2434 < TYPE_PRECISION (result_type))
2435 && (type = signed_or_unsigned_type (unsigned1,
2437 int_fits_type_p (arg0, type)))
2439 else if (TREE_CODE (arg1) == INTEGER_CST
2440 && (unsigned0 || !uns)
2441 && (TYPE_PRECISION (TREE_TYPE (arg0))
2442 < TYPE_PRECISION (result_type))
2443 && (type = signed_or_unsigned_type (unsigned0,
2445 int_fits_type_p (arg1, type)))
2449 /* Shifts can be shortened if shifting right. */
2454 tree arg0 = get_narrower (op0, &unsigned_arg);
2456 final_type = result_type;
2458 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2459 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2461 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2462 /* We can shorten only if the shift count is less than the
2463 number of bits in the smaller type size. */
2464 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2465 /* We cannot drop an unsigned shift after sign-extension. */
2466 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2468 /* Do an unsigned shift if the operand was zero-extended. */
2470 = signed_or_unsigned_type (unsigned_arg, TREE_TYPE (arg0));
2471 /* Convert value-to-be-shifted to that type. */
2472 if (TREE_TYPE (op0) != result_type)
2473 op0 = convert (result_type, op0);
2478 /* Comparison operations are shortened too but differently.
2479 They identify themselves by setting short_compare = 1. */
2483 /* Don't write &op0, etc., because that would prevent op0
2484 from being kept in a register.
2485 Instead, make copies of the our local variables and
2486 pass the copies by reference, then copy them back afterward. */
2487 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2488 enum tree_code xresultcode = resultcode;
2490 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2495 op0 = xop0, op1 = xop1;
2497 resultcode = xresultcode;
2499 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2500 && skip_evaluation == 0)
2502 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2503 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2504 int unsignedp0, unsignedp1;
2505 tree primop0 = get_narrower (op0, &unsignedp0);
2506 tree primop1 = get_narrower (op1, &unsignedp1);
2510 STRIP_TYPE_NOPS (xop0);
2511 STRIP_TYPE_NOPS (xop1);
2513 /* Give warnings for comparisons between signed and unsigned
2514 quantities that may fail.
2516 Do the checking based on the original operand trees, so that
2517 casts will be considered, but default promotions won't be.
2519 Do not warn if the comparison is being done in a signed type,
2520 since the signed type will only be chosen if it can represent
2521 all the values of the unsigned type. */
2522 if (! TREE_UNSIGNED (result_type))
2524 /* Do not warn if both operands are the same signedness. */
2525 else if (op0_signed == op1_signed)
2532 sop = xop0, uop = xop1;
2534 sop = xop1, uop = xop0;
2536 /* Do not warn if the signed quantity is an
2537 unsuffixed integer literal (or some static
2538 constant expression involving such literals or a
2539 conditional expression involving such literals)
2540 and it is non-negative. */
2541 if (tree_expr_nonnegative_p (sop))
2543 /* Do not warn if the comparison is an equality operation,
2544 the unsigned quantity is an integral constant, and it
2545 would fit in the result if the result were signed. */
2546 else if (TREE_CODE (uop) == INTEGER_CST
2547 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2548 && int_fits_type_p (uop, signed_type (result_type)))
2550 /* Do not warn if the unsigned quantity is an enumeration
2551 constant and its maximum value would fit in the result
2552 if the result were signed. */
2553 else if (TREE_CODE (uop) == INTEGER_CST
2554 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2555 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2556 signed_type (result_type)))
2559 warning ("comparison between signed and unsigned");
2562 /* Warn if two unsigned values are being compared in a size
2563 larger than their original size, and one (and only one) is the
2564 result of a `~' operator. This comparison will always fail.
2566 Also warn if one operand is a constant, and the constant
2567 does not have all bits set that are set in the ~ operand
2568 when it is extended. */
2570 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2571 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2573 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2574 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2577 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2580 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2583 HOST_WIDE_INT constant, mask;
2584 int unsignedp, bits;
2586 if (host_integerp (primop0, 0))
2589 unsignedp = unsignedp1;
2590 constant = tree_low_cst (primop0, 0);
2595 unsignedp = unsignedp0;
2596 constant = tree_low_cst (primop1, 0);
2599 bits = TYPE_PRECISION (TREE_TYPE (primop));
2600 if (bits < TYPE_PRECISION (result_type)
2601 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2603 mask = (~ (HOST_WIDE_INT) 0) << bits;
2604 if ((mask & constant) != mask)
2605 warning ("comparison of promoted ~unsigned with constant");
2608 else if (unsignedp0 && unsignedp1
2609 && (TYPE_PRECISION (TREE_TYPE (primop0))
2610 < TYPE_PRECISION (result_type))
2611 && (TYPE_PRECISION (TREE_TYPE (primop1))
2612 < TYPE_PRECISION (result_type)))
2613 warning ("comparison of promoted ~unsigned with unsigned");
2619 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2620 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2621 Then the expression will be built.
2622 It will be given type FINAL_TYPE if that is nonzero;
2623 otherwise, it will be given type RESULT_TYPE. */
2627 binary_op_error (code);
2628 return error_mark_node;
2633 if (TREE_TYPE (op0) != result_type)
2634 op0 = convert (result_type, op0);
2635 if (TREE_TYPE (op1) != result_type)
2636 op1 = convert (result_type, op1);
2639 if (build_type == NULL_TREE)
2640 build_type = result_type;
2643 tree result = build (resultcode, build_type, op0, op1);
2646 folded = fold (result);
2647 if (folded == result)
2648 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2649 if (final_type != 0)
2650 return convert (final_type, folded);
2655 /* Return a tree for the sum or difference (RESULTCODE says which)
2656 of pointer PTROP and integer INTOP. */
2659 pointer_int_sum (resultcode, ptrop, intop)
2660 enum tree_code resultcode;
2668 /* The result is a pointer of the same type that is being added. */
2670 tree result_type = TREE_TYPE (ptrop);
2672 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2674 if (pedantic || warn_pointer_arith)
2675 pedwarn ("pointer of type `void *' used in arithmetic");
2676 size_exp = integer_one_node;
2678 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2680 if (pedantic || warn_pointer_arith)
2681 pedwarn ("pointer to a function used in arithmetic");
2682 size_exp = integer_one_node;
2685 size_exp = c_size_in_bytes (TREE_TYPE (result_type));
2687 /* If what we are about to multiply by the size of the elements
2688 contains a constant term, apply distributive law
2689 and multiply that constant term separately.
2690 This helps produce common subexpressions. */
2692 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2693 && ! TREE_CONSTANT (intop)
2694 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2695 && TREE_CONSTANT (size_exp)
2696 /* If the constant comes from pointer subtraction,
2697 skip this optimization--it would cause an error. */
2698 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2699 /* If the constant is unsigned, and smaller than the pointer size,
2700 then we must skip this optimization. This is because it could cause
2701 an overflow error if the constant is negative but INTOP is not. */
2702 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2703 || (TYPE_PRECISION (TREE_TYPE (intop))
2704 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2706 enum tree_code subcode = resultcode;
2707 tree int_type = TREE_TYPE (intop);
2708 if (TREE_CODE (intop) == MINUS_EXPR)
2709 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2710 /* Convert both subexpression types to the type of intop,
2711 because weird cases involving pointer arithmetic
2712 can result in a sum or difference with different type args. */
2713 ptrop = build_binary_op (subcode, ptrop,
2714 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2715 intop = convert (int_type, TREE_OPERAND (intop, 0));
2718 /* Convert the integer argument to a type the same size as sizetype
2719 so the multiply won't overflow spuriously. */
2721 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2722 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2723 intop = convert (type_for_size (TYPE_PRECISION (sizetype),
2724 TREE_UNSIGNED (sizetype)), intop);
2726 /* Replace the integer argument with a suitable product by the object size.
2727 Do this multiplication as signed, then convert to the appropriate
2728 pointer type (actually unsigned integral). */
2730 intop = convert (result_type,
2731 build_binary_op (MULT_EXPR, intop,
2732 convert (TREE_TYPE (intop), size_exp), 1));
2734 /* Create the sum or difference. */
2736 result = build (resultcode, result_type, ptrop, intop);
2738 folded = fold (result);
2739 if (folded == result)
2740 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2744 /* Return a tree for the difference of pointers OP0 and OP1.
2745 The resulting tree has type int. */
2748 pointer_diff (op0, op1)
2751 tree result, folded;
2752 tree restype = ptrdiff_type_node;
2754 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2755 tree con0, con1, lit0, lit1;
2756 tree orig_op1 = op1;
2758 if (pedantic || warn_pointer_arith)
2760 if (TREE_CODE (target_type) == VOID_TYPE)
2761 pedwarn ("pointer of type `void *' used in subtraction");
2762 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2763 pedwarn ("pointer to a function used in subtraction");
2766 /* If the conversion to ptrdiff_type does anything like widening or
2767 converting a partial to an integral mode, we get a convert_expression
2768 that is in the way to do any simplifications.
2769 (fold-const.c doesn't know that the extra bits won't be needed.
2770 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2771 different mode in place.)
2772 So first try to find a common term here 'by hand'; we want to cover
2773 at least the cases that occur in legal static initializers. */
2774 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2775 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2777 if (TREE_CODE (con0) == PLUS_EXPR)
2779 lit0 = TREE_OPERAND (con0, 1);
2780 con0 = TREE_OPERAND (con0, 0);
2783 lit0 = integer_zero_node;
2785 if (TREE_CODE (con1) == PLUS_EXPR)
2787 lit1 = TREE_OPERAND (con1, 1);
2788 con1 = TREE_OPERAND (con1, 0);
2791 lit1 = integer_zero_node;
2793 if (operand_equal_p (con0, con1, 0))
2800 /* First do the subtraction as integers;
2801 then drop through to build the divide operator.
2802 Do not do default conversions on the minus operator
2803 in case restype is a short type. */
2805 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2806 convert (restype, op1), 0);
2807 /* This generates an error if op1 is pointer to incomplete type. */
2808 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2809 error ("arithmetic on pointer to an incomplete type");
2811 /* This generates an error if op0 is pointer to incomplete type. */
2812 op1 = c_size_in_bytes (target_type);
2814 /* Divide by the size, in easiest possible way. */
2816 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2818 folded = fold (result);
2819 if (folded == result)
2820 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2824 /* Construct and perhaps optimize a tree representation
2825 for a unary operation. CODE, a tree_code, specifies the operation
2826 and XARG is the operand.
2827 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2828 the default promotions (such as from short to int).
2829 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2830 allows non-lvalues; this is only used to handle conversion of non-lvalue
2831 arrays to pointers in C99. */
2834 build_unary_op (code, xarg, flag)
2835 enum tree_code code;
2839 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2842 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2844 int noconvert = flag;
2846 if (typecode == ERROR_MARK)
2847 return error_mark_node;
2848 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2849 typecode = INTEGER_TYPE;
2854 /* This is used for unary plus, because a CONVERT_EXPR
2855 is enough to prevent anybody from looking inside for
2856 associativity, but won't generate any code. */
2857 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2858 || typecode == COMPLEX_TYPE))
2860 error ("wrong type argument to unary plus");
2861 return error_mark_node;
2863 else if (!noconvert)
2864 arg = default_conversion (arg);
2868 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2869 || typecode == COMPLEX_TYPE))
2871 error ("wrong type argument to unary minus");
2872 return error_mark_node;
2874 else if (!noconvert)
2875 arg = default_conversion (arg);
2879 if (typecode == COMPLEX_TYPE)
2883 pedwarn ("ISO C does not support `~' for complex conjugation");
2885 arg = default_conversion (arg);
2887 else if (typecode != INTEGER_TYPE)
2889 error ("wrong type argument to bit-complement");
2890 return error_mark_node;
2892 else if (!noconvert)
2893 arg = default_conversion (arg);
2897 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2898 || typecode == COMPLEX_TYPE))
2900 error ("wrong type argument to abs");
2901 return error_mark_node;
2903 else if (!noconvert)
2904 arg = default_conversion (arg);
2908 /* Conjugating a real value is a no-op, but allow it anyway. */
2909 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2910 || typecode == COMPLEX_TYPE))
2912 error ("wrong type argument to conjugation");
2913 return error_mark_node;
2915 else if (!noconvert)
2916 arg = default_conversion (arg);
2919 case TRUTH_NOT_EXPR:
2920 if (typecode != INTEGER_TYPE
2921 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2922 && typecode != COMPLEX_TYPE
2923 /* These will convert to a pointer. */
2924 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2926 error ("wrong type argument to unary exclamation mark");
2927 return error_mark_node;
2929 arg = truthvalue_conversion (arg);
2930 return invert_truthvalue (arg);
2936 if (TREE_CODE (arg) == COMPLEX_CST)
2937 return TREE_REALPART (arg);
2938 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2939 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2944 if (TREE_CODE (arg) == COMPLEX_CST)
2945 return TREE_IMAGPART (arg);
2946 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2947 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2949 return convert (TREE_TYPE (arg), integer_zero_node);
2951 case PREINCREMENT_EXPR:
2952 case POSTINCREMENT_EXPR:
2953 case PREDECREMENT_EXPR:
2954 case POSTDECREMENT_EXPR:
2955 /* Handle complex lvalues (when permitted)
2956 by reduction to simpler cases. */
2958 val = unary_complex_lvalue (code, arg, 0);
2962 /* Increment or decrement the real part of the value,
2963 and don't change the imaginary part. */
2964 if (typecode == COMPLEX_TYPE)
2969 pedwarn ("ISO C does not support `++' and `--' on complex types");
2971 arg = stabilize_reference (arg);
2972 real = build_unary_op (REALPART_EXPR, arg, 1);
2973 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2974 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2975 build_unary_op (code, real, 1), imag);
2978 /* Report invalid types. */
2980 if (typecode != POINTER_TYPE
2981 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2983 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2984 error ("wrong type argument to increment");
2986 error ("wrong type argument to decrement");
2988 return error_mark_node;
2993 tree result_type = TREE_TYPE (arg);
2995 arg = get_unwidened (arg, 0);
2996 argtype = TREE_TYPE (arg);
2998 /* Compute the increment. */
3000 if (typecode == POINTER_TYPE)
3002 /* If pointer target is an undefined struct,
3003 we just cannot know how to do the arithmetic. */
3004 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3006 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3007 error ("increment of pointer to unknown structure");
3009 error ("decrement of pointer to unknown structure");
3011 else if ((pedantic || warn_pointer_arith)
3012 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3013 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
3015 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3016 pedwarn ("wrong type argument to increment");
3018 pedwarn ("wrong type argument to decrement");
3021 inc = c_size_in_bytes (TREE_TYPE (result_type));
3024 inc = integer_one_node;
3026 inc = convert (argtype, inc);
3028 /* Handle incrementing a cast-expression. */
3031 switch (TREE_CODE (arg))
3036 case FIX_TRUNC_EXPR:
3037 case FIX_FLOOR_EXPR:
3038 case FIX_ROUND_EXPR:
3040 pedantic_lvalue_warning (CONVERT_EXPR);
3041 /* If the real type has the same machine representation
3042 as the type it is cast to, we can make better output
3043 by adding directly to the inside of the cast. */
3044 if ((TREE_CODE (TREE_TYPE (arg))
3045 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
3046 && (TYPE_MODE (TREE_TYPE (arg))
3047 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
3048 arg = TREE_OPERAND (arg, 0);
3051 tree incremented, modify, value;
3052 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3053 value = boolean_increment (code, arg);
3056 arg = stabilize_reference (arg);
3057 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
3060 value = save_expr (arg);
3061 incremented = build (((code == PREINCREMENT_EXPR
3062 || code == POSTINCREMENT_EXPR)
3063 ? PLUS_EXPR : MINUS_EXPR),
3064 argtype, value, inc);
3065 TREE_SIDE_EFFECTS (incremented) = 1;
3066 modify = build_modify_expr (arg, NOP_EXPR, incremented);
3067 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
3069 TREE_USED (value) = 1;
3079 /* Complain about anything else that is not a true lvalue. */
3080 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3081 || code == POSTINCREMENT_EXPR)
3082 ? "invalid lvalue in increment"
3083 : "invalid lvalue in decrement")))
3084 return error_mark_node;
3086 /* Report a read-only lvalue. */
3087 if (TREE_READONLY (arg))
3088 readonly_warning (arg,
3089 ((code == PREINCREMENT_EXPR
3090 || code == POSTINCREMENT_EXPR)
3091 ? "increment" : "decrement"));
3093 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3094 val = boolean_increment (code, arg);
3096 val = build (code, TREE_TYPE (arg), arg, inc);
3097 TREE_SIDE_EFFECTS (val) = 1;
3098 val = convert (result_type, val);
3099 if (TREE_CODE (val) != code)
3100 TREE_NO_UNUSED_WARNING (val) = 1;
3105 /* Note that this operation never does default_conversion. */
3107 /* Let &* cancel out to simplify resulting code. */
3108 if (TREE_CODE (arg) == INDIRECT_REF)
3110 /* Don't let this be an lvalue. */
3111 if (lvalue_p (TREE_OPERAND (arg, 0)))
3112 return non_lvalue (TREE_OPERAND (arg, 0));
3113 return TREE_OPERAND (arg, 0);
3116 /* For &x[y], return x+y */
3117 if (TREE_CODE (arg) == ARRAY_REF)
3119 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
3120 return error_mark_node;
3121 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
3122 TREE_OPERAND (arg, 1), 1);
3125 /* Handle complex lvalues (when permitted)
3126 by reduction to simpler cases. */
3127 val = unary_complex_lvalue (code, arg, flag);
3131 #if 0 /* Turned off because inconsistent;
3132 float f; *&(int)f = 3.4 stores in int format
3133 whereas (int)f = 3.4 stores in float format. */
3134 /* Address of a cast is just a cast of the address
3135 of the operand of the cast. */
3136 switch (TREE_CODE (arg))
3141 case FIX_TRUNC_EXPR:
3142 case FIX_FLOOR_EXPR:
3143 case FIX_ROUND_EXPR:
3146 pedwarn ("ISO C forbids the address of a cast expression");
3147 return convert (build_pointer_type (TREE_TYPE (arg)),
3148 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3153 /* Anything not already handled and not a true memory reference
3154 or a non-lvalue array is an error. */
3155 else if (typecode != FUNCTION_TYPE && !flag
3156 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3157 return error_mark_node;
3159 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3160 argtype = TREE_TYPE (arg);
3162 /* If the lvalue is const or volatile, merge that into the type
3163 to which the address will point. Note that you can't get a
3164 restricted pointer by taking the address of something, so we
3165 only have to deal with `const' and `volatile' here. */
3166 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3167 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3168 argtype = c_build_type_variant (argtype,
3169 TREE_READONLY (arg),
3170 TREE_THIS_VOLATILE (arg));
3172 argtype = build_pointer_type (argtype);
3174 if (mark_addressable (arg) == 0)
3175 return error_mark_node;
3180 if (TREE_CODE (arg) == COMPONENT_REF)
3182 tree field = TREE_OPERAND (arg, 1);
3184 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag);
3186 if (DECL_C_BIT_FIELD (field))
3188 error ("attempt to take address of bit-field structure member `%s'",
3189 IDENTIFIER_POINTER (DECL_NAME (field)));
3190 return error_mark_node;
3193 addr = fold (build (PLUS_EXPR, argtype,
3194 convert (argtype, addr),
3195 convert (argtype, byte_position (field))));
3198 addr = build1 (code, argtype, arg);
3200 /* Address of a static or external variable or
3201 file-scope function counts as a constant. */
3203 && ! (TREE_CODE (arg) == FUNCTION_DECL
3204 && DECL_CONTEXT (arg) != 0))
3205 TREE_CONSTANT (addr) = 1;
3214 argtype = TREE_TYPE (arg);
3215 return fold (build1 (code, argtype, arg));
3219 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3220 convert ARG with the same conversions in the same order
3221 and return the result. */
3224 convert_sequence (conversions, arg)
3228 switch (TREE_CODE (conversions))
3233 case FIX_TRUNC_EXPR:
3234 case FIX_FLOOR_EXPR:
3235 case FIX_ROUND_EXPR:
3237 return convert (TREE_TYPE (conversions),
3238 convert_sequence (TREE_OPERAND (conversions, 0),
3247 /* Return nonzero if REF is an lvalue valid for this language.
3248 Lvalues can be assigned, unless their type has TYPE_READONLY.
3249 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3255 enum tree_code code = TREE_CODE (ref);
3262 return lvalue_p (TREE_OPERAND (ref, 0));
3264 case COMPOUND_LITERAL_EXPR:
3274 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3275 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3279 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3286 /* Return nonzero if REF is an lvalue valid for this language;
3287 otherwise, print an error message and return zero. */
3290 lvalue_or_else (ref, msgid)
3294 int win = lvalue_p (ref);
3297 error ("%s", msgid);
3302 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3303 for certain kinds of expressions which are not really lvalues
3304 but which we can accept as lvalues. If FLAG is nonzero, then
3305 non-lvalues are OK since we may be converting a non-lvalue array to
3308 If ARG is not a kind of expression we can handle, return zero. */
3311 unary_complex_lvalue (code, arg, flag)
3312 enum tree_code code;
3316 /* Handle (a, b) used as an "lvalue". */
3317 if (TREE_CODE (arg) == COMPOUND_EXPR)
3319 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3321 /* If this returns a function type, it isn't really being used as
3322 an lvalue, so don't issue a warning about it. */
3323 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3324 pedantic_lvalue_warning (COMPOUND_EXPR);
3326 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3327 TREE_OPERAND (arg, 0), real_result);
3330 /* Handle (a ? b : c) used as an "lvalue". */
3331 if (TREE_CODE (arg) == COND_EXPR)
3334 pedantic_lvalue_warning (COND_EXPR);
3335 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3336 pedantic_lvalue_warning (COMPOUND_EXPR);
3338 return (build_conditional_expr
3339 (TREE_OPERAND (arg, 0),
3340 build_unary_op (code, TREE_OPERAND (arg, 1), flag),
3341 build_unary_op (code, TREE_OPERAND (arg, 2), flag)));
3347 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3348 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3351 pedantic_lvalue_warning (code)
3352 enum tree_code code;
3358 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3361 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3364 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3369 /* Warn about storing in something that is `const'. */
3372 readonly_warning (arg, msgid)
3376 if (TREE_CODE (arg) == COMPONENT_REF)
3378 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3379 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3381 pedwarn ("%s of read-only member `%s'", _(msgid),
3382 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3384 else if (TREE_CODE (arg) == VAR_DECL)
3385 pedwarn ("%s of read-only variable `%s'", _(msgid),
3386 IDENTIFIER_POINTER (DECL_NAME (arg)));
3388 pedwarn ("%s of read-only location", _(msgid));
3391 /* Mark EXP saying that we need to be able to take the
3392 address of it; it should not be allocated in a register.
3393 Value is 1 if successful. */
3396 mark_addressable (exp)
3401 switch (TREE_CODE (x))
3404 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3406 error ("cannot take address of bit-field `%s'",
3407 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3411 /* ... fall through ... */
3417 x = TREE_OPERAND (x, 0);
3420 case COMPOUND_LITERAL_EXPR:
3422 TREE_ADDRESSABLE (x) = 1;
3429 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3430 && DECL_NONLOCAL (x))
3432 if (TREE_PUBLIC (x))
3434 error ("global register variable `%s' used in nested function",
3435 IDENTIFIER_POINTER (DECL_NAME (x)));
3438 pedwarn ("register variable `%s' used in nested function",
3439 IDENTIFIER_POINTER (DECL_NAME (x)));
3441 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3443 if (TREE_PUBLIC (x))
3445 error ("address of global register variable `%s' requested",
3446 IDENTIFIER_POINTER (DECL_NAME (x)));
3450 /* If we are making this addressable due to its having
3451 volatile components, give a different error message. Also
3452 handle the case of an unnamed parameter by not trying
3453 to give the name. */
3455 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3457 error ("cannot put object with volatile field into register");
3461 pedwarn ("address of register variable `%s' requested",
3462 IDENTIFIER_POINTER (DECL_NAME (x)));
3464 put_var_into_stack (x);
3468 TREE_ADDRESSABLE (x) = 1;
3469 #if 0 /* poplevel deals with this now. */
3470 if (DECL_CONTEXT (x) == 0)
3471 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3479 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3482 build_conditional_expr (ifexp, op1, op2)
3483 tree ifexp, op1, op2;
3487 enum tree_code code1;
3488 enum tree_code code2;
3489 tree result_type = NULL;
3490 tree orig_op1 = op1, orig_op2 = op2;
3492 ifexp = truthvalue_conversion (default_conversion (ifexp));
3494 #if 0 /* Produces wrong result if within sizeof. */
3495 /* Don't promote the operands separately if they promote
3496 the same way. Return the unpromoted type and let the combined
3497 value get promoted if necessary. */
3499 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3500 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3501 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3502 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3504 if (TREE_CODE (ifexp) == INTEGER_CST)
3505 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3507 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3511 /* Promote both alternatives. */
3513 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3514 op1 = default_conversion (op1);
3515 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3516 op2 = default_conversion (op2);
3518 if (TREE_CODE (ifexp) == ERROR_MARK
3519 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3520 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3521 return error_mark_node;
3523 type1 = TREE_TYPE (op1);
3524 code1 = TREE_CODE (type1);
3525 type2 = TREE_TYPE (op2);
3526 code2 = TREE_CODE (type2);
3528 /* Quickly detect the usual case where op1 and op2 have the same type
3530 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3533 result_type = type1;
3535 result_type = TYPE_MAIN_VARIANT (type1);
3537 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3538 || code1 == COMPLEX_TYPE)
3539 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3540 || code2 == COMPLEX_TYPE))
3542 result_type = common_type (type1, type2);
3544 /* If -Wsign-compare, warn here if type1 and type2 have
3545 different signedness. We'll promote the signed to unsigned
3546 and later code won't know it used to be different.
3547 Do this check on the original types, so that explicit casts
3548 will be considered, but default promotions won't. */
3549 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3550 && !skip_evaluation)
3552 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3553 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3555 if (unsigned_op1 ^ unsigned_op2)
3557 /* Do not warn if the result type is signed, since the
3558 signed type will only be chosen if it can represent
3559 all the values of the unsigned type. */
3560 if (! TREE_UNSIGNED (result_type))
3562 /* Do not warn if the signed quantity is an unsuffixed
3563 integer literal (or some static constant expression
3564 involving such literals) and it is non-negative. */
3565 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3566 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3569 warning ("signed and unsigned type in conditional expression");
3573 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3575 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3576 pedwarn ("ISO C forbids conditional expr with only one void side");
3577 result_type = void_type_node;
3579 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3581 if (comp_target_types (type1, type2))
3582 result_type = common_type (type1, type2);
3583 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3584 && TREE_CODE (orig_op1) != NOP_EXPR)
3585 result_type = qualify_type (type2, type1);
3586 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3587 && TREE_CODE (orig_op2) != NOP_EXPR)
3588 result_type = qualify_type (type1, type2);
3589 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3591 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3592 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3593 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3594 TREE_TYPE (type2)));
3596 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3598 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3599 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3600 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3601 TREE_TYPE (type1)));
3605 pedwarn ("pointer type mismatch in conditional expression");
3606 result_type = build_pointer_type (void_type_node);
3609 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3611 if (! integer_zerop (op2))
3612 pedwarn ("pointer/integer type mismatch in conditional expression");
3615 op2 = null_pointer_node;
3617 result_type = type1;
3619 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3621 if (!integer_zerop (op1))
3622 pedwarn ("pointer/integer type mismatch in conditional expression");
3625 op1 = null_pointer_node;
3627 result_type = type2;
3632 if (flag_cond_mismatch)
3633 result_type = void_type_node;
3636 error ("type mismatch in conditional expression");
3637 return error_mark_node;
3641 /* Merge const and volatile flags of the incoming types. */
3643 = build_type_variant (result_type,
3644 TREE_READONLY (op1) || TREE_READONLY (op2),
3645 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3647 if (result_type != TREE_TYPE (op1))
3648 op1 = convert_and_check (result_type, op1);
3649 if (result_type != TREE_TYPE (op2))
3650 op2 = convert_and_check (result_type, op2);
3652 if (TREE_CODE (ifexp) == INTEGER_CST)
3653 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3655 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3658 /* Given a list of expressions, return a compound expression
3659 that performs them all and returns the value of the last of them. */
3662 build_compound_expr (list)
3665 return internal_build_compound_expr (list, TRUE);
3669 internal_build_compound_expr (list, first_p)
3675 if (TREE_CHAIN (list) == 0)
3677 /* Convert arrays and functions to pointers when there
3678 really is a comma operator. */
3681 = default_function_array_conversion (TREE_VALUE (list));
3683 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3684 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3686 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3687 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3688 list = TREE_OPERAND (list, 0);
3691 /* Don't let (0, 0) be null pointer constant. */
3692 if (!first_p && integer_zerop (TREE_VALUE (list)))
3693 return non_lvalue (TREE_VALUE (list));
3694 return TREE_VALUE (list);
3697 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3699 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3701 /* The left-hand operand of a comma expression is like an expression
3702 statement: with -W or -Wunused, we should warn if it doesn't have
3703 any side-effects, unless it was explicitly cast to (void). */
3704 if ((extra_warnings || warn_unused_value)
3705 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3706 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3707 warning ("left-hand operand of comma expression has no effect");
3709 /* When pedantic, a compound expression can be neither an lvalue
3710 nor an integer constant expression. */
3715 /* With -Wunused, we should also warn if the left-hand operand does have
3716 side-effects, but computes a value which is not used. For example, in
3717 `foo() + bar(), baz()' the result of the `+' operator is not used,
3718 so we should issue a warning. */
3719 else if (warn_unused_value)
3720 warn_if_unused_value (TREE_VALUE (list));
3722 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3725 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3728 build_c_cast (type, expr)
3734 if (type == error_mark_node || expr == error_mark_node)
3735 return error_mark_node;
3736 type = TYPE_MAIN_VARIANT (type);
3739 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3740 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3741 value = TREE_OPERAND (value, 0);
3744 if (TREE_CODE (type) == ARRAY_TYPE)
3746 error ("cast specifies array type");
3747 return error_mark_node;
3750 if (TREE_CODE (type) == FUNCTION_TYPE)
3752 error ("cast specifies function type");
3753 return error_mark_node;
3756 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3760 if (TREE_CODE (type) == RECORD_TYPE
3761 || TREE_CODE (type) == UNION_TYPE)
3762 pedwarn ("ISO C forbids casting nonscalar to the same type");
3765 else if (TREE_CODE (type) == UNION_TYPE)
3768 value = default_function_array_conversion (value);
3770 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3771 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3772 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3781 pedwarn ("ISO C forbids casts to union type");
3782 if (TYPE_NAME (type) != 0)
3784 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3785 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3787 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3791 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3792 build_tree_list (field, value)),
3794 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3797 error ("cast to union type from type not present in union");
3798 return error_mark_node;
3804 /* If casting to void, avoid the error that would come
3805 from default_conversion in the case of a non-lvalue array. */
3806 if (type == void_type_node)
3807 return build1 (CONVERT_EXPR, type, value);
3809 /* Convert functions and arrays to pointers,
3810 but don't convert any other types. */
3811 value = default_function_array_conversion (value);
3812 otype = TREE_TYPE (value);
3814 /* Optionally warn about potentially worrisome casts. */
3817 && TREE_CODE (type) == POINTER_TYPE
3818 && TREE_CODE (otype) == POINTER_TYPE)
3820 tree in_type = type;
3821 tree in_otype = otype;
3824 /* Check that the qualifiers on IN_TYPE are a superset of
3825 the qualifiers of IN_OTYPE. The outermost level of
3826 POINTER_TYPE nodes is uninteresting and we stop as soon
3827 as we hit a non-POINTER_TYPE node on either type. */
3830 in_otype = TREE_TYPE (in_otype);
3831 in_type = TREE_TYPE (in_type);
3832 warn |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3834 while (TREE_CODE (in_type) == POINTER_TYPE
3835 && TREE_CODE (in_otype) == POINTER_TYPE);
3838 /* There are qualifiers present in IN_OTYPE that are not
3839 present in IN_TYPE. */
3840 warning ("cast discards qualifiers from pointer target type");
3843 /* Warn about possible alignment problems. */
3844 if (STRICT_ALIGNMENT && warn_cast_align
3845 && TREE_CODE (type) == POINTER_TYPE
3846 && TREE_CODE (otype) == POINTER_TYPE
3847 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3848 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3849 /* Don't warn about opaque types, where the actual alignment
3850 restriction is unknown. */
3851 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3852 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3853 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3854 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3855 warning ("cast increases required alignment of target type");
3857 if (TREE_CODE (type) == INTEGER_TYPE
3858 && TREE_CODE (otype) == POINTER_TYPE
3859 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3860 && !TREE_CONSTANT (value))
3861 warning ("cast from pointer to integer of different size");
3863 if (warn_bad_function_cast
3864 && TREE_CODE (value) == CALL_EXPR
3865 && TREE_CODE (type) != TREE_CODE (otype))
3866 warning ("cast does not match function type");
3868 if (TREE_CODE (type) == POINTER_TYPE
3869 && TREE_CODE (otype) == INTEGER_TYPE
3870 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3871 /* Don't warn about converting any constant. */
3872 && !TREE_CONSTANT (value))
3873 warning ("cast to pointer from integer of different size");
3876 value = convert (type, value);
3878 /* Ignore any integer overflow caused by the cast. */
3879 if (TREE_CODE (value) == INTEGER_CST)
3881 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3882 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3886 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3887 if (pedantic && TREE_CODE (value) == INTEGER_CST
3888 && TREE_CODE (expr) == INTEGER_CST
3889 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3890 value = non_lvalue (value);
3892 /* If pedantic, don't let a cast be an lvalue. */
3893 if (value == expr && pedantic)
3894 value = non_lvalue (value);
3899 /* Interpret a cast of expression EXPR to type TYPE. */
3901 c_cast_expr (type, expr)
3904 int saved_wsp = warn_strict_prototypes;
3906 /* This avoids warnings about unprototyped casts on
3907 integers. E.g. "#define SIG_DFL (void(*)())0". */
3908 if (TREE_CODE (expr) == INTEGER_CST)
3909 warn_strict_prototypes = 0;
3910 type = groktypename (type);
3911 warn_strict_prototypes = saved_wsp;
3913 return build_c_cast (type, expr);
3917 /* Build an assignment expression of lvalue LHS from value RHS.
3918 MODIFYCODE is the code for a binary operator that we use
3919 to combine the old value of LHS with RHS to get the new value.
3920 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3923 build_modify_expr (lhs, modifycode, rhs)
3925 enum tree_code modifycode;
3929 tree lhstype = TREE_TYPE (lhs);
3930 tree olhstype = lhstype;
3932 /* Types that aren't fully specified cannot be used in assignments. */
3933 lhs = require_complete_type (lhs);
3935 /* Avoid duplicate error messages from operands that had errors. */
3936 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3937 return error_mark_node;
3939 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3940 /* Do not use STRIP_NOPS here. We do not want an enumerator
3941 whose value is 0 to count as a null pointer constant. */
3942 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3943 rhs = TREE_OPERAND (rhs, 0);
3947 /* Handle control structure constructs used as "lvalues". */
3949 switch (TREE_CODE (lhs))
3951 /* Handle (a, b) used as an "lvalue". */
3953 pedantic_lvalue_warning (COMPOUND_EXPR);
3954 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3955 if (TREE_CODE (newrhs) == ERROR_MARK)
3956 return error_mark_node;
3957 return build (COMPOUND_EXPR, lhstype,
3958 TREE_OPERAND (lhs, 0), newrhs);
3960 /* Handle (a ? b : c) used as an "lvalue". */
3962 pedantic_lvalue_warning (COND_EXPR);
3963 rhs = save_expr (rhs);
3965 /* Produce (a ? (b = rhs) : (c = rhs))
3966 except that the RHS goes through a save-expr
3967 so the code to compute it is only emitted once. */
3969 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3970 build_modify_expr (TREE_OPERAND (lhs, 1),
3972 build_modify_expr (TREE_OPERAND (lhs, 2),
3974 if (TREE_CODE (cond) == ERROR_MARK)
3976 /* Make sure the code to compute the rhs comes out
3977 before the split. */
3978 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3979 /* But cast it to void to avoid an "unused" error. */
3980 convert (void_type_node, rhs), cond);
3986 /* If a binary op has been requested, combine the old LHS value with the RHS
3987 producing the value we should actually store into the LHS. */
3989 if (modifycode != NOP_EXPR)
3991 lhs = stabilize_reference (lhs);
3992 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3995 /* Handle a cast used as an "lvalue".
3996 We have already performed any binary operator using the value as cast.
3997 Now convert the result to the cast type of the lhs,
3998 and then true type of the lhs and store it there;
3999 then convert result back to the cast type to be the value
4000 of the assignment. */
4002 switch (TREE_CODE (lhs))
4007 case FIX_TRUNC_EXPR:
4008 case FIX_FLOOR_EXPR:
4009 case FIX_ROUND_EXPR:
4011 newrhs = default_function_array_conversion (newrhs);
4013 tree inner_lhs = TREE_OPERAND (lhs, 0);
4015 result = build_modify_expr (inner_lhs, NOP_EXPR,
4016 convert (TREE_TYPE (inner_lhs),
4017 convert (lhstype, newrhs)));
4018 if (TREE_CODE (result) == ERROR_MARK)
4020 pedantic_lvalue_warning (CONVERT_EXPR);
4021 return convert (TREE_TYPE (lhs), result);
4028 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
4029 Reject anything strange now. */
4031 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
4032 return error_mark_node;
4034 /* Warn about storing in something that is `const'. */
4036 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
4037 || ((TREE_CODE (lhstype) == RECORD_TYPE
4038 || TREE_CODE (lhstype) == UNION_TYPE)
4039 && C_TYPE_FIELDS_READONLY (lhstype)))
4040 readonly_warning (lhs, "assignment");
4042 /* If storing into a structure or union member,
4043 it has probably been given type `int'.
4044 Compute the type that would go with
4045 the actual amount of storage the member occupies. */
4047 if (TREE_CODE (lhs) == COMPONENT_REF
4048 && (TREE_CODE (lhstype) == INTEGER_TYPE
4049 || TREE_CODE (lhstype) == BOOLEAN_TYPE
4050 || TREE_CODE (lhstype) == REAL_TYPE
4051 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
4052 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
4054 /* If storing in a field that is in actuality a short or narrower than one,
4055 we must store in the field in its actual type. */
4057 if (lhstype != TREE_TYPE (lhs))
4059 lhs = copy_node (lhs);
4060 TREE_TYPE (lhs) = lhstype;
4063 /* Convert new value to destination type. */
4065 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
4066 NULL_TREE, NULL_TREE, 0);
4067 if (TREE_CODE (newrhs) == ERROR_MARK)
4068 return error_mark_node;
4072 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
4073 TREE_SIDE_EFFECTS (result) = 1;
4075 /* If we got the LHS in a different type for storing in,
4076 convert the result back to the nominal type of LHS
4077 so that the value we return always has the same type
4078 as the LHS argument. */
4080 if (olhstype == TREE_TYPE (result))
4082 return convert_for_assignment (olhstype, result, _("assignment"),
4083 NULL_TREE, NULL_TREE, 0);
4086 /* Convert value RHS to type TYPE as preparation for an assignment
4087 to an lvalue of type TYPE.
4088 The real work of conversion is done by `convert'.
4089 The purpose of this function is to generate error messages
4090 for assignments that are not allowed in C.
4091 ERRTYPE is a string to use in error messages:
4092 "assignment", "return", etc. If it is null, this is parameter passing
4093 for a function call (and different error messages are output).
4095 FUNNAME is the name of the function being called,
4096 as an IDENTIFIER_NODE, or null.
4097 PARMNUM is the number of the argument, for printing in error messages. */
4100 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
4102 const char *errtype;
4103 tree fundecl, funname;
4106 enum tree_code codel = TREE_CODE (type);
4108 enum tree_code coder;
4110 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4111 /* Do not use STRIP_NOPS here. We do not want an enumerator
4112 whose value is 0 to count as a null pointer constant. */
4113 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
4114 rhs = TREE_OPERAND (rhs, 0);
4116 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
4117 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4118 rhs = default_conversion (rhs);
4119 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4120 rhs = decl_constant_value_for_broken_optimization (rhs);
4122 rhstype = TREE_TYPE (rhs);
4123 coder = TREE_CODE (rhstype);
4125 if (coder == ERROR_MARK)
4126 return error_mark_node;
4128 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4130 overflow_warning (rhs);
4131 /* Check for Objective-C protocols. This will issue a warning if
4132 there are protocol violations. No need to use the return value. */
4133 maybe_objc_comptypes (type, rhstype, 0);
4137 if (coder == VOID_TYPE)
4139 error ("void value not ignored as it ought to be");
4140 return error_mark_node;
4142 /* A type converts to a reference to it.
4143 This code doesn't fully support references, it's just for the
4144 special case of va_start and va_copy. */
4145 if (codel == REFERENCE_TYPE
4146 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4148 if (mark_addressable (rhs) == 0)
4149 return error_mark_node;
4150 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4152 /* We already know that these two types are compatible, but they
4153 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4154 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4155 likely to be va_list, a typedef to __builtin_va_list, which
4156 is different enough that it will cause problems later. */
4157 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4158 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4160 rhs = build1 (NOP_EXPR, type, rhs);
4163 /* Arithmetic types all interconvert, and enum is treated like int. */
4164 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4165 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4166 || codel == BOOLEAN_TYPE)
4167 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4168 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4169 || coder == BOOLEAN_TYPE))
4170 return convert_and_check (type, rhs);
4172 /* Conversion to a transparent union from its member types.
4173 This applies only to function arguments. */
4174 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4177 tree marginal_memb_type = 0;
4179 for (memb_types = TYPE_FIELDS (type); memb_types;
4180 memb_types = TREE_CHAIN (memb_types))
4182 tree memb_type = TREE_TYPE (memb_types);
4184 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4185 TYPE_MAIN_VARIANT (rhstype)))
4188 if (TREE_CODE (memb_type) != POINTER_TYPE)
4191 if (coder == POINTER_TYPE)
4193 tree ttl = TREE_TYPE (memb_type);
4194 tree ttr = TREE_TYPE (rhstype);
4196 /* Any non-function converts to a [const][volatile] void *
4197 and vice versa; otherwise, targets must be the same.
4198 Meanwhile, the lhs target must have all the qualifiers of
4200 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4201 || comp_target_types (memb_type, rhstype))
4203 /* If this type won't generate any warnings, use it. */
4204 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4205 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4206 && TREE_CODE (ttl) == FUNCTION_TYPE)
4207 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4208 == TYPE_QUALS (ttr))
4209 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4210 == TYPE_QUALS (ttl))))
4213 /* Keep looking for a better type, but remember this one. */
4214 if (! marginal_memb_type)
4215 marginal_memb_type = memb_type;
4219 /* Can convert integer zero to any pointer type. */
4220 if (integer_zerop (rhs)
4221 || (TREE_CODE (rhs) == NOP_EXPR
4222 && integer_zerop (TREE_OPERAND (rhs, 0))))
4224 rhs = null_pointer_node;
4229 if (memb_types || marginal_memb_type)
4233 /* We have only a marginally acceptable member type;
4234 it needs a warning. */
4235 tree ttl = TREE_TYPE (marginal_memb_type);
4236 tree ttr = TREE_TYPE (rhstype);
4238 /* Const and volatile mean something different for function
4239 types, so the usual warnings are not appropriate. */
4240 if (TREE_CODE (ttr) == FUNCTION_TYPE
4241 && TREE_CODE (ttl) == FUNCTION_TYPE)
4243 /* Because const and volatile on functions are
4244 restrictions that say the function will not do
4245 certain things, it is okay to use a const or volatile
4246 function where an ordinary one is wanted, but not
4248 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4249 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4250 errtype, funname, parmnum);
4252 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4253 warn_for_assignment ("%s discards qualifiers from pointer target type",
4258 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4259 pedwarn ("ISO C prohibits argument conversion to union type");
4261 return build1 (NOP_EXPR, type, rhs);
4265 /* Conversions among pointers */
4266 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4267 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4269 tree ttl = TREE_TYPE (type);
4270 tree ttr = TREE_TYPE (rhstype);
4272 /* Any non-function converts to a [const][volatile] void *
4273 and vice versa; otherwise, targets must be the same.
4274 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4275 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4276 || comp_target_types (type, rhstype)
4277 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4278 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4281 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4284 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4285 which are not ANSI null ptr constants. */
4286 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4287 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4288 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4289 errtype, funname, parmnum);
4290 /* Const and volatile mean something different for function types,
4291 so the usual warnings are not appropriate. */
4292 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4293 && TREE_CODE (ttl) != FUNCTION_TYPE)
4295 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4296 warn_for_assignment ("%s discards qualifiers from pointer target type",
4297 errtype, funname, parmnum);
4298 /* If this is not a case of ignoring a mismatch in signedness,
4300 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4301 || comp_target_types (type, rhstype))
4303 /* If there is a mismatch, do warn. */
4305 warn_for_assignment ("pointer targets in %s differ in signedness",
4306 errtype, funname, parmnum);
4308 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4309 && TREE_CODE (ttr) == FUNCTION_TYPE)
4311 /* Because const and volatile on functions are restrictions
4312 that say the function will not do certain things,
4313 it is okay to use a const or volatile function
4314 where an ordinary one is wanted, but not vice-versa. */
4315 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4316 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4317 errtype, funname, parmnum);
4321 warn_for_assignment ("%s from incompatible pointer type",
4322 errtype, funname, parmnum);
4323 return convert (type, rhs);
4325 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4327 /* An explicit constant 0 can convert to a pointer,
4328 or one that results from arithmetic, even including
4329 a cast to integer type. */
4330 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4332 ! (TREE_CODE (rhs) == NOP_EXPR
4333 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4334 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4335 && integer_zerop (TREE_OPERAND (rhs, 0))))
4337 warn_for_assignment ("%s makes pointer from integer without a cast",
4338 errtype, funname, parmnum);
4339 return convert (type, rhs);
4341 return null_pointer_node;
4343 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4345 warn_for_assignment ("%s makes integer from pointer without a cast",
4346 errtype, funname, parmnum);
4347 return convert (type, rhs);
4349 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4350 return convert (type, rhs);
4356 tree selector = maybe_building_objc_message_expr ();
4358 if (selector && parmnum > 2)
4359 error ("incompatible type for argument %d of `%s'",
4360 parmnum - 2, IDENTIFIER_POINTER (selector));
4362 error ("incompatible type for argument %d of `%s'",
4363 parmnum, IDENTIFIER_POINTER (funname));
4366 error ("incompatible type for argument %d of indirect function call",
4370 error ("incompatible types in %s", errtype);
4372 return error_mark_node;
4375 /* Print a warning using MSGID.
4376 It gets OPNAME as its one parameter.
4377 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4378 FUNCTION and ARGNUM are handled specially if we are building an
4379 Objective-C selector. */
4382 warn_for_assignment (msgid, opname, function, argnum)
4390 tree selector = maybe_building_objc_message_expr ();
4393 if (selector && argnum > 2)
4395 function = selector;
4400 /* Function name is known; supply it. */
4401 const char *const argstring = _("passing arg %d of `%s'");
4402 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4403 + strlen (argstring) + 1 + 25
4405 sprintf (new_opname, argstring, argnum,
4406 IDENTIFIER_POINTER (function));
4410 /* Function name unknown (call through ptr); just give arg number. */
4411 const char *const argnofun = _("passing arg %d of pointer to function");
4412 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4413 sprintf (new_opname, argnofun, argnum);
4415 opname = new_opname;
4417 pedwarn (msgid, opname);
4420 /* If VALUE is a compound expr all of whose expressions are constant, then
4421 return its value. Otherwise, return error_mark_node.
4423 This is for handling COMPOUND_EXPRs as initializer elements
4424 which is allowed with a warning when -pedantic is specified. */
4427 valid_compound_expr_initializer (value, endtype)
4431 if (TREE_CODE (value) == COMPOUND_EXPR)
4433 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4435 return error_mark_node;
4436 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4439 else if (! TREE_CONSTANT (value)
4440 && ! initializer_constant_valid_p (value, endtype))
4441 return error_mark_node;
4446 /* Perform appropriate conversions on the initial value of a variable,
4447 store it in the declaration DECL,
4448 and print any error messages that are appropriate.
4449 If the init is invalid, store an ERROR_MARK. */
4452 store_init_value (decl, init)
4457 /* If variable's type was invalidly declared, just ignore it. */
4459 type = TREE_TYPE (decl);
4460 if (TREE_CODE (type) == ERROR_MARK)
4463 /* Digest the specified initializer into an expression. */
4465 value = digest_init (type, init, TREE_STATIC (decl),
4466 TREE_STATIC (decl) || (pedantic && !flag_isoc99));
4468 /* Store the expression if valid; else report error. */
4471 /* Note that this is the only place we can detect the error
4472 in a case such as struct foo bar = (struct foo) { x, y };
4473 where there is one initial value which is a constructor expression. */
4474 if (value == error_mark_node)
4476 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4478 error ("initializer for static variable is not constant");
4479 value = error_mark_node;
4481 else if (TREE_STATIC (decl)
4482 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4484 error ("initializer for static variable uses complicated arithmetic");
4485 value = error_mark_node;
4489 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4491 if (! TREE_CONSTANT (value))
4492 pedwarn ("aggregate initializer is not constant");
4493 else if (! TREE_STATIC (value))
4494 pedwarn ("aggregate initializer uses complicated arithmetic");
4499 if (warn_traditional && !in_system_header
4500 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4501 warning ("traditional C rejects automatic aggregate initialization");
4503 DECL_INITIAL (decl) = value;
4505 /* ANSI wants warnings about out-of-range constant initializers. */
4506 STRIP_TYPE_NOPS (value);
4507 constant_expression_warning (value);
4509 /* Check if we need to set array size from compound literal size. */
4510 if (TREE_CODE (type) == ARRAY_TYPE
4511 && TYPE_DOMAIN (type) == 0
4512 && value != error_mark_node)
4514 tree inside_init = init;
4516 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4517 inside_init = TREE_OPERAND (init, 0);
4518 inside_init = fold (inside_init);
4520 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4522 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4524 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4526 /* For int foo[] = (int [3]){1}; we need to set array size
4527 now since later on array initializer will be just the
4528 brace enclosed list of the compound literal. */
4529 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4531 layout_decl (decl, 0);
4537 /* Methods for storing and printing names for error messages. */
4539 /* Implement a spelling stack that allows components of a name to be pushed
4540 and popped. Each element on the stack is this structure. */
4552 #define SPELLING_STRING 1
4553 #define SPELLING_MEMBER 2
4554 #define SPELLING_BOUNDS 3
4556 static struct spelling *spelling; /* Next stack element (unused). */
4557 static struct spelling *spelling_base; /* Spelling stack base. */
4558 static int spelling_size; /* Size of the spelling stack. */
4560 /* Macros to save and restore the spelling stack around push_... functions.
4561 Alternative to SAVE_SPELLING_STACK. */
4563 #define SPELLING_DEPTH() (spelling - spelling_base)
4564 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4566 /* Save and restore the spelling stack around arbitrary C code. */
4568 #define SAVE_SPELLING_DEPTH(code) \
4570 int __depth = SPELLING_DEPTH (); \
4572 RESTORE_SPELLING_DEPTH (__depth); \
4575 /* Push an element on the spelling stack with type KIND and assign VALUE
4578 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4580 int depth = SPELLING_DEPTH (); \
4582 if (depth >= spelling_size) \
4584 spelling_size += 10; \
4585 if (spelling_base == 0) \
4587 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4590 = (struct spelling *) xrealloc (spelling_base, \
4591 spelling_size * sizeof (struct spelling)); \
4592 RESTORE_SPELLING_DEPTH (depth); \
4595 spelling->kind = (KIND); \
4596 spelling->MEMBER = (VALUE); \
4600 /* Push STRING on the stack. Printed literally. */
4603 push_string (string)
4606 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4609 /* Push a member name on the stack. Printed as '.' STRING. */
4612 push_member_name (decl)
4616 const char *const string
4617 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4618 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4621 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4624 push_array_bounds (bounds)
4627 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4630 /* Compute the maximum size in bytes of the printed spelling. */
4638 for (p = spelling_base; p < spelling; p++)
4640 if (p->kind == SPELLING_BOUNDS)
4643 size += strlen (p->u.s) + 1;
4649 /* Print the spelling to BUFFER and return it. */
4652 print_spelling (buffer)
4658 for (p = spelling_base; p < spelling; p++)
4659 if (p->kind == SPELLING_BOUNDS)
4661 sprintf (d, "[%d]", p->u.i);
4667 if (p->kind == SPELLING_MEMBER)
4669 for (s = p->u.s; (*d = *s++); d++)
4676 /* Issue an error message for a bad initializer component.
4677 MSGID identifies the message.
4678 The component name is taken from the spelling stack. */
4686 error ("%s", _(msgid));
4687 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4689 error ("(near initialization for `%s')", ofwhat);
4692 /* Issue a pedantic warning for a bad initializer component.
4693 MSGID identifies the message.
4694 The component name is taken from the spelling stack. */
4697 pedwarn_init (msgid)
4702 pedwarn ("%s", _(msgid));
4703 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4705 pedwarn ("(near initialization for `%s')", ofwhat);
4708 /* Issue a warning for a bad initializer component.
4709 MSGID identifies the message.
4710 The component name is taken from the spelling stack. */
4713 warning_init (msgid)
4718 warning ("%s", _(msgid));
4719 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4721 warning ("(near initialization for `%s')", ofwhat);
4724 /* Digest the parser output INIT as an initializer for type TYPE.
4725 Return a C expression of type TYPE to represent the initial value.
4727 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4728 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4729 applies only to elements of constructors. */
4732 digest_init (type, init, require_constant, constructor_constant)
4734 int require_constant, constructor_constant;
4736 enum tree_code code = TREE_CODE (type);
4737 tree inside_init = init;
4739 if (type == error_mark_node
4740 || init == error_mark_node
4741 || TREE_TYPE (init) == error_mark_node)
4742 return error_mark_node;
4744 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4745 /* Do not use STRIP_NOPS here. We do not want an enumerator
4746 whose value is 0 to count as a null pointer constant. */
4747 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4748 inside_init = TREE_OPERAND (init, 0);
4750 inside_init = fold (inside_init);
4752 /* Initialization of an array of chars from a string constant
4753 optionally enclosed in braces. */
4755 if (code == ARRAY_TYPE)
4757 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4758 if ((typ1 == char_type_node
4759 || typ1 == signed_char_type_node
4760 || typ1 == unsigned_char_type_node
4761 || typ1 == unsigned_wchar_type_node
4762 || typ1 == signed_wchar_type_node)
4763 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4765 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4766 TYPE_MAIN_VARIANT (type)))
4769 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4771 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4773 error_init ("char-array initialized from wide string");
4774 return error_mark_node;
4776 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4778 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4780 error_init ("int-array initialized from non-wide string");
4781 return error_mark_node;
4784 TREE_TYPE (inside_init) = type;
4785 if (TYPE_DOMAIN (type) != 0
4786 && TYPE_SIZE (type) != 0
4787 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4788 /* Subtract 1 (or sizeof (wchar_t))
4789 because it's ok to ignore the terminating null char
4790 that is counted in the length of the constant. */
4791 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4792 TREE_STRING_LENGTH (inside_init)
4793 - ((TYPE_PRECISION (typ1)
4794 != TYPE_PRECISION (char_type_node))
4795 ? (TYPE_PRECISION (wchar_type_node)
4798 pedwarn_init ("initializer-string for array of chars is too long");
4804 /* Any type can be initialized
4805 from an expression of the same type, optionally with braces. */
4807 if (inside_init && TREE_TYPE (inside_init) != 0
4808 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4809 TYPE_MAIN_VARIANT (type))
4810 || (code == ARRAY_TYPE
4811 && comptypes (TREE_TYPE (inside_init), type))
4812 || (code == POINTER_TYPE
4813 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4814 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4815 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4816 TREE_TYPE (type)))))
4818 if (code == POINTER_TYPE)
4819 inside_init = default_function_array_conversion (inside_init);
4821 if (require_constant && !flag_isoc99
4822 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4824 /* As an extension, allow initializing objects with static storage
4825 duration with compound literals (which are then treated just as
4826 the brace enclosed list they contain). */
4827 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4828 inside_init = DECL_INITIAL (decl);
4831 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4832 && TREE_CODE (inside_init) != CONSTRUCTOR)
4834 error_init ("array initialized from non-constant array expression");
4835 return error_mark_node;
4838 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4839 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4841 /* Compound expressions can only occur here if -pedantic or
4842 -pedantic-errors is specified. In the later case, we always want
4843 an error. In the former case, we simply want a warning. */
4844 if (require_constant && pedantic
4845 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4848 = valid_compound_expr_initializer (inside_init,
4849 TREE_TYPE (inside_init));
4850 if (inside_init == error_mark_node)
4851 error_init ("initializer element is not constant");
4853 pedwarn_init ("initializer element is not constant");
4854 if (flag_pedantic_errors)
4855 inside_init = error_mark_node;
4857 else if (require_constant
4858 && (!TREE_CONSTANT (inside_init)
4859 /* This test catches things like `7 / 0' which
4860 result in an expression for which TREE_CONSTANT
4861 is true, but which is not actually something
4862 that is a legal constant. We really should not
4863 be using this function, because it is a part of
4864 the back-end. Instead, the expression should
4865 already have been turned into ERROR_MARK_NODE. */
4866 || !initializer_constant_valid_p (inside_init,
4867 TREE_TYPE (inside_init))))
4869 error_init ("initializer element is not constant");
4870 inside_init = error_mark_node;
4876 /* Handle scalar types, including conversions. */
4878 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4879 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4881 /* Note that convert_for_assignment calls default_conversion
4882 for arrays and functions. We must not call it in the
4883 case where inside_init is a null pointer constant. */
4885 = convert_for_assignment (type, init, _("initialization"),
4886 NULL_TREE, NULL_TREE, 0);
4888 if (require_constant && ! TREE_CONSTANT (inside_init))
4890 error_init ("initializer element is not constant");
4891 inside_init = error_mark_node;
4893 else if (require_constant
4894 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4896 error_init ("initializer element is not computable at load time");
4897 inside_init = error_mark_node;
4903 /* Come here only for records and arrays. */
4905 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4907 error_init ("variable-sized object may not be initialized");
4908 return error_mark_node;
4911 /* Traditionally, you can write struct foo x = 0;
4912 and it initializes the first element of x to 0. */
4913 if (flag_traditional)
4915 tree top = 0, prev = 0, otype = type;
4916 while (TREE_CODE (type) == RECORD_TYPE
4917 || TREE_CODE (type) == ARRAY_TYPE
4918 || TREE_CODE (type) == QUAL_UNION_TYPE
4919 || TREE_CODE (type) == UNION_TYPE)
4921 tree temp = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
4925 TREE_OPERAND (prev, 1) = build_tree_list (NULL_TREE, temp);
4927 if (TREE_CODE (type) == ARRAY_TYPE)
4928 type = TREE_TYPE (type);
4929 else if (TYPE_FIELDS (type))
4930 type = TREE_TYPE (TYPE_FIELDS (type));
4933 error_init ("invalid initializer");
4934 return error_mark_node;
4940 TREE_OPERAND (prev, 1)
4941 = build_tree_list (NULL_TREE,
4942 digest_init (type, init, require_constant,
4943 constructor_constant));
4947 return error_mark_node;
4949 error_init ("invalid initializer");
4950 return error_mark_node;
4953 /* Handle initializers that use braces. */
4955 /* Type of object we are accumulating a constructor for.
4956 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4957 static tree constructor_type;
4959 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4961 static tree constructor_fields;
4963 /* For an ARRAY_TYPE, this is the specified index
4964 at which to store the next element we get. */
4965 static tree constructor_index;
4967 /* For an ARRAY_TYPE, this is the maximum index. */
4968 static tree constructor_max_index;
4970 /* For a RECORD_TYPE, this is the first field not yet written out. */
4971 static tree constructor_unfilled_fields;
4973 /* For an ARRAY_TYPE, this is the index of the first element
4974 not yet written out. */
4975 static tree constructor_unfilled_index;
4977 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4978 This is so we can generate gaps between fields, when appropriate. */
4979 static tree constructor_bit_index;
4981 /* If we are saving up the elements rather than allocating them,
4982 this is the list of elements so far (in reverse order,
4983 most recent first). */
4984 static tree constructor_elements;
4986 /* 1 if constructor should be incrementally stored into a constructor chain,
4987 0 if all the elements should be kept in AVL tree. */
4988 static int constructor_incremental;
4990 /* 1 if so far this constructor's elements are all compile-time constants. */
4991 static int constructor_constant;
4993 /* 1 if so far this constructor's elements are all valid address constants. */
4994 static int constructor_simple;
4996 /* 1 if this constructor is erroneous so far. */
4997 static int constructor_erroneous;
4999 /* 1 if have called defer_addressed_constants. */
5000 static int constructor_subconstants_deferred;
5002 /* Structure for managing pending initializer elements, organized as an
5007 struct init_node *left, *right;
5008 struct init_node *parent;
5014 /* Tree of pending elements at this constructor level.
5015 These are elements encountered out of order
5016 which belong at places we haven't reached yet in actually
5018 Will never hold tree nodes across GC runs. */
5019 static struct init_node *constructor_pending_elts;
5021 /* The SPELLING_DEPTH of this constructor. */
5022 static int constructor_depth;
5024 /* 0 if implicitly pushing constructor levels is allowed. */
5025 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
5027 static int require_constant_value;
5028 static int require_constant_elements;
5030 /* DECL node for which an initializer is being read.
5031 0 means we are reading a constructor expression
5032 such as (struct foo) {...}. */
5033 static tree constructor_decl;
5035 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
5036 static const char *constructor_asmspec;
5038 /* Nonzero if this is an initializer for a top-level decl. */
5039 static int constructor_top_level;
5041 /* Nonzero if there were any member designators in this initializer. */
5042 static int constructor_designated;
5044 /* Nesting depth of designator list. */
5045 static int designator_depth;
5047 /* Nonzero if there were diagnosed errors in this designator list. */
5048 static int designator_errorneous;
5051 /* This stack has a level for each implicit or explicit level of
5052 structuring in the initializer, including the outermost one. It
5053 saves the values of most of the variables above. */
5055 struct constructor_range_stack;
5057 struct constructor_stack
5059 struct constructor_stack *next;
5064 tree unfilled_index;
5065 tree unfilled_fields;
5068 struct init_node *pending_elts;
5071 /* If nonzero, this value should replace the entire
5072 constructor at this level. */
5073 tree replacement_value;
5074 struct constructor_range_stack *range_stack;
5084 struct constructor_stack *constructor_stack;
5086 /* This stack represents designators from some range designator up to
5087 the last designator in the list. */
5089 struct constructor_range_stack
5091 struct constructor_range_stack *next, *prev;
5092 struct constructor_stack *stack;
5099 struct constructor_range_stack *constructor_range_stack;
5101 /* This stack records separate initializers that are nested.
5102 Nested initializers can't happen in ANSI C, but GNU C allows them
5103 in cases like { ... (struct foo) { ... } ... }. */
5105 struct initializer_stack
5107 struct initializer_stack *next;
5109 const char *asmspec;
5110 struct constructor_stack *constructor_stack;
5111 struct constructor_range_stack *constructor_range_stack;
5113 struct spelling *spelling;
5114 struct spelling *spelling_base;
5117 char require_constant_value;
5118 char require_constant_elements;
5122 struct initializer_stack *initializer_stack;
5124 /* Prepare to parse and output the initializer for variable DECL. */
5127 start_init (decl, asmspec_tree, top_level)
5133 struct initializer_stack *p
5134 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
5135 const char *asmspec = 0;
5138 asmspec = TREE_STRING_POINTER (asmspec_tree);
5140 p->decl = constructor_decl;
5141 p->asmspec = constructor_asmspec;
5142 p->require_constant_value = require_constant_value;
5143 p->require_constant_elements = require_constant_elements;
5144 p->constructor_stack = constructor_stack;
5145 p->constructor_range_stack = constructor_range_stack;
5146 p->elements = constructor_elements;
5147 p->spelling = spelling;
5148 p->spelling_base = spelling_base;
5149 p->spelling_size = spelling_size;
5150 p->deferred = constructor_subconstants_deferred;
5151 p->top_level = constructor_top_level;
5152 p->next = initializer_stack;
5153 initializer_stack = p;
5155 constructor_decl = decl;
5156 constructor_asmspec = asmspec;
5157 constructor_subconstants_deferred = 0;
5158 constructor_designated = 0;
5159 constructor_top_level = top_level;
5163 require_constant_value = TREE_STATIC (decl);
5164 require_constant_elements
5165 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5166 /* For a scalar, you can always use any value to initialize,
5167 even within braces. */
5168 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5169 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5170 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5171 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5172 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5176 require_constant_value = 0;
5177 require_constant_elements = 0;
5178 locus = "(anonymous)";
5181 constructor_stack = 0;
5182 constructor_range_stack = 0;
5184 missing_braces_mentioned = 0;
5188 RESTORE_SPELLING_DEPTH (0);
5191 push_string (locus);
5197 struct initializer_stack *p = initializer_stack;
5199 /* Output subconstants (string constants, usually)
5200 that were referenced within this initializer and saved up.
5201 Must do this if and only if we called defer_addressed_constants. */
5202 if (constructor_subconstants_deferred)
5203 output_deferred_addressed_constants ();
5205 /* Free the whole constructor stack of this initializer. */
5206 while (constructor_stack)
5208 struct constructor_stack *q = constructor_stack;
5209 constructor_stack = q->next;
5213 if (constructor_range_stack)
5216 /* Pop back to the data of the outer initializer (if any). */
5217 constructor_decl = p->decl;
5218 constructor_asmspec = p->asmspec;
5219 require_constant_value = p->require_constant_value;
5220 require_constant_elements = p->require_constant_elements;
5221 constructor_stack = p->constructor_stack;
5222 constructor_range_stack = p->constructor_range_stack;
5223 constructor_elements = p->elements;
5224 spelling = p->spelling;
5225 spelling_base = p->spelling_base;
5226 spelling_size = p->spelling_size;
5227 constructor_subconstants_deferred = p->deferred;
5228 constructor_top_level = p->top_level;
5229 initializer_stack = p->next;
5233 /* Call here when we see the initializer is surrounded by braces.
5234 This is instead of a call to push_init_level;
5235 it is matched by a call to pop_init_level.
5237 TYPE is the type to initialize, for a constructor expression.
5238 For an initializer for a decl, TYPE is zero. */
5241 really_start_incremental_init (type)
5244 struct constructor_stack *p
5245 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5248 type = TREE_TYPE (constructor_decl);
5250 p->type = constructor_type;
5251 p->fields = constructor_fields;
5252 p->index = constructor_index;
5253 p->max_index = constructor_max_index;
5254 p->unfilled_index = constructor_unfilled_index;
5255 p->unfilled_fields = constructor_unfilled_fields;
5256 p->bit_index = constructor_bit_index;
5257 p->elements = constructor_elements;
5258 p->constant = constructor_constant;
5259 p->simple = constructor_simple;
5260 p->erroneous = constructor_erroneous;
5261 p->pending_elts = constructor_pending_elts;
5262 p->depth = constructor_depth;
5263 p->replacement_value = 0;
5267 p->incremental = constructor_incremental;
5268 p->designated = constructor_designated;
5270 constructor_stack = p;
5272 constructor_constant = 1;
5273 constructor_simple = 1;
5274 constructor_depth = SPELLING_DEPTH ();
5275 constructor_elements = 0;
5276 constructor_pending_elts = 0;
5277 constructor_type = type;
5278 constructor_incremental = 1;
5279 constructor_designated = 0;
5280 designator_depth = 0;
5281 designator_errorneous = 0;
5283 if (TREE_CODE (constructor_type) == RECORD_TYPE
5284 || TREE_CODE (constructor_type) == UNION_TYPE)
5286 constructor_fields = TYPE_FIELDS (constructor_type);
5287 /* Skip any nameless bit fields at the beginning. */
5288 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5289 && DECL_NAME (constructor_fields) == 0)
5290 constructor_fields = TREE_CHAIN (constructor_fields);
5292 constructor_unfilled_fields = constructor_fields;
5293 constructor_bit_index = bitsize_zero_node;
5295 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5297 if (TYPE_DOMAIN (constructor_type))
5299 constructor_max_index
5300 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5302 /* Detect non-empty initializations of zero-length arrays. */
5303 if (constructor_max_index == NULL_TREE
5304 && TYPE_SIZE (constructor_type))
5305 constructor_max_index = build_int_2 (-1, -1);
5307 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5308 to initialize VLAs will cause an proper error; avoid tree
5309 checking errors as well by setting a safe value. */
5310 if (constructor_max_index
5311 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5312 constructor_max_index = build_int_2 (-1, -1);
5315 = convert (bitsizetype,
5316 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5319 constructor_index = bitsize_zero_node;
5321 constructor_unfilled_index = constructor_index;
5325 /* Handle the case of int x = {5}; */
5326 constructor_fields = constructor_type;
5327 constructor_unfilled_fields = constructor_type;
5331 /* Push down into a subobject, for initialization.
5332 If this is for an explicit set of braces, IMPLICIT is 0.
5333 If it is because the next element belongs at a lower level,
5334 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5337 push_init_level (implicit)
5340 struct constructor_stack *p;
5341 tree value = NULL_TREE;
5343 /* If we've exhausted any levels that didn't have braces,
5345 while (constructor_stack->implicit)
5347 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5348 || TREE_CODE (constructor_type) == UNION_TYPE)
5349 && constructor_fields == 0)
5350 process_init_element (pop_init_level (1));
5351 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5352 && tree_int_cst_lt (constructor_max_index, constructor_index))
5353 process_init_element (pop_init_level (1));
5358 /* Unless this is an explicit brace, we need to preserve previous
5362 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5363 || TREE_CODE (constructor_type) == UNION_TYPE)
5364 && constructor_fields)
5365 value = find_init_member (constructor_fields);
5366 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5367 value = find_init_member (constructor_index);
5370 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5371 p->type = constructor_type;
5372 p->fields = constructor_fields;
5373 p->index = constructor_index;
5374 p->max_index = constructor_max_index;
5375 p->unfilled_index = constructor_unfilled_index;
5376 p->unfilled_fields = constructor_unfilled_fields;
5377 p->bit_index = constructor_bit_index;
5378 p->elements = constructor_elements;
5379 p->constant = constructor_constant;
5380 p->simple = constructor_simple;
5381 p->erroneous = constructor_erroneous;
5382 p->pending_elts = constructor_pending_elts;
5383 p->depth = constructor_depth;
5384 p->replacement_value = 0;
5385 p->implicit = implicit;
5387 p->incremental = constructor_incremental;
5388 p->designated = constructor_designated;
5389 p->next = constructor_stack;
5391 constructor_stack = p;
5393 constructor_constant = 1;
5394 constructor_simple = 1;
5395 constructor_depth = SPELLING_DEPTH ();
5396 constructor_elements = 0;
5397 constructor_incremental = 1;
5398 constructor_designated = 0;
5399 constructor_pending_elts = 0;
5402 p->range_stack = constructor_range_stack;
5403 constructor_range_stack = 0;
5404 designator_depth = 0;
5405 designator_errorneous = 0;
5408 /* Don't die if an entire brace-pair level is superfluous
5409 in the containing level. */
5410 if (constructor_type == 0)
5412 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5413 || TREE_CODE (constructor_type) == UNION_TYPE)
5415 /* Don't die if there are extra init elts at the end. */
5416 if (constructor_fields == 0)
5417 constructor_type = 0;
5420 constructor_type = TREE_TYPE (constructor_fields);
5421 push_member_name (constructor_fields);
5422 constructor_depth++;
5425 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5427 constructor_type = TREE_TYPE (constructor_type);
5428 push_array_bounds (tree_low_cst (constructor_index, 0));
5429 constructor_depth++;
5432 if (constructor_type == 0)
5434 error_init ("extra brace group at end of initializer");
5435 constructor_fields = 0;
5436 constructor_unfilled_fields = 0;
5440 if (value && TREE_CODE (value) == CONSTRUCTOR)
5442 constructor_constant = TREE_CONSTANT (value);
5443 constructor_simple = TREE_STATIC (value);
5444 constructor_elements = TREE_OPERAND (value, 1);
5445 if (constructor_elements
5446 && (TREE_CODE (constructor_type) == RECORD_TYPE
5447 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5448 set_nonincremental_init ();
5451 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5453 missing_braces_mentioned = 1;
5454 warning_init ("missing braces around initializer");
5457 if (TREE_CODE (constructor_type) == RECORD_TYPE
5458 || TREE_CODE (constructor_type) == UNION_TYPE)
5460 constructor_fields = TYPE_FIELDS (constructor_type);
5461 /* Skip any nameless bit fields at the beginning. */
5462 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5463 && DECL_NAME (constructor_fields) == 0)
5464 constructor_fields = TREE_CHAIN (constructor_fields);
5466 constructor_unfilled_fields = constructor_fields;
5467 constructor_bit_index = bitsize_zero_node;
5469 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5471 if (TYPE_DOMAIN (constructor_type))
5473 constructor_max_index
5474 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5476 /* Detect non-empty initializations of zero-length arrays. */
5477 if (constructor_max_index == NULL_TREE
5478 && TYPE_SIZE (constructor_type))
5479 constructor_max_index = build_int_2 (-1, -1);
5481 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5482 to initialize VLAs will cause an proper error; avoid tree
5483 checking errors as well by setting a safe value. */
5484 if (constructor_max_index
5485 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5486 constructor_max_index = build_int_2 (-1, -1);
5489 = convert (bitsizetype,
5490 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5493 constructor_index = bitsize_zero_node;
5495 constructor_unfilled_index = constructor_index;
5496 if (value && TREE_CODE (value) == STRING_CST)
5498 /* We need to split the char/wchar array into individual
5499 characters, so that we don't have to special case it
5501 set_nonincremental_init_from_string (value);
5506 warning_init ("braces around scalar initializer");
5507 constructor_fields = constructor_type;
5508 constructor_unfilled_fields = constructor_type;
5512 /* At the end of an implicit or explicit brace level,
5513 finish up that level of constructor.
5514 If we were outputting the elements as they are read, return 0
5515 from inner levels (process_init_element ignores that),
5516 but return error_mark_node from the outermost level
5517 (that's what we want to put in DECL_INITIAL).
5518 Otherwise, return a CONSTRUCTOR expression. */
5521 pop_init_level (implicit)
5524 struct constructor_stack *p;
5525 tree constructor = 0;
5529 /* When we come to an explicit close brace,
5530 pop any inner levels that didn't have explicit braces. */
5531 while (constructor_stack->implicit)
5532 process_init_element (pop_init_level (1));
5534 if (constructor_range_stack)
5538 p = constructor_stack;
5540 /* Error for initializing a flexible array member, or a zero-length
5541 array member in an inappropriate context. */
5542 if (constructor_type && constructor_fields
5543 && TREE_CODE (constructor_type) == ARRAY_TYPE
5544 && TYPE_DOMAIN (constructor_type)
5545 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5547 /* Silently discard empty initializations. The parser will
5548 already have pedwarned for empty brackets. */
5549 if (integer_zerop (constructor_unfilled_index))
5550 constructor_type = NULL_TREE;
5551 else if (! TYPE_SIZE (constructor_type))
5553 if (constructor_depth > 2)
5554 error_init ("initialization of flexible array member in a nested context");
5556 pedwarn_init ("initialization of a flexible array member");
5558 /* We have already issued an error message for the existence
5559 of a flexible array member not at the end of the structure.
5560 Discard the initializer so that we do not abort later. */
5561 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5562 constructor_type = NULL_TREE;
5565 /* Zero-length arrays are no longer special, so we should no longer
5570 /* Warn when some struct elements are implicitly initialized to zero. */
5573 && TREE_CODE (constructor_type) == RECORD_TYPE
5574 && constructor_unfilled_fields)
5576 /* Do not warn for flexible array members or zero-length arrays. */
5577 while (constructor_unfilled_fields
5578 && (! DECL_SIZE (constructor_unfilled_fields)
5579 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5580 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5582 /* Do not warn if this level of the initializer uses member
5583 designators; it is likely to be deliberate. */
5584 if (constructor_unfilled_fields && !constructor_designated)
5586 push_member_name (constructor_unfilled_fields);
5587 warning_init ("missing initializer");
5588 RESTORE_SPELLING_DEPTH (constructor_depth);
5592 /* Now output all pending elements. */
5593 constructor_incremental = 1;
5594 output_pending_init_elements (1);
5596 /* Pad out the end of the structure. */
5597 if (p->replacement_value)
5598 /* If this closes a superfluous brace pair,
5599 just pass out the element between them. */
5600 constructor = p->replacement_value;
5601 else if (constructor_type == 0)
5603 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5604 && TREE_CODE (constructor_type) != UNION_TYPE
5605 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5607 /* A nonincremental scalar initializer--just return
5608 the element, after verifying there is just one. */
5609 if (constructor_elements == 0)
5611 if (!constructor_erroneous)
5612 error_init ("empty scalar initializer");
5613 constructor = error_mark_node;
5615 else if (TREE_CHAIN (constructor_elements) != 0)
5617 error_init ("extra elements in scalar initializer");
5618 constructor = TREE_VALUE (constructor_elements);
5621 constructor = TREE_VALUE (constructor_elements);
5625 if (constructor_erroneous)
5626 constructor = error_mark_node;
5629 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5630 nreverse (constructor_elements));
5631 if (constructor_constant)
5632 TREE_CONSTANT (constructor) = 1;
5633 if (constructor_constant && constructor_simple)
5634 TREE_STATIC (constructor) = 1;
5638 constructor_type = p->type;
5639 constructor_fields = p->fields;
5640 constructor_index = p->index;
5641 constructor_max_index = p->max_index;
5642 constructor_unfilled_index = p->unfilled_index;
5643 constructor_unfilled_fields = p->unfilled_fields;
5644 constructor_bit_index = p->bit_index;
5645 constructor_elements = p->elements;
5646 constructor_constant = p->constant;
5647 constructor_simple = p->simple;
5648 constructor_erroneous = p->erroneous;
5649 constructor_incremental = p->incremental;
5650 constructor_designated = p->designated;
5651 constructor_pending_elts = p->pending_elts;
5652 constructor_depth = p->depth;
5654 constructor_range_stack = p->range_stack;
5655 RESTORE_SPELLING_DEPTH (constructor_depth);
5657 constructor_stack = p->next;
5660 if (constructor == 0)
5662 if (constructor_stack == 0)
5663 return error_mark_node;
5669 /* Common handling for both array range and field name designators.
5670 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5673 set_designator (array)
5677 enum tree_code subcode;
5679 /* Don't die if an entire brace-pair level is superfluous
5680 in the containing level. */
5681 if (constructor_type == 0)
5684 /* If there were errors in this designator list already, bail out silently. */
5685 if (designator_errorneous)
5688 if (!designator_depth)
5690 if (constructor_range_stack)
5693 /* Designator list starts at the level of closest explicit
5695 while (constructor_stack->implicit)
5696 process_init_element (pop_init_level (1));
5697 constructor_designated = 1;
5701 if (constructor_no_implicit)
5703 error_init ("initialization designators may not nest");
5707 if (TREE_CODE (constructor_type) == RECORD_TYPE
5708 || TREE_CODE (constructor_type) == UNION_TYPE)
5710 subtype = TREE_TYPE (constructor_fields);
5711 if (subtype != error_mark_node)
5712 subtype = TYPE_MAIN_VARIANT (subtype);
5714 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5716 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5721 subcode = TREE_CODE (subtype);
5722 if (array && subcode != ARRAY_TYPE)
5724 error_init ("array index in non-array initializer");
5727 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5729 error_init ("field name not in record or union initializer");
5733 constructor_designated = 1;
5734 push_init_level (2);
5738 /* If there are range designators in designator list, push a new designator
5739 to constructor_range_stack. RANGE_END is end of such stack range or
5740 NULL_TREE if there is no range designator at this level. */
5743 push_range_stack (range_end)
5746 struct constructor_range_stack *p;
5748 p = (struct constructor_range_stack *)
5749 ggc_alloc (sizeof (struct constructor_range_stack));
5750 p->prev = constructor_range_stack;
5752 p->fields = constructor_fields;
5753 p->range_start = constructor_index;
5754 p->index = constructor_index;
5755 p->stack = constructor_stack;
5756 p->range_end = range_end;
5757 if (constructor_range_stack)
5758 constructor_range_stack->next = p;
5759 constructor_range_stack = p;
5762 /* Within an array initializer, specify the next index to be initialized.
5763 FIRST is that index. If LAST is nonzero, then initialize a range
5764 of indices, running from FIRST through LAST. */
5767 set_init_index (first, last)
5770 if (set_designator (1))
5773 designator_errorneous = 1;
5775 while ((TREE_CODE (first) == NOP_EXPR
5776 || TREE_CODE (first) == CONVERT_EXPR
5777 || TREE_CODE (first) == NON_LVALUE_EXPR)
5778 && (TYPE_MODE (TREE_TYPE (first))
5779 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5780 first = TREE_OPERAND (first, 0);
5783 while ((TREE_CODE (last) == NOP_EXPR
5784 || TREE_CODE (last) == CONVERT_EXPR
5785 || TREE_CODE (last) == NON_LVALUE_EXPR)
5786 && (TYPE_MODE (TREE_TYPE (last))
5787 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5788 last = TREE_OPERAND (last, 0);
5790 if (TREE_CODE (first) != INTEGER_CST)
5791 error_init ("nonconstant array index in initializer");
5792 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5793 error_init ("nonconstant array index in initializer");
5794 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5795 error_init ("array index in non-array initializer");
5796 else if (constructor_max_index
5797 && tree_int_cst_lt (constructor_max_index, first))
5798 error_init ("array index in initializer exceeds array bounds");
5801 constructor_index = convert (bitsizetype, first);
5805 if (tree_int_cst_equal (first, last))
5807 else if (tree_int_cst_lt (last, first))
5809 error_init ("empty index range in initializer");
5814 last = convert (bitsizetype, last);
5815 if (constructor_max_index != 0
5816 && tree_int_cst_lt (constructor_max_index, last))
5818 error_init ("array index range in initializer exceeds array bounds");
5825 designator_errorneous = 0;
5826 if (constructor_range_stack || last)
5827 push_range_stack (last);
5831 /* Within a struct initializer, specify the next field to be initialized. */
5834 set_init_label (fieldname)
5839 if (set_designator (0))
5842 designator_errorneous = 1;
5844 if (TREE_CODE (constructor_type) != RECORD_TYPE
5845 && TREE_CODE (constructor_type) != UNION_TYPE)
5847 error_init ("field name not in record or union initializer");
5851 for (tail = TYPE_FIELDS (constructor_type); tail;
5852 tail = TREE_CHAIN (tail))
5854 if (DECL_NAME (tail) == fieldname)
5859 error ("unknown field `%s' specified in initializer",
5860 IDENTIFIER_POINTER (fieldname));
5863 constructor_fields = tail;
5865 designator_errorneous = 0;
5866 if (constructor_range_stack)
5867 push_range_stack (NULL_TREE);
5871 /* Add a new initializer to the tree of pending initializers. PURPOSE
5872 identifies the initializer, either array index or field in a structure.
5873 VALUE is the value of that index or field. */
5876 add_pending_init (purpose, value)
5877 tree purpose, value;
5879 struct init_node *p, **q, *r;
5881 q = &constructor_pending_elts;
5884 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5889 if (tree_int_cst_lt (purpose, p->purpose))
5891 else if (tree_int_cst_lt (p->purpose, purpose))
5895 if (TREE_SIDE_EFFECTS (p->value))
5896 warning_init ("initialized field with side-effects overwritten");
5906 bitpos = bit_position (purpose);
5910 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5912 else if (p->purpose != purpose)
5916 if (TREE_SIDE_EFFECTS (p->value))
5917 warning_init ("initialized field with side-effects overwritten");
5924 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5925 r->purpose = purpose;
5936 struct init_node *s;
5940 if (p->balance == 0)
5942 else if (p->balance < 0)
5949 p->left->parent = p;
5966 constructor_pending_elts = r;
5971 struct init_node *t = r->right;
5975 r->right->parent = r;
5980 p->left->parent = p;
5983 p->balance = t->balance < 0;
5984 r->balance = -(t->balance > 0);
5999 constructor_pending_elts = t;
6005 /* p->balance == +1; growth of left side balances the node. */
6010 else /* r == p->right */
6012 if (p->balance == 0)
6013 /* Growth propagation from right side. */
6015 else if (p->balance > 0)
6022 p->right->parent = p;
6039 constructor_pending_elts = r;
6041 else /* r->balance == -1 */
6044 struct init_node *t = r->left;
6048 r->left->parent = r;
6053 p->right->parent = p;
6056 r->balance = (t->balance < 0);
6057 p->balance = -(t->balance > 0);
6072 constructor_pending_elts = t;
6078 /* p->balance == -1; growth of right side balances the node. */
6089 /* Build AVL tree from a sorted chain. */
6092 set_nonincremental_init ()
6096 if (TREE_CODE (constructor_type) != RECORD_TYPE
6097 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6100 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
6101 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
6102 constructor_elements = 0;
6103 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6105 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6106 /* Skip any nameless bit fields at the beginning. */
6107 while (constructor_unfilled_fields != 0
6108 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6109 && DECL_NAME (constructor_unfilled_fields) == 0)
6110 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6113 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6115 if (TYPE_DOMAIN (constructor_type))
6116 constructor_unfilled_index
6117 = convert (bitsizetype,
6118 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6120 constructor_unfilled_index = bitsize_zero_node;
6122 constructor_incremental = 0;
6125 /* Build AVL tree from a string constant. */
6128 set_nonincremental_init_from_string (str)
6131 tree value, purpose, type;
6132 HOST_WIDE_INT val[2];
6133 const char *p, *end;
6134 int byte, wchar_bytes, charwidth, bitpos;
6136 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6139 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6140 == TYPE_PRECISION (char_type_node))
6142 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6143 == TYPE_PRECISION (wchar_type_node))
6144 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6148 charwidth = TYPE_PRECISION (char_type_node);
6149 type = TREE_TYPE (constructor_type);
6150 p = TREE_STRING_POINTER (str);
6151 end = p + TREE_STRING_LENGTH (str);
6153 for (purpose = bitsize_zero_node;
6154 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6155 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6157 if (wchar_bytes == 1)
6159 val[1] = (unsigned char) *p++;
6166 for (byte = 0; byte < wchar_bytes; byte++)
6168 if (BYTES_BIG_ENDIAN)
6169 bitpos = (wchar_bytes - byte - 1) * charwidth;
6171 bitpos = byte * charwidth;
6172 val[bitpos < HOST_BITS_PER_WIDE_INT]
6173 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6174 << (bitpos % HOST_BITS_PER_WIDE_INT);
6178 if (!TREE_UNSIGNED (type))
6180 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6181 if (bitpos < HOST_BITS_PER_WIDE_INT)
6183 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6185 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6189 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6194 else if (val[0] & (((HOST_WIDE_INT) 1)
6195 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6196 val[0] |= ((HOST_WIDE_INT) -1)
6197 << (bitpos - HOST_BITS_PER_WIDE_INT);
6200 value = build_int_2 (val[1], val[0]);
6201 TREE_TYPE (value) = type;
6202 add_pending_init (purpose, value);
6205 constructor_incremental = 0;
6208 /* Return value of FIELD in pending initializer or zero if the field was
6209 not initialized yet. */
6212 find_init_member (field)
6215 struct init_node *p;
6217 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6219 if (constructor_incremental
6220 && tree_int_cst_lt (field, constructor_unfilled_index))
6221 set_nonincremental_init ();
6223 p = constructor_pending_elts;
6226 if (tree_int_cst_lt (field, p->purpose))
6228 else if (tree_int_cst_lt (p->purpose, field))
6234 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6236 tree bitpos = bit_position (field);
6238 if (constructor_incremental
6239 && (!constructor_unfilled_fields
6240 || tree_int_cst_lt (bitpos,
6241 bit_position (constructor_unfilled_fields))))
6242 set_nonincremental_init ();
6244 p = constructor_pending_elts;
6247 if (field == p->purpose)
6249 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6255 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6257 if (constructor_elements
6258 && TREE_PURPOSE (constructor_elements) == field)
6259 return TREE_VALUE (constructor_elements);
6264 /* "Output" the next constructor element.
6265 At top level, really output it to assembler code now.
6266 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6267 TYPE is the data type that the containing data type wants here.
6268 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6270 PENDING if non-nil means output pending elements that belong
6271 right after this element. (PENDING is normally 1;
6272 it is 0 while outputting pending elements, to avoid recursion.) */
6275 output_init_element (value, type, field, pending)
6276 tree value, type, field;
6279 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6280 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6281 && !(TREE_CODE (value) == STRING_CST
6282 && TREE_CODE (type) == ARRAY_TYPE
6283 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6284 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6285 TYPE_MAIN_VARIANT (type))))
6286 value = default_conversion (value);
6288 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6289 && require_constant_value && !flag_isoc99 && pending)
6291 /* As an extension, allow initializing objects with static storage
6292 duration with compound literals (which are then treated just as
6293 the brace enclosed list they contain). */
6294 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6295 value = DECL_INITIAL (decl);
6298 if (value == error_mark_node)
6299 constructor_erroneous = 1;
6300 else if (!TREE_CONSTANT (value))
6301 constructor_constant = 0;
6302 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6303 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6304 || TREE_CODE (constructor_type) == UNION_TYPE)
6305 && DECL_C_BIT_FIELD (field)
6306 && TREE_CODE (value) != INTEGER_CST))
6307 constructor_simple = 0;
6309 if (require_constant_value && ! TREE_CONSTANT (value))
6311 error_init ("initializer element is not constant");
6312 value = error_mark_node;
6314 else if (require_constant_elements
6315 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6316 pedwarn ("initializer element is not computable at load time");
6318 /* If this field is empty (and not at the end of structure),
6319 don't do anything other than checking the initializer. */
6321 && (TREE_TYPE (field) == error_mark_node
6322 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6323 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6324 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6325 || TREE_CHAIN (field)))))
6328 value = digest_init (type, value, require_constant_value,
6329 require_constant_elements);
6330 if (value == error_mark_node)
6332 constructor_erroneous = 1;
6336 /* If this element doesn't come next in sequence,
6337 put it on constructor_pending_elts. */
6338 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6339 && (!constructor_incremental
6340 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6342 if (constructor_incremental
6343 && tree_int_cst_lt (field, constructor_unfilled_index))
6344 set_nonincremental_init ();
6346 add_pending_init (field, value);
6349 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6350 && (!constructor_incremental
6351 || field != constructor_unfilled_fields))
6353 /* We do this for records but not for unions. In a union,
6354 no matter which field is specified, it can be initialized
6355 right away since it starts at the beginning of the union. */
6356 if (constructor_incremental)
6358 if (!constructor_unfilled_fields)
6359 set_nonincremental_init ();
6362 tree bitpos, unfillpos;
6364 bitpos = bit_position (field);
6365 unfillpos = bit_position (constructor_unfilled_fields);
6367 if (tree_int_cst_lt (bitpos, unfillpos))
6368 set_nonincremental_init ();
6372 add_pending_init (field, value);
6375 else if (TREE_CODE (constructor_type) == UNION_TYPE
6376 && constructor_elements)
6378 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6379 warning_init ("initialized field with side-effects overwritten");
6381 /* We can have just one union field set. */
6382 constructor_elements = 0;
6385 /* Otherwise, output this element either to
6386 constructor_elements or to the assembler file. */
6388 if (field && TREE_CODE (field) == INTEGER_CST)
6389 field = copy_node (field);
6390 constructor_elements
6391 = tree_cons (field, value, constructor_elements);
6393 /* Advance the variable that indicates sequential elements output. */
6394 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6395 constructor_unfilled_index
6396 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6398 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6400 constructor_unfilled_fields
6401 = TREE_CHAIN (constructor_unfilled_fields);
6403 /* Skip any nameless bit fields. */
6404 while (constructor_unfilled_fields != 0
6405 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6406 && DECL_NAME (constructor_unfilled_fields) == 0)
6407 constructor_unfilled_fields =
6408 TREE_CHAIN (constructor_unfilled_fields);
6410 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6411 constructor_unfilled_fields = 0;
6413 /* Now output any pending elements which have become next. */
6415 output_pending_init_elements (0);
6418 /* Output any pending elements which have become next.
6419 As we output elements, constructor_unfilled_{fields,index}
6420 advances, which may cause other elements to become next;
6421 if so, they too are output.
6423 If ALL is 0, we return when there are
6424 no more pending elements to output now.
6426 If ALL is 1, we output space as necessary so that
6427 we can output all the pending elements. */
6430 output_pending_init_elements (all)
6433 struct init_node *elt = constructor_pending_elts;
6438 /* Look thru the whole pending tree.
6439 If we find an element that should be output now,
6440 output it. Otherwise, set NEXT to the element
6441 that comes first among those still pending. */
6446 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6448 if (tree_int_cst_equal (elt->purpose,
6449 constructor_unfilled_index))
6450 output_init_element (elt->value,
6451 TREE_TYPE (constructor_type),
6452 constructor_unfilled_index, 0);
6453 else if (tree_int_cst_lt (constructor_unfilled_index,
6456 /* Advance to the next smaller node. */
6461 /* We have reached the smallest node bigger than the
6462 current unfilled index. Fill the space first. */
6463 next = elt->purpose;
6469 /* Advance to the next bigger node. */
6474 /* We have reached the biggest node in a subtree. Find
6475 the parent of it, which is the next bigger node. */
6476 while (elt->parent && elt->parent->right == elt)
6479 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6482 next = elt->purpose;
6488 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6489 || TREE_CODE (constructor_type) == UNION_TYPE)
6491 tree ctor_unfilled_bitpos, elt_bitpos;
6493 /* If the current record is complete we are done. */
6494 if (constructor_unfilled_fields == 0)
6497 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6498 elt_bitpos = bit_position (elt->purpose);
6499 /* We can't compare fields here because there might be empty
6500 fields in between. */
6501 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6503 constructor_unfilled_fields = elt->purpose;
6504 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6507 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6509 /* Advance to the next smaller node. */
6514 /* We have reached the smallest node bigger than the
6515 current unfilled field. Fill the space first. */
6516 next = elt->purpose;
6522 /* Advance to the next bigger node. */
6527 /* We have reached the biggest node in a subtree. Find
6528 the parent of it, which is the next bigger node. */
6529 while (elt->parent && elt->parent->right == elt)
6533 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6534 bit_position (elt->purpose))))
6536 next = elt->purpose;
6544 /* Ordinarily return, but not if we want to output all
6545 and there are elements left. */
6546 if (! (all && next != 0))
6549 /* If it's not incremental, just skip over the gap, so that after
6550 jumping to retry we will output the next successive element. */
6551 if (TREE_CODE (constructor_type) == RECORD_TYPE
6552 || TREE_CODE (constructor_type) == UNION_TYPE)
6553 constructor_unfilled_fields = next;
6554 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6555 constructor_unfilled_index = next;
6557 /* ELT now points to the node in the pending tree with the next
6558 initializer to output. */
6562 /* Add one non-braced element to the current constructor level.
6563 This adjusts the current position within the constructor's type.
6564 This may also start or terminate implicit levels
6565 to handle a partly-braced initializer.
6567 Once this has found the correct level for the new element,
6568 it calls output_init_element. */
6571 process_init_element (value)
6574 tree orig_value = value;
6575 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6577 designator_depth = 0;
6578 designator_errorneous = 0;
6580 /* Handle superfluous braces around string cst as in
6581 char x[] = {"foo"}; */
6584 && TREE_CODE (constructor_type) == ARRAY_TYPE
6585 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6586 && integer_zerop (constructor_unfilled_index))
6588 if (constructor_stack->replacement_value)
6589 error_init ("excess elements in char array initializer");
6590 constructor_stack->replacement_value = value;
6594 if (constructor_stack->replacement_value != 0)
6596 error_init ("excess elements in struct initializer");
6600 /* Ignore elements of a brace group if it is entirely superfluous
6601 and has already been diagnosed. */
6602 if (constructor_type == 0)
6605 /* If we've exhausted any levels that didn't have braces,
6607 while (constructor_stack->implicit)
6609 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6610 || TREE_CODE (constructor_type) == UNION_TYPE)
6611 && constructor_fields == 0)
6612 process_init_element (pop_init_level (1));
6613 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6614 && (constructor_max_index == 0
6615 || tree_int_cst_lt (constructor_max_index,
6616 constructor_index)))
6617 process_init_element (pop_init_level (1));
6622 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6623 if (constructor_range_stack)
6625 /* If value is a compound literal and we'll be just using its
6626 content, don't put it into a SAVE_EXPR. */
6627 if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR
6628 || !require_constant_value
6630 value = save_expr (value);
6635 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6638 enum tree_code fieldcode;
6640 if (constructor_fields == 0)
6642 pedwarn_init ("excess elements in struct initializer");
6646 fieldtype = TREE_TYPE (constructor_fields);
6647 if (fieldtype != error_mark_node)
6648 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6649 fieldcode = TREE_CODE (fieldtype);
6651 /* Accept a string constant to initialize a subarray. */
6653 && fieldcode == ARRAY_TYPE
6654 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6657 /* Otherwise, if we have come to a subaggregate,
6658 and we don't have an element of its type, push into it. */
6659 else if (value != 0 && !constructor_no_implicit
6660 && value != error_mark_node
6661 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6662 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6663 || fieldcode == UNION_TYPE))
6665 push_init_level (1);
6671 push_member_name (constructor_fields);
6672 output_init_element (value, fieldtype, constructor_fields, 1);
6673 RESTORE_SPELLING_DEPTH (constructor_depth);
6676 /* Do the bookkeeping for an element that was
6677 directly output as a constructor. */
6679 /* For a record, keep track of end position of last field. */
6680 if (DECL_SIZE (constructor_fields))
6681 constructor_bit_index
6682 = size_binop (PLUS_EXPR,
6683 bit_position (constructor_fields),
6684 DECL_SIZE (constructor_fields));
6686 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6687 /* Skip any nameless bit fields. */
6688 while (constructor_unfilled_fields != 0
6689 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6690 && DECL_NAME (constructor_unfilled_fields) == 0)
6691 constructor_unfilled_fields =
6692 TREE_CHAIN (constructor_unfilled_fields);
6695 constructor_fields = TREE_CHAIN (constructor_fields);
6696 /* Skip any nameless bit fields at the beginning. */
6697 while (constructor_fields != 0
6698 && DECL_C_BIT_FIELD (constructor_fields)
6699 && DECL_NAME (constructor_fields) == 0)
6700 constructor_fields = TREE_CHAIN (constructor_fields);
6702 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6705 enum tree_code fieldcode;
6707 if (constructor_fields == 0)
6709 pedwarn_init ("excess elements in union initializer");
6713 fieldtype = TREE_TYPE (constructor_fields);
6714 if (fieldtype != error_mark_node)
6715 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6716 fieldcode = TREE_CODE (fieldtype);
6718 /* Warn that traditional C rejects initialization of unions.
6719 We skip the warning if the value is zero. This is done
6720 under the assumption that the zero initializer in user
6721 code appears conditioned on e.g. __STDC__ to avoid
6722 "missing initializer" warnings and relies on default
6723 initialization to zero in the traditional C case.
6724 We also skip the warning if the initializer is designated,
6725 again on the assumption that this must be conditional on
6726 __STDC__ anyway (and we've already complained about the
6727 member-designator already). */
6728 if (warn_traditional && !in_system_header && !constructor_designated
6729 && !(value && (integer_zerop (value) || real_zerop (value))))
6730 warning ("traditional C rejects initialization of unions");
6732 /* Accept a string constant to initialize a subarray. */
6734 && fieldcode == ARRAY_TYPE
6735 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6738 /* Otherwise, if we have come to a subaggregate,
6739 and we don't have an element of its type, push into it. */
6740 else if (value != 0 && !constructor_no_implicit
6741 && value != error_mark_node
6742 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6743 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6744 || fieldcode == UNION_TYPE))
6746 push_init_level (1);
6752 push_member_name (constructor_fields);
6753 output_init_element (value, fieldtype, constructor_fields, 1);
6754 RESTORE_SPELLING_DEPTH (constructor_depth);
6757 /* Do the bookkeeping for an element that was
6758 directly output as a constructor. */
6760 constructor_bit_index = DECL_SIZE (constructor_fields);
6761 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6764 constructor_fields = 0;
6766 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6768 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6769 enum tree_code eltcode = TREE_CODE (elttype);
6771 /* Accept a string constant to initialize a subarray. */
6773 && eltcode == ARRAY_TYPE
6774 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6777 /* Otherwise, if we have come to a subaggregate,
6778 and we don't have an element of its type, push into it. */
6779 else if (value != 0 && !constructor_no_implicit
6780 && value != error_mark_node
6781 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6782 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6783 || eltcode == UNION_TYPE))
6785 push_init_level (1);
6789 if (constructor_max_index != 0
6790 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6791 || integer_all_onesp (constructor_max_index)))
6793 pedwarn_init ("excess elements in array initializer");
6797 /* Now output the actual element. */
6800 push_array_bounds (tree_low_cst (constructor_index, 0));
6801 output_init_element (value, elttype, constructor_index, 1);
6802 RESTORE_SPELLING_DEPTH (constructor_depth);
6806 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6809 /* If we are doing the bookkeeping for an element that was
6810 directly output as a constructor, we must update
6811 constructor_unfilled_index. */
6812 constructor_unfilled_index = constructor_index;
6815 /* Handle the sole element allowed in a braced initializer
6816 for a scalar variable. */
6817 else if (constructor_fields == 0)
6819 pedwarn_init ("excess elements in scalar initializer");
6825 output_init_element (value, constructor_type, NULL_TREE, 1);
6826 constructor_fields = 0;
6829 /* Handle range initializers either at this level or anywhere higher
6830 in the designator stack. */
6831 if (constructor_range_stack)
6833 struct constructor_range_stack *p, *range_stack;
6836 range_stack = constructor_range_stack;
6837 constructor_range_stack = 0;
6838 while (constructor_stack != range_stack->stack)
6840 if (!constructor_stack->implicit)
6842 process_init_element (pop_init_level (1));
6844 for (p = range_stack;
6845 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6848 if (!constructor_stack->implicit)
6850 process_init_element (pop_init_level (1));
6853 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6854 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6859 constructor_index = p->index;
6860 constructor_fields = p->fields;
6861 if (finish && p->range_end && p->index == p->range_start)
6869 push_init_level (2);
6870 p->stack = constructor_stack;
6871 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6872 p->index = p->range_start;
6876 constructor_range_stack = range_stack;
6883 constructor_range_stack = 0;
6886 /* Build a simple asm-statement, from one string literal. */
6888 simple_asm_stmt (expr)
6893 if (TREE_CODE (expr) == ADDR_EXPR)
6894 expr = TREE_OPERAND (expr, 0);
6896 if (TREE_CODE (expr) == STRING_CST)
6900 if (TREE_CHAIN (expr))
6901 expr = combine_strings (expr);
6902 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6903 NULL_TREE, NULL_TREE,
6905 ASM_INPUT_P (stmt) = 1;
6909 error ("argument of `asm' is not a constant string");
6913 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6914 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6917 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
6926 if (TREE_CHAIN (string))
6927 string = combine_strings (string);
6928 if (TREE_CODE (string) != STRING_CST)
6930 error ("asm template is not a string constant");
6934 if (cv_qualifier != NULL_TREE
6935 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
6937 warning ("%s qualifier ignored on asm",
6938 IDENTIFIER_POINTER (cv_qualifier));
6939 cv_qualifier = NULL_TREE;
6942 /* We can remove output conversions that change the type,
6943 but not the mode. */
6944 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6946 tree output = TREE_VALUE (tail);
6948 STRIP_NOPS (output);
6949 TREE_VALUE (tail) = output;
6951 /* Allow conversions as LHS here. build_modify_expr as called below
6952 will do the right thing with them. */
6953 while (TREE_CODE (output) == NOP_EXPR
6954 || TREE_CODE (output) == CONVERT_EXPR
6955 || TREE_CODE (output) == FLOAT_EXPR
6956 || TREE_CODE (output) == FIX_TRUNC_EXPR
6957 || TREE_CODE (output) == FIX_FLOOR_EXPR
6958 || TREE_CODE (output) == FIX_ROUND_EXPR
6959 || TREE_CODE (output) == FIX_CEIL_EXPR)
6960 output = TREE_OPERAND (output, 0);
6962 lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement");
6965 /* Remove output conversions that change the type but not the mode. */
6966 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6968 tree output = TREE_VALUE (tail);
6969 STRIP_NOPS (output);
6970 TREE_VALUE (tail) = output;
6973 /* Perform default conversions on array and function inputs.
6974 Don't do this for other types as it would screw up operands
6975 expected to be in memory. */
6976 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6977 TREE_VALUE (tail) = default_function_array_conversion (TREE_VALUE (tail));
6979 return add_stmt (build_stmt (ASM_STMT, cv_qualifier, string,
6980 outputs, inputs, clobbers));
6983 /* Expand an ASM statement with operands, handling output operands
6984 that are not variables or INDIRECT_REFS by transforming such
6985 cases into cases that expand_asm_operands can handle.
6987 Arguments are same as for expand_asm_operands. */
6990 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6991 tree string, outputs, inputs, clobbers;
6993 const char *filename;
6996 int noutputs = list_length (outputs);
6998 /* o[I] is the place that output number I should be written. */
6999 tree *o = (tree *) alloca (noutputs * sizeof (tree));
7002 /* Record the contents of OUTPUTS before it is modified. */
7003 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
7004 o[i] = TREE_VALUE (tail);
7006 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
7007 OUTPUTS some trees for where the values were actually stored. */
7008 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
7010 /* Copy all the intermediate outputs into the specified outputs. */
7011 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
7013 if (o[i] != TREE_VALUE (tail))
7015 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
7016 NULL_RTX, VOIDmode, EXPAND_NORMAL);
7019 /* Restore the original value so that it's correct the next
7020 time we expand this function. */
7021 TREE_VALUE (tail) = o[i];
7023 /* Detect modification of read-only values.
7024 (Otherwise done by build_modify_expr.) */
7027 tree type = TREE_TYPE (o[i]);
7028 if (TREE_READONLY (o[i])
7029 || TYPE_READONLY (type)
7030 || ((TREE_CODE (type) == RECORD_TYPE
7031 || TREE_CODE (type) == UNION_TYPE)
7032 && C_TYPE_FIELDS_READONLY (type)))
7033 readonly_warning (o[i], "modification by `asm'");
7037 /* Those MODIFY_EXPRs could do autoincrements. */
7041 /* Expand a C `return' statement.
7042 RETVAL is the expression for what to return,
7043 or a null pointer for `return;' with no value. */
7046 c_expand_return (retval)
7049 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
7051 if (TREE_THIS_VOLATILE (current_function_decl))
7052 warning ("function declared `noreturn' has a `return' statement");
7056 current_function_returns_null = 1;
7057 if ((warn_return_type || flag_isoc99)
7058 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7059 pedwarn_c99 ("`return' with no value, in function returning non-void");
7061 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7063 current_function_returns_null = 1;
7064 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7065 pedwarn ("`return' with a value, in function returning void");
7069 tree t = convert_for_assignment (valtype, retval, _("return"),
7070 NULL_TREE, NULL_TREE, 0);
7071 tree res = DECL_RESULT (current_function_decl);
7074 if (t == error_mark_node)
7077 inner = t = convert (TREE_TYPE (res), t);
7079 /* Strip any conversions, additions, and subtractions, and see if
7080 we are returning the address of a local variable. Warn if so. */
7083 switch (TREE_CODE (inner))
7085 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
7087 inner = TREE_OPERAND (inner, 0);
7091 /* If the second operand of the MINUS_EXPR has a pointer
7092 type (or is converted from it), this may be valid, so
7093 don't give a warning. */
7095 tree op1 = TREE_OPERAND (inner, 1);
7097 while (! POINTER_TYPE_P (TREE_TYPE (op1))
7098 && (TREE_CODE (op1) == NOP_EXPR
7099 || TREE_CODE (op1) == NON_LVALUE_EXPR
7100 || TREE_CODE (op1) == CONVERT_EXPR))
7101 op1 = TREE_OPERAND (op1, 0);
7103 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7106 inner = TREE_OPERAND (inner, 0);
7111 inner = TREE_OPERAND (inner, 0);
7113 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
7114 inner = TREE_OPERAND (inner, 0);
7116 if (TREE_CODE (inner) == VAR_DECL
7117 && ! DECL_EXTERNAL (inner)
7118 && ! TREE_STATIC (inner)
7119 && DECL_CONTEXT (inner) == current_function_decl)
7120 warning ("function returns address of local variable");
7130 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
7131 current_function_returns_value = 1;
7134 return add_stmt (build_return_stmt (retval));
7138 /* The SWITCH_STMT being built. */
7140 /* A splay-tree mapping the low element of a case range to the high
7141 element, or NULL_TREE if there is no high element. Used to
7142 determine whether or not a new case label duplicates an old case
7143 label. We need a tree, rather than simply a hash table, because
7144 of the GNU case range extension. */
7146 /* The next node on the stack. */
7147 struct c_switch *next;
7150 /* A stack of the currently active switch statements. The innermost
7151 switch statement is on the top of the stack. There is no need to
7152 mark the stack for garbage collection because it is only active
7153 during the processing of the body of a function, and we never
7154 collect at that point. */
7156 static struct c_switch *switch_stack;
7158 /* Start a C switch statement, testing expression EXP. Return the new
7165 enum tree_code code;
7167 struct c_switch *cs;
7169 if (exp != error_mark_node)
7171 code = TREE_CODE (TREE_TYPE (exp));
7172 type = TREE_TYPE (exp);
7174 if (! INTEGRAL_TYPE_P (type)
7175 && code != ERROR_MARK)
7177 error ("switch quantity not an integer");
7178 exp = integer_zero_node;
7182 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7184 if (warn_traditional && !in_system_header
7185 && (type == long_integer_type_node
7186 || type == long_unsigned_type_node))
7187 warning ("`long' switch expression not converted to `int' in ISO C");
7189 exp = default_conversion (exp);
7190 type = TREE_TYPE (exp);
7194 /* Add this new SWITCH_STMT to the stack. */
7195 cs = (struct c_switch *) xmalloc (sizeof (*cs));
7196 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, NULL_TREE);
7197 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7198 cs->next = switch_stack;
7201 return add_stmt (switch_stack->switch_stmt);
7204 /* Process a case label. */
7207 do_case (low_value, high_value)
7211 tree label = NULL_TREE;
7215 label = c_add_case_label (switch_stack->cases,
7216 SWITCH_COND (switch_stack->switch_stmt),
7217 low_value, high_value);
7218 if (label == error_mark_node)
7222 error ("case label not within a switch statement");
7224 error ("`default' label not within a switch statement");
7229 /* Finish the switch statement. */
7234 struct c_switch *cs = switch_stack;
7236 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
7238 /* Pop the stack. */
7239 switch_stack = switch_stack->next;
7240 splay_tree_delete (cs->cases);