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_diff PARAMS ((tree, tree));
62 static tree unary_complex_lvalue PARAMS ((enum tree_code, tree, int));
63 static void pedantic_lvalue_warning PARAMS ((enum tree_code));
64 static tree internal_build_compound_expr PARAMS ((tree, int));
65 static tree convert_for_assignment PARAMS ((tree, tree, const char *,
67 static void warn_for_assignment PARAMS ((const char *, const char *,
69 static tree valid_compound_expr_initializer PARAMS ((tree, tree));
70 static void push_string PARAMS ((const char *));
71 static void push_member_name PARAMS ((tree));
72 static void push_array_bounds PARAMS ((int));
73 static int spelling_length PARAMS ((void));
74 static char *print_spelling PARAMS ((char *));
75 static void warning_init PARAMS ((const char *));
76 static tree digest_init PARAMS ((tree, tree, int, int));
77 static void output_init_element PARAMS ((tree, tree, tree, int));
78 static void output_pending_init_elements PARAMS ((int));
79 static int set_designator PARAMS ((int));
80 static void push_range_stack PARAMS ((tree));
81 static void add_pending_init PARAMS ((tree, tree));
82 static void set_nonincremental_init PARAMS ((void));
83 static void set_nonincremental_init_from_string PARAMS ((tree));
84 static tree find_init_member PARAMS ((tree));
86 /* Do `exp = require_complete_type (exp);' to make sure exp
87 does not have an incomplete type. (That includes void types.) */
90 require_complete_type (value)
93 tree type = TREE_TYPE (value);
95 if (value == error_mark_node || type == error_mark_node)
96 return error_mark_node;
98 /* First, detect a valid value with a complete type. */
99 if (COMPLETE_TYPE_P (type))
102 incomplete_type_error (value, type);
103 return error_mark_node;
106 /* Print an error message for invalid use of an incomplete type.
107 VALUE is the expression that was used (or 0 if that isn't known)
108 and TYPE is the type that was invalid. */
111 incomplete_type_error (value, type)
115 const char *type_code_string;
117 /* Avoid duplicate error message. */
118 if (TREE_CODE (type) == ERROR_MARK)
121 if (value != 0 && (TREE_CODE (value) == VAR_DECL
122 || TREE_CODE (value) == PARM_DECL))
123 error ("`%s' has an incomplete type",
124 IDENTIFIER_POINTER (DECL_NAME (value)));
128 /* We must print an error message. Be clever about what it says. */
130 switch (TREE_CODE (type))
133 type_code_string = "struct";
137 type_code_string = "union";
141 type_code_string = "enum";
145 error ("invalid use of void expression");
149 if (TYPE_DOMAIN (type))
151 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
153 error ("invalid use of flexible array member");
156 type = TREE_TYPE (type);
159 error ("invalid use of array with unspecified bounds");
166 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
167 error ("invalid use of undefined type `%s %s'",
168 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
170 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
171 error ("invalid use of incomplete typedef `%s'",
172 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
176 /* Return a variant of TYPE which has all the type qualifiers of LIKE
177 as well as those of TYPE. */
180 qualify_type (type, like)
183 return c_build_qualified_type (type,
184 TYPE_QUALS (type) | TYPE_QUALS (like));
187 /* Return the common type of two types.
188 We assume that comptypes has already been done and returned 1;
189 if that isn't so, this may crash. In particular, we assume that qualifiers
192 This is the type for the result of most arithmetic operations
193 if the operands have the given two types. */
199 enum tree_code code1;
200 enum tree_code code2;
203 /* Save time if the two types are the same. */
205 if (t1 == t2) return t1;
207 /* If one type is nonsense, use the other. */
208 if (t1 == error_mark_node)
210 if (t2 == error_mark_node)
213 /* Merge the attributes. */
214 attributes = (*targetm.merge_type_attributes) (t1, t2);
216 /* Treat an enum type as the unsigned integer type of the same width. */
218 if (TREE_CODE (t1) == ENUMERAL_TYPE)
219 t1 = type_for_size (TYPE_PRECISION (t1), 1);
220 if (TREE_CODE (t2) == ENUMERAL_TYPE)
221 t2 = type_for_size (TYPE_PRECISION (t2), 1);
223 code1 = TREE_CODE (t1);
224 code2 = TREE_CODE (t2);
226 /* If one type is complex, form the common type of the non-complex
227 components, then make that complex. Use T1 or T2 if it is the
229 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
231 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
232 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
233 tree subtype = common_type (subtype1, subtype2);
235 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
236 return build_type_attribute_variant (t1, attributes);
237 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
238 return build_type_attribute_variant (t2, attributes);
240 return build_type_attribute_variant (build_complex_type (subtype),
248 /* If only one is real, use it as the result. */
250 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
251 return build_type_attribute_variant (t1, attributes);
253 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
254 return build_type_attribute_variant (t2, attributes);
256 /* Both real or both integers; use the one with greater precision. */
258 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
259 return build_type_attribute_variant (t1, attributes);
260 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
261 return build_type_attribute_variant (t2, attributes);
263 /* Same precision. Prefer longs to ints even when same size. */
265 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
266 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
267 return build_type_attribute_variant (long_unsigned_type_node,
270 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
271 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
273 /* But preserve unsignedness from the other type,
274 since long cannot hold all the values of an unsigned int. */
275 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
276 t1 = long_unsigned_type_node;
278 t1 = long_integer_type_node;
279 return build_type_attribute_variant (t1, attributes);
282 /* Likewise, prefer long double to double even if same size. */
283 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
284 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
285 return build_type_attribute_variant (long_double_type_node,
288 /* Otherwise prefer the unsigned one. */
290 if (TREE_UNSIGNED (t1))
291 return build_type_attribute_variant (t1, attributes);
293 return build_type_attribute_variant (t2, attributes);
296 /* For two pointers, do this recursively on the target type,
297 and combine the qualifiers of the two types' targets. */
298 /* This code was turned off; I don't know why.
299 But ANSI C specifies doing this with the qualifiers.
300 So I turned it on again. */
302 tree pointed_to_1 = TREE_TYPE (t1);
303 tree pointed_to_2 = TREE_TYPE (t2);
304 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
305 TYPE_MAIN_VARIANT (pointed_to_2));
306 t1 = build_pointer_type (c_build_qualified_type
308 TYPE_QUALS (pointed_to_1) |
309 TYPE_QUALS (pointed_to_2)));
310 return build_type_attribute_variant (t1, attributes);
313 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
314 return build_type_attribute_variant (t1, attributes);
319 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
320 /* Save space: see if the result is identical to one of the args. */
321 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
322 return build_type_attribute_variant (t1, attributes);
323 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
324 return build_type_attribute_variant (t2, attributes);
325 /* Merge the element types, and have a size if either arg has one. */
326 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
327 return build_type_attribute_variant (t1, attributes);
331 /* Function types: prefer the one that specified arg types.
332 If both do, merge the arg types. Also merge the return types. */
334 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
335 tree p1 = TYPE_ARG_TYPES (t1);
336 tree p2 = TYPE_ARG_TYPES (t2);
341 /* Save space: see if the result is identical to one of the args. */
342 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
343 return build_type_attribute_variant (t1, attributes);
344 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
345 return build_type_attribute_variant (t2, attributes);
347 /* Simple way if one arg fails to specify argument types. */
348 if (TYPE_ARG_TYPES (t1) == 0)
350 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
351 return build_type_attribute_variant (t1, attributes);
353 if (TYPE_ARG_TYPES (t2) == 0)
355 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
356 return build_type_attribute_variant (t1, attributes);
359 /* If both args specify argument types, we must merge the two
360 lists, argument by argument. */
363 declare_parm_level (1);
365 len = list_length (p1);
368 for (i = 0; i < len; i++)
369 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
374 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
376 /* A null type means arg type is not specified.
377 Take whatever the other function type has. */
378 if (TREE_VALUE (p1) == 0)
380 TREE_VALUE (n) = TREE_VALUE (p2);
383 if (TREE_VALUE (p2) == 0)
385 TREE_VALUE (n) = TREE_VALUE (p1);
389 /* Given wait (union {union wait *u; int *i} *)
390 and wait (union wait *),
391 prefer union wait * as type of parm. */
392 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
393 && TREE_VALUE (p1) != TREE_VALUE (p2))
396 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
397 memb; memb = TREE_CHAIN (memb))
398 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
400 TREE_VALUE (n) = TREE_VALUE (p2);
402 pedwarn ("function types not truly compatible in ISO C");
406 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
407 && TREE_VALUE (p2) != TREE_VALUE (p1))
410 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
411 memb; memb = TREE_CHAIN (memb))
412 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
414 TREE_VALUE (n) = TREE_VALUE (p1);
416 pedwarn ("function types not truly compatible in ISO C");
420 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
426 t1 = build_function_type (valtype, newargs);
427 /* ... falls through ... */
431 return build_type_attribute_variant (t1, attributes);
436 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
437 or various other operations. Return 2 if they are compatible
438 but a warning may be needed if you use them together. */
441 comptypes (type1, type2)
448 /* Suppress errors caused by previously reported errors. */
450 if (t1 == t2 || !t1 || !t2
451 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
454 /* If either type is the internal version of sizetype, return the
456 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
457 && TYPE_DOMAIN (t1) != 0)
458 t1 = TYPE_DOMAIN (t1);
460 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
461 && TYPE_DOMAIN (t2) != 0)
462 t2 = TYPE_DOMAIN (t2);
464 /* Treat an enum type as the integer type of the same width and
467 if (TREE_CODE (t1) == ENUMERAL_TYPE)
468 t1 = type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
469 if (TREE_CODE (t2) == ENUMERAL_TYPE)
470 t2 = type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
475 /* Different classes of types can't be compatible. */
477 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
479 /* Qualifiers must match. */
481 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
484 /* Allow for two different type nodes which have essentially the same
485 definition. Note that we already checked for equality of the type
486 qualifiers (just above). */
488 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
491 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
492 if (! (attrval = (*targetm.comp_type_attributes) (t1, t2)))
495 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
498 switch (TREE_CODE (t1))
501 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
502 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
506 val = function_types_compatible_p (t1, t2);
511 tree d1 = TYPE_DOMAIN (t1);
512 tree d2 = TYPE_DOMAIN (t2);
513 bool d1_variable, d2_variable;
514 bool d1_zero, d2_zero;
517 /* Target types must match incl. qualifiers. */
518 if (TREE_TYPE (t1) != TREE_TYPE (t2)
519 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
522 /* Sizes must match unless one is missing or variable. */
523 if (d1 == 0 || d2 == 0 || d1 == d2)
526 d1_zero = ! TYPE_MAX_VALUE (d1);
527 d2_zero = ! TYPE_MAX_VALUE (d2);
529 d1_variable = (! d1_zero
530 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
531 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
532 d2_variable = (! d2_zero
533 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
534 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
536 if (d1_variable || d2_variable)
538 if (d1_zero && d2_zero)
540 if (d1_zero || d2_zero
541 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
542 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
549 if (maybe_objc_comptypes (t1, t2, 0) == 1)
556 return attrval == 2 && val == 1 ? 2 : val;
559 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
560 ignoring their qualifiers. */
563 comp_target_types (ttl, ttr)
568 /* Give maybe_objc_comptypes a crack at letting these types through. */
569 if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0)
572 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
573 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
575 if (val == 2 && pedantic)
576 pedwarn ("types are not quite compatible");
580 /* Subroutines of `comptypes'. */
582 /* Return 1 if two function types F1 and F2 are compatible.
583 If either type specifies no argument types,
584 the other must specify a fixed number of self-promoting arg types.
585 Otherwise, if one type specifies only the number of arguments,
586 the other must specify that number of self-promoting arg types.
587 Otherwise, the argument types must match. */
590 function_types_compatible_p (f1, f2)
594 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
598 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
599 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
602 args1 = TYPE_ARG_TYPES (f1);
603 args2 = TYPE_ARG_TYPES (f2);
605 /* An unspecified parmlist matches any specified parmlist
606 whose argument types don't need default promotions. */
610 if (!self_promoting_args_p (args2))
612 /* If one of these types comes from a non-prototype fn definition,
613 compare that with the other type's arglist.
614 If they don't match, ask for a warning (but no error). */
615 if (TYPE_ACTUAL_ARG_TYPES (f1)
616 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
622 if (!self_promoting_args_p (args1))
624 if (TYPE_ACTUAL_ARG_TYPES (f2)
625 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
630 /* Both types have argument lists: compare them and propagate results. */
631 val1 = type_lists_compatible_p (args1, args2);
632 return val1 != 1 ? val1 : val;
635 /* Check two lists of types for compatibility,
636 returning 0 for incompatible, 1 for compatible,
637 or 2 for compatible with warning. */
640 type_lists_compatible_p (args1, args2)
643 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
649 if (args1 == 0 && args2 == 0)
651 /* If one list is shorter than the other,
652 they fail to match. */
653 if (args1 == 0 || args2 == 0)
655 /* A null pointer instead of a type
656 means there is supposed to be an argument
657 but nothing is specified about what type it has.
658 So match anything that self-promotes. */
659 if (TREE_VALUE (args1) == 0)
661 if (simple_type_promotes_to (TREE_VALUE (args2)) != NULL_TREE)
664 else if (TREE_VALUE (args2) == 0)
666 if (simple_type_promotes_to (TREE_VALUE (args1)) != NULL_TREE)
669 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
670 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
672 /* Allow wait (union {union wait *u; int *i} *)
673 and wait (union wait *) to be compatible. */
674 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
675 && (TYPE_NAME (TREE_VALUE (args1)) == 0
676 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
677 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
678 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
679 TYPE_SIZE (TREE_VALUE (args2))))
682 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
683 memb; memb = TREE_CHAIN (memb))
684 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
689 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
690 && (TYPE_NAME (TREE_VALUE (args2)) == 0
691 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
692 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
693 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
694 TYPE_SIZE (TREE_VALUE (args1))))
697 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
698 memb; memb = TREE_CHAIN (memb))
699 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
708 /* comptypes said ok, but record if it said to warn. */
712 args1 = TREE_CHAIN (args1);
713 args2 = TREE_CHAIN (args2);
717 /* Compute the value of the `sizeof' operator. */
723 enum tree_code code = TREE_CODE (type);
726 if (code == FUNCTION_TYPE)
728 if (pedantic || warn_pointer_arith)
729 pedwarn ("sizeof applied to a function type");
730 size = size_one_node;
732 else if (code == VOID_TYPE)
734 if (pedantic || warn_pointer_arith)
735 pedwarn ("sizeof applied to a void type");
736 size = size_one_node;
738 else if (code == ERROR_MARK)
739 size = size_one_node;
740 else if (!COMPLETE_TYPE_P (type))
742 error ("sizeof applied to an incomplete type");
743 size = size_zero_node;
746 /* Convert in case a char is more than one unit. */
747 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
748 size_int (TYPE_PRECISION (char_type_node)
751 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
752 TYPE_IS_SIZETYPE means that certain things (like overflow) will
753 never happen. However, this node should really have type
754 `size_t', which is just a typedef for an ordinary integer type. */
755 return fold (build1 (NOP_EXPR, c_size_type_node, size));
759 c_sizeof_nowarn (type)
762 enum tree_code code = TREE_CODE (type);
765 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
766 size = size_one_node;
767 else if (!COMPLETE_TYPE_P (type))
768 size = size_zero_node;
770 /* Convert in case a char is more than one unit. */
771 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
772 size_int (TYPE_PRECISION (char_type_node)
775 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
776 TYPE_IS_SIZETYPE means that certain things (like overflow) will
777 never happen. However, this node should really have type
778 `size_t', which is just a typedef for an ordinary integer type. */
779 return fold (build1 (NOP_EXPR, c_size_type_node, size));
782 /* Compute the size to increment a pointer by. */
785 c_size_in_bytes (type)
788 enum tree_code code = TREE_CODE (type);
790 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
791 return size_one_node;
793 if (!COMPLETE_OR_VOID_TYPE_P (type))
795 error ("arithmetic on pointer to an incomplete type");
796 return size_one_node;
799 /* Convert in case a char is more than one unit. */
800 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
801 size_int (TYPE_PRECISION (char_type_node)
805 /* Return either DECL or its known constant value (if it has one). */
808 decl_constant_value (decl)
811 if (/* Don't change a variable array bound or initial value to a constant
812 in a place where a variable is invalid. */
813 current_function_decl != 0
814 && ! TREE_THIS_VOLATILE (decl)
815 && TREE_READONLY (decl)
816 && DECL_INITIAL (decl) != 0
817 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
818 /* This is invalid if initial value is not constant.
819 If it has either a function call, a memory reference,
820 or a variable, then re-evaluating it could give different results. */
821 && TREE_CONSTANT (DECL_INITIAL (decl))
822 /* Check for cases where this is sub-optimal, even though valid. */
823 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
824 return DECL_INITIAL (decl);
828 /* Return either DECL or its known constant value (if it has one), but
829 return DECL if pedantic or DECL has mode BLKmode. This is for
830 bug-compatibility with the old behavior of decl_constant_value
831 (before GCC 3.0); every use of this function is a bug and it should
832 be removed before GCC 3.1. It is not appropriate to use pedantic
833 in a way that affects optimization, and BLKmode is probably not the
834 right test for avoiding misoptimizations either. */
837 decl_constant_value_for_broken_optimization (decl)
840 if (pedantic || DECL_MODE (decl) == BLKmode)
843 return decl_constant_value (decl);
847 /* Perform the default conversion of arrays and functions to pointers.
848 Return the result of converting EXP. For any other expression, just
852 default_function_array_conversion (exp)
856 tree type = TREE_TYPE (exp);
857 enum tree_code code = TREE_CODE (type);
860 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
863 Do not use STRIP_NOPS here! It will remove conversions from pointer
864 to integer and cause infinite recursion. */
866 while (TREE_CODE (exp) == NON_LVALUE_EXPR
867 || (TREE_CODE (exp) == NOP_EXPR
868 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
870 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
872 exp = TREE_OPERAND (exp, 0);
875 /* Preserve the original expression code. */
876 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
877 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
879 if (code == FUNCTION_TYPE)
881 return build_unary_op (ADDR_EXPR, exp, 0);
883 if (code == ARRAY_TYPE)
886 tree restype = TREE_TYPE (type);
892 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
894 constp = TREE_READONLY (exp);
895 volatilep = TREE_THIS_VOLATILE (exp);
898 if (TYPE_QUALS (type) || constp || volatilep)
900 = c_build_qualified_type (restype,
902 | (constp * TYPE_QUAL_CONST)
903 | (volatilep * TYPE_QUAL_VOLATILE));
905 if (TREE_CODE (exp) == INDIRECT_REF)
906 return convert (TYPE_POINTER_TO (restype),
907 TREE_OPERAND (exp, 0));
909 if (TREE_CODE (exp) == COMPOUND_EXPR)
911 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
912 return build (COMPOUND_EXPR, TREE_TYPE (op1),
913 TREE_OPERAND (exp, 0), op1);
916 lvalue_array_p = !not_lvalue && lvalue_p (exp);
917 if (!flag_isoc99 && !lvalue_array_p)
919 /* Before C99, non-lvalue arrays do not decay to pointers.
920 Normally, using such an array would be invalid; but it can
921 be used correctly inside sizeof or as a statement expression.
922 Thus, do not give an error here; an error will result later. */
926 ptrtype = build_pointer_type (restype);
928 if (TREE_CODE (exp) == VAR_DECL)
930 /* ??? This is not really quite correct
931 in that the type of the operand of ADDR_EXPR
932 is not the target type of the type of the ADDR_EXPR itself.
933 Question is, can this lossage be avoided? */
934 adr = build1 (ADDR_EXPR, ptrtype, exp);
935 if (mark_addressable (exp) == 0)
936 return error_mark_node;
937 TREE_CONSTANT (adr) = staticp (exp);
938 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
941 /* This way is better for a COMPONENT_REF since it can
942 simplify the offset for a component. */
943 adr = build_unary_op (ADDR_EXPR, exp, 1);
944 return convert (ptrtype, adr);
949 /* Perform default promotions for C data used in expressions.
950 Arrays and functions are converted to pointers;
951 enumeral types or short or char, to int.
952 In addition, manifest constants symbols are replaced by their values. */
955 default_conversion (exp)
959 tree type = TREE_TYPE (exp);
960 enum tree_code code = TREE_CODE (type);
962 if (code == FUNCTION_TYPE || code == ARRAY_TYPE)
963 return default_function_array_conversion (exp);
965 /* Constants can be used directly unless they're not loadable. */
966 if (TREE_CODE (exp) == CONST_DECL)
967 exp = DECL_INITIAL (exp);
969 /* Replace a nonvolatile const static variable with its value unless
970 it is an array, in which case we must be sure that taking the
971 address of the array produces consistent results. */
972 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
974 exp = decl_constant_value_for_broken_optimization (exp);
975 type = TREE_TYPE (exp);
978 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
981 Do not use STRIP_NOPS here! It will remove conversions from pointer
982 to integer and cause infinite recursion. */
984 while (TREE_CODE (exp) == NON_LVALUE_EXPR
985 || (TREE_CODE (exp) == NOP_EXPR
986 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
987 exp = TREE_OPERAND (exp, 0);
989 /* Preserve the original expression code. */
990 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
991 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
993 /* Normally convert enums to int,
994 but convert wide enums to something wider. */
995 if (code == ENUMERAL_TYPE)
997 type = type_for_size (MAX (TYPE_PRECISION (type),
998 TYPE_PRECISION (integer_type_node)),
1000 || (TYPE_PRECISION (type)
1001 >= TYPE_PRECISION (integer_type_node)))
1002 && TREE_UNSIGNED (type)));
1004 return convert (type, exp);
1007 if (TREE_CODE (exp) == COMPONENT_REF
1008 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1009 /* If it's thinner than an int, promote it like a
1010 c_promoting_integer_type_p, otherwise leave it alone. */
1011 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1012 TYPE_PRECISION (integer_type_node)))
1013 return convert (flag_traditional && TREE_UNSIGNED (type)
1014 ? unsigned_type_node : integer_type_node,
1017 if (c_promoting_integer_type_p (type))
1019 /* Traditionally, unsignedness is preserved in default promotions.
1020 Also preserve unsignedness if not really getting any wider. */
1021 if (TREE_UNSIGNED (type)
1022 && (flag_traditional
1023 || TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
1024 return convert (unsigned_type_node, exp);
1026 return convert (integer_type_node, exp);
1029 if (flag_traditional && !flag_allow_single_precision
1030 && TYPE_MAIN_VARIANT (type) == float_type_node)
1031 return convert (double_type_node, exp);
1033 if (code == VOID_TYPE)
1035 error ("void value not ignored as it ought to be");
1036 return error_mark_node;
1041 /* Look up COMPONENT in a structure or union DECL.
1043 If the component name is not found, returns NULL_TREE. Otherwise,
1044 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1045 stepping down the chain to the component, which is in the last
1046 TREE_VALUE of the list. Normally the list is of length one, but if
1047 the component is embedded within (nested) anonymous structures or
1048 unions, the list steps down the chain to the component. */
1051 lookup_field (decl, component)
1052 tree decl, component;
1054 tree type = TREE_TYPE (decl);
1057 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1058 to the field elements. Use a binary search on this array to quickly
1059 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1060 will always be set for structures which have many elements. */
1062 if (TYPE_LANG_SPECIFIC (type))
1065 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1067 field = TYPE_FIELDS (type);
1069 top = TYPE_LANG_SPECIFIC (type)->len;
1070 while (top - bot > 1)
1072 half = (top - bot + 1) >> 1;
1073 field = field_array[bot+half];
1075 if (DECL_NAME (field) == NULL_TREE)
1077 /* Step through all anon unions in linear fashion. */
1078 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1080 field = field_array[bot++];
1081 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1082 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1084 tree anon = lookup_field (field, component);
1087 return tree_cons (NULL_TREE, field, anon);
1091 /* Entire record is only anon unions. */
1095 /* Restart the binary search, with new lower bound. */
1099 if (DECL_NAME (field) == component)
1101 if (DECL_NAME (field) < component)
1107 if (DECL_NAME (field_array[bot]) == component)
1108 field = field_array[bot];
1109 else if (DECL_NAME (field) != component)
1114 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1116 if (DECL_NAME (field) == NULL_TREE
1117 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1118 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1120 tree anon = lookup_field (field, component);
1123 return tree_cons (NULL_TREE, field, anon);
1126 if (DECL_NAME (field) == component)
1130 if (field == NULL_TREE)
1134 return tree_cons (NULL_TREE, field, NULL_TREE);
1137 /* Make an expression to refer to the COMPONENT field of
1138 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1141 build_component_ref (datum, component)
1142 tree datum, component;
1144 tree type = TREE_TYPE (datum);
1145 enum tree_code code = TREE_CODE (type);
1149 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1150 If pedantic ensure that the arguments are not lvalues; otherwise,
1151 if the component is an array, it would wrongly decay to a pointer in
1153 We cannot do this with a COND_EXPR, because in a conditional expression
1154 the default promotions are applied to both sides, and this would yield
1155 the wrong type of the result; for example, if the components have
1157 switch (TREE_CODE (datum))
1161 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1162 return build (COMPOUND_EXPR, TREE_TYPE (value),
1163 TREE_OPERAND (datum, 0), pedantic_non_lvalue (value));
1169 /* See if there is a field or component with name COMPONENT. */
1171 if (code == RECORD_TYPE || code == UNION_TYPE)
1173 if (!COMPLETE_TYPE_P (type))
1175 incomplete_type_error (NULL_TREE, type);
1176 return error_mark_node;
1179 field = lookup_field (datum, component);
1183 error ("%s has no member named `%s'",
1184 code == RECORD_TYPE ? "structure" : "union",
1185 IDENTIFIER_POINTER (component));
1186 return error_mark_node;
1189 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1190 This might be better solved in future the way the C++ front
1191 end does it - by giving the anonymous entities each a
1192 separate name and type, and then have build_component_ref
1193 recursively call itself. We can't do that here. */
1194 for (; field; field = TREE_CHAIN (field))
1196 tree subdatum = TREE_VALUE (field);
1198 if (TREE_TYPE (subdatum) == error_mark_node)
1199 return error_mark_node;
1201 ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum);
1202 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1203 TREE_READONLY (ref) = 1;
1204 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1205 TREE_THIS_VOLATILE (ref) = 1;
1207 if (TREE_DEPRECATED (subdatum))
1208 warn_deprecated_use (subdatum);
1215 else if (code != ERROR_MARK)
1216 error ("request for member `%s' in something not a structure or union",
1217 IDENTIFIER_POINTER (component));
1219 return error_mark_node;
1222 /* Given an expression PTR for a pointer, return an expression
1223 for the value pointed to.
1224 ERRORSTRING is the name of the operator to appear in error messages. */
1227 build_indirect_ref (ptr, errorstring)
1229 const char *errorstring;
1231 tree pointer = default_conversion (ptr);
1232 tree type = TREE_TYPE (pointer);
1234 if (TREE_CODE (type) == POINTER_TYPE)
1236 if (TREE_CODE (pointer) == ADDR_EXPR
1238 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1239 == TREE_TYPE (type)))
1240 return TREE_OPERAND (pointer, 0);
1243 tree t = TREE_TYPE (type);
1244 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1246 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1248 error ("dereferencing pointer to incomplete type");
1249 return error_mark_node;
1251 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1252 warning ("dereferencing `void *' pointer");
1254 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1255 so that we get the proper error message if the result is used
1256 to assign to. Also, &* is supposed to be a no-op.
1257 And ANSI C seems to specify that the type of the result
1258 should be the const type. */
1259 /* A de-reference of a pointer to const is not a const. It is valid
1260 to change it via some other pointer. */
1261 TREE_READONLY (ref) = TYPE_READONLY (t);
1262 TREE_SIDE_EFFECTS (ref)
1263 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1264 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1268 else if (TREE_CODE (pointer) != ERROR_MARK)
1269 error ("invalid type argument of `%s'", errorstring);
1270 return error_mark_node;
1273 /* This handles expressions of the form "a[i]", which denotes
1276 This is logically equivalent in C to *(a+i), but we may do it differently.
1277 If A is a variable or a member, we generate a primitive ARRAY_REF.
1278 This avoids forcing the array out of registers, and can work on
1279 arrays that are not lvalues (for example, members of structures returned
1283 build_array_ref (array, index)
1288 error ("subscript missing in array reference");
1289 return error_mark_node;
1292 if (TREE_TYPE (array) == error_mark_node
1293 || TREE_TYPE (index) == error_mark_node)
1294 return error_mark_node;
1296 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1297 && TREE_CODE (array) != INDIRECT_REF)
1301 /* Subscripting with type char is likely to lose
1302 on a machine where chars are signed.
1303 So warn on any machine, but optionally.
1304 Don't warn for unsigned char since that type is safe.
1305 Don't warn for signed char because anyone who uses that
1306 must have done so deliberately. */
1307 if (warn_char_subscripts
1308 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1309 warning ("array subscript has type `char'");
1311 /* Apply default promotions *after* noticing character types. */
1312 index = default_conversion (index);
1314 /* Require integer *after* promotion, for sake of enums. */
1315 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1317 error ("array subscript is not an integer");
1318 return error_mark_node;
1321 /* An array that is indexed by a non-constant
1322 cannot be stored in a register; we must be able to do
1323 address arithmetic on its address.
1324 Likewise an array of elements of variable size. */
1325 if (TREE_CODE (index) != INTEGER_CST
1326 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1327 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1329 if (mark_addressable (array) == 0)
1330 return error_mark_node;
1332 /* An array that is indexed by a constant value which is not within
1333 the array bounds cannot be stored in a register either; because we
1334 would get a crash in store_bit_field/extract_bit_field when trying
1335 to access a non-existent part of the register. */
1336 if (TREE_CODE (index) == INTEGER_CST
1337 && TYPE_VALUES (TREE_TYPE (array))
1338 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1340 if (mark_addressable (array) == 0)
1341 return error_mark_node;
1347 while (TREE_CODE (foo) == COMPONENT_REF)
1348 foo = TREE_OPERAND (foo, 0);
1349 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1350 pedwarn ("ISO C forbids subscripting `register' array");
1351 else if (! flag_isoc99 && ! lvalue_p (foo))
1352 pedwarn ("ISO C89 forbids subscripting non-lvalue array");
1355 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1356 rval = build (ARRAY_REF, type, array, index);
1357 /* Array ref is const/volatile if the array elements are
1358 or if the array is. */
1359 TREE_READONLY (rval)
1360 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1361 | TREE_READONLY (array));
1362 TREE_SIDE_EFFECTS (rval)
1363 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1364 | TREE_SIDE_EFFECTS (array));
1365 TREE_THIS_VOLATILE (rval)
1366 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1367 /* This was added by rms on 16 Nov 91.
1368 It fixes vol struct foo *a; a->elts[1]
1369 in an inline function.
1370 Hope it doesn't break something else. */
1371 | TREE_THIS_VOLATILE (array));
1372 return require_complete_type (fold (rval));
1376 tree ar = default_conversion (array);
1377 tree ind = default_conversion (index);
1379 /* Do the same warning check as above, but only on the part that's
1380 syntactically the index and only if it is also semantically
1382 if (warn_char_subscripts
1383 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1384 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1385 warning ("subscript has type `char'");
1387 /* Put the integer in IND to simplify error checking. */
1388 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1395 if (ar == error_mark_node)
1398 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1399 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1401 error ("subscripted value is neither array nor pointer");
1402 return error_mark_node;
1404 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1406 error ("array subscript is not an integer");
1407 return error_mark_node;
1410 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1415 /* Build an external reference to identifier ID. FUN indicates
1416 whether this will be used for a function call. */
1418 build_external_ref (id, fun)
1423 tree decl = lookup_name (id);
1424 tree objc_ivar = lookup_objc_ivar (id);
1426 if (decl && TREE_DEPRECATED (decl))
1427 warn_deprecated_use (decl);
1429 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1435 if (!decl || decl == error_mark_node)
1436 /* Ordinary implicit function declaration. */
1437 ref = implicitly_declare (id);
1440 /* Implicit declaration of built-in function. Don't
1441 change the built-in declaration, but don't let this
1442 go by silently, either. */
1443 implicit_decl_warning (id);
1445 /* only issue this warning once */
1446 C_DECL_ANTICIPATED (decl) = 0;
1452 /* Reference to undeclared variable, including reference to
1453 builtin outside of function-call context. */
1454 if (current_function_decl == 0)
1455 error ("`%s' undeclared here (not in a function)",
1456 IDENTIFIER_POINTER (id));
1459 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1460 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1462 error ("`%s' undeclared (first use in this function)",
1463 IDENTIFIER_POINTER (id));
1465 if (! undeclared_variable_notice)
1467 error ("(Each undeclared identifier is reported only once");
1468 error ("for each function it appears in.)");
1469 undeclared_variable_notice = 1;
1472 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1473 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1475 return error_mark_node;
1480 /* Properly declared variable or function reference. */
1483 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1485 warning ("local declaration of `%s' hides instance variable",
1486 IDENTIFIER_POINTER (id));
1493 if (TREE_TYPE (ref) == error_mark_node)
1494 return error_mark_node;
1496 assemble_external (ref);
1497 TREE_USED (ref) = 1;
1499 if (TREE_CODE (ref) == CONST_DECL)
1501 ref = DECL_INITIAL (ref);
1502 TREE_CONSTANT (ref) = 1;
1508 /* Build a function call to function FUNCTION with parameters PARAMS.
1509 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1510 TREE_VALUE of each node is a parameter-expression.
1511 FUNCTION's data type may be a function type or a pointer-to-function. */
1514 build_function_call (function, params)
1515 tree function, params;
1517 tree fntype, fundecl = 0;
1518 tree coerced_params;
1519 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1521 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1522 STRIP_TYPE_NOPS (function);
1524 /* Convert anything with function type to a pointer-to-function. */
1525 if (TREE_CODE (function) == FUNCTION_DECL)
1527 name = DECL_NAME (function);
1528 assembler_name = DECL_ASSEMBLER_NAME (function);
1530 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1531 (because calling an inline function does not mean the function
1532 needs to be separately compiled). */
1533 fntype = build_type_variant (TREE_TYPE (function),
1534 TREE_READONLY (function),
1535 TREE_THIS_VOLATILE (function));
1537 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1540 function = default_conversion (function);
1542 fntype = TREE_TYPE (function);
1544 if (TREE_CODE (fntype) == ERROR_MARK)
1545 return error_mark_node;
1547 if (!(TREE_CODE (fntype) == POINTER_TYPE
1548 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1550 error ("called object is not a function");
1551 return error_mark_node;
1554 if (fundecl && TREE_THIS_VOLATILE (fundecl))
1555 current_function_returns_abnormally = 1;
1557 /* fntype now gets the type of function pointed to. */
1558 fntype = TREE_TYPE (fntype);
1560 /* Convert the parameters to the types declared in the
1561 function prototype, or apply default promotions. */
1564 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1566 /* Check for errors in format strings. */
1569 check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params);
1571 /* Recognize certain built-in functions so we can make tree-codes
1572 other than CALL_EXPR. We do this when it enables fold-const.c
1573 to do something useful. */
1575 if (TREE_CODE (function) == ADDR_EXPR
1576 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1577 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1579 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1580 params, coerced_params);
1585 result = build (CALL_EXPR, TREE_TYPE (fntype),
1586 function, coerced_params, NULL_TREE);
1587 TREE_SIDE_EFFECTS (result) = 1;
1588 result = fold (result);
1590 if (VOID_TYPE_P (TREE_TYPE (result)))
1592 return require_complete_type (result);
1595 /* Convert the argument expressions in the list VALUES
1596 to the types in the list TYPELIST. The result is a list of converted
1597 argument expressions.
1599 If TYPELIST is exhausted, or when an element has NULL as its type,
1600 perform the default conversions.
1602 PARMLIST is the chain of parm decls for the function being called.
1603 It may be 0, if that info is not available.
1604 It is used only for generating error messages.
1606 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1608 This is also where warnings about wrong number of args are generated.
1610 Both VALUES and the returned value are chains of TREE_LIST nodes
1611 with the elements of the list in the TREE_VALUE slots of those nodes. */
1614 convert_arguments (typelist, values, name, fundecl)
1615 tree typelist, values, name, fundecl;
1617 tree typetail, valtail;
1621 /* Scan the given expressions and types, producing individual
1622 converted arguments and pushing them on RESULT in reverse order. */
1624 for (valtail = values, typetail = typelist, parmnum = 0;
1626 valtail = TREE_CHAIN (valtail), parmnum++)
1628 tree type = typetail ? TREE_VALUE (typetail) : 0;
1629 tree val = TREE_VALUE (valtail);
1631 if (type == void_type_node)
1634 error ("too many arguments to function `%s'",
1635 IDENTIFIER_POINTER (name));
1637 error ("too many arguments to function");
1641 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1642 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1643 to convert automatically to a pointer. */
1644 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1645 val = TREE_OPERAND (val, 0);
1647 val = default_function_array_conversion (val);
1649 val = require_complete_type (val);
1653 /* Formal parm type is specified by a function prototype. */
1656 if (!COMPLETE_TYPE_P (type))
1658 error ("type of formal parameter %d is incomplete", parmnum + 1);
1663 /* Optionally warn about conversions that
1664 differ from the default conversions. */
1665 if (warn_conversion || warn_traditional)
1667 int formal_prec = TYPE_PRECISION (type);
1669 if (INTEGRAL_TYPE_P (type)
1670 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1671 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1672 if (INTEGRAL_TYPE_P (type)
1673 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1674 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1675 else if (TREE_CODE (type) == COMPLEX_TYPE
1676 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1677 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1678 else if (TREE_CODE (type) == REAL_TYPE
1679 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1680 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1681 else if (TREE_CODE (type) == COMPLEX_TYPE
1682 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1683 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1684 else if (TREE_CODE (type) == REAL_TYPE
1685 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1686 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1687 /* ??? At some point, messages should be written about
1688 conversions between complex types, but that's too messy
1690 else if (TREE_CODE (type) == REAL_TYPE
1691 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1693 /* Warn if any argument is passed as `float',
1694 since without a prototype it would be `double'. */
1695 if (formal_prec == TYPE_PRECISION (float_type_node))
1696 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1698 /* Detect integer changing in width or signedness.
1699 These warnings are only activated with
1700 -Wconversion, not with -Wtraditional. */
1701 else if (warn_conversion && INTEGRAL_TYPE_P (type)
1702 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1704 tree would_have_been = default_conversion (val);
1705 tree type1 = TREE_TYPE (would_have_been);
1707 if (TREE_CODE (type) == ENUMERAL_TYPE
1708 && (TYPE_MAIN_VARIANT (type)
1709 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
1710 /* No warning if function asks for enum
1711 and the actual arg is that enum type. */
1713 else if (formal_prec != TYPE_PRECISION (type1))
1714 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1715 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1717 /* Don't complain if the formal parameter type
1718 is an enum, because we can't tell now whether
1719 the value was an enum--even the same enum. */
1720 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1722 else if (TREE_CODE (val) == INTEGER_CST
1723 && int_fits_type_p (val, type))
1724 /* Change in signedness doesn't matter
1725 if a constant value is unaffected. */
1727 /* Likewise for a constant in a NOP_EXPR. */
1728 else if (TREE_CODE (val) == NOP_EXPR
1729 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1730 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1732 #if 0 /* We never get such tree structure here. */
1733 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1734 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1735 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1736 /* Change in signedness doesn't matter
1737 if an enum value is unaffected. */
1740 /* If the value is extended from a narrower
1741 unsigned type, it doesn't matter whether we
1742 pass it as signed or unsigned; the value
1743 certainly is the same either way. */
1744 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1745 && TREE_UNSIGNED (TREE_TYPE (val)))
1747 else if (TREE_UNSIGNED (type))
1748 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1750 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1754 parmval = convert_for_assignment (type, val,
1755 (char *) 0, /* arg passing */
1756 fundecl, name, parmnum + 1);
1758 if (PROMOTE_PROTOTYPES
1759 && INTEGRAL_TYPE_P (type)
1760 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1761 parmval = default_conversion (parmval);
1763 result = tree_cons (NULL_TREE, parmval, result);
1765 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1766 && (TYPE_PRECISION (TREE_TYPE (val))
1767 < TYPE_PRECISION (double_type_node)))
1768 /* Convert `float' to `double'. */
1769 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1771 /* Convert `short' and `char' to full-size `int'. */
1772 result = tree_cons (NULL_TREE, default_conversion (val), result);
1775 typetail = TREE_CHAIN (typetail);
1778 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1781 error ("too few arguments to function `%s'",
1782 IDENTIFIER_POINTER (name));
1784 error ("too few arguments to function");
1787 return nreverse (result);
1790 /* This is the entry point used by the parser
1791 for binary operators in the input.
1792 In addition to constructing the expression,
1793 we check for operands that were written with other binary operators
1794 in a way that is likely to confuse the user. */
1797 parser_build_binary_op (code, arg1, arg2)
1798 enum tree_code code;
1801 tree result = build_binary_op (code, arg1, arg2, 1);
1804 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1805 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1806 enum tree_code code1 = ERROR_MARK;
1807 enum tree_code code2 = ERROR_MARK;
1809 if (TREE_CODE (result) == ERROR_MARK)
1810 return error_mark_node;
1812 if (IS_EXPR_CODE_CLASS (class1))
1813 code1 = C_EXP_ORIGINAL_CODE (arg1);
1814 if (IS_EXPR_CODE_CLASS (class2))
1815 code2 = C_EXP_ORIGINAL_CODE (arg2);
1817 /* Check for cases such as x+y<<z which users are likely
1818 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1819 is cleared to prevent these warnings. */
1820 if (warn_parentheses)
1822 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1824 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1825 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1826 warning ("suggest parentheses around + or - inside shift");
1829 if (code == TRUTH_ORIF_EXPR)
1831 if (code1 == TRUTH_ANDIF_EXPR
1832 || code2 == TRUTH_ANDIF_EXPR)
1833 warning ("suggest parentheses around && within ||");
1836 if (code == BIT_IOR_EXPR)
1838 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1839 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1840 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1841 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1842 warning ("suggest parentheses around arithmetic in operand of |");
1843 /* Check cases like x|y==z */
1844 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1845 warning ("suggest parentheses around comparison in operand of |");
1848 if (code == BIT_XOR_EXPR)
1850 if (code1 == BIT_AND_EXPR
1851 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1852 || code2 == BIT_AND_EXPR
1853 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1854 warning ("suggest parentheses around arithmetic in operand of ^");
1855 /* Check cases like x^y==z */
1856 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1857 warning ("suggest parentheses around comparison in operand of ^");
1860 if (code == BIT_AND_EXPR)
1862 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1863 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1864 warning ("suggest parentheses around + or - in operand of &");
1865 /* Check cases like x&y==z */
1866 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1867 warning ("suggest parentheses around comparison in operand of &");
1871 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1872 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1873 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1874 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1876 unsigned_conversion_warning (result, arg1);
1877 unsigned_conversion_warning (result, arg2);
1878 overflow_warning (result);
1880 class = TREE_CODE_CLASS (TREE_CODE (result));
1882 /* Record the code that was specified in the source,
1883 for the sake of warnings about confusing nesting. */
1884 if (IS_EXPR_CODE_CLASS (class))
1885 C_SET_EXP_ORIGINAL_CODE (result, code);
1888 int flag = TREE_CONSTANT (result);
1889 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1890 so that convert_for_assignment wouldn't strip it.
1891 That way, we got warnings for things like p = (1 - 1).
1892 But it turns out we should not get those warnings. */
1893 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1894 C_SET_EXP_ORIGINAL_CODE (result, code);
1895 TREE_CONSTANT (result) = flag;
1901 /* Build a binary-operation expression without default conversions.
1902 CODE is the kind of expression to build.
1903 This function differs from `build' in several ways:
1904 the data type of the result is computed and recorded in it,
1905 warnings are generated if arg data types are invalid,
1906 special handling for addition and subtraction of pointers is known,
1907 and some optimization is done (operations on narrow ints
1908 are done in the narrower type when that gives the same result).
1909 Constant folding is also done before the result is returned.
1911 Note that the operands will never have enumeral types, or function
1912 or array types, because either they will have the default conversions
1913 performed or they have both just been converted to some other type in which
1914 the arithmetic is to be done. */
1917 build_binary_op (code, orig_op0, orig_op1, convert_p)
1918 enum tree_code code;
1919 tree orig_op0, orig_op1;
1923 enum tree_code code0, code1;
1926 /* Expression code to give to the expression when it is built.
1927 Normally this is CODE, which is what the caller asked for,
1928 but in some special cases we change it. */
1929 enum tree_code resultcode = code;
1931 /* Data type in which the computation is to be performed.
1932 In the simplest cases this is the common type of the arguments. */
1933 tree result_type = NULL;
1935 /* Nonzero means operands have already been type-converted
1936 in whatever way is necessary.
1937 Zero means they need to be converted to RESULT_TYPE. */
1940 /* Nonzero means create the expression with this type, rather than
1942 tree build_type = 0;
1944 /* Nonzero means after finally constructing the expression
1945 convert it to this type. */
1946 tree final_type = 0;
1948 /* Nonzero if this is an operation like MIN or MAX which can
1949 safely be computed in short if both args are promoted shorts.
1950 Also implies COMMON.
1951 -1 indicates a bitwise operation; this makes a difference
1952 in the exact conditions for when it is safe to do the operation
1953 in a narrower mode. */
1956 /* Nonzero if this is a comparison operation;
1957 if both args are promoted shorts, compare the original shorts.
1958 Also implies COMMON. */
1959 int short_compare = 0;
1961 /* Nonzero if this is a right-shift operation, which can be computed on the
1962 original short and then promoted if the operand is a promoted short. */
1963 int short_shift = 0;
1965 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1970 op0 = default_conversion (orig_op0);
1971 op1 = default_conversion (orig_op1);
1979 type0 = TREE_TYPE (op0);
1980 type1 = TREE_TYPE (op1);
1982 /* The expression codes of the data types of the arguments tell us
1983 whether the arguments are integers, floating, pointers, etc. */
1984 code0 = TREE_CODE (type0);
1985 code1 = TREE_CODE (type1);
1987 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1988 STRIP_TYPE_NOPS (op0);
1989 STRIP_TYPE_NOPS (op1);
1991 /* If an error was already reported for one of the arguments,
1992 avoid reporting another error. */
1994 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1995 return error_mark_node;
2000 /* Handle the pointer + int case. */
2001 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2002 return pointer_int_sum (PLUS_EXPR, op0, op1);
2003 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
2004 return pointer_int_sum (PLUS_EXPR, op1, op0);
2010 /* Subtraction of two similar pointers.
2011 We must subtract them as integers, then divide by object size. */
2012 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
2013 && comp_target_types (type0, type1))
2014 return pointer_diff (op0, op1);
2015 /* Handle pointer minus int. Just like pointer plus int. */
2016 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2017 return pointer_int_sum (MINUS_EXPR, op0, op1);
2026 case TRUNC_DIV_EXPR:
2028 case FLOOR_DIV_EXPR:
2029 case ROUND_DIV_EXPR:
2030 case EXACT_DIV_EXPR:
2031 /* Floating point division by zero is a legitimate way to obtain
2032 infinities and NaNs. */
2033 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2034 warning ("division by zero");
2036 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2037 || code0 == COMPLEX_TYPE)
2038 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2039 || code1 == COMPLEX_TYPE))
2041 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
2042 resultcode = RDIV_EXPR;
2044 /* Although it would be tempting to shorten always here, that
2045 loses on some targets, since the modulo instruction is
2046 undefined if the quotient can't be represented in the
2047 computation mode. We shorten only if unsigned or if
2048 dividing by something we know != -1. */
2049 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2050 || (TREE_CODE (op1) == INTEGER_CST
2051 && ! integer_all_onesp (op1)));
2057 case BIT_ANDTC_EXPR:
2060 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2064 case TRUNC_MOD_EXPR:
2065 case FLOOR_MOD_EXPR:
2066 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2067 warning ("division by zero");
2069 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2071 /* Although it would be tempting to shorten always here, that loses
2072 on some targets, since the modulo instruction is undefined if the
2073 quotient can't be represented in the computation mode. We shorten
2074 only if unsigned or if dividing by something we know != -1. */
2075 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2076 || (TREE_CODE (op1) == INTEGER_CST
2077 && ! integer_all_onesp (op1)));
2082 case TRUTH_ANDIF_EXPR:
2083 case TRUTH_ORIF_EXPR:
2084 case TRUTH_AND_EXPR:
2086 case TRUTH_XOR_EXPR:
2087 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2088 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2089 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2090 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2092 /* Result of these operations is always an int,
2093 but that does not mean the operands should be
2094 converted to ints! */
2095 result_type = integer_type_node;
2096 op0 = truthvalue_conversion (op0);
2097 op1 = truthvalue_conversion (op1);
2102 /* Shift operations: result has same type as first operand;
2103 always convert second operand to int.
2104 Also set SHORT_SHIFT if shifting rightward. */
2107 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2109 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2111 if (tree_int_cst_sgn (op1) < 0)
2112 warning ("right shift count is negative");
2115 if (! integer_zerop (op1))
2118 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2119 warning ("right shift count >= width of type");
2123 /* Use the type of the value to be shifted.
2124 This is what most traditional C compilers do. */
2125 result_type = type0;
2126 /* Unless traditional, convert the shift-count to an integer,
2127 regardless of size of value being shifted. */
2128 if (! flag_traditional)
2130 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2131 op1 = convert (integer_type_node, op1);
2132 /* Avoid converting op1 to result_type later. */
2139 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2141 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2143 if (tree_int_cst_sgn (op1) < 0)
2144 warning ("left shift count is negative");
2146 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2147 warning ("left shift count >= width of type");
2150 /* Use the type of the value to be shifted.
2151 This is what most traditional C compilers do. */
2152 result_type = type0;
2153 /* Unless traditional, convert the shift-count to an integer,
2154 regardless of size of value being shifted. */
2155 if (! flag_traditional)
2157 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2158 op1 = convert (integer_type_node, op1);
2159 /* Avoid converting op1 to result_type later. */
2167 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2169 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2171 if (tree_int_cst_sgn (op1) < 0)
2172 warning ("shift count is negative");
2173 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2174 warning ("shift count >= width of type");
2177 /* Use the type of the value to be shifted.
2178 This is what most traditional C compilers do. */
2179 result_type = type0;
2180 /* Unless traditional, convert the shift-count to an integer,
2181 regardless of size of value being shifted. */
2182 if (! flag_traditional)
2184 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2185 op1 = convert (integer_type_node, op1);
2186 /* Avoid converting op1 to result_type later. */
2194 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2195 warning ("comparing floating point with == or != is unsafe");
2196 /* Result of comparison is always int,
2197 but don't convert the args to int! */
2198 build_type = integer_type_node;
2199 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2200 || code0 == COMPLEX_TYPE)
2201 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2202 || code1 == COMPLEX_TYPE))
2204 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2206 tree tt0 = TREE_TYPE (type0);
2207 tree tt1 = TREE_TYPE (type1);
2208 /* Anything compares with void *. void * compares with anything.
2209 Otherwise, the targets must be compatible
2210 and both must be object or both incomplete. */
2211 if (comp_target_types (type0, type1))
2212 result_type = common_type (type0, type1);
2213 else if (VOID_TYPE_P (tt0))
2215 /* op0 != orig_op0 detects the case of something
2216 whose value is 0 but which isn't a valid null ptr const. */
2217 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2218 && TREE_CODE (tt1) == FUNCTION_TYPE)
2219 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2221 else if (VOID_TYPE_P (tt1))
2223 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2224 && TREE_CODE (tt0) == FUNCTION_TYPE)
2225 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2228 pedwarn ("comparison of distinct pointer types lacks a cast");
2230 if (result_type == NULL_TREE)
2231 result_type = ptr_type_node;
2233 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2234 && integer_zerop (op1))
2235 result_type = type0;
2236 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2237 && integer_zerop (op0))
2238 result_type = type1;
2239 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2241 result_type = type0;
2242 if (! flag_traditional)
2243 pedwarn ("comparison between pointer and integer");
2245 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2247 result_type = type1;
2248 if (! flag_traditional)
2249 pedwarn ("comparison between pointer and integer");
2255 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2256 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2258 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2260 if (comp_target_types (type0, type1))
2262 result_type = common_type (type0, type1);
2264 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2265 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2269 result_type = ptr_type_node;
2270 pedwarn ("comparison of distinct pointer types lacks a cast");
2279 build_type = integer_type_node;
2280 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2281 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2283 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2285 if (comp_target_types (type0, type1))
2287 result_type = common_type (type0, type1);
2288 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2289 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2290 pedwarn ("comparison of complete and incomplete pointers");
2292 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2293 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2297 result_type = ptr_type_node;
2298 pedwarn ("comparison of distinct pointer types lacks a cast");
2301 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2302 && integer_zerop (op1))
2304 result_type = type0;
2305 if (pedantic || extra_warnings)
2306 pedwarn ("ordered comparison of pointer with integer zero");
2308 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2309 && integer_zerop (op0))
2311 result_type = type1;
2313 pedwarn ("ordered comparison of pointer with integer zero");
2315 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2317 result_type = type0;
2318 if (! flag_traditional)
2319 pedwarn ("comparison between pointer and integer");
2321 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2323 result_type = type1;
2324 if (! flag_traditional)
2325 pedwarn ("comparison between pointer and integer");
2329 case UNORDERED_EXPR:
2336 build_type = integer_type_node;
2337 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2339 error ("unordered comparison on non-floating point argument");
2340 return error_mark_node;
2349 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2351 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2353 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2355 if (shorten || common || short_compare)
2356 result_type = common_type (type0, type1);
2358 /* For certain operations (which identify themselves by shorten != 0)
2359 if both args were extended from the same smaller type,
2360 do the arithmetic in that type and then extend.
2362 shorten !=0 and !=1 indicates a bitwise operation.
2363 For them, this optimization is safe only if
2364 both args are zero-extended or both are sign-extended.
2365 Otherwise, we might change the result.
2366 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2367 but calculated in (unsigned short) it would be (unsigned short)-1. */
2369 if (shorten && none_complex)
2371 int unsigned0, unsigned1;
2372 tree arg0 = get_narrower (op0, &unsigned0);
2373 tree arg1 = get_narrower (op1, &unsigned1);
2374 /* UNS is 1 if the operation to be done is an unsigned one. */
2375 int uns = TREE_UNSIGNED (result_type);
2378 final_type = result_type;
2380 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2381 but it *requires* conversion to FINAL_TYPE. */
2383 if ((TYPE_PRECISION (TREE_TYPE (op0))
2384 == TYPE_PRECISION (TREE_TYPE (arg0)))
2385 && TREE_TYPE (op0) != final_type)
2386 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2387 if ((TYPE_PRECISION (TREE_TYPE (op1))
2388 == TYPE_PRECISION (TREE_TYPE (arg1)))
2389 && TREE_TYPE (op1) != final_type)
2390 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2392 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2394 /* For bitwise operations, signedness of nominal type
2395 does not matter. Consider only how operands were extended. */
2399 /* Note that in all three cases below we refrain from optimizing
2400 an unsigned operation on sign-extended args.
2401 That would not be valid. */
2403 /* Both args variable: if both extended in same way
2404 from same width, do it in that width.
2405 Do it unsigned if args were zero-extended. */
2406 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2407 < TYPE_PRECISION (result_type))
2408 && (TYPE_PRECISION (TREE_TYPE (arg1))
2409 == TYPE_PRECISION (TREE_TYPE (arg0)))
2410 && unsigned0 == unsigned1
2411 && (unsigned0 || !uns))
2413 = signed_or_unsigned_type (unsigned0,
2414 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2415 else if (TREE_CODE (arg0) == INTEGER_CST
2416 && (unsigned1 || !uns)
2417 && (TYPE_PRECISION (TREE_TYPE (arg1))
2418 < TYPE_PRECISION (result_type))
2419 && (type = signed_or_unsigned_type (unsigned1,
2421 int_fits_type_p (arg0, type)))
2423 else if (TREE_CODE (arg1) == INTEGER_CST
2424 && (unsigned0 || !uns)
2425 && (TYPE_PRECISION (TREE_TYPE (arg0))
2426 < TYPE_PRECISION (result_type))
2427 && (type = signed_or_unsigned_type (unsigned0,
2429 int_fits_type_p (arg1, type)))
2433 /* Shifts can be shortened if shifting right. */
2438 tree arg0 = get_narrower (op0, &unsigned_arg);
2440 final_type = result_type;
2442 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2443 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2445 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2446 /* We can shorten only if the shift count is less than the
2447 number of bits in the smaller type size. */
2448 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2449 /* We cannot drop an unsigned shift after sign-extension. */
2450 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2452 /* Do an unsigned shift if the operand was zero-extended. */
2454 = signed_or_unsigned_type (unsigned_arg, TREE_TYPE (arg0));
2455 /* Convert value-to-be-shifted to that type. */
2456 if (TREE_TYPE (op0) != result_type)
2457 op0 = convert (result_type, op0);
2462 /* Comparison operations are shortened too but differently.
2463 They identify themselves by setting short_compare = 1. */
2467 /* Don't write &op0, etc., because that would prevent op0
2468 from being kept in a register.
2469 Instead, make copies of the our local variables and
2470 pass the copies by reference, then copy them back afterward. */
2471 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2472 enum tree_code xresultcode = resultcode;
2474 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2479 op0 = xop0, op1 = xop1;
2481 resultcode = xresultcode;
2483 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2484 && skip_evaluation == 0)
2486 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2487 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2488 int unsignedp0, unsignedp1;
2489 tree primop0 = get_narrower (op0, &unsignedp0);
2490 tree primop1 = get_narrower (op1, &unsignedp1);
2494 STRIP_TYPE_NOPS (xop0);
2495 STRIP_TYPE_NOPS (xop1);
2497 /* Give warnings for comparisons between signed and unsigned
2498 quantities that may fail.
2500 Do the checking based on the original operand trees, so that
2501 casts will be considered, but default promotions won't be.
2503 Do not warn if the comparison is being done in a signed type,
2504 since the signed type will only be chosen if it can represent
2505 all the values of the unsigned type. */
2506 if (! TREE_UNSIGNED (result_type))
2508 /* Do not warn if both operands are the same signedness. */
2509 else if (op0_signed == op1_signed)
2516 sop = xop0, uop = xop1;
2518 sop = xop1, uop = xop0;
2520 /* Do not warn if the signed quantity is an
2521 unsuffixed integer literal (or some static
2522 constant expression involving such literals or a
2523 conditional expression involving such literals)
2524 and it is non-negative. */
2525 if (tree_expr_nonnegative_p (sop))
2527 /* Do not warn if the comparison is an equality operation,
2528 the unsigned quantity is an integral constant, and it
2529 would fit in the result if the result were signed. */
2530 else if (TREE_CODE (uop) == INTEGER_CST
2531 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2532 && int_fits_type_p (uop, signed_type (result_type)))
2534 /* Do not warn if the unsigned quantity is an enumeration
2535 constant and its maximum value would fit in the result
2536 if the result were signed. */
2537 else if (TREE_CODE (uop) == INTEGER_CST
2538 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2539 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2540 signed_type (result_type)))
2543 warning ("comparison between signed and unsigned");
2546 /* Warn if two unsigned values are being compared in a size
2547 larger than their original size, and one (and only one) is the
2548 result of a `~' operator. This comparison will always fail.
2550 Also warn if one operand is a constant, and the constant
2551 does not have all bits set that are set in the ~ operand
2552 when it is extended. */
2554 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2555 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2557 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2558 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2561 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2564 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2567 HOST_WIDE_INT constant, mask;
2568 int unsignedp, bits;
2570 if (host_integerp (primop0, 0))
2573 unsignedp = unsignedp1;
2574 constant = tree_low_cst (primop0, 0);
2579 unsignedp = unsignedp0;
2580 constant = tree_low_cst (primop1, 0);
2583 bits = TYPE_PRECISION (TREE_TYPE (primop));
2584 if (bits < TYPE_PRECISION (result_type)
2585 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2587 mask = (~ (HOST_WIDE_INT) 0) << bits;
2588 if ((mask & constant) != mask)
2589 warning ("comparison of promoted ~unsigned with constant");
2592 else if (unsignedp0 && unsignedp1
2593 && (TYPE_PRECISION (TREE_TYPE (primop0))
2594 < TYPE_PRECISION (result_type))
2595 && (TYPE_PRECISION (TREE_TYPE (primop1))
2596 < TYPE_PRECISION (result_type)))
2597 warning ("comparison of promoted ~unsigned with unsigned");
2603 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2604 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2605 Then the expression will be built.
2606 It will be given type FINAL_TYPE if that is nonzero;
2607 otherwise, it will be given type RESULT_TYPE. */
2611 binary_op_error (code);
2612 return error_mark_node;
2617 if (TREE_TYPE (op0) != result_type)
2618 op0 = convert (result_type, op0);
2619 if (TREE_TYPE (op1) != result_type)
2620 op1 = convert (result_type, op1);
2623 if (build_type == NULL_TREE)
2624 build_type = result_type;
2627 tree result = build (resultcode, build_type, op0, op1);
2630 folded = fold (result);
2631 if (folded == result)
2632 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2633 if (final_type != 0)
2634 return convert (final_type, folded);
2639 /* Return a tree for the difference of pointers OP0 and OP1.
2640 The resulting tree has type int. */
2643 pointer_diff (op0, op1)
2646 tree result, folded;
2647 tree restype = ptrdiff_type_node;
2649 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2650 tree con0, con1, lit0, lit1;
2651 tree orig_op1 = op1;
2653 if (pedantic || warn_pointer_arith)
2655 if (TREE_CODE (target_type) == VOID_TYPE)
2656 pedwarn ("pointer of type `void *' used in subtraction");
2657 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2658 pedwarn ("pointer to a function used in subtraction");
2661 /* If the conversion to ptrdiff_type does anything like widening or
2662 converting a partial to an integral mode, we get a convert_expression
2663 that is in the way to do any simplifications.
2664 (fold-const.c doesn't know that the extra bits won't be needed.
2665 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2666 different mode in place.)
2667 So first try to find a common term here 'by hand'; we want to cover
2668 at least the cases that occur in legal static initializers. */
2669 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2670 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2672 if (TREE_CODE (con0) == PLUS_EXPR)
2674 lit0 = TREE_OPERAND (con0, 1);
2675 con0 = TREE_OPERAND (con0, 0);
2678 lit0 = integer_zero_node;
2680 if (TREE_CODE (con1) == PLUS_EXPR)
2682 lit1 = TREE_OPERAND (con1, 1);
2683 con1 = TREE_OPERAND (con1, 0);
2686 lit1 = integer_zero_node;
2688 if (operand_equal_p (con0, con1, 0))
2695 /* First do the subtraction as integers;
2696 then drop through to build the divide operator.
2697 Do not do default conversions on the minus operator
2698 in case restype is a short type. */
2700 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2701 convert (restype, op1), 0);
2702 /* This generates an error if op1 is pointer to incomplete type. */
2703 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2704 error ("arithmetic on pointer to an incomplete type");
2706 /* This generates an error if op0 is pointer to incomplete type. */
2707 op1 = c_size_in_bytes (target_type);
2709 /* Divide by the size, in easiest possible way. */
2711 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2713 folded = fold (result);
2714 if (folded == result)
2715 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2719 /* Construct and perhaps optimize a tree representation
2720 for a unary operation. CODE, a tree_code, specifies the operation
2721 and XARG is the operand.
2722 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2723 the default promotions (such as from short to int).
2724 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2725 allows non-lvalues; this is only used to handle conversion of non-lvalue
2726 arrays to pointers in C99. */
2729 build_unary_op (code, xarg, flag)
2730 enum tree_code code;
2734 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2737 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2739 int noconvert = flag;
2741 if (typecode == ERROR_MARK)
2742 return error_mark_node;
2743 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2744 typecode = INTEGER_TYPE;
2749 /* This is used for unary plus, because a CONVERT_EXPR
2750 is enough to prevent anybody from looking inside for
2751 associativity, but won't generate any code. */
2752 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2753 || typecode == COMPLEX_TYPE))
2755 error ("wrong type argument to unary plus");
2756 return error_mark_node;
2758 else if (!noconvert)
2759 arg = default_conversion (arg);
2763 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2764 || typecode == COMPLEX_TYPE))
2766 error ("wrong type argument to unary minus");
2767 return error_mark_node;
2769 else if (!noconvert)
2770 arg = default_conversion (arg);
2774 if (typecode == COMPLEX_TYPE)
2778 pedwarn ("ISO C does not support `~' for complex conjugation");
2780 arg = default_conversion (arg);
2782 else if (typecode != INTEGER_TYPE)
2784 error ("wrong type argument to bit-complement");
2785 return error_mark_node;
2787 else if (!noconvert)
2788 arg = default_conversion (arg);
2792 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2793 || typecode == COMPLEX_TYPE))
2795 error ("wrong type argument to abs");
2796 return error_mark_node;
2798 else if (!noconvert)
2799 arg = default_conversion (arg);
2803 /* Conjugating a real value is a no-op, but allow it anyway. */
2804 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2805 || typecode == COMPLEX_TYPE))
2807 error ("wrong type argument to conjugation");
2808 return error_mark_node;
2810 else if (!noconvert)
2811 arg = default_conversion (arg);
2814 case TRUTH_NOT_EXPR:
2815 if (typecode != INTEGER_TYPE
2816 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2817 && typecode != COMPLEX_TYPE
2818 /* These will convert to a pointer. */
2819 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2821 error ("wrong type argument to unary exclamation mark");
2822 return error_mark_node;
2824 arg = truthvalue_conversion (arg);
2825 return invert_truthvalue (arg);
2831 if (TREE_CODE (arg) == COMPLEX_CST)
2832 return TREE_REALPART (arg);
2833 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2834 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2839 if (TREE_CODE (arg) == COMPLEX_CST)
2840 return TREE_IMAGPART (arg);
2841 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2842 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2844 return convert (TREE_TYPE (arg), integer_zero_node);
2846 case PREINCREMENT_EXPR:
2847 case POSTINCREMENT_EXPR:
2848 case PREDECREMENT_EXPR:
2849 case POSTDECREMENT_EXPR:
2850 /* Handle complex lvalues (when permitted)
2851 by reduction to simpler cases. */
2853 val = unary_complex_lvalue (code, arg, 0);
2857 /* Increment or decrement the real part of the value,
2858 and don't change the imaginary part. */
2859 if (typecode == COMPLEX_TYPE)
2864 pedwarn ("ISO C does not support `++' and `--' on complex types");
2866 arg = stabilize_reference (arg);
2867 real = build_unary_op (REALPART_EXPR, arg, 1);
2868 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2869 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2870 build_unary_op (code, real, 1), imag);
2873 /* Report invalid types. */
2875 if (typecode != POINTER_TYPE
2876 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2878 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2879 error ("wrong type argument to increment");
2881 error ("wrong type argument to decrement");
2883 return error_mark_node;
2888 tree result_type = TREE_TYPE (arg);
2890 arg = get_unwidened (arg, 0);
2891 argtype = TREE_TYPE (arg);
2893 /* Compute the increment. */
2895 if (typecode == POINTER_TYPE)
2897 /* If pointer target is an undefined struct,
2898 we just cannot know how to do the arithmetic. */
2899 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2901 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2902 error ("increment of pointer to unknown structure");
2904 error ("decrement of pointer to unknown structure");
2906 else if ((pedantic || warn_pointer_arith)
2907 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2908 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2910 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2911 pedwarn ("wrong type argument to increment");
2913 pedwarn ("wrong type argument to decrement");
2916 inc = c_size_in_bytes (TREE_TYPE (result_type));
2919 inc = integer_one_node;
2921 inc = convert (argtype, inc);
2923 /* Handle incrementing a cast-expression. */
2926 switch (TREE_CODE (arg))
2931 case FIX_TRUNC_EXPR:
2932 case FIX_FLOOR_EXPR:
2933 case FIX_ROUND_EXPR:
2935 pedantic_lvalue_warning (CONVERT_EXPR);
2936 /* If the real type has the same machine representation
2937 as the type it is cast to, we can make better output
2938 by adding directly to the inside of the cast. */
2939 if ((TREE_CODE (TREE_TYPE (arg))
2940 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2941 && (TYPE_MODE (TREE_TYPE (arg))
2942 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2943 arg = TREE_OPERAND (arg, 0);
2946 tree incremented, modify, value;
2947 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2948 value = boolean_increment (code, arg);
2951 arg = stabilize_reference (arg);
2952 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
2955 value = save_expr (arg);
2956 incremented = build (((code == PREINCREMENT_EXPR
2957 || code == POSTINCREMENT_EXPR)
2958 ? PLUS_EXPR : MINUS_EXPR),
2959 argtype, value, inc);
2960 TREE_SIDE_EFFECTS (incremented) = 1;
2961 modify = build_modify_expr (arg, NOP_EXPR, incremented);
2962 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
2964 TREE_USED (value) = 1;
2974 /* Complain about anything else that is not a true lvalue. */
2975 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2976 || code == POSTINCREMENT_EXPR)
2977 ? "invalid lvalue in increment"
2978 : "invalid lvalue in decrement")))
2979 return error_mark_node;
2981 /* Report a read-only lvalue. */
2982 if (TREE_READONLY (arg))
2983 readonly_warning (arg,
2984 ((code == PREINCREMENT_EXPR
2985 || code == POSTINCREMENT_EXPR)
2986 ? "increment" : "decrement"));
2988 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2989 val = boolean_increment (code, arg);
2991 val = build (code, TREE_TYPE (arg), arg, inc);
2992 TREE_SIDE_EFFECTS (val) = 1;
2993 val = convert (result_type, val);
2994 if (TREE_CODE (val) != code)
2995 TREE_NO_UNUSED_WARNING (val) = 1;
3000 /* Note that this operation never does default_conversion. */
3002 /* Let &* cancel out to simplify resulting code. */
3003 if (TREE_CODE (arg) == INDIRECT_REF)
3005 /* Don't let this be an lvalue. */
3006 if (lvalue_p (TREE_OPERAND (arg, 0)))
3007 return non_lvalue (TREE_OPERAND (arg, 0));
3008 return TREE_OPERAND (arg, 0);
3011 /* For &x[y], return x+y */
3012 if (TREE_CODE (arg) == ARRAY_REF)
3014 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
3015 return error_mark_node;
3016 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
3017 TREE_OPERAND (arg, 1), 1);
3020 /* Handle complex lvalues (when permitted)
3021 by reduction to simpler cases. */
3022 val = unary_complex_lvalue (code, arg, flag);
3026 #if 0 /* Turned off because inconsistent;
3027 float f; *&(int)f = 3.4 stores in int format
3028 whereas (int)f = 3.4 stores in float format. */
3029 /* Address of a cast is just a cast of the address
3030 of the operand of the cast. */
3031 switch (TREE_CODE (arg))
3036 case FIX_TRUNC_EXPR:
3037 case FIX_FLOOR_EXPR:
3038 case FIX_ROUND_EXPR:
3041 pedwarn ("ISO C forbids the address of a cast expression");
3042 return convert (build_pointer_type (TREE_TYPE (arg)),
3043 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3048 /* Anything not already handled and not a true memory reference
3049 or a non-lvalue array is an error. */
3050 else if (typecode != FUNCTION_TYPE && !flag
3051 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3052 return error_mark_node;
3054 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3055 argtype = TREE_TYPE (arg);
3057 /* If the lvalue is const or volatile, merge that into the type
3058 to which the address will point. Note that you can't get a
3059 restricted pointer by taking the address of something, so we
3060 only have to deal with `const' and `volatile' here. */
3061 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3062 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3063 argtype = c_build_type_variant (argtype,
3064 TREE_READONLY (arg),
3065 TREE_THIS_VOLATILE (arg));
3067 argtype = build_pointer_type (argtype);
3069 if (mark_addressable (arg) == 0)
3070 return error_mark_node;
3075 if (TREE_CODE (arg) == COMPONENT_REF)
3077 tree field = TREE_OPERAND (arg, 1);
3079 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag);
3081 if (DECL_C_BIT_FIELD (field))
3083 error ("attempt to take address of bit-field structure member `%s'",
3084 IDENTIFIER_POINTER (DECL_NAME (field)));
3085 return error_mark_node;
3088 addr = fold (build (PLUS_EXPR, argtype,
3089 convert (argtype, addr),
3090 convert (argtype, byte_position (field))));
3093 addr = build1 (code, argtype, arg);
3095 /* Address of a static or external variable or
3096 file-scope function counts as a constant. */
3098 && ! (TREE_CODE (arg) == FUNCTION_DECL
3099 && DECL_CONTEXT (arg) != 0))
3100 TREE_CONSTANT (addr) = 1;
3109 argtype = TREE_TYPE (arg);
3110 return fold (build1 (code, argtype, arg));
3114 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3115 convert ARG with the same conversions in the same order
3116 and return the result. */
3119 convert_sequence (conversions, arg)
3123 switch (TREE_CODE (conversions))
3128 case FIX_TRUNC_EXPR:
3129 case FIX_FLOOR_EXPR:
3130 case FIX_ROUND_EXPR:
3132 return convert (TREE_TYPE (conversions),
3133 convert_sequence (TREE_OPERAND (conversions, 0),
3142 /* Return nonzero if REF is an lvalue valid for this language.
3143 Lvalues can be assigned, unless their type has TYPE_READONLY.
3144 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3150 enum tree_code code = TREE_CODE (ref);
3157 return lvalue_p (TREE_OPERAND (ref, 0));
3159 case COMPOUND_LITERAL_EXPR:
3169 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3170 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3174 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3181 /* Return nonzero if REF is an lvalue valid for this language;
3182 otherwise, print an error message and return zero. */
3185 lvalue_or_else (ref, msgid)
3189 int win = lvalue_p (ref);
3192 error ("%s", msgid);
3197 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3198 for certain kinds of expressions which are not really lvalues
3199 but which we can accept as lvalues. If FLAG is nonzero, then
3200 non-lvalues are OK since we may be converting a non-lvalue array to
3203 If ARG is not a kind of expression we can handle, return zero. */
3206 unary_complex_lvalue (code, arg, flag)
3207 enum tree_code code;
3211 /* Handle (a, b) used as an "lvalue". */
3212 if (TREE_CODE (arg) == COMPOUND_EXPR)
3214 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3216 /* If this returns a function type, it isn't really being used as
3217 an lvalue, so don't issue a warning about it. */
3218 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3219 pedantic_lvalue_warning (COMPOUND_EXPR);
3221 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3222 TREE_OPERAND (arg, 0), real_result);
3225 /* Handle (a ? b : c) used as an "lvalue". */
3226 if (TREE_CODE (arg) == COND_EXPR)
3229 pedantic_lvalue_warning (COND_EXPR);
3230 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3231 pedantic_lvalue_warning (COMPOUND_EXPR);
3233 return (build_conditional_expr
3234 (TREE_OPERAND (arg, 0),
3235 build_unary_op (code, TREE_OPERAND (arg, 1), flag),
3236 build_unary_op (code, TREE_OPERAND (arg, 2), flag)));
3242 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3243 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3246 pedantic_lvalue_warning (code)
3247 enum tree_code code;
3253 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3256 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3259 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3264 /* Warn about storing in something that is `const'. */
3267 readonly_warning (arg, msgid)
3271 if (TREE_CODE (arg) == COMPONENT_REF)
3273 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3274 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3276 pedwarn ("%s of read-only member `%s'", _(msgid),
3277 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3279 else if (TREE_CODE (arg) == VAR_DECL)
3280 pedwarn ("%s of read-only variable `%s'", _(msgid),
3281 IDENTIFIER_POINTER (DECL_NAME (arg)));
3283 pedwarn ("%s of read-only location", _(msgid));
3286 /* Mark EXP saying that we need to be able to take the
3287 address of it; it should not be allocated in a register.
3288 Value is 1 if successful. */
3291 mark_addressable (exp)
3296 switch (TREE_CODE (x))
3299 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3301 error ("cannot take address of bit-field `%s'",
3302 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3306 /* ... fall through ... */
3312 x = TREE_OPERAND (x, 0);
3315 case COMPOUND_LITERAL_EXPR:
3317 TREE_ADDRESSABLE (x) = 1;
3324 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3325 && DECL_NONLOCAL (x))
3327 if (TREE_PUBLIC (x))
3329 error ("global register variable `%s' used in nested function",
3330 IDENTIFIER_POINTER (DECL_NAME (x)));
3333 pedwarn ("register variable `%s' used in nested function",
3334 IDENTIFIER_POINTER (DECL_NAME (x)));
3336 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3338 if (TREE_PUBLIC (x))
3340 error ("address of global register variable `%s' requested",
3341 IDENTIFIER_POINTER (DECL_NAME (x)));
3345 /* If we are making this addressable due to its having
3346 volatile components, give a different error message. Also
3347 handle the case of an unnamed parameter by not trying
3348 to give the name. */
3350 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3352 error ("cannot put object with volatile field into register");
3356 pedwarn ("address of register variable `%s' requested",
3357 IDENTIFIER_POINTER (DECL_NAME (x)));
3359 put_var_into_stack (x);
3363 TREE_ADDRESSABLE (x) = 1;
3364 #if 0 /* poplevel deals with this now. */
3365 if (DECL_CONTEXT (x) == 0)
3366 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3374 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3377 build_conditional_expr (ifexp, op1, op2)
3378 tree ifexp, op1, op2;
3382 enum tree_code code1;
3383 enum tree_code code2;
3384 tree result_type = NULL;
3385 tree orig_op1 = op1, orig_op2 = op2;
3387 ifexp = truthvalue_conversion (default_conversion (ifexp));
3389 #if 0 /* Produces wrong result if within sizeof. */
3390 /* Don't promote the operands separately if they promote
3391 the same way. Return the unpromoted type and let the combined
3392 value get promoted if necessary. */
3394 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3395 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3396 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3397 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3399 if (TREE_CODE (ifexp) == INTEGER_CST)
3400 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3402 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3406 /* Promote both alternatives. */
3408 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3409 op1 = default_conversion (op1);
3410 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3411 op2 = default_conversion (op2);
3413 if (TREE_CODE (ifexp) == ERROR_MARK
3414 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3415 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3416 return error_mark_node;
3418 type1 = TREE_TYPE (op1);
3419 code1 = TREE_CODE (type1);
3420 type2 = TREE_TYPE (op2);
3421 code2 = TREE_CODE (type2);
3423 /* Quickly detect the usual case where op1 and op2 have the same type
3425 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3428 result_type = type1;
3430 result_type = TYPE_MAIN_VARIANT (type1);
3432 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3433 || code1 == COMPLEX_TYPE)
3434 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3435 || code2 == COMPLEX_TYPE))
3437 result_type = common_type (type1, type2);
3439 /* If -Wsign-compare, warn here if type1 and type2 have
3440 different signedness. We'll promote the signed to unsigned
3441 and later code won't know it used to be different.
3442 Do this check on the original types, so that explicit casts
3443 will be considered, but default promotions won't. */
3444 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3445 && !skip_evaluation)
3447 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3448 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3450 if (unsigned_op1 ^ unsigned_op2)
3452 /* Do not warn if the result type is signed, since the
3453 signed type will only be chosen if it can represent
3454 all the values of the unsigned type. */
3455 if (! TREE_UNSIGNED (result_type))
3457 /* Do not warn if the signed quantity is an unsuffixed
3458 integer literal (or some static constant expression
3459 involving such literals) and it is non-negative. */
3460 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3461 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3464 warning ("signed and unsigned type in conditional expression");
3468 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3470 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3471 pedwarn ("ISO C forbids conditional expr with only one void side");
3472 result_type = void_type_node;
3474 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3476 if (comp_target_types (type1, type2))
3477 result_type = common_type (type1, type2);
3478 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3479 && TREE_CODE (orig_op1) != NOP_EXPR)
3480 result_type = qualify_type (type2, type1);
3481 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3482 && TREE_CODE (orig_op2) != NOP_EXPR)
3483 result_type = qualify_type (type1, type2);
3484 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3486 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3487 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3488 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3489 TREE_TYPE (type2)));
3491 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3493 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3494 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3495 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3496 TREE_TYPE (type1)));
3500 pedwarn ("pointer type mismatch in conditional expression");
3501 result_type = build_pointer_type (void_type_node);
3504 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3506 if (! integer_zerop (op2))
3507 pedwarn ("pointer/integer type mismatch in conditional expression");
3510 op2 = null_pointer_node;
3512 result_type = type1;
3514 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3516 if (!integer_zerop (op1))
3517 pedwarn ("pointer/integer type mismatch in conditional expression");
3520 op1 = null_pointer_node;
3522 result_type = type2;
3527 if (flag_cond_mismatch)
3528 result_type = void_type_node;
3531 error ("type mismatch in conditional expression");
3532 return error_mark_node;
3536 /* Merge const and volatile flags of the incoming types. */
3538 = build_type_variant (result_type,
3539 TREE_READONLY (op1) || TREE_READONLY (op2),
3540 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3542 if (result_type != TREE_TYPE (op1))
3543 op1 = convert_and_check (result_type, op1);
3544 if (result_type != TREE_TYPE (op2))
3545 op2 = convert_and_check (result_type, op2);
3547 if (TREE_CODE (ifexp) == INTEGER_CST)
3548 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3550 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3553 /* Given a list of expressions, return a compound expression
3554 that performs them all and returns the value of the last of them. */
3557 build_compound_expr (list)
3560 return internal_build_compound_expr (list, TRUE);
3564 internal_build_compound_expr (list, first_p)
3570 if (TREE_CHAIN (list) == 0)
3572 /* Convert arrays and functions to pointers when there
3573 really is a comma operator. */
3576 = default_function_array_conversion (TREE_VALUE (list));
3578 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3579 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3581 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3582 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3583 list = TREE_OPERAND (list, 0);
3586 /* Don't let (0, 0) be null pointer constant. */
3587 if (!first_p && integer_zerop (TREE_VALUE (list)))
3588 return non_lvalue (TREE_VALUE (list));
3589 return TREE_VALUE (list);
3592 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3594 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3596 /* The left-hand operand of a comma expression is like an expression
3597 statement: with -W or -Wunused, we should warn if it doesn't have
3598 any side-effects, unless it was explicitly cast to (void). */
3599 if ((extra_warnings || warn_unused_value)
3600 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3601 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3602 warning ("left-hand operand of comma expression has no effect");
3604 /* When pedantic, a compound expression can be neither an lvalue
3605 nor an integer constant expression. */
3610 /* With -Wunused, we should also warn if the left-hand operand does have
3611 side-effects, but computes a value which is not used. For example, in
3612 `foo() + bar(), baz()' the result of the `+' operator is not used,
3613 so we should issue a warning. */
3614 else if (warn_unused_value)
3615 warn_if_unused_value (TREE_VALUE (list));
3617 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3620 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3623 build_c_cast (type, expr)
3629 if (type == error_mark_node || expr == error_mark_node)
3630 return error_mark_node;
3631 type = TYPE_MAIN_VARIANT (type);
3634 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3635 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3636 value = TREE_OPERAND (value, 0);
3639 if (TREE_CODE (type) == ARRAY_TYPE)
3641 error ("cast specifies array type");
3642 return error_mark_node;
3645 if (TREE_CODE (type) == FUNCTION_TYPE)
3647 error ("cast specifies function type");
3648 return error_mark_node;
3651 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3655 if (TREE_CODE (type) == RECORD_TYPE
3656 || TREE_CODE (type) == UNION_TYPE)
3657 pedwarn ("ISO C forbids casting nonscalar to the same type");
3660 else if (TREE_CODE (type) == UNION_TYPE)
3663 value = default_function_array_conversion (value);
3665 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3666 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3667 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3676 pedwarn ("ISO C forbids casts to union type");
3677 if (TYPE_NAME (type) != 0)
3679 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3680 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3682 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3686 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3687 build_tree_list (field, value)),
3689 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3692 error ("cast to union type from type not present in union");
3693 return error_mark_node;
3699 /* If casting to void, avoid the error that would come
3700 from default_conversion in the case of a non-lvalue array. */
3701 if (type == void_type_node)
3702 return build1 (CONVERT_EXPR, type, value);
3704 /* Convert functions and arrays to pointers,
3705 but don't convert any other types. */
3706 value = default_function_array_conversion (value);
3707 otype = TREE_TYPE (value);
3709 /* Optionally warn about potentially worrisome casts. */
3712 && TREE_CODE (type) == POINTER_TYPE
3713 && TREE_CODE (otype) == POINTER_TYPE)
3715 tree in_type = type;
3716 tree in_otype = otype;
3720 /* Check that the qualifiers on IN_TYPE are a superset of
3721 the qualifiers of IN_OTYPE. The outermost level of
3722 POINTER_TYPE nodes is uninteresting and we stop as soon
3723 as we hit a non-POINTER_TYPE node on either type. */
3726 in_otype = TREE_TYPE (in_otype);
3727 in_type = TREE_TYPE (in_type);
3729 /* GNU C allows cv-qualified function types. 'const'
3730 means the function is very pure, 'volatile' means it
3731 can't return. We need to warn when such qualifiers
3732 are added, not when they're taken away. */
3733 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3734 && TREE_CODE (in_type) == FUNCTION_TYPE)
3735 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3737 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3739 while (TREE_CODE (in_type) == POINTER_TYPE
3740 && TREE_CODE (in_otype) == POINTER_TYPE);
3743 warning ("cast adds new qualifiers to function type");
3746 /* There are qualifiers present in IN_OTYPE that are not
3747 present in IN_TYPE. */
3748 warning ("cast discards qualifiers from pointer target type");
3751 /* Warn about possible alignment problems. */
3752 if (STRICT_ALIGNMENT && warn_cast_align
3753 && TREE_CODE (type) == POINTER_TYPE
3754 && TREE_CODE (otype) == POINTER_TYPE
3755 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3756 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3757 /* Don't warn about opaque types, where the actual alignment
3758 restriction is unknown. */
3759 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3760 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3761 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3762 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3763 warning ("cast increases required alignment of target type");
3765 if (TREE_CODE (type) == INTEGER_TYPE
3766 && TREE_CODE (otype) == POINTER_TYPE
3767 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3768 && !TREE_CONSTANT (value))
3769 warning ("cast from pointer to integer of different size");
3771 if (warn_bad_function_cast
3772 && TREE_CODE (value) == CALL_EXPR
3773 && TREE_CODE (type) != TREE_CODE (otype))
3774 warning ("cast does not match function type");
3776 if (TREE_CODE (type) == POINTER_TYPE
3777 && TREE_CODE (otype) == INTEGER_TYPE
3778 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3779 /* Don't warn about converting any constant. */
3780 && !TREE_CONSTANT (value))
3781 warning ("cast to pointer from integer of different size");
3784 value = convert (type, value);
3786 /* Ignore any integer overflow caused by the cast. */
3787 if (TREE_CODE (value) == INTEGER_CST)
3789 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3790 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3794 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3795 if (pedantic && TREE_CODE (value) == INTEGER_CST
3796 && TREE_CODE (expr) == INTEGER_CST
3797 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3798 value = non_lvalue (value);
3800 /* If pedantic, don't let a cast be an lvalue. */
3801 if (value == expr && pedantic)
3802 value = non_lvalue (value);
3807 /* Interpret a cast of expression EXPR to type TYPE. */
3809 c_cast_expr (type, expr)
3812 int saved_wsp = warn_strict_prototypes;
3814 /* This avoids warnings about unprototyped casts on
3815 integers. E.g. "#define SIG_DFL (void(*)())0". */
3816 if (TREE_CODE (expr) == INTEGER_CST)
3817 warn_strict_prototypes = 0;
3818 type = groktypename (type);
3819 warn_strict_prototypes = saved_wsp;
3821 return build_c_cast (type, expr);
3825 /* Build an assignment expression of lvalue LHS from value RHS.
3826 MODIFYCODE is the code for a binary operator that we use
3827 to combine the old value of LHS with RHS to get the new value.
3828 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3831 build_modify_expr (lhs, modifycode, rhs)
3833 enum tree_code modifycode;
3837 tree lhstype = TREE_TYPE (lhs);
3838 tree olhstype = lhstype;
3840 /* Types that aren't fully specified cannot be used in assignments. */
3841 lhs = require_complete_type (lhs);
3843 /* Avoid duplicate error messages from operands that had errors. */
3844 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3845 return error_mark_node;
3847 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3848 /* Do not use STRIP_NOPS here. We do not want an enumerator
3849 whose value is 0 to count as a null pointer constant. */
3850 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3851 rhs = TREE_OPERAND (rhs, 0);
3855 /* Handle control structure constructs used as "lvalues". */
3857 switch (TREE_CODE (lhs))
3859 /* Handle (a, b) used as an "lvalue". */
3861 pedantic_lvalue_warning (COMPOUND_EXPR);
3862 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3863 if (TREE_CODE (newrhs) == ERROR_MARK)
3864 return error_mark_node;
3865 return build (COMPOUND_EXPR, lhstype,
3866 TREE_OPERAND (lhs, 0), newrhs);
3868 /* Handle (a ? b : c) used as an "lvalue". */
3870 pedantic_lvalue_warning (COND_EXPR);
3871 rhs = save_expr (rhs);
3873 /* Produce (a ? (b = rhs) : (c = rhs))
3874 except that the RHS goes through a save-expr
3875 so the code to compute it is only emitted once. */
3877 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3878 build_modify_expr (TREE_OPERAND (lhs, 1),
3880 build_modify_expr (TREE_OPERAND (lhs, 2),
3882 if (TREE_CODE (cond) == ERROR_MARK)
3884 /* Make sure the code to compute the rhs comes out
3885 before the split. */
3886 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3887 /* But cast it to void to avoid an "unused" error. */
3888 convert (void_type_node, rhs), cond);
3894 /* If a binary op has been requested, combine the old LHS value with the RHS
3895 producing the value we should actually store into the LHS. */
3897 if (modifycode != NOP_EXPR)
3899 lhs = stabilize_reference (lhs);
3900 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3903 /* Handle a cast used as an "lvalue".
3904 We have already performed any binary operator using the value as cast.
3905 Now convert the result to the cast type of the lhs,
3906 and then true type of the lhs and store it there;
3907 then convert result back to the cast type to be the value
3908 of the assignment. */
3910 switch (TREE_CODE (lhs))
3915 case FIX_TRUNC_EXPR:
3916 case FIX_FLOOR_EXPR:
3917 case FIX_ROUND_EXPR:
3919 newrhs = default_function_array_conversion (newrhs);
3921 tree inner_lhs = TREE_OPERAND (lhs, 0);
3923 result = build_modify_expr (inner_lhs, NOP_EXPR,
3924 convert (TREE_TYPE (inner_lhs),
3925 convert (lhstype, newrhs)));
3926 if (TREE_CODE (result) == ERROR_MARK)
3928 pedantic_lvalue_warning (CONVERT_EXPR);
3929 return convert (TREE_TYPE (lhs), result);
3936 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3937 Reject anything strange now. */
3939 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3940 return error_mark_node;
3942 /* Warn about storing in something that is `const'. */
3944 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3945 || ((TREE_CODE (lhstype) == RECORD_TYPE
3946 || TREE_CODE (lhstype) == UNION_TYPE)
3947 && C_TYPE_FIELDS_READONLY (lhstype)))
3948 readonly_warning (lhs, "assignment");
3950 /* If storing into a structure or union member,
3951 it has probably been given type `int'.
3952 Compute the type that would go with
3953 the actual amount of storage the member occupies. */
3955 if (TREE_CODE (lhs) == COMPONENT_REF
3956 && (TREE_CODE (lhstype) == INTEGER_TYPE
3957 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3958 || TREE_CODE (lhstype) == REAL_TYPE
3959 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3960 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3962 /* If storing in a field that is in actuality a short or narrower than one,
3963 we must store in the field in its actual type. */
3965 if (lhstype != TREE_TYPE (lhs))
3967 lhs = copy_node (lhs);
3968 TREE_TYPE (lhs) = lhstype;
3971 /* Convert new value to destination type. */
3973 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
3974 NULL_TREE, NULL_TREE, 0);
3975 if (TREE_CODE (newrhs) == ERROR_MARK)
3976 return error_mark_node;
3980 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
3981 TREE_SIDE_EFFECTS (result) = 1;
3983 /* If we got the LHS in a different type for storing in,
3984 convert the result back to the nominal type of LHS
3985 so that the value we return always has the same type
3986 as the LHS argument. */
3988 if (olhstype == TREE_TYPE (result))
3990 return convert_for_assignment (olhstype, result, _("assignment"),
3991 NULL_TREE, NULL_TREE, 0);
3994 /* Convert value RHS to type TYPE as preparation for an assignment
3995 to an lvalue of type TYPE.
3996 The real work of conversion is done by `convert'.
3997 The purpose of this function is to generate error messages
3998 for assignments that are not allowed in C.
3999 ERRTYPE is a string to use in error messages:
4000 "assignment", "return", etc. If it is null, this is parameter passing
4001 for a function call (and different error messages are output).
4003 FUNNAME is the name of the function being called,
4004 as an IDENTIFIER_NODE, or null.
4005 PARMNUM is the number of the argument, for printing in error messages. */
4008 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
4010 const char *errtype;
4011 tree fundecl, funname;
4014 enum tree_code codel = TREE_CODE (type);
4016 enum tree_code coder;
4018 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4019 /* Do not use STRIP_NOPS here. We do not want an enumerator
4020 whose value is 0 to count as a null pointer constant. */
4021 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
4022 rhs = TREE_OPERAND (rhs, 0);
4024 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
4025 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4026 rhs = default_conversion (rhs);
4027 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4028 rhs = decl_constant_value_for_broken_optimization (rhs);
4030 rhstype = TREE_TYPE (rhs);
4031 coder = TREE_CODE (rhstype);
4033 if (coder == ERROR_MARK)
4034 return error_mark_node;
4036 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4038 overflow_warning (rhs);
4039 /* Check for Objective-C protocols. This will issue a warning if
4040 there are protocol violations. No need to use the return value. */
4041 maybe_objc_comptypes (type, rhstype, 0);
4045 if (coder == VOID_TYPE)
4047 error ("void value not ignored as it ought to be");
4048 return error_mark_node;
4050 /* A type converts to a reference to it.
4051 This code doesn't fully support references, it's just for the
4052 special case of va_start and va_copy. */
4053 if (codel == REFERENCE_TYPE
4054 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4056 if (mark_addressable (rhs) == 0)
4057 return error_mark_node;
4058 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4060 /* We already know that these two types are compatible, but they
4061 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4062 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4063 likely to be va_list, a typedef to __builtin_va_list, which
4064 is different enough that it will cause problems later. */
4065 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4066 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4068 rhs = build1 (NOP_EXPR, type, rhs);
4071 /* Arithmetic types all interconvert, and enum is treated like int. */
4072 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4073 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4074 || codel == BOOLEAN_TYPE)
4075 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4076 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4077 || coder == BOOLEAN_TYPE))
4078 return convert_and_check (type, rhs);
4080 /* Conversion to a transparent union from its member types.
4081 This applies only to function arguments. */
4082 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4085 tree marginal_memb_type = 0;
4087 for (memb_types = TYPE_FIELDS (type); memb_types;
4088 memb_types = TREE_CHAIN (memb_types))
4090 tree memb_type = TREE_TYPE (memb_types);
4092 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4093 TYPE_MAIN_VARIANT (rhstype)))
4096 if (TREE_CODE (memb_type) != POINTER_TYPE)
4099 if (coder == POINTER_TYPE)
4101 tree ttl = TREE_TYPE (memb_type);
4102 tree ttr = TREE_TYPE (rhstype);
4104 /* Any non-function converts to a [const][volatile] void *
4105 and vice versa; otherwise, targets must be the same.
4106 Meanwhile, the lhs target must have all the qualifiers of
4108 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4109 || comp_target_types (memb_type, rhstype))
4111 /* If this type won't generate any warnings, use it. */
4112 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4113 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4114 && TREE_CODE (ttl) == FUNCTION_TYPE)
4115 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4116 == TYPE_QUALS (ttr))
4117 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4118 == TYPE_QUALS (ttl))))
4121 /* Keep looking for a better type, but remember this one. */
4122 if (! marginal_memb_type)
4123 marginal_memb_type = memb_type;
4127 /* Can convert integer zero to any pointer type. */
4128 if (integer_zerop (rhs)
4129 || (TREE_CODE (rhs) == NOP_EXPR
4130 && integer_zerop (TREE_OPERAND (rhs, 0))))
4132 rhs = null_pointer_node;
4137 if (memb_types || marginal_memb_type)
4141 /* We have only a marginally acceptable member type;
4142 it needs a warning. */
4143 tree ttl = TREE_TYPE (marginal_memb_type);
4144 tree ttr = TREE_TYPE (rhstype);
4146 /* Const and volatile mean something different for function
4147 types, so the usual warnings are not appropriate. */
4148 if (TREE_CODE (ttr) == FUNCTION_TYPE
4149 && TREE_CODE (ttl) == FUNCTION_TYPE)
4151 /* Because const and volatile on functions are
4152 restrictions that say the function will not do
4153 certain things, it is okay to use a const or volatile
4154 function where an ordinary one is wanted, but not
4156 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4157 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4158 errtype, funname, parmnum);
4160 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4161 warn_for_assignment ("%s discards qualifiers from pointer target type",
4166 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4167 pedwarn ("ISO C prohibits argument conversion to union type");
4169 return build1 (NOP_EXPR, type, rhs);
4173 /* Conversions among pointers */
4174 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4175 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4177 tree ttl = TREE_TYPE (type);
4178 tree ttr = TREE_TYPE (rhstype);
4180 /* Any non-function converts to a [const][volatile] void *
4181 and vice versa; otherwise, targets must be the same.
4182 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4183 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4184 || comp_target_types (type, rhstype)
4185 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4186 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4189 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4192 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4193 which are not ANSI null ptr constants. */
4194 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4195 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4196 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4197 errtype, funname, parmnum);
4198 /* Const and volatile mean something different for function types,
4199 so the usual warnings are not appropriate. */
4200 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4201 && TREE_CODE (ttl) != FUNCTION_TYPE)
4203 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4204 warn_for_assignment ("%s discards qualifiers from pointer target type",
4205 errtype, funname, parmnum);
4206 /* If this is not a case of ignoring a mismatch in signedness,
4208 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4209 || comp_target_types (type, rhstype))
4211 /* If there is a mismatch, do warn. */
4213 warn_for_assignment ("pointer targets in %s differ in signedness",
4214 errtype, funname, parmnum);
4216 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4217 && TREE_CODE (ttr) == FUNCTION_TYPE)
4219 /* Because const and volatile on functions are restrictions
4220 that say the function will not do certain things,
4221 it is okay to use a const or volatile function
4222 where an ordinary one is wanted, but not vice-versa. */
4223 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4224 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4225 errtype, funname, parmnum);
4229 warn_for_assignment ("%s from incompatible pointer type",
4230 errtype, funname, parmnum);
4231 return convert (type, rhs);
4233 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4235 /* An explicit constant 0 can convert to a pointer,
4236 or one that results from arithmetic, even including
4237 a cast to integer type. */
4238 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4240 ! (TREE_CODE (rhs) == NOP_EXPR
4241 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4242 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4243 && integer_zerop (TREE_OPERAND (rhs, 0))))
4245 warn_for_assignment ("%s makes pointer from integer without a cast",
4246 errtype, funname, parmnum);
4247 return convert (type, rhs);
4249 return null_pointer_node;
4251 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4253 warn_for_assignment ("%s makes integer from pointer without a cast",
4254 errtype, funname, parmnum);
4255 return convert (type, rhs);
4257 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4258 return convert (type, rhs);
4264 tree selector = maybe_building_objc_message_expr ();
4266 if (selector && parmnum > 2)
4267 error ("incompatible type for argument %d of `%s'",
4268 parmnum - 2, IDENTIFIER_POINTER (selector));
4270 error ("incompatible type for argument %d of `%s'",
4271 parmnum, IDENTIFIER_POINTER (funname));
4274 error ("incompatible type for argument %d of indirect function call",
4278 error ("incompatible types in %s", errtype);
4280 return error_mark_node;
4283 /* Print a warning using MSGID.
4284 It gets OPNAME as its one parameter.
4285 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4286 FUNCTION and ARGNUM are handled specially if we are building an
4287 Objective-C selector. */
4290 warn_for_assignment (msgid, opname, function, argnum)
4298 tree selector = maybe_building_objc_message_expr ();
4301 if (selector && argnum > 2)
4303 function = selector;
4308 /* Function name is known; supply it. */
4309 const char *const argstring = _("passing arg %d of `%s'");
4310 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4311 + strlen (argstring) + 1 + 25
4313 sprintf (new_opname, argstring, argnum,
4314 IDENTIFIER_POINTER (function));
4318 /* Function name unknown (call through ptr); just give arg number. */
4319 const char *const argnofun = _("passing arg %d of pointer to function");
4320 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4321 sprintf (new_opname, argnofun, argnum);
4323 opname = new_opname;
4325 pedwarn (msgid, opname);
4328 /* If VALUE is a compound expr all of whose expressions are constant, then
4329 return its value. Otherwise, return error_mark_node.
4331 This is for handling COMPOUND_EXPRs as initializer elements
4332 which is allowed with a warning when -pedantic is specified. */
4335 valid_compound_expr_initializer (value, endtype)
4339 if (TREE_CODE (value) == COMPOUND_EXPR)
4341 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4343 return error_mark_node;
4344 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4347 else if (! TREE_CONSTANT (value)
4348 && ! initializer_constant_valid_p (value, endtype))
4349 return error_mark_node;
4354 /* Perform appropriate conversions on the initial value of a variable,
4355 store it in the declaration DECL,
4356 and print any error messages that are appropriate.
4357 If the init is invalid, store an ERROR_MARK. */
4360 store_init_value (decl, init)
4365 /* If variable's type was invalidly declared, just ignore it. */
4367 type = TREE_TYPE (decl);
4368 if (TREE_CODE (type) == ERROR_MARK)
4371 /* Digest the specified initializer into an expression. */
4373 value = digest_init (type, init, TREE_STATIC (decl),
4374 TREE_STATIC (decl) || (pedantic && !flag_isoc99));
4376 /* Store the expression if valid; else report error. */
4379 /* Note that this is the only place we can detect the error
4380 in a case such as struct foo bar = (struct foo) { x, y };
4381 where there is one initial value which is a constructor expression. */
4382 if (value == error_mark_node)
4384 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4386 error ("initializer for static variable is not constant");
4387 value = error_mark_node;
4389 else if (TREE_STATIC (decl)
4390 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4392 error ("initializer for static variable uses complicated arithmetic");
4393 value = error_mark_node;
4397 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4399 if (! TREE_CONSTANT (value))
4400 pedwarn ("aggregate initializer is not constant");
4401 else if (! TREE_STATIC (value))
4402 pedwarn ("aggregate initializer uses complicated arithmetic");
4407 if (warn_traditional && !in_system_header
4408 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4409 warning ("traditional C rejects automatic aggregate initialization");
4411 DECL_INITIAL (decl) = value;
4413 /* ANSI wants warnings about out-of-range constant initializers. */
4414 STRIP_TYPE_NOPS (value);
4415 constant_expression_warning (value);
4417 /* Check if we need to set array size from compound literal size. */
4418 if (TREE_CODE (type) == ARRAY_TYPE
4419 && TYPE_DOMAIN (type) == 0
4420 && value != error_mark_node)
4422 tree inside_init = init;
4424 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4425 inside_init = TREE_OPERAND (init, 0);
4426 inside_init = fold (inside_init);
4428 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4430 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4432 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4434 /* For int foo[] = (int [3]){1}; we need to set array size
4435 now since later on array initializer will be just the
4436 brace enclosed list of the compound literal. */
4437 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4439 layout_decl (decl, 0);
4445 /* Methods for storing and printing names for error messages. */
4447 /* Implement a spelling stack that allows components of a name to be pushed
4448 and popped. Each element on the stack is this structure. */
4460 #define SPELLING_STRING 1
4461 #define SPELLING_MEMBER 2
4462 #define SPELLING_BOUNDS 3
4464 static struct spelling *spelling; /* Next stack element (unused). */
4465 static struct spelling *spelling_base; /* Spelling stack base. */
4466 static int spelling_size; /* Size of the spelling stack. */
4468 /* Macros to save and restore the spelling stack around push_... functions.
4469 Alternative to SAVE_SPELLING_STACK. */
4471 #define SPELLING_DEPTH() (spelling - spelling_base)
4472 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4474 /* Save and restore the spelling stack around arbitrary C code. */
4476 #define SAVE_SPELLING_DEPTH(code) \
4478 int __depth = SPELLING_DEPTH (); \
4480 RESTORE_SPELLING_DEPTH (__depth); \
4483 /* Push an element on the spelling stack with type KIND and assign VALUE
4486 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4488 int depth = SPELLING_DEPTH (); \
4490 if (depth >= spelling_size) \
4492 spelling_size += 10; \
4493 if (spelling_base == 0) \
4495 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4498 = (struct spelling *) xrealloc (spelling_base, \
4499 spelling_size * sizeof (struct spelling)); \
4500 RESTORE_SPELLING_DEPTH (depth); \
4503 spelling->kind = (KIND); \
4504 spelling->MEMBER = (VALUE); \
4508 /* Push STRING on the stack. Printed literally. */
4511 push_string (string)
4514 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4517 /* Push a member name on the stack. Printed as '.' STRING. */
4520 push_member_name (decl)
4524 const char *const string
4525 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4526 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4529 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4532 push_array_bounds (bounds)
4535 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4538 /* Compute the maximum size in bytes of the printed spelling. */
4546 for (p = spelling_base; p < spelling; p++)
4548 if (p->kind == SPELLING_BOUNDS)
4551 size += strlen (p->u.s) + 1;
4557 /* Print the spelling to BUFFER and return it. */
4560 print_spelling (buffer)
4566 for (p = spelling_base; p < spelling; p++)
4567 if (p->kind == SPELLING_BOUNDS)
4569 sprintf (d, "[%d]", p->u.i);
4575 if (p->kind == SPELLING_MEMBER)
4577 for (s = p->u.s; (*d = *s++); d++)
4584 /* Issue an error message for a bad initializer component.
4585 MSGID identifies the message.
4586 The component name is taken from the spelling stack. */
4594 error ("%s", _(msgid));
4595 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4597 error ("(near initialization for `%s')", ofwhat);
4600 /* Issue a pedantic warning for a bad initializer component.
4601 MSGID identifies the message.
4602 The component name is taken from the spelling stack. */
4605 pedwarn_init (msgid)
4610 pedwarn ("%s", _(msgid));
4611 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4613 pedwarn ("(near initialization for `%s')", ofwhat);
4616 /* Issue a warning for a bad initializer component.
4617 MSGID identifies the message.
4618 The component name is taken from the spelling stack. */
4621 warning_init (msgid)
4626 warning ("%s", _(msgid));
4627 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4629 warning ("(near initialization for `%s')", ofwhat);
4632 /* Digest the parser output INIT as an initializer for type TYPE.
4633 Return a C expression of type TYPE to represent the initial value.
4635 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4636 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4637 applies only to elements of constructors. */
4640 digest_init (type, init, require_constant, constructor_constant)
4642 int require_constant, constructor_constant;
4644 enum tree_code code = TREE_CODE (type);
4645 tree inside_init = init;
4647 if (type == error_mark_node
4648 || init == error_mark_node
4649 || TREE_TYPE (init) == error_mark_node)
4650 return error_mark_node;
4652 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4653 /* Do not use STRIP_NOPS here. We do not want an enumerator
4654 whose value is 0 to count as a null pointer constant. */
4655 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4656 inside_init = TREE_OPERAND (init, 0);
4658 inside_init = fold (inside_init);
4660 /* Initialization of an array of chars from a string constant
4661 optionally enclosed in braces. */
4663 if (code == ARRAY_TYPE)
4665 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4666 if ((typ1 == char_type_node
4667 || typ1 == signed_char_type_node
4668 || typ1 == unsigned_char_type_node
4669 || typ1 == unsigned_wchar_type_node
4670 || typ1 == signed_wchar_type_node)
4671 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4673 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4674 TYPE_MAIN_VARIANT (type)))
4677 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4679 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4681 error_init ("char-array initialized from wide string");
4682 return error_mark_node;
4684 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4686 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4688 error_init ("int-array initialized from non-wide string");
4689 return error_mark_node;
4692 TREE_TYPE (inside_init) = type;
4693 if (TYPE_DOMAIN (type) != 0
4694 && TYPE_SIZE (type) != 0
4695 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4696 /* Subtract 1 (or sizeof (wchar_t))
4697 because it's ok to ignore the terminating null char
4698 that is counted in the length of the constant. */
4699 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4700 TREE_STRING_LENGTH (inside_init)
4701 - ((TYPE_PRECISION (typ1)
4702 != TYPE_PRECISION (char_type_node))
4703 ? (TYPE_PRECISION (wchar_type_node)
4706 pedwarn_init ("initializer-string for array of chars is too long");
4712 /* Any type can be initialized
4713 from an expression of the same type, optionally with braces. */
4715 if (inside_init && TREE_TYPE (inside_init) != 0
4716 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4717 TYPE_MAIN_VARIANT (type))
4718 || (code == ARRAY_TYPE
4719 && comptypes (TREE_TYPE (inside_init), type))
4720 || (code == VECTOR_TYPE
4721 && comptypes (TREE_TYPE (inside_init), type))
4722 || (code == POINTER_TYPE
4723 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4724 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4725 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4726 TREE_TYPE (type)))))
4728 if (code == POINTER_TYPE)
4729 inside_init = default_function_array_conversion (inside_init);
4731 if (require_constant && !flag_isoc99
4732 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4734 /* As an extension, allow initializing objects with static storage
4735 duration with compound literals (which are then treated just as
4736 the brace enclosed list they contain). */
4737 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4738 inside_init = DECL_INITIAL (decl);
4741 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4742 && TREE_CODE (inside_init) != CONSTRUCTOR)
4744 error_init ("array initialized from non-constant array expression");
4745 return error_mark_node;
4748 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4749 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4751 /* Compound expressions can only occur here if -pedantic or
4752 -pedantic-errors is specified. In the later case, we always want
4753 an error. In the former case, we simply want a warning. */
4754 if (require_constant && pedantic
4755 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4758 = valid_compound_expr_initializer (inside_init,
4759 TREE_TYPE (inside_init));
4760 if (inside_init == error_mark_node)
4761 error_init ("initializer element is not constant");
4763 pedwarn_init ("initializer element is not constant");
4764 if (flag_pedantic_errors)
4765 inside_init = error_mark_node;
4767 else if (require_constant
4768 && (!TREE_CONSTANT (inside_init)
4769 /* This test catches things like `7 / 0' which
4770 result in an expression for which TREE_CONSTANT
4771 is true, but which is not actually something
4772 that is a legal constant. We really should not
4773 be using this function, because it is a part of
4774 the back-end. Instead, the expression should
4775 already have been turned into ERROR_MARK_NODE. */
4776 || !initializer_constant_valid_p (inside_init,
4777 TREE_TYPE (inside_init))))
4779 error_init ("initializer element is not constant");
4780 inside_init = error_mark_node;
4786 /* Handle scalar types, including conversions. */
4788 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4789 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4791 /* Note that convert_for_assignment calls default_conversion
4792 for arrays and functions. We must not call it in the
4793 case where inside_init is a null pointer constant. */
4795 = convert_for_assignment (type, init, _("initialization"),
4796 NULL_TREE, NULL_TREE, 0);
4798 if (require_constant && ! TREE_CONSTANT (inside_init))
4800 error_init ("initializer element is not constant");
4801 inside_init = error_mark_node;
4803 else if (require_constant
4804 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4806 error_init ("initializer element is not computable at load time");
4807 inside_init = error_mark_node;
4813 /* Come here only for records and arrays. */
4815 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4817 error_init ("variable-sized object may not be initialized");
4818 return error_mark_node;
4821 /* Traditionally, you can write struct foo x = 0;
4822 and it initializes the first element of x to 0. */
4823 if (flag_traditional)
4825 tree top = 0, prev = 0, otype = type;
4826 while (TREE_CODE (type) == RECORD_TYPE
4827 || TREE_CODE (type) == ARRAY_TYPE
4828 || TREE_CODE (type) == QUAL_UNION_TYPE
4829 || TREE_CODE (type) == UNION_TYPE)
4831 tree temp = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
4835 TREE_OPERAND (prev, 1) = build_tree_list (NULL_TREE, temp);
4837 if (TREE_CODE (type) == ARRAY_TYPE)
4838 type = TREE_TYPE (type);
4839 else if (TYPE_FIELDS (type))
4840 type = TREE_TYPE (TYPE_FIELDS (type));
4843 error_init ("invalid initializer");
4844 return error_mark_node;
4850 TREE_OPERAND (prev, 1)
4851 = build_tree_list (NULL_TREE,
4852 digest_init (type, init, require_constant,
4853 constructor_constant));
4857 return error_mark_node;
4859 error_init ("invalid initializer");
4860 return error_mark_node;
4863 /* Handle initializers that use braces. */
4865 /* Type of object we are accumulating a constructor for.
4866 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4867 static tree constructor_type;
4869 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4871 static tree constructor_fields;
4873 /* For an ARRAY_TYPE, this is the specified index
4874 at which to store the next element we get. */
4875 static tree constructor_index;
4877 /* For an ARRAY_TYPE, this is the maximum index. */
4878 static tree constructor_max_index;
4880 /* For a RECORD_TYPE, this is the first field not yet written out. */
4881 static tree constructor_unfilled_fields;
4883 /* For an ARRAY_TYPE, this is the index of the first element
4884 not yet written out. */
4885 static tree constructor_unfilled_index;
4887 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4888 This is so we can generate gaps between fields, when appropriate. */
4889 static tree constructor_bit_index;
4891 /* If we are saving up the elements rather than allocating them,
4892 this is the list of elements so far (in reverse order,
4893 most recent first). */
4894 static tree constructor_elements;
4896 /* 1 if constructor should be incrementally stored into a constructor chain,
4897 0 if all the elements should be kept in AVL tree. */
4898 static int constructor_incremental;
4900 /* 1 if so far this constructor's elements are all compile-time constants. */
4901 static int constructor_constant;
4903 /* 1 if so far this constructor's elements are all valid address constants. */
4904 static int constructor_simple;
4906 /* 1 if this constructor is erroneous so far. */
4907 static int constructor_erroneous;
4909 /* 1 if have called defer_addressed_constants. */
4910 static int constructor_subconstants_deferred;
4912 /* Structure for managing pending initializer elements, organized as an
4917 struct init_node *left, *right;
4918 struct init_node *parent;
4924 /* Tree of pending elements at this constructor level.
4925 These are elements encountered out of order
4926 which belong at places we haven't reached yet in actually
4928 Will never hold tree nodes across GC runs. */
4929 static struct init_node *constructor_pending_elts;
4931 /* The SPELLING_DEPTH of this constructor. */
4932 static int constructor_depth;
4934 /* 0 if implicitly pushing constructor levels is allowed. */
4935 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4937 static int require_constant_value;
4938 static int require_constant_elements;
4940 /* DECL node for which an initializer is being read.
4941 0 means we are reading a constructor expression
4942 such as (struct foo) {...}. */
4943 static tree constructor_decl;
4945 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4946 static const char *constructor_asmspec;
4948 /* Nonzero if this is an initializer for a top-level decl. */
4949 static int constructor_top_level;
4951 /* Nonzero if there were any member designators in this initializer. */
4952 static int constructor_designated;
4954 /* Nesting depth of designator list. */
4955 static int designator_depth;
4957 /* Nonzero if there were diagnosed errors in this designator list. */
4958 static int designator_errorneous;
4961 /* This stack has a level for each implicit or explicit level of
4962 structuring in the initializer, including the outermost one. It
4963 saves the values of most of the variables above. */
4965 struct constructor_range_stack;
4967 struct constructor_stack
4969 struct constructor_stack *next;
4974 tree unfilled_index;
4975 tree unfilled_fields;
4978 struct init_node *pending_elts;
4981 /* If nonzero, this value should replace the entire
4982 constructor at this level. */
4983 tree replacement_value;
4984 struct constructor_range_stack *range_stack;
4994 struct constructor_stack *constructor_stack;
4996 /* This stack represents designators from some range designator up to
4997 the last designator in the list. */
4999 struct constructor_range_stack
5001 struct constructor_range_stack *next, *prev;
5002 struct constructor_stack *stack;
5009 struct constructor_range_stack *constructor_range_stack;
5011 /* This stack records separate initializers that are nested.
5012 Nested initializers can't happen in ANSI C, but GNU C allows them
5013 in cases like { ... (struct foo) { ... } ... }. */
5015 struct initializer_stack
5017 struct initializer_stack *next;
5019 const char *asmspec;
5020 struct constructor_stack *constructor_stack;
5021 struct constructor_range_stack *constructor_range_stack;
5023 struct spelling *spelling;
5024 struct spelling *spelling_base;
5027 char require_constant_value;
5028 char require_constant_elements;
5032 struct initializer_stack *initializer_stack;
5034 /* Prepare to parse and output the initializer for variable DECL. */
5037 start_init (decl, asmspec_tree, top_level)
5043 struct initializer_stack *p
5044 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
5045 const char *asmspec = 0;
5048 asmspec = TREE_STRING_POINTER (asmspec_tree);
5050 p->decl = constructor_decl;
5051 p->asmspec = constructor_asmspec;
5052 p->require_constant_value = require_constant_value;
5053 p->require_constant_elements = require_constant_elements;
5054 p->constructor_stack = constructor_stack;
5055 p->constructor_range_stack = constructor_range_stack;
5056 p->elements = constructor_elements;
5057 p->spelling = spelling;
5058 p->spelling_base = spelling_base;
5059 p->spelling_size = spelling_size;
5060 p->deferred = constructor_subconstants_deferred;
5061 p->top_level = constructor_top_level;
5062 p->next = initializer_stack;
5063 initializer_stack = p;
5065 constructor_decl = decl;
5066 constructor_asmspec = asmspec;
5067 constructor_subconstants_deferred = 0;
5068 constructor_designated = 0;
5069 constructor_top_level = top_level;
5073 require_constant_value = TREE_STATIC (decl);
5074 require_constant_elements
5075 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5076 /* For a scalar, you can always use any value to initialize,
5077 even within braces. */
5078 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5079 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5080 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5081 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5082 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5086 require_constant_value = 0;
5087 require_constant_elements = 0;
5088 locus = "(anonymous)";
5091 constructor_stack = 0;
5092 constructor_range_stack = 0;
5094 missing_braces_mentioned = 0;
5098 RESTORE_SPELLING_DEPTH (0);
5101 push_string (locus);
5107 struct initializer_stack *p = initializer_stack;
5109 /* Output subconstants (string constants, usually)
5110 that were referenced within this initializer and saved up.
5111 Must do this if and only if we called defer_addressed_constants. */
5112 if (constructor_subconstants_deferred)
5113 output_deferred_addressed_constants ();
5115 /* Free the whole constructor stack of this initializer. */
5116 while (constructor_stack)
5118 struct constructor_stack *q = constructor_stack;
5119 constructor_stack = q->next;
5123 if (constructor_range_stack)
5126 /* Pop back to the data of the outer initializer (if any). */
5127 constructor_decl = p->decl;
5128 constructor_asmspec = p->asmspec;
5129 require_constant_value = p->require_constant_value;
5130 require_constant_elements = p->require_constant_elements;
5131 constructor_stack = p->constructor_stack;
5132 constructor_range_stack = p->constructor_range_stack;
5133 constructor_elements = p->elements;
5134 spelling = p->spelling;
5135 spelling_base = p->spelling_base;
5136 spelling_size = p->spelling_size;
5137 constructor_subconstants_deferred = p->deferred;
5138 constructor_top_level = p->top_level;
5139 initializer_stack = p->next;
5143 /* Call here when we see the initializer is surrounded by braces.
5144 This is instead of a call to push_init_level;
5145 it is matched by a call to pop_init_level.
5147 TYPE is the type to initialize, for a constructor expression.
5148 For an initializer for a decl, TYPE is zero. */
5151 really_start_incremental_init (type)
5154 struct constructor_stack *p
5155 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5158 type = TREE_TYPE (constructor_decl);
5160 p->type = constructor_type;
5161 p->fields = constructor_fields;
5162 p->index = constructor_index;
5163 p->max_index = constructor_max_index;
5164 p->unfilled_index = constructor_unfilled_index;
5165 p->unfilled_fields = constructor_unfilled_fields;
5166 p->bit_index = constructor_bit_index;
5167 p->elements = constructor_elements;
5168 p->constant = constructor_constant;
5169 p->simple = constructor_simple;
5170 p->erroneous = constructor_erroneous;
5171 p->pending_elts = constructor_pending_elts;
5172 p->depth = constructor_depth;
5173 p->replacement_value = 0;
5177 p->incremental = constructor_incremental;
5178 p->designated = constructor_designated;
5180 constructor_stack = p;
5182 constructor_constant = 1;
5183 constructor_simple = 1;
5184 constructor_depth = SPELLING_DEPTH ();
5185 constructor_elements = 0;
5186 constructor_pending_elts = 0;
5187 constructor_type = type;
5188 constructor_incremental = 1;
5189 constructor_designated = 0;
5190 designator_depth = 0;
5191 designator_errorneous = 0;
5193 if (TREE_CODE (constructor_type) == RECORD_TYPE
5194 || TREE_CODE (constructor_type) == UNION_TYPE)
5196 constructor_fields = TYPE_FIELDS (constructor_type);
5197 /* Skip any nameless bit fields at the beginning. */
5198 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5199 && DECL_NAME (constructor_fields) == 0)
5200 constructor_fields = TREE_CHAIN (constructor_fields);
5202 constructor_unfilled_fields = constructor_fields;
5203 constructor_bit_index = bitsize_zero_node;
5205 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5207 if (TYPE_DOMAIN (constructor_type))
5209 constructor_max_index
5210 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5212 /* Detect non-empty initializations of zero-length arrays. */
5213 if (constructor_max_index == NULL_TREE
5214 && TYPE_SIZE (constructor_type))
5215 constructor_max_index = build_int_2 (-1, -1);
5217 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5218 to initialize VLAs will cause an proper error; avoid tree
5219 checking errors as well by setting a safe value. */
5220 if (constructor_max_index
5221 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5222 constructor_max_index = build_int_2 (-1, -1);
5225 = convert (bitsizetype,
5226 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5229 constructor_index = bitsize_zero_node;
5231 constructor_unfilled_index = constructor_index;
5233 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5235 /* Vectors are like simple fixed-size arrays. */
5236 constructor_max_index =
5237 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5238 constructor_index = convert (bitsizetype, integer_zero_node);
5239 constructor_unfilled_index = constructor_index;
5243 /* Handle the case of int x = {5}; */
5244 constructor_fields = constructor_type;
5245 constructor_unfilled_fields = constructor_type;
5249 /* Push down into a subobject, for initialization.
5250 If this is for an explicit set of braces, IMPLICIT is 0.
5251 If it is because the next element belongs at a lower level,
5252 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5255 push_init_level (implicit)
5258 struct constructor_stack *p;
5259 tree value = NULL_TREE;
5261 /* If we've exhausted any levels that didn't have braces,
5263 while (constructor_stack->implicit)
5265 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5266 || TREE_CODE (constructor_type) == UNION_TYPE)
5267 && constructor_fields == 0)
5268 process_init_element (pop_init_level (1));
5269 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5270 && tree_int_cst_lt (constructor_max_index, constructor_index))
5271 process_init_element (pop_init_level (1));
5276 /* Unless this is an explicit brace, we need to preserve previous
5280 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5281 || TREE_CODE (constructor_type) == UNION_TYPE)
5282 && constructor_fields)
5283 value = find_init_member (constructor_fields);
5284 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5285 value = find_init_member (constructor_index);
5288 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5289 p->type = constructor_type;
5290 p->fields = constructor_fields;
5291 p->index = constructor_index;
5292 p->max_index = constructor_max_index;
5293 p->unfilled_index = constructor_unfilled_index;
5294 p->unfilled_fields = constructor_unfilled_fields;
5295 p->bit_index = constructor_bit_index;
5296 p->elements = constructor_elements;
5297 p->constant = constructor_constant;
5298 p->simple = constructor_simple;
5299 p->erroneous = constructor_erroneous;
5300 p->pending_elts = constructor_pending_elts;
5301 p->depth = constructor_depth;
5302 p->replacement_value = 0;
5303 p->implicit = implicit;
5305 p->incremental = constructor_incremental;
5306 p->designated = constructor_designated;
5307 p->next = constructor_stack;
5309 constructor_stack = p;
5311 constructor_constant = 1;
5312 constructor_simple = 1;
5313 constructor_depth = SPELLING_DEPTH ();
5314 constructor_elements = 0;
5315 constructor_incremental = 1;
5316 constructor_designated = 0;
5317 constructor_pending_elts = 0;
5320 p->range_stack = constructor_range_stack;
5321 constructor_range_stack = 0;
5322 designator_depth = 0;
5323 designator_errorneous = 0;
5326 /* Don't die if an entire brace-pair level is superfluous
5327 in the containing level. */
5328 if (constructor_type == 0)
5330 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5331 || TREE_CODE (constructor_type) == UNION_TYPE)
5333 /* Don't die if there are extra init elts at the end. */
5334 if (constructor_fields == 0)
5335 constructor_type = 0;
5338 constructor_type = TREE_TYPE (constructor_fields);
5339 push_member_name (constructor_fields);
5340 constructor_depth++;
5343 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5345 constructor_type = TREE_TYPE (constructor_type);
5346 push_array_bounds (tree_low_cst (constructor_index, 0));
5347 constructor_depth++;
5350 if (constructor_type == 0)
5352 error_init ("extra brace group at end of initializer");
5353 constructor_fields = 0;
5354 constructor_unfilled_fields = 0;
5358 if (value && TREE_CODE (value) == CONSTRUCTOR)
5360 constructor_constant = TREE_CONSTANT (value);
5361 constructor_simple = TREE_STATIC (value);
5362 constructor_elements = TREE_OPERAND (value, 1);
5363 if (constructor_elements
5364 && (TREE_CODE (constructor_type) == RECORD_TYPE
5365 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5366 set_nonincremental_init ();
5369 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5371 missing_braces_mentioned = 1;
5372 warning_init ("missing braces around initializer");
5375 if (TREE_CODE (constructor_type) == RECORD_TYPE
5376 || TREE_CODE (constructor_type) == UNION_TYPE)
5378 constructor_fields = TYPE_FIELDS (constructor_type);
5379 /* Skip any nameless bit fields at the beginning. */
5380 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5381 && DECL_NAME (constructor_fields) == 0)
5382 constructor_fields = TREE_CHAIN (constructor_fields);
5384 constructor_unfilled_fields = constructor_fields;
5385 constructor_bit_index = bitsize_zero_node;
5387 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5389 /* Vectors are like simple fixed-size arrays. */
5390 constructor_max_index =
5391 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5392 constructor_index = convert (bitsizetype, integer_zero_node);
5393 constructor_unfilled_index = constructor_index;
5395 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5397 if (TYPE_DOMAIN (constructor_type))
5399 constructor_max_index
5400 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5402 /* Detect non-empty initializations of zero-length arrays. */
5403 if (constructor_max_index == NULL_TREE
5404 && TYPE_SIZE (constructor_type))
5405 constructor_max_index = build_int_2 (-1, -1);
5407 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5408 to initialize VLAs will cause an proper error; avoid tree
5409 checking errors as well by setting a safe value. */
5410 if (constructor_max_index
5411 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5412 constructor_max_index = build_int_2 (-1, -1);
5415 = convert (bitsizetype,
5416 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5419 constructor_index = bitsize_zero_node;
5421 constructor_unfilled_index = constructor_index;
5422 if (value && TREE_CODE (value) == STRING_CST)
5424 /* We need to split the char/wchar array into individual
5425 characters, so that we don't have to special case it
5427 set_nonincremental_init_from_string (value);
5432 warning_init ("braces around scalar initializer");
5433 constructor_fields = constructor_type;
5434 constructor_unfilled_fields = constructor_type;
5438 /* At the end of an implicit or explicit brace level,
5439 finish up that level of constructor.
5440 If we were outputting the elements as they are read, return 0
5441 from inner levels (process_init_element ignores that),
5442 but return error_mark_node from the outermost level
5443 (that's what we want to put in DECL_INITIAL).
5444 Otherwise, return a CONSTRUCTOR expression. */
5447 pop_init_level (implicit)
5450 struct constructor_stack *p;
5451 tree constructor = 0;
5455 /* When we come to an explicit close brace,
5456 pop any inner levels that didn't have explicit braces. */
5457 while (constructor_stack->implicit)
5458 process_init_element (pop_init_level (1));
5460 if (constructor_range_stack)
5464 p = constructor_stack;
5466 /* Error for initializing a flexible array member, or a zero-length
5467 array member in an inappropriate context. */
5468 if (constructor_type && constructor_fields
5469 && TREE_CODE (constructor_type) == ARRAY_TYPE
5470 && TYPE_DOMAIN (constructor_type)
5471 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5473 /* Silently discard empty initializations. The parser will
5474 already have pedwarned for empty brackets. */
5475 if (integer_zerop (constructor_unfilled_index))
5476 constructor_type = NULL_TREE;
5477 else if (! TYPE_SIZE (constructor_type))
5479 if (constructor_depth > 2)
5480 error_init ("initialization of flexible array member in a nested context");
5482 pedwarn_init ("initialization of a flexible array member");
5484 /* We have already issued an error message for the existence
5485 of a flexible array member not at the end of the structure.
5486 Discard the initializer so that we do not abort later. */
5487 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5488 constructor_type = NULL_TREE;
5491 /* Zero-length arrays are no longer special, so we should no longer
5496 /* Warn when some struct elements are implicitly initialized to zero. */
5499 && TREE_CODE (constructor_type) == RECORD_TYPE
5500 && constructor_unfilled_fields)
5502 /* Do not warn for flexible array members or zero-length arrays. */
5503 while (constructor_unfilled_fields
5504 && (! DECL_SIZE (constructor_unfilled_fields)
5505 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5506 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5508 /* Do not warn if this level of the initializer uses member
5509 designators; it is likely to be deliberate. */
5510 if (constructor_unfilled_fields && !constructor_designated)
5512 push_member_name (constructor_unfilled_fields);
5513 warning_init ("missing initializer");
5514 RESTORE_SPELLING_DEPTH (constructor_depth);
5518 /* Now output all pending elements. */
5519 constructor_incremental = 1;
5520 output_pending_init_elements (1);
5522 /* Pad out the end of the structure. */
5523 if (p->replacement_value)
5524 /* If this closes a superfluous brace pair,
5525 just pass out the element between them. */
5526 constructor = p->replacement_value;
5527 else if (constructor_type == 0)
5529 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5530 && TREE_CODE (constructor_type) != UNION_TYPE
5531 && TREE_CODE (constructor_type) != ARRAY_TYPE
5532 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5534 /* A nonincremental scalar initializer--just return
5535 the element, after verifying there is just one. */
5536 if (constructor_elements == 0)
5538 if (!constructor_erroneous)
5539 error_init ("empty scalar initializer");
5540 constructor = error_mark_node;
5542 else if (TREE_CHAIN (constructor_elements) != 0)
5544 error_init ("extra elements in scalar initializer");
5545 constructor = TREE_VALUE (constructor_elements);
5548 constructor = TREE_VALUE (constructor_elements);
5552 if (constructor_erroneous)
5553 constructor = error_mark_node;
5556 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5557 nreverse (constructor_elements));
5558 if (constructor_constant)
5559 TREE_CONSTANT (constructor) = 1;
5560 if (constructor_constant && constructor_simple)
5561 TREE_STATIC (constructor) = 1;
5565 constructor_type = p->type;
5566 constructor_fields = p->fields;
5567 constructor_index = p->index;
5568 constructor_max_index = p->max_index;
5569 constructor_unfilled_index = p->unfilled_index;
5570 constructor_unfilled_fields = p->unfilled_fields;
5571 constructor_bit_index = p->bit_index;
5572 constructor_elements = p->elements;
5573 constructor_constant = p->constant;
5574 constructor_simple = p->simple;
5575 constructor_erroneous = p->erroneous;
5576 constructor_incremental = p->incremental;
5577 constructor_designated = p->designated;
5578 constructor_pending_elts = p->pending_elts;
5579 constructor_depth = p->depth;
5581 constructor_range_stack = p->range_stack;
5582 RESTORE_SPELLING_DEPTH (constructor_depth);
5584 constructor_stack = p->next;
5587 if (constructor == 0)
5589 if (constructor_stack == 0)
5590 return error_mark_node;
5596 /* Common handling for both array range and field name designators.
5597 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5600 set_designator (array)
5604 enum tree_code subcode;
5606 /* Don't die if an entire brace-pair level is superfluous
5607 in the containing level. */
5608 if (constructor_type == 0)
5611 /* If there were errors in this designator list already, bail out silently. */
5612 if (designator_errorneous)
5615 if (!designator_depth)
5617 if (constructor_range_stack)
5620 /* Designator list starts at the level of closest explicit
5622 while (constructor_stack->implicit)
5623 process_init_element (pop_init_level (1));
5624 constructor_designated = 1;
5628 if (constructor_no_implicit)
5630 error_init ("initialization designators may not nest");
5634 if (TREE_CODE (constructor_type) == RECORD_TYPE
5635 || TREE_CODE (constructor_type) == UNION_TYPE)
5637 subtype = TREE_TYPE (constructor_fields);
5638 if (subtype != error_mark_node)
5639 subtype = TYPE_MAIN_VARIANT (subtype);
5641 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5643 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5648 subcode = TREE_CODE (subtype);
5649 if (array && subcode != ARRAY_TYPE)
5651 error_init ("array index in non-array initializer");
5654 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5656 error_init ("field name not in record or union initializer");
5660 constructor_designated = 1;
5661 push_init_level (2);
5665 /* If there are range designators in designator list, push a new designator
5666 to constructor_range_stack. RANGE_END is end of such stack range or
5667 NULL_TREE if there is no range designator at this level. */
5670 push_range_stack (range_end)
5673 struct constructor_range_stack *p;
5675 p = (struct constructor_range_stack *)
5676 ggc_alloc (sizeof (struct constructor_range_stack));
5677 p->prev = constructor_range_stack;
5679 p->fields = constructor_fields;
5680 p->range_start = constructor_index;
5681 p->index = constructor_index;
5682 p->stack = constructor_stack;
5683 p->range_end = range_end;
5684 if (constructor_range_stack)
5685 constructor_range_stack->next = p;
5686 constructor_range_stack = p;
5689 /* Within an array initializer, specify the next index to be initialized.
5690 FIRST is that index. If LAST is nonzero, then initialize a range
5691 of indices, running from FIRST through LAST. */
5694 set_init_index (first, last)
5697 if (set_designator (1))
5700 designator_errorneous = 1;
5702 while ((TREE_CODE (first) == NOP_EXPR
5703 || TREE_CODE (first) == CONVERT_EXPR
5704 || TREE_CODE (first) == NON_LVALUE_EXPR)
5705 && (TYPE_MODE (TREE_TYPE (first))
5706 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5707 first = TREE_OPERAND (first, 0);
5710 while ((TREE_CODE (last) == NOP_EXPR
5711 || TREE_CODE (last) == CONVERT_EXPR
5712 || TREE_CODE (last) == NON_LVALUE_EXPR)
5713 && (TYPE_MODE (TREE_TYPE (last))
5714 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5715 last = TREE_OPERAND (last, 0);
5717 if (TREE_CODE (first) != INTEGER_CST)
5718 error_init ("nonconstant array index in initializer");
5719 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5720 error_init ("nonconstant array index in initializer");
5721 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5722 error_init ("array index in non-array initializer");
5723 else if (constructor_max_index
5724 && tree_int_cst_lt (constructor_max_index, first))
5725 error_init ("array index in initializer exceeds array bounds");
5728 constructor_index = convert (bitsizetype, first);
5732 if (tree_int_cst_equal (first, last))
5734 else if (tree_int_cst_lt (last, first))
5736 error_init ("empty index range in initializer");
5741 last = convert (bitsizetype, last);
5742 if (constructor_max_index != 0
5743 && tree_int_cst_lt (constructor_max_index, last))
5745 error_init ("array index range in initializer exceeds array bounds");
5752 designator_errorneous = 0;
5753 if (constructor_range_stack || last)
5754 push_range_stack (last);
5758 /* Within a struct initializer, specify the next field to be initialized. */
5761 set_init_label (fieldname)
5766 if (set_designator (0))
5769 designator_errorneous = 1;
5771 if (TREE_CODE (constructor_type) != RECORD_TYPE
5772 && TREE_CODE (constructor_type) != UNION_TYPE)
5774 error_init ("field name not in record or union initializer");
5778 for (tail = TYPE_FIELDS (constructor_type); tail;
5779 tail = TREE_CHAIN (tail))
5781 if (DECL_NAME (tail) == fieldname)
5786 error ("unknown field `%s' specified in initializer",
5787 IDENTIFIER_POINTER (fieldname));
5790 constructor_fields = tail;
5792 designator_errorneous = 0;
5793 if (constructor_range_stack)
5794 push_range_stack (NULL_TREE);
5798 /* Add a new initializer to the tree of pending initializers. PURPOSE
5799 identifies the initializer, either array index or field in a structure.
5800 VALUE is the value of that index or field. */
5803 add_pending_init (purpose, value)
5804 tree purpose, value;
5806 struct init_node *p, **q, *r;
5808 q = &constructor_pending_elts;
5811 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5816 if (tree_int_cst_lt (purpose, p->purpose))
5818 else if (tree_int_cst_lt (p->purpose, purpose))
5822 if (TREE_SIDE_EFFECTS (p->value))
5823 warning_init ("initialized field with side-effects overwritten");
5833 bitpos = bit_position (purpose);
5837 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5839 else if (p->purpose != purpose)
5843 if (TREE_SIDE_EFFECTS (p->value))
5844 warning_init ("initialized field with side-effects overwritten");
5851 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5852 r->purpose = purpose;
5863 struct init_node *s;
5867 if (p->balance == 0)
5869 else if (p->balance < 0)
5876 p->left->parent = p;
5893 constructor_pending_elts = r;
5898 struct init_node *t = r->right;
5902 r->right->parent = r;
5907 p->left->parent = p;
5910 p->balance = t->balance < 0;
5911 r->balance = -(t->balance > 0);
5926 constructor_pending_elts = t;
5932 /* p->balance == +1; growth of left side balances the node. */
5937 else /* r == p->right */
5939 if (p->balance == 0)
5940 /* Growth propagation from right side. */
5942 else if (p->balance > 0)
5949 p->right->parent = p;
5966 constructor_pending_elts = r;
5968 else /* r->balance == -1 */
5971 struct init_node *t = r->left;
5975 r->left->parent = r;
5980 p->right->parent = p;
5983 r->balance = (t->balance < 0);
5984 p->balance = -(t->balance > 0);
5999 constructor_pending_elts = t;
6005 /* p->balance == -1; growth of right side balances the node. */
6016 /* Build AVL tree from a sorted chain. */
6019 set_nonincremental_init ()
6023 if (TREE_CODE (constructor_type) != RECORD_TYPE
6024 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6027 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
6028 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
6029 constructor_elements = 0;
6030 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6032 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6033 /* Skip any nameless bit fields at the beginning. */
6034 while (constructor_unfilled_fields != 0
6035 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6036 && DECL_NAME (constructor_unfilled_fields) == 0)
6037 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6040 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6042 if (TYPE_DOMAIN (constructor_type))
6043 constructor_unfilled_index
6044 = convert (bitsizetype,
6045 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6047 constructor_unfilled_index = bitsize_zero_node;
6049 constructor_incremental = 0;
6052 /* Build AVL tree from a string constant. */
6055 set_nonincremental_init_from_string (str)
6058 tree value, purpose, type;
6059 HOST_WIDE_INT val[2];
6060 const char *p, *end;
6061 int byte, wchar_bytes, charwidth, bitpos;
6063 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6066 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6067 == TYPE_PRECISION (char_type_node))
6069 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6070 == TYPE_PRECISION (wchar_type_node))
6071 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6075 charwidth = TYPE_PRECISION (char_type_node);
6076 type = TREE_TYPE (constructor_type);
6077 p = TREE_STRING_POINTER (str);
6078 end = p + TREE_STRING_LENGTH (str);
6080 for (purpose = bitsize_zero_node;
6081 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6082 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6084 if (wchar_bytes == 1)
6086 val[1] = (unsigned char) *p++;
6093 for (byte = 0; byte < wchar_bytes; byte++)
6095 if (BYTES_BIG_ENDIAN)
6096 bitpos = (wchar_bytes - byte - 1) * charwidth;
6098 bitpos = byte * charwidth;
6099 val[bitpos < HOST_BITS_PER_WIDE_INT]
6100 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6101 << (bitpos % HOST_BITS_PER_WIDE_INT);
6105 if (!TREE_UNSIGNED (type))
6107 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6108 if (bitpos < HOST_BITS_PER_WIDE_INT)
6110 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6112 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6116 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6121 else if (val[0] & (((HOST_WIDE_INT) 1)
6122 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6123 val[0] |= ((HOST_WIDE_INT) -1)
6124 << (bitpos - HOST_BITS_PER_WIDE_INT);
6127 value = build_int_2 (val[1], val[0]);
6128 TREE_TYPE (value) = type;
6129 add_pending_init (purpose, value);
6132 constructor_incremental = 0;
6135 /* Return value of FIELD in pending initializer or zero if the field was
6136 not initialized yet. */
6139 find_init_member (field)
6142 struct init_node *p;
6144 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6146 if (constructor_incremental
6147 && tree_int_cst_lt (field, constructor_unfilled_index))
6148 set_nonincremental_init ();
6150 p = constructor_pending_elts;
6153 if (tree_int_cst_lt (field, p->purpose))
6155 else if (tree_int_cst_lt (p->purpose, field))
6161 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6163 tree bitpos = bit_position (field);
6165 if (constructor_incremental
6166 && (!constructor_unfilled_fields
6167 || tree_int_cst_lt (bitpos,
6168 bit_position (constructor_unfilled_fields))))
6169 set_nonincremental_init ();
6171 p = constructor_pending_elts;
6174 if (field == p->purpose)
6176 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6182 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6184 if (constructor_elements
6185 && TREE_PURPOSE (constructor_elements) == field)
6186 return TREE_VALUE (constructor_elements);
6191 /* "Output" the next constructor element.
6192 At top level, really output it to assembler code now.
6193 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6194 TYPE is the data type that the containing data type wants here.
6195 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6197 PENDING if non-nil means output pending elements that belong
6198 right after this element. (PENDING is normally 1;
6199 it is 0 while outputting pending elements, to avoid recursion.) */
6202 output_init_element (value, type, field, pending)
6203 tree value, type, field;
6206 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6207 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6208 && !(TREE_CODE (value) == STRING_CST
6209 && TREE_CODE (type) == ARRAY_TYPE
6210 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6211 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6212 TYPE_MAIN_VARIANT (type))))
6213 value = default_conversion (value);
6215 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6216 && require_constant_value && !flag_isoc99 && pending)
6218 /* As an extension, allow initializing objects with static storage
6219 duration with compound literals (which are then treated just as
6220 the brace enclosed list they contain). */
6221 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6222 value = DECL_INITIAL (decl);
6225 if (value == error_mark_node)
6226 constructor_erroneous = 1;
6227 else if (!TREE_CONSTANT (value))
6228 constructor_constant = 0;
6229 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6230 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6231 || TREE_CODE (constructor_type) == UNION_TYPE)
6232 && DECL_C_BIT_FIELD (field)
6233 && TREE_CODE (value) != INTEGER_CST))
6234 constructor_simple = 0;
6236 if (require_constant_value && ! TREE_CONSTANT (value))
6238 error_init ("initializer element is not constant");
6239 value = error_mark_node;
6241 else if (require_constant_elements
6242 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6243 pedwarn ("initializer element is not computable at load time");
6245 /* If this field is empty (and not at the end of structure),
6246 don't do anything other than checking the initializer. */
6248 && (TREE_TYPE (field) == error_mark_node
6249 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6250 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6251 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6252 || TREE_CHAIN (field)))))
6255 value = digest_init (type, value, require_constant_value,
6256 require_constant_elements);
6257 if (value == error_mark_node)
6259 constructor_erroneous = 1;
6263 /* If this element doesn't come next in sequence,
6264 put it on constructor_pending_elts. */
6265 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6266 && (!constructor_incremental
6267 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6269 if (constructor_incremental
6270 && tree_int_cst_lt (field, constructor_unfilled_index))
6271 set_nonincremental_init ();
6273 add_pending_init (field, value);
6276 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6277 && (!constructor_incremental
6278 || field != constructor_unfilled_fields))
6280 /* We do this for records but not for unions. In a union,
6281 no matter which field is specified, it can be initialized
6282 right away since it starts at the beginning of the union. */
6283 if (constructor_incremental)
6285 if (!constructor_unfilled_fields)
6286 set_nonincremental_init ();
6289 tree bitpos, unfillpos;
6291 bitpos = bit_position (field);
6292 unfillpos = bit_position (constructor_unfilled_fields);
6294 if (tree_int_cst_lt (bitpos, unfillpos))
6295 set_nonincremental_init ();
6299 add_pending_init (field, value);
6302 else if (TREE_CODE (constructor_type) == UNION_TYPE
6303 && constructor_elements)
6305 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6306 warning_init ("initialized field with side-effects overwritten");
6308 /* We can have just one union field set. */
6309 constructor_elements = 0;
6312 /* Otherwise, output this element either to
6313 constructor_elements or to the assembler file. */
6315 if (field && TREE_CODE (field) == INTEGER_CST)
6316 field = copy_node (field);
6317 constructor_elements
6318 = tree_cons (field, value, constructor_elements);
6320 /* Advance the variable that indicates sequential elements output. */
6321 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6322 constructor_unfilled_index
6323 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6325 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6327 constructor_unfilled_fields
6328 = TREE_CHAIN (constructor_unfilled_fields);
6330 /* Skip any nameless bit fields. */
6331 while (constructor_unfilled_fields != 0
6332 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6333 && DECL_NAME (constructor_unfilled_fields) == 0)
6334 constructor_unfilled_fields =
6335 TREE_CHAIN (constructor_unfilled_fields);
6337 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6338 constructor_unfilled_fields = 0;
6340 /* Now output any pending elements which have become next. */
6342 output_pending_init_elements (0);
6345 /* Output any pending elements which have become next.
6346 As we output elements, constructor_unfilled_{fields,index}
6347 advances, which may cause other elements to become next;
6348 if so, they too are output.
6350 If ALL is 0, we return when there are
6351 no more pending elements to output now.
6353 If ALL is 1, we output space as necessary so that
6354 we can output all the pending elements. */
6357 output_pending_init_elements (all)
6360 struct init_node *elt = constructor_pending_elts;
6365 /* Look thru the whole pending tree.
6366 If we find an element that should be output now,
6367 output it. Otherwise, set NEXT to the element
6368 that comes first among those still pending. */
6373 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6375 if (tree_int_cst_equal (elt->purpose,
6376 constructor_unfilled_index))
6377 output_init_element (elt->value,
6378 TREE_TYPE (constructor_type),
6379 constructor_unfilled_index, 0);
6380 else if (tree_int_cst_lt (constructor_unfilled_index,
6383 /* Advance to the next smaller node. */
6388 /* We have reached the smallest node bigger than the
6389 current unfilled index. Fill the space first. */
6390 next = elt->purpose;
6396 /* Advance to the next bigger node. */
6401 /* We have reached the biggest node in a subtree. Find
6402 the parent of it, which is the next bigger node. */
6403 while (elt->parent && elt->parent->right == elt)
6406 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6409 next = elt->purpose;
6415 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6416 || TREE_CODE (constructor_type) == UNION_TYPE)
6418 tree ctor_unfilled_bitpos, elt_bitpos;
6420 /* If the current record is complete we are done. */
6421 if (constructor_unfilled_fields == 0)
6424 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6425 elt_bitpos = bit_position (elt->purpose);
6426 /* We can't compare fields here because there might be empty
6427 fields in between. */
6428 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6430 constructor_unfilled_fields = elt->purpose;
6431 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6434 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6436 /* Advance to the next smaller node. */
6441 /* We have reached the smallest node bigger than the
6442 current unfilled field. Fill the space first. */
6443 next = elt->purpose;
6449 /* Advance to the next bigger node. */
6454 /* We have reached the biggest node in a subtree. Find
6455 the parent of it, which is the next bigger node. */
6456 while (elt->parent && elt->parent->right == elt)
6460 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6461 bit_position (elt->purpose))))
6463 next = elt->purpose;
6471 /* Ordinarily return, but not if we want to output all
6472 and there are elements left. */
6473 if (! (all && next != 0))
6476 /* If it's not incremental, just skip over the gap, so that after
6477 jumping to retry we will output the next successive element. */
6478 if (TREE_CODE (constructor_type) == RECORD_TYPE
6479 || TREE_CODE (constructor_type) == UNION_TYPE)
6480 constructor_unfilled_fields = next;
6481 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6482 constructor_unfilled_index = next;
6484 /* ELT now points to the node in the pending tree with the next
6485 initializer to output. */
6489 /* Add one non-braced element to the current constructor level.
6490 This adjusts the current position within the constructor's type.
6491 This may also start or terminate implicit levels
6492 to handle a partly-braced initializer.
6494 Once this has found the correct level for the new element,
6495 it calls output_init_element. */
6498 process_init_element (value)
6501 tree orig_value = value;
6502 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6504 designator_depth = 0;
6505 designator_errorneous = 0;
6507 /* Handle superfluous braces around string cst as in
6508 char x[] = {"foo"}; */
6511 && TREE_CODE (constructor_type) == ARRAY_TYPE
6512 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6513 && integer_zerop (constructor_unfilled_index))
6515 if (constructor_stack->replacement_value)
6516 error_init ("excess elements in char array initializer");
6517 constructor_stack->replacement_value = value;
6521 if (constructor_stack->replacement_value != 0)
6523 error_init ("excess elements in struct initializer");
6527 /* Ignore elements of a brace group if it is entirely superfluous
6528 and has already been diagnosed. */
6529 if (constructor_type == 0)
6532 /* If we've exhausted any levels that didn't have braces,
6534 while (constructor_stack->implicit)
6536 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6537 || TREE_CODE (constructor_type) == UNION_TYPE)
6538 && constructor_fields == 0)
6539 process_init_element (pop_init_level (1));
6540 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6541 && (constructor_max_index == 0
6542 || tree_int_cst_lt (constructor_max_index,
6543 constructor_index)))
6544 process_init_element (pop_init_level (1));
6549 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6550 if (constructor_range_stack)
6552 /* If value is a compound literal and we'll be just using its
6553 content, don't put it into a SAVE_EXPR. */
6554 if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR
6555 || !require_constant_value
6557 value = save_expr (value);
6562 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6565 enum tree_code fieldcode;
6567 if (constructor_fields == 0)
6569 pedwarn_init ("excess elements in struct initializer");
6573 fieldtype = TREE_TYPE (constructor_fields);
6574 if (fieldtype != error_mark_node)
6575 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6576 fieldcode = TREE_CODE (fieldtype);
6578 /* Accept a string constant to initialize a subarray. */
6580 && fieldcode == ARRAY_TYPE
6581 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6584 /* Otherwise, if we have come to a subaggregate,
6585 and we don't have an element of its type, push into it. */
6586 else if (value != 0 && !constructor_no_implicit
6587 && value != error_mark_node
6588 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6589 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6590 || fieldcode == UNION_TYPE))
6592 push_init_level (1);
6598 push_member_name (constructor_fields);
6599 output_init_element (value, fieldtype, constructor_fields, 1);
6600 RESTORE_SPELLING_DEPTH (constructor_depth);
6603 /* Do the bookkeeping for an element that was
6604 directly output as a constructor. */
6606 /* For a record, keep track of end position of last field. */
6607 if (DECL_SIZE (constructor_fields))
6608 constructor_bit_index
6609 = size_binop (PLUS_EXPR,
6610 bit_position (constructor_fields),
6611 DECL_SIZE (constructor_fields));
6613 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6614 /* Skip any nameless bit fields. */
6615 while (constructor_unfilled_fields != 0
6616 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6617 && DECL_NAME (constructor_unfilled_fields) == 0)
6618 constructor_unfilled_fields =
6619 TREE_CHAIN (constructor_unfilled_fields);
6622 constructor_fields = TREE_CHAIN (constructor_fields);
6623 /* Skip any nameless bit fields at the beginning. */
6624 while (constructor_fields != 0
6625 && DECL_C_BIT_FIELD (constructor_fields)
6626 && DECL_NAME (constructor_fields) == 0)
6627 constructor_fields = TREE_CHAIN (constructor_fields);
6629 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6632 enum tree_code fieldcode;
6634 if (constructor_fields == 0)
6636 pedwarn_init ("excess elements in union initializer");
6640 fieldtype = TREE_TYPE (constructor_fields);
6641 if (fieldtype != error_mark_node)
6642 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6643 fieldcode = TREE_CODE (fieldtype);
6645 /* Warn that traditional C rejects initialization of unions.
6646 We skip the warning if the value is zero. This is done
6647 under the assumption that the zero initializer in user
6648 code appears conditioned on e.g. __STDC__ to avoid
6649 "missing initializer" warnings and relies on default
6650 initialization to zero in the traditional C case.
6651 We also skip the warning if the initializer is designated,
6652 again on the assumption that this must be conditional on
6653 __STDC__ anyway (and we've already complained about the
6654 member-designator already). */
6655 if (warn_traditional && !in_system_header && !constructor_designated
6656 && !(value && (integer_zerop (value) || real_zerop (value))))
6657 warning ("traditional C rejects initialization of unions");
6659 /* Accept a string constant to initialize a subarray. */
6661 && fieldcode == ARRAY_TYPE
6662 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6665 /* Otherwise, if we have come to a subaggregate,
6666 and we don't have an element of its type, push into it. */
6667 else if (value != 0 && !constructor_no_implicit
6668 && value != error_mark_node
6669 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6670 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6671 || fieldcode == UNION_TYPE))
6673 push_init_level (1);
6679 push_member_name (constructor_fields);
6680 output_init_element (value, fieldtype, constructor_fields, 1);
6681 RESTORE_SPELLING_DEPTH (constructor_depth);
6684 /* Do the bookkeeping for an element that was
6685 directly output as a constructor. */
6687 constructor_bit_index = DECL_SIZE (constructor_fields);
6688 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6691 constructor_fields = 0;
6693 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6695 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6696 enum tree_code eltcode = TREE_CODE (elttype);
6698 /* Accept a string constant to initialize a subarray. */
6700 && eltcode == ARRAY_TYPE
6701 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6704 /* Otherwise, if we have come to a subaggregate,
6705 and we don't have an element of its type, push into it. */
6706 else if (value != 0 && !constructor_no_implicit
6707 && value != error_mark_node
6708 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6709 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6710 || eltcode == UNION_TYPE))
6712 push_init_level (1);
6716 if (constructor_max_index != 0
6717 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6718 || integer_all_onesp (constructor_max_index)))
6720 pedwarn_init ("excess elements in array initializer");
6724 /* Now output the actual element. */
6727 push_array_bounds (tree_low_cst (constructor_index, 0));
6728 output_init_element (value, elttype, constructor_index, 1);
6729 RESTORE_SPELLING_DEPTH (constructor_depth);
6733 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6736 /* If we are doing the bookkeeping for an element that was
6737 directly output as a constructor, we must update
6738 constructor_unfilled_index. */
6739 constructor_unfilled_index = constructor_index;
6741 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6743 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6745 /* Do a basic check of initializer size. Note that vectors
6746 always have a fixed size derived from their type. */
6747 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6749 pedwarn_init ("excess elements in vector initializer");
6753 /* Now output the actual element. */
6755 output_init_element (value, elttype, constructor_index, 1);
6758 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6761 /* If we are doing the bookkeeping for an element that was
6762 directly output as a constructor, we must update
6763 constructor_unfilled_index. */
6764 constructor_unfilled_index = constructor_index;
6767 /* Handle the sole element allowed in a braced initializer
6768 for a scalar variable. */
6769 else if (constructor_fields == 0)
6771 pedwarn_init ("excess elements in scalar initializer");
6777 output_init_element (value, constructor_type, NULL_TREE, 1);
6778 constructor_fields = 0;
6781 /* Handle range initializers either at this level or anywhere higher
6782 in the designator stack. */
6783 if (constructor_range_stack)
6785 struct constructor_range_stack *p, *range_stack;
6788 range_stack = constructor_range_stack;
6789 constructor_range_stack = 0;
6790 while (constructor_stack != range_stack->stack)
6792 if (!constructor_stack->implicit)
6794 process_init_element (pop_init_level (1));
6796 for (p = range_stack;
6797 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6800 if (!constructor_stack->implicit)
6802 process_init_element (pop_init_level (1));
6805 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6806 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6811 constructor_index = p->index;
6812 constructor_fields = p->fields;
6813 if (finish && p->range_end && p->index == p->range_start)
6821 push_init_level (2);
6822 p->stack = constructor_stack;
6823 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6824 p->index = p->range_start;
6828 constructor_range_stack = range_stack;
6835 constructor_range_stack = 0;
6838 /* Build a simple asm-statement, from one string literal. */
6840 simple_asm_stmt (expr)
6845 if (TREE_CODE (expr) == ADDR_EXPR)
6846 expr = TREE_OPERAND (expr, 0);
6848 if (TREE_CODE (expr) == STRING_CST)
6852 if (TREE_CHAIN (expr))
6853 expr = combine_strings (expr);
6854 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6855 NULL_TREE, NULL_TREE,
6857 ASM_INPUT_P (stmt) = 1;
6861 error ("argument of `asm' is not a constant string");
6865 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6866 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6869 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
6878 if (TREE_CHAIN (string))
6879 string = combine_strings (string);
6880 if (TREE_CODE (string) != STRING_CST)
6882 error ("asm template is not a string constant");
6886 if (cv_qualifier != NULL_TREE
6887 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
6889 warning ("%s qualifier ignored on asm",
6890 IDENTIFIER_POINTER (cv_qualifier));
6891 cv_qualifier = NULL_TREE;
6894 /* We can remove output conversions that change the type,
6895 but not the mode. */
6896 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6898 tree output = TREE_VALUE (tail);
6900 STRIP_NOPS (output);
6901 TREE_VALUE (tail) = output;
6903 /* Allow conversions as LHS here. build_modify_expr as called below
6904 will do the right thing with them. */
6905 while (TREE_CODE (output) == NOP_EXPR
6906 || TREE_CODE (output) == CONVERT_EXPR
6907 || TREE_CODE (output) == FLOAT_EXPR
6908 || TREE_CODE (output) == FIX_TRUNC_EXPR
6909 || TREE_CODE (output) == FIX_FLOOR_EXPR
6910 || TREE_CODE (output) == FIX_ROUND_EXPR
6911 || TREE_CODE (output) == FIX_CEIL_EXPR)
6912 output = TREE_OPERAND (output, 0);
6914 lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement");
6917 /* Remove output conversions that change the type but not the mode. */
6918 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6920 tree output = TREE_VALUE (tail);
6921 STRIP_NOPS (output);
6922 TREE_VALUE (tail) = output;
6925 /* Perform default conversions on array and function inputs.
6926 Don't do this for other types as it would screw up operands
6927 expected to be in memory. */
6928 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6929 TREE_VALUE (tail) = default_function_array_conversion (TREE_VALUE (tail));
6931 return add_stmt (build_stmt (ASM_STMT, cv_qualifier, string,
6932 outputs, inputs, clobbers));
6935 /* Expand an ASM statement with operands, handling output operands
6936 that are not variables or INDIRECT_REFS by transforming such
6937 cases into cases that expand_asm_operands can handle.
6939 Arguments are same as for expand_asm_operands. */
6942 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6943 tree string, outputs, inputs, clobbers;
6945 const char *filename;
6948 int noutputs = list_length (outputs);
6950 /* o[I] is the place that output number I should be written. */
6951 tree *o = (tree *) alloca (noutputs * sizeof (tree));
6954 /* Record the contents of OUTPUTS before it is modified. */
6955 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6956 o[i] = TREE_VALUE (tail);
6958 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6959 OUTPUTS some trees for where the values were actually stored. */
6960 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
6962 /* Copy all the intermediate outputs into the specified outputs. */
6963 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6965 if (o[i] != TREE_VALUE (tail))
6967 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6968 NULL_RTX, VOIDmode, EXPAND_NORMAL);
6971 /* Restore the original value so that it's correct the next
6972 time we expand this function. */
6973 TREE_VALUE (tail) = o[i];
6975 /* Detect modification of read-only values.
6976 (Otherwise done by build_modify_expr.) */
6979 tree type = TREE_TYPE (o[i]);
6980 if (TREE_READONLY (o[i])
6981 || TYPE_READONLY (type)
6982 || ((TREE_CODE (type) == RECORD_TYPE
6983 || TREE_CODE (type) == UNION_TYPE)
6984 && C_TYPE_FIELDS_READONLY (type)))
6985 readonly_warning (o[i], "modification by `asm'");
6989 /* Those MODIFY_EXPRs could do autoincrements. */
6993 /* Expand a C `return' statement.
6994 RETVAL is the expression for what to return,
6995 or a null pointer for `return;' with no value. */
6998 c_expand_return (retval)
7001 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
7003 if (TREE_THIS_VOLATILE (current_function_decl))
7004 warning ("function declared `noreturn' has a `return' statement");
7008 current_function_returns_null = 1;
7009 if ((warn_return_type || flag_isoc99)
7010 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7011 pedwarn_c99 ("`return' with no value, in function returning non-void");
7013 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7015 current_function_returns_null = 1;
7016 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7017 pedwarn ("`return' with a value, in function returning void");
7021 tree t = convert_for_assignment (valtype, retval, _("return"),
7022 NULL_TREE, NULL_TREE, 0);
7023 tree res = DECL_RESULT (current_function_decl);
7026 current_function_returns_value = 1;
7027 if (t == error_mark_node)
7030 inner = t = convert (TREE_TYPE (res), t);
7032 /* Strip any conversions, additions, and subtractions, and see if
7033 we are returning the address of a local variable. Warn if so. */
7036 switch (TREE_CODE (inner))
7038 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
7040 inner = TREE_OPERAND (inner, 0);
7044 /* If the second operand of the MINUS_EXPR has a pointer
7045 type (or is converted from it), this may be valid, so
7046 don't give a warning. */
7048 tree op1 = TREE_OPERAND (inner, 1);
7050 while (! POINTER_TYPE_P (TREE_TYPE (op1))
7051 && (TREE_CODE (op1) == NOP_EXPR
7052 || TREE_CODE (op1) == NON_LVALUE_EXPR
7053 || TREE_CODE (op1) == CONVERT_EXPR))
7054 op1 = TREE_OPERAND (op1, 0);
7056 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7059 inner = TREE_OPERAND (inner, 0);
7064 inner = TREE_OPERAND (inner, 0);
7066 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
7067 inner = TREE_OPERAND (inner, 0);
7069 if (TREE_CODE (inner) == VAR_DECL
7070 && ! DECL_EXTERNAL (inner)
7071 && ! TREE_STATIC (inner)
7072 && DECL_CONTEXT (inner) == current_function_decl)
7073 warning ("function returns address of local variable");
7083 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
7086 return add_stmt (build_return_stmt (retval));
7090 /* The SWITCH_STMT being built. */
7092 /* A splay-tree mapping the low element of a case range to the high
7093 element, or NULL_TREE if there is no high element. Used to
7094 determine whether or not a new case label duplicates an old case
7095 label. We need a tree, rather than simply a hash table, because
7096 of the GNU case range extension. */
7098 /* The next node on the stack. */
7099 struct c_switch *next;
7102 /* A stack of the currently active switch statements. The innermost
7103 switch statement is on the top of the stack. There is no need to
7104 mark the stack for garbage collection because it is only active
7105 during the processing of the body of a function, and we never
7106 collect at that point. */
7108 static struct c_switch *switch_stack;
7110 /* Start a C switch statement, testing expression EXP. Return the new
7117 enum tree_code code;
7118 tree type, orig_type = error_mark_node;
7119 struct c_switch *cs;
7121 if (exp != error_mark_node)
7123 code = TREE_CODE (TREE_TYPE (exp));
7124 orig_type = TREE_TYPE (exp);
7126 if (! INTEGRAL_TYPE_P (orig_type)
7127 && code != ERROR_MARK)
7129 error ("switch quantity not an integer");
7130 exp = integer_zero_node;
7134 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7136 if (warn_traditional && !in_system_header
7137 && (type == long_integer_type_node
7138 || type == long_unsigned_type_node))
7139 warning ("`long' switch expression not converted to `int' in ISO C");
7141 exp = default_conversion (exp);
7142 type = TREE_TYPE (exp);
7146 /* Add this new SWITCH_STMT to the stack. */
7147 cs = (struct c_switch *) xmalloc (sizeof (*cs));
7148 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, orig_type);
7149 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7150 cs->next = switch_stack;
7153 return add_stmt (switch_stack->switch_stmt);
7156 /* Process a case label. */
7159 do_case (low_value, high_value)
7163 tree label = NULL_TREE;
7167 label = c_add_case_label (switch_stack->cases,
7168 SWITCH_COND (switch_stack->switch_stmt),
7169 low_value, high_value);
7170 if (label == error_mark_node)
7174 error ("case label not within a switch statement");
7176 error ("`default' label not within a switch statement");
7181 /* Finish the switch statement. */
7186 struct c_switch *cs = switch_stack;
7188 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
7190 /* Pop the stack. */
7191 switch_stack = switch_stack->next;
7192 splay_tree_delete (cs->cases);