1 /* Handle initialization things in -*- C++ -*-
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
25 #include "coretypes.h"
28 #include "stringpool.h"
31 #include "c-family/c-ubsan.h"
33 #include "stringpool.h"
36 #include "stor-layout.h"
37 #include "pointer-query.h"
39 static bool begin_init_stmts (tree
*, tree
*);
40 static tree
finish_init_stmts (bool, tree
, tree
);
41 static void construct_virtual_base (tree
, tree
);
42 static bool expand_aggr_init_1 (tree
, tree
, tree
, tree
, int, tsubst_flags_t
);
43 static bool expand_default_init (tree
, tree
, tree
, tree
, int, tsubst_flags_t
);
44 static int member_init_ok_or_else (tree
, tree
, tree
);
45 static void expand_virtual_init (tree
, tree
);
46 static tree
sort_mem_initializers (tree
, tree
);
47 static tree
initializing_context (tree
);
48 static void expand_cleanup_for_base (tree
, tree
);
49 static tree
dfs_initialize_vtbl_ptrs (tree
, void *);
50 static tree
build_field_list (tree
, tree
, int *);
51 static int diagnose_uninitialized_cst_or_ref_member_1 (tree
, tree
, bool, bool);
53 static GTY(()) tree fn
;
55 /* We are about to generate some complex initialization code.
56 Conceptually, it is all a single expression. However, we may want
57 to include conditionals, loops, and other such statement-level
58 constructs. Therefore, we build the initialization code inside a
59 statement-expression. This function starts such an expression.
60 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
61 pass them back to finish_init_stmts when the expression is
65 begin_init_stmts (tree
*stmt_expr_p
, tree
*compound_stmt_p
)
67 bool is_global
= !building_stmt_list_p ();
69 *stmt_expr_p
= begin_stmt_expr ();
70 *compound_stmt_p
= begin_compound_stmt (BCS_NO_SCOPE
);
75 /* Finish out the statement-expression begun by the previous call to
76 begin_init_stmts. Returns the statement-expression itself. */
79 finish_init_stmts (bool is_global
, tree stmt_expr
, tree compound_stmt
)
81 finish_compound_stmt (compound_stmt
);
83 stmt_expr
= finish_stmt_expr (stmt_expr
, true);
85 gcc_assert (!building_stmt_list_p () == is_global
);
92 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
93 which we want to initialize the vtable pointer for, DATA is
94 TREE_LIST whose TREE_VALUE is the this ptr expression. */
97 dfs_initialize_vtbl_ptrs (tree binfo
, void *data
)
99 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
100 return dfs_skip_bases
;
102 if (!BINFO_PRIMARY_P (binfo
) || BINFO_VIRTUAL_P (binfo
))
104 tree base_ptr
= TREE_VALUE ((tree
) data
);
106 base_ptr
= build_base_path (PLUS_EXPR
, base_ptr
, binfo
, /*nonnull=*/1,
107 tf_warning_or_error
);
109 expand_virtual_init (binfo
, base_ptr
);
115 /* Initialize all the vtable pointers in the object pointed to by
119 initialize_vtbl_ptrs (tree addr
)
124 type
= TREE_TYPE (TREE_TYPE (addr
));
125 list
= build_tree_list (type
, addr
);
127 /* Walk through the hierarchy, initializing the vptr in each base
128 class. We do these in pre-order because we can't find the virtual
129 bases for a class until we've initialized the vtbl for that
131 dfs_walk_once (TYPE_BINFO (type
), dfs_initialize_vtbl_ptrs
, NULL
, list
);
134 /* Return an expression for the zero-initialization of an object with
135 type T. This expression will either be a constant (in the case
136 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
137 aggregate), or NULL (in the case that T does not require
138 initialization). In either case, the value can be used as
139 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
140 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
141 is the number of elements in the array. If STATIC_STORAGE_P is
142 TRUE, initializers are only generated for entities for which
143 zero-initialization does not simply mean filling the storage with
144 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
145 subfields with bit positions at or above that bit size shouldn't
146 be added. Note that this only works when the result is assigned
147 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
148 expand_assignment will end up clearing the full size of TYPE. */
151 build_zero_init_1 (tree type
, tree nelts
, bool static_storage_p
,
154 tree init
= NULL_TREE
;
158 To zero-initialize an object of type T means:
160 -- if T is a scalar type, the storage is set to the value of zero
163 -- if T is a non-union class type, the storage for each non-static
164 data member and each base-class subobject is zero-initialized.
166 -- if T is a union type, the storage for its first data member is
169 -- if T is an array type, the storage for each element is
172 -- if T is a reference type, no initialization is performed. */
174 gcc_assert (nelts
== NULL_TREE
|| TREE_CODE (nelts
) == INTEGER_CST
);
176 if (type
== error_mark_node
)
178 else if (static_storage_p
&& zero_init_p (type
))
179 /* In order to save space, we do not explicitly build initializers
180 for items that do not need them. GCC's semantics are that
181 items with static storage duration that are not otherwise
182 initialized are initialized to zero. */
184 else if (TYPE_PTR_OR_PTRMEM_P (type
))
185 init
= fold (convert (type
, nullptr_node
));
186 else if (NULLPTR_TYPE_P (type
))
187 init
= build_int_cst (type
, 0);
188 else if (SCALAR_TYPE_P (type
))
189 init
= build_zero_cst (type
);
190 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (type
)))
193 vec
<constructor_elt
, va_gc
> *v
= NULL
;
195 /* Iterate over the fields, building initializations. */
196 for (field
= TYPE_FIELDS (type
); field
; field
= next
)
198 next
= DECL_CHAIN (field
);
200 if (TREE_CODE (field
) != FIELD_DECL
)
203 /* For unions, only the first field is initialized. */
204 if (TREE_CODE (type
) == UNION_TYPE
)
207 if (TREE_TYPE (field
) == error_mark_node
)
210 /* Don't add virtual bases for base classes if they are beyond
211 the size of the current field, that means it is present
212 somewhere else in the object. */
215 tree bitpos
= bit_position (field
);
216 if (TREE_CODE (bitpos
) == INTEGER_CST
217 && !tree_int_cst_lt (bitpos
, field_size
))
221 /* Don't add zero width bitfields. */
222 if (DECL_C_BIT_FIELD (field
)
223 && integer_zerop (DECL_SIZE (field
)))
226 /* Note that for class types there will be FIELD_DECLs
227 corresponding to base classes as well. Thus, iterating
228 over TYPE_FIELDs will result in correct initialization of
229 all of the subobjects. */
230 if (!static_storage_p
|| !zero_init_p (TREE_TYPE (field
)))
233 = (DECL_FIELD_IS_BASE (field
)
235 && TREE_CODE (DECL_SIZE (field
)) == INTEGER_CST
)
236 ? DECL_SIZE (field
) : NULL_TREE
;
237 tree value
= build_zero_init_1 (TREE_TYPE (field
),
242 CONSTRUCTOR_APPEND_ELT(v
, field
, value
);
246 /* Build a constructor to contain the initializations. */
247 init
= build_constructor (type
, v
);
249 else if (TREE_CODE (type
) == ARRAY_TYPE
)
252 vec
<constructor_elt
, va_gc
> *v
= NULL
;
254 /* Iterate over the array elements, building initializations. */
256 max_index
= fold_build2_loc (input_location
, MINUS_EXPR
,
257 TREE_TYPE (nelts
), nelts
,
258 build_one_cst (TREE_TYPE (nelts
)));
259 /* Treat flexible array members like [0] arrays. */
260 else if (TYPE_DOMAIN (type
) == NULL_TREE
)
263 max_index
= array_type_nelts (type
);
265 /* If we have an error_mark here, we should just return error mark
266 as we don't know the size of the array yet. */
267 if (max_index
== error_mark_node
)
268 return error_mark_node
;
269 gcc_assert (TREE_CODE (max_index
) == INTEGER_CST
);
271 /* A zero-sized array, which is accepted as an extension, will
272 have an upper bound of -1. */
273 if (!integer_minus_onep (max_index
))
277 /* If this is a one element array, we just use a regular init. */
278 if (integer_zerop (max_index
))
279 ce
.index
= size_zero_node
;
281 ce
.index
= build2 (RANGE_EXPR
, sizetype
, size_zero_node
,
284 ce
.value
= build_zero_init_1 (TREE_TYPE (type
), /*nelts=*/NULL_TREE
,
285 static_storage_p
, NULL_TREE
);
293 /* Build a constructor to contain the initializations. */
294 init
= build_constructor (type
, v
);
296 else if (VECTOR_TYPE_P (type
))
297 init
= build_zero_cst (type
);
299 gcc_assert (TYPE_REF_P (type
));
301 /* In all cases, the initializer is a constant. */
303 TREE_CONSTANT (init
) = 1;
308 /* Return an expression for the zero-initialization of an object with
309 type T. This expression will either be a constant (in the case
310 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
311 aggregate), or NULL (in the case that T does not require
312 initialization). In either case, the value can be used as
313 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
314 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
315 is the number of elements in the array. If STATIC_STORAGE_P is
316 TRUE, initializers are only generated for entities for which
317 zero-initialization does not simply mean filling the storage with
321 build_zero_init (tree type
, tree nelts
, bool static_storage_p
)
323 return build_zero_init_1 (type
, nelts
, static_storage_p
, NULL_TREE
);
326 /* Return a suitable initializer for value-initializing an object of type
327 TYPE, as described in [dcl.init]. */
330 build_value_init (tree type
, tsubst_flags_t complain
)
334 To value-initialize an object of type T means:
336 - if T is a class type (clause 9) with either no default constructor
337 (12.1) or a default constructor that is user-provided or deleted,
338 then the object is default-initialized;
340 - if T is a (possibly cv-qualified) class type without a user-provided
341 or deleted default constructor, then the object is zero-initialized
342 and the semantic constraints for default-initialization are checked,
343 and if T has a non-trivial default constructor, the object is
346 - if T is an array type, then each element is value-initialized;
348 - otherwise, the object is zero-initialized.
350 A program that calls for default-initialization or
351 value-initialization of an entity of reference type is ill-formed. */
353 if (CLASS_TYPE_P (type
) && type_build_ctor_call (type
))
356 = build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
357 NULL
, type
, LOOKUP_NORMAL
, complain
);
358 if (ctor
== error_mark_node
|| TREE_CONSTANT (ctor
))
360 if (processing_template_decl
)
361 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
362 return build_min (CAST_EXPR
, type
, NULL_TREE
);
364 if (TREE_CODE (ctor
) == CALL_EXPR
)
365 fn
= get_callee_fndecl (ctor
);
366 ctor
= build_aggr_init_expr (type
, ctor
);
367 if (fn
&& user_provided_p (fn
))
369 else if (TYPE_HAS_COMPLEX_DFLT (type
))
371 /* This is a class that needs constructing, but doesn't have
372 a user-provided constructor. So we need to zero-initialize
373 the object and then call the implicitly defined ctor.
374 This will be handled in simplify_aggr_init_expr. */
375 AGGR_INIT_ZERO_FIRST (ctor
) = 1;
380 /* Discard any access checking during subobject initialization;
381 the checks are implied by the call to the ctor which we have
382 verified is OK (cpp0x/defaulted46.C). */
383 push_deferring_access_checks (dk_deferred
);
384 tree r
= build_value_init_noctor (type
, complain
);
385 pop_deferring_access_checks ();
389 /* Like build_value_init, but don't call the constructor for TYPE. Used
390 for base initializers. */
393 build_value_init_noctor (tree type
, tsubst_flags_t complain
)
395 if (!COMPLETE_TYPE_P (type
))
397 if (complain
& tf_error
)
398 error ("value-initialization of incomplete type %qT", type
);
399 return error_mark_node
;
401 /* FIXME the class and array cases should just use digest_init once it is
403 if (CLASS_TYPE_P (type
))
405 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (type
)
408 if (TREE_CODE (type
) != UNION_TYPE
)
411 vec
<constructor_elt
, va_gc
> *v
= NULL
;
413 /* Iterate over the fields, building initializations. */
414 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
418 if (TREE_CODE (field
) != FIELD_DECL
)
421 ftype
= TREE_TYPE (field
);
423 if (ftype
== error_mark_node
)
426 /* Ignore flexible array members for value initialization. */
427 if (TREE_CODE (ftype
) == ARRAY_TYPE
428 && !COMPLETE_TYPE_P (ftype
)
429 && !TYPE_DOMAIN (ftype
)
430 && COMPLETE_TYPE_P (TREE_TYPE (ftype
))
431 && (next_aggregate_field (DECL_CHAIN (field
))
435 /* Ignore unnamed zero-width bitfields. */
436 if (DECL_UNNAMED_BIT_FIELD (field
)
437 && integer_zerop (DECL_SIZE (field
)))
440 /* We could skip vfields and fields of types with
441 user-defined constructors, but I think that won't improve
442 performance at all; it should be simpler in general just
443 to zero out the entire object than try to only zero the
444 bits that actually need it. */
446 /* Note that for class types there will be FIELD_DECLs
447 corresponding to base classes as well. Thus, iterating
448 over TYPE_FIELDs will result in correct initialization of
449 all of the subobjects. */
450 value
= build_value_init (ftype
, complain
);
451 value
= maybe_constant_init (value
);
453 if (value
== error_mark_node
)
454 return error_mark_node
;
456 CONSTRUCTOR_APPEND_ELT(v
, field
, value
);
458 /* We shouldn't have gotten here for anything that would need
459 non-trivial initialization, and gimplify_init_ctor_preeval
460 would need to be fixed to allow it. */
461 gcc_assert (TREE_CODE (value
) != TARGET_EXPR
462 && TREE_CODE (value
) != AGGR_INIT_EXPR
);
465 /* Build a constructor to contain the zero- initializations. */
466 return build_constructor (type
, v
);
469 else if (TREE_CODE (type
) == ARRAY_TYPE
)
471 vec
<constructor_elt
, va_gc
> *v
= NULL
;
473 /* Iterate over the array elements, building initializations. */
474 tree max_index
= array_type_nelts (type
);
476 /* If we have an error_mark here, we should just return error mark
477 as we don't know the size of the array yet. */
478 if (max_index
== error_mark_node
)
480 if (complain
& tf_error
)
481 error ("cannot value-initialize array of unknown bound %qT",
483 return error_mark_node
;
485 gcc_assert (TREE_CODE (max_index
) == INTEGER_CST
);
487 /* A zero-sized array, which is accepted as an extension, will
488 have an upper bound of -1. */
489 if (!tree_int_cst_equal (max_index
, integer_minus_one_node
))
493 /* If this is a one element array, we just use a regular init. */
494 if (tree_int_cst_equal (size_zero_node
, max_index
))
495 ce
.index
= size_zero_node
;
497 ce
.index
= build2 (RANGE_EXPR
, sizetype
, size_zero_node
, max_index
);
499 ce
.value
= build_value_init (TREE_TYPE (type
), complain
);
500 ce
.value
= maybe_constant_init (ce
.value
);
501 if (ce
.value
== error_mark_node
)
502 return error_mark_node
;
507 /* We shouldn't have gotten here for anything that would need
508 non-trivial initialization, and gimplify_init_ctor_preeval
509 would need to be fixed to allow it. */
510 gcc_assert (TREE_CODE (ce
.value
) != TARGET_EXPR
511 && TREE_CODE (ce
.value
) != AGGR_INIT_EXPR
);
514 /* Build a constructor to contain the initializations. */
515 return build_constructor (type
, v
);
517 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
519 if (complain
& tf_error
)
520 error ("value-initialization of function type %qT", type
);
521 return error_mark_node
;
523 else if (TYPE_REF_P (type
))
525 if (complain
& tf_error
)
526 error ("value-initialization of reference type %qT", type
);
527 return error_mark_node
;
530 return build_zero_init (type
, NULL_TREE
, /*static_storage_p=*/false);
533 /* Initialize current class with INIT, a TREE_LIST of arguments for
534 a target constructor. If TREE_LIST is void_type_node, an empty
535 initializer list was given. Return the target constructor. */
538 perform_target_ctor (tree init
)
540 tree decl
= current_class_ref
;
541 tree type
= current_class_type
;
543 init
= build_aggr_init (decl
, init
, LOOKUP_NORMAL
|LOOKUP_DELEGATING_CONS
,
544 tf_warning_or_error
);
545 finish_expr_stmt (init
);
546 if (type_build_dtor_call (type
))
548 tree expr
= build_delete (input_location
,
549 type
, decl
, sfk_complete_destructor
,
553 0, tf_warning_or_error
);
554 if (DECL_HAS_IN_CHARGE_PARM_P (current_function_decl
))
556 tree base
= build_delete (input_location
,
557 type
, decl
, sfk_base_destructor
,
561 0, tf_warning_or_error
);
562 expr
= build_if_in_charge (expr
, base
);
564 if (expr
!= error_mark_node
565 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
566 finish_eh_cleanup (expr
);
571 /* Instantiate the default member initializer of MEMBER, if needed.
572 Only get_nsdmi should use the return value of this function. */
575 maybe_instantiate_nsdmi_init (tree member
, tsubst_flags_t complain
)
577 tree init
= DECL_INITIAL (member
);
579 /* tsubst_decl uses void_node to indicate an uninstantiated DMI. */
580 if (init
== void_node
)
582 /* Clear any special tsubst flags; the result of NSDMI instantiation
583 should be independent of the substitution context. */
584 complain
&= tf_warning_or_error
;
586 init
= DECL_INITIAL (DECL_TI_TEMPLATE (member
));
588 = cp_expr_loc_or_loc (init
, DECL_SOURCE_LOCATION (member
));
589 if (TREE_CODE (init
) == DEFERRED_PARSE
)
591 /* Check recursive instantiation. */
592 else if (DECL_INSTANTIATING_NSDMI_P (member
))
594 if (complain
& tf_error
)
595 error_at (expr_loc
, "recursive instantiation of default member "
596 "initializer for %qD", member
);
597 init
= error_mark_node
;
603 location_t sloc
= input_location
;
604 input_location
= expr_loc
;
606 DECL_INSTANTIATING_NSDMI_P (member
) = 1;
609 tree ctx
= type_context_for_name_lookup (member
);
611 bool push_to_top
= maybe_push_to_top_level (member
);
612 if (!currently_open_class (ctx
))
614 push_nested_class (ctx
);
615 push_deferring_access_checks (dk_no_deferred
);
619 inject_this_parameter (ctx
, TYPE_UNQUALIFIED
);
621 start_lambda_scope (member
);
623 /* Do deferred instantiation of the NSDMI. */
624 init
= tsubst_copy_and_build (init
, DECL_TI_ARGS (member
),
626 init
= digest_nsdmi_init (member
, init
, complain
);
628 finish_lambda_scope ();
630 DECL_INSTANTIATING_NSDMI_P (member
) = 0;
632 if (init
!= error_mark_node
)
633 DECL_INITIAL (member
) = init
;
637 pop_deferring_access_checks ();
640 maybe_pop_from_top_level (push_to_top
);
642 input_location
= sloc
;
649 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
652 get_nsdmi (tree member
, bool in_ctor
, tsubst_flags_t complain
)
654 tree save_ccp
= current_class_ptr
;
655 tree save_ccr
= current_class_ref
;
657 tree init
= maybe_instantiate_nsdmi_init (member
, complain
);
659 if (init
&& TREE_CODE (init
) == DEFERRED_PARSE
)
661 if (complain
& tf_error
)
663 error ("default member initializer for %qD required before the end "
664 "of its enclosing class", member
);
665 inform (location_of (init
), "defined here");
666 DECL_INITIAL (member
) = error_mark_node
;
668 init
= error_mark_node
;
673 current_class_ptr
= save_ccp
;
674 current_class_ref
= save_ccr
;
678 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
679 refer to; constexpr evaluation knows what to do with it. */
680 current_class_ref
= build0 (PLACEHOLDER_EXPR
, DECL_CONTEXT (member
));
681 current_class_ptr
= build_address (current_class_ref
);
684 /* Clear processing_template_decl for sake of break_out_target_exprs;
685 INIT is always non-templated. */
686 processing_template_decl_sentinel ptds
;
688 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
689 so the aggregate init code below will see a CONSTRUCTOR. */
690 bool simple_target
= (init
&& SIMPLE_TARGET_EXPR_P (init
));
692 init
= TARGET_EXPR_INITIAL (init
);
693 init
= break_out_target_exprs (init
, /*loc*/true);
694 if (init
&& TREE_CODE (init
) == TARGET_EXPR
)
695 /* In a constructor, this expresses the full initialization, prevent
696 perform_member_init from calling another constructor (58162). */
697 TARGET_EXPR_DIRECT_INIT_P (init
) = in_ctor
;
698 if (simple_target
&& TREE_CODE (init
) != CONSTRUCTOR
)
699 /* Now put it back so C++17 copy elision works. */
700 init
= get_target_expr (init
);
702 set_target_expr_eliding (init
);
704 current_class_ptr
= save_ccp
;
705 current_class_ref
= save_ccr
;
709 /* Diagnose the flexible array MEMBER if its INITializer is non-null
710 and return true if so. Otherwise return false. */
713 maybe_reject_flexarray_init (tree member
, tree init
)
715 tree type
= TREE_TYPE (member
);
718 || TREE_CODE (type
) != ARRAY_TYPE
719 || TYPE_DOMAIN (type
))
722 /* Point at the flexible array member declaration if it's initialized
723 in-class, and at the ctor if it's initialized in a ctor member
726 if (DECL_INITIAL (member
) == init
727 || !current_function_decl
728 || DECL_DEFAULTED_FN (current_function_decl
))
729 loc
= DECL_SOURCE_LOCATION (member
);
731 loc
= DECL_SOURCE_LOCATION (current_function_decl
);
733 error_at (loc
, "initializer for flexible array member %q#D", member
);
737 /* If INIT's value can come from a call to std::initializer_list<T>::begin,
738 return that function. Otherwise, NULL_TREE. */
741 find_list_begin (tree init
)
744 while (TREE_CODE (init
) == COMPOUND_EXPR
)
745 init
= TREE_OPERAND (init
, 1);
747 if (TREE_CODE (init
) == COND_EXPR
)
749 tree left
= TREE_OPERAND (init
, 1);
751 left
= TREE_OPERAND (init
, 0);
752 left
= find_list_begin (left
);
755 return find_list_begin (TREE_OPERAND (init
, 2));
757 if (TREE_CODE (init
) == CALL_EXPR
)
758 if (tree fn
= get_callee_fndecl (init
))
759 if (id_equal (DECL_NAME (fn
), "begin")
760 && is_std_init_list (DECL_CONTEXT (fn
)))
765 /* If INIT initializing MEMBER is copying the address of the underlying array
766 of an initializer_list, warn. */
769 maybe_warn_list_ctor (tree member
, tree init
)
771 tree memtype
= TREE_TYPE (member
);
772 if (!init
|| !TYPE_PTR_P (memtype
)
773 || !is_list_ctor (current_function_decl
))
776 tree parm
= FUNCTION_FIRST_USER_PARMTYPE (current_function_decl
);
777 parm
= TREE_VALUE (parm
);
778 tree initlist
= non_reference (parm
);
780 /* Do not warn if the parameter is an lvalue reference to non-const. */
781 if (TYPE_REF_P (parm
) && !TYPE_REF_IS_RVALUE (parm
)
782 && !CP_TYPE_CONST_P (initlist
))
785 tree targs
= CLASSTYPE_TI_ARGS (initlist
);
786 tree elttype
= TREE_VEC_ELT (targs
, 0);
788 if (!same_type_ignoring_top_level_qualifiers_p
789 (TREE_TYPE (memtype
), elttype
))
792 tree begin
= find_list_begin (init
);
796 location_t loc
= cp_expr_loc_or_input_loc (init
);
797 warning_at (loc
, OPT_Winit_list_lifetime
,
798 "initializing %qD from %qE does not extend the lifetime "
799 "of the underlying array", member
, begin
);
802 /* Data structure for find_uninit_fields_r, below. */
804 struct find_uninit_data
{
805 /* The set tracking the yet-uninitialized members. */
806 hash_set
<tree
> *uninitialized
;
807 /* The data member we are currently initializing. It can be either
808 a type (initializing a base class/delegating constructors), or
813 /* walk_tree callback that warns about using uninitialized data in
814 a member-initializer-list. */
817 find_uninit_fields_r (tree
*tp
, int *walk_subtrees
, void *data
)
819 find_uninit_data
*d
= static_cast<find_uninit_data
*>(data
);
820 hash_set
<tree
> *uninitialized
= d
->uninitialized
;
822 const tree_code code
= TREE_CODE (init
);
824 /* No need to look into types or unevaluated operands. */
825 if (TYPE_P (init
) || unevaluated_p (code
))
827 *walk_subtrees
= false;
833 /* We'd need data flow info to avoid false positives. */
837 /* We might see a MODIFY_EXPR in cases like S() : a((b = 42)), c(b) { }
838 where the initializer for 'a' surreptitiously initializes 'b'. Let's
839 not bother with these complicated scenarios in the front end. */
841 /* Don't attempt to handle statement-expressions, either. */
843 uninitialized
->empty ();
845 /* If we're just taking the address of an object, it doesn't matter
846 whether it's been initialized. */
848 *walk_subtrees
= false;
854 /* We'd need data flow info to avoid false positives. */
855 if (truth_value_p (code
))
857 /* Attempt to handle a simple a{b}, but no more. */
858 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
860 if (CONSTRUCTOR_NELTS (init
) == 1
861 && !BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (init
, 0)->value
))
862 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
866 /* Warn about uninitialized 'this'. */
867 else if (code
== CALL_EXPR
)
869 tree fn
= get_callee_fndecl (init
);
870 if (fn
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
872 tree op
= CALL_EXPR_ARG (init
, 0);
873 if (TREE_CODE (op
) == ADDR_EXPR
)
874 op
= TREE_OPERAND (op
, 0);
875 temp_override
<tree
> ovr (d
->member
, DECL_ARGUMENTS (fn
));
876 cp_walk_tree_without_duplicates (&op
, find_uninit_fields_r
, data
);
878 /* Functions (whether static or nonstatic member) may have side effects
879 and initialize other members; it's not the front end's job to try to
880 figure it out. But don't give up for constructors: we still want to
881 warn when initializing base classes:
883 struct D : public B {
888 so carry on to detect that 'x' is used uninitialized. */
889 if (!fn
|| !DECL_CONSTRUCTOR_P (fn
))
893 /* If we find FIELD in the uninitialized set, we warn. */
894 if (code
== COMPONENT_REF
)
896 tree field
= TREE_OPERAND (init
, 1);
897 tree type
= TYPE_P (d
->member
) ? d
->member
: TREE_TYPE (d
->member
);
899 /* We're initializing a reference member with itself. */
900 if (TYPE_REF_P (type
) && cp_tree_equal (d
->member
, init
))
901 warning_at (EXPR_LOCATION (init
), OPT_Winit_self
,
902 "%qD is initialized with itself", field
);
903 else if (cp_tree_equal (TREE_OPERAND (init
, 0), current_class_ref
)
904 && uninitialized
->contains (field
))
906 if (TYPE_REF_P (TREE_TYPE (field
)))
907 warning_at (EXPR_LOCATION (init
), OPT_Wuninitialized
,
908 "reference %qD is not yet bound to a value when used "
910 else if (!INDIRECT_TYPE_P (type
) || is_this_parameter (d
->member
))
911 warning_at (EXPR_LOCATION (init
), OPT_Wuninitialized
,
912 "member %qD is used uninitialized", field
);
913 *walk_subtrees
= false;
920 *walk_subtrees
= false;
921 uninitialized
->empty ();
922 return integer_zero_node
;
925 /* Wrapper around find_uninit_fields_r above. */
928 find_uninit_fields (tree
*t
, hash_set
<tree
> *uninitialized
, tree member
)
930 if (!uninitialized
->is_empty ())
932 find_uninit_data data
= { uninitialized
, member
};
933 cp_walk_tree_without_duplicates (t
, find_uninit_fields_r
, &data
);
937 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
938 arguments. If TREE_LIST is void_type_node, an empty initializer
939 list was given; if NULL_TREE no initializer was given. UNINITIALIZED
940 is the hash set that tracks uninitialized fields. */
943 perform_member_init (tree member
, tree init
, hash_set
<tree
> &uninitialized
)
946 tree type
= TREE_TYPE (member
);
948 /* Use the non-static data member initializer if there was no
949 mem-initializer for this field. */
950 if (init
== NULL_TREE
)
951 init
= get_nsdmi (member
, /*ctor*/true, tf_warning_or_error
);
953 if (init
== error_mark_node
)
956 /* Effective C++ rule 12 requires that all data members be
958 if (warn_ecpp
&& init
== NULL_TREE
&& TREE_CODE (type
) != ARRAY_TYPE
)
959 warning_at (DECL_SOURCE_LOCATION (current_function_decl
), OPT_Weffc__
,
960 "%qD should be initialized in the member initialization list",
963 /* Get an lvalue for the data member. */
964 decl
= build_class_member_access_expr (current_class_ref
, member
,
965 /*access_path=*/NULL_TREE
,
966 /*preserve_reference=*/true,
967 tf_warning_or_error
);
968 if (decl
== error_mark_node
)
971 if ((warn_init_self
|| warn_uninitialized
)
973 && TREE_CODE (init
) == TREE_LIST
974 && TREE_CHAIN (init
) == NULL_TREE
)
976 tree val
= TREE_VALUE (init
);
977 /* Handle references. */
978 if (REFERENCE_REF_P (val
))
979 val
= TREE_OPERAND (val
, 0);
980 if (TREE_CODE (val
) == COMPONENT_REF
&& TREE_OPERAND (val
, 1) == member
981 && TREE_OPERAND (val
, 0) == current_class_ref
)
982 warning_at (DECL_SOURCE_LOCATION (current_function_decl
),
983 OPT_Winit_self
, "%qD is initialized with itself",
986 find_uninit_fields (&val
, &uninitialized
, decl
);
989 if (array_of_unknown_bound_p (type
))
991 maybe_reject_flexarray_init (member
, init
);
995 if (init
&& TREE_CODE (init
) == TREE_LIST
)
998 if (DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
999 init
= build_x_compound_expr_from_list (init
, ELK_MEM_INIT
,
1000 tf_warning_or_error
);
1001 /* We are trying to initialize an array from a ()-list. If we
1002 should attempt to do so, conjure up a CONSTRUCTOR. */
1003 else if (TREE_CODE (type
) == ARRAY_TYPE
1004 /* P0960 is a C++20 feature. */
1005 && cxx_dialect
>= cxx20
)
1006 init
= do_aggregate_paren_init (init
, type
);
1007 else if (!CLASS_TYPE_P (type
))
1008 init
= build_x_compound_expr_from_list (init
, ELK_MEM_INIT
,
1009 tf_warning_or_error
);
1010 /* If we're initializing a class from a ()-list, leave the TREE_LIST
1011 alone: we might call an appropriate constructor, or (in C++20)
1012 do aggregate-initialization. */
1015 /* Assume we are initializing the member. */
1016 bool member_initialized_p
= true;
1018 if (init
== void_type_node
)
1020 /* mem() means value-initialization. */
1021 if (TREE_CODE (type
) == ARRAY_TYPE
)
1023 init
= build_vec_init_expr (type
, init
, tf_warning_or_error
);
1024 init
= cp_build_init_expr (decl
, init
);
1025 finish_expr_stmt (init
);
1029 tree value
= build_value_init (type
, tf_warning_or_error
);
1030 if (value
== error_mark_node
)
1032 init
= cp_build_init_expr (decl
, value
);
1033 finish_expr_stmt (init
);
1036 /* Deal with this here, as we will get confused if we try to call the
1037 assignment op for an anonymous union. This can happen in a
1038 synthesized copy constructor. */
1039 else if (ANON_AGGR_TYPE_P (type
))
1043 init
= cp_build_init_expr (decl
, TREE_VALUE (init
));
1044 finish_expr_stmt (init
);
1048 && (TYPE_REF_P (type
)
1049 || (TREE_CODE (init
) == CONSTRUCTOR
1050 && (CP_AGGREGATE_TYPE_P (type
)
1051 || is_std_init_list (type
)))))
1053 /* With references and list-initialization, we need to deal with
1054 extending temporary lifetimes. 12.2p5: "A temporary bound to a
1055 reference member in a constructor’s ctor-initializer (12.6.2)
1056 persists until the constructor exits." */
1058 releasing_vec cleanups
;
1059 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (init
), type
))
1061 if (BRACE_ENCLOSED_INITIALIZER_P (init
)
1062 && CP_AGGREGATE_TYPE_P (type
))
1063 init
= reshape_init (type
, init
, tf_warning_or_error
);
1064 init
= digest_init (type
, init
, tf_warning_or_error
);
1066 if (init
== error_mark_node
)
1068 if (is_empty_field (member
)
1069 && !TREE_SIDE_EFFECTS (init
))
1070 /* Don't add trivial initialization of an empty base/field, as they
1071 might not be ordered the way the back-end expects. */
1073 /* A FIELD_DECL doesn't really have a suitable lifetime, but
1074 make_temporary_var_for_ref_to_temp will treat it as automatic and
1075 set_up_extended_ref_temp wants to use the decl in a warning. */
1076 init
= extend_ref_init_temps (member
, init
, &cleanups
);
1077 if (TREE_CODE (type
) == ARRAY_TYPE
1078 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (type
)))
1079 init
= build_vec_init_expr (type
, init
, tf_warning_or_error
);
1080 init
= cp_build_init_expr (decl
, init
);
1081 finish_expr_stmt (init
);
1082 FOR_EACH_VEC_ELT (*cleanups
, i
, t
)
1083 push_cleanup (NULL_TREE
, t
, false);
1085 else if (type_build_ctor_call (type
)
1086 || (init
&& CLASS_TYPE_P (strip_array_types (type
))))
1088 if (TREE_CODE (type
) == ARRAY_TYPE
)
1090 if (init
== NULL_TREE
1091 || same_type_ignoring_top_level_qualifiers_p (type
,
1094 if (TYPE_DOMAIN (type
) && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
1096 /* Initialize the array only if it's not a flexible
1097 array member (i.e., if it has an upper bound). */
1098 init
= build_vec_init_expr (type
, init
, tf_warning_or_error
);
1099 init
= cp_build_init_expr (decl
, init
);
1100 finish_expr_stmt (init
);
1104 error ("invalid initializer for array member %q#D", member
);
1108 int flags
= LOOKUP_NORMAL
;
1109 if (DECL_DEFAULTED_FN (current_function_decl
))
1110 flags
|= LOOKUP_DEFAULTED
;
1111 if (CP_TYPE_CONST_P (type
)
1112 && init
== NULL_TREE
1113 && default_init_uninitialized_part (type
))
1115 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
1116 vtable; still give this diagnostic. */
1117 auto_diagnostic_group d
;
1118 if (permerror (DECL_SOURCE_LOCATION (current_function_decl
),
1119 "uninitialized const member in %q#T", type
))
1120 inform (DECL_SOURCE_LOCATION (member
),
1121 "%q#D should be initialized", member
);
1123 finish_expr_stmt (build_aggr_init (decl
, init
, flags
,
1124 tf_warning_or_error
));
1129 if (init
== NULL_TREE
)
1132 /* member traversal: note it leaves init NULL */
1133 if (TYPE_REF_P (type
))
1135 auto_diagnostic_group d
;
1136 if (permerror (DECL_SOURCE_LOCATION (current_function_decl
),
1137 "uninitialized reference member in %q#T", type
))
1138 inform (DECL_SOURCE_LOCATION (member
),
1139 "%q#D should be initialized", member
);
1141 else if (CP_TYPE_CONST_P (type
))
1143 auto_diagnostic_group d
;
1144 if (permerror (DECL_SOURCE_LOCATION (current_function_decl
),
1145 "uninitialized const member in %q#T", type
))
1146 inform (DECL_SOURCE_LOCATION (member
),
1147 "%q#D should be initialized", member
);
1150 core_type
= strip_array_types (type
);
1152 if (CLASS_TYPE_P (core_type
)
1153 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
)
1154 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
)))
1155 diagnose_uninitialized_cst_or_ref_member (core_type
,
1156 /*using_new=*/false,
1159 /* We left the member uninitialized. */
1160 member_initialized_p
= false;
1163 maybe_warn_list_ctor (member
, init
);
1166 finish_expr_stmt (cp_build_modify_expr (input_location
, decl
,
1168 tf_warning_or_error
));
1171 if (member_initialized_p
&& warn_uninitialized
)
1172 /* This member is now initialized, remove it from the uninitialized
1174 uninitialized
.remove (member
);
1176 if (type_build_dtor_call (type
))
1180 expr
= build_class_member_access_expr (current_class_ref
, member
,
1181 /*access_path=*/NULL_TREE
,
1182 /*preserve_reference=*/false,
1183 tf_warning_or_error
);
1184 expr
= build_delete (input_location
,
1185 type
, expr
, sfk_complete_destructor
,
1186 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0,
1187 tf_warning_or_error
);
1189 if (expr
!= error_mark_node
1190 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1191 finish_eh_cleanup (expr
);
1195 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
1196 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
1199 build_field_list (tree t
, tree list
, int *uses_unions_or_anon_p
)
1203 /* Note whether or not T is a union. */
1204 if (TREE_CODE (t
) == UNION_TYPE
)
1205 *uses_unions_or_anon_p
= 1;
1207 for (fields
= TYPE_FIELDS (t
); fields
; fields
= DECL_CHAIN (fields
))
1211 /* Skip CONST_DECLs for enumeration constants and so forth. */
1212 if (TREE_CODE (fields
) != FIELD_DECL
|| DECL_ARTIFICIAL (fields
))
1215 fieldtype
= TREE_TYPE (fields
);
1217 /* For an anonymous struct or union, we must recursively
1218 consider the fields of the anonymous type. They can be
1219 directly initialized from the constructor. */
1220 if (ANON_AGGR_TYPE_P (fieldtype
))
1222 /* Add this field itself. Synthesized copy constructors
1223 initialize the entire aggregate. */
1224 list
= tree_cons (fields
, NULL_TREE
, list
);
1225 /* And now add the fields in the anonymous aggregate. */
1226 list
= build_field_list (fieldtype
, list
, uses_unions_or_anon_p
);
1227 *uses_unions_or_anon_p
= 1;
1229 /* Add this field. */
1230 else if (DECL_NAME (fields
))
1231 list
= tree_cons (fields
, NULL_TREE
, list
);
1237 /* Return the innermost aggregate scope for FIELD, whether that is
1238 the enclosing class or an anonymous aggregate within it. */
1241 innermost_aggr_scope (tree field
)
1243 if (ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1244 return TREE_TYPE (field
);
1246 return DECL_CONTEXT (field
);
1249 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
1250 a FIELD_DECL or BINFO in T that needs initialization. The
1251 TREE_VALUE gives the initializer, or list of initializer arguments.
1253 Return a TREE_LIST containing all of the initializations required
1254 for T, in the order in which they should be performed. The output
1255 list has the same format as the input. */
1258 sort_mem_initializers (tree t
, tree mem_inits
)
1261 tree base
, binfo
, base_binfo
;
1263 tree next_subobject
;
1264 vec
<tree
, va_gc
> *vbases
;
1266 int uses_unions_or_anon_p
= 0;
1268 /* Build up a list of initializations. The TREE_PURPOSE of entry
1269 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
1270 TREE_VALUE will be the constructor arguments, or NULL if no
1271 explicit initialization was provided. */
1272 sorted_inits
= NULL_TREE
;
1274 /* Process the virtual bases. */
1275 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
1276 vec_safe_iterate (vbases
, i
, &base
); i
++)
1277 sorted_inits
= tree_cons (base
, NULL_TREE
, sorted_inits
);
1279 /* Process the direct bases. */
1280 for (binfo
= TYPE_BINFO (t
), i
= 0;
1281 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
1282 if (!BINFO_VIRTUAL_P (base_binfo
))
1283 sorted_inits
= tree_cons (base_binfo
, NULL_TREE
, sorted_inits
);
1285 /* Process the non-static data members. */
1286 sorted_inits
= build_field_list (t
, sorted_inits
, &uses_unions_or_anon_p
);
1287 /* Reverse the entire list of initializations, so that they are in
1288 the order that they will actually be performed. */
1289 sorted_inits
= nreverse (sorted_inits
);
1291 /* If the user presented the initializers in an order different from
1292 that in which they will actually occur, we issue a warning. Keep
1293 track of the next subobject which can be explicitly initialized
1294 without issuing a warning. */
1295 next_subobject
= sorted_inits
;
1297 /* Go through the explicit initializers, filling in TREE_PURPOSE in
1298 the SORTED_INITS. */
1299 for (init
= mem_inits
; init
; init
= TREE_CHAIN (init
))
1302 tree subobject_init
;
1304 subobject
= TREE_PURPOSE (init
);
1306 /* If the explicit initializers are in sorted order, then
1307 SUBOBJECT will be NEXT_SUBOBJECT, or something following
1309 for (subobject_init
= next_subobject
;
1311 subobject_init
= TREE_CHAIN (subobject_init
))
1312 if (TREE_PURPOSE (subobject_init
) == subobject
)
1315 /* Issue a warning if the explicit initializer order does not
1316 match that which will actually occur.
1317 ??? Are all these on the correct lines? */
1318 if (warn_reorder
&& !subobject_init
)
1320 if (TREE_CODE (TREE_PURPOSE (next_subobject
)) == FIELD_DECL
)
1321 warning_at (DECL_SOURCE_LOCATION (TREE_PURPOSE (next_subobject
)),
1322 OPT_Wreorder
, "%qD will be initialized after",
1323 TREE_PURPOSE (next_subobject
));
1325 warning (OPT_Wreorder
, "base %qT will be initialized after",
1326 TREE_PURPOSE (next_subobject
));
1327 if (TREE_CODE (subobject
) == FIELD_DECL
)
1328 warning_at (DECL_SOURCE_LOCATION (subobject
),
1329 OPT_Wreorder
, " %q#D", subobject
);
1331 warning (OPT_Wreorder
, " base %qT", subobject
);
1332 warning_at (DECL_SOURCE_LOCATION (current_function_decl
),
1333 OPT_Wreorder
, " when initialized here");
1336 /* Look again, from the beginning of the list. */
1337 if (!subobject_init
)
1339 subobject_init
= sorted_inits
;
1340 while (TREE_PURPOSE (subobject_init
) != subobject
)
1341 subobject_init
= TREE_CHAIN (subobject_init
);
1344 /* It is invalid to initialize the same subobject more than
1346 if (TREE_VALUE (subobject_init
))
1348 if (TREE_CODE (subobject
) == FIELD_DECL
)
1349 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
1350 "multiple initializations given for %qD",
1353 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
1354 "multiple initializations given for base %qT",
1358 /* Record the initialization. */
1359 TREE_VALUE (subobject_init
) = TREE_VALUE (init
);
1360 /* Carry over the dummy TREE_TYPE node containing the source location. */
1361 TREE_TYPE (subobject_init
) = TREE_TYPE (init
);
1362 next_subobject
= subobject_init
;
1365 /* [class.base.init]
1367 If a ctor-initializer specifies more than one mem-initializer for
1368 multiple members of the same union (including members of
1369 anonymous unions), the ctor-initializer is ill-formed.
1371 Here we also splice out uninitialized union members. */
1372 if (uses_unions_or_anon_p
)
1374 tree
*last_p
= NULL
;
1376 for (p
= &sorted_inits
; *p
; )
1383 field
= TREE_PURPOSE (init
);
1385 /* Skip base classes. */
1386 if (TREE_CODE (field
) != FIELD_DECL
)
1389 /* If this is an anonymous aggregate with no explicit initializer,
1391 if (!TREE_VALUE (init
) && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1394 /* See if this field is a member of a union, or a member of a
1395 structure contained in a union, etc. */
1396 ctx
= innermost_aggr_scope (field
);
1398 /* If this field is not a member of a union, skip it. */
1399 if (TREE_CODE (ctx
) != UNION_TYPE
1400 && !ANON_AGGR_TYPE_P (ctx
))
1403 /* If this union member has no explicit initializer and no NSDMI,
1405 if (TREE_VALUE (init
) || DECL_INITIAL (field
))
1410 /* It's only an error if we have two initializers for the same
1418 /* See if LAST_FIELD and the field initialized by INIT are
1419 members of the same union (or the union itself). If so, there's
1420 a problem, unless they're actually members of the same structure
1421 which is itself a member of a union. For example, given:
1423 union { struct { int i; int j; }; };
1425 initializing both `i' and `j' makes sense. */
1426 ctx
= common_enclosing_class
1427 (innermost_aggr_scope (field
),
1428 innermost_aggr_scope (TREE_PURPOSE (*last_p
)));
1430 if (ctx
&& (TREE_CODE (ctx
) == UNION_TYPE
1431 || ctx
== TREE_TYPE (TREE_PURPOSE (*last_p
))))
1433 /* A mem-initializer hides an NSDMI. */
1434 if (TREE_VALUE (init
) && !TREE_VALUE (*last_p
))
1435 *last_p
= TREE_CHAIN (*last_p
);
1436 else if (TREE_VALUE (*last_p
) && !TREE_VALUE (init
))
1440 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
1441 "initializations for multiple members of %qT",
1450 p
= &TREE_CHAIN (*p
);
1453 *p
= TREE_CHAIN (*p
);
1457 return sorted_inits
;
1460 /* Callback for cp_walk_tree to mark all PARM_DECLs in a tree as read. */
1463 mark_exp_read_r (tree
*tp
, int *, void *)
1466 if (TREE_CODE (t
) == PARM_DECL
)
1471 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1472 is a TREE_LIST giving the explicit mem-initializer-list for the
1473 constructor. The TREE_PURPOSE of each entry is a subobject (a
1474 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1475 is a TREE_LIST giving the arguments to the constructor or
1476 void_type_node for an empty list of arguments. */
1479 emit_mem_initializers (tree mem_inits
)
1481 int flags
= LOOKUP_NORMAL
;
1483 /* We will already have issued an error message about the fact that
1484 the type is incomplete. */
1485 if (!COMPLETE_TYPE_P (current_class_type
))
1488 /* Keep a set holding fields that are not initialized. */
1489 hash_set
<tree
> uninitialized
;
1491 /* Initially that is all of them. */
1492 if (warn_uninitialized
)
1493 for (tree f
= next_aggregate_field (TYPE_FIELDS (current_class_type
));
1495 f
= next_aggregate_field (DECL_CHAIN (f
)))
1496 if (!DECL_ARTIFICIAL (f
)
1497 && !is_really_empty_class (TREE_TYPE (f
), /*ignore_vptr*/false))
1498 uninitialized
.add (f
);
1501 && TYPE_P (TREE_PURPOSE (mem_inits
))
1502 && same_type_p (TREE_PURPOSE (mem_inits
), current_class_type
))
1504 /* Delegating constructor. */
1505 gcc_assert (TREE_CHAIN (mem_inits
) == NULL_TREE
);
1506 tree ctor
= perform_target_ctor (TREE_VALUE (mem_inits
));
1507 find_uninit_fields (&ctor
, &uninitialized
, current_class_type
);
1511 if (DECL_DEFAULTED_FN (current_function_decl
)
1512 && ! DECL_INHERITED_CTOR (current_function_decl
))
1513 flags
|= LOOKUP_DEFAULTED
;
1515 /* Sort the mem-initializers into the order in which the
1516 initializations should be performed. */
1517 mem_inits
= sort_mem_initializers (current_class_type
, mem_inits
);
1519 in_base_initializer
= 1;
1521 /* Initialize base classes. */
1523 && TREE_CODE (TREE_PURPOSE (mem_inits
)) != FIELD_DECL
);
1524 mem_inits
= TREE_CHAIN (mem_inits
))
1526 tree subobject
= TREE_PURPOSE (mem_inits
);
1527 tree arguments
= TREE_VALUE (mem_inits
);
1529 /* We already have issued an error message. */
1530 if (arguments
== error_mark_node
)
1533 /* Suppress access control when calling the inherited ctor. */
1534 bool inherited_base
= (DECL_INHERITED_CTOR (current_function_decl
)
1535 && flag_new_inheriting_ctors
1538 push_deferring_access_checks (dk_deferred
);
1540 if (arguments
== NULL_TREE
)
1542 /* If these initializations are taking place in a copy constructor,
1543 the base class should probably be explicitly initialized if there
1544 is a user-defined constructor in the base class (other than the
1545 default constructor, which will be called anyway). */
1547 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
)
1548 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject
)))
1549 warning_at (DECL_SOURCE_LOCATION (current_function_decl
),
1550 OPT_Wextra
, "base class %q#T should be explicitly "
1551 "initialized in the copy constructor",
1552 BINFO_TYPE (subobject
));
1555 /* Initialize the base. */
1556 if (!BINFO_VIRTUAL_P (subobject
))
1560 base_addr
= build_base_path (PLUS_EXPR
, current_class_ptr
,
1561 subobject
, 1, tf_warning_or_error
);
1562 expand_aggr_init_1 (subobject
, NULL_TREE
,
1563 cp_build_fold_indirect_ref (base_addr
),
1566 tf_warning_or_error
);
1567 expand_cleanup_for_base (subobject
, NULL_TREE
);
1568 if (STATEMENT_LIST_TAIL (cur_stmt_list
))
1569 find_uninit_fields (&STATEMENT_LIST_TAIL (cur_stmt_list
)->stmt
,
1570 &uninitialized
, BINFO_TYPE (subobject
));
1572 else if (!ABSTRACT_CLASS_TYPE_P (current_class_type
))
1573 /* C++14 DR1658 Means we do not have to construct vbases of
1574 abstract classes. */
1575 construct_virtual_base (subobject
, arguments
);
1577 /* When not constructing vbases of abstract classes, at least mark
1578 the arguments expressions as read to avoid
1579 -Wunused-but-set-parameter false positives. */
1580 cp_walk_tree (&arguments
, mark_exp_read_r
, NULL
, NULL
);
1583 pop_deferring_access_checks ();
1585 in_base_initializer
= 0;
1587 /* Initialize the vptrs. */
1588 initialize_vtbl_ptrs (current_class_ptr
);
1590 /* Initialize the data members. */
1593 /* If this initializer was explicitly provided, then the dummy TREE_TYPE
1594 node contains the source location. */
1595 iloc_sentinel
ils (EXPR_LOCATION (TREE_TYPE (mem_inits
)));
1597 perform_member_init (TREE_PURPOSE (mem_inits
),
1598 TREE_VALUE (mem_inits
),
1601 mem_inits
= TREE_CHAIN (mem_inits
);
1605 /* Returns the address of the vtable (i.e., the value that should be
1606 assigned to the vptr) for BINFO. */
1609 build_vtbl_address (tree binfo
)
1611 tree binfo_for
= binfo
;
1614 if (BINFO_VPTR_INDEX (binfo
) && BINFO_VIRTUAL_P (binfo
))
1615 /* If this is a virtual primary base, then the vtable we want to store
1616 is that for the base this is being used as the primary base of. We
1617 can't simply skip the initialization, because we may be expanding the
1618 inits of a subobject constructor where the virtual base layout
1619 can be different. */
1620 while (BINFO_PRIMARY_P (binfo_for
))
1621 binfo_for
= BINFO_INHERITANCE_CHAIN (binfo_for
);
1623 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1625 vtbl
= get_vtbl_decl_for_binfo (binfo_for
);
1626 TREE_USED (vtbl
) = true;
1628 /* Now compute the address to use when initializing the vptr. */
1629 vtbl
= unshare_expr (BINFO_VTABLE (binfo_for
));
1631 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
1636 /* This code sets up the virtual function tables appropriate for
1637 the pointer DECL. It is a one-ply initialization.
1639 BINFO is the exact type that DECL is supposed to be. In
1640 multiple inheritance, this might mean "C's A" if C : A, B. */
1643 expand_virtual_init (tree binfo
, tree decl
)
1645 tree vtbl
, vtbl_ptr
;
1648 /* Compute the initializer for vptr. */
1649 vtbl
= build_vtbl_address (binfo
);
1651 /* We may get this vptr from a VTT, if this is a subobject
1652 constructor or subobject destructor. */
1653 vtt_index
= BINFO_VPTR_INDEX (binfo
);
1659 /* Compute the value to use, when there's a VTT. */
1660 vtt_parm
= current_vtt_parm
;
1661 vtbl2
= fold_build_pointer_plus (vtt_parm
, vtt_index
);
1662 vtbl2
= cp_build_fold_indirect_ref (vtbl2
);
1663 vtbl2
= convert (TREE_TYPE (vtbl
), vtbl2
);
1665 /* The actual initializer is the VTT value only in the subobject
1666 constructor. In maybe_clone_body we'll substitute NULL for
1667 the vtt_parm in the case of the non-subobject constructor. */
1668 vtbl
= build_if_in_charge (vtbl
, vtbl2
);
1671 /* Compute the location of the vtpr. */
1672 vtbl_ptr
= build_vfield_ref (cp_build_fold_indirect_ref (decl
),
1674 gcc_assert (vtbl_ptr
!= error_mark_node
);
1676 /* Assign the vtable to the vptr. */
1677 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0, tf_warning_or_error
);
1678 finish_expr_stmt (cp_build_modify_expr (input_location
, vtbl_ptr
, NOP_EXPR
,
1679 vtbl
, tf_warning_or_error
));
1682 /* If an exception is thrown in a constructor, those base classes already
1683 constructed must be destroyed. This function creates the cleanup
1684 for BINFO, which has just been constructed. If FLAG is non-NULL,
1685 it is a DECL which is nonzero when this base needs to be
1689 expand_cleanup_for_base (tree binfo
, tree flag
)
1693 if (!type_build_dtor_call (BINFO_TYPE (binfo
)))
1696 /* Call the destructor. */
1697 expr
= build_special_member_call (current_class_ref
,
1698 base_dtor_identifier
,
1701 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
,
1702 tf_warning_or_error
);
1704 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
1708 expr
= fold_build3_loc (input_location
,
1709 COND_EXPR
, void_type_node
,
1710 c_common_truthvalue_conversion (input_location
, flag
),
1711 expr
, integer_zero_node
);
1713 finish_eh_cleanup (expr
);
1716 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1720 construct_virtual_base (tree vbase
, tree arguments
)
1726 /* If there are virtual base classes with destructors, we need to
1727 emit cleanups to destroy them if an exception is thrown during
1728 the construction process. These exception regions (i.e., the
1729 period during which the cleanups must occur) begin from the time
1730 the construction is complete to the end of the function. If we
1731 create a conditional block in which to initialize the
1732 base-classes, then the cleanup region for the virtual base begins
1733 inside a block, and ends outside of that block. This situation
1734 confuses the sjlj exception-handling code. Therefore, we do not
1735 create a single conditional block, but one for each
1736 initialization. (That way the cleanup regions always begin
1737 in the outer block.) We trust the back end to figure out
1738 that the FLAG will not change across initializations, and
1739 avoid doing multiple tests. */
1740 flag
= DECL_CHAIN (DECL_ARGUMENTS (current_function_decl
));
1741 inner_if_stmt
= begin_if_stmt ();
1742 finish_if_stmt_cond (flag
, inner_if_stmt
);
1744 /* Compute the location of the virtual base. If we're
1745 constructing virtual bases, then we must be the most derived
1746 class. Therefore, we don't have to look up the virtual base;
1747 we already know where it is. */
1748 exp
= convert_to_base_statically (current_class_ref
, vbase
);
1750 expand_aggr_init_1 (vbase
, current_class_ref
, exp
, arguments
,
1751 0, tf_warning_or_error
);
1752 finish_then_clause (inner_if_stmt
);
1753 finish_if_stmt (inner_if_stmt
);
1755 expand_cleanup_for_base (vbase
, flag
);
1758 /* Find the context in which this FIELD can be initialized. */
1761 initializing_context (tree field
)
1763 tree t
= DECL_CONTEXT (field
);
1765 /* Anonymous union members can be initialized in the first enclosing
1766 non-anonymous union context. */
1767 while (t
&& ANON_AGGR_TYPE_P (t
))
1768 t
= TYPE_CONTEXT (t
);
1772 /* Function to give error message if member initialization specification
1773 is erroneous. FIELD is the member we decided to initialize.
1774 TYPE is the type for which the initialization is being performed.
1775 FIELD must be a member of TYPE.
1777 MEMBER_NAME is the name of the member. */
1780 member_init_ok_or_else (tree field
, tree type
, tree member_name
)
1782 if (field
== error_mark_node
)
1786 error ("class %qT does not have any field named %qD", type
,
1792 error ("%q#D is a static data member; it can only be "
1793 "initialized at its definition",
1797 if (TREE_CODE (field
) != FIELD_DECL
)
1799 error ("%q#D is not a non-static data member of %qT",
1803 if (initializing_context (field
) != type
)
1805 error ("class %qT does not have any field named %qD", type
,
1813 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1814 is a _TYPE node or TYPE_DECL which names a base for that type.
1815 Check the validity of NAME, and return either the base _TYPE, base
1816 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1817 NULL_TREE and issue a diagnostic.
1819 An old style unnamed direct single base construction is permitted,
1820 where NAME is NULL. */
1823 expand_member_init (tree name
)
1828 if (!current_class_ref
)
1833 /* This is an obsolete unnamed base class initializer. The
1834 parser will already have warned about its use. */
1835 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type
)))
1838 error ("unnamed initializer for %qT, which has no base classes",
1839 current_class_type
);
1842 basetype
= BINFO_TYPE
1843 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type
), 0));
1846 error ("unnamed initializer for %qT, which uses multiple inheritance",
1847 current_class_type
);
1851 else if (TYPE_P (name
))
1853 basetype
= TYPE_MAIN_VARIANT (name
);
1854 name
= TYPE_NAME (name
);
1856 else if (TREE_CODE (name
) == TYPE_DECL
)
1857 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
1859 basetype
= NULL_TREE
;
1868 if (current_template_parms
1869 || same_type_p (basetype
, current_class_type
))
1872 class_binfo
= TYPE_BINFO (current_class_type
);
1873 direct_binfo
= NULL_TREE
;
1874 virtual_binfo
= NULL_TREE
;
1876 /* Look for a direct base. */
1877 for (i
= 0; BINFO_BASE_ITERATE (class_binfo
, i
, direct_binfo
); ++i
)
1878 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo
), basetype
))
1881 /* Look for a virtual base -- unless the direct base is itself
1883 if (!direct_binfo
|| !BINFO_VIRTUAL_P (direct_binfo
))
1884 virtual_binfo
= binfo_for_vbase (basetype
, current_class_type
);
1886 /* [class.base.init]
1888 If a mem-initializer-id is ambiguous because it designates
1889 both a direct non-virtual base class and an inherited virtual
1890 base class, the mem-initializer is ill-formed. */
1891 if (direct_binfo
&& virtual_binfo
)
1893 error ("%qD is both a direct base and an indirect virtual base",
1898 if (!direct_binfo
&& !virtual_binfo
)
1900 if (CLASSTYPE_VBASECLASSES (current_class_type
))
1901 error ("type %qT is not a direct or virtual base of %qT",
1902 basetype
, current_class_type
);
1904 error ("type %qT is not a direct base of %qT",
1905 basetype
, current_class_type
);
1909 return direct_binfo
? direct_binfo
: virtual_binfo
;
1913 if (identifier_p (name
))
1914 field
= lookup_field (current_class_type
, name
, 1, false);
1918 if (member_init_ok_or_else (field
, current_class_type
, name
))
1925 /* This is like `expand_member_init', only it stores one aggregate
1928 INIT comes in two flavors: it is either a value which
1929 is to be stored in EXP, or it is a parameter list
1930 to go to a constructor, which will operate on EXP.
1931 If INIT is not a parameter list for a constructor, then set
1932 LOOKUP_ONLYCONVERTING.
1933 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1934 the initializer, if FLAGS is 0, then it is the (init) form.
1935 If `init' is a CONSTRUCTOR, then we emit a warning message,
1936 explaining that such initializations are invalid.
1938 If INIT resolves to a CALL_EXPR which happens to return
1939 something of the type we are looking for, then we know
1940 that we can safely use that call to perform the
1943 The virtual function table pointer cannot be set up here, because
1944 we do not really know its type.
1946 This never calls operator=().
1948 When initializing, nothing is CONST.
1950 A default copy constructor may have to be used to perform the
1953 A constructor or a conversion operator may have to be used to
1954 perform the initialization, but not both, as it would be ambiguous. */
1957 build_aggr_init (tree exp
, tree init
, int flags
, tsubst_flags_t complain
)
1962 tree type
= TREE_TYPE (exp
);
1963 int was_const
= TREE_READONLY (exp
);
1964 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1967 if (init
== error_mark_node
)
1968 return error_mark_node
;
1970 location_t init_loc
= (init
1971 ? cp_expr_loc_or_input_loc (init
)
1972 : location_of (exp
));
1974 TREE_READONLY (exp
) = 0;
1975 TREE_THIS_VOLATILE (exp
) = 0;
1977 if (TREE_CODE (type
) == ARRAY_TYPE
)
1979 tree itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1982 if (VAR_P (exp
) && DECL_DECOMPOSITION_P (exp
))
1985 init
= mark_rvalue_use (init
);
1987 && DECL_P (tree_strip_any_location_wrapper (init
))
1988 && !(flags
& LOOKUP_ONLYCONVERTING
))
1990 /* Wrap the initializer in a CONSTRUCTOR so that build_vec_init
1991 recognizes it as direct-initialization. */
1992 init
= build_constructor_single (init_list_type_node
,
1994 CONSTRUCTOR_IS_DIRECT_INIT (init
) = true;
1999 /* Must arrange to initialize each element of EXP
2000 from elements of INIT. */
2001 if (cv_qualified_p (type
))
2002 TREE_TYPE (exp
) = cv_unqualified (type
);
2003 if (itype
&& cv_qualified_p (itype
))
2004 TREE_TYPE (init
) = cv_unqualified (itype
);
2005 from_array
= (itype
&& same_type_p (TREE_TYPE (init
),
2008 if (init
&& !BRACE_ENCLOSED_INITIALIZER_P (init
)
2010 || (TREE_CODE (init
) != CONSTRUCTOR
2011 /* Can happen, eg, handling the compound-literals
2012 extension (ext/complit12.C). */
2013 && TREE_CODE (init
) != TARGET_EXPR
)))
2015 if (complain
& tf_error
)
2016 error_at (init_loc
, "array must be initialized "
2017 "with a brace-enclosed initializer");
2018 return error_mark_node
;
2022 stmt_expr
= build_vec_init (exp
, NULL_TREE
, init
,
2023 /*explicit_value_init_p=*/false,
2026 TREE_READONLY (exp
) = was_const
;
2027 TREE_THIS_VOLATILE (exp
) = was_volatile
;
2028 TREE_TYPE (exp
) = type
;
2029 /* Restore the type of init unless it was used directly. */
2030 if (init
&& TREE_CODE (stmt_expr
) != INIT_EXPR
)
2031 TREE_TYPE (init
) = itype
;
2035 if (is_copy_initialization (init
))
2036 flags
|= LOOKUP_ONLYCONVERTING
;
2038 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
2039 destroy_temps
= stmts_are_full_exprs_p ();
2040 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2041 bool ok
= expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
2042 init
, LOOKUP_NORMAL
|flags
, complain
);
2043 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
2044 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
2045 TREE_READONLY (exp
) = was_const
;
2046 TREE_THIS_VOLATILE (exp
) = was_volatile
;
2048 return error_mark_node
;
2050 if ((VAR_P (exp
) || TREE_CODE (exp
) == PARM_DECL
)
2051 && TREE_SIDE_EFFECTS (stmt_expr
)
2052 && !lookup_attribute ("warn_unused", TYPE_ATTRIBUTES (type
)))
2053 /* Just know that we've seen something for this node. */
2054 TREE_USED (exp
) = 1;
2060 expand_default_init (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
,
2061 tsubst_flags_t complain
)
2063 tree type
= TREE_TYPE (exp
);
2065 /* It fails because there may not be a constructor which takes
2066 its own type as the first (or only parameter), but which does
2067 take other types via a conversion. So, if the thing initializing
2068 the expression is a unit element of type X, first try X(X&),
2069 followed by initialization by X. If neither of these work
2070 out, then look hard. */
2072 vec
<tree
, va_gc
> *parms
;
2074 /* If we have direct-initialization from an initializer list, pull
2075 it out of the TREE_LIST so the code below can see it. */
2076 if (init
&& TREE_CODE (init
) == TREE_LIST
2077 && DIRECT_LIST_INIT_P (TREE_VALUE (init
)))
2079 gcc_checking_assert ((flags
& LOOKUP_ONLYCONVERTING
) == 0
2080 && TREE_CHAIN (init
) == NULL_TREE
);
2081 init
= TREE_VALUE (init
);
2082 /* Only call reshape_init if it has not been called earlier
2084 if (BRACE_ENCLOSED_INITIALIZER_P (init
) && CP_AGGREGATE_TYPE_P (type
))
2085 init
= reshape_init (type
, init
, complain
);
2088 if (init
&& BRACE_ENCLOSED_INITIALIZER_P (init
)
2089 && CP_AGGREGATE_TYPE_P (type
))
2090 /* A brace-enclosed initializer for an aggregate. In C++0x this can
2091 happen for direct-initialization, too. */
2092 init
= digest_init (type
, init
, complain
);
2094 if (init
== error_mark_node
)
2097 /* A CONSTRUCTOR of the target's type is a previously digested
2098 initializer, whether that happened just above or in
2099 cp_parser_late_parsing_nsdmi.
2101 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
2102 set represents the whole initialization, so we shouldn't build up
2103 another ctor call. */
2105 && (TREE_CODE (init
) == CONSTRUCTOR
2106 || (TREE_CODE (init
) == TARGET_EXPR
2107 && (TARGET_EXPR_DIRECT_INIT_P (init
)
2108 || TARGET_EXPR_LIST_INIT_P (init
))))
2109 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (init
), type
))
2111 /* Early initialization via a TARGET_EXPR only works for
2112 complete objects. */
2113 gcc_assert (TREE_CODE (init
) == CONSTRUCTOR
|| true_exp
== exp
);
2115 init
= cp_build_init_expr (exp
, init
);
2116 TREE_SIDE_EFFECTS (init
) = 1;
2117 finish_expr_stmt (init
);
2121 if (init
&& TREE_CODE (init
) != TREE_LIST
2122 && (flags
& LOOKUP_ONLYCONVERTING
)
2123 && !unsafe_return_slot_p (exp
))
2125 /* Base subobjects should only get direct-initialization. */
2126 gcc_assert (true_exp
== exp
);
2128 if (flags
& DIRECT_BIND
)
2129 /* Do nothing. We hit this in two cases: Reference initialization,
2130 where we aren't initializing a real variable, so we don't want
2131 to run a new constructor; and catching an exception, where we
2132 have already built up the constructor call so we could wrap it
2133 in an exception region. */;
2136 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
,
2137 flags
, complain
| tf_no_cleanup
);
2138 if (init
== error_mark_node
)
2142 /* We need to protect the initialization of a catch parm with a
2143 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
2144 around the TARGET_EXPR for the copy constructor. See
2145 initialize_handler_parm. */
2147 while (TREE_CODE (*p
) == MUST_NOT_THROW_EXPR
2148 || TREE_CODE (*p
) == CLEANUP_POINT_EXPR
)
2150 /* Avoid voidify_wrapper_expr making a temporary. */
2151 TREE_TYPE (*p
) = void_type_node
;
2152 p
= &TREE_OPERAND (*p
, 0);
2154 *p
= cp_build_init_expr (exp
, *p
);
2155 finish_expr_stmt (init
);
2159 if (init
== NULL_TREE
)
2161 else if (TREE_CODE (init
) == TREE_LIST
&& !TREE_TYPE (init
))
2163 parms
= make_tree_vector ();
2164 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
2165 vec_safe_push (parms
, TREE_VALUE (init
));
2168 parms
= make_tree_vector_single (init
);
2170 if (exp
== current_class_ref
&& current_function_decl
2171 && DECL_HAS_IN_CHARGE_PARM_P (current_function_decl
))
2173 /* Delegating constructor. */
2176 tree elt
; unsigned i
;
2178 /* Unshare the arguments for the second call. */
2179 releasing_vec parms2
;
2180 FOR_EACH_VEC_SAFE_ELT (parms
, i
, elt
)
2182 elt
= break_out_target_exprs (elt
);
2183 vec_safe_push (parms2
, elt
);
2185 complete
= build_special_member_call (exp
, complete_ctor_identifier
,
2186 &parms2
, binfo
, flags
,
2188 complete
= fold_build_cleanup_point_expr (void_type_node
, complete
);
2190 base
= build_special_member_call (exp
, base_ctor_identifier
,
2191 &parms
, binfo
, flags
,
2193 base
= fold_build_cleanup_point_expr (void_type_node
, base
);
2194 if (complete
== error_mark_node
|| base
== error_mark_node
)
2196 rval
= build_if_in_charge (complete
, base
);
2200 tree ctor_name
= (true_exp
== exp
2201 ? complete_ctor_identifier
: base_ctor_identifier
);
2203 rval
= build_special_member_call (exp
, ctor_name
, &parms
, binfo
, flags
,
2205 if (rval
== error_mark_node
)
2210 release_tree_vector (parms
);
2212 if (exp
== true_exp
&& TREE_CODE (rval
) == CALL_EXPR
)
2214 tree fn
= get_callee_fndecl (rval
);
2215 if (fn
&& DECL_DECLARED_CONSTEXPR_P (fn
))
2217 tree e
= maybe_constant_init (rval
, exp
);
2218 if (TREE_CONSTANT (e
))
2219 rval
= cp_build_init_expr (exp
, e
);
2223 /* FIXME put back convert_to_void? */
2224 if (TREE_SIDE_EFFECTS (rval
))
2225 finish_expr_stmt (rval
);
2230 /* This function is responsible for initializing EXP with INIT
2231 (if any). Returns true on success, false on failure.
2233 BINFO is the binfo of the type for who we are performing the
2234 initialization. For example, if W is a virtual base class of A and B,
2236 If we are initializing B, then W must contain B's W vtable, whereas
2237 were we initializing C, W must contain C's W vtable.
2239 TRUE_EXP is nonzero if it is the true expression being initialized.
2240 In this case, it may be EXP, or may just contain EXP. The reason we
2241 need this is because if EXP is a base element of TRUE_EXP, we
2242 don't necessarily know by looking at EXP where its virtual
2243 baseclass fields should really be pointing. But we do know
2244 from TRUE_EXP. In constructors, we don't know anything about
2245 the value being initialized.
2247 FLAGS is just passed to `build_new_method_call'. See that function
2248 for its description. */
2251 expand_aggr_init_1 (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
,
2252 tsubst_flags_t complain
)
2254 tree type
= TREE_TYPE (exp
);
2256 gcc_assert (init
!= error_mark_node
&& type
!= error_mark_node
);
2257 gcc_assert (building_stmt_list_p ());
2259 /* Use a function returning the desired type to initialize EXP for us.
2260 If the function is a constructor, and its first argument is
2261 NULL_TREE, know that it was meant for us--just slide exp on
2262 in and expand the constructor. Constructors now come
2265 if (init
&& VAR_P (exp
)
2266 && COMPOUND_LITERAL_P (init
))
2268 vec
<tree
, va_gc
> *cleanups
= NULL
;
2269 /* If store_init_value returns NULL_TREE, the INIT has been
2270 recorded as the DECL_INITIAL for EXP. That means there's
2271 nothing more we have to do. */
2272 init
= store_init_value (exp
, init
, &cleanups
, flags
);
2274 finish_expr_stmt (init
);
2275 gcc_assert (!cleanups
);
2279 /* List-initialization from {} becomes value-initialization for non-aggregate
2280 classes with default constructors. Handle this here when we're
2281 initializing a base, so protected access works. */
2282 if (exp
!= true_exp
&& init
&& TREE_CODE (init
) == TREE_LIST
)
2284 tree elt
= TREE_VALUE (init
);
2285 if (DIRECT_LIST_INIT_P (elt
)
2286 && CONSTRUCTOR_ELTS (elt
) == 0
2287 && CLASSTYPE_NON_AGGREGATE (type
)
2288 && TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2289 init
= void_type_node
;
2292 /* If an explicit -- but empty -- initializer list was present,
2293 that's value-initialization. */
2294 if (init
== void_type_node
)
2296 /* If the type has data but no user-provided default ctor, we need to zero
2298 if (type_has_non_user_provided_default_constructor (type
)
2299 && !is_really_empty_class (type
, /*ignore_vptr*/true))
2301 tree field_size
= NULL_TREE
;
2302 if (exp
!= true_exp
&& CLASSTYPE_AS_BASE (type
) != type
)
2303 /* Don't clobber already initialized virtual bases. */
2304 field_size
= TYPE_SIZE (CLASSTYPE_AS_BASE (type
));
2305 init
= build_zero_init_1 (type
, NULL_TREE
, /*static_storage_p=*/false,
2307 init
= cp_build_init_expr (exp
, init
);
2308 finish_expr_stmt (init
);
2311 /* If we don't need to mess with the constructor at all,
2313 if (! type_build_ctor_call (type
))
2316 /* Otherwise fall through and call the constructor. */
2320 /* We know that expand_default_init can handle everything we want
2322 return expand_default_init (binfo
, true_exp
, exp
, init
, flags
, complain
);
2325 /* Report an error if TYPE is not a user-defined, class type. If
2326 OR_ELSE is nonzero, give an error message. */
2329 is_class_type (tree type
, int or_else
)
2331 if (type
== error_mark_node
)
2334 if (! CLASS_TYPE_P (type
))
2337 error ("%qT is not a class type", type
);
2343 /* Returns true iff the initializer INIT represents copy-initialization
2344 (and therefore we must set LOOKUP_ONLYCONVERTING when processing it). */
2347 is_copy_initialization (tree init
)
2349 return (init
&& init
!= void_type_node
2350 && TREE_CODE (init
) != TREE_LIST
2351 && !(TREE_CODE (init
) == TARGET_EXPR
2352 && TARGET_EXPR_DIRECT_INIT_P (init
))
2353 && !DIRECT_LIST_INIT_P (init
));
2356 /* Build a reference to a member of an aggregate. This is not a C++
2357 `&', but really something which can have its address taken, and
2358 then act as a pointer to member, for example TYPE :: FIELD can have
2359 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
2360 this expression is the operand of "&".
2362 @@ Prints out lousy diagnostics for operator <typename>
2365 @@ This function should be rewritten and placed in search.cc. */
2368 build_offset_ref (tree type
, tree member
, bool address_p
,
2369 tsubst_flags_t complain
)
2372 tree basebinfo
= NULL_TREE
;
2374 /* class templates can come in as TEMPLATE_DECLs here. */
2375 if (TREE_CODE (member
) == TEMPLATE_DECL
)
2378 if (dependent_scope_p (type
) || type_dependent_expression_p (member
))
2379 return build_qualified_name (NULL_TREE
, type
, member
,
2380 /*template_p=*/false);
2382 gcc_assert (TYPE_P (type
));
2383 if (! is_class_type (type
, 1))
2384 return error_mark_node
;
2386 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2387 /* Callers should call mark_used before this point, except for functions. */
2388 gcc_assert (!DECL_P (member
) || TREE_USED (member
)
2389 || TREE_CODE (member
) == FUNCTION_DECL
);
2391 type
= TYPE_MAIN_VARIANT (type
);
2392 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type
)))
2394 if (complain
& tf_error
)
2395 error ("incomplete type %qT does not have member %qD", type
, member
);
2396 return error_mark_node
;
2399 /* Entities other than non-static members need no further
2401 if (TREE_CODE (member
) == TYPE_DECL
)
2403 if (VAR_P (member
) || TREE_CODE (member
) == CONST_DECL
)
2404 return convert_from_reference (member
);
2406 if (TREE_CODE (member
) == FIELD_DECL
&& DECL_C_BIT_FIELD (member
))
2408 if (complain
& tf_error
)
2409 error ("invalid pointer to bit-field %qD", member
);
2410 return error_mark_node
;
2413 /* Set up BASEBINFO for member lookup. */
2414 decl
= maybe_dummy_object (type
, &basebinfo
);
2416 /* A lot of this logic is now handled in lookup_member. */
2417 if (BASELINK_P (member
))
2419 /* Go from the TREE_BASELINK to the member function info. */
2420 tree t
= BASELINK_FUNCTIONS (member
);
2422 if (TREE_CODE (t
) != TEMPLATE_ID_EXPR
&& !really_overloaded_fn (t
))
2424 /* Get rid of a potential OVERLOAD around it. */
2427 /* Unique functions are handled easily. */
2429 /* For non-static member of base class, we need a special rule
2430 for access checking [class.protected]:
2432 If the access is to form a pointer to member, the
2433 nested-name-specifier shall name the derived class
2434 (or any class derived from that class). */
2436 if (address_p
&& DECL_P (t
)
2437 && DECL_NONSTATIC_MEMBER_P (t
))
2438 ok
= perform_or_defer_access_check (TYPE_BINFO (type
), t
, t
,
2441 ok
= perform_or_defer_access_check (basebinfo
, t
, t
,
2444 return error_mark_node
;
2445 if (DECL_STATIC_FUNCTION_P (t
))
2450 TREE_TYPE (member
) = unknown_type_node
;
2452 else if (address_p
&& TREE_CODE (member
) == FIELD_DECL
)
2454 /* We need additional test besides the one in
2455 check_accessibility_of_qualified_id in case it is
2456 a pointer to non-static member. */
2457 if (!perform_or_defer_access_check (TYPE_BINFO (type
), member
, member
,
2459 return error_mark_node
;
2464 /* If MEMBER is non-static, then the program has fallen afoul of
2467 An id-expression that denotes a non-static data member or
2468 non-static member function of a class can only be used:
2470 -- as part of a class member access (_expr.ref_) in which the
2471 object-expression refers to the member's class or a class
2472 derived from that class, or
2474 -- to form a pointer to member (_expr.unary.op_), or
2476 -- in the body of a non-static member function of that class or
2477 of a class derived from that class (_class.mfct.non-static_), or
2479 -- in a mem-initializer for a constructor for that class or for
2480 a class derived from that class (_class.base.init_). */
2481 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member
))
2483 /* Build a representation of the qualified name suitable
2484 for use as the operand to "&" -- even though the "&" is
2485 not actually present. */
2486 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
2487 /* In Microsoft mode, treat a non-static member function as if
2488 it were a pointer-to-member. */
2489 if (flag_ms_extensions
)
2491 PTRMEM_OK_P (member
) = 1;
2492 return cp_build_addr_expr (member
, complain
);
2494 if (complain
& tf_error
)
2495 error ("invalid use of non-static member function %qD",
2496 TREE_OPERAND (member
, 1));
2497 return error_mark_node
;
2499 else if (TREE_CODE (member
) == FIELD_DECL
)
2501 if (complain
& tf_error
)
2502 error ("invalid use of non-static data member %qD", member
);
2503 return error_mark_node
;
2508 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
2509 PTRMEM_OK_P (member
) = 1;
2513 /* If DECL is a scalar enumeration constant or variable with a
2514 constant initializer, return the initializer (or, its initializers,
2515 recursively); otherwise, return DECL. If STRICT_P, the
2516 initializer is only returned if DECL is a
2517 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2518 return an aggregate constant. If UNSHARE_P, return an unshared
2519 copy of the initializer. */
2522 constant_value_1 (tree decl
, bool strict_p
, bool return_aggregate_cst_ok_p
,
2525 while (TREE_CODE (decl
) == CONST_DECL
2526 || decl_constant_var_p (decl
)
2527 || (!strict_p
&& VAR_P (decl
)
2528 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl
))))
2531 /* If DECL is a static data member in a template
2532 specialization, we must instantiate it here. The
2533 initializer for the static data member is not processed
2534 until needed; we need it now. */
2535 mark_used (decl
, tf_none
);
2536 init
= DECL_INITIAL (decl
);
2537 if (init
== error_mark_node
)
2539 if (TREE_CODE (decl
) == CONST_DECL
2540 || DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
))
2541 /* Treat the error as a constant to avoid cascading errors on
2542 excessively recursive template instantiation (c++/9335). */
2547 /* Initializers in templates are generally expanded during
2548 instantiation, so before that for const int i(2)
2549 INIT is a TREE_LIST with the actual initializer as
2551 if (processing_template_decl
2553 && TREE_CODE (init
) == TREE_LIST
2554 && TREE_CHAIN (init
) == NULL_TREE
)
2555 init
= TREE_VALUE (init
);
2556 /* Instantiate a non-dependent initializer for user variables. We
2557 mustn't do this for the temporary for an array compound literal;
2558 trying to instatiate the initializer will keep creating new
2559 temporaries until we crash. Probably it's not useful to do it for
2560 other artificial variables, either. */
2561 if (!DECL_ARTIFICIAL (decl
))
2562 init
= instantiate_non_dependent_or_null (init
);
2564 || !TREE_TYPE (init
)
2565 || !TREE_CONSTANT (init
)
2566 || (!return_aggregate_cst_ok_p
2567 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2568 return an aggregate constant (of which string
2569 literals are a special case), as we do not want
2570 to make inadvertent copies of such entities, and
2571 we must be sure that their addresses are the
2573 && (TREE_CODE (init
) == CONSTRUCTOR
2574 || TREE_CODE (init
) == STRING_CST
)))
2576 /* Don't return a CONSTRUCTOR for a variable with partial run-time
2577 initialization, since it doesn't represent the entire value.
2578 Similarly for VECTOR_CSTs created by cp_folding those
2580 if ((TREE_CODE (init
) == CONSTRUCTOR
2581 || TREE_CODE (init
) == VECTOR_CST
)
2582 && !DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
))
2584 /* If the variable has a dynamic initializer, don't use its
2585 DECL_INITIAL which doesn't reflect the real value. */
2587 && TREE_STATIC (decl
)
2588 && !DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
)
2589 && DECL_NONTRIVIALLY_INITIALIZED_P (decl
))
2593 return unshare_p
? unshare_expr (decl
) : decl
;
2596 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2597 of integral or enumeration type, or a constexpr variable of scalar type,
2598 then return that value. These are those variables permitted in constant
2599 expressions by [5.19/1]. */
2602 scalar_constant_value (tree decl
)
2604 return constant_value_1 (decl
, /*strict_p=*/true,
2605 /*return_aggregate_cst_ok_p=*/false,
2606 /*unshare_p=*/true);
2609 /* Like scalar_constant_value, but can also return aggregate initializers.
2610 If UNSHARE_P, return an unshared copy of the initializer. */
2613 decl_really_constant_value (tree decl
, bool unshare_p
/*= true*/)
2615 return constant_value_1 (decl
, /*strict_p=*/true,
2616 /*return_aggregate_cst_ok_p=*/true,
2617 /*unshare_p=*/unshare_p
);
2620 /* A more relaxed version of decl_really_constant_value, used by the
2621 common C/C++ code. */
2624 decl_constant_value (tree decl
, bool unshare_p
)
2626 return constant_value_1 (decl
, /*strict_p=*/processing_template_decl
,
2627 /*return_aggregate_cst_ok_p=*/true,
2628 /*unshare_p=*/unshare_p
);
2632 decl_constant_value (tree decl
)
2634 return decl_constant_value (decl
, /*unshare_p=*/true);
2637 /* Common subroutines of build_new and build_vec_delete. */
2639 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2640 the type of the object being allocated; otherwise, it's just TYPE.
2641 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2642 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2643 a vector of arguments to be provided as arguments to a placement
2644 new operator. This routine performs no semantic checks; it just
2645 creates and returns a NEW_EXPR. */
2648 build_raw_new_expr (location_t loc
, vec
<tree
, va_gc
> *placement
, tree type
,
2649 tree nelts
, vec
<tree
, va_gc
> *init
, int use_global_new
)
2654 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2655 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2656 permits us to distinguish the case of a missing initializer "new
2657 int" from an empty initializer "new int()". */
2659 init_list
= NULL_TREE
;
2660 else if (init
->is_empty ())
2661 init_list
= void_node
;
2663 init_list
= build_tree_list_vec (init
);
2665 new_expr
= build4_loc (loc
, NEW_EXPR
, build_pointer_type (type
),
2666 build_tree_list_vec (placement
), type
, nelts
,
2668 NEW_EXPR_USE_GLOBAL (new_expr
) = use_global_new
;
2669 TREE_SIDE_EFFECTS (new_expr
) = 1;
2674 /* Diagnose uninitialized const members or reference members of type
2675 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2676 new expression without a new-initializer and a declaration. Returns
2680 diagnose_uninitialized_cst_or_ref_member_1 (tree type
, tree origin
,
2681 bool using_new
, bool complain
)
2684 int error_count
= 0;
2686 if (type_has_user_provided_constructor (type
))
2689 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2693 if (TREE_CODE (field
) != FIELD_DECL
)
2696 field_type
= strip_array_types (TREE_TYPE (field
));
2698 if (type_has_user_provided_constructor (field_type
))
2701 if (TYPE_REF_P (field_type
))
2706 if (DECL_CONTEXT (field
) == origin
)
2709 error ("uninitialized reference member in %q#T "
2710 "using %<new%> without new-initializer", origin
);
2712 error ("uninitialized reference member in %q#T", origin
);
2717 error ("uninitialized reference member in base %q#T "
2718 "of %q#T using %<new%> without new-initializer",
2719 DECL_CONTEXT (field
), origin
);
2721 error ("uninitialized reference member in base %q#T "
2722 "of %q#T", DECL_CONTEXT (field
), origin
);
2724 inform (DECL_SOURCE_LOCATION (field
),
2725 "%q#D should be initialized", field
);
2729 if (CP_TYPE_CONST_P (field_type
))
2734 if (DECL_CONTEXT (field
) == origin
)
2737 error ("uninitialized const member in %q#T "
2738 "using %<new%> without new-initializer", origin
);
2740 error ("uninitialized const member in %q#T", origin
);
2745 error ("uninitialized const member in base %q#T "
2746 "of %q#T using %<new%> without new-initializer",
2747 DECL_CONTEXT (field
), origin
);
2749 error ("uninitialized const member in base %q#T "
2750 "of %q#T", DECL_CONTEXT (field
), origin
);
2752 inform (DECL_SOURCE_LOCATION (field
),
2753 "%q#D should be initialized", field
);
2757 if (CLASS_TYPE_P (field_type
))
2759 += diagnose_uninitialized_cst_or_ref_member_1 (field_type
, origin
,
2760 using_new
, complain
);
2766 diagnose_uninitialized_cst_or_ref_member (tree type
, bool using_new
, bool complain
)
2768 return diagnose_uninitialized_cst_or_ref_member_1 (type
, type
, using_new
, complain
);
2771 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2772 overflowed. Pretend it returns sizetype so that it plays nicely in the
2776 throw_bad_array_new_length (void)
2780 tree name
= get_identifier ("__cxa_throw_bad_array_new_length");
2782 fn
= get_global_binding (name
);
2784 fn
= push_throw_library_fn
2785 (name
, build_function_type_list (sizetype
, NULL_TREE
));
2788 return build_cxx_call (fn
, 0, NULL
, tf_warning_or_error
);
2791 /* Attempt to verify that the argument, OPER, of a placement new expression
2792 refers to an object sufficiently large for an object of TYPE or an array
2793 of NELTS of such objects when NELTS is non-null, and issue a warning when
2794 it does not. SIZE specifies the size needed to construct the object or
2795 array and captures the result of NELTS * sizeof (TYPE). (SIZE could be
2796 greater when the array under construction requires a cookie to store
2797 NELTS. GCC's placement new expression stores the cookie when invoking
2798 a user-defined placement new operator function but not the default one.
2799 Placement new expressions with user-defined placement new operator are
2800 not diagnosed since we don't know how they use the buffer (this could
2801 be a future extension). */
2803 warn_placement_new_too_small (tree type
, tree nelts
, tree size
, tree oper
)
2805 location_t loc
= cp_expr_loc_or_input_loc (oper
);
2809 /* Using a function argument or a (non-array) variable as an argument
2810 to placement new is not checked since it's unknown what it might
2812 if (TREE_CODE (oper
) == PARM_DECL
2814 || TREE_CODE (oper
) == COMPONENT_REF
)
2817 /* Evaluate any constant expressions. */
2818 size
= fold_non_dependent_expr (size
);
2821 ref
.eval
= [](tree x
){ return fold_non_dependent_expr (x
); };
2822 ref
.trail1special
= warn_placement_new
< 2;
2823 tree objsize
= compute_objsize (oper
, 1, &ref
);
2827 /* We can only draw conclusions if ref.deref == -1,
2828 i.e. oper is the address of the object. */
2829 if (ref
.deref
!= -1)
2832 offset_int bytes_avail
= wi::to_offset (objsize
);
2833 offset_int bytes_need
;
2835 if (CONSTANT_CLASS_P (size
))
2836 bytes_need
= wi::to_offset (size
);
2837 else if (nelts
&& CONSTANT_CLASS_P (nelts
))
2838 bytes_need
= (wi::to_offset (nelts
)
2839 * wi::to_offset (TYPE_SIZE_UNIT (type
)));
2840 else if (tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
)))
2841 bytes_need
= wi::to_offset (TYPE_SIZE_UNIT (type
));
2844 /* The type is a VLA. */
2848 if (bytes_avail
>= bytes_need
)
2851 /* True when the size to mention in the warning is exact as opposed
2853 const bool exact_size
= (ref
.offrng
[0] == ref
.offrng
[1]
2854 || ref
.sizrng
[1] - ref
.offrng
[0] == 0);
2856 tree opertype
= ref
.ref
? TREE_TYPE (ref
.ref
) : TREE_TYPE (oper
);
2857 bool warned
= false;
2859 nelts
= fold_for_warn (nelts
);
2861 if (CONSTANT_CLASS_P (nelts
))
2862 warned
= warning_at (loc
, OPT_Wplacement_new_
,
2864 ? G_("placement new constructing an object "
2865 "of type %<%T [%wu]%> and size %qwu "
2866 "in a region of type %qT and size %qwi")
2867 : G_("placement new constructing an object "
2868 "of type %<%T [%wu]%> and size %qwu "
2869 "in a region of type %qT and size "
2871 type
, tree_to_uhwi (nelts
),
2872 bytes_need
.to_uhwi (),
2873 opertype
, bytes_avail
.to_uhwi ());
2875 warned
= warning_at (loc
, OPT_Wplacement_new_
,
2877 ? G_("placement new constructing an array "
2878 "of objects of type %qT and size %qwu "
2879 "in a region of type %qT and size %qwi")
2880 : G_("placement new constructing an array "
2881 "of objects of type %qT and size %qwu "
2882 "in a region of type %qT and size "
2884 type
, bytes_need
.to_uhwi (), opertype
,
2885 bytes_avail
.to_uhwi ());
2887 warned
= warning_at (loc
, OPT_Wplacement_new_
,
2889 ? G_("placement new constructing an object "
2890 "of type %qT and size %qwu in a region "
2891 "of type %qT and size %qwi")
2892 : G_("placement new constructing an object "
2894 "and size %qwu in a region of type %qT "
2895 "and size at most %qwu")),
2896 type
, bytes_need
.to_uhwi (), opertype
,
2897 bytes_avail
.to_uhwi ());
2899 if (!warned
|| !ref
.ref
)
2902 if (ref
.offrng
[0] == 0 || !ref
.offset_bounded ())
2903 /* Avoid mentioning the offset when its lower bound is zero
2904 or when it's impossibly large. */
2905 inform (DECL_SOURCE_LOCATION (ref
.ref
),
2906 "%qD declared here", ref
.ref
);
2907 else if (ref
.offrng
[0] == ref
.offrng
[1])
2908 inform (DECL_SOURCE_LOCATION (ref
.ref
),
2909 "at offset %wi from %qD declared here",
2910 ref
.offrng
[0].to_shwi (), ref
.ref
);
2912 inform (DECL_SOURCE_LOCATION (ref
.ref
),
2913 "at offset [%wi, %wi] from %qD declared here",
2914 ref
.offrng
[0].to_shwi (), ref
.offrng
[1].to_shwi (), ref
.ref
);
2917 /* True if alignof(T) > __STDCPP_DEFAULT_NEW_ALIGNMENT__. */
2920 type_has_new_extended_alignment (tree t
)
2922 return (aligned_new_threshold
2923 && TYPE_ALIGN_UNIT (t
) > (unsigned)aligned_new_threshold
);
2926 /* Return the alignment we expect malloc to guarantee. This should just be
2927 MALLOC_ABI_ALIGNMENT, but that macro defaults to only BITS_PER_WORD for some
2928 reason, so don't let the threshold be smaller than max_align_t_align. */
2933 return MAX (max_align_t_align(), MALLOC_ABI_ALIGNMENT
);
2936 /* Determine whether an allocation function is a namespace-scope
2937 non-replaceable placement new function. See DR 1748. */
2939 std_placement_new_fn_p (tree alloc_fn
)
2941 if (DECL_NAMESPACE_SCOPE_P (alloc_fn
))
2943 tree first_arg
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (alloc_fn
)));
2944 if ((TREE_VALUE (first_arg
) == ptr_type_node
)
2945 && TREE_CHAIN (first_arg
) == void_list_node
)
2951 /* For element type ELT_TYPE, return the appropriate type of the heap object
2952 containing such element(s). COOKIE_SIZE is the size of cookie in bytes.
2954 struct { size_t[COOKIE_SIZE/sizeof(size_t)]; ELT_TYPE[N]; }
2955 where N is nothing (flexible array member) if ITYPE2 is NULL, otherwise
2956 the array has ITYPE2 as its TYPE_DOMAIN. */
2959 build_new_constexpr_heap_type (tree elt_type
, tree cookie_size
, tree itype2
)
2961 gcc_assert (tree_fits_uhwi_p (cookie_size
));
2962 unsigned HOST_WIDE_INT csz
= tree_to_uhwi (cookie_size
);
2963 csz
/= int_size_in_bytes (sizetype
);
2964 tree itype1
= build_index_type (size_int (csz
- 1));
2965 tree atype1
= build_cplus_array_type (sizetype
, itype1
);
2966 tree atype2
= build_cplus_array_type (elt_type
, itype2
);
2967 tree rtype
= cxx_make_type (RECORD_TYPE
);
2968 TYPE_NAME (rtype
) = heap_identifier
;
2969 tree fld1
= build_decl (UNKNOWN_LOCATION
, FIELD_DECL
, NULL_TREE
, atype1
);
2970 tree fld2
= build_decl (UNKNOWN_LOCATION
, FIELD_DECL
, NULL_TREE
, atype2
);
2971 DECL_FIELD_CONTEXT (fld1
) = rtype
;
2972 DECL_FIELD_CONTEXT (fld2
) = rtype
;
2973 DECL_ARTIFICIAL (fld1
) = true;
2974 DECL_ARTIFICIAL (fld2
) = true;
2975 TYPE_FIELDS (rtype
) = fld1
;
2976 DECL_CHAIN (fld1
) = fld2
;
2977 layout_type (rtype
);
2981 /* Help the constexpr code to find the right type for the heap variable
2982 by adding a NOP_EXPR around ALLOC_CALL if needed for cookie_size.
2983 Return ALLOC_CALL or ALLOC_CALL cast to a pointer to
2984 struct { size_t[cookie_size/sizeof(size_t)]; elt_type[]; }. */
2987 maybe_wrap_new_for_constexpr (tree alloc_call
, tree elt_type
, tree cookie_size
)
2989 if (cxx_dialect
< cxx20
)
2992 if (current_function_decl
!= NULL_TREE
2993 && !DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
2996 tree call_expr
= extract_call_expr (alloc_call
);
2997 if (call_expr
== error_mark_node
)
3000 tree alloc_call_fndecl
= cp_get_callee_fndecl_nofold (call_expr
);
3001 if (alloc_call_fndecl
== NULL_TREE
3002 || !IDENTIFIER_NEW_OP_P (DECL_NAME (alloc_call_fndecl
))
3003 || CP_DECL_CONTEXT (alloc_call_fndecl
) != global_namespace
)
3006 tree rtype
= build_new_constexpr_heap_type (elt_type
, cookie_size
,
3008 return build_nop (build_pointer_type (rtype
), alloc_call
);
3011 /* Generate code for a new-expression, including calling the "operator
3012 new" function, initializing the object, and, if an exception occurs
3013 during construction, cleaning up. The arguments are as for
3014 build_raw_new_expr. This may change PLACEMENT and INIT.
3015 TYPE is the type of the object being constructed, possibly an array
3016 of NELTS elements when NELTS is non-null (in "new T[NELTS]", T may
3017 be an array of the form U[inner], with the whole expression being
3018 "new U[NELTS][inner]"). */
3021 build_new_1 (vec
<tree
, va_gc
> **placement
, tree type
, tree nelts
,
3022 vec
<tree
, va_gc
> **init
, bool globally_qualified_p
,
3023 tsubst_flags_t complain
)
3026 /* True iff this is a call to "operator new[]" instead of just
3028 bool array_p
= false;
3029 /* If ARRAY_P is true, the element type of the array. This is never
3030 an ARRAY_TYPE; for something like "new int[3][4]", the
3031 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
3034 /* The type of the new-expression. (This type is always a pointer
3037 tree non_const_pointer_type
;
3038 /* The most significant array bound in int[OUTER_NELTS][inner]. */
3039 tree outer_nelts
= NULL_TREE
;
3040 /* For arrays with a non-constant number of elements, a bounds checks
3041 on the NELTS parameter to avoid integer overflow at runtime. */
3042 tree outer_nelts_check
= NULL_TREE
;
3043 bool outer_nelts_from_type
= false;
3044 /* Number of the "inner" elements in "new T[OUTER_NELTS][inner]". */
3045 offset_int inner_nelts_count
= 1;
3046 tree alloc_call
, alloc_expr
;
3047 /* Size of the inner array elements (those with constant dimensions). */
3048 offset_int inner_size
;
3049 /* The address returned by the call to "operator new". This node is
3050 a VAR_DECL and is therefore reusable. */
3053 tree cookie_expr
, init_expr
;
3054 int nothrow
, check_new
;
3055 /* If non-NULL, the number of extra bytes to allocate at the
3056 beginning of the storage allocated for an array-new expression in
3057 order to store the number of elements. */
3058 tree cookie_size
= NULL_TREE
;
3059 tree placement_first
;
3060 tree placement_expr
= NULL_TREE
;
3061 /* True if the function we are calling is a placement allocation
3063 bool placement_allocation_fn_p
;
3064 /* True if the storage must be initialized, either by a constructor
3065 or due to an explicit new-initializer. */
3066 bool is_initialized
;
3067 /* The address of the thing allocated, not including any cookie. In
3068 particular, if an array cookie is in use, DATA_ADDR is the
3069 address of the first array element. This node is a VAR_DECL, and
3070 is therefore reusable. */
3072 tree orig_type
= type
;
3076 outer_nelts
= nelts
;
3079 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3081 /* Transforms new (T[N]) to new T[N]. The former is a GNU
3082 extension for variable N. (This also covers new T where T is
3085 nelts
= array_type_nelts_top (type
);
3086 outer_nelts
= nelts
;
3087 type
= TREE_TYPE (type
);
3088 outer_nelts_from_type
= true;
3091 /* Lots of logic below depends on whether we have a constant number of
3092 elements, so go ahead and fold it now. */
3093 const_tree cst_outer_nelts
= fold_non_dependent_expr (outer_nelts
, complain
);
3095 /* If our base type is an array, then make sure we know how many elements
3097 for (elt_type
= type
;
3098 TREE_CODE (elt_type
) == ARRAY_TYPE
;
3099 elt_type
= TREE_TYPE (elt_type
))
3101 tree inner_nelts
= array_type_nelts_top (elt_type
);
3102 tree inner_nelts_cst
= maybe_constant_value (inner_nelts
);
3103 if (TREE_CODE (inner_nelts_cst
) == INTEGER_CST
)
3105 wi::overflow_type overflow
;
3106 offset_int result
= wi::mul (wi::to_offset (inner_nelts_cst
),
3107 inner_nelts_count
, SIGNED
, &overflow
);
3110 if (complain
& tf_error
)
3111 error ("integer overflow in array size");
3112 nelts
= error_mark_node
;
3114 inner_nelts_count
= result
;
3118 if (complain
& tf_error
)
3120 error_at (cp_expr_loc_or_input_loc (inner_nelts
),
3121 "array size in new-expression must be constant");
3122 cxx_constant_value(inner_nelts
);
3124 nelts
= error_mark_node
;
3126 if (nelts
!= error_mark_node
)
3127 nelts
= cp_build_binary_op (input_location
,
3133 if (!verify_type_context (input_location
, TCTX_ALLOCATION
, elt_type
,
3134 !(complain
& tf_error
)))
3135 return error_mark_node
;
3137 if (variably_modified_type_p (elt_type
, NULL_TREE
) && (complain
& tf_error
))
3139 error ("variably modified type not allowed in new-expression");
3140 return error_mark_node
;
3143 if (nelts
== error_mark_node
)
3144 return error_mark_node
;
3146 /* Warn if we performed the (T[N]) to T[N] transformation and N is
3148 if (outer_nelts_from_type
3149 && !TREE_CONSTANT (cst_outer_nelts
))
3151 if (complain
& tf_warning_or_error
)
3153 pedwarn (cp_expr_loc_or_input_loc (outer_nelts
), OPT_Wvla
,
3154 typedef_variant_p (orig_type
)
3155 ? G_("non-constant array new length must be specified "
3156 "directly, not by %<typedef%>")
3157 : G_("non-constant array new length must be specified "
3158 "without parentheses around the type-id"));
3161 return error_mark_node
;
3164 if (VOID_TYPE_P (elt_type
))
3166 if (complain
& tf_error
)
3167 error ("invalid type %<void%> for %<new%>");
3168 return error_mark_node
;
3171 if (is_std_init_list (elt_type
) && !cp_unevaluated_operand
)
3172 warning (OPT_Winit_list_lifetime
,
3173 "%<new%> of %<initializer_list%> does not "
3174 "extend the lifetime of the underlying array");
3176 if (abstract_virtuals_error (ACU_NEW
, elt_type
, complain
))
3177 return error_mark_node
;
3179 is_initialized
= (type_build_ctor_call (elt_type
) || *init
!= NULL
);
3181 if (*init
== NULL
&& cxx_dialect
< cxx11
)
3183 bool maybe_uninitialized_error
= false;
3184 /* A program that calls for default-initialization [...] of an
3185 entity of reference type is ill-formed. */
3186 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type
))
3187 maybe_uninitialized_error
= true;
3189 /* A new-expression that creates an object of type T initializes
3190 that object as follows:
3191 - If the new-initializer is omitted:
3192 -- If T is a (possibly cv-qualified) non-POD class type
3193 (or array thereof), the object is default-initialized (8.5).
3195 -- Otherwise, the object created has indeterminate
3196 value. If T is a const-qualified type, or a (possibly
3197 cv-qualified) POD class type (or array thereof)
3198 containing (directly or indirectly) a member of
3199 const-qualified type, the program is ill-formed; */
3201 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type
))
3202 maybe_uninitialized_error
= true;
3204 if (maybe_uninitialized_error
3205 && diagnose_uninitialized_cst_or_ref_member (elt_type
,
3207 complain
& tf_error
))
3208 return error_mark_node
;
3211 if (CP_TYPE_CONST_P (elt_type
) && *init
== NULL
3212 && default_init_uninitialized_part (elt_type
))
3214 if (complain
& tf_error
)
3215 error ("uninitialized const in %<new%> of %q#T", elt_type
);
3216 return error_mark_node
;
3219 size
= size_in_bytes (elt_type
);
3222 /* Maximum available size in bytes. Half of the address space
3223 minus the cookie size. */
3225 = wi::set_bit_in_zero
<offset_int
> (TYPE_PRECISION (sizetype
) - 1);
3226 /* Maximum number of outer elements which can be allocated. */
3227 offset_int max_outer_nelts
;
3228 tree max_outer_nelts_tree
;
3230 gcc_assert (TREE_CODE (size
) == INTEGER_CST
);
3231 cookie_size
= targetm
.cxx
.get_cookie_size (elt_type
);
3232 gcc_assert (TREE_CODE (cookie_size
) == INTEGER_CST
);
3233 gcc_checking_assert (wi::ltu_p (wi::to_offset (cookie_size
), max_size
));
3234 /* Unconditionally subtract the cookie size. This decreases the
3235 maximum object size and is safe even if we choose not to use
3236 a cookie after all. */
3237 max_size
-= wi::to_offset (cookie_size
);
3238 wi::overflow_type overflow
;
3239 inner_size
= wi::mul (wi::to_offset (size
), inner_nelts_count
, SIGNED
,
3241 if (overflow
|| wi::gtu_p (inner_size
, max_size
))
3243 if (complain
& tf_error
)
3245 cst_size_error error
;
3247 error
= cst_size_overflow
;
3250 error
= cst_size_too_big
;
3251 size
= size_binop (MULT_EXPR
, size
,
3252 wide_int_to_tree (sizetype
,
3253 inner_nelts_count
));
3254 size
= cp_fully_fold (size
);
3256 invalid_array_size_error (input_location
, error
, size
,
3257 /*name=*/NULL_TREE
);
3259 return error_mark_node
;
3262 max_outer_nelts
= wi::udiv_trunc (max_size
, inner_size
);
3263 max_outer_nelts_tree
= wide_int_to_tree (sizetype
, max_outer_nelts
);
3265 size
= size_binop (MULT_EXPR
, size
, fold_convert (sizetype
, nelts
));
3267 if (TREE_CODE (cst_outer_nelts
) == INTEGER_CST
)
3269 if (tree_int_cst_lt (max_outer_nelts_tree
, cst_outer_nelts
))
3271 /* When the array size is constant, check it at compile time
3272 to make sure it doesn't exceed the implementation-defined
3273 maximum, as required by C++ 14 (in C++ 11 this requirement
3274 isn't explicitly stated but it's enforced anyway -- see
3275 grokdeclarator in cp/decl.cc). */
3276 if (complain
& tf_error
)
3278 size
= cp_fully_fold (size
);
3279 invalid_array_size_error (input_location
, cst_size_too_big
,
3282 return error_mark_node
;
3287 /* When a runtime check is necessary because the array size
3288 isn't constant, keep only the top-most seven bits (starting
3289 with the most significant non-zero bit) of the maximum size
3290 to compare the array size against, to simplify encoding the
3291 constant maximum size in the instruction stream. */
3293 unsigned shift
= (max_outer_nelts
.get_precision ()) - 7
3294 - wi::clz (max_outer_nelts
);
3295 max_outer_nelts
= (max_outer_nelts
>> shift
) << shift
;
3297 outer_nelts_check
= fold_build2 (LE_EXPR
, boolean_type_node
,
3299 max_outer_nelts_tree
);
3303 tree align_arg
= NULL_TREE
;
3304 if (type_has_new_extended_alignment (elt_type
))
3306 unsigned align
= TYPE_ALIGN_UNIT (elt_type
);
3307 /* Also consider the alignment of the cookie, if any. */
3308 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
3309 align
= MAX (align
, TYPE_ALIGN_UNIT (size_type_node
));
3310 align_arg
= build_int_cst (align_type_node
, align
);
3313 alloc_fn
= NULL_TREE
;
3315 /* If PLACEMENT is a single simple pointer type not passed by
3316 reference, prepare to capture it in a temporary variable. Do
3317 this now, since PLACEMENT will change in the calls below. */
3318 placement_first
= NULL_TREE
;
3319 if (vec_safe_length (*placement
) == 1
3320 && (TYPE_PTR_P (TREE_TYPE ((**placement
)[0]))))
3321 placement_first
= (**placement
)[0];
3323 bool member_new_p
= false;
3325 /* Allocate the object. */
3329 fnname
= ovl_op_identifier (false, array_p
? VEC_NEW_EXPR
: NEW_EXPR
);
3331 member_new_p
= !globally_qualified_p
3332 && CLASS_TYPE_P (elt_type
)
3334 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type
)
3335 : TYPE_HAS_NEW_OPERATOR (elt_type
));
3337 bool member_delete_p
= (!globally_qualified_p
3338 && CLASS_TYPE_P (elt_type
)
3340 ? TYPE_GETS_VEC_DELETE (elt_type
)
3341 : TYPE_GETS_REG_DELETE (elt_type
)));
3345 /* Use a class-specific operator new. */
3346 /* If a cookie is required, add some extra space. */
3347 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
3348 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
3351 cookie_size
= NULL_TREE
;
3352 /* No size arithmetic necessary, so the size check is
3354 if (outer_nelts_check
!= NULL
&& inner_size
== 1)
3355 outer_nelts_check
= NULL_TREE
;
3357 /* Perform the overflow check. */
3358 tree errval
= TYPE_MAX_VALUE (sizetype
);
3359 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
3360 errval
= throw_bad_array_new_length ();
3361 if (outer_nelts_check
!= NULL_TREE
)
3362 size
= fold_build3 (COND_EXPR
, sizetype
, outer_nelts_check
,
3364 /* Create the argument list. */
3365 vec_safe_insert (*placement
, 0, size
);
3366 /* Do name-lookup to find the appropriate operator. */
3367 fns
= lookup_fnfields (elt_type
, fnname
, /*protect=*/2, complain
);
3368 if (fns
== NULL_TREE
)
3370 if (complain
& tf_error
)
3371 error ("no suitable %qD found in class %qT", fnname
, elt_type
);
3372 return error_mark_node
;
3374 if (TREE_CODE (fns
) == TREE_LIST
)
3376 if (complain
& tf_error
)
3378 error ("request for member %qD is ambiguous", fnname
);
3379 print_candidates (fns
);
3381 return error_mark_node
;
3383 tree dummy
= build_dummy_object (elt_type
);
3384 alloc_call
= NULL_TREE
;
3387 vec
<tree
, va_gc
> *align_args
3388 = vec_copy_and_insert (*placement
, align_arg
, 1);
3390 = build_new_method_call (dummy
, fns
, &align_args
,
3391 /*conversion_path=*/NULL_TREE
,
3392 LOOKUP_NORMAL
, &alloc_fn
, tf_none
);
3393 /* If no matching function is found and the allocated object type
3394 has new-extended alignment, the alignment argument is removed
3395 from the argument list, and overload resolution is performed
3397 if (alloc_call
== error_mark_node
)
3398 alloc_call
= NULL_TREE
;
3401 alloc_call
= build_new_method_call (dummy
, fns
, placement
,
3402 /*conversion_path=*/NULL_TREE
,
3404 &alloc_fn
, complain
);
3408 /* Use a global operator new. */
3409 /* See if a cookie might be required. */
3410 if (!(array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
)))
3412 cookie_size
= NULL_TREE
;
3413 /* No size arithmetic necessary, so the size check is
3415 if (outer_nelts_check
!= NULL
&& inner_size
== 1)
3416 outer_nelts_check
= NULL_TREE
;
3419 /* If size is zero e.g. due to type having zero size, try to
3420 preserve outer_nelts for constant expression evaluation
3422 if (integer_zerop (size
) && outer_nelts
)
3423 size
= build2 (MULT_EXPR
, TREE_TYPE (size
), size
, outer_nelts
);
3425 alloc_call
= build_operator_new_call (fnname
, placement
,
3426 &size
, &cookie_size
,
3427 align_arg
, outer_nelts_check
,
3428 &alloc_fn
, complain
);
3431 if (alloc_call
== error_mark_node
)
3432 return error_mark_node
;
3434 gcc_assert (alloc_fn
!= NULL_TREE
);
3436 /* Now, check to see if this function is actually a placement
3437 allocation function. This can happen even when PLACEMENT is NULL
3438 because we might have something like:
3440 struct S { void* operator new (size_t, int i = 0); };
3442 A call to `new S' will get this allocation function, even though
3443 there is no explicit placement argument. If there is more than
3444 one argument, or there are variable arguments, then this is a
3445 placement allocation function. */
3446 placement_allocation_fn_p
3447 = (type_num_arguments (TREE_TYPE (alloc_fn
)) > 1
3448 || varargs_function_p (alloc_fn
));
3450 if (complain
& tf_warning_or_error
3452 && !placement_allocation_fn_p
3453 && TYPE_ALIGN (elt_type
) > malloc_alignment ()
3454 && (warn_aligned_new
> 1
3455 || CP_DECL_CONTEXT (alloc_fn
) == global_namespace
)
3456 && !aligned_allocation_fn_p (alloc_fn
))
3458 auto_diagnostic_group d
;
3459 if (warning (OPT_Waligned_new_
, "%<new%> of type %qT with extended "
3460 "alignment %d", elt_type
, TYPE_ALIGN_UNIT (elt_type
)))
3462 inform (input_location
, "uses %qD, which does not have an alignment "
3463 "parameter", alloc_fn
);
3464 if (!aligned_new_threshold
)
3465 inform (input_location
, "use %<-faligned-new%> to enable C++17 "
3466 "over-aligned new support");
3470 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
3471 into a temporary variable. */
3472 if (!processing_template_decl
3473 && TREE_CODE (alloc_call
) == CALL_EXPR
3474 && call_expr_nargs (alloc_call
) == 2
3475 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call
, 0))) == INTEGER_TYPE
3476 && TYPE_PTR_P (TREE_TYPE (CALL_EXPR_ARG (alloc_call
, 1))))
3478 tree placement
= CALL_EXPR_ARG (alloc_call
, 1);
3480 if (placement_first
!= NULL_TREE
3481 && (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement
)))
3482 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement
)))))
3484 placement_expr
= get_target_expr (placement_first
);
3485 CALL_EXPR_ARG (alloc_call
, 1)
3486 = fold_convert (TREE_TYPE (placement
), placement_expr
);
3490 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_ARG (alloc_call
, 1)))))
3492 /* Attempt to make the warning point at the operator new argument. */
3493 if (placement_first
)
3494 placement
= placement_first
;
3496 warn_placement_new_too_small (orig_type
, nelts
, size
, placement
);
3500 alloc_expr
= alloc_call
;
3502 alloc_expr
= maybe_wrap_new_for_constexpr (alloc_expr
, type
,
3505 /* In the simple case, we can stop now. */
3506 pointer_type
= build_pointer_type (type
);
3507 if (!cookie_size
&& !is_initialized
&& !member_delete_p
)
3508 return build_nop (pointer_type
, alloc_expr
);
3510 /* Store the result of the allocation call in a variable so that we can
3511 use it more than once. */
3512 alloc_expr
= get_target_expr (alloc_expr
);
3513 alloc_node
= TARGET_EXPR_SLOT (alloc_expr
);
3515 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
3516 while (TREE_CODE (alloc_call
) == COMPOUND_EXPR
)
3517 alloc_call
= TREE_OPERAND (alloc_call
, 1);
3519 /* Preevaluate the placement args so that we don't reevaluate them for a
3520 placement delete. */
3521 if (placement_allocation_fn_p
)
3524 stabilize_call (alloc_call
, &inits
);
3526 alloc_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (alloc_expr
), inits
,
3530 /* unless an allocation function is declared with an empty excep-
3531 tion-specification (_except.spec_), throw(), it indicates failure to
3532 allocate storage by throwing a bad_alloc exception (clause _except_,
3533 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
3534 cation function is declared with an empty exception-specification,
3535 throw(), it returns null to indicate failure to allocate storage and a
3536 non-null pointer otherwise.
3538 So check for a null exception spec on the op new we just called. */
3540 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (alloc_fn
));
3542 = flag_check_new
|| (nothrow
&& !std_placement_new_fn_p (alloc_fn
));
3550 /* Adjust so we're pointing to the start of the object. */
3551 data_addr
= fold_build_pointer_plus (alloc_node
, cookie_size
);
3553 /* Store the number of bytes allocated so that we can know how
3554 many elements to destroy later. We use the last sizeof
3555 (size_t) bytes to store the number of elements. */
3556 cookie_ptr
= size_binop (MINUS_EXPR
, cookie_size
, size_in_bytes (sizetype
));
3557 cookie_ptr
= fold_build_pointer_plus_loc (input_location
,
3558 alloc_node
, cookie_ptr
);
3559 size_ptr_type
= build_pointer_type (sizetype
);
3560 cookie_ptr
= fold_convert (size_ptr_type
, cookie_ptr
);
3561 cookie
= cp_build_fold_indirect_ref (cookie_ptr
);
3563 cookie_expr
= build2 (MODIFY_EXPR
, sizetype
, cookie
, nelts
);
3565 if (targetm
.cxx
.cookie_has_size ())
3567 /* Also store the element size. */
3568 cookie_ptr
= fold_build_pointer_plus (cookie_ptr
,
3569 fold_build1_loc (input_location
,
3570 NEGATE_EXPR
, sizetype
,
3571 size_in_bytes (sizetype
)));
3573 cookie
= cp_build_fold_indirect_ref (cookie_ptr
);
3574 cookie
= build2 (MODIFY_EXPR
, sizetype
, cookie
,
3575 size_in_bytes (elt_type
));
3576 cookie_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cookie_expr
),
3577 cookie
, cookie_expr
);
3582 cookie_expr
= NULL_TREE
;
3583 data_addr
= alloc_node
;
3586 /* Now use a pointer to the type we've actually allocated. */
3588 /* But we want to operate on a non-const version to start with,
3589 since we'll be modifying the elements. */
3590 non_const_pointer_type
= build_pointer_type
3591 (cp_build_qualified_type (type
, cp_type_quals (type
) & ~TYPE_QUAL_CONST
));
3593 data_addr
= fold_convert (non_const_pointer_type
, data_addr
);
3594 /* Any further uses of alloc_node will want this type, too. */
3595 alloc_node
= fold_convert (non_const_pointer_type
, alloc_node
);
3597 /* Now initialize the allocated object. Note that we preevaluate the
3598 initialization expression, apart from the actual constructor call or
3599 assignment--we do this because we want to delay the allocation as long
3600 as possible in order to minimize the size of the exception region for
3601 placement delete. */
3604 bool explicit_value_init_p
= false;
3606 if (*init
!= NULL
&& (*init
)->is_empty ())
3609 explicit_value_init_p
= true;
3612 if (processing_template_decl
)
3614 /* Avoid an ICE when converting to a base in build_simple_base_path.
3615 We'll throw this all away anyway, and build_new will create
3617 tree t
= fold_convert (build_pointer_type (elt_type
), data_addr
);
3618 /* build_value_init doesn't work in templates, and we don't need
3619 the initializer anyway since we're going to throw it away and
3620 rebuild it at instantiation time, so just build up a single
3621 constructor call to get any appropriate diagnostics. */
3622 init_expr
= cp_build_fold_indirect_ref (t
);
3623 if (type_build_ctor_call (elt_type
))
3624 init_expr
= build_special_member_call (init_expr
,
3625 complete_ctor_identifier
,
3632 tree vecinit
= NULL_TREE
;
3633 const size_t len
= vec_safe_length (*init
);
3634 if (len
== 1 && DIRECT_LIST_INIT_P ((**init
)[0]))
3636 vecinit
= (**init
)[0];
3637 if (CONSTRUCTOR_NELTS (vecinit
) == 0)
3638 /* List-value-initialization, leave it alone. */;
3641 tree arraytype
, domain
;
3642 if (TREE_CONSTANT (nelts
))
3643 domain
= compute_array_index_type (NULL_TREE
, nelts
,
3646 /* We'll check the length at runtime. */
3648 arraytype
= build_cplus_array_type (type
, domain
);
3649 /* If we have new char[4]{"foo"}, we have to reshape
3650 so that the STRING_CST isn't wrapped in { }. */
3651 vecinit
= reshape_init (arraytype
, vecinit
, complain
);
3652 /* The middle end doesn't cope with the location wrapper
3653 around a STRING_CST. */
3654 STRIP_ANY_LOCATION_WRAPPER (vecinit
);
3655 vecinit
= digest_init (arraytype
, vecinit
, complain
);
3660 if (complain
& tf_error
)
3661 error ("parenthesized initializer in array new");
3662 return error_mark_node
;
3665 = build_vec_init (data_addr
,
3666 cp_build_binary_op (input_location
,
3667 MINUS_EXPR
, outer_nelts
,
3671 explicit_value_init_p
,
3677 init_expr
= cp_build_fold_indirect_ref (data_addr
);
3679 if (type_build_ctor_call (type
) && !explicit_value_init_p
)
3681 init_expr
= build_special_member_call (init_expr
,
3682 complete_ctor_identifier
,
3685 complain
|tf_no_cleanup
);
3687 else if (explicit_value_init_p
)
3689 /* Something like `new int()'. NO_CLEANUP is needed so
3690 we don't try and build a (possibly ill-formed)
3692 tree val
= build_value_init (type
, complain
| tf_no_cleanup
);
3693 if (val
== error_mark_node
)
3694 return error_mark_node
;
3695 init_expr
= cp_build_init_expr (init_expr
, val
);
3701 /* We are processing something like `new int (10)', which
3702 means allocate an int, and initialize it with 10.
3704 In C++20, also handle `new A(1, 2)'. */
3705 if (cxx_dialect
>= cxx20
3706 && AGGREGATE_TYPE_P (type
)
3707 && (*init
)->length () > 1)
3709 ie
= build_constructor_from_vec (init_list_type_node
, *init
);
3710 CONSTRUCTOR_IS_DIRECT_INIT (ie
) = true;
3711 CONSTRUCTOR_IS_PAREN_INIT (ie
) = true;
3712 ie
= digest_init (type
, ie
, complain
);
3715 ie
= build_x_compound_expr_from_vec (*init
, "new initializer",
3717 init_expr
= cp_build_modify_expr (input_location
, init_expr
,
3718 INIT_EXPR
, ie
, complain
);
3720 /* If the initializer uses C++14 aggregate NSDMI that refer to the
3721 object being initialized, replace them now and don't try to
3723 bool had_placeholder
= false;
3724 if (!processing_template_decl
3725 && TREE_CODE (init_expr
) == INIT_EXPR
)
3726 TREE_OPERAND (init_expr
, 1)
3727 = replace_placeholders (TREE_OPERAND (init_expr
, 1),
3728 TREE_OPERAND (init_expr
, 0),
3732 if (init_expr
== error_mark_node
)
3733 return error_mark_node
;
3736 init_expr
= NULL_TREE
;
3738 /* If any part of the object initialization terminates by throwing an
3739 exception and a suitable deallocation function can be found, the
3740 deallocation function is called to free the memory in which the
3741 object was being constructed, after which the exception continues
3742 to propagate in the context of the new-expression. If no
3743 unambiguous matching deallocation function can be found,
3744 propagating the exception does not cause the object's memory to be
3746 if (flag_exceptions
&& (init_expr
|| member_delete_p
))
3748 enum tree_code dcode
= array_p
? VEC_DELETE_EXPR
: DELETE_EXPR
;
3751 /* The Standard is unclear here, but the right thing to do
3752 is to use the same method for finding deallocation
3753 functions that we use for finding allocation functions. */
3754 cleanup
= (build_op_delete_call
3758 globally_qualified_p
,
3759 placement_allocation_fn_p
? alloc_call
: NULL_TREE
,
3763 if (cleanup
&& init_expr
&& !processing_template_decl
)
3764 /* Ack! First we allocate the memory. Then we set our sentry
3765 variable to true, and expand a cleanup that deletes the
3766 memory if sentry is true. Then we run the constructor, and
3767 finally clear the sentry.
3769 We need to do this because we allocate the space first, so
3770 if there are any temporaries with cleanups in the
3771 constructor args, we need this EH region to extend until
3772 end of full-expression to preserve nesting.
3774 We used to try to evaluate the args first to avoid this, but
3775 since C++17 [expr.new] says that "The invocation of the
3776 allocation function is sequenced before the evaluations of
3777 expressions in the new-initializer." */
3779 tree end
, sentry
, begin
;
3781 begin
= get_target_expr (boolean_true_node
);
3782 CLEANUP_EH_ONLY (begin
) = 1;
3784 sentry
= TARGET_EXPR_SLOT (begin
);
3786 /* CLEANUP is compiler-generated, so no diagnostics. */
3787 suppress_warning (cleanup
);
3789 TARGET_EXPR_CLEANUP (begin
)
3790 = build3 (COND_EXPR
, void_type_node
, sentry
,
3791 cleanup
, void_node
);
3793 end
= build2 (MODIFY_EXPR
, TREE_TYPE (sentry
),
3794 sentry
, boolean_false_node
);
3797 = build2 (COMPOUND_EXPR
, void_type_node
, begin
,
3798 build2 (COMPOUND_EXPR
, void_type_node
, init_expr
,
3800 /* Likewise, this is compiler-generated. */
3801 suppress_warning (init_expr
);
3805 /* Now build up the return value in reverse order. */
3810 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
3812 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
3814 suppress_warning (rval
, OPT_Wunused_value
);
3816 if (rval
== data_addr
&& TREE_CODE (alloc_expr
) == TARGET_EXPR
)
3817 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
3818 and return the call (which doesn't need to be adjusted). */
3819 rval
= TARGET_EXPR_INITIAL (alloc_expr
);
3824 tree ifexp
= cp_build_binary_op (input_location
,
3825 NE_EXPR
, alloc_node
,
3828 rval
= build_conditional_expr (input_location
, ifexp
, rval
,
3829 alloc_node
, complain
);
3832 /* Perform the allocation before anything else, so that ALLOC_NODE
3833 has been initialized before we start using it. */
3834 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
3837 /* A new-expression is never an lvalue. */
3838 gcc_assert (!obvalue_p (rval
));
3840 return convert (pointer_type
, rval
);
3843 /* Generate a representation for a C++ "new" expression. *PLACEMENT
3844 is a vector of placement-new arguments (or NULL if none). If NELTS
3845 is NULL, TYPE is the type of the storage to be allocated. If NELTS
3846 is not NULL, then this is an array-new allocation; TYPE is the type
3847 of the elements in the array and NELTS is the number of elements in
3848 the array. *INIT, if non-NULL, is the initializer for the new
3849 object, or an empty vector to indicate an initializer of "()". If
3850 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3851 rather than just "new". This may change PLACEMENT and INIT. */
3854 build_new (location_t loc
, vec
<tree
, va_gc
> **placement
, tree type
,
3855 tree nelts
, vec
<tree
, va_gc
> **init
, int use_global_new
,
3856 tsubst_flags_t complain
)
3859 vec
<tree
, va_gc
> *orig_placement
= NULL
;
3860 tree orig_nelts
= NULL_TREE
;
3861 vec
<tree
, va_gc
> *orig_init
= NULL
;
3863 if (type
== error_mark_node
)
3864 return error_mark_node
;
3866 if (nelts
== NULL_TREE
3867 /* Don't do auto deduction where it might affect mangling. */
3868 && (!processing_template_decl
|| at_function_scope_p ()))
3870 tree auto_node
= type_uses_auto (type
);
3873 tree d_init
= NULL_TREE
;
3874 const size_t len
= vec_safe_length (*init
);
3875 /* E.g. new auto(x) must have exactly one element, or
3876 a {} initializer will have one element. */
3879 d_init
= (**init
)[0];
3880 d_init
= resolve_nondeduced_context (d_init
, complain
);
3882 /* For the rest, e.g. new A(1, 2, 3), create a list. */
3888 FOR_EACH_VEC_ELT (**init
, n
, t
)
3890 t
= resolve_nondeduced_context (t
, complain
);
3891 *pp
= build_tree_list (NULL_TREE
, t
);
3892 pp
= &TREE_CHAIN (*pp
);
3895 type
= do_auto_deduction (type
, d_init
, auto_node
, complain
);
3899 if (processing_template_decl
)
3901 if (dependent_type_p (type
)
3902 || any_type_dependent_arguments_p (*placement
)
3903 || (nelts
&& type_dependent_expression_p (nelts
))
3905 || any_type_dependent_arguments_p (*init
))
3906 return build_raw_new_expr (loc
, *placement
, type
, nelts
, *init
,
3909 orig_placement
= make_tree_vector_copy (*placement
);
3913 orig_init
= make_tree_vector_copy (*init
);
3914 /* Also copy any CONSTRUCTORs in *init, since reshape_init and
3915 digest_init clobber them in place. */
3916 for (unsigned i
= 0; i
< orig_init
->length(); ++i
)
3918 tree e
= (**init
)[i
];
3919 if (TREE_CODE (e
) == CONSTRUCTOR
)
3920 (**init
)[i
] = copy_node (e
);
3924 make_args_non_dependent (*placement
);
3926 nelts
= build_non_dependent_expr (nelts
);
3927 make_args_non_dependent (*init
);
3932 location_t nelts_loc
= cp_expr_loc_or_loc (nelts
, loc
);
3933 if (!build_expr_type_conversion (WANT_INT
| WANT_ENUM
, nelts
, false))
3935 if (complain
& tf_error
)
3936 permerror (nelts_loc
,
3937 "size in array new must have integral type");
3939 return error_mark_node
;
3942 /* Try to determine the constant value only for the purposes
3943 of the diagnostic below but continue to use the original
3944 value and handle const folding later. */
3945 const_tree cst_nelts
= fold_non_dependent_expr (nelts
, complain
);
3947 /* The expression in a noptr-new-declarator is erroneous if it's of
3948 non-class type and its value before converting to std::size_t is
3949 less than zero. ... If the expression is a constant expression,
3950 the program is ill-fomed. */
3951 if (TREE_CODE (cst_nelts
) == INTEGER_CST
3952 && !valid_array_size_p (nelts_loc
, cst_nelts
, NULL_TREE
,
3953 complain
& tf_error
))
3954 return error_mark_node
;
3956 nelts
= mark_rvalue_use (nelts
);
3957 nelts
= cp_save_expr (cp_convert (sizetype
, nelts
, complain
));
3960 /* ``A reference cannot be created by the new operator. A reference
3961 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3962 returned by new.'' ARM 5.3.3 */
3963 if (TYPE_REF_P (type
))
3965 if (complain
& tf_error
)
3966 error_at (loc
, "new cannot be applied to a reference type");
3968 return error_mark_node
;
3969 type
= TREE_TYPE (type
);
3972 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3974 if (complain
& tf_error
)
3975 error_at (loc
, "new cannot be applied to a function type");
3976 return error_mark_node
;
3979 /* P1009: Array size deduction in new-expressions. */
3980 const bool array_p
= TREE_CODE (type
) == ARRAY_TYPE
;
3982 /* If ARRAY_P, we have to deduce the array bound. For C++20 paren-init,
3983 we have to process the parenthesized-list. But don't do it for (),
3984 which is value-initialization, and INIT should stay empty. */
3985 && (array_p
|| (cxx_dialect
>= cxx20
&& nelts
&& !(*init
)->is_empty ())))
3987 /* This means we have 'new T[]()'. */
3988 if ((*init
)->is_empty ())
3990 tree ctor
= build_constructor (init_list_type_node
, NULL
);
3991 CONSTRUCTOR_IS_DIRECT_INIT (ctor
) = true;
3992 vec_safe_push (*init
, ctor
);
3994 tree
&elt
= (**init
)[0];
3995 /* The C++20 'new T[](e_0, ..., e_k)' case allowed by P0960. */
3996 if (!DIRECT_LIST_INIT_P (elt
) && cxx_dialect
>= cxx20
)
3998 tree ctor
= build_constructor_from_vec (init_list_type_node
, *init
);
3999 CONSTRUCTOR_IS_DIRECT_INIT (ctor
) = true;
4000 CONSTRUCTOR_IS_PAREN_INIT (ctor
) = true;
4002 /* We've squashed all the vector elements into the first one;
4003 truncate the rest. */
4004 (*init
)->truncate (1);
4006 /* Otherwise we should have 'new T[]{e_0, ..., e_k}'. */
4007 if (array_p
&& !TYPE_DOMAIN (type
))
4009 /* We need to reshape before deducing the bounds to handle code like
4011 struct S { int x, y; };
4012 new S[]{1, 2, 3, 4};
4014 which should deduce S[2]. But don't change ELT itself: we want to
4015 pass a list-initializer to build_new_1, even for STRING_CSTs. */
4017 if (BRACE_ENCLOSED_INITIALIZER_P (e
))
4018 e
= reshape_init (type
, e
, complain
);
4019 cp_complete_array_type (&type
, e
, /*do_default*/false);
4023 /* The type allocated must be complete. If the new-type-id was
4024 "T[N]" then we are just checking that "T" is complete here, but
4025 that is equivalent, since the value of "N" doesn't matter. */
4026 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
))
4027 return error_mark_node
;
4029 rval
= build_new_1 (placement
, type
, nelts
, init
, use_global_new
, complain
);
4030 if (rval
== error_mark_node
)
4031 return error_mark_node
;
4033 if (processing_template_decl
)
4035 tree ret
= build_raw_new_expr (loc
, orig_placement
, type
, orig_nelts
,
4036 orig_init
, use_global_new
);
4037 release_tree_vector (orig_placement
);
4038 release_tree_vector (orig_init
);
4042 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
4043 rval
= build1_loc (loc
, NOP_EXPR
, TREE_TYPE (rval
), rval
);
4044 suppress_warning (rval
, OPT_Wunused_value
);
4050 build_vec_delete_1 (location_t loc
, tree base
, tree maxindex
, tree type
,
4051 special_function_kind auto_delete_vec
,
4052 int use_global_delete
, tsubst_flags_t complain
,
4053 bool in_cleanup
= false)
4056 tree ptype
= build_pointer_type (type
= complete_type (type
));
4059 /* Temporary variables used by the loop. */
4060 tree tbase
, tbase_init
;
4062 /* This is the body of the loop that implements the deletion of a
4063 single element, and moves temp variables to next elements. */
4066 /* This is the LOOP_EXPR that governs the deletion of the elements. */
4069 /* This is the thing that governs what to do after the loop has run. */
4070 tree deallocate_expr
= 0;
4072 /* This is the BIND_EXPR which holds the outermost iterator of the
4073 loop. It is convenient to set this variable up and test it before
4074 executing any other code in the loop.
4075 This is also the containing expression returned by this function. */
4076 tree controller
= NULL_TREE
;
4079 /* We should only have 1-D arrays here. */
4080 gcc_assert (TREE_CODE (type
) != ARRAY_TYPE
);
4082 if (base
== error_mark_node
|| maxindex
== error_mark_node
)
4083 return error_mark_node
;
4085 if (!verify_type_context (loc
, TCTX_DEALLOCATION
, type
,
4086 !(complain
& tf_error
)))
4087 return error_mark_node
;
4089 if (!COMPLETE_TYPE_P (type
))
4091 if (complain
& tf_warning
)
4093 auto_diagnostic_group d
;
4094 if (warning_at (loc
, OPT_Wdelete_incomplete
,
4095 "possible problem detected in invocation of "
4096 "operator %<delete []%>"))
4098 cxx_incomplete_type_diagnostic (base
, type
, DK_WARNING
);
4099 inform (loc
, "neither the destructor nor the "
4100 "class-specific operator %<delete []%> will be called, "
4101 "even if they are declared when the class is defined");
4104 /* This size won't actually be used. */
4105 size_exp
= size_one_node
;
4109 size_exp
= size_in_bytes (type
);
4111 if (! MAYBE_CLASS_TYPE_P (type
))
4113 else if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
4115 /* Make sure the destructor is callable. */
4116 if (type_build_dtor_call (type
))
4118 tmp
= build_delete (loc
, ptype
, base
, sfk_complete_destructor
,
4119 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1,
4121 if (tmp
== error_mark_node
)
4122 return error_mark_node
;
4127 /* The below is short by the cookie size. */
4128 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
4129 fold_convert (sizetype
, maxindex
));
4131 tbase
= create_temporary_var (ptype
);
4132 DECL_INITIAL (tbase
)
4133 = fold_build_pointer_plus_loc (loc
, fold_convert (ptype
, base
),
4135 tbase_init
= build_stmt (loc
, DECL_EXPR
, tbase
);
4136 controller
= build3 (BIND_EXPR
, void_type_node
, tbase
, NULL_TREE
, NULL_TREE
);
4137 TREE_SIDE_EFFECTS (controller
) = 1;
4138 BIND_EXPR_VEC_DTOR (controller
) = true;
4140 body
= build1 (EXIT_EXPR
, void_type_node
,
4141 build2 (EQ_EXPR
, boolean_type_node
, tbase
,
4142 fold_convert (ptype
, base
)));
4143 tmp
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, size_exp
);
4144 tmp
= fold_build_pointer_plus (tbase
, tmp
);
4145 tmp
= cp_build_modify_expr (loc
, tbase
, NOP_EXPR
, tmp
, complain
);
4146 if (tmp
== error_mark_node
)
4147 return error_mark_node
;
4148 body
= build_compound_expr (loc
, body
, tmp
);
4149 tmp
= build_delete (loc
, ptype
, tbase
, sfk_complete_destructor
,
4150 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1,
4152 if (tmp
== error_mark_node
)
4153 return error_mark_node
;
4154 body
= build_compound_expr (loc
, body
, tmp
);
4156 loop
= build1 (LOOP_EXPR
, void_type_node
, body
);
4158 /* If one destructor throws, keep trying to clean up the rest, unless we're
4159 already in a build_vec_init cleanup. */
4160 if (flag_exceptions
&& !in_cleanup
&& !expr_noexcept_p (tmp
, tf_none
))
4162 loop
= build2 (TRY_CATCH_EXPR
, void_type_node
, loop
,
4163 unshare_expr (loop
));
4164 /* Tell honor_protect_cleanup_actions to discard this on the
4165 exceptional path. */
4166 TRY_CATCH_IS_CLEANUP (loop
) = true;
4169 loop
= build_compound_expr (loc
, tbase_init
, loop
);
4172 /* Delete the storage if appropriate. */
4173 if (auto_delete_vec
== sfk_deleting_destructor
)
4177 /* The below is short by the cookie size. */
4178 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
4179 fold_convert (sizetype
, maxindex
));
4181 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
4188 cookie_size
= targetm
.cxx
.get_cookie_size (type
);
4189 base_tbd
= cp_build_binary_op (loc
,
4191 cp_convert (string_type_node
,
4195 if (base_tbd
== error_mark_node
)
4196 return error_mark_node
;
4197 base_tbd
= cp_convert (ptype
, base_tbd
, complain
);
4198 /* True size with header. */
4199 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
4202 deallocate_expr
= build_op_delete_call (VEC_DELETE_EXPR
,
4203 base_tbd
, virtual_size
,
4204 use_global_delete
& 1,
4205 /*placement=*/NULL_TREE
,
4206 /*alloc_fn=*/NULL_TREE
,
4211 if (deallocate_expr
== error_mark_node
)
4212 return error_mark_node
;
4213 else if (!deallocate_expr
)
4216 body
= deallocate_expr
;
4218 /* The delete operator must be called, even if a destructor
4220 body
= build2 (TRY_FINALLY_EXPR
, void_type_node
, body
, deallocate_expr
);
4223 body
= integer_zero_node
;
4225 /* Outermost wrapper: If pointer is null, punt. */
4226 tree cond
= build2_loc (loc
, NE_EXPR
, boolean_type_node
, base
,
4227 fold_convert (TREE_TYPE (base
), nullptr_node
));
4228 /* This is a compiler generated comparison, don't emit
4229 e.g. -Wnonnull-compare warning for it. */
4230 suppress_warning (cond
, OPT_Wnonnull_compare
);
4231 body
= build3_loc (loc
, COND_EXPR
, void_type_node
,
4232 cond
, body
, integer_zero_node
);
4233 COND_EXPR_IS_VEC_DELETE (body
) = true;
4234 body
= build1 (NOP_EXPR
, void_type_node
, body
);
4238 TREE_OPERAND (controller
, 1) = body
;
4242 if (TREE_CODE (base
) == SAVE_EXPR
)
4243 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
4244 body
= build2 (COMPOUND_EXPR
, void_type_node
, base
, body
);
4246 return convert_to_void (body
, ICV_CAST
, complain
);
4249 /* Create an unnamed variable of the indicated TYPE. */
4252 create_temporary_var (tree type
)
4256 decl
= build_decl (input_location
,
4257 VAR_DECL
, NULL_TREE
, type
);
4258 TREE_USED (decl
) = 1;
4259 DECL_ARTIFICIAL (decl
) = 1;
4260 DECL_IGNORED_P (decl
) = 1;
4261 DECL_CONTEXT (decl
) = current_function_decl
;
4266 /* Create a new temporary variable of the indicated TYPE, initialized
4269 It is not entered into current_binding_level, because that breaks
4270 things when it comes time to do final cleanups (which take place
4271 "outside" the binding contour of the function). */
4274 get_temp_regvar (tree type
, tree init
)
4278 decl
= create_temporary_var (type
);
4279 add_decl_expr (decl
);
4281 finish_expr_stmt (cp_build_modify_expr (input_location
, decl
, INIT_EXPR
,
4282 init
, tf_warning_or_error
));
4287 /* Subroutine of build_vec_init. Returns true if assigning to an array of
4288 INNER_ELT_TYPE from INIT is trivial. */
4291 vec_copy_assign_is_trivial (tree inner_elt_type
, tree init
)
4293 tree fromtype
= inner_elt_type
;
4294 if (lvalue_p (init
))
4295 fromtype
= cp_build_reference_type (fromtype
, /*rval*/false);
4296 return is_trivially_xible (MODIFY_EXPR
, inner_elt_type
, fromtype
);
4299 /* Subroutine of build_vec_init: Check that the array has at least N
4300 elements. Other parameters are local variables in build_vec_init. */
4303 finish_length_check (tree atype
, tree iterator
, tree obase
, unsigned n
)
4305 tree nelts
= build_int_cst (ptrdiff_type_node
, n
- 1);
4306 if (TREE_CODE (atype
) != ARRAY_TYPE
)
4308 if (flag_exceptions
)
4310 tree c
= fold_build2 (LT_EXPR
, boolean_type_node
, iterator
,
4312 c
= build3 (COND_EXPR
, void_type_node
, c
,
4313 throw_bad_array_new_length (), void_node
);
4314 finish_expr_stmt (c
);
4316 /* Don't check an array new when -fno-exceptions. */
4318 else if (sanitize_flags_p (SANITIZE_BOUNDS
)
4319 && current_function_decl
!= NULL_TREE
)
4321 /* Make sure the last element of the initializer is in bounds. */
4323 (ubsan_instrument_bounds
4324 (input_location
, obase
, &nelts
, /*ignore_off_by_one*/false));
4328 /* walk_tree callback to collect temporaries in an expression. */
4331 find_temps_r (tree
*tp
, int *walk_subtrees
, void *data
)
4333 vec
<tree
*> &temps
= *static_cast<auto_vec
<tree
*> *>(data
);
4335 if (TREE_CODE (t
) == TARGET_EXPR
4336 && !TARGET_EXPR_ELIDING_P (t
))
4337 temps
.safe_push (tp
);
4338 else if (TYPE_P (t
))
4344 /* walk_tree callback to collect temporaries in an expression that
4345 are allocator arguments to standard library classes. */
4348 find_allocator_temps_r (tree
*tp
, int *walk_subtrees
, void *data
)
4350 vec
<tree
*> &temps
= *static_cast<auto_vec
<tree
*> *>(data
);
4358 /* If this is a call to a constructor for a std:: class, look for
4359 a reference-to-allocator argument. */
4360 tree fn
= cp_get_callee_fndecl_nofold (t
);
4361 if (fn
&& DECL_CONSTRUCTOR_P (fn
)
4362 && decl_in_std_namespace_p (TYPE_NAME (DECL_CONTEXT (fn
))))
4364 int nargs
= call_expr_nargs (t
);
4365 for (int i
= 1; i
< nargs
; ++i
)
4367 tree arg
= get_nth_callarg (t
, i
);
4368 tree atype
= TREE_TYPE (arg
);
4369 if (TREE_CODE (atype
) == REFERENCE_TYPE
4370 && is_std_allocator (TREE_TYPE (atype
)))
4373 if (TREE_CODE (arg
) == ADDR_EXPR
)
4375 tree
*ap
= &TREE_OPERAND (arg
, 0);
4376 if (TREE_CODE (*ap
) == TARGET_EXPR
)
4377 temps
.safe_push (ap
);
4386 /* If INIT initializes a standard library class, and involves a temporary
4387 std::allocator<T>, use ALLOC_OBJ for all such temporaries.
4389 Note that this can clobber the input to build_vec_init; no unsharing is
4390 done. To make this safe we use the TARGET_EXPR in all places rather than
4391 pulling out the TARGET_EXPR_SLOT.
4393 Used by build_vec_init when initializing an array of e.g. strings to reuse
4394 the same temporary allocator for all of the strings. We can do this because
4395 std::allocator has no data and the standard library doesn't care about the
4396 address of allocator objects.
4398 ??? Add an attribute to allow users to assert the same property for other
4399 classes, i.e. one object of the type is interchangeable with any other? */
4402 combine_allocator_temps (tree
&init
, tree
&alloc_obj
)
4404 auto_vec
<tree
*> temps
;
4405 cp_walk_tree_without_duplicates (&init
, find_allocator_temps_r
, &temps
);
4406 for (tree
*p
: temps
)
4415 /* `build_vec_init' returns tree structure that performs
4416 initialization of a vector of aggregate types.
4418 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
4419 to the first element, of POINTER_TYPE.
4420 MAXINDEX is the maximum index of the array (one less than the
4421 number of elements). It is only used if BASE is a pointer or
4422 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
4424 INIT is the (possibly NULL) initializer.
4426 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
4427 elements in the array are value-initialized.
4429 FROM_ARRAY is 0 if we should init everything with INIT
4430 (i.e., every element initialized from INIT).
4431 FROM_ARRAY is 1 if we should index into INIT in parallel
4432 with initialization of DECL.
4433 FROM_ARRAY is 2 if we should index into INIT in parallel,
4434 but use assignment instead of initialization. */
4437 build_vec_init (tree base
, tree maxindex
, tree init
,
4438 bool explicit_value_init_p
,
4440 tsubst_flags_t complain
,
4441 vec
<tree
, va_gc
>** cleanup_flags
/* = nullptr */)
4444 tree base2
= NULL_TREE
;
4445 tree itype
= NULL_TREE
;
4447 /* The type of BASE. */
4448 tree atype
= TREE_TYPE (base
);
4449 /* The type of an element in the array. */
4450 tree type
= TREE_TYPE (atype
);
4451 /* The element type reached after removing all outer array
4453 tree inner_elt_type
;
4454 /* The type of a pointer to an element in the array. */
4459 HOST_WIDE_INT num_initialized_elts
= 0;
4462 bool xvalue
= false;
4463 bool errors
= false;
4464 location_t loc
= (init
? cp_expr_loc_or_input_loc (init
)
4465 : location_of (base
));
4467 if (TREE_CODE (atype
) == ARRAY_TYPE
&& TYPE_DOMAIN (atype
))
4468 maxindex
= array_type_nelts (atype
);
4470 if (maxindex
== NULL_TREE
|| maxindex
== error_mark_node
)
4471 return error_mark_node
;
4473 maxindex
= maybe_constant_value (maxindex
);
4474 if (explicit_value_init_p
)
4477 inner_elt_type
= strip_array_types (type
);
4479 /* Look through the TARGET_EXPR around a compound literal. */
4480 if (init
&& TREE_CODE (init
) == TARGET_EXPR
4481 && TREE_CODE (TARGET_EXPR_INITIAL (init
)) == CONSTRUCTOR
4483 && (same_type_ignoring_top_level_qualifiers_p
4484 (TREE_TYPE (init
), atype
)))
4485 init
= TARGET_EXPR_INITIAL (init
);
4487 if (tree vi
= get_vec_init_expr (init
))
4488 init
= VEC_INIT_EXPR_INIT (vi
);
4490 bool direct_init
= false;
4491 if (from_array
&& init
&& BRACE_ENCLOSED_INITIALIZER_P (init
)
4492 && CONSTRUCTOR_NELTS (init
) == 1)
4494 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
4495 if (TREE_CODE (TREE_TYPE (elt
)) == ARRAY_TYPE
4496 && TREE_CODE (elt
) != VEC_INIT_EXPR
)
4498 direct_init
= DIRECT_LIST_INIT_P (init
);
4503 /* from_array doesn't apply to initialization from CONSTRUCTOR. */
4504 if (init
&& TREE_CODE (init
) == CONSTRUCTOR
)
4507 /* If we have a braced-init-list or string constant, make sure that the array
4508 is big enough for all the initializers. */
4509 bool length_check
= (init
4510 && (TREE_CODE (init
) == STRING_CST
4511 || (TREE_CODE (init
) == CONSTRUCTOR
4512 && CONSTRUCTOR_NELTS (init
) > 0))
4513 && !TREE_CONSTANT (maxindex
));
4516 && TREE_CODE (atype
) == ARRAY_TYPE
4517 && TREE_CONSTANT (maxindex
)
4518 && !vla_type_p (type
)
4520 ? vec_copy_assign_is_trivial (inner_elt_type
, init
)
4521 : !TYPE_NEEDS_CONSTRUCTING (type
))
4522 && ((TREE_CODE (init
) == CONSTRUCTOR
4523 && (BRACE_ENCLOSED_INITIALIZER_P (init
)
4524 || (same_type_ignoring_top_level_qualifiers_p
4525 (atype
, TREE_TYPE (init
))))
4526 /* Don't do this if the CONSTRUCTOR might contain something
4527 that might throw and require us to clean up. */
4528 && (vec_safe_is_empty (CONSTRUCTOR_ELTS (init
))
4529 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type
)))
4532 /* Do non-default initialization of trivial arrays resulting from
4533 brace-enclosed initializers. In this case, digest_init and
4534 store_constructor will handle the semantics for us. */
4536 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
4537 init
= digest_init (atype
, init
, complain
);
4538 stmt_expr
= cp_build_init_expr (base
, init
);
4542 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
, complain
);
4543 maxindex
= fold_simple (maxindex
);
4545 if (TREE_CODE (atype
) == ARRAY_TYPE
)
4547 ptype
= build_pointer_type (type
);
4548 base
= decay_conversion (base
, complain
);
4549 if (base
== error_mark_node
)
4550 return error_mark_node
;
4551 base
= cp_convert (ptype
, base
, complain
);
4556 if (integer_all_onesp (maxindex
))
4558 /* Shortcut zero element case to avoid unneeded constructor synthesis. */
4559 if (init
&& TREE_SIDE_EFFECTS (init
))
4560 base
= build2 (COMPOUND_EXPR
, ptype
, init
, base
);
4564 /* The code we are generating looks like:
4568 ptrdiff_t iterator = maxindex;
4570 for (; iterator != -1; --iterator) {
4571 ... initialize *t1 ...
4575 ... destroy elements that were constructed ...
4580 We can omit the try and catch blocks if we know that the
4581 initialization will never throw an exception, or if the array
4582 elements do not have destructors. We can omit the loop completely if
4583 the elements of the array do not have constructors.
4585 We actually wrap the entire body of the above in a STMT_EXPR, for
4588 When copying from array to another, when the array elements have
4589 only trivial copy constructors, we should use __builtin_memcpy
4590 rather than generating a loop. That way, we could take advantage
4591 of whatever cleverness the back end has for dealing with copies
4592 of blocks of memory. */
4594 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
4595 destroy_temps
= stmts_are_full_exprs_p ();
4596 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
4597 rval
= get_temp_regvar (ptype
, base
);
4598 base
= get_temp_regvar (ptype
, rval
);
4599 tree iterator_targ
= get_target_expr (maxindex
);
4600 add_stmt (iterator_targ
);
4601 iterator
= TARGET_EXPR_SLOT (iterator_targ
);
4603 /* If initializing one array from another, initialize element by
4604 element. We rely upon the below calls to do the argument
4605 checking. Evaluate the initializer before entering the try block. */
4608 if (lvalue_kind (init
) & clk_rvalueref
)
4610 if (TREE_CODE (init
) == TARGET_EXPR
)
4612 /* Avoid error in decay_conversion. */
4613 base2
= decay_conversion (TARGET_EXPR_SLOT (init
), complain
);
4614 base2
= cp_build_compound_expr (init
, base2
, tf_none
);
4617 base2
= decay_conversion (init
, complain
);
4618 if (base2
== error_mark_node
)
4619 return error_mark_node
;
4620 itype
= TREE_TYPE (base2
);
4621 base2
= get_temp_regvar (itype
, base2
);
4622 itype
= TREE_TYPE (itype
);
4625 /* Protect the entire array initialization so that we can destroy
4626 the partially constructed array if an exception is thrown.
4627 But don't do this if we're assigning. */
4628 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
4632 tree m
= cp_build_binary_op (input_location
,
4633 MINUS_EXPR
, maxindex
, iterator
,
4636 /* Flatten multi-dimensional array since build_vec_delete only
4637 expects one-dimensional array. */
4638 if (TREE_CODE (type
) == ARRAY_TYPE
)
4639 m
= cp_build_binary_op (input_location
,
4641 /* Avoid mixing signed and unsigned. */
4642 convert (TREE_TYPE (m
),
4643 array_type_nelts_total (type
)),
4646 e
= build_vec_delete_1 (input_location
, rval
, m
,
4647 inner_elt_type
, sfk_complete_destructor
,
4648 /*use_global_delete=*/0, complain
,
4649 /*in_cleanup*/true);
4650 if (e
== error_mark_node
)
4652 TARGET_EXPR_CLEANUP (iterator_targ
) = e
;
4653 CLEANUP_EH_ONLY (iterator_targ
) = true;
4655 /* Since we push this cleanup before doing any initialization, cleanups
4656 for any temporaries in the initialization are naturally within our
4657 cleanup region, so we don't want wrap_temporary_cleanups to do
4658 anything for arrays. But if the array is a subobject, we need to
4659 tell split_nonconstant_init how to turn off this cleanup in favor of
4660 the cleanup for the complete object. */
4662 vec_safe_push (*cleanup_flags
, build_tree_list (iterator
, maxindex
));
4665 /* Should we try to create a constant initializer? */
4666 bool try_const
= (TREE_CODE (atype
) == ARRAY_TYPE
4667 && TREE_CONSTANT (maxindex
)
4668 && (init
? TREE_CODE (init
) == CONSTRUCTOR
4669 : (type_has_constexpr_default_constructor
4671 && (literal_type_p (inner_elt_type
)
4672 || TYPE_HAS_CONSTEXPR_CTOR (inner_elt_type
)));
4673 vec
<constructor_elt
, va_gc
> *const_vec
= NULL
;
4674 bool saw_non_const
= false;
4675 /* If we're initializing a static array, we want to do static
4676 initialization of any elements with constant initializers even if
4677 some are non-constant. */
4678 bool do_static_init
= (DECL_P (obase
) && TREE_STATIC (obase
));
4680 bool empty_list
= false;
4681 if (init
&& BRACE_ENCLOSED_INITIALIZER_P (init
)
4682 && CONSTRUCTOR_NELTS (init
) == 0)
4683 /* Skip over the handling of non-empty init lists. */
4686 /* Maybe pull out constant value when from_array? */
4688 else if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
4690 /* Do non-default initialization of non-trivial arrays resulting from
4691 brace-enclosed initializers. */
4692 unsigned HOST_WIDE_INT idx
;
4694 /* If the constructor already has the array type, it's been through
4695 digest_init, so we shouldn't try to do anything more. */
4696 bool digested
= same_type_p (atype
, TREE_TYPE (init
));
4700 finish_length_check (atype
, iterator
, obase
, CONSTRUCTOR_NELTS (init
));
4703 vec_alloc (const_vec
, CONSTRUCTOR_NELTS (init
));
4705 tree alloc_obj
= NULL_TREE
;
4707 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), idx
, field
, elt
)
4709 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
4712 num_initialized_elts
++;
4714 /* We need to see sub-array TARGET_EXPR before cp_fold_r so we can
4715 handle cleanup flags properly. */
4716 gcc_checking_assert (!target_expr_needs_replace (elt
));
4719 one_init
= cp_build_init_expr (baseref
, elt
);
4720 else if (tree vi
= get_vec_init_expr (elt
))
4721 one_init
= expand_vec_init_expr (baseref
, vi
, complain
,
4723 else if (MAYBE_CLASS_TYPE_P (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
4724 one_init
= build_aggr_init (baseref
, elt
, 0, complain
);
4726 one_init
= cp_build_modify_expr (input_location
, baseref
,
4727 NOP_EXPR
, elt
, complain
);
4728 if (one_init
== error_mark_node
)
4733 field
= size_int (idx
);
4734 tree e
= maybe_constant_init (one_init
);
4735 if (reduced_constant_expression_p (e
))
4737 CONSTRUCTOR_APPEND_ELT (const_vec
, field
, e
);
4739 one_init
= NULL_TREE
;
4741 one_init
= cp_build_init_expr (baseref
, e
);
4747 tree value
= build_zero_init (TREE_TYPE (e
), NULL_TREE
,
4750 CONSTRUCTOR_APPEND_ELT (const_vec
, field
, value
);
4752 saw_non_const
= true;
4758 /* Only create one std::allocator temporary. */
4759 combine_allocator_temps (one_init
, alloc_obj
);
4760 finish_expr_stmt (one_init
);
4763 one_init
= cp_build_unary_op (PREINCREMENT_EXPR
, base
, false,
4765 if (one_init
== error_mark_node
)
4768 finish_expr_stmt (one_init
);
4770 one_init
= cp_build_unary_op (PREDECREMENT_EXPR
, iterator
, false,
4772 if (one_init
== error_mark_node
)
4775 finish_expr_stmt (one_init
);
4778 /* Any elements without explicit initializers get T{}. */
4781 else if (init
&& TREE_CODE (init
) == STRING_CST
)
4783 /* Check that the array is at least as long as the string. */
4785 finish_length_check (atype
, iterator
, obase
,
4786 TREE_STRING_LENGTH (init
));
4787 tree length
= build_int_cst (ptrdiff_type_node
,
4788 TREE_STRING_LENGTH (init
));
4790 /* Copy the string to the first part of the array. */
4791 tree alias_set
= build_int_cst (build_pointer_type (type
), 0);
4792 tree lhs
= build2 (MEM_REF
, TREE_TYPE (init
), base
, alias_set
);
4793 tree stmt
= build2 (MODIFY_EXPR
, void_type_node
, lhs
, init
);
4794 finish_expr_stmt (stmt
);
4796 /* Adjust the counter and pointer. */
4797 stmt
= cp_build_binary_op (loc
, MINUS_EXPR
, iterator
, length
, complain
);
4798 stmt
= build2 (MODIFY_EXPR
, void_type_node
, iterator
, stmt
);
4799 finish_expr_stmt (stmt
);
4801 stmt
= cp_build_binary_op (loc
, PLUS_EXPR
, base
, length
, complain
);
4802 stmt
= build2 (MODIFY_EXPR
, void_type_node
, base
, stmt
);
4803 finish_expr_stmt (stmt
);
4805 /* And set the rest of the array to NUL. */
4807 explicit_value_init_p
= true;
4809 else if (from_array
)
4812 /* OK, we set base2 above. */;
4813 else if (CLASS_TYPE_P (type
)
4814 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
4816 if (complain
& tf_error
)
4817 error ("initializer ends prematurely");
4822 /* Now, default-initialize any remaining elements. We don't need to
4823 do that if a) the type does not need constructing, or b) we've
4824 already initialized all the elements.
4826 We do need to keep going if we're copying an array. */
4828 if (try_const
&& !init
4829 && (cxx_dialect
< cxx20
4830 || !default_init_uninitialized_part (inner_elt_type
)))
4831 /* With a constexpr default constructor, which we checked for when
4832 setting try_const above, default-initialization is equivalent to
4833 value-initialization, and build_value_init gives us something more
4834 friendly to maybe_constant_init. Except in C++20 and up a constexpr
4835 constructor need not initialize all the members. */
4836 explicit_value_init_p
= true;
4838 || ((type_build_ctor_call (type
) || init
|| explicit_value_init_p
)
4839 && ! (tree_fits_shwi_p (maxindex
)
4840 && (num_initialized_elts
4841 == tree_to_shwi (maxindex
) + 1))))
4843 /* If the ITERATOR is lesser or equal to -1, then we don't have to loop;
4844 we've already initialized all the elements. */
4849 for_stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
4850 finish_init_stmt (for_stmt
);
4851 finish_for_cond (build2 (GT_EXPR
, boolean_type_node
, iterator
,
4852 build_int_cst (TREE_TYPE (iterator
), -1)),
4853 for_stmt
, false, 0);
4854 /* We used to pass this decrement to finish_for_expr; now we add it to
4855 elt_init below so it's part of the same full-expression as the
4856 initialization, and thus happens before any potentially throwing
4857 temporary cleanups. */
4858 tree decr
= cp_build_unary_op (PREDECREMENT_EXPR
, iterator
, false,
4862 to
= build1 (INDIRECT_REF
, type
, base
);
4864 /* If the initializer is {}, then all elements are initialized from T{}.
4865 But for non-classes, that's the same as value-initialization. */
4868 if (cxx_dialect
>= cxx11
&& AGGREGATE_TYPE_P (type
))
4870 init
= build_constructor (init_list_type_node
, NULL
);
4875 explicit_value_init_p
= true;
4885 from
= build1 (INDIRECT_REF
, itype
, base2
);
4889 from
= build_tree_list (NULL_TREE
, from
);
4894 if (TREE_CODE (type
) == ARRAY_TYPE
)
4895 elt_init
= build_vec_init (to
, NULL_TREE
, from
, /*val_init*/false,
4896 from_array
, complain
);
4897 else if (from_array
== 2)
4898 elt_init
= cp_build_modify_expr (input_location
, to
, NOP_EXPR
,
4900 else if (type_build_ctor_call (type
))
4901 elt_init
= build_aggr_init (to
, from
, 0, complain
);
4903 elt_init
= cp_build_modify_expr (input_location
, to
, NOP_EXPR
, from
,
4908 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4910 if (init
&& !BRACE_ENCLOSED_INITIALIZER_P (init
))
4912 if ((complain
& tf_error
))
4913 error_at (loc
, "array must be initialized "
4914 "with a brace-enclosed initializer");
4915 elt_init
= error_mark_node
;
4918 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
4920 explicit_value_init_p
,
4923 else if (explicit_value_init_p
)
4925 elt_init
= build_value_init (type
, complain
);
4926 if (elt_init
!= error_mark_node
)
4927 elt_init
= cp_build_init_expr (to
, elt_init
);
4931 gcc_assert (type_build_ctor_call (type
) || init
);
4932 if (CLASS_TYPE_P (type
))
4933 elt_init
= build_aggr_init (to
, init
, 0, complain
);
4936 if (TREE_CODE (init
) == TREE_LIST
)
4937 init
= build_x_compound_expr_from_list (init
, ELK_INIT
,
4939 elt_init
= (init
== error_mark_node
4941 : build2 (INIT_EXPR
, type
, to
, init
));
4945 if (elt_init
== error_mark_node
)
4950 /* FIXME refs to earlier elts */
4951 tree e
= maybe_constant_init (elt_init
);
4952 if (reduced_constant_expression_p (e
))
4954 if (initializer_zerop (e
))
4955 /* Don't fill the CONSTRUCTOR with zeros. */
4958 elt_init
= NULL_TREE
;
4962 saw_non_const
= true;
4964 e
= build_zero_init (TREE_TYPE (e
), NULL_TREE
, true);
4971 HOST_WIDE_INT last
= tree_to_shwi (maxindex
);
4972 if (num_initialized_elts
<= last
)
4974 tree field
= size_int (num_initialized_elts
);
4975 if (num_initialized_elts
!= last
)
4976 field
= build2 (RANGE_EXPR
, sizetype
, field
,
4978 CONSTRUCTOR_APPEND_ELT (const_vec
, field
, e
);
4983 /* [class.temporary]: "There are three contexts in which temporaries are
4984 destroyed at a different point than the end of the full-
4985 expression. The first context is when a default constructor is called
4986 to initialize an element of an array with no corresponding
4987 initializer. The second context is when a copy constructor is called
4988 to copy an element of an array while the entire array is copied. In
4989 either case, if the constructor has one or more default arguments, the
4990 destruction of every temporary created in a default argument is
4991 sequenced before the construction of the next array element, if any."
4993 So, for this loop, statements are full-expressions. */
4994 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
4995 if (elt_init
&& !errors
)
4996 elt_init
= build2 (COMPOUND_EXPR
, void_type_node
, elt_init
, decr
);
4999 finish_expr_stmt (elt_init
);
5000 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
5002 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR
, base
, false,
5005 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR
, base2
, false,
5008 finish_for_stmt (for_stmt
);
5011 /* The value of the array initialization is the array itself, RVAL
5012 is a pointer to the first element. */
5013 finish_stmt_expr_expr (rval
, stmt_expr
);
5015 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
5017 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
5020 return error_mark_node
;
5026 tree const_init
= build_constructor (atype
, const_vec
);
5027 return build2 (INIT_EXPR
, atype
, obase
, const_init
);
5029 else if (do_static_init
&& !vec_safe_is_empty (const_vec
))
5030 DECL_INITIAL (obase
) = build_constructor (atype
, const_vec
);
5032 vec_free (const_vec
);
5035 /* Now make the result have the correct type. */
5036 if (TREE_CODE (atype
) == ARRAY_TYPE
)
5038 atype
= build_reference_type (atype
);
5039 stmt_expr
= build1 (NOP_EXPR
, atype
, stmt_expr
);
5040 stmt_expr
= convert_from_reference (stmt_expr
);
5046 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
5050 build_dtor_call (tree exp
, special_function_kind dtor_kind
, int flags
,
5051 tsubst_flags_t complain
)
5056 case sfk_complete_destructor
:
5057 name
= complete_dtor_identifier
;
5060 case sfk_base_destructor
:
5061 name
= base_dtor_identifier
;
5064 case sfk_deleting_destructor
:
5065 name
= deleting_dtor_identifier
;
5072 return build_special_member_call (exp
, name
,
5074 /*binfo=*/TREE_TYPE (exp
),
5079 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
5080 ADDR is an expression which yields the store to be destroyed.
5081 AUTO_DELETE is the name of the destructor to call, i.e., either
5082 sfk_complete_destructor, sfk_base_destructor, or
5083 sfk_deleting_destructor.
5085 FLAGS is the logical disjunction of zero or more LOOKUP_
5086 flags. See cp-tree.h for more info. */
5089 build_delete (location_t loc
, tree otype
, tree addr
,
5090 special_function_kind auto_delete
,
5091 int flags
, int use_global_delete
, tsubst_flags_t complain
)
5095 if (addr
== error_mark_node
)
5096 return error_mark_node
;
5098 tree type
= TYPE_MAIN_VARIANT (otype
);
5100 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
5101 set to `error_mark_node' before it gets properly cleaned up. */
5102 if (type
== error_mark_node
)
5103 return error_mark_node
;
5105 if (TYPE_PTR_P (type
))
5106 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
5108 if (TREE_CODE (type
) == ARRAY_TYPE
)
5110 if (TYPE_DOMAIN (type
) == NULL_TREE
)
5112 if (complain
& tf_error
)
5113 error_at (loc
, "unknown array size in delete");
5114 return error_mark_node
;
5116 return build_vec_delete (loc
, addr
, array_type_nelts (type
),
5117 auto_delete
, use_global_delete
, complain
);
5120 bool deleting
= (auto_delete
== sfk_deleting_destructor
);
5121 gcc_assert (deleting
== !(flags
& LOOKUP_DESTRUCTOR
));
5123 if (TYPE_PTR_P (otype
))
5125 addr
= mark_rvalue_use (addr
);
5127 /* We don't want to warn about delete of void*, only other
5128 incomplete types. Deleting other incomplete types
5129 invokes undefined behavior, but it is not ill-formed, so
5130 compile to something that would even do The Right Thing
5131 (TM) should the type have a trivial dtor and no delete
5133 if (!VOID_TYPE_P (type
))
5135 complete_type (type
);
5137 && !verify_type_context (loc
, TCTX_DEALLOCATION
, type
,
5138 !(complain
& tf_error
)))
5139 return error_mark_node
;
5141 if (!COMPLETE_TYPE_P (type
))
5143 if (complain
& tf_warning
)
5145 auto_diagnostic_group d
;
5146 if (warning_at (loc
, OPT_Wdelete_incomplete
,
5147 "possible problem detected in invocation of "
5148 "%<operator delete%>"))
5150 cxx_incomplete_type_diagnostic (addr
, type
, DK_WARNING
);
5152 "neither the destructor nor the class-specific "
5153 "%<operator delete%> will be called, even if "
5154 "they are declared when the class is defined");
5158 else if (deleting
&& warn_delnonvdtor
5159 && MAYBE_CLASS_TYPE_P (type
) && !CLASSTYPE_FINAL (type
)
5160 && TYPE_POLYMORPHIC_P (type
))
5162 tree dtor
= CLASSTYPE_DESTRUCTOR (type
);
5163 if (!dtor
|| !DECL_VINDEX (dtor
))
5165 if (CLASSTYPE_PURE_VIRTUALS (type
))
5166 warning_at (loc
, OPT_Wdelete_non_virtual_dtor
,
5167 "deleting object of abstract class type %qT"
5168 " which has non-virtual destructor"
5169 " will cause undefined behavior", type
);
5171 warning_at (loc
, OPT_Wdelete_non_virtual_dtor
,
5172 "deleting object of polymorphic class type %qT"
5173 " which has non-virtual destructor"
5174 " might cause undefined behavior", type
);
5179 /* Throw away const and volatile on target type of addr. */
5180 addr
= convert_force (build_pointer_type (type
), addr
, 0, complain
);
5184 /* Don't check PROTECT here; leave that decision to the
5185 destructor. If the destructor is accessible, call it,
5186 else report error. */
5187 addr
= cp_build_addr_expr (addr
, complain
);
5188 if (addr
== error_mark_node
)
5189 return error_mark_node
;
5191 addr
= convert_force (build_pointer_type (type
), addr
, 0, complain
);
5195 /* We will use ADDR multiple times so we must save it. */
5196 addr
= save_expr (addr
);
5198 bool virtual_p
= false;
5199 if (type_build_dtor_call (type
))
5201 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
5202 lazily_declare_fn (sfk_destructor
, type
);
5203 virtual_p
= DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTOR (type
));
5206 tree head
= NULL_TREE
;
5207 tree do_delete
= NULL_TREE
;
5208 bool destroying_delete
= false;
5212 /* Leave do_delete null. */
5214 /* For `::delete x', we must not use the deleting destructor
5215 since then we would not be sure to get the global `operator
5217 else if (use_global_delete
)
5219 head
= get_target_expr (build_headof (addr
));
5220 /* Delete the object. */
5221 do_delete
= build_op_delete_call (DELETE_EXPR
,
5223 cxx_sizeof_nowarn (type
),
5225 /*placement=*/NULL_TREE
,
5226 /*alloc_fn=*/NULL_TREE
,
5228 /* Otherwise, treat this like a complete object destructor
5230 auto_delete
= sfk_complete_destructor
;
5232 /* If the destructor is non-virtual, there is no deleting
5233 variant. Instead, we must explicitly call the appropriate
5234 `operator delete' here. */
5235 else if (!virtual_p
)
5237 /* Build the call. */
5238 do_delete
= build_op_delete_call (DELETE_EXPR
,
5240 cxx_sizeof_nowarn (type
),
5242 /*placement=*/NULL_TREE
,
5243 /*alloc_fn=*/NULL_TREE
,
5245 /* Call the complete object destructor. */
5246 auto_delete
= sfk_complete_destructor
;
5247 if (do_delete
!= error_mark_node
)
5249 tree fn
= get_callee_fndecl (do_delete
);
5250 destroying_delete
= destroying_delete_p (fn
);
5253 else if (TYPE_GETS_REG_DELETE (type
))
5255 /* Make sure we have access to the member op delete, even though
5256 we'll actually be calling it from the destructor. */
5257 build_op_delete_call (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
),
5259 /*placement=*/NULL_TREE
,
5260 /*alloc_fn=*/NULL_TREE
,
5264 if (destroying_delete
)
5265 /* The operator delete will call the destructor. */
5267 else if (type_build_dtor_call (type
))
5268 expr
= build_dtor_call (cp_build_fold_indirect_ref (addr
),
5269 auto_delete
, flags
, complain
);
5271 expr
= build_trivial_dtor_call (addr
);
5272 if (expr
== error_mark_node
)
5273 return error_mark_node
;
5277 protected_set_expr_location (expr
, loc
);
5281 if (do_delete
== error_mark_node
)
5282 return error_mark_node
;
5284 if (do_delete
&& !TREE_SIDE_EFFECTS (expr
))
5287 /* The delete operator must be called, regardless of whether
5288 the destructor throws.
5290 [expr.delete]/7 The deallocation function is called
5291 regardless of whether the destructor for the object or some
5292 element of the array throws an exception. */
5293 expr
= build2 (TRY_FINALLY_EXPR
, void_type_node
, expr
, do_delete
);
5295 /* We need to calculate this before the dtor changes the vptr. */
5297 expr
= build2 (COMPOUND_EXPR
, void_type_node
, head
, expr
);
5299 /* Handle deleting a null pointer. */
5300 warning_sentinel
s (warn_address
);
5301 tree ifexp
= cp_build_binary_op (loc
, NE_EXPR
, addr
,
5302 nullptr_node
, complain
);
5303 ifexp
= cp_fully_fold (ifexp
);
5305 if (ifexp
== error_mark_node
)
5306 return error_mark_node
;
5307 /* This is a compiler generated comparison, don't emit
5308 e.g. -Wnonnull-compare warning for it. */
5309 else if (TREE_CODE (ifexp
) == NE_EXPR
)
5310 suppress_warning (ifexp
, OPT_Wnonnull_compare
);
5312 if (!integer_nonzerop (ifexp
))
5313 expr
= build3 (COND_EXPR
, void_type_node
, ifexp
, expr
, void_node
);
5315 protected_set_expr_location (expr
, loc
);
5319 /* At the beginning of a destructor, push cleanups that will call the
5320 destructors for our base classes and members.
5322 Called from begin_destructor_body. */
5325 push_base_cleanups (void)
5327 tree binfo
, base_binfo
;
5331 vec
<tree
, va_gc
> *vbases
;
5333 /* Run destructors for all virtual baseclasses. */
5334 if (!ABSTRACT_CLASS_TYPE_P (current_class_type
)
5335 && CLASSTYPE_VBASECLASSES (current_class_type
))
5337 tree cond
= (condition_conversion
5338 (build2 (BIT_AND_EXPR
, integer_type_node
,
5339 current_in_charge_parm
,
5340 integer_two_node
)));
5342 /* The CLASSTYPE_VBASECLASSES vector is in initialization
5343 order, which is also the right order for pushing cleanups. */
5344 for (vbases
= CLASSTYPE_VBASECLASSES (current_class_type
), i
= 0;
5345 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5347 if (type_build_dtor_call (BINFO_TYPE (base_binfo
)))
5349 expr
= build_special_member_call (current_class_ref
,
5350 base_dtor_identifier
,
5354 | LOOKUP_NONVIRTUAL
),
5355 tf_warning_or_error
);
5356 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
5358 expr
= build3 (COND_EXPR
, void_type_node
, cond
,
5360 finish_decl_cleanup (NULL_TREE
, expr
);
5366 /* Take care of the remaining baseclasses. */
5367 for (binfo
= TYPE_BINFO (current_class_type
), i
= 0;
5368 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5370 if (BINFO_VIRTUAL_P (base_binfo
)
5371 || !type_build_dtor_call (BINFO_TYPE (base_binfo
)))
5374 expr
= build_special_member_call (current_class_ref
,
5375 base_dtor_identifier
,
5377 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
,
5378 tf_warning_or_error
);
5379 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
5380 finish_decl_cleanup (NULL_TREE
, expr
);
5383 /* Don't automatically destroy union members. */
5384 if (TREE_CODE (current_class_type
) == UNION_TYPE
)
5387 for (member
= TYPE_FIELDS (current_class_type
); member
;
5388 member
= DECL_CHAIN (member
))
5390 tree this_type
= TREE_TYPE (member
);
5391 if (this_type
== error_mark_node
5392 || TREE_CODE (member
) != FIELD_DECL
5393 || DECL_ARTIFICIAL (member
))
5395 if (ANON_AGGR_TYPE_P (this_type
))
5397 if (type_build_dtor_call (this_type
))
5399 tree this_member
= (build_class_member_access_expr
5400 (current_class_ref
, member
,
5401 /*access_path=*/NULL_TREE
,
5402 /*preserve_reference=*/false,
5403 tf_warning_or_error
));
5404 expr
= build_delete (input_location
, this_type
, this_member
,
5405 sfk_complete_destructor
,
5406 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
5407 0, tf_warning_or_error
);
5408 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type
))
5409 finish_decl_cleanup (NULL_TREE
, expr
);
5414 /* Build a C++ vector delete expression.
5415 MAXINDEX is the number of elements to be deleted.
5416 ELT_SIZE is the nominal size of each element in the vector.
5417 BASE is the expression that should yield the store to be deleted.
5418 This function expands (or synthesizes) these calls itself.
5419 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
5421 This also calls delete for virtual baseclasses of elements of the vector.
5423 Update: MAXINDEX is no longer needed. The size can be extracted from the
5424 start of the vector for pointers, and from the type for arrays. We still
5425 use MAXINDEX for arrays because it happens to already have one of the
5426 values we'd have to extract. (We could use MAXINDEX with pointers to
5427 confirm the size, and trap if the numbers differ; not clear that it'd
5428 be worth bothering.) */
5431 build_vec_delete (location_t loc
, tree base
, tree maxindex
,
5432 special_function_kind auto_delete_vec
,
5433 int use_global_delete
, tsubst_flags_t complain
)
5437 tree base_init
= NULL_TREE
;
5439 type
= TREE_TYPE (base
);
5441 if (TYPE_PTR_P (type
))
5443 /* Step back one from start of vector, and read dimension. */
5445 tree size_ptr_type
= build_pointer_type (sizetype
);
5447 base
= mark_rvalue_use (base
);
5448 if (TREE_SIDE_EFFECTS (base
))
5450 base_init
= get_target_expr (base
);
5451 base
= TARGET_EXPR_SLOT (base_init
);
5453 type
= strip_array_types (TREE_TYPE (type
));
5454 cookie_addr
= fold_build1_loc (loc
, NEGATE_EXPR
,
5455 sizetype
, TYPE_SIZE_UNIT (sizetype
));
5456 cookie_addr
= fold_build_pointer_plus (fold_convert (size_ptr_type
, base
),
5458 maxindex
= cp_build_fold_indirect_ref (cookie_addr
);
5460 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5462 /* Get the total number of things in the array, maxindex is a
5464 maxindex
= array_type_nelts_total (type
);
5465 type
= strip_array_types (type
);
5466 base
= decay_conversion (base
, complain
);
5467 if (base
== error_mark_node
)
5468 return error_mark_node
;
5469 if (TREE_SIDE_EFFECTS (base
))
5471 base_init
= get_target_expr (base
);
5472 base
= TARGET_EXPR_SLOT (base_init
);
5477 if (base
!= error_mark_node
&& !(complain
& tf_error
))
5479 "type to vector delete is neither pointer or array type");
5480 return error_mark_node
;
5483 rval
= build_vec_delete_1 (loc
, base
, maxindex
, type
, auto_delete_vec
,
5484 use_global_delete
, complain
);
5485 if (base_init
&& rval
!= error_mark_node
)
5486 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), base_init
, rval
);
5488 protected_set_expr_location (rval
, loc
);
5492 #include "gt-cp-init.h"