1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
57 /* Whether we are building a boolean conversion inside
58 convert_for_assignment, or some other late binary operation. If
59 build_binary_op is called (from code shared with C++) in this case,
60 then the operands have already been folded and the result will not
61 be folded again, so C_MAYBE_CONST_EXPR should not be generated. */
62 bool in_late_binary_op;
64 /* The level of nesting inside "__alignof__". */
67 /* The level of nesting inside "sizeof". */
70 /* The level of nesting inside "typeof". */
73 struct c_label_context_se *label_context_stack_se;
74 struct c_label_context_vm *label_context_stack_vm;
76 /* Nonzero if we've already printed a "missing braces around initializer"
77 message within this initializer. */
78 static int missing_braces_mentioned;
80 static int require_constant_value;
81 static int require_constant_elements;
83 static bool null_pointer_constant_p (const_tree);
84 static tree qualify_type (tree, tree);
85 static int tagged_types_tu_compatible_p (const_tree, const_tree);
86 static int comp_target_types (tree, tree);
87 static int function_types_compatible_p (const_tree, const_tree);
88 static int type_lists_compatible_p (const_tree, const_tree);
89 static tree lookup_field (tree, tree);
90 static int convert_arguments (int, tree *, tree, tree, tree, tree);
91 static tree pointer_diff (tree, tree);
92 static tree convert_for_assignment (tree, tree, enum impl_conv, bool,
94 static tree valid_compound_expr_initializer (tree, tree);
95 static void push_string (const char *);
96 static void push_member_name (tree);
97 static int spelling_length (void);
98 static char *print_spelling (char *);
99 static void warning_init (int, const char *);
100 static tree digest_init (tree, tree, bool, bool, int);
101 static void output_init_element (tree, bool, tree, tree, int, bool);
102 static void output_pending_init_elements (int);
103 static int set_designator (int);
104 static void push_range_stack (tree);
105 static void add_pending_init (tree, tree, bool);
106 static void set_nonincremental_init (void);
107 static void set_nonincremental_init_from_string (tree);
108 static tree find_init_member (tree);
109 static void readonly_error (tree, enum lvalue_use);
110 static int lvalue_or_else (const_tree, enum lvalue_use);
111 static int lvalue_p (const_tree);
112 static void record_maybe_used_decl (tree);
113 static int comptypes_internal (const_tree, const_tree);
115 /* Return true if EXP is a null pointer constant, false otherwise. */
118 null_pointer_constant_p (const_tree expr)
120 /* This should really operate on c_expr structures, but they aren't
121 yet available everywhere required. */
122 tree type = TREE_TYPE (expr);
123 return (TREE_CODE (expr) == INTEGER_CST
124 && !TREE_OVERFLOW (expr)
125 && integer_zerop (expr)
126 && (INTEGRAL_TYPE_P (type)
127 || (TREE_CODE (type) == POINTER_TYPE
128 && VOID_TYPE_P (TREE_TYPE (type))
129 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
132 /* EXPR may appear in an unevaluated part of an integer constant
133 expression, but not in an evaluated part. Wrap it in a
134 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
135 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
138 note_integer_operands (tree expr)
141 if (TREE_CODE (expr) == INTEGER_CST && in_late_binary_op)
143 ret = copy_node (expr);
144 TREE_OVERFLOW (ret) = 1;
148 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL_TREE, expr);
149 C_MAYBE_CONST_EXPR_INT_OPERANDS (ret) = 1;
154 \f/* This is a cache to hold if two types are compatible or not. */
156 struct tagged_tu_seen_cache {
157 const struct tagged_tu_seen_cache * next;
160 /* The return value of tagged_types_tu_compatible_p if we had seen
161 these two types already. */
165 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
166 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
168 /* Do `exp = require_complete_type (exp);' to make sure exp
169 does not have an incomplete type. (That includes void types.) */
172 require_complete_type (tree value)
174 tree type = TREE_TYPE (value);
176 if (value == error_mark_node || type == error_mark_node)
177 return error_mark_node;
179 /* First, detect a valid value with a complete type. */
180 if (COMPLETE_TYPE_P (type))
183 c_incomplete_type_error (value, type);
184 return error_mark_node;
187 /* Print an error message for invalid use of an incomplete type.
188 VALUE is the expression that was used (or 0 if that isn't known)
189 and TYPE is the type that was invalid. */
192 c_incomplete_type_error (const_tree value, const_tree type)
194 const char *type_code_string;
196 /* Avoid duplicate error message. */
197 if (TREE_CODE (type) == ERROR_MARK)
200 if (value != 0 && (TREE_CODE (value) == VAR_DECL
201 || TREE_CODE (value) == PARM_DECL))
202 error ("%qD has an incomplete type", value);
206 /* We must print an error message. Be clever about what it says. */
208 switch (TREE_CODE (type))
211 type_code_string = "struct";
215 type_code_string = "union";
219 type_code_string = "enum";
223 error ("invalid use of void expression");
227 if (TYPE_DOMAIN (type))
229 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
231 error ("invalid use of flexible array member");
234 type = TREE_TYPE (type);
237 error ("invalid use of array with unspecified bounds");
244 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
245 error ("invalid use of undefined type %<%s %E%>",
246 type_code_string, TYPE_NAME (type));
248 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
249 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
253 /* Given a type, apply default promotions wrt unnamed function
254 arguments and return the new type. */
257 c_type_promotes_to (tree type)
259 if (TYPE_MAIN_VARIANT (type) == float_type_node)
260 return double_type_node;
262 if (c_promoting_integer_type_p (type))
264 /* Preserve unsignedness if not really getting any wider. */
265 if (TYPE_UNSIGNED (type)
266 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
267 return unsigned_type_node;
268 return integer_type_node;
274 /* Return a variant of TYPE which has all the type qualifiers of LIKE
275 as well as those of TYPE. */
278 qualify_type (tree type, tree like)
280 return c_build_qualified_type (type,
281 TYPE_QUALS (type) | TYPE_QUALS (like));
284 /* Return true iff the given tree T is a variable length array. */
287 c_vla_type_p (const_tree t)
289 if (TREE_CODE (t) == ARRAY_TYPE
290 && C_TYPE_VARIABLE_SIZE (t))
295 /* Return the composite type of two compatible types.
297 We assume that comptypes has already been done and returned
298 nonzero; if that isn't so, this may crash. In particular, we
299 assume that qualifiers match. */
302 composite_type (tree t1, tree t2)
304 enum tree_code code1;
305 enum tree_code code2;
308 /* Save time if the two types are the same. */
310 if (t1 == t2) return t1;
312 /* If one type is nonsense, use the other. */
313 if (t1 == error_mark_node)
315 if (t2 == error_mark_node)
318 code1 = TREE_CODE (t1);
319 code2 = TREE_CODE (t2);
321 /* Merge the attributes. */
322 attributes = targetm.merge_type_attributes (t1, t2);
324 /* If one is an enumerated type and the other is the compatible
325 integer type, the composite type might be either of the two
326 (DR#013 question 3). For consistency, use the enumerated type as
327 the composite type. */
329 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
331 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
334 gcc_assert (code1 == code2);
339 /* For two pointers, do this recursively on the target type. */
341 tree pointed_to_1 = TREE_TYPE (t1);
342 tree pointed_to_2 = TREE_TYPE (t2);
343 tree target = composite_type (pointed_to_1, pointed_to_2);
344 t1 = build_pointer_type (target);
345 t1 = build_type_attribute_variant (t1, attributes);
346 return qualify_type (t1, t2);
351 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
354 tree d1 = TYPE_DOMAIN (t1);
355 tree d2 = TYPE_DOMAIN (t2);
356 bool d1_variable, d2_variable;
357 bool d1_zero, d2_zero;
358 bool t1_complete, t2_complete;
360 /* We should not have any type quals on arrays at all. */
361 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
363 t1_complete = COMPLETE_TYPE_P (t1);
364 t2_complete = COMPLETE_TYPE_P (t2);
366 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
367 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
369 d1_variable = (!d1_zero
370 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
371 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
372 d2_variable = (!d2_zero
373 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
374 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
375 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
376 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
378 /* Save space: see if the result is identical to one of the args. */
379 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
380 && (d2_variable || d2_zero || !d1_variable))
381 return build_type_attribute_variant (t1, attributes);
382 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
383 && (d1_variable || d1_zero || !d2_variable))
384 return build_type_attribute_variant (t2, attributes);
386 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
387 return build_type_attribute_variant (t1, attributes);
388 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
389 return build_type_attribute_variant (t2, attributes);
391 /* Merge the element types, and have a size if either arg has
392 one. We may have qualifiers on the element types. To set
393 up TYPE_MAIN_VARIANT correctly, we need to form the
394 composite of the unqualified types and add the qualifiers
396 quals = TYPE_QUALS (strip_array_types (elt));
397 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
398 t1 = build_array_type (unqual_elt,
399 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
405 /* Ensure a composite type involving a zero-length array type
406 is a zero-length type not an incomplete type. */
407 if (d1_zero && d2_zero
408 && (t1_complete || t2_complete)
409 && !COMPLETE_TYPE_P (t1))
411 TYPE_SIZE (t1) = bitsize_zero_node;
412 TYPE_SIZE_UNIT (t1) = size_zero_node;
414 t1 = c_build_qualified_type (t1, quals);
415 return build_type_attribute_variant (t1, attributes);
421 if (attributes != NULL)
423 /* Try harder not to create a new aggregate type. */
424 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
426 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
429 return build_type_attribute_variant (t1, attributes);
432 /* Function types: prefer the one that specified arg types.
433 If both do, merge the arg types. Also merge the return types. */
435 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
436 tree p1 = TYPE_ARG_TYPES (t1);
437 tree p2 = TYPE_ARG_TYPES (t2);
442 /* Save space: see if the result is identical to one of the args. */
443 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
444 return build_type_attribute_variant (t1, attributes);
445 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
446 return build_type_attribute_variant (t2, attributes);
448 /* Simple way if one arg fails to specify argument types. */
449 if (TYPE_ARG_TYPES (t1) == 0)
451 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
452 t1 = build_type_attribute_variant (t1, attributes);
453 return qualify_type (t1, t2);
455 if (TYPE_ARG_TYPES (t2) == 0)
457 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
458 t1 = build_type_attribute_variant (t1, attributes);
459 return qualify_type (t1, t2);
462 /* If both args specify argument types, we must merge the two
463 lists, argument by argument. */
464 /* Tell global_bindings_p to return false so that variable_size
465 doesn't die on VLAs in parameter types. */
466 c_override_global_bindings_to_false = true;
468 len = list_length (p1);
471 for (i = 0; i < len; i++)
472 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
477 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
479 /* A null type means arg type is not specified.
480 Take whatever the other function type has. */
481 if (TREE_VALUE (p1) == 0)
483 TREE_VALUE (n) = TREE_VALUE (p2);
486 if (TREE_VALUE (p2) == 0)
488 TREE_VALUE (n) = TREE_VALUE (p1);
492 /* Given wait (union {union wait *u; int *i} *)
493 and wait (union wait *),
494 prefer union wait * as type of parm. */
495 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
496 && TREE_VALUE (p1) != TREE_VALUE (p2))
499 tree mv2 = TREE_VALUE (p2);
500 if (mv2 && mv2 != error_mark_node
501 && TREE_CODE (mv2) != ARRAY_TYPE)
502 mv2 = TYPE_MAIN_VARIANT (mv2);
503 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
504 memb; memb = TREE_CHAIN (memb))
506 tree mv3 = TREE_TYPE (memb);
507 if (mv3 && mv3 != error_mark_node
508 && TREE_CODE (mv3) != ARRAY_TYPE)
509 mv3 = TYPE_MAIN_VARIANT (mv3);
510 if (comptypes (mv3, mv2))
512 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
514 pedwarn (input_location, OPT_pedantic,
515 "function types not truly compatible in ISO C");
520 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
521 && TREE_VALUE (p2) != TREE_VALUE (p1))
524 tree mv1 = TREE_VALUE (p1);
525 if (mv1 && mv1 != error_mark_node
526 && TREE_CODE (mv1) != ARRAY_TYPE)
527 mv1 = TYPE_MAIN_VARIANT (mv1);
528 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
529 memb; memb = TREE_CHAIN (memb))
531 tree mv3 = TREE_TYPE (memb);
532 if (mv3 && mv3 != error_mark_node
533 && TREE_CODE (mv3) != ARRAY_TYPE)
534 mv3 = TYPE_MAIN_VARIANT (mv3);
535 if (comptypes (mv3, mv1))
537 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
539 pedwarn (input_location, OPT_pedantic,
540 "function types not truly compatible in ISO C");
545 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
549 c_override_global_bindings_to_false = false;
550 t1 = build_function_type (valtype, newargs);
551 t1 = qualify_type (t1, t2);
552 /* ... falls through ... */
556 return build_type_attribute_variant (t1, attributes);
561 /* Return the type of a conditional expression between pointers to
562 possibly differently qualified versions of compatible types.
564 We assume that comp_target_types has already been done and returned
565 nonzero; if that isn't so, this may crash. */
568 common_pointer_type (tree t1, tree t2)
571 tree pointed_to_1, mv1;
572 tree pointed_to_2, mv2;
574 unsigned target_quals;
576 /* Save time if the two types are the same. */
578 if (t1 == t2) return t1;
580 /* If one type is nonsense, use the other. */
581 if (t1 == error_mark_node)
583 if (t2 == error_mark_node)
586 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
587 && TREE_CODE (t2) == POINTER_TYPE);
589 /* Merge the attributes. */
590 attributes = targetm.merge_type_attributes (t1, t2);
592 /* Find the composite type of the target types, and combine the
593 qualifiers of the two types' targets. Do not lose qualifiers on
594 array element types by taking the TYPE_MAIN_VARIANT. */
595 mv1 = pointed_to_1 = TREE_TYPE (t1);
596 mv2 = pointed_to_2 = TREE_TYPE (t2);
597 if (TREE_CODE (mv1) != ARRAY_TYPE)
598 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
599 if (TREE_CODE (mv2) != ARRAY_TYPE)
600 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
601 target = composite_type (mv1, mv2);
603 /* For function types do not merge const qualifiers, but drop them
604 if used inconsistently. The middle-end uses these to mark const
605 and noreturn functions. */
606 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
607 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
609 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
610 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
611 return build_type_attribute_variant (t1, attributes);
614 /* Return the common type for two arithmetic types under the usual
615 arithmetic conversions. The default conversions have already been
616 applied, and enumerated types converted to their compatible integer
617 types. The resulting type is unqualified and has no attributes.
619 This is the type for the result of most arithmetic operations
620 if the operands have the given two types. */
623 c_common_type (tree t1, tree t2)
625 enum tree_code code1;
626 enum tree_code code2;
628 /* If one type is nonsense, use the other. */
629 if (t1 == error_mark_node)
631 if (t2 == error_mark_node)
634 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
635 t1 = TYPE_MAIN_VARIANT (t1);
637 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
638 t2 = TYPE_MAIN_VARIANT (t2);
640 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
641 t1 = build_type_attribute_variant (t1, NULL_TREE);
643 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
644 t2 = build_type_attribute_variant (t2, NULL_TREE);
646 /* Save time if the two types are the same. */
648 if (t1 == t2) return t1;
650 code1 = TREE_CODE (t1);
651 code2 = TREE_CODE (t2);
653 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
654 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
655 || code1 == INTEGER_TYPE);
656 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
657 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
658 || code2 == INTEGER_TYPE);
660 /* When one operand is a decimal float type, the other operand cannot be
661 a generic float type or a complex type. We also disallow vector types
663 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
664 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
666 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
668 error ("can%'t mix operands of decimal float and vector types");
669 return error_mark_node;
671 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
673 error ("can%'t mix operands of decimal float and complex types");
674 return error_mark_node;
676 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
678 error ("can%'t mix operands of decimal float and other float types");
679 return error_mark_node;
683 /* If one type is a vector type, return that type. (How the usual
684 arithmetic conversions apply to the vector types extension is not
685 precisely specified.) */
686 if (code1 == VECTOR_TYPE)
689 if (code2 == VECTOR_TYPE)
692 /* If one type is complex, form the common type of the non-complex
693 components, then make that complex. Use T1 or T2 if it is the
695 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
697 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
698 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
699 tree subtype = c_common_type (subtype1, subtype2);
701 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
703 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
706 return build_complex_type (subtype);
709 /* If only one is real, use it as the result. */
711 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
714 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
717 /* If both are real and either are decimal floating point types, use
718 the decimal floating point type with the greater precision. */
720 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
722 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
723 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
724 return dfloat128_type_node;
725 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
726 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
727 return dfloat64_type_node;
728 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
729 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
730 return dfloat32_type_node;
733 /* Deal with fixed-point types. */
734 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
736 unsigned int unsignedp = 0, satp = 0;
737 enum machine_mode m1, m2;
738 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
743 /* If one input type is saturating, the result type is saturating. */
744 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
747 /* If both fixed-point types are unsigned, the result type is unsigned.
748 When mixing fixed-point and integer types, follow the sign of the
750 Otherwise, the result type is signed. */
751 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
752 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
753 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
754 && TYPE_UNSIGNED (t1))
755 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
756 && TYPE_UNSIGNED (t2)))
759 /* The result type is signed. */
762 /* If the input type is unsigned, we need to convert to the
764 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
766 enum mode_class mclass = (enum mode_class) 0;
767 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
769 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
773 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
775 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
777 enum mode_class mclass = (enum mode_class) 0;
778 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
780 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
784 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
788 if (code1 == FIXED_POINT_TYPE)
790 fbit1 = GET_MODE_FBIT (m1);
791 ibit1 = GET_MODE_IBIT (m1);
796 /* Signed integers need to subtract one sign bit. */
797 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
800 if (code2 == FIXED_POINT_TYPE)
802 fbit2 = GET_MODE_FBIT (m2);
803 ibit2 = GET_MODE_IBIT (m2);
808 /* Signed integers need to subtract one sign bit. */
809 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
812 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
813 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
814 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
818 /* Both real or both integers; use the one with greater precision. */
820 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
822 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
825 /* Same precision. Prefer long longs to longs to ints when the
826 same precision, following the C99 rules on integer type rank
827 (which are equivalent to the C90 rules for C90 types). */
829 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
830 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
831 return long_long_unsigned_type_node;
833 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
834 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
836 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
837 return long_long_unsigned_type_node;
839 return long_long_integer_type_node;
842 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
843 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
844 return long_unsigned_type_node;
846 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
847 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
849 /* But preserve unsignedness from the other type,
850 since long cannot hold all the values of an unsigned int. */
851 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
852 return long_unsigned_type_node;
854 return long_integer_type_node;
857 /* Likewise, prefer long double to double even if same size. */
858 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
859 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
860 return long_double_type_node;
862 /* Otherwise prefer the unsigned one. */
864 if (TYPE_UNSIGNED (t1))
870 /* Wrapper around c_common_type that is used by c-common.c and other
871 front end optimizations that remove promotions. ENUMERAL_TYPEs
872 are allowed here and are converted to their compatible integer types.
873 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
874 preferably a non-Boolean type as the common type. */
876 common_type (tree t1, tree t2)
878 if (TREE_CODE (t1) == ENUMERAL_TYPE)
879 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
880 if (TREE_CODE (t2) == ENUMERAL_TYPE)
881 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
883 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
884 if (TREE_CODE (t1) == BOOLEAN_TYPE
885 && TREE_CODE (t2) == BOOLEAN_TYPE)
886 return boolean_type_node;
888 /* If either type is BOOLEAN_TYPE, then return the other. */
889 if (TREE_CODE (t1) == BOOLEAN_TYPE)
891 if (TREE_CODE (t2) == BOOLEAN_TYPE)
894 return c_common_type (t1, t2);
897 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
898 or various other operations. Return 2 if they are compatible
899 but a warning may be needed if you use them together. */
902 comptypes (tree type1, tree type2)
904 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
907 val = comptypes_internal (type1, type2);
908 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
913 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
914 or various other operations. Return 2 if they are compatible
915 but a warning may be needed if you use them together. This
916 differs from comptypes, in that we don't free the seen types. */
919 comptypes_internal (const_tree type1, const_tree type2)
921 const_tree t1 = type1;
922 const_tree t2 = type2;
925 /* Suppress errors caused by previously reported errors. */
927 if (t1 == t2 || !t1 || !t2
928 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
931 /* If either type is the internal version of sizetype, return the
933 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
934 && TYPE_ORIG_SIZE_TYPE (t1))
935 t1 = TYPE_ORIG_SIZE_TYPE (t1);
937 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
938 && TYPE_ORIG_SIZE_TYPE (t2))
939 t2 = TYPE_ORIG_SIZE_TYPE (t2);
942 /* Enumerated types are compatible with integer types, but this is
943 not transitive: two enumerated types in the same translation unit
944 are compatible with each other only if they are the same type. */
946 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
947 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
948 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
949 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
954 /* Different classes of types can't be compatible. */
956 if (TREE_CODE (t1) != TREE_CODE (t2))
959 /* Qualifiers must match. C99 6.7.3p9 */
961 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
964 /* Allow for two different type nodes which have essentially the same
965 definition. Note that we already checked for equality of the type
966 qualifiers (just above). */
968 if (TREE_CODE (t1) != ARRAY_TYPE
969 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
972 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
973 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
976 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
979 switch (TREE_CODE (t1))
982 /* Do not remove mode or aliasing information. */
983 if (TYPE_MODE (t1) != TYPE_MODE (t2)
984 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
986 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
987 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
991 val = function_types_compatible_p (t1, t2);
996 tree d1 = TYPE_DOMAIN (t1);
997 tree d2 = TYPE_DOMAIN (t2);
998 bool d1_variable, d2_variable;
999 bool d1_zero, d2_zero;
1002 /* Target types must match incl. qualifiers. */
1003 if (TREE_TYPE (t1) != TREE_TYPE (t2)
1004 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
1007 /* Sizes must match unless one is missing or variable. */
1008 if (d1 == 0 || d2 == 0 || d1 == d2)
1011 d1_zero = !TYPE_MAX_VALUE (d1);
1012 d2_zero = !TYPE_MAX_VALUE (d2);
1014 d1_variable = (!d1_zero
1015 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
1016 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
1017 d2_variable = (!d2_zero
1018 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
1019 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
1020 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
1021 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
1023 if (d1_variable || d2_variable)
1025 if (d1_zero && d2_zero)
1027 if (d1_zero || d2_zero
1028 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
1029 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
1038 if (val != 1 && !same_translation_unit_p (t1, t2))
1040 tree a1 = TYPE_ATTRIBUTES (t1);
1041 tree a2 = TYPE_ATTRIBUTES (t2);
1043 if (! attribute_list_contained (a1, a2)
1044 && ! attribute_list_contained (a2, a1))
1048 return tagged_types_tu_compatible_p (t1, t2);
1049 val = tagged_types_tu_compatible_p (t1, t2);
1054 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1055 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1061 return attrval == 2 && val == 1 ? 2 : val;
1064 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1065 ignoring their qualifiers. */
1068 comp_target_types (tree ttl, tree ttr)
1073 /* Do not lose qualifiers on element types of array types that are
1074 pointer targets by taking their TYPE_MAIN_VARIANT. */
1075 mvl = TREE_TYPE (ttl);
1076 mvr = TREE_TYPE (ttr);
1077 if (TREE_CODE (mvl) != ARRAY_TYPE)
1078 mvl = TYPE_MAIN_VARIANT (mvl);
1079 if (TREE_CODE (mvr) != ARRAY_TYPE)
1080 mvr = TYPE_MAIN_VARIANT (mvr);
1081 val = comptypes (mvl, mvr);
1084 pedwarn (input_location, OPT_pedantic, "types are not quite compatible");
1088 /* Subroutines of `comptypes'. */
1090 /* Determine whether two trees derive from the same translation unit.
1091 If the CONTEXT chain ends in a null, that tree's context is still
1092 being parsed, so if two trees have context chains ending in null,
1093 they're in the same translation unit. */
1095 same_translation_unit_p (const_tree t1, const_tree t2)
1097 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1098 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1100 case tcc_declaration:
1101 t1 = DECL_CONTEXT (t1); break;
1103 t1 = TYPE_CONTEXT (t1); break;
1104 case tcc_exceptional:
1105 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1106 default: gcc_unreachable ();
1109 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1110 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1112 case tcc_declaration:
1113 t2 = DECL_CONTEXT (t2); break;
1115 t2 = TYPE_CONTEXT (t2); break;
1116 case tcc_exceptional:
1117 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1118 default: gcc_unreachable ();
1124 /* Allocate the seen two types, assuming that they are compatible. */
1126 static struct tagged_tu_seen_cache *
1127 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1129 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1130 tu->next = tagged_tu_seen_base;
1134 tagged_tu_seen_base = tu;
1136 /* The C standard says that two structures in different translation
1137 units are compatible with each other only if the types of their
1138 fields are compatible (among other things). We assume that they
1139 are compatible until proven otherwise when building the cache.
1140 An example where this can occur is:
1145 If we are comparing this against a similar struct in another TU,
1146 and did not assume they were compatible, we end up with an infinite
1152 /* Free the seen types until we get to TU_TIL. */
1155 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1157 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1158 while (tu != tu_til)
1160 const struct tagged_tu_seen_cache *const tu1
1161 = (const struct tagged_tu_seen_cache *) tu;
1163 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1165 tagged_tu_seen_base = tu_til;
1168 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1169 compatible. If the two types are not the same (which has been
1170 checked earlier), this can only happen when multiple translation
1171 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1175 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1178 bool needs_warning = false;
1180 /* We have to verify that the tags of the types are the same. This
1181 is harder than it looks because this may be a typedef, so we have
1182 to go look at the original type. It may even be a typedef of a
1184 In the case of compiler-created builtin structs the TYPE_DECL
1185 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1186 while (TYPE_NAME (t1)
1187 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1188 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1189 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1191 while (TYPE_NAME (t2)
1192 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1193 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1194 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1196 /* C90 didn't have the requirement that the two tags be the same. */
1197 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1200 /* C90 didn't say what happened if one or both of the types were
1201 incomplete; we choose to follow C99 rules here, which is that they
1203 if (TYPE_SIZE (t1) == NULL
1204 || TYPE_SIZE (t2) == NULL)
1208 const struct tagged_tu_seen_cache * tts_i;
1209 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1210 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1214 switch (TREE_CODE (t1))
1218 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1219 /* Speed up the case where the type values are in the same order. */
1220 tree tv1 = TYPE_VALUES (t1);
1221 tree tv2 = TYPE_VALUES (t2);
1228 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1230 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1232 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1239 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1243 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1249 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1255 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1257 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1259 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1270 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1271 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1277 /* Speed up the common case where the fields are in the same order. */
1278 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1279 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1283 if (DECL_NAME (s1) != DECL_NAME (s2))
1285 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1287 if (result != 1 && !DECL_NAME (s1))
1295 needs_warning = true;
1297 if (TREE_CODE (s1) == FIELD_DECL
1298 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1299 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1307 tu->val = needs_warning ? 2 : 1;
1311 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1315 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1316 if (DECL_NAME (s1) == DECL_NAME (s2))
1320 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1322 if (result != 1 && !DECL_NAME (s1))
1330 needs_warning = true;
1332 if (TREE_CODE (s1) == FIELD_DECL
1333 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1334 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1346 tu->val = needs_warning ? 2 : 10;
1352 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1354 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1356 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1359 if (TREE_CODE (s1) != TREE_CODE (s2)
1360 || DECL_NAME (s1) != DECL_NAME (s2))
1362 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1366 needs_warning = true;
1368 if (TREE_CODE (s1) == FIELD_DECL
1369 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1370 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1376 tu->val = needs_warning ? 2 : 1;
1385 /* Return 1 if two function types F1 and F2 are compatible.
1386 If either type specifies no argument types,
1387 the other must specify a fixed number of self-promoting arg types.
1388 Otherwise, if one type specifies only the number of arguments,
1389 the other must specify that number of self-promoting arg types.
1390 Otherwise, the argument types must match. */
1393 function_types_compatible_p (const_tree f1, const_tree f2)
1396 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1401 ret1 = TREE_TYPE (f1);
1402 ret2 = TREE_TYPE (f2);
1404 /* 'volatile' qualifiers on a function's return type used to mean
1405 the function is noreturn. */
1406 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1407 pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1408 if (TYPE_VOLATILE (ret1))
1409 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1410 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1411 if (TYPE_VOLATILE (ret2))
1412 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1413 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1414 val = comptypes_internal (ret1, ret2);
1418 args1 = TYPE_ARG_TYPES (f1);
1419 args2 = TYPE_ARG_TYPES (f2);
1421 /* An unspecified parmlist matches any specified parmlist
1422 whose argument types don't need default promotions. */
1426 if (!self_promoting_args_p (args2))
1428 /* If one of these types comes from a non-prototype fn definition,
1429 compare that with the other type's arglist.
1430 If they don't match, ask for a warning (but no error). */
1431 if (TYPE_ACTUAL_ARG_TYPES (f1)
1432 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1438 if (!self_promoting_args_p (args1))
1440 if (TYPE_ACTUAL_ARG_TYPES (f2)
1441 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1446 /* Both types have argument lists: compare them and propagate results. */
1447 val1 = type_lists_compatible_p (args1, args2);
1448 return val1 != 1 ? val1 : val;
1451 /* Check two lists of types for compatibility,
1452 returning 0 for incompatible, 1 for compatible,
1453 or 2 for compatible with warning. */
1456 type_lists_compatible_p (const_tree args1, const_tree args2)
1458 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1464 tree a1, mv1, a2, mv2;
1465 if (args1 == 0 && args2 == 0)
1467 /* If one list is shorter than the other,
1468 they fail to match. */
1469 if (args1 == 0 || args2 == 0)
1471 mv1 = a1 = TREE_VALUE (args1);
1472 mv2 = a2 = TREE_VALUE (args2);
1473 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1474 mv1 = TYPE_MAIN_VARIANT (mv1);
1475 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1476 mv2 = TYPE_MAIN_VARIANT (mv2);
1477 /* A null pointer instead of a type
1478 means there is supposed to be an argument
1479 but nothing is specified about what type it has.
1480 So match anything that self-promotes. */
1483 if (c_type_promotes_to (a2) != a2)
1488 if (c_type_promotes_to (a1) != a1)
1491 /* If one of the lists has an error marker, ignore this arg. */
1492 else if (TREE_CODE (a1) == ERROR_MARK
1493 || TREE_CODE (a2) == ERROR_MARK)
1495 else if (!(newval = comptypes_internal (mv1, mv2)))
1497 /* Allow wait (union {union wait *u; int *i} *)
1498 and wait (union wait *) to be compatible. */
1499 if (TREE_CODE (a1) == UNION_TYPE
1500 && (TYPE_NAME (a1) == 0
1501 || TYPE_TRANSPARENT_UNION (a1))
1502 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1503 && tree_int_cst_equal (TYPE_SIZE (a1),
1507 for (memb = TYPE_FIELDS (a1);
1508 memb; memb = TREE_CHAIN (memb))
1510 tree mv3 = TREE_TYPE (memb);
1511 if (mv3 && mv3 != error_mark_node
1512 && TREE_CODE (mv3) != ARRAY_TYPE)
1513 mv3 = TYPE_MAIN_VARIANT (mv3);
1514 if (comptypes_internal (mv3, mv2))
1520 else if (TREE_CODE (a2) == UNION_TYPE
1521 && (TYPE_NAME (a2) == 0
1522 || TYPE_TRANSPARENT_UNION (a2))
1523 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1524 && tree_int_cst_equal (TYPE_SIZE (a2),
1528 for (memb = TYPE_FIELDS (a2);
1529 memb; memb = TREE_CHAIN (memb))
1531 tree mv3 = TREE_TYPE (memb);
1532 if (mv3 && mv3 != error_mark_node
1533 && TREE_CODE (mv3) != ARRAY_TYPE)
1534 mv3 = TYPE_MAIN_VARIANT (mv3);
1535 if (comptypes_internal (mv3, mv1))
1545 /* comptypes said ok, but record if it said to warn. */
1549 args1 = TREE_CHAIN (args1);
1550 args2 = TREE_CHAIN (args2);
1554 /* Compute the size to increment a pointer by. */
1557 c_size_in_bytes (const_tree type)
1559 enum tree_code code = TREE_CODE (type);
1561 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1562 return size_one_node;
1564 if (!COMPLETE_OR_VOID_TYPE_P (type))
1566 error ("arithmetic on pointer to an incomplete type");
1567 return size_one_node;
1570 /* Convert in case a char is more than one unit. */
1571 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1572 size_int (TYPE_PRECISION (char_type_node)
1576 /* Return either DECL or its known constant value (if it has one). */
1579 decl_constant_value (tree decl)
1581 if (/* Don't change a variable array bound or initial value to a constant
1582 in a place where a variable is invalid. Note that DECL_INITIAL
1583 isn't valid for a PARM_DECL. */
1584 current_function_decl != 0
1585 && TREE_CODE (decl) != PARM_DECL
1586 && !TREE_THIS_VOLATILE (decl)
1587 && TREE_READONLY (decl)
1588 && DECL_INITIAL (decl) != 0
1589 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1590 /* This is invalid if initial value is not constant.
1591 If it has either a function call, a memory reference,
1592 or a variable, then re-evaluating it could give different results. */
1593 && TREE_CONSTANT (DECL_INITIAL (decl))
1594 /* Check for cases where this is sub-optimal, even though valid. */
1595 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1596 return DECL_INITIAL (decl);
1600 /* Convert the array expression EXP to a pointer. */
1602 array_to_pointer_conversion (tree exp)
1604 tree orig_exp = exp;
1605 tree type = TREE_TYPE (exp);
1607 tree restype = TREE_TYPE (type);
1610 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1612 STRIP_TYPE_NOPS (exp);
1614 if (TREE_NO_WARNING (orig_exp))
1615 TREE_NO_WARNING (exp) = 1;
1617 ptrtype = build_pointer_type (restype);
1619 if (TREE_CODE (exp) == INDIRECT_REF)
1620 return convert (ptrtype, TREE_OPERAND (exp, 0));
1622 if (TREE_CODE (exp) == VAR_DECL)
1624 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1625 ADDR_EXPR because it's the best way of representing what
1626 happens in C when we take the address of an array and place
1627 it in a pointer to the element type. */
1628 adr = build1 (ADDR_EXPR, ptrtype, exp);
1629 if (!c_mark_addressable (exp))
1630 return error_mark_node;
1631 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1635 /* This way is better for a COMPONENT_REF since it can
1636 simplify the offset for a component. */
1637 adr = build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 1);
1638 return convert (ptrtype, adr);
1641 /* Convert the function expression EXP to a pointer. */
1643 function_to_pointer_conversion (tree exp)
1645 tree orig_exp = exp;
1647 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1649 STRIP_TYPE_NOPS (exp);
1651 if (TREE_NO_WARNING (orig_exp))
1652 TREE_NO_WARNING (exp) = 1;
1654 return build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 0);
1657 /* Perform the default conversion of arrays and functions to pointers.
1658 Return the result of converting EXP. For any other expression, just
1662 default_function_array_conversion (struct c_expr exp)
1664 tree orig_exp = exp.value;
1665 tree type = TREE_TYPE (exp.value);
1666 enum tree_code code = TREE_CODE (type);
1672 bool not_lvalue = false;
1673 bool lvalue_array_p;
1675 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1676 || CONVERT_EXPR_P (exp.value))
1677 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1679 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1681 exp.value = TREE_OPERAND (exp.value, 0);
1684 if (TREE_NO_WARNING (orig_exp))
1685 TREE_NO_WARNING (exp.value) = 1;
1687 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1688 if (!flag_isoc99 && !lvalue_array_p)
1690 /* Before C99, non-lvalue arrays do not decay to pointers.
1691 Normally, using such an array would be invalid; but it can
1692 be used correctly inside sizeof or as a statement expression.
1693 Thus, do not give an error here; an error will result later. */
1697 exp.value = array_to_pointer_conversion (exp.value);
1701 exp.value = function_to_pointer_conversion (exp.value);
1711 /* EXP is an expression of integer type. Apply the integer promotions
1712 to it and return the promoted value. */
1715 perform_integral_promotions (tree exp)
1717 tree type = TREE_TYPE (exp);
1718 enum tree_code code = TREE_CODE (type);
1720 gcc_assert (INTEGRAL_TYPE_P (type));
1722 /* Normally convert enums to int,
1723 but convert wide enums to something wider. */
1724 if (code == ENUMERAL_TYPE)
1726 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1727 TYPE_PRECISION (integer_type_node)),
1728 ((TYPE_PRECISION (type)
1729 >= TYPE_PRECISION (integer_type_node))
1730 && TYPE_UNSIGNED (type)));
1732 return convert (type, exp);
1735 /* ??? This should no longer be needed now bit-fields have their
1737 if (TREE_CODE (exp) == COMPONENT_REF
1738 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1739 /* If it's thinner than an int, promote it like a
1740 c_promoting_integer_type_p, otherwise leave it alone. */
1741 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1742 TYPE_PRECISION (integer_type_node)))
1743 return convert (integer_type_node, exp);
1745 if (c_promoting_integer_type_p (type))
1747 /* Preserve unsignedness if not really getting any wider. */
1748 if (TYPE_UNSIGNED (type)
1749 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1750 return convert (unsigned_type_node, exp);
1752 return convert (integer_type_node, exp);
1759 /* Perform default promotions for C data used in expressions.
1760 Enumeral types or short or char are converted to int.
1761 In addition, manifest constants symbols are replaced by their values. */
1764 default_conversion (tree exp)
1767 tree type = TREE_TYPE (exp);
1768 enum tree_code code = TREE_CODE (type);
1770 /* Functions and arrays have been converted during parsing. */
1771 gcc_assert (code != FUNCTION_TYPE);
1772 if (code == ARRAY_TYPE)
1775 /* Constants can be used directly unless they're not loadable. */
1776 if (TREE_CODE (exp) == CONST_DECL)
1777 exp = DECL_INITIAL (exp);
1779 /* Strip no-op conversions. */
1781 STRIP_TYPE_NOPS (exp);
1783 if (TREE_NO_WARNING (orig_exp))
1784 TREE_NO_WARNING (exp) = 1;
1786 if (code == VOID_TYPE)
1788 error ("void value not ignored as it ought to be");
1789 return error_mark_node;
1792 exp = require_complete_type (exp);
1793 if (exp == error_mark_node)
1794 return error_mark_node;
1796 if (INTEGRAL_TYPE_P (type))
1797 return perform_integral_promotions (exp);
1802 /* Look up COMPONENT in a structure or union DECL.
1804 If the component name is not found, returns NULL_TREE. Otherwise,
1805 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1806 stepping down the chain to the component, which is in the last
1807 TREE_VALUE of the list. Normally the list is of length one, but if
1808 the component is embedded within (nested) anonymous structures or
1809 unions, the list steps down the chain to the component. */
1812 lookup_field (tree decl, tree component)
1814 tree type = TREE_TYPE (decl);
1817 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1818 to the field elements. Use a binary search on this array to quickly
1819 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1820 will always be set for structures which have many elements. */
1822 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1825 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1827 field = TYPE_FIELDS (type);
1829 top = TYPE_LANG_SPECIFIC (type)->s->len;
1830 while (top - bot > 1)
1832 half = (top - bot + 1) >> 1;
1833 field = field_array[bot+half];
1835 if (DECL_NAME (field) == NULL_TREE)
1837 /* Step through all anon unions in linear fashion. */
1838 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1840 field = field_array[bot++];
1841 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1842 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1844 tree anon = lookup_field (field, component);
1847 return tree_cons (NULL_TREE, field, anon);
1851 /* Entire record is only anon unions. */
1855 /* Restart the binary search, with new lower bound. */
1859 if (DECL_NAME (field) == component)
1861 if (DECL_NAME (field) < component)
1867 if (DECL_NAME (field_array[bot]) == component)
1868 field = field_array[bot];
1869 else if (DECL_NAME (field) != component)
1874 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1876 if (DECL_NAME (field) == NULL_TREE
1877 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1878 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1880 tree anon = lookup_field (field, component);
1883 return tree_cons (NULL_TREE, field, anon);
1886 if (DECL_NAME (field) == component)
1890 if (field == NULL_TREE)
1894 return tree_cons (NULL_TREE, field, NULL_TREE);
1897 /* Make an expression to refer to the COMPONENT field of
1898 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1901 build_component_ref (tree datum, tree component)
1903 tree type = TREE_TYPE (datum);
1904 enum tree_code code = TREE_CODE (type);
1908 if (!objc_is_public (datum, component))
1909 return error_mark_node;
1911 /* See if there is a field or component with name COMPONENT. */
1913 if (code == RECORD_TYPE || code == UNION_TYPE)
1915 if (!COMPLETE_TYPE_P (type))
1917 c_incomplete_type_error (NULL_TREE, type);
1918 return error_mark_node;
1921 field = lookup_field (datum, component);
1925 error ("%qT has no member named %qE", type, component);
1926 return error_mark_node;
1929 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1930 This might be better solved in future the way the C++ front
1931 end does it - by giving the anonymous entities each a
1932 separate name and type, and then have build_component_ref
1933 recursively call itself. We can't do that here. */
1936 tree subdatum = TREE_VALUE (field);
1940 if (TREE_TYPE (subdatum) == error_mark_node)
1941 return error_mark_node;
1943 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1944 quals |= TYPE_QUALS (TREE_TYPE (datum));
1945 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1947 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1949 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1950 TREE_READONLY (ref) = 1;
1951 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1952 TREE_THIS_VOLATILE (ref) = 1;
1954 if (TREE_DEPRECATED (subdatum))
1955 warn_deprecated_use (subdatum);
1959 field = TREE_CHAIN (field);
1965 else if (code != ERROR_MARK)
1966 error ("request for member %qE in something not a structure or union",
1969 return error_mark_node;
1972 /* Given an expression PTR for a pointer, return an expression
1973 for the value pointed to.
1974 ERRORSTRING is the name of the operator to appear in error messages.
1976 LOC is the location to use for the generated tree. */
1979 build_indirect_ref (location_t loc, tree ptr, const char *errorstring)
1981 tree pointer = default_conversion (ptr);
1982 tree type = TREE_TYPE (pointer);
1985 if (TREE_CODE (type) == POINTER_TYPE)
1987 if (CONVERT_EXPR_P (pointer)
1988 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1990 /* If a warning is issued, mark it to avoid duplicates from
1991 the backend. This only needs to be done at
1992 warn_strict_aliasing > 2. */
1993 if (warn_strict_aliasing > 2)
1994 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1995 type, TREE_OPERAND (pointer, 0)))
1996 TREE_NO_WARNING (pointer) = 1;
1999 if (TREE_CODE (pointer) == ADDR_EXPR
2000 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
2001 == TREE_TYPE (type)))
2003 ref = TREE_OPERAND (pointer, 0);
2004 protected_set_expr_location (ref, loc);
2009 tree t = TREE_TYPE (type);
2011 ref = build1 (INDIRECT_REF, t, pointer);
2013 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2015 error_at (loc, "dereferencing pointer to incomplete type");
2016 return error_mark_node;
2018 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2019 warning_at (loc, 0, "dereferencing %<void *%> pointer");
2021 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2022 so that we get the proper error message if the result is used
2023 to assign to. Also, &* is supposed to be a no-op.
2024 And ANSI C seems to specify that the type of the result
2025 should be the const type. */
2026 /* A de-reference of a pointer to const is not a const. It is valid
2027 to change it via some other pointer. */
2028 TREE_READONLY (ref) = TYPE_READONLY (t);
2029 TREE_SIDE_EFFECTS (ref)
2030 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2031 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2032 protected_set_expr_location (ref, loc);
2036 else if (TREE_CODE (pointer) != ERROR_MARK)
2038 "invalid type argument of %qs (have %qT)", errorstring, type);
2039 return error_mark_node;
2042 /* This handles expressions of the form "a[i]", which denotes
2045 This is logically equivalent in C to *(a+i), but we may do it differently.
2046 If A is a variable or a member, we generate a primitive ARRAY_REF.
2047 This avoids forcing the array out of registers, and can work on
2048 arrays that are not lvalues (for example, members of structures returned
2051 LOC is the location to use for the returned expression. */
2054 build_array_ref (tree array, tree index, location_t loc)
2057 bool swapped = false;
2058 if (TREE_TYPE (array) == error_mark_node
2059 || TREE_TYPE (index) == error_mark_node)
2060 return error_mark_node;
2062 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2063 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2066 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2067 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2069 error_at (loc, "subscripted value is neither array nor pointer");
2070 return error_mark_node;
2078 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2080 error_at (loc, "array subscript is not an integer");
2081 return error_mark_node;
2084 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2086 error_at (loc, "subscripted value is pointer to function");
2087 return error_mark_node;
2090 /* ??? Existing practice has been to warn only when the char
2091 index is syntactically the index, not for char[array]. */
2093 warn_array_subscript_with_type_char (index);
2095 /* Apply default promotions *after* noticing character types. */
2096 index = default_conversion (index);
2098 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2100 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2104 /* An array that is indexed by a non-constant
2105 cannot be stored in a register; we must be able to do
2106 address arithmetic on its address.
2107 Likewise an array of elements of variable size. */
2108 if (TREE_CODE (index) != INTEGER_CST
2109 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2110 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2112 if (!c_mark_addressable (array))
2113 return error_mark_node;
2115 /* An array that is indexed by a constant value which is not within
2116 the array bounds cannot be stored in a register either; because we
2117 would get a crash in store_bit_field/extract_bit_field when trying
2118 to access a non-existent part of the register. */
2119 if (TREE_CODE (index) == INTEGER_CST
2120 && TYPE_DOMAIN (TREE_TYPE (array))
2121 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2123 if (!c_mark_addressable (array))
2124 return error_mark_node;
2130 while (TREE_CODE (foo) == COMPONENT_REF)
2131 foo = TREE_OPERAND (foo, 0);
2132 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2133 pedwarn (loc, OPT_pedantic,
2134 "ISO C forbids subscripting %<register%> array");
2135 else if (!flag_isoc99 && !lvalue_p (foo))
2136 pedwarn (loc, OPT_pedantic,
2137 "ISO C90 forbids subscripting non-lvalue array");
2140 type = TREE_TYPE (TREE_TYPE (array));
2141 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2142 /* Array ref is const/volatile if the array elements are
2143 or if the array is. */
2144 TREE_READONLY (rval)
2145 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2146 | TREE_READONLY (array));
2147 TREE_SIDE_EFFECTS (rval)
2148 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2149 | TREE_SIDE_EFFECTS (array));
2150 TREE_THIS_VOLATILE (rval)
2151 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2152 /* This was added by rms on 16 Nov 91.
2153 It fixes vol struct foo *a; a->elts[1]
2154 in an inline function.
2155 Hope it doesn't break something else. */
2156 | TREE_THIS_VOLATILE (array));
2157 ret = require_complete_type (rval);
2158 protected_set_expr_location (ret, loc);
2163 tree ar = default_conversion (array);
2165 if (ar == error_mark_node)
2168 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2169 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2171 return build_indirect_ref
2172 (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2177 /* Build an external reference to identifier ID. FUN indicates
2178 whether this will be used for a function call. LOC is the source
2179 location of the identifier. */
2181 build_external_ref (tree id, int fun, location_t loc)
2184 tree decl = lookup_name (id);
2186 /* In Objective-C, an instance variable (ivar) may be preferred to
2187 whatever lookup_name() found. */
2188 decl = objc_lookup_ivar (decl, id);
2190 if (decl && decl != error_mark_node)
2193 /* Implicit function declaration. */
2194 ref = implicitly_declare (id);
2195 else if (decl == error_mark_node)
2196 /* Don't complain about something that's already been
2197 complained about. */
2198 return error_mark_node;
2201 undeclared_variable (id, loc);
2202 return error_mark_node;
2205 if (TREE_TYPE (ref) == error_mark_node)
2206 return error_mark_node;
2208 if (TREE_DEPRECATED (ref))
2209 warn_deprecated_use (ref);
2211 /* Recursive call does not count as usage. */
2212 if (ref != current_function_decl)
2214 TREE_USED (ref) = 1;
2217 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2219 if (!in_sizeof && !in_typeof)
2220 C_DECL_USED (ref) = 1;
2221 else if (DECL_INITIAL (ref) == 0
2222 && DECL_EXTERNAL (ref)
2223 && !TREE_PUBLIC (ref))
2224 record_maybe_used_decl (ref);
2227 if (TREE_CODE (ref) == CONST_DECL)
2229 used_types_insert (TREE_TYPE (ref));
2230 ref = DECL_INITIAL (ref);
2231 TREE_CONSTANT (ref) = 1;
2233 else if (current_function_decl != 0
2234 && !DECL_FILE_SCOPE_P (current_function_decl)
2235 && (TREE_CODE (ref) == VAR_DECL
2236 || TREE_CODE (ref) == PARM_DECL
2237 || TREE_CODE (ref) == FUNCTION_DECL))
2239 tree context = decl_function_context (ref);
2241 if (context != 0 && context != current_function_decl)
2242 DECL_NONLOCAL (ref) = 1;
2244 /* C99 6.7.4p3: An inline definition of a function with external
2245 linkage ... shall not contain a reference to an identifier with
2246 internal linkage. */
2247 else if (current_function_decl != 0
2248 && DECL_DECLARED_INLINE_P (current_function_decl)
2249 && DECL_EXTERNAL (current_function_decl)
2250 && VAR_OR_FUNCTION_DECL_P (ref)
2251 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2252 && ! TREE_PUBLIC (ref)
2253 && DECL_CONTEXT (ref) != current_function_decl)
2254 pedwarn (loc, 0, "%qD is static but used in inline function %qD "
2255 "which is not static", ref, current_function_decl);
2260 /* Record details of decls possibly used inside sizeof or typeof. */
2261 struct maybe_used_decl
2265 /* The level seen at (in_sizeof + in_typeof). */
2267 /* The next one at this level or above, or NULL. */
2268 struct maybe_used_decl *next;
2271 static struct maybe_used_decl *maybe_used_decls;
2273 /* Record that DECL, an undefined static function reference seen
2274 inside sizeof or typeof, might be used if the operand of sizeof is
2275 a VLA type or the operand of typeof is a variably modified
2279 record_maybe_used_decl (tree decl)
2281 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2283 t->level = in_sizeof + in_typeof;
2284 t->next = maybe_used_decls;
2285 maybe_used_decls = t;
2288 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2289 USED is false, just discard them. If it is true, mark them used
2290 (if no longer inside sizeof or typeof) or move them to the next
2291 level up (if still inside sizeof or typeof). */
2294 pop_maybe_used (bool used)
2296 struct maybe_used_decl *p = maybe_used_decls;
2297 int cur_level = in_sizeof + in_typeof;
2298 while (p && p->level > cur_level)
2303 C_DECL_USED (p->decl) = 1;
2305 p->level = cur_level;
2309 if (!used || cur_level == 0)
2310 maybe_used_decls = p;
2313 /* Return the result of sizeof applied to EXPR. */
2316 c_expr_sizeof_expr (struct c_expr expr)
2319 if (expr.value == error_mark_node)
2321 ret.value = error_mark_node;
2322 ret.original_code = ERROR_MARK;
2323 pop_maybe_used (false);
2327 bool expr_const_operands = true;
2328 tree folded_expr = c_fully_fold (expr.value, require_constant_value,
2329 &expr_const_operands);
2330 ret.value = c_sizeof (TREE_TYPE (folded_expr));
2331 ret.original_code = ERROR_MARK;
2332 if (c_vla_type_p (TREE_TYPE (folded_expr)))
2334 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2335 ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2336 folded_expr, ret.value);
2337 C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !expr_const_operands;
2339 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (folded_expr)));
2344 /* Return the result of sizeof applied to T, a structure for the type
2345 name passed to sizeof (rather than the type itself). */
2348 c_expr_sizeof_type (struct c_type_name *t)
2352 tree type_expr = NULL_TREE;
2353 bool type_expr_const = true;
2354 type = groktypename (t, &type_expr, &type_expr_const);
2355 ret.value = c_sizeof (type);
2356 ret.original_code = ERROR_MARK;
2357 if (type_expr && c_vla_type_p (type))
2359 ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2360 type_expr, ret.value);
2361 C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !type_expr_const;
2363 pop_maybe_used (type != error_mark_node
2364 ? C_TYPE_VARIABLE_SIZE (type) : false);
2368 /* Build a function call to function FUNCTION with parameters PARAMS.
2369 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2370 TREE_VALUE of each node is a parameter-expression.
2371 FUNCTION's data type may be a function type or a pointer-to-function. */
2374 build_function_call (tree function, tree params)
2376 tree fntype, fundecl = 0;
2377 tree name = NULL_TREE, result;
2383 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2384 STRIP_TYPE_NOPS (function);
2386 /* Convert anything with function type to a pointer-to-function. */
2387 if (TREE_CODE (function) == FUNCTION_DECL)
2389 /* Implement type-directed function overloading for builtins.
2390 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2391 handle all the type checking. The result is a complete expression
2392 that implements this function call. */
2393 tem = resolve_overloaded_builtin (function, params);
2397 name = DECL_NAME (function);
2400 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2401 function = function_to_pointer_conversion (function);
2403 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2404 expressions, like those used for ObjC messenger dispatches. */
2405 function = objc_rewrite_function_call (function, params);
2407 function = c_fully_fold (function, false, NULL);
2409 fntype = TREE_TYPE (function);
2411 if (TREE_CODE (fntype) == ERROR_MARK)
2412 return error_mark_node;
2414 if (!(TREE_CODE (fntype) == POINTER_TYPE
2415 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2417 error ("called object %qE is not a function", function);
2418 return error_mark_node;
2421 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2422 current_function_returns_abnormally = 1;
2424 /* fntype now gets the type of function pointed to. */
2425 fntype = TREE_TYPE (fntype);
2427 /* Convert the parameters to the types declared in the
2428 function prototype, or apply default promotions. */
2430 nargs = list_length (params);
2431 argarray = (tree *) alloca (nargs * sizeof (tree));
2432 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2433 params, function, fundecl);
2435 return error_mark_node;
2437 /* Check that the function is called through a compatible prototype.
2438 If it is not, replace the call by a trap, wrapped up in a compound
2439 expression if necessary. This has the nice side-effect to prevent
2440 the tree-inliner from generating invalid assignment trees which may
2441 blow up in the RTL expander later. */
2442 if (CONVERT_EXPR_P (function)
2443 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2444 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2445 && !comptypes (fntype, TREE_TYPE (tem)))
2447 tree return_type = TREE_TYPE (fntype);
2448 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2452 /* This situation leads to run-time undefined behavior. We can't,
2453 therefore, simply error unless we can prove that all possible
2454 executions of the program must execute the code. */
2455 if (warning (0, "function called through a non-compatible type"))
2456 /* We can, however, treat "undefined" any way we please.
2457 Call abort to encourage the user to fix the program. */
2458 inform (input_location, "if this code is reached, the program will abort");
2459 /* Before the abort, allow the function arguments to exit or
2461 for (i = 0; i < nargs; i++)
2462 trap = build2 (COMPOUND_EXPR, void_type_node, argarray[i], trap);
2464 if (VOID_TYPE_P (return_type))
2470 if (AGGREGATE_TYPE_P (return_type))
2471 rhs = build_compound_literal (return_type,
2472 build_constructor (return_type, 0),
2475 rhs = fold_convert (return_type, integer_zero_node);
2477 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2481 /* Check that arguments to builtin functions match the expectations. */
2483 && DECL_BUILT_IN (fundecl)
2484 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2485 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2486 return error_mark_node;
2488 /* Check that the arguments to the function are valid. */
2489 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2490 TYPE_ARG_TYPES (fntype));
2492 if (name != NULL_TREE
2493 && !strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10))
2495 if (require_constant_value)
2496 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2497 function, nargs, argarray);
2499 result = fold_build_call_array (TREE_TYPE (fntype),
2500 function, nargs, argarray);
2501 if (TREE_CODE (result) == NOP_EXPR
2502 && TREE_CODE (TREE_OPERAND (result, 0)) == INTEGER_CST)
2503 STRIP_TYPE_NOPS (result);
2506 result = build_call_array (TREE_TYPE (fntype),
2507 function, nargs, argarray);
2509 if (VOID_TYPE_P (TREE_TYPE (result)))
2511 return require_complete_type (result);
2514 /* Convert the argument expressions in the list VALUES
2515 to the types in the list TYPELIST. The resulting arguments are
2516 stored in the array ARGARRAY which has size NARGS.
2518 If TYPELIST is exhausted, or when an element has NULL as its type,
2519 perform the default conversions.
2521 PARMLIST is the chain of parm decls for the function being called.
2522 It may be 0, if that info is not available.
2523 It is used only for generating error messages.
2525 FUNCTION is a tree for the called function. It is used only for
2526 error messages, where it is formatted with %qE.
2528 This is also where warnings about wrong number of args are generated.
2530 VALUES is a chain of TREE_LIST nodes with the elements of the list
2531 in the TREE_VALUE slots of those nodes.
2533 Returns the actual number of arguments processed (which may be less
2534 than NARGS in some error situations), or -1 on failure. */
2537 convert_arguments (int nargs, tree *argarray,
2538 tree typelist, tree values, tree function, tree fundecl)
2540 tree typetail, valtail;
2542 const bool type_generic = fundecl
2543 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2546 /* Change pointer to function to the function itself for
2548 if (TREE_CODE (function) == ADDR_EXPR
2549 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2550 function = TREE_OPERAND (function, 0);
2552 /* Handle an ObjC selector specially for diagnostics. */
2553 selector = objc_message_selector ();
2555 /* Scan the given expressions and types, producing individual
2556 converted arguments and storing them in ARGARRAY. */
2558 for (valtail = values, typetail = typelist, parmnum = 0;
2560 valtail = TREE_CHAIN (valtail), parmnum++)
2562 tree type = typetail ? TREE_VALUE (typetail) : 0;
2563 tree val = TREE_VALUE (valtail);
2564 tree rname = function;
2565 int argnum = parmnum + 1;
2566 const char *invalid_func_diag;
2569 if (type == void_type_node)
2571 error ("too many arguments to function %qE", function);
2575 if (selector && argnum > 2)
2581 npc = null_pointer_constant_p (val);
2582 val = c_fully_fold (val, false, NULL);
2583 STRIP_TYPE_NOPS (val);
2585 val = require_complete_type (val);
2589 /* Formal parm type is specified by a function prototype. */
2592 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2594 error ("type of formal parameter %d is incomplete", parmnum + 1);
2599 /* Optionally warn about conversions that
2600 differ from the default conversions. */
2601 if (warn_traditional_conversion || warn_traditional)
2603 unsigned int formal_prec = TYPE_PRECISION (type);
2605 if (INTEGRAL_TYPE_P (type)
2606 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2607 warning (0, "passing argument %d of %qE as integer "
2608 "rather than floating due to prototype",
2610 if (INTEGRAL_TYPE_P (type)
2611 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2612 warning (0, "passing argument %d of %qE as integer "
2613 "rather than complex due to prototype",
2615 else if (TREE_CODE (type) == COMPLEX_TYPE
2616 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2617 warning (0, "passing argument %d of %qE as complex "
2618 "rather than floating due to prototype",
2620 else if (TREE_CODE (type) == REAL_TYPE
2621 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2622 warning (0, "passing argument %d of %qE as floating "
2623 "rather than integer due to prototype",
2625 else if (TREE_CODE (type) == COMPLEX_TYPE
2626 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2627 warning (0, "passing argument %d of %qE as complex "
2628 "rather than integer due to prototype",
2630 else if (TREE_CODE (type) == REAL_TYPE
2631 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2632 warning (0, "passing argument %d of %qE as floating "
2633 "rather than complex due to prototype",
2635 /* ??? At some point, messages should be written about
2636 conversions between complex types, but that's too messy
2638 else if (TREE_CODE (type) == REAL_TYPE
2639 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2641 /* Warn if any argument is passed as `float',
2642 since without a prototype it would be `double'. */
2643 if (formal_prec == TYPE_PRECISION (float_type_node)
2644 && type != dfloat32_type_node)
2645 warning (0, "passing argument %d of %qE as %<float%> "
2646 "rather than %<double%> due to prototype",
2649 /* Warn if mismatch between argument and prototype
2650 for decimal float types. Warn of conversions with
2651 binary float types and of precision narrowing due to
2653 else if (type != TREE_TYPE (val)
2654 && (type == dfloat32_type_node
2655 || type == dfloat64_type_node
2656 || type == dfloat128_type_node
2657 || TREE_TYPE (val) == dfloat32_type_node
2658 || TREE_TYPE (val) == dfloat64_type_node
2659 || TREE_TYPE (val) == dfloat128_type_node)
2661 <= TYPE_PRECISION (TREE_TYPE (val))
2662 || (type == dfloat128_type_node
2664 != dfloat64_type_node
2666 != dfloat32_type_node)))
2667 || (type == dfloat64_type_node
2669 != dfloat32_type_node))))
2670 warning (0, "passing argument %d of %qE as %qT "
2671 "rather than %qT due to prototype",
2672 argnum, rname, type, TREE_TYPE (val));
2675 /* Detect integer changing in width or signedness.
2676 These warnings are only activated with
2677 -Wtraditional-conversion, not with -Wtraditional. */
2678 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2679 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2681 tree would_have_been = default_conversion (val);
2682 tree type1 = TREE_TYPE (would_have_been);
2684 if (TREE_CODE (type) == ENUMERAL_TYPE
2685 && (TYPE_MAIN_VARIANT (type)
2686 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2687 /* No warning if function asks for enum
2688 and the actual arg is that enum type. */
2690 else if (formal_prec != TYPE_PRECISION (type1))
2691 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2692 "with different width due to prototype",
2694 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2696 /* Don't complain if the formal parameter type
2697 is an enum, because we can't tell now whether
2698 the value was an enum--even the same enum. */
2699 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2701 else if (TREE_CODE (val) == INTEGER_CST
2702 && int_fits_type_p (val, type))
2703 /* Change in signedness doesn't matter
2704 if a constant value is unaffected. */
2706 /* If the value is extended from a narrower
2707 unsigned type, it doesn't matter whether we
2708 pass it as signed or unsigned; the value
2709 certainly is the same either way. */
2710 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2711 && TYPE_UNSIGNED (TREE_TYPE (val)))
2713 else if (TYPE_UNSIGNED (type))
2714 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2715 "as unsigned due to prototype",
2718 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2719 "as signed due to prototype", argnum, rname);
2723 parmval = convert_for_assignment (type, val, ic_argpass, npc,
2727 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2728 && INTEGRAL_TYPE_P (type)
2729 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2730 parmval = default_conversion (parmval);
2732 argarray[parmnum] = parmval;
2734 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2735 && (TYPE_PRECISION (TREE_TYPE (val))
2736 < TYPE_PRECISION (double_type_node))
2737 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2740 argarray[parmnum] = val;
2742 /* Convert `float' to `double'. */
2743 argarray[parmnum] = convert (double_type_node, val);
2745 else if ((invalid_func_diag =
2746 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2748 error (invalid_func_diag);
2752 /* Convert `short' and `char' to full-size `int'. */
2753 argarray[parmnum] = default_conversion (val);
2756 typetail = TREE_CHAIN (typetail);
2759 gcc_assert (parmnum == nargs);
2761 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2763 error ("too few arguments to function %qE", function);
2770 /* This is the entry point used by the parser to build unary operators
2771 in the input. CODE, a tree_code, specifies the unary operator, and
2772 ARG is the operand. For unary plus, the C parser currently uses
2773 CONVERT_EXPR for code.
2775 LOC is the location to use for the tree generated.
2779 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2781 struct c_expr result;
2783 result.value = build_unary_op (loc, code, arg.value, 0);
2784 result.original_code = code;
2786 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2787 overflow_warning (result.value);
2792 /* This is the entry point used by the parser to build binary operators
2793 in the input. CODE, a tree_code, specifies the binary operator, and
2794 ARG1 and ARG2 are the operands. In addition to constructing the
2795 expression, we check for operands that were written with other binary
2796 operators in a way that is likely to confuse the user.
2798 LOCATION is the location of the binary operator. */
2801 parser_build_binary_op (location_t location, enum tree_code code,
2802 struct c_expr arg1, struct c_expr arg2)
2804 struct c_expr result;
2806 enum tree_code code1 = arg1.original_code;
2807 enum tree_code code2 = arg2.original_code;
2809 result.value = build_binary_op (location, code,
2810 arg1.value, arg2.value, 1);
2811 result.original_code = code;
2813 if (TREE_CODE (result.value) == ERROR_MARK)
2816 if (location != UNKNOWN_LOCATION)
2817 protected_set_expr_location (result.value, location);
2819 /* Check for cases such as x+y<<z which users are likely
2821 if (warn_parentheses)
2822 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2824 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2825 warn_logical_operator (code, arg1.value, arg2.value);
2827 /* Warn about comparisons against string literals, with the exception
2828 of testing for equality or inequality of a string literal with NULL. */
2829 if (code == EQ_EXPR || code == NE_EXPR)
2831 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2832 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2833 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2835 else if (TREE_CODE_CLASS (code) == tcc_comparison
2836 && (code1 == STRING_CST || code2 == STRING_CST))
2837 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2839 if (TREE_OVERFLOW_P (result.value)
2840 && !TREE_OVERFLOW_P (arg1.value)
2841 && !TREE_OVERFLOW_P (arg2.value))
2842 overflow_warning (result.value);
2847 /* Return a tree for the difference of pointers OP0 and OP1.
2848 The resulting tree has type int. */
2851 pointer_diff (tree op0, tree op1)
2853 tree restype = ptrdiff_type_node;
2855 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2856 tree con0, con1, lit0, lit1;
2857 tree orig_op1 = op1;
2859 if (TREE_CODE (target_type) == VOID_TYPE)
2860 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2861 "pointer of type %<void *%> used in subtraction");
2862 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2863 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2864 "pointer to a function used in subtraction");
2866 /* If the conversion to ptrdiff_type does anything like widening or
2867 converting a partial to an integral mode, we get a convert_expression
2868 that is in the way to do any simplifications.
2869 (fold-const.c doesn't know that the extra bits won't be needed.
2870 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2871 different mode in place.)
2872 So first try to find a common term here 'by hand'; we want to cover
2873 at least the cases that occur in legal static initializers. */
2874 if (CONVERT_EXPR_P (op0)
2875 && (TYPE_PRECISION (TREE_TYPE (op0))
2876 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2877 con0 = TREE_OPERAND (op0, 0);
2880 if (CONVERT_EXPR_P (op1)
2881 && (TYPE_PRECISION (TREE_TYPE (op1))
2882 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2883 con1 = TREE_OPERAND (op1, 0);
2887 if (TREE_CODE (con0) == PLUS_EXPR)
2889 lit0 = TREE_OPERAND (con0, 1);
2890 con0 = TREE_OPERAND (con0, 0);
2893 lit0 = integer_zero_node;
2895 if (TREE_CODE (con1) == PLUS_EXPR)
2897 lit1 = TREE_OPERAND (con1, 1);
2898 con1 = TREE_OPERAND (con1, 0);
2901 lit1 = integer_zero_node;
2903 if (operand_equal_p (con0, con1, 0))
2910 /* First do the subtraction as integers;
2911 then drop through to build the divide operator.
2912 Do not do default conversions on the minus operator
2913 in case restype is a short type. */
2915 op0 = build_binary_op (input_location,
2916 MINUS_EXPR, convert (restype, op0),
2917 convert (restype, op1), 0);
2918 /* This generates an error if op1 is pointer to incomplete type. */
2919 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2920 error ("arithmetic on pointer to an incomplete type");
2922 /* This generates an error if op0 is pointer to incomplete type. */
2923 op1 = c_size_in_bytes (target_type);
2925 /* Divide by the size, in easiest possible way. */
2926 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2929 /* Construct and perhaps optimize a tree representation
2930 for a unary operation. CODE, a tree_code, specifies the operation
2931 and XARG is the operand.
2932 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2933 the default promotions (such as from short to int).
2934 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2935 allows non-lvalues; this is only used to handle conversion of non-lvalue
2936 arrays to pointers in C99.
2938 LOCATION is the location of the operator. */
2941 build_unary_op (location_t location,
2942 enum tree_code code, tree xarg, int flag)
2944 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2947 enum tree_code typecode;
2949 tree ret = error_mark_node;
2950 int noconvert = flag;
2951 const char *invalid_op_diag;
2954 int_operands = EXPR_INT_CONST_OPERANDS (xarg);
2956 if (code != ADDR_EXPR)
2957 arg = require_complete_type (arg);
2959 typecode = TREE_CODE (TREE_TYPE (arg));
2960 if (typecode == ERROR_MARK)
2961 return error_mark_node;
2962 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2963 typecode = INTEGER_TYPE;
2965 if ((invalid_op_diag
2966 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2968 error_at (location, invalid_op_diag);
2969 return error_mark_node;
2975 /* This is used for unary plus, because a CONVERT_EXPR
2976 is enough to prevent anybody from looking inside for
2977 associativity, but won't generate any code. */
2978 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2979 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2980 || typecode == VECTOR_TYPE))
2982 error_at (location, "wrong type argument to unary plus");
2983 return error_mark_node;
2985 else if (!noconvert)
2986 arg = default_conversion (arg);
2987 arg = non_lvalue (arg);
2991 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2992 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2993 || typecode == VECTOR_TYPE))
2995 error_at (location, "wrong type argument to unary minus");
2996 return error_mark_node;
2998 else if (!noconvert)
2999 arg = default_conversion (arg);
3003 /* ~ works on integer types and non float vectors. */
3004 if (typecode == INTEGER_TYPE
3005 || (typecode == VECTOR_TYPE
3006 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
3009 arg = default_conversion (arg);
3011 else if (typecode == COMPLEX_TYPE)
3014 pedwarn (location, OPT_pedantic,
3015 "ISO C does not support %<~%> for complex conjugation");
3017 arg = default_conversion (arg);
3021 error_at (location, "wrong type argument to bit-complement");
3022 return error_mark_node;
3027 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3029 error_at (location, "wrong type argument to abs");
3030 return error_mark_node;
3032 else if (!noconvert)
3033 arg = default_conversion (arg);
3037 /* Conjugating a real value is a no-op, but allow it anyway. */
3038 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3039 || typecode == COMPLEX_TYPE))
3041 error_at (location, "wrong type argument to conjugation");
3042 return error_mark_node;
3044 else if (!noconvert)
3045 arg = default_conversion (arg);
3048 case TRUTH_NOT_EXPR:
3049 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3050 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3051 && typecode != COMPLEX_TYPE)
3054 "wrong type argument to unary exclamation mark");
3055 return error_mark_node;
3057 arg = c_objc_common_truthvalue_conversion (location, arg);
3058 ret = invert_truthvalue (arg);
3059 goto return_build_unary_op;
3062 if (TREE_CODE (arg) == COMPLEX_CST)
3063 ret = TREE_REALPART (arg);
3064 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3065 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3068 goto return_build_unary_op;
3071 if (TREE_CODE (arg) == COMPLEX_CST)
3072 ret = TREE_IMAGPART (arg);
3073 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3074 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3076 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3077 goto return_build_unary_op;
3079 case PREINCREMENT_EXPR:
3080 case POSTINCREMENT_EXPR:
3081 case PREDECREMENT_EXPR:
3082 case POSTDECREMENT_EXPR:
3084 if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3086 tree inner = build_unary_op (location, code,
3087 C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3088 if (inner == error_mark_node)
3089 return error_mark_node;
3090 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3091 C_MAYBE_CONST_EXPR_PRE (arg), inner);
3092 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3093 C_MAYBE_CONST_EXPR_NON_CONST (ret) = 1;
3094 goto return_build_unary_op;
3097 /* Complain about anything that is not a true lvalue. */
3098 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3099 || code == POSTINCREMENT_EXPR)
3102 return error_mark_node;
3104 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3105 arg = c_fully_fold (arg, false, NULL);
3107 /* Increment or decrement the real part of the value,
3108 and don't change the imaginary part. */
3109 if (typecode == COMPLEX_TYPE)
3113 pedwarn (location, OPT_pedantic,
3114 "ISO C does not support %<++%> and %<--%> on complex types");
3116 arg = stabilize_reference (arg);
3117 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3118 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3119 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3120 if (real == error_mark_node || imag == error_mark_node)
3121 return error_mark_node;
3122 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3124 goto return_build_unary_op;
3127 /* Report invalid types. */
3129 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3130 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3132 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3133 error_at (location, "wrong type argument to increment");
3135 error_at (location, "wrong type argument to decrement");
3137 return error_mark_node;
3143 argtype = TREE_TYPE (arg);
3145 /* Compute the increment. */
3147 if (typecode == POINTER_TYPE)
3149 /* If pointer target is an undefined struct,
3150 we just cannot know how to do the arithmetic. */
3151 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3153 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3155 "increment of pointer to unknown structure");
3158 "decrement of pointer to unknown structure");
3160 else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3161 || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3163 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3164 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3165 "wrong type argument to increment");
3167 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3168 "wrong type argument to decrement");
3171 inc = c_size_in_bytes (TREE_TYPE (argtype));
3172 inc = fold_convert (sizetype, inc);
3174 else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3176 /* For signed fract types, we invert ++ to -- or
3177 -- to ++, and change inc from 1 to -1, because
3178 it is not possible to represent 1 in signed fract constants.
3179 For unsigned fract types, the result always overflows and
3180 we get an undefined (original) or the maximum value. */
3181 if (code == PREINCREMENT_EXPR)
3182 code = PREDECREMENT_EXPR;
3183 else if (code == PREDECREMENT_EXPR)
3184 code = PREINCREMENT_EXPR;
3185 else if (code == POSTINCREMENT_EXPR)
3186 code = POSTDECREMENT_EXPR;
3187 else /* code == POSTDECREMENT_EXPR */
3188 code = POSTINCREMENT_EXPR;
3190 inc = integer_minus_one_node;
3191 inc = convert (argtype, inc);
3195 inc = integer_one_node;
3196 inc = convert (argtype, inc);
3199 /* Report a read-only lvalue. */
3200 if (TREE_READONLY (arg))
3202 readonly_error (arg,
3203 ((code == PREINCREMENT_EXPR
3204 || code == POSTINCREMENT_EXPR)
3205 ? lv_increment : lv_decrement));
3206 return error_mark_node;
3209 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3210 val = boolean_increment (code, arg);
3212 val = build2 (code, TREE_TYPE (arg), arg, inc);
3213 TREE_SIDE_EFFECTS (val) = 1;
3214 if (TREE_CODE (val) != code)
3215 TREE_NO_WARNING (val) = 1;
3217 goto return_build_unary_op;
3221 /* Note that this operation never does default_conversion. */
3223 /* Let &* cancel out to simplify resulting code. */
3224 if (TREE_CODE (arg) == INDIRECT_REF)
3226 /* Don't let this be an lvalue. */
3227 if (lvalue_p (TREE_OPERAND (arg, 0)))
3228 return non_lvalue (TREE_OPERAND (arg, 0));
3229 ret = TREE_OPERAND (arg, 0);
3230 goto return_build_unary_op;
3233 /* For &x[y], return x+y */
3234 if (TREE_CODE (arg) == ARRAY_REF)
3236 tree op0 = TREE_OPERAND (arg, 0);
3237 if (!c_mark_addressable (op0))
3238 return error_mark_node;
3239 return build_binary_op (location, PLUS_EXPR,
3240 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3241 ? array_to_pointer_conversion (op0)
3243 TREE_OPERAND (arg, 1), 1);
3246 /* Anything not already handled and not a true memory reference
3247 or a non-lvalue array is an error. */
3248 else if (typecode != FUNCTION_TYPE && !flag
3249 && !lvalue_or_else (arg, lv_addressof))
3250 return error_mark_node;
3252 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3254 if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3256 tree inner = build_unary_op (location, code,
3257 C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3258 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3259 C_MAYBE_CONST_EXPR_PRE (arg), inner);
3260 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3261 C_MAYBE_CONST_EXPR_NON_CONST (ret)
3262 = C_MAYBE_CONST_EXPR_NON_CONST (arg);
3263 goto return_build_unary_op;
3266 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3267 argtype = TREE_TYPE (arg);
3269 /* If the lvalue is const or volatile, merge that into the type
3270 to which the address will point. Note that you can't get a
3271 restricted pointer by taking the address of something, so we
3272 only have to deal with `const' and `volatile' here. */
3273 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3274 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3275 argtype = c_build_type_variant (argtype,
3276 TREE_READONLY (arg),
3277 TREE_THIS_VOLATILE (arg));
3279 if (!c_mark_addressable (arg))
3280 return error_mark_node;
3282 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3283 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3285 argtype = build_pointer_type (argtype);
3287 /* ??? Cope with user tricks that amount to offsetof. Delete this
3288 when we have proper support for integer constant expressions. */
3289 val = get_base_address (arg);
3290 if (val && TREE_CODE (val) == INDIRECT_REF
3291 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3293 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3295 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3296 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3297 goto return_build_unary_op;
3300 val = build1 (ADDR_EXPR, argtype, arg);
3303 goto return_build_unary_op;
3310 argtype = TREE_TYPE (arg);
3311 if (TREE_CODE (arg) == INTEGER_CST)
3312 ret = (require_constant_value
3313 ? fold_build1_initializer (code, argtype, arg)
3314 : fold_build1 (code, argtype, arg));
3316 ret = build1 (code, argtype, arg);
3317 return_build_unary_op:
3318 gcc_assert (ret != error_mark_node);
3319 if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret)
3320 && !(TREE_CODE (xarg) == INTEGER_CST && !TREE_OVERFLOW (xarg)))
3321 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
3322 else if (TREE_CODE (ret) != INTEGER_CST && int_operands)
3323 ret = note_integer_operands (ret);
3324 protected_set_expr_location (ret, location);
3328 /* Return nonzero if REF is an lvalue valid for this language.
3329 Lvalues can be assigned, unless their type has TYPE_READONLY.
3330 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3333 lvalue_p (const_tree ref)
3335 const enum tree_code code = TREE_CODE (ref);
3342 return lvalue_p (TREE_OPERAND (ref, 0));
3344 case C_MAYBE_CONST_EXPR:
3345 return lvalue_p (TREE_OPERAND (ref, 1));
3347 case COMPOUND_LITERAL_EXPR:
3357 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3358 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3361 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3368 /* Give an error for storing in something that is 'const'. */
3371 readonly_error (tree arg, enum lvalue_use use)
3373 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3375 /* Using this macro rather than (for example) arrays of messages
3376 ensures that all the format strings are checked at compile
3378 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3379 : (use == lv_increment ? (I) \
3380 : (use == lv_decrement ? (D) : (AS))))
3381 if (TREE_CODE (arg) == COMPONENT_REF)
3383 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3384 readonly_error (TREE_OPERAND (arg, 0), use);
3386 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3387 G_("increment of read-only member %qD"),
3388 G_("decrement of read-only member %qD"),
3389 G_("read-only member %qD used as %<asm%> output")),
3390 TREE_OPERAND (arg, 1));
3392 else if (TREE_CODE (arg) == VAR_DECL)
3393 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3394 G_("increment of read-only variable %qD"),
3395 G_("decrement of read-only variable %qD"),
3396 G_("read-only variable %qD used as %<asm%> output")),
3399 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3400 G_("increment of read-only location %qE"),
3401 G_("decrement of read-only location %qE"),
3402 G_("read-only location %qE used as %<asm%> output")),
3407 /* Return nonzero if REF is an lvalue valid for this language;
3408 otherwise, print an error message and return zero. USE says
3409 how the lvalue is being used and so selects the error message. */
3412 lvalue_or_else (const_tree ref, enum lvalue_use use)
3414 int win = lvalue_p (ref);
3422 /* Mark EXP saying that we need to be able to take the
3423 address of it; it should not be allocated in a register.
3424 Returns true if successful. */
3427 c_mark_addressable (tree exp)
3432 switch (TREE_CODE (x))
3435 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3438 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3442 /* ... fall through ... */
3448 x = TREE_OPERAND (x, 0);
3451 case COMPOUND_LITERAL_EXPR:
3453 TREE_ADDRESSABLE (x) = 1;
3460 if (C_DECL_REGISTER (x)
3461 && DECL_NONLOCAL (x))
3463 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3466 ("global register variable %qD used in nested function", x);
3469 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3471 else if (C_DECL_REGISTER (x))
3473 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3474 error ("address of global register variable %qD requested", x);
3476 error ("address of register variable %qD requested", x);
3482 TREE_ADDRESSABLE (x) = 1;
3489 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
3490 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
3491 if folded to an integer constant then the unselected half may
3492 contain arbitrary operations not normally permitted in constant
3496 build_conditional_expr (tree ifexp, bool ifexp_bcp, tree op1, tree op2)
3500 enum tree_code code1;
3501 enum tree_code code2;
3502 tree result_type = NULL;
3503 tree orig_op1 = op1, orig_op2 = op2;
3504 bool int_const, op1_int_operands, op2_int_operands, int_operands;
3508 /* Promote both alternatives. */
3510 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3511 op1 = default_conversion (op1);
3512 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3513 op2 = default_conversion (op2);
3515 if (TREE_CODE (ifexp) == ERROR_MARK
3516 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3517 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3518 return error_mark_node;
3520 type1 = TREE_TYPE (op1);
3521 code1 = TREE_CODE (type1);
3522 type2 = TREE_TYPE (op2);
3523 code2 = TREE_CODE (type2);
3525 /* C90 does not permit non-lvalue arrays in conditional expressions.
3526 In C99 they will be pointers by now. */
3527 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3529 error ("non-lvalue array in conditional expression");
3530 return error_mark_node;
3533 objc_ok = objc_compare_types (type1, type2, -3, NULL_TREE);
3535 /* Quickly detect the usual case where op1 and op2 have the same type
3537 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3540 result_type = type1;
3542 result_type = TYPE_MAIN_VARIANT (type1);
3544 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3545 || code1 == COMPLEX_TYPE)
3546 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3547 || code2 == COMPLEX_TYPE))
3549 result_type = c_common_type (type1, type2);
3551 /* If -Wsign-compare, warn here if type1 and type2 have
3552 different signedness. We'll promote the signed to unsigned
3553 and later code won't know it used to be different.
3554 Do this check on the original types, so that explicit casts
3555 will be considered, but default promotions won't. */
3556 if (!skip_evaluation)
3558 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3559 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3561 if (unsigned_op1 ^ unsigned_op2)
3565 /* Do not warn if the result type is signed, since the
3566 signed type will only be chosen if it can represent
3567 all the values of the unsigned type. */
3568 if (!TYPE_UNSIGNED (result_type))
3572 bool op1_maybe_const = true;
3573 bool op2_maybe_const = true;
3575 /* Do not warn if the signed quantity is an
3576 unsuffixed integer literal (or some static
3577 constant expression involving such literals) and
3578 it is non-negative. This warning requires the
3579 operands to be folded for best results, so do
3580 that folding in this case even without
3581 warn_sign_compare to avoid warning options
3582 possibly affecting code generation. */
3583 op1 = c_fully_fold (op1, require_constant_value,
3585 op2 = c_fully_fold (op2, require_constant_value,
3588 if (warn_sign_compare)
3591 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3593 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3596 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3598 if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
3600 op1 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op1),
3602 C_MAYBE_CONST_EXPR_NON_CONST (op1) = !op1_maybe_const;
3604 if (!op2_maybe_const || TREE_CODE (op2) != INTEGER_CST)
3606 op2 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op2),
3608 C_MAYBE_CONST_EXPR_NON_CONST (op2) = !op2_maybe_const;
3614 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3616 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3617 pedwarn (input_location, OPT_pedantic,
3618 "ISO C forbids conditional expr with only one void side");
3619 result_type = void_type_node;
3621 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3623 if (comp_target_types (type1, type2))
3624 result_type = common_pointer_type (type1, type2);
3625 else if (null_pointer_constant_p (orig_op1))
3626 result_type = qualify_type (type2, type1);
3627 else if (null_pointer_constant_p (orig_op2))
3628 result_type = qualify_type (type1, type2);
3629 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3631 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3632 pedwarn (input_location, OPT_pedantic,
3633 "ISO C forbids conditional expr between "
3634 "%<void *%> and function pointer");
3635 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3636 TREE_TYPE (type2)));
3638 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3640 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3641 pedwarn (input_location, OPT_pedantic,
3642 "ISO C forbids conditional expr between "
3643 "%<void *%> and function pointer");
3644 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3645 TREE_TYPE (type1)));
3650 pedwarn (input_location, 0,
3651 "pointer type mismatch in conditional expression");
3652 result_type = build_pointer_type (void_type_node);
3655 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3657 if (!null_pointer_constant_p (orig_op2))
3658 pedwarn (input_location, 0,
3659 "pointer/integer type mismatch in conditional expression");
3662 op2 = null_pointer_node;
3664 result_type = type1;
3666 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3668 if (!null_pointer_constant_p (orig_op1))
3669 pedwarn (input_location, 0,
3670 "pointer/integer type mismatch in conditional expression");
3673 op1 = null_pointer_node;
3675 result_type = type2;
3680 if (flag_cond_mismatch)
3681 result_type = void_type_node;
3684 error ("type mismatch in conditional expression");
3685 return error_mark_node;
3689 /* Merge const and volatile flags of the incoming types. */
3691 = build_type_variant (result_type,
3692 TREE_READONLY (op1) || TREE_READONLY (op2),
3693 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3695 if (result_type != TREE_TYPE (op1))
3696 op1 = convert_and_check (result_type, op1);
3697 if (result_type != TREE_TYPE (op2))
3698 op2 = convert_and_check (result_type, op2);
3700 op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
3701 op2_int_operands = EXPR_INT_CONST_OPERANDS (orig_op2);
3702 if (ifexp_bcp && ifexp == truthvalue_true_node)
3704 op2_int_operands = true;
3705 op1 = c_fully_fold (op1, require_constant_value, NULL);
3707 if (ifexp_bcp && ifexp == truthvalue_false_node)
3709 op1_int_operands = true;
3710 op2 = c_fully_fold (op2, require_constant_value, NULL);
3712 int_const = int_operands = (EXPR_INT_CONST_OPERANDS (ifexp)
3714 && op2_int_operands);
3717 int_const = ((ifexp == truthvalue_true_node
3718 && TREE_CODE (orig_op1) == INTEGER_CST
3719 && !TREE_OVERFLOW (orig_op1))
3720 || (ifexp == truthvalue_false_node
3721 && TREE_CODE (orig_op2) == INTEGER_CST
3722 && !TREE_OVERFLOW (orig_op2)));
3724 if (int_const || (ifexp_bcp && TREE_CODE (ifexp) == INTEGER_CST))
3725 ret = fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3728 ret = build3 (COND_EXPR, result_type, ifexp, op1, op2);
3730 ret = note_integer_operands (ret);
3736 /* Return a compound expression that performs two expressions and
3737 returns the value of the second of them. */
3740 build_compound_expr (tree expr1, tree expr2)
3744 if (!TREE_SIDE_EFFECTS (expr1))
3746 /* The left-hand operand of a comma expression is like an expression
3747 statement: with -Wunused, we should warn if it doesn't have
3748 any side-effects, unless it was explicitly cast to (void). */
3749 if (warn_unused_value)
3751 if (VOID_TYPE_P (TREE_TYPE (expr1))
3752 && CONVERT_EXPR_P (expr1))
3754 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3755 && TREE_CODE (expr1) == COMPOUND_EXPR
3756 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3757 ; /* (void) a, (void) b, c */
3759 warning (OPT_Wunused_value,
3760 "left-hand operand of comma expression has no effect");
3764 /* With -Wunused, we should also warn if the left-hand operand does have
3765 side-effects, but computes a value which is not used. For example, in
3766 `foo() + bar(), baz()' the result of the `+' operator is not used,
3767 so we should issue a warning. */
3768 else if (warn_unused_value)
3769 warn_if_unused_value (expr1, input_location);
3771 if (expr2 == error_mark_node)
3772 return error_mark_node;
3774 ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3777 && EXPR_INT_CONST_OPERANDS (expr1)
3778 && EXPR_INT_CONST_OPERANDS (expr2))
3779 ret = note_integer_operands (ret);
3784 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3787 build_c_cast (tree type, tree expr)
3791 if (type == error_mark_node || expr == error_mark_node)
3792 return error_mark_node;
3794 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3795 only in <protocol> qualifications. But when constructing cast expressions,
3796 the protocols do matter and must be kept around. */
3797 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3798 return build1 (NOP_EXPR, type, expr);
3800 type = TYPE_MAIN_VARIANT (type);
3802 if (TREE_CODE (type) == ARRAY_TYPE)
3804 error ("cast specifies array type");
3805 return error_mark_node;
3808 if (TREE_CODE (type) == FUNCTION_TYPE)
3810 error ("cast specifies function type");
3811 return error_mark_node;
3814 if (!VOID_TYPE_P (type))
3816 value = require_complete_type (value);
3817 if (value == error_mark_node)
3818 return error_mark_node;
3821 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3823 if (TREE_CODE (type) == RECORD_TYPE
3824 || TREE_CODE (type) == UNION_TYPE)
3825 pedwarn (input_location, OPT_pedantic,
3826 "ISO C forbids casting nonscalar to the same type");
3828 else if (TREE_CODE (type) == UNION_TYPE)
3832 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3833 if (TREE_TYPE (field) != error_mark_node
3834 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3835 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3842 pedwarn (input_location, OPT_pedantic,
3843 "ISO C forbids casts to union type");
3844 t = digest_init (type,
3845 build_constructor_single (type, field, value),
3847 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3850 error ("cast to union type from type not present in union");
3851 return error_mark_node;
3857 if (type == void_type_node)
3858 return build1 (CONVERT_EXPR, type, value);
3860 otype = TREE_TYPE (value);
3862 /* Optionally warn about potentially worrisome casts. */
3865 && TREE_CODE (type) == POINTER_TYPE
3866 && TREE_CODE (otype) == POINTER_TYPE)
3868 tree in_type = type;
3869 tree in_otype = otype;
3873 /* Check that the qualifiers on IN_TYPE are a superset of
3874 the qualifiers of IN_OTYPE. The outermost level of
3875 POINTER_TYPE nodes is uninteresting and we stop as soon
3876 as we hit a non-POINTER_TYPE node on either type. */
3879 in_otype = TREE_TYPE (in_otype);
3880 in_type = TREE_TYPE (in_type);
3882 /* GNU C allows cv-qualified function types. 'const'
3883 means the function is very pure, 'volatile' means it
3884 can't return. We need to warn when such qualifiers
3885 are added, not when they're taken away. */
3886 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3887 && TREE_CODE (in_type) == FUNCTION_TYPE)
3888 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3890 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3892 while (TREE_CODE (in_type) == POINTER_TYPE
3893 && TREE_CODE (in_otype) == POINTER_TYPE);
3896 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3899 /* There are qualifiers present in IN_OTYPE that are not
3900 present in IN_TYPE. */
3901 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3904 /* Warn about possible alignment problems. */
3905 if (STRICT_ALIGNMENT
3906 && TREE_CODE (type) == POINTER_TYPE
3907 && TREE_CODE (otype) == POINTER_TYPE
3908 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3909 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3910 /* Don't warn about opaque types, where the actual alignment
3911 restriction is unknown. */
3912 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3913 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3914 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3915 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3916 warning (OPT_Wcast_align,
3917 "cast increases required alignment of target type");
3919 if (TREE_CODE (type) == INTEGER_TYPE
3920 && TREE_CODE (otype) == POINTER_TYPE
3921 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3922 /* Unlike conversion of integers to pointers, where the
3923 warning is disabled for converting constants because
3924 of cases such as SIG_*, warn about converting constant
3925 pointers to integers. In some cases it may cause unwanted
3926 sign extension, and a warning is appropriate. */
3927 warning (OPT_Wpointer_to_int_cast,
3928 "cast from pointer to integer of different size");
3930 if (TREE_CODE (value) == CALL_EXPR
3931 && TREE_CODE (type) != TREE_CODE (otype))
3932 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3933 "to non-matching type %qT", otype, type);
3935 if (TREE_CODE (type) == POINTER_TYPE
3936 && TREE_CODE (otype) == INTEGER_TYPE
3937 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3938 /* Don't warn about converting any constant. */
3939 && !TREE_CONSTANT (value))
3940 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3941 "of different size");
3943 if (warn_strict_aliasing <= 2)
3944 strict_aliasing_warning (otype, type, expr);
3946 /* If pedantic, warn for conversions between function and object
3947 pointer types, except for converting a null pointer constant
3948 to function pointer type. */
3950 && TREE_CODE (type) == POINTER_TYPE
3951 && TREE_CODE (otype) == POINTER_TYPE
3952 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3953 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3954 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3955 "conversion of function pointer to object pointer type");
3958 && TREE_CODE (type) == POINTER_TYPE
3959 && TREE_CODE (otype) == POINTER_TYPE
3960 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3961 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3962 && !null_pointer_constant_p (value))
3963 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3964 "conversion of object pointer to function pointer type");
3967 value = convert (type, value);
3969 /* Ignore any integer overflow caused by the cast. */
3970 if (TREE_CODE (value) == INTEGER_CST && !FLOAT_TYPE_P (otype))
3972 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3974 if (!TREE_OVERFLOW (value))
3976 /* Avoid clobbering a shared constant. */
3977 value = copy_node (value);
3978 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3981 else if (TREE_OVERFLOW (value))
3982 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3983 value = build_int_cst_wide (TREE_TYPE (value),
3984 TREE_INT_CST_LOW (value),
3985 TREE_INT_CST_HIGH (value));
3989 /* Don't let a cast be an lvalue. */
3991 value = non_lvalue (value);
3993 /* Don't allow the results of casting to floating-point or complex
3994 types be confused with actual constants, or casts involving
3995 integer and pointer types other than direct integer-to-integer
3996 and integer-to-pointer be confused with integer constant
3997 expressions and null pointer constants. */
3998 if (TREE_CODE (value) == REAL_CST
3999 || TREE_CODE (value) == COMPLEX_CST
4000 || (TREE_CODE (value) == INTEGER_CST
4001 && !((TREE_CODE (expr) == INTEGER_CST
4002 && INTEGRAL_TYPE_P (TREE_TYPE (expr)))
4003 || TREE_CODE (expr) == REAL_CST
4004 || TREE_CODE (expr) == COMPLEX_CST)))
4005 value = build1 (NOP_EXPR, type, value);
4010 /* Interpret a cast of expression EXPR to type TYPE. */
4012 c_cast_expr (struct c_type_name *type_name, tree expr)
4015 tree type_expr = NULL_TREE;
4016 bool type_expr_const = true;
4018 int saved_wsp = warn_strict_prototypes;
4020 /* This avoids warnings about unprototyped casts on
4021 integers. E.g. "#define SIG_DFL (void(*)())0". */
4022 if (TREE_CODE (expr) == INTEGER_CST)
4023 warn_strict_prototypes = 0;
4024 type = groktypename (type_name, &type_expr, &type_expr_const);
4025 warn_strict_prototypes = saved_wsp;
4027 ret = build_c_cast (type, expr);
4030 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret), type_expr, ret);
4031 C_MAYBE_CONST_EXPR_NON_CONST (ret) = !type_expr_const;
4036 /* Build an assignment expression of lvalue LHS from value RHS.
4037 MODIFYCODE is the code for a binary operator that we use
4038 to combine the old value of LHS with RHS to get the new value.
4039 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4041 LOCATION is the location of the MODIFYCODE operator. */
4044 build_modify_expr (location_t location,
4045 tree lhs, enum tree_code modifycode, tree rhs)
4049 tree lhstype = TREE_TYPE (lhs);
4050 tree olhstype = lhstype;
4053 /* Types that aren't fully specified cannot be used in assignments. */
4054 lhs = require_complete_type (lhs);
4056 /* Avoid duplicate error messages from operands that had errors. */
4057 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
4058 return error_mark_node;
4060 if (!lvalue_or_else (lhs, lv_assign))
4061 return error_mark_node;
4065 if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
4067 tree inner = build_modify_expr (location, C_MAYBE_CONST_EXPR_EXPR (lhs),
4069 if (inner == error_mark_node)
4070 return error_mark_node;
4071 result = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
4072 C_MAYBE_CONST_EXPR_PRE (lhs), inner);
4073 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs));
4074 C_MAYBE_CONST_EXPR_NON_CONST (result) = 1;
4075 protected_set_expr_location (result, location);
4079 /* If a binary op has been requested, combine the old LHS value with the RHS
4080 producing the value we should actually store into the LHS. */
4082 if (modifycode != NOP_EXPR)
4084 lhs = c_fully_fold (lhs, false, NULL);
4085 lhs = stabilize_reference (lhs);
4086 newrhs = build_binary_op (location,
4087 modifycode, lhs, rhs, 1);
4090 /* Give an error for storing in something that is 'const'. */
4092 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
4093 || ((TREE_CODE (lhstype) == RECORD_TYPE
4094 || TREE_CODE (lhstype) == UNION_TYPE)
4095 && C_TYPE_FIELDS_READONLY (lhstype)))
4097 readonly_error (lhs, lv_assign);
4098 return error_mark_node;
4101 /* If storing into a structure or union member,
4102 it has probably been given type `int'.
4103 Compute the type that would go with
4104 the actual amount of storage the member occupies. */
4106 if (TREE_CODE (lhs) == COMPONENT_REF
4107 && (TREE_CODE (lhstype) == INTEGER_TYPE
4108 || TREE_CODE (lhstype) == BOOLEAN_TYPE
4109 || TREE_CODE (lhstype) == REAL_TYPE
4110 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
4111 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
4113 /* If storing in a field that is in actuality a short or narrower than one,
4114 we must store in the field in its actual type. */
4116 if (lhstype != TREE_TYPE (lhs))
4118 lhs = copy_node (lhs);
4119 TREE_TYPE (lhs) = lhstype;
4122 /* Convert new value to destination type. Fold it first for the
4123 sake of conversion warnings. */
4125 npc = null_pointer_constant_p (newrhs);
4126 newrhs = c_fully_fold (newrhs, false, NULL);
4127 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign, npc,
4128 NULL_TREE, NULL_TREE, 0);
4129 if (TREE_CODE (newrhs) == ERROR_MARK)
4130 return error_mark_node;
4132 /* Emit ObjC write barrier, if necessary. */
4133 if (c_dialect_objc () && flag_objc_gc)
4135 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
4138 protected_set_expr_location (result, location);
4143 /* Scan operands. */
4145 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
4146 TREE_SIDE_EFFECTS (result) = 1;
4147 protected_set_expr_location (result, location);
4149 /* If we got the LHS in a different type for storing in,
4150 convert the result back to the nominal type of LHS
4151 so that the value we return always has the same type
4152 as the LHS argument. */
4154 if (olhstype == TREE_TYPE (result))
4157 result = convert_for_assignment (olhstype, result, ic_assign, false,
4158 NULL_TREE, NULL_TREE, 0);
4159 protected_set_expr_location (result, location);
4163 /* Convert value RHS to type TYPE as preparation for an assignment
4164 to an lvalue of type TYPE. NULL_POINTER_CONSTANT says whether RHS
4165 was a null pointer constant before any folding.
4166 The real work of conversion is done by `convert'.
4167 The purpose of this function is to generate error messages
4168 for assignments that are not allowed in C.
4169 ERRTYPE says whether it is argument passing, assignment,
4170 initialization or return.
4172 FUNCTION is a tree for the function being called.
4173 PARMNUM is the number of the argument, for printing in error messages. */
4176 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
4177 bool null_pointer_constant,
4178 tree fundecl, tree function, int parmnum)
4180 enum tree_code codel = TREE_CODE (type);
4182 enum tree_code coder;
4183 tree rname = NULL_TREE;
4184 bool objc_ok = false;
4186 if (errtype == ic_argpass)
4189 /* Change pointer to function to the function itself for
4191 if (TREE_CODE (function) == ADDR_EXPR
4192 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
4193 function = TREE_OPERAND (function, 0);
4195 /* Handle an ObjC selector specially for diagnostics. */
4196 selector = objc_message_selector ();
4198 if (selector && parmnum > 2)
4205 /* This macro is used to emit diagnostics to ensure that all format
4206 strings are complete sentences, visible to gettext and checked at
4208 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4213 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4214 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4215 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4216 "expected %qT but argument is of type %qT", \
4220 pedwarn (LOCATION, OPT, AS); \
4223 pedwarn (LOCATION, OPT, IN); \
4226 pedwarn (LOCATION, OPT, RE); \
4229 gcc_unreachable (); \
4233 rhstype = TREE_TYPE (rhs);
4234 coder = TREE_CODE (rhstype);
4236 if (coder == ERROR_MARK)
4237 return error_mark_node;
4239 if (c_dialect_objc ())
4262 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4265 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4268 if (coder == VOID_TYPE)
4270 /* Except for passing an argument to an unprototyped function,
4271 this is a constraint violation. When passing an argument to
4272 an unprototyped function, it is compile-time undefined;
4273 making it a constraint in that case was rejected in
4275 error ("void value not ignored as it ought to be");
4276 return error_mark_node;
4278 rhs = require_complete_type (rhs);
4279 if (rhs == error_mark_node)
4280 return error_mark_node;
4281 /* A type converts to a reference to it.
4282 This code doesn't fully support references, it's just for the
4283 special case of va_start and va_copy. */
4284 if (codel == REFERENCE_TYPE
4285 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4287 if (!lvalue_p (rhs))
4289 error ("cannot pass rvalue to reference parameter");
4290 return error_mark_node;
4292 if (!c_mark_addressable (rhs))
4293 return error_mark_node;
4294 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4296 /* We already know that these two types are compatible, but they
4297 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4298 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4299 likely to be va_list, a typedef to __builtin_va_list, which
4300 is different enough that it will cause problems later. */
4301 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4302 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4304 rhs = build1 (NOP_EXPR, type, rhs);
4307 /* Some types can interconvert without explicit casts. */
4308 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4309 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4310 return convert (type, rhs);
4311 /* Arithmetic types all interconvert, and enum is treated like int. */
4312 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4313 || codel == FIXED_POINT_TYPE
4314 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4315 || codel == BOOLEAN_TYPE)
4316 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4317 || coder == FIXED_POINT_TYPE
4318 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4319 || coder == BOOLEAN_TYPE))
4322 bool save = in_late_binary_op;
4323 if (codel == BOOLEAN_TYPE)
4324 in_late_binary_op = true;
4325 ret = convert_and_check (type, rhs);
4326 if (codel == BOOLEAN_TYPE)
4327 in_late_binary_op = save;
4331 /* Aggregates in different TUs might need conversion. */
4332 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4334 && comptypes (type, rhstype))
4335 return convert_and_check (type, rhs);
4337 /* Conversion to a transparent union from its member types.
4338 This applies only to function arguments. */
4339 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4340 && errtype == ic_argpass)
4342 tree memb, marginal_memb = NULL_TREE;
4344 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4346 tree memb_type = TREE_TYPE (memb);
4348 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4349 TYPE_MAIN_VARIANT (rhstype)))
4352 if (TREE_CODE (memb_type) != POINTER_TYPE)
4355 if (coder == POINTER_TYPE)
4357 tree ttl = TREE_TYPE (memb_type);
4358 tree ttr = TREE_TYPE (rhstype);
4360 /* Any non-function converts to a [const][volatile] void *
4361 and vice versa; otherwise, targets must be the same.
4362 Meanwhile, the lhs target must have all the qualifiers of
4364 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4365 || comp_target_types (memb_type, rhstype))
4367 /* If this type won't generate any warnings, use it. */
4368 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4369 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4370 && TREE_CODE (ttl) == FUNCTION_TYPE)
4371 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4372 == TYPE_QUALS (ttr))
4373 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4374 == TYPE_QUALS (ttl))))
4377 /* Keep looking for a better type, but remember this one. */
4379 marginal_memb = memb;
4383 /* Can convert integer zero to any pointer type. */
4384 if (null_pointer_constant)
4386 rhs = null_pointer_node;
4391 if (memb || marginal_memb)
4395 /* We have only a marginally acceptable member type;
4396 it needs a warning. */
4397 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4398 tree ttr = TREE_TYPE (rhstype);
4400 /* Const and volatile mean something different for function
4401 types, so the usual warnings are not appropriate. */
4402 if (TREE_CODE (ttr) == FUNCTION_TYPE
4403 && TREE_CODE (ttl) == FUNCTION_TYPE)
4405 /* Because const and volatile on functions are
4406 restrictions that say the function will not do
4407 certain things, it is okay to use a const or volatile
4408 function where an ordinary one is wanted, but not
4410 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4411 WARN_FOR_ASSIGNMENT (input_location, 0,
4412 G_("passing argument %d of %qE "
4413 "makes qualified function "
4414 "pointer from unqualified"),
4415 G_("assignment makes qualified "
4416 "function pointer from "
4418 G_("initialization makes qualified "
4419 "function pointer from "
4421 G_("return makes qualified function "
4422 "pointer from unqualified"));
4424 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4425 WARN_FOR_ASSIGNMENT (input_location, 0,
4426 G_("passing argument %d of %qE discards "
4427 "qualifiers from pointer target type"),
4428 G_("assignment discards qualifiers "
4429 "from pointer target type"),
4430 G_("initialization discards qualifiers "
4431 "from pointer target type"),
4432 G_("return discards qualifiers from "
4433 "pointer target type"));
4435 memb = marginal_memb;
4438 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4439 pedwarn (input_location, OPT_pedantic,
4440 "ISO C prohibits argument conversion to union type");
4442 rhs = fold_convert (TREE_TYPE (memb), rhs);
4443 return build_constructor_single (type, memb, rhs);
4447 /* Conversions among pointers */
4448 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4449 && (coder == codel))
4451 tree ttl = TREE_TYPE (type);
4452 tree ttr = TREE_TYPE (rhstype);
4455 bool is_opaque_pointer;
4456 int target_cmp = 0; /* Cache comp_target_types () result. */
4458 if (TREE_CODE (mvl) != ARRAY_TYPE)
4459 mvl = TYPE_MAIN_VARIANT (mvl);
4460 if (TREE_CODE (mvr) != ARRAY_TYPE)
4461 mvr = TYPE_MAIN_VARIANT (mvr);
4462 /* Opaque pointers are treated like void pointers. */
4463 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4465 /* C++ does not allow the implicit conversion void* -> T*. However,
4466 for the purpose of reducing the number of false positives, we
4467 tolerate the special case of
4471 where NULL is typically defined in C to be '(void *) 0'. */
4472 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4473 warning (OPT_Wc___compat, "request for implicit conversion from "
4474 "%qT to %qT not permitted in C++", rhstype, type);
4476 /* Check if the right-hand side has a format attribute but the
4477 left-hand side doesn't. */
4478 if (warn_missing_format_attribute
4479 && check_missing_format_attribute (type, rhstype))
4484 warning (OPT_Wmissing_format_attribute,
4485 "argument %d of %qE might be "
4486 "a candidate for a format attribute",
4490 warning (OPT_Wmissing_format_attribute,
4491 "assignment left-hand side might be "
4492 "a candidate for a format attribute");
4495 warning (OPT_Wmissing_format_attribute,
4496 "initialization left-hand side might be "
4497 "a candidate for a format attribute");
4500 warning (OPT_Wmissing_format_attribute,
4501 "return type might be "
4502 "a candidate for a format attribute");
4509 /* Any non-function converts to a [const][volatile] void *
4510 and vice versa; otherwise, targets must be the same.
4511 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4512 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4513 || (target_cmp = comp_target_types (type, rhstype))
4514 || is_opaque_pointer
4515 || (c_common_unsigned_type (mvl)
4516 == c_common_unsigned_type (mvr)))
4519 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4522 && !null_pointer_constant
4523 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4524 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4525 G_("ISO C forbids passing argument %d of "
4526 "%qE between function pointer "
4528 G_("ISO C forbids assignment between "
4529 "function pointer and %<void *%>"),
4530 G_("ISO C forbids initialization between "
4531 "function pointer and %<void *%>"),
4532 G_("ISO C forbids return between function "
4533 "pointer and %<void *%>"));
4534 /* Const and volatile mean something different for function types,
4535 so the usual warnings are not appropriate. */
4536 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4537 && TREE_CODE (ttl) != FUNCTION_TYPE)
4539 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4541 /* Types differing only by the presence of the 'volatile'
4542 qualifier are acceptable if the 'volatile' has been added
4543 in by the Objective-C EH machinery. */
4544 if (!objc_type_quals_match (ttl, ttr))
4545 WARN_FOR_ASSIGNMENT (input_location, 0,
4546 G_("passing argument %d of %qE discards "
4547 "qualifiers from pointer target type"),
4548 G_("assignment discards qualifiers "
4549 "from pointer target type"),
4550 G_("initialization discards qualifiers "
4551 "from pointer target type"),
4552 G_("return discards qualifiers from "
4553 "pointer target type"));
4555 /* If this is not a case of ignoring a mismatch in signedness,
4557 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4560 /* If there is a mismatch, do warn. */
4561 else if (warn_pointer_sign)
4562 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4563 G_("pointer targets in passing argument "
4564 "%d of %qE differ in signedness"),
4565 G_("pointer targets in assignment "
4566 "differ in signedness"),
4567 G_("pointer targets in initialization "
4568 "differ in signedness"),
4569 G_("pointer targets in return differ "
4572 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4573 && TREE_CODE (ttr) == FUNCTION_TYPE)
4575 /* Because const and volatile on functions are restrictions
4576 that say the function will not do certain things,
4577 it is okay to use a const or volatile function
4578 where an ordinary one is wanted, but not vice-versa. */
4579 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4580 WARN_FOR_ASSIGNMENT (input_location, 0,
4581 G_("passing argument %d of %qE makes "
4582 "qualified function pointer "
4583 "from unqualified"),
4584 G_("assignment makes qualified function "
4585 "pointer from unqualified"),
4586 G_("initialization makes qualified "
4587 "function pointer from unqualified"),
4588 G_("return makes qualified function "
4589 "pointer from unqualified"));
4593 /* Avoid warning about the volatile ObjC EH puts on decls. */
4595 WARN_FOR_ASSIGNMENT (input_location, 0,
4596 G_("passing argument %d of %qE from "
4597 "incompatible pointer type"),
4598 G_("assignment from incompatible pointer type"),
4599 G_("initialization from incompatible "
4601 G_("return from incompatible pointer type"));
4603 return convert (type, rhs);
4605 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4607 /* ??? This should not be an error when inlining calls to
4608 unprototyped functions. */
4609 error ("invalid use of non-lvalue array");
4610 return error_mark_node;
4612 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4614 /* An explicit constant 0 can convert to a pointer,
4615 or one that results from arithmetic, even including
4616 a cast to integer type. */
4617 if (!null_pointer_constant)
4618 WARN_FOR_ASSIGNMENT (input_location, 0,
4619 G_("passing argument %d of %qE makes "
4620 "pointer from integer without a cast"),
4621 G_("assignment makes pointer from integer "
4623 G_("initialization makes pointer from "
4624 "integer without a cast"),
4625 G_("return makes pointer from integer "
4628 return convert (type, rhs);
4630 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4632 WARN_FOR_ASSIGNMENT (input_location, 0,
4633 G_("passing argument %d of %qE makes integer "
4634 "from pointer without a cast"),
4635 G_("assignment makes integer from pointer "
4637 G_("initialization makes integer from pointer "
4639 G_("return makes integer from pointer "
4641 return convert (type, rhs);
4643 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4646 bool save = in_late_binary_op;
4647 in_late_binary_op = true;
4648 ret = convert (type, rhs);
4649 in_late_binary_op = save;
4656 error ("incompatible type for argument %d of %qE", parmnum, rname);
4657 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4658 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4659 "expected %qT but argument is of type %qT", type, rhstype);
4662 error ("incompatible types when assigning to type %qT from type %qT",
4666 error ("incompatible types when initializing type %qT using type %qT",
4670 error ("incompatible types when returning type %qT but %qT was expected",
4677 return error_mark_node;
4680 /* If VALUE is a compound expr all of whose expressions are constant, then
4681 return its value. Otherwise, return error_mark_node.
4683 This is for handling COMPOUND_EXPRs as initializer elements
4684 which is allowed with a warning when -pedantic is specified. */
4687 valid_compound_expr_initializer (tree value, tree endtype)
4689 if (TREE_CODE (value) == COMPOUND_EXPR)
4691 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4693 return error_mark_node;
4694 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4697 else if (!initializer_constant_valid_p (value, endtype))
4698 return error_mark_node;
4703 /* Perform appropriate conversions on the initial value of a variable,
4704 store it in the declaration DECL,
4705 and print any error messages that are appropriate.
4706 If the init is invalid, store an ERROR_MARK. */
4709 store_init_value (tree decl, tree init)
4714 /* If variable's type was invalidly declared, just ignore it. */
4716 type = TREE_TYPE (decl);
4717 if (TREE_CODE (type) == ERROR_MARK)
4720 /* Digest the specified initializer into an expression. */
4723 npc = null_pointer_constant_p (init);
4724 value = digest_init (type, init, npc, true, TREE_STATIC (decl));
4726 /* Store the expression if valid; else report error. */
4728 if (!in_system_header
4729 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4730 warning (OPT_Wtraditional, "traditional C rejects automatic "
4731 "aggregate initialization");
4733 DECL_INITIAL (decl) = value;
4735 /* ANSI wants warnings about out-of-range constant initializers. */
4736 STRIP_TYPE_NOPS (value);
4737 if (TREE_STATIC (decl))
4738 constant_expression_warning (value);
4740 /* Check if we need to set array size from compound literal size. */
4741 if (TREE_CODE (type) == ARRAY_TYPE
4742 && TYPE_DOMAIN (type) == 0
4743 && value != error_mark_node)
4745 tree inside_init = init;
4747 STRIP_TYPE_NOPS (inside_init);
4748 inside_init = fold (inside_init);
4750 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4752 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4754 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4756 /* For int foo[] = (int [3]){1}; we need to set array size
4757 now since later on array initializer will be just the
4758 brace enclosed list of the compound literal. */
4759 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4760 TREE_TYPE (decl) = type;
4761 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4763 layout_decl (cldecl, 0);
4769 /* Methods for storing and printing names for error messages. */
4771 /* Implement a spelling stack that allows components of a name to be pushed
4772 and popped. Each element on the stack is this structure. */
4779 unsigned HOST_WIDE_INT i;
4784 #define SPELLING_STRING 1
4785 #define SPELLING_MEMBER 2
4786 #define SPELLING_BOUNDS 3
4788 static struct spelling *spelling; /* Next stack element (unused). */
4789 static struct spelling *spelling_base; /* Spelling stack base. */
4790 static int spelling_size; /* Size of the spelling stack. */
4792 /* Macros to save and restore the spelling stack around push_... functions.
4793 Alternative to SAVE_SPELLING_STACK. */
4795 #define SPELLING_DEPTH() (spelling - spelling_base)
4796 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4798 /* Push an element on the spelling stack with type KIND and assign VALUE
4801 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4803 int depth = SPELLING_DEPTH (); \
4805 if (depth >= spelling_size) \
4807 spelling_size += 10; \
4808 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4810 RESTORE_SPELLING_DEPTH (depth); \
4813 spelling->kind = (KIND); \
4814 spelling->MEMBER = (VALUE); \
4818 /* Push STRING on the stack. Printed literally. */
4821 push_string (const char *string)
4823 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4826 /* Push a member name on the stack. Printed as '.' STRING. */
4829 push_member_name (tree decl)
4831 const char *const string
4832 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4833 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4836 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4839 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4841 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4844 /* Compute the maximum size in bytes of the printed spelling. */
4847 spelling_length (void)
4852 for (p = spelling_base; p < spelling; p++)
4854 if (p->kind == SPELLING_BOUNDS)
4857 size += strlen (p->u.s) + 1;
4863 /* Print the spelling to BUFFER and return it. */
4866 print_spelling (char *buffer)
4871 for (p = spelling_base; p < spelling; p++)
4872 if (p->kind == SPELLING_BOUNDS)
4874 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4880 if (p->kind == SPELLING_MEMBER)
4882 for (s = p->u.s; (*d = *s++); d++)
4889 /* Issue an error message for a bad initializer component.
4890 MSGID identifies the message.
4891 The component name is taken from the spelling stack. */
4894 error_init (const char *msgid)
4898 error ("%s", _(msgid));
4899 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4901 error ("(near initialization for %qs)", ofwhat);
4904 /* Issue a pedantic warning for a bad initializer component. OPT is
4905 the option OPT_* (from options.h) controlling this warning or 0 if
4906 it is unconditionally given. MSGID identifies the message. The
4907 component name is taken from the spelling stack. */
4910 pedwarn_init (location_t location, int opt, const char *msgid)
4914 pedwarn (location, opt, "%s", _(msgid));
4915 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4917 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
4920 /* Issue a warning for a bad initializer component.
4922 OPT is the OPT_W* value corresponding to the warning option that
4923 controls this warning. MSGID identifies the message. The
4924 component name is taken from the spelling stack. */
4927 warning_init (int opt, const char *msgid)
4931 warning (opt, "%s", _(msgid));
4932 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4934 warning (opt, "(near initialization for %qs)", ofwhat);
4937 /* If TYPE is an array type and EXPR is a parenthesized string
4938 constant, warn if pedantic that EXPR is being used to initialize an
4939 object of type TYPE. */
4942 maybe_warn_string_init (tree type, struct c_expr expr)
4945 && TREE_CODE (type) == ARRAY_TYPE
4946 && TREE_CODE (expr.value) == STRING_CST
4947 && expr.original_code != STRING_CST)
4948 pedwarn_init (input_location, OPT_pedantic,
4949 "array initialized from parenthesized string constant");
4952 /* Digest the parser output INIT as an initializer for type TYPE.
4953 Return a C expression of type TYPE to represent the initial value.
4955 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
4957 If INIT is a string constant, STRICT_STRING is true if it is
4958 unparenthesized or we should not warn here for it being parenthesized.
4959 For other types of INIT, STRICT_STRING is not used.
4961 REQUIRE_CONSTANT requests an error if non-constant initializers or
4962 elements are seen. */
4965 digest_init (tree type, tree init, bool null_pointer_constant,
4966 bool strict_string, int require_constant)
4968 enum tree_code code = TREE_CODE (type);
4969 tree inside_init = init;
4970 bool maybe_const = true;
4972 if (type == error_mark_node
4974 || init == error_mark_node
4975 || TREE_TYPE (init) == error_mark_node)
4976 return error_mark_node;
4978 STRIP_TYPE_NOPS (inside_init);
4980 inside_init = c_fully_fold (inside_init, require_constant, &maybe_const);
4981 inside_init = decl_constant_value_for_optimization (inside_init);
4983 /* Initialization of an array of chars from a string constant
4984 optionally enclosed in braces. */
4986 if (code == ARRAY_TYPE && inside_init
4987 && TREE_CODE (inside_init) == STRING_CST)
4989 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4990 /* Note that an array could be both an array of character type
4991 and an array of wchar_t if wchar_t is signed char or unsigned
4993 bool char_array = (typ1 == char_type_node
4994 || typ1 == signed_char_type_node
4995 || typ1 == unsigned_char_type_node);
4996 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4997 bool char16_array = !!comptypes (typ1, char16_type_node);
4998 bool char32_array = !!comptypes (typ1, char32_type_node);
5000 if (char_array || wchar_array || char16_array || char32_array)
5003 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
5004 expr.value = inside_init;
5005 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
5006 maybe_warn_string_init (type, expr);
5008 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5009 TYPE_MAIN_VARIANT (type)))
5014 if (typ2 != char_type_node)
5016 error_init ("char-array initialized from wide string");
5017 return error_mark_node;
5022 if (typ2 == char_type_node)
5024 error_init ("wide character array initialized from non-wide "
5026 return error_mark_node;
5028 else if (!comptypes(typ1, typ2))
5030 error_init ("wide character array initialized from "
5031 "incompatible wide string");
5032 return error_mark_node;
5036 TREE_TYPE (inside_init) = type;
5037 if (TYPE_DOMAIN (type) != 0
5038 && TYPE_SIZE (type) != 0
5039 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
5040 /* Subtract the size of a single (possibly wide) character
5041 because it's ok to ignore the terminating null char
5042 that is counted in the length of the constant. */
5043 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
5044 TREE_STRING_LENGTH (inside_init)
5045 - (TYPE_PRECISION (typ1)
5047 pedwarn_init (input_location, 0,
5048 "initializer-string for array of chars is too long");
5052 else if (INTEGRAL_TYPE_P (typ1))
5054 error_init ("array of inappropriate type initialized "
5055 "from string constant");
5056 return error_mark_node;
5060 /* Build a VECTOR_CST from a *constant* vector constructor. If the
5061 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
5062 below and handle as a constructor. */
5063 if (code == VECTOR_TYPE
5064 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
5065 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
5066 && TREE_CONSTANT (inside_init))
5068 if (TREE_CODE (inside_init) == VECTOR_CST
5069 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5070 TYPE_MAIN_VARIANT (type)))
5073 if (TREE_CODE (inside_init) == CONSTRUCTOR)
5075 unsigned HOST_WIDE_INT ix;
5077 bool constant_p = true;
5079 /* Iterate through elements and check if all constructor
5080 elements are *_CSTs. */
5081 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
5082 if (!CONSTANT_CLASS_P (value))
5089 return build_vector_from_ctor (type,
5090 CONSTRUCTOR_ELTS (inside_init));
5094 if (warn_sequence_point)
5095 verify_sequence_points (inside_init);
5097 /* Any type can be initialized
5098 from an expression of the same type, optionally with braces. */
5100 if (inside_init && TREE_TYPE (inside_init) != 0
5101 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5102 TYPE_MAIN_VARIANT (type))
5103 || (code == ARRAY_TYPE
5104 && comptypes (TREE_TYPE (inside_init), type))
5105 || (code == VECTOR_TYPE
5106 && comptypes (TREE_TYPE (inside_init), type))
5107 || (code == POINTER_TYPE
5108 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
5109 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
5110 TREE_TYPE (type)))))
5112 if (code == POINTER_TYPE)
5114 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
5116 if (TREE_CODE (inside_init) == STRING_CST
5117 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5118 inside_init = array_to_pointer_conversion (inside_init);
5121 error_init ("invalid use of non-lvalue array");
5122 return error_mark_node;
5127 if (code == VECTOR_TYPE)
5128 /* Although the types are compatible, we may require a
5130 inside_init = convert (type, inside_init);
5132 if (require_constant
5133 && (code == VECTOR_TYPE || !flag_isoc99)
5134 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5136 /* As an extension, allow initializing objects with static storage
5137 duration with compound literals (which are then treated just as
5138 the brace enclosed list they contain). Also allow this for
5139 vectors, as we can only assign them with compound literals. */
5140 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
5141 inside_init = DECL_INITIAL (decl);
5144 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
5145 && TREE_CODE (inside_init) != CONSTRUCTOR)
5147 error_init ("array initialized from non-constant array expression");
5148 return error_mark_node;
5151 /* Compound expressions can only occur here if -pedantic or
5152 -pedantic-errors is specified. In the later case, we always want
5153 an error. In the former case, we simply want a warning. */
5154 if (require_constant && pedantic
5155 && TREE_CODE (inside_init) == COMPOUND_EXPR)
5158 = valid_compound_expr_initializer (inside_init,
5159 TREE_TYPE (inside_init));
5160 if (inside_init == error_mark_node)
5161 error_init ("initializer element is not constant");
5163 pedwarn_init (input_location, OPT_pedantic,
5164 "initializer element is not constant");
5165 if (flag_pedantic_errors)
5166 inside_init = error_mark_node;
5168 else if (require_constant
5169 && !initializer_constant_valid_p (inside_init,
5170 TREE_TYPE (inside_init)))
5172 error_init ("initializer element is not constant");
5173 inside_init = error_mark_node;
5175 else if (require_constant && !maybe_const)
5176 pedwarn_init (input_location, 0,
5177 "initializer element is not a constant expression");
5179 /* Added to enable additional -Wmissing-format-attribute warnings. */
5180 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
5181 inside_init = convert_for_assignment (type, inside_init, ic_init,
5182 null_pointer_constant,
5183 NULL_TREE, NULL_TREE, 0);
5187 /* Handle scalar types, including conversions. */
5189 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
5190 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
5191 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
5193 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
5194 && (TREE_CODE (init) == STRING_CST
5195 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
5196 inside_init = init = array_to_pointer_conversion (init);
5198 = convert_for_assignment (type, inside_init, ic_init,
5199 null_pointer_constant,
5200 NULL_TREE, NULL_TREE, 0);
5202 /* Check to see if we have already given an error message. */
5203 if (inside_init == error_mark_node)
5205 else if (require_constant && !TREE_CONSTANT (inside_init))
5207 error_init ("initializer element is not constant");
5208 inside_init = error_mark_node;
5210 else if (require_constant
5211 && !initializer_constant_valid_p (inside_init,
5212 TREE_TYPE (inside_init)))
5214 error_init ("initializer element is not computable at load time");
5215 inside_init = error_mark_node;
5217 else if (require_constant && !maybe_const)
5218 pedwarn_init (input_location, 0,
5219 "initializer element is not a constant expression");
5224 /* Come here only for records and arrays. */
5226 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5228 error_init ("variable-sized object may not be initialized");
5229 return error_mark_node;
5232 error_init ("invalid initializer");
5233 return error_mark_node;
5236 /* Handle initializers that use braces. */
5238 /* Type of object we are accumulating a constructor for.
5239 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5240 static tree constructor_type;
5242 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5244 static tree constructor_fields;
5246 /* For an ARRAY_TYPE, this is the specified index
5247 at which to store the next element we get. */
5248 static tree constructor_index;
5250 /* For an ARRAY_TYPE, this is the maximum index. */
5251 static tree constructor_max_index;
5253 /* For a RECORD_TYPE, this is the first field not yet written out. */
5254 static tree constructor_unfilled_fields;
5256 /* For an ARRAY_TYPE, this is the index of the first element
5257 not yet written out. */
5258 static tree constructor_unfilled_index;
5260 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5261 This is so we can generate gaps between fields, when appropriate. */
5262 static tree constructor_bit_index;
5264 /* If we are saving up the elements rather than allocating them,
5265 this is the list of elements so far (in reverse order,
5266 most recent first). */
5267 static VEC(constructor_elt,gc) *constructor_elements;
5269 /* 1 if constructor should be incrementally stored into a constructor chain,
5270 0 if all the elements should be kept in AVL tree. */
5271 static int constructor_incremental;
5273 /* 1 if so far this constructor's elements are all compile-time constants. */
5274 static int constructor_constant;
5276 /* 1 if so far this constructor's elements are all valid address constants. */
5277 static int constructor_simple;
5279 /* 1 if this constructor has an element that cannot be part of a
5280 constant expression. */
5281 static int constructor_nonconst;
5283 /* 1 if this constructor is erroneous so far. */
5284 static int constructor_erroneous;
5286 /* Structure for managing pending initializer elements, organized as an
5291 struct init_node *left, *right;
5292 struct init_node *parent;
5298 /* Tree of pending elements at this constructor level.
5299 These are elements encountered out of order
5300 which belong at places we haven't reached yet in actually
5302 Will never hold tree nodes across GC runs. */
5303 static struct init_node *constructor_pending_elts;
5305 /* The SPELLING_DEPTH of this constructor. */
5306 static int constructor_depth;
5308 /* DECL node for which an initializer is being read.
5309 0 means we are reading a constructor expression
5310 such as (struct foo) {...}. */
5311 static tree constructor_decl;
5313 /* Nonzero if this is an initializer for a top-level decl. */
5314 static int constructor_top_level;
5316 /* Nonzero if there were any member designators in this initializer. */
5317 static int constructor_designated;
5319 /* Nesting depth of designator list. */
5320 static int designator_depth;
5322 /* Nonzero if there were diagnosed errors in this designator list. */
5323 static int designator_erroneous;
5326 /* This stack has a level for each implicit or explicit level of
5327 structuring in the initializer, including the outermost one. It
5328 saves the values of most of the variables above. */
5330 struct constructor_range_stack;
5332 struct constructor_stack
5334 struct constructor_stack *next;
5339 tree unfilled_index;
5340 tree unfilled_fields;
5342 VEC(constructor_elt,gc) *elements;
5343 struct init_node *pending_elts;
5346 /* If value nonzero, this value should replace the entire
5347 constructor at this level. */
5348 struct c_expr replacement_value;
5349 struct constructor_range_stack *range_stack;
5360 static struct constructor_stack *constructor_stack;
5362 /* This stack represents designators from some range designator up to
5363 the last designator in the list. */
5365 struct constructor_range_stack
5367 struct constructor_range_stack *next, *prev;
5368 struct constructor_stack *stack;
5375 static struct constructor_range_stack *constructor_range_stack;
5377 /* This stack records separate initializers that are nested.
5378 Nested initializers can't happen in ANSI C, but GNU C allows them
5379 in cases like { ... (struct foo) { ... } ... }. */
5381 struct initializer_stack
5383 struct initializer_stack *next;
5385 struct constructor_stack *constructor_stack;
5386 struct constructor_range_stack *constructor_range_stack;
5387 VEC(constructor_elt,gc) *elements;
5388 struct spelling *spelling;
5389 struct spelling *spelling_base;
5392 char require_constant_value;
5393 char require_constant_elements;
5396 static struct initializer_stack *initializer_stack;
5398 /* Prepare to parse and output the initializer for variable DECL. */
5401 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5404 struct initializer_stack *p = XNEW (struct initializer_stack);
5406 p->decl = constructor_decl;
5407 p->require_constant_value = require_constant_value;
5408 p->require_constant_elements = require_constant_elements;
5409 p->constructor_stack = constructor_stack;
5410 p->constructor_range_stack = constructor_range_stack;
5411 p->elements = constructor_elements;
5412 p->spelling = spelling;
5413 p->spelling_base = spelling_base;
5414 p->spelling_size = spelling_size;
5415 p->top_level = constructor_top_level;
5416 p->next = initializer_stack;
5417 initializer_stack = p;
5419 constructor_decl = decl;
5420 constructor_designated = 0;
5421 constructor_top_level = top_level;
5423 if (decl != 0 && decl != error_mark_node)
5425 require_constant_value = TREE_STATIC (decl);
5426 require_constant_elements
5427 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5428 /* For a scalar, you can always use any value to initialize,
5429 even within braces. */
5430 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5431 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5432 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5433 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5434 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5438 require_constant_value = 0;
5439 require_constant_elements = 0;
5440 locus = "(anonymous)";
5443 constructor_stack = 0;
5444 constructor_range_stack = 0;
5446 missing_braces_mentioned = 0;
5450 RESTORE_SPELLING_DEPTH (0);
5453 push_string (locus);
5459 struct initializer_stack *p = initializer_stack;
5461 /* Free the whole constructor stack of this initializer. */
5462 while (constructor_stack)
5464 struct constructor_stack *q = constructor_stack;
5465 constructor_stack = q->next;
5469 gcc_assert (!constructor_range_stack);
5471 /* Pop back to the data of the outer initializer (if any). */
5472 free (spelling_base);
5474 constructor_decl = p->decl;
5475 require_constant_value = p->require_constant_value;
5476 require_constant_elements = p->require_constant_elements;
5477 constructor_stack = p->constructor_stack;
5478 constructor_range_stack = p->constructor_range_stack;
5479 constructor_elements = p->elements;
5480 spelling = p->spelling;
5481 spelling_base = p->spelling_base;
5482 spelling_size = p->spelling_size;
5483 constructor_top_level = p->top_level;
5484 initializer_stack = p->next;
5488 /* Call here when we see the initializer is surrounded by braces.
5489 This is instead of a call to push_init_level;
5490 it is matched by a call to pop_init_level.
5492 TYPE is the type to initialize, for a constructor expression.
5493 For an initializer for a decl, TYPE is zero. */
5496 really_start_incremental_init (tree type)
5498 struct constructor_stack *p = XNEW (struct constructor_stack);
5501 type = TREE_TYPE (constructor_decl);
5503 if (targetm.vector_opaque_p (type))
5504 error ("opaque vector types cannot be initialized");
5506 p->type = constructor_type;
5507 p->fields = constructor_fields;
5508 p->index = constructor_index;
5509 p->max_index = constructor_max_index;
5510 p->unfilled_index = constructor_unfilled_index;
5511 p->unfilled_fields = constructor_unfilled_fields;
5512 p->bit_index = constructor_bit_index;
5513 p->elements = constructor_elements;
5514 p->constant = constructor_constant;
5515 p->simple = constructor_simple;
5516 p->nonconst = constructor_nonconst;
5517 p->erroneous = constructor_erroneous;
5518 p->pending_elts = constructor_pending_elts;
5519 p->depth = constructor_depth;
5520 p->replacement_value.value = 0;
5521 p->replacement_value.original_code = ERROR_MARK;
5525 p->incremental = constructor_incremental;
5526 p->designated = constructor_designated;
5528 constructor_stack = p;
5530 constructor_constant = 1;
5531 constructor_simple = 1;
5532 constructor_nonconst = 0;
5533 constructor_depth = SPELLING_DEPTH ();
5534 constructor_elements = 0;
5535 constructor_pending_elts = 0;
5536 constructor_type = type;
5537 constructor_incremental = 1;
5538 constructor_designated = 0;
5539 designator_depth = 0;
5540 designator_erroneous = 0;
5542 if (TREE_CODE (constructor_type) == RECORD_TYPE
5543 || TREE_CODE (constructor_type) == UNION_TYPE)
5545 constructor_fields = TYPE_FIELDS (constructor_type);
5546 /* Skip any nameless bit fields at the beginning. */
5547 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5548 && DECL_NAME (constructor_fields) == 0)
5549 constructor_fields = TREE_CHAIN (constructor_fields);
5551 constructor_unfilled_fields = constructor_fields;
5552 constructor_bit_index = bitsize_zero_node;
5554 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5556 if (TYPE_DOMAIN (constructor_type))
5558 constructor_max_index
5559 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5561 /* Detect non-empty initializations of zero-length arrays. */
5562 if (constructor_max_index == NULL_TREE
5563 && TYPE_SIZE (constructor_type))
5564 constructor_max_index = build_int_cst (NULL_TREE, -1);
5566 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5567 to initialize VLAs will cause a proper error; avoid tree
5568 checking errors as well by setting a safe value. */
5569 if (constructor_max_index
5570 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5571 constructor_max_index = build_int_cst (NULL_TREE, -1);
5574 = convert (bitsizetype,
5575 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5579 constructor_index = bitsize_zero_node;
5580 constructor_max_index = NULL_TREE;
5583 constructor_unfilled_index = constructor_index;
5585 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5587 /* Vectors are like simple fixed-size arrays. */
5588 constructor_max_index =
5589 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5590 constructor_index = bitsize_zero_node;
5591 constructor_unfilled_index = constructor_index;
5595 /* Handle the case of int x = {5}; */
5596 constructor_fields = constructor_type;
5597 constructor_unfilled_fields = constructor_type;
5601 /* Push down into a subobject, for initialization.
5602 If this is for an explicit set of braces, IMPLICIT is 0.
5603 If it is because the next element belongs at a lower level,
5604 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5607 push_init_level (int implicit)
5609 struct constructor_stack *p;
5610 tree value = NULL_TREE;
5612 /* If we've exhausted any levels that didn't have braces,
5613 pop them now. If implicit == 1, this will have been done in
5614 process_init_element; do not repeat it here because in the case
5615 of excess initializers for an empty aggregate this leads to an
5616 infinite cycle of popping a level and immediately recreating
5620 while (constructor_stack->implicit)
5622 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5623 || TREE_CODE (constructor_type) == UNION_TYPE)
5624 && constructor_fields == 0)
5625 process_init_element (pop_init_level (1), true);
5626 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5627 && constructor_max_index
5628 && tree_int_cst_lt (constructor_max_index,
5630 process_init_element (pop_init_level (1), true);
5636 /* Unless this is an explicit brace, we need to preserve previous
5640 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5641 || TREE_CODE (constructor_type) == UNION_TYPE)
5642 && constructor_fields)
5643 value = find_init_member (constructor_fields);
5644 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5645 value = find_init_member (constructor_index);
5648 p = XNEW (struct constructor_stack);
5649 p->type = constructor_type;
5650 p->fields = constructor_fields;
5651 p->index = constructor_index;
5652 p->max_index = constructor_max_index;
5653 p->unfilled_index = constructor_unfilled_index;
5654 p->unfilled_fields = constructor_unfilled_fields;
5655 p->bit_index = constructor_bit_index;
5656 p->elements = constructor_elements;
5657 p->constant = constructor_constant;
5658 p->simple = constructor_simple;
5659 p->nonconst = constructor_nonconst;
5660 p->erroneous = constructor_erroneous;
5661 p->pending_elts = constructor_pending_elts;
5662 p->depth = constructor_depth;
5663 p->replacement_value.value = 0;
5664 p->replacement_value.original_code = ERROR_MARK;
5665 p->implicit = implicit;
5667 p->incremental = constructor_incremental;
5668 p->designated = constructor_designated;
5669 p->next = constructor_stack;
5671 constructor_stack = p;
5673 constructor_constant = 1;
5674 constructor_simple = 1;
5675 constructor_nonconst = 0;
5676 constructor_depth = SPELLING_DEPTH ();
5677 constructor_elements = 0;
5678 constructor_incremental = 1;
5679 constructor_designated = 0;
5680 constructor_pending_elts = 0;
5683 p->range_stack = constructor_range_stack;
5684 constructor_range_stack = 0;
5685 designator_depth = 0;
5686 designator_erroneous = 0;
5689 /* Don't die if an entire brace-pair level is superfluous
5690 in the containing level. */
5691 if (constructor_type == 0)
5693 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5694 || TREE_CODE (constructor_type) == UNION_TYPE)
5696 /* Don't die if there are extra init elts at the end. */
5697 if (constructor_fields == 0)
5698 constructor_type = 0;
5701 constructor_type = TREE_TYPE (constructor_fields);
5702 push_member_name (constructor_fields);
5703 constructor_depth++;
5706 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5708 constructor_type = TREE_TYPE (constructor_type);
5709 push_array_bounds (tree_low_cst (constructor_index, 1));
5710 constructor_depth++;
5713 if (constructor_type == 0)
5715 error_init ("extra brace group at end of initializer");
5716 constructor_fields = 0;
5717 constructor_unfilled_fields = 0;
5721 if (value && TREE_CODE (value) == CONSTRUCTOR)
5723 constructor_constant = TREE_CONSTANT (value);
5724 constructor_simple = TREE_STATIC (value);
5725 constructor_nonconst = CONSTRUCTOR_NON_CONST (value);
5726 constructor_elements = CONSTRUCTOR_ELTS (value);
5727 if (!VEC_empty (constructor_elt, constructor_elements)
5728 && (TREE_CODE (constructor_type) == RECORD_TYPE
5729 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5730 set_nonincremental_init ();
5733 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5735 missing_braces_mentioned = 1;
5736 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5739 if (TREE_CODE (constructor_type) == RECORD_TYPE
5740 || TREE_CODE (constructor_type) == UNION_TYPE)
5742 constructor_fields = TYPE_FIELDS (constructor_type);
5743 /* Skip any nameless bit fields at the beginning. */
5744 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5745 && DECL_NAME (constructor_fields) == 0)
5746 constructor_fields = TREE_CHAIN (constructor_fields);
5748 constructor_unfilled_fields = constructor_fields;
5749 constructor_bit_index = bitsize_zero_node;
5751 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5753 /* Vectors are like simple fixed-size arrays. */
5754 constructor_max_index =
5755 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5756 constructor_index = convert (bitsizetype, integer_zero_node);
5757 constructor_unfilled_index = constructor_index;
5759 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5761 if (TYPE_DOMAIN (constructor_type))
5763 constructor_max_index
5764 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5766 /* Detect non-empty initializations of zero-length arrays. */
5767 if (constructor_max_index == NULL_TREE
5768 && TYPE_SIZE (constructor_type))
5769 constructor_max_index = build_int_cst (NULL_TREE, -1);
5771 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5772 to initialize VLAs will cause a proper error; avoid tree
5773 checking errors as well by setting a safe value. */
5774 if (constructor_max_index
5775 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5776 constructor_max_index = build_int_cst (NULL_TREE, -1);
5779 = convert (bitsizetype,
5780 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5783 constructor_index = bitsize_zero_node;
5785 constructor_unfilled_index = constructor_index;
5786 if (value && TREE_CODE (value) == STRING_CST)
5788 /* We need to split the char/wchar array into individual
5789 characters, so that we don't have to special case it
5791 set_nonincremental_init_from_string (value);
5796 if (constructor_type != error_mark_node)
5797 warning_init (0, "braces around scalar initializer");
5798 constructor_fields = constructor_type;
5799 constructor_unfilled_fields = constructor_type;
5803 /* At the end of an implicit or explicit brace level,
5804 finish up that level of constructor. If a single expression
5805 with redundant braces initialized that level, return the
5806 c_expr structure for that expression. Otherwise, the original_code
5807 element is set to ERROR_MARK.
5808 If we were outputting the elements as they are read, return 0 as the value
5809 from inner levels (process_init_element ignores that),
5810 but return error_mark_node as the value from the outermost level
5811 (that's what we want to put in DECL_INITIAL).
5812 Otherwise, return a CONSTRUCTOR expression as the value. */
5815 pop_init_level (int implicit)
5817 struct constructor_stack *p;
5820 ret.original_code = ERROR_MARK;
5824 /* When we come to an explicit close brace,
5825 pop any inner levels that didn't have explicit braces. */
5826 while (constructor_stack->implicit)
5827 process_init_element (pop_init_level (1), true);
5829 gcc_assert (!constructor_range_stack);
5832 /* Now output all pending elements. */
5833 constructor_incremental = 1;
5834 output_pending_init_elements (1);
5836 p = constructor_stack;
5838 /* Error for initializing a flexible array member, or a zero-length
5839 array member in an inappropriate context. */
5840 if (constructor_type && constructor_fields
5841 && TREE_CODE (constructor_type) == ARRAY_TYPE
5842 && TYPE_DOMAIN (constructor_type)
5843 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5845 /* Silently discard empty initializations. The parser will
5846 already have pedwarned for empty brackets. */
5847 if (integer_zerop (constructor_unfilled_index))
5848 constructor_type = NULL_TREE;
5851 gcc_assert (!TYPE_SIZE (constructor_type));
5853 if (constructor_depth > 2)
5854 error_init ("initialization of flexible array member in a nested context");
5856 pedwarn_init (input_location, OPT_pedantic,
5857 "initialization of a flexible array member");
5859 /* We have already issued an error message for the existence
5860 of a flexible array member not at the end of the structure.
5861 Discard the initializer so that we do not die later. */
5862 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5863 constructor_type = NULL_TREE;
5867 /* Warn when some struct elements are implicitly initialized to zero. */
5868 if (warn_missing_field_initializers
5870 && TREE_CODE (constructor_type) == RECORD_TYPE
5871 && constructor_unfilled_fields)
5873 /* Do not warn for flexible array members or zero-length arrays. */
5874 while (constructor_unfilled_fields
5875 && (!DECL_SIZE (constructor_unfilled_fields)
5876 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5877 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5879 /* Do not warn if this level of the initializer uses member
5880 designators; it is likely to be deliberate. */
5881 if (constructor_unfilled_fields && !constructor_designated)
5883 push_member_name (constructor_unfilled_fields);
5884 warning_init (OPT_Wmissing_field_initializers,
5885 "missing initializer");
5886 RESTORE_SPELLING_DEPTH (constructor_depth);
5890 /* Pad out the end of the structure. */
5891 if (p->replacement_value.value)
5892 /* If this closes a superfluous brace pair,
5893 just pass out the element between them. */
5894 ret = p->replacement_value;
5895 else if (constructor_type == 0)
5897 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5898 && TREE_CODE (constructor_type) != UNION_TYPE
5899 && TREE_CODE (constructor_type) != ARRAY_TYPE
5900 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5902 /* A nonincremental scalar initializer--just return
5903 the element, after verifying there is just one. */
5904 if (VEC_empty (constructor_elt,constructor_elements))
5906 if (!constructor_erroneous)
5907 error_init ("empty scalar initializer");
5908 ret.value = error_mark_node;
5910 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5912 error_init ("extra elements in scalar initializer");
5913 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5916 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5920 if (constructor_erroneous)
5921 ret.value = error_mark_node;
5924 ret.value = build_constructor (constructor_type,
5925 constructor_elements);
5926 if (constructor_constant)
5927 TREE_CONSTANT (ret.value) = 1;
5928 if (constructor_constant && constructor_simple)
5929 TREE_STATIC (ret.value) = 1;
5930 if (constructor_nonconst)
5931 CONSTRUCTOR_NON_CONST (ret.value) = 1;
5935 if (ret.value && TREE_CODE (ret.value) != CONSTRUCTOR)
5937 if (constructor_nonconst)
5938 ret.original_code = C_MAYBE_CONST_EXPR;
5939 else if (ret.original_code == C_MAYBE_CONST_EXPR)
5940 ret.original_code = ERROR_MARK;
5943 constructor_type = p->type;
5944 constructor_fields = p->fields;
5945 constructor_index = p->index;
5946 constructor_max_index = p->max_index;
5947 constructor_unfilled_index = p->unfilled_index;
5948 constructor_unfilled_fields = p->unfilled_fields;
5949 constructor_bit_index = p->bit_index;
5950 constructor_elements = p->elements;
5951 constructor_constant = p->constant;
5952 constructor_simple = p->simple;
5953 constructor_nonconst = p->nonconst;
5954 constructor_erroneous = p->erroneous;
5955 constructor_incremental = p->incremental;
5956 constructor_designated = p->designated;
5957 constructor_pending_elts = p->pending_elts;
5958 constructor_depth = p->depth;
5960 constructor_range_stack = p->range_stack;
5961 RESTORE_SPELLING_DEPTH (constructor_depth);
5963 constructor_stack = p->next;
5966 if (ret.value == 0 && constructor_stack == 0)
5967 ret.value = error_mark_node;
5971 /* Common handling for both array range and field name designators.
5972 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5975 set_designator (int array)
5978 enum tree_code subcode;
5980 /* Don't die if an entire brace-pair level is superfluous
5981 in the containing level. */
5982 if (constructor_type == 0)
5985 /* If there were errors in this designator list already, bail out
5987 if (designator_erroneous)
5990 if (!designator_depth)
5992 gcc_assert (!constructor_range_stack);
5994 /* Designator list starts at the level of closest explicit
5996 while (constructor_stack->implicit)
5997 process_init_element (pop_init_level (1), true);
5998 constructor_designated = 1;
6002 switch (TREE_CODE (constructor_type))
6006 subtype = TREE_TYPE (constructor_fields);
6007 if (subtype != error_mark_node)
6008 subtype = TYPE_MAIN_VARIANT (subtype);
6011 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6017 subcode = TREE_CODE (subtype);
6018 if (array && subcode != ARRAY_TYPE)
6020 error_init ("array index in non-array initializer");
6023 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
6025 error_init ("field name not in record or union initializer");
6029 constructor_designated = 1;
6030 push_init_level (2);
6034 /* If there are range designators in designator list, push a new designator
6035 to constructor_range_stack. RANGE_END is end of such stack range or
6036 NULL_TREE if there is no range designator at this level. */
6039 push_range_stack (tree range_end)
6041 struct constructor_range_stack *p;
6043 p = GGC_NEW (struct constructor_range_stack);
6044 p->prev = constructor_range_stack;
6046 p->fields = constructor_fields;
6047 p->range_start = constructor_index;
6048 p->index = constructor_index;
6049 p->stack = constructor_stack;
6050 p->range_end = range_end;
6051 if (constructor_range_stack)
6052 constructor_range_stack->next = p;
6053 constructor_range_stack = p;
6056 /* Within an array initializer, specify the next index to be initialized.
6057 FIRST is that index. If LAST is nonzero, then initialize a range
6058 of indices, running from FIRST through LAST. */
6061 set_init_index (tree first, tree last)
6063 if (set_designator (1))
6066 designator_erroneous = 1;
6068 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
6069 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
6071 error_init ("array index in initializer not of integer type");
6075 if (TREE_CODE (first) != INTEGER_CST)
6076 error_init ("nonconstant array index in initializer");
6077 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
6078 error_init ("nonconstant array index in initializer");
6079 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6080 error_init ("array index in non-array initializer");
6081 else if (tree_int_cst_sgn (first) == -1)
6082 error_init ("array index in initializer exceeds array bounds");
6083 else if (constructor_max_index
6084 && tree_int_cst_lt (constructor_max_index, first))
6085 error_init ("array index in initializer exceeds array bounds");
6088 constant_expression_warning (first);
6090 constant_expression_warning (last);
6091 constructor_index = convert (bitsizetype, first);
6095 if (tree_int_cst_equal (first, last))
6097 else if (tree_int_cst_lt (last, first))
6099 error_init ("empty index range in initializer");
6104 last = convert (bitsizetype, last);
6105 if (constructor_max_index != 0
6106 && tree_int_cst_lt (constructor_max_index, last))
6108 error_init ("array index range in initializer exceeds array bounds");
6115 designator_erroneous = 0;
6116 if (constructor_range_stack || last)
6117 push_range_stack (last);
6121 /* Within a struct initializer, specify the next field to be initialized. */
6124 set_init_label (tree fieldname)
6128 if (set_designator (0))
6131 designator_erroneous = 1;
6133 if (TREE_CODE (constructor_type) != RECORD_TYPE
6134 && TREE_CODE (constructor_type) != UNION_TYPE)
6136 error_init ("field name not in record or union initializer");
6140 for (tail = TYPE_FIELDS (constructor_type); tail;
6141 tail = TREE_CHAIN (tail))
6143 if (DECL_NAME (tail) == fieldname)
6148 error ("unknown field %qE specified in initializer", fieldname);
6151 constructor_fields = tail;
6153 designator_erroneous = 0;
6154 if (constructor_range_stack)
6155 push_range_stack (NULL_TREE);
6159 /* Add a new initializer to the tree of pending initializers. PURPOSE
6160 identifies the initializer, either array index or field in a structure.
6161 VALUE is the value of that index or field.
6163 IMPLICIT is true if value comes from pop_init_level (1),
6164 the new initializer has been merged with the existing one
6165 and thus no warnings should be emitted about overriding an
6166 existing initializer. */
6169 add_pending_init (tree purpose, tree value, bool implicit)
6171 struct init_node *p, **q, *r;
6173 q = &constructor_pending_elts;
6176 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6181 if (tree_int_cst_lt (purpose, p->purpose))
6183 else if (tree_int_cst_lt (p->purpose, purpose))
6189 if (TREE_SIDE_EFFECTS (p->value))
6190 warning_init (0, "initialized field with side-effects overwritten");
6191 else if (warn_override_init)
6192 warning_init (OPT_Woverride_init, "initialized field overwritten");
6203 bitpos = bit_position (purpose);
6207 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6209 else if (p->purpose != purpose)
6215 if (TREE_SIDE_EFFECTS (p->value))
6216 warning_init (0, "initialized field with side-effects overwritten");
6217 else if (warn_override_init)
6218 warning_init (OPT_Woverride_init, "initialized field overwritten");
6226 r = GGC_NEW (struct init_node);
6227 r->purpose = purpose;
6238 struct init_node *s;
6242 if (p->balance == 0)
6244 else if (p->balance < 0)
6251 p->left->parent = p;
6268 constructor_pending_elts = r;
6273 struct init_node *t = r->right;
6277 r->right->parent = r;
6282 p->left->parent = p;
6285 p->balance = t->balance < 0;
6286 r->balance = -(t->balance > 0);
6301 constructor_pending_elts = t;
6307 /* p->balance == +1; growth of left side balances the node. */
6312 else /* r == p->right */
6314 if (p->balance == 0)
6315 /* Growth propagation from right side. */
6317 else if (p->balance > 0)
6324 p->right->parent = p;
6341 constructor_pending_elts = r;
6343 else /* r->balance == -1 */
6346 struct init_node *t = r->left;
6350 r->left->parent = r;
6355 p->right->parent = p;
6358 r->balance = (t->balance < 0);
6359 p->balance = -(t->balance > 0);
6374 constructor_pending_elts = t;
6380 /* p->balance == -1; growth of right side balances the node. */
6391 /* Build AVL tree from a sorted chain. */
6394 set_nonincremental_init (void)
6396 unsigned HOST_WIDE_INT ix;
6399 if (TREE_CODE (constructor_type) != RECORD_TYPE
6400 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6403 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6404 add_pending_init (index, value, false);
6405 constructor_elements = 0;
6406 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6408 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6409 /* Skip any nameless bit fields at the beginning. */
6410 while (constructor_unfilled_fields != 0
6411 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6412 && DECL_NAME (constructor_unfilled_fields) == 0)
6413 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6416 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6418 if (TYPE_DOMAIN (constructor_type))
6419 constructor_unfilled_index
6420 = convert (bitsizetype,
6421 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6423 constructor_unfilled_index = bitsize_zero_node;
6425 constructor_incremental = 0;
6428 /* Build AVL tree from a string constant. */
6431 set_nonincremental_init_from_string (tree str)
6433 tree value, purpose, type;
6434 HOST_WIDE_INT val[2];
6435 const char *p, *end;
6436 int byte, wchar_bytes, charwidth, bitpos;
6438 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6440 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6441 charwidth = TYPE_PRECISION (char_type_node);
6442 type = TREE_TYPE (constructor_type);
6443 p = TREE_STRING_POINTER (str);
6444 end = p + TREE_STRING_LENGTH (str);
6446 for (purpose = bitsize_zero_node;
6447 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6448 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6450 if (wchar_bytes == 1)
6452 val[1] = (unsigned char) *p++;
6459 for (byte = 0; byte < wchar_bytes; byte++)
6461 if (BYTES_BIG_ENDIAN)
6462 bitpos = (wchar_bytes - byte - 1) * charwidth;
6464 bitpos = byte * charwidth;
6465 val[bitpos < HOST_BITS_PER_WIDE_INT]
6466 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6467 << (bitpos % HOST_BITS_PER_WIDE_INT);
6471 if (!TYPE_UNSIGNED (type))
6473 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6474 if (bitpos < HOST_BITS_PER_WIDE_INT)
6476 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6478 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6482 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6487 else if (val[0] & (((HOST_WIDE_INT) 1)
6488 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6489 val[0] |= ((HOST_WIDE_INT) -1)
6490 << (bitpos - HOST_BITS_PER_WIDE_INT);
6493 value = build_int_cst_wide (type, val[1], val[0]);
6494 add_pending_init (purpose, value, false);
6497 constructor_incremental = 0;
6500 /* Return value of FIELD in pending initializer or zero if the field was
6501 not initialized yet. */
6504 find_init_member (tree field)
6506 struct init_node *p;
6508 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6510 if (constructor_incremental
6511 && tree_int_cst_lt (field, constructor_unfilled_index))
6512 set_nonincremental_init ();
6514 p = constructor_pending_elts;
6517 if (tree_int_cst_lt (field, p->purpose))
6519 else if (tree_int_cst_lt (p->purpose, field))
6525 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6527 tree bitpos = bit_position (field);
6529 if (constructor_incremental
6530 && (!constructor_unfilled_fields
6531 || tree_int_cst_lt (bitpos,
6532 bit_position (constructor_unfilled_fields))))
6533 set_nonincremental_init ();
6535 p = constructor_pending_elts;
6538 if (field == p->purpose)
6540 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6546 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6548 if (!VEC_empty (constructor_elt, constructor_elements)
6549 && (VEC_last (constructor_elt, constructor_elements)->index
6551 return VEC_last (constructor_elt, constructor_elements)->value;
6556 /* "Output" the next constructor element.
6557 At top level, really output it to assembler code now.
6558 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6559 TYPE is the data type that the containing data type wants here.
6560 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6561 If VALUE is a string constant, STRICT_STRING is true if it is
6562 unparenthesized or we should not warn here for it being parenthesized.
6563 For other types of VALUE, STRICT_STRING is not used.
6565 PENDING if non-nil means output pending elements that belong
6566 right after this element. (PENDING is normally 1;
6567 it is 0 while outputting pending elements, to avoid recursion.)
6569 IMPLICIT is true if value comes from pop_init_level (1),
6570 the new initializer has been merged with the existing one
6571 and thus no warnings should be emitted about overriding an
6572 existing initializer. */
6575 output_init_element (tree value, bool strict_string, tree type, tree field,
6576 int pending, bool implicit)
6578 constructor_elt *celt;
6579 bool maybe_const = true;
6582 if (type == error_mark_node || value == error_mark_node)
6584 constructor_erroneous = 1;
6587 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6588 && (TREE_CODE (value) == STRING_CST
6589 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6590 && !(TREE_CODE (value) == STRING_CST
6591 && TREE_CODE (type) == ARRAY_TYPE
6592 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6593 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6594 TYPE_MAIN_VARIANT (type)))
6595 value = array_to_pointer_conversion (value);
6597 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6598 && require_constant_value && !flag_isoc99 && pending)
6600 /* As an extension, allow initializing objects with static storage
6601 duration with compound literals (which are then treated just as
6602 the brace enclosed list they contain). */
6603 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6604 value = DECL_INITIAL (decl);
6607 npc = null_pointer_constant_p (value);
6608 value = c_fully_fold (value, require_constant_value, &maybe_const);
6610 if (value == error_mark_node)
6611 constructor_erroneous = 1;
6612 else if (!TREE_CONSTANT (value))
6613 constructor_constant = 0;
6614 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6615 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6616 || TREE_CODE (constructor_type) == UNION_TYPE)
6617 && DECL_C_BIT_FIELD (field)
6618 && TREE_CODE (value) != INTEGER_CST))
6619 constructor_simple = 0;
6621 constructor_nonconst = 1;
6623 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6625 if (require_constant_value)
6627 error_init ("initializer element is not constant");
6628 value = error_mark_node;
6630 else if (require_constant_elements)
6631 pedwarn (input_location, 0,
6632 "initializer element is not computable at load time");
6634 else if (!maybe_const
6635 && (require_constant_value || require_constant_elements))
6636 pedwarn_init (input_location, 0,
6637 "initializer element is not a constant expression");
6639 /* If this field is empty (and not at the end of structure),
6640 don't do anything other than checking the initializer. */
6642 && (TREE_TYPE (field) == error_mark_node
6643 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6644 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6645 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6646 || TREE_CHAIN (field)))))
6649 value = digest_init (type, value, npc, strict_string,
6650 require_constant_value);
6651 if (value == error_mark_node)
6653 constructor_erroneous = 1;
6656 if (require_constant_value || require_constant_elements)
6657 constant_expression_warning (value);
6659 /* If this element doesn't come next in sequence,
6660 put it on constructor_pending_elts. */
6661 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6662 && (!constructor_incremental
6663 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6665 if (constructor_incremental
6666 && tree_int_cst_lt (field, constructor_unfilled_index))
6667 set_nonincremental_init ();
6669 add_pending_init (field, value, implicit);
6672 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6673 && (!constructor_incremental
6674 || field != constructor_unfilled_fields))
6676 /* We do this for records but not for unions. In a union,
6677 no matter which field is specified, it can be initialized
6678 right away since it starts at the beginning of the union. */
6679 if (constructor_incremental)
6681 if (!constructor_unfilled_fields)
6682 set_nonincremental_init ();
6685 tree bitpos, unfillpos;
6687 bitpos = bit_position (field);
6688 unfillpos = bit_position (constructor_unfilled_fields);
6690 if (tree_int_cst_lt (bitpos, unfillpos))
6691 set_nonincremental_init ();
6695 add_pending_init (field, value, implicit);
6698 else if (TREE_CODE (constructor_type) == UNION_TYPE
6699 && !VEC_empty (constructor_elt, constructor_elements))
6703 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6704 constructor_elements)->value))
6706 "initialized field with side-effects overwritten");
6707 else if (warn_override_init)
6708 warning_init (OPT_Woverride_init, "initialized field overwritten");
6711 /* We can have just one union field set. */
6712 constructor_elements = 0;
6715 /* Otherwise, output this element either to
6716 constructor_elements or to the assembler file. */
6718 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6719 celt->index = field;
6720 celt->value = value;
6722 /* Advance the variable that indicates sequential elements output. */
6723 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6724 constructor_unfilled_index
6725 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6727 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6729 constructor_unfilled_fields
6730 = TREE_CHAIN (constructor_unfilled_fields);
6732 /* Skip any nameless bit fields. */
6733 while (constructor_unfilled_fields != 0
6734 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6735 && DECL_NAME (constructor_unfilled_fields) == 0)
6736 constructor_unfilled_fields =
6737 TREE_CHAIN (constructor_unfilled_fields);
6739 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6740 constructor_unfilled_fields = 0;
6742 /* Now output any pending elements which have become next. */
6744 output_pending_init_elements (0);
6747 /* Output any pending elements which have become next.
6748 As we output elements, constructor_unfilled_{fields,index}
6749 advances, which may cause other elements to become next;
6750 if so, they too are output.
6752 If ALL is 0, we return when there are
6753 no more pending elements to output now.
6755 If ALL is 1, we output space as necessary so that
6756 we can output all the pending elements. */
6759 output_pending_init_elements (int all)
6761 struct init_node *elt = constructor_pending_elts;
6766 /* Look through the whole pending tree.
6767 If we find an element that should be output now,
6768 output it. Otherwise, set NEXT to the element
6769 that comes first among those still pending. */
6774 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6776 if (tree_int_cst_equal (elt->purpose,
6777 constructor_unfilled_index))
6778 output_init_element (elt->value, true,
6779 TREE_TYPE (constructor_type),
6780 constructor_unfilled_index, 0, false);
6781 else if (tree_int_cst_lt (constructor_unfilled_index,
6784 /* Advance to the next smaller node. */
6789 /* We have reached the smallest node bigger than the
6790 current unfilled index. Fill the space first. */
6791 next = elt->purpose;
6797 /* Advance to the next bigger node. */
6802 /* We have reached the biggest node in a subtree. Find
6803 the parent of it, which is the next bigger node. */
6804 while (elt->parent && elt->parent->right == elt)
6807 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6810 next = elt->purpose;
6816 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6817 || TREE_CODE (constructor_type) == UNION_TYPE)
6819 tree ctor_unfilled_bitpos, elt_bitpos;
6821 /* If the current record is complete we are done. */
6822 if (constructor_unfilled_fields == 0)
6825 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6826 elt_bitpos = bit_position (elt->purpose);
6827 /* We can't compare fields here because there might be empty
6828 fields in between. */
6829 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6831 constructor_unfilled_fields = elt->purpose;
6832 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6833 elt->purpose, 0, false);
6835 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6837 /* Advance to the next smaller node. */
6842 /* We have reached the smallest node bigger than the
6843 current unfilled field. Fill the space first. */
6844 next = elt->purpose;
6850 /* Advance to the next bigger node. */
6855 /* We have reached the biggest node in a subtree. Find
6856 the parent of it, which is the next bigger node. */
6857 while (elt->parent && elt->parent->right == elt)
6861 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6862 bit_position (elt->purpose))))
6864 next = elt->purpose;
6872 /* Ordinarily return, but not if we want to output all
6873 and there are elements left. */
6874 if (!(all && next != 0))
6877 /* If it's not incremental, just skip over the gap, so that after
6878 jumping to retry we will output the next successive element. */
6879 if (TREE_CODE (constructor_type) == RECORD_TYPE
6880 || TREE_CODE (constructor_type) == UNION_TYPE)
6881 constructor_unfilled_fields = next;
6882 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6883 constructor_unfilled_index = next;
6885 /* ELT now points to the node in the pending tree with the next
6886 initializer to output. */
6890 /* Add one non-braced element to the current constructor level.
6891 This adjusts the current position within the constructor's type.
6892 This may also start or terminate implicit levels
6893 to handle a partly-braced initializer.
6895 Once this has found the correct level for the new element,
6896 it calls output_init_element.
6898 IMPLICIT is true if value comes from pop_init_level (1),
6899 the new initializer has been merged with the existing one
6900 and thus no warnings should be emitted about overriding an
6901 existing initializer. */
6904 process_init_element (struct c_expr value, bool implicit)
6906 tree orig_value = value.value;
6907 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6908 bool strict_string = value.original_code == STRING_CST;
6910 designator_depth = 0;
6911 designator_erroneous = 0;
6913 /* Handle superfluous braces around string cst as in
6914 char x[] = {"foo"}; */
6917 && TREE_CODE (constructor_type) == ARRAY_TYPE
6918 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6919 && integer_zerop (constructor_unfilled_index))
6921 if (constructor_stack->replacement_value.value)
6922 error_init ("excess elements in char array initializer");
6923 constructor_stack->replacement_value = value;
6927 if (constructor_stack->replacement_value.value != 0)
6929 error_init ("excess elements in struct initializer");
6933 /* Ignore elements of a brace group if it is entirely superfluous
6934 and has already been diagnosed. */
6935 if (constructor_type == 0)
6938 /* If we've exhausted any levels that didn't have braces,
6940 while (constructor_stack->implicit)
6942 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6943 || TREE_CODE (constructor_type) == UNION_TYPE)
6944 && constructor_fields == 0)
6945 process_init_element (pop_init_level (1), true);
6946 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6947 && (constructor_max_index == 0
6948 || tree_int_cst_lt (constructor_max_index,
6949 constructor_index)))
6950 process_init_element (pop_init_level (1), true);
6955 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6956 if (constructor_range_stack)
6958 /* If value is a compound literal and we'll be just using its
6959 content, don't put it into a SAVE_EXPR. */
6960 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6961 || !require_constant_value
6963 value.value = c_save_expr (value.value);
6968 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6971 enum tree_code fieldcode;
6973 if (constructor_fields == 0)
6975 pedwarn_init (input_location, 0,
6976 "excess elements in struct initializer");
6980 fieldtype = TREE_TYPE (constructor_fields);
6981 if (fieldtype != error_mark_node)
6982 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6983 fieldcode = TREE_CODE (fieldtype);
6985 /* Error for non-static initialization of a flexible array member. */
6986 if (fieldcode == ARRAY_TYPE
6987 && !require_constant_value
6988 && TYPE_SIZE (fieldtype) == NULL_TREE
6989 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6991 error_init ("non-static initialization of a flexible array member");
6995 /* Accept a string constant to initialize a subarray. */
6996 if (value.value != 0
6997 && fieldcode == ARRAY_TYPE
6998 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
7000 value.value = orig_value;
7001 /* Otherwise, if we have come to a subaggregate,
7002 and we don't have an element of its type, push into it. */
7003 else if (value.value != 0
7004 && value.value != error_mark_node
7005 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
7006 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
7007 || fieldcode == UNION_TYPE))
7009 push_init_level (1);
7015 push_member_name (constructor_fields);
7016 output_init_element (value.value, strict_string,
7017 fieldtype, constructor_fields, 1, implicit);
7018 RESTORE_SPELLING_DEPTH (constructor_depth);
7021 /* Do the bookkeeping for an element that was
7022 directly output as a constructor. */
7024 /* For a record, keep track of end position of last field. */
7025 if (DECL_SIZE (constructor_fields))
7026 constructor_bit_index
7027 = size_binop (PLUS_EXPR,
7028 bit_position (constructor_fields),
7029 DECL_SIZE (constructor_fields));
7031 /* If the current field was the first one not yet written out,
7032 it isn't now, so update. */
7033 if (constructor_unfilled_fields == constructor_fields)
7035 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
7036 /* Skip any nameless bit fields. */
7037 while (constructor_unfilled_fields != 0
7038 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7039 && DECL_NAME (constructor_unfilled_fields) == 0)
7040 constructor_unfilled_fields =
7041 TREE_CHAIN (constructor_unfilled_fields);
7045 constructor_fields = TREE_CHAIN (constructor_fields);
7046 /* Skip any nameless bit fields at the beginning. */
7047 while (constructor_fields != 0
7048 && DECL_C_BIT_FIELD (constructor_fields)
7049 && DECL_NAME (constructor_fields) == 0)
7050 constructor_fields = TREE_CHAIN (constructor_fields);
7052 else if (TREE_CODE (constructor_type) == UNION_TYPE)
7055 enum tree_code fieldcode;
7057 if (constructor_fields == 0)
7059 pedwarn_init (input_location, 0,
7060 "excess elements in union initializer");
7064 fieldtype = TREE_TYPE (constructor_fields);
7065 if (fieldtype != error_mark_node)
7066 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
7067 fieldcode = TREE_CODE (fieldtype);
7069 /* Warn that traditional C rejects initialization of unions.
7070 We skip the warning if the value is zero. This is done
7071 under the assumption that the zero initializer in user
7072 code appears conditioned on e.g. __STDC__ to avoid
7073 "missing initializer" warnings and relies on default
7074 initialization to zero in the traditional C case.
7075 We also skip the warning if the initializer is designated,
7076 again on the assumption that this must be conditional on
7077 __STDC__ anyway (and we've already complained about the
7078 member-designator already). */
7079 if (!in_system_header && !constructor_designated
7080 && !(value.value && (integer_zerop (value.value)
7081 || real_zerop (value.value))))
7082 warning (OPT_Wtraditional, "traditional C rejects initialization "
7085 /* Accept a string constant to initialize a subarray. */
7086 if (value.value != 0
7087 && fieldcode == ARRAY_TYPE
7088 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
7090 value.value = orig_value;
7091 /* Otherwise, if we have come to a subaggregate,
7092 and we don't have an element of its type, push into it. */
7093 else if (value.value != 0
7094 && value.value != error_mark_node
7095 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
7096 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
7097 || fieldcode == UNION_TYPE))
7099 push_init_level (1);
7105 push_member_name (constructor_fields);
7106 output_init_element (value.value, strict_string,
7107 fieldtype, constructor_fields, 1, implicit);
7108 RESTORE_SPELLING_DEPTH (constructor_depth);
7111 /* Do the bookkeeping for an element that was
7112 directly output as a constructor. */
7114 constructor_bit_index = DECL_SIZE (constructor_fields);
7115 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
7118 constructor_fields = 0;
7120 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7122 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7123 enum tree_code eltcode = TREE_CODE (elttype);
7125 /* Accept a string constant to initialize a subarray. */
7126 if (value.value != 0
7127 && eltcode == ARRAY_TYPE
7128 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
7130 value.value = orig_value;
7131 /* Otherwise, if we have come to a subaggregate,
7132 and we don't have an element of its type, push into it. */
7133 else if (value.value != 0
7134 && value.value != error_mark_node
7135 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
7136 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
7137 || eltcode == UNION_TYPE))
7139 push_init_level (1);
7143 if (constructor_max_index != 0
7144 && (tree_int_cst_lt (constructor_max_index, constructor_index)
7145 || integer_all_onesp (constructor_max_index)))
7147 pedwarn_init (input_location, 0,
7148 "excess elements in array initializer");
7152 /* Now output the actual element. */
7155 push_array_bounds (tree_low_cst (constructor_index, 1));
7156 output_init_element (value.value, strict_string,
7157 elttype, constructor_index, 1, implicit);
7158 RESTORE_SPELLING_DEPTH (constructor_depth);
7162 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
7165 /* If we are doing the bookkeeping for an element that was
7166 directly output as a constructor, we must update
7167 constructor_unfilled_index. */
7168 constructor_unfilled_index = constructor_index;
7170 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
7172 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7174 /* Do a basic check of initializer size. Note that vectors
7175 always have a fixed size derived from their type. */
7176 if (tree_int_cst_lt (constructor_max_index, constructor_index))
7178 pedwarn_init (input_location, 0,
7179 "excess elements in vector initializer");
7183 /* Now output the actual element. */
7185 output_init_element (value.value, strict_string,
7186 elttype, constructor_index, 1, implicit);
7189 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
7192 /* If we are doing the bookkeeping for an element that was
7193 directly output as a constructor, we must update
7194 constructor_unfilled_index. */
7195 constructor_unfilled_index = constructor_index;
7198 /* Handle the sole element allowed in a braced initializer
7199 for a scalar variable. */
7200 else if (constructor_type != error_mark_node
7201 && constructor_fields == 0)
7203 pedwarn_init (input_location, 0,
7204 "excess elements in scalar initializer");
7210 output_init_element (value.value, strict_string,
7211 constructor_type, NULL_TREE, 1, implicit);
7212 constructor_fields = 0;
7215 /* Handle range initializers either at this level or anywhere higher
7216 in the designator stack. */
7217 if (constructor_range_stack)
7219 struct constructor_range_stack *p, *range_stack;
7222 range_stack = constructor_range_stack;
7223 constructor_range_stack = 0;
7224 while (constructor_stack != range_stack->stack)
7226 gcc_assert (constructor_stack->implicit);
7227 process_init_element (pop_init_level (1), true);
7229 for (p = range_stack;
7230 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
7233 gcc_assert (constructor_stack->implicit);
7234 process_init_element (pop_init_level (1), true);
7237 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
7238 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
7243 constructor_index = p->index;
7244 constructor_fields = p->fields;
7245 if (finish && p->range_end && p->index == p->range_start)
7253 push_init_level (2);
7254 p->stack = constructor_stack;
7255 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7256 p->index = p->range_start;
7260 constructor_range_stack = range_stack;
7267 constructor_range_stack = 0;
7270 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7271 (guaranteed to be 'volatile' or null) and ARGS (represented using
7272 an ASM_EXPR node). */
7274 build_asm_stmt (tree cv_qualifier, tree args)
7276 if (!ASM_VOLATILE_P (args) && cv_qualifier)
7277 ASM_VOLATILE_P (args) = 1;
7278 return add_stmt (args);
7281 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7282 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7283 SIMPLE indicates whether there was anything at all after the
7284 string in the asm expression -- asm("blah") and asm("blah" : )
7285 are subtly different. We use a ASM_EXPR node to represent this. */
7287 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7293 const char *constraint;
7294 const char **oconstraints;
7295 bool allows_mem, allows_reg, is_inout;
7296 int ninputs, noutputs;
7298 ninputs = list_length (inputs);
7299 noutputs = list_length (outputs);
7300 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7302 string = resolve_asm_operand_names (string, outputs, inputs);
7304 /* Remove output conversions that change the type but not the mode. */
7305 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7307 tree output = TREE_VALUE (tail);
7309 /* ??? Really, this should not be here. Users should be using a
7310 proper lvalue, dammit. But there's a long history of using casts
7311 in the output operands. In cases like longlong.h, this becomes a
7312 primitive form of typechecking -- if the cast can be removed, then
7313 the output operand had a type of the proper width; otherwise we'll
7314 get an error. Gross, but ... */
7315 STRIP_NOPS (output);
7317 if (!lvalue_or_else (output, lv_asm))
7318 output = error_mark_node;
7320 if (output != error_mark_node
7321 && (TREE_READONLY (output)
7322 || TYPE_READONLY (TREE_TYPE (output))
7323 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7324 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7325 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7326 readonly_error (output, lv_asm);
7328 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7329 oconstraints[i] = constraint;
7331 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7332 &allows_mem, &allows_reg, &is_inout))
7334 /* If the operand is going to end up in memory,
7335 mark it addressable. */
7336 if (!allows_reg && !c_mark_addressable (output))
7337 output = error_mark_node;
7340 output = error_mark_node;
7342 TREE_VALUE (tail) = output;
7345 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7349 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7350 input = TREE_VALUE (tail);
7352 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7353 oconstraints, &allows_mem, &allows_reg))
7355 /* If the operand is going to end up in memory,
7356 mark it addressable. */
7357 if (!allows_reg && allows_mem)
7359 /* Strip the nops as we allow this case. FIXME, this really
7360 should be rejected or made deprecated. */
7362 if (!c_mark_addressable (input))
7363 input = error_mark_node;
7367 input = error_mark_node;
7369 TREE_VALUE (tail) = input;
7372 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7374 /* asm statements without outputs, including simple ones, are treated
7376 ASM_INPUT_P (args) = simple;
7377 ASM_VOLATILE_P (args) = (noutputs == 0);
7382 /* Generate a goto statement to LABEL. */
7385 c_finish_goto_label (tree label)
7387 tree decl = lookup_label (label);
7391 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7393 error ("jump into statement expression");
7397 if (C_DECL_UNJUMPABLE_VM (decl))
7399 error ("jump into scope of identifier with variably modified type");
7403 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7405 /* No jump from outside this statement expression context, so
7406 record that there is a jump from within this context. */
7407 struct c_label_list *nlist;
7408 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7409 nlist->next = label_context_stack_se->labels_used;
7410 nlist->label = decl;
7411 label_context_stack_se->labels_used = nlist;
7414 if (!C_DECL_UNDEFINABLE_VM (decl))
7416 /* No jump from outside this context context of identifiers with
7417 variably modified type, so record that there is a jump from
7418 within this context. */
7419 struct c_label_list *nlist;
7420 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7421 nlist->next = label_context_stack_vm->labels_used;
7422 nlist->label = decl;
7423 label_context_stack_vm->labels_used = nlist;
7426 TREE_USED (decl) = 1;
7427 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7430 /* Generate a computed goto statement to EXPR. */
7433 c_finish_goto_ptr (tree expr)
7435 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7436 expr = c_fully_fold (expr, false, NULL);
7437 expr = convert (ptr_type_node, expr);
7438 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7441 /* Generate a C `return' statement. RETVAL is the expression for what
7442 to return, or a null pointer for `return;' with no value. */
7445 c_finish_return (tree retval)
7447 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7448 bool no_warning = false;
7451 if (TREE_THIS_VOLATILE (current_function_decl))
7452 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7456 npc = null_pointer_constant_p (retval);
7457 retval = c_fully_fold (retval, false, NULL);
7462 current_function_returns_null = 1;
7463 if ((warn_return_type || flag_isoc99)
7464 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7466 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7467 "%<return%> with no value, in "
7468 "function returning non-void");
7472 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7474 current_function_returns_null = 1;
7475 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7476 pedwarn (input_location, 0,
7477 "%<return%> with a value, in function returning void");
7479 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7480 "%<return%> with expression, in function returning void");
7484 tree t = convert_for_assignment (valtype, retval, ic_return, npc,
7485 NULL_TREE, NULL_TREE, 0);
7486 tree res = DECL_RESULT (current_function_decl);
7489 current_function_returns_value = 1;
7490 if (t == error_mark_node)
7493 inner = t = convert (TREE_TYPE (res), t);
7495 /* Strip any conversions, additions, and subtractions, and see if
7496 we are returning the address of a local variable. Warn if so. */
7499 switch (TREE_CODE (inner))
7502 case NON_LVALUE_EXPR:
7504 case POINTER_PLUS_EXPR:
7505 inner = TREE_OPERAND (inner, 0);
7509 /* If the second operand of the MINUS_EXPR has a pointer
7510 type (or is converted from it), this may be valid, so
7511 don't give a warning. */
7513 tree op1 = TREE_OPERAND (inner, 1);
7515 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7516 && (CONVERT_EXPR_P (op1)
7517 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7518 op1 = TREE_OPERAND (op1, 0);
7520 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7523 inner = TREE_OPERAND (inner, 0);
7528 inner = TREE_OPERAND (inner, 0);
7530 while (REFERENCE_CLASS_P (inner)
7531 && TREE_CODE (inner) != INDIRECT_REF)
7532 inner = TREE_OPERAND (inner, 0);
7535 && !DECL_EXTERNAL (inner)
7536 && !TREE_STATIC (inner)
7537 && DECL_CONTEXT (inner) == current_function_decl)
7538 warning (0, "function returns address of local variable");
7548 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7550 if (warn_sequence_point)
7551 verify_sequence_points (retval);
7554 ret_stmt = build_stmt (RETURN_EXPR, retval);
7555 TREE_NO_WARNING (ret_stmt) |= no_warning;
7556 return add_stmt (ret_stmt);
7560 /* The SWITCH_EXPR being built. */
7563 /* The original type of the testing expression, i.e. before the
7564 default conversion is applied. */
7567 /* A splay-tree mapping the low element of a case range to the high
7568 element, or NULL_TREE if there is no high element. Used to
7569 determine whether or not a new case label duplicates an old case
7570 label. We need a tree, rather than simply a hash table, because
7571 of the GNU case range extension. */
7574 /* Number of nested statement expressions within this switch
7575 statement; if nonzero, case and default labels may not
7577 unsigned int blocked_stmt_expr;
7579 /* Scope of outermost declarations of identifiers with variably
7580 modified type within this switch statement; if nonzero, case and
7581 default labels may not appear. */
7582 unsigned int blocked_vm;
7584 /* The next node on the stack. */
7585 struct c_switch *next;
7588 /* A stack of the currently active switch statements. The innermost
7589 switch statement is on the top of the stack. There is no need to
7590 mark the stack for garbage collection because it is only active
7591 during the processing of the body of a function, and we never
7592 collect at that point. */
7594 struct c_switch *c_switch_stack;
7596 /* Start a C switch statement, testing expression EXP. Return the new
7600 c_start_case (tree exp)
7602 tree orig_type = error_mark_node;
7603 struct c_switch *cs;
7605 if (exp != error_mark_node)
7607 orig_type = TREE_TYPE (exp);
7609 if (!INTEGRAL_TYPE_P (orig_type))
7611 if (orig_type != error_mark_node)
7613 error ("switch quantity not an integer");
7614 orig_type = error_mark_node;
7616 exp = integer_zero_node;
7620 tree type = TYPE_MAIN_VARIANT (orig_type);
7622 if (!in_system_header
7623 && (type == long_integer_type_node
7624 || type == long_unsigned_type_node))
7625 warning (OPT_Wtraditional, "%<long%> switch expression not "
7626 "converted to %<int%> in ISO C");
7628 exp = c_fully_fold (exp, false, NULL);
7629 exp = default_conversion (exp);
7631 if (warn_sequence_point)
7632 verify_sequence_points (exp);
7636 /* Add this new SWITCH_EXPR to the stack. */
7637 cs = XNEW (struct c_switch);
7638 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7639 cs->orig_type = orig_type;
7640 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7641 cs->blocked_stmt_expr = 0;
7643 cs->next = c_switch_stack;
7644 c_switch_stack = cs;
7646 return add_stmt (cs->switch_expr);
7649 /* Process a case label. */
7652 do_case (tree low_value, tree high_value)
7654 tree label = NULL_TREE;
7656 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7657 && !c_switch_stack->blocked_vm)
7659 label = c_add_case_label (c_switch_stack->cases,
7660 SWITCH_COND (c_switch_stack->switch_expr),
7661 c_switch_stack->orig_type,
7662 low_value, high_value);
7663 if (label == error_mark_node)
7666 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7669 error ("case label in statement expression not containing "
7670 "enclosing switch statement");
7672 error ("%<default%> label in statement expression not containing "
7673 "enclosing switch statement");
7675 else if (c_switch_stack && c_switch_stack->blocked_vm)
7678 error ("case label in scope of identifier with variably modified "
7679 "type not containing enclosing switch statement");
7681 error ("%<default%> label in scope of identifier with variably "
7682 "modified type not containing enclosing switch statement");
7685 error ("case label not within a switch statement");
7687 error ("%<default%> label not within a switch statement");
7692 /* Finish the switch statement. */
7695 c_finish_case (tree body)
7697 struct c_switch *cs = c_switch_stack;
7698 location_t switch_location;
7700 SWITCH_BODY (cs->switch_expr) = body;
7702 /* We must not be within a statement expression nested in the switch
7703 at this point; we might, however, be within the scope of an
7704 identifier with variably modified type nested in the switch. */
7705 gcc_assert (!cs->blocked_stmt_expr);
7707 /* Emit warnings as needed. */
7708 if (EXPR_HAS_LOCATION (cs->switch_expr))
7709 switch_location = EXPR_LOCATION (cs->switch_expr);
7711 switch_location = input_location;
7712 c_do_switch_warnings (cs->cases, switch_location,
7713 TREE_TYPE (cs->switch_expr),
7714 SWITCH_COND (cs->switch_expr));
7716 /* Pop the stack. */
7717 c_switch_stack = cs->next;
7718 splay_tree_delete (cs->cases);
7722 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7723 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7724 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7725 statement, and was not surrounded with parenthesis. */
7728 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7729 tree else_block, bool nested_if)
7733 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7734 if (warn_parentheses && nested_if && else_block == NULL)
7736 tree inner_if = then_block;
7738 /* We know from the grammar productions that there is an IF nested
7739 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7740 it might not be exactly THEN_BLOCK, but should be the last
7741 non-container statement within. */
7743 switch (TREE_CODE (inner_if))
7748 inner_if = BIND_EXPR_BODY (inner_if);
7750 case STATEMENT_LIST:
7751 inner_if = expr_last (then_block);
7753 case TRY_FINALLY_EXPR:
7754 case TRY_CATCH_EXPR:
7755 inner_if = TREE_OPERAND (inner_if, 0);
7762 if (COND_EXPR_ELSE (inner_if))
7763 warning (OPT_Wparentheses,
7764 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7768 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7769 SET_EXPR_LOCATION (stmt, if_locus);
7773 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7774 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7775 is false for DO loops. INCR is the FOR increment expression. BODY is
7776 the statement controlled by the loop. BLAB is the break label. CLAB is
7777 the continue label. Everything is allowed to be NULL. */
7780 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7781 tree blab, tree clab, bool cond_is_first)
7783 tree entry = NULL, exit = NULL, t;
7785 /* If the condition is zero don't generate a loop construct. */
7786 if (cond && integer_zerop (cond))
7790 t = build_and_jump (&blab);
7791 SET_EXPR_LOCATION (t, start_locus);
7797 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7799 /* If we have an exit condition, then we build an IF with gotos either
7800 out of the loop, or to the top of it. If there's no exit condition,
7801 then we just build a jump back to the top. */
7802 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7804 if (cond && !integer_nonzerop (cond))
7806 /* Canonicalize the loop condition to the end. This means
7807 generating a branch to the loop condition. Reuse the
7808 continue label, if possible. */
7813 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7814 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7817 t = build1 (GOTO_EXPR, void_type_node, clab);
7818 SET_EXPR_LOCATION (t, start_locus);
7822 t = build_and_jump (&blab);
7823 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7825 SET_EXPR_LOCATION (exit, start_locus);
7827 SET_EXPR_LOCATION (exit, input_location);
7836 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7844 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7848 c_finish_bc_stmt (tree *label_p, bool is_break)
7851 tree label = *label_p;
7853 /* In switch statements break is sometimes stylistically used after
7854 a return statement. This can lead to spurious warnings about
7855 control reaching the end of a non-void function when it is
7856 inlined. Note that we are calling block_may_fallthru with
7857 language specific tree nodes; this works because
7858 block_may_fallthru returns true when given something it does not
7860 skip = !block_may_fallthru (cur_stmt_list);
7865 *label_p = label = create_artificial_label ();
7867 else if (TREE_CODE (label) == LABEL_DECL)
7869 else switch (TREE_INT_CST_LOW (label))
7873 error ("break statement not within loop or switch");
7875 error ("continue statement not within a loop");
7879 gcc_assert (is_break);
7880 error ("break statement used with OpenMP for loop");
7891 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7893 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7896 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7899 emit_side_effect_warnings (tree expr)
7901 if (expr == error_mark_node)
7903 else if (!TREE_SIDE_EFFECTS (expr))
7905 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7906 warning (OPT_Wunused_value, "%Hstatement with no effect",
7907 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7910 warn_if_unused_value (expr, input_location);
7913 /* Process an expression as if it were a complete statement. Emit
7914 diagnostics, but do not call ADD_STMT. */
7917 c_process_expr_stmt (tree expr)
7922 expr = c_fully_fold (expr, false, NULL);
7924 if (warn_sequence_point)
7925 verify_sequence_points (expr);
7927 if (TREE_TYPE (expr) != error_mark_node
7928 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7929 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7930 error ("expression statement has incomplete type");
7932 /* If we're not processing a statement expression, warn about unused values.
7933 Warnings for statement expressions will be emitted later, once we figure
7934 out which is the result. */
7935 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7936 && warn_unused_value)
7937 emit_side_effect_warnings (expr);
7939 /* If the expression is not of a type to which we cannot assign a line
7940 number, wrap the thing in a no-op NOP_EXPR. */
7941 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7942 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7944 if (CAN_HAVE_LOCATION_P (expr))
7945 SET_EXPR_LOCATION (expr, input_location);
7950 /* Emit an expression as a statement. */
7953 c_finish_expr_stmt (tree expr)
7956 return add_stmt (c_process_expr_stmt (expr));
7961 /* Do the opposite and emit a statement as an expression. To begin,
7962 create a new binding level and return it. */
7965 c_begin_stmt_expr (void)
7968 struct c_label_context_se *nstack;
7969 struct c_label_list *glist;
7971 /* We must force a BLOCK for this level so that, if it is not expanded
7972 later, there is a way to turn off the entire subtree of blocks that
7973 are contained in it. */
7975 ret = c_begin_compound_stmt (true);
7978 c_switch_stack->blocked_stmt_expr++;
7979 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7981 for (glist = label_context_stack_se->labels_used;
7983 glist = glist->next)
7985 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7987 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7988 nstack->labels_def = NULL;
7989 nstack->labels_used = NULL;
7990 nstack->next = label_context_stack_se;
7991 label_context_stack_se = nstack;
7993 /* Mark the current statement list as belonging to a statement list. */
7994 STATEMENT_LIST_STMT_EXPR (ret) = 1;
8000 c_finish_stmt_expr (tree body)
8002 tree last, type, tmp, val;
8004 struct c_label_list *dlist, *glist, *glist_prev = NULL;
8006 body = c_end_compound_stmt (body, true);
8009 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
8010 c_switch_stack->blocked_stmt_expr--;
8012 /* It is no longer possible to jump to labels defined within this
8013 statement expression. */
8014 for (dlist = label_context_stack_se->labels_def;
8016 dlist = dlist->next)
8018 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
8020 /* It is again possible to define labels with a goto just outside
8021 this statement expression. */
8022 for (glist = label_context_stack_se->next->labels_used;
8024 glist = glist->next)
8026 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
8029 if (glist_prev != NULL)
8030 glist_prev->next = label_context_stack_se->labels_used;
8032 label_context_stack_se->next->labels_used
8033 = label_context_stack_se->labels_used;
8034 label_context_stack_se = label_context_stack_se->next;
8036 /* Locate the last statement in BODY. See c_end_compound_stmt
8037 about always returning a BIND_EXPR. */
8038 last_p = &BIND_EXPR_BODY (body);
8039 last = BIND_EXPR_BODY (body);
8042 if (TREE_CODE (last) == STATEMENT_LIST)
8044 tree_stmt_iterator i;
8046 /* This can happen with degenerate cases like ({ }). No value. */
8047 if (!TREE_SIDE_EFFECTS (last))
8050 /* If we're supposed to generate side effects warnings, process
8051 all of the statements except the last. */
8052 if (warn_unused_value)
8054 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
8055 emit_side_effect_warnings (tsi_stmt (i));
8058 i = tsi_last (last);
8059 last_p = tsi_stmt_ptr (i);
8063 /* If the end of the list is exception related, then the list was split
8064 by a call to push_cleanup. Continue searching. */
8065 if (TREE_CODE (last) == TRY_FINALLY_EXPR
8066 || TREE_CODE (last) == TRY_CATCH_EXPR)
8068 last_p = &TREE_OPERAND (last, 0);
8070 goto continue_searching;
8073 /* In the case that the BIND_EXPR is not necessary, return the
8074 expression out from inside it. */
8075 if (last == error_mark_node
8076 || (last == BIND_EXPR_BODY (body)
8077 && BIND_EXPR_VARS (body) == NULL))
8079 /* Even if this looks constant, do not allow it in a constant
8081 last = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (last), NULL_TREE, last);
8082 C_MAYBE_CONST_EXPR_NON_CONST (last) = 1;
8083 /* Do not warn if the return value of a statement expression is
8085 TREE_NO_WARNING (last) = 1;
8089 /* Extract the type of said expression. */
8090 type = TREE_TYPE (last);
8092 /* If we're not returning a value at all, then the BIND_EXPR that
8093 we already have is a fine expression to return. */
8094 if (!type || VOID_TYPE_P (type))
8097 /* Now that we've located the expression containing the value, it seems
8098 silly to make voidify_wrapper_expr repeat the process. Create a
8099 temporary of the appropriate type and stick it in a TARGET_EXPR. */
8100 tmp = create_tmp_var_raw (type, NULL);
8102 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
8103 tree_expr_nonnegative_p giving up immediately. */
8105 if (TREE_CODE (val) == NOP_EXPR
8106 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
8107 val = TREE_OPERAND (val, 0);
8109 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
8110 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
8112 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
8115 /* Begin the scope of an identifier of variably modified type, scope
8116 number SCOPE. Jumping from outside this scope to inside it is not
8120 c_begin_vm_scope (unsigned int scope)
8122 struct c_label_context_vm *nstack;
8123 struct c_label_list *glist;
8125 gcc_assert (scope > 0);
8127 /* At file_scope, we don't have to do any processing. */
8128 if (label_context_stack_vm == NULL)
8131 if (c_switch_stack && !c_switch_stack->blocked_vm)
8132 c_switch_stack->blocked_vm = scope;
8133 for (glist = label_context_stack_vm->labels_used;
8135 glist = glist->next)
8137 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
8139 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
8140 nstack->labels_def = NULL;
8141 nstack->labels_used = NULL;
8142 nstack->scope = scope;
8143 nstack->next = label_context_stack_vm;
8144 label_context_stack_vm = nstack;
8147 /* End a scope which may contain identifiers of variably modified
8148 type, scope number SCOPE. */
8151 c_end_vm_scope (unsigned int scope)
8153 if (label_context_stack_vm == NULL)
8155 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
8156 c_switch_stack->blocked_vm = 0;
8157 /* We may have a number of nested scopes of identifiers with
8158 variably modified type, all at this depth. Pop each in turn. */
8159 while (label_context_stack_vm->scope == scope)
8161 struct c_label_list *dlist, *glist, *glist_prev = NULL;
8163 /* It is no longer possible to jump to labels defined within this
8165 for (dlist = label_context_stack_vm->labels_def;
8167 dlist = dlist->next)
8169 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
8171 /* It is again possible to define labels with a goto just outside
8173 for (glist = label_context_stack_vm->next->labels_used;
8175 glist = glist->next)
8177 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
8180 if (glist_prev != NULL)
8181 glist_prev->next = label_context_stack_vm->labels_used;
8183 label_context_stack_vm->next->labels_used
8184 = label_context_stack_vm->labels_used;
8185 label_context_stack_vm = label_context_stack_vm->next;
8189 /* Begin and end compound statements. This is as simple as pushing
8190 and popping new statement lists from the tree. */
8193 c_begin_compound_stmt (bool do_scope)
8195 tree stmt = push_stmt_list ();
8202 c_end_compound_stmt (tree stmt, bool do_scope)
8208 if (c_dialect_objc ())
8209 objc_clear_super_receiver ();
8210 block = pop_scope ();
8213 stmt = pop_stmt_list (stmt);
8214 stmt = c_build_bind_expr (block, stmt);
8216 /* If this compound statement is nested immediately inside a statement
8217 expression, then force a BIND_EXPR to be created. Otherwise we'll
8218 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
8219 STATEMENT_LISTs merge, and thus we can lose track of what statement
8222 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
8223 && TREE_CODE (stmt) != BIND_EXPR)
8225 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
8226 TREE_SIDE_EFFECTS (stmt) = 1;
8232 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
8233 when the current scope is exited. EH_ONLY is true when this is not
8234 meant to apply to normal control flow transfer. */
8237 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
8239 enum tree_code code;
8243 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
8244 stmt = build_stmt (code, NULL, cleanup);
8246 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
8247 list = push_stmt_list ();
8248 TREE_OPERAND (stmt, 0) = list;
8249 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
8252 /* Build a binary-operation expression without default conversions.
8253 CODE is the kind of expression to build.
8254 LOCATION is the operator's location.
8255 This function differs from `build' in several ways:
8256 the data type of the result is computed and recorded in it,
8257 warnings are generated if arg data types are invalid,
8258 special handling for addition and subtraction of pointers is known,
8259 and some optimization is done (operations on narrow ints
8260 are done in the narrower type when that gives the same result).
8261 Constant folding is also done before the result is returned.
8263 Note that the operands will never have enumeral types, or function
8264 or array types, because either they will have the default conversions
8265 performed or they have both just been converted to some other type in which
8266 the arithmetic is to be done. */
8269 build_binary_op (location_t location, enum tree_code code,
8270 tree orig_op0, tree orig_op1, int convert_p)
8273 enum tree_code code0, code1;
8275 tree ret = error_mark_node;
8276 const char *invalid_op_diag;
8277 bool int_const, int_const_or_overflow, int_operands;
8279 /* Expression code to give to the expression when it is built.
8280 Normally this is CODE, which is what the caller asked for,
8281 but in some special cases we change it. */
8282 enum tree_code resultcode = code;
8284 /* Data type in which the computation is to be performed.
8285 In the simplest cases this is the common type of the arguments. */
8286 tree result_type = NULL;
8288 /* Nonzero means operands have already been type-converted
8289 in whatever way is necessary.
8290 Zero means they need to be converted to RESULT_TYPE. */
8293 /* Nonzero means create the expression with this type, rather than
8295 tree build_type = 0;
8297 /* Nonzero means after finally constructing the expression
8298 convert it to this type. */
8299 tree final_type = 0;
8301 /* Nonzero if this is an operation like MIN or MAX which can
8302 safely be computed in short if both args are promoted shorts.
8303 Also implies COMMON.
8304 -1 indicates a bitwise operation; this makes a difference
8305 in the exact conditions for when it is safe to do the operation
8306 in a narrower mode. */
8309 /* Nonzero if this is a comparison operation;
8310 if both args are promoted shorts, compare the original shorts.
8311 Also implies COMMON. */
8312 int short_compare = 0;
8314 /* Nonzero if this is a right-shift operation, which can be computed on the
8315 original short and then promoted if the operand is a promoted short. */
8316 int short_shift = 0;
8318 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8321 /* True means types are compatible as far as ObjC is concerned. */
8324 if (location == UNKNOWN_LOCATION)
8325 location = input_location;
8327 int_operands = (EXPR_INT_CONST_OPERANDS (orig_op0)
8328 && EXPR_INT_CONST_OPERANDS (orig_op1));
8331 int_const_or_overflow = (TREE_CODE (orig_op0) == INTEGER_CST
8332 && TREE_CODE (orig_op1) == INTEGER_CST);
8333 int_const = (int_const_or_overflow
8334 && !TREE_OVERFLOW (orig_op0)
8335 && !TREE_OVERFLOW (orig_op1));
8338 int_const = int_const_or_overflow = false;
8342 op0 = default_conversion (orig_op0);
8343 op1 = default_conversion (orig_op1);
8351 type0 = TREE_TYPE (op0);
8352 type1 = TREE_TYPE (op1);
8354 /* The expression codes of the data types of the arguments tell us
8355 whether the arguments are integers, floating, pointers, etc. */
8356 code0 = TREE_CODE (type0);
8357 code1 = TREE_CODE (type1);
8359 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8360 STRIP_TYPE_NOPS (op0);
8361 STRIP_TYPE_NOPS (op1);
8363 /* If an error was already reported for one of the arguments,
8364 avoid reporting another error. */
8366 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8367 return error_mark_node;
8369 if ((invalid_op_diag
8370 = targetm.invalid_binary_op (code, type0, type1)))
8372 error_at (location, invalid_op_diag);
8373 return error_mark_node;
8376 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8381 /* Handle the pointer + int case. */
8382 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8384 ret = pointer_int_sum (location, PLUS_EXPR, op0, op1);
8385 goto return_build_binary_op;
8387 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8389 ret = pointer_int_sum (location, PLUS_EXPR, op1, op0);
8390 goto return_build_binary_op;
8397 /* Subtraction of two similar pointers.
8398 We must subtract them as integers, then divide by object size. */
8399 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8400 && comp_target_types (type0, type1))
8402 ret = pointer_diff (op0, op1);
8403 goto return_build_binary_op;
8405 /* Handle pointer minus int. Just like pointer plus int. */
8406 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8408 ret = pointer_int_sum (location, MINUS_EXPR, op0, op1);
8409 goto return_build_binary_op;
8419 case TRUNC_DIV_EXPR:
8421 case FLOOR_DIV_EXPR:
8422 case ROUND_DIV_EXPR:
8423 case EXACT_DIV_EXPR:
8424 warn_for_div_by_zero (location, op1);
8426 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8427 || code0 == FIXED_POINT_TYPE
8428 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8429 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8430 || code1 == FIXED_POINT_TYPE
8431 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8433 enum tree_code tcode0 = code0, tcode1 = code1;
8435 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8436 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8437 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8438 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8440 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8441 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8442 resultcode = RDIV_EXPR;
8444 /* Although it would be tempting to shorten always here, that
8445 loses on some targets, since the modulo instruction is
8446 undefined if the quotient can't be represented in the
8447 computation mode. We shorten only if unsigned or if
8448 dividing by something we know != -1. */
8449 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8450 || (TREE_CODE (op1) == INTEGER_CST
8451 && !integer_all_onesp (op1)));
8459 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8461 /* Allow vector types which are not floating point types. */
8462 else if (code0 == VECTOR_TYPE
8463 && code1 == VECTOR_TYPE
8464 && !VECTOR_FLOAT_TYPE_P (type0)
8465 && !VECTOR_FLOAT_TYPE_P (type1))
8469 case TRUNC_MOD_EXPR:
8470 case FLOOR_MOD_EXPR:
8471 warn_for_div_by_zero (location, op1);
8473 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8475 /* Although it would be tempting to shorten always here, that loses
8476 on some targets, since the modulo instruction is undefined if the
8477 quotient can't be represented in the computation mode. We shorten
8478 only if unsigned or if dividing by something we know != -1. */
8479 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8480 || (TREE_CODE (op1) == INTEGER_CST
8481 && !integer_all_onesp (op1)));
8486 case TRUTH_ANDIF_EXPR:
8487 case TRUTH_ORIF_EXPR:
8488 case TRUTH_AND_EXPR:
8490 case TRUTH_XOR_EXPR:
8491 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8492 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8493 || code0 == FIXED_POINT_TYPE)
8494 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8495 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8496 || code1 == FIXED_POINT_TYPE))
8498 /* Result of these operations is always an int,
8499 but that does not mean the operands should be
8500 converted to ints! */
8501 result_type = integer_type_node;
8502 op0 = c_common_truthvalue_conversion (location, op0);
8503 op1 = c_common_truthvalue_conversion (location, op1);
8506 if (code == TRUTH_ANDIF_EXPR)
8508 int_const_or_overflow = (int_operands
8509 && TREE_CODE (orig_op0) == INTEGER_CST
8510 && (op0 == truthvalue_false_node
8511 || TREE_CODE (orig_op1) == INTEGER_CST));
8512 int_const = (int_const_or_overflow
8513 && !TREE_OVERFLOW (orig_op0)
8514 && (op0 == truthvalue_false_node
8515 || !TREE_OVERFLOW (orig_op1)));
8517 else if (code == TRUTH_ORIF_EXPR)
8519 int_const_or_overflow = (int_operands
8520 && TREE_CODE (orig_op0) == INTEGER_CST
8521 && (op0 == truthvalue_true_node
8522 || TREE_CODE (orig_op1) == INTEGER_CST));
8523 int_const = (int_const_or_overflow
8524 && !TREE_OVERFLOW (orig_op0)
8525 && (op0 == truthvalue_true_node
8526 || !TREE_OVERFLOW (orig_op1)));
8530 /* Shift operations: result has same type as first operand;
8531 always convert second operand to int.
8532 Also set SHORT_SHIFT if shifting rightward. */
8535 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8536 && code1 == INTEGER_TYPE)
8538 if (TREE_CODE (op1) == INTEGER_CST)
8540 if (tree_int_cst_sgn (op1) < 0)
8543 if (skip_evaluation == 0)
8544 warning (0, "right shift count is negative");
8548 if (!integer_zerop (op1))
8551 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8554 if (skip_evaluation == 0)
8555 warning (0, "right shift count >= width of type");
8560 /* Use the type of the value to be shifted. */
8561 result_type = type0;
8562 /* Convert the shift-count to an integer, regardless of size
8563 of value being shifted. */
8564 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8565 op1 = convert (integer_type_node, op1);
8566 /* Avoid converting op1 to result_type later. */
8572 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8573 && code1 == INTEGER_TYPE)
8575 if (TREE_CODE (op1) == INTEGER_CST)
8577 if (tree_int_cst_sgn (op1) < 0)
8580 if (skip_evaluation == 0)
8581 warning (0, "left shift count is negative");
8584 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8587 if (skip_evaluation == 0)
8588 warning (0, "left shift count >= width of type");
8592 /* Use the type of the value to be shifted. */
8593 result_type = type0;
8594 /* Convert the shift-count to an integer, regardless of size
8595 of value being shifted. */
8596 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8597 op1 = convert (integer_type_node, op1);
8598 /* Avoid converting op1 to result_type later. */
8605 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8606 warning_at (location,
8608 "comparing floating point with == or != is unsafe");
8609 /* Result of comparison is always int,
8610 but don't convert the args to int! */
8611 build_type = integer_type_node;
8612 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8613 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8614 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8615 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8617 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8619 tree tt0 = TREE_TYPE (type0);
8620 tree tt1 = TREE_TYPE (type1);
8621 /* Anything compares with void *. void * compares with anything.
8622 Otherwise, the targets must be compatible
8623 and both must be object or both incomplete. */
8624 if (comp_target_types (type0, type1))
8625 result_type = common_pointer_type (type0, type1);
8626 else if (VOID_TYPE_P (tt0))
8628 /* op0 != orig_op0 detects the case of something
8629 whose value is 0 but which isn't a valid null ptr const. */
8630 if (pedantic && !null_pointer_constant_p (orig_op0)
8631 && TREE_CODE (tt1) == FUNCTION_TYPE)
8632 pedwarn (location, OPT_pedantic, "ISO C forbids "
8633 "comparison of %<void *%> with function pointer");
8635 else if (VOID_TYPE_P (tt1))
8637 if (pedantic && !null_pointer_constant_p (orig_op1)
8638 && TREE_CODE (tt0) == FUNCTION_TYPE)
8639 pedwarn (location, OPT_pedantic, "ISO C forbids "
8640 "comparison of %<void *%> with function pointer");
8643 /* Avoid warning about the volatile ObjC EH puts on decls. */
8645 pedwarn (location, 0,
8646 "comparison of distinct pointer types lacks a cast");
8648 if (result_type == NULL_TREE)
8649 result_type = ptr_type_node;
8651 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8653 if (TREE_CODE (op0) == ADDR_EXPR
8654 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8655 warning_at (location,
8656 OPT_Waddress, "the address of %qD will never be NULL",
8657 TREE_OPERAND (op0, 0));
8658 result_type = type0;
8660 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8662 if (TREE_CODE (op1) == ADDR_EXPR
8663 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8664 warning_at (location,
8665 OPT_Waddress, "the address of %qD will never be NULL",
8666 TREE_OPERAND (op1, 0));
8667 result_type = type1;
8669 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8671 result_type = type0;
8672 pedwarn (location, 0, "comparison between pointer and integer");
8674 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8676 result_type = type1;
8677 pedwarn (location, 0, "comparison between pointer and integer");
8685 build_type = integer_type_node;
8686 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8687 || code0 == FIXED_POINT_TYPE)
8688 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8689 || code1 == FIXED_POINT_TYPE))
8691 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8693 if (comp_target_types (type0, type1))
8695 result_type = common_pointer_type (type0, type1);
8696 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8697 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8698 pedwarn (location, 0,
8699 "comparison of complete and incomplete pointers");
8700 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8701 pedwarn (location, OPT_pedantic, "ISO C forbids "
8702 "ordered comparisons of pointers to functions");
8706 result_type = ptr_type_node;
8707 pedwarn (location, 0,
8708 "comparison of distinct pointer types lacks a cast");
8711 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8713 result_type = type0;
8715 pedwarn (location, OPT_pedantic,
8716 "ordered comparison of pointer with integer zero");
8717 else if (extra_warnings)
8718 warning_at (location, OPT_Wextra,
8719 "ordered comparison of pointer with integer zero");
8721 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8723 result_type = type1;
8724 pedwarn (location, OPT_pedantic,
8725 "ordered comparison of pointer with integer zero");
8727 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8729 result_type = type0;
8730 pedwarn (location, 0, "comparison between pointer and integer");
8732 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8734 result_type = type1;
8735 pedwarn (location, 0, "comparison between pointer and integer");
8743 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8744 return error_mark_node;
8746 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8747 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8748 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8749 TREE_TYPE (type1))))
8751 binary_op_error (location, code, type0, type1);
8752 return error_mark_node;
8755 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8756 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8758 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8759 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8761 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8763 if (shorten || common || short_compare)
8765 result_type = c_common_type (type0, type1);
8766 if (result_type == error_mark_node)
8767 return error_mark_node;
8770 /* For certain operations (which identify themselves by shorten != 0)
8771 if both args were extended from the same smaller type,
8772 do the arithmetic in that type and then extend.
8774 shorten !=0 and !=1 indicates a bitwise operation.
8775 For them, this optimization is safe only if
8776 both args are zero-extended or both are sign-extended.
8777 Otherwise, we might change the result.
8778 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8779 but calculated in (unsigned short) it would be (unsigned short)-1. */
8781 if (shorten && none_complex)
8783 final_type = result_type;
8784 result_type = shorten_binary_op (result_type, op0, op1,
8788 /* Shifts can be shortened if shifting right. */
8793 tree arg0 = get_narrower (op0, &unsigned_arg);
8795 final_type = result_type;
8797 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8798 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8800 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8801 /* We can shorten only if the shift count is less than the
8802 number of bits in the smaller type size. */
8803 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8804 /* We cannot drop an unsigned shift after sign-extension. */
8805 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8807 /* Do an unsigned shift if the operand was zero-extended. */
8809 = c_common_signed_or_unsigned_type (unsigned_arg,
8811 /* Convert value-to-be-shifted to that type. */
8812 if (TREE_TYPE (op0) != result_type)
8813 op0 = convert (result_type, op0);
8818 /* Comparison operations are shortened too but differently.
8819 They identify themselves by setting short_compare = 1. */
8823 /* Don't write &op0, etc., because that would prevent op0
8824 from being kept in a register.
8825 Instead, make copies of the our local variables and
8826 pass the copies by reference, then copy them back afterward. */
8827 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8828 enum tree_code xresultcode = resultcode;
8830 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8835 goto return_build_binary_op;
8838 op0 = xop0, op1 = xop1;
8840 resultcode = xresultcode;
8842 if (!skip_evaluation)
8844 bool op0_maybe_const = true;
8845 bool op1_maybe_const = true;
8846 tree orig_op0_folded, orig_op1_folded;
8848 if (in_late_binary_op)
8850 orig_op0_folded = orig_op0;
8851 orig_op1_folded = orig_op1;
8855 /* Fold for the sake of possible warnings, as in
8856 build_conditional_expr. This requires the
8857 "original" values to be folded, not just op0 and
8859 op0 = c_fully_fold (op0, require_constant_value,
8861 op1 = c_fully_fold (op1, require_constant_value,
8863 orig_op0_folded = c_fully_fold (orig_op0,
8864 require_constant_value,
8866 orig_op1_folded = c_fully_fold (orig_op1,
8867 require_constant_value,
8871 if (warn_sign_compare)
8872 warn_for_sign_compare (location, orig_op0_folded,
8873 orig_op1_folded, op0, op1,
8874 result_type, resultcode);
8875 if (!in_late_binary_op)
8877 if (!op0_maybe_const || TREE_CODE (op0) != INTEGER_CST)
8879 op0 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op0),
8881 C_MAYBE_CONST_EXPR_NON_CONST (op0) = !op0_maybe_const;
8883 if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
8885 op1 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op1),
8887 C_MAYBE_CONST_EXPR_NON_CONST (op1) = !op1_maybe_const;
8894 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8895 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8896 Then the expression will be built.
8897 It will be given type FINAL_TYPE if that is nonzero;
8898 otherwise, it will be given type RESULT_TYPE. */
8902 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
8903 return error_mark_node;
8908 if (TREE_TYPE (op0) != result_type)
8909 op0 = convert_and_check (result_type, op0);
8910 if (TREE_TYPE (op1) != result_type)
8911 op1 = convert_and_check (result_type, op1);
8913 /* This can happen if one operand has a vector type, and the other
8914 has a different type. */
8915 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8916 return error_mark_node;
8919 if (build_type == NULL_TREE)
8920 build_type = result_type;
8922 /* Treat expressions in initializers specially as they can't trap. */
8923 if (int_const_or_overflow)
8924 ret = (require_constant_value
8925 ? fold_build2_initializer (resultcode, build_type, op0, op1)
8926 : fold_build2 (resultcode, build_type, op0, op1));
8928 ret = build2 (resultcode, build_type, op0, op1);
8929 if (final_type != 0)
8930 ret = convert (final_type, ret);
8932 return_build_binary_op:
8933 gcc_assert (ret != error_mark_node);
8934 if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret) && !int_const)
8936 ? note_integer_operands (ret)
8937 : build1 (NOP_EXPR, TREE_TYPE (ret), ret));
8938 else if (TREE_CODE (ret) != INTEGER_CST && int_operands
8939 && !in_late_binary_op)
8940 ret = note_integer_operands (ret);
8941 protected_set_expr_location (ret, location);
8946 /* Convert EXPR to be a truth-value, validating its type for this
8947 purpose. LOCATION is the source location for the expression. */
8950 c_objc_common_truthvalue_conversion (location_t location, tree expr)
8952 bool int_const, int_operands;
8954 switch (TREE_CODE (TREE_TYPE (expr)))
8957 error_at (location, "used array that cannot be converted to pointer where scalar is required");
8958 return error_mark_node;
8961 error_at (location, "used struct type value where scalar is required");
8962 return error_mark_node;
8965 error_at (location, "used union type value where scalar is required");
8966 return error_mark_node;
8975 int_const = (TREE_CODE (expr) == INTEGER_CST && !TREE_OVERFLOW (expr));
8976 int_operands = EXPR_INT_CONST_OPERANDS (expr);
8978 /* ??? Should we also give an error for void and vectors rather than
8979 leaving those to give errors later? */
8980 expr = c_common_truthvalue_conversion (location, expr);
8982 if (TREE_CODE (expr) == INTEGER_CST && int_operands && !int_const)
8984 if (TREE_OVERFLOW (expr))
8987 return note_integer_operands (expr);
8989 if (TREE_CODE (expr) == INTEGER_CST && !int_const)
8990 return build1 (NOP_EXPR, TREE_TYPE (expr), expr);
8995 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8999 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
9001 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
9003 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
9004 /* Executing a compound literal inside a function reinitializes
9006 if (!TREE_STATIC (decl))
9014 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9017 c_begin_omp_parallel (void)
9022 block = c_begin_compound_stmt (true);
9027 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
9030 c_finish_omp_parallel (tree clauses, tree block)
9034 block = c_end_compound_stmt (block, true);
9036 stmt = make_node (OMP_PARALLEL);
9037 TREE_TYPE (stmt) = void_type_node;
9038 OMP_PARALLEL_CLAUSES (stmt) = clauses;
9039 OMP_PARALLEL_BODY (stmt) = block;
9041 return add_stmt (stmt);
9044 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9047 c_begin_omp_task (void)
9052 block = c_begin_compound_stmt (true);
9057 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
9060 c_finish_omp_task (tree clauses, tree block)
9064 block = c_end_compound_stmt (block, true);
9066 stmt = make_node (OMP_TASK);
9067 TREE_TYPE (stmt) = void_type_node;
9068 OMP_TASK_CLAUSES (stmt) = clauses;
9069 OMP_TASK_BODY (stmt) = block;
9071 return add_stmt (stmt);
9074 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
9075 Remove any elements from the list that are invalid. */
9078 c_finish_omp_clauses (tree clauses)
9080 bitmap_head generic_head, firstprivate_head, lastprivate_head;
9081 tree c, t, *pc = &clauses;
9084 bitmap_obstack_initialize (NULL);
9085 bitmap_initialize (&generic_head, &bitmap_default_obstack);
9086 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
9087 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
9089 for (pc = &clauses, c = clauses; c ; c = *pc)
9091 bool remove = false;
9092 bool need_complete = false;
9093 bool need_implicitly_determined = false;
9095 switch (OMP_CLAUSE_CODE (c))
9097 case OMP_CLAUSE_SHARED:
9099 need_implicitly_determined = true;
9100 goto check_dup_generic;
9102 case OMP_CLAUSE_PRIVATE:
9104 need_complete = true;
9105 need_implicitly_determined = true;
9106 goto check_dup_generic;
9108 case OMP_CLAUSE_REDUCTION:
9110 need_implicitly_determined = true;
9111 t = OMP_CLAUSE_DECL (c);
9112 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
9113 || POINTER_TYPE_P (TREE_TYPE (t)))
9115 error ("%qE has invalid type for %<reduction%>", t);
9118 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
9120 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
9121 const char *r_name = NULL;
9138 case TRUTH_ANDIF_EXPR:
9141 case TRUTH_ORIF_EXPR:
9149 error ("%qE has invalid type for %<reduction(%s)%>",
9154 goto check_dup_generic;
9156 case OMP_CLAUSE_COPYPRIVATE:
9157 name = "copyprivate";
9158 goto check_dup_generic;
9160 case OMP_CLAUSE_COPYIN:
9162 t = OMP_CLAUSE_DECL (c);
9163 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
9165 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
9168 goto check_dup_generic;
9171 t = OMP_CLAUSE_DECL (c);
9172 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9174 error ("%qE is not a variable in clause %qs", t, name);
9177 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9178 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
9179 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
9181 error ("%qE appears more than once in data clauses", t);
9185 bitmap_set_bit (&generic_head, DECL_UID (t));
9188 case OMP_CLAUSE_FIRSTPRIVATE:
9189 name = "firstprivate";
9190 t = OMP_CLAUSE_DECL (c);
9191 need_complete = true;
9192 need_implicitly_determined = true;
9193 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9195 error ("%qE is not a variable in clause %<firstprivate%>", t);
9198 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9199 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
9201 error ("%qE appears more than once in data clauses", t);
9205 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
9208 case OMP_CLAUSE_LASTPRIVATE:
9209 name = "lastprivate";
9210 t = OMP_CLAUSE_DECL (c);
9211 need_complete = true;
9212 need_implicitly_determined = true;
9213 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9215 error ("%qE is not a variable in clause %<lastprivate%>", t);
9218 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9219 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
9221 error ("%qE appears more than once in data clauses", t);
9225 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
9229 case OMP_CLAUSE_NUM_THREADS:
9230 case OMP_CLAUSE_SCHEDULE:
9231 case OMP_CLAUSE_NOWAIT:
9232 case OMP_CLAUSE_ORDERED:
9233 case OMP_CLAUSE_DEFAULT:
9234 case OMP_CLAUSE_UNTIED:
9235 case OMP_CLAUSE_COLLAPSE:
9236 pc = &OMP_CLAUSE_CHAIN (c);
9245 t = OMP_CLAUSE_DECL (c);
9249 t = require_complete_type (t);
9250 if (t == error_mark_node)
9254 if (need_implicitly_determined)
9256 const char *share_name = NULL;
9258 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
9259 share_name = "threadprivate";
9260 else switch (c_omp_predetermined_sharing (t))
9262 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
9264 case OMP_CLAUSE_DEFAULT_SHARED:
9265 share_name = "shared";
9267 case OMP_CLAUSE_DEFAULT_PRIVATE:
9268 share_name = "private";
9275 error ("%qE is predetermined %qs for %qs",
9276 t, share_name, name);
9283 *pc = OMP_CLAUSE_CHAIN (c);
9285 pc = &OMP_CLAUSE_CHAIN (c);
9288 bitmap_obstack_release (NULL);
9292 /* Make a variant type in the proper way for C/C++, propagating qualifiers
9293 down to the element type of an array. */
9296 c_build_qualified_type (tree type, int type_quals)
9298 if (type == error_mark_node)
9301 if (TREE_CODE (type) == ARRAY_TYPE)
9304 tree element_type = c_build_qualified_type (TREE_TYPE (type),
9307 /* See if we already have an identically qualified type. */
9308 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
9310 if (TYPE_QUALS (strip_array_types (t)) == type_quals
9311 && TYPE_NAME (t) == TYPE_NAME (type)
9312 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
9313 && attribute_list_equal (TYPE_ATTRIBUTES (t),
9314 TYPE_ATTRIBUTES (type)))
9319 tree domain = TYPE_DOMAIN (type);
9321 t = build_variant_type_copy (type);
9322 TREE_TYPE (t) = element_type;
9324 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
9325 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
9326 SET_TYPE_STRUCTURAL_EQUALITY (t);
9327 else if (TYPE_CANONICAL (element_type) != element_type
9328 || (domain && TYPE_CANONICAL (domain) != domain))
9330 tree unqualified_canon
9331 = build_array_type (TYPE_CANONICAL (element_type),
9332 domain? TYPE_CANONICAL (domain)
9335 = c_build_qualified_type (unqualified_canon, type_quals);
9338 TYPE_CANONICAL (t) = t;
9343 /* A restrict-qualified pointer type must be a pointer to object or
9344 incomplete type. Note that the use of POINTER_TYPE_P also allows
9345 REFERENCE_TYPEs, which is appropriate for C++. */
9346 if ((type_quals & TYPE_QUAL_RESTRICT)
9347 && (!POINTER_TYPE_P (type)
9348 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
9350 error ("invalid use of %<restrict%>");
9351 type_quals &= ~TYPE_QUAL_RESTRICT;
9354 return build_qualified_type (type, type_quals);