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
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"
39 static bool begin_init_stmts (tree *, tree *);
40 static tree finish_init_stmts (bool, tree, tree);
41 static void construct_virtual_base (tree, tree);
42 static void expand_aggr_init_1 (tree, tree, tree, tree, int, tsubst_flags_t);
43 static void expand_default_init (tree, tree, tree, tree, int, tsubst_flags_t);
44 static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int);
45 static void perform_member_init (tree, tree);
46 static tree build_builtin_delete_call (tree);
47 static int member_init_ok_or_else (tree, tree, tree);
48 static void expand_virtual_init (tree, tree);
49 static tree sort_mem_initializers (tree, tree);
50 static tree initializing_context (tree);
51 static void expand_cleanup_for_base (tree, tree);
52 static tree get_temp_regvar (tree, tree);
53 static tree dfs_initialize_vtbl_ptrs (tree, void *);
54 static tree build_dtor_call (tree, special_function_kind, int);
55 static tree build_field_list (tree, tree, int *);
56 static tree build_vtbl_address (tree);
58 /* We are about to generate some complex initialization code.
59 Conceptually, it is all a single expression. However, we may want
60 to include conditionals, loops, and other such statement-level
61 constructs. Therefore, we build the initialization code inside a
62 statement-expression. This function starts such an expression.
63 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
64 pass them back to finish_init_stmts when the expression is
68 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
70 bool is_global = !building_stmt_tree ();
72 *stmt_expr_p = begin_stmt_expr ();
73 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
78 /* Finish out the statement-expression begun by the previous call to
79 begin_init_stmts. Returns the statement-expression itself. */
82 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
84 finish_compound_stmt (compound_stmt);
86 stmt_expr = finish_stmt_expr (stmt_expr, true);
88 gcc_assert (!building_stmt_tree () == is_global);
95 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
96 which we want to initialize the vtable pointer for, DATA is
97 TREE_LIST whose TREE_VALUE is the this ptr expression. */
100 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
102 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
103 return dfs_skip_bases;
105 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
107 tree base_ptr = TREE_VALUE ((tree) data);
109 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
111 expand_virtual_init (binfo, base_ptr);
117 /* Initialize all the vtable pointers in the object pointed to by
121 initialize_vtbl_ptrs (tree addr)
126 type = TREE_TYPE (TREE_TYPE (addr));
127 list = build_tree_list (type, addr);
129 /* Walk through the hierarchy, initializing the vptr in each base
130 class. We do these in pre-order because we can't find the virtual
131 bases for a class until we've initialized the vtbl for that
133 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list);
136 /* Return an expression for the zero-initialization of an object with
137 type T. This expression will either be a constant (in the case
138 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
139 aggregate), or NULL (in the case that T does not require
140 initialization). In either case, the value can be used as
141 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
142 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
143 is the number of elements in the array. If STATIC_STORAGE_P is
144 TRUE, initializers are only generated for entities for which
145 zero-initialization does not simply mean filling the storage with
149 build_zero_init (tree type, tree nelts, bool static_storage_p)
151 tree init = NULL_TREE;
155 To zero-initialize an object of type T means:
157 -- if T is a scalar type, the storage is set to the value of zero
160 -- if T is a non-union class type, the storage for each nonstatic
161 data member and each base-class subobject is zero-initialized.
163 -- if T is a union type, the storage for its first data member is
166 -- if T is an array type, the storage for each element is
169 -- if T is a reference type, no initialization is performed. */
171 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST);
173 if (type == error_mark_node)
175 else if (static_storage_p && zero_init_p (type))
176 /* In order to save space, we do not explicitly build initializers
177 for items that do not need them. GCC's semantics are that
178 items with static storage duration that are not otherwise
179 initialized are initialized to zero. */
181 else if (SCALAR_TYPE_P (type))
182 init = convert (type, integer_zero_node);
183 else if (CLASS_TYPE_P (type))
186 VEC(constructor_elt,gc) *v = NULL;
188 /* Iterate over the fields, building initializations. */
189 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
191 if (TREE_CODE (field) != FIELD_DECL)
194 /* Note that for class types there will be FIELD_DECLs
195 corresponding to base classes as well. Thus, iterating
196 over TYPE_FIELDs will result in correct initialization of
197 all of the subobjects. */
198 if (!static_storage_p || !zero_init_p (TREE_TYPE (field)))
200 tree value = build_zero_init (TREE_TYPE (field),
204 CONSTRUCTOR_APPEND_ELT(v, field, value);
207 /* For unions, only the first field is initialized. */
208 if (TREE_CODE (type) == UNION_TYPE)
212 /* Build a constructor to contain the initializations. */
213 init = build_constructor (type, v);
215 else if (TREE_CODE (type) == ARRAY_TYPE)
218 VEC(constructor_elt,gc) *v = NULL;
220 /* Iterate over the array elements, building initializations. */
222 max_index = fold_build2 (MINUS_EXPR, TREE_TYPE (nelts),
223 nelts, integer_one_node);
225 max_index = array_type_nelts (type);
227 /* If we have an error_mark here, we should just return error mark
228 as we don't know the size of the array yet. */
229 if (max_index == error_mark_node)
230 return error_mark_node;
231 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
233 /* A zero-sized array, which is accepted as an extension, will
234 have an upper bound of -1. */
235 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
239 v = VEC_alloc (constructor_elt, gc, 1);
240 ce = VEC_quick_push (constructor_elt, v, NULL);
242 /* If this is a one element array, we just use a regular init. */
243 if (tree_int_cst_equal (size_zero_node, max_index))
244 ce->index = size_zero_node;
246 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
249 ce->value = build_zero_init (TREE_TYPE (type),
254 /* Build a constructor to contain the initializations. */
255 init = build_constructor (type, v);
257 else if (TREE_CODE (type) == VECTOR_TYPE)
258 init = fold_convert (type, integer_zero_node);
260 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
262 /* In all cases, the initializer is a constant. */
264 TREE_CONSTANT (init) = 1;
269 /* Build an expression for the default-initialization of an object of
270 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
271 ARRAY_TYPE, NELTS is the number of elements in the array. If
272 initialization of TYPE requires calling constructors, this function
273 returns NULL_TREE; the caller is responsible for arranging for the
274 constructors to be called. */
277 build_default_init (tree type, tree nelts)
281 To default-initialize an object of type T means:
283 --if T is a non-POD class type (clause _class_), the default construc-
284 tor for T is called (and the initialization is ill-formed if T has
285 no accessible default constructor);
287 --if T is an array type, each element is default-initialized;
289 --otherwise, the storage for the object is zero-initialized.
291 A program that calls for default-initialization of an entity of refer-
292 ence type is ill-formed. */
294 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
295 performing the initialization. This is confusing in that some
296 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
297 a class with a pointer-to-data member as a non-static data member
298 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
299 passing non-PODs to build_zero_init below, which is contrary to
300 the semantics quoted above from [dcl.init].
302 It happens, however, that the behavior of the constructor the
303 standard says we should have generated would be precisely the
304 same as that obtained by calling build_zero_init below, so things
306 if (TYPE_NEEDS_CONSTRUCTING (type)
307 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
310 /* At this point, TYPE is either a POD class type, an array of POD
311 classes, or something even more innocuous. */
312 return build_zero_init (type, nelts, /*static_storage_p=*/false);
315 /* Return a suitable initializer for value-initializing an object of type
316 TYPE, as described in [dcl.init]. If HAVE_CTOR is true, the initializer
317 for an enclosing object is already calling the constructor for this
321 build_value_init_1 (tree type, bool have_ctor)
325 To value-initialize an object of type T means:
327 - if T is a class type (clause 9) with a user-provided constructor
328 (12.1), then the default constructor for T is called (and the
329 initialization is ill-formed if T has no accessible default
332 - if T is a non-union class type without a user-provided constructor,
333 then every non-static data member and base-class component of T is
334 value-initialized;92)
336 - if T is an array type, then each element is value-initialized;
338 - otherwise, the object is zero-initialized.
340 A program that calls for default-initialization or
341 value-initialization of an entity of reference type is ill-formed.
343 92) Value-initialization for such a class object may be implemented by
344 zero-initializing the object and then calling the default
347 if (CLASS_TYPE_P (type))
349 if (type_has_user_provided_constructor (type) && !have_ctor)
350 return build_aggr_init_expr
352 build_special_member_call (NULL_TREE, complete_ctor_identifier,
353 NULL_TREE, type, LOOKUP_NORMAL,
354 tf_warning_or_error));
355 else if (TREE_CODE (type) != UNION_TYPE)
358 VEC(constructor_elt,gc) *v = NULL;
359 bool call_ctor = !have_ctor && TYPE_NEEDS_CONSTRUCTING (type);
361 /* Iterate over the fields, building initializations. */
362 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
366 if (TREE_CODE (field) != FIELD_DECL)
369 ftype = TREE_TYPE (field);
371 if (TREE_CODE (ftype) == REFERENCE_TYPE)
372 error ("value-initialization of reference");
374 /* We could skip vfields and fields of types with
375 user-defined constructors, but I think that won't improve
376 performance at all; it should be simpler in general just
377 to zero out the entire object than try to only zero the
378 bits that actually need it. */
380 /* Note that for class types there will be FIELD_DECLs
381 corresponding to base classes as well. Thus, iterating
382 over TYPE_FIELDs will result in correct initialization of
383 all of the subobjects. */
384 value = build_value_init_1 (ftype, have_ctor || call_ctor);
387 CONSTRUCTOR_APPEND_ELT(v, field, value);
390 /* Build a constructor to contain the zero- initializations. */
391 init = build_constructor (type, v);
394 /* This is a class that needs constructing, but doesn't have
395 a user-defined constructor. So we need to zero-initialize
396 the object and then call the implicitly defined ctor.
397 Implement this by sticking the zero-initialization inside
398 the TARGET_EXPR for the constructor call;
399 cp_gimplify_init_expr will know how to handle it. */
400 tree ctor = build_special_member_call
401 (NULL_TREE, complete_ctor_identifier,
402 NULL_TREE, type, LOOKUP_NORMAL, tf_warning_or_error);
404 ctor = build_cplus_new (type, ctor);
405 init = build2 (INIT_EXPR, void_type_node,
406 TARGET_EXPR_SLOT (ctor), init);
407 init = build2 (COMPOUND_EXPR, void_type_node, init,
408 TARGET_EXPR_INITIAL (ctor));
409 TARGET_EXPR_INITIAL (ctor) = init;
415 else if (TREE_CODE (type) == ARRAY_TYPE)
417 VEC(constructor_elt,gc) *v = NULL;
419 /* Iterate over the array elements, building initializations. */
420 tree max_index = array_type_nelts (type);
422 /* If we have an error_mark here, we should just return error mark
423 as we don't know the size of the array yet. */
424 if (max_index == error_mark_node)
425 return error_mark_node;
426 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
428 /* A zero-sized array, which is accepted as an extension, will
429 have an upper bound of -1. */
430 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
434 v = VEC_alloc (constructor_elt, gc, 1);
435 ce = VEC_quick_push (constructor_elt, v, NULL);
437 /* If this is a one element array, we just use a regular init. */
438 if (tree_int_cst_equal (size_zero_node, max_index))
439 ce->index = size_zero_node;
441 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
444 ce->value = build_value_init_1 (TREE_TYPE (type), have_ctor);
447 /* Build a constructor to contain the initializations. */
448 return build_constructor (type, v);
451 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
454 /* Return a suitable initializer for value-initializing an object of type
455 TYPE, as described in [dcl.init]. */
458 build_value_init (tree type)
460 return build_value_init_1 (type, false);
463 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
464 arguments. If TREE_LIST is void_type_node, an empty initializer
465 list was given; if NULL_TREE no initializer was given. */
468 perform_member_init (tree member, tree init)
471 tree type = TREE_TYPE (member);
474 is_explicit = (init != NULL_TREE);
476 /* Effective C++ rule 12 requires that all data members be
478 if (warn_ecpp && !is_explicit && TREE_CODE (type) != ARRAY_TYPE)
479 warning (OPT_Weffc__, "%J%qD should be initialized in the member initialization "
480 "list", current_function_decl, member);
482 if (init == void_type_node)
485 /* Get an lvalue for the data member. */
486 decl = build_class_member_access_expr (current_class_ref, member,
487 /*access_path=*/NULL_TREE,
488 /*preserve_reference=*/true,
489 tf_warning_or_error);
490 if (decl == error_mark_node)
493 /* Deal with this here, as we will get confused if we try to call the
494 assignment op for an anonymous union. This can happen in a
495 synthesized copy constructor. */
496 if (ANON_AGGR_TYPE_P (type))
500 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
501 finish_expr_stmt (init);
504 else if (TYPE_NEEDS_CONSTRUCTING (type))
507 && TREE_CODE (type) == ARRAY_TYPE
509 && TREE_CHAIN (init) == NULL_TREE
510 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
512 /* Initialization of one array from another. */
513 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
514 /*explicit_value_init_p=*/false,
516 tf_warning_or_error));
520 if (CP_TYPE_CONST_P (type)
522 && !type_has_user_provided_default_constructor (type))
523 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
524 vtable; still give this diagnostic. */
525 permerror ("%Juninitialized member %qD with %<const%> type %qT",
526 current_function_decl, member, type);
527 finish_expr_stmt (build_aggr_init (decl, init, 0,
528 tf_warning_or_error));
533 if (init == NULL_TREE)
537 init = build_default_init (type, /*nelts=*/NULL_TREE);
538 if (TREE_CODE (type) == REFERENCE_TYPE)
539 warning (0, "%Jdefault-initialization of %q#D, "
540 "which has reference type",
541 current_function_decl, member);
543 /* member traversal: note it leaves init NULL */
544 else if (TREE_CODE (type) == REFERENCE_TYPE)
545 permerror ("%Juninitialized reference member %qD",
546 current_function_decl, member);
547 else if (CP_TYPE_CONST_P (type))
548 permerror ("%Juninitialized member %qD with %<const%> type %qT",
549 current_function_decl, member, type);
551 else if (TREE_CODE (init) == TREE_LIST)
552 /* There was an explicit member initialization. Do some work
554 init = build_x_compound_expr_from_list (init, "member initializer");
557 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
558 tf_warning_or_error));
561 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
565 expr = build_class_member_access_expr (current_class_ref, member,
566 /*access_path=*/NULL_TREE,
567 /*preserve_reference=*/false,
568 tf_warning_or_error);
569 expr = build_delete (type, expr, sfk_complete_destructor,
570 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
572 if (expr != error_mark_node)
573 finish_eh_cleanup (expr);
577 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
578 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
581 build_field_list (tree t, tree list, int *uses_unions_p)
587 /* Note whether or not T is a union. */
588 if (TREE_CODE (t) == UNION_TYPE)
591 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
593 /* Skip CONST_DECLs for enumeration constants and so forth. */
594 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
597 /* Keep track of whether or not any fields are unions. */
598 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
601 /* For an anonymous struct or union, we must recursively
602 consider the fields of the anonymous type. They can be
603 directly initialized from the constructor. */
604 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
606 /* Add this field itself. Synthesized copy constructors
607 initialize the entire aggregate. */
608 list = tree_cons (fields, NULL_TREE, list);
609 /* And now add the fields in the anonymous aggregate. */
610 list = build_field_list (TREE_TYPE (fields), list,
613 /* Add this field. */
614 else if (DECL_NAME (fields))
615 list = tree_cons (fields, NULL_TREE, list);
621 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
622 a FIELD_DECL or BINFO in T that needs initialization. The
623 TREE_VALUE gives the initializer, or list of initializer arguments.
625 Return a TREE_LIST containing all of the initializations required
626 for T, in the order in which they should be performed. The output
627 list has the same format as the input. */
630 sort_mem_initializers (tree t, tree mem_inits)
633 tree base, binfo, base_binfo;
636 VEC(tree,gc) *vbases;
640 /* Build up a list of initializations. The TREE_PURPOSE of entry
641 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
642 TREE_VALUE will be the constructor arguments, or NULL if no
643 explicit initialization was provided. */
644 sorted_inits = NULL_TREE;
646 /* Process the virtual bases. */
647 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
648 VEC_iterate (tree, vbases, i, base); i++)
649 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
651 /* Process the direct bases. */
652 for (binfo = TYPE_BINFO (t), i = 0;
653 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
654 if (!BINFO_VIRTUAL_P (base_binfo))
655 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
657 /* Process the non-static data members. */
658 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
659 /* Reverse the entire list of initializations, so that they are in
660 the order that they will actually be performed. */
661 sorted_inits = nreverse (sorted_inits);
663 /* If the user presented the initializers in an order different from
664 that in which they will actually occur, we issue a warning. Keep
665 track of the next subobject which can be explicitly initialized
666 without issuing a warning. */
667 next_subobject = sorted_inits;
669 /* Go through the explicit initializers, filling in TREE_PURPOSE in
671 for (init = mem_inits; init; init = TREE_CHAIN (init))
676 subobject = TREE_PURPOSE (init);
678 /* If the explicit initializers are in sorted order, then
679 SUBOBJECT will be NEXT_SUBOBJECT, or something following
681 for (subobject_init = next_subobject;
683 subobject_init = TREE_CHAIN (subobject_init))
684 if (TREE_PURPOSE (subobject_init) == subobject)
687 /* Issue a warning if the explicit initializer order does not
688 match that which will actually occur.
689 ??? Are all these on the correct lines? */
690 if (warn_reorder && !subobject_init)
692 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
693 warning (OPT_Wreorder, "%q+D will be initialized after",
694 TREE_PURPOSE (next_subobject));
696 warning (OPT_Wreorder, "base %qT will be initialized after",
697 TREE_PURPOSE (next_subobject));
698 if (TREE_CODE (subobject) == FIELD_DECL)
699 warning (OPT_Wreorder, " %q+#D", subobject);
701 warning (OPT_Wreorder, " base %qT", subobject);
702 warning (OPT_Wreorder, "%J when initialized here", current_function_decl);
705 /* Look again, from the beginning of the list. */
708 subobject_init = sorted_inits;
709 while (TREE_PURPOSE (subobject_init) != subobject)
710 subobject_init = TREE_CHAIN (subobject_init);
713 /* It is invalid to initialize the same subobject more than
715 if (TREE_VALUE (subobject_init))
717 if (TREE_CODE (subobject) == FIELD_DECL)
718 error ("%Jmultiple initializations given for %qD",
719 current_function_decl, subobject);
721 error ("%Jmultiple initializations given for base %qT",
722 current_function_decl, subobject);
725 /* Record the initialization. */
726 TREE_VALUE (subobject_init) = TREE_VALUE (init);
727 next_subobject = subobject_init;
732 If a ctor-initializer specifies more than one mem-initializer for
733 multiple members of the same union (including members of
734 anonymous unions), the ctor-initializer is ill-formed. */
737 tree last_field = NULL_TREE;
738 for (init = sorted_inits; init; init = TREE_CHAIN (init))
744 /* Skip uninitialized members and base classes. */
745 if (!TREE_VALUE (init)
746 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
748 /* See if this field is a member of a union, or a member of a
749 structure contained in a union, etc. */
750 field = TREE_PURPOSE (init);
751 for (field_type = DECL_CONTEXT (field);
752 !same_type_p (field_type, t);
753 field_type = TYPE_CONTEXT (field_type))
754 if (TREE_CODE (field_type) == UNION_TYPE)
756 /* If this field is not a member of a union, skip it. */
757 if (TREE_CODE (field_type) != UNION_TYPE)
760 /* It's only an error if we have two initializers for the same
768 /* See if LAST_FIELD and the field initialized by INIT are
769 members of the same union. If so, there's a problem,
770 unless they're actually members of the same structure
771 which is itself a member of a union. For example, given:
773 union { struct { int i; int j; }; };
775 initializing both `i' and `j' makes sense. */
776 field_type = DECL_CONTEXT (field);
780 tree last_field_type;
782 last_field_type = DECL_CONTEXT (last_field);
785 if (same_type_p (last_field_type, field_type))
787 if (TREE_CODE (field_type) == UNION_TYPE)
788 error ("%Jinitializations for multiple members of %qT",
789 current_function_decl, last_field_type);
794 if (same_type_p (last_field_type, t))
797 last_field_type = TYPE_CONTEXT (last_field_type);
800 /* If we've reached the outermost class, then we're
802 if (same_type_p (field_type, t))
805 field_type = TYPE_CONTEXT (field_type);
816 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
817 is a TREE_LIST giving the explicit mem-initializer-list for the
818 constructor. The TREE_PURPOSE of each entry is a subobject (a
819 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
820 is a TREE_LIST giving the arguments to the constructor or
821 void_type_node for an empty list of arguments. */
824 emit_mem_initializers (tree mem_inits)
826 /* We will already have issued an error message about the fact that
827 the type is incomplete. */
828 if (!COMPLETE_TYPE_P (current_class_type))
831 /* Sort the mem-initializers into the order in which the
832 initializations should be performed. */
833 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
835 in_base_initializer = 1;
837 /* Initialize base classes. */
839 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
841 tree subobject = TREE_PURPOSE (mem_inits);
842 tree arguments = TREE_VALUE (mem_inits);
844 /* If these initializations are taking place in a copy constructor,
845 the base class should probably be explicitly initialized if there
846 is a user-defined constructor in the base class (other than the
847 default constructor, which will be called anyway). */
848 if (extra_warnings && !arguments
849 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
850 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
851 warning (OPT_Wextra, "%Jbase class %q#T should be explicitly initialized in the "
853 current_function_decl, BINFO_TYPE (subobject));
855 /* If an explicit -- but empty -- initializer list was present,
856 treat it just like default initialization at this point. */
857 if (arguments == void_type_node)
858 arguments = NULL_TREE;
860 /* Initialize the base. */
861 if (BINFO_VIRTUAL_P (subobject))
862 construct_virtual_base (subobject, arguments);
867 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
869 expand_aggr_init_1 (subobject, NULL_TREE,
870 cp_build_indirect_ref (base_addr, NULL,
871 tf_warning_or_error),
874 tf_warning_or_error);
875 expand_cleanup_for_base (subobject, NULL_TREE);
878 mem_inits = TREE_CHAIN (mem_inits);
880 in_base_initializer = 0;
882 /* Initialize the vptrs. */
883 initialize_vtbl_ptrs (current_class_ptr);
885 /* Initialize the data members. */
888 perform_member_init (TREE_PURPOSE (mem_inits),
889 TREE_VALUE (mem_inits));
890 mem_inits = TREE_CHAIN (mem_inits);
894 /* Returns the address of the vtable (i.e., the value that should be
895 assigned to the vptr) for BINFO. */
898 build_vtbl_address (tree binfo)
900 tree binfo_for = binfo;
903 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
904 /* If this is a virtual primary base, then the vtable we want to store
905 is that for the base this is being used as the primary base of. We
906 can't simply skip the initialization, because we may be expanding the
907 inits of a subobject constructor where the virtual base layout
909 while (BINFO_PRIMARY_P (binfo_for))
910 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
912 /* Figure out what vtable BINFO's vtable is based on, and mark it as
914 vtbl = get_vtbl_decl_for_binfo (binfo_for);
915 assemble_external (vtbl);
916 TREE_USED (vtbl) = 1;
918 /* Now compute the address to use when initializing the vptr. */
919 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
920 if (TREE_CODE (vtbl) == VAR_DECL)
921 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
926 /* This code sets up the virtual function tables appropriate for
927 the pointer DECL. It is a one-ply initialization.
929 BINFO is the exact type that DECL is supposed to be. In
930 multiple inheritance, this might mean "C's A" if C : A, B. */
933 expand_virtual_init (tree binfo, tree decl)
938 /* Compute the initializer for vptr. */
939 vtbl = build_vtbl_address (binfo);
941 /* We may get this vptr from a VTT, if this is a subobject
942 constructor or subobject destructor. */
943 vtt_index = BINFO_VPTR_INDEX (binfo);
949 /* Compute the value to use, when there's a VTT. */
950 vtt_parm = current_vtt_parm;
951 vtbl2 = build2 (POINTER_PLUS_EXPR,
952 TREE_TYPE (vtt_parm),
955 vtbl2 = cp_build_indirect_ref (vtbl2, NULL, tf_warning_or_error);
956 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
958 /* The actual initializer is the VTT value only in the subobject
959 constructor. In maybe_clone_body we'll substitute NULL for
960 the vtt_parm in the case of the non-subobject constructor. */
961 vtbl = build3 (COND_EXPR,
963 build2 (EQ_EXPR, boolean_type_node,
964 current_in_charge_parm, integer_zero_node),
969 /* Compute the location of the vtpr. */
970 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, NULL,
971 tf_warning_or_error),
973 gcc_assert (vtbl_ptr != error_mark_node);
975 /* Assign the vtable to the vptr. */
976 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
977 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
978 tf_warning_or_error));
981 /* If an exception is thrown in a constructor, those base classes already
982 constructed must be destroyed. This function creates the cleanup
983 for BINFO, which has just been constructed. If FLAG is non-NULL,
984 it is a DECL which is nonzero when this base needs to be
988 expand_cleanup_for_base (tree binfo, tree flag)
992 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
995 /* Call the destructor. */
996 expr = build_special_member_call (current_class_ref,
997 base_dtor_identifier,
1000 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
1001 tf_warning_or_error);
1003 expr = fold_build3 (COND_EXPR, void_type_node,
1004 c_common_truthvalue_conversion (flag),
1005 expr, integer_zero_node);
1007 finish_eh_cleanup (expr);
1010 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1014 construct_virtual_base (tree vbase, tree arguments)
1020 /* If there are virtual base classes with destructors, we need to
1021 emit cleanups to destroy them if an exception is thrown during
1022 the construction process. These exception regions (i.e., the
1023 period during which the cleanups must occur) begin from the time
1024 the construction is complete to the end of the function. If we
1025 create a conditional block in which to initialize the
1026 base-classes, then the cleanup region for the virtual base begins
1027 inside a block, and ends outside of that block. This situation
1028 confuses the sjlj exception-handling code. Therefore, we do not
1029 create a single conditional block, but one for each
1030 initialization. (That way the cleanup regions always begin
1031 in the outer block.) We trust the back end to figure out
1032 that the FLAG will not change across initializations, and
1033 avoid doing multiple tests. */
1034 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
1035 inner_if_stmt = begin_if_stmt ();
1036 finish_if_stmt_cond (flag, inner_if_stmt);
1038 /* Compute the location of the virtual base. If we're
1039 constructing virtual bases, then we must be the most derived
1040 class. Therefore, we don't have to look up the virtual base;
1041 we already know where it is. */
1042 exp = convert_to_base_statically (current_class_ref, vbase);
1044 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1045 LOOKUP_COMPLAIN, tf_warning_or_error);
1046 finish_then_clause (inner_if_stmt);
1047 finish_if_stmt (inner_if_stmt);
1049 expand_cleanup_for_base (vbase, flag);
1052 /* Find the context in which this FIELD can be initialized. */
1055 initializing_context (tree field)
1057 tree t = DECL_CONTEXT (field);
1059 /* Anonymous union members can be initialized in the first enclosing
1060 non-anonymous union context. */
1061 while (t && ANON_AGGR_TYPE_P (t))
1062 t = TYPE_CONTEXT (t);
1066 /* Function to give error message if member initialization specification
1067 is erroneous. FIELD is the member we decided to initialize.
1068 TYPE is the type for which the initialization is being performed.
1069 FIELD must be a member of TYPE.
1071 MEMBER_NAME is the name of the member. */
1074 member_init_ok_or_else (tree field, tree type, tree member_name)
1076 if (field == error_mark_node)
1080 error ("class %qT does not have any field named %qD", type,
1084 if (TREE_CODE (field) == VAR_DECL)
1086 error ("%q#D is a static data member; it can only be "
1087 "initialized at its definition",
1091 if (TREE_CODE (field) != FIELD_DECL)
1093 error ("%q#D is not a non-static data member of %qT",
1097 if (initializing_context (field) != type)
1099 error ("class %qT does not have any field named %qD", type,
1107 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1108 is a _TYPE node or TYPE_DECL which names a base for that type.
1109 Check the validity of NAME, and return either the base _TYPE, base
1110 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1111 NULL_TREE and issue a diagnostic.
1113 An old style unnamed direct single base construction is permitted,
1114 where NAME is NULL. */
1117 expand_member_init (tree name)
1122 if (!current_class_ref)
1127 /* This is an obsolete unnamed base class initializer. The
1128 parser will already have warned about its use. */
1129 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1132 error ("unnamed initializer for %qT, which has no base classes",
1133 current_class_type);
1136 basetype = BINFO_TYPE
1137 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1140 error ("unnamed initializer for %qT, which uses multiple inheritance",
1141 current_class_type);
1145 else if (TYPE_P (name))
1147 basetype = TYPE_MAIN_VARIANT (name);
1148 name = TYPE_NAME (name);
1150 else if (TREE_CODE (name) == TYPE_DECL)
1151 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1153 basetype = NULL_TREE;
1162 if (current_template_parms)
1165 class_binfo = TYPE_BINFO (current_class_type);
1166 direct_binfo = NULL_TREE;
1167 virtual_binfo = NULL_TREE;
1169 /* Look for a direct base. */
1170 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1171 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1174 /* Look for a virtual base -- unless the direct base is itself
1176 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1177 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1179 /* [class.base.init]
1181 If a mem-initializer-id is ambiguous because it designates
1182 both a direct non-virtual base class and an inherited virtual
1183 base class, the mem-initializer is ill-formed. */
1184 if (direct_binfo && virtual_binfo)
1186 error ("%qD is both a direct base and an indirect virtual base",
1191 if (!direct_binfo && !virtual_binfo)
1193 if (CLASSTYPE_VBASECLASSES (current_class_type))
1194 error ("type %qT is not a direct or virtual base of %qT",
1195 basetype, current_class_type);
1197 error ("type %qT is not a direct base of %qT",
1198 basetype, current_class_type);
1202 return direct_binfo ? direct_binfo : virtual_binfo;
1206 if (TREE_CODE (name) == IDENTIFIER_NODE)
1207 field = lookup_field (current_class_type, name, 1, false);
1211 if (member_init_ok_or_else (field, current_class_type, name))
1218 /* This is like `expand_member_init', only it stores one aggregate
1221 INIT comes in two flavors: it is either a value which
1222 is to be stored in EXP, or it is a parameter list
1223 to go to a constructor, which will operate on EXP.
1224 If INIT is not a parameter list for a constructor, then set
1225 LOOKUP_ONLYCONVERTING.
1226 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1227 the initializer, if FLAGS is 0, then it is the (init) form.
1228 If `init' is a CONSTRUCTOR, then we emit a warning message,
1229 explaining that such initializations are invalid.
1231 If INIT resolves to a CALL_EXPR which happens to return
1232 something of the type we are looking for, then we know
1233 that we can safely use that call to perform the
1236 The virtual function table pointer cannot be set up here, because
1237 we do not really know its type.
1239 This never calls operator=().
1241 When initializing, nothing is CONST.
1243 A default copy constructor may have to be used to perform the
1246 A constructor or a conversion operator may have to be used to
1247 perform the initialization, but not both, as it would be ambiguous. */
1250 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1255 tree type = TREE_TYPE (exp);
1256 int was_const = TREE_READONLY (exp);
1257 int was_volatile = TREE_THIS_VOLATILE (exp);
1260 if (init == error_mark_node)
1261 return error_mark_node;
1263 TREE_READONLY (exp) = 0;
1264 TREE_THIS_VOLATILE (exp) = 0;
1266 if (init && TREE_CODE (init) != TREE_LIST)
1267 flags |= LOOKUP_ONLYCONVERTING;
1269 if (TREE_CODE (type) == ARRAY_TYPE)
1273 /* An array may not be initialized use the parenthesized
1274 initialization form -- unless the initializer is "()". */
1275 if (init && TREE_CODE (init) == TREE_LIST)
1277 if (complain & tf_error)
1278 error ("bad array initializer");
1279 return error_mark_node;
1281 /* Must arrange to initialize each element of EXP
1282 from elements of INIT. */
1283 itype = init ? TREE_TYPE (init) : NULL_TREE;
1284 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1285 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1286 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1287 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1288 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1289 /*explicit_value_init_p=*/false,
1290 itype && same_type_p (itype,
1293 TREE_READONLY (exp) = was_const;
1294 TREE_THIS_VOLATILE (exp) = was_volatile;
1295 TREE_TYPE (exp) = type;
1297 TREE_TYPE (init) = itype;
1301 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1302 /* Just know that we've seen something for this node. */
1303 TREE_USED (exp) = 1;
1305 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1306 destroy_temps = stmts_are_full_exprs_p ();
1307 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1308 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1309 init, LOOKUP_NORMAL|flags, complain);
1310 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1311 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1312 TREE_READONLY (exp) = was_const;
1313 TREE_THIS_VOLATILE (exp) = was_volatile;
1319 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1320 tsubst_flags_t complain)
1322 tree type = TREE_TYPE (exp);
1325 /* It fails because there may not be a constructor which takes
1326 its own type as the first (or only parameter), but which does
1327 take other types via a conversion. So, if the thing initializing
1328 the expression is a unit element of type X, first try X(X&),
1329 followed by initialization by X. If neither of these work
1330 out, then look hard. */
1334 if (init && TREE_CODE (init) != TREE_LIST
1335 && (flags & LOOKUP_ONLYCONVERTING))
1337 /* Base subobjects should only get direct-initialization. */
1338 gcc_assert (true_exp == exp);
1340 if (flags & DIRECT_BIND)
1341 /* Do nothing. We hit this in two cases: Reference initialization,
1342 where we aren't initializing a real variable, so we don't want
1343 to run a new constructor; and catching an exception, where we
1344 have already built up the constructor call so we could wrap it
1345 in an exception region. */;
1346 else if (BRACE_ENCLOSED_INITIALIZER_P (init)
1347 && CP_AGGREGATE_TYPE_P (type))
1349 /* A brace-enclosed initializer for an aggregate. */
1350 init = digest_init (type, init);
1353 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1355 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1356 /* We need to protect the initialization of a catch parm with a
1357 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1358 around the TARGET_EXPR for the copy constructor. See
1359 initialize_handler_parm. */
1361 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1362 TREE_OPERAND (init, 0));
1363 TREE_TYPE (init) = void_type_node;
1366 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1367 TREE_SIDE_EFFECTS (init) = 1;
1368 finish_expr_stmt (init);
1372 if (init == NULL_TREE
1373 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1377 init = TREE_VALUE (parms);
1380 parms = build_tree_list (NULL_TREE, init);
1382 if (true_exp == exp)
1383 ctor_name = complete_ctor_identifier;
1385 ctor_name = base_ctor_identifier;
1387 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags,
1389 if (TREE_SIDE_EFFECTS (rval))
1390 finish_expr_stmt (convert_to_void (rval, NULL, complain));
1393 /* This function is responsible for initializing EXP with INIT
1396 BINFO is the binfo of the type for who we are performing the
1397 initialization. For example, if W is a virtual base class of A and B,
1399 If we are initializing B, then W must contain B's W vtable, whereas
1400 were we initializing C, W must contain C's W vtable.
1402 TRUE_EXP is nonzero if it is the true expression being initialized.
1403 In this case, it may be EXP, or may just contain EXP. The reason we
1404 need this is because if EXP is a base element of TRUE_EXP, we
1405 don't necessarily know by looking at EXP where its virtual
1406 baseclass fields should really be pointing. But we do know
1407 from TRUE_EXP. In constructors, we don't know anything about
1408 the value being initialized.
1410 FLAGS is just passed to `build_new_method_call'. See that function
1411 for its description. */
1414 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1415 tsubst_flags_t complain)
1417 tree type = TREE_TYPE (exp);
1419 gcc_assert (init != error_mark_node && type != error_mark_node);
1420 gcc_assert (building_stmt_tree ());
1422 /* Use a function returning the desired type to initialize EXP for us.
1423 If the function is a constructor, and its first argument is
1424 NULL_TREE, know that it was meant for us--just slide exp on
1425 in and expand the constructor. Constructors now come
1428 if (init && TREE_CODE (exp) == VAR_DECL
1429 && COMPOUND_LITERAL_P (init))
1431 /* If store_init_value returns NULL_TREE, the INIT has been
1432 recorded as the DECL_INITIAL for EXP. That means there's
1433 nothing more we have to do. */
1434 init = store_init_value (exp, init);
1436 finish_expr_stmt (init);
1440 /* We know that expand_default_init can handle everything we want
1442 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1445 /* Report an error if TYPE is not a user-defined, class type. If
1446 OR_ELSE is nonzero, give an error message. */
1449 is_class_type (tree type, int or_else)
1451 if (type == error_mark_node)
1454 if (! CLASS_TYPE_P (type))
1457 error ("%qT is not a class type", type);
1464 get_type_value (tree name)
1466 if (name == error_mark_node)
1469 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1470 return IDENTIFIER_TYPE_VALUE (name);
1475 /* Build a reference to a member of an aggregate. This is not a C++
1476 `&', but really something which can have its address taken, and
1477 then act as a pointer to member, for example TYPE :: FIELD can have
1478 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1479 this expression is the operand of "&".
1481 @@ Prints out lousy diagnostics for operator <typename>
1484 @@ This function should be rewritten and placed in search.c. */
1487 build_offset_ref (tree type, tree member, bool address_p)
1490 tree basebinfo = NULL_TREE;
1492 /* class templates can come in as TEMPLATE_DECLs here. */
1493 if (TREE_CODE (member) == TEMPLATE_DECL)
1496 if (dependent_type_p (type) || type_dependent_expression_p (member))
1497 return build_qualified_name (NULL_TREE, type, member,
1498 /*template_p=*/false);
1500 gcc_assert (TYPE_P (type));
1501 if (! is_class_type (type, 1))
1502 return error_mark_node;
1504 gcc_assert (DECL_P (member) || BASELINK_P (member));
1505 /* Callers should call mark_used before this point. */
1506 gcc_assert (!DECL_P (member) || TREE_USED (member));
1508 if (!COMPLETE_TYPE_P (complete_type (type))
1509 && !TYPE_BEING_DEFINED (type))
1511 error ("incomplete type %qT does not have member %qD", type, member);
1512 return error_mark_node;
1515 /* Entities other than non-static members need no further
1517 if (TREE_CODE (member) == TYPE_DECL)
1519 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1520 return convert_from_reference (member);
1522 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1524 error ("invalid pointer to bit-field %qD", member);
1525 return error_mark_node;
1528 /* Set up BASEBINFO for member lookup. */
1529 decl = maybe_dummy_object (type, &basebinfo);
1531 /* A lot of this logic is now handled in lookup_member. */
1532 if (BASELINK_P (member))
1534 /* Go from the TREE_BASELINK to the member function info. */
1535 tree t = BASELINK_FUNCTIONS (member);
1537 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1539 /* Get rid of a potential OVERLOAD around it. */
1540 t = OVL_CURRENT (t);
1542 /* Unique functions are handled easily. */
1544 /* For non-static member of base class, we need a special rule
1545 for access checking [class.protected]:
1547 If the access is to form a pointer to member, the
1548 nested-name-specifier shall name the derived class
1549 (or any class derived from that class). */
1550 if (address_p && DECL_P (t)
1551 && DECL_NONSTATIC_MEMBER_P (t))
1552 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1554 perform_or_defer_access_check (basebinfo, t, t);
1556 if (DECL_STATIC_FUNCTION_P (t))
1561 TREE_TYPE (member) = unknown_type_node;
1563 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1564 /* We need additional test besides the one in
1565 check_accessibility_of_qualified_id in case it is
1566 a pointer to non-static member. */
1567 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1571 /* If MEMBER is non-static, then the program has fallen afoul of
1574 An id-expression that denotes a nonstatic data member or
1575 nonstatic member function of a class can only be used:
1577 -- as part of a class member access (_expr.ref_) in which the
1578 object-expression refers to the member's class or a class
1579 derived from that class, or
1581 -- to form a pointer to member (_expr.unary.op_), or
1583 -- in the body of a nonstatic member function of that class or
1584 of a class derived from that class (_class.mfct.nonstatic_), or
1586 -- in a mem-initializer for a constructor for that class or for
1587 a class derived from that class (_class.base.init_). */
1588 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1590 /* Build a representation of the qualified name suitable
1591 for use as the operand to "&" -- even though the "&" is
1592 not actually present. */
1593 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1594 /* In Microsoft mode, treat a non-static member function as if
1595 it were a pointer-to-member. */
1596 if (flag_ms_extensions)
1598 PTRMEM_OK_P (member) = 1;
1599 return cp_build_unary_op (ADDR_EXPR, member, 0,
1600 tf_warning_or_error);
1602 error ("invalid use of non-static member function %qD",
1603 TREE_OPERAND (member, 1));
1604 return error_mark_node;
1606 else if (TREE_CODE (member) == FIELD_DECL)
1608 error ("invalid use of non-static data member %qD", member);
1609 return error_mark_node;
1614 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1615 PTRMEM_OK_P (member) = 1;
1619 /* If DECL is a scalar enumeration constant or variable with a
1620 constant initializer, return the initializer (or, its initializers,
1621 recursively); otherwise, return DECL. If INTEGRAL_P, the
1622 initializer is only returned if DECL is an integral
1623 constant-expression. */
1626 constant_value_1 (tree decl, bool integral_p)
1628 while (TREE_CODE (decl) == CONST_DECL
1630 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1631 : (TREE_CODE (decl) == VAR_DECL
1632 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1635 /* Static data members in template classes may have
1636 non-dependent initializers. References to such non-static
1637 data members are not value-dependent, so we must retrieve the
1638 initializer here. The DECL_INITIAL will have the right type,
1639 but will not have been folded because that would prevent us
1640 from performing all appropriate semantic checks at
1641 instantiation time. */
1642 if (DECL_CLASS_SCOPE_P (decl)
1643 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1644 && uses_template_parms (CLASSTYPE_TI_ARGS
1645 (DECL_CONTEXT (decl))))
1647 ++processing_template_decl;
1648 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1649 --processing_template_decl;
1653 /* If DECL is a static data member in a template
1654 specialization, we must instantiate it here. The
1655 initializer for the static data member is not processed
1656 until needed; we need it now. */
1658 init = DECL_INITIAL (decl);
1660 if (init == error_mark_node)
1663 || !TREE_TYPE (init)
1665 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1666 : (!TREE_CONSTANT (init)
1667 /* Do not return an aggregate constant (of which
1668 string literals are a special case), as we do not
1669 want to make inadvertent copies of such entities,
1670 and we must be sure that their addresses are the
1672 || TREE_CODE (init) == CONSTRUCTOR
1673 || TREE_CODE (init) == STRING_CST)))
1675 decl = unshare_expr (init);
1680 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1681 constant of integral or enumeration type, then return that value.
1682 These are those variables permitted in constant expressions by
1686 integral_constant_value (tree decl)
1688 return constant_value_1 (decl, /*integral_p=*/true);
1691 /* A more relaxed version of integral_constant_value, used by the
1692 common C/C++ code and by the C++ front end for optimization
1696 decl_constant_value (tree decl)
1698 return constant_value_1 (decl,
1699 /*integral_p=*/processing_template_decl);
1702 /* Common subroutines of build_new and build_vec_delete. */
1704 /* Call the global __builtin_delete to delete ADDR. */
1707 build_builtin_delete_call (tree addr)
1709 mark_used (global_delete_fndecl);
1710 return build_call_n (global_delete_fndecl, 1, addr);
1713 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1714 the type of the object being allocated; otherwise, it's just TYPE.
1715 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1716 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1717 the TREE_LIST of arguments to be provided as arguments to a
1718 placement new operator. This routine performs no semantic checks;
1719 it just creates and returns a NEW_EXPR. */
1722 build_raw_new_expr (tree placement, tree type, tree nelts, tree init,
1727 new_expr = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1729 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1730 TREE_SIDE_EFFECTS (new_expr) = 1;
1735 /* Make sure that there are no aliasing issues with T, a placement new
1736 expression applied to PLACEMENT, by recording the change in dynamic
1737 type. If placement new is inlined, as it is with libstdc++, and if
1738 the type of the placement new differs from the type of the
1739 placement location itself, then alias analysis may think it is OK
1740 to interchange writes to the location from before the placement new
1741 and from after the placement new. We have to prevent type-based
1742 alias analysis from applying. PLACEMENT may be NULL, which means
1743 that we couldn't capture it in a temporary variable, in which case
1744 we use a memory clobber. */
1747 avoid_placement_new_aliasing (tree t, tree placement)
1751 if (processing_template_decl)
1754 /* If we are not using type based aliasing, we don't have to do
1756 if (!flag_strict_aliasing)
1759 /* If we have a pointer and a location, record the change in dynamic
1760 type. Otherwise we need a general memory clobber. */
1761 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE
1762 && placement != NULL_TREE
1763 && TREE_CODE (TREE_TYPE (placement)) == POINTER_TYPE)
1764 type_change = build_stmt (CHANGE_DYNAMIC_TYPE_EXPR,
1769 /* Build a memory clobber. */
1770 type_change = build_stmt (ASM_EXPR,
1771 build_string (0, ""),
1774 tree_cons (NULL_TREE,
1775 build_string (6, "memory"),
1778 ASM_VOLATILE_P (type_change) = 1;
1781 return build2 (COMPOUND_EXPR, TREE_TYPE (t), type_change, t);
1784 /* Generate code for a new-expression, including calling the "operator
1785 new" function, initializing the object, and, if an exception occurs
1786 during construction, cleaning up. The arguments are as for
1787 build_raw_new_expr. */
1790 build_new_1 (tree placement, tree type, tree nelts, tree init,
1791 bool globally_qualified_p, tsubst_flags_t complain)
1794 /* True iff this is a call to "operator new[]" instead of just
1796 bool array_p = false;
1797 /* True iff ARRAY_P is true and the bound of the array type is
1798 not necessarily a compile time constant. For example, VLA_P is
1799 true for "new int[f()]". */
1801 /* The type being allocated. If ARRAY_P is true, this will be an
1804 /* If ARRAY_P is true, the element type of the array. This is an
1805 never ARRAY_TYPE; for something like "new int[3][4]", the
1806 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1809 /* The type of the new-expression. (This type is always a pointer
1812 /* A pointer type pointing to the FULL_TYPE. */
1813 tree full_pointer_type;
1814 tree outer_nelts = NULL_TREE;
1815 tree alloc_call, alloc_expr;
1816 /* The address returned by the call to "operator new". This node is
1817 a VAR_DECL and is therefore reusable. */
1820 tree cookie_expr, init_expr;
1821 int nothrow, check_new;
1822 int use_java_new = 0;
1823 /* If non-NULL, the number of extra bytes to allocate at the
1824 beginning of the storage allocated for an array-new expression in
1825 order to store the number of elements. */
1826 tree cookie_size = NULL_TREE;
1827 tree placement_expr = NULL_TREE;
1828 /* True if the function we are calling is a placement allocation
1830 bool placement_allocation_fn_p;
1831 tree args = NULL_TREE;
1832 /* True if the storage must be initialized, either by a constructor
1833 or due to an explicit new-initializer. */
1834 bool is_initialized;
1835 /* The address of the thing allocated, not including any cookie. In
1836 particular, if an array cookie is in use, DATA_ADDR is the
1837 address of the first array element. This node is a VAR_DECL, and
1838 is therefore reusable. */
1840 tree init_preeval_expr = NULL_TREE;
1846 outer_nelts = nelts;
1849 /* ??? The middle-end will error on us for building a VLA outside a
1850 function context. Methinks that's not it's purvey. So we'll do
1851 our own VLA layout later. */
1853 index = convert (sizetype, nelts);
1854 index = size_binop (MINUS_EXPR, index, size_one_node);
1855 index = build_index_type (index);
1856 full_type = build_cplus_array_type (type, NULL_TREE);
1857 /* We need a copy of the type as build_array_type will return a shared copy
1858 of the incomplete array type. */
1859 full_type = build_distinct_type_copy (full_type);
1860 TYPE_DOMAIN (full_type) = index;
1861 SET_TYPE_STRUCTURAL_EQUALITY (full_type);
1866 if (TREE_CODE (type) == ARRAY_TYPE)
1869 nelts = array_type_nelts_top (type);
1870 outer_nelts = nelts;
1871 type = TREE_TYPE (type);
1875 /* If our base type is an array, then make sure we know how many elements
1877 for (elt_type = type;
1878 TREE_CODE (elt_type) == ARRAY_TYPE;
1879 elt_type = TREE_TYPE (elt_type))
1880 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1881 array_type_nelts_top (elt_type),
1884 if (TREE_CODE (elt_type) == VOID_TYPE)
1886 if (complain & tf_error)
1887 error ("invalid type %<void%> for new");
1888 return error_mark_node;
1891 if (abstract_virtuals_error (NULL_TREE, elt_type))
1892 return error_mark_node;
1894 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1896 if (CP_TYPE_CONST_P (elt_type) && !init
1897 && !type_has_user_provided_default_constructor (elt_type))
1899 if (complain & tf_error)
1900 error ("uninitialized const in %<new%> of %q#T", elt_type);
1901 return error_mark_node;
1904 size = size_in_bytes (elt_type);
1907 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1912 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1913 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1914 ...>> to be valid. */
1915 TYPE_SIZE_UNIT (full_type) = size;
1916 n = convert (bitsizetype, nelts);
1917 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1918 TYPE_SIZE (full_type) = bitsize;
1922 alloc_fn = NULL_TREE;
1924 /* Allocate the object. */
1925 if (! placement && TYPE_FOR_JAVA (elt_type))
1928 tree class_decl = build_java_class_ref (elt_type);
1929 static const char alloc_name[] = "_Jv_AllocObject";
1931 if (class_decl == error_mark_node)
1932 return error_mark_node;
1935 if (!get_global_value_if_present (get_identifier (alloc_name),
1938 if (complain & tf_error)
1939 error ("call to Java constructor with %qs undefined", alloc_name);
1940 return error_mark_node;
1942 else if (really_overloaded_fn (alloc_fn))
1944 if (complain & tf_error)
1945 error ("%qD should never be overloaded", alloc_fn);
1946 return error_mark_node;
1948 alloc_fn = OVL_CURRENT (alloc_fn);
1949 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1950 alloc_call = (cp_build_function_call
1952 build_tree_list (NULL_TREE, class_addr),
1955 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
1957 error ("Java class %q#T object allocated using placement new", elt_type);
1958 return error_mark_node;
1965 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1967 if (!globally_qualified_p
1968 && CLASS_TYPE_P (elt_type)
1970 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1971 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1973 /* Use a class-specific operator new. */
1974 /* If a cookie is required, add some extra space. */
1975 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1977 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1978 size = size_binop (PLUS_EXPR, size, cookie_size);
1980 /* Create the argument list. */
1981 args = tree_cons (NULL_TREE, size, placement);
1982 /* Do name-lookup to find the appropriate operator. */
1983 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1984 if (fns == NULL_TREE)
1986 if (complain & tf_error)
1987 error ("no suitable %qD found in class %qT", fnname, elt_type);
1988 return error_mark_node;
1990 if (TREE_CODE (fns) == TREE_LIST)
1992 if (complain & tf_error)
1994 error ("request for member %qD is ambiguous", fnname);
1995 print_candidates (fns);
1997 return error_mark_node;
1999 alloc_call = build_new_method_call (build_dummy_object (elt_type),
2001 /*conversion_path=*/NULL_TREE,
2008 /* Use a global operator new. */
2009 /* See if a cookie might be required. */
2010 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
2011 cookie_size = targetm.cxx.get_cookie_size (elt_type);
2013 cookie_size = NULL_TREE;
2015 alloc_call = build_operator_new_call (fnname, placement,
2016 &size, &cookie_size,
2021 if (alloc_call == error_mark_node)
2022 return error_mark_node;
2024 gcc_assert (alloc_fn != NULL_TREE);
2026 /* If PLACEMENT is a simple pointer type and is not passed by reference,
2027 then copy it into PLACEMENT_EXPR. */
2028 if (!processing_template_decl
2029 && placement != NULL_TREE
2030 && TREE_CHAIN (placement) == NULL_TREE
2031 && TREE_CODE (TREE_TYPE (TREE_VALUE (placement))) == POINTER_TYPE
2032 && TREE_CODE (alloc_call) == CALL_EXPR
2033 && call_expr_nargs (alloc_call) == 2
2034 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2035 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2037 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2039 if (INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2040 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2042 placement_expr = get_target_expr (TREE_VALUE (placement));
2043 CALL_EXPR_ARG (alloc_call, 1)
2044 = convert (TREE_TYPE (placement_arg), placement_expr);
2048 /* In the simple case, we can stop now. */
2049 pointer_type = build_pointer_type (type);
2050 if (!cookie_size && !is_initialized)
2052 rval = build_nop (pointer_type, alloc_call);
2053 if (placement != NULL)
2054 rval = avoid_placement_new_aliasing (rval, placement_expr);
2058 /* While we're working, use a pointer to the type we've actually
2059 allocated. Store the result of the call in a variable so that we
2060 can use it more than once. */
2061 full_pointer_type = build_pointer_type (full_type);
2062 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2063 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2065 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2066 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2067 alloc_call = TREE_OPERAND (alloc_call, 1);
2069 /* Now, check to see if this function is actually a placement
2070 allocation function. This can happen even when PLACEMENT is NULL
2071 because we might have something like:
2073 struct S { void* operator new (size_t, int i = 0); };
2075 A call to `new S' will get this allocation function, even though
2076 there is no explicit placement argument. If there is more than
2077 one argument, or there are variable arguments, then this is a
2078 placement allocation function. */
2079 placement_allocation_fn_p
2080 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2081 || varargs_function_p (alloc_fn));
2083 /* Preevaluate the placement args so that we don't reevaluate them for a
2084 placement delete. */
2085 if (placement_allocation_fn_p)
2088 stabilize_call (alloc_call, &inits);
2090 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2094 /* unless an allocation function is declared with an empty excep-
2095 tion-specification (_except.spec_), throw(), it indicates failure to
2096 allocate storage by throwing a bad_alloc exception (clause _except_,
2097 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2098 cation function is declared with an empty exception-specification,
2099 throw(), it returns null to indicate failure to allocate storage and a
2100 non-null pointer otherwise.
2102 So check for a null exception spec on the op new we just called. */
2104 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2105 check_new = (flag_check_new || nothrow) && ! use_java_new;
2113 /* Adjust so we're pointing to the start of the object. */
2114 data_addr = get_target_expr (build2 (POINTER_PLUS_EXPR, full_pointer_type,
2115 alloc_node, cookie_size));
2117 /* Store the number of bytes allocated so that we can know how
2118 many elements to destroy later. We use the last sizeof
2119 (size_t) bytes to store the number of elements. */
2120 cookie_ptr = fold_build1 (NEGATE_EXPR, sizetype, size_in_bytes (sizetype));
2121 size_ptr_type = build_pointer_type (sizetype);
2122 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type,
2123 fold_convert (size_ptr_type, data_addr), cookie_ptr);
2124 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2126 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2128 if (targetm.cxx.cookie_has_size ())
2130 /* Also store the element size. */
2131 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2132 fold_build1 (NEGATE_EXPR, sizetype,
2133 size_in_bytes (sizetype)));
2135 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2136 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2137 size_in_bytes(elt_type));
2138 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2139 cookie, cookie_expr);
2141 data_addr = TARGET_EXPR_SLOT (data_addr);
2145 cookie_expr = NULL_TREE;
2146 data_addr = alloc_node;
2149 /* Now initialize the allocated object. Note that we preevaluate the
2150 initialization expression, apart from the actual constructor call or
2151 assignment--we do this because we want to delay the allocation as long
2152 as possible in order to minimize the size of the exception region for
2153 placement delete. */
2157 bool explicit_value_init_p = false;
2159 init_expr = cp_build_indirect_ref (data_addr, NULL, complain);
2161 if (init == void_zero_node)
2164 explicit_value_init_p = true;
2171 if (complain & tf_error)
2172 permerror ("ISO C++ forbids initialization in array new");
2174 return error_mark_node;
2177 = build_vec_init (init_expr,
2178 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2182 explicit_value_init_p,
2186 /* An array initialization is stable because the initialization
2187 of each element is a full-expression, so the temporaries don't
2193 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2195 init_expr = build_special_member_call (init_expr,
2196 complete_ctor_identifier,
2201 else if (explicit_value_init_p)
2203 /* Something like `new int()'. */
2204 init_expr = build2 (INIT_EXPR, full_type,
2205 init_expr, build_value_init (full_type));
2209 /* We are processing something like `new int (10)', which
2210 means allocate an int, and initialize it with 10. */
2212 if (TREE_CODE (init) == TREE_LIST)
2213 init = build_x_compound_expr_from_list (init,
2216 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
2217 || TREE_TYPE (init) != NULL_TREE);
2219 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, init,
2222 stable = stabilize_init (init_expr, &init_preeval_expr);
2225 if (init_expr == error_mark_node)
2226 return error_mark_node;
2228 /* If any part of the object initialization terminates by throwing an
2229 exception and a suitable deallocation function can be found, the
2230 deallocation function is called to free the memory in which the
2231 object was being constructed, after which the exception continues
2232 to propagate in the context of the new-expression. If no
2233 unambiguous matching deallocation function can be found,
2234 propagating the exception does not cause the object's memory to be
2236 if (flag_exceptions && ! use_java_new)
2238 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2241 /* The Standard is unclear here, but the right thing to do
2242 is to use the same method for finding deallocation
2243 functions that we use for finding allocation functions. */
2244 cleanup = build_op_delete_call (dcode, alloc_node, size,
2245 globally_qualified_p,
2246 (placement_allocation_fn_p
2247 ? alloc_call : NULL_TREE),
2253 /* This is much simpler if we were able to preevaluate all of
2254 the arguments to the constructor call. */
2255 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2256 init_expr, cleanup);
2258 /* Ack! First we allocate the memory. Then we set our sentry
2259 variable to true, and expand a cleanup that deletes the
2260 memory if sentry is true. Then we run the constructor, and
2261 finally clear the sentry.
2263 We need to do this because we allocate the space first, so
2264 if there are any temporaries with cleanups in the
2265 constructor args and we weren't able to preevaluate them, we
2266 need this EH region to extend until end of full-expression
2267 to preserve nesting. */
2269 tree end, sentry, begin;
2271 begin = get_target_expr (boolean_true_node);
2272 CLEANUP_EH_ONLY (begin) = 1;
2274 sentry = TARGET_EXPR_SLOT (begin);
2276 TARGET_EXPR_CLEANUP (begin)
2277 = build3 (COND_EXPR, void_type_node, sentry,
2278 cleanup, void_zero_node);
2280 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2281 sentry, boolean_false_node);
2284 = build2 (COMPOUND_EXPR, void_type_node, begin,
2285 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2292 init_expr = NULL_TREE;
2294 /* Now build up the return value in reverse order. */
2299 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2301 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2303 if (rval == alloc_node)
2304 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2305 and return the call (which doesn't need to be adjusted). */
2306 rval = TARGET_EXPR_INITIAL (alloc_expr);
2311 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2314 rval = build_conditional_expr (ifexp, rval, alloc_node,
2318 /* Perform the allocation before anything else, so that ALLOC_NODE
2319 has been initialized before we start using it. */
2320 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2323 if (init_preeval_expr)
2324 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2326 /* Convert to the final type. */
2327 rval = build_nop (pointer_type, rval);
2329 /* A new-expression is never an lvalue. */
2330 gcc_assert (!lvalue_p (rval));
2332 if (placement != NULL)
2333 rval = avoid_placement_new_aliasing (rval, placement_expr);
2338 /* Generate a representation for a C++ "new" expression. PLACEMENT is
2339 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
2340 NELTS is NULL, TYPE is the type of the storage to be allocated. If
2341 NELTS is not NULL, then this is an array-new allocation; TYPE is
2342 the type of the elements in the array and NELTS is the number of
2343 elements in the array. INIT, if non-NULL, is the initializer for
2344 the new object, or void_zero_node to indicate an initializer of
2345 "()". If USE_GLOBAL_NEW is true, then the user explicitly wrote
2346 "::new" rather than just "new". */
2349 build_new (tree placement, tree type, tree nelts, tree init,
2350 int use_global_new, tsubst_flags_t complain)
2353 tree orig_placement;
2357 if (placement == error_mark_node || type == error_mark_node
2358 || init == error_mark_node)
2359 return error_mark_node;
2361 orig_placement = placement;
2365 if (processing_template_decl)
2367 if (dependent_type_p (type)
2368 || any_type_dependent_arguments_p (placement)
2369 || (nelts && type_dependent_expression_p (nelts))
2370 || (init != void_zero_node
2371 && any_type_dependent_arguments_p (init)))
2372 return build_raw_new_expr (placement, type, nelts, init,
2374 placement = build_non_dependent_args (placement);
2376 nelts = build_non_dependent_expr (nelts);
2377 if (init != void_zero_node)
2378 init = build_non_dependent_args (init);
2383 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2385 if (complain & tf_error)
2386 permerror ("size in array new must have integral type");
2388 return error_mark_node;
2390 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2393 /* ``A reference cannot be created by the new operator. A reference
2394 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2395 returned by new.'' ARM 5.3.3 */
2396 if (TREE_CODE (type) == REFERENCE_TYPE)
2398 if (complain & tf_error)
2399 error ("new cannot be applied to a reference type");
2401 return error_mark_node;
2402 type = TREE_TYPE (type);
2405 if (TREE_CODE (type) == FUNCTION_TYPE)
2407 if (complain & tf_error)
2408 error ("new cannot be applied to a function type");
2409 return error_mark_node;
2412 /* The type allocated must be complete. If the new-type-id was
2413 "T[N]" then we are just checking that "T" is complete here, but
2414 that is equivalent, since the value of "N" doesn't matter. */
2415 if (!complete_type_or_else (type, NULL_TREE))
2416 return error_mark_node;
2418 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2419 if (rval == error_mark_node)
2420 return error_mark_node;
2422 if (processing_template_decl)
2423 return build_raw_new_expr (orig_placement, type, orig_nelts, orig_init,
2426 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2427 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2428 TREE_NO_WARNING (rval) = 1;
2433 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2436 build_java_class_ref (tree type)
2438 tree name = NULL_TREE, class_decl;
2439 static tree CL_suffix = NULL_TREE;
2440 if (CL_suffix == NULL_TREE)
2441 CL_suffix = get_identifier("class$");
2442 if (jclass_node == NULL_TREE)
2444 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2445 if (jclass_node == NULL_TREE)
2447 error ("call to Java constructor, while %<jclass%> undefined");
2448 return error_mark_node;
2450 jclass_node = TREE_TYPE (jclass_node);
2453 /* Mangle the class$ field. */
2456 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2457 if (DECL_NAME (field) == CL_suffix)
2459 mangle_decl (field);
2460 name = DECL_ASSEMBLER_NAME (field);
2465 error ("can't find %<class$%> in %qT", type);
2466 return error_mark_node;
2470 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2471 if (class_decl == NULL_TREE)
2473 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2474 TREE_STATIC (class_decl) = 1;
2475 DECL_EXTERNAL (class_decl) = 1;
2476 TREE_PUBLIC (class_decl) = 1;
2477 DECL_ARTIFICIAL (class_decl) = 1;
2478 DECL_IGNORED_P (class_decl) = 1;
2479 pushdecl_top_level (class_decl);
2480 make_decl_rtl (class_decl);
2486 build_vec_delete_1 (tree base, tree maxindex, tree type,
2487 special_function_kind auto_delete_vec, int use_global_delete)
2490 tree ptype = build_pointer_type (type = complete_type (type));
2491 tree size_exp = size_in_bytes (type);
2493 /* Temporary variables used by the loop. */
2494 tree tbase, tbase_init;
2496 /* This is the body of the loop that implements the deletion of a
2497 single element, and moves temp variables to next elements. */
2500 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2503 /* This is the thing that governs what to do after the loop has run. */
2504 tree deallocate_expr = 0;
2506 /* This is the BIND_EXPR which holds the outermost iterator of the
2507 loop. It is convenient to set this variable up and test it before
2508 executing any other code in the loop.
2509 This is also the containing expression returned by this function. */
2510 tree controller = NULL_TREE;
2513 /* We should only have 1-D arrays here. */
2514 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2516 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2519 /* The below is short by the cookie size. */
2520 virtual_size = size_binop (MULT_EXPR, size_exp,
2521 convert (sizetype, maxindex));
2523 tbase = create_temporary_var (ptype);
2524 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2525 fold_build2 (POINTER_PLUS_EXPR, ptype,
2526 fold_convert (ptype, base),
2528 tf_warning_or_error);
2529 DECL_REGISTER (tbase) = 1;
2530 controller = build3 (BIND_EXPR, void_type_node, tbase,
2531 NULL_TREE, NULL_TREE);
2532 TREE_SIDE_EFFECTS (controller) = 1;
2534 body = build1 (EXIT_EXPR, void_type_node,
2535 build2 (EQ_EXPR, boolean_type_node, tbase,
2536 fold_convert (ptype, base)));
2537 tmp = fold_build1 (NEGATE_EXPR, sizetype, size_exp);
2538 body = build_compound_expr
2539 (body, cp_build_modify_expr (tbase, NOP_EXPR,
2540 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2541 tf_warning_or_error));
2542 body = build_compound_expr
2543 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2544 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2546 loop = build1 (LOOP_EXPR, void_type_node, body);
2547 loop = build_compound_expr (tbase_init, loop);
2550 /* If the delete flag is one, or anything else with the low bit set,
2551 delete the storage. */
2552 if (auto_delete_vec != sfk_base_destructor)
2556 /* The below is short by the cookie size. */
2557 virtual_size = size_binop (MULT_EXPR, size_exp,
2558 convert (sizetype, maxindex));
2560 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2567 cookie_size = targetm.cxx.get_cookie_size (type);
2569 = cp_convert (ptype,
2570 cp_build_binary_op (MINUS_EXPR,
2571 cp_convert (string_type_node,
2574 tf_warning_or_error));
2575 /* True size with header. */
2576 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2579 if (auto_delete_vec == sfk_deleting_destructor)
2580 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2581 base_tbd, virtual_size,
2582 use_global_delete & 1,
2583 /*placement=*/NULL_TREE,
2584 /*alloc_fn=*/NULL_TREE);
2588 if (!deallocate_expr)
2591 body = deallocate_expr;
2593 body = build_compound_expr (body, deallocate_expr);
2596 body = integer_zero_node;
2598 /* Outermost wrapper: If pointer is null, punt. */
2599 body = fold_build3 (COND_EXPR, void_type_node,
2600 fold_build2 (NE_EXPR, boolean_type_node, base,
2601 convert (TREE_TYPE (base),
2602 integer_zero_node)),
2603 body, integer_zero_node);
2604 body = build1 (NOP_EXPR, void_type_node, body);
2608 TREE_OPERAND (controller, 1) = body;
2612 if (TREE_CODE (base) == SAVE_EXPR)
2613 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2614 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2616 return convert_to_void (body, /*implicit=*/NULL, tf_warning_or_error);
2619 /* Create an unnamed variable of the indicated TYPE. */
2622 create_temporary_var (tree type)
2626 decl = build_decl (VAR_DECL, NULL_TREE, type);
2627 TREE_USED (decl) = 1;
2628 DECL_ARTIFICIAL (decl) = 1;
2629 DECL_IGNORED_P (decl) = 1;
2630 DECL_SOURCE_LOCATION (decl) = input_location;
2631 DECL_CONTEXT (decl) = current_function_decl;
2636 /* Create a new temporary variable of the indicated TYPE, initialized
2639 It is not entered into current_binding_level, because that breaks
2640 things when it comes time to do final cleanups (which take place
2641 "outside" the binding contour of the function). */
2644 get_temp_regvar (tree type, tree init)
2648 decl = create_temporary_var (type);
2649 add_decl_expr (decl);
2651 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2652 tf_warning_or_error));
2657 /* `build_vec_init' returns tree structure that performs
2658 initialization of a vector of aggregate types.
2660 BASE is a reference to the vector, of ARRAY_TYPE.
2661 MAXINDEX is the maximum index of the array (one less than the
2662 number of elements). It is only used if
2663 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2665 INIT is the (possibly NULL) initializer.
2667 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2668 elements in the array are value-initialized.
2670 FROM_ARRAY is 0 if we should init everything with INIT
2671 (i.e., every element initialized from INIT).
2672 FROM_ARRAY is 1 if we should index into INIT in parallel
2673 with initialization of DECL.
2674 FROM_ARRAY is 2 if we should index into INIT in parallel,
2675 but use assignment instead of initialization. */
2678 build_vec_init (tree base, tree maxindex, tree init,
2679 bool explicit_value_init_p,
2680 int from_array, tsubst_flags_t complain)
2683 tree base2 = NULL_TREE;
2685 tree itype = NULL_TREE;
2687 /* The type of the array. */
2688 tree atype = TREE_TYPE (base);
2689 /* The type of an element in the array. */
2690 tree type = TREE_TYPE (atype);
2691 /* The element type reached after removing all outer array
2693 tree inner_elt_type;
2694 /* The type of a pointer to an element in the array. */
2699 tree try_block = NULL_TREE;
2700 int num_initialized_elts = 0;
2703 if (TYPE_DOMAIN (atype))
2704 maxindex = array_type_nelts (atype);
2706 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2707 return error_mark_node;
2709 if (explicit_value_init_p)
2712 inner_elt_type = strip_array_types (atype);
2715 ? (!CLASS_TYPE_P (inner_elt_type)
2716 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2717 : !TYPE_NEEDS_CONSTRUCTING (type))
2718 && ((TREE_CODE (init) == CONSTRUCTOR
2719 /* Don't do this if the CONSTRUCTOR might contain something
2720 that might throw and require us to clean up. */
2721 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2722 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2725 /* Do non-default initialization of POD arrays resulting from
2726 brace-enclosed initializers. In this case, digest_init and
2727 store_constructor will handle the semantics for us. */
2729 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2733 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2734 ptype = build_pointer_type (type);
2735 size = size_in_bytes (type);
2736 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2737 base = cp_convert (ptype, decay_conversion (base));
2739 /* The code we are generating looks like:
2743 ptrdiff_t iterator = maxindex;
2745 for (; iterator != -1; --iterator) {
2746 ... initialize *t1 ...
2750 ... destroy elements that were constructed ...
2755 We can omit the try and catch blocks if we know that the
2756 initialization will never throw an exception, or if the array
2757 elements do not have destructors. We can omit the loop completely if
2758 the elements of the array do not have constructors.
2760 We actually wrap the entire body of the above in a STMT_EXPR, for
2763 When copying from array to another, when the array elements have
2764 only trivial copy constructors, we should use __builtin_memcpy
2765 rather than generating a loop. That way, we could take advantage
2766 of whatever cleverness the back end has for dealing with copies
2767 of blocks of memory. */
2769 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2770 destroy_temps = stmts_are_full_exprs_p ();
2771 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2772 rval = get_temp_regvar (ptype, base);
2773 base = get_temp_regvar (ptype, rval);
2774 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2776 /* Protect the entire array initialization so that we can destroy
2777 the partially constructed array if an exception is thrown.
2778 But don't do this if we're assigning. */
2779 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2782 try_block = begin_try_block ();
2785 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2787 /* Do non-default initialization of non-POD arrays resulting from
2788 brace-enclosed initializers. */
2789 unsigned HOST_WIDE_INT idx;
2793 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2795 tree baseref = build1 (INDIRECT_REF, type, base);
2797 num_initialized_elts++;
2799 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2800 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2801 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2803 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2805 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2807 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2809 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2813 /* Clear out INIT so that we don't get confused below. */
2816 else if (from_array)
2818 /* If initializing one array from another, initialize element by
2819 element. We rely upon the below calls the do argument
2823 base2 = decay_conversion (init);
2824 itype = TREE_TYPE (base2);
2825 base2 = get_temp_regvar (itype, base2);
2826 itype = TREE_TYPE (itype);
2828 else if (TYPE_LANG_SPECIFIC (type)
2829 && TYPE_NEEDS_CONSTRUCTING (type)
2830 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2832 if (complain & tf_error)
2833 error ("initializer ends prematurely");
2834 return error_mark_node;
2838 /* Now, default-initialize any remaining elements. We don't need to
2839 do that if a) the type does not need constructing, or b) we've
2840 already initialized all the elements.
2842 We do need to keep going if we're copying an array. */
2845 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
2846 && ! (host_integerp (maxindex, 0)
2847 && (num_initialized_elts
2848 == tree_low_cst (maxindex, 0) + 1))))
2850 /* If the ITERATOR is equal to -1, then we don't have to loop;
2851 we've already initialized all the elements. */
2856 for_stmt = begin_for_stmt ();
2857 finish_for_init_stmt (for_stmt);
2858 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2859 build_int_cst (TREE_TYPE (iterator), -1)),
2861 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2865 to = build1 (INDIRECT_REF, type, base);
2872 from = build1 (INDIRECT_REF, itype, base2);
2876 if (from_array == 2)
2877 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2879 else if (TYPE_NEEDS_CONSTRUCTING (type))
2880 elt_init = build_aggr_init (to, from, 0, complain);
2882 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2887 else if (TREE_CODE (type) == ARRAY_TYPE)
2891 ("cannot initialize multi-dimensional array with initializer");
2892 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2894 explicit_value_init_p,
2897 else if (explicit_value_init_p)
2898 elt_init = build2 (INIT_EXPR, type, to,
2899 build_value_init (type));
2902 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
2903 elt_init = build_aggr_init (to, init, 0, complain);
2906 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2907 finish_expr_stmt (elt_init);
2908 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2910 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2913 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
2916 finish_for_stmt (for_stmt);
2919 /* Make sure to cleanup any partially constructed elements. */
2920 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2924 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator,
2927 /* Flatten multi-dimensional array since build_vec_delete only
2928 expects one-dimensional array. */
2929 if (TREE_CODE (type) == ARRAY_TYPE)
2930 m = cp_build_binary_op (MULT_EXPR, m,
2931 array_type_nelts_total (type),
2934 finish_cleanup_try_block (try_block);
2935 e = build_vec_delete_1 (rval, m,
2936 inner_elt_type, sfk_base_destructor,
2937 /*use_global_delete=*/0);
2938 finish_cleanup (e, try_block);
2941 /* The value of the array initialization is the array itself, RVAL
2942 is a pointer to the first element. */
2943 finish_stmt_expr_expr (rval, stmt_expr);
2945 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2947 /* Now convert make the result have the correct type. */
2948 atype = build_pointer_type (atype);
2949 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2950 stmt_expr = cp_build_indirect_ref (stmt_expr, NULL, complain);
2952 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2956 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2960 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2966 case sfk_complete_destructor:
2967 name = complete_dtor_identifier;
2970 case sfk_base_destructor:
2971 name = base_dtor_identifier;
2974 case sfk_deleting_destructor:
2975 name = deleting_dtor_identifier;
2981 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2982 return build_new_method_call (exp, fn,
2984 /*conversion_path=*/NULL_TREE,
2987 tf_warning_or_error);
2990 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2991 ADDR is an expression which yields the store to be destroyed.
2992 AUTO_DELETE is the name of the destructor to call, i.e., either
2993 sfk_complete_destructor, sfk_base_destructor, or
2994 sfk_deleting_destructor.
2996 FLAGS is the logical disjunction of zero or more LOOKUP_
2997 flags. See cp-tree.h for more info. */
3000 build_delete (tree type, tree addr, special_function_kind auto_delete,
3001 int flags, int use_global_delete)
3005 if (addr == error_mark_node)
3006 return error_mark_node;
3008 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3009 set to `error_mark_node' before it gets properly cleaned up. */
3010 if (type == error_mark_node)
3011 return error_mark_node;
3013 type = TYPE_MAIN_VARIANT (type);
3015 if (TREE_CODE (type) == POINTER_TYPE)
3017 bool complete_p = true;
3019 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3020 if (TREE_CODE (type) == ARRAY_TYPE)
3023 /* We don't want to warn about delete of void*, only other
3024 incomplete types. Deleting other incomplete types
3025 invokes undefined behavior, but it is not ill-formed, so
3026 compile to something that would even do The Right Thing
3027 (TM) should the type have a trivial dtor and no delete
3029 if (!VOID_TYPE_P (type))
3031 complete_type (type);
3032 if (!COMPLETE_TYPE_P (type))
3034 warning (0, "possible problem detected in invocation of "
3035 "delete operator:");
3036 cxx_incomplete_type_diagnostic (addr, type, 1);
3037 inform ("neither the destructor nor the class-specific "
3038 "operator delete will be called, even if they are "
3039 "declared when the class is defined.");
3043 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3044 /* Call the builtin operator delete. */
3045 return build_builtin_delete_call (addr);
3046 if (TREE_SIDE_EFFECTS (addr))
3047 addr = save_expr (addr);
3049 /* Throw away const and volatile on target type of addr. */
3050 addr = convert_force (build_pointer_type (type), addr, 0);
3052 else if (TREE_CODE (type) == ARRAY_TYPE)
3056 if (TYPE_DOMAIN (type) == NULL_TREE)
3058 error ("unknown array size in delete");
3059 return error_mark_node;
3061 return build_vec_delete (addr, array_type_nelts (type),
3062 auto_delete, use_global_delete);
3066 /* Don't check PROTECT here; leave that decision to the
3067 destructor. If the destructor is accessible, call it,
3068 else report error. */
3069 addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error);
3070 if (TREE_SIDE_EFFECTS (addr))
3071 addr = save_expr (addr);
3073 addr = convert_force (build_pointer_type (type), addr, 0);
3076 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3078 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3080 if (auto_delete != sfk_deleting_destructor)
3081 return void_zero_node;
3083 return build_op_delete_call (DELETE_EXPR, addr,
3084 cxx_sizeof_nowarn (type),
3086 /*placement=*/NULL_TREE,
3087 /*alloc_fn=*/NULL_TREE);
3091 tree head = NULL_TREE;
3092 tree do_delete = NULL_TREE;
3095 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3096 lazily_declare_fn (sfk_destructor, type);
3098 /* For `::delete x', we must not use the deleting destructor
3099 since then we would not be sure to get the global `operator
3101 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3103 /* We will use ADDR multiple times so we must save it. */
3104 addr = save_expr (addr);
3105 head = get_target_expr (build_headof (addr));
3106 /* Delete the object. */
3107 do_delete = build_builtin_delete_call (head);
3108 /* Otherwise, treat this like a complete object destructor
3110 auto_delete = sfk_complete_destructor;
3112 /* If the destructor is non-virtual, there is no deleting
3113 variant. Instead, we must explicitly call the appropriate
3114 `operator delete' here. */
3115 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3116 && auto_delete == sfk_deleting_destructor)
3118 /* We will use ADDR multiple times so we must save it. */
3119 addr = save_expr (addr);
3120 /* Build the call. */
3121 do_delete = build_op_delete_call (DELETE_EXPR,
3123 cxx_sizeof_nowarn (type),
3125 /*placement=*/NULL_TREE,
3126 /*alloc_fn=*/NULL_TREE);
3127 /* Call the complete object destructor. */
3128 auto_delete = sfk_complete_destructor;
3130 else if (auto_delete == sfk_deleting_destructor
3131 && TYPE_GETS_REG_DELETE (type))
3133 /* Make sure we have access to the member op delete, even though
3134 we'll actually be calling it from the destructor. */
3135 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3137 /*placement=*/NULL_TREE,
3138 /*alloc_fn=*/NULL_TREE);
3141 expr = build_dtor_call (cp_build_indirect_ref (addr, NULL,
3142 tf_warning_or_error),
3143 auto_delete, flags);
3145 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3147 /* We need to calculate this before the dtor changes the vptr. */
3149 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3151 if (flags & LOOKUP_DESTRUCTOR)
3152 /* Explicit destructor call; don't check for null pointer. */
3153 ifexp = integer_one_node;
3155 /* Handle deleting a null pointer. */
3156 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node,
3157 tf_warning_or_error));
3159 if (ifexp != integer_one_node)
3160 expr = build3 (COND_EXPR, void_type_node,
3161 ifexp, expr, void_zero_node);
3167 /* At the beginning of a destructor, push cleanups that will call the
3168 destructors for our base classes and members.
3170 Called from begin_destructor_body. */
3173 push_base_cleanups (void)
3175 tree binfo, base_binfo;
3179 VEC(tree,gc) *vbases;
3181 /* Run destructors for all virtual baseclasses. */
3182 if (CLASSTYPE_VBASECLASSES (current_class_type))
3184 tree cond = (condition_conversion
3185 (build2 (BIT_AND_EXPR, integer_type_node,
3186 current_in_charge_parm,
3187 integer_two_node)));
3189 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3190 order, which is also the right order for pushing cleanups. */
3191 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3192 VEC_iterate (tree, vbases, i, base_binfo); i++)
3194 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3196 expr = build_special_member_call (current_class_ref,
3197 base_dtor_identifier,
3201 | LOOKUP_NONVIRTUAL),
3202 tf_warning_or_error);
3203 expr = build3 (COND_EXPR, void_type_node, cond,
3204 expr, void_zero_node);
3205 finish_decl_cleanup (NULL_TREE, expr);
3210 /* Take care of the remaining baseclasses. */
3211 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3212 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3214 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3215 || BINFO_VIRTUAL_P (base_binfo))
3218 expr = build_special_member_call (current_class_ref,
3219 base_dtor_identifier,
3220 NULL_TREE, base_binfo,
3221 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3222 tf_warning_or_error);
3223 finish_decl_cleanup (NULL_TREE, expr);
3226 for (member = TYPE_FIELDS (current_class_type); member;
3227 member = TREE_CHAIN (member))
3229 if (TREE_TYPE (member) == error_mark_node
3230 || TREE_CODE (member) != FIELD_DECL
3231 || DECL_ARTIFICIAL (member))
3233 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3235 tree this_member = (build_class_member_access_expr
3236 (current_class_ref, member,
3237 /*access_path=*/NULL_TREE,
3238 /*preserve_reference=*/false,
3239 tf_warning_or_error));
3240 tree this_type = TREE_TYPE (member);
3241 expr = build_delete (this_type, this_member,
3242 sfk_complete_destructor,
3243 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3245 finish_decl_cleanup (NULL_TREE, expr);
3250 /* Build a C++ vector delete expression.
3251 MAXINDEX is the number of elements to be deleted.
3252 ELT_SIZE is the nominal size of each element in the vector.
3253 BASE is the expression that should yield the store to be deleted.
3254 This function expands (or synthesizes) these calls itself.
3255 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3257 This also calls delete for virtual baseclasses of elements of the vector.
3259 Update: MAXINDEX is no longer needed. The size can be extracted from the
3260 start of the vector for pointers, and from the type for arrays. We still
3261 use MAXINDEX for arrays because it happens to already have one of the
3262 values we'd have to extract. (We could use MAXINDEX with pointers to
3263 confirm the size, and trap if the numbers differ; not clear that it'd
3264 be worth bothering.) */
3267 build_vec_delete (tree base, tree maxindex,
3268 special_function_kind auto_delete_vec, int use_global_delete)
3272 tree base_init = NULL_TREE;
3274 type = TREE_TYPE (base);
3276 if (TREE_CODE (type) == POINTER_TYPE)
3278 /* Step back one from start of vector, and read dimension. */
3280 tree size_ptr_type = build_pointer_type (sizetype);
3282 if (TREE_SIDE_EFFECTS (base))
3284 base_init = get_target_expr (base);
3285 base = TARGET_EXPR_SLOT (base_init);
3287 type = strip_array_types (TREE_TYPE (type));
3288 cookie_addr = fold_build1 (NEGATE_EXPR, sizetype, TYPE_SIZE_UNIT (sizetype));
3289 cookie_addr = build2 (POINTER_PLUS_EXPR,
3291 fold_convert (size_ptr_type, base),
3293 maxindex = cp_build_indirect_ref (cookie_addr, NULL, tf_warning_or_error);
3295 else if (TREE_CODE (type) == ARRAY_TYPE)
3297 /* Get the total number of things in the array, maxindex is a
3299 maxindex = array_type_nelts_total (type);
3300 type = strip_array_types (type);
3301 base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error);
3302 if (TREE_SIDE_EFFECTS (base))
3304 base_init = get_target_expr (base);
3305 base = TARGET_EXPR_SLOT (base_init);
3310 if (base != error_mark_node)
3311 error ("type to vector delete is neither pointer or array type");
3312 return error_mark_node;
3315 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3318 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);