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
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 2, 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 COPYING. If not, write to
22 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
23 Boston, MA 02110-1301, USA. */
26 /* This file is part of the C++ front end.
27 It contains routines to build C++ expressions given their operands,
28 including computing the types of the result, C and C++ specific error
29 checks, and some optimization. */
33 #include "coretypes.h"
40 #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. Thus, we emit hard errors for these,
72 rather than just pedwarns. If `SOFT' is 1, then we just pedwarn. (For
73 example, conversions to references.) */
76 readonly_error (tree arg
, const char* string
, int soft
)
79 void (*fn
) (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
86 if (TREE_CODE (arg
) == COMPONENT_REF
)
88 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
89 fmt
= "%s of data-member %qD in read-only structure";
91 fmt
= "%s of read-only data-member %qD";
92 (*fn
) (fmt
, string
, TREE_OPERAND (arg
, 1));
94 else if (TREE_CODE (arg
) == VAR_DECL
)
96 if (DECL_LANG_SPECIFIC (arg
)
97 && DECL_IN_AGGR_P (arg
)
98 && !TREE_STATIC (arg
))
99 fmt
= "%s of constant field %qD";
101 fmt
= "%s of read-only variable %qD";
102 (*fn
) (fmt
, string
, arg
);
104 else if (TREE_CODE (arg
) == PARM_DECL
)
105 (*fn
) ("%s of read-only parameter %qD", string
, arg
);
106 else if (TREE_CODE (arg
) == INDIRECT_REF
107 && TREE_CODE (TREE_TYPE (TREE_OPERAND (arg
, 0))) == REFERENCE_TYPE
108 && (TREE_CODE (TREE_OPERAND (arg
, 0)) == VAR_DECL
109 || TREE_CODE (TREE_OPERAND (arg
, 0)) == PARM_DECL
))
110 (*fn
) ("%s of read-only reference %qD", string
, TREE_OPERAND (arg
, 0));
111 else if (TREE_CODE (arg
) == RESULT_DECL
)
112 (*fn
) ("%s of read-only named return value %qD", string
, arg
);
113 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
114 (*fn
) ("%s of function %qD", string
, arg
);
116 (*fn
) ("%s of read-only location", string
);
120 /* Structure that holds information about declarations whose type was
121 incomplete and we could not check whether it was abstract or not. */
123 struct pending_abstract_type
GTY((chain_next ("%h.next")))
125 /* Declaration which we are checking for abstractness. It is either
126 a DECL node, or an IDENTIFIER_NODE if we do not have a full
127 declaration available. */
130 /* Type which will be checked for abstractness. */
133 /* Position of the declaration. This is only needed for IDENTIFIER_NODEs,
134 because DECLs already carry locus information. */
137 /* Link to the next element in list. */
138 struct pending_abstract_type
* next
;
142 /* Compute the hash value of the node VAL. This function is used by the
143 hash table abstract_pending_vars. */
146 pat_calc_hash (const void* val
)
148 const struct pending_abstract_type
*pat
=
149 (const struct pending_abstract_type
*) val
;
150 return (hashval_t
) TYPE_UID (pat
->type
);
154 /* Compare node VAL1 with the type VAL2. This function is used by the
155 hash table abstract_pending_vars. */
158 pat_compare (const void* val1
, const void* val2
)
160 const struct pending_abstract_type
*pat1
=
161 (const struct pending_abstract_type
*) val1
;
162 tree type2
= (tree
)val2
;
164 return (pat1
->type
== type2
);
167 /* Hash table that maintains pending_abstract_type nodes, for which we still
168 need to check for type abstractness. The key of the table is the type
169 of the declaration. */
170 static GTY ((param_is (struct pending_abstract_type
)))
171 htab_t abstract_pending_vars
= NULL
;
174 /* This function is called after TYPE is completed, and will check if there
175 are pending declarations for which we still need to verify the abstractness
176 of TYPE, and emit a diagnostic (through abstract_virtuals_error) if TYPE
177 turned out to be incomplete. */
180 complete_type_check_abstract (tree type
)
183 struct pending_abstract_type
*pat
;
184 location_t cur_loc
= input_location
;
186 gcc_assert (COMPLETE_TYPE_P (type
));
188 if (!abstract_pending_vars
)
191 /* Retrieve the list of pending declarations for this type. */
192 slot
= htab_find_slot_with_hash (abstract_pending_vars
, type
,
193 (hashval_t
)TYPE_UID (type
), NO_INSERT
);
196 pat
= (struct pending_abstract_type
*)*slot
;
199 /* If the type is not abstract, do not do anything. */
200 if (CLASSTYPE_PURE_VIRTUALS (type
))
202 struct pending_abstract_type
*prev
= 0, *next
;
204 /* Reverse the list to emit the errors in top-down order. */
205 for (; pat
; pat
= next
)
213 /* Go through the list, and call abstract_virtuals_error for each
214 element: it will issue a diagnostic if the type is abstract. */
217 gcc_assert (type
== pat
->type
);
219 /* Tweak input_location so that the diagnostic appears at the correct
220 location. Notice that this is only needed if the decl is an
222 input_location
= pat
->locus
;
223 abstract_virtuals_error (pat
->decl
, pat
->type
);
228 htab_clear_slot (abstract_pending_vars
, slot
);
230 input_location
= cur_loc
;
234 /* If TYPE has abstract virtual functions, issue an error about trying
235 to create an object of that type. DECL is the object declared, or
236 NULL_TREE if the declaration is unavailable. Returns 1 if an error
237 occurred; zero if all was well. */
240 abstract_virtuals_error (tree decl
, tree type
)
244 /* This function applies only to classes. Any other entity can never
246 if (!CLASS_TYPE_P (type
))
249 /* If the type is incomplete, we register it within a hash table,
250 so that we can check again once it is completed. This makes sense
251 only for objects for which we have a declaration or at least a
253 if (!COMPLETE_TYPE_P (type
))
256 struct pending_abstract_type
*pat
;
258 gcc_assert (!decl
|| DECL_P (decl
)
259 || TREE_CODE (decl
) == IDENTIFIER_NODE
);
261 if (!abstract_pending_vars
)
262 abstract_pending_vars
= htab_create_ggc (31, &pat_calc_hash
,
265 slot
= htab_find_slot_with_hash (abstract_pending_vars
, type
,
266 (hashval_t
)TYPE_UID (type
), INSERT
);
268 pat
= GGC_NEW (struct pending_abstract_type
);
271 pat
->locus
= ((decl
&& DECL_P (decl
))
272 ? DECL_SOURCE_LOCATION (decl
)
275 pat
->next
= (struct pending_abstract_type
*) *slot
;
281 if (!TYPE_SIZE (type
))
282 /* TYPE is being defined, and during that time
283 CLASSTYPE_PURE_VIRTUALS holds the inline friends. */
286 pure
= CLASSTYPE_PURE_VIRTUALS (type
);
292 if (TREE_CODE (decl
) == RESULT_DECL
)
295 if (TREE_CODE (decl
) == VAR_DECL
)
296 error ("cannot declare variable %q+D to be of abstract "
297 "type %qT", decl
, type
);
298 else if (TREE_CODE (decl
) == PARM_DECL
)
299 error ("cannot declare parameter %q+D to be of abstract type %qT",
301 else if (TREE_CODE (decl
) == FIELD_DECL
)
302 error ("cannot declare field %q+D to be of abstract type %qT",
304 else if (TREE_CODE (decl
) == FUNCTION_DECL
305 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
306 error ("invalid abstract return type for member function %q+#D", decl
);
307 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
308 error ("invalid abstract return type for function %q+#D", decl
);
309 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
310 /* Here we do not have location information. */
311 error ("invalid abstract type %qT for %qE", type
, decl
);
313 error ("invalid abstract type for %q+D", decl
);
316 error ("cannot allocate an object of abstract type %qT", type
);
318 /* Only go through this once. */
319 if (VEC_length (tree
, pure
))
324 inform ("%J because the following virtual functions are pure "
325 "within %qT:", TYPE_MAIN_DECL (type
), type
);
327 for (ix
= 0; VEC_iterate (tree
, pure
, ix
, fn
); ix
++)
328 inform ("\t%+#D", fn
);
329 /* Now truncate the vector. This leaves it non-null, so we know
330 there are pure virtuals, but empty so we don't list them out
332 VEC_truncate (tree
, pure
, 0);
335 inform ("%J since type %qT has pure virtual functions",
336 TYPE_MAIN_DECL (type
), type
);
341 /* Print an error message for invalid use of an incomplete type.
342 VALUE is the expression that was used (or 0 if that isn't known)
343 and TYPE is the type that was invalid. DIAG_TYPE indicates the
344 type of diagnostic: 0 for an error, 1 for a warning, 2 for a
348 cxx_incomplete_type_diagnostic (tree value
, tree type
, int diag_type
)
351 void (*p_msg
) (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
355 else if (diag_type
== 2)
360 /* Avoid duplicate error message. */
361 if (TREE_CODE (type
) == ERROR_MARK
)
364 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
365 || TREE_CODE (value
) == PARM_DECL
366 || TREE_CODE (value
) == FIELD_DECL
))
368 p_msg ("%q+D has incomplete type", value
);
372 /* We must print an error message. Be clever about what it says. */
374 switch (TREE_CODE (type
))
380 p_msg ("invalid use of incomplete type %q#T", type
);
381 if (!TYPE_TEMPLATE_INFO (type
))
382 p_msg ("forward declaration of %q+#T", type
);
384 p_msg ("declaration of %q+#T", type
);
388 p_msg ("invalid use of %qT", type
);
392 if (TYPE_DOMAIN (type
))
394 type
= TREE_TYPE (type
);
397 p_msg ("invalid use of array with unspecified bounds");
402 p_msg ("invalid use of member (did you forget the %<&%> ?)");
405 case TEMPLATE_TYPE_PARM
:
406 p_msg ("invalid use of template type parameter %qT", type
);
409 case BOUND_TEMPLATE_TEMPLATE_PARM
:
410 p_msg ("invalid use of template template parameter %qT",
415 p_msg ("invalid use of dependent type %qT", type
);
419 if (value
&& TREE_CODE (value
) == COMPONENT_REF
)
421 else if (value
&& TREE_CODE (value
) == ADDR_EXPR
)
422 p_msg ("address of overloaded function with no contextual "
424 else if (value
&& TREE_CODE (value
) == OVERLOAD
)
425 p_msg ("overloaded function with no contextual type information");
427 p_msg ("insufficient contextual information to determine type");
435 /* Backward-compatibility interface to incomplete_type_diagnostic;
436 required by ../tree.c. */
437 #undef cxx_incomplete_type_error
439 cxx_incomplete_type_error (tree value
, tree type
)
441 cxx_incomplete_type_diagnostic (value
, type
, 0);
445 /* The recursive part of split_nonconstant_init. DEST is an lvalue
446 expression to which INIT should be assigned. INIT is a CONSTRUCTOR. */
449 split_nonconstant_init_1 (tree dest
, tree init
)
451 unsigned HOST_WIDE_INT idx
;
452 tree field_index
, value
;
453 tree type
= TREE_TYPE (dest
);
454 tree inner_type
= NULL
;
455 bool array_type_p
= false;
457 switch (TREE_CODE (type
))
460 inner_type
= TREE_TYPE (type
);
466 case QUAL_UNION_TYPE
:
467 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), idx
,
470 /* The current implementation of this algorithm assumes that
471 the field was set for all the elements. This is usually done
472 by process_init_constructor. */
473 gcc_assert (field_index
);
476 inner_type
= TREE_TYPE (field_index
);
478 if (TREE_CODE (value
) == CONSTRUCTOR
)
483 sub
= build4 (ARRAY_REF
, inner_type
, dest
, field_index
,
484 NULL_TREE
, NULL_TREE
);
486 sub
= build3 (COMPONENT_REF
, inner_type
, dest
, field_index
,
489 split_nonconstant_init_1 (sub
, value
);
491 else if (!initializer_constant_valid_p (value
, inner_type
))
496 /* FIXME: Ordered removal is O(1) so the whole function is
497 worst-case quadratic. This could be fixed using an aside
498 bitmap to record which elements must be removed and remove
499 them all at the same time. Or by merging
500 split_non_constant_init into process_init_constructor_array,
501 that is separating constants from non-constants while building
503 VEC_ordered_remove (constructor_elt
, CONSTRUCTOR_ELTS (init
),
508 sub
= build4 (ARRAY_REF
, inner_type
, dest
, field_index
,
509 NULL_TREE
, NULL_TREE
);
511 sub
= build3 (COMPONENT_REF
, inner_type
, dest
, field_index
,
514 code
= build2 (INIT_EXPR
, inner_type
, sub
, value
);
515 code
= build_stmt (EXPR_STMT
, code
);
523 if (!initializer_constant_valid_p (init
, type
))
526 tree cons
= copy_node (init
);
527 CONSTRUCTOR_ELTS (init
) = NULL
;
528 code
= build2 (MODIFY_EXPR
, type
, dest
, cons
);
529 code
= build_stmt (EXPR_STMT
, code
);
538 /* The rest of the initializer is now a constant. */
539 TREE_CONSTANT (init
) = 1;
542 /* A subroutine of store_init_value. Splits non-constant static
543 initializer INIT into a constant part and generates code to
544 perform the non-constant part of the initialization to DEST.
545 Returns the code for the runtime init. */
548 split_nonconstant_init (tree dest
, tree init
)
552 if (TREE_CODE (init
) == CONSTRUCTOR
)
554 code
= push_stmt_list ();
555 split_nonconstant_init_1 (dest
, init
);
556 code
= pop_stmt_list (code
);
557 DECL_INITIAL (dest
) = init
;
558 TREE_READONLY (dest
) = 0;
561 code
= build2 (INIT_EXPR
, TREE_TYPE (dest
), dest
, init
);
566 /* Perform appropriate conversions on the initial value of a variable,
567 store it in the declaration DECL,
568 and print any error messages that are appropriate.
569 If the init is invalid, store an ERROR_MARK.
571 C++: Note that INIT might be a TREE_LIST, which would mean that it is
572 a base class initializer for some aggregate type, hopefully compatible
573 with DECL. If INIT is a single element, and DECL is an aggregate
574 type, we silently convert INIT into a TREE_LIST, allowing a constructor
577 If INIT is a TREE_LIST and there is no constructor, turn INIT
578 into a CONSTRUCTOR and use standard initialization techniques.
579 Perhaps a warning should be generated?
581 Returns code to be executed if initialization could not be performed
582 for static variable. In that case, caller must emit the code. */
585 store_init_value (tree decl
, tree init
)
589 /* If variable's type was invalidly declared, just ignore it. */
591 type
= TREE_TYPE (decl
);
592 if (TREE_CODE (type
) == ERROR_MARK
)
595 if (IS_AGGR_TYPE (type
))
597 gcc_assert (TYPE_HAS_TRIVIAL_INIT_REF (type
)
598 || TREE_CODE (init
) == CONSTRUCTOR
);
600 if (TREE_CODE (init
) == TREE_LIST
)
602 error ("constructor syntax used, but no constructor declared "
603 "for type %qT", type
);
604 init
= build_constructor_from_list (NULL_TREE
, nreverse (init
));
607 else if (TREE_CODE (init
) == TREE_LIST
608 && TREE_TYPE (init
) != unknown_type_node
)
610 if (TREE_CODE (decl
) == RESULT_DECL
)
611 init
= build_x_compound_expr_from_list (init
,
612 "return value initializer");
613 else if (TREE_CODE (init
) == TREE_LIST
614 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
616 error ("cannot initialize arrays using this syntax");
620 /* We get here with code like `int a (2);' */
621 init
= build_x_compound_expr_from_list (init
, "initializer");
624 /* End of special C++ code. */
626 /* Digest the specified initializer into an expression. */
627 value
= digest_init (type
, init
);
628 /* If the initializer is not a constant, fill in DECL_INITIAL with
629 the bits that are constant, and then return an expression that
630 will perform the dynamic initialization. */
631 if (value
!= error_mark_node
632 && (TREE_SIDE_EFFECTS (value
)
633 || ! initializer_constant_valid_p (value
, TREE_TYPE (value
))))
634 return split_nonconstant_init (decl
, value
);
635 /* If the value is a constant, just put it in DECL_INITIAL. If DECL
636 is an automatic variable, the middle end will turn this into a
637 dynamic initialization later. */
638 DECL_INITIAL (decl
) = value
;
643 /* Process the initializer INIT for a variable of type TYPE, emitting
644 diagnostics for invalid initializers and converting the initializer as
647 For aggregate types, it assumes that reshape_init has already run, thus the
648 initializer will have the right shape (brace elision has been undone). */
651 digest_init (tree type
, tree init
)
653 enum tree_code code
= TREE_CODE (type
);
655 if (init
== error_mark_node
)
656 return error_mark_node
;
660 /* We must strip the outermost array type when completing the type,
661 because the its bounds might be incomplete at the moment. */
662 if (!complete_type_or_else (TREE_CODE (type
) == ARRAY_TYPE
663 ? TREE_TYPE (type
) : type
, NULL_TREE
))
664 return error_mark_node
;
666 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue
667 (g++.old-deja/g++.law/casts2.C). */
668 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
669 init
= TREE_OPERAND (init
, 0);
671 /* Initialization of an array of chars from a string constant. The initializer
672 can be optionally enclosed in braces, but reshape_init has already removed
673 them if they were present. */
674 if (code
== ARRAY_TYPE
)
676 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
677 if (char_type_p (typ1
)
679 && TREE_CODE (init
) == STRING_CST
)
681 tree char_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (init
)));
683 if (char_type
!= char_type_node
684 && TYPE_PRECISION (typ1
) == BITS_PER_UNIT
)
686 error ("char-array initialized from wide string");
687 return error_mark_node
;
689 if (char_type
== char_type_node
690 && TYPE_PRECISION (typ1
) != BITS_PER_UNIT
)
692 error ("int-array initialized from non-wide string");
693 return error_mark_node
;
696 TREE_TYPE (init
) = type
;
697 if (TYPE_DOMAIN (type
) != 0 && TREE_CONSTANT (TYPE_SIZE (type
)))
699 int size
= TREE_INT_CST_LOW (TYPE_SIZE (type
));
700 size
= (size
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
701 /* In C it is ok to subtract 1 from the length of the string
702 because it's ok to ignore the terminating null char that is
703 counted in the length of the constant, but in C++ this would
705 if (size
< TREE_STRING_LENGTH (init
))
706 pedwarn ("initializer-string for array of chars is too long");
712 /* Handle scalar types (including conversions) and references. */
713 if (SCALAR_TYPE_P (type
) || code
== REFERENCE_TYPE
)
714 return convert_for_initialization (0, type
, init
, LOOKUP_NORMAL
,
715 "initialization", NULL_TREE
, 0);
717 /* Come here only for aggregates: records, arrays, unions, complex numbers
719 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
720 || TREE_CODE (type
) == VECTOR_TYPE
721 || TREE_CODE (type
) == RECORD_TYPE
722 || TREE_CODE (type
) == UNION_TYPE
723 || TREE_CODE (type
) == COMPLEX_TYPE
);
725 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
726 return process_init_constructor (type
, init
);
729 if (COMPOUND_LITERAL_P (init
) && TREE_CODE (type
) == ARRAY_TYPE
)
731 error ("cannot initialize aggregate of type %qT with "
732 "a compound literal", type
);
734 return error_mark_node
;
737 if (TREE_CODE (type
) == ARRAY_TYPE
738 && TREE_CODE (init
) != CONSTRUCTOR
)
740 error ("array must be initialized with a brace-enclosed"
742 return error_mark_node
;
745 return convert_for_initialization (NULL_TREE
, type
, init
,
746 LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
,
747 "initialization", NULL_TREE
, 0);
752 /* Set of flags used within process_init_constructor to describe the
754 #define PICFLAG_ERRONEOUS 1
755 #define PICFLAG_NOT_ALL_CONSTANT 2
756 #define PICFLAG_NOT_ALL_SIMPLE 4
758 /* Given an initializer INIT, return the flag (PICFLAG_*) which better
762 picflag_from_initializer (tree init
)
764 if (init
== error_mark_node
)
765 return PICFLAG_ERRONEOUS
;
766 else if (!TREE_CONSTANT (init
))
767 return PICFLAG_NOT_ALL_CONSTANT
;
768 else if (!initializer_constant_valid_p (init
, TREE_TYPE (init
)))
769 return PICFLAG_NOT_ALL_SIMPLE
;
773 /* Subroutine of process_init_constructor, which will process an initializer
774 INIT for a array or vector of type TYPE. Returns the flags (PICFLAG_*) which
775 describe the initializers. */
778 process_init_constructor_array (tree type
, tree init
)
780 unsigned HOST_WIDE_INT i
, len
= 0;
782 bool unbounded
= false;
784 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (init
);
786 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
787 || TREE_CODE (type
) == VECTOR_TYPE
);
789 if (TREE_CODE (type
) == ARRAY_TYPE
)
791 tree domain
= TYPE_DOMAIN (type
);
793 len
= (TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain
))
794 - TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain
))
797 unbounded
= true; /* Take as many as there are. */
800 /* Vectors are like simple fixed-size arrays. */
801 len
= TYPE_VECTOR_SUBPARTS (type
);
803 /* There cannot be more initializers than needed as otherwise
804 reshape_init would have already rejected the initializer. */
806 gcc_assert (VEC_length (constructor_elt
, v
) <= len
);
808 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
812 gcc_assert (TREE_CODE (ce
->index
) == INTEGER_CST
);
813 if (compare_tree_int (ce
->index
, i
) != 0)
815 ce
->value
= error_mark_node
;
816 sorry ("non-trivial designated initializers not supported");
820 ce
->index
= size_int (i
);
821 gcc_assert (ce
->value
);
822 ce
->value
= digest_init (TREE_TYPE (type
), ce
->value
);
824 if (ce
->value
!= error_mark_node
)
825 gcc_assert (same_type_ignoring_top_level_qualifiers_p
826 (TREE_TYPE (type
), TREE_TYPE (ce
->value
)));
828 flags
|= picflag_from_initializer (ce
->value
);
831 /* No more initializers. If the array is unbounded, we are done. Otherwise,
832 we must add initializers ourselves. */
838 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (type
)))
840 /* If this type needs constructors run for default-initialization,
841 we can't rely on the backend to do it for us, so build up
842 TARGET_EXPRs. If the type in question is a class, just build
843 one up; if it's an array, recurse. */
844 if (IS_AGGR_TYPE (TREE_TYPE (type
)))
845 next
= build_functional_cast (TREE_TYPE (type
), NULL_TREE
);
847 next
= build_constructor (NULL_TREE
, NULL
);
848 next
= digest_init (TREE_TYPE (type
), next
);
850 else if (!zero_init_p (TREE_TYPE (type
)))
851 next
= build_zero_init (TREE_TYPE (type
),
853 /*static_storage_p=*/false);
855 /* The default zero-initialization is fine for us; don't
856 add anything to the CONSTRUCTOR. */
859 flags
|= picflag_from_initializer (next
);
860 CONSTRUCTOR_APPEND_ELT (v
, size_int (i
), next
);
863 CONSTRUCTOR_ELTS (init
) = v
;
867 /* Subroutine of process_init_constructor, which will process an initializer
868 INIT for a class of type TYPE. Returns the flags (PICFLAG_*) which describe
872 process_init_constructor_record (tree type
, tree init
)
874 VEC(constructor_elt
,gc
) *v
= NULL
;
877 unsigned HOST_WIDE_INT idx
= 0;
879 gcc_assert (TREE_CODE (type
) == RECORD_TYPE
);
880 gcc_assert (!CLASSTYPE_VBASECLASSES (type
));
881 gcc_assert (!TYPE_BINFO (type
)
882 || !BINFO_N_BASE_BINFOS (TYPE_BINFO (type
)));
883 gcc_assert (!TYPE_POLYMORPHIC_P (type
));
885 /* Generally, we will always have an index for each initializer (which is
886 a FIELD_DECL, put by reshape_init), but compound literals don't go trough
887 reshape_init. So we need to handle both cases. */
888 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
892 if (!DECL_NAME (field
) && DECL_C_BIT_FIELD (field
))
894 flags
|= picflag_from_initializer (integer_zero_node
);
895 CONSTRUCTOR_APPEND_ELT (v
, field
, integer_zero_node
);
899 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
902 if (idx
< VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (init
)))
904 constructor_elt
*ce
= VEC_index (constructor_elt
,
905 CONSTRUCTOR_ELTS (init
), idx
);
908 /* We can have either a FIELD_DECL or an IDENTIFIER_NODE. The
909 latter case can happen in templates where lookup has to be
911 gcc_assert (TREE_CODE (ce
->index
) == FIELD_DECL
912 || TREE_CODE (ce
->index
) == IDENTIFIER_NODE
);
913 if (ce
->index
!= field
914 && ce
->index
!= DECL_NAME (field
))
916 ce
->value
= error_mark_node
;
917 sorry ("non-trivial designated initializers not supported");
921 gcc_assert (ce
->value
);
922 next
= digest_init (TREE_TYPE (field
), ce
->value
);
925 else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field
)))
927 /* If this type needs constructors run for
928 default-initialization, we can't rely on the backend to do it
929 for us, so build up TARGET_EXPRs. If the type in question is
930 a class, just build one up; if it's an array, recurse. */
931 if (IS_AGGR_TYPE (TREE_TYPE (field
)))
932 next
= build_functional_cast (TREE_TYPE (field
), NULL_TREE
);
934 next
= build_constructor (NULL_TREE
, NULL
);
936 next
= digest_init (TREE_TYPE (field
), next
);
938 /* Warn when some struct elements are implicitly initialized. */
939 warning (OPT_Wmissing_field_initializers
,
940 "missing initializer for member %qD", field
);
944 if (TREE_READONLY (field
))
945 error ("uninitialized const member %qD", field
);
946 else if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (TREE_TYPE (field
)))
947 error ("member %qD with uninitialized const fields", field
);
948 else if (TREE_CODE (TREE_TYPE (field
)) == REFERENCE_TYPE
)
949 error ("member %qD is uninitialized reference", field
);
951 /* Warn when some struct elements are implicitly initialized
953 warning (OPT_Wmissing_field_initializers
,
954 "missing initializer for member %qD", field
);
956 if (!zero_init_p (TREE_TYPE (field
)))
957 next
= build_zero_init (TREE_TYPE (field
), /*nelts=*/NULL_TREE
,
958 /*static_storage_p=*/false);
960 /* The default zero-initialization is fine for us; don't
961 add anything to the CONSTRUCTOR. */
965 flags
|= picflag_from_initializer (next
);
966 CONSTRUCTOR_APPEND_ELT (v
, field
, next
);
969 CONSTRUCTOR_ELTS (init
) = v
;
973 /* Subroutine of process_init_constructor, which will process a single
974 initializer INIT for a union of type TYPE. Returns the flags (PICFLAG_*)
975 which describe the initializer. */
978 process_init_constructor_union (tree type
, tree init
)
982 /* If the initializer was empty, use default zero initialization. */
983 if (VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (init
)))
986 gcc_assert (VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (init
)) == 1);
987 ce
= VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (init
), 0);
989 /* If this element specifies a field, initialize via that field. */
992 if (TREE_CODE (ce
->index
) == FIELD_DECL
)
994 else if (TREE_CODE (ce
->index
) == IDENTIFIER_NODE
)
996 /* This can happen within a cast, see g++.dg/opt/cse2.C. */
997 tree name
= ce
->index
;
999 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1000 if (DECL_NAME (field
) == name
)
1004 error ("no field %qD found in union being initialized", field
);
1005 ce
->value
= error_mark_node
;
1011 gcc_assert (TREE_CODE (ce
->index
) == INTEGER_CST
1012 || TREE_CODE (ce
->index
) == RANGE_EXPR
);
1013 error ("index value instead of field name in union initializer");
1014 ce
->value
= error_mark_node
;
1019 /* Find the first named field. ANSI decided in September 1990
1020 that only named fields count here. */
1021 tree field
= TYPE_FIELDS (type
);
1022 while (field
&& (!DECL_NAME (field
) || TREE_CODE (field
) != FIELD_DECL
))
1023 field
= TREE_CHAIN (field
);
1028 if (ce
->value
&& ce
->value
!= error_mark_node
)
1029 ce
->value
= digest_init (TREE_TYPE (ce
->index
), ce
->value
);
1031 return picflag_from_initializer (ce
->value
);
1034 /* Process INIT, a constructor for a variable of aggregate type TYPE. The
1035 constructor is a brace-enclosed initializer, and will be modified in-place.
1037 Each element is converted to the right type through digest_init, and
1038 missing initializers are added following the language rules (zero-padding,
1041 After the execution, the initializer will have TREE_CONSTANT if all elts are
1042 constant, and TREE_STATIC set if, in addition, all elts are simple enough
1043 constants that the assembler and linker can compute them.
1045 The function returns the initializer itself, or error_mark_node in case
1049 process_init_constructor (tree type
, tree init
)
1053 gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init
));
1055 if (TREE_CODE (type
) == ARRAY_TYPE
|| TREE_CODE (type
) == VECTOR_TYPE
)
1056 flags
= process_init_constructor_array (type
, init
);
1057 else if (TREE_CODE (type
) == RECORD_TYPE
)
1058 flags
= process_init_constructor_record (type
, init
);
1059 else if (TREE_CODE (type
) == UNION_TYPE
)
1060 flags
= process_init_constructor_union (type
, init
);
1064 if (flags
& PICFLAG_ERRONEOUS
)
1065 return error_mark_node
;
1067 TREE_TYPE (init
) = type
;
1068 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
) == NULL_TREE
)
1069 cp_complete_array_type (&TREE_TYPE (init
), init
, /*do_default=*/0);
1070 if (!(flags
& PICFLAG_NOT_ALL_CONSTANT
))
1072 TREE_CONSTANT (init
) = 1;
1073 TREE_INVARIANT (init
) = 1;
1074 if (!(flags
& PICFLAG_NOT_ALL_SIMPLE
))
1075 TREE_STATIC (init
) = 1;
1080 /* Given a structure or union value DATUM, construct and return
1081 the structure or union component which results from narrowing
1082 that value to the base specified in BASETYPE. For example, given the
1085 class L { int ii; };
1086 class A : L { ... };
1087 class B : L { ... };
1088 class C : A, B { ... };
1096 x.A::ii refers to the ii member of the L part of
1097 the A part of the C object named by X. In this case,
1098 DATUM would be x, and BASETYPE would be A.
1100 I used to think that this was nonconformant, that the standard specified
1101 that first we look up ii in A, then convert x to an L& and pull out the
1102 ii part. But in fact, it does say that we convert x to an A&; A here
1103 is known as the "naming class". (jason 2000-12-19)
1105 BINFO_P points to a variable initialized either to NULL_TREE or to the
1106 binfo for the specific base subobject we want to convert to. */
1109 build_scoped_ref (tree datum
, tree basetype
, tree
* binfo_p
)
1113 if (datum
== error_mark_node
)
1114 return error_mark_node
;
1118 binfo
= lookup_base (TREE_TYPE (datum
), basetype
, ba_check
, NULL
);
1120 if (!binfo
|| binfo
== error_mark_node
)
1122 *binfo_p
= NULL_TREE
;
1124 error_not_base_type (basetype
, TREE_TYPE (datum
));
1125 return error_mark_node
;
1129 return build_base_path (PLUS_EXPR
, datum
, binfo
, 1);
1132 /* Build a reference to an object specified by the C++ `->' operator.
1133 Usually this just involves dereferencing the object, but if the
1134 `->' operator is overloaded, then such overloads must be
1135 performed until an object which does not have the `->' operator
1136 overloaded is found. An error is reported when circular pointer
1137 delegation is detected. */
1140 build_x_arrow (tree expr
)
1142 tree orig_expr
= expr
;
1143 tree types_memoized
= NULL_TREE
;
1144 tree type
= TREE_TYPE (expr
);
1145 tree last_rval
= NULL_TREE
;
1147 if (type
== error_mark_node
)
1148 return error_mark_node
;
1150 if (processing_template_decl
)
1152 if (type_dependent_expression_p (expr
))
1153 return build_min_nt (ARROW_EXPR
, expr
);
1154 expr
= build_non_dependent_expr (expr
);
1157 if (IS_AGGR_TYPE (type
))
1159 while ((expr
= build_new_op (COMPONENT_REF
, LOOKUP_NORMAL
, expr
,
1160 NULL_TREE
, NULL_TREE
,
1161 /*overloaded_p=*/NULL
)))
1163 if (expr
== error_mark_node
)
1164 return error_mark_node
;
1166 if (value_member (TREE_TYPE (expr
), types_memoized
))
1168 error ("circular pointer delegation detected");
1169 return error_mark_node
;
1173 types_memoized
= tree_cons (NULL_TREE
, TREE_TYPE (expr
),
1179 if (last_rval
== NULL_TREE
)
1181 error ("base operand of %<->%> has non-pointer type %qT", type
);
1182 return error_mark_node
;
1185 if (TREE_CODE (TREE_TYPE (last_rval
)) == REFERENCE_TYPE
)
1186 last_rval
= convert_from_reference (last_rval
);
1189 last_rval
= decay_conversion (expr
);
1191 if (TREE_CODE (TREE_TYPE (last_rval
)) == POINTER_TYPE
)
1193 if (processing_template_decl
)
1195 expr
= build_min_non_dep (ARROW_EXPR
, last_rval
, orig_expr
);
1196 /* It will be dereferenced. */
1197 TREE_TYPE (expr
) = TREE_TYPE (TREE_TYPE (last_rval
));
1201 return build_indirect_ref (last_rval
, NULL
);
1205 error ("result of %<operator->()%> yields non-pointer result");
1207 error ("base operand of %<->%> is not a pointer");
1208 return error_mark_node
;
1211 /* Return an expression for "DATUM .* COMPONENT". DATUM has not
1212 already been checked out to be of aggregate type. */
1215 build_m_component_ref (tree datum
, tree component
)
1223 if (error_operand_p (datum
) || error_operand_p (component
))
1224 return error_mark_node
;
1226 ptrmem_type
= TREE_TYPE (component
);
1227 if (!TYPE_PTR_TO_MEMBER_P (ptrmem_type
))
1229 error ("%qE cannot be used as a member pointer, since it is of "
1231 component
, ptrmem_type
);
1232 return error_mark_node
;
1235 objtype
= TYPE_MAIN_VARIANT (TREE_TYPE (datum
));
1236 if (! IS_AGGR_TYPE (objtype
))
1238 error ("cannot apply member pointer %qE to %qE, which is of "
1239 "non-class type %qT",
1240 component
, datum
, objtype
);
1241 return error_mark_node
;
1244 type
= TYPE_PTRMEM_POINTED_TO_TYPE (ptrmem_type
);
1245 ctype
= complete_type (TYPE_PTRMEM_CLASS_TYPE (ptrmem_type
));
1247 if (!COMPLETE_TYPE_P (ctype
))
1249 if (!same_type_p (ctype
, objtype
))
1255 binfo
= lookup_base (objtype
, ctype
, ba_check
, NULL
);
1260 error ("pointer to member type %qT incompatible with object "
1263 return error_mark_node
;
1265 else if (binfo
== error_mark_node
)
1266 return error_mark_node
;
1269 if (TYPE_PTRMEM_P (ptrmem_type
))
1271 /* Compute the type of the field, as described in [expr.ref].
1272 There's no such thing as a mutable pointer-to-member, so
1273 things are not as complex as they are for references to
1274 non-static data members. */
1275 type
= cp_build_qualified_type (type
,
1276 (cp_type_quals (type
)
1277 | cp_type_quals (TREE_TYPE (datum
))));
1279 datum
= build_address (datum
);
1281 /* Convert object to the correct base. */
1283 datum
= build_base_path (PLUS_EXPR
, datum
, binfo
, 1);
1285 /* Build an expression for "object + offset" where offset is the
1286 value stored in the pointer-to-data-member. */
1287 datum
= build2 (PLUS_EXPR
, build_pointer_type (type
),
1288 datum
, build_nop (ptrdiff_type_node
, component
));
1289 return build_indirect_ref (datum
, 0);
1292 return build2 (OFFSET_REF
, type
, datum
, component
);
1295 /* Return a tree node for the expression TYPENAME '(' PARMS ')'. */
1298 build_functional_cast (tree exp
, tree parms
)
1300 /* This is either a call to a constructor,
1301 or a C cast in C++'s `functional' notation. */
1304 if (exp
== error_mark_node
|| parms
== error_mark_node
)
1305 return error_mark_node
;
1307 if (TREE_CODE (exp
) == TYPE_DECL
)
1308 type
= TREE_TYPE (exp
);
1312 if (processing_template_decl
)
1314 tree t
= build_min (CAST_EXPR
, type
, parms
);
1315 /* We don't know if it will or will not have side effects. */
1316 TREE_SIDE_EFFECTS (t
) = 1;
1320 if (! IS_AGGR_TYPE (type
))
1322 if (parms
== NULL_TREE
)
1323 return cp_convert (type
, integer_zero_node
);
1325 /* This must build a C cast. */
1326 parms
= build_x_compound_expr_from_list (parms
, "functional cast");
1327 return build_c_cast (type
, parms
);
1330 /* Prepare to evaluate as a call to a constructor. If this expression
1331 is actually used, for example,
1333 return X (arg1, arg2, ...);
1335 then the slot being initialized will be filled in. */
1337 if (!complete_type_or_else (type
, NULL_TREE
))
1338 return error_mark_node
;
1339 if (abstract_virtuals_error (NULL_TREE
, type
))
1340 return error_mark_node
;
1342 if (parms
&& TREE_CHAIN (parms
) == NULL_TREE
)
1343 return build_c_cast (type
, TREE_VALUE (parms
));
1345 /* We need to zero-initialize POD types. */
1346 if (parms
== NULL_TREE
1347 && !CLASSTYPE_NON_POD_P (type
)
1348 && TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
1350 exp
= build_constructor (type
, NULL
);
1351 return get_target_expr (exp
);
1354 exp
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
, parms
,
1355 type
, LOOKUP_NORMAL
);
1357 if (exp
== error_mark_node
)
1358 return error_mark_node
;
1360 return build_cplus_new (type
, exp
);
1364 /* Add new exception specifier SPEC, to the LIST we currently have.
1365 If it's already in LIST then do nothing.
1366 Moan if it's bad and we're allowed to. COMPLAIN < 0 means we
1367 know what we're doing. */
1370 add_exception_specifier (tree list
, tree spec
, int complain
)
1375 int diag_type
= -1; /* none */
1377 if (spec
== error_mark_node
)
1380 gcc_assert (spec
&& (!list
|| TREE_VALUE (list
)));
1382 /* [except.spec] 1, type in an exception specifier shall not be
1383 incomplete, or pointer or ref to incomplete other than pointer
1385 is_ptr
= TREE_CODE (core
) == POINTER_TYPE
;
1386 if (is_ptr
|| TREE_CODE (core
) == REFERENCE_TYPE
)
1387 core
= TREE_TYPE (core
);
1390 else if (VOID_TYPE_P (core
))
1392 else if (TREE_CODE (core
) == TEMPLATE_TYPE_PARM
)
1394 else if (processing_template_decl
)
1399 /* 15.4/1 says that types in an exception specifier must be complete,
1400 but it seems more reasonable to only require this on definitions
1401 and calls. So just give a pedwarn at this point; we will give an
1402 error later if we hit one of those two cases. */
1403 if (!COMPLETE_TYPE_P (complete_type (core
)))
1404 diag_type
= 2; /* pedwarn */
1411 for (probe
= list
; probe
; probe
= TREE_CHAIN (probe
))
1412 if (same_type_p (TREE_VALUE (probe
), spec
))
1415 list
= tree_cons (NULL_TREE
, spec
, list
);
1418 diag_type
= 0; /* error */
1420 if (diag_type
>= 0 && complain
)
1421 cxx_incomplete_type_diagnostic (NULL_TREE
, core
, diag_type
);
1426 /* Combine the two exceptions specifier lists LIST and ADD, and return
1430 merge_exception_specifiers (tree list
, tree add
)
1434 else if (!TREE_VALUE (list
))
1436 else if (!TREE_VALUE (add
))
1440 tree orig_list
= list
;
1442 for (; add
; add
= TREE_CHAIN (add
))
1444 tree spec
= TREE_VALUE (add
);
1447 for (probe
= orig_list
; probe
; probe
= TREE_CHAIN (probe
))
1448 if (same_type_p (TREE_VALUE (probe
), spec
))
1452 spec
= build_tree_list (NULL_TREE
, spec
);
1453 TREE_CHAIN (spec
) = list
;
1461 /* Subroutine of build_call. Ensure that each of the types in the
1462 exception specification is complete. Technically, 15.4/1 says that
1463 they need to be complete when we see a declaration of the function,
1464 but we should be able to get away with only requiring this when the
1465 function is defined or called. See also add_exception_specifier. */
1468 require_complete_eh_spec_types (tree fntype
, tree decl
)
1471 /* Don't complain about calls to op new. */
1472 if (decl
&& DECL_ARTIFICIAL (decl
))
1474 for (raises
= TYPE_RAISES_EXCEPTIONS (fntype
); raises
;
1475 raises
= TREE_CHAIN (raises
))
1477 tree type
= TREE_VALUE (raises
);
1478 if (type
&& !COMPLETE_TYPE_P (type
))
1482 ("call to function %qD which throws incomplete type %q#T",
1485 error ("call to function which throws incomplete type %q#T",
1492 #include "gt-cp-typeck2.h"