+2019-06-13 Richard Biener <rguenther@suse.de>
+
+ PR c++/90801
+ * typeck2.c (split_nonconstant_init_1): Properly count
+ num_split_elts, optimize single constructor elt removal.
+
2019-06-12 Marek Polacek <polacek@redhat.com>
PR c++/66999 - 'this' captured by reference.
static bool
split_nonconstant_init_1 (tree dest, tree init)
{
- unsigned HOST_WIDE_INT idx, tidx;
+ unsigned HOST_WIDE_INT idx, tidx = HOST_WIDE_INT_M1U;
tree field_index, value;
tree type = TREE_TYPE (dest);
tree inner_type = NULL;
if (!split_nonconstant_init_1 (sub, value))
complete_p = false;
else
- /* Mark element for removal. */
- CONSTRUCTOR_ELT (init, idx)->index = NULL_TREE;
- num_split_elts++;
+ {
+ /* Mark element for removal. */
+ CONSTRUCTOR_ELT (init, idx)->index = NULL_TREE;
+ if (idx < tidx)
+ tidx = idx;
+ num_split_elts++;
+ }
}
else if (!initializer_constant_valid_p (value, inner_type))
{
/* Mark element for removal. */
CONSTRUCTOR_ELT (init, idx)->index = NULL_TREE;
+ if (idx < tidx)
+ tidx = idx;
if (TREE_CODE (field_index) == RANGE_EXPR)
{
num_split_elts++;
}
}
- if (num_split_elts != 0)
+ if (num_split_elts == 1)
+ CONSTRUCTOR_ELTS (init)->ordered_remove (tidx);
+ else if (num_split_elts > 1)
{
/* Perform the delayed ordered removal of non-constant elements
we split out. */
- for (tidx = 0, idx = 0; idx < CONSTRUCTOR_NELTS (init); ++idx)
+ for (idx = tidx; idx < CONSTRUCTOR_NELTS (init); ++idx)
if (CONSTRUCTOR_ELT (init, idx)->index == NULL_TREE)
;
else
{
- if (tidx != idx)
- *CONSTRUCTOR_ELT (init, tidx) = *CONSTRUCTOR_ELT (init, idx);
+ *CONSTRUCTOR_ELT (init, tidx) = *CONSTRUCTOR_ELT (init, idx);
++tidx;
}
vec_safe_truncate (CONSTRUCTOR_ELTS (init), tidx);