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 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"
36 static bool begin_init_stmts (tree *, tree *);
37 static tree finish_init_stmts (bool, tree, tree);
38 static void construct_virtual_base (tree, tree);
39 static void expand_aggr_init_1 (tree, tree, tree, tree, int, tsubst_flags_t);
40 static void expand_default_init (tree, tree, tree, tree, int, tsubst_flags_t);
41 static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int);
42 static void perform_member_init (tree, tree);
43 static tree build_builtin_delete_call (tree);
44 static int member_init_ok_or_else (tree, tree, tree);
45 static void expand_virtual_init (tree, tree);
46 static tree sort_mem_initializers (tree, tree);
47 static tree initializing_context (tree);
48 static void expand_cleanup_for_base (tree, tree);
49 static tree get_temp_regvar (tree, tree);
50 static tree dfs_initialize_vtbl_ptrs (tree, void *);
51 static tree build_dtor_call (tree, special_function_kind, int);
52 static tree build_field_list (tree, tree, int *);
53 static tree build_vtbl_address (tree);
54 static int diagnose_uninitialized_cst_or_ref_member_1 (tree, tree, bool, bool);
56 /* We are about to generate some complex initialization code.
57 Conceptually, it is all a single expression. However, we may want
58 to include conditionals, loops, and other such statement-level
59 constructs. Therefore, we build the initialization code inside a
60 statement-expression. This function starts such an expression.
61 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
62 pass them back to finish_init_stmts when the expression is
66 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
68 bool is_global = !building_stmt_tree ();
70 *stmt_expr_p = begin_stmt_expr ();
71 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
76 /* Finish out the statement-expression begun by the previous call to
77 begin_init_stmts. Returns the statement-expression itself. */
80 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
82 finish_compound_stmt (compound_stmt);
84 stmt_expr = finish_stmt_expr (stmt_expr, true);
86 gcc_assert (!building_stmt_tree () == is_global);
93 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
94 which we want to initialize the vtable pointer for, DATA is
95 TREE_LIST whose TREE_VALUE is the this ptr expression. */
98 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
100 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
101 return dfs_skip_bases;
103 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
105 tree base_ptr = TREE_VALUE ((tree) data);
107 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
109 expand_virtual_init (binfo, base_ptr);
115 /* Initialize all the vtable pointers in the object pointed to by
119 initialize_vtbl_ptrs (tree addr)
124 type = TREE_TYPE (TREE_TYPE (addr));
125 list = build_tree_list (type, addr);
127 /* Walk through the hierarchy, initializing the vptr in each base
128 class. We do these in pre-order because we can't find the virtual
129 bases for a class until we've initialized the vtbl for that
131 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list);
134 /* Return an expression for the zero-initialization of an object with
135 type T. This expression will either be a constant (in the case
136 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
137 aggregate), or NULL (in the case that T does not require
138 initialization). In either case, the value can be used as
139 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
140 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
141 is the number of elements in the array. If STATIC_STORAGE_P is
142 TRUE, initializers are only generated for entities for which
143 zero-initialization does not simply mean filling the storage with
147 build_zero_init (tree type, tree nelts, bool static_storage_p)
149 tree init = NULL_TREE;
153 To zero-initialize an object of type T means:
155 -- if T is a scalar type, the storage is set to the value of zero
158 -- if T is a non-union class type, the storage for each nonstatic
159 data member and each base-class subobject is zero-initialized.
161 -- if T is a union type, the storage for its first data member is
164 -- if T is an array type, the storage for each element is
167 -- if T is a reference type, no initialization is performed. */
169 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST);
171 if (type == error_mark_node)
173 else if (static_storage_p && zero_init_p (type))
174 /* In order to save space, we do not explicitly build initializers
175 for items that do not need them. GCC's semantics are that
176 items with static storage duration that are not otherwise
177 initialized are initialized to zero. */
179 else if (SCALAR_TYPE_P (type))
180 init = convert (type, integer_zero_node);
181 else if (CLASS_TYPE_P (type))
184 VEC(constructor_elt,gc) *v = NULL;
186 /* Iterate over the fields, building initializations. */
187 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
189 if (TREE_CODE (field) != FIELD_DECL)
192 /* Note that for class types there will be FIELD_DECLs
193 corresponding to base classes as well. Thus, iterating
194 over TYPE_FIELDs will result in correct initialization of
195 all of the subobjects. */
196 if (!static_storage_p || !zero_init_p (TREE_TYPE (field)))
198 tree value = build_zero_init (TREE_TYPE (field),
202 CONSTRUCTOR_APPEND_ELT(v, field, value);
205 /* For unions, only the first field is initialized. */
206 if (TREE_CODE (type) == UNION_TYPE)
210 /* Build a constructor to contain the initializations. */
211 init = build_constructor (type, v);
213 else if (TREE_CODE (type) == ARRAY_TYPE)
216 VEC(constructor_elt,gc) *v = NULL;
218 /* Iterate over the array elements, building initializations. */
220 max_index = fold_build2_loc (input_location,
221 MINUS_EXPR, TREE_TYPE (nelts),
222 nelts, integer_one_node);
224 max_index = array_type_nelts (type);
226 /* If we have an error_mark here, we should just return error mark
227 as we don't know the size of the array yet. */
228 if (max_index == error_mark_node)
229 return error_mark_node;
230 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
232 /* A zero-sized array, which is accepted as an extension, will
233 have an upper bound of -1. */
234 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
238 v = VEC_alloc (constructor_elt, gc, 1);
239 ce = VEC_quick_push (constructor_elt, v, NULL);
241 /* If this is a one element array, we just use a regular init. */
242 if (tree_int_cst_equal (size_zero_node, max_index))
243 ce->index = size_zero_node;
245 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
248 ce->value = build_zero_init (TREE_TYPE (type),
253 /* Build a constructor to contain the initializations. */
254 init = build_constructor (type, v);
256 else if (TREE_CODE (type) == VECTOR_TYPE)
257 init = fold_convert (type, integer_zero_node);
259 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
261 /* In all cases, the initializer is a constant. */
263 TREE_CONSTANT (init) = 1;
268 /* Return a suitable initializer for value-initializing an object of type
269 TYPE, as described in [dcl.init]. */
272 build_value_init (tree type, tsubst_flags_t complain)
276 To value-initialize an object of type T means:
278 - if T is a class type (clause 9) with a user-provided constructor
279 (12.1), then the default constructor for T is called (and the
280 initialization is ill-formed if T has no accessible default
283 - if T is a non-union class type without a user-provided constructor,
284 then every non-static data member and base-class component of T is
285 value-initialized;92)
287 - if T is an array type, then each element is value-initialized;
289 - otherwise, the object is zero-initialized.
291 A program that calls for default-initialization or
292 value-initialization of an entity of reference type is ill-formed.
294 92) Value-initialization for such a class object may be implemented by
295 zero-initializing the object and then calling the default
298 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
299 gcc_assert (!processing_template_decl);
301 if (CLASS_TYPE_P (type))
303 if (type_has_user_provided_constructor (type))
304 return build_aggr_init_expr
306 build_special_member_call (NULL_TREE, complete_ctor_identifier,
307 NULL, type, LOOKUP_NORMAL,
309 else if (TREE_CODE (type) != UNION_TYPE && TYPE_NEEDS_CONSTRUCTING (type))
311 /* This is a class that needs constructing, but doesn't have
312 a user-provided constructor. So we need to zero-initialize
313 the object and then call the implicitly defined ctor.
314 This will be handled in simplify_aggr_init_expr. */
315 tree ctor = build_special_member_call
316 (NULL_TREE, complete_ctor_identifier,
317 NULL, type, LOOKUP_NORMAL, complain);
319 ctor = build_aggr_init_expr (type, ctor);
320 AGGR_INIT_ZERO_FIRST (ctor) = 1;
324 return build_value_init_noctor (type, complain);
327 /* Like build_value_init, but don't call the constructor for TYPE. Used
328 for base initializers. */
331 build_value_init_noctor (tree type, tsubst_flags_t complain)
333 if (CLASS_TYPE_P (type))
335 gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type));
337 if (TREE_CODE (type) != UNION_TYPE)
340 VEC(constructor_elt,gc) *v = NULL;
342 /* Iterate over the fields, building initializations. */
343 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
347 if (TREE_CODE (field) != FIELD_DECL)
350 ftype = TREE_TYPE (field);
352 if (TREE_CODE (ftype) == REFERENCE_TYPE)
354 if (complain & tf_error)
355 error ("value-initialization of reference");
357 return error_mark_node;
360 /* We could skip vfields and fields of types with
361 user-defined constructors, but I think that won't improve
362 performance at all; it should be simpler in general just
363 to zero out the entire object than try to only zero the
364 bits that actually need it. */
366 /* Note that for class types there will be FIELD_DECLs
367 corresponding to base classes as well. Thus, iterating
368 over TYPE_FIELDs will result in correct initialization of
369 all of the subobjects. */
370 value = build_value_init (ftype, complain);
373 CONSTRUCTOR_APPEND_ELT(v, field, value);
376 /* Build a constructor to contain the zero- initializations. */
377 return build_constructor (type, v);
380 else if (TREE_CODE (type) == ARRAY_TYPE)
382 VEC(constructor_elt,gc) *v = NULL;
384 /* Iterate over the array elements, building initializations. */
385 tree max_index = array_type_nelts (type);
387 /* If we have an error_mark here, we should just return error mark
388 as we don't know the size of the array yet. */
389 if (max_index == error_mark_node)
391 error ("cannot value-initialize array of unknown bound %qT", type);
392 return error_mark_node;
394 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
396 /* A zero-sized array, which is accepted as an extension, will
397 have an upper bound of -1. */
398 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
402 v = VEC_alloc (constructor_elt, gc, 1);
403 ce = VEC_quick_push (constructor_elt, v, NULL);
405 /* If this is a one element array, we just use a regular init. */
406 if (tree_int_cst_equal (size_zero_node, max_index))
407 ce->index = size_zero_node;
409 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
412 ce->value = build_value_init (TREE_TYPE (type), complain);
414 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
415 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR
416 && TREE_CODE (ce->value) != AGGR_INIT_EXPR);
419 /* Build a constructor to contain the initializations. */
420 return build_constructor (type, v);
423 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
426 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
427 arguments. If TREE_LIST is void_type_node, an empty initializer
428 list was given; if NULL_TREE no initializer was given. */
431 perform_member_init (tree member, tree init)
434 tree type = TREE_TYPE (member);
436 /* Effective C++ rule 12 requires that all data members be
438 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE)
439 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__,
440 "%qD should be initialized in the member initialization list",
443 /* Get an lvalue for the data member. */
444 decl = build_class_member_access_expr (current_class_ref, member,
445 /*access_path=*/NULL_TREE,
446 /*preserve_reference=*/true,
447 tf_warning_or_error);
448 if (decl == error_mark_node)
451 if (init == void_type_node)
453 /* mem() means value-initialization. */
454 if (TREE_CODE (type) == ARRAY_TYPE)
456 init = build_vec_init (decl, NULL_TREE, NULL_TREE,
457 /*explicit_value_init_p=*/true,
459 tf_warning_or_error);
460 finish_expr_stmt (init);
464 if (TREE_CODE (type) == REFERENCE_TYPE)
465 permerror (DECL_SOURCE_LOCATION (current_function_decl),
466 "value-initialization of %q#D, which has reference type",
470 init = build2 (INIT_EXPR, type, decl,
471 build_value_init (type, tf_warning_or_error));
472 finish_expr_stmt (init);
476 /* Deal with this here, as we will get confused if we try to call the
477 assignment op for an anonymous union. This can happen in a
478 synthesized copy constructor. */
479 else if (ANON_AGGR_TYPE_P (type))
483 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
484 finish_expr_stmt (init);
487 else if (TYPE_NEEDS_CONSTRUCTING (type))
489 if (init != NULL_TREE
490 && TREE_CODE (type) == ARRAY_TYPE
491 && TREE_CHAIN (init) == NULL_TREE
492 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
494 /* Initialization of one array from another. */
495 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
496 /*explicit_value_init_p=*/false,
498 tf_warning_or_error));
502 if (CP_TYPE_CONST_P (type)
504 && !type_has_user_provided_default_constructor (type))
505 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
506 vtable; still give this diagnostic. */
507 permerror (DECL_SOURCE_LOCATION (current_function_decl),
508 "uninitialized member %qD with %<const%> type %qT",
510 finish_expr_stmt (build_aggr_init (decl, init, 0,
511 tf_warning_or_error));
516 if (init == NULL_TREE)
519 /* member traversal: note it leaves init NULL */
520 if (TREE_CODE (type) == REFERENCE_TYPE)
521 permerror (DECL_SOURCE_LOCATION (current_function_decl),
522 "uninitialized reference member %qD",
524 else if (CP_TYPE_CONST_P (type))
525 permerror (DECL_SOURCE_LOCATION (current_function_decl),
526 "uninitialized member %qD with %<const%> type %qT",
529 core_type = strip_array_types (type);
530 if (CLASS_TYPE_P (core_type)
531 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)
532 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)))
533 diagnose_uninitialized_cst_or_ref_member (core_type,
537 else if (TREE_CODE (init) == TREE_LIST)
538 /* There was an explicit member initialization. Do some work
540 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT,
541 tf_warning_or_error);
544 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
545 tf_warning_or_error));
548 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
552 expr = build_class_member_access_expr (current_class_ref, member,
553 /*access_path=*/NULL_TREE,
554 /*preserve_reference=*/false,
555 tf_warning_or_error);
556 expr = build_delete (type, expr, sfk_complete_destructor,
557 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
559 if (expr != error_mark_node)
560 finish_eh_cleanup (expr);
564 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
565 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
568 build_field_list (tree t, tree list, int *uses_unions_p)
574 /* Note whether or not T is a union. */
575 if (TREE_CODE (t) == UNION_TYPE)
578 for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields))
582 /* Skip CONST_DECLs for enumeration constants and so forth. */
583 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
586 fieldtype = TREE_TYPE (fields);
587 /* Keep track of whether or not any fields are unions. */
588 if (TREE_CODE (fieldtype) == UNION_TYPE)
591 /* For an anonymous struct or union, we must recursively
592 consider the fields of the anonymous type. They can be
593 directly initialized from the constructor. */
594 if (ANON_AGGR_TYPE_P (fieldtype))
596 /* Add this field itself. Synthesized copy constructors
597 initialize the entire aggregate. */
598 list = tree_cons (fields, NULL_TREE, list);
599 /* And now add the fields in the anonymous aggregate. */
600 list = build_field_list (fieldtype, list, uses_unions_p);
602 /* Add this field. */
603 else if (DECL_NAME (fields))
604 list = tree_cons (fields, NULL_TREE, list);
610 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
611 a FIELD_DECL or BINFO in T that needs initialization. The
612 TREE_VALUE gives the initializer, or list of initializer arguments.
614 Return a TREE_LIST containing all of the initializations required
615 for T, in the order in which they should be performed. The output
616 list has the same format as the input. */
619 sort_mem_initializers (tree t, tree mem_inits)
622 tree base, binfo, base_binfo;
625 VEC(tree,gc) *vbases;
629 /* Build up a list of initializations. The TREE_PURPOSE of entry
630 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
631 TREE_VALUE will be the constructor arguments, or NULL if no
632 explicit initialization was provided. */
633 sorted_inits = NULL_TREE;
635 /* Process the virtual bases. */
636 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
637 VEC_iterate (tree, vbases, i, base); i++)
638 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
640 /* Process the direct bases. */
641 for (binfo = TYPE_BINFO (t), i = 0;
642 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
643 if (!BINFO_VIRTUAL_P (base_binfo))
644 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
646 /* Process the non-static data members. */
647 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
648 /* Reverse the entire list of initializations, so that they are in
649 the order that they will actually be performed. */
650 sorted_inits = nreverse (sorted_inits);
652 /* If the user presented the initializers in an order different from
653 that in which they will actually occur, we issue a warning. Keep
654 track of the next subobject which can be explicitly initialized
655 without issuing a warning. */
656 next_subobject = sorted_inits;
658 /* Go through the explicit initializers, filling in TREE_PURPOSE in
660 for (init = mem_inits; init; init = TREE_CHAIN (init))
665 subobject = TREE_PURPOSE (init);
667 /* If the explicit initializers are in sorted order, then
668 SUBOBJECT will be NEXT_SUBOBJECT, or something following
670 for (subobject_init = next_subobject;
672 subobject_init = TREE_CHAIN (subobject_init))
673 if (TREE_PURPOSE (subobject_init) == subobject)
676 /* Issue a warning if the explicit initializer order does not
677 match that which will actually occur.
678 ??? Are all these on the correct lines? */
679 if (warn_reorder && !subobject_init)
681 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
682 warning (OPT_Wreorder, "%q+D will be initialized after",
683 TREE_PURPOSE (next_subobject));
685 warning (OPT_Wreorder, "base %qT will be initialized after",
686 TREE_PURPOSE (next_subobject));
687 if (TREE_CODE (subobject) == FIELD_DECL)
688 warning (OPT_Wreorder, " %q+#D", subobject);
690 warning (OPT_Wreorder, " base %qT", subobject);
691 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
692 OPT_Wreorder, " when initialized here");
695 /* Look again, from the beginning of the list. */
698 subobject_init = sorted_inits;
699 while (TREE_PURPOSE (subobject_init) != subobject)
700 subobject_init = TREE_CHAIN (subobject_init);
703 /* It is invalid to initialize the same subobject more than
705 if (TREE_VALUE (subobject_init))
707 if (TREE_CODE (subobject) == FIELD_DECL)
708 error_at (DECL_SOURCE_LOCATION (current_function_decl),
709 "multiple initializations given for %qD",
712 error_at (DECL_SOURCE_LOCATION (current_function_decl),
713 "multiple initializations given for base %qT",
717 /* Record the initialization. */
718 TREE_VALUE (subobject_init) = TREE_VALUE (init);
719 next_subobject = subobject_init;
724 If a ctor-initializer specifies more than one mem-initializer for
725 multiple members of the same union (including members of
726 anonymous unions), the ctor-initializer is ill-formed.
728 Here we also splice out uninitialized union members. */
731 tree last_field = NULL_TREE;
733 for (p = &sorted_inits; *p; )
741 field = TREE_PURPOSE (init);
743 /* Skip base classes. */
744 if (TREE_CODE (field) != FIELD_DECL)
747 /* If this is an anonymous union with no explicit initializer,
749 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field)))
752 /* See if this field is a member of a union, or a member of a
753 structure contained in a union, etc. */
754 for (ctx = DECL_CONTEXT (field);
755 !same_type_p (ctx, t);
756 ctx = TYPE_CONTEXT (ctx))
757 if (TREE_CODE (ctx) == UNION_TYPE)
759 /* If this field is not a member of a union, skip it. */
760 if (TREE_CODE (ctx) != UNION_TYPE)
763 /* If this union member has no explicit initializer, splice
765 if (!TREE_VALUE (init))
768 /* It's only an error if we have two initializers for the same
776 /* See if LAST_FIELD and the field initialized by INIT are
777 members of the same union. If so, there's a problem,
778 unless they're actually members of the same structure
779 which is itself a member of a union. For example, given:
781 union { struct { int i; int j; }; };
783 initializing both `i' and `j' makes sense. */
784 ctx = DECL_CONTEXT (field);
790 last_ctx = DECL_CONTEXT (last_field);
793 if (same_type_p (last_ctx, ctx))
795 if (TREE_CODE (ctx) == UNION_TYPE)
796 error_at (DECL_SOURCE_LOCATION (current_function_decl),
797 "initializations for multiple members of %qT",
803 if (same_type_p (last_ctx, t))
806 last_ctx = TYPE_CONTEXT (last_ctx);
809 /* If we've reached the outermost class, then we're
811 if (same_type_p (ctx, t))
814 ctx = TYPE_CONTEXT (ctx);
821 p = &TREE_CHAIN (*p);
824 *p = TREE_CHAIN (*p);
832 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
833 is a TREE_LIST giving the explicit mem-initializer-list for the
834 constructor. The TREE_PURPOSE of each entry is a subobject (a
835 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
836 is a TREE_LIST giving the arguments to the constructor or
837 void_type_node for an empty list of arguments. */
840 emit_mem_initializers (tree mem_inits)
842 /* We will already have issued an error message about the fact that
843 the type is incomplete. */
844 if (!COMPLETE_TYPE_P (current_class_type))
847 /* Sort the mem-initializers into the order in which the
848 initializations should be performed. */
849 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
851 in_base_initializer = 1;
853 /* Initialize base classes. */
855 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
857 tree subobject = TREE_PURPOSE (mem_inits);
858 tree arguments = TREE_VALUE (mem_inits);
860 /* If these initializations are taking place in a copy constructor,
861 the base class should probably be explicitly initialized if there
862 is a user-defined constructor in the base class (other than the
863 default constructor, which will be called anyway). */
864 if (extra_warnings && !arguments
865 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
866 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
867 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Wextra,
868 "base class %q#T should be explicitly initialized in the "
870 BINFO_TYPE (subobject));
872 /* Initialize the base. */
873 if (BINFO_VIRTUAL_P (subobject))
874 construct_virtual_base (subobject, arguments);
879 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
881 expand_aggr_init_1 (subobject, NULL_TREE,
882 cp_build_indirect_ref (base_addr, RO_NULL,
883 tf_warning_or_error),
886 tf_warning_or_error);
887 expand_cleanup_for_base (subobject, NULL_TREE);
890 mem_inits = TREE_CHAIN (mem_inits);
892 in_base_initializer = 0;
894 /* Initialize the vptrs. */
895 initialize_vtbl_ptrs (current_class_ptr);
897 /* Initialize the data members. */
900 perform_member_init (TREE_PURPOSE (mem_inits),
901 TREE_VALUE (mem_inits));
902 mem_inits = TREE_CHAIN (mem_inits);
906 /* Returns the address of the vtable (i.e., the value that should be
907 assigned to the vptr) for BINFO. */
910 build_vtbl_address (tree binfo)
912 tree binfo_for = binfo;
915 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
916 /* If this is a virtual primary base, then the vtable we want to store
917 is that for the base this is being used as the primary base of. We
918 can't simply skip the initialization, because we may be expanding the
919 inits of a subobject constructor where the virtual base layout
921 while (BINFO_PRIMARY_P (binfo_for))
922 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
924 /* Figure out what vtable BINFO's vtable is based on, and mark it as
926 vtbl = get_vtbl_decl_for_binfo (binfo_for);
927 TREE_USED (vtbl) = 1;
929 /* Now compute the address to use when initializing the vptr. */
930 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
931 if (TREE_CODE (vtbl) == VAR_DECL)
932 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
937 /* This code sets up the virtual function tables appropriate for
938 the pointer DECL. It is a one-ply initialization.
940 BINFO is the exact type that DECL is supposed to be. In
941 multiple inheritance, this might mean "C's A" if C : A, B. */
944 expand_virtual_init (tree binfo, tree decl)
949 /* Compute the initializer for vptr. */
950 vtbl = build_vtbl_address (binfo);
952 /* We may get this vptr from a VTT, if this is a subobject
953 constructor or subobject destructor. */
954 vtt_index = BINFO_VPTR_INDEX (binfo);
960 /* Compute the value to use, when there's a VTT. */
961 vtt_parm = current_vtt_parm;
962 vtbl2 = build2 (POINTER_PLUS_EXPR,
963 TREE_TYPE (vtt_parm),
966 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error);
967 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
969 /* The actual initializer is the VTT value only in the subobject
970 constructor. In maybe_clone_body we'll substitute NULL for
971 the vtt_parm in the case of the non-subobject constructor. */
972 vtbl = build3 (COND_EXPR,
974 build2 (EQ_EXPR, boolean_type_node,
975 current_in_charge_parm, integer_zero_node),
980 /* Compute the location of the vtpr. */
981 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL,
982 tf_warning_or_error),
984 gcc_assert (vtbl_ptr != error_mark_node);
986 /* Assign the vtable to the vptr. */
987 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
988 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
989 tf_warning_or_error));
992 /* If an exception is thrown in a constructor, those base classes already
993 constructed must be destroyed. This function creates the cleanup
994 for BINFO, which has just been constructed. If FLAG is non-NULL,
995 it is a DECL which is nonzero when this base needs to be
999 expand_cleanup_for_base (tree binfo, tree flag)
1003 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
1006 /* Call the destructor. */
1007 expr = build_special_member_call (current_class_ref,
1008 base_dtor_identifier,
1011 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
1012 tf_warning_or_error);
1014 expr = fold_build3_loc (input_location,
1015 COND_EXPR, void_type_node,
1016 c_common_truthvalue_conversion (input_location, flag),
1017 expr, integer_zero_node);
1019 finish_eh_cleanup (expr);
1022 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1026 construct_virtual_base (tree vbase, tree arguments)
1032 /* If there are virtual base classes with destructors, we need to
1033 emit cleanups to destroy them if an exception is thrown during
1034 the construction process. These exception regions (i.e., the
1035 period during which the cleanups must occur) begin from the time
1036 the construction is complete to the end of the function. If we
1037 create a conditional block in which to initialize the
1038 base-classes, then the cleanup region for the virtual base begins
1039 inside a block, and ends outside of that block. This situation
1040 confuses the sjlj exception-handling code. Therefore, we do not
1041 create a single conditional block, but one for each
1042 initialization. (That way the cleanup regions always begin
1043 in the outer block.) We trust the back end to figure out
1044 that the FLAG will not change across initializations, and
1045 avoid doing multiple tests. */
1046 flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl));
1047 inner_if_stmt = begin_if_stmt ();
1048 finish_if_stmt_cond (flag, inner_if_stmt);
1050 /* Compute the location of the virtual base. If we're
1051 constructing virtual bases, then we must be the most derived
1052 class. Therefore, we don't have to look up the virtual base;
1053 we already know where it is. */
1054 exp = convert_to_base_statically (current_class_ref, vbase);
1056 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1057 LOOKUP_COMPLAIN, tf_warning_or_error);
1058 finish_then_clause (inner_if_stmt);
1059 finish_if_stmt (inner_if_stmt);
1061 expand_cleanup_for_base (vbase, flag);
1064 /* Find the context in which this FIELD can be initialized. */
1067 initializing_context (tree field)
1069 tree t = DECL_CONTEXT (field);
1071 /* Anonymous union members can be initialized in the first enclosing
1072 non-anonymous union context. */
1073 while (t && ANON_AGGR_TYPE_P (t))
1074 t = TYPE_CONTEXT (t);
1078 /* Function to give error message if member initialization specification
1079 is erroneous. FIELD is the member we decided to initialize.
1080 TYPE is the type for which the initialization is being performed.
1081 FIELD must be a member of TYPE.
1083 MEMBER_NAME is the name of the member. */
1086 member_init_ok_or_else (tree field, tree type, tree member_name)
1088 if (field == error_mark_node)
1092 error ("class %qT does not have any field named %qD", type,
1096 if (TREE_CODE (field) == VAR_DECL)
1098 error ("%q#D is a static data member; it can only be "
1099 "initialized at its definition",
1103 if (TREE_CODE (field) != FIELD_DECL)
1105 error ("%q#D is not a non-static data member of %qT",
1109 if (initializing_context (field) != type)
1111 error ("class %qT does not have any field named %qD", type,
1119 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1120 is a _TYPE node or TYPE_DECL which names a base for that type.
1121 Check the validity of NAME, and return either the base _TYPE, base
1122 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1123 NULL_TREE and issue a diagnostic.
1125 An old style unnamed direct single base construction is permitted,
1126 where NAME is NULL. */
1129 expand_member_init (tree name)
1134 if (!current_class_ref)
1139 /* This is an obsolete unnamed base class initializer. The
1140 parser will already have warned about its use. */
1141 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1144 error ("unnamed initializer for %qT, which has no base classes",
1145 current_class_type);
1148 basetype = BINFO_TYPE
1149 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1152 error ("unnamed initializer for %qT, which uses multiple inheritance",
1153 current_class_type);
1157 else if (TYPE_P (name))
1159 basetype = TYPE_MAIN_VARIANT (name);
1160 name = TYPE_NAME (name);
1162 else if (TREE_CODE (name) == TYPE_DECL)
1163 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1165 basetype = NULL_TREE;
1174 if (current_template_parms)
1177 class_binfo = TYPE_BINFO (current_class_type);
1178 direct_binfo = NULL_TREE;
1179 virtual_binfo = NULL_TREE;
1181 /* Look for a direct base. */
1182 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1183 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1186 /* Look for a virtual base -- unless the direct base is itself
1188 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1189 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1191 /* [class.base.init]
1193 If a mem-initializer-id is ambiguous because it designates
1194 both a direct non-virtual base class and an inherited virtual
1195 base class, the mem-initializer is ill-formed. */
1196 if (direct_binfo && virtual_binfo)
1198 error ("%qD is both a direct base and an indirect virtual base",
1203 if (!direct_binfo && !virtual_binfo)
1205 if (CLASSTYPE_VBASECLASSES (current_class_type))
1206 error ("type %qT is not a direct or virtual base of %qT",
1207 basetype, current_class_type);
1209 error ("type %qT is not a direct base of %qT",
1210 basetype, current_class_type);
1214 return direct_binfo ? direct_binfo : virtual_binfo;
1218 if (TREE_CODE (name) == IDENTIFIER_NODE)
1219 field = lookup_field (current_class_type, name, 1, false);
1223 if (member_init_ok_or_else (field, current_class_type, name))
1230 /* This is like `expand_member_init', only it stores one aggregate
1233 INIT comes in two flavors: it is either a value which
1234 is to be stored in EXP, or it is a parameter list
1235 to go to a constructor, which will operate on EXP.
1236 If INIT is not a parameter list for a constructor, then set
1237 LOOKUP_ONLYCONVERTING.
1238 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1239 the initializer, if FLAGS is 0, then it is the (init) form.
1240 If `init' is a CONSTRUCTOR, then we emit a warning message,
1241 explaining that such initializations are invalid.
1243 If INIT resolves to a CALL_EXPR which happens to return
1244 something of the type we are looking for, then we know
1245 that we can safely use that call to perform the
1248 The virtual function table pointer cannot be set up here, because
1249 we do not really know its type.
1251 This never calls operator=().
1253 When initializing, nothing is CONST.
1255 A default copy constructor may have to be used to perform the
1258 A constructor or a conversion operator may have to be used to
1259 perform the initialization, but not both, as it would be ambiguous. */
1262 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1267 tree type = TREE_TYPE (exp);
1268 int was_const = TREE_READONLY (exp);
1269 int was_volatile = TREE_THIS_VOLATILE (exp);
1272 if (init == error_mark_node)
1273 return error_mark_node;
1275 TREE_READONLY (exp) = 0;
1276 TREE_THIS_VOLATILE (exp) = 0;
1278 if (init && TREE_CODE (init) != TREE_LIST
1279 && !(BRACE_ENCLOSED_INITIALIZER_P (init)
1280 && CONSTRUCTOR_IS_DIRECT_INIT (init)))
1281 flags |= LOOKUP_ONLYCONVERTING;
1283 if (TREE_CODE (type) == ARRAY_TYPE)
1287 /* An array may not be initialized use the parenthesized
1288 initialization form -- unless the initializer is "()". */
1289 if (init && TREE_CODE (init) == TREE_LIST)
1291 if (complain & tf_error)
1292 error ("bad array initializer");
1293 return error_mark_node;
1295 /* Must arrange to initialize each element of EXP
1296 from elements of INIT. */
1297 itype = init ? TREE_TYPE (init) : NULL_TREE;
1298 if (cv_qualified_p (type))
1299 TREE_TYPE (exp) = cv_unqualified (type);
1300 if (itype && cv_qualified_p (itype))
1301 TREE_TYPE (init) = cv_unqualified (itype);
1302 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1303 /*explicit_value_init_p=*/false,
1304 itype && same_type_p (TREE_TYPE (init),
1307 TREE_READONLY (exp) = was_const;
1308 TREE_THIS_VOLATILE (exp) = was_volatile;
1309 TREE_TYPE (exp) = type;
1311 TREE_TYPE (init) = itype;
1315 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1316 /* Just know that we've seen something for this node. */
1317 TREE_USED (exp) = 1;
1319 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1320 destroy_temps = stmts_are_full_exprs_p ();
1321 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1322 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1323 init, LOOKUP_NORMAL|flags, complain);
1324 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1325 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1326 TREE_READONLY (exp) = was_const;
1327 TREE_THIS_VOLATILE (exp) = was_volatile;
1333 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1334 tsubst_flags_t complain)
1336 tree type = TREE_TYPE (exp);
1339 /* It fails because there may not be a constructor which takes
1340 its own type as the first (or only parameter), but which does
1341 take other types via a conversion. So, if the thing initializing
1342 the expression is a unit element of type X, first try X(X&),
1343 followed by initialization by X. If neither of these work
1344 out, then look hard. */
1346 VEC(tree,gc) *parms;
1348 if (init && BRACE_ENCLOSED_INITIALIZER_P (init)
1349 && CP_AGGREGATE_TYPE_P (type))
1351 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1352 happen for direct-initialization, too. */
1353 init = digest_init (type, init);
1354 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1355 TREE_SIDE_EFFECTS (init) = 1;
1356 finish_expr_stmt (init);
1360 if (init && TREE_CODE (init) != TREE_LIST
1361 && (flags & LOOKUP_ONLYCONVERTING))
1363 /* Base subobjects should only get direct-initialization. */
1364 gcc_assert (true_exp == exp);
1366 if (flags & DIRECT_BIND)
1367 /* Do nothing. We hit this in two cases: Reference initialization,
1368 where we aren't initializing a real variable, so we don't want
1369 to run a new constructor; and catching an exception, where we
1370 have already built up the constructor call so we could wrap it
1371 in an exception region. */;
1373 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1375 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1376 /* We need to protect the initialization of a catch parm with a
1377 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1378 around the TARGET_EXPR for the copy constructor. See
1379 initialize_handler_parm. */
1381 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1382 TREE_OPERAND (init, 0));
1383 TREE_TYPE (init) = void_type_node;
1386 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1387 TREE_SIDE_EFFECTS (init) = 1;
1388 finish_expr_stmt (init);
1392 if (init == NULL_TREE)
1394 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1396 parms = make_tree_vector ();
1397 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1398 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1401 parms = make_tree_vector_single (init);
1403 if (true_exp == exp)
1404 ctor_name = complete_ctor_identifier;
1406 ctor_name = base_ctor_identifier;
1408 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1412 release_tree_vector (parms);
1414 if (TREE_SIDE_EFFECTS (rval))
1415 finish_expr_stmt (convert_to_void (rval, ICV_CAST, complain));
1418 /* This function is responsible for initializing EXP with INIT
1421 BINFO is the binfo of the type for who we are performing the
1422 initialization. For example, if W is a virtual base class of A and B,
1424 If we are initializing B, then W must contain B's W vtable, whereas
1425 were we initializing C, W must contain C's W vtable.
1427 TRUE_EXP is nonzero if it is the true expression being initialized.
1428 In this case, it may be EXP, or may just contain EXP. The reason we
1429 need this is because if EXP is a base element of TRUE_EXP, we
1430 don't necessarily know by looking at EXP where its virtual
1431 baseclass fields should really be pointing. But we do know
1432 from TRUE_EXP. In constructors, we don't know anything about
1433 the value being initialized.
1435 FLAGS is just passed to `build_new_method_call'. See that function
1436 for its description. */
1439 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1440 tsubst_flags_t complain)
1442 tree type = TREE_TYPE (exp);
1444 gcc_assert (init != error_mark_node && type != error_mark_node);
1445 gcc_assert (building_stmt_tree ());
1447 /* Use a function returning the desired type to initialize EXP for us.
1448 If the function is a constructor, and its first argument is
1449 NULL_TREE, know that it was meant for us--just slide exp on
1450 in and expand the constructor. Constructors now come
1453 if (init && TREE_CODE (exp) == VAR_DECL
1454 && COMPOUND_LITERAL_P (init))
1456 /* If store_init_value returns NULL_TREE, the INIT has been
1457 recorded as the DECL_INITIAL for EXP. That means there's
1458 nothing more we have to do. */
1459 init = store_init_value (exp, init, flags);
1461 finish_expr_stmt (init);
1465 /* If an explicit -- but empty -- initializer list was present,
1466 that's value-initialization. */
1467 if (init == void_type_node)
1469 /* If there's a user-provided constructor, we just call that. */
1470 if (type_has_user_provided_constructor (type))
1471 /* Fall through. */;
1472 /* If there isn't, but we still need to call the constructor,
1473 zero out the object first. */
1474 else if (TYPE_NEEDS_CONSTRUCTING (type))
1476 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1477 init = build2 (INIT_EXPR, type, exp, init);
1478 finish_expr_stmt (init);
1479 /* And then call the constructor. */
1481 /* If we don't need to mess with the constructor at all,
1482 then just zero out the object and we're done. */
1485 init = build2 (INIT_EXPR, type, exp,
1486 build_value_init_noctor (type, complain));
1487 finish_expr_stmt (init);
1493 /* We know that expand_default_init can handle everything we want
1495 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1498 /* Report an error if TYPE is not a user-defined, class type. If
1499 OR_ELSE is nonzero, give an error message. */
1502 is_class_type (tree type, int or_else)
1504 if (type == error_mark_node)
1507 if (! CLASS_TYPE_P (type))
1510 error ("%qT is not a class type", type);
1517 get_type_value (tree name)
1519 if (name == error_mark_node)
1522 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1523 return IDENTIFIER_TYPE_VALUE (name);
1528 /* Build a reference to a member of an aggregate. This is not a C++
1529 `&', but really something which can have its address taken, and
1530 then act as a pointer to member, for example TYPE :: FIELD can have
1531 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1532 this expression is the operand of "&".
1534 @@ Prints out lousy diagnostics for operator <typename>
1537 @@ This function should be rewritten and placed in search.c. */
1540 build_offset_ref (tree type, tree member, bool address_p)
1543 tree basebinfo = NULL_TREE;
1545 /* class templates can come in as TEMPLATE_DECLs here. */
1546 if (TREE_CODE (member) == TEMPLATE_DECL)
1549 if (dependent_scope_p (type) || type_dependent_expression_p (member))
1550 return build_qualified_name (NULL_TREE, type, member,
1551 /*template_p=*/false);
1553 gcc_assert (TYPE_P (type));
1554 if (! is_class_type (type, 1))
1555 return error_mark_node;
1557 gcc_assert (DECL_P (member) || BASELINK_P (member));
1558 /* Callers should call mark_used before this point. */
1559 gcc_assert (!DECL_P (member) || TREE_USED (member));
1561 type = TYPE_MAIN_VARIANT (type);
1562 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type)))
1564 error ("incomplete type %qT does not have member %qD", type, member);
1565 return error_mark_node;
1568 /* Entities other than non-static members need no further
1570 if (TREE_CODE (member) == TYPE_DECL)
1572 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1573 return convert_from_reference (member);
1575 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1577 error ("invalid pointer to bit-field %qD", member);
1578 return error_mark_node;
1581 /* Set up BASEBINFO for member lookup. */
1582 decl = maybe_dummy_object (type, &basebinfo);
1584 /* A lot of this logic is now handled in lookup_member. */
1585 if (BASELINK_P (member))
1587 /* Go from the TREE_BASELINK to the member function info. */
1588 tree t = BASELINK_FUNCTIONS (member);
1590 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1592 /* Get rid of a potential OVERLOAD around it. */
1593 t = OVL_CURRENT (t);
1595 /* Unique functions are handled easily. */
1597 /* For non-static member of base class, we need a special rule
1598 for access checking [class.protected]:
1600 If the access is to form a pointer to member, the
1601 nested-name-specifier shall name the derived class
1602 (or any class derived from that class). */
1603 if (address_p && DECL_P (t)
1604 && DECL_NONSTATIC_MEMBER_P (t))
1605 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1607 perform_or_defer_access_check (basebinfo, t, t);
1609 if (DECL_STATIC_FUNCTION_P (t))
1614 TREE_TYPE (member) = unknown_type_node;
1616 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1617 /* We need additional test besides the one in
1618 check_accessibility_of_qualified_id in case it is
1619 a pointer to non-static member. */
1620 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1624 /* If MEMBER is non-static, then the program has fallen afoul of
1627 An id-expression that denotes a nonstatic data member or
1628 nonstatic member function of a class can only be used:
1630 -- as part of a class member access (_expr.ref_) in which the
1631 object-expression refers to the member's class or a class
1632 derived from that class, or
1634 -- to form a pointer to member (_expr.unary.op_), or
1636 -- in the body of a nonstatic member function of that class or
1637 of a class derived from that class (_class.mfct.nonstatic_), or
1639 -- in a mem-initializer for a constructor for that class or for
1640 a class derived from that class (_class.base.init_). */
1641 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1643 /* Build a representation of the qualified name suitable
1644 for use as the operand to "&" -- even though the "&" is
1645 not actually present. */
1646 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1647 /* In Microsoft mode, treat a non-static member function as if
1648 it were a pointer-to-member. */
1649 if (flag_ms_extensions)
1651 PTRMEM_OK_P (member) = 1;
1652 return cp_build_addr_expr (member, tf_warning_or_error);
1654 error ("invalid use of non-static member function %qD",
1655 TREE_OPERAND (member, 1));
1656 return error_mark_node;
1658 else if (TREE_CODE (member) == FIELD_DECL)
1660 error ("invalid use of non-static data member %qD", member);
1661 return error_mark_node;
1666 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1667 PTRMEM_OK_P (member) = 1;
1671 /* If DECL is a scalar enumeration constant or variable with a
1672 constant initializer, return the initializer (or, its initializers,
1673 recursively); otherwise, return DECL. If INTEGRAL_P, the
1674 initializer is only returned if DECL is an integral
1675 constant-expression. */
1678 constant_value_1 (tree decl, bool integral_p)
1680 while (TREE_CODE (decl) == CONST_DECL
1682 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1683 : (TREE_CODE (decl) == VAR_DECL
1684 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1687 /* Static data members in template classes may have
1688 non-dependent initializers. References to such non-static
1689 data members are not value-dependent, so we must retrieve the
1690 initializer here. The DECL_INITIAL will have the right type,
1691 but will not have been folded because that would prevent us
1692 from performing all appropriate semantic checks at
1693 instantiation time. */
1694 if (DECL_CLASS_SCOPE_P (decl)
1695 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1696 && uses_template_parms (CLASSTYPE_TI_ARGS
1697 (DECL_CONTEXT (decl))))
1699 ++processing_template_decl;
1700 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1701 --processing_template_decl;
1705 /* If DECL is a static data member in a template
1706 specialization, we must instantiate it here. The
1707 initializer for the static data member is not processed
1708 until needed; we need it now. */
1710 init = DECL_INITIAL (decl);
1712 if (init == error_mark_node)
1714 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
1715 /* Treat the error as a constant to avoid cascading errors on
1716 excessively recursive template instantiation (c++/9335). */
1721 /* Initializers in templates are generally expanded during
1722 instantiation, so before that for const int i(2)
1723 INIT is a TREE_LIST with the actual initializer as
1725 if (processing_template_decl
1727 && TREE_CODE (init) == TREE_LIST
1728 && TREE_CHAIN (init) == NULL_TREE)
1729 init = TREE_VALUE (init);
1731 || !TREE_TYPE (init)
1733 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1734 : (!TREE_CONSTANT (init)
1735 /* Do not return an aggregate constant (of which
1736 string literals are a special case), as we do not
1737 want to make inadvertent copies of such entities,
1738 and we must be sure that their addresses are the
1740 || TREE_CODE (init) == CONSTRUCTOR
1741 || TREE_CODE (init) == STRING_CST)))
1743 decl = unshare_expr (init);
1748 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1749 constant of integral or enumeration type, then return that value.
1750 These are those variables permitted in constant expressions by
1754 integral_constant_value (tree decl)
1756 return constant_value_1 (decl, /*integral_p=*/true);
1759 /* A more relaxed version of integral_constant_value, used by the
1760 common C/C++ code and by the C++ front end for optimization
1764 decl_constant_value (tree decl)
1766 return constant_value_1 (decl,
1767 /*integral_p=*/processing_template_decl);
1770 /* Common subroutines of build_new and build_vec_delete. */
1772 /* Call the global __builtin_delete to delete ADDR. */
1775 build_builtin_delete_call (tree addr)
1777 mark_used (global_delete_fndecl);
1778 return build_call_n (global_delete_fndecl, 1, addr);
1781 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1782 the type of the object being allocated; otherwise, it's just TYPE.
1783 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1784 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1785 a vector of arguments to be provided as arguments to a placement
1786 new operator. This routine performs no semantic checks; it just
1787 creates and returns a NEW_EXPR. */
1790 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1791 VEC(tree,gc) *init, int use_global_new)
1796 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1797 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1798 permits us to distinguish the case of a missing initializer "new
1799 int" from an empty initializer "new int()". */
1801 init_list = NULL_TREE;
1802 else if (VEC_empty (tree, init))
1803 init_list = void_zero_node;
1805 init_list = build_tree_list_vec (init);
1807 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1808 build_tree_list_vec (placement), type, nelts,
1810 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1811 TREE_SIDE_EFFECTS (new_expr) = 1;
1816 /* Diagnose uninitialized const members or reference members of type
1817 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1818 new expression without a new-initializer and a declaration. Returns
1822 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin,
1823 bool using_new, bool complain)
1826 int error_count = 0;
1828 if (type_has_user_provided_constructor (type))
1831 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1835 if (TREE_CODE (field) != FIELD_DECL)
1838 field_type = strip_array_types (TREE_TYPE (field));
1840 if (TREE_CODE (field_type) == REFERENCE_TYPE)
1846 error ("uninitialized reference member in %q#T "
1847 "using %<new%> without new-initializer", origin);
1849 error ("uninitialized reference member in %q#T", origin);
1850 inform (DECL_SOURCE_LOCATION (field),
1851 "%qD should be initialized", field);
1855 if (CP_TYPE_CONST_P (field_type))
1861 error ("uninitialized const member in %q#T "
1862 "using %<new%> without new-initializer", origin);
1864 error ("uninitialized const member in %q#T", origin);
1865 inform (DECL_SOURCE_LOCATION (field),
1866 "%qD should be initialized", field);
1870 if (CLASS_TYPE_P (field_type))
1872 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin,
1873 using_new, complain);
1879 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain)
1881 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain);
1884 /* Generate code for a new-expression, including calling the "operator
1885 new" function, initializing the object, and, if an exception occurs
1886 during construction, cleaning up. The arguments are as for
1887 build_raw_new_expr. This may change PLACEMENT and INIT. */
1890 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1891 VEC(tree,gc) **init, bool globally_qualified_p,
1892 tsubst_flags_t complain)
1895 /* True iff this is a call to "operator new[]" instead of just
1897 bool array_p = false;
1898 /* If ARRAY_P is true, the element type of the array. This is never
1899 an ARRAY_TYPE; for something like "new int[3][4]", the
1900 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1903 /* The type of the new-expression. (This type is always a pointer
1906 tree non_const_pointer_type;
1907 tree outer_nelts = NULL_TREE;
1908 tree alloc_call, alloc_expr;
1909 /* The address returned by the call to "operator new". This node is
1910 a VAR_DECL and is therefore reusable. */
1913 tree cookie_expr, init_expr;
1914 int nothrow, check_new;
1915 int use_java_new = 0;
1916 /* If non-NULL, the number of extra bytes to allocate at the
1917 beginning of the storage allocated for an array-new expression in
1918 order to store the number of elements. */
1919 tree cookie_size = NULL_TREE;
1920 tree placement_first;
1921 tree placement_expr = NULL_TREE;
1922 /* True if the function we are calling is a placement allocation
1924 bool placement_allocation_fn_p;
1925 /* True if the storage must be initialized, either by a constructor
1926 or due to an explicit new-initializer. */
1927 bool is_initialized;
1928 /* The address of the thing allocated, not including any cookie. In
1929 particular, if an array cookie is in use, DATA_ADDR is the
1930 address of the first array element. This node is a VAR_DECL, and
1931 is therefore reusable. */
1933 tree init_preeval_expr = NULL_TREE;
1937 outer_nelts = nelts;
1940 else if (TREE_CODE (type) == ARRAY_TYPE)
1943 nelts = array_type_nelts_top (type);
1944 outer_nelts = nelts;
1945 type = TREE_TYPE (type);
1948 /* If our base type is an array, then make sure we know how many elements
1950 for (elt_type = type;
1951 TREE_CODE (elt_type) == ARRAY_TYPE;
1952 elt_type = TREE_TYPE (elt_type))
1953 nelts = cp_build_binary_op (input_location,
1955 array_type_nelts_top (elt_type),
1958 if (TREE_CODE (elt_type) == VOID_TYPE)
1960 if (complain & tf_error)
1961 error ("invalid type %<void%> for new");
1962 return error_mark_node;
1965 if (abstract_virtuals_error (NULL_TREE, elt_type))
1966 return error_mark_node;
1968 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
1972 bool maybe_uninitialized_error = false;
1973 /* A program that calls for default-initialization [...] of an
1974 entity of reference type is ill-formed. */
1975 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type))
1976 maybe_uninitialized_error = true;
1978 /* A new-expression that creates an object of type T initializes
1979 that object as follows:
1980 - If the new-initializer is omitted:
1981 -- If T is a (possibly cv-qualified) non-POD class type
1982 (or array thereof), the object is default-initialized (8.5).
1984 -- Otherwise, the object created has indeterminate
1985 value. If T is a const-qualified type, or a (possibly
1986 cv-qualified) POD class type (or array thereof)
1987 containing (directly or indirectly) a member of
1988 const-qualified type, the program is ill-formed; */
1990 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type))
1991 maybe_uninitialized_error = true;
1993 if (maybe_uninitialized_error
1994 && diagnose_uninitialized_cst_or_ref_member (elt_type,
1996 complain & tf_error))
1997 return error_mark_node;
2000 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
2001 && !type_has_user_provided_default_constructor (elt_type))
2003 if (complain & tf_error)
2004 error ("uninitialized const in %<new%> of %q#T", elt_type);
2005 return error_mark_node;
2008 size = size_in_bytes (elt_type);
2010 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2012 alloc_fn = NULL_TREE;
2014 /* If PLACEMENT is a single simple pointer type not passed by
2015 reference, prepare to capture it in a temporary variable. Do
2016 this now, since PLACEMENT will change in the calls below. */
2017 placement_first = NULL_TREE;
2018 if (VEC_length (tree, *placement) == 1
2019 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
2021 placement_first = VEC_index (tree, *placement, 0);
2023 /* Allocate the object. */
2024 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
2027 tree class_decl = build_java_class_ref (elt_type);
2028 static const char alloc_name[] = "_Jv_AllocObject";
2030 if (class_decl == error_mark_node)
2031 return error_mark_node;
2034 if (!get_global_value_if_present (get_identifier (alloc_name),
2037 if (complain & tf_error)
2038 error ("call to Java constructor with %qs undefined", alloc_name);
2039 return error_mark_node;
2041 else if (really_overloaded_fn (alloc_fn))
2043 if (complain & tf_error)
2044 error ("%qD should never be overloaded", alloc_fn);
2045 return error_mark_node;
2047 alloc_fn = OVL_CURRENT (alloc_fn);
2048 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2049 alloc_call = cp_build_function_call_nary (alloc_fn, complain,
2050 class_addr, NULL_TREE);
2052 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
2054 error ("Java class %q#T object allocated using placement new", elt_type);
2055 return error_mark_node;
2062 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
2064 if (!globally_qualified_p
2065 && CLASS_TYPE_P (elt_type)
2067 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
2068 : TYPE_HAS_NEW_OPERATOR (elt_type)))
2070 /* Use a class-specific operator new. */
2071 /* If a cookie is required, add some extra space. */
2072 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2074 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2075 size = size_binop (PLUS_EXPR, size, cookie_size);
2077 /* Create the argument list. */
2078 VEC_safe_insert (tree, gc, *placement, 0, size);
2079 /* Do name-lookup to find the appropriate operator. */
2080 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
2081 if (fns == NULL_TREE)
2083 if (complain & tf_error)
2084 error ("no suitable %qD found in class %qT", fnname, elt_type);
2085 return error_mark_node;
2087 if (TREE_CODE (fns) == TREE_LIST)
2089 if (complain & tf_error)
2091 error ("request for member %qD is ambiguous", fnname);
2092 print_candidates (fns);
2094 return error_mark_node;
2096 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2098 /*conversion_path=*/NULL_TREE,
2105 /* Use a global operator new. */
2106 /* See if a cookie might be required. */
2107 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2108 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2110 cookie_size = NULL_TREE;
2112 alloc_call = build_operator_new_call (fnname, placement,
2113 &size, &cookie_size,
2118 if (alloc_call == error_mark_node)
2119 return error_mark_node;
2121 gcc_assert (alloc_fn != NULL_TREE);
2123 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2124 into a temporary variable. */
2125 if (!processing_template_decl
2126 && placement_first != NULL_TREE
2127 && TREE_CODE (alloc_call) == CALL_EXPR
2128 && call_expr_nargs (alloc_call) == 2
2129 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2130 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2132 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2134 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2135 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2137 placement_expr = get_target_expr (placement_first);
2138 CALL_EXPR_ARG (alloc_call, 1)
2139 = convert (TREE_TYPE (placement_arg), placement_expr);
2143 /* In the simple case, we can stop now. */
2144 pointer_type = build_pointer_type (type);
2145 if (!cookie_size && !is_initialized)
2146 return build_nop (pointer_type, alloc_call);
2148 /* Store the result of the allocation call in a variable so that we can
2149 use it more than once. */
2150 alloc_expr = get_target_expr (alloc_call);
2151 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2153 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2154 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2155 alloc_call = TREE_OPERAND (alloc_call, 1);
2157 /* Now, check to see if this function is actually a placement
2158 allocation function. This can happen even when PLACEMENT is NULL
2159 because we might have something like:
2161 struct S { void* operator new (size_t, int i = 0); };
2163 A call to `new S' will get this allocation function, even though
2164 there is no explicit placement argument. If there is more than
2165 one argument, or there are variable arguments, then this is a
2166 placement allocation function. */
2167 placement_allocation_fn_p
2168 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2169 || varargs_function_p (alloc_fn));
2171 /* Preevaluate the placement args so that we don't reevaluate them for a
2172 placement delete. */
2173 if (placement_allocation_fn_p)
2176 stabilize_call (alloc_call, &inits);
2178 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2182 /* unless an allocation function is declared with an empty excep-
2183 tion-specification (_except.spec_), throw(), it indicates failure to
2184 allocate storage by throwing a bad_alloc exception (clause _except_,
2185 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2186 cation function is declared with an empty exception-specification,
2187 throw(), it returns null to indicate failure to allocate storage and a
2188 non-null pointer otherwise.
2190 So check for a null exception spec on the op new we just called. */
2192 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2193 check_new = (flag_check_new || nothrow) && ! use_java_new;
2201 /* Adjust so we're pointing to the start of the object. */
2202 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2203 alloc_node, cookie_size);
2205 /* Store the number of bytes allocated so that we can know how
2206 many elements to destroy later. We use the last sizeof
2207 (size_t) bytes to store the number of elements. */
2208 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2209 cookie_ptr = fold_build2_loc (input_location,
2210 POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2211 alloc_node, cookie_ptr);
2212 size_ptr_type = build_pointer_type (sizetype);
2213 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2214 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2216 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2218 if (targetm.cxx.cookie_has_size ())
2220 /* Also store the element size. */
2221 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2222 fold_build1_loc (input_location,
2223 NEGATE_EXPR, sizetype,
2224 size_in_bytes (sizetype)));
2226 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2227 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2228 size_in_bytes (elt_type));
2229 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2230 cookie, cookie_expr);
2235 cookie_expr = NULL_TREE;
2236 data_addr = alloc_node;
2239 /* Now use a pointer to the type we've actually allocated. */
2241 /* But we want to operate on a non-const version to start with,
2242 since we'll be modifying the elements. */
2243 non_const_pointer_type = build_pointer_type
2244 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST));
2246 data_addr = fold_convert (non_const_pointer_type, data_addr);
2247 /* Any further uses of alloc_node will want this type, too. */
2248 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2250 /* Now initialize the allocated object. Note that we preevaluate the
2251 initialization expression, apart from the actual constructor call or
2252 assignment--we do this because we want to delay the allocation as long
2253 as possible in order to minimize the size of the exception region for
2254 placement delete. */
2258 bool explicit_value_init_p = false;
2260 if (*init != NULL && VEC_empty (tree, *init))
2263 explicit_value_init_p = true;
2268 tree vecinit = NULL_TREE;
2269 if (*init && VEC_length (tree, *init) == 1
2270 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2271 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2273 tree arraytype, domain;
2274 vecinit = VEC_index (tree, *init, 0);
2275 if (TREE_CONSTANT (nelts))
2276 domain = compute_array_index_type (NULL_TREE, nelts);
2280 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2281 warning (0, "non-constant array size in new, unable to "
2282 "verify length of initializer-list");
2284 arraytype = build_cplus_array_type (type, domain);
2285 vecinit = digest_init (arraytype, vecinit);
2289 if (complain & tf_error)
2290 permerror (input_location, "ISO C++ forbids initialization in array new");
2292 return error_mark_node;
2293 vecinit = build_tree_list_vec (*init);
2296 = build_vec_init (data_addr,
2297 cp_build_binary_op (input_location,
2298 MINUS_EXPR, outer_nelts,
2302 explicit_value_init_p,
2306 /* An array initialization is stable because the initialization
2307 of each element is a full-expression, so the temporaries don't
2313 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2315 if (TYPE_NEEDS_CONSTRUCTING (type)
2316 && (!explicit_value_init_p || processing_template_decl))
2318 init_expr = build_special_member_call (init_expr,
2319 complete_ctor_identifier,
2324 else if (explicit_value_init_p)
2326 if (processing_template_decl)
2327 /* Don't worry about it, we'll handle this properly at
2328 instantiation time. */;
2331 /* Something like `new int()'. */
2332 tree val = build_value_init (type, complain);
2333 if (val == error_mark_node)
2334 return error_mark_node;
2335 init_expr = build2 (INIT_EXPR, type, init_expr, val);
2342 /* We are processing something like `new int (10)', which
2343 means allocate an int, and initialize it with 10. */
2345 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2346 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2349 stable = stabilize_init (init_expr, &init_preeval_expr);
2352 if (init_expr == error_mark_node)
2353 return error_mark_node;
2355 /* If any part of the object initialization terminates by throwing an
2356 exception and a suitable deallocation function can be found, the
2357 deallocation function is called to free the memory in which the
2358 object was being constructed, after which the exception continues
2359 to propagate in the context of the new-expression. If no
2360 unambiguous matching deallocation function can be found,
2361 propagating the exception does not cause the object's memory to be
2363 if (flag_exceptions && ! use_java_new)
2365 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2368 /* The Standard is unclear here, but the right thing to do
2369 is to use the same method for finding deallocation
2370 functions that we use for finding allocation functions. */
2371 cleanup = (build_op_delete_call
2375 globally_qualified_p,
2376 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2382 /* This is much simpler if we were able to preevaluate all of
2383 the arguments to the constructor call. */
2385 /* CLEANUP is compiler-generated, so no diagnostics. */
2386 TREE_NO_WARNING (cleanup) = true;
2387 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2388 init_expr, cleanup);
2389 /* Likewise, this try-catch is compiler-generated. */
2390 TREE_NO_WARNING (init_expr) = true;
2393 /* Ack! First we allocate the memory. Then we set our sentry
2394 variable to true, and expand a cleanup that deletes the
2395 memory if sentry is true. Then we run the constructor, and
2396 finally clear the sentry.
2398 We need to do this because we allocate the space first, so
2399 if there are any temporaries with cleanups in the
2400 constructor args and we weren't able to preevaluate them, we
2401 need this EH region to extend until end of full-expression
2402 to preserve nesting. */
2404 tree end, sentry, begin;
2406 begin = get_target_expr (boolean_true_node);
2407 CLEANUP_EH_ONLY (begin) = 1;
2409 sentry = TARGET_EXPR_SLOT (begin);
2411 /* CLEANUP is compiler-generated, so no diagnostics. */
2412 TREE_NO_WARNING (cleanup) = true;
2414 TARGET_EXPR_CLEANUP (begin)
2415 = build3 (COND_EXPR, void_type_node, sentry,
2416 cleanup, void_zero_node);
2418 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2419 sentry, boolean_false_node);
2422 = build2 (COMPOUND_EXPR, void_type_node, begin,
2423 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2425 /* Likewise, this is compiler-generated. */
2426 TREE_NO_WARNING (init_expr) = true;
2431 init_expr = NULL_TREE;
2433 /* Now build up the return value in reverse order. */
2438 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2440 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2442 if (rval == data_addr)
2443 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2444 and return the call (which doesn't need to be adjusted). */
2445 rval = TARGET_EXPR_INITIAL (alloc_expr);
2450 tree ifexp = cp_build_binary_op (input_location,
2451 NE_EXPR, alloc_node,
2454 rval = build_conditional_expr (ifexp, rval, alloc_node,
2458 /* Perform the allocation before anything else, so that ALLOC_NODE
2459 has been initialized before we start using it. */
2460 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2463 if (init_preeval_expr)
2464 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2466 /* A new-expression is never an lvalue. */
2467 gcc_assert (!lvalue_p (rval));
2469 return convert (pointer_type, rval);
2472 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2473 is a vector of placement-new arguments (or NULL if none). If NELTS
2474 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2475 is not NULL, then this is an array-new allocation; TYPE is the type
2476 of the elements in the array and NELTS is the number of elements in
2477 the array. *INIT, if non-NULL, is the initializer for the new
2478 object, or an empty vector to indicate an initializer of "()". If
2479 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2480 rather than just "new". This may change PLACEMENT and INIT. */
2483 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2484 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2487 VEC(tree,gc) *orig_placement = NULL;
2488 tree orig_nelts = NULL_TREE;
2489 VEC(tree,gc) *orig_init = NULL;
2491 if (type == error_mark_node)
2492 return error_mark_node;
2494 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2496 tree auto_node = type_uses_auto (type);
2497 if (auto_node && describable_type (VEC_index (tree, *init, 0)))
2498 type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node);
2501 if (processing_template_decl)
2503 if (dependent_type_p (type)
2504 || any_type_dependent_arguments_p (*placement)
2505 || (nelts && type_dependent_expression_p (nelts))
2506 || any_type_dependent_arguments_p (*init))
2507 return build_raw_new_expr (*placement, type, nelts, *init,
2510 orig_placement = make_tree_vector_copy (*placement);
2512 orig_init = make_tree_vector_copy (*init);
2514 make_args_non_dependent (*placement);
2516 nelts = build_non_dependent_expr (nelts);
2517 make_args_non_dependent (*init);
2522 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2524 if (complain & tf_error)
2525 permerror (input_location, "size in array new must have integral type");
2527 return error_mark_node;
2529 nelts = mark_rvalue_use (nelts);
2530 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2533 /* ``A reference cannot be created by the new operator. A reference
2534 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2535 returned by new.'' ARM 5.3.3 */
2536 if (TREE_CODE (type) == REFERENCE_TYPE)
2538 if (complain & tf_error)
2539 error ("new cannot be applied to a reference type");
2541 return error_mark_node;
2542 type = TREE_TYPE (type);
2545 if (TREE_CODE (type) == FUNCTION_TYPE)
2547 if (complain & tf_error)
2548 error ("new cannot be applied to a function type");
2549 return error_mark_node;
2552 /* The type allocated must be complete. If the new-type-id was
2553 "T[N]" then we are just checking that "T" is complete here, but
2554 that is equivalent, since the value of "N" doesn't matter. */
2555 if (!complete_type_or_maybe_complain (type, NULL_TREE, complain))
2556 return error_mark_node;
2558 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2559 if (rval == error_mark_node)
2560 return error_mark_node;
2562 if (processing_template_decl)
2564 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2565 orig_init, use_global_new);
2566 release_tree_vector (orig_placement);
2567 release_tree_vector (orig_init);
2571 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2572 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2573 TREE_NO_WARNING (rval) = 1;
2578 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2581 build_java_class_ref (tree type)
2583 tree name = NULL_TREE, class_decl;
2584 static tree CL_suffix = NULL_TREE;
2585 if (CL_suffix == NULL_TREE)
2586 CL_suffix = get_identifier("class$");
2587 if (jclass_node == NULL_TREE)
2589 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2590 if (jclass_node == NULL_TREE)
2592 error ("call to Java constructor, while %<jclass%> undefined");
2593 return error_mark_node;
2595 jclass_node = TREE_TYPE (jclass_node);
2598 /* Mangle the class$ field. */
2601 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2602 if (DECL_NAME (field) == CL_suffix)
2604 mangle_decl (field);
2605 name = DECL_ASSEMBLER_NAME (field);
2610 error ("can't find %<class$%> in %qT", type);
2611 return error_mark_node;
2615 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2616 if (class_decl == NULL_TREE)
2618 class_decl = build_decl (input_location,
2619 VAR_DECL, name, TREE_TYPE (jclass_node));
2620 TREE_STATIC (class_decl) = 1;
2621 DECL_EXTERNAL (class_decl) = 1;
2622 TREE_PUBLIC (class_decl) = 1;
2623 DECL_ARTIFICIAL (class_decl) = 1;
2624 DECL_IGNORED_P (class_decl) = 1;
2625 pushdecl_top_level (class_decl);
2626 make_decl_rtl (class_decl);
2632 build_vec_delete_1 (tree base, tree maxindex, tree type,
2633 special_function_kind auto_delete_vec, int use_global_delete)
2636 tree ptype = build_pointer_type (type = complete_type (type));
2637 tree size_exp = size_in_bytes (type);
2639 /* Temporary variables used by the loop. */
2640 tree tbase, tbase_init;
2642 /* This is the body of the loop that implements the deletion of a
2643 single element, and moves temp variables to next elements. */
2646 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2649 /* This is the thing that governs what to do after the loop has run. */
2650 tree deallocate_expr = 0;
2652 /* This is the BIND_EXPR which holds the outermost iterator of the
2653 loop. It is convenient to set this variable up and test it before
2654 executing any other code in the loop.
2655 This is also the containing expression returned by this function. */
2656 tree controller = NULL_TREE;
2659 /* We should only have 1-D arrays here. */
2660 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2662 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2665 /* The below is short by the cookie size. */
2666 virtual_size = size_binop (MULT_EXPR, size_exp,
2667 convert (sizetype, maxindex));
2669 tbase = create_temporary_var (ptype);
2670 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2671 fold_build2_loc (input_location,
2672 POINTER_PLUS_EXPR, ptype,
2673 fold_convert (ptype, base),
2675 tf_warning_or_error);
2676 controller = build3 (BIND_EXPR, void_type_node, tbase,
2677 NULL_TREE, NULL_TREE);
2678 TREE_SIDE_EFFECTS (controller) = 1;
2680 body = build1 (EXIT_EXPR, void_type_node,
2681 build2 (EQ_EXPR, boolean_type_node, tbase,
2682 fold_convert (ptype, base)));
2683 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp);
2684 body = build_compound_expr
2686 body, cp_build_modify_expr (tbase, NOP_EXPR,
2687 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2688 tf_warning_or_error));
2689 body = build_compound_expr
2691 body, build_delete (ptype, tbase, sfk_complete_destructor,
2692 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2694 loop = build1 (LOOP_EXPR, void_type_node, body);
2695 loop = build_compound_expr (input_location, tbase_init, loop);
2698 /* If the delete flag is one, or anything else with the low bit set,
2699 delete the storage. */
2700 if (auto_delete_vec != sfk_base_destructor)
2704 /* The below is short by the cookie size. */
2705 virtual_size = size_binop (MULT_EXPR, size_exp,
2706 convert (sizetype, maxindex));
2708 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2715 cookie_size = targetm.cxx.get_cookie_size (type);
2717 = cp_convert (ptype,
2718 cp_build_binary_op (input_location,
2720 cp_convert (string_type_node,
2723 tf_warning_or_error));
2724 /* True size with header. */
2725 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2728 if (auto_delete_vec == sfk_deleting_destructor)
2729 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2730 base_tbd, virtual_size,
2731 use_global_delete & 1,
2732 /*placement=*/NULL_TREE,
2733 /*alloc_fn=*/NULL_TREE);
2737 if (!deallocate_expr)
2740 body = deallocate_expr;
2742 body = build_compound_expr (input_location, body, deallocate_expr);
2745 body = integer_zero_node;
2747 /* Outermost wrapper: If pointer is null, punt. */
2748 body = fold_build3_loc (input_location, COND_EXPR, void_type_node,
2749 fold_build2_loc (input_location,
2750 NE_EXPR, boolean_type_node, base,
2751 convert (TREE_TYPE (base),
2752 integer_zero_node)),
2753 body, integer_zero_node);
2754 body = build1 (NOP_EXPR, void_type_node, body);
2758 TREE_OPERAND (controller, 1) = body;
2762 if (TREE_CODE (base) == SAVE_EXPR)
2763 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2764 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2766 return convert_to_void (body, ICV_CAST, tf_warning_or_error);
2769 /* Create an unnamed variable of the indicated TYPE. */
2772 create_temporary_var (tree type)
2776 decl = build_decl (input_location,
2777 VAR_DECL, NULL_TREE, type);
2778 TREE_USED (decl) = 1;
2779 DECL_ARTIFICIAL (decl) = 1;
2780 DECL_IGNORED_P (decl) = 1;
2781 DECL_CONTEXT (decl) = current_function_decl;
2786 /* Create a new temporary variable of the indicated TYPE, initialized
2789 It is not entered into current_binding_level, because that breaks
2790 things when it comes time to do final cleanups (which take place
2791 "outside" the binding contour of the function). */
2794 get_temp_regvar (tree type, tree init)
2798 decl = create_temporary_var (type);
2799 add_decl_expr (decl);
2801 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2802 tf_warning_or_error));
2807 /* `build_vec_init' returns tree structure that performs
2808 initialization of a vector of aggregate types.
2810 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2811 to the first element, of POINTER_TYPE.
2812 MAXINDEX is the maximum index of the array (one less than the
2813 number of elements). It is only used if BASE is a pointer or
2814 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2816 INIT is the (possibly NULL) initializer.
2818 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2819 elements in the array are value-initialized.
2821 FROM_ARRAY is 0 if we should init everything with INIT
2822 (i.e., every element initialized from INIT).
2823 FROM_ARRAY is 1 if we should index into INIT in parallel
2824 with initialization of DECL.
2825 FROM_ARRAY is 2 if we should index into INIT in parallel,
2826 but use assignment instead of initialization. */
2829 build_vec_init (tree base, tree maxindex, tree init,
2830 bool explicit_value_init_p,
2831 int from_array, tsubst_flags_t complain)
2834 tree base2 = NULL_TREE;
2835 tree itype = NULL_TREE;
2837 /* The type of BASE. */
2838 tree atype = TREE_TYPE (base);
2839 /* The type of an element in the array. */
2840 tree type = TREE_TYPE (atype);
2841 /* The element type reached after removing all outer array
2843 tree inner_elt_type;
2844 /* The type of a pointer to an element in the array. */
2849 tree try_block = NULL_TREE;
2850 int num_initialized_elts = 0;
2853 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2854 maxindex = array_type_nelts (atype);
2856 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2857 return error_mark_node;
2859 if (explicit_value_init_p)
2862 inner_elt_type = strip_array_types (type);
2864 /* Look through the TARGET_EXPR around a compound literal. */
2865 if (init && TREE_CODE (init) == TARGET_EXPR
2866 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR
2868 init = TARGET_EXPR_INITIAL (init);
2871 && TREE_CODE (atype) == ARRAY_TYPE
2873 ? (!CLASS_TYPE_P (inner_elt_type)
2874 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type))
2875 : !TYPE_NEEDS_CONSTRUCTING (type))
2876 && ((TREE_CODE (init) == CONSTRUCTOR
2877 /* Don't do this if the CONSTRUCTOR might contain something
2878 that might throw and require us to clean up. */
2879 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2880 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2883 /* Do non-default initialization of trivial arrays resulting from
2884 brace-enclosed initializers. In this case, digest_init and
2885 store_constructor will handle the semantics for us. */
2887 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2891 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2892 if (TREE_CODE (atype) == ARRAY_TYPE)
2894 ptype = build_pointer_type (type);
2895 base = cp_convert (ptype, decay_conversion (base));
2900 /* The code we are generating looks like:
2904 ptrdiff_t iterator = maxindex;
2906 for (; iterator != -1; --iterator) {
2907 ... initialize *t1 ...
2911 ... destroy elements that were constructed ...
2916 We can omit the try and catch blocks if we know that the
2917 initialization will never throw an exception, or if the array
2918 elements do not have destructors. We can omit the loop completely if
2919 the elements of the array do not have constructors.
2921 We actually wrap the entire body of the above in a STMT_EXPR, for
2924 When copying from array to another, when the array elements have
2925 only trivial copy constructors, we should use __builtin_memcpy
2926 rather than generating a loop. That way, we could take advantage
2927 of whatever cleverness the back end has for dealing with copies
2928 of blocks of memory. */
2930 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2931 destroy_temps = stmts_are_full_exprs_p ();
2932 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2933 rval = get_temp_regvar (ptype, base);
2934 base = get_temp_regvar (ptype, rval);
2935 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2937 /* If initializing one array from another, initialize element by
2938 element. We rely upon the below calls to do the argument
2939 checking. Evaluate the initializer before entering the try block. */
2940 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR)
2942 base2 = decay_conversion (init);
2943 itype = TREE_TYPE (base2);
2944 base2 = get_temp_regvar (itype, base2);
2945 itype = TREE_TYPE (itype);
2948 /* Protect the entire array initialization so that we can destroy
2949 the partially constructed array if an exception is thrown.
2950 But don't do this if we're assigning. */
2951 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2954 try_block = begin_try_block ();
2957 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2959 /* Do non-default initialization of non-trivial arrays resulting from
2960 brace-enclosed initializers. */
2961 unsigned HOST_WIDE_INT idx;
2965 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2967 tree baseref = build1 (INDIRECT_REF, type, base);
2969 num_initialized_elts++;
2971 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2972 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2973 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2975 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2977 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2979 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2981 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2985 /* Clear out INIT so that we don't get confused below. */
2988 else if (from_array)
2991 /* OK, we set base2 above. */;
2992 else if (TYPE_LANG_SPECIFIC (type)
2993 && TYPE_NEEDS_CONSTRUCTING (type)
2994 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2996 if (complain & tf_error)
2997 error ("initializer ends prematurely");
2998 return error_mark_node;
3002 /* Now, default-initialize any remaining elements. We don't need to
3003 do that if a) the type does not need constructing, or b) we've
3004 already initialized all the elements.
3006 We do need to keep going if we're copying an array. */
3009 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
3010 && ! (host_integerp (maxindex, 0)
3011 && (num_initialized_elts
3012 == tree_low_cst (maxindex, 0) + 1))))
3014 /* If the ITERATOR is equal to -1, then we don't have to loop;
3015 we've already initialized all the elements. */
3020 for_stmt = begin_for_stmt ();
3021 finish_for_init_stmt (for_stmt);
3022 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
3023 build_int_cst (TREE_TYPE (iterator), -1)),
3025 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3029 to = build1 (INDIRECT_REF, type, base);
3036 from = build1 (INDIRECT_REF, itype, base2);
3040 if (from_array == 2)
3041 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3043 else if (TYPE_NEEDS_CONSTRUCTING (type))
3044 elt_init = build_aggr_init (to, from, 0, complain);
3046 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3051 else if (TREE_CODE (type) == ARRAY_TYPE)
3055 ("cannot initialize multi-dimensional array with initializer");
3056 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
3058 explicit_value_init_p,
3061 else if (explicit_value_init_p)
3063 elt_init = build_value_init (type, complain);
3064 if (elt_init == error_mark_node)
3065 return error_mark_node;
3067 elt_init = build2 (INIT_EXPR, type, to, elt_init);
3071 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
3072 elt_init = build_aggr_init (to, init, 0, complain);
3075 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3076 finish_expr_stmt (elt_init);
3077 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3079 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
3082 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
3085 finish_for_stmt (for_stmt);
3088 /* Make sure to cleanup any partially constructed elements. */
3089 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3093 tree m = cp_build_binary_op (input_location,
3094 MINUS_EXPR, maxindex, iterator,
3097 /* Flatten multi-dimensional array since build_vec_delete only
3098 expects one-dimensional array. */
3099 if (TREE_CODE (type) == ARRAY_TYPE)
3100 m = cp_build_binary_op (input_location,
3102 array_type_nelts_total (type),
3105 finish_cleanup_try_block (try_block);
3106 e = build_vec_delete_1 (rval, m,
3107 inner_elt_type, sfk_base_destructor,
3108 /*use_global_delete=*/0);
3109 finish_cleanup (e, try_block);
3112 /* The value of the array initialization is the array itself, RVAL
3113 is a pointer to the first element. */
3114 finish_stmt_expr_expr (rval, stmt_expr);
3116 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
3118 /* Now make the result have the correct type. */
3119 if (TREE_CODE (atype) == ARRAY_TYPE)
3121 atype = build_pointer_type (atype);
3122 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
3123 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain);
3124 TREE_NO_WARNING (stmt_expr) = 1;
3127 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3131 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3135 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
3141 case sfk_complete_destructor:
3142 name = complete_dtor_identifier;
3145 case sfk_base_destructor:
3146 name = base_dtor_identifier;
3149 case sfk_deleting_destructor:
3150 name = deleting_dtor_identifier;
3156 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
3157 return build_new_method_call (exp, fn,
3159 /*conversion_path=*/NULL_TREE,
3162 tf_warning_or_error);
3165 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3166 ADDR is an expression which yields the store to be destroyed.
3167 AUTO_DELETE is the name of the destructor to call, i.e., either
3168 sfk_complete_destructor, sfk_base_destructor, or
3169 sfk_deleting_destructor.
3171 FLAGS is the logical disjunction of zero or more LOOKUP_
3172 flags. See cp-tree.h for more info. */
3175 build_delete (tree type, tree addr, special_function_kind auto_delete,
3176 int flags, int use_global_delete)
3180 if (addr == error_mark_node)
3181 return error_mark_node;
3183 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3184 set to `error_mark_node' before it gets properly cleaned up. */
3185 if (type == error_mark_node)
3186 return error_mark_node;
3188 type = TYPE_MAIN_VARIANT (type);
3190 addr = mark_rvalue_use (addr);
3192 if (TREE_CODE (type) == POINTER_TYPE)
3194 bool complete_p = true;
3196 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3197 if (TREE_CODE (type) == ARRAY_TYPE)
3200 /* We don't want to warn about delete of void*, only other
3201 incomplete types. Deleting other incomplete types
3202 invokes undefined behavior, but it is not ill-formed, so
3203 compile to something that would even do The Right Thing
3204 (TM) should the type have a trivial dtor and no delete
3206 if (!VOID_TYPE_P (type))
3208 complete_type (type);
3209 if (!COMPLETE_TYPE_P (type))
3211 if (warning (0, "possible problem detected in invocation of "
3212 "delete operator:"))
3214 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3215 inform (input_location, "neither the destructor nor the class-specific "
3216 "operator delete will be called, even if they are "
3217 "declared when the class is defined.");
3222 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3223 /* Call the builtin operator delete. */
3224 return build_builtin_delete_call (addr);
3225 if (TREE_SIDE_EFFECTS (addr))
3226 addr = save_expr (addr);
3228 /* Throw away const and volatile on target type of addr. */
3229 addr = convert_force (build_pointer_type (type), addr, 0);
3231 else if (TREE_CODE (type) == ARRAY_TYPE)
3235 if (TYPE_DOMAIN (type) == NULL_TREE)
3237 error ("unknown array size in delete");
3238 return error_mark_node;
3240 return build_vec_delete (addr, array_type_nelts (type),
3241 auto_delete, use_global_delete);
3245 /* Don't check PROTECT here; leave that decision to the
3246 destructor. If the destructor is accessible, call it,
3247 else report error. */
3248 addr = cp_build_addr_expr (addr, tf_warning_or_error);
3249 if (TREE_SIDE_EFFECTS (addr))
3250 addr = save_expr (addr);
3252 addr = convert_force (build_pointer_type (type), addr, 0);
3255 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3257 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3259 if (auto_delete != sfk_deleting_destructor)
3260 return void_zero_node;
3262 return build_op_delete_call (DELETE_EXPR, addr,
3263 cxx_sizeof_nowarn (type),
3265 /*placement=*/NULL_TREE,
3266 /*alloc_fn=*/NULL_TREE);
3270 tree head = NULL_TREE;
3271 tree do_delete = NULL_TREE;
3274 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3275 lazily_declare_fn (sfk_destructor, type);
3277 /* For `::delete x', we must not use the deleting destructor
3278 since then we would not be sure to get the global `operator
3280 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3282 /* We will use ADDR multiple times so we must save it. */
3283 addr = save_expr (addr);
3284 head = get_target_expr (build_headof (addr));
3285 /* Delete the object. */
3286 do_delete = build_builtin_delete_call (head);
3287 /* Otherwise, treat this like a complete object destructor
3289 auto_delete = sfk_complete_destructor;
3291 /* If the destructor is non-virtual, there is no deleting
3292 variant. Instead, we must explicitly call the appropriate
3293 `operator delete' here. */
3294 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3295 && auto_delete == sfk_deleting_destructor)
3297 /* We will use ADDR multiple times so we must save it. */
3298 addr = save_expr (addr);
3299 /* Build the call. */
3300 do_delete = build_op_delete_call (DELETE_EXPR,
3302 cxx_sizeof_nowarn (type),
3304 /*placement=*/NULL_TREE,
3305 /*alloc_fn=*/NULL_TREE);
3306 /* Call the complete object destructor. */
3307 auto_delete = sfk_complete_destructor;
3309 else if (auto_delete == sfk_deleting_destructor
3310 && TYPE_GETS_REG_DELETE (type))
3312 /* Make sure we have access to the member op delete, even though
3313 we'll actually be calling it from the destructor. */
3314 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3316 /*placement=*/NULL_TREE,
3317 /*alloc_fn=*/NULL_TREE);
3320 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL,
3321 tf_warning_or_error),
3322 auto_delete, flags);
3324 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3326 /* We need to calculate this before the dtor changes the vptr. */
3328 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3330 if (flags & LOOKUP_DESTRUCTOR)
3331 /* Explicit destructor call; don't check for null pointer. */
3332 ifexp = integer_one_node;
3334 /* Handle deleting a null pointer. */
3335 ifexp = fold (cp_build_binary_op (input_location,
3336 NE_EXPR, addr, integer_zero_node,
3337 tf_warning_or_error));
3339 if (ifexp != integer_one_node)
3340 expr = build3 (COND_EXPR, void_type_node,
3341 ifexp, expr, void_zero_node);
3347 /* At the beginning of a destructor, push cleanups that will call the
3348 destructors for our base classes and members.
3350 Called from begin_destructor_body. */
3353 push_base_cleanups (void)
3355 tree binfo, base_binfo;
3359 VEC(tree,gc) *vbases;
3361 /* Run destructors for all virtual baseclasses. */
3362 if (CLASSTYPE_VBASECLASSES (current_class_type))
3364 tree cond = (condition_conversion
3365 (build2 (BIT_AND_EXPR, integer_type_node,
3366 current_in_charge_parm,
3367 integer_two_node)));
3369 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3370 order, which is also the right order for pushing cleanups. */
3371 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3372 VEC_iterate (tree, vbases, i, base_binfo); i++)
3374 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3376 expr = build_special_member_call (current_class_ref,
3377 base_dtor_identifier,
3381 | LOOKUP_NONVIRTUAL),
3382 tf_warning_or_error);
3383 expr = build3 (COND_EXPR, void_type_node, cond,
3384 expr, void_zero_node);
3385 finish_decl_cleanup (NULL_TREE, expr);
3390 /* Take care of the remaining baseclasses. */
3391 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3392 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3394 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3395 || BINFO_VIRTUAL_P (base_binfo))
3398 expr = build_special_member_call (current_class_ref,
3399 base_dtor_identifier,
3401 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3402 tf_warning_or_error);
3403 finish_decl_cleanup (NULL_TREE, expr);
3406 /* Don't automatically destroy union members. */
3407 if (TREE_CODE (current_class_type) == UNION_TYPE)
3410 for (member = TYPE_FIELDS (current_class_type); member;
3411 member = DECL_CHAIN (member))
3413 tree this_type = TREE_TYPE (member);
3414 if (this_type == error_mark_node
3415 || TREE_CODE (member) != FIELD_DECL
3416 || DECL_ARTIFICIAL (member))
3418 if (ANON_UNION_TYPE_P (this_type))
3420 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type))
3422 tree this_member = (build_class_member_access_expr
3423 (current_class_ref, member,
3424 /*access_path=*/NULL_TREE,
3425 /*preserve_reference=*/false,
3426 tf_warning_or_error));
3427 expr = build_delete (this_type, this_member,
3428 sfk_complete_destructor,
3429 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3431 finish_decl_cleanup (NULL_TREE, expr);
3436 /* Build a C++ vector delete expression.
3437 MAXINDEX is the number of elements to be deleted.
3438 ELT_SIZE is the nominal size of each element in the vector.
3439 BASE is the expression that should yield the store to be deleted.
3440 This function expands (or synthesizes) these calls itself.
3441 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3443 This also calls delete for virtual baseclasses of elements of the vector.
3445 Update: MAXINDEX is no longer needed. The size can be extracted from the
3446 start of the vector for pointers, and from the type for arrays. We still
3447 use MAXINDEX for arrays because it happens to already have one of the
3448 values we'd have to extract. (We could use MAXINDEX with pointers to
3449 confirm the size, and trap if the numbers differ; not clear that it'd
3450 be worth bothering.) */
3453 build_vec_delete (tree base, tree maxindex,
3454 special_function_kind auto_delete_vec, int use_global_delete)
3458 tree base_init = NULL_TREE;
3460 type = TREE_TYPE (base);
3462 if (TREE_CODE (type) == POINTER_TYPE)
3464 /* Step back one from start of vector, and read dimension. */
3466 tree size_ptr_type = build_pointer_type (sizetype);
3468 if (TREE_SIDE_EFFECTS (base))
3470 base_init = get_target_expr (base);
3471 base = TARGET_EXPR_SLOT (base_init);
3473 type = strip_array_types (TREE_TYPE (type));
3474 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR,
3475 sizetype, TYPE_SIZE_UNIT (sizetype));
3476 cookie_addr = build2 (POINTER_PLUS_EXPR,
3478 fold_convert (size_ptr_type, base),
3480 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, tf_warning_or_error);
3482 else if (TREE_CODE (type) == ARRAY_TYPE)
3484 /* Get the total number of things in the array, maxindex is a
3486 maxindex = array_type_nelts_total (type);
3487 type = strip_array_types (type);
3488 base = cp_build_addr_expr (base, tf_warning_or_error);
3489 if (TREE_SIDE_EFFECTS (base))
3491 base_init = get_target_expr (base);
3492 base = TARGET_EXPR_SLOT (base_init);
3497 if (base != error_mark_node)
3498 error ("type to vector delete is neither pointer or array type");
3499 return error_mark_node;
3502 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3505 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);