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 if (CLASS_TYPE_P (type))
300 if (type_has_user_provided_constructor (type))
301 return build_aggr_init_expr
303 build_special_member_call (NULL_TREE, complete_ctor_identifier,
304 NULL, type, LOOKUP_NORMAL,
306 else if (TREE_CODE (type) != UNION_TYPE && TYPE_NEEDS_CONSTRUCTING (type))
308 /* This is a class that needs constructing, but doesn't have
309 a user-provided constructor. So we need to zero-initialize
310 the object and then call the implicitly defined ctor.
311 This will be handled in simplify_aggr_init_expr. */
312 tree ctor = build_special_member_call
313 (NULL_TREE, complete_ctor_identifier,
314 NULL, type, LOOKUP_NORMAL, complain);
316 ctor = build_aggr_init_expr (type, ctor);
317 AGGR_INIT_ZERO_FIRST (ctor) = 1;
321 return build_value_init_noctor (type, complain);
324 /* Like build_value_init, but don't call the constructor for TYPE. Used
325 for base initializers. */
328 build_value_init_noctor (tree type, tsubst_flags_t complain)
330 if (CLASS_TYPE_P (type))
332 gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type));
334 if (TREE_CODE (type) != UNION_TYPE)
337 VEC(constructor_elt,gc) *v = NULL;
339 /* Iterate over the fields, building initializations. */
340 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
344 if (TREE_CODE (field) != FIELD_DECL)
347 ftype = TREE_TYPE (field);
349 if (TREE_CODE (ftype) == REFERENCE_TYPE)
351 if (complain & tf_error)
352 error ("value-initialization of reference");
354 return error_mark_node;
357 /* We could skip vfields and fields of types with
358 user-defined constructors, but I think that won't improve
359 performance at all; it should be simpler in general just
360 to zero out the entire object than try to only zero the
361 bits that actually need it. */
363 /* Note that for class types there will be FIELD_DECLs
364 corresponding to base classes as well. Thus, iterating
365 over TYPE_FIELDs will result in correct initialization of
366 all of the subobjects. */
367 value = build_value_init (ftype, complain);
370 CONSTRUCTOR_APPEND_ELT(v, field, value);
373 /* Build a constructor to contain the zero- initializations. */
374 return build_constructor (type, v);
377 else if (TREE_CODE (type) == ARRAY_TYPE)
379 VEC(constructor_elt,gc) *v = NULL;
381 /* Iterate over the array elements, building initializations. */
382 tree max_index = array_type_nelts (type);
384 /* If we have an error_mark here, we should just return error mark
385 as we don't know the size of the array yet. */
386 if (max_index == error_mark_node)
388 error ("cannot value-initialize array of unknown bound %qT", type);
389 return error_mark_node;
391 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
393 /* A zero-sized array, which is accepted as an extension, will
394 have an upper bound of -1. */
395 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
399 v = VEC_alloc (constructor_elt, gc, 1);
400 ce = VEC_quick_push (constructor_elt, v, NULL);
402 /* If this is a one element array, we just use a regular init. */
403 if (tree_int_cst_equal (size_zero_node, max_index))
404 ce->index = size_zero_node;
406 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
409 ce->value = build_value_init (TREE_TYPE (type), complain);
411 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
412 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR
413 && TREE_CODE (ce->value) != AGGR_INIT_EXPR);
416 /* Build a constructor to contain the initializations. */
417 return build_constructor (type, v);
420 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
423 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
424 arguments. If TREE_LIST is void_type_node, an empty initializer
425 list was given; if NULL_TREE no initializer was given. */
428 perform_member_init (tree member, tree init)
431 tree type = TREE_TYPE (member);
433 /* Effective C++ rule 12 requires that all data members be
435 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE)
436 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__,
437 "%qD should be initialized in the member initialization list",
440 /* Get an lvalue for the data member. */
441 decl = build_class_member_access_expr (current_class_ref, member,
442 /*access_path=*/NULL_TREE,
443 /*preserve_reference=*/true,
444 tf_warning_or_error);
445 if (decl == error_mark_node)
448 if (init == void_type_node)
450 /* mem() means value-initialization. */
451 if (TREE_CODE (type) == ARRAY_TYPE)
453 init = build_vec_init (decl, NULL_TREE, NULL_TREE,
454 /*explicit_value_init_p=*/true,
456 tf_warning_or_error);
457 finish_expr_stmt (init);
461 if (TREE_CODE (type) == REFERENCE_TYPE)
462 permerror (DECL_SOURCE_LOCATION (current_function_decl),
463 "value-initialization of %q#D, which has reference type",
467 init = build2 (INIT_EXPR, type, decl,
468 build_value_init (type, tf_warning_or_error));
469 finish_expr_stmt (init);
473 /* Deal with this here, as we will get confused if we try to call the
474 assignment op for an anonymous union. This can happen in a
475 synthesized copy constructor. */
476 else if (ANON_AGGR_TYPE_P (type))
480 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
481 finish_expr_stmt (init);
484 else if (TYPE_NEEDS_CONSTRUCTING (type))
486 if (init != NULL_TREE
487 && TREE_CODE (type) == ARRAY_TYPE
488 && TREE_CHAIN (init) == NULL_TREE
489 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
491 /* Initialization of one array from another. */
492 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
493 /*explicit_value_init_p=*/false,
495 tf_warning_or_error));
499 if (CP_TYPE_CONST_P (type)
501 && !type_has_user_provided_default_constructor (type))
502 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
503 vtable; still give this diagnostic. */
504 permerror (DECL_SOURCE_LOCATION (current_function_decl),
505 "uninitialized member %qD with %<const%> type %qT",
507 finish_expr_stmt (build_aggr_init (decl, init, 0,
508 tf_warning_or_error));
513 if (init == NULL_TREE)
516 /* member traversal: note it leaves init NULL */
517 if (TREE_CODE (type) == REFERENCE_TYPE)
518 permerror (DECL_SOURCE_LOCATION (current_function_decl),
519 "uninitialized reference member %qD",
521 else if (CP_TYPE_CONST_P (type))
522 permerror (DECL_SOURCE_LOCATION (current_function_decl),
523 "uninitialized member %qD with %<const%> type %qT",
526 core_type = strip_array_types (type);
527 if (CLASS_TYPE_P (core_type)
528 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)
529 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)))
530 diagnose_uninitialized_cst_or_ref_member (core_type,
534 else if (TREE_CODE (init) == TREE_LIST)
535 /* There was an explicit member initialization. Do some work
537 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT,
538 tf_warning_or_error);
541 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
542 tf_warning_or_error));
545 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
549 expr = build_class_member_access_expr (current_class_ref, member,
550 /*access_path=*/NULL_TREE,
551 /*preserve_reference=*/false,
552 tf_warning_or_error);
553 expr = build_delete (type, expr, sfk_complete_destructor,
554 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
556 if (expr != error_mark_node)
557 finish_eh_cleanup (expr);
561 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
562 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
565 build_field_list (tree t, tree list, int *uses_unions_p)
571 /* Note whether or not T is a union. */
572 if (TREE_CODE (t) == UNION_TYPE)
575 for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields))
579 /* Skip CONST_DECLs for enumeration constants and so forth. */
580 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
583 fieldtype = TREE_TYPE (fields);
584 /* Keep track of whether or not any fields are unions. */
585 if (TREE_CODE (fieldtype) == UNION_TYPE)
588 /* For an anonymous struct or union, we must recursively
589 consider the fields of the anonymous type. They can be
590 directly initialized from the constructor. */
591 if (ANON_AGGR_TYPE_P (fieldtype))
593 /* Add this field itself. Synthesized copy constructors
594 initialize the entire aggregate. */
595 list = tree_cons (fields, NULL_TREE, list);
596 /* And now add the fields in the anonymous aggregate. */
597 list = build_field_list (fieldtype, list, uses_unions_p);
599 /* Add this field. */
600 else if (DECL_NAME (fields))
601 list = tree_cons (fields, NULL_TREE, list);
607 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
608 a FIELD_DECL or BINFO in T that needs initialization. The
609 TREE_VALUE gives the initializer, or list of initializer arguments.
611 Return a TREE_LIST containing all of the initializations required
612 for T, in the order in which they should be performed. The output
613 list has the same format as the input. */
616 sort_mem_initializers (tree t, tree mem_inits)
619 tree base, binfo, base_binfo;
622 VEC(tree,gc) *vbases;
626 /* Build up a list of initializations. The TREE_PURPOSE of entry
627 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
628 TREE_VALUE will be the constructor arguments, or NULL if no
629 explicit initialization was provided. */
630 sorted_inits = NULL_TREE;
632 /* Process the virtual bases. */
633 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
634 VEC_iterate (tree, vbases, i, base); i++)
635 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
637 /* Process the direct bases. */
638 for (binfo = TYPE_BINFO (t), i = 0;
639 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
640 if (!BINFO_VIRTUAL_P (base_binfo))
641 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
643 /* Process the non-static data members. */
644 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
645 /* Reverse the entire list of initializations, so that they are in
646 the order that they will actually be performed. */
647 sorted_inits = nreverse (sorted_inits);
649 /* If the user presented the initializers in an order different from
650 that in which they will actually occur, we issue a warning. Keep
651 track of the next subobject which can be explicitly initialized
652 without issuing a warning. */
653 next_subobject = sorted_inits;
655 /* Go through the explicit initializers, filling in TREE_PURPOSE in
657 for (init = mem_inits; init; init = TREE_CHAIN (init))
662 subobject = TREE_PURPOSE (init);
664 /* If the explicit initializers are in sorted order, then
665 SUBOBJECT will be NEXT_SUBOBJECT, or something following
667 for (subobject_init = next_subobject;
669 subobject_init = TREE_CHAIN (subobject_init))
670 if (TREE_PURPOSE (subobject_init) == subobject)
673 /* Issue a warning if the explicit initializer order does not
674 match that which will actually occur.
675 ??? Are all these on the correct lines? */
676 if (warn_reorder && !subobject_init)
678 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
679 warning (OPT_Wreorder, "%q+D will be initialized after",
680 TREE_PURPOSE (next_subobject));
682 warning (OPT_Wreorder, "base %qT will be initialized after",
683 TREE_PURPOSE (next_subobject));
684 if (TREE_CODE (subobject) == FIELD_DECL)
685 warning (OPT_Wreorder, " %q+#D", subobject);
687 warning (OPT_Wreorder, " base %qT", subobject);
688 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
689 OPT_Wreorder, " when initialized here");
692 /* Look again, from the beginning of the list. */
695 subobject_init = sorted_inits;
696 while (TREE_PURPOSE (subobject_init) != subobject)
697 subobject_init = TREE_CHAIN (subobject_init);
700 /* It is invalid to initialize the same subobject more than
702 if (TREE_VALUE (subobject_init))
704 if (TREE_CODE (subobject) == FIELD_DECL)
705 error_at (DECL_SOURCE_LOCATION (current_function_decl),
706 "multiple initializations given for %qD",
709 error_at (DECL_SOURCE_LOCATION (current_function_decl),
710 "multiple initializations given for base %qT",
714 /* Record the initialization. */
715 TREE_VALUE (subobject_init) = TREE_VALUE (init);
716 next_subobject = subobject_init;
721 If a ctor-initializer specifies more than one mem-initializer for
722 multiple members of the same union (including members of
723 anonymous unions), the ctor-initializer is ill-formed.
725 Here we also splice out uninitialized union members. */
728 tree last_field = NULL_TREE;
730 for (p = &sorted_inits; *p; )
738 field = TREE_PURPOSE (init);
740 /* Skip base classes. */
741 if (TREE_CODE (field) != FIELD_DECL)
744 /* If this is an anonymous union with no explicit initializer,
746 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field)))
749 /* See if this field is a member of a union, or a member of a
750 structure contained in a union, etc. */
751 for (ctx = DECL_CONTEXT (field);
752 !same_type_p (ctx, t);
753 ctx = TYPE_CONTEXT (ctx))
754 if (TREE_CODE (ctx) == UNION_TYPE)
756 /* If this field is not a member of a union, skip it. */
757 if (TREE_CODE (ctx) != UNION_TYPE)
760 /* If this union member has no explicit initializer, splice
762 if (!TREE_VALUE (init))
765 /* It's only an error if we have two initializers for the same
773 /* See if LAST_FIELD and the field initialized by INIT are
774 members of the same union. If so, there's a problem,
775 unless they're actually members of the same structure
776 which is itself a member of a union. For example, given:
778 union { struct { int i; int j; }; };
780 initializing both `i' and `j' makes sense. */
781 ctx = DECL_CONTEXT (field);
787 last_ctx = DECL_CONTEXT (last_field);
790 if (same_type_p (last_ctx, ctx))
792 if (TREE_CODE (ctx) == UNION_TYPE)
793 error_at (DECL_SOURCE_LOCATION (current_function_decl),
794 "initializations for multiple members of %qT",
800 if (same_type_p (last_ctx, t))
803 last_ctx = TYPE_CONTEXT (last_ctx);
806 /* If we've reached the outermost class, then we're
808 if (same_type_p (ctx, t))
811 ctx = TYPE_CONTEXT (ctx);
818 p = &TREE_CHAIN (*p);
821 *p = TREE_CHAIN (*p);
829 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
830 is a TREE_LIST giving the explicit mem-initializer-list for the
831 constructor. The TREE_PURPOSE of each entry is a subobject (a
832 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
833 is a TREE_LIST giving the arguments to the constructor or
834 void_type_node for an empty list of arguments. */
837 emit_mem_initializers (tree mem_inits)
839 /* We will already have issued an error message about the fact that
840 the type is incomplete. */
841 if (!COMPLETE_TYPE_P (current_class_type))
844 /* Sort the mem-initializers into the order in which the
845 initializations should be performed. */
846 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
848 in_base_initializer = 1;
850 /* Initialize base classes. */
852 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
854 tree subobject = TREE_PURPOSE (mem_inits);
855 tree arguments = TREE_VALUE (mem_inits);
857 /* If these initializations are taking place in a copy constructor,
858 the base class should probably be explicitly initialized if there
859 is a user-defined constructor in the base class (other than the
860 default constructor, which will be called anyway). */
861 if (extra_warnings && !arguments
862 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
863 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
864 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Wextra,
865 "base class %q#T should be explicitly initialized in the "
867 BINFO_TYPE (subobject));
869 /* Initialize the base. */
870 if (BINFO_VIRTUAL_P (subobject))
871 construct_virtual_base (subobject, arguments);
876 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
878 expand_aggr_init_1 (subobject, NULL_TREE,
879 cp_build_indirect_ref (base_addr, RO_NULL,
880 tf_warning_or_error),
883 tf_warning_or_error);
884 expand_cleanup_for_base (subobject, NULL_TREE);
887 mem_inits = TREE_CHAIN (mem_inits);
889 in_base_initializer = 0;
891 /* Initialize the vptrs. */
892 initialize_vtbl_ptrs (current_class_ptr);
894 /* Initialize the data members. */
897 perform_member_init (TREE_PURPOSE (mem_inits),
898 TREE_VALUE (mem_inits));
899 mem_inits = TREE_CHAIN (mem_inits);
903 /* Returns the address of the vtable (i.e., the value that should be
904 assigned to the vptr) for BINFO. */
907 build_vtbl_address (tree binfo)
909 tree binfo_for = binfo;
912 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
913 /* If this is a virtual primary base, then the vtable we want to store
914 is that for the base this is being used as the primary base of. We
915 can't simply skip the initialization, because we may be expanding the
916 inits of a subobject constructor where the virtual base layout
918 while (BINFO_PRIMARY_P (binfo_for))
919 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
921 /* Figure out what vtable BINFO's vtable is based on, and mark it as
923 vtbl = get_vtbl_decl_for_binfo (binfo_for);
924 TREE_USED (vtbl) = 1;
926 /* Now compute the address to use when initializing the vptr. */
927 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
928 if (TREE_CODE (vtbl) == VAR_DECL)
929 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
934 /* This code sets up the virtual function tables appropriate for
935 the pointer DECL. It is a one-ply initialization.
937 BINFO is the exact type that DECL is supposed to be. In
938 multiple inheritance, this might mean "C's A" if C : A, B. */
941 expand_virtual_init (tree binfo, tree decl)
946 /* Compute the initializer for vptr. */
947 vtbl = build_vtbl_address (binfo);
949 /* We may get this vptr from a VTT, if this is a subobject
950 constructor or subobject destructor. */
951 vtt_index = BINFO_VPTR_INDEX (binfo);
957 /* Compute the value to use, when there's a VTT. */
958 vtt_parm = current_vtt_parm;
959 vtbl2 = build2 (POINTER_PLUS_EXPR,
960 TREE_TYPE (vtt_parm),
963 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error);
964 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
966 /* The actual initializer is the VTT value only in the subobject
967 constructor. In maybe_clone_body we'll substitute NULL for
968 the vtt_parm in the case of the non-subobject constructor. */
969 vtbl = build3 (COND_EXPR,
971 build2 (EQ_EXPR, boolean_type_node,
972 current_in_charge_parm, integer_zero_node),
977 /* Compute the location of the vtpr. */
978 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL,
979 tf_warning_or_error),
981 gcc_assert (vtbl_ptr != error_mark_node);
983 /* Assign the vtable to the vptr. */
984 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
985 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
986 tf_warning_or_error));
989 /* If an exception is thrown in a constructor, those base classes already
990 constructed must be destroyed. This function creates the cleanup
991 for BINFO, which has just been constructed. If FLAG is non-NULL,
992 it is a DECL which is nonzero when this base needs to be
996 expand_cleanup_for_base (tree binfo, tree flag)
1000 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
1003 /* Call the destructor. */
1004 expr = build_special_member_call (current_class_ref,
1005 base_dtor_identifier,
1008 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
1009 tf_warning_or_error);
1011 expr = fold_build3_loc (input_location,
1012 COND_EXPR, void_type_node,
1013 c_common_truthvalue_conversion (input_location, flag),
1014 expr, integer_zero_node);
1016 finish_eh_cleanup (expr);
1019 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1023 construct_virtual_base (tree vbase, tree arguments)
1029 /* If there are virtual base classes with destructors, we need to
1030 emit cleanups to destroy them if an exception is thrown during
1031 the construction process. These exception regions (i.e., the
1032 period during which the cleanups must occur) begin from the time
1033 the construction is complete to the end of the function. If we
1034 create a conditional block in which to initialize the
1035 base-classes, then the cleanup region for the virtual base begins
1036 inside a block, and ends outside of that block. This situation
1037 confuses the sjlj exception-handling code. Therefore, we do not
1038 create a single conditional block, but one for each
1039 initialization. (That way the cleanup regions always begin
1040 in the outer block.) We trust the back end to figure out
1041 that the FLAG will not change across initializations, and
1042 avoid doing multiple tests. */
1043 flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl));
1044 inner_if_stmt = begin_if_stmt ();
1045 finish_if_stmt_cond (flag, inner_if_stmt);
1047 /* Compute the location of the virtual base. If we're
1048 constructing virtual bases, then we must be the most derived
1049 class. Therefore, we don't have to look up the virtual base;
1050 we already know where it is. */
1051 exp = convert_to_base_statically (current_class_ref, vbase);
1053 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1054 LOOKUP_COMPLAIN, tf_warning_or_error);
1055 finish_then_clause (inner_if_stmt);
1056 finish_if_stmt (inner_if_stmt);
1058 expand_cleanup_for_base (vbase, flag);
1061 /* Find the context in which this FIELD can be initialized. */
1064 initializing_context (tree field)
1066 tree t = DECL_CONTEXT (field);
1068 /* Anonymous union members can be initialized in the first enclosing
1069 non-anonymous union context. */
1070 while (t && ANON_AGGR_TYPE_P (t))
1071 t = TYPE_CONTEXT (t);
1075 /* Function to give error message if member initialization specification
1076 is erroneous. FIELD is the member we decided to initialize.
1077 TYPE is the type for which the initialization is being performed.
1078 FIELD must be a member of TYPE.
1080 MEMBER_NAME is the name of the member. */
1083 member_init_ok_or_else (tree field, tree type, tree member_name)
1085 if (field == error_mark_node)
1089 error ("class %qT does not have any field named %qD", type,
1093 if (TREE_CODE (field) == VAR_DECL)
1095 error ("%q#D is a static data member; it can only be "
1096 "initialized at its definition",
1100 if (TREE_CODE (field) != FIELD_DECL)
1102 error ("%q#D is not a non-static data member of %qT",
1106 if (initializing_context (field) != type)
1108 error ("class %qT does not have any field named %qD", type,
1116 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1117 is a _TYPE node or TYPE_DECL which names a base for that type.
1118 Check the validity of NAME, and return either the base _TYPE, base
1119 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1120 NULL_TREE and issue a diagnostic.
1122 An old style unnamed direct single base construction is permitted,
1123 where NAME is NULL. */
1126 expand_member_init (tree name)
1131 if (!current_class_ref)
1136 /* This is an obsolete unnamed base class initializer. The
1137 parser will already have warned about its use. */
1138 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1141 error ("unnamed initializer for %qT, which has no base classes",
1142 current_class_type);
1145 basetype = BINFO_TYPE
1146 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1149 error ("unnamed initializer for %qT, which uses multiple inheritance",
1150 current_class_type);
1154 else if (TYPE_P (name))
1156 basetype = TYPE_MAIN_VARIANT (name);
1157 name = TYPE_NAME (name);
1159 else if (TREE_CODE (name) == TYPE_DECL)
1160 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1162 basetype = NULL_TREE;
1171 if (current_template_parms)
1174 class_binfo = TYPE_BINFO (current_class_type);
1175 direct_binfo = NULL_TREE;
1176 virtual_binfo = NULL_TREE;
1178 /* Look for a direct base. */
1179 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1180 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1183 /* Look for a virtual base -- unless the direct base is itself
1185 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1186 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1188 /* [class.base.init]
1190 If a mem-initializer-id is ambiguous because it designates
1191 both a direct non-virtual base class and an inherited virtual
1192 base class, the mem-initializer is ill-formed. */
1193 if (direct_binfo && virtual_binfo)
1195 error ("%qD is both a direct base and an indirect virtual base",
1200 if (!direct_binfo && !virtual_binfo)
1202 if (CLASSTYPE_VBASECLASSES (current_class_type))
1203 error ("type %qT is not a direct or virtual base of %qT",
1204 basetype, current_class_type);
1206 error ("type %qT is not a direct base of %qT",
1207 basetype, current_class_type);
1211 return direct_binfo ? direct_binfo : virtual_binfo;
1215 if (TREE_CODE (name) == IDENTIFIER_NODE)
1216 field = lookup_field (current_class_type, name, 1, false);
1220 if (member_init_ok_or_else (field, current_class_type, name))
1227 /* This is like `expand_member_init', only it stores one aggregate
1230 INIT comes in two flavors: it is either a value which
1231 is to be stored in EXP, or it is a parameter list
1232 to go to a constructor, which will operate on EXP.
1233 If INIT is not a parameter list for a constructor, then set
1234 LOOKUP_ONLYCONVERTING.
1235 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1236 the initializer, if FLAGS is 0, then it is the (init) form.
1237 If `init' is a CONSTRUCTOR, then we emit a warning message,
1238 explaining that such initializations are invalid.
1240 If INIT resolves to a CALL_EXPR which happens to return
1241 something of the type we are looking for, then we know
1242 that we can safely use that call to perform the
1245 The virtual function table pointer cannot be set up here, because
1246 we do not really know its type.
1248 This never calls operator=().
1250 When initializing, nothing is CONST.
1252 A default copy constructor may have to be used to perform the
1255 A constructor or a conversion operator may have to be used to
1256 perform the initialization, but not both, as it would be ambiguous. */
1259 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1264 tree type = TREE_TYPE (exp);
1265 int was_const = TREE_READONLY (exp);
1266 int was_volatile = TREE_THIS_VOLATILE (exp);
1269 if (init == error_mark_node)
1270 return error_mark_node;
1272 TREE_READONLY (exp) = 0;
1273 TREE_THIS_VOLATILE (exp) = 0;
1275 if (init && TREE_CODE (init) != TREE_LIST
1276 && !(BRACE_ENCLOSED_INITIALIZER_P (init)
1277 && CONSTRUCTOR_IS_DIRECT_INIT (init)))
1278 flags |= LOOKUP_ONLYCONVERTING;
1280 if (TREE_CODE (type) == ARRAY_TYPE)
1284 /* An array may not be initialized use the parenthesized
1285 initialization form -- unless the initializer is "()". */
1286 if (init && TREE_CODE (init) == TREE_LIST)
1288 if (complain & tf_error)
1289 error ("bad array initializer");
1290 return error_mark_node;
1292 /* Must arrange to initialize each element of EXP
1293 from elements of INIT. */
1294 itype = init ? TREE_TYPE (init) : NULL_TREE;
1295 if (cv_qualified_p (type))
1296 TREE_TYPE (exp) = cv_unqualified (type);
1297 if (itype && cv_qualified_p (itype))
1298 TREE_TYPE (init) = cv_unqualified (itype);
1299 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1300 /*explicit_value_init_p=*/false,
1301 itype && same_type_p (TREE_TYPE (init),
1304 TREE_READONLY (exp) = was_const;
1305 TREE_THIS_VOLATILE (exp) = was_volatile;
1306 TREE_TYPE (exp) = type;
1308 TREE_TYPE (init) = itype;
1312 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1313 /* Just know that we've seen something for this node. */
1314 TREE_USED (exp) = 1;
1316 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1317 destroy_temps = stmts_are_full_exprs_p ();
1318 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1319 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1320 init, LOOKUP_NORMAL|flags, complain);
1321 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1322 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1323 TREE_READONLY (exp) = was_const;
1324 TREE_THIS_VOLATILE (exp) = was_volatile;
1330 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1331 tsubst_flags_t complain)
1333 tree type = TREE_TYPE (exp);
1336 /* It fails because there may not be a constructor which takes
1337 its own type as the first (or only parameter), but which does
1338 take other types via a conversion. So, if the thing initializing
1339 the expression is a unit element of type X, first try X(X&),
1340 followed by initialization by X. If neither of these work
1341 out, then look hard. */
1343 VEC(tree,gc) *parms;
1345 if (init && BRACE_ENCLOSED_INITIALIZER_P (init)
1346 && CP_AGGREGATE_TYPE_P (type))
1348 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1349 happen for direct-initialization, too. */
1350 init = digest_init (type, init);
1351 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1352 TREE_SIDE_EFFECTS (init) = 1;
1353 finish_expr_stmt (init);
1357 if (init && TREE_CODE (init) != TREE_LIST
1358 && (flags & LOOKUP_ONLYCONVERTING))
1360 /* Base subobjects should only get direct-initialization. */
1361 gcc_assert (true_exp == exp);
1363 if (flags & DIRECT_BIND)
1364 /* Do nothing. We hit this in two cases: Reference initialization,
1365 where we aren't initializing a real variable, so we don't want
1366 to run a new constructor; and catching an exception, where we
1367 have already built up the constructor call so we could wrap it
1368 in an exception region. */;
1370 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1372 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1373 /* We need to protect the initialization of a catch parm with a
1374 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1375 around the TARGET_EXPR for the copy constructor. See
1376 initialize_handler_parm. */
1378 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1379 TREE_OPERAND (init, 0));
1380 TREE_TYPE (init) = void_type_node;
1383 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1384 TREE_SIDE_EFFECTS (init) = 1;
1385 finish_expr_stmt (init);
1389 if (init == NULL_TREE)
1391 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1393 parms = make_tree_vector ();
1394 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1395 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1398 parms = make_tree_vector_single (init);
1400 if (true_exp == exp)
1401 ctor_name = complete_ctor_identifier;
1403 ctor_name = base_ctor_identifier;
1405 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1409 release_tree_vector (parms);
1411 if (TREE_SIDE_EFFECTS (rval))
1412 finish_expr_stmt (convert_to_void (rval, ICV_CAST, complain));
1415 /* This function is responsible for initializing EXP with INIT
1418 BINFO is the binfo of the type for who we are performing the
1419 initialization. For example, if W is a virtual base class of A and B,
1421 If we are initializing B, then W must contain B's W vtable, whereas
1422 were we initializing C, W must contain C's W vtable.
1424 TRUE_EXP is nonzero if it is the true expression being initialized.
1425 In this case, it may be EXP, or may just contain EXP. The reason we
1426 need this is because if EXP is a base element of TRUE_EXP, we
1427 don't necessarily know by looking at EXP where its virtual
1428 baseclass fields should really be pointing. But we do know
1429 from TRUE_EXP. In constructors, we don't know anything about
1430 the value being initialized.
1432 FLAGS is just passed to `build_new_method_call'. See that function
1433 for its description. */
1436 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1437 tsubst_flags_t complain)
1439 tree type = TREE_TYPE (exp);
1441 gcc_assert (init != error_mark_node && type != error_mark_node);
1442 gcc_assert (building_stmt_tree ());
1444 /* Use a function returning the desired type to initialize EXP for us.
1445 If the function is a constructor, and its first argument is
1446 NULL_TREE, know that it was meant for us--just slide exp on
1447 in and expand the constructor. Constructors now come
1450 if (init && TREE_CODE (exp) == VAR_DECL
1451 && COMPOUND_LITERAL_P (init))
1453 /* If store_init_value returns NULL_TREE, the INIT has been
1454 recorded as the DECL_INITIAL for EXP. That means there's
1455 nothing more we have to do. */
1456 init = store_init_value (exp, init, flags);
1458 finish_expr_stmt (init);
1462 /* If an explicit -- but empty -- initializer list was present,
1463 that's value-initialization. */
1464 if (init == void_type_node)
1466 /* If there's a user-provided constructor, we just call that. */
1467 if (type_has_user_provided_constructor (type))
1468 /* Fall through. */;
1469 /* If there isn't, but we still need to call the constructor,
1470 zero out the object first. */
1471 else if (TYPE_NEEDS_CONSTRUCTING (type))
1473 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1474 init = build2 (INIT_EXPR, type, exp, init);
1475 finish_expr_stmt (init);
1476 /* And then call the constructor. */
1478 /* If we don't need to mess with the constructor at all,
1479 then just zero out the object and we're done. */
1482 init = build2 (INIT_EXPR, type, exp,
1483 build_value_init_noctor (type, complain));
1484 finish_expr_stmt (init);
1490 /* We know that expand_default_init can handle everything we want
1492 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1495 /* Report an error if TYPE is not a user-defined, class type. If
1496 OR_ELSE is nonzero, give an error message. */
1499 is_class_type (tree type, int or_else)
1501 if (type == error_mark_node)
1504 if (! CLASS_TYPE_P (type))
1507 error ("%qT is not a class type", type);
1514 get_type_value (tree name)
1516 if (name == error_mark_node)
1519 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1520 return IDENTIFIER_TYPE_VALUE (name);
1525 /* Build a reference to a member of an aggregate. This is not a C++
1526 `&', but really something which can have its address taken, and
1527 then act as a pointer to member, for example TYPE :: FIELD can have
1528 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1529 this expression is the operand of "&".
1531 @@ Prints out lousy diagnostics for operator <typename>
1534 @@ This function should be rewritten and placed in search.c. */
1537 build_offset_ref (tree type, tree member, bool address_p)
1540 tree basebinfo = NULL_TREE;
1542 /* class templates can come in as TEMPLATE_DECLs here. */
1543 if (TREE_CODE (member) == TEMPLATE_DECL)
1546 if (dependent_scope_p (type) || type_dependent_expression_p (member))
1547 return build_qualified_name (NULL_TREE, type, member,
1548 /*template_p=*/false);
1550 gcc_assert (TYPE_P (type));
1551 if (! is_class_type (type, 1))
1552 return error_mark_node;
1554 gcc_assert (DECL_P (member) || BASELINK_P (member));
1555 /* Callers should call mark_used before this point. */
1556 gcc_assert (!DECL_P (member) || TREE_USED (member));
1558 type = TYPE_MAIN_VARIANT (type);
1559 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type)))
1561 error ("incomplete type %qT does not have member %qD", type, member);
1562 return error_mark_node;
1565 /* Entities other than non-static members need no further
1567 if (TREE_CODE (member) == TYPE_DECL)
1569 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1570 return convert_from_reference (member);
1572 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1574 error ("invalid pointer to bit-field %qD", member);
1575 return error_mark_node;
1578 /* Set up BASEBINFO for member lookup. */
1579 decl = maybe_dummy_object (type, &basebinfo);
1581 /* A lot of this logic is now handled in lookup_member. */
1582 if (BASELINK_P (member))
1584 /* Go from the TREE_BASELINK to the member function info. */
1585 tree t = BASELINK_FUNCTIONS (member);
1587 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1589 /* Get rid of a potential OVERLOAD around it. */
1590 t = OVL_CURRENT (t);
1592 /* Unique functions are handled easily. */
1594 /* For non-static member of base class, we need a special rule
1595 for access checking [class.protected]:
1597 If the access is to form a pointer to member, the
1598 nested-name-specifier shall name the derived class
1599 (or any class derived from that class). */
1600 if (address_p && DECL_P (t)
1601 && DECL_NONSTATIC_MEMBER_P (t))
1602 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1604 perform_or_defer_access_check (basebinfo, t, t);
1606 if (DECL_STATIC_FUNCTION_P (t))
1611 TREE_TYPE (member) = unknown_type_node;
1613 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1614 /* We need additional test besides the one in
1615 check_accessibility_of_qualified_id in case it is
1616 a pointer to non-static member. */
1617 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1621 /* If MEMBER is non-static, then the program has fallen afoul of
1624 An id-expression that denotes a nonstatic data member or
1625 nonstatic member function of a class can only be used:
1627 -- as part of a class member access (_expr.ref_) in which the
1628 object-expression refers to the member's class or a class
1629 derived from that class, or
1631 -- to form a pointer to member (_expr.unary.op_), or
1633 -- in the body of a nonstatic member function of that class or
1634 of a class derived from that class (_class.mfct.nonstatic_), or
1636 -- in a mem-initializer for a constructor for that class or for
1637 a class derived from that class (_class.base.init_). */
1638 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1640 /* Build a representation of the qualified name suitable
1641 for use as the operand to "&" -- even though the "&" is
1642 not actually present. */
1643 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1644 /* In Microsoft mode, treat a non-static member function as if
1645 it were a pointer-to-member. */
1646 if (flag_ms_extensions)
1648 PTRMEM_OK_P (member) = 1;
1649 return cp_build_unary_op (ADDR_EXPR, member, 0,
1650 tf_warning_or_error);
1652 error ("invalid use of non-static member function %qD",
1653 TREE_OPERAND (member, 1));
1654 return error_mark_node;
1656 else if (TREE_CODE (member) == FIELD_DECL)
1658 error ("invalid use of non-static data member %qD", member);
1659 return error_mark_node;
1664 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1665 PTRMEM_OK_P (member) = 1;
1669 /* If DECL is a scalar enumeration constant or variable with a
1670 constant initializer, return the initializer (or, its initializers,
1671 recursively); otherwise, return DECL. If INTEGRAL_P, the
1672 initializer is only returned if DECL is an integral
1673 constant-expression. */
1676 constant_value_1 (tree decl, bool integral_p)
1678 while (TREE_CODE (decl) == CONST_DECL
1680 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1681 : (TREE_CODE (decl) == VAR_DECL
1682 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1685 /* Static data members in template classes may have
1686 non-dependent initializers. References to such non-static
1687 data members are not value-dependent, so we must retrieve the
1688 initializer here. The DECL_INITIAL will have the right type,
1689 but will not have been folded because that would prevent us
1690 from performing all appropriate semantic checks at
1691 instantiation time. */
1692 if (DECL_CLASS_SCOPE_P (decl)
1693 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1694 && uses_template_parms (CLASSTYPE_TI_ARGS
1695 (DECL_CONTEXT (decl))))
1697 ++processing_template_decl;
1698 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1699 --processing_template_decl;
1703 /* If DECL is a static data member in a template
1704 specialization, we must instantiate it here. The
1705 initializer for the static data member is not processed
1706 until needed; we need it now. */
1708 init = DECL_INITIAL (decl);
1710 if (init == error_mark_node)
1712 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
1713 /* Treat the error as a constant to avoid cascading errors on
1714 excessively recursive template instantiation (c++/9335). */
1719 /* Initializers in templates are generally expanded during
1720 instantiation, so before that for const int i(2)
1721 INIT is a TREE_LIST with the actual initializer as
1723 if (processing_template_decl
1725 && TREE_CODE (init) == TREE_LIST
1726 && TREE_CHAIN (init) == NULL_TREE)
1727 init = TREE_VALUE (init);
1729 || !TREE_TYPE (init)
1731 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1732 : (!TREE_CONSTANT (init)
1733 /* Do not return an aggregate constant (of which
1734 string literals are a special case), as we do not
1735 want to make inadvertent copies of such entities,
1736 and we must be sure that their addresses are the
1738 || TREE_CODE (init) == CONSTRUCTOR
1739 || TREE_CODE (init) == STRING_CST)))
1741 decl = unshare_expr (init);
1746 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1747 constant of integral or enumeration type, then return that value.
1748 These are those variables permitted in constant expressions by
1752 integral_constant_value (tree decl)
1754 return constant_value_1 (decl, /*integral_p=*/true);
1757 /* A more relaxed version of integral_constant_value, used by the
1758 common C/C++ code and by the C++ front end for optimization
1762 decl_constant_value (tree decl)
1764 return constant_value_1 (decl,
1765 /*integral_p=*/processing_template_decl);
1768 /* Common subroutines of build_new and build_vec_delete. */
1770 /* Call the global __builtin_delete to delete ADDR. */
1773 build_builtin_delete_call (tree addr)
1775 mark_used (global_delete_fndecl);
1776 return build_call_n (global_delete_fndecl, 1, addr);
1779 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1780 the type of the object being allocated; otherwise, it's just TYPE.
1781 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1782 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1783 a vector of arguments to be provided as arguments to a placement
1784 new operator. This routine performs no semantic checks; it just
1785 creates and returns a NEW_EXPR. */
1788 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1789 VEC(tree,gc) *init, int use_global_new)
1794 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1795 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1796 permits us to distinguish the case of a missing initializer "new
1797 int" from an empty initializer "new int()". */
1799 init_list = NULL_TREE;
1800 else if (VEC_empty (tree, init))
1801 init_list = void_zero_node;
1803 init_list = build_tree_list_vec (init);
1805 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1806 build_tree_list_vec (placement), type, nelts,
1808 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1809 TREE_SIDE_EFFECTS (new_expr) = 1;
1814 /* Diagnose uninitialized const members or reference members of type
1815 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1816 new expression without a new-initializer and a declaration. Returns
1820 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin,
1821 bool using_new, bool complain)
1824 int error_count = 0;
1826 if (type_has_user_provided_constructor (type))
1829 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
1833 if (TREE_CODE (field) != FIELD_DECL)
1836 field_type = strip_array_types (TREE_TYPE (field));
1838 if (TREE_CODE (field_type) == REFERENCE_TYPE)
1844 error ("uninitialized reference member in %q#T "
1845 "using %<new%> without new-initializer", origin);
1847 error ("uninitialized reference member in %q#T", origin);
1848 inform (DECL_SOURCE_LOCATION (field),
1849 "%qD should be initialized", field);
1853 if (CP_TYPE_CONST_P (field_type))
1859 error ("uninitialized const member in %q#T "
1860 "using %<new%> without new-initializer", origin);
1862 error ("uninitialized const member in %q#T", origin);
1863 inform (DECL_SOURCE_LOCATION (field),
1864 "%qD should be initialized", field);
1868 if (CLASS_TYPE_P (field_type))
1870 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin,
1871 using_new, complain);
1877 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain)
1879 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain);
1882 /* Generate code for a new-expression, including calling the "operator
1883 new" function, initializing the object, and, if an exception occurs
1884 during construction, cleaning up. The arguments are as for
1885 build_raw_new_expr. This may change PLACEMENT and INIT. */
1888 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1889 VEC(tree,gc) **init, bool globally_qualified_p,
1890 tsubst_flags_t complain)
1893 /* True iff this is a call to "operator new[]" instead of just
1895 bool array_p = false;
1896 /* If ARRAY_P is true, the element type of the array. This is never
1897 an ARRAY_TYPE; for something like "new int[3][4]", the
1898 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1901 /* The type of the new-expression. (This type is always a pointer
1904 tree non_const_pointer_type;
1905 tree outer_nelts = NULL_TREE;
1906 tree alloc_call, alloc_expr;
1907 /* The address returned by the call to "operator new". This node is
1908 a VAR_DECL and is therefore reusable. */
1911 tree cookie_expr, init_expr;
1912 int nothrow, check_new;
1913 int use_java_new = 0;
1914 /* If non-NULL, the number of extra bytes to allocate at the
1915 beginning of the storage allocated for an array-new expression in
1916 order to store the number of elements. */
1917 tree cookie_size = NULL_TREE;
1918 tree placement_first;
1919 tree placement_expr = NULL_TREE;
1920 /* True if the function we are calling is a placement allocation
1922 bool placement_allocation_fn_p;
1923 /* True if the storage must be initialized, either by a constructor
1924 or due to an explicit new-initializer. */
1925 bool is_initialized;
1926 /* The address of the thing allocated, not including any cookie. In
1927 particular, if an array cookie is in use, DATA_ADDR is the
1928 address of the first array element. This node is a VAR_DECL, and
1929 is therefore reusable. */
1931 tree init_preeval_expr = NULL_TREE;
1935 outer_nelts = nelts;
1938 else if (TREE_CODE (type) == ARRAY_TYPE)
1941 nelts = array_type_nelts_top (type);
1942 outer_nelts = nelts;
1943 type = TREE_TYPE (type);
1946 /* If our base type is an array, then make sure we know how many elements
1948 for (elt_type = type;
1949 TREE_CODE (elt_type) == ARRAY_TYPE;
1950 elt_type = TREE_TYPE (elt_type))
1951 nelts = cp_build_binary_op (input_location,
1953 array_type_nelts_top (elt_type),
1956 if (TREE_CODE (elt_type) == VOID_TYPE)
1958 if (complain & tf_error)
1959 error ("invalid type %<void%> for new");
1960 return error_mark_node;
1963 if (abstract_virtuals_error (NULL_TREE, elt_type))
1964 return error_mark_node;
1966 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
1970 bool maybe_uninitialized_error = false;
1971 /* A program that calls for default-initialization [...] of an
1972 entity of reference type is ill-formed. */
1973 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type))
1974 maybe_uninitialized_error = true;
1976 /* A new-expression that creates an object of type T initializes
1977 that object as follows:
1978 - If the new-initializer is omitted:
1979 -- If T is a (possibly cv-qualified) non-POD class type
1980 (or array thereof), the object is default-initialized (8.5).
1982 -- Otherwise, the object created has indeterminate
1983 value. If T is a const-qualified type, or a (possibly
1984 cv-qualified) POD class type (or array thereof)
1985 containing (directly or indirectly) a member of
1986 const-qualified type, the program is ill-formed; */
1988 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type))
1989 maybe_uninitialized_error = true;
1991 if (maybe_uninitialized_error
1992 && diagnose_uninitialized_cst_or_ref_member (elt_type,
1994 complain & tf_error))
1995 return error_mark_node;
1998 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
1999 && !type_has_user_provided_default_constructor (elt_type))
2001 if (complain & tf_error)
2002 error ("uninitialized const in %<new%> of %q#T", elt_type);
2003 return error_mark_node;
2006 size = size_in_bytes (elt_type);
2008 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2010 alloc_fn = NULL_TREE;
2012 /* If PLACEMENT is a single simple pointer type not passed by
2013 reference, prepare to capture it in a temporary variable. Do
2014 this now, since PLACEMENT will change in the calls below. */
2015 placement_first = NULL_TREE;
2016 if (VEC_length (tree, *placement) == 1
2017 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
2019 placement_first = VEC_index (tree, *placement, 0);
2021 /* Allocate the object. */
2022 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
2025 tree class_decl = build_java_class_ref (elt_type);
2026 static const char alloc_name[] = "_Jv_AllocObject";
2028 if (class_decl == error_mark_node)
2029 return error_mark_node;
2032 if (!get_global_value_if_present (get_identifier (alloc_name),
2035 if (complain & tf_error)
2036 error ("call to Java constructor with %qs undefined", alloc_name);
2037 return error_mark_node;
2039 else if (really_overloaded_fn (alloc_fn))
2041 if (complain & tf_error)
2042 error ("%qD should never be overloaded", alloc_fn);
2043 return error_mark_node;
2045 alloc_fn = OVL_CURRENT (alloc_fn);
2046 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2047 alloc_call = cp_build_function_call_nary (alloc_fn, complain,
2048 class_addr, NULL_TREE);
2050 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
2052 error ("Java class %q#T object allocated using placement new", elt_type);
2053 return error_mark_node;
2060 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
2062 if (!globally_qualified_p
2063 && CLASS_TYPE_P (elt_type)
2065 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
2066 : TYPE_HAS_NEW_OPERATOR (elt_type)))
2068 /* Use a class-specific operator new. */
2069 /* If a cookie is required, add some extra space. */
2070 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2072 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2073 size = size_binop (PLUS_EXPR, size, cookie_size);
2075 /* Create the argument list. */
2076 VEC_safe_insert (tree, gc, *placement, 0, size);
2077 /* Do name-lookup to find the appropriate operator. */
2078 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
2079 if (fns == NULL_TREE)
2081 if (complain & tf_error)
2082 error ("no suitable %qD found in class %qT", fnname, elt_type);
2083 return error_mark_node;
2085 if (TREE_CODE (fns) == TREE_LIST)
2087 if (complain & tf_error)
2089 error ("request for member %qD is ambiguous", fnname);
2090 print_candidates (fns);
2092 return error_mark_node;
2094 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2096 /*conversion_path=*/NULL_TREE,
2103 /* Use a global operator new. */
2104 /* See if a cookie might be required. */
2105 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2106 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2108 cookie_size = NULL_TREE;
2110 alloc_call = build_operator_new_call (fnname, placement,
2111 &size, &cookie_size,
2116 if (alloc_call == error_mark_node)
2117 return error_mark_node;
2119 gcc_assert (alloc_fn != NULL_TREE);
2121 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2122 into a temporary variable. */
2123 if (!processing_template_decl
2124 && placement_first != NULL_TREE
2125 && TREE_CODE (alloc_call) == CALL_EXPR
2126 && call_expr_nargs (alloc_call) == 2
2127 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2128 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2130 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2132 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2133 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2135 placement_expr = get_target_expr (placement_first);
2136 CALL_EXPR_ARG (alloc_call, 1)
2137 = convert (TREE_TYPE (placement_arg), placement_expr);
2141 /* In the simple case, we can stop now. */
2142 pointer_type = build_pointer_type (type);
2143 if (!cookie_size && !is_initialized)
2144 return build_nop (pointer_type, alloc_call);
2146 /* Store the result of the allocation call in a variable so that we can
2147 use it more than once. */
2148 alloc_expr = get_target_expr (alloc_call);
2149 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2151 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2152 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2153 alloc_call = TREE_OPERAND (alloc_call, 1);
2155 /* Now, check to see if this function is actually a placement
2156 allocation function. This can happen even when PLACEMENT is NULL
2157 because we might have something like:
2159 struct S { void* operator new (size_t, int i = 0); };
2161 A call to `new S' will get this allocation function, even though
2162 there is no explicit placement argument. If there is more than
2163 one argument, or there are variable arguments, then this is a
2164 placement allocation function. */
2165 placement_allocation_fn_p
2166 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2167 || varargs_function_p (alloc_fn));
2169 /* Preevaluate the placement args so that we don't reevaluate them for a
2170 placement delete. */
2171 if (placement_allocation_fn_p)
2174 stabilize_call (alloc_call, &inits);
2176 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2180 /* unless an allocation function is declared with an empty excep-
2181 tion-specification (_except.spec_), throw(), it indicates failure to
2182 allocate storage by throwing a bad_alloc exception (clause _except_,
2183 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2184 cation function is declared with an empty exception-specification,
2185 throw(), it returns null to indicate failure to allocate storage and a
2186 non-null pointer otherwise.
2188 So check for a null exception spec on the op new we just called. */
2190 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2191 check_new = (flag_check_new || nothrow) && ! use_java_new;
2199 /* Adjust so we're pointing to the start of the object. */
2200 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2201 alloc_node, cookie_size);
2203 /* Store the number of bytes allocated so that we can know how
2204 many elements to destroy later. We use the last sizeof
2205 (size_t) bytes to store the number of elements. */
2206 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2207 cookie_ptr = fold_build2_loc (input_location,
2208 POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2209 alloc_node, cookie_ptr);
2210 size_ptr_type = build_pointer_type (sizetype);
2211 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2212 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2214 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2216 if (targetm.cxx.cookie_has_size ())
2218 /* Also store the element size. */
2219 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2220 fold_build1_loc (input_location,
2221 NEGATE_EXPR, sizetype,
2222 size_in_bytes (sizetype)));
2224 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2225 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2226 size_in_bytes (elt_type));
2227 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2228 cookie, cookie_expr);
2233 cookie_expr = NULL_TREE;
2234 data_addr = alloc_node;
2237 /* Now use a pointer to the type we've actually allocated. */
2239 /* But we want to operate on a non-const version to start with,
2240 since we'll be modifying the elements. */
2241 non_const_pointer_type = build_pointer_type
2242 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST));
2244 data_addr = fold_convert (non_const_pointer_type, data_addr);
2245 /* Any further uses of alloc_node will want this type, too. */
2246 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2248 /* Now initialize the allocated object. Note that we preevaluate the
2249 initialization expression, apart from the actual constructor call or
2250 assignment--we do this because we want to delay the allocation as long
2251 as possible in order to minimize the size of the exception region for
2252 placement delete. */
2256 bool explicit_value_init_p = false;
2258 if (*init != NULL && VEC_empty (tree, *init))
2261 explicit_value_init_p = true;
2266 tree vecinit = NULL_TREE;
2267 if (*init && VEC_length (tree, *init) == 1
2268 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2269 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2271 tree arraytype, domain;
2272 vecinit = VEC_index (tree, *init, 0);
2273 if (TREE_CONSTANT (nelts))
2274 domain = compute_array_index_type (NULL_TREE, nelts);
2278 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2279 warning (0, "non-constant array size in new, unable to "
2280 "verify length of initializer-list");
2282 arraytype = build_cplus_array_type (type, domain);
2283 vecinit = digest_init (arraytype, vecinit);
2287 if (complain & tf_error)
2288 permerror (input_location, "ISO C++ forbids initialization in array new");
2290 return error_mark_node;
2291 vecinit = build_tree_list_vec (*init);
2294 = build_vec_init (data_addr,
2295 cp_build_binary_op (input_location,
2296 MINUS_EXPR, outer_nelts,
2300 explicit_value_init_p,
2304 /* An array initialization is stable because the initialization
2305 of each element is a full-expression, so the temporaries don't
2311 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2313 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2315 init_expr = build_special_member_call (init_expr,
2316 complete_ctor_identifier,
2321 else if (explicit_value_init_p)
2323 /* Something like `new int()'. */
2324 tree val = build_value_init (type, complain);
2325 if (val == error_mark_node)
2326 return error_mark_node;
2327 init_expr = build2 (INIT_EXPR, type, init_expr, val);
2333 /* We are processing something like `new int (10)', which
2334 means allocate an int, and initialize it with 10. */
2336 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2337 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2340 stable = stabilize_init (init_expr, &init_preeval_expr);
2343 if (init_expr == error_mark_node)
2344 return error_mark_node;
2346 /* If any part of the object initialization terminates by throwing an
2347 exception and a suitable deallocation function can be found, the
2348 deallocation function is called to free the memory in which the
2349 object was being constructed, after which the exception continues
2350 to propagate in the context of the new-expression. If no
2351 unambiguous matching deallocation function can be found,
2352 propagating the exception does not cause the object's memory to be
2354 if (flag_exceptions && ! use_java_new)
2356 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2359 /* The Standard is unclear here, but the right thing to do
2360 is to use the same method for finding deallocation
2361 functions that we use for finding allocation functions. */
2362 cleanup = (build_op_delete_call
2366 globally_qualified_p,
2367 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2373 /* This is much simpler if we were able to preevaluate all of
2374 the arguments to the constructor call. */
2376 /* CLEANUP is compiler-generated, so no diagnostics. */
2377 TREE_NO_WARNING (cleanup) = true;
2378 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2379 init_expr, cleanup);
2380 /* Likewise, this try-catch is compiler-generated. */
2381 TREE_NO_WARNING (init_expr) = true;
2384 /* Ack! First we allocate the memory. Then we set our sentry
2385 variable to true, and expand a cleanup that deletes the
2386 memory if sentry is true. Then we run the constructor, and
2387 finally clear the sentry.
2389 We need to do this because we allocate the space first, so
2390 if there are any temporaries with cleanups in the
2391 constructor args and we weren't able to preevaluate them, we
2392 need this EH region to extend until end of full-expression
2393 to preserve nesting. */
2395 tree end, sentry, begin;
2397 begin = get_target_expr (boolean_true_node);
2398 CLEANUP_EH_ONLY (begin) = 1;
2400 sentry = TARGET_EXPR_SLOT (begin);
2402 /* CLEANUP is compiler-generated, so no diagnostics. */
2403 TREE_NO_WARNING (cleanup) = true;
2405 TARGET_EXPR_CLEANUP (begin)
2406 = build3 (COND_EXPR, void_type_node, sentry,
2407 cleanup, void_zero_node);
2409 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2410 sentry, boolean_false_node);
2413 = build2 (COMPOUND_EXPR, void_type_node, begin,
2414 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2416 /* Likewise, this is compiler-generated. */
2417 TREE_NO_WARNING (init_expr) = true;
2422 init_expr = NULL_TREE;
2424 /* Now build up the return value in reverse order. */
2429 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2431 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2433 if (rval == data_addr)
2434 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2435 and return the call (which doesn't need to be adjusted). */
2436 rval = TARGET_EXPR_INITIAL (alloc_expr);
2441 tree ifexp = cp_build_binary_op (input_location,
2442 NE_EXPR, alloc_node,
2445 rval = build_conditional_expr (ifexp, rval, alloc_node,
2449 /* Perform the allocation before anything else, so that ALLOC_NODE
2450 has been initialized before we start using it. */
2451 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2454 if (init_preeval_expr)
2455 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2457 /* A new-expression is never an lvalue. */
2458 gcc_assert (!lvalue_p (rval));
2460 return convert (pointer_type, rval);
2463 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2464 is a vector of placement-new arguments (or NULL if none). If NELTS
2465 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2466 is not NULL, then this is an array-new allocation; TYPE is the type
2467 of the elements in the array and NELTS is the number of elements in
2468 the array. *INIT, if non-NULL, is the initializer for the new
2469 object, or an empty vector to indicate an initializer of "()". If
2470 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2471 rather than just "new". This may change PLACEMENT and INIT. */
2474 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2475 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2478 VEC(tree,gc) *orig_placement = NULL;
2479 tree orig_nelts = NULL_TREE;
2480 VEC(tree,gc) *orig_init = NULL;
2482 if (type == error_mark_node)
2483 return error_mark_node;
2485 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2487 tree auto_node = type_uses_auto (type);
2488 if (auto_node && describable_type (VEC_index (tree, *init, 0)))
2489 type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node);
2492 if (processing_template_decl)
2494 if (dependent_type_p (type)
2495 || any_type_dependent_arguments_p (*placement)
2496 || (nelts && type_dependent_expression_p (nelts))
2497 || any_type_dependent_arguments_p (*init))
2498 return build_raw_new_expr (*placement, type, nelts, *init,
2501 orig_placement = make_tree_vector_copy (*placement);
2503 orig_init = make_tree_vector_copy (*init);
2505 make_args_non_dependent (*placement);
2507 nelts = build_non_dependent_expr (nelts);
2508 make_args_non_dependent (*init);
2513 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2515 if (complain & tf_error)
2516 permerror (input_location, "size in array new must have integral type");
2518 return error_mark_node;
2520 nelts = mark_rvalue_use (nelts);
2521 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2524 /* ``A reference cannot be created by the new operator. A reference
2525 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2526 returned by new.'' ARM 5.3.3 */
2527 if (TREE_CODE (type) == REFERENCE_TYPE)
2529 if (complain & tf_error)
2530 error ("new cannot be applied to a reference type");
2532 return error_mark_node;
2533 type = TREE_TYPE (type);
2536 if (TREE_CODE (type) == FUNCTION_TYPE)
2538 if (complain & tf_error)
2539 error ("new cannot be applied to a function type");
2540 return error_mark_node;
2543 /* The type allocated must be complete. If the new-type-id was
2544 "T[N]" then we are just checking that "T" is complete here, but
2545 that is equivalent, since the value of "N" doesn't matter. */
2546 if (!complete_type_or_maybe_complain (type, NULL_TREE, complain))
2547 return error_mark_node;
2549 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2550 if (rval == error_mark_node)
2551 return error_mark_node;
2553 if (processing_template_decl)
2555 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2556 orig_init, use_global_new);
2557 release_tree_vector (orig_placement);
2558 release_tree_vector (orig_init);
2562 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2563 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2564 TREE_NO_WARNING (rval) = 1;
2569 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2572 build_java_class_ref (tree type)
2574 tree name = NULL_TREE, class_decl;
2575 static tree CL_suffix = NULL_TREE;
2576 if (CL_suffix == NULL_TREE)
2577 CL_suffix = get_identifier("class$");
2578 if (jclass_node == NULL_TREE)
2580 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2581 if (jclass_node == NULL_TREE)
2583 error ("call to Java constructor, while %<jclass%> undefined");
2584 return error_mark_node;
2586 jclass_node = TREE_TYPE (jclass_node);
2589 /* Mangle the class$ field. */
2592 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2593 if (DECL_NAME (field) == CL_suffix)
2595 mangle_decl (field);
2596 name = DECL_ASSEMBLER_NAME (field);
2601 error ("can't find %<class$%> in %qT", type);
2602 return error_mark_node;
2606 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2607 if (class_decl == NULL_TREE)
2609 class_decl = build_decl (input_location,
2610 VAR_DECL, name, TREE_TYPE (jclass_node));
2611 TREE_STATIC (class_decl) = 1;
2612 DECL_EXTERNAL (class_decl) = 1;
2613 TREE_PUBLIC (class_decl) = 1;
2614 DECL_ARTIFICIAL (class_decl) = 1;
2615 DECL_IGNORED_P (class_decl) = 1;
2616 pushdecl_top_level (class_decl);
2617 make_decl_rtl (class_decl);
2623 build_vec_delete_1 (tree base, tree maxindex, tree type,
2624 special_function_kind auto_delete_vec, int use_global_delete)
2627 tree ptype = build_pointer_type (type = complete_type (type));
2628 tree size_exp = size_in_bytes (type);
2630 /* Temporary variables used by the loop. */
2631 tree tbase, tbase_init;
2633 /* This is the body of the loop that implements the deletion of a
2634 single element, and moves temp variables to next elements. */
2637 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2640 /* This is the thing that governs what to do after the loop has run. */
2641 tree deallocate_expr = 0;
2643 /* This is the BIND_EXPR which holds the outermost iterator of the
2644 loop. It is convenient to set this variable up and test it before
2645 executing any other code in the loop.
2646 This is also the containing expression returned by this function. */
2647 tree controller = NULL_TREE;
2650 /* We should only have 1-D arrays here. */
2651 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2653 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2656 /* The below is short by the cookie size. */
2657 virtual_size = size_binop (MULT_EXPR, size_exp,
2658 convert (sizetype, maxindex));
2660 tbase = create_temporary_var (ptype);
2661 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2662 fold_build2_loc (input_location,
2663 POINTER_PLUS_EXPR, ptype,
2664 fold_convert (ptype, base),
2666 tf_warning_or_error);
2667 controller = build3 (BIND_EXPR, void_type_node, tbase,
2668 NULL_TREE, NULL_TREE);
2669 TREE_SIDE_EFFECTS (controller) = 1;
2671 body = build1 (EXIT_EXPR, void_type_node,
2672 build2 (EQ_EXPR, boolean_type_node, tbase,
2673 fold_convert (ptype, base)));
2674 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp);
2675 body = build_compound_expr
2677 body, cp_build_modify_expr (tbase, NOP_EXPR,
2678 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2679 tf_warning_or_error));
2680 body = build_compound_expr
2682 body, build_delete (ptype, tbase, sfk_complete_destructor,
2683 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2685 loop = build1 (LOOP_EXPR, void_type_node, body);
2686 loop = build_compound_expr (input_location, tbase_init, loop);
2689 /* If the delete flag is one, or anything else with the low bit set,
2690 delete the storage. */
2691 if (auto_delete_vec != sfk_base_destructor)
2695 /* The below is short by the cookie size. */
2696 virtual_size = size_binop (MULT_EXPR, size_exp,
2697 convert (sizetype, maxindex));
2699 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2706 cookie_size = targetm.cxx.get_cookie_size (type);
2708 = cp_convert (ptype,
2709 cp_build_binary_op (input_location,
2711 cp_convert (string_type_node,
2714 tf_warning_or_error));
2715 /* True size with header. */
2716 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2719 if (auto_delete_vec == sfk_deleting_destructor)
2720 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2721 base_tbd, virtual_size,
2722 use_global_delete & 1,
2723 /*placement=*/NULL_TREE,
2724 /*alloc_fn=*/NULL_TREE);
2728 if (!deallocate_expr)
2731 body = deallocate_expr;
2733 body = build_compound_expr (input_location, body, deallocate_expr);
2736 body = integer_zero_node;
2738 /* Outermost wrapper: If pointer is null, punt. */
2739 body = fold_build3_loc (input_location, COND_EXPR, void_type_node,
2740 fold_build2_loc (input_location,
2741 NE_EXPR, boolean_type_node, base,
2742 convert (TREE_TYPE (base),
2743 integer_zero_node)),
2744 body, integer_zero_node);
2745 body = build1 (NOP_EXPR, void_type_node, body);
2749 TREE_OPERAND (controller, 1) = body;
2753 if (TREE_CODE (base) == SAVE_EXPR)
2754 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2755 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2757 return convert_to_void (body, ICV_CAST, tf_warning_or_error);
2760 /* Create an unnamed variable of the indicated TYPE. */
2763 create_temporary_var (tree type)
2767 decl = build_decl (input_location,
2768 VAR_DECL, NULL_TREE, type);
2769 TREE_USED (decl) = 1;
2770 DECL_ARTIFICIAL (decl) = 1;
2771 DECL_IGNORED_P (decl) = 1;
2772 DECL_CONTEXT (decl) = current_function_decl;
2777 /* Create a new temporary variable of the indicated TYPE, initialized
2780 It is not entered into current_binding_level, because that breaks
2781 things when it comes time to do final cleanups (which take place
2782 "outside" the binding contour of the function). */
2785 get_temp_regvar (tree type, tree init)
2789 decl = create_temporary_var (type);
2790 add_decl_expr (decl);
2792 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2793 tf_warning_or_error));
2798 /* `build_vec_init' returns tree structure that performs
2799 initialization of a vector of aggregate types.
2801 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2802 to the first element, of POINTER_TYPE.
2803 MAXINDEX is the maximum index of the array (one less than the
2804 number of elements). It is only used if BASE is a pointer or
2805 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2807 INIT is the (possibly NULL) initializer.
2809 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2810 elements in the array are value-initialized.
2812 FROM_ARRAY is 0 if we should init everything with INIT
2813 (i.e., every element initialized from INIT).
2814 FROM_ARRAY is 1 if we should index into INIT in parallel
2815 with initialization of DECL.
2816 FROM_ARRAY is 2 if we should index into INIT in parallel,
2817 but use assignment instead of initialization. */
2820 build_vec_init (tree base, tree maxindex, tree init,
2821 bool explicit_value_init_p,
2822 int from_array, tsubst_flags_t complain)
2825 tree base2 = NULL_TREE;
2826 tree itype = NULL_TREE;
2828 /* The type of BASE. */
2829 tree atype = TREE_TYPE (base);
2830 /* The type of an element in the array. */
2831 tree type = TREE_TYPE (atype);
2832 /* The element type reached after removing all outer array
2834 tree inner_elt_type;
2835 /* The type of a pointer to an element in the array. */
2840 tree try_block = NULL_TREE;
2841 int num_initialized_elts = 0;
2844 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2845 maxindex = array_type_nelts (atype);
2847 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2848 return error_mark_node;
2850 if (explicit_value_init_p)
2853 inner_elt_type = strip_array_types (type);
2855 /* Look through the TARGET_EXPR around a compound literal. */
2856 if (init && TREE_CODE (init) == TARGET_EXPR
2857 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR
2859 init = TARGET_EXPR_INITIAL (init);
2862 && TREE_CODE (atype) == ARRAY_TYPE
2864 ? (!CLASS_TYPE_P (inner_elt_type)
2865 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type))
2866 : !TYPE_NEEDS_CONSTRUCTING (type))
2867 && ((TREE_CODE (init) == CONSTRUCTOR
2868 /* Don't do this if the CONSTRUCTOR might contain something
2869 that might throw and require us to clean up. */
2870 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2871 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2874 /* Do non-default initialization of trivial arrays resulting from
2875 brace-enclosed initializers. In this case, digest_init and
2876 store_constructor will handle the semantics for us. */
2878 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2882 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2883 if (TREE_CODE (atype) == ARRAY_TYPE)
2885 ptype = build_pointer_type (type);
2886 base = cp_convert (ptype, decay_conversion (base));
2891 /* The code we are generating looks like:
2895 ptrdiff_t iterator = maxindex;
2897 for (; iterator != -1; --iterator) {
2898 ... initialize *t1 ...
2902 ... destroy elements that were constructed ...
2907 We can omit the try and catch blocks if we know that the
2908 initialization will never throw an exception, or if the array
2909 elements do not have destructors. We can omit the loop completely if
2910 the elements of the array do not have constructors.
2912 We actually wrap the entire body of the above in a STMT_EXPR, for
2915 When copying from array to another, when the array elements have
2916 only trivial copy constructors, we should use __builtin_memcpy
2917 rather than generating a loop. That way, we could take advantage
2918 of whatever cleverness the back end has for dealing with copies
2919 of blocks of memory. */
2921 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2922 destroy_temps = stmts_are_full_exprs_p ();
2923 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2924 rval = get_temp_regvar (ptype, base);
2925 base = get_temp_regvar (ptype, rval);
2926 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2928 /* If initializing one array from another, initialize element by
2929 element. We rely upon the below calls to do the argument
2930 checking. Evaluate the initializer before entering the try block. */
2931 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR)
2933 base2 = decay_conversion (init);
2934 itype = TREE_TYPE (base2);
2935 base2 = get_temp_regvar (itype, base2);
2936 itype = TREE_TYPE (itype);
2939 /* Protect the entire array initialization so that we can destroy
2940 the partially constructed array if an exception is thrown.
2941 But don't do this if we're assigning. */
2942 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2945 try_block = begin_try_block ();
2948 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2950 /* Do non-default initialization of non-trivial arrays resulting from
2951 brace-enclosed initializers. */
2952 unsigned HOST_WIDE_INT idx;
2956 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2958 tree baseref = build1 (INDIRECT_REF, type, base);
2960 num_initialized_elts++;
2962 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2963 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2964 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2966 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2968 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2970 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2972 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2976 /* Clear out INIT so that we don't get confused below. */
2979 else if (from_array)
2982 /* OK, we set base2 above. */;
2983 else if (TYPE_LANG_SPECIFIC (type)
2984 && TYPE_NEEDS_CONSTRUCTING (type)
2985 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2987 if (complain & tf_error)
2988 error ("initializer ends prematurely");
2989 return error_mark_node;
2993 /* Now, default-initialize any remaining elements. We don't need to
2994 do that if a) the type does not need constructing, or b) we've
2995 already initialized all the elements.
2997 We do need to keep going if we're copying an array. */
3000 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
3001 && ! (host_integerp (maxindex, 0)
3002 && (num_initialized_elts
3003 == tree_low_cst (maxindex, 0) + 1))))
3005 /* If the ITERATOR is equal to -1, then we don't have to loop;
3006 we've already initialized all the elements. */
3011 for_stmt = begin_for_stmt ();
3012 finish_for_init_stmt (for_stmt);
3013 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
3014 build_int_cst (TREE_TYPE (iterator), -1)),
3016 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3020 to = build1 (INDIRECT_REF, type, base);
3027 from = build1 (INDIRECT_REF, itype, base2);
3031 if (from_array == 2)
3032 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3034 else if (TYPE_NEEDS_CONSTRUCTING (type))
3035 elt_init = build_aggr_init (to, from, 0, complain);
3037 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3042 else if (TREE_CODE (type) == ARRAY_TYPE)
3046 ("cannot initialize multi-dimensional array with initializer");
3047 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
3049 explicit_value_init_p,
3052 else if (explicit_value_init_p)
3054 elt_init = build_value_init (type, complain);
3055 if (elt_init == error_mark_node)
3056 return error_mark_node;
3058 elt_init = build2 (INIT_EXPR, type, to, elt_init);
3062 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
3063 elt_init = build_aggr_init (to, init, 0, complain);
3066 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3067 finish_expr_stmt (elt_init);
3068 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3070 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
3073 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
3076 finish_for_stmt (for_stmt);
3079 /* Make sure to cleanup any partially constructed elements. */
3080 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3084 tree m = cp_build_binary_op (input_location,
3085 MINUS_EXPR, maxindex, iterator,
3088 /* Flatten multi-dimensional array since build_vec_delete only
3089 expects one-dimensional array. */
3090 if (TREE_CODE (type) == ARRAY_TYPE)
3091 m = cp_build_binary_op (input_location,
3093 array_type_nelts_total (type),
3096 finish_cleanup_try_block (try_block);
3097 e = build_vec_delete_1 (rval, m,
3098 inner_elt_type, sfk_base_destructor,
3099 /*use_global_delete=*/0);
3100 finish_cleanup (e, try_block);
3103 /* The value of the array initialization is the array itself, RVAL
3104 is a pointer to the first element. */
3105 finish_stmt_expr_expr (rval, stmt_expr);
3107 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
3109 /* Now make the result have the correct type. */
3110 if (TREE_CODE (atype) == ARRAY_TYPE)
3112 atype = build_pointer_type (atype);
3113 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
3114 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain);
3115 TREE_NO_WARNING (stmt_expr) = 1;
3118 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3122 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3126 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
3132 case sfk_complete_destructor:
3133 name = complete_dtor_identifier;
3136 case sfk_base_destructor:
3137 name = base_dtor_identifier;
3140 case sfk_deleting_destructor:
3141 name = deleting_dtor_identifier;
3147 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
3148 return build_new_method_call (exp, fn,
3150 /*conversion_path=*/NULL_TREE,
3153 tf_warning_or_error);
3156 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3157 ADDR is an expression which yields the store to be destroyed.
3158 AUTO_DELETE is the name of the destructor to call, i.e., either
3159 sfk_complete_destructor, sfk_base_destructor, or
3160 sfk_deleting_destructor.
3162 FLAGS is the logical disjunction of zero or more LOOKUP_
3163 flags. See cp-tree.h for more info. */
3166 build_delete (tree type, tree addr, special_function_kind auto_delete,
3167 int flags, int use_global_delete)
3171 if (addr == error_mark_node)
3172 return error_mark_node;
3174 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3175 set to `error_mark_node' before it gets properly cleaned up. */
3176 if (type == error_mark_node)
3177 return error_mark_node;
3179 type = TYPE_MAIN_VARIANT (type);
3181 addr = mark_rvalue_use (addr);
3183 if (TREE_CODE (type) == POINTER_TYPE)
3185 bool complete_p = true;
3187 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3188 if (TREE_CODE (type) == ARRAY_TYPE)
3191 /* We don't want to warn about delete of void*, only other
3192 incomplete types. Deleting other incomplete types
3193 invokes undefined behavior, but it is not ill-formed, so
3194 compile to something that would even do The Right Thing
3195 (TM) should the type have a trivial dtor and no delete
3197 if (!VOID_TYPE_P (type))
3199 complete_type (type);
3200 if (!COMPLETE_TYPE_P (type))
3202 if (warning (0, "possible problem detected in invocation of "
3203 "delete operator:"))
3205 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3206 inform (input_location, "neither the destructor nor the class-specific "
3207 "operator delete will be called, even if they are "
3208 "declared when the class is defined.");
3213 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3214 /* Call the builtin operator delete. */
3215 return build_builtin_delete_call (addr);
3216 if (TREE_SIDE_EFFECTS (addr))
3217 addr = save_expr (addr);
3219 /* Throw away const and volatile on target type of addr. */
3220 addr = convert_force (build_pointer_type (type), addr, 0);
3222 else if (TREE_CODE (type) == ARRAY_TYPE)
3226 if (TYPE_DOMAIN (type) == NULL_TREE)
3228 error ("unknown array size in delete");
3229 return error_mark_node;
3231 return build_vec_delete (addr, array_type_nelts (type),
3232 auto_delete, use_global_delete);
3236 /* Don't check PROTECT here; leave that decision to the
3237 destructor. If the destructor is accessible, call it,
3238 else report error. */
3239 addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error);
3240 if (TREE_SIDE_EFFECTS (addr))
3241 addr = save_expr (addr);
3243 addr = convert_force (build_pointer_type (type), addr, 0);
3246 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3248 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3250 if (auto_delete != sfk_deleting_destructor)
3251 return void_zero_node;
3253 return build_op_delete_call (DELETE_EXPR, addr,
3254 cxx_sizeof_nowarn (type),
3256 /*placement=*/NULL_TREE,
3257 /*alloc_fn=*/NULL_TREE);
3261 tree head = NULL_TREE;
3262 tree do_delete = NULL_TREE;
3265 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3266 lazily_declare_fn (sfk_destructor, type);
3268 /* For `::delete x', we must not use the deleting destructor
3269 since then we would not be sure to get the global `operator
3271 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3273 /* We will use ADDR multiple times so we must save it. */
3274 addr = save_expr (addr);
3275 head = get_target_expr (build_headof (addr));
3276 /* Delete the object. */
3277 do_delete = build_builtin_delete_call (head);
3278 /* Otherwise, treat this like a complete object destructor
3280 auto_delete = sfk_complete_destructor;
3282 /* If the destructor is non-virtual, there is no deleting
3283 variant. Instead, we must explicitly call the appropriate
3284 `operator delete' here. */
3285 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3286 && auto_delete == sfk_deleting_destructor)
3288 /* We will use ADDR multiple times so we must save it. */
3289 addr = save_expr (addr);
3290 /* Build the call. */
3291 do_delete = build_op_delete_call (DELETE_EXPR,
3293 cxx_sizeof_nowarn (type),
3295 /*placement=*/NULL_TREE,
3296 /*alloc_fn=*/NULL_TREE);
3297 /* Call the complete object destructor. */
3298 auto_delete = sfk_complete_destructor;
3300 else if (auto_delete == sfk_deleting_destructor
3301 && TYPE_GETS_REG_DELETE (type))
3303 /* Make sure we have access to the member op delete, even though
3304 we'll actually be calling it from the destructor. */
3305 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3307 /*placement=*/NULL_TREE,
3308 /*alloc_fn=*/NULL_TREE);
3311 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL,
3312 tf_warning_or_error),
3313 auto_delete, flags);
3315 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3317 /* We need to calculate this before the dtor changes the vptr. */
3319 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3321 if (flags & LOOKUP_DESTRUCTOR)
3322 /* Explicit destructor call; don't check for null pointer. */
3323 ifexp = integer_one_node;
3325 /* Handle deleting a null pointer. */
3326 ifexp = fold (cp_build_binary_op (input_location,
3327 NE_EXPR, addr, integer_zero_node,
3328 tf_warning_or_error));
3330 if (ifexp != integer_one_node)
3331 expr = build3 (COND_EXPR, void_type_node,
3332 ifexp, expr, void_zero_node);
3338 /* At the beginning of a destructor, push cleanups that will call the
3339 destructors for our base classes and members.
3341 Called from begin_destructor_body. */
3344 push_base_cleanups (void)
3346 tree binfo, base_binfo;
3350 VEC(tree,gc) *vbases;
3352 /* Run destructors for all virtual baseclasses. */
3353 if (CLASSTYPE_VBASECLASSES (current_class_type))
3355 tree cond = (condition_conversion
3356 (build2 (BIT_AND_EXPR, integer_type_node,
3357 current_in_charge_parm,
3358 integer_two_node)));
3360 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3361 order, which is also the right order for pushing cleanups. */
3362 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3363 VEC_iterate (tree, vbases, i, base_binfo); i++)
3365 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3367 expr = build_special_member_call (current_class_ref,
3368 base_dtor_identifier,
3372 | LOOKUP_NONVIRTUAL),
3373 tf_warning_or_error);
3374 expr = build3 (COND_EXPR, void_type_node, cond,
3375 expr, void_zero_node);
3376 finish_decl_cleanup (NULL_TREE, expr);
3381 /* Take care of the remaining baseclasses. */
3382 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3383 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3385 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3386 || BINFO_VIRTUAL_P (base_binfo))
3389 expr = build_special_member_call (current_class_ref,
3390 base_dtor_identifier,
3392 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3393 tf_warning_or_error);
3394 finish_decl_cleanup (NULL_TREE, expr);
3397 /* Don't automatically destroy union members. */
3398 if (TREE_CODE (current_class_type) == UNION_TYPE)
3401 for (member = TYPE_FIELDS (current_class_type); member;
3402 member = DECL_CHAIN (member))
3404 tree this_type = TREE_TYPE (member);
3405 if (this_type == error_mark_node
3406 || TREE_CODE (member) != FIELD_DECL
3407 || DECL_ARTIFICIAL (member))
3409 if (ANON_UNION_TYPE_P (this_type))
3411 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type))
3413 tree this_member = (build_class_member_access_expr
3414 (current_class_ref, member,
3415 /*access_path=*/NULL_TREE,
3416 /*preserve_reference=*/false,
3417 tf_warning_or_error));
3418 expr = build_delete (this_type, this_member,
3419 sfk_complete_destructor,
3420 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3422 finish_decl_cleanup (NULL_TREE, expr);
3427 /* Build a C++ vector delete expression.
3428 MAXINDEX is the number of elements to be deleted.
3429 ELT_SIZE is the nominal size of each element in the vector.
3430 BASE is the expression that should yield the store to be deleted.
3431 This function expands (or synthesizes) these calls itself.
3432 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3434 This also calls delete for virtual baseclasses of elements of the vector.
3436 Update: MAXINDEX is no longer needed. The size can be extracted from the
3437 start of the vector for pointers, and from the type for arrays. We still
3438 use MAXINDEX for arrays because it happens to already have one of the
3439 values we'd have to extract. (We could use MAXINDEX with pointers to
3440 confirm the size, and trap if the numbers differ; not clear that it'd
3441 be worth bothering.) */
3444 build_vec_delete (tree base, tree maxindex,
3445 special_function_kind auto_delete_vec, int use_global_delete)
3449 tree base_init = NULL_TREE;
3451 type = TREE_TYPE (base);
3453 if (TREE_CODE (type) == POINTER_TYPE)
3455 /* Step back one from start of vector, and read dimension. */
3457 tree size_ptr_type = build_pointer_type (sizetype);
3459 if (TREE_SIDE_EFFECTS (base))
3461 base_init = get_target_expr (base);
3462 base = TARGET_EXPR_SLOT (base_init);
3464 type = strip_array_types (TREE_TYPE (type));
3465 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR,
3466 sizetype, TYPE_SIZE_UNIT (sizetype));
3467 cookie_addr = build2 (POINTER_PLUS_EXPR,
3469 fold_convert (size_ptr_type, base),
3471 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, tf_warning_or_error);
3473 else if (TREE_CODE (type) == ARRAY_TYPE)
3475 /* Get the total number of things in the array, maxindex is a
3477 maxindex = array_type_nelts_total (type);
3478 type = strip_array_types (type);
3479 base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error);
3480 if (TREE_SIDE_EFFECTS (base))
3482 base_init = get_target_expr (base);
3483 base = TARGET_EXPR_SLOT (base_init);
3488 if (base != error_mark_node)
3489 error ("type to vector delete is neither pointer or array type");
3490 return error_mark_node;
3493 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3496 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);