1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
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 /* Return a suitable initializer for value-initializing an object of type
270 TYPE, as described in [dcl.init]. */
273 build_value_init (tree type)
277 To value-initialize an object of type T means:
279 - if T is a class type (clause 9) with a user-provided constructor
280 (12.1), then the default constructor for T is called (and the
281 initialization is ill-formed if T has no accessible default
284 - if T is a non-union class type without a user-provided constructor,
285 then every non-static data member and base-class component of T is
286 value-initialized;92)
288 - if T is an array type, then each element is value-initialized;
290 - otherwise, the object is zero-initialized.
292 A program that calls for default-initialization or
293 value-initialization of an entity of reference type is ill-formed.
295 92) Value-initialization for such a class object may be implemented by
296 zero-initializing the object and then calling the default
299 if (CLASS_TYPE_P (type))
301 if (type_has_user_provided_constructor (type))
302 return build_aggr_init_expr
304 build_special_member_call (NULL_TREE, complete_ctor_identifier,
305 NULL, type, LOOKUP_NORMAL,
306 tf_warning_or_error));
307 else if (TREE_CODE (type) != UNION_TYPE && TYPE_NEEDS_CONSTRUCTING (type))
309 /* This is a class that needs constructing, but doesn't have
310 a user-provided constructor. So we need to zero-initialize
311 the object and then call the implicitly defined ctor.
312 This will be handled in simplify_aggr_init_expr. */
313 tree ctor = build_special_member_call
314 (NULL_TREE, complete_ctor_identifier,
315 NULL, type, LOOKUP_NORMAL, tf_warning_or_error);
317 ctor = build_aggr_init_expr (type, ctor);
318 AGGR_INIT_ZERO_FIRST (ctor) = 1;
322 return build_value_init_noctor (type);
325 /* Like build_value_init, but don't call the constructor for TYPE. Used
326 for base initializers. */
329 build_value_init_noctor (tree type)
331 if (CLASS_TYPE_P (type))
333 gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type));
335 if (TREE_CODE (type) != UNION_TYPE)
338 VEC(constructor_elt,gc) *v = NULL;
340 /* Iterate over the fields, building initializations. */
341 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
345 if (TREE_CODE (field) != FIELD_DECL)
348 ftype = TREE_TYPE (field);
350 if (TREE_CODE (ftype) == REFERENCE_TYPE)
351 error ("value-initialization of reference");
353 /* We could skip vfields and fields of types with
354 user-defined constructors, but I think that won't improve
355 performance at all; it should be simpler in general just
356 to zero out the entire object than try to only zero the
357 bits that actually need it. */
359 /* Note that for class types there will be FIELD_DECLs
360 corresponding to base classes as well. Thus, iterating
361 over TYPE_FIELDs will result in correct initialization of
362 all of the subobjects. */
363 value = build_value_init (ftype);
366 CONSTRUCTOR_APPEND_ELT(v, field, value);
369 /* Build a constructor to contain the zero- initializations. */
370 return build_constructor (type, v);
373 else if (TREE_CODE (type) == ARRAY_TYPE)
375 VEC(constructor_elt,gc) *v = NULL;
377 /* Iterate over the array elements, building initializations. */
378 tree max_index = array_type_nelts (type);
380 /* If we have an error_mark here, we should just return error mark
381 as we don't know the size of the array yet. */
382 if (max_index == error_mark_node)
383 return error_mark_node;
384 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
386 /* A zero-sized array, which is accepted as an extension, will
387 have an upper bound of -1. */
388 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
392 v = VEC_alloc (constructor_elt, gc, 1);
393 ce = VEC_quick_push (constructor_elt, v, NULL);
395 /* If this is a one element array, we just use a regular init. */
396 if (tree_int_cst_equal (size_zero_node, max_index))
397 ce->index = size_zero_node;
399 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
402 ce->value = build_value_init (TREE_TYPE (type));
404 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
405 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR
406 && TREE_CODE (ce->value) != AGGR_INIT_EXPR);
409 /* Build a constructor to contain the initializations. */
410 return build_constructor (type, v);
413 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
416 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
417 arguments. If TREE_LIST is void_type_node, an empty initializer
418 list was given; if NULL_TREE no initializer was given. */
421 perform_member_init (tree member, tree init)
424 tree type = TREE_TYPE (member);
426 /* Effective C++ rule 12 requires that all data members be
428 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE)
429 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__,
430 "%qD should be initialized in the member initialization list",
433 /* Get an lvalue for the data member. */
434 decl = build_class_member_access_expr (current_class_ref, member,
435 /*access_path=*/NULL_TREE,
436 /*preserve_reference=*/true,
437 tf_warning_or_error);
438 if (decl == error_mark_node)
441 if (init == void_type_node)
443 /* mem() means value-initialization. */
444 if (TREE_CODE (type) == ARRAY_TYPE)
446 init = build_vec_init (decl, NULL_TREE, NULL_TREE,
447 /*explicit_value_init_p=*/true,
449 tf_warning_or_error);
450 finish_expr_stmt (init);
454 if (TREE_CODE (type) == REFERENCE_TYPE)
455 permerror (DECL_SOURCE_LOCATION (current_function_decl),
456 "value-initialization of %q#D, which has reference type",
460 init = build2 (INIT_EXPR, type, decl, build_value_init (type));
461 finish_expr_stmt (init);
465 /* Deal with this here, as we will get confused if we try to call the
466 assignment op for an anonymous union. This can happen in a
467 synthesized copy constructor. */
468 else if (ANON_AGGR_TYPE_P (type))
472 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
473 finish_expr_stmt (init);
476 else if (TYPE_NEEDS_CONSTRUCTING (type))
478 if (init != NULL_TREE
479 && TREE_CODE (type) == ARRAY_TYPE
480 && TREE_CHAIN (init) == NULL_TREE
481 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
483 /* Initialization of one array from another. */
484 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
485 /*explicit_value_init_p=*/false,
487 tf_warning_or_error));
491 if (CP_TYPE_CONST_P (type)
493 && !type_has_user_provided_default_constructor (type))
494 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
495 vtable; still give this diagnostic. */
496 permerror (DECL_SOURCE_LOCATION (current_function_decl),
497 "uninitialized member %qD with %<const%> type %qT",
499 finish_expr_stmt (build_aggr_init (decl, init, 0,
500 tf_warning_or_error));
505 if (init == NULL_TREE)
507 /* member traversal: note it leaves init NULL */
508 if (TREE_CODE (type) == REFERENCE_TYPE)
509 permerror (DECL_SOURCE_LOCATION (current_function_decl),
510 "uninitialized reference member %qD",
512 else if (CP_TYPE_CONST_P (type))
513 permerror (DECL_SOURCE_LOCATION (current_function_decl),
514 "uninitialized member %qD with %<const%> type %qT",
517 else if (TREE_CODE (init) == TREE_LIST)
518 /* There was an explicit member initialization. Do some work
520 init = build_x_compound_expr_from_list (init, "member initializer");
523 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
524 tf_warning_or_error));
527 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
531 expr = build_class_member_access_expr (current_class_ref, member,
532 /*access_path=*/NULL_TREE,
533 /*preserve_reference=*/false,
534 tf_warning_or_error);
535 expr = build_delete (type, expr, sfk_complete_destructor,
536 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
538 if (expr != error_mark_node)
539 finish_eh_cleanup (expr);
543 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
544 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
547 build_field_list (tree t, tree list, int *uses_unions_p)
553 /* Note whether or not T is a union. */
554 if (TREE_CODE (t) == UNION_TYPE)
557 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
559 /* Skip CONST_DECLs for enumeration constants and so forth. */
560 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
563 /* Keep track of whether or not any fields are unions. */
564 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
567 /* For an anonymous struct or union, we must recursively
568 consider the fields of the anonymous type. They can be
569 directly initialized from the constructor. */
570 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
572 /* Add this field itself. Synthesized copy constructors
573 initialize the entire aggregate. */
574 list = tree_cons (fields, NULL_TREE, list);
575 /* And now add the fields in the anonymous aggregate. */
576 list = build_field_list (TREE_TYPE (fields), list,
579 /* Add this field. */
580 else if (DECL_NAME (fields))
581 list = tree_cons (fields, NULL_TREE, list);
587 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
588 a FIELD_DECL or BINFO in T that needs initialization. The
589 TREE_VALUE gives the initializer, or list of initializer arguments.
591 Return a TREE_LIST containing all of the initializations required
592 for T, in the order in which they should be performed. The output
593 list has the same format as the input. */
596 sort_mem_initializers (tree t, tree mem_inits)
599 tree base, binfo, base_binfo;
602 VEC(tree,gc) *vbases;
606 /* Build up a list of initializations. The TREE_PURPOSE of entry
607 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
608 TREE_VALUE will be the constructor arguments, or NULL if no
609 explicit initialization was provided. */
610 sorted_inits = NULL_TREE;
612 /* Process the virtual bases. */
613 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
614 VEC_iterate (tree, vbases, i, base); i++)
615 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
617 /* Process the direct bases. */
618 for (binfo = TYPE_BINFO (t), i = 0;
619 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
620 if (!BINFO_VIRTUAL_P (base_binfo))
621 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
623 /* Process the non-static data members. */
624 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
625 /* Reverse the entire list of initializations, so that they are in
626 the order that they will actually be performed. */
627 sorted_inits = nreverse (sorted_inits);
629 /* If the user presented the initializers in an order different from
630 that in which they will actually occur, we issue a warning. Keep
631 track of the next subobject which can be explicitly initialized
632 without issuing a warning. */
633 next_subobject = sorted_inits;
635 /* Go through the explicit initializers, filling in TREE_PURPOSE in
637 for (init = mem_inits; init; init = TREE_CHAIN (init))
642 subobject = TREE_PURPOSE (init);
644 /* If the explicit initializers are in sorted order, then
645 SUBOBJECT will be NEXT_SUBOBJECT, or something following
647 for (subobject_init = next_subobject;
649 subobject_init = TREE_CHAIN (subobject_init))
650 if (TREE_PURPOSE (subobject_init) == subobject)
653 /* Issue a warning if the explicit initializer order does not
654 match that which will actually occur.
655 ??? Are all these on the correct lines? */
656 if (warn_reorder && !subobject_init)
658 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
659 warning (OPT_Wreorder, "%q+D will be initialized after",
660 TREE_PURPOSE (next_subobject));
662 warning (OPT_Wreorder, "base %qT will be initialized after",
663 TREE_PURPOSE (next_subobject));
664 if (TREE_CODE (subobject) == FIELD_DECL)
665 warning (OPT_Wreorder, " %q+#D", subobject);
667 warning (OPT_Wreorder, " base %qT", subobject);
668 warning_at (DECL_SOURCE_LOCATION (current_function_decl),
669 OPT_Wreorder, " when initialized here");
672 /* Look again, from the beginning of the list. */
675 subobject_init = sorted_inits;
676 while (TREE_PURPOSE (subobject_init) != subobject)
677 subobject_init = TREE_CHAIN (subobject_init);
680 /* It is invalid to initialize the same subobject more than
682 if (TREE_VALUE (subobject_init))
684 if (TREE_CODE (subobject) == FIELD_DECL)
685 error_at (DECL_SOURCE_LOCATION (current_function_decl),
686 "multiple initializations given for %qD",
689 error_at (DECL_SOURCE_LOCATION (current_function_decl),
690 "multiple initializations given for base %qT",
694 /* Record the initialization. */
695 TREE_VALUE (subobject_init) = TREE_VALUE (init);
696 next_subobject = subobject_init;
701 If a ctor-initializer specifies more than one mem-initializer for
702 multiple members of the same union (including members of
703 anonymous unions), the ctor-initializer is ill-formed. */
706 tree last_field = NULL_TREE;
707 for (init = sorted_inits; init; init = TREE_CHAIN (init))
713 /* Skip uninitialized members and base classes. */
714 if (!TREE_VALUE (init)
715 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
717 /* See if this field is a member of a union, or a member of a
718 structure contained in a union, etc. */
719 field = TREE_PURPOSE (init);
720 for (field_type = DECL_CONTEXT (field);
721 !same_type_p (field_type, t);
722 field_type = TYPE_CONTEXT (field_type))
723 if (TREE_CODE (field_type) == UNION_TYPE)
725 /* If this field is not a member of a union, skip it. */
726 if (TREE_CODE (field_type) != UNION_TYPE)
729 /* It's only an error if we have two initializers for the same
737 /* See if LAST_FIELD and the field initialized by INIT are
738 members of the same union. If so, there's a problem,
739 unless they're actually members of the same structure
740 which is itself a member of a union. For example, given:
742 union { struct { int i; int j; }; };
744 initializing both `i' and `j' makes sense. */
745 field_type = DECL_CONTEXT (field);
749 tree last_field_type;
751 last_field_type = DECL_CONTEXT (last_field);
754 if (same_type_p (last_field_type, field_type))
756 if (TREE_CODE (field_type) == UNION_TYPE)
757 error_at (DECL_SOURCE_LOCATION (current_function_decl),
758 "initializations for multiple members of %qT",
764 if (same_type_p (last_field_type, t))
767 last_field_type = TYPE_CONTEXT (last_field_type);
770 /* If we've reached the outermost class, then we're
772 if (same_type_p (field_type, t))
775 field_type = TYPE_CONTEXT (field_type);
786 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
787 is a TREE_LIST giving the explicit mem-initializer-list for the
788 constructor. The TREE_PURPOSE of each entry is a subobject (a
789 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
790 is a TREE_LIST giving the arguments to the constructor or
791 void_type_node for an empty list of arguments. */
794 emit_mem_initializers (tree mem_inits)
796 /* We will already have issued an error message about the fact that
797 the type is incomplete. */
798 if (!COMPLETE_TYPE_P (current_class_type))
801 /* Sort the mem-initializers into the order in which the
802 initializations should be performed. */
803 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
805 in_base_initializer = 1;
807 /* Initialize base classes. */
809 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
811 tree subobject = TREE_PURPOSE (mem_inits);
812 tree arguments = TREE_VALUE (mem_inits);
814 /* If these initializations are taking place in a copy constructor,
815 the base class should probably be explicitly initialized if there
816 is a user-defined constructor in the base class (other than the
817 default constructor, which will be called anyway). */
818 if (extra_warnings && !arguments
819 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
820 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
821 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Wextra,
822 "base class %q#T should be explicitly initialized in the "
824 BINFO_TYPE (subobject));
826 /* Initialize the base. */
827 if (BINFO_VIRTUAL_P (subobject))
828 construct_virtual_base (subobject, arguments);
833 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
835 expand_aggr_init_1 (subobject, NULL_TREE,
836 cp_build_indirect_ref (base_addr, NULL,
837 tf_warning_or_error),
840 tf_warning_or_error);
841 expand_cleanup_for_base (subobject, NULL_TREE);
844 mem_inits = TREE_CHAIN (mem_inits);
846 in_base_initializer = 0;
848 /* Initialize the vptrs. */
849 initialize_vtbl_ptrs (current_class_ptr);
851 /* Initialize the data members. */
854 perform_member_init (TREE_PURPOSE (mem_inits),
855 TREE_VALUE (mem_inits));
856 mem_inits = TREE_CHAIN (mem_inits);
860 /* Returns the address of the vtable (i.e., the value that should be
861 assigned to the vptr) for BINFO. */
864 build_vtbl_address (tree binfo)
866 tree binfo_for = binfo;
869 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
870 /* If this is a virtual primary base, then the vtable we want to store
871 is that for the base this is being used as the primary base of. We
872 can't simply skip the initialization, because we may be expanding the
873 inits of a subobject constructor where the virtual base layout
875 while (BINFO_PRIMARY_P (binfo_for))
876 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
878 /* Figure out what vtable BINFO's vtable is based on, and mark it as
880 vtbl = get_vtbl_decl_for_binfo (binfo_for);
881 TREE_USED (vtbl) = 1;
883 /* Now compute the address to use when initializing the vptr. */
884 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
885 if (TREE_CODE (vtbl) == VAR_DECL)
886 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
891 /* This code sets up the virtual function tables appropriate for
892 the pointer DECL. It is a one-ply initialization.
894 BINFO is the exact type that DECL is supposed to be. In
895 multiple inheritance, this might mean "C's A" if C : A, B. */
898 expand_virtual_init (tree binfo, tree decl)
903 /* Compute the initializer for vptr. */
904 vtbl = build_vtbl_address (binfo);
906 /* We may get this vptr from a VTT, if this is a subobject
907 constructor or subobject destructor. */
908 vtt_index = BINFO_VPTR_INDEX (binfo);
914 /* Compute the value to use, when there's a VTT. */
915 vtt_parm = current_vtt_parm;
916 vtbl2 = build2 (POINTER_PLUS_EXPR,
917 TREE_TYPE (vtt_parm),
920 vtbl2 = cp_build_indirect_ref (vtbl2, NULL, tf_warning_or_error);
921 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
923 /* The actual initializer is the VTT value only in the subobject
924 constructor. In maybe_clone_body we'll substitute NULL for
925 the vtt_parm in the case of the non-subobject constructor. */
926 vtbl = build3 (COND_EXPR,
928 build2 (EQ_EXPR, boolean_type_node,
929 current_in_charge_parm, integer_zero_node),
934 /* Compute the location of the vtpr. */
935 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, NULL,
936 tf_warning_or_error),
938 gcc_assert (vtbl_ptr != error_mark_node);
940 /* Assign the vtable to the vptr. */
941 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
942 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
943 tf_warning_or_error));
946 /* If an exception is thrown in a constructor, those base classes already
947 constructed must be destroyed. This function creates the cleanup
948 for BINFO, which has just been constructed. If FLAG is non-NULL,
949 it is a DECL which is nonzero when this base needs to be
953 expand_cleanup_for_base (tree binfo, tree flag)
957 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
960 /* Call the destructor. */
961 expr = build_special_member_call (current_class_ref,
962 base_dtor_identifier,
965 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
966 tf_warning_or_error);
968 expr = fold_build3 (COND_EXPR, void_type_node,
969 c_common_truthvalue_conversion (input_location, flag),
970 expr, integer_zero_node);
972 finish_eh_cleanup (expr);
975 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
979 construct_virtual_base (tree vbase, tree arguments)
985 /* If there are virtual base classes with destructors, we need to
986 emit cleanups to destroy them if an exception is thrown during
987 the construction process. These exception regions (i.e., the
988 period during which the cleanups must occur) begin from the time
989 the construction is complete to the end of the function. If we
990 create a conditional block in which to initialize the
991 base-classes, then the cleanup region for the virtual base begins
992 inside a block, and ends outside of that block. This situation
993 confuses the sjlj exception-handling code. Therefore, we do not
994 create a single conditional block, but one for each
995 initialization. (That way the cleanup regions always begin
996 in the outer block.) We trust the back end to figure out
997 that the FLAG will not change across initializations, and
998 avoid doing multiple tests. */
999 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
1000 inner_if_stmt = begin_if_stmt ();
1001 finish_if_stmt_cond (flag, inner_if_stmt);
1003 /* Compute the location of the virtual base. If we're
1004 constructing virtual bases, then we must be the most derived
1005 class. Therefore, we don't have to look up the virtual base;
1006 we already know where it is. */
1007 exp = convert_to_base_statically (current_class_ref, vbase);
1009 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1010 LOOKUP_COMPLAIN, tf_warning_or_error);
1011 finish_then_clause (inner_if_stmt);
1012 finish_if_stmt (inner_if_stmt);
1014 expand_cleanup_for_base (vbase, flag);
1017 /* Find the context in which this FIELD can be initialized. */
1020 initializing_context (tree field)
1022 tree t = DECL_CONTEXT (field);
1024 /* Anonymous union members can be initialized in the first enclosing
1025 non-anonymous union context. */
1026 while (t && ANON_AGGR_TYPE_P (t))
1027 t = TYPE_CONTEXT (t);
1031 /* Function to give error message if member initialization specification
1032 is erroneous. FIELD is the member we decided to initialize.
1033 TYPE is the type for which the initialization is being performed.
1034 FIELD must be a member of TYPE.
1036 MEMBER_NAME is the name of the member. */
1039 member_init_ok_or_else (tree field, tree type, tree member_name)
1041 if (field == error_mark_node)
1045 error ("class %qT does not have any field named %qD", type,
1049 if (TREE_CODE (field) == VAR_DECL)
1051 error ("%q#D is a static data member; it can only be "
1052 "initialized at its definition",
1056 if (TREE_CODE (field) != FIELD_DECL)
1058 error ("%q#D is not a non-static data member of %qT",
1062 if (initializing_context (field) != type)
1064 error ("class %qT does not have any field named %qD", type,
1072 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1073 is a _TYPE node or TYPE_DECL which names a base for that type.
1074 Check the validity of NAME, and return either the base _TYPE, base
1075 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1076 NULL_TREE and issue a diagnostic.
1078 An old style unnamed direct single base construction is permitted,
1079 where NAME is NULL. */
1082 expand_member_init (tree name)
1087 if (!current_class_ref)
1092 /* This is an obsolete unnamed base class initializer. The
1093 parser will already have warned about its use. */
1094 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1097 error ("unnamed initializer for %qT, which has no base classes",
1098 current_class_type);
1101 basetype = BINFO_TYPE
1102 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1105 error ("unnamed initializer for %qT, which uses multiple inheritance",
1106 current_class_type);
1110 else if (TYPE_P (name))
1112 basetype = TYPE_MAIN_VARIANT (name);
1113 name = TYPE_NAME (name);
1115 else if (TREE_CODE (name) == TYPE_DECL)
1116 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1118 basetype = NULL_TREE;
1127 if (current_template_parms)
1130 class_binfo = TYPE_BINFO (current_class_type);
1131 direct_binfo = NULL_TREE;
1132 virtual_binfo = NULL_TREE;
1134 /* Look for a direct base. */
1135 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1136 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1139 /* Look for a virtual base -- unless the direct base is itself
1141 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1142 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1144 /* [class.base.init]
1146 If a mem-initializer-id is ambiguous because it designates
1147 both a direct non-virtual base class and an inherited virtual
1148 base class, the mem-initializer is ill-formed. */
1149 if (direct_binfo && virtual_binfo)
1151 error ("%qD is both a direct base and an indirect virtual base",
1156 if (!direct_binfo && !virtual_binfo)
1158 if (CLASSTYPE_VBASECLASSES (current_class_type))
1159 error ("type %qT is not a direct or virtual base of %qT",
1160 basetype, current_class_type);
1162 error ("type %qT is not a direct base of %qT",
1163 basetype, current_class_type);
1167 return direct_binfo ? direct_binfo : virtual_binfo;
1171 if (TREE_CODE (name) == IDENTIFIER_NODE)
1172 field = lookup_field (current_class_type, name, 1, false);
1176 if (member_init_ok_or_else (field, current_class_type, name))
1183 /* This is like `expand_member_init', only it stores one aggregate
1186 INIT comes in two flavors: it is either a value which
1187 is to be stored in EXP, or it is a parameter list
1188 to go to a constructor, which will operate on EXP.
1189 If INIT is not a parameter list for a constructor, then set
1190 LOOKUP_ONLYCONVERTING.
1191 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1192 the initializer, if FLAGS is 0, then it is the (init) form.
1193 If `init' is a CONSTRUCTOR, then we emit a warning message,
1194 explaining that such initializations are invalid.
1196 If INIT resolves to a CALL_EXPR which happens to return
1197 something of the type we are looking for, then we know
1198 that we can safely use that call to perform the
1201 The virtual function table pointer cannot be set up here, because
1202 we do not really know its type.
1204 This never calls operator=().
1206 When initializing, nothing is CONST.
1208 A default copy constructor may have to be used to perform the
1211 A constructor or a conversion operator may have to be used to
1212 perform the initialization, but not both, as it would be ambiguous. */
1215 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1220 tree type = TREE_TYPE (exp);
1221 int was_const = TREE_READONLY (exp);
1222 int was_volatile = TREE_THIS_VOLATILE (exp);
1225 if (init == error_mark_node)
1226 return error_mark_node;
1228 TREE_READONLY (exp) = 0;
1229 TREE_THIS_VOLATILE (exp) = 0;
1231 if (init && TREE_CODE (init) != TREE_LIST)
1232 flags |= LOOKUP_ONLYCONVERTING;
1234 if (TREE_CODE (type) == ARRAY_TYPE)
1238 /* An array may not be initialized use the parenthesized
1239 initialization form -- unless the initializer is "()". */
1240 if (init && TREE_CODE (init) == TREE_LIST)
1242 if (complain & tf_error)
1243 error ("bad array initializer");
1244 return error_mark_node;
1246 /* Must arrange to initialize each element of EXP
1247 from elements of INIT. */
1248 itype = init ? TREE_TYPE (init) : NULL_TREE;
1249 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1250 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1251 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1252 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1253 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1254 /*explicit_value_init_p=*/false,
1255 itype && same_type_p (itype,
1258 TREE_READONLY (exp) = was_const;
1259 TREE_THIS_VOLATILE (exp) = was_volatile;
1260 TREE_TYPE (exp) = type;
1262 TREE_TYPE (init) = itype;
1266 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1267 /* Just know that we've seen something for this node. */
1268 TREE_USED (exp) = 1;
1270 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1271 destroy_temps = stmts_are_full_exprs_p ();
1272 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1273 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1274 init, LOOKUP_NORMAL|flags, complain);
1275 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1276 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1277 TREE_READONLY (exp) = was_const;
1278 TREE_THIS_VOLATILE (exp) = was_volatile;
1284 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1285 tsubst_flags_t complain)
1287 tree type = TREE_TYPE (exp);
1290 /* It fails because there may not be a constructor which takes
1291 its own type as the first (or only parameter), but which does
1292 take other types via a conversion. So, if the thing initializing
1293 the expression is a unit element of type X, first try X(X&),
1294 followed by initialization by X. If neither of these work
1295 out, then look hard. */
1297 VEC(tree,gc) *parms;
1299 if (init && TREE_CODE (init) != TREE_LIST
1300 && (flags & LOOKUP_ONLYCONVERTING))
1302 /* Base subobjects should only get direct-initialization. */
1303 gcc_assert (true_exp == exp);
1305 if (flags & DIRECT_BIND)
1306 /* Do nothing. We hit this in two cases: Reference initialization,
1307 where we aren't initializing a real variable, so we don't want
1308 to run a new constructor; and catching an exception, where we
1309 have already built up the constructor call so we could wrap it
1310 in an exception region. */;
1311 else if (BRACE_ENCLOSED_INITIALIZER_P (init)
1312 && CP_AGGREGATE_TYPE_P (type))
1314 /* A brace-enclosed initializer for an aggregate. */
1315 init = digest_init (type, init);
1318 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1320 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1321 /* We need to protect the initialization of a catch parm with a
1322 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1323 around the TARGET_EXPR for the copy constructor. See
1324 initialize_handler_parm. */
1326 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1327 TREE_OPERAND (init, 0));
1328 TREE_TYPE (init) = void_type_node;
1331 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1332 TREE_SIDE_EFFECTS (init) = 1;
1333 finish_expr_stmt (init);
1337 if (init == NULL_TREE)
1339 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1341 parms = make_tree_vector ();
1342 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1343 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1346 parms = make_tree_vector_single (init);
1348 if (true_exp == exp)
1349 ctor_name = complete_ctor_identifier;
1351 ctor_name = base_ctor_identifier;
1353 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1357 release_tree_vector (parms);
1359 if (TREE_SIDE_EFFECTS (rval))
1360 finish_expr_stmt (convert_to_void (rval, NULL, complain));
1363 /* This function is responsible for initializing EXP with INIT
1366 BINFO is the binfo of the type for who we are performing the
1367 initialization. For example, if W is a virtual base class of A and B,
1369 If we are initializing B, then W must contain B's W vtable, whereas
1370 were we initializing C, W must contain C's W vtable.
1372 TRUE_EXP is nonzero if it is the true expression being initialized.
1373 In this case, it may be EXP, or may just contain EXP. The reason we
1374 need this is because if EXP is a base element of TRUE_EXP, we
1375 don't necessarily know by looking at EXP where its virtual
1376 baseclass fields should really be pointing. But we do know
1377 from TRUE_EXP. In constructors, we don't know anything about
1378 the value being initialized.
1380 FLAGS is just passed to `build_new_method_call'. See that function
1381 for its description. */
1384 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1385 tsubst_flags_t complain)
1387 tree type = TREE_TYPE (exp);
1389 gcc_assert (init != error_mark_node && type != error_mark_node);
1390 gcc_assert (building_stmt_tree ());
1392 /* Use a function returning the desired type to initialize EXP for us.
1393 If the function is a constructor, and its first argument is
1394 NULL_TREE, know that it was meant for us--just slide exp on
1395 in and expand the constructor. Constructors now come
1398 if (init && TREE_CODE (exp) == VAR_DECL
1399 && COMPOUND_LITERAL_P (init))
1401 /* If store_init_value returns NULL_TREE, the INIT has been
1402 recorded as the DECL_INITIAL for EXP. That means there's
1403 nothing more we have to do. */
1404 init = store_init_value (exp, init, flags);
1406 finish_expr_stmt (init);
1410 /* If an explicit -- but empty -- initializer list was present,
1411 that's value-initialization. */
1412 if (init == void_type_node)
1414 /* If there's a user-provided constructor, we just call that. */
1415 if (type_has_user_provided_constructor (type))
1416 /* Fall through. */;
1417 /* If there isn't, but we still need to call the constructor,
1418 zero out the object first. */
1419 else if (TYPE_NEEDS_CONSTRUCTING (type))
1421 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1422 init = build2 (INIT_EXPR, type, exp, init);
1423 finish_expr_stmt (init);
1424 /* And then call the constructor. */
1426 /* If we don't need to mess with the constructor at all,
1427 then just zero out the object and we're done. */
1430 init = build2 (INIT_EXPR, type, exp, build_value_init_noctor (type));
1431 finish_expr_stmt (init);
1437 /* We know that expand_default_init can handle everything we want
1439 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1442 /* Report an error if TYPE is not a user-defined, class type. If
1443 OR_ELSE is nonzero, give an error message. */
1446 is_class_type (tree type, int or_else)
1448 if (type == error_mark_node)
1451 if (! CLASS_TYPE_P (type))
1454 error ("%qT is not a class type", type);
1461 get_type_value (tree name)
1463 if (name == error_mark_node)
1466 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1467 return IDENTIFIER_TYPE_VALUE (name);
1472 /* Build a reference to a member of an aggregate. This is not a C++
1473 `&', but really something which can have its address taken, and
1474 then act as a pointer to member, for example TYPE :: FIELD can have
1475 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1476 this expression is the operand of "&".
1478 @@ Prints out lousy diagnostics for operator <typename>
1481 @@ This function should be rewritten and placed in search.c. */
1484 build_offset_ref (tree type, tree member, bool address_p)
1487 tree basebinfo = NULL_TREE;
1489 /* class templates can come in as TEMPLATE_DECLs here. */
1490 if (TREE_CODE (member) == TEMPLATE_DECL)
1493 if (dependent_type_p (type) || type_dependent_expression_p (member))
1494 return build_qualified_name (NULL_TREE, type, member,
1495 /*template_p=*/false);
1497 gcc_assert (TYPE_P (type));
1498 if (! is_class_type (type, 1))
1499 return error_mark_node;
1501 gcc_assert (DECL_P (member) || BASELINK_P (member));
1502 /* Callers should call mark_used before this point. */
1503 gcc_assert (!DECL_P (member) || TREE_USED (member));
1505 if (!COMPLETE_TYPE_P (complete_type (type))
1506 && !TYPE_BEING_DEFINED (type))
1508 error ("incomplete type %qT does not have member %qD", type, member);
1509 return error_mark_node;
1512 /* Entities other than non-static members need no further
1514 if (TREE_CODE (member) == TYPE_DECL)
1516 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1517 return convert_from_reference (member);
1519 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1521 error ("invalid pointer to bit-field %qD", member);
1522 return error_mark_node;
1525 /* Set up BASEBINFO for member lookup. */
1526 decl = maybe_dummy_object (type, &basebinfo);
1528 /* A lot of this logic is now handled in lookup_member. */
1529 if (BASELINK_P (member))
1531 /* Go from the TREE_BASELINK to the member function info. */
1532 tree t = BASELINK_FUNCTIONS (member);
1534 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1536 /* Get rid of a potential OVERLOAD around it. */
1537 t = OVL_CURRENT (t);
1539 /* Unique functions are handled easily. */
1541 /* For non-static member of base class, we need a special rule
1542 for access checking [class.protected]:
1544 If the access is to form a pointer to member, the
1545 nested-name-specifier shall name the derived class
1546 (or any class derived from that class). */
1547 if (address_p && DECL_P (t)
1548 && DECL_NONSTATIC_MEMBER_P (t))
1549 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1551 perform_or_defer_access_check (basebinfo, t, t);
1553 if (DECL_STATIC_FUNCTION_P (t))
1558 TREE_TYPE (member) = unknown_type_node;
1560 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1561 /* We need additional test besides the one in
1562 check_accessibility_of_qualified_id in case it is
1563 a pointer to non-static member. */
1564 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1568 /* If MEMBER is non-static, then the program has fallen afoul of
1571 An id-expression that denotes a nonstatic data member or
1572 nonstatic member function of a class can only be used:
1574 -- as part of a class member access (_expr.ref_) in which the
1575 object-expression refers to the member's class or a class
1576 derived from that class, or
1578 -- to form a pointer to member (_expr.unary.op_), or
1580 -- in the body of a nonstatic member function of that class or
1581 of a class derived from that class (_class.mfct.nonstatic_), or
1583 -- in a mem-initializer for a constructor for that class or for
1584 a class derived from that class (_class.base.init_). */
1585 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1587 /* Build a representation of the qualified name suitable
1588 for use as the operand to "&" -- even though the "&" is
1589 not actually present. */
1590 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1591 /* In Microsoft mode, treat a non-static member function as if
1592 it were a pointer-to-member. */
1593 if (flag_ms_extensions)
1595 PTRMEM_OK_P (member) = 1;
1596 return cp_build_unary_op (ADDR_EXPR, member, 0,
1597 tf_warning_or_error);
1599 error ("invalid use of non-static member function %qD",
1600 TREE_OPERAND (member, 1));
1601 return error_mark_node;
1603 else if (TREE_CODE (member) == FIELD_DECL)
1605 error ("invalid use of non-static data member %qD", member);
1606 return error_mark_node;
1611 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1612 PTRMEM_OK_P (member) = 1;
1616 /* If DECL is a scalar enumeration constant or variable with a
1617 constant initializer, return the initializer (or, its initializers,
1618 recursively); otherwise, return DECL. If INTEGRAL_P, the
1619 initializer is only returned if DECL is an integral
1620 constant-expression. */
1623 constant_value_1 (tree decl, bool integral_p)
1625 while (TREE_CODE (decl) == CONST_DECL
1627 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1628 : (TREE_CODE (decl) == VAR_DECL
1629 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1632 /* Static data members in template classes may have
1633 non-dependent initializers. References to such non-static
1634 data members are not value-dependent, so we must retrieve the
1635 initializer here. The DECL_INITIAL will have the right type,
1636 but will not have been folded because that would prevent us
1637 from performing all appropriate semantic checks at
1638 instantiation time. */
1639 if (DECL_CLASS_SCOPE_P (decl)
1640 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1641 && uses_template_parms (CLASSTYPE_TI_ARGS
1642 (DECL_CONTEXT (decl))))
1644 ++processing_template_decl;
1645 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1646 --processing_template_decl;
1650 /* If DECL is a static data member in a template
1651 specialization, we must instantiate it here. The
1652 initializer for the static data member is not processed
1653 until needed; we need it now. */
1655 init = DECL_INITIAL (decl);
1657 if (init == error_mark_node)
1659 /* Initializers in templates are generally expanded during
1660 instantiation, so before that for const int i(2)
1661 INIT is a TREE_LIST with the actual initializer as
1663 if (processing_template_decl
1665 && TREE_CODE (init) == TREE_LIST
1666 && TREE_CHAIN (init) == NULL_TREE)
1667 init = TREE_VALUE (init);
1669 || !TREE_TYPE (init)
1671 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1672 : (!TREE_CONSTANT (init)
1673 /* Do not return an aggregate constant (of which
1674 string literals are a special case), as we do not
1675 want to make inadvertent copies of such entities,
1676 and we must be sure that their addresses are the
1678 || TREE_CODE (init) == CONSTRUCTOR
1679 || TREE_CODE (init) == STRING_CST)))
1681 decl = unshare_expr (init);
1686 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1687 constant of integral or enumeration type, then return that value.
1688 These are those variables permitted in constant expressions by
1692 integral_constant_value (tree decl)
1694 return constant_value_1 (decl, /*integral_p=*/true);
1697 /* A more relaxed version of integral_constant_value, used by the
1698 common C/C++ code and by the C++ front end for optimization
1702 decl_constant_value (tree decl)
1704 return constant_value_1 (decl,
1705 /*integral_p=*/processing_template_decl);
1708 /* Common subroutines of build_new and build_vec_delete. */
1710 /* Call the global __builtin_delete to delete ADDR. */
1713 build_builtin_delete_call (tree addr)
1715 mark_used (global_delete_fndecl);
1716 return build_call_n (global_delete_fndecl, 1, addr);
1719 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1720 the type of the object being allocated; otherwise, it's just TYPE.
1721 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1722 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1723 a vector of arguments to be provided as arguments to a placement
1724 new operator. This routine performs no semantic checks; it just
1725 creates and returns a NEW_EXPR. */
1728 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1729 VEC(tree,gc) *init, int use_global_new)
1734 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1735 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1736 permits us to distinguish the case of a missing initializer "new
1737 int" from an empty initializer "new int()". */
1739 init_list = NULL_TREE;
1740 else if (VEC_empty (tree, init))
1741 init_list = void_zero_node;
1743 init_list = build_tree_list_vec (init);
1745 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1746 build_tree_list_vec (placement), type, nelts,
1748 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1749 TREE_SIDE_EFFECTS (new_expr) = 1;
1754 /* Generate code for a new-expression, including calling the "operator
1755 new" function, initializing the object, and, if an exception occurs
1756 during construction, cleaning up. The arguments are as for
1757 build_raw_new_expr. This may change PLACEMENT and INIT. */
1760 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1761 VEC(tree,gc) **init, bool globally_qualified_p,
1762 tsubst_flags_t complain)
1765 /* True iff this is a call to "operator new[]" instead of just
1767 bool array_p = false;
1768 /* If ARRAY_P is true, the element type of the array. This is never
1769 an ARRAY_TYPE; for something like "new int[3][4]", the
1770 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1773 /* The type of the new-expression. (This type is always a pointer
1776 tree non_const_pointer_type;
1777 tree outer_nelts = NULL_TREE;
1778 tree alloc_call, alloc_expr;
1779 /* The address returned by the call to "operator new". This node is
1780 a VAR_DECL and is therefore reusable. */
1783 tree cookie_expr, init_expr;
1784 int nothrow, check_new;
1785 int use_java_new = 0;
1786 /* If non-NULL, the number of extra bytes to allocate at the
1787 beginning of the storage allocated for an array-new expression in
1788 order to store the number of elements. */
1789 tree cookie_size = NULL_TREE;
1790 tree placement_first;
1791 tree placement_expr = NULL_TREE;
1792 /* True if the function we are calling is a placement allocation
1794 bool placement_allocation_fn_p;
1795 /* True if the storage must be initialized, either by a constructor
1796 or due to an explicit new-initializer. */
1797 bool is_initialized;
1798 /* The address of the thing allocated, not including any cookie. In
1799 particular, if an array cookie is in use, DATA_ADDR is the
1800 address of the first array element. This node is a VAR_DECL, and
1801 is therefore reusable. */
1803 tree init_preeval_expr = NULL_TREE;
1807 outer_nelts = nelts;
1810 else if (TREE_CODE (type) == ARRAY_TYPE)
1813 nelts = array_type_nelts_top (type);
1814 outer_nelts = nelts;
1815 type = TREE_TYPE (type);
1818 /* If our base type is an array, then make sure we know how many elements
1820 for (elt_type = type;
1821 TREE_CODE (elt_type) == ARRAY_TYPE;
1822 elt_type = TREE_TYPE (elt_type))
1823 nelts = cp_build_binary_op (input_location,
1825 array_type_nelts_top (elt_type),
1828 if (TREE_CODE (elt_type) == VOID_TYPE)
1830 if (complain & tf_error)
1831 error ("invalid type %<void%> for new");
1832 return error_mark_node;
1835 if (abstract_virtuals_error (NULL_TREE, elt_type))
1836 return error_mark_node;
1838 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
1840 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
1841 && !type_has_user_provided_default_constructor (elt_type))
1843 if (complain & tf_error)
1844 error ("uninitialized const in %<new%> of %q#T", elt_type);
1845 return error_mark_node;
1848 size = size_in_bytes (elt_type);
1850 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1852 alloc_fn = NULL_TREE;
1854 /* If PLACEMENT is a single simple pointer type not passed by
1855 reference, prepare to capture it in a temporary variable. Do
1856 this now, since PLACEMENT will change in the calls below. */
1857 placement_first = NULL_TREE;
1858 if (VEC_length (tree, *placement) == 1
1859 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
1861 placement_first = VEC_index (tree, *placement, 0);
1863 /* Allocate the object. */
1864 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
1867 tree class_decl = build_java_class_ref (elt_type);
1868 static const char alloc_name[] = "_Jv_AllocObject";
1870 if (class_decl == error_mark_node)
1871 return error_mark_node;
1874 if (!get_global_value_if_present (get_identifier (alloc_name),
1877 if (complain & tf_error)
1878 error ("call to Java constructor with %qs undefined", alloc_name);
1879 return error_mark_node;
1881 else if (really_overloaded_fn (alloc_fn))
1883 if (complain & tf_error)
1884 error ("%qD should never be overloaded", alloc_fn);
1885 return error_mark_node;
1887 alloc_fn = OVL_CURRENT (alloc_fn);
1888 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1889 alloc_call = (cp_build_function_call
1891 build_tree_list (NULL_TREE, class_addr),
1894 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
1896 error ("Java class %q#T object allocated using placement new", elt_type);
1897 return error_mark_node;
1904 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1906 if (!globally_qualified_p
1907 && CLASS_TYPE_P (elt_type)
1909 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1910 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1912 /* Use a class-specific operator new. */
1913 /* If a cookie is required, add some extra space. */
1914 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1916 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1917 size = size_binop (PLUS_EXPR, size, cookie_size);
1919 /* Create the argument list. */
1920 VEC_safe_insert (tree, gc, *placement, 0, size);
1921 /* Do name-lookup to find the appropriate operator. */
1922 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1923 if (fns == NULL_TREE)
1925 if (complain & tf_error)
1926 error ("no suitable %qD found in class %qT", fnname, elt_type);
1927 return error_mark_node;
1929 if (TREE_CODE (fns) == TREE_LIST)
1931 if (complain & tf_error)
1933 error ("request for member %qD is ambiguous", fnname);
1934 print_candidates (fns);
1936 return error_mark_node;
1938 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1940 /*conversion_path=*/NULL_TREE,
1947 /* Use a global operator new. */
1948 /* See if a cookie might be required. */
1949 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1950 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1952 cookie_size = NULL_TREE;
1954 alloc_call = build_operator_new_call (fnname, placement,
1955 &size, &cookie_size,
1960 if (alloc_call == error_mark_node)
1961 return error_mark_node;
1963 gcc_assert (alloc_fn != NULL_TREE);
1965 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
1966 into a temporary variable. */
1967 if (!processing_template_decl
1968 && placement_first != NULL_TREE
1969 && TREE_CODE (alloc_call) == CALL_EXPR
1970 && call_expr_nargs (alloc_call) == 2
1971 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
1972 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
1974 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
1976 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
1977 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
1979 placement_expr = get_target_expr (placement_first);
1980 CALL_EXPR_ARG (alloc_call, 1)
1981 = convert (TREE_TYPE (placement_arg), placement_expr);
1985 /* In the simple case, we can stop now. */
1986 pointer_type = build_pointer_type (type);
1987 if (!cookie_size && !is_initialized)
1988 return build_nop (pointer_type, alloc_call);
1990 /* Store the result of the allocation call in a variable so that we can
1991 use it more than once. */
1992 alloc_expr = get_target_expr (alloc_call);
1993 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1995 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1996 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1997 alloc_call = TREE_OPERAND (alloc_call, 1);
1999 /* Now, check to see if this function is actually a placement
2000 allocation function. This can happen even when PLACEMENT is NULL
2001 because we might have something like:
2003 struct S { void* operator new (size_t, int i = 0); };
2005 A call to `new S' will get this allocation function, even though
2006 there is no explicit placement argument. If there is more than
2007 one argument, or there are variable arguments, then this is a
2008 placement allocation function. */
2009 placement_allocation_fn_p
2010 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2011 || varargs_function_p (alloc_fn));
2013 /* Preevaluate the placement args so that we don't reevaluate them for a
2014 placement delete. */
2015 if (placement_allocation_fn_p)
2018 stabilize_call (alloc_call, &inits);
2020 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2024 /* unless an allocation function is declared with an empty excep-
2025 tion-specification (_except.spec_), throw(), it indicates failure to
2026 allocate storage by throwing a bad_alloc exception (clause _except_,
2027 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2028 cation function is declared with an empty exception-specification,
2029 throw(), it returns null to indicate failure to allocate storage and a
2030 non-null pointer otherwise.
2032 So check for a null exception spec on the op new we just called. */
2034 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2035 check_new = (flag_check_new || nothrow) && ! use_java_new;
2043 /* Adjust so we're pointing to the start of the object. */
2044 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2045 alloc_node, cookie_size);
2047 /* Store the number of bytes allocated so that we can know how
2048 many elements to destroy later. We use the last sizeof
2049 (size_t) bytes to store the number of elements. */
2050 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2051 cookie_ptr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2052 alloc_node, cookie_ptr);
2053 size_ptr_type = build_pointer_type (sizetype);
2054 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2055 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2057 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2059 if (targetm.cxx.cookie_has_size ())
2061 /* Also store the element size. */
2062 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2063 fold_build1 (NEGATE_EXPR, sizetype,
2064 size_in_bytes (sizetype)));
2066 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2067 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2068 size_in_bytes (elt_type));
2069 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2070 cookie, cookie_expr);
2075 cookie_expr = NULL_TREE;
2076 data_addr = alloc_node;
2079 /* Now use a pointer to the type we've actually allocated. */
2081 /* But we want to operate on a non-const version to start with,
2082 since we'll be modifying the elements. */
2083 non_const_pointer_type = build_pointer_type
2084 (cp_build_qualified_type (type, TYPE_QUALS (type) & ~TYPE_QUAL_CONST));
2086 data_addr = fold_convert (non_const_pointer_type, data_addr);
2087 /* Any further uses of alloc_node will want this type, too. */
2088 alloc_node = fold_convert (non_const_pointer_type, alloc_node);
2090 /* Now initialize the allocated object. Note that we preevaluate the
2091 initialization expression, apart from the actual constructor call or
2092 assignment--we do this because we want to delay the allocation as long
2093 as possible in order to minimize the size of the exception region for
2094 placement delete. */
2098 bool explicit_value_init_p = false;
2100 if (*init != NULL && VEC_empty (tree, *init))
2103 explicit_value_init_p = true;
2108 tree vecinit = NULL_TREE;
2109 if (*init && VEC_length (tree, *init) == 1
2110 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0))
2111 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0)))
2113 tree arraytype, domain;
2114 vecinit = VEC_index (tree, *init, 0);
2115 if (TREE_CONSTANT (nelts))
2116 domain = compute_array_index_type (NULL_TREE, nelts);
2120 if (CONSTRUCTOR_NELTS (vecinit) > 0)
2121 warning (0, "non-constant array size in new, unable to "
2122 "verify length of initializer-list");
2124 arraytype = build_cplus_array_type (type, domain);
2125 vecinit = digest_init (arraytype, vecinit);
2129 if (complain & tf_error)
2130 permerror (input_location, "ISO C++ forbids initialization in array new");
2132 return error_mark_node;
2133 vecinit = build_tree_list_vec (*init);
2136 = build_vec_init (data_addr,
2137 cp_build_binary_op (input_location,
2138 MINUS_EXPR, outer_nelts,
2142 explicit_value_init_p,
2146 /* An array initialization is stable because the initialization
2147 of each element is a full-expression, so the temporaries don't
2153 init_expr = cp_build_indirect_ref (data_addr, NULL, complain);
2155 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2157 init_expr = build_special_member_call (init_expr,
2158 complete_ctor_identifier,
2163 else if (explicit_value_init_p)
2165 /* Something like `new int()'. */
2166 init_expr = build2 (INIT_EXPR, type,
2167 init_expr, build_value_init (type));
2173 /* We are processing something like `new int (10)', which
2174 means allocate an int, and initialize it with 10. */
2176 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2177 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2180 stable = stabilize_init (init_expr, &init_preeval_expr);
2183 if (init_expr == error_mark_node)
2184 return error_mark_node;
2186 /* If any part of the object initialization terminates by throwing an
2187 exception and a suitable deallocation function can be found, the
2188 deallocation function is called to free the memory in which the
2189 object was being constructed, after which the exception continues
2190 to propagate in the context of the new-expression. If no
2191 unambiguous matching deallocation function can be found,
2192 propagating the exception does not cause the object's memory to be
2194 if (flag_exceptions && ! use_java_new)
2196 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2199 /* The Standard is unclear here, but the right thing to do
2200 is to use the same method for finding deallocation
2201 functions that we use for finding allocation functions. */
2202 cleanup = (build_op_delete_call
2206 globally_qualified_p,
2207 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2213 /* This is much simpler if we were able to preevaluate all of
2214 the arguments to the constructor call. */
2216 /* CLEANUP is compiler-generated, so no diagnostics. */
2217 TREE_NO_WARNING (cleanup) = true;
2218 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2219 init_expr, cleanup);
2220 /* Likewise, this try-catch is compiler-generated. */
2221 TREE_NO_WARNING (init_expr) = true;
2224 /* Ack! First we allocate the memory. Then we set our sentry
2225 variable to true, and expand a cleanup that deletes the
2226 memory if sentry is true. Then we run the constructor, and
2227 finally clear the sentry.
2229 We need to do this because we allocate the space first, so
2230 if there are any temporaries with cleanups in the
2231 constructor args and we weren't able to preevaluate them, we
2232 need this EH region to extend until end of full-expression
2233 to preserve nesting. */
2235 tree end, sentry, begin;
2237 begin = get_target_expr (boolean_true_node);
2238 CLEANUP_EH_ONLY (begin) = 1;
2240 sentry = TARGET_EXPR_SLOT (begin);
2242 /* CLEANUP is compiler-generated, so no diagnostics. */
2243 TREE_NO_WARNING (cleanup) = true;
2245 TARGET_EXPR_CLEANUP (begin)
2246 = build3 (COND_EXPR, void_type_node, sentry,
2247 cleanup, void_zero_node);
2249 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2250 sentry, boolean_false_node);
2253 = build2 (COMPOUND_EXPR, void_type_node, begin,
2254 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2256 /* Likewise, this is compiler-generated. */
2257 TREE_NO_WARNING (init_expr) = true;
2262 init_expr = NULL_TREE;
2264 /* Now build up the return value in reverse order. */
2269 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2271 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2273 if (rval == data_addr)
2274 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2275 and return the call (which doesn't need to be adjusted). */
2276 rval = TARGET_EXPR_INITIAL (alloc_expr);
2281 tree ifexp = cp_build_binary_op (input_location,
2282 NE_EXPR, alloc_node,
2285 rval = build_conditional_expr (ifexp, rval, alloc_node,
2289 /* Perform the allocation before anything else, so that ALLOC_NODE
2290 has been initialized before we start using it. */
2291 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2294 if (init_preeval_expr)
2295 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2297 /* A new-expression is never an lvalue. */
2298 gcc_assert (!lvalue_p (rval));
2300 return convert (pointer_type, rval);
2303 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2304 is a vector of placement-new arguments (or NULL if none). If NELTS
2305 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2306 is not NULL, then this is an array-new allocation; TYPE is the type
2307 of the elements in the array and NELTS is the number of elements in
2308 the array. *INIT, if non-NULL, is the initializer for the new
2309 object, or an empty vector to indicate an initializer of "()". If
2310 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2311 rather than just "new". This may change PLACEMENT and INIT. */
2314 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2315 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2318 VEC(tree,gc) *orig_placement = NULL;
2319 tree orig_nelts = NULL_TREE;
2320 VEC(tree,gc) *orig_init = NULL;
2322 if (type == error_mark_node)
2323 return error_mark_node;
2325 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2327 tree auto_node = type_uses_auto (type);
2328 if (auto_node && describable_type (VEC_index (tree, *init, 0)))
2329 type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node);
2332 if (processing_template_decl)
2334 if (dependent_type_p (type)
2335 || any_type_dependent_arguments_p (*placement)
2336 || (nelts && type_dependent_expression_p (nelts))
2337 || any_type_dependent_arguments_p (*init))
2338 return build_raw_new_expr (*placement, type, nelts, *init,
2341 orig_placement = make_tree_vector_copy (*placement);
2343 orig_init = make_tree_vector_copy (*init);
2345 make_args_non_dependent (*placement);
2347 nelts = build_non_dependent_expr (nelts);
2348 make_args_non_dependent (*init);
2353 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2355 if (complain & tf_error)
2356 permerror (input_location, "size in array new must have integral type");
2358 return error_mark_node;
2360 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2363 /* ``A reference cannot be created by the new operator. A reference
2364 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2365 returned by new.'' ARM 5.3.3 */
2366 if (TREE_CODE (type) == REFERENCE_TYPE)
2368 if (complain & tf_error)
2369 error ("new cannot be applied to a reference type");
2371 return error_mark_node;
2372 type = TREE_TYPE (type);
2375 if (TREE_CODE (type) == FUNCTION_TYPE)
2377 if (complain & tf_error)
2378 error ("new cannot be applied to a function type");
2379 return error_mark_node;
2382 /* The type allocated must be complete. If the new-type-id was
2383 "T[N]" then we are just checking that "T" is complete here, but
2384 that is equivalent, since the value of "N" doesn't matter. */
2385 if (!complete_type_or_else (type, NULL_TREE))
2386 return error_mark_node;
2388 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2389 if (rval == error_mark_node)
2390 return error_mark_node;
2392 if (processing_template_decl)
2394 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2395 orig_init, use_global_new);
2396 release_tree_vector (orig_placement);
2397 release_tree_vector (orig_init);
2401 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2402 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2403 TREE_NO_WARNING (rval) = 1;
2408 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2411 build_java_class_ref (tree type)
2413 tree name = NULL_TREE, class_decl;
2414 static tree CL_suffix = NULL_TREE;
2415 if (CL_suffix == NULL_TREE)
2416 CL_suffix = get_identifier("class$");
2417 if (jclass_node == NULL_TREE)
2419 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2420 if (jclass_node == NULL_TREE)
2422 error ("call to Java constructor, while %<jclass%> undefined");
2423 return error_mark_node;
2425 jclass_node = TREE_TYPE (jclass_node);
2428 /* Mangle the class$ field. */
2431 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2432 if (DECL_NAME (field) == CL_suffix)
2434 mangle_decl (field);
2435 name = DECL_ASSEMBLER_NAME (field);
2440 error ("can't find %<class$%> in %qT", type);
2441 return error_mark_node;
2445 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2446 if (class_decl == NULL_TREE)
2448 class_decl = build_decl (input_location,
2449 VAR_DECL, name, TREE_TYPE (jclass_node));
2450 TREE_STATIC (class_decl) = 1;
2451 DECL_EXTERNAL (class_decl) = 1;
2452 TREE_PUBLIC (class_decl) = 1;
2453 DECL_ARTIFICIAL (class_decl) = 1;
2454 DECL_IGNORED_P (class_decl) = 1;
2455 pushdecl_top_level (class_decl);
2456 make_decl_rtl (class_decl);
2462 build_vec_delete_1 (tree base, tree maxindex, tree type,
2463 special_function_kind auto_delete_vec, int use_global_delete)
2466 tree ptype = build_pointer_type (type = complete_type (type));
2467 tree size_exp = size_in_bytes (type);
2469 /* Temporary variables used by the loop. */
2470 tree tbase, tbase_init;
2472 /* This is the body of the loop that implements the deletion of a
2473 single element, and moves temp variables to next elements. */
2476 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2479 /* This is the thing that governs what to do after the loop has run. */
2480 tree deallocate_expr = 0;
2482 /* This is the BIND_EXPR which holds the outermost iterator of the
2483 loop. It is convenient to set this variable up and test it before
2484 executing any other code in the loop.
2485 This is also the containing expression returned by this function. */
2486 tree controller = NULL_TREE;
2489 /* We should only have 1-D arrays here. */
2490 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2492 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2495 /* The below is short by the cookie size. */
2496 virtual_size = size_binop (MULT_EXPR, size_exp,
2497 convert (sizetype, maxindex));
2499 tbase = create_temporary_var (ptype);
2500 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2501 fold_build2 (POINTER_PLUS_EXPR, ptype,
2502 fold_convert (ptype, base),
2504 tf_warning_or_error);
2505 DECL_REGISTER (tbase) = 1;
2506 controller = build3 (BIND_EXPR, void_type_node, tbase,
2507 NULL_TREE, NULL_TREE);
2508 TREE_SIDE_EFFECTS (controller) = 1;
2510 body = build1 (EXIT_EXPR, void_type_node,
2511 build2 (EQ_EXPR, boolean_type_node, tbase,
2512 fold_convert (ptype, base)));
2513 tmp = fold_build1 (NEGATE_EXPR, sizetype, size_exp);
2514 body = build_compound_expr
2516 body, cp_build_modify_expr (tbase, NOP_EXPR,
2517 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2518 tf_warning_or_error));
2519 body = build_compound_expr
2521 body, build_delete (ptype, tbase, sfk_complete_destructor,
2522 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2524 loop = build1 (LOOP_EXPR, void_type_node, body);
2525 loop = build_compound_expr (input_location, tbase_init, loop);
2528 /* If the delete flag is one, or anything else with the low bit set,
2529 delete the storage. */
2530 if (auto_delete_vec != sfk_base_destructor)
2534 /* The below is short by the cookie size. */
2535 virtual_size = size_binop (MULT_EXPR, size_exp,
2536 convert (sizetype, maxindex));
2538 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2545 cookie_size = targetm.cxx.get_cookie_size (type);
2547 = cp_convert (ptype,
2548 cp_build_binary_op (input_location,
2550 cp_convert (string_type_node,
2553 tf_warning_or_error));
2554 /* True size with header. */
2555 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2558 if (auto_delete_vec == sfk_deleting_destructor)
2559 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2560 base_tbd, virtual_size,
2561 use_global_delete & 1,
2562 /*placement=*/NULL_TREE,
2563 /*alloc_fn=*/NULL_TREE);
2567 if (!deallocate_expr)
2570 body = deallocate_expr;
2572 body = build_compound_expr (input_location, body, deallocate_expr);
2575 body = integer_zero_node;
2577 /* Outermost wrapper: If pointer is null, punt. */
2578 body = fold_build3 (COND_EXPR, void_type_node,
2579 fold_build2 (NE_EXPR, boolean_type_node, base,
2580 convert (TREE_TYPE (base),
2581 integer_zero_node)),
2582 body, integer_zero_node);
2583 body = build1 (NOP_EXPR, void_type_node, body);
2587 TREE_OPERAND (controller, 1) = body;
2591 if (TREE_CODE (base) == SAVE_EXPR)
2592 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2593 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2595 return convert_to_void (body, /*implicit=*/NULL, tf_warning_or_error);
2598 /* Create an unnamed variable of the indicated TYPE. */
2601 create_temporary_var (tree type)
2605 decl = build_decl (input_location,
2606 VAR_DECL, NULL_TREE, type);
2607 TREE_USED (decl) = 1;
2608 DECL_ARTIFICIAL (decl) = 1;
2609 DECL_IGNORED_P (decl) = 1;
2610 DECL_CONTEXT (decl) = current_function_decl;
2615 /* Create a new temporary variable of the indicated TYPE, initialized
2618 It is not entered into current_binding_level, because that breaks
2619 things when it comes time to do final cleanups (which take place
2620 "outside" the binding contour of the function). */
2623 get_temp_regvar (tree type, tree init)
2627 decl = create_temporary_var (type);
2628 add_decl_expr (decl);
2630 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2631 tf_warning_or_error));
2636 /* `build_vec_init' returns tree structure that performs
2637 initialization of a vector of aggregate types.
2639 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2640 to the first element, of POINTER_TYPE.
2641 MAXINDEX is the maximum index of the array (one less than the
2642 number of elements). It is only used if BASE is a pointer or
2643 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2645 INIT is the (possibly NULL) initializer.
2647 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2648 elements in the array are value-initialized.
2650 FROM_ARRAY is 0 if we should init everything with INIT
2651 (i.e., every element initialized from INIT).
2652 FROM_ARRAY is 1 if we should index into INIT in parallel
2653 with initialization of DECL.
2654 FROM_ARRAY is 2 if we should index into INIT in parallel,
2655 but use assignment instead of initialization. */
2658 build_vec_init (tree base, tree maxindex, tree init,
2659 bool explicit_value_init_p,
2660 int from_array, tsubst_flags_t complain)
2663 tree base2 = NULL_TREE;
2665 tree itype = NULL_TREE;
2667 /* The type of BASE. */
2668 tree atype = TREE_TYPE (base);
2669 /* The type of an element in the array. */
2670 tree type = TREE_TYPE (atype);
2671 /* The element type reached after removing all outer array
2673 tree inner_elt_type;
2674 /* The type of a pointer to an element in the array. */
2679 tree try_block = NULL_TREE;
2680 int num_initialized_elts = 0;
2683 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2684 maxindex = array_type_nelts (atype);
2686 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2687 return error_mark_node;
2689 if (explicit_value_init_p)
2692 inner_elt_type = strip_array_types (type);
2694 && TREE_CODE (atype) == ARRAY_TYPE
2696 ? (!CLASS_TYPE_P (inner_elt_type)
2697 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2698 : !TYPE_NEEDS_CONSTRUCTING (type))
2699 && ((TREE_CODE (init) == CONSTRUCTOR
2700 /* Don't do this if the CONSTRUCTOR might contain something
2701 that might throw and require us to clean up. */
2702 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2703 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2706 /* Do non-default initialization of trivial arrays resulting from
2707 brace-enclosed initializers. In this case, digest_init and
2708 store_constructor will handle the semantics for us. */
2710 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2714 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2715 size = size_in_bytes (type);
2716 if (TREE_CODE (atype) == ARRAY_TYPE)
2718 ptype = build_pointer_type (type);
2719 base = cp_convert (ptype, decay_conversion (base));
2724 /* The code we are generating looks like:
2728 ptrdiff_t iterator = maxindex;
2730 for (; iterator != -1; --iterator) {
2731 ... initialize *t1 ...
2735 ... destroy elements that were constructed ...
2740 We can omit the try and catch blocks if we know that the
2741 initialization will never throw an exception, or if the array
2742 elements do not have destructors. We can omit the loop completely if
2743 the elements of the array do not have constructors.
2745 We actually wrap the entire body of the above in a STMT_EXPR, for
2748 When copying from array to another, when the array elements have
2749 only trivial copy constructors, we should use __builtin_memcpy
2750 rather than generating a loop. That way, we could take advantage
2751 of whatever cleverness the back end has for dealing with copies
2752 of blocks of memory. */
2754 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2755 destroy_temps = stmts_are_full_exprs_p ();
2756 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2757 rval = get_temp_regvar (ptype, base);
2758 base = get_temp_regvar (ptype, rval);
2759 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2761 /* Protect the entire array initialization so that we can destroy
2762 the partially constructed array if an exception is thrown.
2763 But don't do this if we're assigning. */
2764 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2767 try_block = begin_try_block ();
2770 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2772 /* Do non-default initialization of non-trivial arrays resulting from
2773 brace-enclosed initializers. */
2774 unsigned HOST_WIDE_INT idx;
2778 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2780 tree baseref = build1 (INDIRECT_REF, type, base);
2782 num_initialized_elts++;
2784 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2785 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2786 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2788 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2790 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2792 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2794 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2798 /* Clear out INIT so that we don't get confused below. */
2801 else if (from_array)
2803 /* If initializing one array from another, initialize element by
2804 element. We rely upon the below calls the do argument
2808 base2 = decay_conversion (init);
2809 itype = TREE_TYPE (base2);
2810 base2 = get_temp_regvar (itype, base2);
2811 itype = TREE_TYPE (itype);
2813 else if (TYPE_LANG_SPECIFIC (type)
2814 && TYPE_NEEDS_CONSTRUCTING (type)
2815 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2817 if (complain & tf_error)
2818 error ("initializer ends prematurely");
2819 return error_mark_node;
2823 /* Now, default-initialize any remaining elements. We don't need to
2824 do that if a) the type does not need constructing, or b) we've
2825 already initialized all the elements.
2827 We do need to keep going if we're copying an array. */
2830 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
2831 && ! (host_integerp (maxindex, 0)
2832 && (num_initialized_elts
2833 == tree_low_cst (maxindex, 0) + 1))))
2835 /* If the ITERATOR is equal to -1, then we don't have to loop;
2836 we've already initialized all the elements. */
2841 for_stmt = begin_for_stmt ();
2842 finish_for_init_stmt (for_stmt);
2843 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2844 build_int_cst (TREE_TYPE (iterator), -1)),
2846 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2850 to = build1 (INDIRECT_REF, type, base);
2857 from = build1 (INDIRECT_REF, itype, base2);
2861 if (from_array == 2)
2862 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2864 else if (TYPE_NEEDS_CONSTRUCTING (type))
2865 elt_init = build_aggr_init (to, from, 0, complain);
2867 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2872 else if (TREE_CODE (type) == ARRAY_TYPE)
2876 ("cannot initialize multi-dimensional array with initializer");
2877 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2879 explicit_value_init_p,
2882 else if (explicit_value_init_p)
2883 elt_init = build2 (INIT_EXPR, type, to,
2884 build_value_init (type));
2887 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
2888 elt_init = build_aggr_init (to, init, 0, complain);
2891 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2892 finish_expr_stmt (elt_init);
2893 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2895 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2898 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
2901 finish_for_stmt (for_stmt);
2904 /* Make sure to cleanup any partially constructed elements. */
2905 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2909 tree m = cp_build_binary_op (input_location,
2910 MINUS_EXPR, maxindex, iterator,
2913 /* Flatten multi-dimensional array since build_vec_delete only
2914 expects one-dimensional array. */
2915 if (TREE_CODE (type) == ARRAY_TYPE)
2916 m = cp_build_binary_op (input_location,
2918 array_type_nelts_total (type),
2921 finish_cleanup_try_block (try_block);
2922 e = build_vec_delete_1 (rval, m,
2923 inner_elt_type, sfk_base_destructor,
2924 /*use_global_delete=*/0);
2925 finish_cleanup (e, try_block);
2928 /* The value of the array initialization is the array itself, RVAL
2929 is a pointer to the first element. */
2930 finish_stmt_expr_expr (rval, stmt_expr);
2932 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2934 /* Now make the result have the correct type. */
2935 if (TREE_CODE (atype) == ARRAY_TYPE)
2937 atype = build_pointer_type (atype);
2938 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2939 stmt_expr = cp_build_indirect_ref (stmt_expr, NULL, complain);
2940 TREE_NO_WARNING (stmt_expr) = 1;
2943 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2947 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2951 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2957 case sfk_complete_destructor:
2958 name = complete_dtor_identifier;
2961 case sfk_base_destructor:
2962 name = base_dtor_identifier;
2965 case sfk_deleting_destructor:
2966 name = deleting_dtor_identifier;
2972 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2973 return build_new_method_call (exp, fn,
2975 /*conversion_path=*/NULL_TREE,
2978 tf_warning_or_error);
2981 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2982 ADDR is an expression which yields the store to be destroyed.
2983 AUTO_DELETE is the name of the destructor to call, i.e., either
2984 sfk_complete_destructor, sfk_base_destructor, or
2985 sfk_deleting_destructor.
2987 FLAGS is the logical disjunction of zero or more LOOKUP_
2988 flags. See cp-tree.h for more info. */
2991 build_delete (tree type, tree addr, special_function_kind auto_delete,
2992 int flags, int use_global_delete)
2996 if (addr == error_mark_node)
2997 return error_mark_node;
2999 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3000 set to `error_mark_node' before it gets properly cleaned up. */
3001 if (type == error_mark_node)
3002 return error_mark_node;
3004 type = TYPE_MAIN_VARIANT (type);
3006 if (TREE_CODE (type) == POINTER_TYPE)
3008 bool complete_p = true;
3010 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3011 if (TREE_CODE (type) == ARRAY_TYPE)
3014 /* We don't want to warn about delete of void*, only other
3015 incomplete types. Deleting other incomplete types
3016 invokes undefined behavior, but it is not ill-formed, so
3017 compile to something that would even do The Right Thing
3018 (TM) should the type have a trivial dtor and no delete
3020 if (!VOID_TYPE_P (type))
3022 complete_type (type);
3023 if (!COMPLETE_TYPE_P (type))
3025 if (warning (0, "possible problem detected in invocation of "
3026 "delete operator:"))
3028 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3029 inform (input_location, "neither the destructor nor the class-specific "
3030 "operator delete will be called, even if they are "
3031 "declared when the class is defined.");
3036 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3037 /* Call the builtin operator delete. */
3038 return build_builtin_delete_call (addr);
3039 if (TREE_SIDE_EFFECTS (addr))
3040 addr = save_expr (addr);
3042 /* Throw away const and volatile on target type of addr. */
3043 addr = convert_force (build_pointer_type (type), addr, 0);
3045 else if (TREE_CODE (type) == ARRAY_TYPE)
3049 if (TYPE_DOMAIN (type) == NULL_TREE)
3051 error ("unknown array size in delete");
3052 return error_mark_node;
3054 return build_vec_delete (addr, array_type_nelts (type),
3055 auto_delete, use_global_delete);
3059 /* Don't check PROTECT here; leave that decision to the
3060 destructor. If the destructor is accessible, call it,
3061 else report error. */
3062 addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error);
3063 if (TREE_SIDE_EFFECTS (addr))
3064 addr = save_expr (addr);
3066 addr = convert_force (build_pointer_type (type), addr, 0);
3069 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3071 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3073 if (auto_delete != sfk_deleting_destructor)
3074 return void_zero_node;
3076 return build_op_delete_call (DELETE_EXPR, addr,
3077 cxx_sizeof_nowarn (type),
3079 /*placement=*/NULL_TREE,
3080 /*alloc_fn=*/NULL_TREE);
3084 tree head = NULL_TREE;
3085 tree do_delete = NULL_TREE;
3088 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3089 lazily_declare_fn (sfk_destructor, type);
3091 /* For `::delete x', we must not use the deleting destructor
3092 since then we would not be sure to get the global `operator
3094 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3096 /* We will use ADDR multiple times so we must save it. */
3097 addr = save_expr (addr);
3098 head = get_target_expr (build_headof (addr));
3099 /* Delete the object. */
3100 do_delete = build_builtin_delete_call (head);
3101 /* Otherwise, treat this like a complete object destructor
3103 auto_delete = sfk_complete_destructor;
3105 /* If the destructor is non-virtual, there is no deleting
3106 variant. Instead, we must explicitly call the appropriate
3107 `operator delete' here. */
3108 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3109 && auto_delete == sfk_deleting_destructor)
3111 /* We will use ADDR multiple times so we must save it. */
3112 addr = save_expr (addr);
3113 /* Build the call. */
3114 do_delete = build_op_delete_call (DELETE_EXPR,
3116 cxx_sizeof_nowarn (type),
3118 /*placement=*/NULL_TREE,
3119 /*alloc_fn=*/NULL_TREE);
3120 /* Call the complete object destructor. */
3121 auto_delete = sfk_complete_destructor;
3123 else if (auto_delete == sfk_deleting_destructor
3124 && TYPE_GETS_REG_DELETE (type))
3126 /* Make sure we have access to the member op delete, even though
3127 we'll actually be calling it from the destructor. */
3128 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3130 /*placement=*/NULL_TREE,
3131 /*alloc_fn=*/NULL_TREE);
3134 expr = build_dtor_call (cp_build_indirect_ref (addr, NULL,
3135 tf_warning_or_error),
3136 auto_delete, flags);
3138 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3140 /* We need to calculate this before the dtor changes the vptr. */
3142 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3144 if (flags & LOOKUP_DESTRUCTOR)
3145 /* Explicit destructor call; don't check for null pointer. */
3146 ifexp = integer_one_node;
3148 /* Handle deleting a null pointer. */
3149 ifexp = fold (cp_build_binary_op (input_location,
3150 NE_EXPR, addr, integer_zero_node,
3151 tf_warning_or_error));
3153 if (ifexp != integer_one_node)
3154 expr = build3 (COND_EXPR, void_type_node,
3155 ifexp, expr, void_zero_node);
3161 /* At the beginning of a destructor, push cleanups that will call the
3162 destructors for our base classes and members.
3164 Called from begin_destructor_body. */
3167 push_base_cleanups (void)
3169 tree binfo, base_binfo;
3173 VEC(tree,gc) *vbases;
3175 /* Run destructors for all virtual baseclasses. */
3176 if (CLASSTYPE_VBASECLASSES (current_class_type))
3178 tree cond = (condition_conversion
3179 (build2 (BIT_AND_EXPR, integer_type_node,
3180 current_in_charge_parm,
3181 integer_two_node)));
3183 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3184 order, which is also the right order for pushing cleanups. */
3185 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3186 VEC_iterate (tree, vbases, i, base_binfo); i++)
3188 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3190 expr = build_special_member_call (current_class_ref,
3191 base_dtor_identifier,
3195 | LOOKUP_NONVIRTUAL),
3196 tf_warning_or_error);
3197 expr = build3 (COND_EXPR, void_type_node, cond,
3198 expr, void_zero_node);
3199 finish_decl_cleanup (NULL_TREE, expr);
3204 /* Take care of the remaining baseclasses. */
3205 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3206 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3208 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3209 || BINFO_VIRTUAL_P (base_binfo))
3212 expr = build_special_member_call (current_class_ref,
3213 base_dtor_identifier,
3215 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3216 tf_warning_or_error);
3217 finish_decl_cleanup (NULL_TREE, expr);
3220 for (member = TYPE_FIELDS (current_class_type); member;
3221 member = TREE_CHAIN (member))
3223 if (TREE_TYPE (member) == error_mark_node
3224 || TREE_CODE (member) != FIELD_DECL
3225 || DECL_ARTIFICIAL (member))
3227 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3229 tree this_member = (build_class_member_access_expr
3230 (current_class_ref, member,
3231 /*access_path=*/NULL_TREE,
3232 /*preserve_reference=*/false,
3233 tf_warning_or_error));
3234 tree this_type = TREE_TYPE (member);
3235 expr = build_delete (this_type, this_member,
3236 sfk_complete_destructor,
3237 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3239 finish_decl_cleanup (NULL_TREE, expr);
3244 /* Build a C++ vector delete expression.
3245 MAXINDEX is the number of elements to be deleted.
3246 ELT_SIZE is the nominal size of each element in the vector.
3247 BASE is the expression that should yield the store to be deleted.
3248 This function expands (or synthesizes) these calls itself.
3249 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3251 This also calls delete for virtual baseclasses of elements of the vector.
3253 Update: MAXINDEX is no longer needed. The size can be extracted from the
3254 start of the vector for pointers, and from the type for arrays. We still
3255 use MAXINDEX for arrays because it happens to already have one of the
3256 values we'd have to extract. (We could use MAXINDEX with pointers to
3257 confirm the size, and trap if the numbers differ; not clear that it'd
3258 be worth bothering.) */
3261 build_vec_delete (tree base, tree maxindex,
3262 special_function_kind auto_delete_vec, int use_global_delete)
3266 tree base_init = NULL_TREE;
3268 type = TREE_TYPE (base);
3270 if (TREE_CODE (type) == POINTER_TYPE)
3272 /* Step back one from start of vector, and read dimension. */
3274 tree size_ptr_type = build_pointer_type (sizetype);
3276 if (TREE_SIDE_EFFECTS (base))
3278 base_init = get_target_expr (base);
3279 base = TARGET_EXPR_SLOT (base_init);
3281 type = strip_array_types (TREE_TYPE (type));
3282 cookie_addr = fold_build1 (NEGATE_EXPR, sizetype, TYPE_SIZE_UNIT (sizetype));
3283 cookie_addr = build2 (POINTER_PLUS_EXPR,
3285 fold_convert (size_ptr_type, base),
3287 maxindex = cp_build_indirect_ref (cookie_addr, NULL, tf_warning_or_error);
3289 else if (TREE_CODE (type) == ARRAY_TYPE)
3291 /* Get the total number of things in the array, maxindex is a
3293 maxindex = array_type_nelts_total (type);
3294 type = strip_array_types (type);
3295 base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error);
3296 if (TREE_SIDE_EFFECTS (base))
3298 base_init = get_target_expr (base);
3299 base = TARGET_EXPR_SLOT (base_init);
3304 if (base != error_mark_node)
3305 error ("type to vector delete is neither pointer or array type");
3306 return error_mark_node;
3309 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3312 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);