static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
static void insert_into_classtype_sorted_fields (tree, tree, int);
static bool check_bitfield_decl (tree);
-static void check_field_decl (tree, tree, int *, int *, int *);
+static bool check_field_decl (tree, tree, int *, int *);
static void check_field_decls (tree, tree *, int *, int *);
static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
static void build_base_fields (record_layout_info, splay_tree, tree *);
enclosing type T. Issue any appropriate messages and set appropriate
flags. */
-static void
+static bool
check_field_decl (tree field,
tree t,
int* cant_have_const_ctor,
- int* no_const_asn_ref,
- int* any_default_members)
+ int* no_const_asn_ref)
{
tree type = strip_array_types (TREE_TYPE (field));
+ bool any_default_members = false;
/* In C++98 an anonymous union cannot contain any fields which would change
the settings of CANT_HAVE_CONST_CTOR and friends. */
structs. So, we recurse through their fields here. */
else if (ANON_AGGR_TYPE_P (type))
{
- tree fields;
-
- for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields))
+ for (tree fields = TYPE_FIELDS (type); fields;
+ fields = DECL_CHAIN (fields))
if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
- check_field_decl (fields, t, cant_have_const_ctor,
- no_const_asn_ref, any_default_members);
+ any_default_members |= check_field_decl (fields, t,
+ cant_have_const_ctor,
+ no_const_asn_ref);
}
/* Check members with class type for constructors, destructors,
etc. */
check_abi_tags (t, field);
if (DECL_INITIAL (field) != NULL_TREE)
- {
- /* `build_class_init_list' does not recognize
- non-FIELD_DECLs. */
- if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0)
- error ("multiple fields in union %qT initialized", t);
- *any_default_members = 1;
- }
+ /* `build_class_init_list' does not recognize
+ non-FIELD_DECLs. */
+ any_default_members = true;
+
+ return any_default_members;
}
/* Check the data members (both static and non-static), class-scoped
tree *field;
tree *next;
bool has_pointers;
- int any_default_members;
+ bool any_default_members;
int cant_pack = 0;
int field_access = -1;
has_pointers = false;
/* Assume none of the members of this class have default
initializations. */
- any_default_members = 0;
+ any_default_members = false;
for (field = &TYPE_FIELDS (t); *field; field = next)
{
/* We set DECL_C_BIT_FIELD in grokbitfield.
If the type and width are valid, we'll also set DECL_BIT_FIELD. */
- if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x))
- check_field_decl (x, t,
- cant_have_const_ctor_p,
- no_const_asn_ref_p,
- &any_default_members);
+ if ((! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x))
+ && check_field_decl (x, t,
+ cant_have_const_ctor_p,
+ no_const_asn_ref_p))
+ {
+ if (any_default_members
+ && TREE_CODE (t) == UNION_TYPE)
+ error ("multiple fields in union %qT initialized", t);
+ any_default_members = true;
+ }
/* Now that we've removed bit-field widths from DECL_INITIAL,
anything left in DECL_INITIAL is an NSDMI that makes the class