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 (OPT_Weffc__, "%J%qD should be initialized in the member initialization "
430 "list", current_function_decl, member);
432 /* Get an lvalue for the data member. */
433 decl = build_class_member_access_expr (current_class_ref, member,
434 /*access_path=*/NULL_TREE,
435 /*preserve_reference=*/true,
436 tf_warning_or_error);
437 if (decl == error_mark_node)
440 if (init == void_type_node)
442 /* mem() means value-initialization. */
443 if (TREE_CODE (type) == ARRAY_TYPE)
445 init = build_vec_init (decl, NULL_TREE, NULL_TREE,
446 /*explicit_value_init_p=*/true,
448 tf_warning_or_error);
449 finish_expr_stmt (init);
453 if (TREE_CODE (type) == REFERENCE_TYPE)
454 permerror (input_location, "%Jvalue-initialization of %q#D, "
455 "which has reference type",
456 current_function_decl, member);
459 init = build2 (INIT_EXPR, type, decl, build_value_init (type));
460 finish_expr_stmt (init);
464 /* Deal with this here, as we will get confused if we try to call the
465 assignment op for an anonymous union. This can happen in a
466 synthesized copy constructor. */
467 else if (ANON_AGGR_TYPE_P (type))
471 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
472 finish_expr_stmt (init);
475 else if (TYPE_NEEDS_CONSTRUCTING (type))
477 if (init != NULL_TREE
478 && TREE_CODE (type) == ARRAY_TYPE
479 && TREE_CHAIN (init) == NULL_TREE
480 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
482 /* Initialization of one array from another. */
483 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
484 /*explicit_value_init_p=*/false,
486 tf_warning_or_error));
490 if (CP_TYPE_CONST_P (type)
492 && !type_has_user_provided_default_constructor (type))
493 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
494 vtable; still give this diagnostic. */
495 permerror (input_location, "%Juninitialized member %qD with %<const%> type %qT",
496 current_function_decl, member, type);
497 finish_expr_stmt (build_aggr_init (decl, init, 0,
498 tf_warning_or_error));
503 if (init == NULL_TREE)
505 /* member traversal: note it leaves init NULL */
506 if (TREE_CODE (type) == REFERENCE_TYPE)
507 permerror (input_location, "%Juninitialized reference member %qD",
508 current_function_decl, member);
509 else if (CP_TYPE_CONST_P (type))
510 permerror (input_location, "%Juninitialized member %qD with %<const%> type %qT",
511 current_function_decl, member, type);
513 else if (TREE_CODE (init) == TREE_LIST)
514 /* There was an explicit member initialization. Do some work
516 init = build_x_compound_expr_from_list (init, "member initializer");
519 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
520 tf_warning_or_error));
523 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
527 expr = build_class_member_access_expr (current_class_ref, member,
528 /*access_path=*/NULL_TREE,
529 /*preserve_reference=*/false,
530 tf_warning_or_error);
531 expr = build_delete (type, expr, sfk_complete_destructor,
532 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
534 if (expr != error_mark_node)
535 finish_eh_cleanup (expr);
539 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
540 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
543 build_field_list (tree t, tree list, int *uses_unions_p)
549 /* Note whether or not T is a union. */
550 if (TREE_CODE (t) == UNION_TYPE)
553 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
555 /* Skip CONST_DECLs for enumeration constants and so forth. */
556 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
559 /* Keep track of whether or not any fields are unions. */
560 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
563 /* For an anonymous struct or union, we must recursively
564 consider the fields of the anonymous type. They can be
565 directly initialized from the constructor. */
566 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
568 /* Add this field itself. Synthesized copy constructors
569 initialize the entire aggregate. */
570 list = tree_cons (fields, NULL_TREE, list);
571 /* And now add the fields in the anonymous aggregate. */
572 list = build_field_list (TREE_TYPE (fields), list,
575 /* Add this field. */
576 else if (DECL_NAME (fields))
577 list = tree_cons (fields, NULL_TREE, list);
583 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
584 a FIELD_DECL or BINFO in T that needs initialization. The
585 TREE_VALUE gives the initializer, or list of initializer arguments.
587 Return a TREE_LIST containing all of the initializations required
588 for T, in the order in which they should be performed. The output
589 list has the same format as the input. */
592 sort_mem_initializers (tree t, tree mem_inits)
595 tree base, binfo, base_binfo;
598 VEC(tree,gc) *vbases;
602 /* Build up a list of initializations. The TREE_PURPOSE of entry
603 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
604 TREE_VALUE will be the constructor arguments, or NULL if no
605 explicit initialization was provided. */
606 sorted_inits = NULL_TREE;
608 /* Process the virtual bases. */
609 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
610 VEC_iterate (tree, vbases, i, base); i++)
611 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
613 /* Process the direct bases. */
614 for (binfo = TYPE_BINFO (t), i = 0;
615 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
616 if (!BINFO_VIRTUAL_P (base_binfo))
617 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
619 /* Process the non-static data members. */
620 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
621 /* Reverse the entire list of initializations, so that they are in
622 the order that they will actually be performed. */
623 sorted_inits = nreverse (sorted_inits);
625 /* If the user presented the initializers in an order different from
626 that in which they will actually occur, we issue a warning. Keep
627 track of the next subobject which can be explicitly initialized
628 without issuing a warning. */
629 next_subobject = sorted_inits;
631 /* Go through the explicit initializers, filling in TREE_PURPOSE in
633 for (init = mem_inits; init; init = TREE_CHAIN (init))
638 subobject = TREE_PURPOSE (init);
640 /* If the explicit initializers are in sorted order, then
641 SUBOBJECT will be NEXT_SUBOBJECT, or something following
643 for (subobject_init = next_subobject;
645 subobject_init = TREE_CHAIN (subobject_init))
646 if (TREE_PURPOSE (subobject_init) == subobject)
649 /* Issue a warning if the explicit initializer order does not
650 match that which will actually occur.
651 ??? Are all these on the correct lines? */
652 if (warn_reorder && !subobject_init)
654 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
655 warning (OPT_Wreorder, "%q+D will be initialized after",
656 TREE_PURPOSE (next_subobject));
658 warning (OPT_Wreorder, "base %qT will be initialized after",
659 TREE_PURPOSE (next_subobject));
660 if (TREE_CODE (subobject) == FIELD_DECL)
661 warning (OPT_Wreorder, " %q+#D", subobject);
663 warning (OPT_Wreorder, " base %qT", subobject);
664 warning (OPT_Wreorder, "%J when initialized here", current_function_decl);
667 /* Look again, from the beginning of the list. */
670 subobject_init = sorted_inits;
671 while (TREE_PURPOSE (subobject_init) != subobject)
672 subobject_init = TREE_CHAIN (subobject_init);
675 /* It is invalid to initialize the same subobject more than
677 if (TREE_VALUE (subobject_init))
679 if (TREE_CODE (subobject) == FIELD_DECL)
680 error ("%Jmultiple initializations given for %qD",
681 current_function_decl, subobject);
683 error ("%Jmultiple initializations given for base %qT",
684 current_function_decl, subobject);
687 /* Record the initialization. */
688 TREE_VALUE (subobject_init) = TREE_VALUE (init);
689 next_subobject = subobject_init;
694 If a ctor-initializer specifies more than one mem-initializer for
695 multiple members of the same union (including members of
696 anonymous unions), the ctor-initializer is ill-formed. */
699 tree last_field = NULL_TREE;
700 for (init = sorted_inits; init; init = TREE_CHAIN (init))
706 /* Skip uninitialized members and base classes. */
707 if (!TREE_VALUE (init)
708 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
710 /* See if this field is a member of a union, or a member of a
711 structure contained in a union, etc. */
712 field = TREE_PURPOSE (init);
713 for (field_type = DECL_CONTEXT (field);
714 !same_type_p (field_type, t);
715 field_type = TYPE_CONTEXT (field_type))
716 if (TREE_CODE (field_type) == UNION_TYPE)
718 /* If this field is not a member of a union, skip it. */
719 if (TREE_CODE (field_type) != UNION_TYPE)
722 /* It's only an error if we have two initializers for the same
730 /* See if LAST_FIELD and the field initialized by INIT are
731 members of the same union. If so, there's a problem,
732 unless they're actually members of the same structure
733 which is itself a member of a union. For example, given:
735 union { struct { int i; int j; }; };
737 initializing both `i' and `j' makes sense. */
738 field_type = DECL_CONTEXT (field);
742 tree last_field_type;
744 last_field_type = DECL_CONTEXT (last_field);
747 if (same_type_p (last_field_type, field_type))
749 if (TREE_CODE (field_type) == UNION_TYPE)
750 error ("%Jinitializations for multiple members of %qT",
751 current_function_decl, last_field_type);
756 if (same_type_p (last_field_type, t))
759 last_field_type = TYPE_CONTEXT (last_field_type);
762 /* If we've reached the outermost class, then we're
764 if (same_type_p (field_type, t))
767 field_type = TYPE_CONTEXT (field_type);
778 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
779 is a TREE_LIST giving the explicit mem-initializer-list for the
780 constructor. The TREE_PURPOSE of each entry is a subobject (a
781 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
782 is a TREE_LIST giving the arguments to the constructor or
783 void_type_node for an empty list of arguments. */
786 emit_mem_initializers (tree mem_inits)
788 /* We will already have issued an error message about the fact that
789 the type is incomplete. */
790 if (!COMPLETE_TYPE_P (current_class_type))
793 /* Sort the mem-initializers into the order in which the
794 initializations should be performed. */
795 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
797 in_base_initializer = 1;
799 /* Initialize base classes. */
801 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
803 tree subobject = TREE_PURPOSE (mem_inits);
804 tree arguments = TREE_VALUE (mem_inits);
806 /* If these initializations are taking place in a copy constructor,
807 the base class should probably be explicitly initialized if there
808 is a user-defined constructor in the base class (other than the
809 default constructor, which will be called anyway). */
810 if (extra_warnings && !arguments
811 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
812 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
813 warning (OPT_Wextra, "%Jbase class %q#T should be explicitly initialized in the "
815 current_function_decl, BINFO_TYPE (subobject));
817 /* Initialize the base. */
818 if (BINFO_VIRTUAL_P (subobject))
819 construct_virtual_base (subobject, arguments);
824 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
826 expand_aggr_init_1 (subobject, NULL_TREE,
827 cp_build_indirect_ref (base_addr, NULL,
828 tf_warning_or_error),
831 tf_warning_or_error);
832 expand_cleanup_for_base (subobject, NULL_TREE);
835 mem_inits = TREE_CHAIN (mem_inits);
837 in_base_initializer = 0;
839 /* Initialize the vptrs. */
840 initialize_vtbl_ptrs (current_class_ptr);
842 /* Initialize the data members. */
845 perform_member_init (TREE_PURPOSE (mem_inits),
846 TREE_VALUE (mem_inits));
847 mem_inits = TREE_CHAIN (mem_inits);
851 /* Returns the address of the vtable (i.e., the value that should be
852 assigned to the vptr) for BINFO. */
855 build_vtbl_address (tree binfo)
857 tree binfo_for = binfo;
860 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
861 /* If this is a virtual primary base, then the vtable we want to store
862 is that for the base this is being used as the primary base of. We
863 can't simply skip the initialization, because we may be expanding the
864 inits of a subobject constructor where the virtual base layout
866 while (BINFO_PRIMARY_P (binfo_for))
867 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
869 /* Figure out what vtable BINFO's vtable is based on, and mark it as
871 vtbl = get_vtbl_decl_for_binfo (binfo_for);
872 TREE_USED (vtbl) = 1;
874 /* Now compute the address to use when initializing the vptr. */
875 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
876 if (TREE_CODE (vtbl) == VAR_DECL)
877 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
882 /* This code sets up the virtual function tables appropriate for
883 the pointer DECL. It is a one-ply initialization.
885 BINFO is the exact type that DECL is supposed to be. In
886 multiple inheritance, this might mean "C's A" if C : A, B. */
889 expand_virtual_init (tree binfo, tree decl)
894 /* Compute the initializer for vptr. */
895 vtbl = build_vtbl_address (binfo);
897 /* We may get this vptr from a VTT, if this is a subobject
898 constructor or subobject destructor. */
899 vtt_index = BINFO_VPTR_INDEX (binfo);
905 /* Compute the value to use, when there's a VTT. */
906 vtt_parm = current_vtt_parm;
907 vtbl2 = build2 (POINTER_PLUS_EXPR,
908 TREE_TYPE (vtt_parm),
911 vtbl2 = cp_build_indirect_ref (vtbl2, NULL, tf_warning_or_error);
912 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
914 /* The actual initializer is the VTT value only in the subobject
915 constructor. In maybe_clone_body we'll substitute NULL for
916 the vtt_parm in the case of the non-subobject constructor. */
917 vtbl = build3 (COND_EXPR,
919 build2 (EQ_EXPR, boolean_type_node,
920 current_in_charge_parm, integer_zero_node),
925 /* Compute the location of the vtpr. */
926 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, NULL,
927 tf_warning_or_error),
929 gcc_assert (vtbl_ptr != error_mark_node);
931 /* Assign the vtable to the vptr. */
932 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
933 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl,
934 tf_warning_or_error));
937 /* If an exception is thrown in a constructor, those base classes already
938 constructed must be destroyed. This function creates the cleanup
939 for BINFO, which has just been constructed. If FLAG is non-NULL,
940 it is a DECL which is nonzero when this base needs to be
944 expand_cleanup_for_base (tree binfo, tree flag)
948 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
951 /* Call the destructor. */
952 expr = build_special_member_call (current_class_ref,
953 base_dtor_identifier,
956 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
957 tf_warning_or_error);
959 expr = fold_build3 (COND_EXPR, void_type_node,
960 c_common_truthvalue_conversion (input_location, flag),
961 expr, integer_zero_node);
963 finish_eh_cleanup (expr);
966 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
970 construct_virtual_base (tree vbase, tree arguments)
976 /* If there are virtual base classes with destructors, we need to
977 emit cleanups to destroy them if an exception is thrown during
978 the construction process. These exception regions (i.e., the
979 period during which the cleanups must occur) begin from the time
980 the construction is complete to the end of the function. If we
981 create a conditional block in which to initialize the
982 base-classes, then the cleanup region for the virtual base begins
983 inside a block, and ends outside of that block. This situation
984 confuses the sjlj exception-handling code. Therefore, we do not
985 create a single conditional block, but one for each
986 initialization. (That way the cleanup regions always begin
987 in the outer block.) We trust the back end to figure out
988 that the FLAG will not change across initializations, and
989 avoid doing multiple tests. */
990 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
991 inner_if_stmt = begin_if_stmt ();
992 finish_if_stmt_cond (flag, inner_if_stmt);
994 /* Compute the location of the virtual base. If we're
995 constructing virtual bases, then we must be the most derived
996 class. Therefore, we don't have to look up the virtual base;
997 we already know where it is. */
998 exp = convert_to_base_statically (current_class_ref, vbase);
1000 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1001 LOOKUP_COMPLAIN, tf_warning_or_error);
1002 finish_then_clause (inner_if_stmt);
1003 finish_if_stmt (inner_if_stmt);
1005 expand_cleanup_for_base (vbase, flag);
1008 /* Find the context in which this FIELD can be initialized. */
1011 initializing_context (tree field)
1013 tree t = DECL_CONTEXT (field);
1015 /* Anonymous union members can be initialized in the first enclosing
1016 non-anonymous union context. */
1017 while (t && ANON_AGGR_TYPE_P (t))
1018 t = TYPE_CONTEXT (t);
1022 /* Function to give error message if member initialization specification
1023 is erroneous. FIELD is the member we decided to initialize.
1024 TYPE is the type for which the initialization is being performed.
1025 FIELD must be a member of TYPE.
1027 MEMBER_NAME is the name of the member. */
1030 member_init_ok_or_else (tree field, tree type, tree member_name)
1032 if (field == error_mark_node)
1036 error ("class %qT does not have any field named %qD", type,
1040 if (TREE_CODE (field) == VAR_DECL)
1042 error ("%q#D is a static data member; it can only be "
1043 "initialized at its definition",
1047 if (TREE_CODE (field) != FIELD_DECL)
1049 error ("%q#D is not a non-static data member of %qT",
1053 if (initializing_context (field) != type)
1055 error ("class %qT does not have any field named %qD", type,
1063 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1064 is a _TYPE node or TYPE_DECL which names a base for that type.
1065 Check the validity of NAME, and return either the base _TYPE, base
1066 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1067 NULL_TREE and issue a diagnostic.
1069 An old style unnamed direct single base construction is permitted,
1070 where NAME is NULL. */
1073 expand_member_init (tree name)
1078 if (!current_class_ref)
1083 /* This is an obsolete unnamed base class initializer. The
1084 parser will already have warned about its use. */
1085 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1088 error ("unnamed initializer for %qT, which has no base classes",
1089 current_class_type);
1092 basetype = BINFO_TYPE
1093 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1096 error ("unnamed initializer for %qT, which uses multiple inheritance",
1097 current_class_type);
1101 else if (TYPE_P (name))
1103 basetype = TYPE_MAIN_VARIANT (name);
1104 name = TYPE_NAME (name);
1106 else if (TREE_CODE (name) == TYPE_DECL)
1107 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1109 basetype = NULL_TREE;
1118 if (current_template_parms)
1121 class_binfo = TYPE_BINFO (current_class_type);
1122 direct_binfo = NULL_TREE;
1123 virtual_binfo = NULL_TREE;
1125 /* Look for a direct base. */
1126 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1127 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1130 /* Look for a virtual base -- unless the direct base is itself
1132 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1133 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1135 /* [class.base.init]
1137 If a mem-initializer-id is ambiguous because it designates
1138 both a direct non-virtual base class and an inherited virtual
1139 base class, the mem-initializer is ill-formed. */
1140 if (direct_binfo && virtual_binfo)
1142 error ("%qD is both a direct base and an indirect virtual base",
1147 if (!direct_binfo && !virtual_binfo)
1149 if (CLASSTYPE_VBASECLASSES (current_class_type))
1150 error ("type %qT is not a direct or virtual base of %qT",
1151 basetype, current_class_type);
1153 error ("type %qT is not a direct base of %qT",
1154 basetype, current_class_type);
1158 return direct_binfo ? direct_binfo : virtual_binfo;
1162 if (TREE_CODE (name) == IDENTIFIER_NODE)
1163 field = lookup_field (current_class_type, name, 1, false);
1167 if (member_init_ok_or_else (field, current_class_type, name))
1174 /* This is like `expand_member_init', only it stores one aggregate
1177 INIT comes in two flavors: it is either a value which
1178 is to be stored in EXP, or it is a parameter list
1179 to go to a constructor, which will operate on EXP.
1180 If INIT is not a parameter list for a constructor, then set
1181 LOOKUP_ONLYCONVERTING.
1182 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1183 the initializer, if FLAGS is 0, then it is the (init) form.
1184 If `init' is a CONSTRUCTOR, then we emit a warning message,
1185 explaining that such initializations are invalid.
1187 If INIT resolves to a CALL_EXPR which happens to return
1188 something of the type we are looking for, then we know
1189 that we can safely use that call to perform the
1192 The virtual function table pointer cannot be set up here, because
1193 we do not really know its type.
1195 This never calls operator=().
1197 When initializing, nothing is CONST.
1199 A default copy constructor may have to be used to perform the
1202 A constructor or a conversion operator may have to be used to
1203 perform the initialization, but not both, as it would be ambiguous. */
1206 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain)
1211 tree type = TREE_TYPE (exp);
1212 int was_const = TREE_READONLY (exp);
1213 int was_volatile = TREE_THIS_VOLATILE (exp);
1216 if (init == error_mark_node)
1217 return error_mark_node;
1219 TREE_READONLY (exp) = 0;
1220 TREE_THIS_VOLATILE (exp) = 0;
1222 if (init && TREE_CODE (init) != TREE_LIST)
1223 flags |= LOOKUP_ONLYCONVERTING;
1225 if (TREE_CODE (type) == ARRAY_TYPE)
1229 /* An array may not be initialized use the parenthesized
1230 initialization form -- unless the initializer is "()". */
1231 if (init && TREE_CODE (init) == TREE_LIST)
1233 if (complain & tf_error)
1234 error ("bad array initializer");
1235 return error_mark_node;
1237 /* Must arrange to initialize each element of EXP
1238 from elements of INIT. */
1239 itype = init ? TREE_TYPE (init) : NULL_TREE;
1240 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1241 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1242 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1243 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1244 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1245 /*explicit_value_init_p=*/false,
1246 itype && same_type_p (itype,
1249 TREE_READONLY (exp) = was_const;
1250 TREE_THIS_VOLATILE (exp) = was_volatile;
1251 TREE_TYPE (exp) = type;
1253 TREE_TYPE (init) = itype;
1257 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1258 /* Just know that we've seen something for this node. */
1259 TREE_USED (exp) = 1;
1261 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1262 destroy_temps = stmts_are_full_exprs_p ();
1263 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1264 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1265 init, LOOKUP_NORMAL|flags, complain);
1266 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1267 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1268 TREE_READONLY (exp) = was_const;
1269 TREE_THIS_VOLATILE (exp) = was_volatile;
1275 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags,
1276 tsubst_flags_t complain)
1278 tree type = TREE_TYPE (exp);
1281 /* It fails because there may not be a constructor which takes
1282 its own type as the first (or only parameter), but which does
1283 take other types via a conversion. So, if the thing initializing
1284 the expression is a unit element of type X, first try X(X&),
1285 followed by initialization by X. If neither of these work
1286 out, then look hard. */
1288 VEC(tree,gc) *parms;
1290 if (init && TREE_CODE (init) != TREE_LIST
1291 && (flags & LOOKUP_ONLYCONVERTING))
1293 /* Base subobjects should only get direct-initialization. */
1294 gcc_assert (true_exp == exp);
1296 if (flags & DIRECT_BIND)
1297 /* Do nothing. We hit this in two cases: Reference initialization,
1298 where we aren't initializing a real variable, so we don't want
1299 to run a new constructor; and catching an exception, where we
1300 have already built up the constructor call so we could wrap it
1301 in an exception region. */;
1302 else if (BRACE_ENCLOSED_INITIALIZER_P (init)
1303 && CP_AGGREGATE_TYPE_P (type))
1305 /* A brace-enclosed initializer for an aggregate. */
1306 init = digest_init (type, init);
1309 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1311 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1312 /* We need to protect the initialization of a catch parm with a
1313 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1314 around the TARGET_EXPR for the copy constructor. See
1315 initialize_handler_parm. */
1317 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1318 TREE_OPERAND (init, 0));
1319 TREE_TYPE (init) = void_type_node;
1322 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1323 TREE_SIDE_EFFECTS (init) = 1;
1324 finish_expr_stmt (init);
1328 if (init == NULL_TREE)
1330 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init))
1332 parms = make_tree_vector ();
1333 for (; init != NULL_TREE; init = TREE_CHAIN (init))
1334 VEC_safe_push (tree, gc, parms, TREE_VALUE (init));
1337 parms = make_tree_vector_single (init);
1339 if (true_exp == exp)
1340 ctor_name = complete_ctor_identifier;
1342 ctor_name = base_ctor_identifier;
1344 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags,
1348 release_tree_vector (parms);
1350 if (TREE_SIDE_EFFECTS (rval))
1351 finish_expr_stmt (convert_to_void (rval, NULL, complain));
1354 /* This function is responsible for initializing EXP with INIT
1357 BINFO is the binfo of the type for who we are performing the
1358 initialization. For example, if W is a virtual base class of A and B,
1360 If we are initializing B, then W must contain B's W vtable, whereas
1361 were we initializing C, W must contain C's W vtable.
1363 TRUE_EXP is nonzero if it is the true expression being initialized.
1364 In this case, it may be EXP, or may just contain EXP. The reason we
1365 need this is because if EXP is a base element of TRUE_EXP, we
1366 don't necessarily know by looking at EXP where its virtual
1367 baseclass fields should really be pointing. But we do know
1368 from TRUE_EXP. In constructors, we don't know anything about
1369 the value being initialized.
1371 FLAGS is just passed to `build_new_method_call'. See that function
1372 for its description. */
1375 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags,
1376 tsubst_flags_t complain)
1378 tree type = TREE_TYPE (exp);
1380 gcc_assert (init != error_mark_node && type != error_mark_node);
1381 gcc_assert (building_stmt_tree ());
1383 /* Use a function returning the desired type to initialize EXP for us.
1384 If the function is a constructor, and its first argument is
1385 NULL_TREE, know that it was meant for us--just slide exp on
1386 in and expand the constructor. Constructors now come
1389 if (init && TREE_CODE (exp) == VAR_DECL
1390 && COMPOUND_LITERAL_P (init))
1392 /* If store_init_value returns NULL_TREE, the INIT has been
1393 recorded as the DECL_INITIAL for EXP. That means there's
1394 nothing more we have to do. */
1395 init = store_init_value (exp, init, flags);
1397 finish_expr_stmt (init);
1401 /* If an explicit -- but empty -- initializer list was present,
1402 that's value-initialization. */
1403 if (init == void_type_node)
1405 /* If there's a user-provided constructor, we just call that. */
1406 if (type_has_user_provided_constructor (type))
1407 /* Fall through. */;
1408 /* If there isn't, but we still need to call the constructor,
1409 zero out the object first. */
1410 else if (TYPE_NEEDS_CONSTRUCTING (type))
1412 init = build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
1413 init = build2 (INIT_EXPR, type, exp, init);
1414 finish_expr_stmt (init);
1415 /* And then call the constructor. */
1417 /* If we don't need to mess with the constructor at all,
1418 then just zero out the object and we're done. */
1421 init = build2 (INIT_EXPR, type, exp, build_value_init_noctor (type));
1422 finish_expr_stmt (init);
1428 /* We know that expand_default_init can handle everything we want
1430 expand_default_init (binfo, true_exp, exp, init, flags, complain);
1433 /* Report an error if TYPE is not a user-defined, class type. If
1434 OR_ELSE is nonzero, give an error message. */
1437 is_class_type (tree type, int or_else)
1439 if (type == error_mark_node)
1442 if (! CLASS_TYPE_P (type))
1445 error ("%qT is not a class type", type);
1452 get_type_value (tree name)
1454 if (name == error_mark_node)
1457 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1458 return IDENTIFIER_TYPE_VALUE (name);
1463 /* Build a reference to a member of an aggregate. This is not a C++
1464 `&', but really something which can have its address taken, and
1465 then act as a pointer to member, for example TYPE :: FIELD can have
1466 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1467 this expression is the operand of "&".
1469 @@ Prints out lousy diagnostics for operator <typename>
1472 @@ This function should be rewritten and placed in search.c. */
1475 build_offset_ref (tree type, tree member, bool address_p)
1478 tree basebinfo = NULL_TREE;
1480 /* class templates can come in as TEMPLATE_DECLs here. */
1481 if (TREE_CODE (member) == TEMPLATE_DECL)
1484 if (dependent_type_p (type) || type_dependent_expression_p (member))
1485 return build_qualified_name (NULL_TREE, type, member,
1486 /*template_p=*/false);
1488 gcc_assert (TYPE_P (type));
1489 if (! is_class_type (type, 1))
1490 return error_mark_node;
1492 gcc_assert (DECL_P (member) || BASELINK_P (member));
1493 /* Callers should call mark_used before this point. */
1494 gcc_assert (!DECL_P (member) || TREE_USED (member));
1496 if (!COMPLETE_TYPE_P (complete_type (type))
1497 && !TYPE_BEING_DEFINED (type))
1499 error ("incomplete type %qT does not have member %qD", type, member);
1500 return error_mark_node;
1503 /* Entities other than non-static members need no further
1505 if (TREE_CODE (member) == TYPE_DECL)
1507 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1508 return convert_from_reference (member);
1510 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1512 error ("invalid pointer to bit-field %qD", member);
1513 return error_mark_node;
1516 /* Set up BASEBINFO for member lookup. */
1517 decl = maybe_dummy_object (type, &basebinfo);
1519 /* A lot of this logic is now handled in lookup_member. */
1520 if (BASELINK_P (member))
1522 /* Go from the TREE_BASELINK to the member function info. */
1523 tree t = BASELINK_FUNCTIONS (member);
1525 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1527 /* Get rid of a potential OVERLOAD around it. */
1528 t = OVL_CURRENT (t);
1530 /* Unique functions are handled easily. */
1532 /* For non-static member of base class, we need a special rule
1533 for access checking [class.protected]:
1535 If the access is to form a pointer to member, the
1536 nested-name-specifier shall name the derived class
1537 (or any class derived from that class). */
1538 if (address_p && DECL_P (t)
1539 && DECL_NONSTATIC_MEMBER_P (t))
1540 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1542 perform_or_defer_access_check (basebinfo, t, t);
1544 if (DECL_STATIC_FUNCTION_P (t))
1549 TREE_TYPE (member) = unknown_type_node;
1551 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1552 /* We need additional test besides the one in
1553 check_accessibility_of_qualified_id in case it is
1554 a pointer to non-static member. */
1555 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1559 /* If MEMBER is non-static, then the program has fallen afoul of
1562 An id-expression that denotes a nonstatic data member or
1563 nonstatic member function of a class can only be used:
1565 -- as part of a class member access (_expr.ref_) in which the
1566 object-expression refers to the member's class or a class
1567 derived from that class, or
1569 -- to form a pointer to member (_expr.unary.op_), or
1571 -- in the body of a nonstatic member function of that class or
1572 of a class derived from that class (_class.mfct.nonstatic_), or
1574 -- in a mem-initializer for a constructor for that class or for
1575 a class derived from that class (_class.base.init_). */
1576 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1578 /* Build a representation of the qualified name suitable
1579 for use as the operand to "&" -- even though the "&" is
1580 not actually present. */
1581 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1582 /* In Microsoft mode, treat a non-static member function as if
1583 it were a pointer-to-member. */
1584 if (flag_ms_extensions)
1586 PTRMEM_OK_P (member) = 1;
1587 return cp_build_unary_op (ADDR_EXPR, member, 0,
1588 tf_warning_or_error);
1590 error ("invalid use of non-static member function %qD",
1591 TREE_OPERAND (member, 1));
1592 return error_mark_node;
1594 else if (TREE_CODE (member) == FIELD_DECL)
1596 error ("invalid use of non-static data member %qD", member);
1597 return error_mark_node;
1602 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1603 PTRMEM_OK_P (member) = 1;
1607 /* If DECL is a scalar enumeration constant or variable with a
1608 constant initializer, return the initializer (or, its initializers,
1609 recursively); otherwise, return DECL. If INTEGRAL_P, the
1610 initializer is only returned if DECL is an integral
1611 constant-expression. */
1614 constant_value_1 (tree decl, bool integral_p)
1616 while (TREE_CODE (decl) == CONST_DECL
1618 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1619 : (TREE_CODE (decl) == VAR_DECL
1620 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1623 /* Static data members in template classes may have
1624 non-dependent initializers. References to such non-static
1625 data members are not value-dependent, so we must retrieve the
1626 initializer here. The DECL_INITIAL will have the right type,
1627 but will not have been folded because that would prevent us
1628 from performing all appropriate semantic checks at
1629 instantiation time. */
1630 if (DECL_CLASS_SCOPE_P (decl)
1631 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1632 && uses_template_parms (CLASSTYPE_TI_ARGS
1633 (DECL_CONTEXT (decl))))
1635 ++processing_template_decl;
1636 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1637 --processing_template_decl;
1641 /* If DECL is a static data member in a template
1642 specialization, we must instantiate it here. The
1643 initializer for the static data member is not processed
1644 until needed; we need it now. */
1646 init = DECL_INITIAL (decl);
1648 if (init == error_mark_node)
1650 /* Initializers in templates are generally expanded during
1651 instantiation, so before that for const int i(2)
1652 INIT is a TREE_LIST with the actual initializer as
1654 if (processing_template_decl
1656 && TREE_CODE (init) == TREE_LIST
1657 && TREE_CHAIN (init) == NULL_TREE)
1658 init = TREE_VALUE (init);
1660 || !TREE_TYPE (init)
1662 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1663 : (!TREE_CONSTANT (init)
1664 /* Do not return an aggregate constant (of which
1665 string literals are a special case), as we do not
1666 want to make inadvertent copies of such entities,
1667 and we must be sure that their addresses are the
1669 || TREE_CODE (init) == CONSTRUCTOR
1670 || TREE_CODE (init) == STRING_CST)))
1672 decl = unshare_expr (init);
1677 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1678 constant of integral or enumeration type, then return that value.
1679 These are those variables permitted in constant expressions by
1683 integral_constant_value (tree decl)
1685 return constant_value_1 (decl, /*integral_p=*/true);
1688 /* A more relaxed version of integral_constant_value, used by the
1689 common C/C++ code and by the C++ front end for optimization
1693 decl_constant_value (tree decl)
1695 return constant_value_1 (decl,
1696 /*integral_p=*/processing_template_decl);
1699 /* Common subroutines of build_new and build_vec_delete. */
1701 /* Call the global __builtin_delete to delete ADDR. */
1704 build_builtin_delete_call (tree addr)
1706 mark_used (global_delete_fndecl);
1707 return build_call_n (global_delete_fndecl, 1, addr);
1710 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1711 the type of the object being allocated; otherwise, it's just TYPE.
1712 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1713 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1714 a vector of arguments to be provided as arguments to a placement
1715 new operator. This routine performs no semantic checks; it just
1716 creates and returns a NEW_EXPR. */
1719 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts,
1720 VEC(tree,gc) *init, int use_global_new)
1725 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1726 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1727 permits us to distinguish the case of a missing initializer "new
1728 int" from an empty initializer "new int()". */
1730 init_list = NULL_TREE;
1731 else if (VEC_empty (tree, init))
1732 init_list = void_zero_node;
1734 init_list = build_tree_list_vec (init);
1736 new_expr = build4 (NEW_EXPR, build_pointer_type (type),
1737 build_tree_list_vec (placement), type, nelts,
1739 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1740 TREE_SIDE_EFFECTS (new_expr) = 1;
1745 /* Make sure that there are no aliasing issues with T, a placement new
1746 expression applied to PLACEMENT, by recording the change in dynamic
1747 type. If placement new is inlined, as it is with libstdc++, and if
1748 the type of the placement new differs from the type of the
1749 placement location itself, then alias analysis may think it is OK
1750 to interchange writes to the location from before the placement new
1751 and from after the placement new. We have to prevent type-based
1752 alias analysis from applying. PLACEMENT may be NULL, which means
1753 that we couldn't capture it in a temporary variable, in which case
1754 we use a memory clobber. */
1757 avoid_placement_new_aliasing (tree t, tree placement)
1761 if (processing_template_decl)
1764 /* If we are not using type based aliasing, we don't have to do
1766 if (!flag_strict_aliasing)
1769 /* If we have a pointer and a location, record the change in dynamic
1770 type. Otherwise we need a general memory clobber. */
1771 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE
1772 && placement != NULL_TREE
1773 && TREE_CODE (TREE_TYPE (placement)) == POINTER_TYPE)
1774 type_change = build_stmt (CHANGE_DYNAMIC_TYPE_EXPR,
1779 /* Build a memory clobber. */
1780 type_change = build_stmt (ASM_EXPR,
1781 build_string (0, ""),
1784 tree_cons (NULL_TREE,
1785 build_string (6, "memory"),
1788 ASM_VOLATILE_P (type_change) = 1;
1791 return build2 (COMPOUND_EXPR, TREE_TYPE (t), type_change, t);
1794 /* Generate code for a new-expression, including calling the "operator
1795 new" function, initializing the object, and, if an exception occurs
1796 during construction, cleaning up. The arguments are as for
1797 build_raw_new_expr. This may change PLACEMENT and INIT. */
1800 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts,
1801 VEC(tree,gc) **init, bool globally_qualified_p,
1802 tsubst_flags_t complain)
1805 /* True iff this is a call to "operator new[]" instead of just
1807 bool array_p = false;
1808 /* If ARRAY_P is true, the element type of the array. This is never
1809 an ARRAY_TYPE; for something like "new int[3][4]", the
1810 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1813 /* The type of the new-expression. (This type is always a pointer
1816 tree outer_nelts = NULL_TREE;
1817 tree alloc_call, alloc_expr;
1818 /* The address returned by the call to "operator new". This node is
1819 a VAR_DECL and is therefore reusable. */
1822 tree cookie_expr, init_expr;
1823 int nothrow, check_new;
1824 int use_java_new = 0;
1825 /* If non-NULL, the number of extra bytes to allocate at the
1826 beginning of the storage allocated for an array-new expression in
1827 order to store the number of elements. */
1828 tree cookie_size = NULL_TREE;
1829 bool have_placement;
1830 tree placement_first;
1831 tree placement_expr = NULL_TREE;
1832 /* True if the function we are calling is a placement allocation
1834 bool placement_allocation_fn_p;
1835 /* True if the storage must be initialized, either by a constructor
1836 or due to an explicit new-initializer. */
1837 bool is_initialized;
1838 /* The address of the thing allocated, not including any cookie. In
1839 particular, if an array cookie is in use, DATA_ADDR is the
1840 address of the first array element. This node is a VAR_DECL, and
1841 is therefore reusable. */
1843 tree init_preeval_expr = NULL_TREE;
1847 outer_nelts = nelts;
1850 else if (TREE_CODE (type) == ARRAY_TYPE)
1853 nelts = array_type_nelts_top (type);
1854 outer_nelts = nelts;
1855 type = TREE_TYPE (type);
1858 /* If our base type is an array, then make sure we know how many elements
1860 for (elt_type = type;
1861 TREE_CODE (elt_type) == ARRAY_TYPE;
1862 elt_type = TREE_TYPE (elt_type))
1863 nelts = cp_build_binary_op (input_location,
1865 array_type_nelts_top (elt_type),
1868 if (TREE_CODE (elt_type) == VOID_TYPE)
1870 if (complain & tf_error)
1871 error ("invalid type %<void%> for new");
1872 return error_mark_node;
1875 if (abstract_virtuals_error (NULL_TREE, elt_type))
1876 return error_mark_node;
1878 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL);
1880 if (CP_TYPE_CONST_P (elt_type) && *init == NULL
1881 && !type_has_user_provided_default_constructor (elt_type))
1883 if (complain & tf_error)
1884 error ("uninitialized const in %<new%> of %q#T", elt_type);
1885 return error_mark_node;
1888 size = size_in_bytes (elt_type);
1890 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1892 alloc_fn = NULL_TREE;
1894 /* If PLACEMENT is a single simple pointer type not passed by
1895 reference, prepare to capture it in a temporary variable. Do
1896 this now, since PLACEMENT will change in the calls below. */
1897 have_placement = !VEC_empty (tree, *placement);
1898 placement_first = NULL_TREE;
1899 if (VEC_length (tree, *placement) == 1
1900 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0)))
1902 placement_first = VEC_index (tree, *placement, 0);
1904 /* Allocate the object. */
1905 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type))
1908 tree class_decl = build_java_class_ref (elt_type);
1909 static const char alloc_name[] = "_Jv_AllocObject";
1911 if (class_decl == error_mark_node)
1912 return error_mark_node;
1915 if (!get_global_value_if_present (get_identifier (alloc_name),
1918 if (complain & tf_error)
1919 error ("call to Java constructor with %qs undefined", alloc_name);
1920 return error_mark_node;
1922 else if (really_overloaded_fn (alloc_fn))
1924 if (complain & tf_error)
1925 error ("%qD should never be overloaded", alloc_fn);
1926 return error_mark_node;
1928 alloc_fn = OVL_CURRENT (alloc_fn);
1929 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1930 alloc_call = (cp_build_function_call
1932 build_tree_list (NULL_TREE, class_addr),
1935 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type))
1937 error ("Java class %q#T object allocated using placement new", elt_type);
1938 return error_mark_node;
1945 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1947 if (!globally_qualified_p
1948 && CLASS_TYPE_P (elt_type)
1950 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1951 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1953 /* Use a class-specific operator new. */
1954 /* If a cookie is required, add some extra space. */
1955 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1957 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1958 size = size_binop (PLUS_EXPR, size, cookie_size);
1960 /* Create the argument list. */
1961 VEC_safe_insert (tree, gc, *placement, 0, size);
1962 /* Do name-lookup to find the appropriate operator. */
1963 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1964 if (fns == NULL_TREE)
1966 if (complain & tf_error)
1967 error ("no suitable %qD found in class %qT", fnname, elt_type);
1968 return error_mark_node;
1970 if (TREE_CODE (fns) == TREE_LIST)
1972 if (complain & tf_error)
1974 error ("request for member %qD is ambiguous", fnname);
1975 print_candidates (fns);
1977 return error_mark_node;
1979 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1981 /*conversion_path=*/NULL_TREE,
1988 /* Use a global operator new. */
1989 /* See if a cookie might be required. */
1990 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1991 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1993 cookie_size = NULL_TREE;
1995 alloc_call = build_operator_new_call (fnname, placement,
1996 &size, &cookie_size,
2001 if (alloc_call == error_mark_node)
2002 return error_mark_node;
2004 gcc_assert (alloc_fn != NULL_TREE);
2006 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2007 into a temporary variable. */
2008 if (!processing_template_decl
2009 && placement_first != NULL_TREE
2010 && TREE_CODE (alloc_call) == CALL_EXPR
2011 && call_expr_nargs (alloc_call) == 2
2012 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
2013 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2015 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2017 if (INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2018 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2020 placement_expr = get_target_expr (placement_first);
2021 CALL_EXPR_ARG (alloc_call, 1)
2022 = convert (TREE_TYPE (placement_arg), placement_expr);
2026 /* In the simple case, we can stop now. */
2027 pointer_type = build_pointer_type (type);
2028 if (!cookie_size && !is_initialized)
2030 rval = build_nop (pointer_type, alloc_call);
2032 rval = avoid_placement_new_aliasing (rval, placement_expr);
2036 /* Store the result of the allocation call in a variable so that we can
2037 use it more than once. */
2038 alloc_expr = get_target_expr (alloc_call);
2039 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2041 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2042 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2043 alloc_call = TREE_OPERAND (alloc_call, 1);
2045 /* Now, check to see if this function is actually a placement
2046 allocation function. This can happen even when PLACEMENT is NULL
2047 because we might have something like:
2049 struct S { void* operator new (size_t, int i = 0); };
2051 A call to `new S' will get this allocation function, even though
2052 there is no explicit placement argument. If there is more than
2053 one argument, or there are variable arguments, then this is a
2054 placement allocation function. */
2055 placement_allocation_fn_p
2056 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2057 || varargs_function_p (alloc_fn));
2059 /* Preevaluate the placement args so that we don't reevaluate them for a
2060 placement delete. */
2061 if (placement_allocation_fn_p)
2064 stabilize_call (alloc_call, &inits);
2066 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2070 /* unless an allocation function is declared with an empty excep-
2071 tion-specification (_except.spec_), throw(), it indicates failure to
2072 allocate storage by throwing a bad_alloc exception (clause _except_,
2073 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2074 cation function is declared with an empty exception-specification,
2075 throw(), it returns null to indicate failure to allocate storage and a
2076 non-null pointer otherwise.
2078 So check for a null exception spec on the op new we just called. */
2080 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2081 check_new = (flag_check_new || nothrow) && ! use_java_new;
2089 /* Adjust so we're pointing to the start of the object. */
2090 data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2091 alloc_node, cookie_size);
2093 /* Store the number of bytes allocated so that we can know how
2094 many elements to destroy later. We use the last sizeof
2095 (size_t) bytes to store the number of elements. */
2096 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype));
2097 cookie_ptr = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node),
2098 alloc_node, cookie_ptr);
2099 size_ptr_type = build_pointer_type (sizetype);
2100 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr);
2101 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2103 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2105 if (targetm.cxx.cookie_has_size ())
2107 /* Also store the element size. */
2108 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2109 fold_build1 (NEGATE_EXPR, sizetype,
2110 size_in_bytes (sizetype)));
2112 cookie = cp_build_indirect_ref (cookie_ptr, NULL, complain);
2113 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2114 size_in_bytes (elt_type));
2115 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2116 cookie, cookie_expr);
2121 cookie_expr = NULL_TREE;
2122 data_addr = alloc_node;
2125 /* Now use a pointer to the type we've actually allocated. */
2126 data_addr = fold_convert (pointer_type, data_addr);
2127 /* Any further uses of alloc_node will want this type, too. */
2128 alloc_node = fold_convert (pointer_type, alloc_node);
2130 /* Now initialize the allocated object. Note that we preevaluate the
2131 initialization expression, apart from the actual constructor call or
2132 assignment--we do this because we want to delay the allocation as long
2133 as possible in order to minimize the size of the exception region for
2134 placement delete. */
2138 bool explicit_value_init_p = false;
2140 if (*init != NULL && VEC_empty (tree, *init))
2143 explicit_value_init_p = true;
2150 if (complain & tf_error)
2151 permerror (input_location, "ISO C++ forbids initialization in array new");
2153 return error_mark_node;
2156 = build_vec_init (data_addr,
2157 cp_build_binary_op (input_location,
2158 MINUS_EXPR, outer_nelts,
2161 build_tree_list_vec (*init),
2162 explicit_value_init_p,
2166 /* An array initialization is stable because the initialization
2167 of each element is a full-expression, so the temporaries don't
2173 init_expr = cp_build_indirect_ref (data_addr, NULL, complain);
2175 if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p)
2177 init_expr = build_special_member_call (init_expr,
2178 complete_ctor_identifier,
2183 else if (explicit_value_init_p)
2185 /* Something like `new int()'. */
2186 init_expr = build2 (INIT_EXPR, type,
2187 init_expr, build_value_init (type));
2193 /* We are processing something like `new int (10)', which
2194 means allocate an int, and initialize it with 10. */
2196 ie = build_x_compound_expr_from_vec (*init, "new initializer");
2197 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie,
2200 stable = stabilize_init (init_expr, &init_preeval_expr);
2203 if (init_expr == error_mark_node)
2204 return error_mark_node;
2206 /* If any part of the object initialization terminates by throwing an
2207 exception and a suitable deallocation function can be found, the
2208 deallocation function is called to free the memory in which the
2209 object was being constructed, after which the exception continues
2210 to propagate in the context of the new-expression. If no
2211 unambiguous matching deallocation function can be found,
2212 propagating the exception does not cause the object's memory to be
2214 if (flag_exceptions && ! use_java_new)
2216 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2219 /* The Standard is unclear here, but the right thing to do
2220 is to use the same method for finding deallocation
2221 functions that we use for finding allocation functions. */
2222 cleanup = (build_op_delete_call
2226 globally_qualified_p,
2227 placement_allocation_fn_p ? alloc_call : NULL_TREE,
2233 /* This is much simpler if we were able to preevaluate all of
2234 the arguments to the constructor call. */
2235 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2236 init_expr, cleanup);
2238 /* Ack! First we allocate the memory. Then we set our sentry
2239 variable to true, and expand a cleanup that deletes the
2240 memory if sentry is true. Then we run the constructor, and
2241 finally clear the sentry.
2243 We need to do this because we allocate the space first, so
2244 if there are any temporaries with cleanups in the
2245 constructor args and we weren't able to preevaluate them, we
2246 need this EH region to extend until end of full-expression
2247 to preserve nesting. */
2249 tree end, sentry, begin;
2251 begin = get_target_expr (boolean_true_node);
2252 CLEANUP_EH_ONLY (begin) = 1;
2254 sentry = TARGET_EXPR_SLOT (begin);
2256 TARGET_EXPR_CLEANUP (begin)
2257 = build3 (COND_EXPR, void_type_node, sentry,
2258 cleanup, void_zero_node);
2260 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2261 sentry, boolean_false_node);
2264 = build2 (COMPOUND_EXPR, void_type_node, begin,
2265 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2272 init_expr = NULL_TREE;
2274 /* Now build up the return value in reverse order. */
2279 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2281 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2283 if (rval == data_addr)
2284 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2285 and return the call (which doesn't need to be adjusted). */
2286 rval = TARGET_EXPR_INITIAL (alloc_expr);
2291 tree ifexp = cp_build_binary_op (input_location,
2292 NE_EXPR, alloc_node,
2295 rval = build_conditional_expr (ifexp, rval, alloc_node,
2299 /* Perform the allocation before anything else, so that ALLOC_NODE
2300 has been initialized before we start using it. */
2301 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2304 if (init_preeval_expr)
2305 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2307 /* A new-expression is never an lvalue. */
2308 gcc_assert (!lvalue_p (rval));
2311 rval = avoid_placement_new_aliasing (rval, placement_expr);
2316 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2317 is a vector of placement-new arguments (or NULL if none). If NELTS
2318 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2319 is not NULL, then this is an array-new allocation; TYPE is the type
2320 of the elements in the array and NELTS is the number of elements in
2321 the array. *INIT, if non-NULL, is the initializer for the new
2322 object, or an empty vector to indicate an initializer of "()". If
2323 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2324 rather than just "new". This may change PLACEMENT and INIT. */
2327 build_new (VEC(tree,gc) **placement, tree type, tree nelts,
2328 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain)
2331 VEC(tree,gc) *orig_placement = NULL;
2332 tree orig_nelts = NULL_TREE;
2333 VEC(tree,gc) *orig_init = NULL;
2335 if (type == error_mark_node)
2336 return error_mark_node;
2338 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1)
2340 tree auto_node = type_uses_auto (type);
2341 if (auto_node && describable_type (VEC_index (tree, *init, 0)))
2342 type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node);
2345 if (processing_template_decl)
2347 if (dependent_type_p (type)
2348 || any_type_dependent_arguments_p (*placement)
2349 || (nelts && type_dependent_expression_p (nelts))
2350 || any_type_dependent_arguments_p (*init))
2351 return build_raw_new_expr (*placement, type, nelts, *init,
2354 orig_placement = make_tree_vector_copy (*placement);
2356 orig_init = make_tree_vector_copy (*init);
2358 make_args_non_dependent (*placement);
2360 nelts = build_non_dependent_expr (nelts);
2361 make_args_non_dependent (*init);
2366 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2368 if (complain & tf_error)
2369 permerror (input_location, "size in array new must have integral type");
2371 return error_mark_node;
2373 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2376 /* ``A reference cannot be created by the new operator. A reference
2377 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2378 returned by new.'' ARM 5.3.3 */
2379 if (TREE_CODE (type) == REFERENCE_TYPE)
2381 if (complain & tf_error)
2382 error ("new cannot be applied to a reference type");
2384 return error_mark_node;
2385 type = TREE_TYPE (type);
2388 if (TREE_CODE (type) == FUNCTION_TYPE)
2390 if (complain & tf_error)
2391 error ("new cannot be applied to a function type");
2392 return error_mark_node;
2395 /* The type allocated must be complete. If the new-type-id was
2396 "T[N]" then we are just checking that "T" is complete here, but
2397 that is equivalent, since the value of "N" doesn't matter. */
2398 if (!complete_type_or_else (type, NULL_TREE))
2399 return error_mark_node;
2401 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain);
2402 if (rval == error_mark_node)
2403 return error_mark_node;
2405 if (processing_template_decl)
2407 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts,
2408 orig_init, use_global_new);
2409 release_tree_vector (orig_placement);
2410 release_tree_vector (orig_init);
2414 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2415 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2416 TREE_NO_WARNING (rval) = 1;
2421 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2424 build_java_class_ref (tree type)
2426 tree name = NULL_TREE, class_decl;
2427 static tree CL_suffix = NULL_TREE;
2428 if (CL_suffix == NULL_TREE)
2429 CL_suffix = get_identifier("class$");
2430 if (jclass_node == NULL_TREE)
2432 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2433 if (jclass_node == NULL_TREE)
2435 error ("call to Java constructor, while %<jclass%> undefined");
2436 return error_mark_node;
2438 jclass_node = TREE_TYPE (jclass_node);
2441 /* Mangle the class$ field. */
2444 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2445 if (DECL_NAME (field) == CL_suffix)
2447 mangle_decl (field);
2448 name = DECL_ASSEMBLER_NAME (field);
2453 error ("can't find %<class$%> in %qT", type);
2454 return error_mark_node;
2458 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2459 if (class_decl == NULL_TREE)
2461 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2462 TREE_STATIC (class_decl) = 1;
2463 DECL_EXTERNAL (class_decl) = 1;
2464 TREE_PUBLIC (class_decl) = 1;
2465 DECL_ARTIFICIAL (class_decl) = 1;
2466 DECL_IGNORED_P (class_decl) = 1;
2467 pushdecl_top_level (class_decl);
2468 make_decl_rtl (class_decl);
2474 build_vec_delete_1 (tree base, tree maxindex, tree type,
2475 special_function_kind auto_delete_vec, int use_global_delete)
2478 tree ptype = build_pointer_type (type = complete_type (type));
2479 tree size_exp = size_in_bytes (type);
2481 /* Temporary variables used by the loop. */
2482 tree tbase, tbase_init;
2484 /* This is the body of the loop that implements the deletion of a
2485 single element, and moves temp variables to next elements. */
2488 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2491 /* This is the thing that governs what to do after the loop has run. */
2492 tree deallocate_expr = 0;
2494 /* This is the BIND_EXPR which holds the outermost iterator of the
2495 loop. It is convenient to set this variable up and test it before
2496 executing any other code in the loop.
2497 This is also the containing expression returned by this function. */
2498 tree controller = NULL_TREE;
2501 /* We should only have 1-D arrays here. */
2502 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2504 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2507 /* The below is short by the cookie size. */
2508 virtual_size = size_binop (MULT_EXPR, size_exp,
2509 convert (sizetype, maxindex));
2511 tbase = create_temporary_var (ptype);
2512 tbase_init = cp_build_modify_expr (tbase, NOP_EXPR,
2513 fold_build2 (POINTER_PLUS_EXPR, ptype,
2514 fold_convert (ptype, base),
2516 tf_warning_or_error);
2517 DECL_REGISTER (tbase) = 1;
2518 controller = build3 (BIND_EXPR, void_type_node, tbase,
2519 NULL_TREE, NULL_TREE);
2520 TREE_SIDE_EFFECTS (controller) = 1;
2522 body = build1 (EXIT_EXPR, void_type_node,
2523 build2 (EQ_EXPR, boolean_type_node, tbase,
2524 fold_convert (ptype, base)));
2525 tmp = fold_build1 (NEGATE_EXPR, sizetype, size_exp);
2526 body = build_compound_expr
2527 (body, cp_build_modify_expr (tbase, NOP_EXPR,
2528 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp),
2529 tf_warning_or_error));
2530 body = build_compound_expr
2531 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2532 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2534 loop = build1 (LOOP_EXPR, void_type_node, body);
2535 loop = build_compound_expr (tbase_init, loop);
2538 /* If the delete flag is one, or anything else with the low bit set,
2539 delete the storage. */
2540 if (auto_delete_vec != sfk_base_destructor)
2544 /* The below is short by the cookie size. */
2545 virtual_size = size_binop (MULT_EXPR, size_exp,
2546 convert (sizetype, maxindex));
2548 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2555 cookie_size = targetm.cxx.get_cookie_size (type);
2557 = cp_convert (ptype,
2558 cp_build_binary_op (input_location,
2560 cp_convert (string_type_node,
2563 tf_warning_or_error));
2564 /* True size with header. */
2565 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2568 if (auto_delete_vec == sfk_deleting_destructor)
2569 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2570 base_tbd, virtual_size,
2571 use_global_delete & 1,
2572 /*placement=*/NULL_TREE,
2573 /*alloc_fn=*/NULL_TREE);
2577 if (!deallocate_expr)
2580 body = deallocate_expr;
2582 body = build_compound_expr (body, deallocate_expr);
2585 body = integer_zero_node;
2587 /* Outermost wrapper: If pointer is null, punt. */
2588 body = fold_build3 (COND_EXPR, void_type_node,
2589 fold_build2 (NE_EXPR, boolean_type_node, base,
2590 convert (TREE_TYPE (base),
2591 integer_zero_node)),
2592 body, integer_zero_node);
2593 body = build1 (NOP_EXPR, void_type_node, body);
2597 TREE_OPERAND (controller, 1) = body;
2601 if (TREE_CODE (base) == SAVE_EXPR)
2602 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2603 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2605 return convert_to_void (body, /*implicit=*/NULL, tf_warning_or_error);
2608 /* Create an unnamed variable of the indicated TYPE. */
2611 create_temporary_var (tree type)
2615 decl = build_decl (VAR_DECL, NULL_TREE, type);
2616 TREE_USED (decl) = 1;
2617 DECL_ARTIFICIAL (decl) = 1;
2618 DECL_IGNORED_P (decl) = 1;
2619 DECL_SOURCE_LOCATION (decl) = input_location;
2620 DECL_CONTEXT (decl) = current_function_decl;
2625 /* Create a new temporary variable of the indicated TYPE, initialized
2628 It is not entered into current_binding_level, because that breaks
2629 things when it comes time to do final cleanups (which take place
2630 "outside" the binding contour of the function). */
2633 get_temp_regvar (tree type, tree init)
2637 decl = create_temporary_var (type);
2638 add_decl_expr (decl);
2640 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init,
2641 tf_warning_or_error));
2646 /* `build_vec_init' returns tree structure that performs
2647 initialization of a vector of aggregate types.
2649 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2650 to the first element, of POINTER_TYPE.
2651 MAXINDEX is the maximum index of the array (one less than the
2652 number of elements). It is only used if BASE is a pointer or
2653 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2655 INIT is the (possibly NULL) initializer.
2657 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2658 elements in the array are value-initialized.
2660 FROM_ARRAY is 0 if we should init everything with INIT
2661 (i.e., every element initialized from INIT).
2662 FROM_ARRAY is 1 if we should index into INIT in parallel
2663 with initialization of DECL.
2664 FROM_ARRAY is 2 if we should index into INIT in parallel,
2665 but use assignment instead of initialization. */
2668 build_vec_init (tree base, tree maxindex, tree init,
2669 bool explicit_value_init_p,
2670 int from_array, tsubst_flags_t complain)
2673 tree base2 = NULL_TREE;
2675 tree itype = NULL_TREE;
2677 /* The type of BASE. */
2678 tree atype = TREE_TYPE (base);
2679 /* The type of an element in the array. */
2680 tree type = TREE_TYPE (atype);
2681 /* The element type reached after removing all outer array
2683 tree inner_elt_type;
2684 /* The type of a pointer to an element in the array. */
2689 tree try_block = NULL_TREE;
2690 int num_initialized_elts = 0;
2693 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype))
2694 maxindex = array_type_nelts (atype);
2696 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2697 return error_mark_node;
2699 if (explicit_value_init_p)
2702 inner_elt_type = strip_array_types (type);
2705 ? (!CLASS_TYPE_P (inner_elt_type)
2706 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2707 : !TYPE_NEEDS_CONSTRUCTING (type))
2708 && ((TREE_CODE (init) == CONSTRUCTOR
2709 /* Don't do this if the CONSTRUCTOR might contain something
2710 that might throw and require us to clean up. */
2711 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2712 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2715 /* Do non-default initialization of POD arrays resulting from
2716 brace-enclosed initializers. In this case, digest_init and
2717 store_constructor will handle the semantics for us. */
2719 gcc_assert (TREE_CODE (atype) == ARRAY_TYPE);
2720 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2724 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2725 size = size_in_bytes (type);
2726 if (TREE_CODE (atype) == ARRAY_TYPE)
2728 ptype = build_pointer_type (type);
2729 base = cp_convert (ptype, decay_conversion (base));
2734 /* The code we are generating looks like:
2738 ptrdiff_t iterator = maxindex;
2740 for (; iterator != -1; --iterator) {
2741 ... initialize *t1 ...
2745 ... destroy elements that were constructed ...
2750 We can omit the try and catch blocks if we know that the
2751 initialization will never throw an exception, or if the array
2752 elements do not have destructors. We can omit the loop completely if
2753 the elements of the array do not have constructors.
2755 We actually wrap the entire body of the above in a STMT_EXPR, for
2758 When copying from array to another, when the array elements have
2759 only trivial copy constructors, we should use __builtin_memcpy
2760 rather than generating a loop. That way, we could take advantage
2761 of whatever cleverness the back end has for dealing with copies
2762 of blocks of memory. */
2764 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2765 destroy_temps = stmts_are_full_exprs_p ();
2766 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2767 rval = get_temp_regvar (ptype, base);
2768 base = get_temp_regvar (ptype, rval);
2769 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2771 /* Protect the entire array initialization so that we can destroy
2772 the partially constructed array if an exception is thrown.
2773 But don't do this if we're assigning. */
2774 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2777 try_block = begin_try_block ();
2780 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2782 /* Do non-default initialization of non-POD arrays resulting from
2783 brace-enclosed initializers. */
2784 unsigned HOST_WIDE_INT idx;
2788 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2790 tree baseref = build1 (INDIRECT_REF, type, base);
2792 num_initialized_elts++;
2794 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2795 if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)
2796 finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain));
2798 finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR,
2800 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2802 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2804 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2808 /* Clear out INIT so that we don't get confused below. */
2811 else if (from_array)
2813 /* If initializing one array from another, initialize element by
2814 element. We rely upon the below calls the do argument
2818 base2 = decay_conversion (init);
2819 itype = TREE_TYPE (base2);
2820 base2 = get_temp_regvar (itype, base2);
2821 itype = TREE_TYPE (itype);
2823 else if (TYPE_LANG_SPECIFIC (type)
2824 && TYPE_NEEDS_CONSTRUCTING (type)
2825 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2827 if (complain & tf_error)
2828 error ("initializer ends prematurely");
2829 return error_mark_node;
2833 /* Now, default-initialize any remaining elements. We don't need to
2834 do that if a) the type does not need constructing, or b) we've
2835 already initialized all the elements.
2837 We do need to keep going if we're copying an array. */
2840 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p)
2841 && ! (host_integerp (maxindex, 0)
2842 && (num_initialized_elts
2843 == tree_low_cst (maxindex, 0) + 1))))
2845 /* If the ITERATOR is equal to -1, then we don't have to loop;
2846 we've already initialized all the elements. */
2851 for_stmt = begin_for_stmt ();
2852 finish_for_init_stmt (for_stmt);
2853 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2854 build_int_cst (TREE_TYPE (iterator), -1)),
2856 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0,
2860 to = build1 (INDIRECT_REF, type, base);
2867 from = build1 (INDIRECT_REF, itype, base2);
2871 if (from_array == 2)
2872 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2874 else if (TYPE_NEEDS_CONSTRUCTING (type))
2875 elt_init = build_aggr_init (to, from, 0, complain);
2877 elt_init = cp_build_modify_expr (to, NOP_EXPR, from,
2882 else if (TREE_CODE (type) == ARRAY_TYPE)
2886 ("cannot initialize multi-dimensional array with initializer");
2887 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2889 explicit_value_init_p,
2892 else if (explicit_value_init_p)
2893 elt_init = build2 (INIT_EXPR, type, to,
2894 build_value_init (type));
2897 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type));
2898 elt_init = build_aggr_init (to, init, 0, complain);
2901 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2902 finish_expr_stmt (elt_init);
2903 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2905 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0,
2908 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0,
2911 finish_for_stmt (for_stmt);
2914 /* Make sure to cleanup any partially constructed elements. */
2915 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2919 tree m = cp_build_binary_op (input_location,
2920 MINUS_EXPR, maxindex, iterator,
2923 /* Flatten multi-dimensional array since build_vec_delete only
2924 expects one-dimensional array. */
2925 if (TREE_CODE (type) == ARRAY_TYPE)
2926 m = cp_build_binary_op (input_location,
2928 array_type_nelts_total (type),
2931 finish_cleanup_try_block (try_block);
2932 e = build_vec_delete_1 (rval, m,
2933 inner_elt_type, sfk_base_destructor,
2934 /*use_global_delete=*/0);
2935 finish_cleanup (e, try_block);
2938 /* The value of the array initialization is the array itself, RVAL
2939 is a pointer to the first element. */
2940 finish_stmt_expr_expr (rval, stmt_expr);
2942 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2944 /* Now make the result have the correct type. */
2945 if (TREE_CODE (atype) == ARRAY_TYPE)
2947 atype = build_pointer_type (atype);
2948 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2949 stmt_expr = cp_build_indirect_ref (stmt_expr, NULL, complain);
2950 TREE_NO_WARNING (stmt_expr) = 1;
2953 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2957 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2961 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2967 case sfk_complete_destructor:
2968 name = complete_dtor_identifier;
2971 case sfk_base_destructor:
2972 name = base_dtor_identifier;
2975 case sfk_deleting_destructor:
2976 name = deleting_dtor_identifier;
2982 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2983 return build_new_method_call (exp, fn,
2985 /*conversion_path=*/NULL_TREE,
2988 tf_warning_or_error);
2991 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2992 ADDR is an expression which yields the store to be destroyed.
2993 AUTO_DELETE is the name of the destructor to call, i.e., either
2994 sfk_complete_destructor, sfk_base_destructor, or
2995 sfk_deleting_destructor.
2997 FLAGS is the logical disjunction of zero or more LOOKUP_
2998 flags. See cp-tree.h for more info. */
3001 build_delete (tree type, tree addr, special_function_kind auto_delete,
3002 int flags, int use_global_delete)
3006 if (addr == error_mark_node)
3007 return error_mark_node;
3009 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3010 set to `error_mark_node' before it gets properly cleaned up. */
3011 if (type == error_mark_node)
3012 return error_mark_node;
3014 type = TYPE_MAIN_VARIANT (type);
3016 if (TREE_CODE (type) == POINTER_TYPE)
3018 bool complete_p = true;
3020 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3021 if (TREE_CODE (type) == ARRAY_TYPE)
3024 /* We don't want to warn about delete of void*, only other
3025 incomplete types. Deleting other incomplete types
3026 invokes undefined behavior, but it is not ill-formed, so
3027 compile to something that would even do The Right Thing
3028 (TM) should the type have a trivial dtor and no delete
3030 if (!VOID_TYPE_P (type))
3032 complete_type (type);
3033 if (!COMPLETE_TYPE_P (type))
3035 if (warning (0, "possible problem detected in invocation of "
3036 "delete operator:"))
3038 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING);
3039 inform (input_location, "neither the destructor nor the class-specific "
3040 "operator delete will be called, even if they are "
3041 "declared when the class is defined.");
3046 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type))
3047 /* Call the builtin operator delete. */
3048 return build_builtin_delete_call (addr);
3049 if (TREE_SIDE_EFFECTS (addr))
3050 addr = save_expr (addr);
3052 /* Throw away const and volatile on target type of addr. */
3053 addr = convert_force (build_pointer_type (type), addr, 0);
3055 else if (TREE_CODE (type) == ARRAY_TYPE)
3059 if (TYPE_DOMAIN (type) == NULL_TREE)
3061 error ("unknown array size in delete");
3062 return error_mark_node;
3064 return build_vec_delete (addr, array_type_nelts (type),
3065 auto_delete, use_global_delete);
3069 /* Don't check PROTECT here; leave that decision to the
3070 destructor. If the destructor is accessible, call it,
3071 else report error. */
3072 addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error);
3073 if (TREE_SIDE_EFFECTS (addr))
3074 addr = save_expr (addr);
3076 addr = convert_force (build_pointer_type (type), addr, 0);
3079 gcc_assert (MAYBE_CLASS_TYPE_P (type));
3081 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3083 if (auto_delete != sfk_deleting_destructor)
3084 return void_zero_node;
3086 return build_op_delete_call (DELETE_EXPR, addr,
3087 cxx_sizeof_nowarn (type),
3089 /*placement=*/NULL_TREE,
3090 /*alloc_fn=*/NULL_TREE);
3094 tree head = NULL_TREE;
3095 tree do_delete = NULL_TREE;
3098 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3099 lazily_declare_fn (sfk_destructor, type);
3101 /* For `::delete x', we must not use the deleting destructor
3102 since then we would not be sure to get the global `operator
3104 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3106 /* We will use ADDR multiple times so we must save it. */
3107 addr = save_expr (addr);
3108 head = get_target_expr (build_headof (addr));
3109 /* Delete the object. */
3110 do_delete = build_builtin_delete_call (head);
3111 /* Otherwise, treat this like a complete object destructor
3113 auto_delete = sfk_complete_destructor;
3115 /* If the destructor is non-virtual, there is no deleting
3116 variant. Instead, we must explicitly call the appropriate
3117 `operator delete' here. */
3118 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3119 && auto_delete == sfk_deleting_destructor)
3121 /* We will use ADDR multiple times so we must save it. */
3122 addr = save_expr (addr);
3123 /* Build the call. */
3124 do_delete = build_op_delete_call (DELETE_EXPR,
3126 cxx_sizeof_nowarn (type),
3128 /*placement=*/NULL_TREE,
3129 /*alloc_fn=*/NULL_TREE);
3130 /* Call the complete object destructor. */
3131 auto_delete = sfk_complete_destructor;
3133 else if (auto_delete == sfk_deleting_destructor
3134 && TYPE_GETS_REG_DELETE (type))
3136 /* Make sure we have access to the member op delete, even though
3137 we'll actually be calling it from the destructor. */
3138 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3140 /*placement=*/NULL_TREE,
3141 /*alloc_fn=*/NULL_TREE);
3144 expr = build_dtor_call (cp_build_indirect_ref (addr, NULL,
3145 tf_warning_or_error),
3146 auto_delete, flags);
3148 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3150 /* We need to calculate this before the dtor changes the vptr. */
3152 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3154 if (flags & LOOKUP_DESTRUCTOR)
3155 /* Explicit destructor call; don't check for null pointer. */
3156 ifexp = integer_one_node;
3158 /* Handle deleting a null pointer. */
3159 ifexp = fold (cp_build_binary_op (input_location,
3160 NE_EXPR, addr, integer_zero_node,
3161 tf_warning_or_error));
3163 if (ifexp != integer_one_node)
3164 expr = build3 (COND_EXPR, void_type_node,
3165 ifexp, expr, void_zero_node);
3171 /* At the beginning of a destructor, push cleanups that will call the
3172 destructors for our base classes and members.
3174 Called from begin_destructor_body. */
3177 push_base_cleanups (void)
3179 tree binfo, base_binfo;
3183 VEC(tree,gc) *vbases;
3185 /* Run destructors for all virtual baseclasses. */
3186 if (CLASSTYPE_VBASECLASSES (current_class_type))
3188 tree cond = (condition_conversion
3189 (build2 (BIT_AND_EXPR, integer_type_node,
3190 current_in_charge_parm,
3191 integer_two_node)));
3193 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3194 order, which is also the right order for pushing cleanups. */
3195 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3196 VEC_iterate (tree, vbases, i, base_binfo); i++)
3198 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3200 expr = build_special_member_call (current_class_ref,
3201 base_dtor_identifier,
3205 | LOOKUP_NONVIRTUAL),
3206 tf_warning_or_error);
3207 expr = build3 (COND_EXPR, void_type_node, cond,
3208 expr, void_zero_node);
3209 finish_decl_cleanup (NULL_TREE, expr);
3214 /* Take care of the remaining baseclasses. */
3215 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3216 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3218 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3219 || BINFO_VIRTUAL_P (base_binfo))
3222 expr = build_special_member_call (current_class_ref,
3223 base_dtor_identifier,
3225 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL,
3226 tf_warning_or_error);
3227 finish_decl_cleanup (NULL_TREE, expr);
3230 for (member = TYPE_FIELDS (current_class_type); member;
3231 member = TREE_CHAIN (member))
3233 if (TREE_TYPE (member) == error_mark_node
3234 || TREE_CODE (member) != FIELD_DECL
3235 || DECL_ARTIFICIAL (member))
3237 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3239 tree this_member = (build_class_member_access_expr
3240 (current_class_ref, member,
3241 /*access_path=*/NULL_TREE,
3242 /*preserve_reference=*/false,
3243 tf_warning_or_error));
3244 tree this_type = TREE_TYPE (member);
3245 expr = build_delete (this_type, this_member,
3246 sfk_complete_destructor,
3247 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3249 finish_decl_cleanup (NULL_TREE, expr);
3254 /* Build a C++ vector delete expression.
3255 MAXINDEX is the number of elements to be deleted.
3256 ELT_SIZE is the nominal size of each element in the vector.
3257 BASE is the expression that should yield the store to be deleted.
3258 This function expands (or synthesizes) these calls itself.
3259 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3261 This also calls delete for virtual baseclasses of elements of the vector.
3263 Update: MAXINDEX is no longer needed. The size can be extracted from the
3264 start of the vector for pointers, and from the type for arrays. We still
3265 use MAXINDEX for arrays because it happens to already have one of the
3266 values we'd have to extract. (We could use MAXINDEX with pointers to
3267 confirm the size, and trap if the numbers differ; not clear that it'd
3268 be worth bothering.) */
3271 build_vec_delete (tree base, tree maxindex,
3272 special_function_kind auto_delete_vec, int use_global_delete)
3276 tree base_init = NULL_TREE;
3278 type = TREE_TYPE (base);
3280 if (TREE_CODE (type) == POINTER_TYPE)
3282 /* Step back one from start of vector, and read dimension. */
3284 tree size_ptr_type = build_pointer_type (sizetype);
3286 if (TREE_SIDE_EFFECTS (base))
3288 base_init = get_target_expr (base);
3289 base = TARGET_EXPR_SLOT (base_init);
3291 type = strip_array_types (TREE_TYPE (type));
3292 cookie_addr = fold_build1 (NEGATE_EXPR, sizetype, TYPE_SIZE_UNIT (sizetype));
3293 cookie_addr = build2 (POINTER_PLUS_EXPR,
3295 fold_convert (size_ptr_type, base),
3297 maxindex = cp_build_indirect_ref (cookie_addr, NULL, tf_warning_or_error);
3299 else if (TREE_CODE (type) == ARRAY_TYPE)
3301 /* Get the total number of things in the array, maxindex is a
3303 maxindex = array_type_nelts_total (type);
3304 type = strip_array_types (type);
3305 base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error);
3306 if (TREE_SIDE_EFFECTS (base))
3308 base_init = get_target_expr (base);
3309 base = TARGET_EXPR_SLOT (base_init);
3314 if (base != error_mark_node)
3315 error ("type to vector delete is neither pointer or array type");
3316 return error_mark_node;
3319 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3322 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);