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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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 lookup_field PARAMS ((tree, tree, tree *));
59 static tree convert_arguments PARAMS ((tree, tree, tree, tree));
60 static tree pointer_int_sum PARAMS ((enum tree_code, tree, tree));
61 static tree pointer_diff PARAMS ((tree, tree));
62 static tree unary_complex_lvalue PARAMS ((enum tree_code, tree));
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 void add_pending_init PARAMS ((tree, tree));
80 static int pending_init_member PARAMS ((tree));
82 /* Do `exp = require_complete_type (exp);' to make sure exp
83 does not have an incomplete type. (That includes void types.) */
86 require_complete_type (value)
89 tree type = TREE_TYPE (value);
91 if (TREE_CODE (value) == ERROR_MARK)
92 return error_mark_node;
94 /* First, detect a valid value with a complete type. */
95 if (COMPLETE_TYPE_P (type))
98 incomplete_type_error (value, type);
99 return error_mark_node;
102 /* Print an error message for invalid use of an incomplete type.
103 VALUE is the expression that was used (or 0 if that isn't known)
104 and TYPE is the type that was invalid. */
107 incomplete_type_error (value, type)
111 const char *type_code_string;
113 /* Avoid duplicate error message. */
114 if (TREE_CODE (type) == ERROR_MARK)
117 if (value != 0 && (TREE_CODE (value) == VAR_DECL
118 || TREE_CODE (value) == PARM_DECL))
119 error ("`%s' has an incomplete type",
120 IDENTIFIER_POINTER (DECL_NAME (value)));
124 /* We must print an error message. Be clever about what it says. */
126 switch (TREE_CODE (type))
129 type_code_string = "struct";
133 type_code_string = "union";
137 type_code_string = "enum";
141 error ("invalid use of void expression");
145 if (TYPE_DOMAIN (type))
147 type = TREE_TYPE (type);
150 error ("invalid use of array with unspecified bounds");
157 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
158 error ("invalid use of undefined type `%s %s'",
159 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
161 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
162 error ("invalid use of incomplete typedef `%s'",
163 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
167 /* Return a variant of TYPE which has all the type qualifiers of LIKE
168 as well as those of TYPE. */
171 qualify_type (type, like)
174 return c_build_qualified_type (type,
175 TYPE_QUALS (type) | TYPE_QUALS (like));
178 /* Return the common type of two types.
179 We assume that comptypes has already been done and returned 1;
180 if that isn't so, this may crash. In particular, we assume that qualifiers
183 This is the type for the result of most arithmetic operations
184 if the operands have the given two types. */
190 register enum tree_code code1;
191 register enum tree_code code2;
194 /* Save time if the two types are the same. */
196 if (t1 == t2) return t1;
198 /* If one type is nonsense, use the other. */
199 if (t1 == error_mark_node)
201 if (t2 == error_mark_node)
204 /* Merge the attributes. */
205 attributes = merge_machine_type_attributes (t1, t2);
207 /* Treat an enum type as the unsigned integer type of the same width. */
209 if (TREE_CODE (t1) == ENUMERAL_TYPE)
210 t1 = type_for_size (TYPE_PRECISION (t1), 1);
211 if (TREE_CODE (t2) == ENUMERAL_TYPE)
212 t2 = type_for_size (TYPE_PRECISION (t2), 1);
214 code1 = TREE_CODE (t1);
215 code2 = TREE_CODE (t2);
217 /* If one type is complex, form the common type of the non-complex
218 components, then make that complex. Use T1 or T2 if it is the
220 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
222 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
223 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
224 tree subtype = common_type (subtype1, subtype2);
226 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
227 return build_type_attribute_variant (t1, attributes);
228 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
229 return build_type_attribute_variant (t2, attributes);
231 return build_type_attribute_variant (build_complex_type (subtype),
239 /* If only one is real, use it as the result. */
241 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
242 return build_type_attribute_variant (t1, attributes);
244 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
245 return build_type_attribute_variant (t2, attributes);
247 /* Both real or both integers; use the one with greater precision. */
249 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
250 return build_type_attribute_variant (t1, attributes);
251 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
252 return build_type_attribute_variant (t2, attributes);
254 /* Same precision. Prefer longs to ints even when same size. */
256 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
257 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
258 return build_type_attribute_variant (long_unsigned_type_node,
261 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
262 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
264 /* But preserve unsignedness from the other type,
265 since long cannot hold all the values of an unsigned int. */
266 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
267 t1 = long_unsigned_type_node;
269 t1 = long_integer_type_node;
270 return build_type_attribute_variant (t1, attributes);
273 /* Likewise, prefer long double to double even if same size. */
274 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
275 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
276 return build_type_attribute_variant (long_double_type_node,
279 /* Otherwise prefer the unsigned one. */
281 if (TREE_UNSIGNED (t1))
282 return build_type_attribute_variant (t1, attributes);
284 return build_type_attribute_variant (t2, attributes);
287 /* For two pointers, do this recursively on the target type,
288 and combine the qualifiers of the two types' targets. */
289 /* This code was turned off; I don't know why.
290 But ANSI C specifies doing this with the qualifiers.
291 So I turned it on again. */
293 tree pointed_to_1 = TREE_TYPE (t1);
294 tree pointed_to_2 = TREE_TYPE (t2);
295 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
296 TYPE_MAIN_VARIANT (pointed_to_2));
297 t1 = build_pointer_type (c_build_qualified_type
299 TYPE_QUALS (pointed_to_1) |
300 TYPE_QUALS (pointed_to_2)));
301 return build_type_attribute_variant (t1, attributes);
304 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
305 return build_type_attribute_variant (t1, attributes);
310 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
311 /* Save space: see if the result is identical to one of the args. */
312 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
313 return build_type_attribute_variant (t1, attributes);
314 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
315 return build_type_attribute_variant (t2, attributes);
316 /* Merge the element types, and have a size if either arg has one. */
317 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
318 return build_type_attribute_variant (t1, attributes);
322 /* Function types: prefer the one that specified arg types.
323 If both do, merge the arg types. Also merge the return types. */
325 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
326 tree p1 = TYPE_ARG_TYPES (t1);
327 tree p2 = TYPE_ARG_TYPES (t2);
332 /* Save space: see if the result is identical to one of the args. */
333 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
334 return build_type_attribute_variant (t1, attributes);
335 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
336 return build_type_attribute_variant (t2, attributes);
338 /* Simple way if one arg fails to specify argument types. */
339 if (TYPE_ARG_TYPES (t1) == 0)
341 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
342 return build_type_attribute_variant (t1, attributes);
344 if (TYPE_ARG_TYPES (t2) == 0)
346 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
347 return build_type_attribute_variant (t1, attributes);
350 /* If both args specify argument types, we must merge the two
351 lists, argument by argument. */
353 len = list_length (p1);
356 for (i = 0; i < len; i++)
357 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
362 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
364 /* A null type means arg type is not specified.
365 Take whatever the other function type has. */
366 if (TREE_VALUE (p1) == 0)
368 TREE_VALUE (n) = TREE_VALUE (p2);
371 if (TREE_VALUE (p2) == 0)
373 TREE_VALUE (n) = TREE_VALUE (p1);
377 /* Given wait (union {union wait *u; int *i} *)
378 and wait (union wait *),
379 prefer union wait * as type of parm. */
380 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
381 && TREE_VALUE (p1) != TREE_VALUE (p2))
384 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
385 memb; memb = TREE_CHAIN (memb))
386 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
388 TREE_VALUE (n) = TREE_VALUE (p2);
390 pedwarn ("function types not truly compatible in ISO C");
394 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
395 && TREE_VALUE (p2) != TREE_VALUE (p1))
398 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
399 memb; memb = TREE_CHAIN (memb))
400 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
402 TREE_VALUE (n) = TREE_VALUE (p1);
404 pedwarn ("function types not truly compatible in ISO C");
408 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
412 t1 = build_function_type (valtype, newargs);
413 /* ... falls through ... */
417 return build_type_attribute_variant (t1, attributes);
422 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
423 or various other operations. Return 2 if they are compatible
424 but a warning may be needed if you use them together. */
427 comptypes (type1, type2)
430 register tree t1 = type1;
431 register tree t2 = type2;
434 /* Suppress errors caused by previously reported errors. */
436 if (t1 == t2 || !t1 || !t2
437 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
440 /* If either type is the internal version of sizetype, return the
442 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
443 && TYPE_DOMAIN (t1) != 0)
444 t1 = TYPE_DOMAIN (t1);
446 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
447 && TYPE_DOMAIN (t2) != 0)
448 t2 = TYPE_DOMAIN (t2);
450 /* Treat an enum type as the integer type of the same width and
453 if (TREE_CODE (t1) == ENUMERAL_TYPE)
454 t1 = type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
455 if (TREE_CODE (t2) == ENUMERAL_TYPE)
456 t2 = type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
461 /* Different classes of types can't be compatible. */
463 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
465 /* Qualifiers must match. */
467 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
470 /* Allow for two different type nodes which have essentially the same
471 definition. Note that we already checked for equality of the type
472 qualifiers (just above). */
474 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
477 #ifndef COMP_TYPE_ATTRIBUTES
478 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
481 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
482 if (! (attrval = COMP_TYPE_ATTRIBUTES (t1, t2)))
485 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
488 switch (TREE_CODE (t1))
491 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
492 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
496 val = function_types_compatible_p (t1, t2);
501 tree d1 = TYPE_DOMAIN (t1);
502 tree d2 = TYPE_DOMAIN (t2);
505 /* Target types must match incl. qualifiers. */
506 if (TREE_TYPE (t1) != TREE_TYPE (t2)
507 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
510 /* Sizes must match unless one is missing or variable. */
511 if (d1 == 0 || d2 == 0 || d1 == d2
512 || TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
513 || TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
514 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST
515 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST)
518 if (! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
519 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
526 if (maybe_objc_comptypes (t1, t2, 0) == 1)
533 return attrval == 2 && val == 1 ? 2 : val;
536 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
537 ignoring their qualifiers. */
540 comp_target_types (ttl, ttr)
545 /* Give maybe_objc_comptypes a crack at letting these types through. */
546 if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0)
549 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
550 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
552 if (val == 2 && pedantic)
553 pedwarn ("types are not quite compatible");
557 /* Subroutines of `comptypes'. */
559 /* Return 1 if two function types F1 and F2 are compatible.
560 If either type specifies no argument types,
561 the other must specify a fixed number of self-promoting arg types.
562 Otherwise, if one type specifies only the number of arguments,
563 the other must specify that number of self-promoting arg types.
564 Otherwise, the argument types must match. */
567 function_types_compatible_p (f1, f2)
571 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
575 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
576 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
579 args1 = TYPE_ARG_TYPES (f1);
580 args2 = TYPE_ARG_TYPES (f2);
582 /* An unspecified parmlist matches any specified parmlist
583 whose argument types don't need default promotions. */
587 if (!self_promoting_args_p (args2))
589 /* If one of these types comes from a non-prototype fn definition,
590 compare that with the other type's arglist.
591 If they don't match, ask for a warning (but no error). */
592 if (TYPE_ACTUAL_ARG_TYPES (f1)
593 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
599 if (!self_promoting_args_p (args1))
601 if (TYPE_ACTUAL_ARG_TYPES (f2)
602 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
607 /* Both types have argument lists: compare them and propagate results. */
608 val1 = type_lists_compatible_p (args1, args2);
609 return val1 != 1 ? val1 : val;
612 /* Check two lists of types for compatibility,
613 returning 0 for incompatible, 1 for compatible,
614 or 2 for compatible with warning. */
617 type_lists_compatible_p (args1, args2)
620 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
626 if (args1 == 0 && args2 == 0)
628 /* If one list is shorter than the other,
629 they fail to match. */
630 if (args1 == 0 || args2 == 0)
632 /* A null pointer instead of a type
633 means there is supposed to be an argument
634 but nothing is specified about what type it has.
635 So match anything that self-promotes. */
636 if (TREE_VALUE (args1) == 0)
638 if (simple_type_promotes_to (TREE_VALUE (args2)) != NULL_TREE)
641 else if (TREE_VALUE (args2) == 0)
643 if (simple_type_promotes_to (TREE_VALUE (args1)) != NULL_TREE)
646 else if (! (newval = comptypes (TREE_VALUE (args1), TREE_VALUE (args2))))
648 /* Allow wait (union {union wait *u; int *i} *)
649 and wait (union wait *) to be compatible. */
650 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
651 && (TYPE_NAME (TREE_VALUE (args1)) == 0
652 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
653 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
654 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
655 TYPE_SIZE (TREE_VALUE (args2))))
658 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
659 memb; memb = TREE_CHAIN (memb))
660 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
665 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
666 && (TYPE_NAME (TREE_VALUE (args2)) == 0
667 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
668 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
669 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
670 TYPE_SIZE (TREE_VALUE (args1))))
673 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
674 memb; memb = TREE_CHAIN (memb))
675 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
684 /* comptypes said ok, but record if it said to warn. */
688 args1 = TREE_CHAIN (args1);
689 args2 = TREE_CHAIN (args2);
693 /* Compute the value of the `sizeof' operator. */
699 enum tree_code code = TREE_CODE (type);
701 if (code == FUNCTION_TYPE)
703 if (pedantic || warn_pointer_arith)
704 pedwarn ("sizeof applied to a function type");
705 return size_one_node;
707 if (code == VOID_TYPE)
709 if (pedantic || warn_pointer_arith)
710 pedwarn ("sizeof applied to a void type");
711 return size_one_node;
714 if (code == ERROR_MARK)
715 return size_one_node;
717 if (!COMPLETE_TYPE_P (type))
719 error ("sizeof applied to an incomplete type");
720 return size_zero_node;
723 /* Convert in case a char is more than one unit. */
724 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
725 size_int (TYPE_PRECISION (char_type_node)
730 c_sizeof_nowarn (type)
733 enum tree_code code = TREE_CODE (type);
735 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
736 return size_one_node;
738 if (!COMPLETE_TYPE_P (type))
739 return size_zero_node;
741 /* Convert in case a char is more than one unit. */
742 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
743 size_int (TYPE_PRECISION (char_type_node)
747 /* Compute the size to increment a pointer by. */
750 c_size_in_bytes (type)
753 enum tree_code code = TREE_CODE (type);
755 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
756 return size_one_node;
758 if (!COMPLETE_OR_VOID_TYPE_P (type))
760 error ("arithmetic on pointer to an incomplete type");
761 return size_one_node;
764 /* Convert in case a char is more than one unit. */
765 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
766 size_int (TYPE_PRECISION (char_type_node)
770 /* Implement the __alignof keyword: Return the minimum required
771 alignment of TYPE, measured in bytes. */
777 enum tree_code code = TREE_CODE (type);
779 if (code == FUNCTION_TYPE)
780 return size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
782 if (code == VOID_TYPE || code == ERROR_MARK)
783 return size_one_node;
785 if (!COMPLETE_TYPE_P (type))
787 error ("__alignof__ applied to an incomplete type");
788 return size_zero_node;
791 return size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
794 /* Implement the __alignof keyword: Return the minimum required
795 alignment of EXPR, measured in bytes. For VAR_DECL's and
796 FIELD_DECL's return DECL_ALIGN (which can be set from an
797 "aligned" __attribute__ specification). */
800 c_alignof_expr (expr)
803 if (TREE_CODE (expr) == VAR_DECL)
804 return size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
806 if (TREE_CODE (expr) == COMPONENT_REF
807 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
809 error ("`__alignof' applied to a bit-field");
810 return size_one_node;
812 else if (TREE_CODE (expr) == COMPONENT_REF
813 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
814 return size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
816 if (TREE_CODE (expr) == INDIRECT_REF)
818 tree t = TREE_OPERAND (expr, 0);
820 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
822 while (TREE_CODE (t) == NOP_EXPR
823 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
827 t = TREE_OPERAND (t, 0);
828 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
829 if (thisalign > bestalign)
830 best = t, bestalign = thisalign;
832 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
835 return c_alignof (TREE_TYPE (expr));
838 /* Return either DECL or its known constant value (if it has one). */
841 decl_constant_value (decl)
844 if (/* Don't change a variable array bound or initial value to a constant
845 in a place where a variable is invalid. */
846 current_function_decl != 0
847 && ! TREE_THIS_VOLATILE (decl)
848 && TREE_READONLY (decl)
849 && DECL_INITIAL (decl) != 0
850 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
851 /* This is invalid if initial value is not constant.
852 If it has either a function call, a memory reference,
853 or a variable, then re-evaluating it could give different results. */
854 && TREE_CONSTANT (DECL_INITIAL (decl))
855 /* Check for cases where this is sub-optimal, even though valid. */
856 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
857 return DECL_INITIAL (decl);
861 /* Return either DECL or its known constant value (if it has one), but
862 return DECL if pedantic or DECL has mode BLKmode. This is for
863 bug-compatibility with the old behavior of decl_constant_value
864 (before GCC 3.0); every use of this function is a bug and it should
865 be removed before GCC 3.1. It is not appropriate to use pedantic
866 in a way that affects optimization, and BLKmode is probably not the
867 right test for avoiding misoptimizations either. */
870 decl_constant_value_for_broken_optimization (decl)
873 if (pedantic || DECL_MODE (decl) == BLKmode)
876 return decl_constant_value (decl);
879 /* Perform default promotions for C data used in expressions.
880 Arrays and functions are converted to pointers;
881 enumeral types or short or char, to int.
882 In addition, manifest constants symbols are replaced by their values. */
885 default_conversion (exp)
888 register tree type = TREE_TYPE (exp);
889 register enum tree_code code = TREE_CODE (type);
891 /* Constants can be used directly unless they're not loadable. */
892 if (TREE_CODE (exp) == CONST_DECL)
893 exp = DECL_INITIAL (exp);
895 /* Replace a nonvolatile const static variable with its value unless
896 it is an array, in which case we must be sure that taking the
897 address of the array produces consistent results. */
898 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
900 exp = decl_constant_value_for_broken_optimization (exp);
901 type = TREE_TYPE (exp);
904 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
907 Do not use STRIP_NOPS here! It will remove conversions from pointer
908 to integer and cause infinite recursion. */
909 while (TREE_CODE (exp) == NON_LVALUE_EXPR
910 || (TREE_CODE (exp) == NOP_EXPR
911 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
912 exp = TREE_OPERAND (exp, 0);
914 /* Normally convert enums to int,
915 but convert wide enums to something wider. */
916 if (code == ENUMERAL_TYPE)
918 type = type_for_size (MAX (TYPE_PRECISION (type),
919 TYPE_PRECISION (integer_type_node)),
921 || (TYPE_PRECISION (type)
922 >= TYPE_PRECISION (integer_type_node)))
923 && TREE_UNSIGNED (type)));
925 return convert (type, exp);
928 if (TREE_CODE (exp) == COMPONENT_REF
929 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
930 /* If it's thinner than an int, promote it like a
931 C_PROMOTING_INTEGER_TYPE_P, otherwise leave it alone. */
932 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
933 TYPE_PRECISION (integer_type_node)))
934 return convert (flag_traditional && TREE_UNSIGNED (type)
935 ? unsigned_type_node : integer_type_node,
938 if (C_PROMOTING_INTEGER_TYPE_P (type))
940 /* Traditionally, unsignedness is preserved in default promotions.
941 Also preserve unsignedness if not really getting any wider. */
942 if (TREE_UNSIGNED (type)
944 || TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
945 return convert (unsigned_type_node, exp);
947 return convert (integer_type_node, exp);
950 if (code == BOOLEAN_TYPE)
951 return convert (integer_type_node, exp);
953 if (flag_traditional && !flag_allow_single_precision
954 && TYPE_MAIN_VARIANT (type) == float_type_node)
955 return convert (double_type_node, exp);
957 if (code == VOID_TYPE)
959 error ("void value not ignored as it ought to be");
960 return error_mark_node;
962 if (code == FUNCTION_TYPE)
964 return build_unary_op (ADDR_EXPR, exp, 0);
966 if (code == ARRAY_TYPE)
969 tree restype = TREE_TYPE (type);
974 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
976 constp = TREE_READONLY (exp);
977 volatilep = TREE_THIS_VOLATILE (exp);
980 if (TYPE_QUALS (type) || constp || volatilep)
982 = c_build_qualified_type (restype,
984 | (constp * TYPE_QUAL_CONST)
985 | (volatilep * TYPE_QUAL_VOLATILE));
987 if (TREE_CODE (exp) == INDIRECT_REF)
988 return convert (TYPE_POINTER_TO (restype),
989 TREE_OPERAND (exp, 0));
991 if (TREE_CODE (exp) == COMPOUND_EXPR)
993 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
994 return build (COMPOUND_EXPR, TREE_TYPE (op1),
995 TREE_OPERAND (exp, 0), op1);
999 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1001 error ("invalid use of non-lvalue array");
1002 return error_mark_node;
1005 ptrtype = build_pointer_type (restype);
1007 if (TREE_CODE (exp) == VAR_DECL)
1009 /* ??? This is not really quite correct
1010 in that the type of the operand of ADDR_EXPR
1011 is not the target type of the type of the ADDR_EXPR itself.
1012 Question is, can this lossage be avoided? */
1013 adr = build1 (ADDR_EXPR, ptrtype, exp);
1014 if (mark_addressable (exp) == 0)
1015 return error_mark_node;
1016 TREE_CONSTANT (adr) = staticp (exp);
1017 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1020 /* This way is better for a COMPONENT_REF since it can
1021 simplify the offset for a component. */
1022 adr = build_unary_op (ADDR_EXPR, exp, 1);
1023 return convert (ptrtype, adr);
1028 /* Look up component name in the structure type definition.
1030 If this component name is found indirectly within an anonymous union,
1031 store in *INDIRECT the component which directly contains
1032 that anonymous union. Otherwise, set *INDIRECT to 0. */
1035 lookup_field (type, component, indirect)
1036 tree type, component;
1041 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1042 to the field elements. Use a binary search on this array to quickly
1043 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1044 will always be set for structures which have many elements. */
1046 if (TYPE_LANG_SPECIFIC (type))
1049 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1051 field = TYPE_FIELDS (type);
1053 top = TYPE_LANG_SPECIFIC (type)->len;
1054 while (top - bot > 1)
1056 half = (top - bot + 1) >> 1;
1057 field = field_array[bot+half];
1059 if (DECL_NAME (field) == NULL_TREE)
1061 /* Step through all anon unions in linear fashion. */
1062 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1064 tree anon = 0, junk;
1066 field = field_array[bot++];
1067 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1068 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1069 anon = lookup_field (TREE_TYPE (field), component, &junk);
1071 if (anon != NULL_TREE)
1078 /* Entire record is only anon unions. */
1082 /* Restart the binary search, with new lower bound. */
1086 if (DECL_NAME (field) == component)
1088 if (DECL_NAME (field) < component)
1094 if (DECL_NAME (field_array[bot]) == component)
1095 field = field_array[bot];
1096 else if (DECL_NAME (field) != component)
1101 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1103 if (DECL_NAME (field) == NULL_TREE)
1108 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1109 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1110 anon = lookup_field (TREE_TYPE (field), component, &junk);
1112 if (anon != NULL_TREE)
1119 if (DECL_NAME (field) == component)
1124 *indirect = NULL_TREE;
1128 /* Make an expression to refer to the COMPONENT field of
1129 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1132 build_component_ref (datum, component)
1133 tree datum, component;
1135 register tree type = TREE_TYPE (datum);
1136 register enum tree_code code = TREE_CODE (type);
1137 register tree field = NULL;
1140 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference inside it
1141 unless we are not to support things not strictly ANSI. */
1142 switch (TREE_CODE (datum))
1146 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1147 return build (COMPOUND_EXPR, TREE_TYPE (value),
1148 TREE_OPERAND (datum, 0), value);
1151 return build_conditional_expr
1152 (TREE_OPERAND (datum, 0),
1153 build_component_ref (TREE_OPERAND (datum, 1), component),
1154 build_component_ref (TREE_OPERAND (datum, 2), component));
1160 /* See if there is a field or component with name COMPONENT. */
1162 if (code == RECORD_TYPE || code == UNION_TYPE)
1166 if (!COMPLETE_TYPE_P (type))
1168 incomplete_type_error (NULL_TREE, type);
1169 return error_mark_node;
1172 field = lookup_field (type, component, &indirect);
1176 error ("%s has no member named `%s'",
1177 code == RECORD_TYPE ? "structure" : "union",
1178 IDENTIFIER_POINTER (component));
1179 return error_mark_node;
1181 if (TREE_TYPE (field) == error_mark_node)
1182 return error_mark_node;
1184 /* If FIELD was found buried within an anonymous union,
1185 make one COMPONENT_REF to get that anonymous union,
1186 then fall thru to make a second COMPONENT_REF to get FIELD. */
1189 ref = build (COMPONENT_REF, TREE_TYPE (indirect), datum, indirect);
1190 if (TREE_READONLY (datum) || TREE_READONLY (indirect))
1191 TREE_READONLY (ref) = 1;
1192 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (indirect))
1193 TREE_THIS_VOLATILE (ref) = 1;
1197 ref = build (COMPONENT_REF, TREE_TYPE (field), datum, field);
1199 if (TREE_READONLY (datum) || TREE_READONLY (field))
1200 TREE_READONLY (ref) = 1;
1201 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (field))
1202 TREE_THIS_VOLATILE (ref) = 1;
1206 else if (code != ERROR_MARK)
1207 error ("request for member `%s' in something not a structure or union",
1208 IDENTIFIER_POINTER (component));
1210 return error_mark_node;
1213 /* Given an expression PTR for a pointer, return an expression
1214 for the value pointed to.
1215 ERRORSTRING is the name of the operator to appear in error messages. */
1218 build_indirect_ref (ptr, errorstring)
1220 const char *errorstring;
1222 register tree pointer = default_conversion (ptr);
1223 register tree type = TREE_TYPE (pointer);
1225 if (TREE_CODE (type) == POINTER_TYPE)
1227 if (TREE_CODE (pointer) == ADDR_EXPR
1229 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1230 == TREE_TYPE (type)))
1231 return TREE_OPERAND (pointer, 0);
1234 tree t = TREE_TYPE (type);
1235 register tree ref = build1 (INDIRECT_REF,
1236 TYPE_MAIN_VARIANT (t), pointer);
1238 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1240 error ("dereferencing pointer to incomplete type");
1241 return error_mark_node;
1243 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1244 warning ("dereferencing `void *' pointer");
1246 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1247 so that we get the proper error message if the result is used
1248 to assign to. Also, &* is supposed to be a no-op.
1249 And ANSI C seems to specify that the type of the result
1250 should be the const type. */
1251 /* A de-reference of a pointer to const is not a const. It is valid
1252 to change it via some other pointer. */
1253 TREE_READONLY (ref) = TYPE_READONLY (t);
1254 TREE_SIDE_EFFECTS (ref)
1255 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1256 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1260 else if (TREE_CODE (pointer) != ERROR_MARK)
1261 error ("invalid type argument of `%s'", errorstring);
1262 return error_mark_node;
1265 /* This handles expressions of the form "a[i]", which denotes
1268 This is logically equivalent in C to *(a+i), but we may do it differently.
1269 If A is a variable or a member, we generate a primitive ARRAY_REF.
1270 This avoids forcing the array out of registers, and can work on
1271 arrays that are not lvalues (for example, members of structures returned
1275 build_array_ref (array, index)
1280 error ("subscript missing in array reference");
1281 return error_mark_node;
1284 if (TREE_TYPE (array) == error_mark_node
1285 || TREE_TYPE (index) == error_mark_node)
1286 return error_mark_node;
1288 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1289 && TREE_CODE (array) != INDIRECT_REF)
1293 /* Subscripting with type char is likely to lose
1294 on a machine where chars are signed.
1295 So warn on any machine, but optionally.
1296 Don't warn for unsigned char since that type is safe.
1297 Don't warn for signed char because anyone who uses that
1298 must have done so deliberately. */
1299 if (warn_char_subscripts
1300 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1301 warning ("array subscript has type `char'");
1303 /* Apply default promotions *after* noticing character types. */
1304 index = default_conversion (index);
1306 /* Require integer *after* promotion, for sake of enums. */
1307 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1309 error ("array subscript is not an integer");
1310 return error_mark_node;
1313 /* An array that is indexed by a non-constant
1314 cannot be stored in a register; we must be able to do
1315 address arithmetic on its address.
1316 Likewise an array of elements of variable size. */
1317 if (TREE_CODE (index) != INTEGER_CST
1318 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1319 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1321 if (mark_addressable (array) == 0)
1322 return error_mark_node;
1324 /* An array that is indexed by a constant value which is not within
1325 the array bounds cannot be stored in a register either; because we
1326 would get a crash in store_bit_field/extract_bit_field when trying
1327 to access a non-existent part of the register. */
1328 if (TREE_CODE (index) == INTEGER_CST
1329 && TYPE_VALUES (TREE_TYPE (array))
1330 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1332 if (mark_addressable (array) == 0)
1333 return error_mark_node;
1339 while (TREE_CODE (foo) == COMPONENT_REF)
1340 foo = TREE_OPERAND (foo, 0);
1341 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1342 pedwarn ("ISO C forbids subscripting `register' array");
1343 else if (! flag_isoc99 && ! lvalue_p (foo))
1344 pedwarn ("ISO C89 forbids subscripting non-lvalue array");
1347 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1348 rval = build (ARRAY_REF, type, array, index);
1349 /* Array ref is const/volatile if the array elements are
1350 or if the array is. */
1351 TREE_READONLY (rval)
1352 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1353 | TREE_READONLY (array));
1354 TREE_SIDE_EFFECTS (rval)
1355 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1356 | TREE_SIDE_EFFECTS (array));
1357 TREE_THIS_VOLATILE (rval)
1358 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1359 /* This was added by rms on 16 Nov 91.
1360 It fixes vol struct foo *a; a->elts[1]
1361 in an inline function.
1362 Hope it doesn't break something else. */
1363 | TREE_THIS_VOLATILE (array));
1364 return require_complete_type (fold (rval));
1368 tree ar = default_conversion (array);
1369 tree ind = default_conversion (index);
1371 /* Do the same warning check as above, but only on the part that's
1372 syntactically the index and only if it is also semantically
1374 if (warn_char_subscripts
1375 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1376 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1377 warning ("subscript has type `char'");
1379 /* Put the integer in IND to simplify error checking. */
1380 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1387 if (ar == error_mark_node)
1390 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1391 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1393 error ("subscripted value is neither array nor pointer");
1394 return error_mark_node;
1396 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1398 error ("array subscript is not an integer");
1399 return error_mark_node;
1402 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1407 /* Build an external reference to identifier ID. FUN indicates
1408 whether this will be used for a function call. */
1410 build_external_ref (id, fun)
1415 tree decl = lookup_name (id);
1416 tree objc_ivar = lookup_objc_ivar (id);
1418 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1424 if (!decl || decl == error_mark_node)
1425 /* Ordinary implicit function declaration. */
1426 ref = implicitly_declare (id);
1429 /* Implicit declaration of built-in function. Don't
1430 change the built-in declaration, but don't let this
1431 go by silently, either. */
1432 implicit_decl_warning (id);
1434 /* only issue this warning once */
1435 C_DECL_ANTICIPATED (decl) = 0;
1441 /* Reference to undeclared variable, including reference to
1442 builtin outside of function-call context. */
1443 if (current_function_decl == 0)
1444 error ("`%s' undeclared here (not in a function)",
1445 IDENTIFIER_POINTER (id));
1448 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1449 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1451 error ("`%s' undeclared (first use in this function)",
1452 IDENTIFIER_POINTER (id));
1454 if (! undeclared_variable_notice)
1456 error ("(Each undeclared identifier is reported only once");
1457 error ("for each function it appears in.)");
1458 undeclared_variable_notice = 1;
1461 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1462 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1464 return error_mark_node;
1469 /* Properly declared variable or function reference. */
1472 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1474 warning ("local declaration of `%s' hides instance variable",
1475 IDENTIFIER_POINTER (id));
1482 if (TREE_TYPE (ref) == error_mark_node)
1483 return error_mark_node;
1485 assemble_external (ref);
1486 TREE_USED (ref) = 1;
1488 if (TREE_CODE (ref) == CONST_DECL)
1490 ref = DECL_INITIAL (ref);
1491 TREE_CONSTANT (ref) = 1;
1497 /* Build a function call to function FUNCTION with parameters PARAMS.
1498 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1499 TREE_VALUE of each node is a parameter-expression.
1500 FUNCTION's data type may be a function type or a pointer-to-function. */
1503 build_function_call (function, params)
1504 tree function, params;
1506 register tree fntype, fundecl = 0;
1507 register tree coerced_params;
1508 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1510 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1511 STRIP_TYPE_NOPS (function);
1513 /* Convert anything with function type to a pointer-to-function. */
1514 if (TREE_CODE (function) == FUNCTION_DECL)
1516 name = DECL_NAME (function);
1517 assembler_name = DECL_ASSEMBLER_NAME (function);
1519 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1520 (because calling an inline function does not mean the function
1521 needs to be separately compiled). */
1522 fntype = build_type_variant (TREE_TYPE (function),
1523 TREE_READONLY (function),
1524 TREE_THIS_VOLATILE (function));
1526 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1529 function = default_conversion (function);
1531 fntype = TREE_TYPE (function);
1533 if (TREE_CODE (fntype) == ERROR_MARK)
1534 return error_mark_node;
1536 if (!(TREE_CODE (fntype) == POINTER_TYPE
1537 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1539 error ("called object is not a function");
1540 return error_mark_node;
1543 /* fntype now gets the type of function pointed to. */
1544 fntype = TREE_TYPE (fntype);
1546 /* Convert the parameters to the types declared in the
1547 function prototype, or apply default promotions. */
1550 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1552 /* Check for errors in format strings. */
1554 if (warn_format && (name || assembler_name))
1555 check_function_format (NULL, name, assembler_name, coerced_params);
1557 /* Recognize certain built-in functions so we can make tree-codes
1558 other than CALL_EXPR. We do this when it enables fold-const.c
1559 to do something useful. */
1561 if (TREE_CODE (function) == ADDR_EXPR
1562 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1563 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1565 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1566 params, coerced_params);
1571 result = build (CALL_EXPR, TREE_TYPE (fntype),
1572 function, coerced_params, NULL_TREE);
1573 TREE_SIDE_EFFECTS (result) = 1;
1574 result = fold (result);
1576 if (VOID_TYPE_P (TREE_TYPE (result)))
1578 return require_complete_type (result);
1581 /* Convert the argument expressions in the list VALUES
1582 to the types in the list TYPELIST. The result is a list of converted
1583 argument expressions.
1585 If TYPELIST is exhausted, or when an element has NULL as its type,
1586 perform the default conversions.
1588 PARMLIST is the chain of parm decls for the function being called.
1589 It may be 0, if that info is not available.
1590 It is used only for generating error messages.
1592 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1594 This is also where warnings about wrong number of args are generated.
1596 Both VALUES and the returned value are chains of TREE_LIST nodes
1597 with the elements of the list in the TREE_VALUE slots of those nodes. */
1600 convert_arguments (typelist, values, name, fundecl)
1601 tree typelist, values, name, fundecl;
1603 register tree typetail, valtail;
1604 register tree result = NULL;
1607 /* Scan the given expressions and types, producing individual
1608 converted arguments and pushing them on RESULT in reverse order. */
1610 for (valtail = values, typetail = typelist, parmnum = 0;
1612 valtail = TREE_CHAIN (valtail), parmnum++)
1614 register tree type = typetail ? TREE_VALUE (typetail) : 0;
1615 register tree val = TREE_VALUE (valtail);
1617 if (type == void_type_node)
1620 error ("too many arguments to function `%s'",
1621 IDENTIFIER_POINTER (name));
1623 error ("too many arguments to function");
1627 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1628 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1629 to convert automatically to a pointer. */
1630 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1631 val = TREE_OPERAND (val, 0);
1633 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
1634 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE)
1635 val = default_conversion (val);
1637 val = require_complete_type (val);
1641 /* Formal parm type is specified by a function prototype. */
1644 if (!COMPLETE_TYPE_P (type))
1646 error ("type of formal parameter %d is incomplete", parmnum + 1);
1651 /* Optionally warn about conversions that
1652 differ from the default conversions. */
1653 if (warn_conversion)
1655 int formal_prec = TYPE_PRECISION (type);
1657 if (INTEGRAL_TYPE_P (type)
1658 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1659 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1660 else if (TREE_CODE (type) == COMPLEX_TYPE
1661 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1662 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1663 else if (TREE_CODE (type) == REAL_TYPE
1664 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1665 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1666 else if (TREE_CODE (type) == REAL_TYPE
1667 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1668 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1669 /* ??? At some point, messages should be written about
1670 conversions between complex types, but that's too messy
1672 else if (TREE_CODE (type) == REAL_TYPE
1673 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1675 /* Warn if any argument is passed as `float',
1676 since without a prototype it would be `double'. */
1677 if (formal_prec == TYPE_PRECISION (float_type_node))
1678 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1680 /* Detect integer changing in width or signedness. */
1681 else if (INTEGRAL_TYPE_P (type)
1682 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1684 tree would_have_been = default_conversion (val);
1685 tree type1 = TREE_TYPE (would_have_been);
1687 if (TREE_CODE (type) == ENUMERAL_TYPE
1688 && type == TREE_TYPE (val))
1689 /* No warning if function asks for enum
1690 and the actual arg is that enum type. */
1692 else if (formal_prec != TYPE_PRECISION (type1))
1693 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1694 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1696 /* Don't complain if the formal parameter type
1697 is an enum, because we can't tell now whether
1698 the value was an enum--even the same enum. */
1699 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1701 else if (TREE_CODE (val) == INTEGER_CST
1702 && int_fits_type_p (val, type))
1703 /* Change in signedness doesn't matter
1704 if a constant value is unaffected. */
1706 /* Likewise for a constant in a NOP_EXPR. */
1707 else if (TREE_CODE (val) == NOP_EXPR
1708 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1709 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1711 #if 0 /* We never get such tree structure here. */
1712 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1713 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1714 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1715 /* Change in signedness doesn't matter
1716 if an enum value is unaffected. */
1719 /* If the value is extended from a narrower
1720 unsigned type, it doesn't matter whether we
1721 pass it as signed or unsigned; the value
1722 certainly is the same either way. */
1723 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1724 && TREE_UNSIGNED (TREE_TYPE (val)))
1726 else if (TREE_UNSIGNED (type))
1727 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1729 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1733 parmval = convert_for_assignment (type, val,
1734 (char *) 0, /* arg passing */
1735 fundecl, name, parmnum + 1);
1737 if (PROMOTE_PROTOTYPES
1738 && (TREE_CODE (type) == INTEGER_TYPE
1739 || TREE_CODE (type) == ENUMERAL_TYPE
1740 || TREE_CODE (type) == BOOLEAN_TYPE)
1741 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1742 parmval = default_conversion (parmval);
1744 result = tree_cons (NULL_TREE, parmval, result);
1746 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1747 && (TYPE_PRECISION (TREE_TYPE (val))
1748 < TYPE_PRECISION (double_type_node)))
1749 /* Convert `float' to `double'. */
1750 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1752 /* Convert `short' and `char' to full-size `int'. */
1753 result = tree_cons (NULL_TREE, default_conversion (val), result);
1756 typetail = TREE_CHAIN (typetail);
1759 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1762 error ("too few arguments to function `%s'",
1763 IDENTIFIER_POINTER (name));
1765 error ("too few arguments to function");
1768 return nreverse (result);
1771 /* This is the entry point used by the parser
1772 for binary operators in the input.
1773 In addition to constructing the expression,
1774 we check for operands that were written with other binary operators
1775 in a way that is likely to confuse the user. */
1778 parser_build_binary_op (code, arg1, arg2)
1779 enum tree_code code;
1782 tree result = build_binary_op (code, arg1, arg2, 1);
1785 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1786 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1787 enum tree_code code1 = ERROR_MARK;
1788 enum tree_code code2 = ERROR_MARK;
1790 if (class1 == 'e' || class1 == '1'
1791 || class1 == '2' || class1 == '<')
1792 code1 = C_EXP_ORIGINAL_CODE (arg1);
1793 if (class2 == 'e' || class2 == '1'
1794 || class2 == '2' || class2 == '<')
1795 code2 = C_EXP_ORIGINAL_CODE (arg2);
1797 /* Check for cases such as x+y<<z which users are likely
1798 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1799 is cleared to prevent these warnings. */
1800 if (warn_parentheses)
1802 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1804 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1805 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1806 warning ("suggest parentheses around + or - inside shift");
1809 if (code == TRUTH_ORIF_EXPR)
1811 if (code1 == TRUTH_ANDIF_EXPR
1812 || code2 == TRUTH_ANDIF_EXPR)
1813 warning ("suggest parentheses around && within ||");
1816 if (code == BIT_IOR_EXPR)
1818 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1819 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1820 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1821 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1822 warning ("suggest parentheses around arithmetic in operand of |");
1823 /* Check cases like x|y==z */
1824 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1825 warning ("suggest parentheses around comparison in operand of |");
1828 if (code == BIT_XOR_EXPR)
1830 if (code1 == BIT_AND_EXPR
1831 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1832 || code2 == BIT_AND_EXPR
1833 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1834 warning ("suggest parentheses around arithmetic in operand of ^");
1835 /* Check cases like x^y==z */
1836 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1837 warning ("suggest parentheses around comparison in operand of ^");
1840 if (code == BIT_AND_EXPR)
1842 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1843 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1844 warning ("suggest parentheses around + or - in operand of &");
1845 /* Check cases like x&y==z */
1846 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1847 warning ("suggest parentheses around comparison in operand of &");
1851 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1852 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1853 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1854 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1856 unsigned_conversion_warning (result, arg1);
1857 unsigned_conversion_warning (result, arg2);
1858 overflow_warning (result);
1860 class = TREE_CODE_CLASS (TREE_CODE (result));
1862 /* Record the code that was specified in the source,
1863 for the sake of warnings about confusing nesting. */
1864 if (class == 'e' || class == '1'
1865 || class == '2' || class == '<')
1866 C_SET_EXP_ORIGINAL_CODE (result, code);
1869 int flag = TREE_CONSTANT (result);
1870 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1871 so that convert_for_assignment wouldn't strip it.
1872 That way, we got warnings for things like p = (1 - 1).
1873 But it turns out we should not get those warnings. */
1874 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1875 C_SET_EXP_ORIGINAL_CODE (result, code);
1876 TREE_CONSTANT (result) = flag;
1882 /* Build a binary-operation expression without default conversions.
1883 CODE is the kind of expression to build.
1884 This function differs from `build' in several ways:
1885 the data type of the result is computed and recorded in it,
1886 warnings are generated if arg data types are invalid,
1887 special handling for addition and subtraction of pointers is known,
1888 and some optimization is done (operations on narrow ints
1889 are done in the narrower type when that gives the same result).
1890 Constant folding is also done before the result is returned.
1892 Note that the operands will never have enumeral types, or function
1893 or array types, because either they will have the default conversions
1894 performed or they have both just been converted to some other type in which
1895 the arithmetic is to be done. */
1898 build_binary_op (code, orig_op0, orig_op1, convert_p)
1899 enum tree_code code;
1900 tree orig_op0, orig_op1;
1904 register enum tree_code code0, code1;
1907 /* Expression code to give to the expression when it is built.
1908 Normally this is CODE, which is what the caller asked for,
1909 but in some special cases we change it. */
1910 register enum tree_code resultcode = code;
1912 /* Data type in which the computation is to be performed.
1913 In the simplest cases this is the common type of the arguments. */
1914 register tree result_type = NULL;
1916 /* Nonzero means operands have already been type-converted
1917 in whatever way is necessary.
1918 Zero means they need to be converted to RESULT_TYPE. */
1921 /* Nonzero means create the expression with this type, rather than
1923 tree build_type = 0;
1925 /* Nonzero means after finally constructing the expression
1926 convert it to this type. */
1927 tree final_type = 0;
1929 /* Nonzero if this is an operation like MIN or MAX which can
1930 safely be computed in short if both args are promoted shorts.
1931 Also implies COMMON.
1932 -1 indicates a bitwise operation; this makes a difference
1933 in the exact conditions for when it is safe to do the operation
1934 in a narrower mode. */
1937 /* Nonzero if this is a comparison operation;
1938 if both args are promoted shorts, compare the original shorts.
1939 Also implies COMMON. */
1940 int short_compare = 0;
1942 /* Nonzero if this is a right-shift operation, which can be computed on the
1943 original short and then promoted if the operand is a promoted short. */
1944 int short_shift = 0;
1946 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1951 op0 = default_conversion (orig_op0);
1952 op1 = default_conversion (orig_op1);
1960 type0 = TREE_TYPE (op0);
1961 type1 = TREE_TYPE (op1);
1963 /* The expression codes of the data types of the arguments tell us
1964 whether the arguments are integers, floating, pointers, etc. */
1965 code0 = TREE_CODE (type0);
1966 code1 = TREE_CODE (type1);
1968 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1969 STRIP_TYPE_NOPS (op0);
1970 STRIP_TYPE_NOPS (op1);
1972 /* If an error was already reported for one of the arguments,
1973 avoid reporting another error. */
1975 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1976 return error_mark_node;
1981 /* Handle the pointer + int case. */
1982 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1983 return pointer_int_sum (PLUS_EXPR, op0, op1);
1984 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1985 return pointer_int_sum (PLUS_EXPR, op1, op0);
1991 /* Subtraction of two similar pointers.
1992 We must subtract them as integers, then divide by object size. */
1993 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
1994 && comp_target_types (type0, type1))
1995 return pointer_diff (op0, op1);
1996 /* Handle pointer minus int. Just like pointer plus int. */
1997 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1998 return pointer_int_sum (MINUS_EXPR, op0, op1);
2007 case TRUNC_DIV_EXPR:
2009 case FLOOR_DIV_EXPR:
2010 case ROUND_DIV_EXPR:
2011 case EXACT_DIV_EXPR:
2012 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2013 || code0 == COMPLEX_TYPE)
2014 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2015 || code1 == COMPLEX_TYPE))
2017 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
2018 resultcode = RDIV_EXPR;
2020 /* Although it would be tempting to shorten always here, that
2021 loses on some targets, since the modulo instruction is
2022 undefined if the quotient can't be represented in the
2023 computation mode. We shorten only if unsigned or if
2024 dividing by something we know != -1. */
2025 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2026 || (TREE_CODE (op1) == INTEGER_CST
2027 && ! integer_all_onesp (op1)));
2033 case BIT_ANDTC_EXPR:
2036 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2038 /* If one operand is a constant, and the other is a short type
2039 that has been converted to an int,
2040 really do the work in the short type and then convert the
2041 result to int. If we are lucky, the constant will be 0 or 1
2042 in the short type, making the entire operation go away. */
2043 if (TREE_CODE (op0) == INTEGER_CST
2044 && TREE_CODE (op1) == NOP_EXPR
2045 && TYPE_PRECISION (type1) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))
2046 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
2048 final_type = result_type;
2049 op1 = TREE_OPERAND (op1, 0);
2050 result_type = TREE_TYPE (op1);
2052 if (TREE_CODE (op1) == INTEGER_CST
2053 && TREE_CODE (op0) == NOP_EXPR
2054 && TYPE_PRECISION (type0) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))
2055 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2057 final_type = result_type;
2058 op0 = TREE_OPERAND (op0, 0);
2059 result_type = TREE_TYPE (op0);
2063 case TRUNC_MOD_EXPR:
2064 case FLOOR_MOD_EXPR:
2065 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2067 /* Although it would be tempting to shorten always here, that loses
2068 on some targets, since the modulo instruction is undefined if the
2069 quotient can't be represented in the computation mode. We shorten
2070 only if unsigned or if dividing by something we know != -1. */
2071 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2072 || (TREE_CODE (op1) == INTEGER_CST
2073 && ! integer_all_onesp (op1)));
2078 case TRUTH_ANDIF_EXPR:
2079 case TRUTH_ORIF_EXPR:
2080 case TRUTH_AND_EXPR:
2082 case TRUTH_XOR_EXPR:
2083 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2084 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2085 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2086 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2088 /* Result of these operations is always an int,
2089 but that does not mean the operands should be
2090 converted to ints! */
2091 result_type = integer_type_node;
2092 op0 = truthvalue_conversion (op0);
2093 op1 = truthvalue_conversion (op1);
2098 /* Shift operations: result has same type as first operand;
2099 always convert second operand to int.
2100 Also set SHORT_SHIFT if shifting rightward. */
2103 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2105 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2107 if (tree_int_cst_sgn (op1) < 0)
2108 warning ("right shift count is negative");
2111 if (! integer_zerop (op1))
2114 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2115 warning ("right shift count >= width of type");
2119 /* Use the type of the value to be shifted.
2120 This is what most traditional C compilers do. */
2121 result_type = type0;
2122 /* Unless traditional, convert the shift-count to an integer,
2123 regardless of size of value being shifted. */
2124 if (! flag_traditional)
2126 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2127 op1 = convert (integer_type_node, op1);
2128 /* Avoid converting op1 to result_type later. */
2135 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2137 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2139 if (tree_int_cst_sgn (op1) < 0)
2140 warning ("left shift count is negative");
2142 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2143 warning ("left shift count >= width of type");
2146 /* Use the type of the value to be shifted.
2147 This is what most traditional C compilers do. */
2148 result_type = type0;
2149 /* Unless traditional, convert the shift-count to an integer,
2150 regardless of size of value being shifted. */
2151 if (! flag_traditional)
2153 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2154 op1 = convert (integer_type_node, op1);
2155 /* Avoid converting op1 to result_type later. */
2163 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2165 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2167 if (tree_int_cst_sgn (op1) < 0)
2168 warning ("shift count is negative");
2169 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2170 warning ("shift count >= width of type");
2173 /* Use the type of the value to be shifted.
2174 This is what most traditional C compilers do. */
2175 result_type = type0;
2176 /* Unless traditional, convert the shift-count to an integer,
2177 regardless of size of value being shifted. */
2178 if (! flag_traditional)
2180 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2181 op1 = convert (integer_type_node, op1);
2182 /* Avoid converting op1 to result_type later. */
2190 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2191 warning ("comparing floating point with == or != is unsafe");
2192 /* Result of comparison is always int,
2193 but don't convert the args to int! */
2194 build_type = integer_type_node;
2195 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2196 || code0 == COMPLEX_TYPE)
2197 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2198 || code1 == COMPLEX_TYPE))
2200 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2202 register tree tt0 = TREE_TYPE (type0);
2203 register tree tt1 = TREE_TYPE (type1);
2204 /* Anything compares with void *. void * compares with anything.
2205 Otherwise, the targets must be compatible
2206 and both must be object or both incomplete. */
2207 if (comp_target_types (type0, type1))
2208 result_type = common_type (type0, type1);
2209 else if (VOID_TYPE_P (tt0))
2211 /* op0 != orig_op0 detects the case of something
2212 whose value is 0 but which isn't a valid null ptr const. */
2213 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2214 && TREE_CODE (tt1) == FUNCTION_TYPE)
2215 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2217 else if (VOID_TYPE_P (tt1))
2219 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2220 && TREE_CODE (tt0) == FUNCTION_TYPE)
2221 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2224 pedwarn ("comparison of distinct pointer types lacks a cast");
2226 if (result_type == NULL_TREE)
2227 result_type = ptr_type_node;
2229 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2230 && integer_zerop (op1))
2231 result_type = type0;
2232 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2233 && integer_zerop (op0))
2234 result_type = type1;
2235 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2237 result_type = type0;
2238 if (! flag_traditional)
2239 pedwarn ("comparison between pointer and integer");
2241 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2243 result_type = type1;
2244 if (! flag_traditional)
2245 pedwarn ("comparison between pointer and integer");
2251 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2252 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2254 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2256 if (comp_target_types (type0, type1))
2258 result_type = common_type (type0, type1);
2260 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2261 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2265 result_type = ptr_type_node;
2266 pedwarn ("comparison of distinct pointer types lacks a cast");
2275 build_type = integer_type_node;
2276 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2277 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2279 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2281 if (comp_target_types (type0, type1))
2283 result_type = common_type (type0, type1);
2284 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2285 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2286 pedwarn ("comparison of complete and incomplete pointers");
2288 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2289 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2293 result_type = ptr_type_node;
2294 pedwarn ("comparison of distinct pointer types lacks a cast");
2297 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2298 && integer_zerop (op1))
2300 result_type = type0;
2301 if (pedantic || extra_warnings)
2302 pedwarn ("ordered comparison of pointer with integer zero");
2304 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2305 && integer_zerop (op0))
2307 result_type = type1;
2309 pedwarn ("ordered comparison of pointer with integer zero");
2311 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2313 result_type = type0;
2314 if (! flag_traditional)
2315 pedwarn ("comparison between pointer and integer");
2317 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2319 result_type = type1;
2320 if (! flag_traditional)
2321 pedwarn ("comparison between pointer and integer");
2325 case UNORDERED_EXPR:
2332 build_type = integer_type_node;
2333 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2335 error ("unordered comparison on non-floating point argument");
2336 return error_mark_node;
2345 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2347 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2349 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2351 if (shorten || common || short_compare)
2352 result_type = common_type (type0, type1);
2354 /* For certain operations (which identify themselves by shorten != 0)
2355 if both args were extended from the same smaller type,
2356 do the arithmetic in that type and then extend.
2358 shorten !=0 and !=1 indicates a bitwise operation.
2359 For them, this optimization is safe only if
2360 both args are zero-extended or both are sign-extended.
2361 Otherwise, we might change the result.
2362 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2363 but calculated in (unsigned short) it would be (unsigned short)-1. */
2365 if (shorten && none_complex)
2367 int unsigned0, unsigned1;
2368 tree arg0 = get_narrower (op0, &unsigned0);
2369 tree arg1 = get_narrower (op1, &unsigned1);
2370 /* UNS is 1 if the operation to be done is an unsigned one. */
2371 int uns = TREE_UNSIGNED (result_type);
2374 final_type = result_type;
2376 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2377 but it *requires* conversion to FINAL_TYPE. */
2379 if ((TYPE_PRECISION (TREE_TYPE (op0))
2380 == TYPE_PRECISION (TREE_TYPE (arg0)))
2381 && TREE_TYPE (op0) != final_type)
2382 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2383 if ((TYPE_PRECISION (TREE_TYPE (op1))
2384 == TYPE_PRECISION (TREE_TYPE (arg1)))
2385 && TREE_TYPE (op1) != final_type)
2386 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2388 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2390 /* For bitwise operations, signedness of nominal type
2391 does not matter. Consider only how operands were extended. */
2395 /* Note that in all three cases below we refrain from optimizing
2396 an unsigned operation on sign-extended args.
2397 That would not be valid. */
2399 /* Both args variable: if both extended in same way
2400 from same width, do it in that width.
2401 Do it unsigned if args were zero-extended. */
2402 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2403 < TYPE_PRECISION (result_type))
2404 && (TYPE_PRECISION (TREE_TYPE (arg1))
2405 == TYPE_PRECISION (TREE_TYPE (arg0)))
2406 && unsigned0 == unsigned1
2407 && (unsigned0 || !uns))
2409 = signed_or_unsigned_type (unsigned0,
2410 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2411 else if (TREE_CODE (arg0) == INTEGER_CST
2412 && (unsigned1 || !uns)
2413 && (TYPE_PRECISION (TREE_TYPE (arg1))
2414 < TYPE_PRECISION (result_type))
2415 && (type = signed_or_unsigned_type (unsigned1,
2417 int_fits_type_p (arg0, type)))
2419 else if (TREE_CODE (arg1) == INTEGER_CST
2420 && (unsigned0 || !uns)
2421 && (TYPE_PRECISION (TREE_TYPE (arg0))
2422 < TYPE_PRECISION (result_type))
2423 && (type = signed_or_unsigned_type (unsigned0,
2425 int_fits_type_p (arg1, type)))
2429 /* Shifts can be shortened if shifting right. */
2434 tree arg0 = get_narrower (op0, &unsigned_arg);
2436 final_type = result_type;
2438 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2439 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2441 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2442 /* We can shorten only if the shift count is less than the
2443 number of bits in the smaller type size. */
2444 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2445 /* If arg is sign-extended and then unsigned-shifted,
2446 we can simulate this with a signed shift in arg's type
2447 only if the extended result is at least twice as wide
2448 as the arg. Otherwise, the shift could use up all the
2449 ones made by sign-extension and bring in zeros.
2450 We can't optimize that case at all, but in most machines
2451 it never happens because available widths are 2**N. */
2452 && (!TREE_UNSIGNED (final_type)
2454 || (2 * TYPE_PRECISION (TREE_TYPE (arg0))
2455 <= TYPE_PRECISION (result_type))))
2457 /* Do an unsigned shift if the operand was zero-extended. */
2459 = signed_or_unsigned_type (unsigned_arg,
2461 /* Convert value-to-be-shifted to that type. */
2462 if (TREE_TYPE (op0) != result_type)
2463 op0 = convert (result_type, op0);
2468 /* Comparison operations are shortened too but differently.
2469 They identify themselves by setting short_compare = 1. */
2473 /* Don't write &op0, etc., because that would prevent op0
2474 from being kept in a register.
2475 Instead, make copies of the our local variables and
2476 pass the copies by reference, then copy them back afterward. */
2477 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2478 enum tree_code xresultcode = resultcode;
2480 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2485 op0 = xop0, op1 = xop1;
2487 resultcode = xresultcode;
2489 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2490 && skip_evaluation == 0)
2492 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2493 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2494 int unsignedp0, unsignedp1;
2495 tree primop0 = get_narrower (op0, &unsignedp0);
2496 tree primop1 = get_narrower (op1, &unsignedp1);
2500 STRIP_TYPE_NOPS (xop0);
2501 STRIP_TYPE_NOPS (xop1);
2503 /* Give warnings for comparisons between signed and unsigned
2504 quantities that may fail.
2506 Do the checking based on the original operand trees, so that
2507 casts will be considered, but default promotions won't be.
2509 Do not warn if the comparison is being done in a signed type,
2510 since the signed type will only be chosen if it can represent
2511 all the values of the unsigned type. */
2512 if (! TREE_UNSIGNED (result_type))
2514 /* Do not warn if both operands are the same signedness. */
2515 else if (op0_signed == op1_signed)
2522 sop = xop0, uop = xop1;
2524 sop = xop1, uop = xop0;
2526 /* Do not warn if the signed quantity is an
2527 unsuffixed integer literal (or some static
2528 constant expression involving such literals or a
2529 conditional expression involving such literals)
2530 and it is non-negative. */
2531 if (tree_expr_nonnegative_p (sop))
2533 /* Do not warn if the comparison is an equality operation,
2534 the unsigned quantity is an integral constant, and it
2535 would fit in the result if the result were signed. */
2536 else if (TREE_CODE (uop) == INTEGER_CST
2537 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2538 && int_fits_type_p (uop, signed_type (result_type)))
2540 /* Do not warn if the unsigned quantity is an enumeration
2541 constant and its maximum value would fit in the result
2542 if the result were signed. */
2543 else if (TREE_CODE (uop) == INTEGER_CST
2544 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2545 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2546 signed_type (result_type)))
2549 warning ("comparison between signed and unsigned");
2552 /* Warn if two unsigned values are being compared in a size
2553 larger than their original size, and one (and only one) is the
2554 result of a `~' operator. This comparison will always fail.
2556 Also warn if one operand is a constant, and the constant
2557 does not have all bits set that are set in the ~ operand
2558 when it is extended. */
2560 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2561 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2563 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2564 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2567 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2570 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2573 HOST_WIDE_INT constant, mask;
2574 int unsignedp, bits;
2576 if (host_integerp (primop0, 0))
2579 unsignedp = unsignedp1;
2580 constant = tree_low_cst (primop0, 0);
2585 unsignedp = unsignedp0;
2586 constant = tree_low_cst (primop1, 0);
2589 bits = TYPE_PRECISION (TREE_TYPE (primop));
2590 if (bits < TYPE_PRECISION (result_type)
2591 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2593 mask = (~ (HOST_WIDE_INT) 0) << bits;
2594 if ((mask & constant) != mask)
2595 warning ("comparison of promoted ~unsigned with constant");
2598 else if (unsignedp0 && unsignedp1
2599 && (TYPE_PRECISION (TREE_TYPE (primop0))
2600 < TYPE_PRECISION (result_type))
2601 && (TYPE_PRECISION (TREE_TYPE (primop1))
2602 < TYPE_PRECISION (result_type)))
2603 warning ("comparison of promoted ~unsigned with unsigned");
2609 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2610 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2611 Then the expression will be built.
2612 It will be given type FINAL_TYPE if that is nonzero;
2613 otherwise, it will be given type RESULT_TYPE. */
2617 binary_op_error (code);
2618 return error_mark_node;
2623 if (TREE_TYPE (op0) != result_type)
2624 op0 = convert (result_type, op0);
2625 if (TREE_TYPE (op1) != result_type)
2626 op1 = convert (result_type, op1);
2629 if (build_type == NULL_TREE)
2630 build_type = result_type;
2633 register tree result = build (resultcode, build_type, op0, op1);
2634 register tree folded;
2636 folded = fold (result);
2637 if (folded == result)
2638 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2639 if (final_type != 0)
2640 return convert (final_type, folded);
2645 /* Return a tree for the sum or difference (RESULTCODE says which)
2646 of pointer PTROP and integer INTOP. */
2649 pointer_int_sum (resultcode, ptrop, intop)
2650 enum tree_code resultcode;
2651 register tree ptrop, intop;
2655 register tree result;
2656 register tree folded;
2658 /* The result is a pointer of the same type that is being added. */
2660 register tree result_type = TREE_TYPE (ptrop);
2662 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2664 if (pedantic || warn_pointer_arith)
2665 pedwarn ("pointer of type `void *' used in arithmetic");
2666 size_exp = integer_one_node;
2668 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2670 if (pedantic || warn_pointer_arith)
2671 pedwarn ("pointer to a function used in arithmetic");
2672 size_exp = integer_one_node;
2675 size_exp = c_size_in_bytes (TREE_TYPE (result_type));
2677 /* If what we are about to multiply by the size of the elements
2678 contains a constant term, apply distributive law
2679 and multiply that constant term separately.
2680 This helps produce common subexpressions. */
2682 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2683 && ! TREE_CONSTANT (intop)
2684 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2685 && TREE_CONSTANT (size_exp)
2686 /* If the constant comes from pointer subtraction,
2687 skip this optimization--it would cause an error. */
2688 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2689 /* If the constant is unsigned, and smaller than the pointer size,
2690 then we must skip this optimization. This is because it could cause
2691 an overflow error if the constant is negative but INTOP is not. */
2692 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2693 || (TYPE_PRECISION (TREE_TYPE (intop))
2694 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2696 enum tree_code subcode = resultcode;
2697 tree int_type = TREE_TYPE (intop);
2698 if (TREE_CODE (intop) == MINUS_EXPR)
2699 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2700 /* Convert both subexpression types to the type of intop,
2701 because weird cases involving pointer arithmetic
2702 can result in a sum or difference with different type args. */
2703 ptrop = build_binary_op (subcode, ptrop,
2704 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2705 intop = convert (int_type, TREE_OPERAND (intop, 0));
2708 /* Convert the integer argument to a type the same size as sizetype
2709 so the multiply won't overflow spuriously. */
2711 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2712 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2713 intop = convert (type_for_size (TYPE_PRECISION (sizetype),
2714 TREE_UNSIGNED (sizetype)), intop);
2716 /* Replace the integer argument with a suitable product by the object size.
2717 Do this multiplication as signed, then convert to the appropriate
2718 pointer type (actually unsigned integral). */
2720 intop = convert (result_type,
2721 build_binary_op (MULT_EXPR, intop,
2722 convert (TREE_TYPE (intop), size_exp), 1));
2724 /* Create the sum or difference. */
2726 result = build (resultcode, result_type, ptrop, intop);
2728 folded = fold (result);
2729 if (folded == result)
2730 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2734 /* Return a tree for the difference of pointers OP0 and OP1.
2735 The resulting tree has type int. */
2738 pointer_diff (op0, op1)
2739 register tree op0, op1;
2741 register tree result, folded;
2742 tree restype = ptrdiff_type_node;
2744 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2746 if (pedantic || warn_pointer_arith)
2748 if (TREE_CODE (target_type) == VOID_TYPE)
2749 pedwarn ("pointer of type `void *' used in subtraction");
2750 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2751 pedwarn ("pointer to a function used in subtraction");
2754 /* First do the subtraction as integers;
2755 then drop through to build the divide operator.
2756 Do not do default conversions on the minus operator
2757 in case restype is a short type. */
2759 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2760 convert (restype, op1), 0);
2761 /* This generates an error if op1 is pointer to incomplete type. */
2762 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
2763 error ("arithmetic on pointer to an incomplete type");
2765 /* This generates an error if op0 is pointer to incomplete type. */
2766 op1 = c_size_in_bytes (target_type);
2768 /* Divide by the size, in easiest possible way. */
2770 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2772 folded = fold (result);
2773 if (folded == result)
2774 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2778 /* Construct and perhaps optimize a tree representation
2779 for a unary operation. CODE, a tree_code, specifies the operation
2780 and XARG is the operand. NOCONVERT nonzero suppresses
2781 the default promotions (such as from short to int). */
2784 build_unary_op (code, xarg, noconvert)
2785 enum tree_code code;
2789 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2790 register tree arg = xarg;
2791 register tree argtype = 0;
2792 register enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2795 if (typecode == ERROR_MARK)
2796 return error_mark_node;
2797 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2798 typecode = INTEGER_TYPE;
2803 /* This is used for unary plus, because a CONVERT_EXPR
2804 is enough to prevent anybody from looking inside for
2805 associativity, but won't generate any code. */
2806 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2807 || typecode == COMPLEX_TYPE))
2809 error ("wrong type argument to unary plus");
2810 return error_mark_node;
2812 else if (!noconvert)
2813 arg = default_conversion (arg);
2817 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2818 || typecode == COMPLEX_TYPE))
2820 error ("wrong type argument to unary minus");
2821 return error_mark_node;
2823 else if (!noconvert)
2824 arg = default_conversion (arg);
2828 if (typecode == COMPLEX_TYPE)
2832 pedwarn ("ISO C does not support `~' for complex conjugation");
2834 arg = default_conversion (arg);
2836 else if (typecode != INTEGER_TYPE)
2838 error ("wrong type argument to bit-complement");
2839 return error_mark_node;
2841 else if (!noconvert)
2842 arg = default_conversion (arg);
2846 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2847 || typecode == COMPLEX_TYPE))
2849 error ("wrong type argument to abs");
2850 return error_mark_node;
2852 else if (!noconvert)
2853 arg = default_conversion (arg);
2857 /* Conjugating a real value is a no-op, but allow it anyway. */
2858 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2859 || typecode == COMPLEX_TYPE))
2861 error ("wrong type argument to conjugation");
2862 return error_mark_node;
2864 else if (!noconvert)
2865 arg = default_conversion (arg);
2868 case TRUTH_NOT_EXPR:
2869 if (typecode != INTEGER_TYPE
2870 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2871 && typecode != COMPLEX_TYPE
2872 /* These will convert to a pointer. */
2873 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2875 error ("wrong type argument to unary exclamation mark");
2876 return error_mark_node;
2878 arg = truthvalue_conversion (arg);
2879 return invert_truthvalue (arg);
2885 if (TREE_CODE (arg) == COMPLEX_CST)
2886 return TREE_REALPART (arg);
2887 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2888 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2893 if (TREE_CODE (arg) == COMPLEX_CST)
2894 return TREE_IMAGPART (arg);
2895 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2896 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2898 return convert (TREE_TYPE (arg), integer_zero_node);
2900 case PREINCREMENT_EXPR:
2901 case POSTINCREMENT_EXPR:
2902 case PREDECREMENT_EXPR:
2903 case POSTDECREMENT_EXPR:
2904 /* Handle complex lvalues (when permitted)
2905 by reduction to simpler cases. */
2907 val = unary_complex_lvalue (code, arg);
2911 /* Increment or decrement the real part of the value,
2912 and don't change the imaginary part. */
2913 if (typecode == COMPLEX_TYPE)
2918 pedwarn ("ISO C does not support `++' and `--' on complex types");
2920 arg = stabilize_reference (arg);
2921 real = build_unary_op (REALPART_EXPR, arg, 1);
2922 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2923 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2924 build_unary_op (code, real, 1), imag);
2927 /* Report invalid types. */
2929 if (typecode != POINTER_TYPE
2930 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2932 error ("wrong type argument to %s",
2933 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2934 ? "increment" : "decrement");
2935 return error_mark_node;
2940 tree result_type = TREE_TYPE (arg);
2942 arg = get_unwidened (arg, 0);
2943 argtype = TREE_TYPE (arg);
2945 /* Compute the increment. */
2947 if (typecode == POINTER_TYPE)
2949 /* If pointer target is an undefined struct,
2950 we just cannot know how to do the arithmetic. */
2951 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2952 error ("%s of pointer to unknown structure",
2953 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2954 ? "increment" : "decrement");
2955 else if ((pedantic || warn_pointer_arith)
2956 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2957 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2958 pedwarn ("wrong type argument to %s",
2959 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2960 ? "increment" : "decrement");
2961 inc = c_size_in_bytes (TREE_TYPE (result_type));
2964 inc = integer_one_node;
2966 inc = convert (argtype, inc);
2968 /* Handle incrementing a cast-expression. */
2971 switch (TREE_CODE (arg))
2976 case FIX_TRUNC_EXPR:
2977 case FIX_FLOOR_EXPR:
2978 case FIX_ROUND_EXPR:
2980 pedantic_lvalue_warning (CONVERT_EXPR);
2981 /* If the real type has the same machine representation
2982 as the type it is cast to, we can make better output
2983 by adding directly to the inside of the cast. */
2984 if ((TREE_CODE (TREE_TYPE (arg))
2985 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2986 && (TYPE_MODE (TREE_TYPE (arg))
2987 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2988 arg = TREE_OPERAND (arg, 0);
2991 tree incremented, modify, value;
2992 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2993 value = boolean_increment (code, arg);
2996 arg = stabilize_reference (arg);
2997 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
3000 value = save_expr (arg);
3001 incremented = build (((code == PREINCREMENT_EXPR
3002 || code == POSTINCREMENT_EXPR)
3003 ? PLUS_EXPR : MINUS_EXPR),
3004 argtype, value, inc);
3005 TREE_SIDE_EFFECTS (incremented) = 1;
3006 modify = build_modify_expr (arg, NOP_EXPR, incremented);
3007 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
3009 TREE_USED (value) = 1;
3019 /* Complain about anything else that is not a true lvalue. */
3020 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3021 || code == POSTINCREMENT_EXPR)
3022 ? "invalid lvalue in increment"
3023 : "invalid lvalue in decrement")))
3024 return error_mark_node;
3026 /* Report a read-only lvalue. */
3027 if (TREE_READONLY (arg))
3028 readonly_warning (arg,
3029 ((code == PREINCREMENT_EXPR
3030 || code == POSTINCREMENT_EXPR)
3031 ? "increment" : "decrement"));
3033 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3034 val = boolean_increment (code, arg);
3036 val = build (code, TREE_TYPE (arg), arg, inc);
3037 TREE_SIDE_EFFECTS (val) = 1;
3038 val = convert (result_type, val);
3039 if (TREE_CODE (val) != code)
3040 TREE_NO_UNUSED_WARNING (val) = 1;
3045 /* Note that this operation never does default_conversion
3046 regardless of NOCONVERT. */
3048 /* Let &* cancel out to simplify resulting code. */
3049 if (TREE_CODE (arg) == INDIRECT_REF)
3051 /* Don't let this be an lvalue. */
3052 if (lvalue_p (TREE_OPERAND (arg, 0)))
3053 return non_lvalue (TREE_OPERAND (arg, 0));
3054 return TREE_OPERAND (arg, 0);
3057 /* For &x[y], return x+y */
3058 if (TREE_CODE (arg) == ARRAY_REF)
3060 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
3061 return error_mark_node;
3062 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
3063 TREE_OPERAND (arg, 1), 1);
3066 /* Handle complex lvalues (when permitted)
3067 by reduction to simpler cases. */
3068 val = unary_complex_lvalue (code, arg);
3072 #if 0 /* Turned off because inconsistent;
3073 float f; *&(int)f = 3.4 stores in int format
3074 whereas (int)f = 3.4 stores in float format. */
3075 /* Address of a cast is just a cast of the address
3076 of the operand of the cast. */
3077 switch (TREE_CODE (arg))
3082 case FIX_TRUNC_EXPR:
3083 case FIX_FLOOR_EXPR:
3084 case FIX_ROUND_EXPR:
3087 pedwarn ("ISO C forbids the address of a cast expression");
3088 return convert (build_pointer_type (TREE_TYPE (arg)),
3089 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3094 /* Allow the address of a constructor if all the elements
3096 if (TREE_CODE (arg) == CONSTRUCTOR && TREE_CONSTANT (arg))
3098 /* Anything not already handled and not a true memory reference
3100 else if (typecode != FUNCTION_TYPE
3101 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3102 return error_mark_node;
3104 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3105 argtype = TREE_TYPE (arg);
3107 /* If the lvalue is const or volatile, merge that into the type
3108 to which the address will point. Note that you can't get a
3109 restricted pointer by taking the address of something, so we
3110 only have to deal with `const' and `volatile' here. */
3111 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3112 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3113 argtype = c_build_type_variant (argtype,
3114 TREE_READONLY (arg),
3115 TREE_THIS_VOLATILE (arg));
3117 argtype = build_pointer_type (argtype);
3119 if (mark_addressable (arg) == 0)
3120 return error_mark_node;
3125 if (TREE_CODE (arg) == COMPONENT_REF)
3127 tree field = TREE_OPERAND (arg, 1);
3129 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0);
3131 if (DECL_C_BIT_FIELD (field))
3133 error ("attempt to take address of bit-field structure member `%s'",
3134 IDENTIFIER_POINTER (DECL_NAME (field)));
3135 return error_mark_node;
3138 addr = fold (build (PLUS_EXPR, argtype,
3139 convert (argtype, addr),
3140 convert (argtype, byte_position (field))));
3143 addr = build1 (code, argtype, arg);
3145 /* Address of a static or external variable or
3146 file-scope function counts as a constant. */
3148 && ! (TREE_CODE (arg) == FUNCTION_DECL
3149 && DECL_CONTEXT (arg) != 0))
3150 TREE_CONSTANT (addr) = 1;
3159 argtype = TREE_TYPE (arg);
3160 return fold (build1 (code, argtype, arg));
3164 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3165 convert ARG with the same conversions in the same order
3166 and return the result. */
3169 convert_sequence (conversions, arg)
3173 switch (TREE_CODE (conversions))
3178 case FIX_TRUNC_EXPR:
3179 case FIX_FLOOR_EXPR:
3180 case FIX_ROUND_EXPR:
3182 return convert (TREE_TYPE (conversions),
3183 convert_sequence (TREE_OPERAND (conversions, 0),
3192 /* Return nonzero if REF is an lvalue valid for this language.
3193 Lvalues can be assigned, unless their type has TYPE_READONLY.
3194 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3200 register enum tree_code code = TREE_CODE (ref);
3207 return lvalue_p (TREE_OPERAND (ref, 0));
3218 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3219 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3223 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3230 /* Return nonzero if REF is an lvalue valid for this language;
3231 otherwise, print an error message and return zero. */
3234 lvalue_or_else (ref, msgid)
3238 int win = lvalue_p (ref);
3241 error ("%s", msgid);
3246 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3247 for certain kinds of expressions which are not really lvalues
3248 but which we can accept as lvalues.
3250 If ARG is not a kind of expression we can handle, return zero. */
3253 unary_complex_lvalue (code, arg)
3254 enum tree_code code;
3257 /* Handle (a, b) used as an "lvalue". */
3258 if (TREE_CODE (arg) == COMPOUND_EXPR)
3260 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3262 /* If this returns a function type, it isn't really being used as
3263 an lvalue, so don't issue a warning about it. */
3264 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3265 pedantic_lvalue_warning (COMPOUND_EXPR);
3267 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3268 TREE_OPERAND (arg, 0), real_result);
3271 /* Handle (a ? b : c) used as an "lvalue". */
3272 if (TREE_CODE (arg) == COND_EXPR)
3274 pedantic_lvalue_warning (COND_EXPR);
3275 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3276 pedantic_lvalue_warning (COMPOUND_EXPR);
3278 return (build_conditional_expr
3279 (TREE_OPERAND (arg, 0),
3280 build_unary_op (code, TREE_OPERAND (arg, 1), 0),
3281 build_unary_op (code, TREE_OPERAND (arg, 2), 0)));
3287 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3288 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3291 pedantic_lvalue_warning (code)
3292 enum tree_code code;
3298 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3301 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3304 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3309 /* Warn about storing in something that is `const'. */
3312 readonly_warning (arg, msgid)
3316 if (TREE_CODE (arg) == COMPONENT_REF)
3318 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3319 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3321 pedwarn ("%s of read-only member `%s'", _(msgid),
3322 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3324 else if (TREE_CODE (arg) == VAR_DECL)
3325 pedwarn ("%s of read-only variable `%s'", _(msgid),
3326 IDENTIFIER_POINTER (DECL_NAME (arg)));
3328 pedwarn ("%s of read-only location", _(msgid));
3331 /* Mark EXP saying that we need to be able to take the
3332 address of it; it should not be allocated in a register.
3333 Value is 1 if successful. */
3336 mark_addressable (exp)
3339 register tree x = exp;
3341 switch (TREE_CODE (x))
3344 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3346 error ("cannot take address of bitfield `%s'",
3347 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3351 /* ... fall through ... */
3357 x = TREE_OPERAND (x, 0);
3361 TREE_ADDRESSABLE (x) = 1;
3368 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3369 && DECL_NONLOCAL (x))
3371 if (TREE_PUBLIC (x))
3373 error ("global register variable `%s' used in nested function",
3374 IDENTIFIER_POINTER (DECL_NAME (x)));
3377 pedwarn ("register variable `%s' used in nested function",
3378 IDENTIFIER_POINTER (DECL_NAME (x)));
3380 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3382 if (TREE_PUBLIC (x))
3384 error ("address of global register variable `%s' requested",
3385 IDENTIFIER_POINTER (DECL_NAME (x)));
3389 /* If we are making this addressable due to its having
3390 volatile components, give a different error message. Also
3391 handle the case of an unnamed parameter by not trying
3392 to give the name. */
3394 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3396 error ("cannot put object with volatile field into register");
3400 pedwarn ("address of register variable `%s' requested",
3401 IDENTIFIER_POINTER (DECL_NAME (x)));
3403 put_var_into_stack (x);
3407 TREE_ADDRESSABLE (x) = 1;
3408 #if 0 /* poplevel deals with this now. */
3409 if (DECL_CONTEXT (x) == 0)
3410 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3418 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3421 build_conditional_expr (ifexp, op1, op2)
3422 tree ifexp, op1, op2;
3424 register tree type1;
3425 register tree type2;
3426 register enum tree_code code1;
3427 register enum tree_code code2;
3428 register tree result_type = NULL;
3429 tree orig_op1 = op1, orig_op2 = op2;
3431 ifexp = truthvalue_conversion (default_conversion (ifexp));
3433 #if 0 /* Produces wrong result if within sizeof. */
3434 /* Don't promote the operands separately if they promote
3435 the same way. Return the unpromoted type and let the combined
3436 value get promoted if necessary. */
3438 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3439 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3440 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3441 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3443 if (TREE_CODE (ifexp) == INTEGER_CST)
3444 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3446 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3450 /* Promote both alternatives. */
3452 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3453 op1 = default_conversion (op1);
3454 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3455 op2 = default_conversion (op2);
3457 if (TREE_CODE (ifexp) == ERROR_MARK
3458 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3459 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3460 return error_mark_node;
3462 type1 = TREE_TYPE (op1);
3463 code1 = TREE_CODE (type1);
3464 type2 = TREE_TYPE (op2);
3465 code2 = TREE_CODE (type2);
3467 /* Quickly detect the usual case where op1 and op2 have the same type
3469 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3472 result_type = type1;
3474 result_type = TYPE_MAIN_VARIANT (type1);
3476 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3477 || code1 == COMPLEX_TYPE)
3478 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3479 || code2 == COMPLEX_TYPE))
3481 result_type = common_type (type1, type2);
3483 /* If -Wsign-compare, warn here if type1 and type2 have
3484 different signedness. We'll promote the signed to unsigned
3485 and later code won't know it used to be different.
3486 Do this check on the original types, so that explicit casts
3487 will be considered, but default promotions won't. */
3488 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3489 && !skip_evaluation)
3491 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3492 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3494 if (unsigned_op1 ^ unsigned_op2)
3496 /* Do not warn if the result type is signed, since the
3497 signed type will only be chosen if it can represent
3498 all the values of the unsigned type. */
3499 if (! TREE_UNSIGNED (result_type))
3501 /* Do not warn if the signed quantity is an unsuffixed
3502 integer literal (or some static constant expression
3503 involving such literals) and it is non-negative. */
3504 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3505 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3508 warning ("signed and unsigned type in conditional expression");
3512 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3514 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3515 pedwarn ("ISO C forbids conditional expr with only one void side");
3516 result_type = void_type_node;
3518 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3520 if (comp_target_types (type1, type2))
3521 result_type = common_type (type1, type2);
3522 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3523 && TREE_CODE (orig_op1) != NOP_EXPR)
3524 result_type = qualify_type (type2, type1);
3525 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3526 && TREE_CODE (orig_op2) != NOP_EXPR)
3527 result_type = qualify_type (type1, type2);
3528 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3530 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3531 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3532 result_type = qualify_type (type1, type2);
3534 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3536 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3537 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3538 result_type = qualify_type (type2, type1);
3542 pedwarn ("pointer type mismatch in conditional expression");
3543 result_type = build_pointer_type (void_type_node);
3546 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3548 if (! integer_zerop (op2))
3549 pedwarn ("pointer/integer type mismatch in conditional expression");
3552 op2 = null_pointer_node;
3553 #if 0 /* The spec seems to say this is permitted. */
3554 if (pedantic && TREE_CODE (type1) == FUNCTION_TYPE)
3555 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3558 result_type = type1;
3560 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3562 if (!integer_zerop (op1))
3563 pedwarn ("pointer/integer type mismatch in conditional expression");
3566 op1 = null_pointer_node;
3567 #if 0 /* The spec seems to say this is permitted. */
3568 if (pedantic && TREE_CODE (type2) == FUNCTION_TYPE)
3569 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3572 result_type = type2;
3577 if (flag_cond_mismatch)
3578 result_type = void_type_node;
3581 error ("type mismatch in conditional expression");
3582 return error_mark_node;
3586 /* Merge const and volatile flags of the incoming types. */
3588 = build_type_variant (result_type,
3589 TREE_READONLY (op1) || TREE_READONLY (op2),
3590 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3592 if (result_type != TREE_TYPE (op1))
3593 op1 = convert_and_check (result_type, op1);
3594 if (result_type != TREE_TYPE (op2))
3595 op2 = convert_and_check (result_type, op2);
3597 if (TREE_CODE (ifexp) == INTEGER_CST)
3598 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3600 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3603 /* Given a list of expressions, return a compound expression
3604 that performs them all and returns the value of the last of them. */
3607 build_compound_expr (list)
3610 return internal_build_compound_expr (list, TRUE);
3614 internal_build_compound_expr (list, first_p)
3620 if (TREE_CHAIN (list) == 0)
3622 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3623 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3625 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3626 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3627 list = TREE_OPERAND (list, 0);
3630 /* Don't let (0, 0) be null pointer constant. */
3631 if (!first_p && integer_zerop (TREE_VALUE (list)))
3632 return non_lvalue (TREE_VALUE (list));
3633 return TREE_VALUE (list);
3636 if (TREE_CHAIN (list) != 0 && TREE_CHAIN (TREE_CHAIN (list)) == 0)
3638 /* Convert arrays to pointers when there really is a comma operator. */
3639 if (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (list)))) == ARRAY_TYPE)
3640 TREE_VALUE (TREE_CHAIN (list))
3641 = default_conversion (TREE_VALUE (TREE_CHAIN (list)));
3644 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3646 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3648 /* The left-hand operand of a comma expression is like an expression
3649 statement: with -W or -Wunused, we should warn if it doesn't have
3650 any side-effects, unless it was explicitly cast to (void). */
3651 if ((extra_warnings || warn_unused_value)
3652 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3653 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3654 warning ("left-hand operand of comma expression has no effect");
3656 /* When pedantic, a compound expression can be neither an lvalue
3657 nor an integer constant expression. */
3662 /* With -Wunused, we should also warn if the left-hand operand does have
3663 side-effects, but computes a value which is not used. For example, in
3664 `foo() + bar(), baz()' the result of the `+' operator is not used,
3665 so we should issue a warning. */
3666 else if (warn_unused_value)
3667 warn_if_unused_value (TREE_VALUE (list));
3669 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3672 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3675 build_c_cast (type, expr)
3679 register tree value = expr;
3681 if (type == error_mark_node || expr == error_mark_node)
3682 return error_mark_node;
3683 type = TYPE_MAIN_VARIANT (type);
3686 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3687 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3688 value = TREE_OPERAND (value, 0);
3691 if (TREE_CODE (type) == ARRAY_TYPE)
3693 error ("cast specifies array type");
3694 return error_mark_node;
3697 if (TREE_CODE (type) == FUNCTION_TYPE)
3699 error ("cast specifies function type");
3700 return error_mark_node;
3703 if (type == TREE_TYPE (value))
3707 if (TREE_CODE (type) == RECORD_TYPE
3708 || TREE_CODE (type) == UNION_TYPE)
3709 pedwarn ("ISO C forbids casting nonscalar to the same type");
3712 else if (TREE_CODE (type) == UNION_TYPE)
3715 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
3716 || TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE)
3717 value = default_conversion (value);
3719 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3720 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3721 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3730 pedwarn ("ISO C forbids casts to union type");
3731 if (TYPE_NAME (type) != 0)
3733 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3734 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3736 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3740 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3741 build_tree_list (field, value)),
3743 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3746 error ("cast to union type from type not present in union");
3747 return error_mark_node;
3753 /* If casting to void, avoid the error that would come
3754 from default_conversion in the case of a non-lvalue array. */
3755 if (type == void_type_node)
3756 return build1 (CONVERT_EXPR, type, value);
3758 /* Convert functions and arrays to pointers,
3759 but don't convert any other types. */
3760 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
3761 || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE)
3762 value = default_conversion (value);
3763 otype = TREE_TYPE (value);
3765 /* Optionally warn about potentially worrisome casts. */
3768 && TREE_CODE (type) == POINTER_TYPE
3769 && TREE_CODE (otype) == POINTER_TYPE)
3771 tree in_type = type;
3772 tree in_otype = otype;
3775 /* Check that the qualifiers on IN_TYPE are a superset of
3776 the qualifiers of IN_OTYPE. The outermost level of
3777 POINTER_TYPE nodes is uninteresting and we stop as soon
3778 as we hit a non-POINTER_TYPE node on either type. */
3781 in_otype = TREE_TYPE (in_otype);
3782 in_type = TREE_TYPE (in_type);
3783 warn |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3785 while (TREE_CODE (in_type) == POINTER_TYPE
3786 && TREE_CODE (in_otype) == POINTER_TYPE);
3789 /* There are qualifiers present in IN_OTYPE that are not
3790 present in IN_TYPE. */
3791 warning ("cast discards qualifiers from pointer target type");
3794 /* Warn about possible alignment problems. */
3795 if (STRICT_ALIGNMENT && warn_cast_align
3796 && TREE_CODE (type) == POINTER_TYPE
3797 && TREE_CODE (otype) == POINTER_TYPE
3798 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3799 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3800 /* Don't warn about opaque types, where the actual alignment
3801 restriction is unknown. */
3802 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3803 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3804 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3805 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3806 warning ("cast increases required alignment of target type");
3808 if (TREE_CODE (type) == INTEGER_TYPE
3809 && TREE_CODE (otype) == POINTER_TYPE
3810 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3811 && !TREE_CONSTANT (value))
3812 warning ("cast from pointer to integer of different size");
3814 if (warn_bad_function_cast
3815 && TREE_CODE (value) == CALL_EXPR
3816 && TREE_CODE (type) != TREE_CODE (otype))
3817 warning ("cast does not match function type");
3819 if (TREE_CODE (type) == POINTER_TYPE
3820 && TREE_CODE (otype) == INTEGER_TYPE
3821 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3822 /* Don't warn about converting any constant. */
3823 && !TREE_CONSTANT (value))
3824 warning ("cast to pointer from integer of different size");
3827 value = convert (type, value);
3829 /* Ignore any integer overflow caused by the cast. */
3830 if (TREE_CODE (value) == INTEGER_CST)
3832 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3833 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3837 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3838 if (pedantic && TREE_CODE (value) == INTEGER_CST
3839 && TREE_CODE (expr) == INTEGER_CST
3840 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3841 value = non_lvalue (value);
3843 /* If pedantic, don't let a cast be an lvalue. */
3844 if (value == expr && pedantic)
3845 value = non_lvalue (value);
3850 /* Build an assignment expression of lvalue LHS from value RHS.
3851 MODIFYCODE is the code for a binary operator that we use
3852 to combine the old value of LHS with RHS to get the new value.
3853 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3856 build_modify_expr (lhs, modifycode, rhs)
3858 enum tree_code modifycode;
3860 register tree result;
3862 tree lhstype = TREE_TYPE (lhs);
3863 tree olhstype = lhstype;
3865 /* Types that aren't fully specified cannot be used in assignments. */
3866 lhs = require_complete_type (lhs);
3868 /* Avoid duplicate error messages from operands that had errors. */
3869 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3870 return error_mark_node;
3872 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3873 /* Do not use STRIP_NOPS here. We do not want an enumerator
3874 whose value is 0 to count as a null pointer constant. */
3875 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3876 rhs = TREE_OPERAND (rhs, 0);
3880 /* Handle control structure constructs used as "lvalues". */
3882 switch (TREE_CODE (lhs))
3884 /* Handle (a, b) used as an "lvalue". */
3886 pedantic_lvalue_warning (COMPOUND_EXPR);
3887 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3888 if (TREE_CODE (newrhs) == ERROR_MARK)
3889 return error_mark_node;
3890 return build (COMPOUND_EXPR, lhstype,
3891 TREE_OPERAND (lhs, 0), newrhs);
3893 /* Handle (a ? b : c) used as an "lvalue". */
3895 pedantic_lvalue_warning (COND_EXPR);
3896 rhs = save_expr (rhs);
3898 /* Produce (a ? (b = rhs) : (c = rhs))
3899 except that the RHS goes through a save-expr
3900 so the code to compute it is only emitted once. */
3902 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3903 build_modify_expr (TREE_OPERAND (lhs, 1),
3905 build_modify_expr (TREE_OPERAND (lhs, 2),
3907 if (TREE_CODE (cond) == ERROR_MARK)
3909 /* Make sure the code to compute the rhs comes out
3910 before the split. */
3911 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3912 /* But cast it to void to avoid an "unused" error. */
3913 convert (void_type_node, rhs), cond);
3919 /* If a binary op has been requested, combine the old LHS value with the RHS
3920 producing the value we should actually store into the LHS. */
3922 if (modifycode != NOP_EXPR)
3924 lhs = stabilize_reference (lhs);
3925 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3928 /* Handle a cast used as an "lvalue".
3929 We have already performed any binary operator using the value as cast.
3930 Now convert the result to the cast type of the lhs,
3931 and then true type of the lhs and store it there;
3932 then convert result back to the cast type to be the value
3933 of the assignment. */
3935 switch (TREE_CODE (lhs))
3940 case FIX_TRUNC_EXPR:
3941 case FIX_FLOOR_EXPR:
3942 case FIX_ROUND_EXPR:
3944 if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
3945 || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE)
3946 newrhs = default_conversion (newrhs);
3948 tree inner_lhs = TREE_OPERAND (lhs, 0);
3950 result = build_modify_expr (inner_lhs, NOP_EXPR,
3951 convert (TREE_TYPE (inner_lhs),
3952 convert (lhstype, newrhs)));
3953 if (TREE_CODE (result) == ERROR_MARK)
3955 pedantic_lvalue_warning (CONVERT_EXPR);
3956 return convert (TREE_TYPE (lhs), result);
3963 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3964 Reject anything strange now. */
3966 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3967 return error_mark_node;
3969 /* Warn about storing in something that is `const'. */
3971 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3972 || ((TREE_CODE (lhstype) == RECORD_TYPE
3973 || TREE_CODE (lhstype) == UNION_TYPE)
3974 && C_TYPE_FIELDS_READONLY (lhstype)))
3975 readonly_warning (lhs, "assignment");
3977 /* If storing into a structure or union member,
3978 it has probably been given type `int'.
3979 Compute the type that would go with
3980 the actual amount of storage the member occupies. */
3982 if (TREE_CODE (lhs) == COMPONENT_REF
3983 && (TREE_CODE (lhstype) == INTEGER_TYPE
3984 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3985 || TREE_CODE (lhstype) == REAL_TYPE
3986 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3987 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3989 /* If storing in a field that is in actuality a short or narrower than one,
3990 we must store in the field in its actual type. */
3992 if (lhstype != TREE_TYPE (lhs))
3994 lhs = copy_node (lhs);
3995 TREE_TYPE (lhs) = lhstype;
3998 /* Convert new value to destination type. */
4000 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
4001 NULL_TREE, NULL_TREE, 0);
4002 if (TREE_CODE (newrhs) == ERROR_MARK)
4003 return error_mark_node;
4007 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
4008 TREE_SIDE_EFFECTS (result) = 1;
4010 /* If we got the LHS in a different type for storing in,
4011 convert the result back to the nominal type of LHS
4012 so that the value we return always has the same type
4013 as the LHS argument. */
4015 if (olhstype == TREE_TYPE (result))
4017 return convert_for_assignment (olhstype, result, _("assignment"),
4018 NULL_TREE, NULL_TREE, 0);
4021 /* Convert value RHS to type TYPE as preparation for an assignment
4022 to an lvalue of type TYPE.
4023 The real work of conversion is done by `convert'.
4024 The purpose of this function is to generate error messages
4025 for assignments that are not allowed in C.
4026 ERRTYPE is a string to use in error messages:
4027 "assignment", "return", etc. If it is null, this is parameter passing
4028 for a function call (and different error messages are output).
4030 FUNNAME is the name of the function being called,
4031 as an IDENTIFIER_NODE, or null.
4032 PARMNUM is the number of the argument, for printing in error messages. */
4035 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
4037 const char *errtype;
4038 tree fundecl, funname;
4041 register enum tree_code codel = TREE_CODE (type);
4042 register tree rhstype;
4043 register enum tree_code coder;
4045 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4046 /* Do not use STRIP_NOPS here. We do not want an enumerator
4047 whose value is 0 to count as a null pointer constant. */
4048 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
4049 rhs = TREE_OPERAND (rhs, 0);
4051 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
4052 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4053 rhs = default_conversion (rhs);
4054 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4055 rhs = decl_constant_value_for_broken_optimization (rhs);
4057 rhstype = TREE_TYPE (rhs);
4058 coder = TREE_CODE (rhstype);
4060 if (coder == ERROR_MARK)
4061 return error_mark_node;
4063 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4065 overflow_warning (rhs);
4066 /* Check for Objective-C protocols. This will issue a warning if
4067 there are protocol violations. No need to use the return value. */
4068 maybe_objc_comptypes (type, rhstype, 0);
4072 if (coder == VOID_TYPE)
4074 error ("void value not ignored as it ought to be");
4075 return error_mark_node;
4077 /* A type converts to a reference to it.
4078 This code doesn't fully support references, it's just for the
4079 special case of va_start and va_copy. */
4080 if (codel == REFERENCE_TYPE
4081 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4083 if (mark_addressable (rhs) == 0)
4084 return error_mark_node;
4085 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4087 /* We already know that these two types are compatible, but they
4088 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4089 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4090 likely to be va_list, a typedef to __builtin_va_list, which
4091 is different enough that it will cause problems later. */
4092 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4093 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4095 rhs = build1 (NOP_EXPR, type, rhs);
4098 /* Arithmetic types all interconvert, and enum is treated like int. */
4099 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4100 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4101 || codel == BOOLEAN_TYPE)
4102 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4103 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4104 || coder == BOOLEAN_TYPE))
4105 return convert_and_check (type, rhs);
4107 /* Conversion to a transparent union from its member types.
4108 This applies only to function arguments. */
4109 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4112 tree marginal_memb_type = 0;
4114 for (memb_types = TYPE_FIELDS (type); memb_types;
4115 memb_types = TREE_CHAIN (memb_types))
4117 tree memb_type = TREE_TYPE (memb_types);
4119 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4120 TYPE_MAIN_VARIANT (rhstype)))
4123 if (TREE_CODE (memb_type) != POINTER_TYPE)
4126 if (coder == POINTER_TYPE)
4128 register tree ttl = TREE_TYPE (memb_type);
4129 register tree ttr = TREE_TYPE (rhstype);
4131 /* Any non-function converts to a [const][volatile] void *
4132 and vice versa; otherwise, targets must be the same.
4133 Meanwhile, the lhs target must have all the qualifiers of
4135 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4136 || comp_target_types (memb_type, rhstype))
4138 /* If this type won't generate any warnings, use it. */
4139 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4140 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4141 && TREE_CODE (ttl) == FUNCTION_TYPE)
4142 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4143 == TYPE_QUALS (ttr))
4144 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4145 == TYPE_QUALS (ttl))))
4148 /* Keep looking for a better type, but remember this one. */
4149 if (! marginal_memb_type)
4150 marginal_memb_type = memb_type;
4154 /* Can convert integer zero to any pointer type. */
4155 if (integer_zerop (rhs)
4156 || (TREE_CODE (rhs) == NOP_EXPR
4157 && integer_zerop (TREE_OPERAND (rhs, 0))))
4159 rhs = null_pointer_node;
4164 if (memb_types || marginal_memb_type)
4168 /* We have only a marginally acceptable member type;
4169 it needs a warning. */
4170 register tree ttl = TREE_TYPE (marginal_memb_type);
4171 register tree ttr = TREE_TYPE (rhstype);
4173 /* Const and volatile mean something different for function
4174 types, so the usual warnings are not appropriate. */
4175 if (TREE_CODE (ttr) == FUNCTION_TYPE
4176 && TREE_CODE (ttl) == FUNCTION_TYPE)
4178 /* Because const and volatile on functions are
4179 restrictions that say the function will not do
4180 certain things, it is okay to use a const or volatile
4181 function where an ordinary one is wanted, but not
4183 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4184 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4185 errtype, funname, parmnum);
4187 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4188 warn_for_assignment ("%s discards qualifiers from pointer target type",
4193 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4194 pedwarn ("ISO C prohibits argument conversion to union type");
4196 return build1 (NOP_EXPR, type, rhs);
4200 /* Conversions among pointers */
4201 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4202 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4204 register tree ttl = TREE_TYPE (type);
4205 register tree ttr = TREE_TYPE (rhstype);
4207 /* Any non-function converts to a [const][volatile] void *
4208 and vice versa; otherwise, targets must be the same.
4209 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4210 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4211 || comp_target_types (type, rhstype)
4212 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4213 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4216 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4219 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4220 which are not ANSI null ptr constants. */
4221 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4222 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4223 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4224 errtype, funname, parmnum);
4225 /* Const and volatile mean something different for function types,
4226 so the usual warnings are not appropriate. */
4227 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4228 && TREE_CODE (ttl) != FUNCTION_TYPE)
4230 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4231 warn_for_assignment ("%s discards qualifiers from pointer target type",
4232 errtype, funname, parmnum);
4233 /* If this is not a case of ignoring a mismatch in signedness,
4235 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4236 || comp_target_types (type, rhstype))
4238 /* If there is a mismatch, do warn. */
4240 warn_for_assignment ("pointer targets in %s differ in signedness",
4241 errtype, funname, parmnum);
4243 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4244 && TREE_CODE (ttr) == FUNCTION_TYPE)
4246 /* Because const and volatile on functions are restrictions
4247 that say the function will not do certain things,
4248 it is okay to use a const or volatile function
4249 where an ordinary one is wanted, but not vice-versa. */
4250 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4251 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4252 errtype, funname, parmnum);
4256 warn_for_assignment ("%s from incompatible pointer type",
4257 errtype, funname, parmnum);
4258 return convert (type, rhs);
4260 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4262 /* An explicit constant 0 can convert to a pointer,
4263 or one that results from arithmetic, even including
4264 a cast to integer type. */
4265 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4267 ! (TREE_CODE (rhs) == NOP_EXPR
4268 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4269 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4270 && integer_zerop (TREE_OPERAND (rhs, 0))))
4272 warn_for_assignment ("%s makes pointer from integer without a cast",
4273 errtype, funname, parmnum);
4274 return convert (type, rhs);
4276 return null_pointer_node;
4278 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4280 warn_for_assignment ("%s makes integer from pointer without a cast",
4281 errtype, funname, parmnum);
4282 return convert (type, rhs);
4284 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4285 return convert (type, rhs);
4291 tree selector = maybe_building_objc_message_expr ();
4293 if (selector && parmnum > 2)
4294 error ("incompatible type for argument %d of `%s'",
4295 parmnum - 2, IDENTIFIER_POINTER (selector));
4297 error ("incompatible type for argument %d of `%s'",
4298 parmnum, IDENTIFIER_POINTER (funname));
4301 error ("incompatible type for argument %d of indirect function call",
4305 error ("incompatible types in %s", errtype);
4307 return error_mark_node;
4310 /* Print a warning using MSGID.
4311 It gets OPNAME as its one parameter.
4312 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4313 FUNCTION and ARGNUM are handled specially if we are building an
4314 Objective-C selector. */
4317 warn_for_assignment (msgid, opname, function, argnum)
4325 tree selector = maybe_building_objc_message_expr ();
4328 if (selector && argnum > 2)
4330 function = selector;
4335 /* Function name is known; supply it. */
4336 const char *argstring = _("passing arg %d of `%s'");
4337 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4338 + strlen (argstring) + 1 + 25
4340 sprintf (new_opname, argstring, argnum,
4341 IDENTIFIER_POINTER (function));
4345 /* Function name unknown (call through ptr); just give arg number.*/
4346 const char *argnofun = _("passing arg %d of pointer to function");
4347 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4348 sprintf (new_opname, argnofun, argnum);
4350 opname = new_opname;
4352 pedwarn (msgid, opname);
4355 /* If VALUE is a compound expr all of whose expressions are constant, then
4356 return its value. Otherwise, return error_mark_node.
4358 This is for handling COMPOUND_EXPRs as initializer elements
4359 which is allowed with a warning when -pedantic is specified. */
4362 valid_compound_expr_initializer (value, endtype)
4366 if (TREE_CODE (value) == COMPOUND_EXPR)
4368 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4370 return error_mark_node;
4371 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4374 else if (! TREE_CONSTANT (value)
4375 && ! initializer_constant_valid_p (value, endtype))
4376 return error_mark_node;
4381 /* Perform appropriate conversions on the initial value of a variable,
4382 store it in the declaration DECL,
4383 and print any error messages that are appropriate.
4384 If the init is invalid, store an ERROR_MARK. */
4387 store_init_value (decl, init)
4390 register tree value, type;
4392 /* If variable's type was invalidly declared, just ignore it. */
4394 type = TREE_TYPE (decl);
4395 if (TREE_CODE (type) == ERROR_MARK)
4398 /* Digest the specified initializer into an expression. */
4400 value = digest_init (type, init, TREE_STATIC (decl),
4401 TREE_STATIC (decl) || pedantic);
4403 /* Store the expression if valid; else report error. */
4406 /* Note that this is the only place we can detect the error
4407 in a case such as struct foo bar = (struct foo) { x, y };
4408 where there is one initial value which is a constructor expression. */
4409 if (value == error_mark_node)
4411 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4413 error ("initializer for static variable is not constant");
4414 value = error_mark_node;
4416 else if (TREE_STATIC (decl)
4417 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4419 error ("initializer for static variable uses complicated arithmetic");
4420 value = error_mark_node;
4424 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4426 if (! TREE_CONSTANT (value))
4427 pedwarn ("aggregate initializer is not constant");
4428 else if (! TREE_STATIC (value))
4429 pedwarn ("aggregate initializer uses complicated arithmetic");
4434 if (warn_traditional && !in_system_header
4435 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4436 warning ("traditional C rejects automatic aggregate initialization");
4438 DECL_INITIAL (decl) = value;
4440 /* ANSI wants warnings about out-of-range constant initializers. */
4441 STRIP_TYPE_NOPS (value);
4442 constant_expression_warning (value);
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)
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. */
4543 register int size = 0;
4544 register struct spelling *p;
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)
4561 register char *buffer;
4563 register char *d = buffer;
4564 register struct spelling *p;
4566 for (p = spelling_base; p < spelling; p++)
4567 if (p->kind == SPELLING_BOUNDS)
4569 sprintf (d, "[%d]", p->u.i);
4574 register const char *s;
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 /* Initialization of an array of chars from a string constant
4659 optionally enclosed in braces. */
4661 if (code == ARRAY_TYPE)
4663 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4664 if ((typ1 == char_type_node
4665 || typ1 == signed_char_type_node
4666 || typ1 == unsigned_char_type_node
4667 || typ1 == unsigned_wchar_type_node
4668 || typ1 == signed_wchar_type_node)
4669 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4671 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4672 TYPE_MAIN_VARIANT (type)))
4675 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4677 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4679 error_init ("char-array initialized from wide string");
4680 return error_mark_node;
4682 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4684 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4686 error_init ("int-array initialized from non-wide string");
4687 return error_mark_node;
4690 TREE_TYPE (inside_init) = type;
4691 if (TYPE_DOMAIN (type) != 0
4692 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4693 /* Subtract 1 (or sizeof (wchar_t))
4694 because it's ok to ignore the terminating null char
4695 that is counted in the length of the constant. */
4696 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4697 TREE_STRING_LENGTH (inside_init)
4698 - ((TYPE_PRECISION (typ1)
4699 != TYPE_PRECISION (char_type_node))
4700 ? (TYPE_PRECISION (wchar_type_node)
4703 pedwarn_init ("initializer-string for array of chars is too long");
4709 /* Any type can be initialized
4710 from an expression of the same type, optionally with braces. */
4712 if (inside_init && TREE_TYPE (inside_init) != 0
4713 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4714 TYPE_MAIN_VARIANT (type))
4715 || (code == ARRAY_TYPE
4716 && comptypes (TREE_TYPE (inside_init), type))
4717 || (code == POINTER_TYPE
4718 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4719 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4720 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4721 TREE_TYPE (type)))))
4723 if (code == POINTER_TYPE
4724 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4725 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE))
4726 inside_init = default_conversion (inside_init);
4727 else if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4728 && TREE_CODE (inside_init) != CONSTRUCTOR)
4730 error_init ("array initialized from non-constant array expression");
4731 return error_mark_node;
4734 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4735 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4737 /* Compound expressions can only occur here if -pedantic or
4738 -pedantic-errors is specified. In the later case, we always want
4739 an error. In the former case, we simply want a warning. */
4740 if (require_constant && pedantic
4741 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4744 = valid_compound_expr_initializer (inside_init,
4745 TREE_TYPE (inside_init));
4746 if (inside_init == error_mark_node)
4747 error_init ("initializer element is not constant");
4749 pedwarn_init ("initializer element is not constant");
4750 if (flag_pedantic_errors)
4751 inside_init = error_mark_node;
4753 else if (require_constant && ! TREE_CONSTANT (inside_init))
4755 error_init ("initializer element is not constant");
4756 inside_init = error_mark_node;
4758 else if (require_constant
4759 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4761 error_init ("initializer element is not computable at load time");
4762 inside_init = error_mark_node;
4768 /* Handle scalar types, including conversions. */
4770 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4771 || code == ENUMERAL_TYPE || code == COMPLEX_TYPE)
4773 /* Note that convert_for_assignment calls default_conversion
4774 for arrays and functions. We must not call it in the
4775 case where inside_init is a null pointer constant. */
4777 = convert_for_assignment (type, init, _("initialization"),
4778 NULL_TREE, NULL_TREE, 0);
4780 if (require_constant && ! TREE_CONSTANT (inside_init))
4782 error_init ("initializer element is not constant");
4783 inside_init = error_mark_node;
4785 else if (require_constant
4786 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4788 error_init ("initializer element is not computable at load time");
4789 inside_init = error_mark_node;
4795 /* Come here only for records and arrays. */
4797 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4799 error_init ("variable-sized object may not be initialized");
4800 return error_mark_node;
4803 /* Traditionally, you can write struct foo x = 0;
4804 and it initializes the first element of x to 0. */
4805 if (flag_traditional)
4807 tree top = 0, prev = 0, otype = type;
4808 while (TREE_CODE (type) == RECORD_TYPE
4809 || TREE_CODE (type) == ARRAY_TYPE
4810 || TREE_CODE (type) == QUAL_UNION_TYPE
4811 || TREE_CODE (type) == UNION_TYPE)
4813 tree temp = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
4817 TREE_OPERAND (prev, 1) = build_tree_list (NULL_TREE, temp);
4819 if (TREE_CODE (type) == ARRAY_TYPE)
4820 type = TREE_TYPE (type);
4821 else if (TYPE_FIELDS (type))
4822 type = TREE_TYPE (TYPE_FIELDS (type));
4825 error_init ("invalid initializer");
4826 return error_mark_node;
4832 TREE_OPERAND (prev, 1)
4833 = build_tree_list (NULL_TREE,
4834 digest_init (type, init, require_constant,
4835 constructor_constant));
4839 return error_mark_node;
4841 error_init ("invalid initializer");
4842 return error_mark_node;
4845 /* Handle initializers that use braces. */
4847 /* Type of object we are accumulating a constructor for.
4848 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4849 static tree constructor_type;
4851 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4853 static tree constructor_fields;
4855 /* For an ARRAY_TYPE, this is the specified index
4856 at which to store the next element we get. */
4857 static tree constructor_index;
4859 /* For an ARRAY_TYPE, this is the end index of the range
4860 to initialize with the next element, or NULL in the ordinary case
4861 where the element is used just once. */
4862 static tree constructor_range_end;
4864 /* For an ARRAY_TYPE, this is the maximum index. */
4865 static tree constructor_max_index;
4867 /* For a RECORD_TYPE, this is the first field not yet written out. */
4868 static tree constructor_unfilled_fields;
4870 /* For an ARRAY_TYPE, this is the index of the first element
4871 not yet written out. */
4872 static tree constructor_unfilled_index;
4874 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4875 This is so we can generate gaps between fields, when appropriate. */
4876 static tree constructor_bit_index;
4878 /* If we are saving up the elements rather than allocating them,
4879 this is the list of elements so far (in reverse order,
4880 most recent first). */
4881 static tree constructor_elements;
4883 /* 1 if so far this constructor's elements are all compile-time constants. */
4884 static int constructor_constant;
4886 /* 1 if so far this constructor's elements are all valid address constants. */
4887 static int constructor_simple;
4889 /* 1 if this constructor is erroneous so far. */
4890 static int constructor_erroneous;
4892 /* 1 if have called defer_addressed_constants. */
4893 static int constructor_subconstants_deferred;
4895 /* Structure for managing pending initializer elements, organized as an
4900 struct init_node *left, *right;
4901 struct init_node *parent;
4907 /* Tree of pending elements at this constructor level.
4908 These are elements encountered out of order
4909 which belong at places we haven't reached yet in actually
4911 Will never hold tree nodes across GC runs. */
4912 static struct init_node *constructor_pending_elts;
4914 /* The SPELLING_DEPTH of this constructor. */
4915 static int constructor_depth;
4917 /* 0 if implicitly pushing constructor levels is allowed. */
4918 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4920 static int require_constant_value;
4921 static int require_constant_elements;
4923 /* DECL node for which an initializer is being read.
4924 0 means we are reading a constructor expression
4925 such as (struct foo) {...}. */
4926 static tree constructor_decl;
4928 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4929 static char *constructor_asmspec;
4931 /* Nonzero if this is an initializer for a top-level decl. */
4932 static int constructor_top_level;
4935 /* This stack has a level for each implicit or explicit level of
4936 structuring in the initializer, including the outermost one. It
4937 saves the values of most of the variables above. */
4939 struct constructor_stack
4941 struct constructor_stack *next;
4947 tree unfilled_index;
4948 tree unfilled_fields;
4952 struct init_node *pending_elts;
4954 /* If nonzero, this value should replace the entire
4955 constructor at this level. */
4956 tree replacement_value;
4964 struct constructor_stack *constructor_stack;
4966 /* This stack records separate initializers that are nested.
4967 Nested initializers can't happen in ANSI C, but GNU C allows them
4968 in cases like { ... (struct foo) { ... } ... }. */
4970 struct initializer_stack
4972 struct initializer_stack *next;
4975 struct constructor_stack *constructor_stack;
4977 struct spelling *spelling;
4978 struct spelling *spelling_base;
4981 char require_constant_value;
4982 char require_constant_elements;
4986 struct initializer_stack *initializer_stack;
4988 /* Prepare to parse and output the initializer for variable DECL. */
4991 start_init (decl, asmspec_tree, top_level)
4997 struct initializer_stack *p
4998 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
5002 asmspec = TREE_STRING_POINTER (asmspec_tree);
5004 p->decl = constructor_decl;
5005 p->asmspec = constructor_asmspec;
5006 p->require_constant_value = require_constant_value;
5007 p->require_constant_elements = require_constant_elements;
5008 p->constructor_stack = constructor_stack;
5009 p->elements = constructor_elements;
5010 p->spelling = spelling;
5011 p->spelling_base = spelling_base;
5012 p->spelling_size = spelling_size;
5013 p->deferred = constructor_subconstants_deferred;
5014 p->top_level = constructor_top_level;
5015 p->next = initializer_stack;
5016 initializer_stack = p;
5018 constructor_decl = decl;
5019 constructor_asmspec = asmspec;
5020 constructor_subconstants_deferred = 0;
5021 constructor_top_level = top_level;
5025 require_constant_value = TREE_STATIC (decl);
5026 require_constant_elements
5027 = ((TREE_STATIC (decl) || pedantic)
5028 /* For a scalar, you can always use any value to initialize,
5029 even within braces. */
5030 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5031 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5032 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5033 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5034 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5038 require_constant_value = 0;
5039 require_constant_elements = 0;
5040 locus = "(anonymous)";
5043 constructor_stack = 0;
5045 missing_braces_mentioned = 0;
5049 RESTORE_SPELLING_DEPTH (0);
5052 push_string (locus);
5058 struct initializer_stack *p = initializer_stack;
5060 /* Output subconstants (string constants, usually)
5061 that were referenced within this initializer and saved up.
5062 Must do this if and only if we called defer_addressed_constants. */
5063 if (constructor_subconstants_deferred)
5064 output_deferred_addressed_constants ();
5066 /* Free the whole constructor stack of this initializer. */
5067 while (constructor_stack)
5069 struct constructor_stack *q = constructor_stack;
5070 constructor_stack = q->next;
5074 /* Pop back to the data of the outer initializer (if any). */
5075 constructor_decl = p->decl;
5076 constructor_asmspec = p->asmspec;
5077 require_constant_value = p->require_constant_value;
5078 require_constant_elements = p->require_constant_elements;
5079 constructor_stack = p->constructor_stack;
5080 constructor_elements = p->elements;
5081 spelling = p->spelling;
5082 spelling_base = p->spelling_base;
5083 spelling_size = p->spelling_size;
5084 constructor_subconstants_deferred = p->deferred;
5085 constructor_top_level = p->top_level;
5086 initializer_stack = p->next;
5090 /* Call here when we see the initializer is surrounded by braces.
5091 This is instead of a call to push_init_level;
5092 it is matched by a call to pop_init_level.
5094 TYPE is the type to initialize, for a constructor expression.
5095 For an initializer for a decl, TYPE is zero. */
5098 really_start_incremental_init (type)
5101 struct constructor_stack *p
5102 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5105 type = TREE_TYPE (constructor_decl);
5107 p->type = constructor_type;
5108 p->fields = constructor_fields;
5109 p->index = constructor_index;
5110 p->range_end = constructor_range_end;
5111 p->max_index = constructor_max_index;
5112 p->unfilled_index = constructor_unfilled_index;
5113 p->unfilled_fields = constructor_unfilled_fields;
5114 p->bit_index = constructor_bit_index;
5115 p->elements = constructor_elements;
5116 p->constant = constructor_constant;
5117 p->simple = constructor_simple;
5118 p->erroneous = constructor_erroneous;
5119 p->pending_elts = constructor_pending_elts;
5120 p->depth = constructor_depth;
5121 p->replacement_value = 0;
5125 constructor_stack = p;
5127 constructor_constant = 1;
5128 constructor_simple = 1;
5129 constructor_depth = SPELLING_DEPTH ();
5130 constructor_elements = 0;
5131 constructor_pending_elts = 0;
5132 constructor_type = type;
5134 if (TREE_CODE (constructor_type) == RECORD_TYPE
5135 || TREE_CODE (constructor_type) == UNION_TYPE)
5137 constructor_fields = TYPE_FIELDS (constructor_type);
5138 /* Skip any nameless bit fields at the beginning. */
5139 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5140 && DECL_NAME (constructor_fields) == 0)
5141 constructor_fields = TREE_CHAIN (constructor_fields);
5143 constructor_unfilled_fields = constructor_fields;
5144 constructor_bit_index = bitsize_zero_node;
5146 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5148 constructor_range_end = 0;
5149 if (TYPE_DOMAIN (constructor_type))
5151 constructor_max_index
5152 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5154 = convert (bitsizetype,
5155 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5158 constructor_index = bitsize_zero_node;
5160 constructor_unfilled_index = constructor_index;
5164 /* Handle the case of int x = {5}; */
5165 constructor_fields = constructor_type;
5166 constructor_unfilled_fields = constructor_type;
5170 /* Push down into a subobject, for initialization.
5171 If this is for an explicit set of braces, IMPLICIT is 0.
5172 If it is because the next element belongs at a lower level,
5176 push_init_level (implicit)
5179 struct constructor_stack *p;
5181 /* If we've exhausted any levels that didn't have braces,
5183 while (constructor_stack->implicit)
5185 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5186 || TREE_CODE (constructor_type) == UNION_TYPE)
5187 && constructor_fields == 0)
5188 process_init_element (pop_init_level (1));
5189 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5190 && tree_int_cst_lt (constructor_max_index, constructor_index))
5191 process_init_element (pop_init_level (1));
5196 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5197 p->type = constructor_type;
5198 p->fields = constructor_fields;
5199 p->index = constructor_index;
5200 p->range_end = constructor_range_end;
5201 p->max_index = constructor_max_index;
5202 p->unfilled_index = constructor_unfilled_index;
5203 p->unfilled_fields = constructor_unfilled_fields;
5204 p->bit_index = constructor_bit_index;
5205 p->elements = constructor_elements;
5206 p->constant = constructor_constant;
5207 p->simple = constructor_simple;
5208 p->erroneous = constructor_erroneous;
5209 p->pending_elts = constructor_pending_elts;
5210 p->depth = constructor_depth;
5211 p->replacement_value = 0;
5212 p->implicit = implicit;
5214 p->next = constructor_stack;
5215 constructor_stack = p;
5217 constructor_constant = 1;
5218 constructor_simple = 1;
5219 constructor_depth = SPELLING_DEPTH ();
5220 constructor_elements = 0;
5221 constructor_pending_elts = 0;
5223 /* Don't die if an entire brace-pair level is superfluous
5224 in the containing level. */
5225 if (constructor_type == 0)
5227 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5228 || TREE_CODE (constructor_type) == UNION_TYPE)
5230 /* Don't die if there are extra init elts at the end. */
5231 if (constructor_fields == 0)
5232 constructor_type = 0;
5235 constructor_type = TREE_TYPE (constructor_fields);
5236 push_member_name (constructor_fields);
5237 constructor_depth++;
5240 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5242 constructor_type = TREE_TYPE (constructor_type);
5243 push_array_bounds (tree_low_cst (constructor_index, 0));
5244 constructor_depth++;
5247 if (constructor_type == 0)
5249 error_init ("extra brace group at end of initializer");
5250 constructor_fields = 0;
5251 constructor_unfilled_fields = 0;
5255 if (implicit && warn_missing_braces && !missing_braces_mentioned)
5257 missing_braces_mentioned = 1;
5258 warning_init ("missing braces around initializer");
5261 if (TREE_CODE (constructor_type) == RECORD_TYPE
5262 || TREE_CODE (constructor_type) == UNION_TYPE)
5264 constructor_fields = TYPE_FIELDS (constructor_type);
5265 /* Skip any nameless bit fields at the beginning. */
5266 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5267 && DECL_NAME (constructor_fields) == 0)
5268 constructor_fields = TREE_CHAIN (constructor_fields);
5270 constructor_unfilled_fields = constructor_fields;
5271 constructor_bit_index = bitsize_zero_node;
5273 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5275 constructor_range_end = 0;
5276 if (TYPE_DOMAIN (constructor_type))
5278 constructor_max_index
5279 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5281 = convert (bitsizetype,
5283 (TYPE_DOMAIN (constructor_type)));
5286 constructor_index = bitsize_zero_node;
5288 constructor_unfilled_index = constructor_index;
5292 warning_init ("braces around scalar initializer");
5293 constructor_fields = constructor_type;
5294 constructor_unfilled_fields = constructor_type;
5298 /* At the end of an implicit or explicit brace level,
5299 finish up that level of constructor.
5300 If we were outputting the elements as they are read, return 0
5301 from inner levels (process_init_element ignores that),
5302 but return error_mark_node from the outermost level
5303 (that's what we want to put in DECL_INITIAL).
5304 Otherwise, return a CONSTRUCTOR expression. */
5307 pop_init_level (implicit)
5310 struct constructor_stack *p;
5311 HOST_WIDE_INT size = 0;
5312 tree constructor = 0;
5316 /* When we come to an explicit close brace,
5317 pop any inner levels that didn't have explicit braces. */
5318 while (constructor_stack->implicit)
5319 process_init_element (pop_init_level (1));
5322 p = constructor_stack;
5324 if (constructor_type != 0)
5325 size = int_size_in_bytes (constructor_type);
5327 /* Warn when some struct elements are implicitly initialized to zero. */
5330 && TREE_CODE (constructor_type) == RECORD_TYPE
5331 && constructor_unfilled_fields)
5333 push_member_name (constructor_unfilled_fields);
5334 warning_init ("missing initializer");
5335 RESTORE_SPELLING_DEPTH (constructor_depth);
5338 /* Now output all pending elements. */
5339 output_pending_init_elements (1);
5341 #if 0 /* c-parse.in warns about {}. */
5342 /* In ANSI, each brace level must have at least one element. */
5343 if (! implicit && pedantic
5344 && (TREE_CODE (constructor_type) == ARRAY_TYPE
5345 ? integer_zerop (constructor_unfilled_index)
5346 : constructor_unfilled_fields == TYPE_FIELDS (constructor_type)))
5347 pedwarn_init ("empty braces in initializer");
5350 /* Pad out the end of the structure. */
5352 if (p->replacement_value)
5353 /* If this closes a superfluous brace pair,
5354 just pass out the element between them. */
5355 constructor = p->replacement_value;
5356 else if (constructor_type == 0)
5358 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5359 && TREE_CODE (constructor_type) != UNION_TYPE
5360 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5362 /* A nonincremental scalar initializer--just return
5363 the element, after verifying there is just one. */
5364 if (constructor_elements == 0)
5366 error_init ("empty scalar initializer");
5367 constructor = error_mark_node;
5369 else if (TREE_CHAIN (constructor_elements) != 0)
5371 error_init ("extra elements in scalar initializer");
5372 constructor = TREE_VALUE (constructor_elements);
5375 constructor = TREE_VALUE (constructor_elements);
5379 if (constructor_erroneous)
5380 constructor = error_mark_node;
5383 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5384 nreverse (constructor_elements));
5385 if (constructor_constant)
5386 TREE_CONSTANT (constructor) = 1;
5387 if (constructor_constant && constructor_simple)
5388 TREE_STATIC (constructor) = 1;
5392 constructor_type = p->type;
5393 constructor_fields = p->fields;
5394 constructor_index = p->index;
5395 constructor_range_end = p->range_end;
5396 constructor_max_index = p->max_index;
5397 constructor_unfilled_index = p->unfilled_index;
5398 constructor_unfilled_fields = p->unfilled_fields;
5399 constructor_bit_index = p->bit_index;
5400 constructor_elements = p->elements;
5401 constructor_constant = p->constant;
5402 constructor_simple = p->simple;
5403 constructor_erroneous = p->erroneous;
5404 constructor_pending_elts = p->pending_elts;
5405 constructor_depth = p->depth;
5406 RESTORE_SPELLING_DEPTH (constructor_depth);
5408 constructor_stack = p->next;
5411 if (constructor == 0)
5413 if (constructor_stack == 0)
5414 return error_mark_node;
5420 /* Within an array initializer, specify the next index to be initialized.
5421 FIRST is that index. If LAST is nonzero, then initialize a range
5422 of indices, running from FIRST through LAST. */
5425 set_init_index (first, last)
5428 while ((TREE_CODE (first) == NOP_EXPR
5429 || TREE_CODE (first) == CONVERT_EXPR
5430 || TREE_CODE (first) == NON_LVALUE_EXPR)
5431 && (TYPE_MODE (TREE_TYPE (first))
5432 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5433 first = TREE_OPERAND (first, 0);
5436 while ((TREE_CODE (last) == NOP_EXPR
5437 || TREE_CODE (last) == CONVERT_EXPR
5438 || TREE_CODE (last) == NON_LVALUE_EXPR)
5439 && (TYPE_MODE (TREE_TYPE (last))
5440 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5441 last = TREE_OPERAND (last, 0);
5443 if (TREE_CODE (first) != INTEGER_CST)
5444 error_init ("nonconstant array index in initializer");
5445 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5446 error_init ("nonconstant array index in initializer");
5447 else if (! constructor_unfilled_index)
5448 error_init ("array index in non-array initializer");
5449 else if (tree_int_cst_lt (first, constructor_unfilled_index))
5450 error_init ("duplicate array index in initializer");
5453 constructor_index = convert (bitsizetype, first);
5455 if (last != 0 && tree_int_cst_lt (last, first))
5456 error_init ("empty index range in initializer");
5458 constructor_range_end = last ? convert (bitsizetype, last) : 0;
5462 /* Within a struct initializer, specify the next field to be initialized. */
5465 set_init_label (fieldname)
5471 /* Don't die if an entire brace-pair level is superfluous
5472 in the containing level. */
5473 if (constructor_type == 0)
5476 for (tail = TYPE_FIELDS (constructor_type); tail;
5477 tail = TREE_CHAIN (tail))
5479 if (tail == constructor_unfilled_fields)
5481 if (DECL_NAME (tail) == fieldname)
5486 error ("unknown field `%s' specified in initializer",
5487 IDENTIFIER_POINTER (fieldname));
5489 error ("field `%s' already initialized",
5490 IDENTIFIER_POINTER (fieldname));
5492 constructor_fields = tail;
5495 /* Add a new initializer to the tree of pending initializers. PURPOSE
5496 indentifies the initializer, either array index or field in a structure.
5497 VALUE is the value of that index or field. */
5500 add_pending_init (purpose, value)
5501 tree purpose, value;
5503 struct init_node *p, **q, *r;
5505 q = &constructor_pending_elts;
5508 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5513 if (tree_int_cst_lt (purpose, p->purpose))
5515 else if (p->purpose != purpose)
5526 if (tree_int_cst_lt (bit_position (purpose),
5527 bit_position (p->purpose)))
5529 else if (p->purpose != purpose)
5536 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5537 r->purpose = purpose;
5548 struct init_node *s;
5552 if (p->balance == 0)
5554 else if (p->balance < 0)
5561 p->left->parent = p;
5578 constructor_pending_elts = r;
5583 struct init_node *t = r->right;
5587 r->right->parent = r;
5592 p->left->parent = p;
5595 p->balance = t->balance < 0;
5596 r->balance = -(t->balance > 0);
5611 constructor_pending_elts = t;
5617 /* p->balance == +1; growth of left side balances the node. */
5622 else /* r == p->right */
5624 if (p->balance == 0)
5625 /* Growth propagation from right side. */
5627 else if (p->balance > 0)
5634 p->right->parent = p;
5651 constructor_pending_elts = r;
5653 else /* r->balance == -1 */
5656 struct init_node *t = r->left;
5660 r->left->parent = r;
5665 p->right->parent = p;
5668 r->balance = (t->balance < 0);
5669 p->balance = -(t->balance > 0);
5684 constructor_pending_elts = t;
5690 /* p->balance == -1; growth of right side balances the node. */
5701 /* Return nonzero if FIELD is equal to the index of a pending initializer. */
5704 pending_init_member (field)
5707 struct init_node *p;
5709 p = constructor_pending_elts;
5710 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5714 if (field == p->purpose)
5716 else if (tree_int_cst_lt (field, p->purpose))
5726 if (field == p->purpose)
5728 else if (tree_int_cst_lt (bit_position (field),
5729 bit_position (p->purpose)))
5739 /* "Output" the next constructor element.
5740 At top level, really output it to assembler code now.
5741 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5742 TYPE is the data type that the containing data type wants here.
5743 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5745 PENDING if non-nil means output pending elements that belong
5746 right after this element. (PENDING is normally 1;
5747 it is 0 while outputting pending elements, to avoid recursion.) */
5750 output_init_element (value, type, field, pending)
5751 tree value, type, field;
5756 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
5757 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5758 && !(TREE_CODE (value) == STRING_CST
5759 && TREE_CODE (type) == ARRAY_TYPE
5760 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
5761 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
5762 TYPE_MAIN_VARIANT (type))))
5763 value = default_conversion (value);
5765 if (value == error_mark_node)
5766 constructor_erroneous = 1;
5767 else if (!TREE_CONSTANT (value))
5768 constructor_constant = 0;
5769 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
5770 || ((TREE_CODE (constructor_type) == RECORD_TYPE
5771 || TREE_CODE (constructor_type) == UNION_TYPE)
5772 && DECL_C_BIT_FIELD (field)
5773 && TREE_CODE (value) != INTEGER_CST))
5774 constructor_simple = 0;
5776 if (require_constant_value && ! TREE_CONSTANT (value))
5778 error_init ("initializer element is not constant");
5779 value = error_mark_node;
5781 else if (require_constant_elements
5782 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
5784 error_init ("initializer element is not computable at load time");
5785 value = error_mark_node;
5788 /* If this element duplicates one on constructor_pending_elts,
5789 print a message and ignore it. Don't do this when we're
5790 processing elements taken off constructor_pending_elts,
5791 because we'd always get spurious errors. */
5794 if (TREE_CODE (constructor_type) == RECORD_TYPE
5795 || TREE_CODE (constructor_type) == UNION_TYPE
5796 || TREE_CODE (constructor_type) == ARRAY_TYPE)
5798 if (pending_init_member (field))
5800 error_init ("duplicate initializer");
5806 /* If this element doesn't come next in sequence,
5807 put it on constructor_pending_elts. */
5808 if (TREE_CODE (constructor_type) == ARRAY_TYPE
5809 && ! tree_int_cst_equal (field, constructor_unfilled_index))
5812 add_pending_init (field,
5813 digest_init (type, value, require_constant_value,
5814 require_constant_elements));
5816 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5817 && field != constructor_unfilled_fields)
5819 /* We do this for records but not for unions. In a union,
5820 no matter which field is specified, it can be initialized
5821 right away since it starts at the beginning of the union. */
5823 add_pending_init (field,
5824 digest_init (type, value, require_constant_value,
5825 require_constant_elements));
5829 /* Otherwise, output this element either to
5830 constructor_elements or to the assembler file. */
5834 if (field && TREE_CODE (field) == INTEGER_CST)
5835 field = copy_node (field);
5836 constructor_elements
5837 = tree_cons (field, digest_init (type, value,
5838 require_constant_value,
5839 require_constant_elements),
5840 constructor_elements);
5843 /* Advance the variable that indicates sequential elements output. */
5844 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5845 constructor_unfilled_index
5846 = size_binop (PLUS_EXPR, constructor_unfilled_index,
5848 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5850 constructor_unfilled_fields
5851 = TREE_CHAIN (constructor_unfilled_fields);
5853 /* Skip any nameless bit fields. */
5854 while (constructor_unfilled_fields != 0
5855 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5856 && DECL_NAME (constructor_unfilled_fields) == 0)
5857 constructor_unfilled_fields =
5858 TREE_CHAIN (constructor_unfilled_fields);
5860 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5861 constructor_unfilled_fields = 0;
5863 /* Now output any pending elements which have become next. */
5865 output_pending_init_elements (0);
5869 /* Output any pending elements which have become next.
5870 As we output elements, constructor_unfilled_{fields,index}
5871 advances, which may cause other elements to become next;
5872 if so, they too are output.
5874 If ALL is 0, we return when there are
5875 no more pending elements to output now.
5877 If ALL is 1, we output space as necessary so that
5878 we can output all the pending elements. */
5881 output_pending_init_elements (all)
5884 struct init_node *elt = constructor_pending_elts;
5889 /* Look thru the whole pending tree.
5890 If we find an element that should be output now,
5891 output it. Otherwise, set NEXT to the element
5892 that comes first among those still pending. */
5897 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5899 if (tree_int_cst_equal (elt->purpose,
5900 constructor_unfilled_index))
5901 output_init_element (elt->value,
5902 TREE_TYPE (constructor_type),
5903 constructor_unfilled_index, 0);
5904 else if (tree_int_cst_lt (constructor_unfilled_index,
5907 /* Advance to the next smaller node. */
5912 /* We have reached the smallest node bigger than the
5913 current unfilled index. Fill the space first. */
5914 next = elt->purpose;
5920 /* Advance to the next bigger node. */
5925 /* We have reached the biggest node in a subtree. Find
5926 the parent of it, which is the next bigger node. */
5927 while (elt->parent && elt->parent->right == elt)
5930 if (elt && tree_int_cst_lt (constructor_unfilled_index,
5933 next = elt->purpose;
5939 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5940 || TREE_CODE (constructor_type) == UNION_TYPE)
5942 /* If the current record is complete we are done. */
5943 if (constructor_unfilled_fields == 0)
5945 if (elt->purpose == constructor_unfilled_fields)
5947 output_init_element (elt->value,
5948 TREE_TYPE (constructor_unfilled_fields),
5949 constructor_unfilled_fields,
5952 else if (tree_int_cst_lt (bit_position (constructor_unfilled_fields),
5953 bit_position (elt->purpose)))
5955 /* Advance to the next smaller node. */
5960 /* We have reached the smallest node bigger than the
5961 current unfilled field. Fill the space first. */
5962 next = elt->purpose;
5968 /* Advance to the next bigger node. */
5973 /* We have reached the biggest node in a subtree. Find
5974 the parent of it, which is the next bigger node. */
5975 while (elt->parent && elt->parent->right == elt)
5980 (bit_position (constructor_unfilled_fields),
5981 bit_position (elt->purpose))))
5983 next = elt->purpose;
5991 /* Ordinarily return, but not if we want to output all
5992 and there are elements left. */
5993 if (! (all && next != 0))
5996 /* If it's not incremental, just skip over the gap, so that after
5997 jumping to retry we will output the next successive element. */
5998 if (TREE_CODE (constructor_type) == RECORD_TYPE
5999 || TREE_CODE (constructor_type) == UNION_TYPE)
6000 constructor_unfilled_fields = next;
6001 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6002 constructor_unfilled_index = next;
6004 /* ELT now points to the node in the pending tree with the next
6005 initializer to output. */
6009 /* Add one non-braced element to the current constructor level.
6010 This adjusts the current position within the constructor's type.
6011 This may also start or terminate implicit levels
6012 to handle a partly-braced initializer.
6014 Once this has found the correct level for the new element,
6015 it calls output_init_element. */
6018 process_init_element (value)
6021 tree orig_value = value;
6022 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6024 /* Handle superfluous braces around string cst as in
6025 char x[] = {"foo"}; */
6028 && TREE_CODE (constructor_type) == ARRAY_TYPE
6029 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6030 && integer_zerop (constructor_unfilled_index))
6032 if (constructor_stack->replacement_value)
6033 error_init ("excess elements in char array initializer");
6034 constructor_stack->replacement_value = value;
6038 if (constructor_stack->replacement_value != 0)
6040 error_init ("excess elements in struct initializer");
6044 /* Ignore elements of a brace group if it is entirely superfluous
6045 and has already been diagnosed. */
6046 if (constructor_type == 0)
6049 /* If we've exhausted any levels that didn't have braces,
6051 while (constructor_stack->implicit)
6053 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6054 || TREE_CODE (constructor_type) == UNION_TYPE)
6055 && constructor_fields == 0)
6056 process_init_element (pop_init_level (1));
6057 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6058 && (constructor_max_index == 0
6059 || tree_int_cst_lt (constructor_max_index,
6060 constructor_index)))
6061 process_init_element (pop_init_level (1));
6068 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6071 enum tree_code fieldcode;
6073 if (constructor_fields == 0)
6075 pedwarn_init ("excess elements in struct initializer");
6079 fieldtype = TREE_TYPE (constructor_fields);
6080 if (fieldtype != error_mark_node)
6081 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6082 fieldcode = TREE_CODE (fieldtype);
6084 /* Accept a string constant to initialize a subarray. */
6086 && fieldcode == ARRAY_TYPE
6087 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6090 /* Otherwise, if we have come to a subaggregate,
6091 and we don't have an element of its type, push into it. */
6092 else if (value != 0 && !constructor_no_implicit
6093 && value != error_mark_node
6094 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6095 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6096 || fieldcode == UNION_TYPE))
6098 push_init_level (1);
6104 push_member_name (constructor_fields);
6105 output_init_element (value, fieldtype, constructor_fields, 1);
6106 RESTORE_SPELLING_DEPTH (constructor_depth);
6109 /* Do the bookkeeping for an element that was
6110 directly output as a constructor. */
6112 /* For a record, keep track of end position of last field. */
6113 constructor_bit_index
6114 = size_binop (PLUS_EXPR,
6115 bit_position (constructor_fields),
6116 DECL_SIZE (constructor_fields));
6118 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6119 /* Skip any nameless bit fields. */
6120 while (constructor_unfilled_fields != 0
6121 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6122 && DECL_NAME (constructor_unfilled_fields) == 0)
6123 constructor_unfilled_fields =
6124 TREE_CHAIN (constructor_unfilled_fields);
6127 constructor_fields = TREE_CHAIN (constructor_fields);
6128 /* Skip any nameless bit fields at the beginning. */
6129 while (constructor_fields != 0
6130 && DECL_C_BIT_FIELD (constructor_fields)
6131 && DECL_NAME (constructor_fields) == 0)
6132 constructor_fields = TREE_CHAIN (constructor_fields);
6135 if (TREE_CODE (constructor_type) == UNION_TYPE)
6138 enum tree_code fieldcode;
6140 if (constructor_fields == 0)
6142 pedwarn_init ("excess elements in union initializer");
6146 fieldtype = TREE_TYPE (constructor_fields);
6147 if (fieldtype != error_mark_node)
6148 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6149 fieldcode = TREE_CODE (fieldtype);
6151 /* Warn that traditional C rejects initialization of unions.
6152 We skip the warning if the value is zero. This is done
6153 under the assumption that the zero initializer in user
6154 code appears conditioned on e.g. __STDC__ to avoid
6155 "missing initializer" warnings and relies on default
6156 initialization to zero in the traditional C case. */
6157 if (warn_traditional && !in_system_header
6158 && !(value && (integer_zerop (value) || real_zerop (value))))
6159 warning ("traditional C rejects initialization of unions");
6161 /* Accept a string constant to initialize a subarray. */
6163 && fieldcode == ARRAY_TYPE
6164 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6167 /* Otherwise, if we have come to a subaggregate,
6168 and we don't have an element of its type, push into it. */
6169 else if (value != 0 && !constructor_no_implicit
6170 && value != error_mark_node
6171 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6172 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6173 || fieldcode == UNION_TYPE))
6175 push_init_level (1);
6181 push_member_name (constructor_fields);
6182 output_init_element (value, fieldtype, constructor_fields, 1);
6183 RESTORE_SPELLING_DEPTH (constructor_depth);
6186 /* Do the bookkeeping for an element that was
6187 directly output as a constructor. */
6189 constructor_bit_index = DECL_SIZE (constructor_fields);
6190 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6193 constructor_fields = 0;
6196 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6198 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6199 enum tree_code eltcode = TREE_CODE (elttype);
6201 /* Accept a string constant to initialize a subarray. */
6203 && eltcode == ARRAY_TYPE
6204 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6207 /* Otherwise, if we have come to a subaggregate,
6208 and we don't have an element of its type, push into it. */
6209 else if (value != 0 && !constructor_no_implicit
6210 && value != error_mark_node
6211 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6212 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6213 || eltcode == UNION_TYPE))
6215 push_init_level (1);
6219 if (constructor_max_index != 0
6220 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6221 || integer_all_onesp (constructor_max_index)))
6223 pedwarn_init ("excess elements in array initializer");
6227 /* In the case of [LO .. HI] = VALUE, only evaluate VALUE once. */
6228 if (constructor_range_end)
6230 if (constructor_max_index != 0
6231 && tree_int_cst_lt (constructor_max_index,
6232 constructor_range_end))
6234 pedwarn_init ("excess elements in array initializer");
6235 constructor_range_end = constructor_max_index;
6238 value = save_expr (value);
6241 /* Now output the actual element.
6242 Ordinarily, output once.
6243 If there is a range, repeat it till we advance past the range. */
6248 push_array_bounds (tree_low_cst (constructor_index, 0));
6249 output_init_element (value, elttype, constructor_index, 1);
6250 RESTORE_SPELLING_DEPTH (constructor_depth);
6254 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6257 /* If we are doing the bookkeeping for an element that was
6258 directly output as a constructor, we must update
6259 constructor_unfilled_index. */
6260 constructor_unfilled_index = constructor_index;
6262 while (! (constructor_range_end == 0
6263 || tree_int_cst_lt (constructor_range_end,
6264 constructor_index)));
6269 /* Handle the sole element allowed in a braced initializer
6270 for a scalar variable. */
6271 if (constructor_fields == 0)
6273 pedwarn_init ("excess elements in scalar initializer");
6278 output_init_element (value, constructor_type, NULL_TREE, 1);
6279 constructor_fields = 0;
6284 /* Expand an ASM statement with operands, handling output operands
6285 that are not variables or INDIRECT_REFS by transforming such
6286 cases into cases that expand_asm_operands can handle.
6288 Arguments are same as for expand_asm_operands. */
6291 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6292 tree string, outputs, inputs, clobbers;
6294 const char *filename;
6297 int noutputs = list_length (outputs);
6299 /* o[I] is the place that output number I should be written. */
6300 register tree *o = (tree *) alloca (noutputs * sizeof (tree));
6303 if (TREE_CODE (string) == ADDR_EXPR)
6304 string = TREE_OPERAND (string, 0);
6305 if (last_tree && TREE_CODE (string) != STRING_CST)
6307 error ("asm template is not a string constant");
6311 /* Record the contents of OUTPUTS before it is modified. */
6312 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6314 tree output = TREE_VALUE (tail);
6316 /* We can remove conversions that just change the type, not the mode. */
6317 STRIP_NOPS (output);
6320 /* Allow conversions as LHS here. build_modify_expr as called below
6321 will do the right thing with them. */
6322 while (TREE_CODE (output) == NOP_EXPR
6323 || TREE_CODE (output) == CONVERT_EXPR
6324 || TREE_CODE (output) == FLOAT_EXPR
6325 || TREE_CODE (output) == FIX_TRUNC_EXPR
6326 || TREE_CODE (output) == FIX_FLOOR_EXPR
6327 || TREE_CODE (output) == FIX_ROUND_EXPR
6328 || TREE_CODE (output) == FIX_CEIL_EXPR)
6329 output = TREE_OPERAND (output, 0);
6332 lvalue_or_else (o[i], "invalid lvalue in asm statement");
6335 /* Perform default conversions on array and function inputs. */
6336 /* Don't do this for other types--
6337 it would screw up operands expected to be in memory. */
6338 for (i = 0, tail = inputs; tail; tail = TREE_CHAIN (tail), i++)
6339 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == ARRAY_TYPE
6340 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == FUNCTION_TYPE)
6341 TREE_VALUE (tail) = default_conversion (TREE_VALUE (tail));
6345 add_stmt (build_stmt (ASM_STMT,
6346 vol ? ridpointers[(int) RID_VOLATILE] : NULL_TREE,
6347 string, outputs, inputs, clobbers));
6351 /* Generate the ASM_OPERANDS insn;
6352 store into the TREE_VALUEs of OUTPUTS some trees for
6353 where the values were actually stored. */
6354 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
6356 /* Copy all the intermediate outputs into the specified outputs. */
6357 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6359 if (o[i] != TREE_VALUE (tail))
6361 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6362 NULL_RTX, VOIDmode, EXPAND_NORMAL);
6365 /* Restore the original value so that it's correct the next
6366 time we expand this function. */
6367 TREE_VALUE (tail) = o[i];
6369 /* Detect modification of read-only values.
6370 (Otherwise done by build_modify_expr.) */
6373 tree type = TREE_TYPE (o[i]);
6374 if (TREE_READONLY (o[i])
6375 || TYPE_READONLY (type)
6376 || ((TREE_CODE (type) == RECORD_TYPE
6377 || TREE_CODE (type) == UNION_TYPE)
6378 && C_TYPE_FIELDS_READONLY (type)))
6379 readonly_warning (o[i], "modification by `asm'");
6383 /* Those MODIFY_EXPRs could do autoincrements. */
6387 /* Expand a C `return' statement.
6388 RETVAL is the expression for what to return,
6389 or a null pointer for `return;' with no value. */
6392 c_expand_return (retval)
6395 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6397 if (TREE_THIS_VOLATILE (current_function_decl))
6398 warning ("function declared `noreturn' has a `return' statement");
6402 current_function_returns_null = 1;
6403 if ((warn_return_type || flag_isoc99)
6404 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6405 pedwarn_c99 ("`return' with no value, in function returning non-void");
6407 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6409 current_function_returns_null = 1;
6410 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6411 pedwarn ("`return' with a value, in function returning void");
6415 tree t = convert_for_assignment (valtype, retval, _("return"),
6416 NULL_TREE, NULL_TREE, 0);
6417 tree res = DECL_RESULT (current_function_decl);
6420 if (t == error_mark_node)
6423 inner = t = convert (TREE_TYPE (res), t);
6425 /* Strip any conversions, additions, and subtractions, and see if
6426 we are returning the address of a local variable. Warn if so. */
6429 switch (TREE_CODE (inner))
6431 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6433 inner = TREE_OPERAND (inner, 0);
6437 /* If the second operand of the MINUS_EXPR has a pointer
6438 type (or is converted from it), this may be valid, so
6439 don't give a warning. */
6441 tree op1 = TREE_OPERAND (inner, 1);
6443 while (! POINTER_TYPE_P (TREE_TYPE (op1))
6444 && (TREE_CODE (op1) == NOP_EXPR
6445 || TREE_CODE (op1) == NON_LVALUE_EXPR
6446 || TREE_CODE (op1) == CONVERT_EXPR))
6447 op1 = TREE_OPERAND (op1, 0);
6449 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6452 inner = TREE_OPERAND (inner, 0);
6457 inner = TREE_OPERAND (inner, 0);
6459 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
6460 inner = TREE_OPERAND (inner, 0);
6462 if (TREE_CODE (inner) == VAR_DECL
6463 && ! DECL_EXTERNAL (inner)
6464 && ! TREE_STATIC (inner)
6465 && DECL_CONTEXT (inner) == current_function_decl)
6466 warning ("function returns address of local variable");
6476 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
6477 current_function_returns_value = 1;
6480 add_stmt (build_return_stmt (retval));
6484 /* The SWITCH_STMT being built. */
6486 /* A splay-tree mapping the low element of a case range to the high
6487 element, or NULL_TREE if there is no high element. Used to
6488 determine whether or not a new case label duplicates an old case
6489 label. We need a tree, rather than simply a hash table, because
6490 of the GNU case range extension. */
6492 /* The next node on the stack. */
6493 struct c_switch *next;
6496 /* A stack of the currently active switch statements. The innermost
6497 switch statement is on the top of the stack. There is no need to
6498 mark the stack for garbage collection because it is only active
6499 during the processing of the body of a function, and we never
6500 collect at that point. */
6502 static struct c_switch *switch_stack;
6504 /* Start a C switch statement, testing expression EXP. Return the new
6511 register enum tree_code code;
6513 struct c_switch *cs;
6515 if (exp != error_mark_node)
6517 code = TREE_CODE (TREE_TYPE (exp));
6518 type = TREE_TYPE (exp);
6520 if (code != INTEGER_TYPE
6521 && code != ENUMERAL_TYPE
6522 && code != ERROR_MARK)
6524 error ("switch quantity not an integer");
6525 exp = integer_zero_node;
6530 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
6532 if (warn_traditional && !in_system_header
6533 && (type == long_integer_type_node
6534 || type == long_unsigned_type_node))
6535 warning ("`long' switch expression not converted to `int' in ISO C");
6537 exp = default_conversion (exp);
6538 type = TREE_TYPE (exp);
6539 index = get_unwidened (exp, NULL_TREE);
6540 /* We can't strip a conversion from a signed type to an
6541 unsigned, because if we did, int_fits_type_p would do the
6542 wrong thing when checking case values for being in range,
6543 and it's too hard to do the right thing. */
6544 if (TREE_UNSIGNED (TREE_TYPE (exp))
6545 == TREE_UNSIGNED (TREE_TYPE (index)))
6550 /* Add this new SWITCH_STMT to the stack. */
6551 cs = (struct c_switch *) xmalloc (sizeof (*cs));
6552 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, NULL_TREE);
6553 cs->cases = splay_tree_new (case_compare, NULL, NULL);
6554 cs->next = switch_stack;
6557 return add_stmt (switch_stack->switch_stmt);
6560 /* Process a case label. */
6563 do_case (low_value, high_value)
6568 c_add_case_label (switch_stack->cases,
6569 SWITCH_COND (switch_stack->switch_stmt),
6573 error ("case label not within a switch statement");
6575 error ("`default' label not within a switch statement");
6578 /* Finish the switch statement. */
6583 struct c_switch *cs = switch_stack;
6585 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
6587 /* Pop the stack. */
6588 switch_stack = switch_stack->next;
6589 splay_tree_delete (cs->cases);