1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
39 static bool begin_init_stmts (tree *, tree *);
40 static tree finish_init_stmts (bool, tree, tree);
41 static void construct_virtual_base (tree, tree);
42 static void expand_aggr_init_1 (tree, tree, tree, tree, int);
43 static void expand_default_init (tree, tree, tree, tree, int);
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. */
265 TREE_CONSTANT (init) = 1;
266 TREE_INVARIANT (init) = 1;
272 /* Build an expression for the default-initialization of an object of
273 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
274 ARRAY_TYPE, NELTS is the number of elements in the array. If
275 initialization of TYPE requires calling constructors, this function
276 returns NULL_TREE; the caller is responsible for arranging for the
277 constructors to be called. */
280 build_default_init (tree type, tree nelts)
284 To default-initialize an object of type T means:
286 --if T is a non-POD class type (clause _class_), the default construc-
287 tor for T is called (and the initialization is ill-formed if T has
288 no accessible default constructor);
290 --if T is an array type, each element is default-initialized;
292 --otherwise, the storage for the object is zero-initialized.
294 A program that calls for default-initialization of an entity of refer-
295 ence type is ill-formed. */
297 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
298 performing the initialization. This is confusing in that some
299 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
300 a class with a pointer-to-data member as a non-static data member
301 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
302 passing non-PODs to build_zero_init below, which is contrary to
303 the semantics quoted above from [dcl.init].
305 It happens, however, that the behavior of the constructor the
306 standard says we should have generated would be precisely the
307 same as that obtained by calling build_zero_init below, so things
309 if (TYPE_NEEDS_CONSTRUCTING (type)
310 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
313 /* At this point, TYPE is either a POD class type, an array of POD
314 classes, or something even more innocuous. */
315 return build_zero_init (type, nelts, /*static_storage_p=*/false);
318 /* Return a suitable initializer for value-initializing an object of type
319 TYPE, as described in [dcl.init]. If HAVE_CTOR is true, the initializer
320 for an enclosing object is already calling the constructor for this
324 build_value_init_1 (tree type, bool have_ctor)
328 To value-initialize an object of type T means:
330 - if T is a class type (clause 9) with a user-provided constructor
331 (12.1), then the default constructor for T is called (and the
332 initialization is ill-formed if T has no accessible default
335 - if T is a non-union class type without a user-provided constructor,
336 then every non-static data member and base-class component of T is
337 value-initialized;92)
339 - if T is an array type, then each element is value-initialized;
341 - otherwise, the object is zero-initialized.
343 A program that calls for default-initialization or
344 value-initialization of an entity of reference type is ill-formed.
346 92) Value-initialization for such a class object may be implemented by
347 zero-initializing the object and then calling the default
350 if (CLASS_TYPE_P (type))
352 if (TYPE_HAS_USER_CONSTRUCTOR (type) && !have_ctor)
353 return build_cplus_new
355 build_special_member_call (NULL_TREE, complete_ctor_identifier,
356 NULL_TREE, type, LOOKUP_NORMAL));
357 else if (TREE_CODE (type) != UNION_TYPE)
360 VEC(constructor_elt,gc) *v = NULL;
361 bool call_ctor = !have_ctor && TYPE_NEEDS_CONSTRUCTING (type);
363 /* Iterate over the fields, building initializations. */
364 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
368 if (TREE_CODE (field) != FIELD_DECL)
371 ftype = TREE_TYPE (field);
373 if (TREE_CODE (ftype) == REFERENCE_TYPE)
374 error ("value-initialization of reference");
376 /* We could skip vfields and fields of types with
377 user-defined constructors, but I think that won't improve
378 performance at all; it should be simpler in general just
379 to zero out the entire object than try to only zero the
380 bits that actually need it. */
382 /* Note that for class types there will be FIELD_DECLs
383 corresponding to base classes as well. Thus, iterating
384 over TYPE_FIELDs will result in correct initialization of
385 all of the subobjects. */
386 value = build_value_init_1 (ftype, have_ctor || call_ctor);
389 CONSTRUCTOR_APPEND_ELT(v, field, value);
392 /* Build a constructor to contain the zero- initializations. */
393 init = build_constructor (type, v);
396 /* This is a class that needs constructing, but doesn't have
397 a user-defined constructor. So we need to zero-initialize
398 the object and then call the implicitly defined ctor.
399 Implement this by sticking the zero-initialization inside
400 the TARGET_EXPR for the constructor call;
401 cp_gimplify_init_expr will know how to handle it. */
402 tree ctor = build_special_member_call
403 (NULL_TREE, complete_ctor_identifier,
404 NULL_TREE, type, LOOKUP_NORMAL);
406 ctor = build_cplus_new (type, ctor);
407 init = build2 (INIT_EXPR, void_type_node,
408 TARGET_EXPR_SLOT (ctor), init);
409 init = build2 (COMPOUND_EXPR, void_type_node, init,
410 TARGET_EXPR_INITIAL (ctor));
411 TARGET_EXPR_INITIAL (ctor) = init;
417 else if (TREE_CODE (type) == ARRAY_TYPE)
419 VEC(constructor_elt,gc) *v = NULL;
421 /* Iterate over the array elements, building initializations. */
422 tree max_index = array_type_nelts (type);
424 /* If we have an error_mark here, we should just return error mark
425 as we don't know the size of the array yet. */
426 if (max_index == error_mark_node)
427 return error_mark_node;
428 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
430 /* A zero-sized array, which is accepted as an extension, will
431 have an upper bound of -1. */
432 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
436 v = VEC_alloc (constructor_elt, gc, 1);
437 ce = VEC_quick_push (constructor_elt, v, NULL);
439 /* If this is a one element array, we just use a regular init. */
440 if (tree_int_cst_equal (size_zero_node, max_index))
441 ce->index = size_zero_node;
443 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
446 ce->value = build_value_init_1 (TREE_TYPE (type), have_ctor);
449 /* Build a constructor to contain the initializations. */
450 return build_constructor (type, v);
453 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false);
456 /* Return a suitable initializer for value-initializing an object of type
457 TYPE, as described in [dcl.init]. */
460 build_value_init (tree type)
462 return build_value_init_1 (type, false);
465 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
466 arguments. If TREE_LIST is void_type_node, an empty initializer
467 list was given; if NULL_TREE no initializer was given. */
470 perform_member_init (tree member, tree init)
473 tree type = TREE_TYPE (member);
476 explicit = (init != NULL_TREE);
478 /* Effective C++ rule 12 requires that all data members be
480 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
481 warning (OPT_Weffc__, "%J%qD should be initialized in the member initialization "
482 "list", current_function_decl, member);
484 if (init == void_type_node)
487 /* Get an lvalue for the data member. */
488 decl = build_class_member_access_expr (current_class_ref, member,
489 /*access_path=*/NULL_TREE,
490 /*preserve_reference=*/true);
491 if (decl == error_mark_node)
494 /* Deal with this here, as we will get confused if we try to call the
495 assignment op for an anonymous union. This can happen in a
496 synthesized copy constructor. */
497 if (ANON_AGGR_TYPE_P (type))
501 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
502 finish_expr_stmt (init);
505 else if (TYPE_NEEDS_CONSTRUCTING (type))
508 && TREE_CODE (type) == ARRAY_TYPE
510 && TREE_CHAIN (init) == NULL_TREE
511 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
513 /* Initialization of one array from another. */
514 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
515 /*explicit_default_init_p=*/false,
519 finish_expr_stmt (build_aggr_init (decl, init, 0));
523 if (init == NULL_TREE)
527 init = build_default_init (type, /*nelts=*/NULL_TREE);
528 if (TREE_CODE (type) == REFERENCE_TYPE)
529 warning (0, "%Jdefault-initialization of %q#D, "
530 "which has reference type",
531 current_function_decl, member);
533 /* member traversal: note it leaves init NULL */
534 else if (TREE_CODE (type) == REFERENCE_TYPE)
535 pedwarn ("%Juninitialized reference member %qD",
536 current_function_decl, member);
537 else if (CP_TYPE_CONST_P (type))
538 pedwarn ("%Juninitialized member %qD with %<const%> type %qT",
539 current_function_decl, member, type);
541 else if (TREE_CODE (init) == TREE_LIST)
542 /* There was an explicit member initialization. Do some work
544 init = build_x_compound_expr_from_list (init, "member initializer");
547 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
550 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
554 expr = build_class_member_access_expr (current_class_ref, member,
555 /*access_path=*/NULL_TREE,
556 /*preserve_reference=*/false);
557 expr = build_delete (type, expr, sfk_complete_destructor,
558 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
560 if (expr != error_mark_node)
561 finish_eh_cleanup (expr);
565 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
566 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
569 build_field_list (tree t, tree list, int *uses_unions_p)
575 /* Note whether or not T is a union. */
576 if (TREE_CODE (t) == UNION_TYPE)
579 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
581 /* Skip CONST_DECLs for enumeration constants and so forth. */
582 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
585 /* Keep track of whether or not any fields are unions. */
586 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
589 /* For an anonymous struct or union, we must recursively
590 consider the fields of the anonymous type. They can be
591 directly initialized from the constructor. */
592 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
594 /* Add this field itself. Synthesized copy constructors
595 initialize the entire aggregate. */
596 list = tree_cons (fields, NULL_TREE, list);
597 /* And now add the fields in the anonymous aggregate. */
598 list = build_field_list (TREE_TYPE (fields), list,
601 /* Add this field. */
602 else if (DECL_NAME (fields))
603 list = tree_cons (fields, NULL_TREE, list);
609 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
610 a FIELD_DECL or BINFO in T that needs initialization. The
611 TREE_VALUE gives the initializer, or list of initializer arguments.
613 Return a TREE_LIST containing all of the initializations required
614 for T, in the order in which they should be performed. The output
615 list has the same format as the input. */
618 sort_mem_initializers (tree t, tree mem_inits)
621 tree base, binfo, base_binfo;
624 VEC(tree,gc) *vbases;
628 /* Build up a list of initializations. The TREE_PURPOSE of entry
629 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
630 TREE_VALUE will be the constructor arguments, or NULL if no
631 explicit initialization was provided. */
632 sorted_inits = NULL_TREE;
634 /* Process the virtual bases. */
635 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
636 VEC_iterate (tree, vbases, i, base); i++)
637 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
639 /* Process the direct bases. */
640 for (binfo = TYPE_BINFO (t), i = 0;
641 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
642 if (!BINFO_VIRTUAL_P (base_binfo))
643 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
645 /* Process the non-static data members. */
646 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
647 /* Reverse the entire list of initializations, so that they are in
648 the order that they will actually be performed. */
649 sorted_inits = nreverse (sorted_inits);
651 /* If the user presented the initializers in an order different from
652 that in which they will actually occur, we issue a warning. Keep
653 track of the next subobject which can be explicitly initialized
654 without issuing a warning. */
655 next_subobject = sorted_inits;
657 /* Go through the explicit initializers, filling in TREE_PURPOSE in
659 for (init = mem_inits; init; init = TREE_CHAIN (init))
664 subobject = TREE_PURPOSE (init);
666 /* If the explicit initializers are in sorted order, then
667 SUBOBJECT will be NEXT_SUBOBJECT, or something following
669 for (subobject_init = next_subobject;
671 subobject_init = TREE_CHAIN (subobject_init))
672 if (TREE_PURPOSE (subobject_init) == subobject)
675 /* Issue a warning if the explicit initializer order does not
676 match that which will actually occur.
677 ??? Are all these on the correct lines? */
678 if (warn_reorder && !subobject_init)
680 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
681 warning (OPT_Wreorder, "%q+D will be initialized after",
682 TREE_PURPOSE (next_subobject));
684 warning (OPT_Wreorder, "base %qT will be initialized after",
685 TREE_PURPOSE (next_subobject));
686 if (TREE_CODE (subobject) == FIELD_DECL)
687 warning (OPT_Wreorder, " %q+#D", subobject);
689 warning (OPT_Wreorder, " base %qT", subobject);
690 warning (OPT_Wreorder, "%J when initialized here", current_function_decl);
693 /* Look again, from the beginning of the list. */
696 subobject_init = sorted_inits;
697 while (TREE_PURPOSE (subobject_init) != subobject)
698 subobject_init = TREE_CHAIN (subobject_init);
701 /* It is invalid to initialize the same subobject more than
703 if (TREE_VALUE (subobject_init))
705 if (TREE_CODE (subobject) == FIELD_DECL)
706 error ("%Jmultiple initializations given for %qD",
707 current_function_decl, subobject);
709 error ("%Jmultiple initializations given for base %qT",
710 current_function_decl, subobject);
713 /* Record the initialization. */
714 TREE_VALUE (subobject_init) = TREE_VALUE (init);
715 next_subobject = subobject_init;
720 If a ctor-initializer specifies more than one mem-initializer for
721 multiple members of the same union (including members of
722 anonymous unions), the ctor-initializer is ill-formed. */
725 tree last_field = NULL_TREE;
726 for (init = sorted_inits; init; init = TREE_CHAIN (init))
732 /* Skip uninitialized members and base classes. */
733 if (!TREE_VALUE (init)
734 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
736 /* See if this field is a member of a union, or a member of a
737 structure contained in a union, etc. */
738 field = TREE_PURPOSE (init);
739 for (field_type = DECL_CONTEXT (field);
740 !same_type_p (field_type, t);
741 field_type = TYPE_CONTEXT (field_type))
742 if (TREE_CODE (field_type) == UNION_TYPE)
744 /* If this field is not a member of a union, skip it. */
745 if (TREE_CODE (field_type) != UNION_TYPE)
748 /* It's only an error if we have two initializers for the same
756 /* See if LAST_FIELD and the field initialized by INIT are
757 members of the same union. If so, there's a problem,
758 unless they're actually members of the same structure
759 which is itself a member of a union. For example, given:
761 union { struct { int i; int j; }; };
763 initializing both `i' and `j' makes sense. */
764 field_type = DECL_CONTEXT (field);
768 tree last_field_type;
770 last_field_type = DECL_CONTEXT (last_field);
773 if (same_type_p (last_field_type, field_type))
775 if (TREE_CODE (field_type) == UNION_TYPE)
776 error ("%Jinitializations for multiple members of %qT",
777 current_function_decl, last_field_type);
782 if (same_type_p (last_field_type, t))
785 last_field_type = TYPE_CONTEXT (last_field_type);
788 /* If we've reached the outermost class, then we're
790 if (same_type_p (field_type, t))
793 field_type = TYPE_CONTEXT (field_type);
804 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
805 is a TREE_LIST giving the explicit mem-initializer-list for the
806 constructor. The TREE_PURPOSE of each entry is a subobject (a
807 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
808 is a TREE_LIST giving the arguments to the constructor or
809 void_type_node for an empty list of arguments. */
812 emit_mem_initializers (tree mem_inits)
814 /* We will already have issued an error message about the fact that
815 the type is incomplete. */
816 if (!COMPLETE_TYPE_P (current_class_type))
819 /* Sort the mem-initializers into the order in which the
820 initializations should be performed. */
821 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
823 in_base_initializer = 1;
825 /* Initialize base classes. */
827 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
829 tree subobject = TREE_PURPOSE (mem_inits);
830 tree arguments = TREE_VALUE (mem_inits);
832 /* If these initializations are taking place in a copy constructor,
833 the base class should probably be explicitly initialized if there
834 is a user-defined constructor in the base class (other than the
835 default constructor, which will be called anyway). */
836 if (extra_warnings && !arguments
837 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
838 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject)))
839 warning (OPT_Wextra, "%Jbase class %q#T should be explicitly initialized in the "
841 current_function_decl, BINFO_TYPE (subobject));
843 /* If an explicit -- but empty -- initializer list was present,
844 treat it just like default initialization at this point. */
845 if (arguments == void_type_node)
846 arguments = NULL_TREE;
848 /* Initialize the base. */
849 if (BINFO_VIRTUAL_P (subobject))
850 construct_virtual_base (subobject, arguments);
855 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
857 expand_aggr_init_1 (subobject, NULL_TREE,
858 build_indirect_ref (base_addr, NULL),
861 expand_cleanup_for_base (subobject, NULL_TREE);
864 mem_inits = TREE_CHAIN (mem_inits);
866 in_base_initializer = 0;
868 /* Initialize the vptrs. */
869 initialize_vtbl_ptrs (current_class_ptr);
871 /* Initialize the data members. */
874 perform_member_init (TREE_PURPOSE (mem_inits),
875 TREE_VALUE (mem_inits));
876 mem_inits = TREE_CHAIN (mem_inits);
880 /* Returns the address of the vtable (i.e., the value that should be
881 assigned to the vptr) for BINFO. */
884 build_vtbl_address (tree binfo)
886 tree binfo_for = binfo;
889 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
890 /* If this is a virtual primary base, then the vtable we want to store
891 is that for the base this is being used as the primary base of. We
892 can't simply skip the initialization, because we may be expanding the
893 inits of a subobject constructor where the virtual base layout
895 while (BINFO_PRIMARY_P (binfo_for))
896 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
898 /* Figure out what vtable BINFO's vtable is based on, and mark it as
900 vtbl = get_vtbl_decl_for_binfo (binfo_for);
901 assemble_external (vtbl);
902 TREE_USED (vtbl) = 1;
904 /* Now compute the address to use when initializing the vptr. */
905 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
906 if (TREE_CODE (vtbl) == VAR_DECL)
907 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
912 /* This code sets up the virtual function tables appropriate for
913 the pointer DECL. It is a one-ply initialization.
915 BINFO is the exact type that DECL is supposed to be. In
916 multiple inheritance, this might mean "C's A" if C : A, B. */
919 expand_virtual_init (tree binfo, tree decl)
924 /* Compute the initializer for vptr. */
925 vtbl = build_vtbl_address (binfo);
927 /* We may get this vptr from a VTT, if this is a subobject
928 constructor or subobject destructor. */
929 vtt_index = BINFO_VPTR_INDEX (binfo);
935 /* Compute the value to use, when there's a VTT. */
936 vtt_parm = current_vtt_parm;
937 vtbl2 = build2 (POINTER_PLUS_EXPR,
938 TREE_TYPE (vtt_parm),
941 vtbl2 = build_indirect_ref (vtbl2, NULL);
942 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
944 /* The actual initializer is the VTT value only in the subobject
945 constructor. In maybe_clone_body we'll substitute NULL for
946 the vtt_parm in the case of the non-subobject constructor. */
947 vtbl = build3 (COND_EXPR,
949 build2 (EQ_EXPR, boolean_type_node,
950 current_in_charge_parm, integer_zero_node),
955 /* Compute the location of the vtpr. */
956 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
958 gcc_assert (vtbl_ptr != error_mark_node);
960 /* Assign the vtable to the vptr. */
961 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
962 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
965 /* If an exception is thrown in a constructor, those base classes already
966 constructed must be destroyed. This function creates the cleanup
967 for BINFO, which has just been constructed. If FLAG is non-NULL,
968 it is a DECL which is nonzero when this base needs to be
972 expand_cleanup_for_base (tree binfo, tree flag)
976 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
979 /* Call the destructor. */
980 expr = build_special_member_call (current_class_ref,
981 base_dtor_identifier,
984 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
986 expr = fold_build3 (COND_EXPR, void_type_node,
987 c_common_truthvalue_conversion (flag),
988 expr, integer_zero_node);
990 finish_eh_cleanup (expr);
993 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
997 construct_virtual_base (tree vbase, tree arguments)
1003 /* If there are virtual base classes with destructors, we need to
1004 emit cleanups to destroy them if an exception is thrown during
1005 the construction process. These exception regions (i.e., the
1006 period during which the cleanups must occur) begin from the time
1007 the construction is complete to the end of the function. If we
1008 create a conditional block in which to initialize the
1009 base-classes, then the cleanup region for the virtual base begins
1010 inside a block, and ends outside of that block. This situation
1011 confuses the sjlj exception-handling code. Therefore, we do not
1012 create a single conditional block, but one for each
1013 initialization. (That way the cleanup regions always begin
1014 in the outer block.) We trust the back end to figure out
1015 that the FLAG will not change across initializations, and
1016 avoid doing multiple tests. */
1017 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
1018 inner_if_stmt = begin_if_stmt ();
1019 finish_if_stmt_cond (flag, inner_if_stmt);
1021 /* Compute the location of the virtual base. If we're
1022 constructing virtual bases, then we must be the most derived
1023 class. Therefore, we don't have to look up the virtual base;
1024 we already know where it is. */
1025 exp = convert_to_base_statically (current_class_ref, vbase);
1027 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
1029 finish_then_clause (inner_if_stmt);
1030 finish_if_stmt (inner_if_stmt);
1032 expand_cleanup_for_base (vbase, flag);
1035 /* Find the context in which this FIELD can be initialized. */
1038 initializing_context (tree field)
1040 tree t = DECL_CONTEXT (field);
1042 /* Anonymous union members can be initialized in the first enclosing
1043 non-anonymous union context. */
1044 while (t && ANON_AGGR_TYPE_P (t))
1045 t = TYPE_CONTEXT (t);
1049 /* Function to give error message if member initialization specification
1050 is erroneous. FIELD is the member we decided to initialize.
1051 TYPE is the type for which the initialization is being performed.
1052 FIELD must be a member of TYPE.
1054 MEMBER_NAME is the name of the member. */
1057 member_init_ok_or_else (tree field, tree type, tree member_name)
1059 if (field == error_mark_node)
1063 error ("class %qT does not have any field named %qD", type,
1067 if (TREE_CODE (field) == VAR_DECL)
1069 error ("%q#D is a static data member; it can only be "
1070 "initialized at its definition",
1074 if (TREE_CODE (field) != FIELD_DECL)
1076 error ("%q#D is not a non-static data member of %qT",
1080 if (initializing_context (field) != type)
1082 error ("class %qT does not have any field named %qD", type,
1090 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1091 is a _TYPE node or TYPE_DECL which names a base for that type.
1092 Check the validity of NAME, and return either the base _TYPE, base
1093 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1094 NULL_TREE and issue a diagnostic.
1096 An old style unnamed direct single base construction is permitted,
1097 where NAME is NULL. */
1100 expand_member_init (tree name)
1105 if (!current_class_ref)
1110 /* This is an obsolete unnamed base class initializer. The
1111 parser will already have warned about its use. */
1112 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
1115 error ("unnamed initializer for %qT, which has no base classes",
1116 current_class_type);
1119 basetype = BINFO_TYPE
1120 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
1123 error ("unnamed initializer for %qT, which uses multiple inheritance",
1124 current_class_type);
1128 else if (TYPE_P (name))
1130 basetype = TYPE_MAIN_VARIANT (name);
1131 name = TYPE_NAME (name);
1133 else if (TREE_CODE (name) == TYPE_DECL)
1134 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1136 basetype = NULL_TREE;
1145 if (current_template_parms)
1148 class_binfo = TYPE_BINFO (current_class_type);
1149 direct_binfo = NULL_TREE;
1150 virtual_binfo = NULL_TREE;
1152 /* Look for a direct base. */
1153 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1154 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1157 /* Look for a virtual base -- unless the direct base is itself
1159 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1160 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1162 /* [class.base.init]
1164 If a mem-initializer-id is ambiguous because it designates
1165 both a direct non-virtual base class and an inherited virtual
1166 base class, the mem-initializer is ill-formed. */
1167 if (direct_binfo && virtual_binfo)
1169 error ("%qD is both a direct base and an indirect virtual base",
1174 if (!direct_binfo && !virtual_binfo)
1176 if (CLASSTYPE_VBASECLASSES (current_class_type))
1177 error ("type %qT is not a direct or virtual base of %qT",
1178 basetype, current_class_type);
1180 error ("type %qT is not a direct base of %qT",
1181 basetype, current_class_type);
1185 return direct_binfo ? direct_binfo : virtual_binfo;
1189 if (TREE_CODE (name) == IDENTIFIER_NODE)
1190 field = lookup_field (current_class_type, name, 1, false);
1194 if (member_init_ok_or_else (field, current_class_type, name))
1201 /* This is like `expand_member_init', only it stores one aggregate
1204 INIT comes in two flavors: it is either a value which
1205 is to be stored in EXP, or it is a parameter list
1206 to go to a constructor, which will operate on EXP.
1207 If INIT is not a parameter list for a constructor, then set
1208 LOOKUP_ONLYCONVERTING.
1209 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1210 the initializer, if FLAGS is 0, then it is the (init) form.
1211 If `init' is a CONSTRUCTOR, then we emit a warning message,
1212 explaining that such initializations are invalid.
1214 If INIT resolves to a CALL_EXPR which happens to return
1215 something of the type we are looking for, then we know
1216 that we can safely use that call to perform the
1219 The virtual function table pointer cannot be set up here, because
1220 we do not really know its type.
1222 This never calls operator=().
1224 When initializing, nothing is CONST.
1226 A default copy constructor may have to be used to perform the
1229 A constructor or a conversion operator may have to be used to
1230 perform the initialization, but not both, as it would be ambiguous. */
1233 build_aggr_init (tree exp, tree init, int flags)
1238 tree type = TREE_TYPE (exp);
1239 int was_const = TREE_READONLY (exp);
1240 int was_volatile = TREE_THIS_VOLATILE (exp);
1243 if (init == error_mark_node)
1244 return error_mark_node;
1246 TREE_READONLY (exp) = 0;
1247 TREE_THIS_VOLATILE (exp) = 0;
1249 if (init && TREE_CODE (init) != TREE_LIST)
1250 flags |= LOOKUP_ONLYCONVERTING;
1252 if (TREE_CODE (type) == ARRAY_TYPE)
1256 /* An array may not be initialized use the parenthesized
1257 initialization form -- unless the initializer is "()". */
1258 if (init && TREE_CODE (init) == TREE_LIST)
1260 error ("bad array initializer");
1261 return error_mark_node;
1263 /* Must arrange to initialize each element of EXP
1264 from elements of INIT. */
1265 itype = init ? TREE_TYPE (init) : NULL_TREE;
1266 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1267 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1268 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1269 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1270 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1271 /*explicit_default_init_p=*/false,
1272 itype && same_type_p (itype,
1274 TREE_READONLY (exp) = was_const;
1275 TREE_THIS_VOLATILE (exp) = was_volatile;
1276 TREE_TYPE (exp) = type;
1278 TREE_TYPE (init) = itype;
1282 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1283 /* Just know that we've seen something for this node. */
1284 TREE_USED (exp) = 1;
1286 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1287 destroy_temps = stmts_are_full_exprs_p ();
1288 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1289 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1290 init, LOOKUP_NORMAL|flags);
1291 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1292 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1293 TREE_READONLY (exp) = was_const;
1294 TREE_THIS_VOLATILE (exp) = was_volatile;
1300 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1302 tree type = TREE_TYPE (exp);
1305 /* It fails because there may not be a constructor which takes
1306 its own type as the first (or only parameter), but which does
1307 take other types via a conversion. So, if the thing initializing
1308 the expression is a unit element of type X, first try X(X&),
1309 followed by initialization by X. If neither of these work
1310 out, then look hard. */
1314 if (init && TREE_CODE (init) != TREE_LIST
1315 && (flags & LOOKUP_ONLYCONVERTING))
1317 /* Base subobjects should only get direct-initialization. */
1318 gcc_assert (true_exp == exp);
1320 if (flags & DIRECT_BIND)
1321 /* Do nothing. We hit this in two cases: Reference initialization,
1322 where we aren't initializing a real variable, so we don't want
1323 to run a new constructor; and catching an exception, where we
1324 have already built up the constructor call so we could wrap it
1325 in an exception region. */;
1326 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1328 /* A brace-enclosed initializer for an aggregate. */
1329 gcc_assert (CP_AGGREGATE_TYPE_P (type));
1330 init = digest_init (type, init);
1333 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1335 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1336 /* We need to protect the initialization of a catch parm with a
1337 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1338 around the TARGET_EXPR for the copy constructor. See
1339 initialize_handler_parm. */
1341 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1342 TREE_OPERAND (init, 0));
1343 TREE_TYPE (init) = void_type_node;
1346 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1347 TREE_SIDE_EFFECTS (init) = 1;
1348 finish_expr_stmt (init);
1352 if (init == NULL_TREE
1353 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1357 init = TREE_VALUE (parms);
1360 parms = build_tree_list (NULL_TREE, init);
1362 if (true_exp == exp)
1363 ctor_name = complete_ctor_identifier;
1365 ctor_name = base_ctor_identifier;
1367 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1368 if (TREE_SIDE_EFFECTS (rval))
1369 finish_expr_stmt (convert_to_void (rval, NULL));
1372 /* This function is responsible for initializing EXP with INIT
1375 BINFO is the binfo of the type for who we are performing the
1376 initialization. For example, if W is a virtual base class of A and B,
1378 If we are initializing B, then W must contain B's W vtable, whereas
1379 were we initializing C, W must contain C's W vtable.
1381 TRUE_EXP is nonzero if it is the true expression being initialized.
1382 In this case, it may be EXP, or may just contain EXP. The reason we
1383 need this is because if EXP is a base element of TRUE_EXP, we
1384 don't necessarily know by looking at EXP where its virtual
1385 baseclass fields should really be pointing. But we do know
1386 from TRUE_EXP. In constructors, we don't know anything about
1387 the value being initialized.
1389 FLAGS is just passed to `build_new_method_call'. See that function
1390 for its description. */
1393 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1395 tree type = TREE_TYPE (exp);
1397 gcc_assert (init != error_mark_node && type != error_mark_node);
1398 gcc_assert (building_stmt_tree ());
1400 /* Use a function returning the desired type to initialize EXP for us.
1401 If the function is a constructor, and its first argument is
1402 NULL_TREE, know that it was meant for us--just slide exp on
1403 in and expand the constructor. Constructors now come
1406 if (init && TREE_CODE (exp) == VAR_DECL
1407 && COMPOUND_LITERAL_P (init))
1409 /* If store_init_value returns NULL_TREE, the INIT has been
1410 recorded as the DECL_INITIAL for EXP. That means there's
1411 nothing more we have to do. */
1412 init = store_init_value (exp, init);
1414 finish_expr_stmt (init);
1418 /* We know that expand_default_init can handle everything we want
1420 expand_default_init (binfo, true_exp, exp, init, flags);
1423 /* Report an error if TYPE is not a user-defined, aggregate type. If
1424 OR_ELSE is nonzero, give an error message. */
1427 is_aggr_type (tree type, int or_else)
1429 if (type == error_mark_node)
1432 if (! IS_AGGR_TYPE (type))
1435 error ("%qT is not an aggregate type", type);
1442 get_type_value (tree name)
1444 if (name == error_mark_node)
1447 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1448 return IDENTIFIER_TYPE_VALUE (name);
1453 /* Build a reference to a member of an aggregate. This is not a C++
1454 `&', but really something which can have its address taken, and
1455 then act as a pointer to member, for example TYPE :: FIELD can have
1456 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1457 this expression is the operand of "&".
1459 @@ Prints out lousy diagnostics for operator <typename>
1462 @@ This function should be rewritten and placed in search.c. */
1465 build_offset_ref (tree type, tree member, bool address_p)
1468 tree basebinfo = NULL_TREE;
1470 /* class templates can come in as TEMPLATE_DECLs here. */
1471 if (TREE_CODE (member) == TEMPLATE_DECL)
1474 if (dependent_type_p (type) || type_dependent_expression_p (member))
1475 return build_qualified_name (NULL_TREE, type, member,
1476 /*template_p=*/false);
1478 gcc_assert (TYPE_P (type));
1479 if (! is_aggr_type (type, 1))
1480 return error_mark_node;
1482 gcc_assert (DECL_P (member) || BASELINK_P (member));
1483 /* Callers should call mark_used before this point. */
1484 gcc_assert (!DECL_P (member) || TREE_USED (member));
1486 if (!COMPLETE_TYPE_P (complete_type (type))
1487 && !TYPE_BEING_DEFINED (type))
1489 error ("incomplete type %qT does not have member %qD", type, member);
1490 return error_mark_node;
1493 /* Entities other than non-static members need no further
1495 if (TREE_CODE (member) == TYPE_DECL)
1497 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1498 return convert_from_reference (member);
1500 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1502 error ("invalid pointer to bit-field %qD", member);
1503 return error_mark_node;
1506 /* Set up BASEBINFO for member lookup. */
1507 decl = maybe_dummy_object (type, &basebinfo);
1509 /* A lot of this logic is now handled in lookup_member. */
1510 if (BASELINK_P (member))
1512 /* Go from the TREE_BASELINK to the member function info. */
1513 tree t = BASELINK_FUNCTIONS (member);
1515 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1517 /* Get rid of a potential OVERLOAD around it. */
1518 t = OVL_CURRENT (t);
1520 /* Unique functions are handled easily. */
1522 /* For non-static member of base class, we need a special rule
1523 for access checking [class.protected]:
1525 If the access is to form a pointer to member, the
1526 nested-name-specifier shall name the derived class
1527 (or any class derived from that class). */
1528 if (address_p && DECL_P (t)
1529 && DECL_NONSTATIC_MEMBER_P (t))
1530 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1532 perform_or_defer_access_check (basebinfo, t, t);
1534 if (DECL_STATIC_FUNCTION_P (t))
1539 TREE_TYPE (member) = unknown_type_node;
1541 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1542 /* We need additional test besides the one in
1543 check_accessibility_of_qualified_id in case it is
1544 a pointer to non-static member. */
1545 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1549 /* If MEMBER is non-static, then the program has fallen afoul of
1552 An id-expression that denotes a nonstatic data member or
1553 nonstatic member function of a class can only be used:
1555 -- as part of a class member access (_expr.ref_) in which the
1556 object-expression refers to the member's class or a class
1557 derived from that class, or
1559 -- to form a pointer to member (_expr.unary.op_), or
1561 -- in the body of a nonstatic member function of that class or
1562 of a class derived from that class (_class.mfct.nonstatic_), or
1564 -- in a mem-initializer for a constructor for that class or for
1565 a class derived from that class (_class.base.init_). */
1566 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1568 /* Build a representation of a the qualified name suitable
1569 for use as the operand to "&" -- even though the "&" is
1570 not actually present. */
1571 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1572 /* In Microsoft mode, treat a non-static member function as if
1573 it were a pointer-to-member. */
1574 if (flag_ms_extensions)
1576 PTRMEM_OK_P (member) = 1;
1577 return build_unary_op (ADDR_EXPR, member, 0);
1579 error ("invalid use of non-static member function %qD",
1580 TREE_OPERAND (member, 1));
1581 return error_mark_node;
1583 else if (TREE_CODE (member) == FIELD_DECL)
1585 error ("invalid use of non-static data member %qD", member);
1586 return error_mark_node;
1591 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1592 PTRMEM_OK_P (member) = 1;
1596 /* If DECL is a scalar enumeration constant or variable with a
1597 constant initializer, return the initializer (or, its initializers,
1598 recursively); otherwise, return DECL. If INTEGRAL_P, the
1599 initializer is only returned if DECL is an integral
1600 constant-expression. */
1603 constant_value_1 (tree decl, bool integral_p)
1605 while (TREE_CODE (decl) == CONST_DECL
1607 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1608 : (TREE_CODE (decl) == VAR_DECL
1609 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1612 /* Static data members in template classes may have
1613 non-dependent initializers. References to such non-static
1614 data members are not value-dependent, so we must retrieve the
1615 initializer here. The DECL_INITIAL will have the right type,
1616 but will not have been folded because that would prevent us
1617 from performing all appropriate semantic checks at
1618 instantiation time. */
1619 if (DECL_CLASS_SCOPE_P (decl)
1620 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1621 && uses_template_parms (CLASSTYPE_TI_ARGS
1622 (DECL_CONTEXT (decl))))
1624 ++processing_template_decl;
1625 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1626 --processing_template_decl;
1630 /* If DECL is a static data member in a template
1631 specialization, we must instantiate it here. The
1632 initializer for the static data member is not processed
1633 until needed; we need it now. */
1635 init = DECL_INITIAL (decl);
1637 if (init == error_mark_node)
1640 || !TREE_TYPE (init)
1642 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1643 : (!TREE_CONSTANT (init)
1644 /* Do not return an aggregate constant (of which
1645 string literals are a special case), as we do not
1646 want to make inadvertent copies of such entities,
1647 and we must be sure that their addresses are the
1649 || TREE_CODE (init) == CONSTRUCTOR
1650 || TREE_CODE (init) == STRING_CST)))
1652 decl = unshare_expr (init);
1657 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1658 constant of integral or enumeration type, then return that value.
1659 These are those variables permitted in constant expressions by
1663 integral_constant_value (tree decl)
1665 return constant_value_1 (decl, /*integral_p=*/true);
1668 /* A more relaxed version of integral_constant_value, used by the
1669 common C/C++ code and by the C++ front end for optimization
1673 decl_constant_value (tree decl)
1675 return constant_value_1 (decl,
1676 /*integral_p=*/processing_template_decl);
1679 /* Common subroutines of build_new and build_vec_delete. */
1681 /* Call the global __builtin_delete to delete ADDR. */
1684 build_builtin_delete_call (tree addr)
1686 mark_used (global_delete_fndecl);
1687 return build_call_n (global_delete_fndecl, 1, addr);
1690 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1691 the type of the object being allocated; otherwise, it's just TYPE.
1692 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1693 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1694 the TREE_LIST of arguments to be provided as arguments to a
1695 placement new operator. This routine performs no semantic checks;
1696 it just creates and returns a NEW_EXPR. */
1699 build_raw_new_expr (tree placement, tree type, tree nelts, tree init,
1704 new_expr = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1706 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1707 TREE_SIDE_EFFECTS (new_expr) = 1;
1712 /* Make sure that there are no aliasing issues with T, a placement new
1713 expression applied to PLACEMENT, by recording the change in dynamic
1714 type. If placement new is inlined, as it is with libstdc++, and if
1715 the type of the placement new differs from the type of the
1716 placement location itself, then alias analysis may think it is OK
1717 to interchange writes to the location from before the placement new
1718 and from after the placement new. We have to prevent type-based
1719 alias analysis from applying. PLACEMENT may be NULL, which means
1720 that we couldn't capture it in a temporary variable, in which case
1721 we use a memory clobber. */
1724 avoid_placement_new_aliasing (tree t, tree placement)
1728 if (processing_template_decl)
1731 /* If we are not using type based aliasing, we don't have to do
1733 if (!flag_strict_aliasing)
1736 /* If we have a pointer and a location, record the change in dynamic
1737 type. Otherwise we need a general memory clobber. */
1738 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE
1739 && placement != NULL_TREE
1740 && TREE_CODE (TREE_TYPE (placement)) == POINTER_TYPE)
1741 type_change = build_stmt (CHANGE_DYNAMIC_TYPE_EXPR,
1746 /* Build a memory clobber. */
1747 type_change = build_stmt (ASM_EXPR,
1748 build_string (0, ""),
1751 tree_cons (NULL_TREE,
1752 build_string (6, "memory"),
1755 ASM_VOLATILE_P (type_change) = 1;
1758 return build2 (COMPOUND_EXPR, TREE_TYPE (t), type_change, t);
1761 /* Generate code for a new-expression, including calling the "operator
1762 new" function, initializing the object, and, if an exception occurs
1763 during construction, cleaning up. The arguments are as for
1764 build_raw_new_expr. */
1767 build_new_1 (tree placement, tree type, tree nelts, tree init,
1768 bool globally_qualified_p)
1771 /* True iff this is a call to "operator new[]" instead of just
1773 bool array_p = false;
1774 /* True iff ARRAY_P is true and the bound of the array type is
1775 not necessarily a compile time constant. For example, VLA_P is
1776 true for "new int[f()]". */
1778 /* The type being allocated. If ARRAY_P is true, this will be an
1781 /* If ARRAY_P is true, the element type of the array. This is an
1782 never ARRAY_TYPE; for something like "new int[3][4]", the
1783 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1786 /* The type of the new-expression. (This type is always a pointer
1789 /* A pointer type pointing to the FULL_TYPE. */
1790 tree full_pointer_type;
1791 tree outer_nelts = NULL_TREE;
1792 tree alloc_call, alloc_expr;
1793 /* The address returned by the call to "operator new". This node is
1794 a VAR_DECL and is therefore reusable. */
1797 tree cookie_expr, init_expr;
1798 int nothrow, check_new;
1799 int use_java_new = 0;
1800 /* If non-NULL, the number of extra bytes to allocate at the
1801 beginning of the storage allocated for an array-new expression in
1802 order to store the number of elements. */
1803 tree cookie_size = NULL_TREE;
1804 tree placement_expr = NULL_TREE;
1805 /* True if the function we are calling is a placement allocation
1807 bool placement_allocation_fn_p;
1808 tree args = NULL_TREE;
1809 /* True if the storage must be initialized, either by a constructor
1810 or due to an explicit new-initializer. */
1811 bool is_initialized;
1812 /* The address of the thing allocated, not including any cookie. In
1813 particular, if an array cookie is in use, DATA_ADDR is the
1814 address of the first array element. This node is a VAR_DECL, and
1815 is therefore reusable. */
1817 tree init_preeval_expr = NULL_TREE;
1823 outer_nelts = nelts;
1826 /* ??? The middle-end will error on us for building a VLA outside a
1827 function context. Methinks that's not it's purvey. So we'll do
1828 our own VLA layout later. */
1830 index = convert (sizetype, nelts);
1831 index = size_binop (MINUS_EXPR, index, size_one_node);
1832 index = build_index_type (index);
1833 full_type = build_cplus_array_type (type, NULL_TREE);
1834 /* We need a copy of the type as build_array_type will return a shared copy
1835 of the incomplete array type. */
1836 full_type = build_distinct_type_copy (full_type);
1837 TYPE_DOMAIN (full_type) = index;
1838 SET_TYPE_STRUCTURAL_EQUALITY (full_type);
1843 if (TREE_CODE (type) == ARRAY_TYPE)
1846 nelts = array_type_nelts_top (type);
1847 outer_nelts = nelts;
1848 type = TREE_TYPE (type);
1852 /* If our base type is an array, then make sure we know how many elements
1854 for (elt_type = type;
1855 TREE_CODE (elt_type) == ARRAY_TYPE;
1856 elt_type = TREE_TYPE (elt_type))
1857 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1858 array_type_nelts_top (elt_type));
1860 if (TREE_CODE (elt_type) == VOID_TYPE)
1862 error ("invalid type %<void%> for new");
1863 return error_mark_node;
1866 if (abstract_virtuals_error (NULL_TREE, elt_type))
1867 return error_mark_node;
1869 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1870 if (CP_TYPE_CONST_P (elt_type) && !is_initialized)
1872 error ("uninitialized const in %<new%> of %q#T", elt_type);
1873 return error_mark_node;
1876 size = size_in_bytes (elt_type);
1879 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1884 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1885 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1886 ...>> to be valid. */
1887 TYPE_SIZE_UNIT (full_type) = size;
1888 n = convert (bitsizetype, nelts);
1889 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1890 TYPE_SIZE (full_type) = bitsize;
1894 alloc_fn = NULL_TREE;
1896 /* Allocate the object. */
1897 if (! placement && TYPE_FOR_JAVA (elt_type))
1900 tree class_decl = build_java_class_ref (elt_type);
1901 static const char alloc_name[] = "_Jv_AllocObject";
1903 if (class_decl == error_mark_node)
1904 return error_mark_node;
1907 if (!get_global_value_if_present (get_identifier (alloc_name),
1910 error ("call to Java constructor with %qs undefined", alloc_name);
1911 return error_mark_node;
1913 else if (really_overloaded_fn (alloc_fn))
1915 error ("%qD should never be overloaded", alloc_fn);
1916 return error_mark_node;
1918 alloc_fn = OVL_CURRENT (alloc_fn);
1919 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1920 alloc_call = (build_function_call
1922 build_tree_list (NULL_TREE, class_addr)));
1924 else if (TYPE_FOR_JAVA (elt_type) && IS_AGGR_TYPE (elt_type))
1926 error ("Java class %q#T object allocated using placement new", elt_type);
1927 return error_mark_node;
1934 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1936 if (!globally_qualified_p
1937 && CLASS_TYPE_P (elt_type)
1939 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1940 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1942 /* Use a class-specific operator new. */
1943 /* If a cookie is required, add some extra space. */
1944 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1946 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1947 size = size_binop (PLUS_EXPR, size, cookie_size);
1949 /* Create the argument list. */
1950 args = tree_cons (NULL_TREE, size, placement);
1951 /* Do name-lookup to find the appropriate operator. */
1952 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1953 if (fns == NULL_TREE)
1955 error ("no suitable %qD found in class %qT", fnname, elt_type);
1956 return error_mark_node;
1958 if (TREE_CODE (fns) == TREE_LIST)
1960 error ("request for member %qD is ambiguous", fnname);
1961 print_candidates (fns);
1962 return error_mark_node;
1964 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1966 /*conversion_path=*/NULL_TREE,
1972 /* Use a global operator new. */
1973 /* See if a cookie might be required. */
1974 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1975 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1977 cookie_size = NULL_TREE;
1979 alloc_call = build_operator_new_call (fnname, placement,
1980 &size, &cookie_size,
1985 if (alloc_call == error_mark_node)
1986 return error_mark_node;
1988 gcc_assert (alloc_fn != NULL_TREE);
1990 /* If PLACEMENT is a simple pointer type and is not passed by reference,
1991 then copy it into PLACEMENT_EXPR. */
1992 if (!processing_template_decl
1993 && placement != NULL_TREE
1994 && TREE_CHAIN (placement) == NULL_TREE
1995 && TREE_CODE (TREE_TYPE (TREE_VALUE (placement))) == POINTER_TYPE
1996 && TREE_CODE (alloc_call) == CALL_EXPR
1997 && call_expr_nargs (alloc_call) == 2
1998 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE
1999 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE)
2001 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1);
2003 if (INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))
2004 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))))
2006 placement_expr = get_target_expr (TREE_VALUE (placement));
2007 CALL_EXPR_ARG (alloc_call, 1)
2008 = convert (TREE_TYPE (placement_arg), placement_expr);
2012 /* In the simple case, we can stop now. */
2013 pointer_type = build_pointer_type (type);
2014 if (!cookie_size && !is_initialized)
2016 rval = build_nop (pointer_type, alloc_call);
2017 if (placement != NULL)
2018 rval = avoid_placement_new_aliasing (rval, placement_expr);
2022 /* While we're working, use a pointer to the type we've actually
2023 allocated. Store the result of the call in a variable so that we
2024 can use it more than once. */
2025 full_pointer_type = build_pointer_type (full_type);
2026 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2027 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2029 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2030 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2031 alloc_call = TREE_OPERAND (alloc_call, 1);
2033 /* Now, check to see if this function is actually a placement
2034 allocation function. This can happen even when PLACEMENT is NULL
2035 because we might have something like:
2037 struct S { void* operator new (size_t, int i = 0); };
2039 A call to `new S' will get this allocation function, even though
2040 there is no explicit placement argument. If there is more than
2041 one argument, or there are variable arguments, then this is a
2042 placement allocation function. */
2043 placement_allocation_fn_p
2044 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2045 || varargs_function_p (alloc_fn));
2047 /* Preevaluate the placement args so that we don't reevaluate them for a
2048 placement delete. */
2049 if (placement_allocation_fn_p)
2052 stabilize_call (alloc_call, &inits);
2054 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2058 /* unless an allocation function is declared with an empty excep-
2059 tion-specification (_except.spec_), throw(), it indicates failure to
2060 allocate storage by throwing a bad_alloc exception (clause _except_,
2061 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2062 cation function is declared with an empty exception-specification,
2063 throw(), it returns null to indicate failure to allocate storage and a
2064 non-null pointer otherwise.
2066 So check for a null exception spec on the op new we just called. */
2068 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2069 check_new = (flag_check_new || nothrow) && ! use_java_new;
2077 /* Adjust so we're pointing to the start of the object. */
2078 data_addr = get_target_expr (build2 (POINTER_PLUS_EXPR, full_pointer_type,
2079 alloc_node, cookie_size));
2081 /* Store the number of bytes allocated so that we can know how
2082 many elements to destroy later. We use the last sizeof
2083 (size_t) bytes to store the number of elements. */
2084 cookie_ptr = fold_build1 (NEGATE_EXPR, sizetype, size_in_bytes (sizetype));
2085 size_ptr_type = build_pointer_type (sizetype);
2086 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type,
2087 fold_convert (size_ptr_type, data_addr), cookie_ptr);
2088 cookie = build_indirect_ref (cookie_ptr, NULL);
2090 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2092 if (targetm.cxx.cookie_has_size ())
2094 /* Also store the element size. */
2095 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
2096 fold_build1 (NEGATE_EXPR, sizetype,
2097 size_in_bytes (sizetype)));
2099 cookie = build_indirect_ref (cookie_ptr, NULL);
2100 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2101 size_in_bytes(elt_type));
2102 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2103 cookie, cookie_expr);
2105 data_addr = TARGET_EXPR_SLOT (data_addr);
2109 cookie_expr = NULL_TREE;
2110 data_addr = alloc_node;
2113 /* Now initialize the allocated object. Note that we preevaluate the
2114 initialization expression, apart from the actual constructor call or
2115 assignment--we do this because we want to delay the allocation as long
2116 as possible in order to minimize the size of the exception region for
2117 placement delete. */
2122 init_expr = build_indirect_ref (data_addr, NULL);
2126 bool explicit_default_init_p = false;
2128 if (init == void_zero_node)
2131 explicit_default_init_p = true;
2134 pedwarn ("ISO C++ forbids initialization in array new");
2137 = build_vec_init (init_expr,
2138 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2141 explicit_default_init_p,
2144 /* An array initialization is stable because the initialization
2145 of each element is a full-expression, so the temporaries don't
2151 if (init == void_zero_node)
2152 init = build_default_init (full_type, nelts);
2154 if (TYPE_NEEDS_CONSTRUCTING (type))
2156 init_expr = build_special_member_call (init_expr,
2157 complete_ctor_identifier,
2160 stable = stabilize_init (init_expr, &init_preeval_expr);
2164 /* We are processing something like `new int (10)', which
2165 means allocate an int, and initialize it with 10. */
2167 if (TREE_CODE (init) == TREE_LIST)
2168 init = build_x_compound_expr_from_list (init,
2171 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
2172 || TREE_TYPE (init) != NULL_TREE);
2174 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2175 stable = stabilize_init (init_expr, &init_preeval_expr);
2179 if (init_expr == error_mark_node)
2180 return error_mark_node;
2182 /* If any part of the object initialization terminates by throwing an
2183 exception and a suitable deallocation function can be found, the
2184 deallocation function is called to free the memory in which the
2185 object was being constructed, after which the exception continues
2186 to propagate in the context of the new-expression. If no
2187 unambiguous matching deallocation function can be found,
2188 propagating the exception does not cause the object's memory to be
2190 if (flag_exceptions && ! use_java_new)
2192 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2195 /* The Standard is unclear here, but the right thing to do
2196 is to use the same method for finding deallocation
2197 functions that we use for finding allocation functions. */
2198 cleanup = build_op_delete_call (dcode, alloc_node, size,
2199 globally_qualified_p,
2200 (placement_allocation_fn_p
2201 ? alloc_call : NULL_TREE),
2207 /* This is much simpler if we were able to preevaluate all of
2208 the arguments to the constructor call. */
2209 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2210 init_expr, cleanup);
2212 /* Ack! First we allocate the memory. Then we set our sentry
2213 variable to true, and expand a cleanup that deletes the
2214 memory if sentry is true. Then we run the constructor, and
2215 finally clear the sentry.
2217 We need to do this because we allocate the space first, so
2218 if there are any temporaries with cleanups in the
2219 constructor args and we weren't able to preevaluate them, we
2220 need this EH region to extend until end of full-expression
2221 to preserve nesting. */
2223 tree end, sentry, begin;
2225 begin = get_target_expr (boolean_true_node);
2226 CLEANUP_EH_ONLY (begin) = 1;
2228 sentry = TARGET_EXPR_SLOT (begin);
2230 TARGET_EXPR_CLEANUP (begin)
2231 = build3 (COND_EXPR, void_type_node, sentry,
2232 cleanup, void_zero_node);
2234 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2235 sentry, boolean_false_node);
2238 = build2 (COMPOUND_EXPR, void_type_node, begin,
2239 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2246 init_expr = NULL_TREE;
2248 /* Now build up the return value in reverse order. */
2253 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2255 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2257 if (rval == alloc_node)
2258 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2259 and return the call (which doesn't need to be adjusted). */
2260 rval = TARGET_EXPR_INITIAL (alloc_expr);
2265 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2267 rval = build_conditional_expr (ifexp, rval, alloc_node);
2270 /* Perform the allocation before anything else, so that ALLOC_NODE
2271 has been initialized before we start using it. */
2272 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2275 if (init_preeval_expr)
2276 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2278 /* Convert to the final type. */
2279 rval = build_nop (pointer_type, rval);
2281 /* A new-expression is never an lvalue. */
2282 gcc_assert (!lvalue_p (rval));
2284 if (placement != NULL)
2285 rval = avoid_placement_new_aliasing (rval, placement_expr);
2290 /* Generate a representation for a C++ "new" expression. PLACEMENT is
2291 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
2292 NELTS is NULL, TYPE is the type of the storage to be allocated. If
2293 NELTS is not NULL, then this is an array-new allocation; TYPE is
2294 the type of the elements in the array and NELTS is the number of
2295 elements in the array. INIT, if non-NULL, is the initializer for
2296 the new object, or void_zero_node to indicate an initializer of
2297 "()". If USE_GLOBAL_NEW is true, then the user explicitly wrote
2298 "::new" rather than just "new". */
2301 build_new (tree placement, tree type, tree nelts, tree init,
2305 tree orig_placement;
2309 if (placement == error_mark_node || type == error_mark_node
2310 || init == error_mark_node)
2311 return error_mark_node;
2313 orig_placement = placement;
2317 if (processing_template_decl)
2319 if (dependent_type_p (type)
2320 || any_type_dependent_arguments_p (placement)
2321 || (nelts && type_dependent_expression_p (nelts))
2322 || (init != void_zero_node
2323 && any_type_dependent_arguments_p (init)))
2324 return build_raw_new_expr (placement, type, nelts, init,
2326 placement = build_non_dependent_args (placement);
2328 nelts = build_non_dependent_expr (nelts);
2329 if (init != void_zero_node)
2330 init = build_non_dependent_args (init);
2335 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2336 pedwarn ("size in array new must have integral type");
2337 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2340 /* ``A reference cannot be created by the new operator. A reference
2341 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2342 returned by new.'' ARM 5.3.3 */
2343 if (TREE_CODE (type) == REFERENCE_TYPE)
2345 error ("new cannot be applied to a reference type");
2346 type = TREE_TYPE (type);
2349 if (TREE_CODE (type) == FUNCTION_TYPE)
2351 error ("new cannot be applied to a function type");
2352 return error_mark_node;
2355 /* The type allocated must be complete. If the new-type-id was
2356 "T[N]" then we are just checking that "T" is complete here, but
2357 that is equivalent, since the value of "N" doesn't matter. */
2358 if (!complete_type_or_else (type, NULL_TREE))
2359 return error_mark_node;
2361 rval = build_new_1 (placement, type, nelts, init, use_global_new);
2362 if (rval == error_mark_node)
2363 return error_mark_node;
2365 if (processing_template_decl)
2366 return build_raw_new_expr (orig_placement, type, orig_nelts, orig_init,
2369 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2370 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2371 TREE_NO_WARNING (rval) = 1;
2376 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2379 build_java_class_ref (tree type)
2381 tree name = NULL_TREE, class_decl;
2382 static tree CL_suffix = NULL_TREE;
2383 if (CL_suffix == NULL_TREE)
2384 CL_suffix = get_identifier("class$");
2385 if (jclass_node == NULL_TREE)
2387 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2388 if (jclass_node == NULL_TREE)
2390 error ("call to Java constructor, while %<jclass%> undefined");
2391 return error_mark_node;
2393 jclass_node = TREE_TYPE (jclass_node);
2396 /* Mangle the class$ field. */
2399 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2400 if (DECL_NAME (field) == CL_suffix)
2402 mangle_decl (field);
2403 name = DECL_ASSEMBLER_NAME (field);
2408 error ("can't find %<class$%> in %qT", type);
2409 return error_mark_node;
2413 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2414 if (class_decl == NULL_TREE)
2416 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2417 TREE_STATIC (class_decl) = 1;
2418 DECL_EXTERNAL (class_decl) = 1;
2419 TREE_PUBLIC (class_decl) = 1;
2420 DECL_ARTIFICIAL (class_decl) = 1;
2421 DECL_IGNORED_P (class_decl) = 1;
2422 pushdecl_top_level (class_decl);
2423 make_decl_rtl (class_decl);
2429 build_vec_delete_1 (tree base, tree maxindex, tree type,
2430 special_function_kind auto_delete_vec, int use_global_delete)
2433 tree ptype = build_pointer_type (type = complete_type (type));
2434 tree size_exp = size_in_bytes (type);
2436 /* Temporary variables used by the loop. */
2437 tree tbase, tbase_init;
2439 /* This is the body of the loop that implements the deletion of a
2440 single element, and moves temp variables to next elements. */
2443 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2446 /* This is the thing that governs what to do after the loop has run. */
2447 tree deallocate_expr = 0;
2449 /* This is the BIND_EXPR which holds the outermost iterator of the
2450 loop. It is convenient to set this variable up and test it before
2451 executing any other code in the loop.
2452 This is also the containing expression returned by this function. */
2453 tree controller = NULL_TREE;
2456 /* We should only have 1-D arrays here. */
2457 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2459 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2462 /* The below is short by the cookie size. */
2463 virtual_size = size_binop (MULT_EXPR, size_exp,
2464 convert (sizetype, maxindex));
2466 tbase = create_temporary_var (ptype);
2467 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2468 fold_build2 (POINTER_PLUS_EXPR, ptype,
2469 fold_convert (ptype, base),
2471 DECL_REGISTER (tbase) = 1;
2472 controller = build3 (BIND_EXPR, void_type_node, tbase,
2473 NULL_TREE, NULL_TREE);
2474 TREE_SIDE_EFFECTS (controller) = 1;
2476 body = build1 (EXIT_EXPR, void_type_node,
2477 build2 (EQ_EXPR, boolean_type_node, tbase,
2478 fold_convert (ptype, base)));
2479 tmp = fold_build1 (NEGATE_EXPR, sizetype, size_exp);
2480 body = build_compound_expr
2481 (body, build_modify_expr (tbase, NOP_EXPR,
2482 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp)));
2483 body = build_compound_expr
2484 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2485 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2487 loop = build1 (LOOP_EXPR, void_type_node, body);
2488 loop = build_compound_expr (tbase_init, loop);
2491 /* If the delete flag is one, or anything else with the low bit set,
2492 delete the storage. */
2493 if (auto_delete_vec != sfk_base_destructor)
2497 /* The below is short by the cookie size. */
2498 virtual_size = size_binop (MULT_EXPR, size_exp,
2499 convert (sizetype, maxindex));
2501 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2508 cookie_size = targetm.cxx.get_cookie_size (type);
2510 = cp_convert (ptype,
2511 cp_build_binary_op (MINUS_EXPR,
2512 cp_convert (string_type_node,
2515 /* True size with header. */
2516 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2519 if (auto_delete_vec == sfk_deleting_destructor)
2520 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2521 base_tbd, virtual_size,
2522 use_global_delete & 1,
2523 /*placement=*/NULL_TREE,
2524 /*alloc_fn=*/NULL_TREE);
2528 if (!deallocate_expr)
2531 body = deallocate_expr;
2533 body = build_compound_expr (body, deallocate_expr);
2536 body = integer_zero_node;
2538 /* Outermost wrapper: If pointer is null, punt. */
2539 body = fold_build3 (COND_EXPR, void_type_node,
2540 fold_build2 (NE_EXPR, boolean_type_node, base,
2541 convert (TREE_TYPE (base),
2542 integer_zero_node)),
2543 body, integer_zero_node);
2544 body = build1 (NOP_EXPR, void_type_node, body);
2548 TREE_OPERAND (controller, 1) = body;
2552 if (TREE_CODE (base) == SAVE_EXPR)
2553 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2554 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2556 return convert_to_void (body, /*implicit=*/NULL);
2559 /* Create an unnamed variable of the indicated TYPE. */
2562 create_temporary_var (tree type)
2566 decl = build_decl (VAR_DECL, NULL_TREE, type);
2567 TREE_USED (decl) = 1;
2568 DECL_ARTIFICIAL (decl) = 1;
2569 DECL_IGNORED_P (decl) = 1;
2570 DECL_SOURCE_LOCATION (decl) = input_location;
2571 DECL_CONTEXT (decl) = current_function_decl;
2576 /* Create a new temporary variable of the indicated TYPE, initialized
2579 It is not entered into current_binding_level, because that breaks
2580 things when it comes time to do final cleanups (which take place
2581 "outside" the binding contour of the function). */
2584 get_temp_regvar (tree type, tree init)
2588 decl = create_temporary_var (type);
2589 add_decl_expr (decl);
2591 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2596 /* `build_vec_init' returns tree structure that performs
2597 initialization of a vector of aggregate types.
2599 BASE is a reference to the vector, of ARRAY_TYPE.
2600 MAXINDEX is the maximum index of the array (one less than the
2601 number of elements). It is only used if
2602 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2604 INIT is the (possibly NULL) initializer.
2606 If EXPLICIT_DEFAULT_INIT_P is true, then INIT must be NULL. All
2607 elements in the array are default-initialized.
2609 FROM_ARRAY is 0 if we should init everything with INIT
2610 (i.e., every element initialized from INIT).
2611 FROM_ARRAY is 1 if we should index into INIT in parallel
2612 with initialization of DECL.
2613 FROM_ARRAY is 2 if we should index into INIT in parallel,
2614 but use assignment instead of initialization. */
2617 build_vec_init (tree base, tree maxindex, tree init,
2618 bool explicit_default_init_p,
2622 tree base2 = NULL_TREE;
2624 tree itype = NULL_TREE;
2626 /* The type of the array. */
2627 tree atype = TREE_TYPE (base);
2628 /* The type of an element in the array. */
2629 tree type = TREE_TYPE (atype);
2630 /* The element type reached after removing all outer array
2632 tree inner_elt_type;
2633 /* The type of a pointer to an element in the array. */
2638 tree try_block = NULL_TREE;
2639 int num_initialized_elts = 0;
2642 if (TYPE_DOMAIN (atype))
2643 maxindex = array_type_nelts (atype);
2645 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2646 return error_mark_node;
2648 if (explicit_default_init_p)
2651 inner_elt_type = strip_array_types (atype);
2654 ? (!CLASS_TYPE_P (inner_elt_type)
2655 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2656 : !TYPE_NEEDS_CONSTRUCTING (type))
2657 && ((TREE_CODE (init) == CONSTRUCTOR
2658 /* Don't do this if the CONSTRUCTOR might contain something
2659 that might throw and require us to clean up. */
2660 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2661 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2664 /* Do non-default initialization of POD arrays resulting from
2665 brace-enclosed initializers. In this case, digest_init and
2666 store_constructor will handle the semantics for us. */
2668 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2672 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2673 ptype = build_pointer_type (type);
2674 size = size_in_bytes (type);
2675 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2676 base = cp_convert (ptype, decay_conversion (base));
2678 /* The code we are generating looks like:
2682 ptrdiff_t iterator = maxindex;
2684 for (; iterator != -1; --iterator) {
2685 ... initialize *t1 ...
2689 ... destroy elements that were constructed ...
2694 We can omit the try and catch blocks if we know that the
2695 initialization will never throw an exception, or if the array
2696 elements do not have destructors. We can omit the loop completely if
2697 the elements of the array do not have constructors.
2699 We actually wrap the entire body of the above in a STMT_EXPR, for
2702 When copying from array to another, when the array elements have
2703 only trivial copy constructors, we should use __builtin_memcpy
2704 rather than generating a loop. That way, we could take advantage
2705 of whatever cleverness the back end has for dealing with copies
2706 of blocks of memory. */
2708 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2709 destroy_temps = stmts_are_full_exprs_p ();
2710 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2711 rval = get_temp_regvar (ptype, base);
2712 base = get_temp_regvar (ptype, rval);
2713 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2715 /* Protect the entire array initialization so that we can destroy
2716 the partially constructed array if an exception is thrown.
2717 But don't do this if we're assigning. */
2718 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2721 try_block = begin_try_block ();
2724 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2726 /* Do non-default initialization of non-POD arrays resulting from
2727 brace-enclosed initializers. */
2728 unsigned HOST_WIDE_INT idx;
2732 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2734 tree baseref = build1 (INDIRECT_REF, type, base);
2736 num_initialized_elts++;
2738 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2739 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2740 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2742 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2744 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2746 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2747 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2750 /* Clear out INIT so that we don't get confused below. */
2753 else if (from_array)
2755 /* If initializing one array from another, initialize element by
2756 element. We rely upon the below calls the do argument
2760 base2 = decay_conversion (init);
2761 itype = TREE_TYPE (base2);
2762 base2 = get_temp_regvar (itype, base2);
2763 itype = TREE_TYPE (itype);
2765 else if (TYPE_LANG_SPECIFIC (type)
2766 && TYPE_NEEDS_CONSTRUCTING (type)
2767 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2769 error ("initializer ends prematurely");
2770 return error_mark_node;
2774 /* Now, default-initialize any remaining elements. We don't need to
2775 do that if a) the type does not need constructing, or b) we've
2776 already initialized all the elements.
2778 We do need to keep going if we're copying an array. */
2781 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_default_init_p)
2782 && ! (host_integerp (maxindex, 0)
2783 && (num_initialized_elts
2784 == tree_low_cst (maxindex, 0) + 1))))
2786 /* If the ITERATOR is equal to -1, then we don't have to loop;
2787 we've already initialized all the elements. */
2792 for_stmt = begin_for_stmt ();
2793 finish_for_init_stmt (for_stmt);
2794 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2795 build_int_cst (TREE_TYPE (iterator), -1)),
2797 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2800 to = build1 (INDIRECT_REF, type, base);
2807 from = build1 (INDIRECT_REF, itype, base2);
2811 if (from_array == 2)
2812 elt_init = build_modify_expr (to, NOP_EXPR, from);
2813 else if (TYPE_NEEDS_CONSTRUCTING (type))
2814 elt_init = build_aggr_init (to, from, 0);
2816 elt_init = build_modify_expr (to, NOP_EXPR, from);
2820 else if (TREE_CODE (type) == ARRAY_TYPE)
2824 ("cannot initialize multi-dimensional array with initializer");
2825 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2827 /*explicit_default_init_p=*/false,
2830 else if (!TYPE_NEEDS_CONSTRUCTING (type))
2831 elt_init = (build_modify_expr
2833 build_zero_init (type, size_one_node,
2834 /*static_storage_p=*/false)));
2836 elt_init = build_aggr_init (to, init, 0);
2838 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2839 finish_expr_stmt (elt_init);
2840 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2842 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2844 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2846 finish_for_stmt (for_stmt);
2849 /* Make sure to cleanup any partially constructed elements. */
2850 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2854 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2856 /* Flatten multi-dimensional array since build_vec_delete only
2857 expects one-dimensional array. */
2858 if (TREE_CODE (type) == ARRAY_TYPE)
2859 m = cp_build_binary_op (MULT_EXPR, m,
2860 array_type_nelts_total (type));
2862 finish_cleanup_try_block (try_block);
2863 e = build_vec_delete_1 (rval, m,
2864 inner_elt_type, sfk_base_destructor,
2865 /*use_global_delete=*/0);
2866 finish_cleanup (e, try_block);
2869 /* The value of the array initialization is the array itself, RVAL
2870 is a pointer to the first element. */
2871 finish_stmt_expr_expr (rval, stmt_expr);
2873 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2875 /* Now convert make the result have the correct type. */
2876 atype = build_pointer_type (atype);
2877 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2878 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2880 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2884 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2888 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2894 case sfk_complete_destructor:
2895 name = complete_dtor_identifier;
2898 case sfk_base_destructor:
2899 name = base_dtor_identifier;
2902 case sfk_deleting_destructor:
2903 name = deleting_dtor_identifier;
2909 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2910 return build_new_method_call (exp, fn,
2912 /*conversion_path=*/NULL_TREE,
2917 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2918 ADDR is an expression which yields the store to be destroyed.
2919 AUTO_DELETE is the name of the destructor to call, i.e., either
2920 sfk_complete_destructor, sfk_base_destructor, or
2921 sfk_deleting_destructor.
2923 FLAGS is the logical disjunction of zero or more LOOKUP_
2924 flags. See cp-tree.h for more info. */
2927 build_delete (tree type, tree addr, special_function_kind auto_delete,
2928 int flags, int use_global_delete)
2932 if (addr == error_mark_node)
2933 return error_mark_node;
2935 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2936 set to `error_mark_node' before it gets properly cleaned up. */
2937 if (type == error_mark_node)
2938 return error_mark_node;
2940 type = TYPE_MAIN_VARIANT (type);
2942 if (TREE_CODE (type) == POINTER_TYPE)
2944 bool complete_p = true;
2946 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2947 if (TREE_CODE (type) == ARRAY_TYPE)
2950 /* We don't want to warn about delete of void*, only other
2951 incomplete types. Deleting other incomplete types
2952 invokes undefined behavior, but it is not ill-formed, so
2953 compile to something that would even do The Right Thing
2954 (TM) should the type have a trivial dtor and no delete
2956 if (!VOID_TYPE_P (type))
2958 complete_type (type);
2959 if (!COMPLETE_TYPE_P (type))
2961 warning (0, "possible problem detected in invocation of "
2962 "delete operator:");
2963 cxx_incomplete_type_diagnostic (addr, type, 1);
2964 inform ("neither the destructor nor the class-specific "
2965 "operator delete will be called, even if they are "
2966 "declared when the class is defined.");
2970 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2971 /* Call the builtin operator delete. */
2972 return build_builtin_delete_call (addr);
2973 if (TREE_SIDE_EFFECTS (addr))
2974 addr = save_expr (addr);
2976 /* Throw away const and volatile on target type of addr. */
2977 addr = convert_force (build_pointer_type (type), addr, 0);
2979 else if (TREE_CODE (type) == ARRAY_TYPE)
2983 if (TYPE_DOMAIN (type) == NULL_TREE)
2985 error ("unknown array size in delete");
2986 return error_mark_node;
2988 return build_vec_delete (addr, array_type_nelts (type),
2989 auto_delete, use_global_delete);
2993 /* Don't check PROTECT here; leave that decision to the
2994 destructor. If the destructor is accessible, call it,
2995 else report error. */
2996 addr = build_unary_op (ADDR_EXPR, addr, 0);
2997 if (TREE_SIDE_EFFECTS (addr))
2998 addr = save_expr (addr);
3000 addr = convert_force (build_pointer_type (type), addr, 0);
3003 gcc_assert (IS_AGGR_TYPE (type));
3005 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3007 if (auto_delete != sfk_deleting_destructor)
3008 return void_zero_node;
3010 return build_op_delete_call (DELETE_EXPR, addr,
3011 cxx_sizeof_nowarn (type),
3013 /*placement=*/NULL_TREE,
3014 /*alloc_fn=*/NULL_TREE);
3018 tree head = NULL_TREE;
3019 tree do_delete = NULL_TREE;
3022 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
3023 lazily_declare_fn (sfk_destructor, type);
3025 /* For `::delete x', we must not use the deleting destructor
3026 since then we would not be sure to get the global `operator
3028 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3030 /* We will use ADDR multiple times so we must save it. */
3031 addr = save_expr (addr);
3032 head = get_target_expr (build_headof (addr));
3033 /* Delete the object. */
3034 do_delete = build_builtin_delete_call (head);
3035 /* Otherwise, treat this like a complete object destructor
3037 auto_delete = sfk_complete_destructor;
3039 /* If the destructor is non-virtual, there is no deleting
3040 variant. Instead, we must explicitly call the appropriate
3041 `operator delete' here. */
3042 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3043 && auto_delete == sfk_deleting_destructor)
3045 /* We will use ADDR multiple times so we must save it. */
3046 addr = save_expr (addr);
3047 /* Build the call. */
3048 do_delete = build_op_delete_call (DELETE_EXPR,
3050 cxx_sizeof_nowarn (type),
3052 /*placement=*/NULL_TREE,
3053 /*alloc_fn=*/NULL_TREE);
3054 /* Call the complete object destructor. */
3055 auto_delete = sfk_complete_destructor;
3057 else if (auto_delete == sfk_deleting_destructor
3058 && TYPE_GETS_REG_DELETE (type))
3060 /* Make sure we have access to the member op delete, even though
3061 we'll actually be calling it from the destructor. */
3062 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3064 /*placement=*/NULL_TREE,
3065 /*alloc_fn=*/NULL_TREE);
3068 expr = build_dtor_call (build_indirect_ref (addr, NULL),
3069 auto_delete, flags);
3071 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
3073 /* We need to calculate this before the dtor changes the vptr. */
3075 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
3077 if (flags & LOOKUP_DESTRUCTOR)
3078 /* Explicit destructor call; don't check for null pointer. */
3079 ifexp = integer_one_node;
3081 /* Handle deleting a null pointer. */
3082 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
3084 if (ifexp != integer_one_node)
3085 expr = build3 (COND_EXPR, void_type_node,
3086 ifexp, expr, void_zero_node);
3092 /* At the beginning of a destructor, push cleanups that will call the
3093 destructors for our base classes and members.
3095 Called from begin_destructor_body. */
3098 push_base_cleanups (void)
3100 tree binfo, base_binfo;
3104 VEC(tree,gc) *vbases;
3106 /* Run destructors for all virtual baseclasses. */
3107 if (CLASSTYPE_VBASECLASSES (current_class_type))
3109 tree cond = (condition_conversion
3110 (build2 (BIT_AND_EXPR, integer_type_node,
3111 current_in_charge_parm,
3112 integer_two_node)));
3114 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3115 order, which is also the right order for pushing cleanups. */
3116 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
3117 VEC_iterate (tree, vbases, i, base_binfo); i++)
3119 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3121 expr = build_special_member_call (current_class_ref,
3122 base_dtor_identifier,
3126 | LOOKUP_NONVIRTUAL));
3127 expr = build3 (COND_EXPR, void_type_node, cond,
3128 expr, void_zero_node);
3129 finish_decl_cleanup (NULL_TREE, expr);
3134 /* Take care of the remaining baseclasses. */
3135 for (binfo = TYPE_BINFO (current_class_type), i = 0;
3136 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
3138 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3139 || BINFO_VIRTUAL_P (base_binfo))
3142 expr = build_special_member_call (current_class_ref,
3143 base_dtor_identifier,
3144 NULL_TREE, base_binfo,
3145 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3146 finish_decl_cleanup (NULL_TREE, expr);
3149 for (member = TYPE_FIELDS (current_class_type); member;
3150 member = TREE_CHAIN (member))
3152 if (TREE_TYPE (member) == error_mark_node
3153 || TREE_CODE (member) != FIELD_DECL
3154 || DECL_ARTIFICIAL (member))
3156 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3158 tree this_member = (build_class_member_access_expr
3159 (current_class_ref, member,
3160 /*access_path=*/NULL_TREE,
3161 /*preserve_reference=*/false));
3162 tree this_type = TREE_TYPE (member);
3163 expr = build_delete (this_type, this_member,
3164 sfk_complete_destructor,
3165 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3167 finish_decl_cleanup (NULL_TREE, expr);
3172 /* Build a C++ vector delete expression.
3173 MAXINDEX is the number of elements to be deleted.
3174 ELT_SIZE is the nominal size of each element in the vector.
3175 BASE is the expression that should yield the store to be deleted.
3176 This function expands (or synthesizes) these calls itself.
3177 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3179 This also calls delete for virtual baseclasses of elements of the vector.
3181 Update: MAXINDEX is no longer needed. The size can be extracted from the
3182 start of the vector for pointers, and from the type for arrays. We still
3183 use MAXINDEX for arrays because it happens to already have one of the
3184 values we'd have to extract. (We could use MAXINDEX with pointers to
3185 confirm the size, and trap if the numbers differ; not clear that it'd
3186 be worth bothering.) */
3189 build_vec_delete (tree base, tree maxindex,
3190 special_function_kind auto_delete_vec, int use_global_delete)
3194 tree base_init = NULL_TREE;
3196 type = TREE_TYPE (base);
3198 if (TREE_CODE (type) == POINTER_TYPE)
3200 /* Step back one from start of vector, and read dimension. */
3203 if (TREE_SIDE_EFFECTS (base))
3205 base_init = get_target_expr (base);
3206 base = TARGET_EXPR_SLOT (base_init);
3208 type = strip_array_types (TREE_TYPE (type));
3209 cookie_addr = fold_build1 (NEGATE_EXPR, sizetype, TYPE_SIZE_UNIT (sizetype));
3210 cookie_addr = build2 (POINTER_PLUS_EXPR,
3211 build_pointer_type (sizetype),
3214 maxindex = build_indirect_ref (cookie_addr, NULL);
3216 else if (TREE_CODE (type) == ARRAY_TYPE)
3218 /* Get the total number of things in the array, maxindex is a
3220 maxindex = array_type_nelts_total (type);
3221 type = strip_array_types (type);
3222 base = build_unary_op (ADDR_EXPR, base, 1);
3223 if (TREE_SIDE_EFFECTS (base))
3225 base_init = get_target_expr (base);
3226 base = TARGET_EXPR_SLOT (base_init);
3231 if (base != error_mark_node)
3232 error ("type to vector delete is neither pointer or array type");
3233 return error_mark_node;
3236 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3239 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);