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_build_ctor_call (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_build_ctor_call (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 (warn_init_self && init && TREE_CODE (init) == TREE_LIST
505 && TREE_CHAIN (init) == NULL_TREE)
507 tree val = TREE_VALUE (init);
508 if (TREE_CODE (val) == COMPONENT_REF && TREE_OPERAND (val, 1) == member
509 && TREE_OPERAND (val, 0) == current_class_ref)
510 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
511 OPT_Wuninitialized, "%qD is initialized with itself",
515 if (init == void_type_node)
517 /* mem() means value-initialization. */
518 if (TREE_CODE (type) == ARRAY_TYPE)
520 init = build_vec_init_expr (type, init, tf_warning_or_error);
521 init = build2 (INIT_EXPR, type, decl, init);
522 finish_expr_stmt (init);
526 tree value = build_value_init (type, tf_warning_or_error);
527 if (value == error_mark_node)
529 init = build2 (INIT_EXPR, type, decl, value);
530 finish_expr_stmt (init);
533 /* Deal with this here, as we will get confused if we try to call the
534 assignment op for an anonymous union. This can happen in a
535 synthesized copy constructor. */
536 else if (ANON_AGGR_TYPE_P (type))
540 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
541 finish_expr_stmt (init);
544 else if (type_build_ctor_call (type))
546 if (TREE_CODE (type) == ARRAY_TYPE)
550 gcc_assert (TREE_CHAIN (init) == NULL_TREE);
551 init = TREE_VALUE (init);
552 if (BRACE_ENCLOSED_INITIALIZER_P (init))
553 init = digest_init (type, init, tf_warning_or_error);
555 if (init == NULL_TREE
556 || same_type_ignoring_top_level_qualifiers_p (type,
559 init = build_vec_init_expr (type, init, tf_warning_or_error);
560 init = build2 (INIT_EXPR, type, decl, init);
561 finish_expr_stmt (init);
564 error ("invalid initializer for array member %q#D", member);
568 int flags = LOOKUP_NORMAL;
569 if (DECL_DEFAULTED_FN (current_function_decl))
570 flags |= LOOKUP_DEFAULTED;
571 if (CP_TYPE_CONST_P (type)
573 && !type_has_user_provided_default_constructor (type))
574 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
575 vtable; still give this diagnostic. */
576 permerror (DECL_SOURCE_LOCATION (current_function_decl),
577 "uninitialized member %qD with %<const%> type %qT",
579 finish_expr_stmt (build_aggr_init (decl, init, flags,
580 tf_warning_or_error));
585 if (init == NULL_TREE)
588 /* member traversal: note it leaves init NULL */
589 if (TREE_CODE (type) == REFERENCE_TYPE)
590 permerror (DECL_SOURCE_LOCATION (current_function_decl),
591 "uninitialized reference member %qD",
593 else if (CP_TYPE_CONST_P (type))
594 permerror (DECL_SOURCE_LOCATION (current_function_decl),
595 "uninitialized member %qD with %<const%> type %qT",
598 core_type = strip_array_types (type);
600 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
601 && !type_has_constexpr_default_constructor (core_type))
603 if (!DECL_TEMPLATE_INSTANTIATION (current_function_decl))
604 error ("uninitialized member %qD in %<constexpr%> constructor",
606 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
609 if (CLASS_TYPE_P (core_type)
610 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)
611 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)))
612 diagnose_uninitialized_cst_or_ref_member (core_type,
616 else if (TREE_CODE (init) == TREE_LIST)
617 /* There was an explicit member initialization. Do some work
619 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT,
620 tf_warning_or_error);
623 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
624 tf_warning_or_error));
627 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
631 expr = build_class_member_access_expr (current_class_ref, member,
632 /*access_path=*/NULL_TREE,
633 /*preserve_reference=*/false,
634 tf_warning_or_error);
635 expr = build_delete (type, expr, sfk_complete_destructor,
636 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0,
637 tf_warning_or_error);
639 if (expr != error_mark_node)
640 finish_eh_cleanup (expr);
644 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
645 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
648 build_field_list (tree t, tree list, int *uses_unions_p)
654 /* Note whether or not T is a union. */
655 if (TREE_CODE (t) == UNION_TYPE)
658 for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields))
662 /* Skip CONST_DECLs for enumeration constants and so forth. */
663 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
666 fieldtype = TREE_TYPE (fields);
667 /* Keep track of whether or not any fields are unions. */
668 if (TREE_CODE (fieldtype) == UNION_TYPE)
671 /* For an anonymous struct or union, we must recursively
672 consider the fields of the anonymous type. They can be
673 directly initialized from the constructor. */
674 if (ANON_AGGR_TYPE_P (fieldtype))
676 /* Add this field itself. Synthesized copy constructors
677 initialize the entire aggregate. */
678 list = tree_cons (fields, NULL_TREE, list);
679 /* And now add the fields in the anonymous aggregate. */
680 list = build_field_list (fieldtype, list, uses_unions_p);
682 /* Add this field. */
683 else if (DECL_NAME (fields))
684 list = tree_cons (fields, NULL_TREE, list);
690 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
691 a FIELD_DECL or BINFO in T that needs initialization. The
692 TREE_VALUE gives the initializer, or list of initializer arguments.
694 Return a TREE_LIST containing all of the initializations required
695 for T, in the order in which they should be performed. The output
696 list has the same format as the input. */
699 sort_mem_initializers (tree t, tree mem_inits)
702 tree base, binfo, base_binfo;
705 VEC(tree,gc) *vbases;
709 /* Build up a list of initializations. The TREE_PURPOSE of entry
710 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
711 TREE_VALUE will be the constructor arguments, or NULL if no
712 explicit initialization was provided. */
713 sorted_inits = NULL_TREE;
715 /* Process the virtual bases. */
716 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
717 VEC_iterate (tree, vbases, i, base); i++)
718 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
720 /* Process the direct bases. */
721 for (binfo = TYPE_BINFO (t), i = 0;
722 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
723 if (!BINFO_VIRTUAL_P (base_binfo))
724 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
726 /* Process the non-static data members. */
727 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
728 /* Reverse the entire list of initializations, so that they are in
729 the order that they will actually be performed. */
730 sorted_inits = nreverse (sorted_inits);
732 /* If the user presented the initializers in an order different from
733 that in which they will actually occur, we issue a warning. Keep
734 track of the next subobject which can be explicitly initialized
735 without issuing a warning. */
736 next_subobject = sorted_inits;
738 /* Go through the explicit initializers, filling in TREE_PURPOSE in
740 for (init = mem_inits; init; init = TREE_CHAIN (init))
745 subobject = TREE_PURPOSE (init);
747 /* If the explicit initializers are in sorted order, then
748 SUBOBJECT will be NEXT_SUBOBJECT, or something following
750 for (subobject_init = next_subobject;
752 subobject_init = TREE_CHAIN (subobject_init))
753 if (TREE_PURPOSE (subobject_init) == subobject)
756 /* Issue a warning if the explicit initializer order does not
757 match that which will actually occur.
758 ??? Are all these on the correct lines? */
759 if (warn_reorder && !subobject_init)
761 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
762 warning (OPT_Wreorder, "%q+D will be initialized after",
763 TREE_PURPOSE (next_subobject));
765 warning (OPT_Wreorder, "base %qT will be initialized after",
766 TREE_PURPOSE (next_subobject));
767 if (TREE_CODE (subobject) == FIELD_DECL)
768 warning (OPT_Wreorder, " %q+#D", subobject);
770 warning (OPT_Wreorder, " base %qT", subobject);
771 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
772 OPT_Wreorder, " when initialized here");
775 /* Look again, from the beginning of the list. */
778 subobject_init = sorted_inits;
779 while (TREE_PURPOSE (subobject_init) != subobject)
780 subobject_init = TREE_CHAIN (subobject_init);
783 /* It is invalid to initialize the same subobject more than
785 if (TREE_VALUE (subobject_init))
787 if (TREE_CODE (subobject) == FIELD_DECL)
788 error_at (DECL_SOURCE_LOCATION (current_function_decl),
789 "multiple initializations given for %qD",
792 error_at (DECL_SOURCE_LOCATION (current_function_decl),
793 "multiple initializations given for base %qT",
797 /* Record the initialization. */
798 TREE_VALUE (subobject_init) = TREE_VALUE (init);
799 next_subobject = subobject_init;
804 If a ctor-initializer specifies more than one mem-initializer for
805 multiple members of the same union (including members of
806 anonymous unions), the ctor-initializer is ill-formed.
808 Here we also splice out uninitialized union members. */
811 tree last_field = NULL_TREE;
813 for (p = &sorted_inits; *p; )
821 field = TREE_PURPOSE (init);
823 /* Skip base classes. */
824 if (TREE_CODE (field) != FIELD_DECL)
827 /* If this is an anonymous union with no explicit initializer,
829 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field)))
832 /* See if this field is a member of a union, or a member of a
833 structure contained in a union, etc. */
834 for (ctx = DECL_CONTEXT (field);
835 !same_type_p (ctx, t);
836 ctx = TYPE_CONTEXT (ctx))
837 if (TREE_CODE (ctx) == UNION_TYPE)
839 /* If this field is not a member of a union, skip it. */
840 if (TREE_CODE (ctx) != UNION_TYPE)
843 /* If this union member has no explicit initializer, splice
845 if (!TREE_VALUE (init))
848 /* It's only an error if we have two initializers for the same
856 /* See if LAST_FIELD and the field initialized by INIT are
857 members of the same union. If so, there's a problem,
858 unless they're actually members of the same structure
859 which is itself a member of a union. For example, given:
861 union { struct { int i; int j; }; };
863 initializing both `i' and `j' makes sense. */
864 ctx = DECL_CONTEXT (field);
870 last_ctx = DECL_CONTEXT (last_field);
873 if (same_type_p (last_ctx, ctx))
875 if (TREE_CODE (ctx) == UNION_TYPE)
876 error_at (DECL_SOURCE_LOCATION (current_function_decl),
877 "initializations for multiple members of %qT",
883 if (same_type_p (last_ctx, t))
886 last_ctx = TYPE_CONTEXT (last_ctx);
889 /* If we've reached the outermost class, then we're
891 if (same_type_p (ctx, t))
894 ctx = TYPE_CONTEXT (ctx);
901 p = &TREE_CHAIN (*p);
904 *p = TREE_CHAIN (*p);
912 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
913 is a TREE_LIST giving the explicit mem-initializer-list for the
914 constructor. The TREE_PURPOSE of each entry is a subobject (a
915 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
916 is a TREE_LIST giving the arguments to the constructor or
917 void_type_node for an empty list of arguments. */
920 emit_mem_initializers (tree mem_inits)
922 int flags = LOOKUP_NORMAL;
924 /* We will already have issued an error message about the fact that
925 the type is incomplete. */
926 if (!COMPLETE_TYPE_P (current_class_type))
929 if (DECL_DEFAULTED_FN (current_function_decl))
930 flags |= LOOKUP_DEFAULTED;
932 /* Sort the mem-initializers into the order in which the
933 initializations should be performed. */
934 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
936 in_base_initializer = 1;
938 /* Initialize base classes. */
940 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
942 tree subobject = TREE_PURPOSE (mem_inits);
943 tree arguments = TREE_VALUE (mem_inits);
945 if (arguments == NULL_TREE)
947 /* If these initializations are taking place in a copy constructor,
948 the base class should probably be explicitly initialized if there
949 is a user-defined constructor in the base class (other than the
950 default constructor, which will be called anyway). */
952 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
953 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
954 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
955 OPT_Wextra, "base class %q#T should be explicitly "
956 "initialized in the copy constructor",
957 BINFO_TYPE (subobject));
959 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
960 && !(type_has_constexpr_default_constructor
961 (BINFO_TYPE (subobject))))
963 if (!DECL_TEMPLATE_INSTANTIATION (current_function_decl))
964 error ("uninitialized base %qT in %<constexpr%> constructor",
965 BINFO_TYPE (subobject));
966 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
970 /* Initialize the base. */
971 if (BINFO_VIRTUAL_P (subobject))
972 construct_virtual_base (subobject, arguments);
977 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
979 expand_aggr_init_1 (subobject, NULL_TREE,
980 cp_build_indirect_ref (base_addr, RO_NULL,
981 tf_warning_or_error),
984 tf_warning_or_error);
985 expand_cleanup_for_base (subobject, NULL_TREE);
988 mem_inits = TREE_CHAIN (mem_inits);
990 in_base_initializer = 0;
992 /* Initialize the vptrs. */
993 initialize_vtbl_ptrs (current_class_ptr);
995 /* Initialize the data members. */
998 perform_member_init (TREE_PURPOSE (mem_inits),
999 TREE_VALUE (mem_inits));
1000 mem_inits = TREE_CHAIN (mem_inits);
1004 /* Returns the address of the vtable (i.e., the value that should be
1005 assigned to the vptr) for BINFO. */
1008 build_vtbl_address (tree binfo)
1010 tree binfo_for = binfo;
1013 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
1014 /* If this is a virtual primary base, then the vtable we want to store
1015 is that for the base this is being used as the primary base of. We
1016 can't simply skip the initialization, because we may be expanding the
1017 inits of a subobject constructor where the virtual base layout
1018 can be different. */
1019 while (BINFO_PRIMARY_P (binfo_for))
1020 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
1022 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1024 vtbl = get_vtbl_decl_for_binfo (binfo_for);
1025 TREE_USED (vtbl) = 1;
1027 /* Now compute the address to use when initializing the vptr. */
1028 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
1029 if (TREE_CODE (vtbl) == VAR_DECL)
1030 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
1035 /* This code sets up the virtual function tables appropriate for
1036 the pointer DECL. It is a one-ply initialization.
1038 BINFO is the exact type that DECL is supposed to be. In
1039 multiple inheritance, this might mean "C's A" if C : A, B. */
1042 expand_virtual_init (tree binfo, tree decl)
1044 tree vtbl, vtbl_ptr;
1047 /* Compute the initializer for vptr. */
1048 vtbl = build_vtbl_address (binfo);
1050 /* We may get this vptr from a VTT, if this is a subobject
1051 constructor or subobject destructor. */
1052 vtt_index = BINFO_VPTR_INDEX (binfo);
1058 /* Compute the value to use, when there's a VTT. */
1059 vtt_parm = current_vtt_parm;
1060 vtbl2 = build2 (POINTER_PLUS_EXPR,
1061 TREE_TYPE (vtt_parm),
1064 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error);
1065 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
1067 /* The actual initializer is the VTT value only in the subobject
1068 constructor. In maybe_clone_body we'll substitute NULL for
1069 the vtt_parm in the case of the non-subobject constructor. */
1070 vtbl = build3 (COND_EXPR,
1072 build2 (EQ_EXPR, boolean_type_node,
1073 current_in_charge_parm, integer_zero_node),
1078 /* Compute the location of the vtpr. */
1079 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL,
1080 tf_warning_or_error),
1082 gcc_assert (vtbl_ptr != error_mark_node);
1084 /* Assign the vtable to the vptr. */
1085 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
1086 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
1087 tf_warning_or_error));
1090 /* If an exception is thrown in a constructor, those base classes already
1091 constructed must be destroyed. This function creates the cleanup
1092 for BINFO, which has just been constructed. If FLAG is non-NULL,
1093 it is a DECL which is nonzero when this base needs to be
1097 expand_cleanup_for_base (tree binfo, tree flag)
1101 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
1104 /* Call the destructor. */
1105 expr = build_special_member_call (current_class_ref,
1106 base_dtor_identifier,
1109 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
1110 tf_warning_or_error);
1112 expr = fold_build3_loc (input_location,
1113 COND_EXPR, void_type_node,
1114 c_common_truthvalue_conversion (input_location, flag),
1115 expr, integer_zero_node);
1117 finish_eh_cleanup (expr);
1120 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1124 construct_virtual_base (tree vbase, tree arguments)
1130 /* If there are virtual base classes with destructors, we need to
1131 emit cleanups to destroy them if an exception is thrown during
1132 the construction process. These exception regions (i.e., the
1133 period during which the cleanups must occur) begin from the time
1134 the construction is complete to the end of the function. If we
1135 create a conditional block in which to initialize the
1136 base-classes, then the cleanup region for the virtual base begins
1137 inside a block, and ends outside of that block. This situation
1138 confuses the sjlj exception-handling code. Therefore, we do not
1139 create a single conditional block, but one for each
1140 initialization. (That way the cleanup regions always begin
1141 in the outer block.) We trust the back end to figure out
1142 that the FLAG will not change across initializations, and
1143 avoid doing multiple tests. */
1144 flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl));
1145 inner_if_stmt = begin_if_stmt ();
1146 finish_if_stmt_cond (flag, inner_if_stmt);
1148 /* Compute the location of the virtual base. If we're
1149 constructing virtual bases, then we must be the most derived
1150 class. Therefore, we don't have to look up the virtual base;
1151 we already know where it is. */
1152 exp = convert_to_base_statically (current_class_ref, vbase);
1154 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1155 LOOKUP_COMPLAIN, tf_warning_or_error);
1156 finish_then_clause (inner_if_stmt);
1157 finish_if_stmt (inner_if_stmt);
1159 expand_cleanup_for_base (vbase, flag);
1162 /* Find the context in which this FIELD can be initialized. */
1165 initializing_context (tree field)
1167 tree t = DECL_CONTEXT (field);
1169 /* Anonymous union members can be initialized in the first enclosing
1170 non-anonymous union context. */
1171 while (t && ANON_AGGR_TYPE_P (t))
1172 t = TYPE_CONTEXT (t);
1176 /* Function to give error message if member initialization specification
1177 is erroneous. FIELD is the member we decided to initialize.
1178 TYPE is the type for which the initialization is being performed.
1179 FIELD must be a member of TYPE.
1181 MEMBER_NAME is the name of the member. */
1184 member_init_ok_or_else (tree field, tree type, tree member_name)
1186 if (field == error_mark_node)
1190 error ("class %qT does not have any field named %qD", type,
1194 if (TREE_CODE (field) == VAR_DECL)
1196 error ("%q#D is a static data member; it can only be "
1197 "initialized at its definition",
1201 if (TREE_CODE (field) != FIELD_DECL)
1203 error ("%q#D is not a non-static data member of %qT",
1207 if (initializing_context (field) != type)
1209 error ("class %qT does not have any field named %qD", type,
1217 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1218 is a _TYPE node or TYPE_DECL which names a base for that type.
1219 Check the validity of NAME, and return either the base _TYPE, base
1220 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1221 NULL_TREE and issue a diagnostic.
1223 An old style unnamed direct single base construction is permitted,
1224 where NAME is NULL. */
1227 expand_member_init (tree name)
1232 if (!current_class_ref)
1237 /* This is an obsolete unnamed base class initializer. The
1238 parser will already have warned about its use. */
1239 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1242 error ("unnamed initializer for %qT, which has no base classes",
1243 current_class_type);
1246 basetype = BINFO_TYPE
1247 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1250 error ("unnamed initializer for %qT, which uses multiple inheritance",
1251 current_class_type);
1255 else if (TYPE_P (name))
1257 basetype = TYPE_MAIN_VARIANT (name);
1258 name = TYPE_NAME (name);
1260 else if (TREE_CODE (name) == TYPE_DECL)
1261 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1263 basetype = NULL_TREE;
1272 if (current_template_parms)
1275 class_binfo = TYPE_BINFO (current_class_type);
1276 direct_binfo = NULL_TREE;
1277 virtual_binfo = NULL_TREE;
1279 /* Look for a direct base. */
1280 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1281 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1284 /* Look for a virtual base -- unless the direct base is itself
1286 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1287 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1289 /* [class.base.init]
1291 If a mem-initializer-id is ambiguous because it designates
1292 both a direct non-virtual base class and an inherited virtual
1293 base class, the mem-initializer is ill-formed. */
1294 if (direct_binfo && virtual_binfo)
1296 error ("%qD is both a direct base and an indirect virtual base",
1301 if (!direct_binfo && !virtual_binfo)
1303 if (CLASSTYPE_VBASECLASSES (current_class_type))
1304 error ("type %qT is not a direct or virtual base of %qT",
1305 basetype, current_class_type);
1307 error ("type %qT is not a direct base of %qT",
1308 basetype, current_class_type);
1312 return direct_binfo ? direct_binfo : virtual_binfo;
1316 if (TREE_CODE (name) == IDENTIFIER_NODE)
1317 field = lookup_field (current_class_type, name, 1, false);
1321 if (member_init_ok_or_else (field, current_class_type, name))
1328 /* This is like `expand_member_init', only it stores one aggregate
1331 INIT comes in two flavors: it is either a value which
1332 is to be stored in EXP, or it is a parameter list
1333 to go to a constructor, which will operate on EXP.
1334 If INIT is not a parameter list for a constructor, then set
1335 LOOKUP_ONLYCONVERTING.
1336 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1337 the initializer, if FLAGS is 0, then it is the (init) form.
1338 If `init' is a CONSTRUCTOR, then we emit a warning message,
1339 explaining that such initializations are invalid.
1341 If INIT resolves to a CALL_EXPR which happens to return
1342 something of the type we are looking for, then we know
1343 that we can safely use that call to perform the
1346 The virtual function table pointer cannot be set up here, because
1347 we do not really know its type.
1349 This never calls operator=().
1351 When initializing, nothing is CONST.
1353 A default copy constructor may have to be used to perform the
1356 A constructor or a conversion operator may have to be used to
1357 perform the initialization, but not both, as it would be ambiguous. */
1360 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1365 tree type = TREE_TYPE (exp);
1366 int was_const = TREE_READONLY (exp);
1367 int was_volatile = TREE_THIS_VOLATILE (exp);
1370 if (init == error_mark_node)
1371 return error_mark_node;
1373 TREE_READONLY (exp) = 0;
1374 TREE_THIS_VOLATILE (exp) = 0;
1376 if (init && TREE_CODE (init) != TREE_LIST
1377 && !(BRACE_ENCLOSED_INITIALIZER_P (init)
1378 && CONSTRUCTOR_IS_DIRECT_INIT (init)))
1379 flags |= LOOKUP_ONLYCONVERTING;
1381 if (TREE_CODE (type) == ARRAY_TYPE)
1385 /* An array may not be initialized use the parenthesized
1386 initialization form -- unless the initializer is "()". */
1387 if (init && TREE_CODE (init) == TREE_LIST)
1389 if (complain & tf_error)
1390 error ("bad array initializer");
1391 return error_mark_node;
1393 /* Must arrange to initialize each element of EXP
1394 from elements of INIT. */
1395 itype = init ? TREE_TYPE (init) : NULL_TREE;
1396 if (cv_qualified_p (type))
1397 TREE_TYPE (exp) = cv_unqualified (type);
1398 if (itype && cv_qualified_p (itype))
1399 TREE_TYPE (init) = cv_unqualified (itype);
1400 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1401 /*explicit_value_init_p=*/false,
1402 itype && same_type_p (TREE_TYPE (init),
1405 TREE_READONLY (exp) = was_const;
1406 TREE_THIS_VOLATILE (exp) = was_volatile;
1407 TREE_TYPE (exp) = type;
1409 TREE_TYPE (init) = itype;
1413 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1414 /* Just know that we've seen something for this node. */
1415 TREE_USED (exp) = 1;
1417 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1418 destroy_temps = stmts_are_full_exprs_p ();
1419 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1420 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1421 init, LOOKUP_NORMAL|flags, complain);
1422 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1423 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1424 TREE_READONLY (exp) = was_const;
1425 TREE_THIS_VOLATILE (exp) = was_volatile;
1431 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1432 tsubst_flags_t complain)
1434 tree type = TREE_TYPE (exp);
1437 /* It fails because there may not be a constructor which takes
1438 its own type as the first (or only parameter), but which does
1439 take other types via a conversion. So, if the thing initializing
1440 the expression is a unit element of type X, first try X(X&),
1441 followed by initialization by X. If neither of these work
1442 out, then look hard. */
1444 VEC(tree,gc) *parms;
1446 if (init && BRACE_ENCLOSED_INITIALIZER_P (init)
1447 && CP_AGGREGATE_TYPE_P (type))
1449 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1450 happen for direct-initialization, too. */
1451 init = digest_init (type, init, complain);
1452 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1453 TREE_SIDE_EFFECTS (init) = 1;
1454 finish_expr_stmt (init);
1458 if (init && TREE_CODE (init) != TREE_LIST
1459 && (flags & LOOKUP_ONLYCONVERTING))
1461 /* Base subobjects should only get direct-initialization. */
1462 gcc_assert (true_exp == exp);
1464 if (flags & DIRECT_BIND)
1465 /* Do nothing. We hit this in two cases: Reference initialization,
1466 where we aren't initializing a real variable, so we don't want
1467 to run a new constructor; and catching an exception, where we
1468 have already built up the constructor call so we could wrap it
1469 in an exception region. */;
1471 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1473 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1474 /* We need to protect the initialization of a catch parm with a
1475 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1476 around the TARGET_EXPR for the copy constructor. See
1477 initialize_handler_parm. */
1479 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1480 TREE_OPERAND (init, 0));
1481 TREE_TYPE (init) = void_type_node;
1484 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1485 TREE_SIDE_EFFECTS (init) = 1;
1486 finish_expr_stmt (init);
1490 if (init == NULL_TREE)
1492 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1494 parms = make_tree_vector ();
1495 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1496 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1499 parms = make_tree_vector_single (init);
1501 if (true_exp == exp)
1502 ctor_name = complete_ctor_identifier;
1504 ctor_name = base_ctor_identifier;
1506 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1510 release_tree_vector (parms);
1512 if (exp == true_exp && TREE_CODE (rval) == CALL_EXPR)
1514 tree fn = get_callee_fndecl (rval);
1515 if (fn && DECL_DECLARED_CONSTEXPR_P (fn))
1517 tree e = maybe_constant_value (rval);
1518 if (TREE_CONSTANT (e))
1519 rval = build2 (INIT_EXPR, type, exp, e);
1523 /* FIXME put back convert_to_void? */
1524 if (TREE_SIDE_EFFECTS (rval))
1525 finish_expr_stmt (rval);
1528 /* This function is responsible for initializing EXP with INIT
1531 BINFO is the binfo of the type for who we are performing the
1532 initialization. For example, if W is a virtual base class of A and B,
1534 If we are initializing B, then W must contain B's W vtable, whereas
1535 were we initializing C, W must contain C's W vtable.
1537 TRUE_EXP is nonzero if it is the true expression being initialized.
1538 In this case, it may be EXP, or may just contain EXP. The reason we
1539 need this is because if EXP is a base element of TRUE_EXP, we
1540 don't necessarily know by looking at EXP where its virtual
1541 baseclass fields should really be pointing. But we do know
1542 from TRUE_EXP. In constructors, we don't know anything about
1543 the value being initialized.
1545 FLAGS is just passed to `build_new_method_call'. See that function
1546 for its description. */
1549 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1550 tsubst_flags_t complain)
1552 tree type = TREE_TYPE (exp);
1554 gcc_assert (init != error_mark_node && type != error_mark_node);
1555 gcc_assert (building_stmt_tree ());
1557 /* Use a function returning the desired type to initialize EXP for us.
1558 If the function is a constructor, and its first argument is
1559 NULL_TREE, know that it was meant for us--just slide exp on
1560 in and expand the constructor. Constructors now come
1563 if (init && TREE_CODE (exp) == VAR_DECL
1564 && COMPOUND_LITERAL_P (init))
1566 /* If store_init_value returns NULL_TREE, the INIT has been
1567 recorded as the DECL_INITIAL for EXP. That means there's
1568 nothing more we have to do. */
1569 init = store_init_value (exp, init, flags);
1571 finish_expr_stmt (init);
1575 /* If an explicit -- but empty -- initializer list was present,
1576 that's value-initialization. */
1577 if (init == void_type_node)
1579 /* If there's a user-provided constructor, we just call that. */
1580 if (type_has_user_provided_constructor (type))
1581 /* Fall through. */;
1582 /* If there isn't, but we still need to call the constructor,
1583 zero out the object first. */
1584 else if (type_build_ctor_call (type))
1586 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1587 init = build2 (INIT_EXPR, type, exp, init);
1588 finish_expr_stmt (init);
1589 /* And then call the constructor. */
1591 /* If we don't need to mess with the constructor at all,
1592 then just zero out the object and we're done. */
1595 init = build2 (INIT_EXPR, type, exp,
1596 build_value_init_noctor (type, complain));
1597 finish_expr_stmt (init);
1603 /* We know that expand_default_init can handle everything we want
1605 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1608 /* Report an error if TYPE is not a user-defined, class type. If
1609 OR_ELSE is nonzero, give an error message. */
1612 is_class_type (tree type, int or_else)
1614 if (type == error_mark_node)
1617 if (! CLASS_TYPE_P (type))
1620 error ("%qT is not a class type", type);
1627 get_type_value (tree name)
1629 if (name == error_mark_node)
1632 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1633 return IDENTIFIER_TYPE_VALUE (name);
1638 /* Build a reference to a member of an aggregate. This is not a C++
1639 `&', but really something which can have its address taken, and
1640 then act as a pointer to member, for example TYPE :: FIELD can have
1641 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1642 this expression is the operand of "&".
1644 @@ Prints out lousy diagnostics for operator <typename>
1647 @@ This function should be rewritten and placed in search.c. */
1650 build_offset_ref (tree type, tree member, bool address_p)
1653 tree basebinfo = NULL_TREE;
1655 /* class templates can come in as TEMPLATE_DECLs here. */
1656 if (TREE_CODE (member) == TEMPLATE_DECL)
1659 if (dependent_scope_p (type) || type_dependent_expression_p (member))
1660 return build_qualified_name (NULL_TREE, type, member,
1661 /*template_p=*/false);
1663 gcc_assert (TYPE_P (type));
1664 if (! is_class_type (type, 1))
1665 return error_mark_node;
1667 gcc_assert (DECL_P (member) || BASELINK_P (member));
1668 /* Callers should call mark_used before this point. */
1669 gcc_assert (!DECL_P (member) || TREE_USED (member));
1671 type = TYPE_MAIN_VARIANT (type);
1672 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type)))
1674 error ("incomplete type %qT does not have member %qD", type, member);
1675 return error_mark_node;
1678 /* Entities other than non-static members need no further
1680 if (TREE_CODE (member) == TYPE_DECL)
1682 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1683 return convert_from_reference (member);
1685 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1687 error ("invalid pointer to bit-field %qD", member);
1688 return error_mark_node;
1691 /* Set up BASEBINFO for member lookup. */
1692 decl = maybe_dummy_object (type, &basebinfo);
1694 /* A lot of this logic is now handled in lookup_member. */
1695 if (BASELINK_P (member))
1697 /* Go from the TREE_BASELINK to the member function info. */
1698 tree t = BASELINK_FUNCTIONS (member);
1700 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1702 /* Get rid of a potential OVERLOAD around it. */
1703 t = OVL_CURRENT (t);
1705 /* Unique functions are handled easily. */
1707 /* For non-static member of base class, we need a special rule
1708 for access checking [class.protected]:
1710 If the access is to form a pointer to member, the
1711 nested-name-specifier shall name the derived class
1712 (or any class derived from that class). */
1713 if (address_p && DECL_P (t)
1714 && DECL_NONSTATIC_MEMBER_P (t))
1715 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1717 perform_or_defer_access_check (basebinfo, t, t);
1719 if (DECL_STATIC_FUNCTION_P (t))
1724 TREE_TYPE (member) = unknown_type_node;
1726 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1727 /* We need additional test besides the one in
1728 check_accessibility_of_qualified_id in case it is
1729 a pointer to non-static member. */
1730 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1734 /* If MEMBER is non-static, then the program has fallen afoul of
1737 An id-expression that denotes a nonstatic data member or
1738 nonstatic member function of a class can only be used:
1740 -- as part of a class member access (_expr.ref_) in which the
1741 object-expression refers to the member's class or a class
1742 derived from that class, or
1744 -- to form a pointer to member (_expr.unary.op_), or
1746 -- in the body of a nonstatic member function of that class or
1747 of a class derived from that class (_class.mfct.nonstatic_), or
1749 -- in a mem-initializer for a constructor for that class or for
1750 a class derived from that class (_class.base.init_). */
1751 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1753 /* Build a representation of the qualified name suitable
1754 for use as the operand to "&" -- even though the "&" is
1755 not actually present. */
1756 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1757 /* In Microsoft mode, treat a non-static member function as if
1758 it were a pointer-to-member. */
1759 if (flag_ms_extensions)
1761 PTRMEM_OK_P (member) = 1;
1762 return cp_build_addr_expr (member, tf_warning_or_error);
1764 error ("invalid use of non-static member function %qD",
1765 TREE_OPERAND (member, 1));
1766 return error_mark_node;
1768 else if (TREE_CODE (member) == FIELD_DECL)
1770 error ("invalid use of non-static data member %qD", member);
1771 return error_mark_node;
1776 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1777 PTRMEM_OK_P (member) = 1;
1781 /* If DECL is a scalar enumeration constant or variable with a
1782 constant initializer, return the initializer (or, its initializers,
1783 recursively); otherwise, return DECL. If INTEGRAL_P, the
1784 initializer is only returned if DECL is an integral
1785 constant-expression. */
1788 constant_value_1 (tree decl, bool integral_p)
1790 while (TREE_CODE (decl) == CONST_DECL
1792 ? decl_constant_var_p (decl)
1793 : (TREE_CODE (decl) == VAR_DECL
1794 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1797 /* If DECL is a static data member in a template
1798 specialization, we must instantiate it here. The
1799 initializer for the static data member is not processed
1800 until needed; we need it now. */
1802 mark_rvalue_use (decl);
1803 init = DECL_INITIAL (decl);
1804 if (init == error_mark_node)
1806 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
1807 /* Treat the error as a constant to avoid cascading errors on
1808 excessively recursive template instantiation (c++/9335). */
1813 /* Initializers in templates are generally expanded during
1814 instantiation, so before that for const int i(2)
1815 INIT is a TREE_LIST with the actual initializer as
1817 if (processing_template_decl
1819 && TREE_CODE (init) == TREE_LIST
1820 && TREE_CHAIN (init) == NULL_TREE)
1821 init = TREE_VALUE (init);
1823 || !TREE_TYPE (init)
1824 || !TREE_CONSTANT (init)
1826 /* Do not return an aggregate constant (of which
1827 string literals are a special case), as we do not
1828 want to make inadvertent copies of such entities,
1829 and we must be sure that their addresses are the
1831 && (TREE_CODE (init) == CONSTRUCTOR
1832 || TREE_CODE (init) == STRING_CST)))
1834 decl = unshare_expr (init);
1839 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1840 constant of integral or enumeration type, then return that value.
1841 These are those variables permitted in constant expressions by
1845 integral_constant_value (tree decl)
1847 return constant_value_1 (decl, /*integral_p=*/true);
1850 /* A more relaxed version of integral_constant_value, used by the
1851 common C/C++ code and by the C++ front end for optimization
1855 decl_constant_value (tree decl)
1857 return constant_value_1 (decl,
1858 /*integral_p=*/processing_template_decl);
1861 /* Common subroutines of build_new and build_vec_delete. */
1863 /* Call the global __builtin_delete to delete ADDR. */
1866 build_builtin_delete_call (tree addr)
1868 mark_used (global_delete_fndecl);
1869 return build_call_n (global_delete_fndecl, 1, addr);
1872 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1873 the type of the object being allocated; otherwise, it's just TYPE.
1874 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1875 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1876 a vector of arguments to be provided as arguments to a placement
1877 new operator. This routine performs no semantic checks; it just
1878 creates and returns a NEW_EXPR. */
1881 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1882 VEC(tree,gc) *init, int use_global_new)
1887 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1888 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1889 permits us to distinguish the case of a missing initializer "new
1890 int" from an empty initializer "new int()". */
1892 init_list = NULL_TREE;
1893 else if (VEC_empty (tree, init))
1894 init_list = void_zero_node;
1896 init_list = build_tree_list_vec (init);
1898 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1899 build_tree_list_vec (placement), type, nelts,
1901 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1902 TREE_SIDE_EFFECTS (new_expr) = 1;
1907 /* Diagnose uninitialized const members or reference members of type
1908 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1909 new expression without a new-initializer and a declaration. Returns
1913 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin,
1914 bool using_new, bool complain)
1917 int error_count = 0;
1919 if (type_has_user_provided_constructor (type))
1922 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1926 if (TREE_CODE (field) != FIELD_DECL)
1929 field_type = strip_array_types (TREE_TYPE (field));
1931 if (type_has_user_provided_constructor (field_type))
1934 if (TREE_CODE (field_type) == REFERENCE_TYPE)
1940 error ("uninitialized reference member in %q#T "
1941 "using %<new%> without new-initializer", origin);
1943 error ("uninitialized reference member in %q#T", origin);
1944 inform (DECL_SOURCE_LOCATION (field),
1945 "%qD should be initialized", field);
1949 if (CP_TYPE_CONST_P (field_type))
1955 error ("uninitialized const member in %q#T "
1956 "using %<new%> without new-initializer", origin);
1958 error ("uninitialized const member in %q#T", origin);
1959 inform (DECL_SOURCE_LOCATION (field),
1960 "%qD should be initialized", field);
1964 if (CLASS_TYPE_P (field_type))
1966 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin,
1967 using_new, complain);
1973 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain)
1975 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain);
1978 /* Generate code for a new-expression, including calling the "operator
1979 new" function, initializing the object, and, if an exception occurs
1980 during construction, cleaning up. The arguments are as for
1981 build_raw_new_expr. This may change PLACEMENT and INIT. */
1984 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1985 VEC(tree,gc) **init, bool globally_qualified_p,
1986 tsubst_flags_t complain)
1989 /* True iff this is a call to "operator new[]" instead of just
1991 bool array_p = false;
1992 /* If ARRAY_P is true, the element type of the array. This is never
1993 an ARRAY_TYPE; for something like "new int[3][4]", the
1994 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1997 /* The type of the new-expression. (This type is always a pointer
2000 tree non_const_pointer_type;
2001 tree outer_nelts = NULL_TREE;
2002 tree alloc_call, alloc_expr;
2003 /* The address returned by the call to "operator new". This node is
2004 a VAR_DECL and is therefore reusable. */
2007 tree cookie_expr, init_expr;
2008 int nothrow, check_new;
2009 int use_java_new = 0;
2010 /* If non-NULL, the number of extra bytes to allocate at the
2011 beginning of the storage allocated for an array-new expression in
2012 order to store the number of elements. */
2013 tree cookie_size = NULL_TREE;
2014 tree placement_first;
2015 tree placement_expr = NULL_TREE;
2016 /* True if the function we are calling is a placement allocation
2018 bool placement_allocation_fn_p;
2019 /* True if the storage must be initialized, either by a constructor
2020 or due to an explicit new-initializer. */
2021 bool is_initialized;
2022 /* The address of the thing allocated, not including any cookie. In
2023 particular, if an array cookie is in use, DATA_ADDR is the
2024 address of the first array element. This node is a VAR_DECL, and
2025 is therefore reusable. */
2027 tree init_preeval_expr = NULL_TREE;
2031 outer_nelts = nelts;
2034 else if (TREE_CODE (type) == ARRAY_TYPE)
2037 nelts = array_type_nelts_top (type);
2038 outer_nelts = nelts;
2039 type = TREE_TYPE (type);
2042 /* If our base type is an array, then make sure we know how many elements
2044 for (elt_type = type;
2045 TREE_CODE (elt_type) == ARRAY_TYPE;
2046 elt_type = TREE_TYPE (elt_type))
2047 nelts = cp_build_binary_op (input_location,
2049 array_type_nelts_top (elt_type),
2052 if (TREE_CODE (elt_type) == VOID_TYPE)
2054 if (complain & tf_error)
2055 error ("invalid type %<void%> for new");
2056 return error_mark_node;
2059 if (abstract_virtuals_error_sfinae (NULL_TREE, elt_type, complain))
2060 return error_mark_node;
2062 is_initialized = (type_build_ctor_call (elt_type) || *init != NULL);
2066 bool maybe_uninitialized_error = false;
2067 /* A program that calls for default-initialization [...] of an
2068 entity of reference type is ill-formed. */
2069 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type))
2070 maybe_uninitialized_error = true;
2072 /* A new-expression that creates an object of type T initializes
2073 that object as follows:
2074 - If the new-initializer is omitted:
2075 -- If T is a (possibly cv-qualified) non-POD class type
2076 (or array thereof), the object is default-initialized (8.5).
2078 -- Otherwise, the object created has indeterminate
2079 value. If T is a const-qualified type, or a (possibly
2080 cv-qualified) POD class type (or array thereof)
2081 containing (directly or indirectly) a member of
2082 const-qualified type, the program is ill-formed; */
2084 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type))
2085 maybe_uninitialized_error = true;
2087 if (maybe_uninitialized_error
2088 && diagnose_uninitialized_cst_or_ref_member (elt_type,
2090 complain & tf_error))
2091 return error_mark_node;
2094 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
2095 && !type_has_user_provided_default_constructor (elt_type))
2097 if (complain & tf_error)
2098 error ("uninitialized const in %<new%> of %q#T", elt_type);
2099 return error_mark_node;
2102 size = size_in_bytes (elt_type);
2104 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2106 alloc_fn = NULL_TREE;
2108 /* If PLACEMENT is a single simple pointer type not passed by
2109 reference, prepare to capture it in a temporary variable. Do
2110 this now, since PLACEMENT will change in the calls below. */
2111 placement_first = NULL_TREE;
2112 if (VEC_length (tree, *placement) == 1
2113 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
2115 placement_first = VEC_index (tree, *placement, 0);
2117 /* Allocate the object. */
2118 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
2121 tree class_decl = build_java_class_ref (elt_type);
2122 static const char alloc_name[] = "_Jv_AllocObject";
2124 if (class_decl == error_mark_node)
2125 return error_mark_node;
2128 if (!get_global_value_if_present (get_identifier (alloc_name),
2131 if (complain & tf_error)
2132 error ("call to Java constructor with %qs undefined", alloc_name);
2133 return error_mark_node;
2135 else if (really_overloaded_fn (alloc_fn))
2137 if (complain & tf_error)
2138 error ("%qD should never be overloaded", alloc_fn);
2139 return error_mark_node;
2141 alloc_fn = OVL_CURRENT (alloc_fn);
2142 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2143 alloc_call = cp_build_function_call_nary (alloc_fn, complain,
2144 class_addr, NULL_TREE);
2146 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
2148 error ("Java class %q#T object allocated using placement new", elt_type);
2149 return error_mark_node;
2156 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
2158 if (!globally_qualified_p
2159 && CLASS_TYPE_P (elt_type)
2161 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
2162 : TYPE_HAS_NEW_OPERATOR (elt_type)))
2164 /* Use a class-specific operator new. */
2165 /* If a cookie is required, add some extra space. */
2166 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2168 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2169 size = size_binop (PLUS_EXPR, size, cookie_size);
2171 /* Create the argument list. */
2172 VEC_safe_insert (tree, gc, *placement, 0, size);
2173 /* Do name-lookup to find the appropriate operator. */
2174 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
2175 if (fns == NULL_TREE)
2177 if (complain & tf_error)
2178 error ("no suitable %qD found in class %qT", fnname, elt_type);
2179 return error_mark_node;
2181 if (TREE_CODE (fns) == TREE_LIST)
2183 if (complain & tf_error)
2185 error ("request for member %qD is ambiguous", fnname);
2186 print_candidates (fns);
2188 return error_mark_node;
2190 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2192 /*conversion_path=*/NULL_TREE,
2199 /* Use a global operator new. */
2200 /* See if a cookie might be required. */
2201 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2202 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2204 cookie_size = NULL_TREE;
2206 alloc_call = build_operator_new_call (fnname, placement,
2207 &size, &cookie_size,
2212 if (alloc_call == error_mark_node)
2213 return error_mark_node;
2215 gcc_assert (alloc_fn != NULL_TREE);
2217 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2218 into a temporary variable. */
2219 if (!processing_template_decl
2220 && placement_first != NULL_TREE
2221 && TREE_CODE (alloc_call) == CALL_EXPR
2222 && call_expr_nargs (alloc_call) == 2
2223 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2224 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2226 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2228 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2229 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2231 placement_expr = get_target_expr (placement_first);
2232 CALL_EXPR_ARG (alloc_call, 1)
2233 = convert (TREE_TYPE (placement_arg), placement_expr);
2237 /* In the simple case, we can stop now. */
2238 pointer_type = build_pointer_type (type);
2239 if (!cookie_size && !is_initialized)
2240 return build_nop (pointer_type, alloc_call);
2242 /* Store the result of the allocation call in a variable so that we can
2243 use it more than once. */
2244 alloc_expr = get_target_expr (alloc_call);
2245 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2247 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2248 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2249 alloc_call = TREE_OPERAND (alloc_call, 1);
2251 /* Now, check to see if this function is actually a placement
2252 allocation function. This can happen even when PLACEMENT is NULL
2253 because we might have something like:
2255 struct S { void* operator new (size_t, int i = 0); };
2257 A call to `new S' will get this allocation function, even though
2258 there is no explicit placement argument. If there is more than
2259 one argument, or there are variable arguments, then this is a
2260 placement allocation function. */
2261 placement_allocation_fn_p
2262 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2263 || varargs_function_p (alloc_fn));
2265 /* Preevaluate the placement args so that we don't reevaluate them for a
2266 placement delete. */
2267 if (placement_allocation_fn_p)
2270 stabilize_call (alloc_call, &inits);
2272 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2276 /* unless an allocation function is declared with an empty excep-
2277 tion-specification (_except.spec_), throw(), it indicates failure to
2278 allocate storage by throwing a bad_alloc exception (clause _except_,
2279 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2280 cation function is declared with an empty exception-specification,
2281 throw(), it returns null to indicate failure to allocate storage and a
2282 non-null pointer otherwise.
2284 So check for a null exception spec on the op new we just called. */
2286 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2287 check_new = (flag_check_new || nothrow) && ! use_java_new;
2295 /* Adjust so we're pointing to the start of the object. */
2296 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2297 alloc_node, cookie_size);
2299 /* Store the number of bytes allocated so that we can know how
2300 many elements to destroy later. We use the last sizeof
2301 (size_t) bytes to store the number of elements. */
2302 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2303 cookie_ptr = fold_build2_loc (input_location,
2304 POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2305 alloc_node, cookie_ptr);
2306 size_ptr_type = build_pointer_type (sizetype);
2307 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2308 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2310 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2312 if (targetm.cxx.cookie_has_size ())
2314 /* Also store the element size. */
2315 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2316 fold_build1_loc (input_location,
2317 NEGATE_EXPR, sizetype,
2318 size_in_bytes (sizetype)));
2320 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2321 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2322 size_in_bytes (elt_type));
2323 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2324 cookie, cookie_expr);
2329 cookie_expr = NULL_TREE;
2330 data_addr = alloc_node;
2333 /* Now use a pointer to the type we've actually allocated. */
2335 /* But we want to operate on a non-const version to start with,
2336 since we'll be modifying the elements. */
2337 non_const_pointer_type = build_pointer_type
2338 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST));
2340 data_addr = fold_convert (non_const_pointer_type, data_addr);
2341 /* Any further uses of alloc_node will want this type, too. */
2342 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2344 /* Now initialize the allocated object. Note that we preevaluate the
2345 initialization expression, apart from the actual constructor call or
2346 assignment--we do this because we want to delay the allocation as long
2347 as possible in order to minimize the size of the exception region for
2348 placement delete. */
2352 bool explicit_value_init_p = false;
2354 if (*init != NULL && VEC_empty (tree, *init))
2357 explicit_value_init_p = true;
2360 if (processing_template_decl && explicit_value_init_p)
2362 /* build_value_init doesn't work in templates, and we don't need
2363 the initializer anyway since we're going to throw it away and
2364 rebuild it at instantiation time, so just build up a single
2365 constructor call to get any appropriate diagnostics. */
2366 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2367 if (type_build_ctor_call (elt_type))
2368 init_expr = build_special_member_call (init_expr,
2369 complete_ctor_identifier,
2373 stable = stabilize_init (init_expr, &init_preeval_expr);
2377 tree vecinit = NULL_TREE;
2378 if (*init && VEC_length (tree, *init) == 1
2379 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2380 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2382 tree arraytype, domain;
2383 vecinit = VEC_index (tree, *init, 0);
2384 if (TREE_CONSTANT (nelts))
2385 domain = compute_array_index_type (NULL_TREE, nelts, complain);
2389 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2390 warning (0, "non-constant array size in new, unable to "
2391 "verify length of initializer-list");
2393 arraytype = build_cplus_array_type (type, domain);
2394 vecinit = digest_init (arraytype, vecinit, complain);
2398 if (complain & tf_error)
2399 permerror (input_location, "ISO C++ forbids initialization in array new");
2401 return error_mark_node;
2402 vecinit = build_tree_list_vec (*init);
2405 = build_vec_init (data_addr,
2406 cp_build_binary_op (input_location,
2407 MINUS_EXPR, outer_nelts,
2411 explicit_value_init_p,
2415 /* An array initialization is stable because the initialization
2416 of each element is a full-expression, so the temporaries don't
2422 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2424 if (type_build_ctor_call (type) && !explicit_value_init_p)
2426 init_expr = build_special_member_call (init_expr,
2427 complete_ctor_identifier,
2432 else if (explicit_value_init_p)
2434 /* Something like `new int()'. */
2435 tree val = build_value_init (type, complain);
2436 if (val == error_mark_node)
2437 return error_mark_node;
2438 init_expr = build2 (INIT_EXPR, type, init_expr, val);
2444 /* We are processing something like `new int (10)', which
2445 means allocate an int, and initialize it with 10. */
2447 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2448 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2451 stable = stabilize_init (init_expr, &init_preeval_expr);
2454 if (init_expr == error_mark_node)
2455 return error_mark_node;
2457 /* If any part of the object initialization terminates by throwing an
2458 exception and a suitable deallocation function can be found, the
2459 deallocation function is called to free the memory in which the
2460 object was being constructed, after which the exception continues
2461 to propagate in the context of the new-expression. If no
2462 unambiguous matching deallocation function can be found,
2463 propagating the exception does not cause the object's memory to be
2465 if (flag_exceptions && ! use_java_new)
2467 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2470 /* The Standard is unclear here, but the right thing to do
2471 is to use the same method for finding deallocation
2472 functions that we use for finding allocation functions. */
2473 cleanup = (build_op_delete_call
2477 globally_qualified_p,
2478 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2484 /* This is much simpler if we were able to preevaluate all of
2485 the arguments to the constructor call. */
2487 /* CLEANUP is compiler-generated, so no diagnostics. */
2488 TREE_NO_WARNING (cleanup) = true;
2489 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2490 init_expr, cleanup);
2491 /* Likewise, this try-catch is compiler-generated. */
2492 TREE_NO_WARNING (init_expr) = true;
2495 /* Ack! First we allocate the memory. Then we set our sentry
2496 variable to true, and expand a cleanup that deletes the
2497 memory if sentry is true. Then we run the constructor, and
2498 finally clear the sentry.
2500 We need to do this because we allocate the space first, so
2501 if there are any temporaries with cleanups in the
2502 constructor args and we weren't able to preevaluate them, we
2503 need this EH region to extend until end of full-expression
2504 to preserve nesting. */
2506 tree end, sentry, begin;
2508 begin = get_target_expr (boolean_true_node);
2509 CLEANUP_EH_ONLY (begin) = 1;
2511 sentry = TARGET_EXPR_SLOT (begin);
2513 /* CLEANUP is compiler-generated, so no diagnostics. */
2514 TREE_NO_WARNING (cleanup) = true;
2516 TARGET_EXPR_CLEANUP (begin)
2517 = build3 (COND_EXPR, void_type_node, sentry,
2518 cleanup, void_zero_node);
2520 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2521 sentry, boolean_false_node);
2524 = build2 (COMPOUND_EXPR, void_type_node, begin,
2525 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2527 /* Likewise, this is compiler-generated. */
2528 TREE_NO_WARNING (init_expr) = true;
2533 init_expr = NULL_TREE;
2535 /* Now build up the return value in reverse order. */
2540 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2542 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2544 if (rval == data_addr)
2545 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2546 and return the call (which doesn't need to be adjusted). */
2547 rval = TARGET_EXPR_INITIAL (alloc_expr);
2552 tree ifexp = cp_build_binary_op (input_location,
2553 NE_EXPR, alloc_node,
2556 rval = build_conditional_expr (ifexp, rval, alloc_node,
2560 /* Perform the allocation before anything else, so that ALLOC_NODE
2561 has been initialized before we start using it. */
2562 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2565 if (init_preeval_expr)
2566 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2568 /* A new-expression is never an lvalue. */
2569 gcc_assert (!lvalue_p (rval));
2571 return convert (pointer_type, rval);
2574 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2575 is a vector of placement-new arguments (or NULL if none). If NELTS
2576 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2577 is not NULL, then this is an array-new allocation; TYPE is the type
2578 of the elements in the array and NELTS is the number of elements in
2579 the array. *INIT, if non-NULL, is the initializer for the new
2580 object, or an empty vector to indicate an initializer of "()". If
2581 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2582 rather than just "new". This may change PLACEMENT and INIT. */
2585 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2586 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2589 VEC(tree,gc) *orig_placement = NULL;
2590 tree orig_nelts = NULL_TREE;
2591 VEC(tree,gc) *orig_init = NULL;
2593 if (type == error_mark_node)
2594 return error_mark_node;
2596 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2598 tree auto_node = type_uses_auto (type);
2601 tree d_init = VEC_index (tree, *init, 0);
2602 d_init = resolve_nondeduced_context (d_init);
2603 if (describable_type (d_init))
2604 type = do_auto_deduction (type, d_init, auto_node);
2608 if (processing_template_decl)
2610 if (dependent_type_p (type)
2611 || any_type_dependent_arguments_p (*placement)
2612 || (nelts && type_dependent_expression_p (nelts))
2613 || any_type_dependent_arguments_p (*init))
2614 return build_raw_new_expr (*placement, type, nelts, *init,
2617 orig_placement = make_tree_vector_copy (*placement);
2619 orig_init = make_tree_vector_copy (*init);
2621 make_args_non_dependent (*placement);
2623 nelts = build_non_dependent_expr (nelts);
2624 make_args_non_dependent (*init);
2629 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2631 if (complain & tf_error)
2632 permerror (input_location, "size in array new must have integral type");
2634 return error_mark_node;
2636 nelts = mark_rvalue_use (nelts);
2637 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2640 /* ``A reference cannot be created by the new operator. A reference
2641 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2642 returned by new.'' ARM 5.3.3 */
2643 if (TREE_CODE (type) == REFERENCE_TYPE)
2645 if (complain & tf_error)
2646 error ("new cannot be applied to a reference type");
2648 return error_mark_node;
2649 type = TREE_TYPE (type);
2652 if (TREE_CODE (type) == FUNCTION_TYPE)
2654 if (complain & tf_error)
2655 error ("new cannot be applied to a function type");
2656 return error_mark_node;
2659 /* The type allocated must be complete. If the new-type-id was
2660 "T[N]" then we are just checking that "T" is complete here, but
2661 that is equivalent, since the value of "N" doesn't matter. */
2662 if (!complete_type_or_maybe_complain (type, NULL_TREE, complain))
2663 return error_mark_node;
2665 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2666 if (rval == error_mark_node)
2667 return error_mark_node;
2669 if (processing_template_decl)
2671 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2672 orig_init, use_global_new);
2673 release_tree_vector (orig_placement);
2674 release_tree_vector (orig_init);
2678 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2679 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2680 TREE_NO_WARNING (rval) = 1;
2685 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2688 build_java_class_ref (tree type)
2690 tree name = NULL_TREE, class_decl;
2691 static tree CL_suffix = NULL_TREE;
2692 if (CL_suffix == NULL_TREE)
2693 CL_suffix = get_identifier("class$");
2694 if (jclass_node == NULL_TREE)
2696 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2697 if (jclass_node == NULL_TREE)
2699 error ("call to Java constructor, while %<jclass%> undefined");
2700 return error_mark_node;
2702 jclass_node = TREE_TYPE (jclass_node);
2705 /* Mangle the class$ field. */
2708 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2709 if (DECL_NAME (field) == CL_suffix)
2711 mangle_decl (field);
2712 name = DECL_ASSEMBLER_NAME (field);
2717 error ("can%'t find %<class$%> in %qT", type);
2718 return error_mark_node;
2722 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2723 if (class_decl == NULL_TREE)
2725 class_decl = build_decl (input_location,
2726 VAR_DECL, name, TREE_TYPE (jclass_node));
2727 TREE_STATIC (class_decl) = 1;
2728 DECL_EXTERNAL (class_decl) = 1;
2729 TREE_PUBLIC (class_decl) = 1;
2730 DECL_ARTIFICIAL (class_decl) = 1;
2731 DECL_IGNORED_P (class_decl) = 1;
2732 pushdecl_top_level (class_decl);
2733 make_decl_rtl (class_decl);
2739 build_vec_delete_1 (tree base, tree maxindex, tree type,
2740 special_function_kind auto_delete_vec,
2741 int use_global_delete, tsubst_flags_t complain)
2744 tree ptype = build_pointer_type (type = complete_type (type));
2745 tree size_exp = size_in_bytes (type);
2747 /* Temporary variables used by the loop. */
2748 tree tbase, tbase_init;
2750 /* This is the body of the loop that implements the deletion of a
2751 single element, and moves temp variables to next elements. */
2754 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2757 /* This is the thing that governs what to do after the loop has run. */
2758 tree deallocate_expr = 0;
2760 /* This is the BIND_EXPR which holds the outermost iterator of the
2761 loop. It is convenient to set this variable up and test it before
2762 executing any other code in the loop.
2763 This is also the containing expression returned by this function. */
2764 tree controller = NULL_TREE;
2767 /* We should only have 1-D arrays here. */
2768 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2770 if (base == error_mark_node || maxindex == error_mark_node)
2771 return error_mark_node;
2773 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2776 /* The below is short by the cookie size. */
2777 virtual_size = size_binop (MULT_EXPR, size_exp,
2778 convert (sizetype, maxindex));
2780 tbase = create_temporary_var (ptype);
2781 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2782 fold_build2_loc (input_location,
2783 POINTER_PLUS_EXPR, ptype,
2784 fold_convert (ptype, base),
2787 if (tbase_init == error_mark_node)
2788 return error_mark_node;
2789 controller = build3 (BIND_EXPR, void_type_node, tbase,
2790 NULL_TREE, NULL_TREE);
2791 TREE_SIDE_EFFECTS (controller) = 1;
2793 body = build1 (EXIT_EXPR, void_type_node,
2794 build2 (EQ_EXPR, boolean_type_node, tbase,
2795 fold_convert (ptype, base)));
2796 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp);
2797 tmp = build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp);
2798 tmp = cp_build_modify_expr (tbase, NOP_EXPR, tmp, complain);
2799 if (tmp == error_mark_node)
2800 return error_mark_node;
2801 body = build_compound_expr (input_location, body, tmp);
2802 tmp = build_delete (ptype, tbase, sfk_complete_destructor,
2803 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1,
2805 if (tmp == error_mark_node)
2806 return error_mark_node;
2807 body = build_compound_expr (input_location, body, tmp);
2809 loop = build1 (LOOP_EXPR, void_type_node, body);
2810 loop = build_compound_expr (input_location, tbase_init, loop);
2813 /* Delete the storage if appropriate. */
2814 if (auto_delete_vec == sfk_deleting_destructor)
2818 /* The below is short by the cookie size. */
2819 virtual_size = size_binop (MULT_EXPR, size_exp,
2820 convert (sizetype, maxindex));
2822 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2829 cookie_size = targetm.cxx.get_cookie_size (type);
2830 base_tbd = cp_build_binary_op (input_location,
2832 cp_convert (string_type_node,
2836 if (base_tbd == error_mark_node)
2837 return error_mark_node;
2838 base_tbd = cp_convert (ptype, base_tbd);
2839 /* True size with header. */
2840 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2843 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2844 base_tbd, virtual_size,
2845 use_global_delete & 1,
2846 /*placement=*/NULL_TREE,
2847 /*alloc_fn=*/NULL_TREE);
2851 if (!deallocate_expr)
2854 body = deallocate_expr;
2856 body = build_compound_expr (input_location, body, deallocate_expr);
2859 body = integer_zero_node;
2861 /* Outermost wrapper: If pointer is null, punt. */
2862 body = fold_build3_loc (input_location, COND_EXPR, void_type_node,
2863 fold_build2_loc (input_location,
2864 NE_EXPR, boolean_type_node, base,
2865 convert (TREE_TYPE (base),
2866 integer_zero_node)),
2867 body, integer_zero_node);
2868 body = build1 (NOP_EXPR, void_type_node, body);
2872 TREE_OPERAND (controller, 1) = body;
2876 if (TREE_CODE (base) == SAVE_EXPR)
2877 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2878 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2880 return convert_to_void (body, ICV_CAST, complain);
2883 /* Create an unnamed variable of the indicated TYPE. */
2886 create_temporary_var (tree type)
2890 decl = build_decl (input_location,
2891 VAR_DECL, NULL_TREE, type);
2892 TREE_USED (decl) = 1;
2893 DECL_ARTIFICIAL (decl) = 1;
2894 DECL_IGNORED_P (decl) = 1;
2895 DECL_CONTEXT (decl) = current_function_decl;
2900 /* Create a new temporary variable of the indicated TYPE, initialized
2903 It is not entered into current_binding_level, because that breaks
2904 things when it comes time to do final cleanups (which take place
2905 "outside" the binding contour of the function). */
2908 get_temp_regvar (tree type, tree init)
2912 decl = create_temporary_var (type);
2913 add_decl_expr (decl);
2915 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2916 tf_warning_or_error));
2921 /* `build_vec_init' returns tree structure that performs
2922 initialization of a vector of aggregate types.
2924 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2925 to the first element, of POINTER_TYPE.
2926 MAXINDEX is the maximum index of the array (one less than the
2927 number of elements). It is only used if BASE is a pointer or
2928 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2930 INIT is the (possibly NULL) initializer.
2932 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2933 elements in the array are value-initialized.
2935 FROM_ARRAY is 0 if we should init everything with INIT
2936 (i.e., every element initialized from INIT).
2937 FROM_ARRAY is 1 if we should index into INIT in parallel
2938 with initialization of DECL.
2939 FROM_ARRAY is 2 if we should index into INIT in parallel,
2940 but use assignment instead of initialization. */
2943 build_vec_init (tree base, tree maxindex, tree init,
2944 bool explicit_value_init_p,
2945 int from_array, tsubst_flags_t complain)
2948 tree base2 = NULL_TREE;
2949 tree itype = NULL_TREE;
2951 /* The type of BASE. */
2952 tree atype = TREE_TYPE (base);
2953 /* The type of an element in the array. */
2954 tree type = TREE_TYPE (atype);
2955 /* The element type reached after removing all outer array
2957 tree inner_elt_type;
2958 /* The type of a pointer to an element in the array. */
2963 tree try_block = NULL_TREE;
2964 int num_initialized_elts = 0;
2966 tree const_init = NULL_TREE;
2968 bool xvalue = false;
2969 bool errors = false;
2971 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2972 maxindex = array_type_nelts (atype);
2974 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2975 return error_mark_node;
2977 if (explicit_value_init_p)
2980 inner_elt_type = strip_array_types (type);
2982 /* Look through the TARGET_EXPR around a compound literal. */
2983 if (init && TREE_CODE (init) == TARGET_EXPR
2984 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR
2986 init = TARGET_EXPR_INITIAL (init);
2989 && TREE_CODE (atype) == ARRAY_TYPE
2991 ? (!CLASS_TYPE_P (inner_elt_type)
2992 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type))
2993 : !TYPE_NEEDS_CONSTRUCTING (type))
2994 && ((TREE_CODE (init) == CONSTRUCTOR
2995 /* Don't do this if the CONSTRUCTOR might contain something
2996 that might throw and require us to clean up. */
2997 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2998 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
3001 /* Do non-default initialization of trivial arrays resulting from
3002 brace-enclosed initializers. In this case, digest_init and
3003 store_constructor will handle the semantics for us. */
3005 stmt_expr = build2 (INIT_EXPR, atype, base, init);
3009 maxindex = cp_convert (ptrdiff_type_node, maxindex);
3010 if (TREE_CODE (atype) == ARRAY_TYPE)
3012 ptype = build_pointer_type (type);
3013 base = cp_convert (ptype, decay_conversion (base));
3018 /* The code we are generating looks like:
3022 ptrdiff_t iterator = maxindex;
3024 for (; iterator != -1; --iterator) {
3025 ... initialize *t1 ...
3029 ... destroy elements that were constructed ...
3034 We can omit the try and catch blocks if we know that the
3035 initialization will never throw an exception, or if the array
3036 elements do not have destructors. We can omit the loop completely if
3037 the elements of the array do not have constructors.
3039 We actually wrap the entire body of the above in a STMT_EXPR, for
3042 When copying from array to another, when the array elements have
3043 only trivial copy constructors, we should use __builtin_memcpy
3044 rather than generating a loop. That way, we could take advantage
3045 of whatever cleverness the back end has for dealing with copies
3046 of blocks of memory. */
3048 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
3049 destroy_temps = stmts_are_full_exprs_p ();
3050 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3051 rval = get_temp_regvar (ptype, base);
3052 base = get_temp_regvar (ptype, rval);
3053 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
3055 /* If initializing one array from another, initialize element by
3056 element. We rely upon the below calls to do the argument
3057 checking. Evaluate the initializer before entering the try block. */
3058 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR)
3060 if (lvalue_kind (init) & clk_rvalueref)
3062 base2 = decay_conversion (init);
3063 itype = TREE_TYPE (base2);
3064 base2 = get_temp_regvar (itype, base2);
3065 itype = TREE_TYPE (itype);
3068 /* Protect the entire array initialization so that we can destroy
3069 the partially constructed array if an exception is thrown.
3070 But don't do this if we're assigning. */
3071 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3074 try_block = begin_try_block ();
3077 /* Maybe pull out constant value when from_array? */
3079 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
3081 /* Do non-default initialization of non-trivial arrays resulting from
3082 brace-enclosed initializers. */
3083 unsigned HOST_WIDE_INT idx;
3085 /* Should we try to create a constant initializer? */
3086 bool try_const = (literal_type_p (inner_elt_type)
3087 || TYPE_HAS_CONSTEXPR_CTOR (inner_elt_type));
3088 bool saw_non_const = false;
3089 bool saw_const = false;
3090 /* If we're initializing a static array, we want to do static
3091 initialization of any elements with constant initializers even if
3092 some are non-constant. */
3093 bool do_static_init = (DECL_P (obase) && TREE_STATIC (obase));
3094 VEC(constructor_elt,gc) *new_vec;
3098 new_vec = VEC_alloc (constructor_elt, gc, CONSTRUCTOR_NELTS (init));
3102 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx, field, elt)
3104 tree baseref = build1 (INDIRECT_REF, type, base);
3107 num_initialized_elts++;
3109 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3110 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
3111 one_init = build_aggr_init (baseref, elt, 0, complain);
3113 one_init = cp_build_modify_expr (baseref, NOP_EXPR,
3115 if (one_init == error_mark_node)
3120 if (TREE_CODE (e) == EXPR_STMT)
3121 e = TREE_OPERAND (e, 0);
3122 if (TREE_CODE (e) == CONVERT_EXPR
3123 && VOID_TYPE_P (TREE_TYPE (e)))
3124 e = TREE_OPERAND (e, 0);
3125 e = maybe_constant_init (e);
3126 if (reduced_constant_expression_p (e))
3128 CONSTRUCTOR_APPEND_ELT (new_vec, field, e);
3130 one_init = NULL_TREE;
3132 one_init = build2 (INIT_EXPR, type, baseref, e);
3138 CONSTRUCTOR_APPEND_ELT (new_vec, field,
3139 build_zero_init (TREE_TYPE (e),
3141 saw_non_const = true;
3146 finish_expr_stmt (one_init);
3147 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3149 one_init = cp_build_unary_op (PREINCREMENT_EXPR, base, 0, complain);
3150 if (one_init == error_mark_node)
3153 finish_expr_stmt (one_init);
3155 one_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3157 if (one_init == error_mark_node)
3160 finish_expr_stmt (one_init);
3166 const_init = build_constructor (atype, new_vec);
3167 else if (do_static_init && saw_const)
3168 DECL_INITIAL (obase) = build_constructor (atype, new_vec);
3170 VEC_free (constructor_elt, gc, new_vec);
3173 /* Clear out INIT so that we don't get confused below. */
3176 else if (from_array)
3179 /* OK, we set base2 above. */;
3180 else if (CLASS_TYPE_P (type)
3181 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3183 if (complain & tf_error)
3184 error ("initializer ends prematurely");
3189 /* Now, default-initialize any remaining elements. We don't need to
3190 do that if a) the type does not need constructing, or b) we've
3191 already initialized all the elements.
3193 We do need to keep going if we're copying an array. */
3196 || ((type_build_ctor_call (type) || explicit_value_init_p)
3197 && ! (host_integerp (maxindex, 0)
3198 && (num_initialized_elts
3199 == tree_low_cst (maxindex, 0) + 1))))
3201 /* If the ITERATOR is equal to -1, then we don't have to loop;
3202 we've already initialized all the elements. */
3207 for_stmt = begin_for_stmt (NULL_TREE, NULL_TREE);
3208 finish_for_init_stmt (for_stmt);
3209 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
3210 build_int_cst (TREE_TYPE (iterator), -1)),
3212 elt_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3214 if (elt_init == error_mark_node)
3216 finish_for_expr (elt_init, for_stmt);
3218 to = build1 (INDIRECT_REF, type, base);
3226 from = build1 (INDIRECT_REF, itype, base2);
3233 if (from_array == 2)
3234 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3236 else if (type_build_ctor_call (type))
3237 elt_init = build_aggr_init (to, from, 0, complain);
3239 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3244 else if (TREE_CODE (type) == ARRAY_TYPE)
3248 ("cannot initialize multi-dimensional array with initializer");
3249 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
3251 explicit_value_init_p,
3254 else if (explicit_value_init_p)
3256 elt_init = build_value_init (type, complain);
3257 if (elt_init != error_mark_node)
3258 elt_init = build2 (INIT_EXPR, type, to, elt_init);
3262 gcc_assert (type_build_ctor_call (type));
3263 elt_init = build_aggr_init (to, init, 0, complain);
3266 if (elt_init == error_mark_node)
3269 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3270 finish_expr_stmt (elt_init);
3271 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3273 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
3276 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
3279 finish_for_stmt (for_stmt);
3282 /* Make sure to cleanup any partially constructed elements. */
3283 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3287 tree m = cp_build_binary_op (input_location,
3288 MINUS_EXPR, maxindex, iterator,
3291 /* Flatten multi-dimensional array since build_vec_delete only
3292 expects one-dimensional array. */
3293 if (TREE_CODE (type) == ARRAY_TYPE)
3294 m = cp_build_binary_op (input_location,
3296 array_type_nelts_total (type),
3299 finish_cleanup_try_block (try_block);
3300 e = build_vec_delete_1 (rval, m,
3301 inner_elt_type, sfk_complete_destructor,
3302 /*use_global_delete=*/0, complain);
3303 if (e == error_mark_node)
3305 finish_cleanup (e, try_block);
3308 /* The value of the array initialization is the array itself, RVAL
3309 is a pointer to the first element. */
3310 finish_stmt_expr_expr (rval, stmt_expr);
3312 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
3314 /* Now make the result have the correct type. */
3315 if (TREE_CODE (atype) == ARRAY_TYPE)
3317 atype = build_pointer_type (atype);
3318 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
3319 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain);
3320 TREE_NO_WARNING (stmt_expr) = 1;
3323 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3326 return build2 (INIT_EXPR, atype, obase, const_init);
3328 return error_mark_node;
3332 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3336 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags,
3337 tsubst_flags_t complain)
3343 case sfk_complete_destructor:
3344 name = complete_dtor_identifier;
3347 case sfk_base_destructor:
3348 name = base_dtor_identifier;
3351 case sfk_deleting_destructor:
3352 name = deleting_dtor_identifier;
3358 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
3359 return build_new_method_call (exp, fn,
3361 /*conversion_path=*/NULL_TREE,
3367 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3368 ADDR is an expression which yields the store to be destroyed.
3369 AUTO_DELETE is the name of the destructor to call, i.e., either
3370 sfk_complete_destructor, sfk_base_destructor, or
3371 sfk_deleting_destructor.
3373 FLAGS is the logical disjunction of zero or more LOOKUP_
3374 flags. See cp-tree.h for more info. */
3377 build_delete (tree type, tree addr, special_function_kind auto_delete,
3378 int flags, int use_global_delete, tsubst_flags_t complain)
3382 if (addr == error_mark_node)
3383 return error_mark_node;
3385 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3386 set to `error_mark_node' before it gets properly cleaned up. */
3387 if (type == error_mark_node)
3388 return error_mark_node;
3390 type = TYPE_MAIN_VARIANT (type);
3392 addr = mark_rvalue_use (addr);
3394 if (TREE_CODE (type) == POINTER_TYPE)
3396 bool complete_p = true;
3398 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3399 if (TREE_CODE (type) == ARRAY_TYPE)
3402 /* We don't want to warn about delete of void*, only other
3403 incomplete types. Deleting other incomplete types
3404 invokes undefined behavior, but it is not ill-formed, so
3405 compile to something that would even do The Right Thing
3406 (TM) should the type have a trivial dtor and no delete
3408 if (!VOID_TYPE_P (type))
3410 complete_type (type);
3411 if (!COMPLETE_TYPE_P (type))
3413 if ((complain & tf_warning)
3414 && warning (0, "possible problem detected in invocation of "
3415 "delete operator:"))
3417 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3418 inform (input_location, "neither the destructor nor the class-specific "
3419 "operator delete will be called, even if they are "
3420 "declared when the class is defined");
3425 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3426 /* Call the builtin operator delete. */
3427 return build_builtin_delete_call (addr);
3428 if (TREE_SIDE_EFFECTS (addr))
3429 addr = save_expr (addr);
3431 /* Throw away const and volatile on target type of addr. */
3432 addr = convert_force (build_pointer_type (type), addr, 0);
3434 else if (TREE_CODE (type) == ARRAY_TYPE)
3438 if (TYPE_DOMAIN (type) == NULL_TREE)
3440 if (complain & tf_error)
3441 error ("unknown array size in delete");
3442 return error_mark_node;
3444 return build_vec_delete (addr, array_type_nelts (type),
3445 auto_delete, use_global_delete, complain);
3449 /* Don't check PROTECT here; leave that decision to the
3450 destructor. If the destructor is accessible, call it,
3451 else report error. */
3452 addr = cp_build_addr_expr (addr, complain);
3453 if (addr == error_mark_node)
3454 return error_mark_node;
3455 if (TREE_SIDE_EFFECTS (addr))
3456 addr = save_expr (addr);
3458 addr = convert_force (build_pointer_type (type), addr, 0);
3461 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3463 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3465 if (auto_delete != sfk_deleting_destructor)
3466 return void_zero_node;
3468 return build_op_delete_call (DELETE_EXPR, addr,
3469 cxx_sizeof_nowarn (type),
3471 /*placement=*/NULL_TREE,
3472 /*alloc_fn=*/NULL_TREE);
3476 tree head = NULL_TREE;
3477 tree do_delete = NULL_TREE;
3480 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3481 lazily_declare_fn (sfk_destructor, type);
3483 /* For `::delete x', we must not use the deleting destructor
3484 since then we would not be sure to get the global `operator
3486 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3488 /* We will use ADDR multiple times so we must save it. */
3489 addr = save_expr (addr);
3490 head = get_target_expr (build_headof (addr));
3491 /* Delete the object. */
3492 do_delete = build_builtin_delete_call (head);
3493 /* Otherwise, treat this like a complete object destructor
3495 auto_delete = sfk_complete_destructor;
3497 /* If the destructor is non-virtual, there is no deleting
3498 variant. Instead, we must explicitly call the appropriate
3499 `operator delete' here. */
3500 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3501 && auto_delete == sfk_deleting_destructor)
3503 /* We will use ADDR multiple times so we must save it. */
3504 addr = save_expr (addr);
3505 /* Build the call. */
3506 do_delete = build_op_delete_call (DELETE_EXPR,
3508 cxx_sizeof_nowarn (type),
3510 /*placement=*/NULL_TREE,
3511 /*alloc_fn=*/NULL_TREE);
3512 /* Call the complete object destructor. */
3513 auto_delete = sfk_complete_destructor;
3515 else if (auto_delete == sfk_deleting_destructor
3516 && TYPE_GETS_REG_DELETE (type))
3518 /* Make sure we have access to the member op delete, even though
3519 we'll actually be calling it from the destructor. */
3520 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3522 /*placement=*/NULL_TREE,
3523 /*alloc_fn=*/NULL_TREE);
3526 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL, complain),
3527 auto_delete, flags, complain);
3528 if (expr == error_mark_node)
3529 return error_mark_node;
3531 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3533 /* We need to calculate this before the dtor changes the vptr. */
3535 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3537 if (flags & LOOKUP_DESTRUCTOR)
3538 /* Explicit destructor call; don't check for null pointer. */
3539 ifexp = integer_one_node;
3542 /* Handle deleting a null pointer. */
3543 ifexp = fold (cp_build_binary_op (input_location,
3544 NE_EXPR, addr, integer_zero_node,
3546 if (ifexp == error_mark_node)
3547 return error_mark_node;
3550 if (ifexp != integer_one_node)
3551 expr = build3 (COND_EXPR, void_type_node,
3552 ifexp, expr, void_zero_node);
3558 /* At the beginning of a destructor, push cleanups that will call the
3559 destructors for our base classes and members.
3561 Called from begin_destructor_body. */
3564 push_base_cleanups (void)
3566 tree binfo, base_binfo;
3570 VEC(tree,gc) *vbases;
3572 /* Run destructors for all virtual baseclasses. */
3573 if (CLASSTYPE_VBASECLASSES (current_class_type))
3575 tree cond = (condition_conversion
3576 (build2 (BIT_AND_EXPR, integer_type_node,
3577 current_in_charge_parm,
3578 integer_two_node)));
3580 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3581 order, which is also the right order for pushing cleanups. */
3582 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3583 VEC_iterate (tree, vbases, i, base_binfo); i++)
3585 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3587 expr = build_special_member_call (current_class_ref,
3588 base_dtor_identifier,
3592 | LOOKUP_NONVIRTUAL),
3593 tf_warning_or_error);
3594 expr = build3 (COND_EXPR, void_type_node, cond,
3595 expr, void_zero_node);
3596 finish_decl_cleanup (NULL_TREE, expr);
3601 /* Take care of the remaining baseclasses. */
3602 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3603 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3605 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3606 || BINFO_VIRTUAL_P (base_binfo))
3609 expr = build_special_member_call (current_class_ref,
3610 base_dtor_identifier,
3612 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3613 tf_warning_or_error);
3614 finish_decl_cleanup (NULL_TREE, expr);
3617 /* Don't automatically destroy union members. */
3618 if (TREE_CODE (current_class_type) == UNION_TYPE)
3621 for (member = TYPE_FIELDS (current_class_type); member;
3622 member = DECL_CHAIN (member))
3624 tree this_type = TREE_TYPE (member);
3625 if (this_type == error_mark_node
3626 || TREE_CODE (member) != FIELD_DECL
3627 || DECL_ARTIFICIAL (member))
3629 if (ANON_UNION_TYPE_P (this_type))
3631 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type))
3633 tree this_member = (build_class_member_access_expr
3634 (current_class_ref, member,
3635 /*access_path=*/NULL_TREE,
3636 /*preserve_reference=*/false,
3637 tf_warning_or_error));
3638 expr = build_delete (this_type, this_member,
3639 sfk_complete_destructor,
3640 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3641 0, tf_warning_or_error);
3642 finish_decl_cleanup (NULL_TREE, expr);
3647 /* Build a C++ vector delete expression.
3648 MAXINDEX is the number of elements to be deleted.
3649 ELT_SIZE is the nominal size of each element in the vector.
3650 BASE is the expression that should yield the store to be deleted.
3651 This function expands (or synthesizes) these calls itself.
3652 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3654 This also calls delete for virtual baseclasses of elements of the vector.
3656 Update: MAXINDEX is no longer needed. The size can be extracted from the
3657 start of the vector for pointers, and from the type for arrays. We still
3658 use MAXINDEX for arrays because it happens to already have one of the
3659 values we'd have to extract. (We could use MAXINDEX with pointers to
3660 confirm the size, and trap if the numbers differ; not clear that it'd
3661 be worth bothering.) */
3664 build_vec_delete (tree base, tree maxindex,
3665 special_function_kind auto_delete_vec,
3666 int use_global_delete, tsubst_flags_t complain)
3670 tree base_init = NULL_TREE;
3672 type = TREE_TYPE (base);
3674 if (TREE_CODE (type) == POINTER_TYPE)
3676 /* Step back one from start of vector, and read dimension. */
3678 tree size_ptr_type = build_pointer_type (sizetype);
3680 if (TREE_SIDE_EFFECTS (base))
3682 base_init = get_target_expr (base);
3683 base = TARGET_EXPR_SLOT (base_init);
3685 type = strip_array_types (TREE_TYPE (type));
3686 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR,
3687 sizetype, TYPE_SIZE_UNIT (sizetype));
3688 cookie_addr = build2 (POINTER_PLUS_EXPR,
3690 fold_convert (size_ptr_type, base),
3692 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, complain);
3694 else if (TREE_CODE (type) == ARRAY_TYPE)
3696 /* Get the total number of things in the array, maxindex is a
3698 maxindex = array_type_nelts_total (type);
3699 type = strip_array_types (type);
3700 base = cp_build_addr_expr (base, complain);
3701 if (base == error_mark_node)
3702 return error_mark_node;
3703 if (TREE_SIDE_EFFECTS (base))
3705 base_init = get_target_expr (base);
3706 base = TARGET_EXPR_SLOT (base_init);
3711 if (base != error_mark_node && !(complain & tf_error))
3712 error ("type to vector delete is neither pointer or array type");
3713 return error_mark_node;
3716 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3717 use_global_delete, complain);
3718 if (base_init && rval != error_mark_node)
3719 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);