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 = TREE_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)
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,
305 tf_warning_or_error));
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, tf_warning_or_error);
316 ctor = build_aggr_init_expr (type, ctor);
317 AGGR_INIT_ZERO_FIRST (ctor) = 1;
321 return build_value_init_noctor (type);
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)
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 = TREE_CHAIN (field))
344 if (TREE_CODE (field) != FIELD_DECL)
347 ftype = TREE_TYPE (field);
349 if (TREE_CODE (ftype) == REFERENCE_TYPE)
350 error ("value-initialization of reference");
352 /* We could skip vfields and fields of types with
353 user-defined constructors, but I think that won't improve
354 performance at all; it should be simpler in general just
355 to zero out the entire object than try to only zero the
356 bits that actually need it. */
358 /* Note that for class types there will be FIELD_DECLs
359 corresponding to base classes as well. Thus, iterating
360 over TYPE_FIELDs will result in correct initialization of
361 all of the subobjects. */
362 value = build_value_init (ftype);
365 CONSTRUCTOR_APPEND_ELT(v, field, value);
368 /* Build a constructor to contain the zero- initializations. */
369 return build_constructor (type, v);
372 else if (TREE_CODE (type) == ARRAY_TYPE)
374 VEC(constructor_elt,gc) *v = NULL;
376 /* Iterate over the array elements, building initializations. */
377 tree max_index = array_type_nelts (type);
379 /* If we have an error_mark here, we should just return error mark
380 as we don't know the size of the array yet. */
381 if (max_index == error_mark_node)
382 return error_mark_node;
383 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
385 /* A zero-sized array, which is accepted as an extension, will
386 have an upper bound of -1. */
387 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
391 v = VEC_alloc (constructor_elt, gc, 1);
392 ce = VEC_quick_push (constructor_elt, v, NULL);
394 /* If this is a one element array, we just use a regular init. */
395 if (tree_int_cst_equal (size_zero_node, max_index))
396 ce->index = size_zero_node;
398 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
401 ce->value = build_value_init (TREE_TYPE (type));
403 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
404 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR
405 && TREE_CODE (ce->value) != AGGR_INIT_EXPR);
408 /* Build a constructor to contain the initializations. */
409 return build_constructor (type, v);
412 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
415 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
416 arguments. If TREE_LIST is void_type_node, an empty initializer
417 list was given; if NULL_TREE no initializer was given. */
420 perform_member_init (tree member, tree init)
423 tree type = TREE_TYPE (member);
425 /* Effective C++ rule 12 requires that all data members be
427 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE)
428 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__,
429 "%qD should be initialized in the member initialization list",
432 /* Get an lvalue for the data member. */
433 decl = build_class_member_access_expr (current_class_ref, member,
434 /*access_path=*/NULL_TREE,
435 /*preserve_reference=*/true,
436 tf_warning_or_error);
437 if (decl == error_mark_node)
440 if (init == void_type_node)
442 /* mem() means value-initialization. */
443 if (TREE_CODE (type) == ARRAY_TYPE)
445 init = build_vec_init (decl, NULL_TREE, NULL_TREE,
446 /*explicit_value_init_p=*/true,
448 tf_warning_or_error);
449 finish_expr_stmt (init);
453 if (TREE_CODE (type) == REFERENCE_TYPE)
454 permerror (DECL_SOURCE_LOCATION (current_function_decl),
455 "value-initialization of %q#D, which has reference type",
459 init = build2 (INIT_EXPR, type, decl, build_value_init (type));
460 finish_expr_stmt (init);
464 /* Deal with this here, as we will get confused if we try to call the
465 assignment op for an anonymous union. This can happen in a
466 synthesized copy constructor. */
467 else if (ANON_AGGR_TYPE_P (type))
471 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
472 finish_expr_stmt (init);
475 else if (TYPE_NEEDS_CONSTRUCTING (type))
477 if (init != NULL_TREE
478 && TREE_CODE (type) == ARRAY_TYPE
479 && TREE_CHAIN (init) == NULL_TREE
480 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
482 /* Initialization of one array from another. */
483 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
484 /*explicit_value_init_p=*/false,
486 tf_warning_or_error));
490 if (CP_TYPE_CONST_P (type)
492 && !type_has_user_provided_default_constructor (type))
493 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
494 vtable; still give this diagnostic. */
495 permerror (DECL_SOURCE_LOCATION (current_function_decl),
496 "uninitialized member %qD with %<const%> type %qT",
498 finish_expr_stmt (build_aggr_init (decl, init, 0,
499 tf_warning_or_error));
504 if (init == NULL_TREE)
507 /* member traversal: note it leaves init NULL */
508 if (TREE_CODE (type) == REFERENCE_TYPE)
509 permerror (DECL_SOURCE_LOCATION (current_function_decl),
510 "uninitialized reference member %qD",
512 else if (CP_TYPE_CONST_P (type))
513 permerror (DECL_SOURCE_LOCATION (current_function_decl),
514 "uninitialized member %qD with %<const%> type %qT",
517 core_type = strip_array_types (type);
518 if (CLASS_TYPE_P (core_type)
519 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)
520 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)))
521 diagnose_uninitialized_cst_or_ref_member (core_type,
525 else if (TREE_CODE (init) == TREE_LIST)
526 /* There was an explicit member initialization. Do some work
528 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT);
531 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
532 tf_warning_or_error));
535 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
539 expr = build_class_member_access_expr (current_class_ref, member,
540 /*access_path=*/NULL_TREE,
541 /*preserve_reference=*/false,
542 tf_warning_or_error);
543 expr = build_delete (type, expr, sfk_complete_destructor,
544 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
546 if (expr != error_mark_node)
547 finish_eh_cleanup (expr);
551 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
552 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
555 build_field_list (tree t, tree list, int *uses_unions_p)
561 /* Note whether or not T is a union. */
562 if (TREE_CODE (t) == UNION_TYPE)
565 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
567 /* Skip CONST_DECLs for enumeration constants and so forth. */
568 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
571 /* Keep track of whether or not any fields are unions. */
572 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
575 /* For an anonymous struct or union, we must recursively
576 consider the fields of the anonymous type. They can be
577 directly initialized from the constructor. */
578 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
580 /* Add this field itself. Synthesized copy constructors
581 initialize the entire aggregate. */
582 list = tree_cons (fields, NULL_TREE, list);
583 /* And now add the fields in the anonymous aggregate. */
584 list = build_field_list (TREE_TYPE (fields), list,
587 /* Add this field. */
588 else if (DECL_NAME (fields))
589 list = tree_cons (fields, NULL_TREE, list);
595 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
596 a FIELD_DECL or BINFO in T that needs initialization. The
597 TREE_VALUE gives the initializer, or list of initializer arguments.
599 Return a TREE_LIST containing all of the initializations required
600 for T, in the order in which they should be performed. The output
601 list has the same format as the input. */
604 sort_mem_initializers (tree t, tree mem_inits)
607 tree base, binfo, base_binfo;
610 VEC(tree,gc) *vbases;
614 /* Build up a list of initializations. The TREE_PURPOSE of entry
615 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
616 TREE_VALUE will be the constructor arguments, or NULL if no
617 explicit initialization was provided. */
618 sorted_inits = NULL_TREE;
620 /* Process the virtual bases. */
621 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
622 VEC_iterate (tree, vbases, i, base); i++)
623 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
625 /* Process the direct bases. */
626 for (binfo = TYPE_BINFO (t), i = 0;
627 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
628 if (!BINFO_VIRTUAL_P (base_binfo))
629 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
631 /* Process the non-static data members. */
632 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
633 /* Reverse the entire list of initializations, so that they are in
634 the order that they will actually be performed. */
635 sorted_inits = nreverse (sorted_inits);
637 /* If the user presented the initializers in an order different from
638 that in which they will actually occur, we issue a warning. Keep
639 track of the next subobject which can be explicitly initialized
640 without issuing a warning. */
641 next_subobject = sorted_inits;
643 /* Go through the explicit initializers, filling in TREE_PURPOSE in
645 for (init = mem_inits; init; init = TREE_CHAIN (init))
650 subobject = TREE_PURPOSE (init);
652 /* If the explicit initializers are in sorted order, then
653 SUBOBJECT will be NEXT_SUBOBJECT, or something following
655 for (subobject_init = next_subobject;
657 subobject_init = TREE_CHAIN (subobject_init))
658 if (TREE_PURPOSE (subobject_init) == subobject)
661 /* Issue a warning if the explicit initializer order does not
662 match that which will actually occur.
663 ??? Are all these on the correct lines? */
664 if (warn_reorder && !subobject_init)
666 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
667 warning (OPT_Wreorder, "%q+D will be initialized after",
668 TREE_PURPOSE (next_subobject));
670 warning (OPT_Wreorder, "base %qT will be initialized after",
671 TREE_PURPOSE (next_subobject));
672 if (TREE_CODE (subobject) == FIELD_DECL)
673 warning (OPT_Wreorder, " %q+#D", subobject);
675 warning (OPT_Wreorder, " base %qT", subobject);
676 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
677 OPT_Wreorder, " when initialized here");
680 /* Look again, from the beginning of the list. */
683 subobject_init = sorted_inits;
684 while (TREE_PURPOSE (subobject_init) != subobject)
685 subobject_init = TREE_CHAIN (subobject_init);
688 /* It is invalid to initialize the same subobject more than
690 if (TREE_VALUE (subobject_init))
692 if (TREE_CODE (subobject) == FIELD_DECL)
693 error_at (DECL_SOURCE_LOCATION (current_function_decl),
694 "multiple initializations given for %qD",
697 error_at (DECL_SOURCE_LOCATION (current_function_decl),
698 "multiple initializations given for base %qT",
702 /* Record the initialization. */
703 TREE_VALUE (subobject_init) = TREE_VALUE (init);
704 next_subobject = subobject_init;
709 If a ctor-initializer specifies more than one mem-initializer for
710 multiple members of the same union (including members of
711 anonymous unions), the ctor-initializer is ill-formed.
713 Here we also splice out uninitialized union members. */
716 tree last_field = NULL_TREE;
718 for (p = &sorted_inits; *p; )
726 field = TREE_PURPOSE (init);
728 /* Skip base classes. */
729 if (TREE_CODE (field) != FIELD_DECL)
732 /* If this is an anonymous union with no explicit initializer,
734 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field)))
737 /* See if this field is a member of a union, or a member of a
738 structure contained in a union, etc. */
739 for (field_type = DECL_CONTEXT (field);
740 !same_type_p (field_type, t);
741 field_type = TYPE_CONTEXT (field_type))
742 if (TREE_CODE (field_type) == UNION_TYPE)
744 /* If this field is not a member of a union, skip it. */
745 if (TREE_CODE (field_type) != UNION_TYPE)
748 /* If this union member has no explicit initializer, splice
750 if (!TREE_VALUE (init))
753 /* It's only an error if we have two initializers for the same
761 /* See if LAST_FIELD and the field initialized by INIT are
762 members of the same union. If so, there's a problem,
763 unless they're actually members of the same structure
764 which is itself a member of a union. For example, given:
766 union { struct { int i; int j; }; };
768 initializing both `i' and `j' makes sense. */
769 field_type = DECL_CONTEXT (field);
773 tree last_field_type;
775 last_field_type = DECL_CONTEXT (last_field);
778 if (same_type_p (last_field_type, field_type))
780 if (TREE_CODE (field_type) == UNION_TYPE)
781 error_at (DECL_SOURCE_LOCATION (current_function_decl),
782 "initializations for multiple members of %qT",
788 if (same_type_p (last_field_type, t))
791 last_field_type = TYPE_CONTEXT (last_field_type);
794 /* If we've reached the outermost class, then we're
796 if (same_type_p (field_type, t))
799 field_type = TYPE_CONTEXT (field_type);
806 p = &TREE_CHAIN (*p);
809 *p = TREE_CHAIN (*p);
817 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
818 is a TREE_LIST giving the explicit mem-initializer-list for the
819 constructor. The TREE_PURPOSE of each entry is a subobject (a
820 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
821 is a TREE_LIST giving the arguments to the constructor or
822 void_type_node for an empty list of arguments. */
825 emit_mem_initializers (tree mem_inits)
827 /* We will already have issued an error message about the fact that
828 the type is incomplete. */
829 if (!COMPLETE_TYPE_P (current_class_type))
832 /* Sort the mem-initializers into the order in which the
833 initializations should be performed. */
834 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
836 in_base_initializer = 1;
838 /* Initialize base classes. */
840 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
842 tree subobject = TREE_PURPOSE (mem_inits);
843 tree arguments = TREE_VALUE (mem_inits);
845 /* If these initializations are taking place in a copy constructor,
846 the base class should probably be explicitly initialized if there
847 is a user-defined constructor in the base class (other than the
848 default constructor, which will be called anyway). */
849 if (extra_warnings && !arguments
850 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
851 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
852 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Wextra,
853 "base class %q#T should be explicitly initialized in the "
855 BINFO_TYPE (subobject));
857 /* Initialize the base. */
858 if (BINFO_VIRTUAL_P (subobject))
859 construct_virtual_base (subobject, arguments);
864 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
866 expand_aggr_init_1 (subobject, NULL_TREE,
867 cp_build_indirect_ref (base_addr, RO_NULL,
868 tf_warning_or_error),
871 tf_warning_or_error);
872 expand_cleanup_for_base (subobject, NULL_TREE);
875 mem_inits = TREE_CHAIN (mem_inits);
877 in_base_initializer = 0;
879 /* Initialize the vptrs. */
880 initialize_vtbl_ptrs (current_class_ptr);
882 /* Initialize the data members. */
885 perform_member_init (TREE_PURPOSE (mem_inits),
886 TREE_VALUE (mem_inits));
887 mem_inits = TREE_CHAIN (mem_inits);
891 /* Returns the address of the vtable (i.e., the value that should be
892 assigned to the vptr) for BINFO. */
895 build_vtbl_address (tree binfo)
897 tree binfo_for = binfo;
900 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
901 /* If this is a virtual primary base, then the vtable we want to store
902 is that for the base this is being used as the primary base of. We
903 can't simply skip the initialization, because we may be expanding the
904 inits of a subobject constructor where the virtual base layout
906 while (BINFO_PRIMARY_P (binfo_for))
907 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
909 /* Figure out what vtable BINFO's vtable is based on, and mark it as
911 vtbl = get_vtbl_decl_for_binfo (binfo_for);
912 TREE_USED (vtbl) = 1;
914 /* Now compute the address to use when initializing the vptr. */
915 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
916 if (TREE_CODE (vtbl) == VAR_DECL)
917 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
922 /* This code sets up the virtual function tables appropriate for
923 the pointer DECL. It is a one-ply initialization.
925 BINFO is the exact type that DECL is supposed to be. In
926 multiple inheritance, this might mean "C's A" if C : A, B. */
929 expand_virtual_init (tree binfo, tree decl)
934 /* Compute the initializer for vptr. */
935 vtbl = build_vtbl_address (binfo);
937 /* We may get this vptr from a VTT, if this is a subobject
938 constructor or subobject destructor. */
939 vtt_index = BINFO_VPTR_INDEX (binfo);
945 /* Compute the value to use, when there's a VTT. */
946 vtt_parm = current_vtt_parm;
947 vtbl2 = build2 (POINTER_PLUS_EXPR,
948 TREE_TYPE (vtt_parm),
951 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error);
952 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
954 /* The actual initializer is the VTT value only in the subobject
955 constructor. In maybe_clone_body we'll substitute NULL for
956 the vtt_parm in the case of the non-subobject constructor. */
957 vtbl = build3 (COND_EXPR,
959 build2 (EQ_EXPR, boolean_type_node,
960 current_in_charge_parm, integer_zero_node),
965 /* Compute the location of the vtpr. */
966 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL,
967 tf_warning_or_error),
969 gcc_assert (vtbl_ptr != error_mark_node);
971 /* Assign the vtable to the vptr. */
972 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
973 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
974 tf_warning_or_error));
977 /* If an exception is thrown in a constructor, those base classes already
978 constructed must be destroyed. This function creates the cleanup
979 for BINFO, which has just been constructed. If FLAG is non-NULL,
980 it is a DECL which is nonzero when this base needs to be
984 expand_cleanup_for_base (tree binfo, tree flag)
988 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
991 /* Call the destructor. */
992 expr = build_special_member_call (current_class_ref,
993 base_dtor_identifier,
996 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
997 tf_warning_or_error);
999 expr = fold_build3_loc (input_location,
1000 COND_EXPR, void_type_node,
1001 c_common_truthvalue_conversion (input_location, flag),
1002 expr, integer_zero_node);
1004 finish_eh_cleanup (expr);
1007 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1011 construct_virtual_base (tree vbase, tree arguments)
1017 /* If there are virtual base classes with destructors, we need to
1018 emit cleanups to destroy them if an exception is thrown during
1019 the construction process. These exception regions (i.e., the
1020 period during which the cleanups must occur) begin from the time
1021 the construction is complete to the end of the function. If we
1022 create a conditional block in which to initialize the
1023 base-classes, then the cleanup region for the virtual base begins
1024 inside a block, and ends outside of that block. This situation
1025 confuses the sjlj exception-handling code. Therefore, we do not
1026 create a single conditional block, but one for each
1027 initialization. (That way the cleanup regions always begin
1028 in the outer block.) We trust the back end to figure out
1029 that the FLAG will not change across initializations, and
1030 avoid doing multiple tests. */
1031 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
1032 inner_if_stmt = begin_if_stmt ();
1033 finish_if_stmt_cond (flag, inner_if_stmt);
1035 /* Compute the location of the virtual base. If we're
1036 constructing virtual bases, then we must be the most derived
1037 class. Therefore, we don't have to look up the virtual base;
1038 we already know where it is. */
1039 exp = convert_to_base_statically (current_class_ref, vbase);
1041 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1042 LOOKUP_COMPLAIN, tf_warning_or_error);
1043 finish_then_clause (inner_if_stmt);
1044 finish_if_stmt (inner_if_stmt);
1046 expand_cleanup_for_base (vbase, flag);
1049 /* Find the context in which this FIELD can be initialized. */
1052 initializing_context (tree field)
1054 tree t = DECL_CONTEXT (field);
1056 /* Anonymous union members can be initialized in the first enclosing
1057 non-anonymous union context. */
1058 while (t && ANON_AGGR_TYPE_P (t))
1059 t = TYPE_CONTEXT (t);
1063 /* Function to give error message if member initialization specification
1064 is erroneous. FIELD is the member we decided to initialize.
1065 TYPE is the type for which the initialization is being performed.
1066 FIELD must be a member of TYPE.
1068 MEMBER_NAME is the name of the member. */
1071 member_init_ok_or_else (tree field, tree type, tree member_name)
1073 if (field == error_mark_node)
1077 error ("class %qT does not have any field named %qD", type,
1081 if (TREE_CODE (field) == VAR_DECL)
1083 error ("%q#D is a static data member; it can only be "
1084 "initialized at its definition",
1088 if (TREE_CODE (field) != FIELD_DECL)
1090 error ("%q#D is not a non-static data member of %qT",
1094 if (initializing_context (field) != type)
1096 error ("class %qT does not have any field named %qD", type,
1104 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1105 is a _TYPE node or TYPE_DECL which names a base for that type.
1106 Check the validity of NAME, and return either the base _TYPE, base
1107 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1108 NULL_TREE and issue a diagnostic.
1110 An old style unnamed direct single base construction is permitted,
1111 where NAME is NULL. */
1114 expand_member_init (tree name)
1119 if (!current_class_ref)
1124 /* This is an obsolete unnamed base class initializer. The
1125 parser will already have warned about its use. */
1126 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1129 error ("unnamed initializer for %qT, which has no base classes",
1130 current_class_type);
1133 basetype = BINFO_TYPE
1134 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1137 error ("unnamed initializer for %qT, which uses multiple inheritance",
1138 current_class_type);
1142 else if (TYPE_P (name))
1144 basetype = TYPE_MAIN_VARIANT (name);
1145 name = TYPE_NAME (name);
1147 else if (TREE_CODE (name) == TYPE_DECL)
1148 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1150 basetype = NULL_TREE;
1159 if (current_template_parms)
1162 class_binfo = TYPE_BINFO (current_class_type);
1163 direct_binfo = NULL_TREE;
1164 virtual_binfo = NULL_TREE;
1166 /* Look for a direct base. */
1167 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1168 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1171 /* Look for a virtual base -- unless the direct base is itself
1173 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1174 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1176 /* [class.base.init]
1178 If a mem-initializer-id is ambiguous because it designates
1179 both a direct non-virtual base class and an inherited virtual
1180 base class, the mem-initializer is ill-formed. */
1181 if (direct_binfo && virtual_binfo)
1183 error ("%qD is both a direct base and an indirect virtual base",
1188 if (!direct_binfo && !virtual_binfo)
1190 if (CLASSTYPE_VBASECLASSES (current_class_type))
1191 error ("type %qT is not a direct or virtual base of %qT",
1192 basetype, current_class_type);
1194 error ("type %qT is not a direct base of %qT",
1195 basetype, current_class_type);
1199 return direct_binfo ? direct_binfo : virtual_binfo;
1203 if (TREE_CODE (name) == IDENTIFIER_NODE)
1204 field = lookup_field (current_class_type, name, 1, false);
1208 if (member_init_ok_or_else (field, current_class_type, name))
1215 /* This is like `expand_member_init', only it stores one aggregate
1218 INIT comes in two flavors: it is either a value which
1219 is to be stored in EXP, or it is a parameter list
1220 to go to a constructor, which will operate on EXP.
1221 If INIT is not a parameter list for a constructor, then set
1222 LOOKUP_ONLYCONVERTING.
1223 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1224 the initializer, if FLAGS is 0, then it is the (init) form.
1225 If `init' is a CONSTRUCTOR, then we emit a warning message,
1226 explaining that such initializations are invalid.
1228 If INIT resolves to a CALL_EXPR which happens to return
1229 something of the type we are looking for, then we know
1230 that we can safely use that call to perform the
1233 The virtual function table pointer cannot be set up here, because
1234 we do not really know its type.
1236 This never calls operator=().
1238 When initializing, nothing is CONST.
1240 A default copy constructor may have to be used to perform the
1243 A constructor or a conversion operator may have to be used to
1244 perform the initialization, but not both, as it would be ambiguous. */
1247 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1252 tree type = TREE_TYPE (exp);
1253 int was_const = TREE_READONLY (exp);
1254 int was_volatile = TREE_THIS_VOLATILE (exp);
1257 if (init == error_mark_node)
1258 return error_mark_node;
1260 TREE_READONLY (exp) = 0;
1261 TREE_THIS_VOLATILE (exp) = 0;
1263 if (init && TREE_CODE (init) != TREE_LIST
1264 && !(BRACE_ENCLOSED_INITIALIZER_P (init)
1265 && CONSTRUCTOR_IS_DIRECT_INIT (init)))
1266 flags |= LOOKUP_ONLYCONVERTING;
1268 if (TREE_CODE (type) == ARRAY_TYPE)
1272 /* An array may not be initialized use the parenthesized
1273 initialization form -- unless the initializer is "()". */
1274 if (init && TREE_CODE (init) == TREE_LIST)
1276 if (complain & tf_error)
1277 error ("bad array initializer");
1278 return error_mark_node;
1280 /* Must arrange to initialize each element of EXP
1281 from elements of INIT. */
1282 itype = init ? TREE_TYPE (init) : NULL_TREE;
1283 if (cv_qualified_p (type))
1284 TREE_TYPE (exp) = cv_unqualified (type);
1285 if (itype && cv_qualified_p (itype))
1286 TREE_TYPE (init) = cv_unqualified (itype);
1287 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1288 /*explicit_value_init_p=*/false,
1289 itype && same_type_p (TREE_TYPE (init),
1292 TREE_READONLY (exp) = was_const;
1293 TREE_THIS_VOLATILE (exp) = was_volatile;
1294 TREE_TYPE (exp) = type;
1296 TREE_TYPE (init) = itype;
1300 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1301 /* Just know that we've seen something for this node. */
1302 TREE_USED (exp) = 1;
1304 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1305 destroy_temps = stmts_are_full_exprs_p ();
1306 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1307 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1308 init, LOOKUP_NORMAL|flags, complain);
1309 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1310 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1311 TREE_READONLY (exp) = was_const;
1312 TREE_THIS_VOLATILE (exp) = was_volatile;
1318 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1319 tsubst_flags_t complain)
1321 tree type = TREE_TYPE (exp);
1324 /* It fails because there may not be a constructor which takes
1325 its own type as the first (or only parameter), but which does
1326 take other types via a conversion. So, if the thing initializing
1327 the expression is a unit element of type X, first try X(X&),
1328 followed by initialization by X. If neither of these work
1329 out, then look hard. */
1331 VEC(tree,gc) *parms;
1333 if (init && BRACE_ENCLOSED_INITIALIZER_P (init)
1334 && CP_AGGREGATE_TYPE_P (type))
1336 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1337 happen for direct-initialization, too. */
1338 init = digest_init (type, init);
1339 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1340 TREE_SIDE_EFFECTS (init) = 1;
1341 finish_expr_stmt (init);
1345 if (init && TREE_CODE (init) != TREE_LIST
1346 && (flags & LOOKUP_ONLYCONVERTING))
1348 /* Base subobjects should only get direct-initialization. */
1349 gcc_assert (true_exp == exp);
1351 if (flags & DIRECT_BIND)
1352 /* Do nothing. We hit this in two cases: Reference initialization,
1353 where we aren't initializing a real variable, so we don't want
1354 to run a new constructor; and catching an exception, where we
1355 have already built up the constructor call so we could wrap it
1356 in an exception region. */;
1358 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1360 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1361 /* We need to protect the initialization of a catch parm with a
1362 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1363 around the TARGET_EXPR for the copy constructor. See
1364 initialize_handler_parm. */
1366 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1367 TREE_OPERAND (init, 0));
1368 TREE_TYPE (init) = void_type_node;
1371 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1372 TREE_SIDE_EFFECTS (init) = 1;
1373 finish_expr_stmt (init);
1377 if (init == NULL_TREE)
1379 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1381 parms = make_tree_vector ();
1382 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1383 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1386 parms = make_tree_vector_single (init);
1388 if (true_exp == exp)
1389 ctor_name = complete_ctor_identifier;
1391 ctor_name = base_ctor_identifier;
1393 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1397 release_tree_vector (parms);
1399 if (TREE_SIDE_EFFECTS (rval))
1400 finish_expr_stmt (convert_to_void (rval, ICV_CAST, complain));
1403 /* This function is responsible for initializing EXP with INIT
1406 BINFO is the binfo of the type for who we are performing the
1407 initialization. For example, if W is a virtual base class of A and B,
1409 If we are initializing B, then W must contain B's W vtable, whereas
1410 were we initializing C, W must contain C's W vtable.
1412 TRUE_EXP is nonzero if it is the true expression being initialized.
1413 In this case, it may be EXP, or may just contain EXP. The reason we
1414 need this is because if EXP is a base element of TRUE_EXP, we
1415 don't necessarily know by looking at EXP where its virtual
1416 baseclass fields should really be pointing. But we do know
1417 from TRUE_EXP. In constructors, we don't know anything about
1418 the value being initialized.
1420 FLAGS is just passed to `build_new_method_call'. See that function
1421 for its description. */
1424 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1425 tsubst_flags_t complain)
1427 tree type = TREE_TYPE (exp);
1429 gcc_assert (init != error_mark_node && type != error_mark_node);
1430 gcc_assert (building_stmt_tree ());
1432 /* Use a function returning the desired type to initialize EXP for us.
1433 If the function is a constructor, and its first argument is
1434 NULL_TREE, know that it was meant for us--just slide exp on
1435 in and expand the constructor. Constructors now come
1438 if (init && TREE_CODE (exp) == VAR_DECL
1439 && COMPOUND_LITERAL_P (init))
1441 /* If store_init_value returns NULL_TREE, the INIT has been
1442 recorded as the DECL_INITIAL for EXP. That means there's
1443 nothing more we have to do. */
1444 init = store_init_value (exp, init, flags);
1446 finish_expr_stmt (init);
1450 /* If an explicit -- but empty -- initializer list was present,
1451 that's value-initialization. */
1452 if (init == void_type_node)
1454 /* If there's a user-provided constructor, we just call that. */
1455 if (type_has_user_provided_constructor (type))
1456 /* Fall through. */;
1457 /* If there isn't, but we still need to call the constructor,
1458 zero out the object first. */
1459 else if (TYPE_NEEDS_CONSTRUCTING (type))
1461 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1462 init = build2 (INIT_EXPR, type, exp, init);
1463 finish_expr_stmt (init);
1464 /* And then call the constructor. */
1466 /* If we don't need to mess with the constructor at all,
1467 then just zero out the object and we're done. */
1470 init = build2 (INIT_EXPR, type, exp, build_value_init_noctor (type));
1471 finish_expr_stmt (init);
1477 /* We know that expand_default_init can handle everything we want
1479 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1482 /* Report an error if TYPE is not a user-defined, class type. If
1483 OR_ELSE is nonzero, give an error message. */
1486 is_class_type (tree type, int or_else)
1488 if (type == error_mark_node)
1491 if (! CLASS_TYPE_P (type))
1494 error ("%qT is not a class type", type);
1501 get_type_value (tree name)
1503 if (name == error_mark_node)
1506 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1507 return IDENTIFIER_TYPE_VALUE (name);
1512 /* Build a reference to a member of an aggregate. This is not a C++
1513 `&', but really something which can have its address taken, and
1514 then act as a pointer to member, for example TYPE :: FIELD can have
1515 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1516 this expression is the operand of "&".
1518 @@ Prints out lousy diagnostics for operator <typename>
1521 @@ This function should be rewritten and placed in search.c. */
1524 build_offset_ref (tree type, tree member, bool address_p)
1527 tree basebinfo = NULL_TREE;
1529 /* class templates can come in as TEMPLATE_DECLs here. */
1530 if (TREE_CODE (member) == TEMPLATE_DECL)
1533 if (dependent_scope_p (type) || type_dependent_expression_p (member))
1534 return build_qualified_name (NULL_TREE, type, member,
1535 /*template_p=*/false);
1537 gcc_assert (TYPE_P (type));
1538 if (! is_class_type (type, 1))
1539 return error_mark_node;
1541 gcc_assert (DECL_P (member) || BASELINK_P (member));
1542 /* Callers should call mark_used before this point. */
1543 gcc_assert (!DECL_P (member) || TREE_USED (member));
1545 type = TYPE_MAIN_VARIANT (type);
1546 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type)))
1548 error ("incomplete type %qT does not have member %qD", type, member);
1549 return error_mark_node;
1552 /* Entities other than non-static members need no further
1554 if (TREE_CODE (member) == TYPE_DECL)
1556 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1557 return convert_from_reference (member);
1559 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1561 error ("invalid pointer to bit-field %qD", member);
1562 return error_mark_node;
1565 /* Set up BASEBINFO for member lookup. */
1566 decl = maybe_dummy_object (type, &basebinfo);
1568 /* A lot of this logic is now handled in lookup_member. */
1569 if (BASELINK_P (member))
1571 /* Go from the TREE_BASELINK to the member function info. */
1572 tree t = BASELINK_FUNCTIONS (member);
1574 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1576 /* Get rid of a potential OVERLOAD around it. */
1577 t = OVL_CURRENT (t);
1579 /* Unique functions are handled easily. */
1581 /* For non-static member of base class, we need a special rule
1582 for access checking [class.protected]:
1584 If the access is to form a pointer to member, the
1585 nested-name-specifier shall name the derived class
1586 (or any class derived from that class). */
1587 if (address_p && DECL_P (t)
1588 && DECL_NONSTATIC_MEMBER_P (t))
1589 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1591 perform_or_defer_access_check (basebinfo, t, t);
1593 if (DECL_STATIC_FUNCTION_P (t))
1598 TREE_TYPE (member) = unknown_type_node;
1600 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1601 /* We need additional test besides the one in
1602 check_accessibility_of_qualified_id in case it is
1603 a pointer to non-static member. */
1604 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1608 /* If MEMBER is non-static, then the program has fallen afoul of
1611 An id-expression that denotes a nonstatic data member or
1612 nonstatic member function of a class can only be used:
1614 -- as part of a class member access (_expr.ref_) in which the
1615 object-expression refers to the member's class or a class
1616 derived from that class, or
1618 -- to form a pointer to member (_expr.unary.op_), or
1620 -- in the body of a nonstatic member function of that class or
1621 of a class derived from that class (_class.mfct.nonstatic_), or
1623 -- in a mem-initializer for a constructor for that class or for
1624 a class derived from that class (_class.base.init_). */
1625 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1627 /* Build a representation of the qualified name suitable
1628 for use as the operand to "&" -- even though the "&" is
1629 not actually present. */
1630 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1631 /* In Microsoft mode, treat a non-static member function as if
1632 it were a pointer-to-member. */
1633 if (flag_ms_extensions)
1635 PTRMEM_OK_P (member) = 1;
1636 return cp_build_unary_op (ADDR_EXPR, member, 0,
1637 tf_warning_or_error);
1639 error ("invalid use of non-static member function %qD",
1640 TREE_OPERAND (member, 1));
1641 return error_mark_node;
1643 else if (TREE_CODE (member) == FIELD_DECL)
1645 error ("invalid use of non-static data member %qD", member);
1646 return error_mark_node;
1651 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1652 PTRMEM_OK_P (member) = 1;
1656 /* If DECL is a scalar enumeration constant or variable with a
1657 constant initializer, return the initializer (or, its initializers,
1658 recursively); otherwise, return DECL. If INTEGRAL_P, the
1659 initializer is only returned if DECL is an integral
1660 constant-expression. */
1663 constant_value_1 (tree decl, bool integral_p)
1665 while (TREE_CODE (decl) == CONST_DECL
1667 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1668 : (TREE_CODE (decl) == VAR_DECL
1669 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1672 /* Static data members in template classes may have
1673 non-dependent initializers. References to such non-static
1674 data members are not value-dependent, so we must retrieve the
1675 initializer here. The DECL_INITIAL will have the right type,
1676 but will not have been folded because that would prevent us
1677 from performing all appropriate semantic checks at
1678 instantiation time. */
1679 if (DECL_CLASS_SCOPE_P (decl)
1680 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1681 && uses_template_parms (CLASSTYPE_TI_ARGS
1682 (DECL_CONTEXT (decl))))
1684 ++processing_template_decl;
1685 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1686 --processing_template_decl;
1690 /* If DECL is a static data member in a template
1691 specialization, we must instantiate it here. The
1692 initializer for the static data member is not processed
1693 until needed; we need it now. */
1695 init = DECL_INITIAL (decl);
1697 if (init == error_mark_node)
1699 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))
1700 /* Treat the error as a constant to avoid cascading errors on
1701 excessively recursive template instantiation (c++/9335). */
1706 /* Initializers in templates are generally expanded during
1707 instantiation, so before that for const int i(2)
1708 INIT is a TREE_LIST with the actual initializer as
1710 if (processing_template_decl
1712 && TREE_CODE (init) == TREE_LIST
1713 && TREE_CHAIN (init) == NULL_TREE)
1714 init = TREE_VALUE (init);
1716 || !TREE_TYPE (init)
1718 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1719 : (!TREE_CONSTANT (init)
1720 /* Do not return an aggregate constant (of which
1721 string literals are a special case), as we do not
1722 want to make inadvertent copies of such entities,
1723 and we must be sure that their addresses are the
1725 || TREE_CODE (init) == CONSTRUCTOR
1726 || TREE_CODE (init) == STRING_CST)))
1728 decl = unshare_expr (init);
1733 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1734 constant of integral or enumeration type, then return that value.
1735 These are those variables permitted in constant expressions by
1739 integral_constant_value (tree decl)
1741 return constant_value_1 (decl, /*integral_p=*/true);
1744 /* A more relaxed version of integral_constant_value, used by the
1745 common C/C++ code and by the C++ front end for optimization
1749 decl_constant_value (tree decl)
1751 return constant_value_1 (decl,
1752 /*integral_p=*/processing_template_decl);
1755 /* Common subroutines of build_new and build_vec_delete. */
1757 /* Call the global __builtin_delete to delete ADDR. */
1760 build_builtin_delete_call (tree addr)
1762 mark_used (global_delete_fndecl);
1763 return build_call_n (global_delete_fndecl, 1, addr);
1766 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1767 the type of the object being allocated; otherwise, it's just TYPE.
1768 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1769 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1770 a vector of arguments to be provided as arguments to a placement
1771 new operator. This routine performs no semantic checks; it just
1772 creates and returns a NEW_EXPR. */
1775 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1776 VEC(tree,gc) *init, int use_global_new)
1781 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1782 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1783 permits us to distinguish the case of a missing initializer "new
1784 int" from an empty initializer "new int()". */
1786 init_list = NULL_TREE;
1787 else if (VEC_empty (tree, init))
1788 init_list = void_zero_node;
1790 init_list = build_tree_list_vec (init);
1792 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1793 build_tree_list_vec (placement), type, nelts,
1795 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1796 TREE_SIDE_EFFECTS (new_expr) = 1;
1801 /* Diagnose uninitialized const members or reference members of type
1802 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1803 new expression without a new-initializer and a declaration. Returns
1807 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin,
1808 bool using_new, bool complain)
1811 int error_count = 0;
1813 if (type_has_user_provided_constructor (type))
1816 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1820 if (TREE_CODE (field) != FIELD_DECL)
1823 field_type = strip_array_types (TREE_TYPE (field));
1825 if (TREE_CODE (field_type) == REFERENCE_TYPE)
1831 error ("uninitialized reference member in %q#T "
1832 "using %<new%> without new-initializer", origin);
1834 error ("uninitialized reference member in %q#T", origin);
1835 inform (DECL_SOURCE_LOCATION (field),
1836 "%qD should be initialized", field);
1840 if (CP_TYPE_CONST_P (field_type))
1846 error ("uninitialized const member in %q#T "
1847 "using %<new%> without new-initializer", origin);
1849 error ("uninitialized const member in %q#T", origin);
1850 inform (DECL_SOURCE_LOCATION (field),
1851 "%qD should be initialized", field);
1855 if (CLASS_TYPE_P (field_type))
1857 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin,
1858 using_new, complain);
1864 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain)
1866 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain);
1869 /* Generate code for a new-expression, including calling the "operator
1870 new" function, initializing the object, and, if an exception occurs
1871 during construction, cleaning up. The arguments are as for
1872 build_raw_new_expr. This may change PLACEMENT and INIT. */
1875 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1876 VEC(tree,gc) **init, bool globally_qualified_p,
1877 tsubst_flags_t complain)
1880 /* True iff this is a call to "operator new[]" instead of just
1882 bool array_p = false;
1883 /* If ARRAY_P is true, the element type of the array. This is never
1884 an ARRAY_TYPE; for something like "new int[3][4]", the
1885 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1888 /* The type of the new-expression. (This type is always a pointer
1891 tree non_const_pointer_type;
1892 tree outer_nelts = NULL_TREE;
1893 tree alloc_call, alloc_expr;
1894 /* The address returned by the call to "operator new". This node is
1895 a VAR_DECL and is therefore reusable. */
1898 tree cookie_expr, init_expr;
1899 int nothrow, check_new;
1900 int use_java_new = 0;
1901 /* If non-NULL, the number of extra bytes to allocate at the
1902 beginning of the storage allocated for an array-new expression in
1903 order to store the number of elements. */
1904 tree cookie_size = NULL_TREE;
1905 tree placement_first;
1906 tree placement_expr = NULL_TREE;
1907 /* True if the function we are calling is a placement allocation
1909 bool placement_allocation_fn_p;
1910 /* True if the storage must be initialized, either by a constructor
1911 or due to an explicit new-initializer. */
1912 bool is_initialized;
1913 /* The address of the thing allocated, not including any cookie. In
1914 particular, if an array cookie is in use, DATA_ADDR is the
1915 address of the first array element. This node is a VAR_DECL, and
1916 is therefore reusable. */
1918 tree init_preeval_expr = NULL_TREE;
1922 outer_nelts = nelts;
1925 else if (TREE_CODE (type) == ARRAY_TYPE)
1928 nelts = array_type_nelts_top (type);
1929 outer_nelts = nelts;
1930 type = TREE_TYPE (type);
1933 /* If our base type is an array, then make sure we know how many elements
1935 for (elt_type = type;
1936 TREE_CODE (elt_type) == ARRAY_TYPE;
1937 elt_type = TREE_TYPE (elt_type))
1938 nelts = cp_build_binary_op (input_location,
1940 array_type_nelts_top (elt_type),
1943 if (TREE_CODE (elt_type) == VOID_TYPE)
1945 if (complain & tf_error)
1946 error ("invalid type %<void%> for new");
1947 return error_mark_node;
1950 if (abstract_virtuals_error (NULL_TREE, elt_type))
1951 return error_mark_node;
1953 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
1957 bool maybe_uninitialized_error = false;
1958 /* A program that calls for default-initialization [...] of an
1959 entity of reference type is ill-formed. */
1960 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type))
1961 maybe_uninitialized_error = true;
1963 /* A new-expression that creates an object of type T initializes
1964 that object as follows:
1965 - If the new-initializer is omitted:
1966 -- If T is a (possibly cv-qualified) non-POD class type
1967 (or array thereof), the object is default-initialized (8.5).
1969 -- Otherwise, the object created has indeterminate
1970 value. If T is a const-qualified type, or a (possibly
1971 cv-qualified) POD class type (or array thereof)
1972 containing (directly or indirectly) a member of
1973 const-qualified type, the program is ill-formed; */
1975 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type))
1976 maybe_uninitialized_error = true;
1978 if (maybe_uninitialized_error
1979 && diagnose_uninitialized_cst_or_ref_member (elt_type,
1981 complain & tf_error))
1982 return error_mark_node;
1985 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
1986 && !type_has_user_provided_default_constructor (elt_type))
1988 if (complain & tf_error)
1989 error ("uninitialized const in %<new%> of %q#T", elt_type);
1990 return error_mark_node;
1993 size = size_in_bytes (elt_type);
1995 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1997 alloc_fn = NULL_TREE;
1999 /* If PLACEMENT is a single simple pointer type not passed by
2000 reference, prepare to capture it in a temporary variable. Do
2001 this now, since PLACEMENT will change in the calls below. */
2002 placement_first = NULL_TREE;
2003 if (VEC_length (tree, *placement) == 1
2004 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
2006 placement_first = VEC_index (tree, *placement, 0);
2008 /* Allocate the object. */
2009 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
2012 tree class_decl = build_java_class_ref (elt_type);
2013 static const char alloc_name[] = "_Jv_AllocObject";
2015 if (class_decl == error_mark_node)
2016 return error_mark_node;
2019 if (!get_global_value_if_present (get_identifier (alloc_name),
2022 if (complain & tf_error)
2023 error ("call to Java constructor with %qs undefined", alloc_name);
2024 return error_mark_node;
2026 else if (really_overloaded_fn (alloc_fn))
2028 if (complain & tf_error)
2029 error ("%qD should never be overloaded", alloc_fn);
2030 return error_mark_node;
2032 alloc_fn = OVL_CURRENT (alloc_fn);
2033 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2034 alloc_call = (cp_build_function_call
2036 build_tree_list (NULL_TREE, class_addr),
2039 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
2041 error ("Java class %q#T object allocated using placement new", elt_type);
2042 return error_mark_node;
2049 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
2051 if (!globally_qualified_p
2052 && CLASS_TYPE_P (elt_type)
2054 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
2055 : TYPE_HAS_NEW_OPERATOR (elt_type)))
2057 /* Use a class-specific operator new. */
2058 /* If a cookie is required, add some extra space. */
2059 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2061 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2062 size = size_binop (PLUS_EXPR, size, cookie_size);
2064 /* Create the argument list. */
2065 VEC_safe_insert (tree, gc, *placement, 0, size);
2066 /* Do name-lookup to find the appropriate operator. */
2067 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
2068 if (fns == NULL_TREE)
2070 if (complain & tf_error)
2071 error ("no suitable %qD found in class %qT", fnname, elt_type);
2072 return error_mark_node;
2074 if (TREE_CODE (fns) == TREE_LIST)
2076 if (complain & tf_error)
2078 error ("request for member %qD is ambiguous", fnname);
2079 print_candidates (fns);
2081 return error_mark_node;
2083 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2085 /*conversion_path=*/NULL_TREE,
2092 /* Use a global operator new. */
2093 /* See if a cookie might be required. */
2094 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2095 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2097 cookie_size = NULL_TREE;
2099 alloc_call = build_operator_new_call (fnname, placement,
2100 &size, &cookie_size,
2105 if (alloc_call == error_mark_node)
2106 return error_mark_node;
2108 gcc_assert (alloc_fn != NULL_TREE);
2110 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2111 into a temporary variable. */
2112 if (!processing_template_decl
2113 && placement_first != NULL_TREE
2114 && TREE_CODE (alloc_call) == CALL_EXPR
2115 && call_expr_nargs (alloc_call) == 2
2116 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2117 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2119 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2121 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2122 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2124 placement_expr = get_target_expr (placement_first);
2125 CALL_EXPR_ARG (alloc_call, 1)
2126 = convert (TREE_TYPE (placement_arg), placement_expr);
2130 /* In the simple case, we can stop now. */
2131 pointer_type = build_pointer_type (type);
2132 if (!cookie_size && !is_initialized)
2133 return build_nop (pointer_type, alloc_call);
2135 /* Store the result of the allocation call in a variable so that we can
2136 use it more than once. */
2137 alloc_expr = get_target_expr (alloc_call);
2138 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2140 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2141 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2142 alloc_call = TREE_OPERAND (alloc_call, 1);
2144 /* Now, check to see if this function is actually a placement
2145 allocation function. This can happen even when PLACEMENT is NULL
2146 because we might have something like:
2148 struct S { void* operator new (size_t, int i = 0); };
2150 A call to `new S' will get this allocation function, even though
2151 there is no explicit placement argument. If there is more than
2152 one argument, or there are variable arguments, then this is a
2153 placement allocation function. */
2154 placement_allocation_fn_p
2155 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2156 || varargs_function_p (alloc_fn));
2158 /* Preevaluate the placement args so that we don't reevaluate them for a
2159 placement delete. */
2160 if (placement_allocation_fn_p)
2163 stabilize_call (alloc_call, &inits);
2165 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2169 /* unless an allocation function is declared with an empty excep-
2170 tion-specification (_except.spec_), throw(), it indicates failure to
2171 allocate storage by throwing a bad_alloc exception (clause _except_,
2172 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2173 cation function is declared with an empty exception-specification,
2174 throw(), it returns null to indicate failure to allocate storage and a
2175 non-null pointer otherwise.
2177 So check for a null exception spec on the op new we just called. */
2179 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2180 check_new = (flag_check_new || nothrow) && ! use_java_new;
2188 /* Adjust so we're pointing to the start of the object. */
2189 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2190 alloc_node, cookie_size);
2192 /* Store the number of bytes allocated so that we can know how
2193 many elements to destroy later. We use the last sizeof
2194 (size_t) bytes to store the number of elements. */
2195 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2196 cookie_ptr = fold_build2_loc (input_location,
2197 POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2198 alloc_node, cookie_ptr);
2199 size_ptr_type = build_pointer_type (sizetype);
2200 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2201 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2203 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2205 if (targetm.cxx.cookie_has_size ())
2207 /* Also store the element size. */
2208 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2209 fold_build1_loc (input_location,
2210 NEGATE_EXPR, sizetype,
2211 size_in_bytes (sizetype)));
2213 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain);
2214 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2215 size_in_bytes (elt_type));
2216 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2217 cookie, cookie_expr);
2222 cookie_expr = NULL_TREE;
2223 data_addr = alloc_node;
2226 /* Now use a pointer to the type we've actually allocated. */
2228 /* But we want to operate on a non-const version to start with,
2229 since we'll be modifying the elements. */
2230 non_const_pointer_type = build_pointer_type
2231 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST));
2233 data_addr = fold_convert (non_const_pointer_type, data_addr);
2234 /* Any further uses of alloc_node will want this type, too. */
2235 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2237 /* Now initialize the allocated object. Note that we preevaluate the
2238 initialization expression, apart from the actual constructor call or
2239 assignment--we do this because we want to delay the allocation as long
2240 as possible in order to minimize the size of the exception region for
2241 placement delete. */
2245 bool explicit_value_init_p = false;
2247 if (*init != NULL && VEC_empty (tree, *init))
2250 explicit_value_init_p = true;
2255 tree vecinit = NULL_TREE;
2256 if (*init && VEC_length (tree, *init) == 1
2257 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2258 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2260 tree arraytype, domain;
2261 vecinit = VEC_index (tree, *init, 0);
2262 if (TREE_CONSTANT (nelts))
2263 domain = compute_array_index_type (NULL_TREE, nelts);
2267 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2268 warning (0, "non-constant array size in new, unable to "
2269 "verify length of initializer-list");
2271 arraytype = build_cplus_array_type (type, domain);
2272 vecinit = digest_init (arraytype, vecinit);
2276 if (complain & tf_error)
2277 permerror (input_location, "ISO C++ forbids initialization in array new");
2279 return error_mark_node;
2280 vecinit = build_tree_list_vec (*init);
2283 = build_vec_init (data_addr,
2284 cp_build_binary_op (input_location,
2285 MINUS_EXPR, outer_nelts,
2289 explicit_value_init_p,
2293 /* An array initialization is stable because the initialization
2294 of each element is a full-expression, so the temporaries don't
2300 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain);
2302 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2304 init_expr = build_special_member_call (init_expr,
2305 complete_ctor_identifier,
2310 else if (explicit_value_init_p)
2312 /* Something like `new int()'. */
2313 init_expr = build2 (INIT_EXPR, type,
2314 init_expr, build_value_init (type));
2320 /* We are processing something like `new int (10)', which
2321 means allocate an int, and initialize it with 10. */
2323 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2324 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2327 stable = stabilize_init (init_expr, &init_preeval_expr);
2330 if (init_expr == error_mark_node)
2331 return error_mark_node;
2333 /* If any part of the object initialization terminates by throwing an
2334 exception and a suitable deallocation function can be found, the
2335 deallocation function is called to free the memory in which the
2336 object was being constructed, after which the exception continues
2337 to propagate in the context of the new-expression. If no
2338 unambiguous matching deallocation function can be found,
2339 propagating the exception does not cause the object's memory to be
2341 if (flag_exceptions && ! use_java_new)
2343 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2346 /* The Standard is unclear here, but the right thing to do
2347 is to use the same method for finding deallocation
2348 functions that we use for finding allocation functions. */
2349 cleanup = (build_op_delete_call
2353 globally_qualified_p,
2354 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2360 /* This is much simpler if we were able to preevaluate all of
2361 the arguments to the constructor call. */
2363 /* CLEANUP is compiler-generated, so no diagnostics. */
2364 TREE_NO_WARNING (cleanup) = true;
2365 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2366 init_expr, cleanup);
2367 /* Likewise, this try-catch is compiler-generated. */
2368 TREE_NO_WARNING (init_expr) = true;
2371 /* Ack! First we allocate the memory. Then we set our sentry
2372 variable to true, and expand a cleanup that deletes the
2373 memory if sentry is true. Then we run the constructor, and
2374 finally clear the sentry.
2376 We need to do this because we allocate the space first, so
2377 if there are any temporaries with cleanups in the
2378 constructor args and we weren't able to preevaluate them, we
2379 need this EH region to extend until end of full-expression
2380 to preserve nesting. */
2382 tree end, sentry, begin;
2384 begin = get_target_expr (boolean_true_node);
2385 CLEANUP_EH_ONLY (begin) = 1;
2387 sentry = TARGET_EXPR_SLOT (begin);
2389 /* CLEANUP is compiler-generated, so no diagnostics. */
2390 TREE_NO_WARNING (cleanup) = true;
2392 TARGET_EXPR_CLEANUP (begin)
2393 = build3 (COND_EXPR, void_type_node, sentry,
2394 cleanup, void_zero_node);
2396 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2397 sentry, boolean_false_node);
2400 = build2 (COMPOUND_EXPR, void_type_node, begin,
2401 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2403 /* Likewise, this is compiler-generated. */
2404 TREE_NO_WARNING (init_expr) = true;
2409 init_expr = NULL_TREE;
2411 /* Now build up the return value in reverse order. */
2416 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2418 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2420 if (rval == data_addr)
2421 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2422 and return the call (which doesn't need to be adjusted). */
2423 rval = TARGET_EXPR_INITIAL (alloc_expr);
2428 tree ifexp = cp_build_binary_op (input_location,
2429 NE_EXPR, alloc_node,
2432 rval = build_conditional_expr (ifexp, rval, alloc_node,
2436 /* Perform the allocation before anything else, so that ALLOC_NODE
2437 has been initialized before we start using it. */
2438 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2441 if (init_preeval_expr)
2442 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2444 /* A new-expression is never an lvalue. */
2445 gcc_assert (!lvalue_p (rval));
2447 return convert (pointer_type, rval);
2450 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2451 is a vector of placement-new arguments (or NULL if none). If NELTS
2452 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2453 is not NULL, then this is an array-new allocation; TYPE is the type
2454 of the elements in the array and NELTS is the number of elements in
2455 the array. *INIT, if non-NULL, is the initializer for the new
2456 object, or an empty vector to indicate an initializer of "()". If
2457 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2458 rather than just "new". This may change PLACEMENT and INIT. */
2461 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2462 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2465 VEC(tree,gc) *orig_placement = NULL;
2466 tree orig_nelts = NULL_TREE;
2467 VEC(tree,gc) *orig_init = NULL;
2469 if (type == error_mark_node)
2470 return error_mark_node;
2472 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2474 tree auto_node = type_uses_auto (type);
2475 if (auto_node && describable_type (VEC_index (tree, *init, 0)))
2476 type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node);
2479 if (processing_template_decl)
2481 if (dependent_type_p (type)
2482 || any_type_dependent_arguments_p (*placement)
2483 || (nelts && type_dependent_expression_p (nelts))
2484 || any_type_dependent_arguments_p (*init))
2485 return build_raw_new_expr (*placement, type, nelts, *init,
2488 orig_placement = make_tree_vector_copy (*placement);
2490 orig_init = make_tree_vector_copy (*init);
2492 make_args_non_dependent (*placement);
2494 nelts = build_non_dependent_expr (nelts);
2495 make_args_non_dependent (*init);
2500 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2502 if (complain & tf_error)
2503 permerror (input_location, "size in array new must have integral type");
2505 return error_mark_node;
2507 nelts = mark_rvalue_use (nelts);
2508 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2511 /* ``A reference cannot be created by the new operator. A reference
2512 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2513 returned by new.'' ARM 5.3.3 */
2514 if (TREE_CODE (type) == REFERENCE_TYPE)
2516 if (complain & tf_error)
2517 error ("new cannot be applied to a reference type");
2519 return error_mark_node;
2520 type = TREE_TYPE (type);
2523 if (TREE_CODE (type) == FUNCTION_TYPE)
2525 if (complain & tf_error)
2526 error ("new cannot be applied to a function type");
2527 return error_mark_node;
2530 /* The type allocated must be complete. If the new-type-id was
2531 "T[N]" then we are just checking that "T" is complete here, but
2532 that is equivalent, since the value of "N" doesn't matter. */
2533 if (!complete_type_or_else (type, NULL_TREE))
2534 return error_mark_node;
2536 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2537 if (rval == error_mark_node)
2538 return error_mark_node;
2540 if (processing_template_decl)
2542 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2543 orig_init, use_global_new);
2544 release_tree_vector (orig_placement);
2545 release_tree_vector (orig_init);
2549 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2550 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2551 TREE_NO_WARNING (rval) = 1;
2556 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2559 build_java_class_ref (tree type)
2561 tree name = NULL_TREE, class_decl;
2562 static tree CL_suffix = NULL_TREE;
2563 if (CL_suffix == NULL_TREE)
2564 CL_suffix = get_identifier("class$");
2565 if (jclass_node == NULL_TREE)
2567 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2568 if (jclass_node == NULL_TREE)
2570 error ("call to Java constructor, while %<jclass%> undefined");
2571 return error_mark_node;
2573 jclass_node = TREE_TYPE (jclass_node);
2576 /* Mangle the class$ field. */
2579 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2580 if (DECL_NAME (field) == CL_suffix)
2582 mangle_decl (field);
2583 name = DECL_ASSEMBLER_NAME (field);
2588 error ("can't find %<class$%> in %qT", type);
2589 return error_mark_node;
2593 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2594 if (class_decl == NULL_TREE)
2596 class_decl = build_decl (input_location,
2597 VAR_DECL, name, TREE_TYPE (jclass_node));
2598 TREE_STATIC (class_decl) = 1;
2599 DECL_EXTERNAL (class_decl) = 1;
2600 TREE_PUBLIC (class_decl) = 1;
2601 DECL_ARTIFICIAL (class_decl) = 1;
2602 DECL_IGNORED_P (class_decl) = 1;
2603 pushdecl_top_level (class_decl);
2604 make_decl_rtl (class_decl);
2610 build_vec_delete_1 (tree base, tree maxindex, tree type,
2611 special_function_kind auto_delete_vec, int use_global_delete)
2614 tree ptype = build_pointer_type (type = complete_type (type));
2615 tree size_exp = size_in_bytes (type);
2617 /* Temporary variables used by the loop. */
2618 tree tbase, tbase_init;
2620 /* This is the body of the loop that implements the deletion of a
2621 single element, and moves temp variables to next elements. */
2624 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2627 /* This is the thing that governs what to do after the loop has run. */
2628 tree deallocate_expr = 0;
2630 /* This is the BIND_EXPR which holds the outermost iterator of the
2631 loop. It is convenient to set this variable up and test it before
2632 executing any other code in the loop.
2633 This is also the containing expression returned by this function. */
2634 tree controller = NULL_TREE;
2637 /* We should only have 1-D arrays here. */
2638 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2640 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2643 /* The below is short by the cookie size. */
2644 virtual_size = size_binop (MULT_EXPR, size_exp,
2645 convert (sizetype, maxindex));
2647 tbase = create_temporary_var (ptype);
2648 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2649 fold_build2_loc (input_location,
2650 POINTER_PLUS_EXPR, ptype,
2651 fold_convert (ptype, base),
2653 tf_warning_or_error);
2654 controller = build3 (BIND_EXPR, void_type_node, tbase,
2655 NULL_TREE, NULL_TREE);
2656 TREE_SIDE_EFFECTS (controller) = 1;
2658 body = build1 (EXIT_EXPR, void_type_node,
2659 build2 (EQ_EXPR, boolean_type_node, tbase,
2660 fold_convert (ptype, base)));
2661 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp);
2662 body = build_compound_expr
2664 body, cp_build_modify_expr (tbase, NOP_EXPR,
2665 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2666 tf_warning_or_error));
2667 body = build_compound_expr
2669 body, build_delete (ptype, tbase, sfk_complete_destructor,
2670 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2672 loop = build1 (LOOP_EXPR, void_type_node, body);
2673 loop = build_compound_expr (input_location, tbase_init, loop);
2676 /* If the delete flag is one, or anything else with the low bit set,
2677 delete the storage. */
2678 if (auto_delete_vec != sfk_base_destructor)
2682 /* The below is short by the cookie size. */
2683 virtual_size = size_binop (MULT_EXPR, size_exp,
2684 convert (sizetype, maxindex));
2686 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2693 cookie_size = targetm.cxx.get_cookie_size (type);
2695 = cp_convert (ptype,
2696 cp_build_binary_op (input_location,
2698 cp_convert (string_type_node,
2701 tf_warning_or_error));
2702 /* True size with header. */
2703 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2706 if (auto_delete_vec == sfk_deleting_destructor)
2707 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2708 base_tbd, virtual_size,
2709 use_global_delete & 1,
2710 /*placement=*/NULL_TREE,
2711 /*alloc_fn=*/NULL_TREE);
2715 if (!deallocate_expr)
2718 body = deallocate_expr;
2720 body = build_compound_expr (input_location, body, deallocate_expr);
2723 body = integer_zero_node;
2725 /* Outermost wrapper: If pointer is null, punt. */
2726 body = fold_build3_loc (input_location, COND_EXPR, void_type_node,
2727 fold_build2_loc (input_location,
2728 NE_EXPR, boolean_type_node, base,
2729 convert (TREE_TYPE (base),
2730 integer_zero_node)),
2731 body, integer_zero_node);
2732 body = build1 (NOP_EXPR, void_type_node, body);
2736 TREE_OPERAND (controller, 1) = body;
2740 if (TREE_CODE (base) == SAVE_EXPR)
2741 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2742 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2744 return convert_to_void (body, ICV_CAST, tf_warning_or_error);
2747 /* Create an unnamed variable of the indicated TYPE. */
2750 create_temporary_var (tree type)
2754 decl = build_decl (input_location,
2755 VAR_DECL, NULL_TREE, type);
2756 TREE_USED (decl) = 1;
2757 DECL_ARTIFICIAL (decl) = 1;
2758 DECL_IGNORED_P (decl) = 1;
2759 DECL_CONTEXT (decl) = current_function_decl;
2764 /* Create a new temporary variable of the indicated TYPE, initialized
2767 It is not entered into current_binding_level, because that breaks
2768 things when it comes time to do final cleanups (which take place
2769 "outside" the binding contour of the function). */
2772 get_temp_regvar (tree type, tree init)
2776 decl = create_temporary_var (type);
2777 add_decl_expr (decl);
2779 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2780 tf_warning_or_error));
2785 /* `build_vec_init' returns tree structure that performs
2786 initialization of a vector of aggregate types.
2788 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2789 to the first element, of POINTER_TYPE.
2790 MAXINDEX is the maximum index of the array (one less than the
2791 number of elements). It is only used if BASE is a pointer or
2792 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2794 INIT is the (possibly NULL) initializer.
2796 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2797 elements in the array are value-initialized.
2799 FROM_ARRAY is 0 if we should init everything with INIT
2800 (i.e., every element initialized from INIT).
2801 FROM_ARRAY is 1 if we should index into INIT in parallel
2802 with initialization of DECL.
2803 FROM_ARRAY is 2 if we should index into INIT in parallel,
2804 but use assignment instead of initialization. */
2807 build_vec_init (tree base, tree maxindex, tree init,
2808 bool explicit_value_init_p,
2809 int from_array, tsubst_flags_t complain)
2812 tree base2 = NULL_TREE;
2813 tree itype = NULL_TREE;
2815 /* The type of BASE. */
2816 tree atype = TREE_TYPE (base);
2817 /* The type of an element in the array. */
2818 tree type = TREE_TYPE (atype);
2819 /* The element type reached after removing all outer array
2821 tree inner_elt_type;
2822 /* The type of a pointer to an element in the array. */
2827 tree try_block = NULL_TREE;
2828 int num_initialized_elts = 0;
2831 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2832 maxindex = array_type_nelts (atype);
2834 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2835 return error_mark_node;
2837 if (explicit_value_init_p)
2840 inner_elt_type = strip_array_types (type);
2842 /* Look through the TARGET_EXPR around a compound literal. */
2843 if (init && TREE_CODE (init) == TARGET_EXPR
2844 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR
2846 init = TARGET_EXPR_INITIAL (init);
2849 && TREE_CODE (atype) == ARRAY_TYPE
2851 ? (!CLASS_TYPE_P (inner_elt_type)
2852 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type))
2853 : !TYPE_NEEDS_CONSTRUCTING (type))
2854 && ((TREE_CODE (init) == CONSTRUCTOR
2855 /* Don't do this if the CONSTRUCTOR might contain something
2856 that might throw and require us to clean up. */
2857 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2858 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2861 /* Do non-default initialization of trivial arrays resulting from
2862 brace-enclosed initializers. In this case, digest_init and
2863 store_constructor will handle the semantics for us. */
2865 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2869 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2870 if (TREE_CODE (atype) == ARRAY_TYPE)
2872 ptype = build_pointer_type (type);
2873 base = cp_convert (ptype, decay_conversion (base));
2878 /* The code we are generating looks like:
2882 ptrdiff_t iterator = maxindex;
2884 for (; iterator != -1; --iterator) {
2885 ... initialize *t1 ...
2889 ... destroy elements that were constructed ...
2894 We can omit the try and catch blocks if we know that the
2895 initialization will never throw an exception, or if the array
2896 elements do not have destructors. We can omit the loop completely if
2897 the elements of the array do not have constructors.
2899 We actually wrap the entire body of the above in a STMT_EXPR, for
2902 When copying from array to another, when the array elements have
2903 only trivial copy constructors, we should use __builtin_memcpy
2904 rather than generating a loop. That way, we could take advantage
2905 of whatever cleverness the back end has for dealing with copies
2906 of blocks of memory. */
2908 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2909 destroy_temps = stmts_are_full_exprs_p ();
2910 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2911 rval = get_temp_regvar (ptype, base);
2912 base = get_temp_regvar (ptype, rval);
2913 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2915 /* If initializing one array from another, initialize element by
2916 element. We rely upon the below calls to do the argument
2917 checking. Evaluate the initializer before entering the try block. */
2918 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR)
2920 base2 = decay_conversion (init);
2921 itype = TREE_TYPE (base2);
2922 base2 = get_temp_regvar (itype, base2);
2923 itype = TREE_TYPE (itype);
2926 /* Protect the entire array initialization so that we can destroy
2927 the partially constructed array if an exception is thrown.
2928 But don't do this if we're assigning. */
2929 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2932 try_block = begin_try_block ();
2935 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2937 /* Do non-default initialization of non-trivial arrays resulting from
2938 brace-enclosed initializers. */
2939 unsigned HOST_WIDE_INT idx;
2943 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2945 tree baseref = build1 (INDIRECT_REF, type, base);
2947 num_initialized_elts++;
2949 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2950 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2951 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2953 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2955 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2957 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2959 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2963 /* Clear out INIT so that we don't get confused below. */
2966 else if (from_array)
2969 /* OK, we set base2 above. */;
2970 else if (TYPE_LANG_SPECIFIC (type)
2971 && TYPE_NEEDS_CONSTRUCTING (type)
2972 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2974 if (complain & tf_error)
2975 error ("initializer ends prematurely");
2976 return error_mark_node;
2980 /* Now, default-initialize any remaining elements. We don't need to
2981 do that if a) the type does not need constructing, or b) we've
2982 already initialized all the elements.
2984 We do need to keep going if we're copying an array. */
2987 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
2988 && ! (host_integerp (maxindex, 0)
2989 && (num_initialized_elts
2990 == tree_low_cst (maxindex, 0) + 1))))
2992 /* If the ITERATOR is equal to -1, then we don't have to loop;
2993 we've already initialized all the elements. */
2998 for_stmt = begin_for_stmt ();
2999 finish_for_init_stmt (for_stmt);
3000 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
3001 build_int_cst (TREE_TYPE (iterator), -1)),
3003 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
3007 to = build1 (INDIRECT_REF, type, base);
3014 from = build1 (INDIRECT_REF, itype, base2);
3018 if (from_array == 2)
3019 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3021 else if (TYPE_NEEDS_CONSTRUCTING (type))
3022 elt_init = build_aggr_init (to, from, 0, complain);
3024 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
3029 else if (TREE_CODE (type) == ARRAY_TYPE)
3033 ("cannot initialize multi-dimensional array with initializer");
3034 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
3036 explicit_value_init_p,
3039 else if (explicit_value_init_p)
3040 elt_init = build2 (INIT_EXPR, type, to,
3041 build_value_init (type));
3044 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
3045 elt_init = build_aggr_init (to, init, 0, complain);
3048 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
3049 finish_expr_stmt (elt_init);
3050 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
3052 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
3055 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
3058 finish_for_stmt (for_stmt);
3061 /* Make sure to cleanup any partially constructed elements. */
3062 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3066 tree m = cp_build_binary_op (input_location,
3067 MINUS_EXPR, maxindex, iterator,
3070 /* Flatten multi-dimensional array since build_vec_delete only
3071 expects one-dimensional array. */
3072 if (TREE_CODE (type) == ARRAY_TYPE)
3073 m = cp_build_binary_op (input_location,
3075 array_type_nelts_total (type),
3078 finish_cleanup_try_block (try_block);
3079 e = build_vec_delete_1 (rval, m,
3080 inner_elt_type, sfk_base_destructor,
3081 /*use_global_delete=*/0);
3082 finish_cleanup (e, try_block);
3085 /* The value of the array initialization is the array itself, RVAL
3086 is a pointer to the first element. */
3087 finish_stmt_expr_expr (rval, stmt_expr);
3089 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
3091 /* Now make the result have the correct type. */
3092 if (TREE_CODE (atype) == ARRAY_TYPE)
3094 atype = build_pointer_type (atype);
3095 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
3096 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain);
3097 TREE_NO_WARNING (stmt_expr) = 1;
3100 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3104 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3108 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
3114 case sfk_complete_destructor:
3115 name = complete_dtor_identifier;
3118 case sfk_base_destructor:
3119 name = base_dtor_identifier;
3122 case sfk_deleting_destructor:
3123 name = deleting_dtor_identifier;
3129 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
3130 return build_new_method_call (exp, fn,
3132 /*conversion_path=*/NULL_TREE,
3135 tf_warning_or_error);
3138 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3139 ADDR is an expression which yields the store to be destroyed.
3140 AUTO_DELETE is the name of the destructor to call, i.e., either
3141 sfk_complete_destructor, sfk_base_destructor, or
3142 sfk_deleting_destructor.
3144 FLAGS is the logical disjunction of zero or more LOOKUP_
3145 flags. See cp-tree.h for more info. */
3148 build_delete (tree type, tree addr, special_function_kind auto_delete,
3149 int flags, int use_global_delete)
3153 if (addr == error_mark_node)
3154 return error_mark_node;
3156 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3157 set to `error_mark_node' before it gets properly cleaned up. */
3158 if (type == error_mark_node)
3159 return error_mark_node;
3161 type = TYPE_MAIN_VARIANT (type);
3163 addr = mark_rvalue_use (addr);
3165 if (TREE_CODE (type) == POINTER_TYPE)
3167 bool complete_p = true;
3169 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3170 if (TREE_CODE (type) == ARRAY_TYPE)
3173 /* We don't want to warn about delete of void*, only other
3174 incomplete types. Deleting other incomplete types
3175 invokes undefined behavior, but it is not ill-formed, so
3176 compile to something that would even do The Right Thing
3177 (TM) should the type have a trivial dtor and no delete
3179 if (!VOID_TYPE_P (type))
3181 complete_type (type);
3182 if (!COMPLETE_TYPE_P (type))
3184 if (warning (0, "possible problem detected in invocation of "
3185 "delete operator:"))
3187 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3188 inform (input_location, "neither the destructor nor the class-specific "
3189 "operator delete will be called, even if they are "
3190 "declared when the class is defined.");
3195 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3196 /* Call the builtin operator delete. */
3197 return build_builtin_delete_call (addr);
3198 if (TREE_SIDE_EFFECTS (addr))
3199 addr = save_expr (addr);
3201 /* Throw away const and volatile on target type of addr. */
3202 addr = convert_force (build_pointer_type (type), addr, 0);
3204 else if (TREE_CODE (type) == ARRAY_TYPE)
3208 if (TYPE_DOMAIN (type) == NULL_TREE)
3210 error ("unknown array size in delete");
3211 return error_mark_node;
3213 return build_vec_delete (addr, array_type_nelts (type),
3214 auto_delete, use_global_delete);
3218 /* Don't check PROTECT here; leave that decision to the
3219 destructor. If the destructor is accessible, call it,
3220 else report error. */
3221 addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error);
3222 if (TREE_SIDE_EFFECTS (addr))
3223 addr = save_expr (addr);
3225 addr = convert_force (build_pointer_type (type), addr, 0);
3228 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3230 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3232 if (auto_delete != sfk_deleting_destructor)
3233 return void_zero_node;
3235 return build_op_delete_call (DELETE_EXPR, addr,
3236 cxx_sizeof_nowarn (type),
3238 /*placement=*/NULL_TREE,
3239 /*alloc_fn=*/NULL_TREE);
3243 tree head = NULL_TREE;
3244 tree do_delete = NULL_TREE;
3247 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3248 lazily_declare_fn (sfk_destructor, type);
3250 /* For `::delete x', we must not use the deleting destructor
3251 since then we would not be sure to get the global `operator
3253 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3255 /* We will use ADDR multiple times so we must save it. */
3256 addr = save_expr (addr);
3257 head = get_target_expr (build_headof (addr));
3258 /* Delete the object. */
3259 do_delete = build_builtin_delete_call (head);
3260 /* Otherwise, treat this like a complete object destructor
3262 auto_delete = sfk_complete_destructor;
3264 /* If the destructor is non-virtual, there is no deleting
3265 variant. Instead, we must explicitly call the appropriate
3266 `operator delete' here. */
3267 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3268 && auto_delete == sfk_deleting_destructor)
3270 /* We will use ADDR multiple times so we must save it. */
3271 addr = save_expr (addr);
3272 /* Build the call. */
3273 do_delete = build_op_delete_call (DELETE_EXPR,
3275 cxx_sizeof_nowarn (type),
3277 /*placement=*/NULL_TREE,
3278 /*alloc_fn=*/NULL_TREE);
3279 /* Call the complete object destructor. */
3280 auto_delete = sfk_complete_destructor;
3282 else if (auto_delete == sfk_deleting_destructor
3283 && TYPE_GETS_REG_DELETE (type))
3285 /* Make sure we have access to the member op delete, even though
3286 we'll actually be calling it from the destructor. */
3287 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3289 /*placement=*/NULL_TREE,
3290 /*alloc_fn=*/NULL_TREE);
3293 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL,
3294 tf_warning_or_error),
3295 auto_delete, flags);
3297 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3299 /* We need to calculate this before the dtor changes the vptr. */
3301 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3303 if (flags & LOOKUP_DESTRUCTOR)
3304 /* Explicit destructor call; don't check for null pointer. */
3305 ifexp = integer_one_node;
3307 /* Handle deleting a null pointer. */
3308 ifexp = fold (cp_build_binary_op (input_location,
3309 NE_EXPR, addr, integer_zero_node,
3310 tf_warning_or_error));
3312 if (ifexp != integer_one_node)
3313 expr = build3 (COND_EXPR, void_type_node,
3314 ifexp, expr, void_zero_node);
3320 /* At the beginning of a destructor, push cleanups that will call the
3321 destructors for our base classes and members.
3323 Called from begin_destructor_body. */
3326 push_base_cleanups (void)
3328 tree binfo, base_binfo;
3332 VEC(tree,gc) *vbases;
3334 /* Run destructors for all virtual baseclasses. */
3335 if (CLASSTYPE_VBASECLASSES (current_class_type))
3337 tree cond = (condition_conversion
3338 (build2 (BIT_AND_EXPR, integer_type_node,
3339 current_in_charge_parm,
3340 integer_two_node)));
3342 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3343 order, which is also the right order for pushing cleanups. */
3344 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3345 VEC_iterate (tree, vbases, i, base_binfo); i++)
3347 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3349 expr = build_special_member_call (current_class_ref,
3350 base_dtor_identifier,
3354 | LOOKUP_NONVIRTUAL),
3355 tf_warning_or_error);
3356 expr = build3 (COND_EXPR, void_type_node, cond,
3357 expr, void_zero_node);
3358 finish_decl_cleanup (NULL_TREE, expr);
3363 /* Take care of the remaining baseclasses. */
3364 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3365 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3367 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3368 || BINFO_VIRTUAL_P (base_binfo))
3371 expr = build_special_member_call (current_class_ref,
3372 base_dtor_identifier,
3374 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3375 tf_warning_or_error);
3376 finish_decl_cleanup (NULL_TREE, expr);
3379 /* Don't automatically destroy union members. */
3380 if (TREE_CODE (current_class_type) == UNION_TYPE)
3383 for (member = TYPE_FIELDS (current_class_type); member;
3384 member = TREE_CHAIN (member))
3386 tree this_type = TREE_TYPE (member);
3387 if (this_type == error_mark_node
3388 || TREE_CODE (member) != FIELD_DECL
3389 || DECL_ARTIFICIAL (member))
3391 if (ANON_UNION_TYPE_P (this_type))
3393 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type))
3395 tree this_member = (build_class_member_access_expr
3396 (current_class_ref, member,
3397 /*access_path=*/NULL_TREE,
3398 /*preserve_reference=*/false,
3399 tf_warning_or_error));
3400 expr = build_delete (this_type, this_member,
3401 sfk_complete_destructor,
3402 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3404 finish_decl_cleanup (NULL_TREE, expr);
3409 /* Build a C++ vector delete expression.
3410 MAXINDEX is the number of elements to be deleted.
3411 ELT_SIZE is the nominal size of each element in the vector.
3412 BASE is the expression that should yield the store to be deleted.
3413 This function expands (or synthesizes) these calls itself.
3414 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3416 This also calls delete for virtual baseclasses of elements of the vector.
3418 Update: MAXINDEX is no longer needed. The size can be extracted from the
3419 start of the vector for pointers, and from the type for arrays. We still
3420 use MAXINDEX for arrays because it happens to already have one of the
3421 values we'd have to extract. (We could use MAXINDEX with pointers to
3422 confirm the size, and trap if the numbers differ; not clear that it'd
3423 be worth bothering.) */
3426 build_vec_delete (tree base, tree maxindex,
3427 special_function_kind auto_delete_vec, int use_global_delete)
3431 tree base_init = NULL_TREE;
3433 type = TREE_TYPE (base);
3435 if (TREE_CODE (type) == POINTER_TYPE)
3437 /* Step back one from start of vector, and read dimension. */
3439 tree size_ptr_type = build_pointer_type (sizetype);
3441 if (TREE_SIDE_EFFECTS (base))
3443 base_init = get_target_expr (base);
3444 base = TARGET_EXPR_SLOT (base_init);
3446 type = strip_array_types (TREE_TYPE (type));
3447 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR,
3448 sizetype, TYPE_SIZE_UNIT (sizetype));
3449 cookie_addr = build2 (POINTER_PLUS_EXPR,
3451 fold_convert (size_ptr_type, base),
3453 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, tf_warning_or_error);
3455 else if (TREE_CODE (type) == ARRAY_TYPE)
3457 /* Get the total number of things in the array, maxindex is a
3459 maxindex = array_type_nelts_total (type);
3460 type = strip_array_types (type);
3461 base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error);
3462 if (TREE_SIDE_EFFECTS (base))
3464 base_init = get_target_expr (base);
3465 base = TARGET_EXPR_SLOT (base_init);
3470 if (base != error_mark_node)
3471 error ("type to vector delete is neither pointer or array type");
3472 return error_mark_node;
3475 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3478 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);