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-initialization storage for 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 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
319 arguments. If TREE_LIST is void_type_node, an empty initializer
320 list was given; if NULL_TREE no initializer was given. */
323 perform_member_init (tree member, tree init)
326 tree type = TREE_TYPE (member);
329 explicit = (init != NULL_TREE);
331 /* Effective C++ rule 12 requires that all data members be
333 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
334 warning (OPT_Weffc__, "%J%qD should be initialized in the member initialization "
335 "list", current_function_decl, member);
337 if (init == void_type_node)
340 /* Get an lvalue for the data member. */
341 decl = build_class_member_access_expr (current_class_ref, member,
342 /*access_path=*/NULL_TREE,
343 /*preserve_reference=*/true);
344 if (decl == error_mark_node)
347 /* Deal with this here, as we will get confused if we try to call the
348 assignment op for an anonymous union. This can happen in a
349 synthesized copy constructor. */
350 if (ANON_AGGR_TYPE_P (type))
354 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
355 finish_expr_stmt (init);
358 else if (TYPE_NEEDS_CONSTRUCTING (type))
361 && TREE_CODE (type) == ARRAY_TYPE
363 && TREE_CHAIN (init) == NULL_TREE
364 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
366 /* Initialization of one array from another. */
367 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
368 /*explicit_default_init_p=*/false,
372 finish_expr_stmt (build_aggr_init (decl, init, 0));
376 if (init == NULL_TREE)
380 init = build_default_init (type, /*nelts=*/NULL_TREE);
381 if (TREE_CODE (type) == REFERENCE_TYPE)
382 warning (0, "%Jdefault-initialization of %q#D, "
383 "which has reference type",
384 current_function_decl, member);
386 /* member traversal: note it leaves init NULL */
387 else if (TREE_CODE (type) == REFERENCE_TYPE)
388 pedwarn ("%Juninitialized reference member %qD",
389 current_function_decl, member);
390 else if (CP_TYPE_CONST_P (type))
391 pedwarn ("%Juninitialized member %qD with %<const%> type %qT",
392 current_function_decl, member, type);
394 else if (TREE_CODE (init) == TREE_LIST)
395 /* There was an explicit member initialization. Do some work
397 init = build_x_compound_expr_from_list (init, "member initializer");
400 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
403 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
407 expr = build_class_member_access_expr (current_class_ref, member,
408 /*access_path=*/NULL_TREE,
409 /*preserve_reference=*/false);
410 expr = build_delete (type, expr, sfk_complete_destructor,
411 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
413 if (expr != error_mark_node)
414 finish_eh_cleanup (expr);
418 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
419 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
422 build_field_list (tree t, tree list, int *uses_unions_p)
428 /* Note whether or not T is a union. */
429 if (TREE_CODE (t) == UNION_TYPE)
432 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
434 /* Skip CONST_DECLs for enumeration constants and so forth. */
435 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
438 /* Keep track of whether or not any fields are unions. */
439 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
442 /* For an anonymous struct or union, we must recursively
443 consider the fields of the anonymous type. They can be
444 directly initialized from the constructor. */
445 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
447 /* Add this field itself. Synthesized copy constructors
448 initialize the entire aggregate. */
449 list = tree_cons (fields, NULL_TREE, list);
450 /* And now add the fields in the anonymous aggregate. */
451 list = build_field_list (TREE_TYPE (fields), list,
454 /* Add this field. */
455 else if (DECL_NAME (fields))
456 list = tree_cons (fields, NULL_TREE, list);
462 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
463 a FIELD_DECL or BINFO in T that needs initialization. The
464 TREE_VALUE gives the initializer, or list of initializer arguments.
466 Return a TREE_LIST containing all of the initializations required
467 for T, in the order in which they should be performed. The output
468 list has the same format as the input. */
471 sort_mem_initializers (tree t, tree mem_inits)
474 tree base, binfo, base_binfo;
477 VEC(tree,gc) *vbases;
481 /* Build up a list of initializations. The TREE_PURPOSE of entry
482 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
483 TREE_VALUE will be the constructor arguments, or NULL if no
484 explicit initialization was provided. */
485 sorted_inits = NULL_TREE;
487 /* Process the virtual bases. */
488 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
489 VEC_iterate (tree, vbases, i, base); i++)
490 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
492 /* Process the direct bases. */
493 for (binfo = TYPE_BINFO (t), i = 0;
494 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
495 if (!BINFO_VIRTUAL_P (base_binfo))
496 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
498 /* Process the non-static data members. */
499 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
500 /* Reverse the entire list of initializations, so that they are in
501 the order that they will actually be performed. */
502 sorted_inits = nreverse (sorted_inits);
504 /* If the user presented the initializers in an order different from
505 that in which they will actually occur, we issue a warning. Keep
506 track of the next subobject which can be explicitly initialized
507 without issuing a warning. */
508 next_subobject = sorted_inits;
510 /* Go through the explicit initializers, filling in TREE_PURPOSE in
512 for (init = mem_inits; init; init = TREE_CHAIN (init))
517 subobject = TREE_PURPOSE (init);
519 /* If the explicit initializers are in sorted order, then
520 SUBOBJECT will be NEXT_SUBOBJECT, or something following
522 for (subobject_init = next_subobject;
524 subobject_init = TREE_CHAIN (subobject_init))
525 if (TREE_PURPOSE (subobject_init) == subobject)
528 /* Issue a warning if the explicit initializer order does not
529 match that which will actually occur.
530 ??? Are all these on the correct lines? */
531 if (warn_reorder && !subobject_init)
533 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
534 warning (OPT_Wreorder, "%q+D will be initialized after",
535 TREE_PURPOSE (next_subobject));
537 warning (OPT_Wreorder, "base %qT will be initialized after",
538 TREE_PURPOSE (next_subobject));
539 if (TREE_CODE (subobject) == FIELD_DECL)
540 warning (OPT_Wreorder, " %q+#D", subobject);
542 warning (OPT_Wreorder, " base %qT", subobject);
543 warning (OPT_Wreorder, "%J when initialized here", current_function_decl);
546 /* Look again, from the beginning of the list. */
549 subobject_init = sorted_inits;
550 while (TREE_PURPOSE (subobject_init) != subobject)
551 subobject_init = TREE_CHAIN (subobject_init);
554 /* It is invalid to initialize the same subobject more than
556 if (TREE_VALUE (subobject_init))
558 if (TREE_CODE (subobject) == FIELD_DECL)
559 error ("%Jmultiple initializations given for %qD",
560 current_function_decl, subobject);
562 error ("%Jmultiple initializations given for base %qT",
563 current_function_decl, subobject);
566 /* Record the initialization. */
567 TREE_VALUE (subobject_init) = TREE_VALUE (init);
568 next_subobject = subobject_init;
573 If a ctor-initializer specifies more than one mem-initializer for
574 multiple members of the same union (including members of
575 anonymous unions), the ctor-initializer is ill-formed. */
578 tree last_field = NULL_TREE;
579 for (init = sorted_inits; init; init = TREE_CHAIN (init))
585 /* Skip uninitialized members and base classes. */
586 if (!TREE_VALUE (init)
587 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
589 /* See if this field is a member of a union, or a member of a
590 structure contained in a union, etc. */
591 field = TREE_PURPOSE (init);
592 for (field_type = DECL_CONTEXT (field);
593 !same_type_p (field_type, t);
594 field_type = TYPE_CONTEXT (field_type))
595 if (TREE_CODE (field_type) == UNION_TYPE)
597 /* If this field is not a member of a union, skip it. */
598 if (TREE_CODE (field_type) != UNION_TYPE)
601 /* It's only an error if we have two initializers for the same
609 /* See if LAST_FIELD and the field initialized by INIT are
610 members of the same union. If so, there's a problem,
611 unless they're actually members of the same structure
612 which is itself a member of a union. For example, given:
614 union { struct { int i; int j; }; };
616 initializing both `i' and `j' makes sense. */
617 field_type = DECL_CONTEXT (field);
621 tree last_field_type;
623 last_field_type = DECL_CONTEXT (last_field);
626 if (same_type_p (last_field_type, field_type))
628 if (TREE_CODE (field_type) == UNION_TYPE)
629 error ("%Jinitializations for multiple members of %qT",
630 current_function_decl, last_field_type);
635 if (same_type_p (last_field_type, t))
638 last_field_type = TYPE_CONTEXT (last_field_type);
641 /* If we've reached the outermost class, then we're
643 if (same_type_p (field_type, t))
646 field_type = TYPE_CONTEXT (field_type);
657 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
658 is a TREE_LIST giving the explicit mem-initializer-list for the
659 constructor. The TREE_PURPOSE of each entry is a subobject (a
660 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
661 is a TREE_LIST giving the arguments to the constructor or
662 void_type_node for an empty list of arguments. */
665 emit_mem_initializers (tree mem_inits)
667 /* We will already have issued an error message about the fact that
668 the type is incomplete. */
669 if (!COMPLETE_TYPE_P (current_class_type))
672 /* Sort the mem-initializers into the order in which the
673 initializations should be performed. */
674 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
676 in_base_initializer = 1;
678 /* Initialize base classes. */
680 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
682 tree subobject = TREE_PURPOSE (mem_inits);
683 tree arguments = TREE_VALUE (mem_inits);
685 /* If these initializations are taking place in a copy
686 constructor, the base class should probably be explicitly
688 if (extra_warnings && !arguments
689 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
690 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
691 warning (OPT_Wextra, "%Jbase class %q#T should be explicitly initialized in the "
693 current_function_decl, BINFO_TYPE (subobject));
695 /* If an explicit -- but empty -- initializer list was present,
696 treat it just like default initialization at this point. */
697 if (arguments == void_type_node)
698 arguments = NULL_TREE;
700 /* Initialize the base. */
701 if (BINFO_VIRTUAL_P (subobject))
702 construct_virtual_base (subobject, arguments);
707 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
709 expand_aggr_init_1 (subobject, NULL_TREE,
710 build_indirect_ref (base_addr, NULL),
713 expand_cleanup_for_base (subobject, NULL_TREE);
716 mem_inits = TREE_CHAIN (mem_inits);
718 in_base_initializer = 0;
720 /* Initialize the vptrs. */
721 initialize_vtbl_ptrs (current_class_ptr);
723 /* Initialize the data members. */
726 perform_member_init (TREE_PURPOSE (mem_inits),
727 TREE_VALUE (mem_inits));
728 mem_inits = TREE_CHAIN (mem_inits);
732 /* Returns the address of the vtable (i.e., the value that should be
733 assigned to the vptr) for BINFO. */
736 build_vtbl_address (tree binfo)
738 tree binfo_for = binfo;
741 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
742 /* If this is a virtual primary base, then the vtable we want to store
743 is that for the base this is being used as the primary base of. We
744 can't simply skip the initialization, because we may be expanding the
745 inits of a subobject constructor where the virtual base layout
747 while (BINFO_PRIMARY_P (binfo_for))
748 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
750 /* Figure out what vtable BINFO's vtable is based on, and mark it as
752 vtbl = get_vtbl_decl_for_binfo (binfo_for);
753 assemble_external (vtbl);
754 TREE_USED (vtbl) = 1;
756 /* Now compute the address to use when initializing the vptr. */
757 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
758 if (TREE_CODE (vtbl) == VAR_DECL)
759 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
764 /* This code sets up the virtual function tables appropriate for
765 the pointer DECL. It is a one-ply initialization.
767 BINFO is the exact type that DECL is supposed to be. In
768 multiple inheritance, this might mean "C's A" if C : A, B. */
771 expand_virtual_init (tree binfo, tree decl)
776 /* Compute the initializer for vptr. */
777 vtbl = build_vtbl_address (binfo);
779 /* We may get this vptr from a VTT, if this is a subobject
780 constructor or subobject destructor. */
781 vtt_index = BINFO_VPTR_INDEX (binfo);
787 /* Compute the value to use, when there's a VTT. */
788 vtt_parm = current_vtt_parm;
789 vtbl2 = build2 (POINTER_PLUS_EXPR,
790 TREE_TYPE (vtt_parm),
793 vtbl2 = build_indirect_ref (vtbl2, NULL);
794 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
796 /* The actual initializer is the VTT value only in the subobject
797 constructor. In maybe_clone_body we'll substitute NULL for
798 the vtt_parm in the case of the non-subobject constructor. */
799 vtbl = build3 (COND_EXPR,
801 build2 (EQ_EXPR, boolean_type_node,
802 current_in_charge_parm, integer_zero_node),
807 /* Compute the location of the vtpr. */
808 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
810 gcc_assert (vtbl_ptr != error_mark_node);
812 /* Assign the vtable to the vptr. */
813 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
814 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
817 /* If an exception is thrown in a constructor, those base classes already
818 constructed must be destroyed. This function creates the cleanup
819 for BINFO, which has just been constructed. If FLAG is non-NULL,
820 it is a DECL which is nonzero when this base needs to be
824 expand_cleanup_for_base (tree binfo, tree flag)
828 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
831 /* Call the destructor. */
832 expr = build_special_member_call (current_class_ref,
833 base_dtor_identifier,
836 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
838 expr = fold_build3 (COND_EXPR, void_type_node,
839 c_common_truthvalue_conversion (flag),
840 expr, integer_zero_node);
842 finish_eh_cleanup (expr);
845 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
849 construct_virtual_base (tree vbase, tree arguments)
855 /* If there are virtual base classes with destructors, we need to
856 emit cleanups to destroy them if an exception is thrown during
857 the construction process. These exception regions (i.e., the
858 period during which the cleanups must occur) begin from the time
859 the construction is complete to the end of the function. If we
860 create a conditional block in which to initialize the
861 base-classes, then the cleanup region for the virtual base begins
862 inside a block, and ends outside of that block. This situation
863 confuses the sjlj exception-handling code. Therefore, we do not
864 create a single conditional block, but one for each
865 initialization. (That way the cleanup regions always begin
866 in the outer block.) We trust the back end to figure out
867 that the FLAG will not change across initializations, and
868 avoid doing multiple tests. */
869 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
870 inner_if_stmt = begin_if_stmt ();
871 finish_if_stmt_cond (flag, inner_if_stmt);
873 /* Compute the location of the virtual base. If we're
874 constructing virtual bases, then we must be the most derived
875 class. Therefore, we don't have to look up the virtual base;
876 we already know where it is. */
877 exp = convert_to_base_statically (current_class_ref, vbase);
879 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
881 finish_then_clause (inner_if_stmt);
882 finish_if_stmt (inner_if_stmt);
884 expand_cleanup_for_base (vbase, flag);
887 /* Find the context in which this FIELD can be initialized. */
890 initializing_context (tree field)
892 tree t = DECL_CONTEXT (field);
894 /* Anonymous union members can be initialized in the first enclosing
895 non-anonymous union context. */
896 while (t && ANON_AGGR_TYPE_P (t))
897 t = TYPE_CONTEXT (t);
901 /* Function to give error message if member initialization specification
902 is erroneous. FIELD is the member we decided to initialize.
903 TYPE is the type for which the initialization is being performed.
904 FIELD must be a member of TYPE.
906 MEMBER_NAME is the name of the member. */
909 member_init_ok_or_else (tree field, tree type, tree member_name)
911 if (field == error_mark_node)
915 error ("class %qT does not have any field named %qD", type,
919 if (TREE_CODE (field) == VAR_DECL)
921 error ("%q#D is a static data member; it can only be "
922 "initialized at its definition",
926 if (TREE_CODE (field) != FIELD_DECL)
928 error ("%q#D is not a non-static data member of %qT",
932 if (initializing_context (field) != type)
934 error ("class %qT does not have any field named %qD", type,
942 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
943 is a _TYPE node or TYPE_DECL which names a base for that type.
944 Check the validity of NAME, and return either the base _TYPE, base
945 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
946 NULL_TREE and issue a diagnostic.
948 An old style unnamed direct single base construction is permitted,
949 where NAME is NULL. */
952 expand_member_init (tree name)
957 if (!current_class_ref)
962 /* This is an obsolete unnamed base class initializer. The
963 parser will already have warned about its use. */
964 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
967 error ("unnamed initializer for %qT, which has no base classes",
971 basetype = BINFO_TYPE
972 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
975 error ("unnamed initializer for %qT, which uses multiple inheritance",
980 else if (TYPE_P (name))
982 basetype = TYPE_MAIN_VARIANT (name);
983 name = TYPE_NAME (name);
985 else if (TREE_CODE (name) == TYPE_DECL)
986 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
988 basetype = NULL_TREE;
997 if (current_template_parms)
1000 class_binfo = TYPE_BINFO (current_class_type);
1001 direct_binfo = NULL_TREE;
1002 virtual_binfo = NULL_TREE;
1004 /* Look for a direct base. */
1005 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
1006 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1009 /* Look for a virtual base -- unless the direct base is itself
1011 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1012 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1014 /* [class.base.init]
1016 If a mem-initializer-id is ambiguous because it designates
1017 both a direct non-virtual base class and an inherited virtual
1018 base class, the mem-initializer is ill-formed. */
1019 if (direct_binfo && virtual_binfo)
1021 error ("%qD is both a direct base and an indirect virtual base",
1026 if (!direct_binfo && !virtual_binfo)
1028 if (CLASSTYPE_VBASECLASSES (current_class_type))
1029 error ("type %qT is not a direct or virtual base of %qT",
1030 basetype, current_class_type);
1032 error ("type %qT is not a direct base of %qT",
1033 basetype, current_class_type);
1037 return direct_binfo ? direct_binfo : virtual_binfo;
1041 if (TREE_CODE (name) == IDENTIFIER_NODE)
1042 field = lookup_field (current_class_type, name, 1, false);
1046 if (member_init_ok_or_else (field, current_class_type, name))
1053 /* This is like `expand_member_init', only it stores one aggregate
1056 INIT comes in two flavors: it is either a value which
1057 is to be stored in EXP, or it is a parameter list
1058 to go to a constructor, which will operate on EXP.
1059 If INIT is not a parameter list for a constructor, then set
1060 LOOKUP_ONLYCONVERTING.
1061 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1062 the initializer, if FLAGS is 0, then it is the (init) form.
1063 If `init' is a CONSTRUCTOR, then we emit a warning message,
1064 explaining that such initializations are invalid.
1066 If INIT resolves to a CALL_EXPR which happens to return
1067 something of the type we are looking for, then we know
1068 that we can safely use that call to perform the
1071 The virtual function table pointer cannot be set up here, because
1072 we do not really know its type.
1074 This never calls operator=().
1076 When initializing, nothing is CONST.
1078 A default copy constructor may have to be used to perform the
1081 A constructor or a conversion operator may have to be used to
1082 perform the initialization, but not both, as it would be ambiguous. */
1085 build_aggr_init (tree exp, tree init, int flags)
1090 tree type = TREE_TYPE (exp);
1091 int was_const = TREE_READONLY (exp);
1092 int was_volatile = TREE_THIS_VOLATILE (exp);
1095 if (init == error_mark_node)
1096 return error_mark_node;
1098 TREE_READONLY (exp) = 0;
1099 TREE_THIS_VOLATILE (exp) = 0;
1101 if (init && TREE_CODE (init) != TREE_LIST)
1102 flags |= LOOKUP_ONLYCONVERTING;
1104 if (TREE_CODE (type) == ARRAY_TYPE)
1108 /* An array may not be initialized use the parenthesized
1109 initialization form -- unless the initializer is "()". */
1110 if (init && TREE_CODE (init) == TREE_LIST)
1112 error ("bad array initializer");
1113 return error_mark_node;
1115 /* Must arrange to initialize each element of EXP
1116 from elements of INIT. */
1117 itype = init ? TREE_TYPE (init) : NULL_TREE;
1118 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1119 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1120 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1121 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1122 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1123 /*explicit_default_init_p=*/false,
1124 itype && same_type_p (itype,
1126 TREE_READONLY (exp) = was_const;
1127 TREE_THIS_VOLATILE (exp) = was_volatile;
1128 TREE_TYPE (exp) = type;
1130 TREE_TYPE (init) = itype;
1134 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1135 /* Just know that we've seen something for this node. */
1136 TREE_USED (exp) = 1;
1138 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1139 destroy_temps = stmts_are_full_exprs_p ();
1140 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1141 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1142 init, LOOKUP_NORMAL|flags);
1143 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1144 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1145 TREE_READONLY (exp) = was_const;
1146 TREE_THIS_VOLATILE (exp) = was_volatile;
1152 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1154 tree type = TREE_TYPE (exp);
1157 /* It fails because there may not be a constructor which takes
1158 its own type as the first (or only parameter), but which does
1159 take other types via a conversion. So, if the thing initializing
1160 the expression is a unit element of type X, first try X(X&),
1161 followed by initialization by X. If neither of these work
1162 out, then look hard. */
1166 if (init && TREE_CODE (init) != TREE_LIST
1167 && (flags & LOOKUP_ONLYCONVERTING))
1169 /* Base subobjects should only get direct-initialization. */
1170 gcc_assert (true_exp == exp);
1172 if (flags & DIRECT_BIND)
1173 /* Do nothing. We hit this in two cases: Reference initialization,
1174 where we aren't initializing a real variable, so we don't want
1175 to run a new constructor; and catching an exception, where we
1176 have already built up the constructor call so we could wrap it
1177 in an exception region. */;
1178 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1180 /* A brace-enclosed initializer for an aggregate. */
1181 gcc_assert (CP_AGGREGATE_TYPE_P (type));
1182 init = digest_init (type, init);
1185 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1187 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1188 /* We need to protect the initialization of a catch parm with a
1189 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1190 around the TARGET_EXPR for the copy constructor. See
1191 initialize_handler_parm. */
1193 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1194 TREE_OPERAND (init, 0));
1195 TREE_TYPE (init) = void_type_node;
1198 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1199 TREE_SIDE_EFFECTS (init) = 1;
1200 finish_expr_stmt (init);
1204 if (init == NULL_TREE
1205 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1209 init = TREE_VALUE (parms);
1212 parms = build_tree_list (NULL_TREE, init);
1214 if (true_exp == exp)
1215 ctor_name = complete_ctor_identifier;
1217 ctor_name = base_ctor_identifier;
1219 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1220 if (TREE_SIDE_EFFECTS (rval))
1221 finish_expr_stmt (convert_to_void (rval, NULL));
1224 /* This function is responsible for initializing EXP with INIT
1227 BINFO is the binfo of the type for who we are performing the
1228 initialization. For example, if W is a virtual base class of A and B,
1230 If we are initializing B, then W must contain B's W vtable, whereas
1231 were we initializing C, W must contain C's W vtable.
1233 TRUE_EXP is nonzero if it is the true expression being initialized.
1234 In this case, it may be EXP, or may just contain EXP. The reason we
1235 need this is because if EXP is a base element of TRUE_EXP, we
1236 don't necessarily know by looking at EXP where its virtual
1237 baseclass fields should really be pointing. But we do know
1238 from TRUE_EXP. In constructors, we don't know anything about
1239 the value being initialized.
1241 FLAGS is just passed to `build_new_method_call'. See that function
1242 for its description. */
1245 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1247 tree type = TREE_TYPE (exp);
1249 gcc_assert (init != error_mark_node && type != error_mark_node);
1250 gcc_assert (building_stmt_tree ());
1252 /* Use a function returning the desired type to initialize EXP for us.
1253 If the function is a constructor, and its first argument is
1254 NULL_TREE, know that it was meant for us--just slide exp on
1255 in and expand the constructor. Constructors now come
1258 if (init && TREE_CODE (exp) == VAR_DECL
1259 && COMPOUND_LITERAL_P (init))
1261 /* If store_init_value returns NULL_TREE, the INIT has been
1262 recorded as the DECL_INITIAL for EXP. That means there's
1263 nothing more we have to do. */
1264 init = store_init_value (exp, init);
1266 finish_expr_stmt (init);
1270 /* We know that expand_default_init can handle everything we want
1272 expand_default_init (binfo, true_exp, exp, init, flags);
1275 /* Report an error if TYPE is not a user-defined, aggregate type. If
1276 OR_ELSE is nonzero, give an error message. */
1279 is_aggr_type (tree type, int or_else)
1281 if (type == error_mark_node)
1284 if (! IS_AGGR_TYPE (type))
1287 error ("%qT is not an aggregate type", type);
1294 get_type_value (tree name)
1296 if (name == error_mark_node)
1299 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1300 return IDENTIFIER_TYPE_VALUE (name);
1305 /* Build a reference to a member of an aggregate. This is not a C++
1306 `&', but really something which can have its address taken, and
1307 then act as a pointer to member, for example TYPE :: FIELD can have
1308 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1309 this expression is the operand of "&".
1311 @@ Prints out lousy diagnostics for operator <typename>
1314 @@ This function should be rewritten and placed in search.c. */
1317 build_offset_ref (tree type, tree member, bool address_p)
1320 tree basebinfo = NULL_TREE;
1322 /* class templates can come in as TEMPLATE_DECLs here. */
1323 if (TREE_CODE (member) == TEMPLATE_DECL)
1326 if (dependent_type_p (type) || type_dependent_expression_p (member))
1327 return build_qualified_name (NULL_TREE, type, member,
1328 /*template_p=*/false);
1330 gcc_assert (TYPE_P (type));
1331 if (! is_aggr_type (type, 1))
1332 return error_mark_node;
1334 gcc_assert (DECL_P (member) || BASELINK_P (member));
1335 /* Callers should call mark_used before this point. */
1336 gcc_assert (!DECL_P (member) || TREE_USED (member));
1338 if (!COMPLETE_TYPE_P (complete_type (type))
1339 && !TYPE_BEING_DEFINED (type))
1341 error ("incomplete type %qT does not have member %qD", type, member);
1342 return error_mark_node;
1345 /* Entities other than non-static members need no further
1347 if (TREE_CODE (member) == TYPE_DECL)
1349 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1350 return convert_from_reference (member);
1352 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1354 error ("invalid pointer to bit-field %qD", member);
1355 return error_mark_node;
1358 /* Set up BASEBINFO for member lookup. */
1359 decl = maybe_dummy_object (type, &basebinfo);
1361 /* A lot of this logic is now handled in lookup_member. */
1362 if (BASELINK_P (member))
1364 /* Go from the TREE_BASELINK to the member function info. */
1365 tree t = BASELINK_FUNCTIONS (member);
1367 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1369 /* Get rid of a potential OVERLOAD around it. */
1370 t = OVL_CURRENT (t);
1372 /* Unique functions are handled easily. */
1374 /* For non-static member of base class, we need a special rule
1375 for access checking [class.protected]:
1377 If the access is to form a pointer to member, the
1378 nested-name-specifier shall name the derived class
1379 (or any class derived from that class). */
1380 if (address_p && DECL_P (t)
1381 && DECL_NONSTATIC_MEMBER_P (t))
1382 perform_or_defer_access_check (TYPE_BINFO (type), t, t);
1384 perform_or_defer_access_check (basebinfo, t, t);
1386 if (DECL_STATIC_FUNCTION_P (t))
1391 TREE_TYPE (member) = unknown_type_node;
1393 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1394 /* We need additional test besides the one in
1395 check_accessibility_of_qualified_id in case it is
1396 a pointer to non-static member. */
1397 perform_or_defer_access_check (TYPE_BINFO (type), member, member);
1401 /* If MEMBER is non-static, then the program has fallen afoul of
1404 An id-expression that denotes a nonstatic data member or
1405 nonstatic member function of a class can only be used:
1407 -- as part of a class member access (_expr.ref_) in which the
1408 object-expression refers to the member's class or a class
1409 derived from that class, or
1411 -- to form a pointer to member (_expr.unary.op_), or
1413 -- in the body of a nonstatic member function of that class or
1414 of a class derived from that class (_class.mfct.nonstatic_), or
1416 -- in a mem-initializer for a constructor for that class or for
1417 a class derived from that class (_class.base.init_). */
1418 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1420 /* Build a representation of a the qualified name suitable
1421 for use as the operand to "&" -- even though the "&" is
1422 not actually present. */
1423 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1424 /* In Microsoft mode, treat a non-static member function as if
1425 it were a pointer-to-member. */
1426 if (flag_ms_extensions)
1428 PTRMEM_OK_P (member) = 1;
1429 return build_unary_op (ADDR_EXPR, member, 0);
1431 error ("invalid use of non-static member function %qD",
1432 TREE_OPERAND (member, 1));
1433 return error_mark_node;
1435 else if (TREE_CODE (member) == FIELD_DECL)
1437 error ("invalid use of non-static data member %qD", member);
1438 return error_mark_node;
1443 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1444 PTRMEM_OK_P (member) = 1;
1448 /* If DECL is a scalar enumeration constant or variable with a
1449 constant initializer, return the initializer (or, its initializers,
1450 recursively); otherwise, return DECL. If INTEGRAL_P, the
1451 initializer is only returned if DECL is an integral
1452 constant-expression. */
1455 constant_value_1 (tree decl, bool integral_p)
1457 while (TREE_CODE (decl) == CONST_DECL
1459 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1460 : (TREE_CODE (decl) == VAR_DECL
1461 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1464 /* Static data members in template classes may have
1465 non-dependent initializers. References to such non-static
1466 data members are not value-dependent, so we must retrieve the
1467 initializer here. The DECL_INITIAL will have the right type,
1468 but will not have been folded because that would prevent us
1469 from performing all appropriate semantic checks at
1470 instantiation time. */
1471 if (DECL_CLASS_SCOPE_P (decl)
1472 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1473 && uses_template_parms (CLASSTYPE_TI_ARGS
1474 (DECL_CONTEXT (decl))))
1476 ++processing_template_decl;
1477 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1478 --processing_template_decl;
1482 /* If DECL is a static data member in a template
1483 specialization, we must instantiate it here. The
1484 initializer for the static data member is not processed
1485 until needed; we need it now. */
1487 init = DECL_INITIAL (decl);
1489 if (init == error_mark_node)
1492 || !TREE_TYPE (init)
1494 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1495 : (!TREE_CONSTANT (init)
1496 /* Do not return an aggregate constant (of which
1497 string literals are a special case), as we do not
1498 want to make inadvertent copies of such entities,
1499 and we must be sure that their addresses are the
1501 || TREE_CODE (init) == CONSTRUCTOR
1502 || TREE_CODE (init) == STRING_CST)))
1504 decl = unshare_expr (init);
1509 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1510 constant of integral or enumeration type, then return that value.
1511 These are those variables permitted in constant expressions by
1515 integral_constant_value (tree decl)
1517 return constant_value_1 (decl, /*integral_p=*/true);
1520 /* A more relaxed version of integral_constant_value, used by the
1521 common C/C++ code and by the C++ front end for optimization
1525 decl_constant_value (tree decl)
1527 return constant_value_1 (decl,
1528 /*integral_p=*/processing_template_decl);
1531 /* Common subroutines of build_new and build_vec_delete. */
1533 /* Call the global __builtin_delete to delete ADDR. */
1536 build_builtin_delete_call (tree addr)
1538 mark_used (global_delete_fndecl);
1539 return build_call_n (global_delete_fndecl, 1, addr);
1542 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1543 the type of the object being allocated; otherwise, it's just TYPE.
1544 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1545 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1546 the TREE_LIST of arguments to be provided as arguments to a
1547 placement new operator. This routine performs no semantic checks;
1548 it just creates and returns a NEW_EXPR. */
1551 build_raw_new_expr (tree placement, tree type, tree nelts, tree init,
1556 new_expr = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1558 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1559 TREE_SIDE_EFFECTS (new_expr) = 1;
1564 /* Make sure that there are no aliasing issues with T, a placement new
1565 expression applied to PLACEMENT, by recording the change in dynamic
1566 type. If placement new is inlined, as it is with libstdc++, and if
1567 the type of the placement new differs from the type of the
1568 placement location itself, then alias analysis may think it is OK
1569 to interchange writes to the location from before the placement new
1570 and from after the placement new. We have to prevent type-based
1571 alias analysis from applying. PLACEMENT may be NULL, which means
1572 that we couldn't capture it in a temporary variable, in which case
1573 we use a memory clobber. */
1576 avoid_placement_new_aliasing (tree t, tree placement)
1580 if (processing_template_decl)
1583 /* If we are not using type based aliasing, we don't have to do
1585 if (!flag_strict_aliasing)
1588 /* If we have a pointer and a location, record the change in dynamic
1589 type. Otherwise we need a general memory clobber. */
1590 if (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE
1591 && placement != NULL_TREE
1592 && TREE_CODE (TREE_TYPE (placement)) == POINTER_TYPE)
1593 type_change = build_stmt (CHANGE_DYNAMIC_TYPE_EXPR,
1598 /* Build a memory clobber. */
1599 type_change = build_stmt (ASM_EXPR,
1600 build_string (0, ""),
1603 tree_cons (NULL_TREE,
1604 build_string (6, "memory"),
1607 ASM_VOLATILE_P (type_change) = 1;
1610 return build2 (COMPOUND_EXPR, TREE_TYPE (t), type_change, t);
1613 /* Generate code for a new-expression, including calling the "operator
1614 new" function, initializing the object, and, if an exception occurs
1615 during construction, cleaning up. The arguments are as for
1616 build_raw_new_expr. */
1619 build_new_1 (tree placement, tree type, tree nelts, tree init,
1620 bool globally_qualified_p)
1623 /* True iff this is a call to "operator new[]" instead of just
1625 bool array_p = false;
1626 /* True iff ARRAY_P is true and the bound of the array type is
1627 not necessarily a compile time constant. For example, VLA_P is
1628 true for "new int[f()]". */
1630 /* The type being allocated. If ARRAY_P is true, this will be an
1633 /* If ARRAY_P is true, the element type of the array. This is an
1634 never ARRAY_TYPE; for something like "new int[3][4]", the
1635 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1638 /* The type of the new-expression. (This type is always a pointer
1641 /* A pointer type pointing to the FULL_TYPE. */
1642 tree full_pointer_type;
1643 tree outer_nelts = NULL_TREE;
1644 tree alloc_call, alloc_expr;
1645 /* The address returned by the call to "operator new". This node is
1646 a VAR_DECL and is therefore reusable. */
1649 tree cookie_expr, init_expr;
1650 int nothrow, check_new;
1651 int use_java_new = 0;
1652 /* If non-NULL, the number of extra bytes to allocate at the
1653 beginning of the storage allocated for an array-new expression in
1654 order to store the number of elements. */
1655 tree cookie_size = NULL_TREE;
1656 tree placement_expr;
1657 /* True if the function we are calling is a placement allocation
1659 bool placement_allocation_fn_p;
1660 tree args = NULL_TREE;
1661 /* True if the storage must be initialized, either by a constructor
1662 or due to an explicit new-initializer. */
1663 bool is_initialized;
1664 /* The address of the thing allocated, not including any cookie. In
1665 particular, if an array cookie is in use, DATA_ADDR is the
1666 address of the first array element. This node is a VAR_DECL, and
1667 is therefore reusable. */
1669 tree init_preeval_expr = NULL_TREE;
1675 outer_nelts = nelts;
1678 /* ??? The middle-end will error on us for building a VLA outside a
1679 function context. Methinks that's not it's purvey. So we'll do
1680 our own VLA layout later. */
1682 index = convert (sizetype, nelts);
1683 index = size_binop (MINUS_EXPR, index, size_one_node);
1684 index = build_index_type (index);
1685 full_type = build_cplus_array_type (type, NULL_TREE);
1686 /* We need a copy of the type as build_array_type will return a shared copy
1687 of the incomplete array type. */
1688 full_type = build_distinct_type_copy (full_type);
1689 TYPE_DOMAIN (full_type) = index;
1690 SET_TYPE_STRUCTURAL_EQUALITY (full_type);
1695 if (TREE_CODE (type) == ARRAY_TYPE)
1698 nelts = array_type_nelts_top (type);
1699 outer_nelts = nelts;
1700 type = TREE_TYPE (type);
1704 /* If our base type is an array, then make sure we know how many elements
1706 for (elt_type = type;
1707 TREE_CODE (elt_type) == ARRAY_TYPE;
1708 elt_type = TREE_TYPE (elt_type))
1709 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1710 array_type_nelts_top (elt_type));
1712 if (TREE_CODE (elt_type) == VOID_TYPE)
1714 error ("invalid type %<void%> for new");
1715 return error_mark_node;
1718 if (abstract_virtuals_error (NULL_TREE, elt_type))
1719 return error_mark_node;
1721 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1722 if (CP_TYPE_CONST_P (elt_type) && !is_initialized)
1724 error ("uninitialized const in %<new%> of %q#T", elt_type);
1725 return error_mark_node;
1728 size = size_in_bytes (elt_type);
1731 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1736 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1737 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1738 ...>> to be valid. */
1739 TYPE_SIZE_UNIT (full_type) = size;
1740 n = convert (bitsizetype, nelts);
1741 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1742 TYPE_SIZE (full_type) = bitsize;
1746 alloc_fn = NULL_TREE;
1748 /* If PLACEMENT is a simple pointer type, then copy it into
1750 if (processing_template_decl
1751 || placement == NULL_TREE
1752 || TREE_CHAIN (placement) != NULL_TREE
1753 || TREE_CODE (TREE_TYPE (TREE_VALUE (placement))) != POINTER_TYPE)
1754 placement_expr = NULL_TREE;
1757 placement_expr = get_target_expr (TREE_VALUE (placement));
1758 placement = tree_cons (NULL_TREE, placement_expr, NULL_TREE);
1761 /* Allocate the object. */
1762 if (! placement && TYPE_FOR_JAVA (elt_type))
1765 tree class_decl = build_java_class_ref (elt_type);
1766 static const char alloc_name[] = "_Jv_AllocObject";
1768 if (class_decl == error_mark_node)
1769 return error_mark_node;
1772 if (!get_global_value_if_present (get_identifier (alloc_name),
1775 error ("call to Java constructor with %qs undefined", alloc_name);
1776 return error_mark_node;
1778 else if (really_overloaded_fn (alloc_fn))
1780 error ("%qD should never be overloaded", alloc_fn);
1781 return error_mark_node;
1783 alloc_fn = OVL_CURRENT (alloc_fn);
1784 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1785 alloc_call = (build_function_call
1787 build_tree_list (NULL_TREE, class_addr)));
1789 else if (TYPE_FOR_JAVA (elt_type) && IS_AGGR_TYPE (elt_type))
1791 error ("Java class %q#T object allocated using placement new", elt_type);
1792 return error_mark_node;
1799 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1801 if (!globally_qualified_p
1802 && CLASS_TYPE_P (elt_type)
1804 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1805 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1807 /* Use a class-specific operator new. */
1808 /* If a cookie is required, add some extra space. */
1809 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1811 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1812 size = size_binop (PLUS_EXPR, size, cookie_size);
1814 /* Create the argument list. */
1815 args = tree_cons (NULL_TREE, size, placement);
1816 /* Do name-lookup to find the appropriate operator. */
1817 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1818 if (fns == NULL_TREE)
1820 error ("no suitable %qD found in class %qT", fnname, elt_type);
1821 return error_mark_node;
1823 if (TREE_CODE (fns) == TREE_LIST)
1825 error ("request for member %qD is ambiguous", fnname);
1826 print_candidates (fns);
1827 return error_mark_node;
1829 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1831 /*conversion_path=*/NULL_TREE,
1837 /* Use a global operator new. */
1838 /* See if a cookie might be required. */
1839 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1840 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1842 cookie_size = NULL_TREE;
1844 alloc_call = build_operator_new_call (fnname, placement,
1845 &size, &cookie_size,
1850 if (alloc_call == error_mark_node)
1851 return error_mark_node;
1853 gcc_assert (alloc_fn != NULL_TREE);
1855 /* In the simple case, we can stop now. */
1856 pointer_type = build_pointer_type (type);
1857 if (!cookie_size && !is_initialized)
1859 rval = build_nop (pointer_type, alloc_call);
1860 if (placement != NULL)
1861 rval = avoid_placement_new_aliasing (rval, placement_expr);
1865 /* While we're working, use a pointer to the type we've actually
1866 allocated. Store the result of the call in a variable so that we
1867 can use it more than once. */
1868 full_pointer_type = build_pointer_type (full_type);
1869 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1870 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1872 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1873 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1874 alloc_call = TREE_OPERAND (alloc_call, 1);
1876 /* Now, check to see if this function is actually a placement
1877 allocation function. This can happen even when PLACEMENT is NULL
1878 because we might have something like:
1880 struct S { void* operator new (size_t, int i = 0); };
1882 A call to `new S' will get this allocation function, even though
1883 there is no explicit placement argument. If there is more than
1884 one argument, or there are variable arguments, then this is a
1885 placement allocation function. */
1886 placement_allocation_fn_p
1887 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1888 || varargs_function_p (alloc_fn));
1890 /* Preevaluate the placement args so that we don't reevaluate them for a
1891 placement delete. */
1892 if (placement_allocation_fn_p)
1895 stabilize_call (alloc_call, &inits);
1897 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1901 /* unless an allocation function is declared with an empty excep-
1902 tion-specification (_except.spec_), throw(), it indicates failure to
1903 allocate storage by throwing a bad_alloc exception (clause _except_,
1904 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1905 cation function is declared with an empty exception-specification,
1906 throw(), it returns null to indicate failure to allocate storage and a
1907 non-null pointer otherwise.
1909 So check for a null exception spec on the op new we just called. */
1911 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
1912 check_new = (flag_check_new || nothrow) && ! use_java_new;
1920 /* Adjust so we're pointing to the start of the object. */
1921 data_addr = get_target_expr (build2 (POINTER_PLUS_EXPR, full_pointer_type,
1922 alloc_node, cookie_size));
1924 /* Store the number of bytes allocated so that we can know how
1925 many elements to destroy later. We use the last sizeof
1926 (size_t) bytes to store the number of elements. */
1927 cookie_ptr = fold_build1 (NEGATE_EXPR, sizetype, size_in_bytes (sizetype));
1928 size_ptr_type = build_pointer_type (sizetype);
1929 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type,
1930 fold_convert (size_ptr_type, data_addr), cookie_ptr);
1931 cookie = build_indirect_ref (cookie_ptr, NULL);
1933 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
1935 if (targetm.cxx.cookie_has_size ())
1937 /* Also store the element size. */
1938 cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr,
1939 fold_build1 (NEGATE_EXPR, sizetype,
1940 size_in_bytes (sizetype)));
1942 cookie = build_indirect_ref (cookie_ptr, NULL);
1943 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
1944 size_in_bytes(elt_type));
1945 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
1946 cookie, cookie_expr);
1948 data_addr = TARGET_EXPR_SLOT (data_addr);
1952 cookie_expr = NULL_TREE;
1953 data_addr = alloc_node;
1956 /* Now initialize the allocated object. Note that we preevaluate the
1957 initialization expression, apart from the actual constructor call or
1958 assignment--we do this because we want to delay the allocation as long
1959 as possible in order to minimize the size of the exception region for
1960 placement delete. */
1965 init_expr = build_indirect_ref (data_addr, NULL);
1969 bool explicit_default_init_p = false;
1971 if (init == void_zero_node)
1974 explicit_default_init_p = true;
1977 pedwarn ("ISO C++ forbids initialization in array new");
1980 = build_vec_init (init_expr,
1981 cp_build_binary_op (MINUS_EXPR, outer_nelts,
1984 explicit_default_init_p,
1987 /* An array initialization is stable because the initialization
1988 of each element is a full-expression, so the temporaries don't
1994 if (init == void_zero_node)
1995 init = build_default_init (full_type, nelts);
1997 if (TYPE_NEEDS_CONSTRUCTING (type))
1999 init_expr = build_special_member_call (init_expr,
2000 complete_ctor_identifier,
2003 stable = stabilize_init (init_expr, &init_preeval_expr);
2007 /* We are processing something like `new int (10)', which
2008 means allocate an int, and initialize it with 10. */
2010 if (TREE_CODE (init) == TREE_LIST)
2011 init = build_x_compound_expr_from_list (init,
2014 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
2015 || TREE_TYPE (init) != NULL_TREE);
2017 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2018 stable = stabilize_init (init_expr, &init_preeval_expr);
2022 if (init_expr == error_mark_node)
2023 return error_mark_node;
2025 /* If any part of the object initialization terminates by throwing an
2026 exception and a suitable deallocation function can be found, the
2027 deallocation function is called to free the memory in which the
2028 object was being constructed, after which the exception continues
2029 to propagate in the context of the new-expression. If no
2030 unambiguous matching deallocation function can be found,
2031 propagating the exception does not cause the object's memory to be
2033 if (flag_exceptions && ! use_java_new)
2035 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2038 /* The Standard is unclear here, but the right thing to do
2039 is to use the same method for finding deallocation
2040 functions that we use for finding allocation functions. */
2041 cleanup = build_op_delete_call (dcode, alloc_node, size,
2042 globally_qualified_p,
2043 (placement_allocation_fn_p
2044 ? alloc_call : NULL_TREE),
2050 /* This is much simpler if we were able to preevaluate all of
2051 the arguments to the constructor call. */
2052 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2053 init_expr, cleanup);
2055 /* Ack! First we allocate the memory. Then we set our sentry
2056 variable to true, and expand a cleanup that deletes the
2057 memory if sentry is true. Then we run the constructor, and
2058 finally clear the sentry.
2060 We need to do this because we allocate the space first, so
2061 if there are any temporaries with cleanups in the
2062 constructor args and we weren't able to preevaluate them, we
2063 need this EH region to extend until end of full-expression
2064 to preserve nesting. */
2066 tree end, sentry, begin;
2068 begin = get_target_expr (boolean_true_node);
2069 CLEANUP_EH_ONLY (begin) = 1;
2071 sentry = TARGET_EXPR_SLOT (begin);
2073 TARGET_EXPR_CLEANUP (begin)
2074 = build3 (COND_EXPR, void_type_node, sentry,
2075 cleanup, void_zero_node);
2077 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2078 sentry, boolean_false_node);
2081 = build2 (COMPOUND_EXPR, void_type_node, begin,
2082 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2089 init_expr = NULL_TREE;
2091 /* Now build up the return value in reverse order. */
2096 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2098 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2100 if (rval == alloc_node)
2101 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2102 and return the call (which doesn't need to be adjusted). */
2103 rval = TARGET_EXPR_INITIAL (alloc_expr);
2108 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2110 rval = build_conditional_expr (ifexp, rval, alloc_node);
2113 /* Perform the allocation before anything else, so that ALLOC_NODE
2114 has been initialized before we start using it. */
2115 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2118 if (init_preeval_expr)
2119 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2121 /* Convert to the final type. */
2122 rval = build_nop (pointer_type, rval);
2124 /* A new-expression is never an lvalue. */
2125 gcc_assert (!lvalue_p (rval));
2127 if (placement != NULL)
2128 rval = avoid_placement_new_aliasing (rval, placement_expr);
2133 /* Generate a representation for a C++ "new" expression. PLACEMENT is
2134 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
2135 NELTS is NULL, TYPE is the type of the storage to be allocated. If
2136 NELTS is not NULL, then this is an array-new allocation; TYPE is
2137 the type of the elements in the array and NELTS is the number of
2138 elements in the array. INIT, if non-NULL, is the initializer for
2139 the new object, or void_zero_node to indicate an initializer of
2140 "()". If USE_GLOBAL_NEW is true, then the user explicitly wrote
2141 "::new" rather than just "new". */
2144 build_new (tree placement, tree type, tree nelts, tree init,
2148 tree orig_placement;
2152 if (placement == error_mark_node || type == error_mark_node
2153 || init == error_mark_node)
2154 return error_mark_node;
2156 orig_placement = placement;
2160 if (processing_template_decl)
2162 if (dependent_type_p (type)
2163 || any_type_dependent_arguments_p (placement)
2164 || (nelts && type_dependent_expression_p (nelts))
2165 || (init != void_zero_node
2166 && any_type_dependent_arguments_p (init)))
2167 return build_raw_new_expr (placement, type, nelts, init,
2169 placement = build_non_dependent_args (placement);
2171 nelts = build_non_dependent_expr (nelts);
2172 if (init != void_zero_node)
2173 init = build_non_dependent_args (init);
2178 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2179 pedwarn ("size in array new must have integral type");
2180 nelts = cp_save_expr (cp_convert (sizetype, nelts));
2183 /* ``A reference cannot be created by the new operator. A reference
2184 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2185 returned by new.'' ARM 5.3.3 */
2186 if (TREE_CODE (type) == REFERENCE_TYPE)
2188 error ("new cannot be applied to a reference type");
2189 type = TREE_TYPE (type);
2192 if (TREE_CODE (type) == FUNCTION_TYPE)
2194 error ("new cannot be applied to a function type");
2195 return error_mark_node;
2198 /* The type allocated must be complete. If the new-type-id was
2199 "T[N]" then we are just checking that "T" is complete here, but
2200 that is equivalent, since the value of "N" doesn't matter. */
2201 if (!complete_type_or_else (type, NULL_TREE))
2202 return error_mark_node;
2204 rval = build_new_1 (placement, type, nelts, init, use_global_new);
2205 if (rval == error_mark_node)
2206 return error_mark_node;
2208 if (processing_template_decl)
2209 return build_raw_new_expr (orig_placement, type, orig_nelts, orig_init,
2212 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2213 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2214 TREE_NO_WARNING (rval) = 1;
2219 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2222 build_java_class_ref (tree type)
2224 tree name = NULL_TREE, class_decl;
2225 static tree CL_suffix = NULL_TREE;
2226 if (CL_suffix == NULL_TREE)
2227 CL_suffix = get_identifier("class$");
2228 if (jclass_node == NULL_TREE)
2230 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2231 if (jclass_node == NULL_TREE)
2233 error ("call to Java constructor, while %<jclass%> undefined");
2234 return error_mark_node;
2236 jclass_node = TREE_TYPE (jclass_node);
2239 /* Mangle the class$ field. */
2242 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2243 if (DECL_NAME (field) == CL_suffix)
2245 mangle_decl (field);
2246 name = DECL_ASSEMBLER_NAME (field);
2251 error ("can't find %<class$%> in %qT", type);
2252 return error_mark_node;
2256 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2257 if (class_decl == NULL_TREE)
2259 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2260 TREE_STATIC (class_decl) = 1;
2261 DECL_EXTERNAL (class_decl) = 1;
2262 TREE_PUBLIC (class_decl) = 1;
2263 DECL_ARTIFICIAL (class_decl) = 1;
2264 DECL_IGNORED_P (class_decl) = 1;
2265 pushdecl_top_level (class_decl);
2266 make_decl_rtl (class_decl);
2272 build_vec_delete_1 (tree base, tree maxindex, tree type,
2273 special_function_kind auto_delete_vec, int use_global_delete)
2276 tree ptype = build_pointer_type (type = complete_type (type));
2277 tree size_exp = size_in_bytes (type);
2279 /* Temporary variables used by the loop. */
2280 tree tbase, tbase_init;
2282 /* This is the body of the loop that implements the deletion of a
2283 single element, and moves temp variables to next elements. */
2286 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2289 /* This is the thing that governs what to do after the loop has run. */
2290 tree deallocate_expr = 0;
2292 /* This is the BIND_EXPR which holds the outermost iterator of the
2293 loop. It is convenient to set this variable up and test it before
2294 executing any other code in the loop.
2295 This is also the containing expression returned by this function. */
2296 tree controller = NULL_TREE;
2299 /* We should only have 1-D arrays here. */
2300 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2302 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2305 /* The below is short by the cookie size. */
2306 virtual_size = size_binop (MULT_EXPR, size_exp,
2307 convert (sizetype, maxindex));
2309 tbase = create_temporary_var (ptype);
2310 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2311 fold_build2 (POINTER_PLUS_EXPR, ptype,
2312 fold_convert (ptype, base),
2314 DECL_REGISTER (tbase) = 1;
2315 controller = build3 (BIND_EXPR, void_type_node, tbase,
2316 NULL_TREE, NULL_TREE);
2317 TREE_SIDE_EFFECTS (controller) = 1;
2319 body = build1 (EXIT_EXPR, void_type_node,
2320 build2 (EQ_EXPR, boolean_type_node, tbase,
2321 fold_convert (ptype, base)));
2322 tmp = fold_build1 (NEGATE_EXPR, sizetype, size_exp);
2323 body = build_compound_expr
2324 (body, build_modify_expr (tbase, NOP_EXPR,
2325 build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp)));
2326 body = build_compound_expr
2327 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2328 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2330 loop = build1 (LOOP_EXPR, void_type_node, body);
2331 loop = build_compound_expr (tbase_init, loop);
2334 /* If the delete flag is one, or anything else with the low bit set,
2335 delete the storage. */
2336 if (auto_delete_vec != sfk_base_destructor)
2340 /* The below is short by the cookie size. */
2341 virtual_size = size_binop (MULT_EXPR, size_exp,
2342 convert (sizetype, maxindex));
2344 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2351 cookie_size = targetm.cxx.get_cookie_size (type);
2353 = cp_convert (ptype,
2354 cp_build_binary_op (MINUS_EXPR,
2355 cp_convert (string_type_node,
2358 /* True size with header. */
2359 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2362 if (auto_delete_vec == sfk_deleting_destructor)
2363 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2364 base_tbd, virtual_size,
2365 use_global_delete & 1,
2366 /*placement=*/NULL_TREE,
2367 /*alloc_fn=*/NULL_TREE);
2371 if (!deallocate_expr)
2374 body = deallocate_expr;
2376 body = build_compound_expr (body, deallocate_expr);
2379 body = integer_zero_node;
2381 /* Outermost wrapper: If pointer is null, punt. */
2382 body = fold_build3 (COND_EXPR, void_type_node,
2383 fold_build2 (NE_EXPR, boolean_type_node, base,
2384 convert (TREE_TYPE (base),
2385 integer_zero_node)),
2386 body, integer_zero_node);
2387 body = build1 (NOP_EXPR, void_type_node, body);
2391 TREE_OPERAND (controller, 1) = body;
2395 if (TREE_CODE (base) == SAVE_EXPR)
2396 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2397 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2399 return convert_to_void (body, /*implicit=*/NULL);
2402 /* Create an unnamed variable of the indicated TYPE. */
2405 create_temporary_var (tree type)
2409 decl = build_decl (VAR_DECL, NULL_TREE, type);
2410 TREE_USED (decl) = 1;
2411 DECL_ARTIFICIAL (decl) = 1;
2412 DECL_IGNORED_P (decl) = 1;
2413 DECL_SOURCE_LOCATION (decl) = input_location;
2414 DECL_CONTEXT (decl) = current_function_decl;
2419 /* Create a new temporary variable of the indicated TYPE, initialized
2422 It is not entered into current_binding_level, because that breaks
2423 things when it comes time to do final cleanups (which take place
2424 "outside" the binding contour of the function). */
2427 get_temp_regvar (tree type, tree init)
2431 decl = create_temporary_var (type);
2432 add_decl_expr (decl);
2434 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2439 /* `build_vec_init' returns tree structure that performs
2440 initialization of a vector of aggregate types.
2442 BASE is a reference to the vector, of ARRAY_TYPE.
2443 MAXINDEX is the maximum index of the array (one less than the
2444 number of elements). It is only used if
2445 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2447 INIT is the (possibly NULL) initializer.
2449 If EXPLICIT_DEFAULT_INIT_P is true, then INIT must be NULL. All
2450 elements in the array are default-initialized.
2452 FROM_ARRAY is 0 if we should init everything with INIT
2453 (i.e., every element initialized from INIT).
2454 FROM_ARRAY is 1 if we should index into INIT in parallel
2455 with initialization of DECL.
2456 FROM_ARRAY is 2 if we should index into INIT in parallel,
2457 but use assignment instead of initialization. */
2460 build_vec_init (tree base, tree maxindex, tree init,
2461 bool explicit_default_init_p,
2465 tree base2 = NULL_TREE;
2467 tree itype = NULL_TREE;
2469 /* The type of the array. */
2470 tree atype = TREE_TYPE (base);
2471 /* The type of an element in the array. */
2472 tree type = TREE_TYPE (atype);
2473 /* The element type reached after removing all outer array
2475 tree inner_elt_type;
2476 /* The type of a pointer to an element in the array. */
2481 tree try_block = NULL_TREE;
2482 int num_initialized_elts = 0;
2485 if (TYPE_DOMAIN (atype))
2486 maxindex = array_type_nelts (atype);
2488 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2489 return error_mark_node;
2491 if (explicit_default_init_p)
2494 inner_elt_type = strip_array_types (atype);
2497 ? (!CLASS_TYPE_P (inner_elt_type)
2498 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2499 : !TYPE_NEEDS_CONSTRUCTING (type))
2500 && ((TREE_CODE (init) == CONSTRUCTOR
2501 /* Don't do this if the CONSTRUCTOR might contain something
2502 that might throw and require us to clean up. */
2503 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2504 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2507 /* Do non-default initialization of POD arrays resulting from
2508 brace-enclosed initializers. In this case, digest_init and
2509 store_constructor will handle the semantics for us. */
2511 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2515 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2516 ptype = build_pointer_type (type);
2517 size = size_in_bytes (type);
2518 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2519 base = cp_convert (ptype, decay_conversion (base));
2521 /* The code we are generating looks like:
2525 ptrdiff_t iterator = maxindex;
2527 for (; iterator != -1; --iterator) {
2528 ... initialize *t1 ...
2532 ... destroy elements that were constructed ...
2537 We can omit the try and catch blocks if we know that the
2538 initialization will never throw an exception, or if the array
2539 elements do not have destructors. We can omit the loop completely if
2540 the elements of the array do not have constructors.
2542 We actually wrap the entire body of the above in a STMT_EXPR, for
2545 When copying from array to another, when the array elements have
2546 only trivial copy constructors, we should use __builtin_memcpy
2547 rather than generating a loop. That way, we could take advantage
2548 of whatever cleverness the back end has for dealing with copies
2549 of blocks of memory. */
2551 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2552 destroy_temps = stmts_are_full_exprs_p ();
2553 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2554 rval = get_temp_regvar (ptype, base);
2555 base = get_temp_regvar (ptype, rval);
2556 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2558 /* Protect the entire array initialization so that we can destroy
2559 the partially constructed array if an exception is thrown.
2560 But don't do this if we're assigning. */
2561 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2564 try_block = begin_try_block ();
2567 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2569 /* Do non-default initialization of non-POD arrays resulting from
2570 brace-enclosed initializers. */
2571 unsigned HOST_WIDE_INT idx;
2575 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2577 tree baseref = build1 (INDIRECT_REF, type, base);
2579 num_initialized_elts++;
2581 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2582 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2583 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2585 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2587 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2589 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2590 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2593 /* Clear out INIT so that we don't get confused below. */
2596 else if (from_array)
2598 /* If initializing one array from another, initialize element by
2599 element. We rely upon the below calls the do argument
2603 base2 = decay_conversion (init);
2604 itype = TREE_TYPE (base2);
2605 base2 = get_temp_regvar (itype, base2);
2606 itype = TREE_TYPE (itype);
2608 else if (TYPE_LANG_SPECIFIC (type)
2609 && TYPE_NEEDS_CONSTRUCTING (type)
2610 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2612 error ("initializer ends prematurely");
2613 return error_mark_node;
2617 /* Now, default-initialize any remaining elements. We don't need to
2618 do that if a) the type does not need constructing, or b) we've
2619 already initialized all the elements.
2621 We do need to keep going if we're copying an array. */
2624 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_default_init_p)
2625 && ! (host_integerp (maxindex, 0)
2626 && (num_initialized_elts
2627 == tree_low_cst (maxindex, 0) + 1))))
2629 /* If the ITERATOR is equal to -1, then we don't have to loop;
2630 we've already initialized all the elements. */
2635 for_stmt = begin_for_stmt ();
2636 finish_for_init_stmt (for_stmt);
2637 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2638 build_int_cst (TREE_TYPE (iterator), -1)),
2640 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2643 to = build1 (INDIRECT_REF, type, base);
2650 from = build1 (INDIRECT_REF, itype, base2);
2654 if (from_array == 2)
2655 elt_init = build_modify_expr (to, NOP_EXPR, from);
2656 else if (TYPE_NEEDS_CONSTRUCTING (type))
2657 elt_init = build_aggr_init (to, from, 0);
2659 elt_init = build_modify_expr (to, NOP_EXPR, from);
2663 else if (TREE_CODE (type) == ARRAY_TYPE)
2667 ("cannot initialize multi-dimensional array with initializer");
2668 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2670 /*explicit_default_init_p=*/false,
2673 else if (!TYPE_NEEDS_CONSTRUCTING (type))
2674 elt_init = (build_modify_expr
2676 build_zero_init (type, size_one_node,
2677 /*static_storage_p=*/false)));
2679 elt_init = build_aggr_init (to, init, 0);
2681 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2682 finish_expr_stmt (elt_init);
2683 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2685 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2687 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2689 finish_for_stmt (for_stmt);
2692 /* Make sure to cleanup any partially constructed elements. */
2693 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2697 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2699 /* Flatten multi-dimensional array since build_vec_delete only
2700 expects one-dimensional array. */
2701 if (TREE_CODE (type) == ARRAY_TYPE)
2702 m = cp_build_binary_op (MULT_EXPR, m,
2703 array_type_nelts_total (type));
2705 finish_cleanup_try_block (try_block);
2706 e = build_vec_delete_1 (rval, m,
2707 inner_elt_type, sfk_base_destructor,
2708 /*use_global_delete=*/0);
2709 finish_cleanup (e, try_block);
2712 /* The value of the array initialization is the array itself, RVAL
2713 is a pointer to the first element. */
2714 finish_stmt_expr_expr (rval, stmt_expr);
2716 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2718 /* Now convert make the result have the correct type. */
2719 atype = build_pointer_type (atype);
2720 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2721 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2723 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2727 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2731 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2737 case sfk_complete_destructor:
2738 name = complete_dtor_identifier;
2741 case sfk_base_destructor:
2742 name = base_dtor_identifier;
2745 case sfk_deleting_destructor:
2746 name = deleting_dtor_identifier;
2752 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2753 return build_new_method_call (exp, fn,
2755 /*conversion_path=*/NULL_TREE,
2760 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2761 ADDR is an expression which yields the store to be destroyed.
2762 AUTO_DELETE is the name of the destructor to call, i.e., either
2763 sfk_complete_destructor, sfk_base_destructor, or
2764 sfk_deleting_destructor.
2766 FLAGS is the logical disjunction of zero or more LOOKUP_
2767 flags. See cp-tree.h for more info. */
2770 build_delete (tree type, tree addr, special_function_kind auto_delete,
2771 int flags, int use_global_delete)
2775 if (addr == error_mark_node)
2776 return error_mark_node;
2778 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2779 set to `error_mark_node' before it gets properly cleaned up. */
2780 if (type == error_mark_node)
2781 return error_mark_node;
2783 type = TYPE_MAIN_VARIANT (type);
2785 if (TREE_CODE (type) == POINTER_TYPE)
2787 bool complete_p = true;
2789 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2790 if (TREE_CODE (type) == ARRAY_TYPE)
2793 /* We don't want to warn about delete of void*, only other
2794 incomplete types. Deleting other incomplete types
2795 invokes undefined behavior, but it is not ill-formed, so
2796 compile to something that would even do The Right Thing
2797 (TM) should the type have a trivial dtor and no delete
2799 if (!VOID_TYPE_P (type))
2801 complete_type (type);
2802 if (!COMPLETE_TYPE_P (type))
2804 warning (0, "possible problem detected in invocation of "
2805 "delete operator:");
2806 cxx_incomplete_type_diagnostic (addr, type, 1);
2807 inform ("neither the destructor nor the class-specific "
2808 "operator delete will be called, even if they are "
2809 "declared when the class is defined.");
2813 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2814 /* Call the builtin operator delete. */
2815 return build_builtin_delete_call (addr);
2816 if (TREE_SIDE_EFFECTS (addr))
2817 addr = save_expr (addr);
2819 /* Throw away const and volatile on target type of addr. */
2820 addr = convert_force (build_pointer_type (type), addr, 0);
2822 else if (TREE_CODE (type) == ARRAY_TYPE)
2826 if (TYPE_DOMAIN (type) == NULL_TREE)
2828 error ("unknown array size in delete");
2829 return error_mark_node;
2831 return build_vec_delete (addr, array_type_nelts (type),
2832 auto_delete, use_global_delete);
2836 /* Don't check PROTECT here; leave that decision to the
2837 destructor. If the destructor is accessible, call it,
2838 else report error. */
2839 addr = build_unary_op (ADDR_EXPR, addr, 0);
2840 if (TREE_SIDE_EFFECTS (addr))
2841 addr = save_expr (addr);
2843 addr = convert_force (build_pointer_type (type), addr, 0);
2846 gcc_assert (IS_AGGR_TYPE (type));
2848 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2850 if (auto_delete != sfk_deleting_destructor)
2851 return void_zero_node;
2853 return build_op_delete_call (DELETE_EXPR, addr,
2854 cxx_sizeof_nowarn (type),
2856 /*placement=*/NULL_TREE,
2857 /*alloc_fn=*/NULL_TREE);
2861 tree head = NULL_TREE;
2862 tree do_delete = NULL_TREE;
2865 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
2866 lazily_declare_fn (sfk_destructor, type);
2868 /* For `::delete x', we must not use the deleting destructor
2869 since then we would not be sure to get the global `operator
2871 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2873 /* We will use ADDR multiple times so we must save it. */
2874 addr = save_expr (addr);
2875 head = get_target_expr (build_headof (addr));
2876 /* Delete the object. */
2877 do_delete = build_builtin_delete_call (head);
2878 /* Otherwise, treat this like a complete object destructor
2880 auto_delete = sfk_complete_destructor;
2882 /* If the destructor is non-virtual, there is no deleting
2883 variant. Instead, we must explicitly call the appropriate
2884 `operator delete' here. */
2885 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2886 && auto_delete == sfk_deleting_destructor)
2888 /* We will use ADDR multiple times so we must save it. */
2889 addr = save_expr (addr);
2890 /* Build the call. */
2891 do_delete = build_op_delete_call (DELETE_EXPR,
2893 cxx_sizeof_nowarn (type),
2895 /*placement=*/NULL_TREE,
2896 /*alloc_fn=*/NULL_TREE);
2897 /* Call the complete object destructor. */
2898 auto_delete = sfk_complete_destructor;
2900 else if (auto_delete == sfk_deleting_destructor
2901 && TYPE_GETS_REG_DELETE (type))
2903 /* Make sure we have access to the member op delete, even though
2904 we'll actually be calling it from the destructor. */
2905 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2907 /*placement=*/NULL_TREE,
2908 /*alloc_fn=*/NULL_TREE);
2911 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2912 auto_delete, flags);
2914 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
2916 /* We need to calculate this before the dtor changes the vptr. */
2918 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr);
2920 if (flags & LOOKUP_DESTRUCTOR)
2921 /* Explicit destructor call; don't check for null pointer. */
2922 ifexp = integer_one_node;
2924 /* Handle deleting a null pointer. */
2925 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2927 if (ifexp != integer_one_node)
2928 expr = build3 (COND_EXPR, void_type_node,
2929 ifexp, expr, void_zero_node);
2935 /* At the beginning of a destructor, push cleanups that will call the
2936 destructors for our base classes and members.
2938 Called from begin_destructor_body. */
2941 push_base_cleanups (void)
2943 tree binfo, base_binfo;
2947 VEC(tree,gc) *vbases;
2949 /* Run destructors for all virtual baseclasses. */
2950 if (CLASSTYPE_VBASECLASSES (current_class_type))
2952 tree cond = (condition_conversion
2953 (build2 (BIT_AND_EXPR, integer_type_node,
2954 current_in_charge_parm,
2955 integer_two_node)));
2957 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2958 order, which is also the right order for pushing cleanups. */
2959 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
2960 VEC_iterate (tree, vbases, i, base_binfo); i++)
2962 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
2964 expr = build_special_member_call (current_class_ref,
2965 base_dtor_identifier,
2969 | LOOKUP_NONVIRTUAL));
2970 expr = build3 (COND_EXPR, void_type_node, cond,
2971 expr, void_zero_node);
2972 finish_decl_cleanup (NULL_TREE, expr);
2977 /* Take care of the remaining baseclasses. */
2978 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2979 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2981 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2982 || BINFO_VIRTUAL_P (base_binfo))
2985 expr = build_special_member_call (current_class_ref,
2986 base_dtor_identifier,
2987 NULL_TREE, base_binfo,
2988 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2989 finish_decl_cleanup (NULL_TREE, expr);
2992 for (member = TYPE_FIELDS (current_class_type); member;
2993 member = TREE_CHAIN (member))
2995 if (TREE_TYPE (member) == error_mark_node
2996 || TREE_CODE (member) != FIELD_DECL
2997 || DECL_ARTIFICIAL (member))
2999 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3001 tree this_member = (build_class_member_access_expr
3002 (current_class_ref, member,
3003 /*access_path=*/NULL_TREE,
3004 /*preserve_reference=*/false));
3005 tree this_type = TREE_TYPE (member);
3006 expr = build_delete (this_type, this_member,
3007 sfk_complete_destructor,
3008 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3010 finish_decl_cleanup (NULL_TREE, expr);
3015 /* Build a C++ vector delete expression.
3016 MAXINDEX is the number of elements to be deleted.
3017 ELT_SIZE is the nominal size of each element in the vector.
3018 BASE is the expression that should yield the store to be deleted.
3019 This function expands (or synthesizes) these calls itself.
3020 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3022 This also calls delete for virtual baseclasses of elements of the vector.
3024 Update: MAXINDEX is no longer needed. The size can be extracted from the
3025 start of the vector for pointers, and from the type for arrays. We still
3026 use MAXINDEX for arrays because it happens to already have one of the
3027 values we'd have to extract. (We could use MAXINDEX with pointers to
3028 confirm the size, and trap if the numbers differ; not clear that it'd
3029 be worth bothering.) */
3032 build_vec_delete (tree base, tree maxindex,
3033 special_function_kind auto_delete_vec, int use_global_delete)
3037 tree base_init = NULL_TREE;
3039 type = TREE_TYPE (base);
3041 if (TREE_CODE (type) == POINTER_TYPE)
3043 /* Step back one from start of vector, and read dimension. */
3046 if (TREE_SIDE_EFFECTS (base))
3048 base_init = get_target_expr (base);
3049 base = TARGET_EXPR_SLOT (base_init);
3051 type = strip_array_types (TREE_TYPE (type));
3052 cookie_addr = fold_build1 (NEGATE_EXPR, sizetype, TYPE_SIZE_UNIT (sizetype));
3053 cookie_addr = build2 (POINTER_PLUS_EXPR,
3054 build_pointer_type (sizetype),
3057 maxindex = build_indirect_ref (cookie_addr, NULL);
3059 else if (TREE_CODE (type) == ARRAY_TYPE)
3061 /* Get the total number of things in the array, maxindex is a
3063 maxindex = array_type_nelts_total (type);
3064 type = strip_array_types (type);
3065 base = build_unary_op (ADDR_EXPR, base, 1);
3066 if (TREE_SIDE_EFFECTS (base))
3068 base_init = get_target_expr (base);
3069 base = TARGET_EXPR_SLOT (base_init);
3074 if (base != error_mark_node)
3075 error ("type to vector delete is neither pointer or array type");
3076 return error_mark_node;
3079 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3082 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);