1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
35 static bool begin_init_stmts (tree *, tree *);
36 static tree finish_init_stmts (bool, tree, tree);
37 static void construct_virtual_base (tree, tree);
38 static void expand_aggr_init_1 (tree, tree, tree, tree, int, tsubst_flags_t);
39 static void expand_default_init (tree, tree, tree, tree, int, tsubst_flags_t);
40 static void perform_member_init (tree, tree);
41 static tree build_builtin_delete_call (tree);
42 static int member_init_ok_or_else (tree, tree, tree);
43 static void expand_virtual_init (tree, tree);
44 static tree sort_mem_initializers (tree, tree);
45 static tree initializing_context (tree);
46 static void expand_cleanup_for_base (tree, tree);
47 static tree dfs_initialize_vtbl_ptrs (tree, void *);
48 static tree build_field_list (tree, tree, int *);
49 static tree build_vtbl_address (tree);
50 static int diagnose_uninitialized_cst_or_ref_member_1 (tree, tree, bool, bool);
52 /* We are about to generate some complex initialization code.
53 Conceptually, it is all a single expression. However, we may want
54 to include conditionals, loops, and other such statement-level
55 constructs. Therefore, we build the initialization code inside a
56 statement-expression. This function starts such an expression.
57 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
58 pass them back to finish_init_stmts when the expression is
62 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
64 bool is_global = !building_stmt_tree ();
66 *stmt_expr_p = begin_stmt_expr ();
67 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
72 /* Finish out the statement-expression begun by the previous call to
73 begin_init_stmts. Returns the statement-expression itself. */
76 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
78 finish_compound_stmt (compound_stmt);
80 stmt_expr = finish_stmt_expr (stmt_expr, true);
82 gcc_assert (!building_stmt_tree () == is_global);
89 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
90 which we want to initialize the vtable pointer for, DATA is
91 TREE_LIST whose TREE_VALUE is the this ptr expression. */
94 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
96 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
97 return dfs_skip_bases;
99 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
101 tree base_ptr = TREE_VALUE ((tree) data);
103 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
105 expand_virtual_init (binfo, base_ptr);
111 /* Initialize all the vtable pointers in the object pointed to by
115 initialize_vtbl_ptrs (tree addr)
120 type = TREE_TYPE (TREE_TYPE (addr));
121 list = build_tree_list (type, addr);
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
127 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list);
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
145 build_zero_init_1 (tree type, tree nelts, bool static_storage_p,
148 tree init = NULL_TREE;
152 To zero-initialize an object of type T means:
154 -- if T is a scalar type, the storage is set to the value of zero
157 -- if T is a non-union class type, the storage for each nonstatic
158 data member and each base-class subobject is zero-initialized.
160 -- if T is a union type, the storage for its first data member is
163 -- if T is an array type, the storage for each element is
166 -- if T is a reference type, no initialization is performed. */
168 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST);
170 if (type == error_mark_node)
172 else if (static_storage_p && zero_init_p (type))
173 /* In order to save space, we do not explicitly build initializers
174 for items that do not need them. GCC's semantics are that
175 items with static storage duration that are not otherwise
176 initialized are initialized to zero. */
178 else if (SCALAR_TYPE_P (type))
179 init = convert (type, integer_zero_node);
180 else if (CLASS_TYPE_P (type))
183 VEC(constructor_elt,gc) *v = NULL;
185 /* Iterate over the fields, building initializations. */
186 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
188 if (TREE_CODE (field) != FIELD_DECL)
191 /* Don't add virtual bases for base classes if they are beyond
192 the size of the current field, that means it is present
193 somewhere else in the object. */
196 tree bitpos = bit_position (field);
197 if (TREE_CODE (bitpos) == INTEGER_CST
198 && !tree_int_cst_lt (bitpos, field_size))
202 /* Note that for class types there will be FIELD_DECLs
203 corresponding to base classes as well. Thus, iterating
204 over TYPE_FIELDs will result in correct initialization of
205 all of the subobjects. */
206 if (!static_storage_p || !zero_init_p (TREE_TYPE (field)))
209 = (DECL_FIELD_IS_BASE (field)
211 && TREE_CODE (DECL_SIZE (field)) == INTEGER_CST)
212 ? DECL_SIZE (field) : NULL_TREE;
213 tree value = build_zero_init_1 (TREE_TYPE (field),
218 CONSTRUCTOR_APPEND_ELT(v, field, value);
221 /* For unions, only the first field is initialized. */
222 if (TREE_CODE (type) == UNION_TYPE)
226 /* Build a constructor to contain the initializations. */
227 init = build_constructor (type, v);
229 else if (TREE_CODE (type) == ARRAY_TYPE)
232 VEC(constructor_elt,gc) *v = NULL;
234 /* Iterate over the array elements, building initializations. */
236 max_index = fold_build2_loc (input_location,
237 MINUS_EXPR, TREE_TYPE (nelts),
238 nelts, integer_one_node);
240 max_index = array_type_nelts (type);
242 /* If we have an error_mark here, we should just return error mark
243 as we don't know the size of the array yet. */
244 if (max_index == error_mark_node)
245 return error_mark_node;
246 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
248 /* A zero-sized array, which is accepted as an extension, will
249 have an upper bound of -1. */
250 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
254 v = VEC_alloc (constructor_elt, gc, 1);
255 ce = VEC_quick_push (constructor_elt, v, NULL);
257 /* If this is a one element array, we just use a regular init. */
258 if (tree_int_cst_equal (size_zero_node, max_index))
259 ce->index = size_zero_node;
261 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
264 ce->value = build_zero_init_1 (TREE_TYPE (type),
266 static_storage_p, NULL_TREE);
269 /* Build a constructor to contain the initializations. */
270 init = build_constructor (type, v);
272 else if (TREE_CODE (type) == VECTOR_TYPE)
273 init = build_zero_cst (type);
275 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
277 /* In all cases, the initializer is a constant. */
279 TREE_CONSTANT (init) = 1;
284 /* Return an expression for the zero-initialization of an object with
285 type T. This expression will either be a constant (in the case
286 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
287 aggregate), or NULL (in the case that T does not require
288 initialization). In either case, the value can be used as
289 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
290 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
291 is the number of elements in the array. If STATIC_STORAGE_P is
292 TRUE, initializers are only generated for entities for which
293 zero-initialization does not simply mean filling the storage with
297 build_zero_init (tree type, tree nelts, bool static_storage_p)
299 return build_zero_init_1 (type, nelts, static_storage_p, NULL_TREE);
302 /* Return a suitable initializer for value-initializing an object of type
303 TYPE, as described in [dcl.init]. */
306 build_value_init (tree type, tsubst_flags_t complain)
310 To value-initialize an object of type T means:
312 - if T is a class type (clause 9) with a user-provided constructor
313 (12.1), then the default constructor for T is called (and the
314 initialization is ill-formed if T has no accessible default
317 - if T is a non-union class type without a user-provided constructor,
318 then every non-static data member and base-class component of T is
319 value-initialized;92)
321 - if T is an array type, then each element is value-initialized;
323 - otherwise, the object is zero-initialized.
325 A program that calls for default-initialization or
326 value-initialization of an entity of reference type is ill-formed.
328 92) Value-initialization for such a class object may be implemented by
329 zero-initializing the object and then calling the default
332 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
333 gcc_assert (!processing_template_decl);
335 if (CLASS_TYPE_P (type))
337 if (type_has_user_provided_constructor (type))
338 return build_aggr_init_expr
340 build_special_member_call (NULL_TREE, complete_ctor_identifier,
341 NULL, type, LOOKUP_NORMAL,
344 else if (TYPE_NEEDS_CONSTRUCTING (type))
346 /* This is a class that needs constructing, but doesn't have
347 a user-provided constructor. So we need to zero-initialize
348 the object and then call the implicitly defined ctor.
349 This will be handled in simplify_aggr_init_expr. */
350 tree ctor = build_special_member_call
351 (NULL_TREE, complete_ctor_identifier,
352 NULL, type, LOOKUP_NORMAL, complain);
353 if (ctor != error_mark_node)
355 ctor = build_aggr_init_expr (type, ctor, complain);
356 AGGR_INIT_ZERO_FIRST (ctor) = 1;
361 return build_value_init_noctor (type, complain);
364 /* Like build_value_init, but don't call the constructor for TYPE. Used
365 for base initializers. */
368 build_value_init_noctor (tree type, tsubst_flags_t complain)
370 /* FIXME the class and array cases should just use digest_init once it is
372 if (CLASS_TYPE_P (type))
374 gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type));
376 if (TREE_CODE (type) != UNION_TYPE)
379 VEC(constructor_elt,gc) *v = NULL;
381 /* Iterate over the fields, building initializations. */
382 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
386 if (TREE_CODE (field) != FIELD_DECL)
389 ftype = TREE_TYPE (field);
391 /* We could skip vfields and fields of types with
392 user-defined constructors, but I think that won't improve
393 performance at all; it should be simpler in general just
394 to zero out the entire object than try to only zero the
395 bits that actually need it. */
397 /* Note that for class types there will be FIELD_DECLs
398 corresponding to base classes as well. Thus, iterating
399 over TYPE_FIELDs will result in correct initialization of
400 all of the subobjects. */
401 value = build_value_init (ftype, complain);
403 if (value == error_mark_node)
404 return error_mark_node;
407 CONSTRUCTOR_APPEND_ELT(v, field, value);
410 /* Build a constructor to contain the zero- initializations. */
411 return build_constructor (type, v);
414 else if (TREE_CODE (type) == ARRAY_TYPE)
416 VEC(constructor_elt,gc) *v = NULL;
418 /* Iterate over the array elements, building initializations. */
419 tree max_index = array_type_nelts (type);
421 /* If we have an error_mark here, we should just return error mark
422 as we don't know the size of the array yet. */
423 if (max_index == error_mark_node)
425 if (complain & tf_error)
426 error ("cannot value-initialize array of unknown bound %qT",
428 return error_mark_node;
430 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
432 /* A zero-sized array, which is accepted as an extension, will
433 have an upper bound of -1. */
434 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
438 v = VEC_alloc (constructor_elt, gc, 1);
439 ce = VEC_quick_push (constructor_elt, v, NULL);
441 /* If this is a one element array, we just use a regular init. */
442 if (tree_int_cst_equal (size_zero_node, max_index))
443 ce->index = size_zero_node;
445 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
448 ce->value = build_value_init (TREE_TYPE (type), complain);
450 if (ce->value == error_mark_node)
451 return error_mark_node;
453 /* We shouldn't have gotten here for anything that would need
454 non-trivial initialization, and gimplify_init_ctor_preeval
455 would need to be fixed to allow it. */
456 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR
457 && TREE_CODE (ce->value) != AGGR_INIT_EXPR);
460 /* Build a constructor to contain the initializations. */
461 return build_constructor (type, v);
463 else if (TREE_CODE (type) == FUNCTION_TYPE)
465 if (complain & tf_error)
466 error ("value-initialization of function type %qT", type);
467 return error_mark_node;
469 else if (TREE_CODE (type) == REFERENCE_TYPE)
471 if (complain & tf_error)
472 error ("value-initialization of reference type %qT", type);
473 return error_mark_node;
476 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
479 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
480 arguments. If TREE_LIST is void_type_node, an empty initializer
481 list was given; if NULL_TREE no initializer was given. */
484 perform_member_init (tree member, tree init)
487 tree type = TREE_TYPE (member);
489 /* Effective C++ rule 12 requires that all data members be
491 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE)
492 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__,
493 "%qD should be initialized in the member initialization list",
496 /* Get an lvalue for the data member. */
497 decl = build_class_member_access_expr (current_class_ref, member,
498 /*access_path=*/NULL_TREE,
499 /*preserve_reference=*/true,
500 tf_warning_or_error);
501 if (decl == error_mark_node)
504 if (init == void_type_node)
506 /* mem() means value-initialization. */
507 if (TREE_CODE (type) == ARRAY_TYPE)
509 init = build_vec_init_expr (type, init, tf_warning_or_error);
510 init = build2 (INIT_EXPR, type, decl, init);
511 finish_expr_stmt (init);
515 tree value = build_value_init (type, tf_warning_or_error);
516 if (value == error_mark_node)
518 init = build2 (INIT_EXPR, type, decl, value);
519 finish_expr_stmt (init);
522 /* Deal with this here, as we will get confused if we try to call the
523 assignment op for an anonymous union. This can happen in a
524 synthesized copy constructor. */
525 else if (ANON_AGGR_TYPE_P (type))
529 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
530 finish_expr_stmt (init);
533 else if (TYPE_NEEDS_CONSTRUCTING (type))
535 if (TREE_CODE (type) == ARRAY_TYPE)
539 gcc_assert (TREE_CHAIN (init) == NULL_TREE);
540 init = TREE_VALUE (init);
542 if (init == NULL_TREE
543 || same_type_ignoring_top_level_qualifiers_p (type,
546 init = build_vec_init_expr (type, init, tf_warning_or_error);
547 init = build2 (INIT_EXPR, type, decl, init);
548 finish_expr_stmt (init);
551 error ("invalid initializer for array member %q#D", member);
555 int flags = LOOKUP_NORMAL;
556 if (DECL_DEFAULTED_FN (current_function_decl))
557 flags |= LOOKUP_DEFAULTED;
558 if (CP_TYPE_CONST_P (type)
560 && !type_has_user_provided_default_constructor (type))
561 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
562 vtable; still give this diagnostic. */
563 permerror (DECL_SOURCE_LOCATION (current_function_decl),
564 "uninitialized member %qD with %<const%> type %qT",
566 finish_expr_stmt (build_aggr_init (decl, init, flags,
567 tf_warning_or_error));
572 if (init == NULL_TREE)
575 /* member traversal: note it leaves init NULL */
576 if (TREE_CODE (type) == REFERENCE_TYPE)
577 permerror (DECL_SOURCE_LOCATION (current_function_decl),
578 "uninitialized reference member %qD",
580 else if (CP_TYPE_CONST_P (type))
581 permerror (DECL_SOURCE_LOCATION (current_function_decl),
582 "uninitialized member %qD with %<const%> type %qT",
585 core_type = strip_array_types (type);
587 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
588 && !type_has_constexpr_default_constructor (core_type))
590 if (!DECL_TEMPLATE_INSTANTIATION (current_function_decl))
591 error ("uninitialized member %qD in %<constexpr%> constructor",
593 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
596 if (CLASS_TYPE_P (core_type)
597 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)
598 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)))
599 diagnose_uninitialized_cst_or_ref_member (core_type,
603 else if (TREE_CODE (init) == TREE_LIST)
604 /* There was an explicit member initialization. Do some work
606 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT,
607 tf_warning_or_error);
610 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
611 tf_warning_or_error));
614 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
618 expr = build_class_member_access_expr (current_class_ref, member,
619 /*access_path=*/NULL_TREE,
620 /*preserve_reference=*/false,
621 tf_warning_or_error);
622 expr = build_delete (type, expr, sfk_complete_destructor,
623 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0,
624 tf_warning_or_error);
626 if (expr != error_mark_node)
627 finish_eh_cleanup (expr);
631 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
632 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
635 build_field_list (tree t, tree list, int *uses_unions_p)
641 /* Note whether or not T is a union. */
642 if (TREE_CODE (t) == UNION_TYPE)
645 for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields))
649 /* Skip CONST_DECLs for enumeration constants and so forth. */
650 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
653 fieldtype = TREE_TYPE (fields);
654 /* Keep track of whether or not any fields are unions. */
655 if (TREE_CODE (fieldtype) == UNION_TYPE)
658 /* For an anonymous struct or union, we must recursively
659 consider the fields of the anonymous type. They can be
660 directly initialized from the constructor. */
661 if (ANON_AGGR_TYPE_P (fieldtype))
663 /* Add this field itself. Synthesized copy constructors
664 initialize the entire aggregate. */
665 list = tree_cons (fields, NULL_TREE, list);
666 /* And now add the fields in the anonymous aggregate. */
667 list = build_field_list (fieldtype, list, uses_unions_p);
669 /* Add this field. */
670 else if (DECL_NAME (fields))
671 list = tree_cons (fields, NULL_TREE, list);
677 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
678 a FIELD_DECL or BINFO in T that needs initialization. The
679 TREE_VALUE gives the initializer, or list of initializer arguments.
681 Return a TREE_LIST containing all of the initializations required
682 for T, in the order in which they should be performed. The output
683 list has the same format as the input. */
686 sort_mem_initializers (tree t, tree mem_inits)
689 tree base, binfo, base_binfo;
692 VEC(tree,gc) *vbases;
696 /* Build up a list of initializations. The TREE_PURPOSE of entry
697 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
698 TREE_VALUE will be the constructor arguments, or NULL if no
699 explicit initialization was provided. */
700 sorted_inits = NULL_TREE;
702 /* Process the virtual bases. */
703 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
704 VEC_iterate (tree, vbases, i, base); i++)
705 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
707 /* Process the direct bases. */
708 for (binfo = TYPE_BINFO (t), i = 0;
709 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
710 if (!BINFO_VIRTUAL_P (base_binfo))
711 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
713 /* Process the non-static data members. */
714 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
715 /* Reverse the entire list of initializations, so that they are in
716 the order that they will actually be performed. */
717 sorted_inits = nreverse (sorted_inits);
719 /* If the user presented the initializers in an order different from
720 that in which they will actually occur, we issue a warning. Keep
721 track of the next subobject which can be explicitly initialized
722 without issuing a warning. */
723 next_subobject = sorted_inits;
725 /* Go through the explicit initializers, filling in TREE_PURPOSE in
727 for (init = mem_inits; init; init = TREE_CHAIN (init))
732 subobject = TREE_PURPOSE (init);
734 /* If the explicit initializers are in sorted order, then
735 SUBOBJECT will be NEXT_SUBOBJECT, or something following
737 for (subobject_init = next_subobject;
739 subobject_init = TREE_CHAIN (subobject_init))
740 if (TREE_PURPOSE (subobject_init) == subobject)
743 /* Issue a warning if the explicit initializer order does not
744 match that which will actually occur.
745 ??? Are all these on the correct lines? */
746 if (warn_reorder && !subobject_init)
748 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
749 warning (OPT_Wreorder, "%q+D will be initialized after",
750 TREE_PURPOSE (next_subobject));
752 warning (OPT_Wreorder, "base %qT will be initialized after",
753 TREE_PURPOSE (next_subobject));
754 if (TREE_CODE (subobject) == FIELD_DECL)
755 warning (OPT_Wreorder, " %q+#D", subobject);
757 warning (OPT_Wreorder, " base %qT", subobject);
758 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
759 OPT_Wreorder, " when initialized here");
762 /* Look again, from the beginning of the list. */
765 subobject_init = sorted_inits;
766 while (TREE_PURPOSE (subobject_init) != subobject)
767 subobject_init = TREE_CHAIN (subobject_init);
770 /* It is invalid to initialize the same subobject more than
772 if (TREE_VALUE (subobject_init))
774 if (TREE_CODE (subobject) == FIELD_DECL)
775 error_at (DECL_SOURCE_LOCATION (current_function_decl),
776 "multiple initializations given for %qD",
779 error_at (DECL_SOURCE_LOCATION (current_function_decl),
780 "multiple initializations given for base %qT",
784 /* Record the initialization. */
785 TREE_VALUE (subobject_init) = TREE_VALUE (init);
786 next_subobject = subobject_init;
791 If a ctor-initializer specifies more than one mem-initializer for
792 multiple members of the same union (including members of
793 anonymous unions), the ctor-initializer is ill-formed.
795 Here we also splice out uninitialized union members. */
798 tree last_field = NULL_TREE;
800 for (p = &sorted_inits; *p; )
808 field = TREE_PURPOSE (init);
810 /* Skip base classes. */
811 if (TREE_CODE (field) != FIELD_DECL)
814 /* If this is an anonymous union with no explicit initializer,
816 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field)))
819 /* See if this field is a member of a union, or a member of a
820 structure contained in a union, etc. */
821 for (ctx = DECL_CONTEXT (field);
822 !same_type_p (ctx, t);
823 ctx = TYPE_CONTEXT (ctx))
824 if (TREE_CODE (ctx) == UNION_TYPE)
826 /* If this field is not a member of a union, skip it. */
827 if (TREE_CODE (ctx) != UNION_TYPE)
830 /* If this union member has no explicit initializer, splice
832 if (!TREE_VALUE (init))
835 /* It's only an error if we have two initializers for the same
843 /* See if LAST_FIELD and the field initialized by INIT are
844 members of the same union. If so, there's a problem,
845 unless they're actually members of the same structure
846 which is itself a member of a union. For example, given:
848 union { struct { int i; int j; }; };
850 initializing both `i' and `j' makes sense. */
851 ctx = DECL_CONTEXT (field);
857 last_ctx = DECL_CONTEXT (last_field);
860 if (same_type_p (last_ctx, ctx))
862 if (TREE_CODE (ctx) == UNION_TYPE)
863 error_at (DECL_SOURCE_LOCATION (current_function_decl),
864 "initializations for multiple members of %qT",
870 if (same_type_p (last_ctx, t))
873 last_ctx = TYPE_CONTEXT (last_ctx);
876 /* If we've reached the outermost class, then we're
878 if (same_type_p (ctx, t))
881 ctx = TYPE_CONTEXT (ctx);
888 p = &TREE_CHAIN (*p);
891 *p = TREE_CHAIN (*p);
899 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
900 is a TREE_LIST giving the explicit mem-initializer-list for the
901 constructor. The TREE_PURPOSE of each entry is a subobject (a
902 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
903 is a TREE_LIST giving the arguments to the constructor or
904 void_type_node for an empty list of arguments. */
907 emit_mem_initializers (tree mem_inits)
909 int flags = LOOKUP_NORMAL;
911 /* We will already have issued an error message about the fact that
912 the type is incomplete. */
913 if (!COMPLETE_TYPE_P (current_class_type))
916 if (DECL_DEFAULTED_FN (current_function_decl))
917 flags |= LOOKUP_DEFAULTED;
919 /* Sort the mem-initializers into the order in which the
920 initializations should be performed. */
921 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
923 in_base_initializer = 1;
925 /* Initialize base classes. */
927 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
929 tree subobject = TREE_PURPOSE (mem_inits);
930 tree arguments = TREE_VALUE (mem_inits);
932 if (arguments == NULL_TREE)
934 /* If these initializations are taking place in a copy constructor,
935 the base class should probably be explicitly initialized if there
936 is a user-defined constructor in the base class (other than the
937 default constructor, which will be called anyway). */
939 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
940 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
941 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
942 OPT_Wextra, "base class %q#T should be explicitly "
943 "initialized in the copy constructor",
944 BINFO_TYPE (subobject));
946 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
947 && !(type_has_constexpr_default_constructor
948 (BINFO_TYPE (subobject))))
950 if (!DECL_TEMPLATE_INSTANTIATION (current_function_decl))
951 error ("uninitialized base %qT in %<constexpr%> constructor",
952 BINFO_TYPE (subobject));
953 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
957 /* Initialize the base. */
958 if (BINFO_VIRTUAL_P (subobject))
959 construct_virtual_base (subobject, arguments);
964 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
966 expand_aggr_init_1 (subobject, NULL_TREE,
967 cp_build_indirect_ref (base_addr, RO_NULL,
968 tf_warning_or_error),
971 tf_warning_or_error);
972 expand_cleanup_for_base (subobject, NULL_TREE);
975 mem_inits = TREE_CHAIN (mem_inits);
977 in_base_initializer = 0;
979 /* Initialize the vptrs. */
980 initialize_vtbl_ptrs (current_class_ptr);
982 /* Initialize the data members. */
985 perform_member_init (TREE_PURPOSE (mem_inits),
986 TREE_VALUE (mem_inits));
987 mem_inits = TREE_CHAIN (mem_inits);
991 /* Returns the address of the vtable (i.e., the value that should be
992 assigned to the vptr) for BINFO. */
995 build_vtbl_address (tree binfo)
997 tree binfo_for = binfo;
1000 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
1001 /* If this is a virtual primary base, then the vtable we want to store
1002 is that for the base this is being used as the primary base of. We
1003 can't simply skip the initialization, because we may be expanding the
1004 inits of a subobject constructor where the virtual base layout
1005 can be different. */
1006 while (BINFO_PRIMARY_P (binfo_for))
1007 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
1009 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1011 vtbl = get_vtbl_decl_for_binfo (binfo_for);
1012 TREE_USED (vtbl) = 1;
1014 /* Now compute the address to use when initializing the vptr. */
1015 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
1016 if (TREE_CODE (vtbl) == VAR_DECL)
1017 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
1022 /* This code sets up the virtual function tables appropriate for
1023 the pointer DECL. It is a one-ply initialization.
1025 BINFO is the exact type that DECL is supposed to be. In
1026 multiple inheritance, this might mean "C's A" if C : A, B. */
1029 expand_virtual_init (tree binfo, tree decl)
1031 tree vtbl, vtbl_ptr;
1034 /* Compute the initializer for vptr. */
1035 vtbl = build_vtbl_address (binfo);
1037 /* We may get this vptr from a VTT, if this is a subobject
1038 constructor or subobject destructor. */
1039 vtt_index = BINFO_VPTR_INDEX (binfo);
1045 /* Compute the value to use, when there's a VTT. */
1046 vtt_parm = current_vtt_parm;
1047 vtbl2 = build2 (POINTER_PLUS_EXPR,
1048 TREE_TYPE (vtt_parm),
1051 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error);
1052 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
1054 /* The actual initializer is the VTT value only in the subobject
1055 constructor. In maybe_clone_body we'll substitute NULL for
1056 the vtt_parm in the case of the non-subobject constructor. */
1057 vtbl = build3 (COND_EXPR,
1059 build2 (EQ_EXPR, boolean_type_node,
1060 current_in_charge_parm, integer_zero_node),
1065 /* Compute the location of the vtpr. */
1066 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL,
1067 tf_warning_or_error),
1069 gcc_assert (vtbl_ptr != error_mark_node);
1071 /* Assign the vtable to the vptr. */
1072 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
1073 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
1074 tf_warning_or_error));
1077 /* If an exception is thrown in a constructor, those base classes already
1078 constructed must be destroyed. This function creates the cleanup
1079 for BINFO, which has just been constructed. If FLAG is non-NULL,
1080 it is a DECL which is nonzero when this base needs to be
1084 expand_cleanup_for_base (tree binfo, tree flag)
1088 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
1091 /* Call the destructor. */
1092 expr = build_special_member_call (current_class_ref,
1093 base_dtor_identifier,
1096 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
1097 tf_warning_or_error);
1099 expr = fold_build3_loc (input_location,
1100 COND_EXPR, void_type_node,
1101 c_common_truthvalue_conversion (input_location, flag),
1102 expr, integer_zero_node);
1104 finish_eh_cleanup (expr);
1107 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1111 construct_virtual_base (tree vbase, tree arguments)
1117 /* If there are virtual base classes with destructors, we need to
1118 emit cleanups to destroy them if an exception is thrown during
1119 the construction process. These exception regions (i.e., the
1120 period during which the cleanups must occur) begin from the time
1121 the construction is complete to the end of the function. If we
1122 create a conditional block in which to initialize the
1123 base-classes, then the cleanup region for the virtual base begins
1124 inside a block, and ends outside of that block. This situation
1125 confuses the sjlj exception-handling code. Therefore, we do not
1126 create a single conditional block, but one for each
1127 initialization. (That way the cleanup regions always begin
1128 in the outer block.) We trust the back end to figure out
1129 that the FLAG will not change across initializations, and
1130 avoid doing multiple tests. */
1131 flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl));
1132 inner_if_stmt = begin_if_stmt ();
1133 finish_if_stmt_cond (flag, inner_if_stmt);
1135 /* Compute the location of the virtual base. If we're
1136 constructing virtual bases, then we must be the most derived
1137 class. Therefore, we don't have to look up the virtual base;
1138 we already know where it is. */
1139 exp = convert_to_base_statically (current_class_ref, vbase);
1141 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1142 LOOKUP_COMPLAIN, tf_warning_or_error);
1143 finish_then_clause (inner_if_stmt);
1144 finish_if_stmt (inner_if_stmt);
1146 expand_cleanup_for_base (vbase, flag);
1149 /* Find the context in which this FIELD can be initialized. */
1152 initializing_context (tree field)
1154 tree t = DECL_CONTEXT (field);
1156 /* Anonymous union members can be initialized in the first enclosing
1157 non-anonymous union context. */
1158 while (t && ANON_AGGR_TYPE_P (t))
1159 t = TYPE_CONTEXT (t);
1163 /* Function to give error message if member initialization specification
1164 is erroneous. FIELD is the member we decided to initialize.
1165 TYPE is the type for which the initialization is being performed.
1166 FIELD must be a member of TYPE.
1168 MEMBER_NAME is the name of the member. */
1171 member_init_ok_or_else (tree field, tree type, tree member_name)
1173 if (field == error_mark_node)
1177 error ("class %qT does not have any field named %qD", type,
1181 if (TREE_CODE (field) == VAR_DECL)
1183 error ("%q#D is a static data member; it can only be "
1184 "initialized at its definition",
1188 if (TREE_CODE (field) != FIELD_DECL)
1190 error ("%q#D is not a non-static data member of %qT",
1194 if (initializing_context (field) != type)
1196 error ("class %qT does not have any field named %qD", type,
1204 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1205 is a _TYPE node or TYPE_DECL which names a base for that type.
1206 Check the validity of NAME, and return either the base _TYPE, base
1207 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1208 NULL_TREE and issue a diagnostic.
1210 An old style unnamed direct single base construction is permitted,
1211 where NAME is NULL. */
1214 expand_member_init (tree name)
1219 if (!current_class_ref)
1224 /* This is an obsolete unnamed base class initializer. The
1225 parser will already have warned about its use. */
1226 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1229 error ("unnamed initializer for %qT, which has no base classes",
1230 current_class_type);
1233 basetype = BINFO_TYPE
1234 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1237 error ("unnamed initializer for %qT, which uses multiple inheritance",
1238 current_class_type);
1242 else if (TYPE_P (name))
1244 basetype = TYPE_MAIN_VARIANT (name);
1245 name = TYPE_NAME (name);
1247 else if (TREE_CODE (name) == TYPE_DECL)
1248 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1250 basetype = NULL_TREE;
1259 if (current_template_parms)
1262 class_binfo = TYPE_BINFO (current_class_type);
1263 direct_binfo = NULL_TREE;
1264 virtual_binfo = NULL_TREE;
1266 /* Look for a direct base. */
1267 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1268 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1271 /* Look for a virtual base -- unless the direct base is itself
1273 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1274 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1276 /* [class.base.init]
1278 If a mem-initializer-id is ambiguous because it designates
1279 both a direct non-virtual base class and an inherited virtual
1280 base class, the mem-initializer is ill-formed. */
1281 if (direct_binfo && virtual_binfo)
1283 error ("%qD is both a direct base and an indirect virtual base",
1288 if (!direct_binfo && !virtual_binfo)
1290 if (CLASSTYPE_VBASECLASSES (current_class_type))
1291 error ("type %qT is not a direct or virtual base of %qT",
1292 basetype, current_class_type);
1294 error ("type %qT is not a direct base of %qT",
1295 basetype, current_class_type);
1299 return direct_binfo ? direct_binfo : virtual_binfo;
1303 if (TREE_CODE (name) == IDENTIFIER_NODE)
1304 field = lookup_field (current_class_type, name, 1, false);
1308 if (member_init_ok_or_else (field, current_class_type, name))
1315 /* This is like `expand_member_init', only it stores one aggregate
1318 INIT comes in two flavors: it is either a value which
1319 is to be stored in EXP, or it is a parameter list
1320 to go to a constructor, which will operate on EXP.
1321 If INIT is not a parameter list for a constructor, then set
1322 LOOKUP_ONLYCONVERTING.
1323 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1324 the initializer, if FLAGS is 0, then it is the (init) form.
1325 If `init' is a CONSTRUCTOR, then we emit a warning message,
1326 explaining that such initializations are invalid.
1328 If INIT resolves to a CALL_EXPR which happens to return
1329 something of the type we are looking for, then we know
1330 that we can safely use that call to perform the
1333 The virtual function table pointer cannot be set up here, because
1334 we do not really know its type.
1336 This never calls operator=().
1338 When initializing, nothing is CONST.
1340 A default copy constructor may have to be used to perform the
1343 A constructor or a conversion operator may have to be used to
1344 perform the initialization, but not both, as it would be ambiguous. */
1347 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1352 tree type = TREE_TYPE (exp);
1353 int was_const = TREE_READONLY (exp);
1354 int was_volatile = TREE_THIS_VOLATILE (exp);
1357 if (init == error_mark_node)
1358 return error_mark_node;
1360 TREE_READONLY (exp) = 0;
1361 TREE_THIS_VOLATILE (exp) = 0;
1363 if (init && TREE_CODE (init) != TREE_LIST
1364 && !(BRACE_ENCLOSED_INITIALIZER_P (init)
1365 && CONSTRUCTOR_IS_DIRECT_INIT (init)))
1366 flags |= LOOKUP_ONLYCONVERTING;
1368 if (TREE_CODE (type) == ARRAY_TYPE)
1372 /* An array may not be initialized use the parenthesized
1373 initialization form -- unless the initializer is "()". */
1374 if (init && TREE_CODE (init) == TREE_LIST)
1376 if (complain & tf_error)
1377 error ("bad array initializer");
1378 return error_mark_node;
1380 /* Must arrange to initialize each element of EXP
1381 from elements of INIT. */
1382 itype = init ? TREE_TYPE (init) : NULL_TREE;
1383 if (cv_qualified_p (type))
1384 TREE_TYPE (exp) = cv_unqualified (type);
1385 if (itype && cv_qualified_p (itype))
1386 TREE_TYPE (init) = cv_unqualified (itype);
1387 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1388 /*explicit_value_init_p=*/false,
1389 itype && same_type_p (TREE_TYPE (init),
1392 TREE_READONLY (exp) = was_const;
1393 TREE_THIS_VOLATILE (exp) = was_volatile;
1394 TREE_TYPE (exp) = type;
1396 TREE_TYPE (init) = itype;
1400 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1401 /* Just know that we've seen something for this node. */
1402 TREE_USED (exp) = 1;
1404 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1405 destroy_temps = stmts_are_full_exprs_p ();
1406 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1407 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1408 init, LOOKUP_NORMAL|flags, complain);
1409 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1410 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1411 TREE_READONLY (exp) = was_const;
1412 TREE_THIS_VOLATILE (exp) = was_volatile;
1418 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1419 tsubst_flags_t complain)
1421 tree type = TREE_TYPE (exp);
1424 /* It fails because there may not be a constructor which takes
1425 its own type as the first (or only parameter), but which does
1426 take other types via a conversion. So, if the thing initializing
1427 the expression is a unit element of type X, first try X(X&),
1428 followed by initialization by X. If neither of these work
1429 out, then look hard. */
1431 VEC(tree,gc) *parms;
1433 if (init && BRACE_ENCLOSED_INITIALIZER_P (init)
1434 && CP_AGGREGATE_TYPE_P (type))
1436 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1437 happen for direct-initialization, too. */
1438 init = digest_init (type, init, complain);
1439 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1440 TREE_SIDE_EFFECTS (init) = 1;
1441 finish_expr_stmt (init);
1445 if (init && TREE_CODE (init) != TREE_LIST
1446 && (flags & LOOKUP_ONLYCONVERTING))
1448 /* Base subobjects should only get direct-initialization. */
1449 gcc_assert (true_exp == exp);
1451 if (flags & DIRECT_BIND)
1452 /* Do nothing. We hit this in two cases: Reference initialization,
1453 where we aren't initializing a real variable, so we don't want
1454 to run a new constructor; and catching an exception, where we
1455 have already built up the constructor call so we could wrap it
1456 in an exception region. */;
1458 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1460 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1461 /* We need to protect the initialization of a catch parm with a
1462 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1463 around the TARGET_EXPR for the copy constructor. See
1464 initialize_handler_parm. */
1466 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1467 TREE_OPERAND (init, 0));
1468 TREE_TYPE (init) = void_type_node;
1471 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1472 TREE_SIDE_EFFECTS (init) = 1;
1473 finish_expr_stmt (init);
1477 if (init == NULL_TREE)
1479 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1481 parms = make_tree_vector ();
1482 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1483 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1486 parms = make_tree_vector_single (init);
1488 if (true_exp == exp)
1489 ctor_name = complete_ctor_identifier;
1491 ctor_name = base_ctor_identifier;
1493 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1497 release_tree_vector (parms);
1499 if (exp == true_exp && TREE_CODE (rval) == CALL_EXPR)
1501 tree fn = get_callee_fndecl (rval);
1502 if (fn && DECL_DECLARED_CONSTEXPR_P (fn))
1504 tree e = maybe_constant_value (rval);
1505 if (TREE_CONSTANT (e))
1506 rval = build2 (INIT_EXPR, type, exp, e);
1510 /* FIXME put back convert_to_void? */
1511 if (TREE_SIDE_EFFECTS (rval))
1512 finish_expr_stmt (rval);
1515 /* This function is responsible for initializing EXP with INIT
1518 BINFO is the binfo of the type for who we are performing the
1519 initialization. For example, if W is a virtual base class of A and B,
1521 If we are initializing B, then W must contain B's W vtable, whereas
1522 were we initializing C, W must contain C's W vtable.
1524 TRUE_EXP is nonzero if it is the true expression being initialized.
1525 In this case, it may be EXP, or may just contain EXP. The reason we
1526 need this is because if EXP is a base element of TRUE_EXP, we
1527 don't necessarily know by looking at EXP where its virtual
1528 baseclass fields should really be pointing. But we do know
1529 from TRUE_EXP. In constructors, we don't know anything about
1530 the value being initialized.
1532 FLAGS is just passed to `build_new_method_call'. See that function
1533 for its description. */
1536 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1537 tsubst_flags_t complain)
1539 tree type = TREE_TYPE (exp);
1541 gcc_assert (init != error_mark_node && type != error_mark_node);
1542 gcc_assert (building_stmt_tree ());
1544 /* Use a function returning the desired type to initialize EXP for us.
1545 If the function is a constructor, and its first argument is
1546 NULL_TREE, know that it was meant for us--just slide exp on
1547 in and expand the constructor. Constructors now come
1550 if (init && TREE_CODE (exp) == VAR_DECL
1551 && COMPOUND_LITERAL_P (init))
1553 /* If store_init_value returns NULL_TREE, the INIT has been
1554 recorded as the DECL_INITIAL for EXP. That means there's
1555 nothing more we have to do. */
1556 init = store_init_value (exp, init, flags);
1558 finish_expr_stmt (init);
1562 /* If an explicit -- but empty -- initializer list was present,
1563 that's value-initialization. */
1564 if (init == void_type_node)
1566 /* If there's a user-provided constructor, we just call that. */
1567 if (type_has_user_provided_constructor (type))
1568 /* Fall through. */;
1569 /* If there isn't, but we still need to call the constructor,
1570 zero out the object first. */
1571 else if (TYPE_NEEDS_CONSTRUCTING (type))
1573 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1574 init = build2 (INIT_EXPR, type, exp, init);
1575 finish_expr_stmt (init);
1576 /* And then call the constructor. */
1578 /* If we don't need to mess with the constructor at all,
1579 then just zero out the object and we're done. */
1582 init = build2 (INIT_EXPR, type, exp,
1583 build_value_init_noctor (type, complain));
1584 finish_expr_stmt (init);
1590 /* We know that expand_default_init can handle everything we want
1592 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1595 /* Report an error if TYPE is not a user-defined, class type. If
1596 OR_ELSE is nonzero, give an error message. */
1599 is_class_type (tree type, int or_else)
1601 if (type == error_mark_node)
1604 if (! CLASS_TYPE_P (type))
1607 error ("%qT is not a class type", type);
1614 get_type_value (tree name)
1616 if (name == error_mark_node)
1619 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1620 return IDENTIFIER_TYPE_VALUE (name);
1625 /* Build a reference to a member of an aggregate. This is not a C++
1626 `&', but really something which can have its address taken, and
1627 then act as a pointer to member, for example TYPE :: FIELD can have
1628 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1629 this expression is the operand of "&".
1631 @@ Prints out lousy diagnostics for operator <typename>
1634 @@ This function should be rewritten and placed in search.c. */
1637 build_offset_ref (tree type, tree member, bool address_p)
1640 tree basebinfo = NULL_TREE;
1642 /* class templates can come in as TEMPLATE_DECLs here. */
1643 if (TREE_CODE (member) == TEMPLATE_DECL)
1646 if (dependent_scope_p (type) || type_dependent_expression_p (member))
1647 return build_qualified_name (NULL_TREE, type, member,
1648 /*template_p=*/false);
1650 gcc_assert (TYPE_P (type));
1651 if (! is_class_type (type, 1))
1652 return error_mark_node;
1654 gcc_assert (DECL_P (member) || BASELINK_P (member));
1655 /* Callers should call mark_used before this point. */
1656 gcc_assert (!DECL_P (member) || TREE_USED (member));
1658 type = TYPE_MAIN_VARIANT (type);
1659 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type)))
1661 error ("incomplete type %qT does not have member %qD", type, member);
1662 return error_mark_node;
1665 /* Entities other than non-static members need no further
1667 if (TREE_CODE (member) == TYPE_DECL)
1669 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1670 return convert_from_reference (member);
1672 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1674 error ("invalid pointer to bit-field %qD", member);
1675 return error_mark_node;
1678 /* Set up BASEBINFO for member lookup. */
1679 decl = maybe_dummy_object (type, &basebinfo);
1681 /* A lot of this logic is now handled in lookup_member. */
1682 if (BASELINK_P (member))
1684 /* Go from the TREE_BASELINK to the member function info. */
1685 tree t = BASELINK_FUNCTIONS (member);
1687 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1689 /* Get rid of a potential OVERLOAD around it. */
1690 t = OVL_CURRENT (t);
1692 /* Unique functions are handled easily. */
1694 /* For non-static member of base class, we need a special rule
1695 for access checking [class.protected]:
1697 If the access is to form a pointer to member, the
1698 nested-name-specifier shall name the derived class
1699 (or any class derived from that class). */
1700 if (address_p && DECL_P (t)
1701 && DECL_NONSTATIC_MEMBER_P (t))
1702 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1704 perform_or_defer_access_check (basebinfo, t, t);
1706 if (DECL_STATIC_FUNCTION_P (t))
1711 TREE_TYPE (member) = unknown_type_node;
1713 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1714 /* We need additional test besides the one in
1715 check_accessibility_of_qualified_id in case it is
1716 a pointer to non-static member. */
1717 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1721 /* If MEMBER is non-static, then the program has fallen afoul of
1724 An id-expression that denotes a nonstatic data member or
1725 nonstatic member function of a class can only be used:
1727 -- as part of a class member access (_expr.ref_) in which the
1728 object-expression refers to the member's class or a class
1729 derived from that class, or
1731 -- to form a pointer to member (_expr.unary.op_), or
1733 -- in the body of a nonstatic member function of that class or
1734 of a class derived from that class (_class.mfct.nonstatic_), or
1736 -- in a mem-initializer for a constructor for that class or for
1737 a class derived from that class (_class.base.init_). */
1738 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1740 /* Build a representation of the qualified name suitable
1741 for use as the operand to "&" -- even though the "&" is
1742 not actually present. */
1743 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1744 /* In Microsoft mode, treat a non-static member function as if
1745 it were a pointer-to-member. */
1746 if (flag_ms_extensions)
1748 PTRMEM_OK_P (member) = 1;
1749 return cp_build_addr_expr (member, tf_warning_or_error);
1751 error ("invalid use of non-static member function %qD",
1752 TREE_OPERAND (member, 1));
1753 return error_mark_node;
1755 else if (TREE_CODE (member) == FIELD_DECL)
1757 error ("invalid use of non-static data member %qD", member);
1758 return error_mark_node;
1763 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1764 PTRMEM_OK_P (member) = 1;
1768 /* If DECL is a scalar enumeration constant or variable with a
1769 constant initializer, return the initializer (or, its initializers,
1770 recursively); otherwise, return DECL. If INTEGRAL_P, the
1771 initializer is only returned if DECL is an integral
1772 constant-expression. */
1775 constant_value_1 (tree decl, bool integral_p)
1777 while (TREE_CODE (decl) == CONST_DECL
1779 ? decl_constant_var_p (decl)
1780 : (TREE_CODE (decl) == VAR_DECL
1781 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1784 /* If DECL is a static data member in a template
1785 specialization, we must instantiate it here. The
1786 initializer for the static data member is not processed
1787 until needed; we need it now. */
1789 mark_rvalue_use (decl);
1790 init = DECL_INITIAL (decl);
1791 if (init == error_mark_node)
1793 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
1794 /* Treat the error as a constant to avoid cascading errors on
1795 excessively recursive template instantiation (c++/9335). */
1800 /* Initializers in templates are generally expanded during
1801 instantiation, so before that for const int i(2)
1802 INIT is a TREE_LIST with the actual initializer as
1804 if (processing_template_decl
1806 && TREE_CODE (init) == TREE_LIST
1807 && TREE_CHAIN (init) == NULL_TREE)
1808 init = TREE_VALUE (init);
1810 || !TREE_TYPE (init)
1811 || !TREE_CONSTANT (init)
1813 /* Do not return an aggregate constant (of which
1814 string literals are a special case), as we do not
1815 want to make inadvertent copies of such entities,
1816 and we must be sure that their addresses are the
1818 && (TREE_CODE (init) == CONSTRUCTOR
1819 || TREE_CODE (init) == STRING_CST)))
1821 decl = unshare_expr (init);
1826 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1827 constant of integral or enumeration type, then return that value.
1828 These are those variables permitted in constant expressions by
1832 integral_constant_value (tree decl)
1834 return constant_value_1 (decl, /*integral_p=*/true);
1837 /* A more relaxed version of integral_constant_value, used by the
1838 common C/C++ code and by the C++ front end for optimization
1842 decl_constant_value (tree decl)
1844 return constant_value_1 (decl,
1845 /*integral_p=*/processing_template_decl);
1848 /* Common subroutines of build_new and build_vec_delete. */
1850 /* Call the global __builtin_delete to delete ADDR. */
1853 build_builtin_delete_call (tree addr)
1855 mark_used (global_delete_fndecl);
1856 return build_call_n (global_delete_fndecl, 1, addr);
1859 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1860 the type of the object being allocated; otherwise, it's just TYPE.
1861 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1862 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1863 a vector of arguments to be provided as arguments to a placement
1864 new operator. This routine performs no semantic checks; it just
1865 creates and returns a NEW_EXPR. */
1868 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1869 VEC(tree,gc) *init, int use_global_new)
1874 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1875 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1876 permits us to distinguish the case of a missing initializer "new
1877 int" from an empty initializer "new int()". */
1879 init_list = NULL_TREE;
1880 else if (VEC_empty (tree, init))
1881 init_list = void_zero_node;
1883 init_list = build_tree_list_vec (init);
1885 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1886 build_tree_list_vec (placement), type, nelts,
1888 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1889 TREE_SIDE_EFFECTS (new_expr) = 1;
1894 /* Diagnose uninitialized const members or reference members of type
1895 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1896 new expression without a new-initializer and a declaration. Returns
1900 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin,
1901 bool using_new, bool complain)
1904 int error_count = 0;
1906 if (type_has_user_provided_constructor (type))
1909 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1913 if (TREE_CODE (field) != FIELD_DECL)
1916 field_type = strip_array_types (TREE_TYPE (field));
1918 if (type_has_user_provided_constructor (field_type))
1921 if (TREE_CODE (field_type) == REFERENCE_TYPE)
1927 error ("uninitialized reference member in %q#T "
1928 "using %<new%> without new-initializer", origin);
1930 error ("uninitialized reference member in %q#T", origin);
1931 inform (DECL_SOURCE_LOCATION (field),
1932 "%qD should be initialized", field);
1936 if (CP_TYPE_CONST_P (field_type))
1942 error ("uninitialized const member in %q#T "
1943 "using %<new%> without new-initializer", origin);
1945 error ("uninitialized const member in %q#T", origin);
1946 inform (DECL_SOURCE_LOCATION (field),
1947 "%qD should be initialized", field);
1951 if (CLASS_TYPE_P (field_type))
1953 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin,
1954 using_new, complain);
1960 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain)
1962 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain);
1965 /* Generate code for a new-expression, including calling the "operator
1966 new" function, initializing the object, and, if an exception occurs
1967 during construction, cleaning up. The arguments are as for
1968 build_raw_new_expr. This may change PLACEMENT and INIT. */
1971 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1972 VEC(tree,gc) **init, bool globally_qualified_p,
1973 tsubst_flags_t complain)
1976 /* True iff this is a call to "operator new[]" instead of just
1978 bool array_p = false;
1979 /* If ARRAY_P is true, the element type of the array. This is never
1980 an ARRAY_TYPE; for something like "new int[3][4]", the
1981 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1984 /* The type of the new-expression. (This type is always a pointer
1987 tree non_const_pointer_type;
1988 tree outer_nelts = NULL_TREE;
1989 tree alloc_call, alloc_expr;
1990 /* The address returned by the call to "operator new". This node is
1991 a VAR_DECL and is therefore reusable. */
1994 tree cookie_expr, init_expr;
1995 int nothrow, check_new;
1996 int use_java_new = 0;
1997 /* If non-NULL, the number of extra bytes to allocate at the
1998 beginning of the storage allocated for an array-new expression in
1999 order to store the number of elements. */
2000 tree cookie_size = NULL_TREE;
2001 tree placement_first;
2002 tree placement_expr = NULL_TREE;
2003 /* True if the function we are calling is a placement allocation
2005 bool placement_allocation_fn_p;
2006 /* True if the storage must be initialized, either by a constructor
2007 or due to an explicit new-initializer. */
2008 bool is_initialized;
2009 /* The address of the thing allocated, not including any cookie. In
2010 particular, if an array cookie is in use, DATA_ADDR is the
2011 address of the first array element. This node is a VAR_DECL, and
2012 is therefore reusable. */
2014 tree init_preeval_expr = NULL_TREE;
2018 outer_nelts = nelts;
2021 else if (TREE_CODE (type) == ARRAY_TYPE)
2024 nelts = array_type_nelts_top (type);
2025 outer_nelts = nelts;
2026 type = TREE_TYPE (type);
2029 /* If our base type is an array, then make sure we know how many elements
2031 for (elt_type = type;
2032 TREE_CODE (elt_type) == ARRAY_TYPE;
2033 elt_type = TREE_TYPE (elt_type))
2034 nelts = cp_build_binary_op (input_location,
2036 array_type_nelts_top (elt_type),
2039 if (TREE_CODE (elt_type) == VOID_TYPE)
2041 if (complain & tf_error)
2042 error ("invalid type %<void%> for new");
2043 return error_mark_node;
2046 if (abstract_virtuals_error_sfinae (NULL_TREE, elt_type, complain))
2047 return error_mark_node;
2049 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
2053 bool maybe_uninitialized_error = false;
2054 /* A program that calls for default-initialization [...] of an
2055 entity of reference type is ill-formed. */
2056 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type))
2057 maybe_uninitialized_error = true;
2059 /* A new-expression that creates an object of type T initializes
2060 that object as follows:
2061 - If the new-initializer is omitted:
2062 -- If T is a (possibly cv-qualified) non-POD class type
2063 (or array thereof), the object is default-initialized (8.5).
2065 -- Otherwise, the object created has indeterminate
2066 value. If T is a const-qualified type, or a (possibly
2067 cv-qualified) POD class type (or array thereof)
2068 containing (directly or indirectly) a member of
2069 const-qualified type, the program is ill-formed; */
2071 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type))
2072 maybe_uninitialized_error = true;
2074 if (maybe_uninitialized_error
2075 && diagnose_uninitialized_cst_or_ref_member (elt_type,
2077 complain & tf_error))
2078 return error_mark_node;
2081 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
2082 && !type_has_user_provided_default_constructor (elt_type))
2084 if (complain & tf_error)
2085 error ("uninitialized const in %<new%> of %q#T", elt_type);
2086 return error_mark_node;
2089 size = size_in_bytes (elt_type);
2091 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2093 alloc_fn = NULL_TREE;
2095 /* If PLACEMENT is a single simple pointer type not passed by
2096 reference, prepare to capture it in a temporary variable. Do
2097 this now, since PLACEMENT will change in the calls below. */
2098 placement_first = NULL_TREE;
2099 if (VEC_length (tree, *placement) == 1
2100 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
2102 placement_first = VEC_index (tree, *placement, 0);
2104 /* Allocate the object. */
2105 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
2108 tree class_decl = build_java_class_ref (elt_type);
2109 static const char alloc_name[] = "_Jv_AllocObject";
2111 if (class_decl == error_mark_node)
2112 return error_mark_node;
2115 if (!get_global_value_if_present (get_identifier (alloc_name),
2118 if (complain & tf_error)
2119 error ("call to Java constructor with %qs undefined", alloc_name);
2120 return error_mark_node;
2122 else if (really_overloaded_fn (alloc_fn))
2124 if (complain & tf_error)
2125 error ("%qD should never be overloaded", alloc_fn);
2126 return error_mark_node;
2128 alloc_fn = OVL_CURRENT (alloc_fn);
2129 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2130 alloc_call = cp_build_function_call_nary (alloc_fn, complain,
2131 class_addr, NULL_TREE);
2133 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
2135 error ("Java class %q#T object allocated using placement new", elt_type);
2136 return error_mark_node;
2143 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
2145 if (!globally_qualified_p
2146 && CLASS_TYPE_P (elt_type)
2148 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
2149 : TYPE_HAS_NEW_OPERATOR (elt_type)))
2151 /* Use a class-specific operator new. */
2152 /* If a cookie is required, add some extra space. */
2153 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2155 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2156 size = size_binop (PLUS_EXPR, size, cookie_size);
2158 /* Create the argument list. */
2159 VEC_safe_insert (tree, gc, *placement, 0, size);
2160 /* Do name-lookup to find the appropriate operator. */
2161 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
2162 if (fns == NULL_TREE)
2164 if (complain & tf_error)
2165 error ("no suitable %qD found in class %qT", fnname, elt_type);
2166 return error_mark_node;
2168 if (TREE_CODE (fns) == TREE_LIST)
2170 if (complain & tf_error)
2172 error ("request for member %qD is ambiguous", fnname);
2173 print_candidates (fns);
2175 return error_mark_node;
2177 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2179 /*conversion_path=*/NULL_TREE,
2186 /* Use a global operator new. */
2187 /* See if a cookie might be required. */
2188 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2189 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2191 cookie_size = NULL_TREE;
2193 alloc_call = build_operator_new_call (fnname, placement,
2194 &size, &cookie_size,
2199 if (alloc_call == error_mark_node)
2200 return error_mark_node;
2202 gcc_assert (alloc_fn != NULL_TREE);
2204 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2205 into a temporary variable. */
2206 if (!processing_template_decl
2207 && placement_first != NULL_TREE
2208 && TREE_CODE (alloc_call) == CALL_EXPR
2209 && call_expr_nargs (alloc_call) == 2
2210 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2211 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2213 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2215 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2216 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2218 placement_expr = get_target_expr (placement_first);
2219 CALL_EXPR_ARG (alloc_call, 1)
2220 = convert (TREE_TYPE (placement_arg), placement_expr);
2224 /* In the simple case, we can stop now. */
2225 pointer_type = build_pointer_type (type);
2226 if (!cookie_size && !is_initialized)
2227 return build_nop (pointer_type, alloc_call);
2229 /* Store the result of the allocation call in a variable so that we can
2230 use it more than once. */
2231 alloc_expr = get_target_expr (alloc_call);
2232 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2234 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2235 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2236 alloc_call = TREE_OPERAND (alloc_call, 1);
2238 /* Now, check to see if this function is actually a placement
2239 allocation function. This can happen even when PLACEMENT is NULL
2240 because we might have something like:
2242 struct S { void* operator new (size_t, int i = 0); };
2244 A call to `new S' will get this allocation function, even though
2245 there is no explicit placement argument. If there is more than
2246 one argument, or there are variable arguments, then this is a
2247 placement allocation function. */
2248 placement_allocation_fn_p
2249 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2250 || varargs_function_p (alloc_fn));
2252 /* Preevaluate the placement args so that we don't reevaluate them for a
2253 placement delete. */
2254 if (placement_allocation_fn_p)
2257 stabilize_call (alloc_call, &inits);
2259 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2263 /* unless an allocation function is declared with an empty excep-
2264 tion-specification (_except.spec_), throw(), it indicates failure to
2265 allocate storage by throwing a bad_alloc exception (clause _except_,
2266 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2267 cation function is declared with an empty exception-specification,
2268 throw(), it returns null to indicate failure to allocate storage and a
2269 non-null pointer otherwise.
2271 So check for a null exception spec on the op new we just called. */
2273 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2274 check_new = (flag_check_new || nothrow) && ! use_java_new;
2282 /* Adjust so we're pointing to the start of the object. */
2283 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2284 alloc_node, cookie_size);
2286 /* Store the number of bytes allocated so that we can know how
2287 many elements to destroy later. We use the last sizeof
2288 (size_t) bytes to store the number of elements. */
2289 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2290 cookie_ptr = fold_build2_loc (input_location,
2291 POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2292 alloc_node, cookie_ptr);
2293 size_ptr_type = build_pointer_type (sizetype);
2294 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2295 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2297 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2299 if (targetm.cxx.cookie_has_size ())
2301 /* Also store the element size. */
2302 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2303 fold_build1_loc (input_location,
2304 NEGATE_EXPR, sizetype,
2305 size_in_bytes (sizetype)));
2307 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2308 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2309 size_in_bytes (elt_type));
2310 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2311 cookie, cookie_expr);
2316 cookie_expr = NULL_TREE;
2317 data_addr = alloc_node;
2320 /* Now use a pointer to the type we've actually allocated. */
2322 /* But we want to operate on a non-const version to start with,
2323 since we'll be modifying the elements. */
2324 non_const_pointer_type = build_pointer_type
2325 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST));
2327 data_addr = fold_convert (non_const_pointer_type, data_addr);
2328 /* Any further uses of alloc_node will want this type, too. */
2329 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2331 /* Now initialize the allocated object. Note that we preevaluate the
2332 initialization expression, apart from the actual constructor call or
2333 assignment--we do this because we want to delay the allocation as long
2334 as possible in order to minimize the size of the exception region for
2335 placement delete. */
2339 bool explicit_value_init_p = false;
2341 if (*init != NULL && VEC_empty (tree, *init))
2344 explicit_value_init_p = true;
2347 if (processing_template_decl && explicit_value_init_p)
2349 /* build_value_init doesn't work in templates, and we don't need
2350 the initializer anyway since we're going to throw it away and
2351 rebuild it at instantiation time, so just build up a single
2352 constructor call to get any appropriate diagnostics. */
2353 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2354 if (TYPE_NEEDS_CONSTRUCTING (elt_type))
2355 init_expr = build_special_member_call (init_expr,
2356 complete_ctor_identifier,
2360 stable = stabilize_init (init_expr, &init_preeval_expr);
2364 tree vecinit = NULL_TREE;
2365 if (*init && VEC_length (tree, *init) == 1
2366 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2367 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2369 tree arraytype, domain;
2370 vecinit = VEC_index (tree, *init, 0);
2371 if (TREE_CONSTANT (nelts))
2372 domain = compute_array_index_type (NULL_TREE, nelts, complain);
2376 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2377 warning (0, "non-constant array size in new, unable to "
2378 "verify length of initializer-list");
2380 arraytype = build_cplus_array_type (type, domain);
2381 vecinit = digest_init (arraytype, vecinit, complain);
2385 if (complain & tf_error)
2386 permerror (input_location, "ISO C++ forbids initialization in array new");
2388 return error_mark_node;
2389 vecinit = build_tree_list_vec (*init);
2392 = build_vec_init (data_addr,
2393 cp_build_binary_op (input_location,
2394 MINUS_EXPR, outer_nelts,
2398 explicit_value_init_p,
2402 /* An array initialization is stable because the initialization
2403 of each element is a full-expression, so the temporaries don't
2409 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2411 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2413 init_expr = build_special_member_call (init_expr,
2414 complete_ctor_identifier,
2419 else if (explicit_value_init_p)
2421 /* Something like `new int()'. */
2422 tree val = build_value_init (type, complain);
2423 if (val == error_mark_node)
2424 return error_mark_node;
2425 init_expr = build2 (INIT_EXPR, type, init_expr, val);
2431 /* We are processing something like `new int (10)', which
2432 means allocate an int, and initialize it with 10. */
2434 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2435 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2438 stable = stabilize_init (init_expr, &init_preeval_expr);
2441 if (init_expr == error_mark_node)
2442 return error_mark_node;
2444 /* If any part of the object initialization terminates by throwing an
2445 exception and a suitable deallocation function can be found, the
2446 deallocation function is called to free the memory in which the
2447 object was being constructed, after which the exception continues
2448 to propagate in the context of the new-expression. If no
2449 unambiguous matching deallocation function can be found,
2450 propagating the exception does not cause the object's memory to be
2452 if (flag_exceptions && ! use_java_new)
2454 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2457 /* The Standard is unclear here, but the right thing to do
2458 is to use the same method for finding deallocation
2459 functions that we use for finding allocation functions. */
2460 cleanup = (build_op_delete_call
2464 globally_qualified_p,
2465 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2471 /* This is much simpler if we were able to preevaluate all of
2472 the arguments to the constructor call. */
2474 /* CLEANUP is compiler-generated, so no diagnostics. */
2475 TREE_NO_WARNING (cleanup) = true;
2476 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2477 init_expr, cleanup);
2478 /* Likewise, this try-catch is compiler-generated. */
2479 TREE_NO_WARNING (init_expr) = true;
2482 /* Ack! First we allocate the memory. Then we set our sentry
2483 variable to true, and expand a cleanup that deletes the
2484 memory if sentry is true. Then we run the constructor, and
2485 finally clear the sentry.
2487 We need to do this because we allocate the space first, so
2488 if there are any temporaries with cleanups in the
2489 constructor args and we weren't able to preevaluate them, we
2490 need this EH region to extend until end of full-expression
2491 to preserve nesting. */
2493 tree end, sentry, begin;
2495 begin = get_target_expr (boolean_true_node);
2496 CLEANUP_EH_ONLY (begin) = 1;
2498 sentry = TARGET_EXPR_SLOT (begin);
2500 /* CLEANUP is compiler-generated, so no diagnostics. */
2501 TREE_NO_WARNING (cleanup) = true;
2503 TARGET_EXPR_CLEANUP (begin)
2504 = build3 (COND_EXPR, void_type_node, sentry,
2505 cleanup, void_zero_node);
2507 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2508 sentry, boolean_false_node);
2511 = build2 (COMPOUND_EXPR, void_type_node, begin,
2512 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2514 /* Likewise, this is compiler-generated. */
2515 TREE_NO_WARNING (init_expr) = true;
2520 init_expr = NULL_TREE;
2522 /* Now build up the return value in reverse order. */
2527 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2529 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2531 if (rval == data_addr)
2532 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2533 and return the call (which doesn't need to be adjusted). */
2534 rval = TARGET_EXPR_INITIAL (alloc_expr);
2539 tree ifexp = cp_build_binary_op (input_location,
2540 NE_EXPR, alloc_node,
2543 rval = build_conditional_expr (ifexp, rval, alloc_node,
2547 /* Perform the allocation before anything else, so that ALLOC_NODE
2548 has been initialized before we start using it. */
2549 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2552 if (init_preeval_expr)
2553 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2555 /* A new-expression is never an lvalue. */
2556 gcc_assert (!lvalue_p (rval));
2558 return convert (pointer_type, rval);
2561 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2562 is a vector of placement-new arguments (or NULL if none). If NELTS
2563 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2564 is not NULL, then this is an array-new allocation; TYPE is the type
2565 of the elements in the array and NELTS is the number of elements in
2566 the array. *INIT, if non-NULL, is the initializer for the new
2567 object, or an empty vector to indicate an initializer of "()". If
2568 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2569 rather than just "new". This may change PLACEMENT and INIT. */
2572 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2573 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2576 VEC(tree,gc) *orig_placement = NULL;
2577 tree orig_nelts = NULL_TREE;
2578 VEC(tree,gc) *orig_init = NULL;
2580 if (type == error_mark_node)
2581 return error_mark_node;
2583 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2585 tree auto_node = type_uses_auto (type);
2588 tree d_init = VEC_index (tree, *init, 0);
2589 d_init = resolve_nondeduced_context (d_init);
2590 if (describable_type (d_init))
2591 type = do_auto_deduction (type, d_init, auto_node);
2595 if (processing_template_decl)
2597 if (dependent_type_p (type)
2598 || any_type_dependent_arguments_p (*placement)
2599 || (nelts && type_dependent_expression_p (nelts))
2600 || any_type_dependent_arguments_p (*init))
2601 return build_raw_new_expr (*placement, type, nelts, *init,
2604 orig_placement = make_tree_vector_copy (*placement);
2606 orig_init = make_tree_vector_copy (*init);
2608 make_args_non_dependent (*placement);
2610 nelts = build_non_dependent_expr (nelts);
2611 make_args_non_dependent (*init);
2616 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2618 if (complain & tf_error)
2619 permerror (input_location, "size in array new must have integral type");
2621 return error_mark_node;
2623 nelts = mark_rvalue_use (nelts);
2624 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2627 /* ``A reference cannot be created by the new operator. A reference
2628 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2629 returned by new.'' ARM 5.3.3 */
2630 if (TREE_CODE (type) == REFERENCE_TYPE)
2632 if (complain & tf_error)
2633 error ("new cannot be applied to a reference type");
2635 return error_mark_node;
2636 type = TREE_TYPE (type);
2639 if (TREE_CODE (type) == FUNCTION_TYPE)
2641 if (complain & tf_error)
2642 error ("new cannot be applied to a function type");
2643 return error_mark_node;
2646 /* The type allocated must be complete. If the new-type-id was
2647 "T[N]" then we are just checking that "T" is complete here, but
2648 that is equivalent, since the value of "N" doesn't matter. */
2649 if (!complete_type_or_maybe_complain (type, NULL_TREE, complain))
2650 return error_mark_node;
2652 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2653 if (rval == error_mark_node)
2654 return error_mark_node;
2656 if (processing_template_decl)
2658 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2659 orig_init, use_global_new);
2660 release_tree_vector (orig_placement);
2661 release_tree_vector (orig_init);
2665 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2666 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2667 TREE_NO_WARNING (rval) = 1;
2672 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2675 build_java_class_ref (tree type)
2677 tree name = NULL_TREE, class_decl;
2678 static tree CL_suffix = NULL_TREE;
2679 if (CL_suffix == NULL_TREE)
2680 CL_suffix = get_identifier("class$");
2681 if (jclass_node == NULL_TREE)
2683 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2684 if (jclass_node == NULL_TREE)
2686 error ("call to Java constructor, while %<jclass%> undefined");
2687 return error_mark_node;
2689 jclass_node = TREE_TYPE (jclass_node);
2692 /* Mangle the class$ field. */
2695 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2696 if (DECL_NAME (field) == CL_suffix)
2698 mangle_decl (field);
2699 name = DECL_ASSEMBLER_NAME (field);
2704 error ("can%'t find %<class$%> in %qT", type);
2705 return error_mark_node;
2709 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2710 if (class_decl == NULL_TREE)
2712 class_decl = build_decl (input_location,
2713 VAR_DECL, name, TREE_TYPE (jclass_node));
2714 TREE_STATIC (class_decl) = 1;
2715 DECL_EXTERNAL (class_decl) = 1;
2716 TREE_PUBLIC (class_decl) = 1;
2717 DECL_ARTIFICIAL (class_decl) = 1;
2718 DECL_IGNORED_P (class_decl) = 1;
2719 pushdecl_top_level (class_decl);
2720 make_decl_rtl (class_decl);
2726 build_vec_delete_1 (tree base, tree maxindex, tree type,
2727 special_function_kind auto_delete_vec,
2728 int use_global_delete, tsubst_flags_t complain)
2731 tree ptype = build_pointer_type (type = complete_type (type));
2732 tree size_exp = size_in_bytes (type);
2734 /* Temporary variables used by the loop. */
2735 tree tbase, tbase_init;
2737 /* This is the body of the loop that implements the deletion of a
2738 single element, and moves temp variables to next elements. */
2741 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2744 /* This is the thing that governs what to do after the loop has run. */
2745 tree deallocate_expr = 0;
2747 /* This is the BIND_EXPR which holds the outermost iterator of the
2748 loop. It is convenient to set this variable up and test it before
2749 executing any other code in the loop.
2750 This is also the containing expression returned by this function. */
2751 tree controller = NULL_TREE;
2754 /* We should only have 1-D arrays here. */
2755 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2757 if (base == error_mark_node || maxindex == error_mark_node)
2758 return error_mark_node;
2760 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2763 /* The below is short by the cookie size. */
2764 virtual_size = size_binop (MULT_EXPR, size_exp,
2765 convert (sizetype, maxindex));
2767 tbase = create_temporary_var (ptype);
2768 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2769 fold_build2_loc (input_location,
2770 POINTER_PLUS_EXPR, ptype,
2771 fold_convert (ptype, base),
2774 if (tbase_init == error_mark_node)
2775 return error_mark_node;
2776 controller = build3 (BIND_EXPR, void_type_node, tbase,
2777 NULL_TREE, NULL_TREE);
2778 TREE_SIDE_EFFECTS (controller) = 1;
2780 body = build1 (EXIT_EXPR, void_type_node,
2781 build2 (EQ_EXPR, boolean_type_node, tbase,
2782 fold_convert (ptype, base)));
2783 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp);
2784 tmp = build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp);
2785 tmp = cp_build_modify_expr (tbase, NOP_EXPR, tmp, complain);
2786 if (tmp == error_mark_node)
2787 return error_mark_node;
2788 body = build_compound_expr (input_location, body, tmp);
2789 tmp = build_delete (ptype, tbase, sfk_complete_destructor,
2790 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1,
2792 if (tmp == error_mark_node)
2793 return error_mark_node;
2794 body = build_compound_expr (input_location, body, tmp);
2796 loop = build1 (LOOP_EXPR, void_type_node, body);
2797 loop = build_compound_expr (input_location, tbase_init, loop);
2800 /* Delete the storage if appropriate. */
2801 if (auto_delete_vec == sfk_deleting_destructor)
2805 /* The below is short by the cookie size. */
2806 virtual_size = size_binop (MULT_EXPR, size_exp,
2807 convert (sizetype, maxindex));
2809 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2816 cookie_size = targetm.cxx.get_cookie_size (type);
2817 base_tbd = cp_build_binary_op (input_location,
2819 cp_convert (string_type_node,
2823 if (base_tbd == error_mark_node)
2824 return error_mark_node;
2825 base_tbd = cp_convert (ptype, base_tbd);
2826 /* True size with header. */
2827 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2830 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2831 base_tbd, virtual_size,
2832 use_global_delete & 1,
2833 /*placement=*/NULL_TREE,
2834 /*alloc_fn=*/NULL_TREE);
2838 if (!deallocate_expr)
2841 body = deallocate_expr;
2843 body = build_compound_expr (input_location, body, deallocate_expr);
2846 body = integer_zero_node;
2848 /* Outermost wrapper: If pointer is null, punt. */
2849 body = fold_build3_loc (input_location, COND_EXPR, void_type_node,
2850 fold_build2_loc (input_location,
2851 NE_EXPR, boolean_type_node, base,
2852 convert (TREE_TYPE (base),
2853 integer_zero_node)),
2854 body, integer_zero_node);
2855 body = build1 (NOP_EXPR, void_type_node, body);
2859 TREE_OPERAND (controller, 1) = body;
2863 if (TREE_CODE (base) == SAVE_EXPR)
2864 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2865 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2867 return convert_to_void (body, ICV_CAST, complain);
2870 /* Create an unnamed variable of the indicated TYPE. */
2873 create_temporary_var (tree type)
2877 decl = build_decl (input_location,
2878 VAR_DECL, NULL_TREE, type);
2879 TREE_USED (decl) = 1;
2880 DECL_ARTIFICIAL (decl) = 1;
2881 DECL_IGNORED_P (decl) = 1;
2882 DECL_CONTEXT (decl) = current_function_decl;
2887 /* Create a new temporary variable of the indicated TYPE, initialized
2890 It is not entered into current_binding_level, because that breaks
2891 things when it comes time to do final cleanups (which take place
2892 "outside" the binding contour of the function). */
2895 get_temp_regvar (tree type, tree init)
2899 decl = create_temporary_var (type);
2900 add_decl_expr (decl);
2902 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2903 tf_warning_or_error));
2908 /* `build_vec_init' returns tree structure that performs
2909 initialization of a vector of aggregate types.
2911 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2912 to the first element, of POINTER_TYPE.
2913 MAXINDEX is the maximum index of the array (one less than the
2914 number of elements). It is only used if BASE is a pointer or
2915 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2917 INIT is the (possibly NULL) initializer.
2919 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2920 elements in the array are value-initialized.
2922 FROM_ARRAY is 0 if we should init everything with INIT
2923 (i.e., every element initialized from INIT).
2924 FROM_ARRAY is 1 if we should index into INIT in parallel
2925 with initialization of DECL.
2926 FROM_ARRAY is 2 if we should index into INIT in parallel,
2927 but use assignment instead of initialization. */
2930 build_vec_init (tree base, tree maxindex, tree init,
2931 bool explicit_value_init_p,
2932 int from_array, tsubst_flags_t complain)
2935 tree base2 = NULL_TREE;
2936 tree itype = NULL_TREE;
2938 /* The type of BASE. */
2939 tree atype = TREE_TYPE (base);
2940 /* The type of an element in the array. */
2941 tree type = TREE_TYPE (atype);
2942 /* The element type reached after removing all outer array
2944 tree inner_elt_type;
2945 /* The type of a pointer to an element in the array. */
2950 tree try_block = NULL_TREE;
2951 int num_initialized_elts = 0;
2953 tree const_init = NULL_TREE;
2955 bool xvalue = false;
2956 bool errors = false;
2958 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2959 maxindex = array_type_nelts (atype);
2961 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2962 return error_mark_node;
2964 if (explicit_value_init_p)
2967 inner_elt_type = strip_array_types (type);
2969 /* Look through the TARGET_EXPR around a compound literal. */
2970 if (init && TREE_CODE (init) == TARGET_EXPR
2971 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR
2973 init = TARGET_EXPR_INITIAL (init);
2976 && TREE_CODE (atype) == ARRAY_TYPE
2978 ? (!CLASS_TYPE_P (inner_elt_type)
2979 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type))
2980 : !TYPE_NEEDS_CONSTRUCTING (type))
2981 && ((TREE_CODE (init) == CONSTRUCTOR
2982 /* Don't do this if the CONSTRUCTOR might contain something
2983 that might throw and require us to clean up. */
2984 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2985 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2988 /* Do non-default initialization of trivial arrays resulting from
2989 brace-enclosed initializers. In this case, digest_init and
2990 store_constructor will handle the semantics for us. */
2992 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2996 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2997 if (TREE_CODE (atype) == ARRAY_TYPE)
2999 ptype = build_pointer_type (type);
3000 base = cp_convert (ptype, decay_conversion (base));
3005 /* The code we are generating looks like:
3009 ptrdiff_t iterator = maxindex;
3011 for (; iterator != -1; --iterator) {
3012 ... initialize *t1 ...
3016 ... destroy elements that were constructed ...
3021 We can omit the try and catch blocks if we know that the
3022 initialization will never throw an exception, or if the array
3023 elements do not have destructors. We can omit the loop completely if
3024 the elements of the array do not have constructors.
3026 We actually wrap the entire body of the above in a STMT_EXPR, for
3029 When copying from array to another, when the array elements have
3030 only trivial copy constructors, we should use __builtin_memcpy
3031 rather than generating a loop. That way, we could take advantage
3032 of whatever cleverness the back end has for dealing with copies
3033 of blocks of memory. */
3035 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
3036 destroy_temps = stmts_are_full_exprs_p ();
3037 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3038 rval = get_temp_regvar (ptype, base);
3039 base = get_temp_regvar (ptype, rval);
3040 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
3042 /* If initializing one array from another, initialize element by
3043 element. We rely upon the below calls to do the argument
3044 checking. Evaluate the initializer before entering the try block. */
3045 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR)
3047 if (lvalue_kind (init) & clk_rvalueref)
3049 base2 = decay_conversion (init);
3050 itype = TREE_TYPE (base2);
3051 base2 = get_temp_regvar (itype, base2);
3052 itype = TREE_TYPE (itype);
3055 /* Protect the entire array initialization so that we can destroy
3056 the partially constructed array if an exception is thrown.
3057 But don't do this if we're assigning. */
3058 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3061 try_block = begin_try_block ();
3064 /* Maybe pull out constant value when from_array? */
3066 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
3068 /* Do non-default initialization of non-trivial arrays resulting from
3069 brace-enclosed initializers. */
3070 unsigned HOST_WIDE_INT idx;
3072 /* Should we try to create a constant initializer? */
3073 bool try_const = (literal_type_p (inner_elt_type)
3074 || TYPE_HAS_CONSTEXPR_CTOR (inner_elt_type));
3075 bool saw_non_const = false;
3076 bool saw_const = false;
3077 /* If we're initializing a static array, we want to do static
3078 initialization of any elements with constant initializers even if
3079 some are non-constant. */
3080 bool do_static_init = (DECL_P (obase) && TREE_STATIC (obase));
3081 VEC(constructor_elt,gc) *new_vec;
3085 new_vec = VEC_alloc (constructor_elt, gc, CONSTRUCTOR_NELTS (init));
3089 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx, field, elt)
3091 tree baseref = build1 (INDIRECT_REF, type, base);
3094 num_initialized_elts++;
3096 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3097 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
3098 one_init = build_aggr_init (baseref, elt, 0, complain);
3100 one_init = cp_build_modify_expr (baseref, NOP_EXPR,
3102 if (one_init == error_mark_node)
3107 if (TREE_CODE (e) == EXPR_STMT)
3108 e = TREE_OPERAND (e, 0);
3109 if (TREE_CODE (e) == CONVERT_EXPR
3110 && VOID_TYPE_P (TREE_TYPE (e)))
3111 e = TREE_OPERAND (e, 0);
3112 e = maybe_constant_init (e);
3113 if (reduced_constant_expression_p (e))
3115 CONSTRUCTOR_APPEND_ELT (new_vec, field, e);
3117 one_init = NULL_TREE;
3119 one_init = build2 (INIT_EXPR, type, baseref, e);
3125 CONSTRUCTOR_APPEND_ELT (new_vec, field,
3126 build_zero_init (TREE_TYPE (e),
3128 saw_non_const = true;
3133 finish_expr_stmt (one_init);
3134 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3136 one_init = cp_build_unary_op (PREINCREMENT_EXPR, base, 0, complain);
3137 if (one_init == error_mark_node)
3140 finish_expr_stmt (one_init);
3142 one_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3144 if (one_init == error_mark_node)
3147 finish_expr_stmt (one_init);
3153 const_init = build_constructor (atype, new_vec);
3154 else if (do_static_init && saw_const)
3155 DECL_INITIAL (obase) = build_constructor (atype, new_vec);
3157 VEC_free (constructor_elt, gc, new_vec);
3160 /* Clear out INIT so that we don't get confused below. */
3163 else if (from_array)
3166 /* OK, we set base2 above. */;
3167 else if (TYPE_LANG_SPECIFIC (type)
3168 && TYPE_NEEDS_CONSTRUCTING (type)
3169 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3171 if (complain & tf_error)
3172 error ("initializer ends prematurely");
3177 /* Now, default-initialize any remaining elements. We don't need to
3178 do that if a) the type does not need constructing, or b) we've
3179 already initialized all the elements.
3181 We do need to keep going if we're copying an array. */
3184 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
3185 && ! (host_integerp (maxindex, 0)
3186 && (num_initialized_elts
3187 == tree_low_cst (maxindex, 0) + 1))))
3189 /* If the ITERATOR is equal to -1, then we don't have to loop;
3190 we've already initialized all the elements. */
3195 for_stmt = begin_for_stmt (NULL_TREE, NULL_TREE);
3196 finish_for_init_stmt (for_stmt);
3197 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
3198 build_int_cst (TREE_TYPE (iterator), -1)),
3200 elt_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3202 if (elt_init == error_mark_node)
3204 finish_for_expr (elt_init, for_stmt);
3206 to = build1 (INDIRECT_REF, type, base);
3214 from = build1 (INDIRECT_REF, itype, base2);
3221 if (from_array == 2)
3222 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3224 else if (TYPE_NEEDS_CONSTRUCTING (type))
3225 elt_init = build_aggr_init (to, from, 0, complain);
3227 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3232 else if (TREE_CODE (type) == ARRAY_TYPE)
3236 ("cannot initialize multi-dimensional array with initializer");
3237 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
3239 explicit_value_init_p,
3242 else if (explicit_value_init_p)
3244 elt_init = build_value_init (type, complain);
3245 if (elt_init != error_mark_node)
3246 elt_init = build2 (INIT_EXPR, type, to, elt_init);
3250 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
3251 elt_init = build_aggr_init (to, init, 0, complain);
3254 if (elt_init == error_mark_node)
3257 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3258 finish_expr_stmt (elt_init);
3259 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3261 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
3264 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
3267 finish_for_stmt (for_stmt);
3270 /* Make sure to cleanup any partially constructed elements. */
3271 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3275 tree m = cp_build_binary_op (input_location,
3276 MINUS_EXPR, maxindex, iterator,
3279 /* Flatten multi-dimensional array since build_vec_delete only
3280 expects one-dimensional array. */
3281 if (TREE_CODE (type) == ARRAY_TYPE)
3282 m = cp_build_binary_op (input_location,
3284 array_type_nelts_total (type),
3287 finish_cleanup_try_block (try_block);
3288 e = build_vec_delete_1 (rval, m,
3289 inner_elt_type, sfk_complete_destructor,
3290 /*use_global_delete=*/0, complain);
3291 if (e == error_mark_node)
3293 finish_cleanup (e, try_block);
3296 /* The value of the array initialization is the array itself, RVAL
3297 is a pointer to the first element. */
3298 finish_stmt_expr_expr (rval, stmt_expr);
3300 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
3302 /* Now make the result have the correct type. */
3303 if (TREE_CODE (atype) == ARRAY_TYPE)
3305 atype = build_pointer_type (atype);
3306 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
3307 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain);
3308 TREE_NO_WARNING (stmt_expr) = 1;
3311 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3314 return build2 (INIT_EXPR, atype, obase, const_init);
3316 return error_mark_node;
3320 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3324 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags,
3325 tsubst_flags_t complain)
3331 case sfk_complete_destructor:
3332 name = complete_dtor_identifier;
3335 case sfk_base_destructor:
3336 name = base_dtor_identifier;
3339 case sfk_deleting_destructor:
3340 name = deleting_dtor_identifier;
3346 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
3347 return build_new_method_call (exp, fn,
3349 /*conversion_path=*/NULL_TREE,
3355 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3356 ADDR is an expression which yields the store to be destroyed.
3357 AUTO_DELETE is the name of the destructor to call, i.e., either
3358 sfk_complete_destructor, sfk_base_destructor, or
3359 sfk_deleting_destructor.
3361 FLAGS is the logical disjunction of zero or more LOOKUP_
3362 flags. See cp-tree.h for more info. */
3365 build_delete (tree type, tree addr, special_function_kind auto_delete,
3366 int flags, int use_global_delete, tsubst_flags_t complain)
3370 if (addr == error_mark_node)
3371 return error_mark_node;
3373 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3374 set to `error_mark_node' before it gets properly cleaned up. */
3375 if (type == error_mark_node)
3376 return error_mark_node;
3378 type = TYPE_MAIN_VARIANT (type);
3380 addr = mark_rvalue_use (addr);
3382 if (TREE_CODE (type) == POINTER_TYPE)
3384 bool complete_p = true;
3386 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3387 if (TREE_CODE (type) == ARRAY_TYPE)
3390 /* We don't want to warn about delete of void*, only other
3391 incomplete types. Deleting other incomplete types
3392 invokes undefined behavior, but it is not ill-formed, so
3393 compile to something that would even do The Right Thing
3394 (TM) should the type have a trivial dtor and no delete
3396 if (!VOID_TYPE_P (type))
3398 complete_type (type);
3399 if (!COMPLETE_TYPE_P (type))
3401 if ((complain & tf_warning)
3402 && warning (0, "possible problem detected in invocation of "
3403 "delete operator:"))
3405 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3406 inform (input_location, "neither the destructor nor the class-specific "
3407 "operator delete will be called, even if they are "
3408 "declared when the class is defined");
3413 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3414 /* Call the builtin operator delete. */
3415 return build_builtin_delete_call (addr);
3416 if (TREE_SIDE_EFFECTS (addr))
3417 addr = save_expr (addr);
3419 /* Throw away const and volatile on target type of addr. */
3420 addr = convert_force (build_pointer_type (type), addr, 0);
3422 else if (TREE_CODE (type) == ARRAY_TYPE)
3426 if (TYPE_DOMAIN (type) == NULL_TREE)
3428 if (complain & tf_error)
3429 error ("unknown array size in delete");
3430 return error_mark_node;
3432 return build_vec_delete (addr, array_type_nelts (type),
3433 auto_delete, use_global_delete, complain);
3437 /* Don't check PROTECT here; leave that decision to the
3438 destructor. If the destructor is accessible, call it,
3439 else report error. */
3440 addr = cp_build_addr_expr (addr, complain);
3441 if (addr == error_mark_node)
3442 return error_mark_node;
3443 if (TREE_SIDE_EFFECTS (addr))
3444 addr = save_expr (addr);
3446 addr = convert_force (build_pointer_type (type), addr, 0);
3449 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3451 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3453 if (auto_delete != sfk_deleting_destructor)
3454 return void_zero_node;
3456 return build_op_delete_call (DELETE_EXPR, addr,
3457 cxx_sizeof_nowarn (type),
3459 /*placement=*/NULL_TREE,
3460 /*alloc_fn=*/NULL_TREE);
3464 tree head = NULL_TREE;
3465 tree do_delete = NULL_TREE;
3468 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3469 lazily_declare_fn (sfk_destructor, type);
3471 /* For `::delete x', we must not use the deleting destructor
3472 since then we would not be sure to get the global `operator
3474 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3476 /* We will use ADDR multiple times so we must save it. */
3477 addr = save_expr (addr);
3478 head = get_target_expr (build_headof (addr));
3479 /* Delete the object. */
3480 do_delete = build_builtin_delete_call (head);
3481 /* Otherwise, treat this like a complete object destructor
3483 auto_delete = sfk_complete_destructor;
3485 /* If the destructor is non-virtual, there is no deleting
3486 variant. Instead, we must explicitly call the appropriate
3487 `operator delete' here. */
3488 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3489 && auto_delete == sfk_deleting_destructor)
3491 /* We will use ADDR multiple times so we must save it. */
3492 addr = save_expr (addr);
3493 /* Build the call. */
3494 do_delete = build_op_delete_call (DELETE_EXPR,
3496 cxx_sizeof_nowarn (type),
3498 /*placement=*/NULL_TREE,
3499 /*alloc_fn=*/NULL_TREE);
3500 /* Call the complete object destructor. */
3501 auto_delete = sfk_complete_destructor;
3503 else if (auto_delete == sfk_deleting_destructor
3504 && TYPE_GETS_REG_DELETE (type))
3506 /* Make sure we have access to the member op delete, even though
3507 we'll actually be calling it from the destructor. */
3508 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3510 /*placement=*/NULL_TREE,
3511 /*alloc_fn=*/NULL_TREE);
3514 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL, complain),
3515 auto_delete, flags, complain);
3516 if (expr == error_mark_node)
3517 return error_mark_node;
3519 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3521 /* We need to calculate this before the dtor changes the vptr. */
3523 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3525 if (flags & LOOKUP_DESTRUCTOR)
3526 /* Explicit destructor call; don't check for null pointer. */
3527 ifexp = integer_one_node;
3530 /* Handle deleting a null pointer. */
3531 ifexp = fold (cp_build_binary_op (input_location,
3532 NE_EXPR, addr, integer_zero_node,
3534 if (ifexp == error_mark_node)
3535 return error_mark_node;
3538 if (ifexp != integer_one_node)
3539 expr = build3 (COND_EXPR, void_type_node,
3540 ifexp, expr, void_zero_node);
3546 /* At the beginning of a destructor, push cleanups that will call the
3547 destructors for our base classes and members.
3549 Called from begin_destructor_body. */
3552 push_base_cleanups (void)
3554 tree binfo, base_binfo;
3558 VEC(tree,gc) *vbases;
3560 /* Run destructors for all virtual baseclasses. */
3561 if (CLASSTYPE_VBASECLASSES (current_class_type))
3563 tree cond = (condition_conversion
3564 (build2 (BIT_AND_EXPR, integer_type_node,
3565 current_in_charge_parm,
3566 integer_two_node)));
3568 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3569 order, which is also the right order for pushing cleanups. */
3570 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3571 VEC_iterate (tree, vbases, i, base_binfo); i++)
3573 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3575 expr = build_special_member_call (current_class_ref,
3576 base_dtor_identifier,
3580 | LOOKUP_NONVIRTUAL),
3581 tf_warning_or_error);
3582 expr = build3 (COND_EXPR, void_type_node, cond,
3583 expr, void_zero_node);
3584 finish_decl_cleanup (NULL_TREE, expr);
3589 /* Take care of the remaining baseclasses. */
3590 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3591 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3593 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3594 || BINFO_VIRTUAL_P (base_binfo))
3597 expr = build_special_member_call (current_class_ref,
3598 base_dtor_identifier,
3600 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3601 tf_warning_or_error);
3602 finish_decl_cleanup (NULL_TREE, expr);
3605 /* Don't automatically destroy union members. */
3606 if (TREE_CODE (current_class_type) == UNION_TYPE)
3609 for (member = TYPE_FIELDS (current_class_type); member;
3610 member = DECL_CHAIN (member))
3612 tree this_type = TREE_TYPE (member);
3613 if (this_type == error_mark_node
3614 || TREE_CODE (member) != FIELD_DECL
3615 || DECL_ARTIFICIAL (member))
3617 if (ANON_UNION_TYPE_P (this_type))
3619 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type))
3621 tree this_member = (build_class_member_access_expr
3622 (current_class_ref, member,
3623 /*access_path=*/NULL_TREE,
3624 /*preserve_reference=*/false,
3625 tf_warning_or_error));
3626 expr = build_delete (this_type, this_member,
3627 sfk_complete_destructor,
3628 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3629 0, tf_warning_or_error);
3630 finish_decl_cleanup (NULL_TREE, expr);
3635 /* Build a C++ vector delete expression.
3636 MAXINDEX is the number of elements to be deleted.
3637 ELT_SIZE is the nominal size of each element in the vector.
3638 BASE is the expression that should yield the store to be deleted.
3639 This function expands (or synthesizes) these calls itself.
3640 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3642 This also calls delete for virtual baseclasses of elements of the vector.
3644 Update: MAXINDEX is no longer needed. The size can be extracted from the
3645 start of the vector for pointers, and from the type for arrays. We still
3646 use MAXINDEX for arrays because it happens to already have one of the
3647 values we'd have to extract. (We could use MAXINDEX with pointers to
3648 confirm the size, and trap if the numbers differ; not clear that it'd
3649 be worth bothering.) */
3652 build_vec_delete (tree base, tree maxindex,
3653 special_function_kind auto_delete_vec,
3654 int use_global_delete, tsubst_flags_t complain)
3658 tree base_init = NULL_TREE;
3660 type = TREE_TYPE (base);
3662 if (TREE_CODE (type) == POINTER_TYPE)
3664 /* Step back one from start of vector, and read dimension. */
3666 tree size_ptr_type = build_pointer_type (sizetype);
3668 if (TREE_SIDE_EFFECTS (base))
3670 base_init = get_target_expr (base);
3671 base = TARGET_EXPR_SLOT (base_init);
3673 type = strip_array_types (TREE_TYPE (type));
3674 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR,
3675 sizetype, TYPE_SIZE_UNIT (sizetype));
3676 cookie_addr = build2 (POINTER_PLUS_EXPR,
3678 fold_convert (size_ptr_type, base),
3680 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, complain);
3682 else if (TREE_CODE (type) == ARRAY_TYPE)
3684 /* Get the total number of things in the array, maxindex is a
3686 maxindex = array_type_nelts_total (type);
3687 type = strip_array_types (type);
3688 base = cp_build_addr_expr (base, complain);
3689 if (base == error_mark_node)
3690 return error_mark_node;
3691 if (TREE_SIDE_EFFECTS (base))
3693 base_init = get_target_expr (base);
3694 base = TARGET_EXPR_SLOT (base_init);
3699 if (base != error_mark_node && !(complain & tf_error))
3700 error ("type to vector delete is neither pointer or array type");
3701 return error_mark_node;
3704 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3705 use_global_delete, complain);
3706 if (base_init && rval != error_mark_node)
3707 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);