1 /* Report error messages, build initializers, and perform
2 some front-end optimizations for C++ compiler.
3 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
4 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008
5 Free Software Foundation, Inc.
6 Hacked by Michael Tiemann (tiemann@cygnus.com)
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* This file is part of the C++ front end.
26 It contains routines to build C++ expressions given their operands,
27 including computing the types of the result, C and C++ specific error
28 checks, and some optimization. */
32 #include "coretypes.h"
39 #include "diagnostic.h"
43 process_init_constructor (tree type, tree init);
46 /* Print an error message stemming from an attempt to use
47 BASETYPE as a base class for TYPE. */
50 error_not_base_type (tree basetype, tree type)
52 if (TREE_CODE (basetype) == FUNCTION_DECL)
53 basetype = DECL_CONTEXT (basetype);
54 error ("type %qT is not a base type for type %qT", basetype, type);
55 return error_mark_node;
59 binfo_or_else (tree base, tree type)
61 tree binfo = lookup_base (type, base, ba_unique, NULL);
63 if (binfo == error_mark_node)
66 error_not_base_type (base, type);
70 /* According to ARM $7.1.6, "A `const' object may be initialized, but its
71 value may not be changed thereafter. */
74 readonly_error (tree arg, const char* string)
78 if (TREE_CODE (arg) == COMPONENT_REF)
80 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
81 fmt = "%s of data-member %qD in read-only structure";
83 fmt = "%s of read-only data-member %qD";
84 error (fmt, string, TREE_OPERAND (arg, 1));
86 else if (TREE_CODE (arg) == VAR_DECL)
88 if (DECL_LANG_SPECIFIC (arg)
89 && DECL_IN_AGGR_P (arg)
90 && !TREE_STATIC (arg))
91 fmt = "%s of constant field %qD";
93 fmt = "%s of read-only variable %qD";
94 error (fmt, string, arg);
96 else if (TREE_CODE (arg) == PARM_DECL)
97 error ("%s of read-only parameter %qD", string, arg);
98 else if (TREE_CODE (arg) == INDIRECT_REF
99 && TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))) == REFERENCE_TYPE
100 && (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL
101 || TREE_CODE (TREE_OPERAND (arg, 0)) == PARM_DECL))
102 error ("%s of read-only reference %qD", string, TREE_OPERAND (arg, 0));
103 else if (TREE_CODE (arg) == RESULT_DECL)
104 error ("%s of read-only named return value %qD", string, arg);
105 else if (TREE_CODE (arg) == FUNCTION_DECL)
106 error ("%s of function %qD", string, arg);
108 error ("%s of read-only location %qE", string, arg);
112 /* Structure that holds information about declarations whose type was
113 incomplete and we could not check whether it was abstract or not. */
115 struct pending_abstract_type GTY((chain_next ("%h.next")))
117 /* Declaration which we are checking for abstractness. It is either
118 a DECL node, or an IDENTIFIER_NODE if we do not have a full
119 declaration available. */
122 /* Type which will be checked for abstractness. */
125 /* Position of the declaration. This is only needed for IDENTIFIER_NODEs,
126 because DECLs already carry locus information. */
129 /* Link to the next element in list. */
130 struct pending_abstract_type* next;
134 /* Compute the hash value of the node VAL. This function is used by the
135 hash table abstract_pending_vars. */
138 pat_calc_hash (const void* val)
140 const struct pending_abstract_type *pat =
141 (const struct pending_abstract_type *) val;
142 return (hashval_t) TYPE_UID (pat->type);
146 /* Compare node VAL1 with the type VAL2. This function is used by the
147 hash table abstract_pending_vars. */
150 pat_compare (const void* val1, const void* val2)
152 const struct pending_abstract_type *const pat1 =
153 (const struct pending_abstract_type *) val1;
154 const_tree const type2 = (const_tree)val2;
156 return (pat1->type == type2);
159 /* Hash table that maintains pending_abstract_type nodes, for which we still
160 need to check for type abstractness. The key of the table is the type
161 of the declaration. */
162 static GTY ((param_is (struct pending_abstract_type)))
163 htab_t abstract_pending_vars = NULL;
166 /* This function is called after TYPE is completed, and will check if there
167 are pending declarations for which we still need to verify the abstractness
168 of TYPE, and emit a diagnostic (through abstract_virtuals_error) if TYPE
169 turned out to be incomplete. */
172 complete_type_check_abstract (tree type)
175 struct pending_abstract_type *pat;
176 location_t cur_loc = input_location;
178 gcc_assert (COMPLETE_TYPE_P (type));
180 if (!abstract_pending_vars)
183 /* Retrieve the list of pending declarations for this type. */
184 slot = htab_find_slot_with_hash (abstract_pending_vars, type,
185 (hashval_t)TYPE_UID (type), NO_INSERT);
188 pat = (struct pending_abstract_type*)*slot;
191 /* If the type is not abstract, do not do anything. */
192 if (CLASSTYPE_PURE_VIRTUALS (type))
194 struct pending_abstract_type *prev = 0, *next;
196 /* Reverse the list to emit the errors in top-down order. */
197 for (; pat; pat = next)
205 /* Go through the list, and call abstract_virtuals_error for each
206 element: it will issue a diagnostic if the type is abstract. */
209 gcc_assert (type == pat->type);
211 /* Tweak input_location so that the diagnostic appears at the correct
212 location. Notice that this is only needed if the decl is an
214 input_location = pat->locus;
215 abstract_virtuals_error (pat->decl, pat->type);
220 htab_clear_slot (abstract_pending_vars, slot);
222 input_location = cur_loc;
226 /* If TYPE has abstract virtual functions, issue an error about trying
227 to create an object of that type. DECL is the object declared, or
228 NULL_TREE if the declaration is unavailable. Returns 1 if an error
229 occurred; zero if all was well. */
232 abstract_virtuals_error (tree decl, tree type)
236 /* This function applies only to classes. Any other entity can never
238 if (!CLASS_TYPE_P (type))
241 /* If the type is incomplete, we register it within a hash table,
242 so that we can check again once it is completed. This makes sense
243 only for objects for which we have a declaration or at least a
245 if (!COMPLETE_TYPE_P (type))
248 struct pending_abstract_type *pat;
250 gcc_assert (!decl || DECL_P (decl)
251 || TREE_CODE (decl) == IDENTIFIER_NODE);
253 if (!abstract_pending_vars)
254 abstract_pending_vars = htab_create_ggc (31, &pat_calc_hash,
257 slot = htab_find_slot_with_hash (abstract_pending_vars, type,
258 (hashval_t)TYPE_UID (type), INSERT);
260 pat = GGC_NEW (struct pending_abstract_type);
263 pat->locus = ((decl && DECL_P (decl))
264 ? DECL_SOURCE_LOCATION (decl)
267 pat->next = (struct pending_abstract_type *) *slot;
273 if (!TYPE_SIZE (type))
274 /* TYPE is being defined, and during that time
275 CLASSTYPE_PURE_VIRTUALS holds the inline friends. */
278 pure = CLASSTYPE_PURE_VIRTUALS (type);
284 if (TREE_CODE (decl) == RESULT_DECL)
287 if (TREE_CODE (decl) == VAR_DECL)
288 error ("cannot declare variable %q+D to be of abstract "
289 "type %qT", decl, type);
290 else if (TREE_CODE (decl) == PARM_DECL)
291 error ("cannot declare parameter %q+D to be of abstract type %qT",
293 else if (TREE_CODE (decl) == FIELD_DECL)
294 error ("cannot declare field %q+D to be of abstract type %qT",
296 else if (TREE_CODE (decl) == FUNCTION_DECL
297 && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
298 error ("invalid abstract return type for member function %q+#D", decl);
299 else if (TREE_CODE (decl) == FUNCTION_DECL)
300 error ("invalid abstract return type for function %q+#D", decl);
301 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
302 /* Here we do not have location information. */
303 error ("invalid abstract type %qT for %qE", type, decl);
305 error ("invalid abstract type for %q+D", decl);
308 error ("cannot allocate an object of abstract type %qT", type);
310 /* Only go through this once. */
311 if (VEC_length (tree, pure))
316 inform (input_location, "%J because the following virtual functions are pure "
317 "within %qT:", TYPE_MAIN_DECL (type), type);
319 for (ix = 0; VEC_iterate (tree, pure, ix, fn); ix++)
320 inform (input_location, "\t%+#D", fn);
321 /* Now truncate the vector. This leaves it non-null, so we know
322 there are pure virtuals, but empty so we don't list them out
324 VEC_truncate (tree, pure, 0);
327 inform (input_location, "%J since type %qT has pure virtual functions",
328 TYPE_MAIN_DECL (type), type);
333 /* Print an error message for invalid use of an incomplete type.
334 VALUE is the expression that was used (or 0 if that isn't known)
335 and TYPE is the type that was invalid. DIAG_KIND indicates the
336 type of diagnostic (see diagnostic.def). */
339 cxx_incomplete_type_diagnostic (const_tree value, const_tree type,
340 diagnostic_t diag_kind)
344 gcc_assert (diag_kind == DK_WARNING
345 || diag_kind == DK_PEDWARN
346 || diag_kind == DK_ERROR);
348 /* Avoid duplicate error message. */
349 if (TREE_CODE (type) == ERROR_MARK)
352 if (value != 0 && (TREE_CODE (value) == VAR_DECL
353 || TREE_CODE (value) == PARM_DECL
354 || TREE_CODE (value) == FIELD_DECL))
356 emit_diagnostic (diag_kind, input_location, 0,
357 "%q+D has incomplete type", value);
361 /* We must print an error message. Be clever about what it says. */
363 switch (TREE_CODE (type))
369 emit_diagnostic (diag_kind, input_location, 0,
370 "invalid use of incomplete type %q#T", type);
371 if (!TYPE_TEMPLATE_INFO (type))
372 emit_diagnostic (diag_kind, input_location, 0,
373 "forward declaration of %q+#T", type);
375 emit_diagnostic (diag_kind, input_location, 0,
376 "declaration of %q+#T", type);
380 emit_diagnostic (diag_kind, input_location, 0,
381 "invalid use of %qT", type);
385 if (TYPE_DOMAIN (type))
387 type = TREE_TYPE (type);
390 emit_diagnostic (diag_kind, input_location, 0,
391 "invalid use of array with unspecified bounds");
396 emit_diagnostic (diag_kind, input_location, 0,
397 "invalid use of member (did you forget the %<&%> ?)");
400 case TEMPLATE_TYPE_PARM:
402 emit_diagnostic (diag_kind, input_location, 0,
403 "invalid use of %<auto%>");
405 emit_diagnostic (diag_kind, input_location, 0,
406 "invalid use of template type parameter %qT", type);
409 case BOUND_TEMPLATE_TEMPLATE_PARM:
410 emit_diagnostic (diag_kind, input_location, 0,
411 "invalid use of template template parameter %qT",
416 emit_diagnostic (diag_kind, input_location, 0,
417 "invalid use of dependent type %qT", type);
421 if (value && TREE_CODE (value) == COMPONENT_REF)
423 else if (value && TREE_CODE (value) == ADDR_EXPR)
424 emit_diagnostic (diag_kind, input_location, 0,
425 "address of overloaded function with no contextual "
427 else if (value && TREE_CODE (value) == OVERLOAD)
428 emit_diagnostic (diag_kind, input_location, 0,
429 "overloaded function with no contextual type information");
431 emit_diagnostic (diag_kind, input_location, 0,
432 "insufficient contextual information to determine type");
440 /* Backward-compatibility interface to incomplete_type_diagnostic;
441 required by ../tree.c. */
442 #undef cxx_incomplete_type_error
444 cxx_incomplete_type_error (const_tree value, const_tree type)
446 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
450 /* The recursive part of split_nonconstant_init. DEST is an lvalue
451 expression to which INIT should be assigned. INIT is a CONSTRUCTOR. */
454 split_nonconstant_init_1 (tree dest, tree init)
456 unsigned HOST_WIDE_INT idx;
457 tree field_index, value;
458 tree type = TREE_TYPE (dest);
459 tree inner_type = NULL;
460 bool array_type_p = false;
462 switch (TREE_CODE (type))
465 inner_type = TREE_TYPE (type);
471 case QUAL_UNION_TYPE:
472 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx,
475 /* The current implementation of this algorithm assumes that
476 the field was set for all the elements. This is usually done
477 by process_init_constructor. */
478 gcc_assert (field_index);
481 inner_type = TREE_TYPE (field_index);
483 if (TREE_CODE (value) == CONSTRUCTOR)
488 sub = build4 (ARRAY_REF, inner_type, dest, field_index,
489 NULL_TREE, NULL_TREE);
491 sub = build3 (COMPONENT_REF, inner_type, dest, field_index,
494 split_nonconstant_init_1 (sub, value);
496 else if (!initializer_constant_valid_p (value, inner_type))
501 /* FIXME: Ordered removal is O(1) so the whole function is
502 worst-case quadratic. This could be fixed using an aside
503 bitmap to record which elements must be removed and remove
504 them all at the same time. Or by merging
505 split_non_constant_init into process_init_constructor_array,
506 that is separating constants from non-constants while building
508 VEC_ordered_remove (constructor_elt, CONSTRUCTOR_ELTS (init),
513 sub = build4 (ARRAY_REF, inner_type, dest, field_index,
514 NULL_TREE, NULL_TREE);
516 sub = build3 (COMPONENT_REF, inner_type, dest, field_index,
519 code = build2 (INIT_EXPR, inner_type, sub, value);
520 code = build_stmt (EXPR_STMT, code);
528 if (!initializer_constant_valid_p (init, type))
531 tree cons = copy_node (init);
532 CONSTRUCTOR_ELTS (init) = NULL;
533 code = build2 (MODIFY_EXPR, type, dest, cons);
534 code = build_stmt (EXPR_STMT, code);
543 /* The rest of the initializer is now a constant. */
544 TREE_CONSTANT (init) = 1;
547 /* A subroutine of store_init_value. Splits non-constant static
548 initializer INIT into a constant part and generates code to
549 perform the non-constant part of the initialization to DEST.
550 Returns the code for the runtime init. */
553 split_nonconstant_init (tree dest, tree init)
557 if (TREE_CODE (init) == CONSTRUCTOR)
559 code = push_stmt_list ();
560 split_nonconstant_init_1 (dest, init);
561 code = pop_stmt_list (code);
562 DECL_INITIAL (dest) = init;
563 TREE_READONLY (dest) = 0;
566 code = build2 (INIT_EXPR, TREE_TYPE (dest), dest, init);
571 /* Perform appropriate conversions on the initial value of a variable,
572 store it in the declaration DECL,
573 and print any error messages that are appropriate.
574 If the init is invalid, store an ERROR_MARK.
576 C++: Note that INIT might be a TREE_LIST, which would mean that it is
577 a base class initializer for some aggregate type, hopefully compatible
578 with DECL. If INIT is a single element, and DECL is an aggregate
579 type, we silently convert INIT into a TREE_LIST, allowing a constructor
582 If INIT is a TREE_LIST and there is no constructor, turn INIT
583 into a CONSTRUCTOR and use standard initialization techniques.
584 Perhaps a warning should be generated?
586 Returns code to be executed if initialization could not be performed
587 for static variable. In that case, caller must emit the code. */
590 store_init_value (tree decl, tree init)
594 /* If variable's type was invalidly declared, just ignore it. */
596 type = TREE_TYPE (decl);
597 if (TREE_CODE (type) == ERROR_MARK)
600 if (MAYBE_CLASS_TYPE_P (type))
602 gcc_assert (TYPE_HAS_TRIVIAL_INIT_REF (type)
603 || TREE_CODE (init) == CONSTRUCTOR);
605 if (TREE_CODE (init) == TREE_LIST)
607 error ("constructor syntax used, but no constructor declared "
608 "for type %qT", type);
609 init = build_constructor_from_list (init_list_type_node, nreverse (init));
612 else if (TREE_CODE (init) == TREE_LIST
613 && TREE_TYPE (init) != unknown_type_node)
615 if (TREE_CODE (decl) == RESULT_DECL)
616 init = build_x_compound_expr_from_list (init,
617 "return value initializer");
618 else if (TREE_CODE (init) == TREE_LIST
619 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
621 error ("cannot initialize arrays using this syntax");
625 /* We get here with code like `int a (2);' */
626 init = build_x_compound_expr_from_list (init, "initializer");
629 /* End of special C++ code. */
631 /* Digest the specified initializer into an expression. */
632 value = digest_init (type, init);
633 /* If the initializer is not a constant, fill in DECL_INITIAL with
634 the bits that are constant, and then return an expression that
635 will perform the dynamic initialization. */
636 if (value != error_mark_node
637 && (TREE_SIDE_EFFECTS (value)
638 || ! initializer_constant_valid_p (value, TREE_TYPE (value))))
639 return split_nonconstant_init (decl, value);
640 /* If the value is a constant, just put it in DECL_INITIAL. If DECL
641 is an automatic variable, the middle end will turn this into a
642 dynamic initialization later. */
643 DECL_INITIAL (decl) = value;
648 /* Give errors about narrowing conversions within { }. */
651 check_narrowing (tree type, tree init)
653 tree ftype = unlowered_expr_type (init);
656 bool was_decl = false;
661 init = decl_constant_value (init);
664 if (TREE_CODE (type) == INTEGER_TYPE
665 && TREE_CODE (ftype) == REAL_TYPE)
667 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (ftype)
668 && CP_INTEGRAL_TYPE_P (type))
670 if (TYPE_PRECISION (type) < TYPE_PRECISION (ftype)
671 && (TREE_CODE (init) != INTEGER_CST
672 || !int_fits_type_p (init, type)))
675 else if (TREE_CODE (ftype) == REAL_TYPE
676 && TREE_CODE (type) == REAL_TYPE)
678 if (TYPE_PRECISION (type) < TYPE_PRECISION (ftype))
681 if (TREE_CODE (init) == REAL_CST)
683 d = TREE_REAL_CST (init);
684 if (exact_real_truncate (TYPE_MODE (type), &d)
685 /* FIXME: As a temporary workaround for PR 36963, don't
686 complain about narrowing from a floating
687 literal. Hopefully this will be resolved at the
688 September 2008 C++ meeting. */
694 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (ftype)
695 && TREE_CODE (type) == REAL_TYPE)
698 if (TREE_CODE (init) == INTEGER_CST)
700 d = real_value_from_int_cst (0, init);
701 if (exact_real_truncate (TYPE_MODE (type), &d))
707 permerror (input_location, "narrowing conversion of %qE from %qT to %qT inside { }",
711 /* Process the initializer INIT for a variable of type TYPE, emitting
712 diagnostics for invalid initializers and converting the initializer as
715 For aggregate types, it assumes that reshape_init has already run, thus the
716 initializer will have the right shape (brace elision has been undone).
718 NESTED is true iff we are being called for an element of a CONSTRUCTOR. */
721 digest_init_r (tree type, tree init, bool nested)
723 enum tree_code code = TREE_CODE (type);
725 if (init == error_mark_node)
726 return error_mark_node;
730 /* We must strip the outermost array type when completing the type,
731 because the its bounds might be incomplete at the moment. */
732 if (!complete_type_or_else (TREE_CODE (type) == ARRAY_TYPE
733 ? TREE_TYPE (type) : type, NULL_TREE))
734 return error_mark_node;
736 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue
737 (g++.old-deja/g++.law/casts2.C). */
738 if (TREE_CODE (init) == NON_LVALUE_EXPR)
739 init = TREE_OPERAND (init, 0);
741 /* Initialization of an array of chars from a string constant. The initializer
742 can be optionally enclosed in braces, but reshape_init has already removed
743 them if they were present. */
744 if (code == ARRAY_TYPE)
746 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
747 if (char_type_p (typ1)
749 && TREE_CODE (init) == STRING_CST)
751 tree char_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (init)));
753 if (TYPE_PRECISION (typ1) == BITS_PER_UNIT)
755 if (char_type != char_type_node)
757 error ("char-array initialized from wide string");
758 return error_mark_node;
763 if (char_type == char_type_node)
765 error ("int-array initialized from non-wide string");
766 return error_mark_node;
768 else if (char_type != typ1)
770 error ("int-array initialized from incompatible wide string");
771 return error_mark_node;
775 TREE_TYPE (init) = type;
776 if (TYPE_DOMAIN (type) != 0 && TREE_CONSTANT (TYPE_SIZE (type)))
778 int size = TREE_INT_CST_LOW (TYPE_SIZE (type));
779 size = (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
780 /* In C it is ok to subtract 1 from the length of the string
781 because it's ok to ignore the terminating null char that is
782 counted in the length of the constant, but in C++ this would
784 if (size < TREE_STRING_LENGTH (init))
785 permerror (input_location, "initializer-string for array of chars is too long");
791 /* Handle scalar types (including conversions) and references. */
792 if (TREE_CODE (type) != COMPLEX_TYPE
793 && (SCALAR_TYPE_P (type) || code == REFERENCE_TYPE))
797 if (cxx_dialect != cxx98 && nested)
798 check_narrowing (type, init);
799 init = convert_for_initialization (0, type, init, LOOKUP_NORMAL,
800 "initialization", NULL_TREE, 0,
801 tf_warning_or_error);
804 /* Skip any conversions since we'll be outputting the underlying
806 while (CONVERT_EXPR_P (*exp)
807 || TREE_CODE (*exp) == NON_LVALUE_EXPR)
808 exp = &TREE_OPERAND (*exp, 0);
810 *exp = cplus_expand_constant (*exp);
815 /* Come here only for aggregates: records, arrays, unions, complex numbers
817 gcc_assert (TREE_CODE (type) == ARRAY_TYPE
818 || TREE_CODE (type) == VECTOR_TYPE
819 || TREE_CODE (type) == RECORD_TYPE
820 || TREE_CODE (type) == UNION_TYPE
821 || TREE_CODE (type) == COMPLEX_TYPE);
823 if (BRACE_ENCLOSED_INITIALIZER_P (init)
824 && !TYPE_NON_AGGREGATE_CLASS (type))
825 return process_init_constructor (type, init);
828 if (COMPOUND_LITERAL_P (init) && TREE_CODE (type) == ARRAY_TYPE)
830 error ("cannot initialize aggregate of type %qT with "
831 "a compound literal", type);
833 return error_mark_node;
836 if (TREE_CODE (type) == ARRAY_TYPE
837 && TREE_CODE (init) != CONSTRUCTOR)
839 error ("array must be initialized with a brace-enclosed"
841 return error_mark_node;
844 return convert_for_initialization (NULL_TREE, type, init,
845 LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING,
846 "initialization", NULL_TREE, 0,
847 tf_warning_or_error);
852 digest_init (tree type, tree init)
854 return digest_init_r (type, init, false);
857 /* Set of flags used within process_init_constructor to describe the
859 #define PICFLAG_ERRONEOUS 1
860 #define PICFLAG_NOT_ALL_CONSTANT 2
861 #define PICFLAG_NOT_ALL_SIMPLE 4
863 /* Given an initializer INIT, return the flag (PICFLAG_*) which better
867 picflag_from_initializer (tree init)
869 if (init == error_mark_node)
870 return PICFLAG_ERRONEOUS;
871 else if (!TREE_CONSTANT (init))
872 return PICFLAG_NOT_ALL_CONSTANT;
873 else if (!initializer_constant_valid_p (init, TREE_TYPE (init)))
874 return PICFLAG_NOT_ALL_SIMPLE;
878 /* Subroutine of process_init_constructor, which will process an initializer
879 INIT for an array or vector of type TYPE. Returns the flags (PICFLAG_*)
880 which describe the initializers. */
883 process_init_constructor_array (tree type, tree init)
885 unsigned HOST_WIDE_INT i, len = 0;
887 bool unbounded = false;
889 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (init);
891 gcc_assert (TREE_CODE (type) == ARRAY_TYPE
892 || TREE_CODE (type) == VECTOR_TYPE);
894 if (TREE_CODE (type) == ARRAY_TYPE)
896 tree domain = TYPE_DOMAIN (type);
898 len = (TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain))
899 - TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain))
902 unbounded = true; /* Take as many as there are. */
905 /* Vectors are like simple fixed-size arrays. */
906 len = TYPE_VECTOR_SUBPARTS (type);
908 /* There cannot be more initializers than needed as otherwise
909 reshape_init would have already rejected the initializer. */
911 gcc_assert (VEC_length (constructor_elt, v) <= len);
913 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
917 gcc_assert (TREE_CODE (ce->index) == INTEGER_CST);
918 if (compare_tree_int (ce->index, i) != 0)
920 ce->value = error_mark_node;
921 sorry ("non-trivial designated initializers not supported");
925 ce->index = size_int (i);
926 gcc_assert (ce->value);
927 ce->value = digest_init_r (TREE_TYPE (type), ce->value, true);
929 if (ce->value != error_mark_node)
930 gcc_assert (same_type_ignoring_top_level_qualifiers_p
931 (TREE_TYPE (type), TREE_TYPE (ce->value)));
933 flags |= picflag_from_initializer (ce->value);
936 /* No more initializers. If the array is unbounded, we are done. Otherwise,
937 we must add initializers ourselves. */
943 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (type)))
945 /* If this type needs constructors run for default-initialization,
946 we can't rely on the back end to do it for us, so build up
947 TARGET_EXPRs. If the type in question is a class, just build
948 one up; if it's an array, recurse. */
949 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (type)))
950 next = build_functional_cast (TREE_TYPE (type), NULL_TREE,
951 tf_warning_or_error);
953 next = build_constructor (init_list_type_node, NULL);
954 next = digest_init (TREE_TYPE (type), next);
956 else if (!zero_init_p (TREE_TYPE (type)))
957 next = build_zero_init (TREE_TYPE (type),
959 /*static_storage_p=*/false);
961 /* The default zero-initialization is fine for us; don't
962 add anything to the CONSTRUCTOR. */
965 flags |= picflag_from_initializer (next);
966 CONSTRUCTOR_APPEND_ELT (v, size_int (i), next);
969 CONSTRUCTOR_ELTS (init) = v;
973 /* Subroutine of process_init_constructor, which will process an initializer
974 INIT for a class of type TYPE. Returns the flags (PICFLAG_*) which describe
978 process_init_constructor_record (tree type, tree init)
980 VEC(constructor_elt,gc) *v = NULL;
983 unsigned HOST_WIDE_INT idx = 0;
985 gcc_assert (TREE_CODE (type) == RECORD_TYPE);
986 gcc_assert (!CLASSTYPE_VBASECLASSES (type));
987 gcc_assert (!TYPE_BINFO (type)
988 || !BINFO_N_BASE_BINFOS (TYPE_BINFO (type)));
989 gcc_assert (!TYPE_POLYMORPHIC_P (type));
991 /* Generally, we will always have an index for each initializer (which is
992 a FIELD_DECL, put by reshape_init), but compound literals don't go trough
993 reshape_init. So we need to handle both cases. */
994 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
999 if (!DECL_NAME (field) && DECL_C_BIT_FIELD (field))
1001 flags |= picflag_from_initializer (integer_zero_node);
1002 CONSTRUCTOR_APPEND_ELT (v, field, integer_zero_node);
1006 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1009 /* If this is a bitfield, first convert to the declared type. */
1010 type = TREE_TYPE (field);
1011 if (DECL_BIT_FIELD_TYPE (field))
1012 type = DECL_BIT_FIELD_TYPE (field);
1014 if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)))
1016 constructor_elt *ce = VEC_index (constructor_elt,
1017 CONSTRUCTOR_ELTS (init), idx);
1020 /* We can have either a FIELD_DECL or an IDENTIFIER_NODE. The
1021 latter case can happen in templates where lookup has to be
1023 gcc_assert (TREE_CODE (ce->index) == FIELD_DECL
1024 || TREE_CODE (ce->index) == IDENTIFIER_NODE);
1025 if (ce->index != field
1026 && ce->index != DECL_NAME (field))
1028 ce->value = error_mark_node;
1029 sorry ("non-trivial designated initializers not supported");
1033 gcc_assert (ce->value);
1034 next = digest_init_r (type, ce->value, true);
1037 else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field)))
1039 /* If this type needs constructors run for
1040 default-initialization, we can't rely on the back end to do it
1041 for us, so build up TARGET_EXPRs. If the type in question is
1042 a class, just build one up; if it's an array, recurse. */
1043 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (field)))
1044 next = build_functional_cast (TREE_TYPE (field), NULL_TREE,
1045 tf_warning_or_error);
1047 next = build_constructor (init_list_type_node, NULL);
1049 next = digest_init_r (TREE_TYPE (field), next, true);
1051 /* Warn when some struct elements are implicitly initialized. */
1052 warning (OPT_Wmissing_field_initializers,
1053 "missing initializer for member %qD", field);
1057 if (TREE_READONLY (field))
1058 error ("uninitialized const member %qD", field);
1059 else if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (TREE_TYPE (field)))
1060 error ("member %qD with uninitialized const fields", field);
1061 else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE)
1062 error ("member %qD is uninitialized reference", field);
1064 /* Warn when some struct elements are implicitly initialized
1066 warning (OPT_Wmissing_field_initializers,
1067 "missing initializer for member %qD", field);
1069 if (!zero_init_p (TREE_TYPE (field)))
1070 next = build_zero_init (TREE_TYPE (field), /*nelts=*/NULL_TREE,
1071 /*static_storage_p=*/false);
1073 /* The default zero-initialization is fine for us; don't
1074 add anything to the CONSTRUCTOR. */
1078 /* If this is a bitfield, now convert to the lowered type. */
1079 if (type != TREE_TYPE (field))
1080 next = cp_convert_and_check (TREE_TYPE (field), next);
1081 flags |= picflag_from_initializer (next);
1082 CONSTRUCTOR_APPEND_ELT (v, field, next);
1085 if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)))
1086 error ("too many initializers for %qT", type);
1088 CONSTRUCTOR_ELTS (init) = v;
1092 /* Subroutine of process_init_constructor, which will process a single
1093 initializer INIT for a union of type TYPE. Returns the flags (PICFLAG_*)
1094 which describe the initializer. */
1097 process_init_constructor_union (tree type, tree init)
1099 constructor_elt *ce;
1102 /* If the initializer was empty, use default zero initialization. */
1103 if (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init)))
1106 len = VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init));
1109 error ("too many initializers for %qT", type);
1110 VEC_block_remove (constructor_elt, CONSTRUCTOR_ELTS (init), 1, len-1);
1113 ce = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (init), 0);
1115 /* If this element specifies a field, initialize via that field. */
1118 if (TREE_CODE (ce->index) == FIELD_DECL)
1120 else if (TREE_CODE (ce->index) == IDENTIFIER_NODE)
1122 /* This can happen within a cast, see g++.dg/opt/cse2.C. */
1123 tree name = ce->index;
1125 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1126 if (DECL_NAME (field) == name)
1130 error ("no field %qD found in union being initialized", field);
1131 ce->value = error_mark_node;
1137 gcc_assert (TREE_CODE (ce->index) == INTEGER_CST
1138 || TREE_CODE (ce->index) == RANGE_EXPR);
1139 error ("index value instead of field name in union initializer");
1140 ce->value = error_mark_node;
1145 /* Find the first named field. ANSI decided in September 1990
1146 that only named fields count here. */
1147 tree field = TYPE_FIELDS (type);
1148 while (field && (!DECL_NAME (field) || TREE_CODE (field) != FIELD_DECL))
1149 field = TREE_CHAIN (field);
1150 if (field == NULL_TREE)
1152 error ("too many initializers for %qT", type);
1153 ce->value = error_mark_node;
1158 if (ce->value && ce->value != error_mark_node)
1159 ce->value = digest_init_r (TREE_TYPE (ce->index), ce->value, true);
1161 return picflag_from_initializer (ce->value);
1164 /* Process INIT, a constructor for a variable of aggregate type TYPE. The
1165 constructor is a brace-enclosed initializer, and will be modified in-place.
1167 Each element is converted to the right type through digest_init, and
1168 missing initializers are added following the language rules (zero-padding,
1171 After the execution, the initializer will have TREE_CONSTANT if all elts are
1172 constant, and TREE_STATIC set if, in addition, all elts are simple enough
1173 constants that the assembler and linker can compute them.
1175 The function returns the initializer itself, or error_mark_node in case
1179 process_init_constructor (tree type, tree init)
1183 gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init));
1185 if (TREE_CODE (type) == ARRAY_TYPE || TREE_CODE (type) == VECTOR_TYPE)
1186 flags = process_init_constructor_array (type, init);
1187 else if (TREE_CODE (type) == RECORD_TYPE)
1188 flags = process_init_constructor_record (type, init);
1189 else if (TREE_CODE (type) == UNION_TYPE)
1190 flags = process_init_constructor_union (type, init);
1194 if (flags & PICFLAG_ERRONEOUS)
1195 return error_mark_node;
1197 TREE_TYPE (init) = type;
1198 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == NULL_TREE)
1199 cp_complete_array_type (&TREE_TYPE (init), init, /*do_default=*/0);
1200 if (!(flags & PICFLAG_NOT_ALL_CONSTANT))
1202 TREE_CONSTANT (init) = 1;
1203 if (!(flags & PICFLAG_NOT_ALL_SIMPLE))
1204 TREE_STATIC (init) = 1;
1209 /* Given a structure or union value DATUM, construct and return
1210 the structure or union component which results from narrowing
1211 that value to the base specified in BASETYPE. For example, given the
1214 class L { int ii; };
1215 class A : L { ... };
1216 class B : L { ... };
1217 class C : A, B { ... };
1225 x.A::ii refers to the ii member of the L part of
1226 the A part of the C object named by X. In this case,
1227 DATUM would be x, and BASETYPE would be A.
1229 I used to think that this was nonconformant, that the standard specified
1230 that first we look up ii in A, then convert x to an L& and pull out the
1231 ii part. But in fact, it does say that we convert x to an A&; A here
1232 is known as the "naming class". (jason 2000-12-19)
1234 BINFO_P points to a variable initialized either to NULL_TREE or to the
1235 binfo for the specific base subobject we want to convert to. */
1238 build_scoped_ref (tree datum, tree basetype, tree* binfo_p)
1242 if (datum == error_mark_node)
1243 return error_mark_node;
1247 binfo = lookup_base (TREE_TYPE (datum), basetype, ba_check, NULL);
1249 if (!binfo || binfo == error_mark_node)
1251 *binfo_p = NULL_TREE;
1253 error_not_base_type (basetype, TREE_TYPE (datum));
1254 return error_mark_node;
1258 return build_base_path (PLUS_EXPR, datum, binfo, 1);
1261 /* Build a reference to an object specified by the C++ `->' operator.
1262 Usually this just involves dereferencing the object, but if the
1263 `->' operator is overloaded, then such overloads must be
1264 performed until an object which does not have the `->' operator
1265 overloaded is found. An error is reported when circular pointer
1266 delegation is detected. */
1269 build_x_arrow (tree expr)
1271 tree orig_expr = expr;
1272 tree types_memoized = NULL_TREE;
1273 tree type = TREE_TYPE (expr);
1274 tree last_rval = NULL_TREE;
1276 if (type == error_mark_node)
1277 return error_mark_node;
1279 if (processing_template_decl)
1281 if (type_dependent_expression_p (expr))
1282 return build_min_nt (ARROW_EXPR, expr);
1283 expr = build_non_dependent_expr (expr);
1286 if (MAYBE_CLASS_TYPE_P (type))
1288 while ((expr = build_new_op (COMPONENT_REF, LOOKUP_NORMAL, expr,
1289 NULL_TREE, NULL_TREE,
1290 /*overloaded_p=*/NULL,
1291 tf_warning_or_error)))
1293 if (expr == error_mark_node)
1294 return error_mark_node;
1296 if (value_member (TREE_TYPE (expr), types_memoized))
1298 error ("circular pointer delegation detected");
1299 return error_mark_node;
1303 types_memoized = tree_cons (NULL_TREE, TREE_TYPE (expr),
1309 if (last_rval == NULL_TREE)
1311 error ("base operand of %<->%> has non-pointer type %qT", type);
1312 return error_mark_node;
1315 if (TREE_CODE (TREE_TYPE (last_rval)) == REFERENCE_TYPE)
1316 last_rval = convert_from_reference (last_rval);
1319 last_rval = decay_conversion (expr);
1321 if (TREE_CODE (TREE_TYPE (last_rval)) == POINTER_TYPE)
1323 if (processing_template_decl)
1325 expr = build_min_non_dep (ARROW_EXPR, last_rval, orig_expr);
1326 /* It will be dereferenced. */
1327 TREE_TYPE (expr) = TREE_TYPE (TREE_TYPE (last_rval));
1331 return cp_build_indirect_ref (last_rval, NULL, tf_warning_or_error);
1335 error ("result of %<operator->()%> yields non-pointer result");
1337 error ("base operand of %<->%> is not a pointer");
1338 return error_mark_node;
1341 /* Return an expression for "DATUM .* COMPONENT". DATUM has not
1342 already been checked out to be of aggregate type. */
1345 build_m_component_ref (tree datum, tree component)
1353 if (error_operand_p (datum) || error_operand_p (component))
1354 return error_mark_node;
1356 ptrmem_type = TREE_TYPE (component);
1357 if (!TYPE_PTR_TO_MEMBER_P (ptrmem_type))
1359 error ("%qE cannot be used as a member pointer, since it is of "
1361 component, ptrmem_type);
1362 return error_mark_node;
1365 objtype = TYPE_MAIN_VARIANT (TREE_TYPE (datum));
1366 if (! MAYBE_CLASS_TYPE_P (objtype))
1368 error ("cannot apply member pointer %qE to %qE, which is of "
1369 "non-class type %qT",
1370 component, datum, objtype);
1371 return error_mark_node;
1374 type = TYPE_PTRMEM_POINTED_TO_TYPE (ptrmem_type);
1375 ctype = complete_type (TYPE_PTRMEM_CLASS_TYPE (ptrmem_type));
1377 if (!COMPLETE_TYPE_P (ctype))
1379 if (!same_type_p (ctype, objtype))
1385 binfo = lookup_base (objtype, ctype, ba_check, NULL);
1390 error ("pointer to member type %qT incompatible with object "
1393 return error_mark_node;
1395 else if (binfo == error_mark_node)
1396 return error_mark_node;
1399 if (TYPE_PTRMEM_P (ptrmem_type))
1403 /* Compute the type of the field, as described in [expr.ref].
1404 There's no such thing as a mutable pointer-to-member, so
1405 things are not as complex as they are for references to
1406 non-static data members. */
1407 type = cp_build_qualified_type (type,
1408 (cp_type_quals (type)
1409 | cp_type_quals (TREE_TYPE (datum))));
1411 datum = build_address (datum);
1413 /* Convert object to the correct base. */
1415 datum = build_base_path (PLUS_EXPR, datum, binfo, 1);
1417 /* Build an expression for "object + offset" where offset is the
1418 value stored in the pointer-to-data-member. */
1419 ptype = build_pointer_type (type);
1420 datum = build2 (POINTER_PLUS_EXPR, ptype,
1421 fold_convert (ptype, datum),
1422 build_nop (sizetype, component));
1423 return cp_build_indirect_ref (datum, 0, tf_warning_or_error);
1426 return build2 (OFFSET_REF, type, datum, component);
1429 /* Return a tree node for the expression TYPENAME '(' PARMS ')'. */
1432 build_functional_cast (tree exp, tree parms, tsubst_flags_t complain)
1434 /* This is either a call to a constructor,
1435 or a C cast in C++'s `functional' notation. */
1437 /* The type to which we are casting. */
1440 if (exp == error_mark_node || parms == error_mark_node)
1441 return error_mark_node;
1443 if (TREE_CODE (exp) == TYPE_DECL)
1444 type = TREE_TYPE (exp);
1448 if (processing_template_decl)
1450 tree t = build_min (CAST_EXPR, type, parms);
1451 /* We don't know if it will or will not have side effects. */
1452 TREE_SIDE_EFFECTS (t) = 1;
1456 if (! MAYBE_CLASS_TYPE_P (type))
1458 if (parms == NULL_TREE)
1459 return cp_convert (type, integer_zero_node);
1461 /* This must build a C cast. */
1462 parms = build_x_compound_expr_from_list (parms, "functional cast");
1463 return cp_build_c_cast (type, parms, complain);
1466 /* Prepare to evaluate as a call to a constructor. If this expression
1467 is actually used, for example,
1469 return X (arg1, arg2, ...);
1471 then the slot being initialized will be filled in. */
1473 if (!complete_type_or_else (type, NULL_TREE))
1474 return error_mark_node;
1475 if (abstract_virtuals_error (NULL_TREE, type))
1476 return error_mark_node;
1480 If the expression list is a single-expression, the type
1481 conversion is equivalent (in definedness, and if defined in
1482 meaning) to the corresponding cast expression. */
1483 if (parms && TREE_CHAIN (parms) == NULL_TREE)
1484 return cp_build_c_cast (type, TREE_VALUE (parms), complain);
1488 The expression T(), where T is a simple-type-specifier for a
1489 non-array complete object type or the (possibly cv-qualified)
1490 void type, creates an rvalue of the specified type, which is
1491 value-initialized. */
1493 if (parms == NULL_TREE
1494 /* If there's a user-defined constructor, value-initialization is
1495 just calling the constructor, so fall through. */
1496 && !TYPE_HAS_USER_CONSTRUCTOR (type))
1498 exp = build_value_init (type);
1499 return get_target_expr (exp);
1502 /* Call the constructor. */
1503 exp = build_special_member_call (NULL_TREE, complete_ctor_identifier, parms,
1504 type, LOOKUP_NORMAL, complain);
1506 if (exp == error_mark_node)
1507 return error_mark_node;
1509 return build_cplus_new (type, exp);
1513 /* Add new exception specifier SPEC, to the LIST we currently have.
1514 If it's already in LIST then do nothing.
1515 Moan if it's bad and we're allowed to. COMPLAIN < 0 means we
1516 know what we're doing. */
1519 add_exception_specifier (tree list, tree spec, int complain)
1524 diagnostic_t diag_type = DK_UNSPECIFIED; /* none */
1526 if (spec == error_mark_node)
1529 gcc_assert (spec && (!list || TREE_VALUE (list)));
1531 /* [except.spec] 1, type in an exception specifier shall not be
1532 incomplete, or pointer or ref to incomplete other than pointer
1534 is_ptr = TREE_CODE (core) == POINTER_TYPE;
1535 if (is_ptr || TREE_CODE (core) == REFERENCE_TYPE)
1536 core = TREE_TYPE (core);
1539 else if (VOID_TYPE_P (core))
1541 else if (TREE_CODE (core) == TEMPLATE_TYPE_PARM)
1543 else if (processing_template_decl)
1548 /* 15.4/1 says that types in an exception specifier must be complete,
1549 but it seems more reasonable to only require this on definitions
1550 and calls. So just give a pedwarn at this point; we will give an
1551 error later if we hit one of those two cases. */
1552 if (!COMPLETE_TYPE_P (complete_type (core)))
1553 diag_type = DK_PEDWARN; /* pedwarn */
1560 for (probe = list; probe; probe = TREE_CHAIN (probe))
1561 if (same_type_p (TREE_VALUE (probe), spec))
1564 list = tree_cons (NULL_TREE, spec, list);
1567 diag_type = DK_ERROR; /* error */
1569 if (diag_type != DK_UNSPECIFIED && complain)
1570 cxx_incomplete_type_diagnostic (NULL_TREE, core, diag_type);
1575 /* Combine the two exceptions specifier lists LIST and ADD, and return
1579 merge_exception_specifiers (tree list, tree add)
1583 else if (!TREE_VALUE (list))
1585 else if (!TREE_VALUE (add))
1589 tree orig_list = list;
1591 for (; add; add = TREE_CHAIN (add))
1593 tree spec = TREE_VALUE (add);
1596 for (probe = orig_list; probe; probe = TREE_CHAIN (probe))
1597 if (same_type_p (TREE_VALUE (probe), spec))
1601 spec = build_tree_list (NULL_TREE, spec);
1602 TREE_CHAIN (spec) = list;
1610 /* Subroutine of build_call. Ensure that each of the types in the
1611 exception specification is complete. Technically, 15.4/1 says that
1612 they need to be complete when we see a declaration of the function,
1613 but we should be able to get away with only requiring this when the
1614 function is defined or called. See also add_exception_specifier. */
1617 require_complete_eh_spec_types (tree fntype, tree decl)
1620 /* Don't complain about calls to op new. */
1621 if (decl && DECL_ARTIFICIAL (decl))
1623 for (raises = TYPE_RAISES_EXCEPTIONS (fntype); raises;
1624 raises = TREE_CHAIN (raises))
1626 tree type = TREE_VALUE (raises);
1627 if (type && !COMPLETE_TYPE_P (type))
1631 ("call to function %qD which throws incomplete type %q#T",
1634 error ("call to function which throws incomplete type %q#T",
1641 #include "gt-cp-typeck2.h"