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 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
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_default_init (tree, tree);
55 static tree build_dtor_call (tree, special_function_kind, int);
56 static tree build_field_list (tree, tree, int *);
57 static tree build_vtbl_address (tree);
59 /* We are about to generate some complex initialization code.
60 Conceptually, it is all a single expression. However, we may want
61 to include conditionals, loops, and other such statement-level
62 constructs. Therefore, we build the initialization code inside a
63 statement-expression. This function starts such an expression.
64 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
65 pass them back to finish_init_stmts when the expression is
69 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
71 bool is_global = !building_stmt_tree ();
73 *stmt_expr_p = begin_stmt_expr ();
74 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
79 /* Finish out the statement-expression begun by the previous call to
80 begin_init_stmts. Returns the statement-expression itself. */
83 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
85 finish_compound_stmt (compound_stmt);
87 stmt_expr = finish_stmt_expr (stmt_expr, true);
89 gcc_assert (!building_stmt_tree () == is_global);
96 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
97 which we want to initialize the vtable pointer for, DATA is
98 TREE_LIST whose TREE_VALUE is the this ptr expression. */
101 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
103 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
104 return dfs_skip_bases;
106 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
108 tree base_ptr = TREE_VALUE ((tree) data);
110 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
112 expand_virtual_init (binfo, base_ptr);
118 /* Initialize all the vtable pointers in the object pointed to by
122 initialize_vtbl_ptrs (tree addr)
127 type = TREE_TYPE (TREE_TYPE (addr));
128 list = build_tree_list (type, addr);
130 /* Walk through the hierarchy, initializing the vptr in each base
131 class. We do these in pre-order because we can't find the virtual
132 bases for a class until we've initialized the vtbl for that
134 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list);
137 /* Return an expression for the zero-initialization of an object with
138 type T. This expression will either be a constant (in the case
139 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
140 aggregate). In either case, the value can be used as DECL_INITIAL
141 for a decl of the indicated TYPE; it is a valid static initializer.
142 If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
143 number of elements in the array. If STATIC_STORAGE_P is TRUE,
144 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),
203 CONSTRUCTOR_APPEND_ELT(v, field, value);
206 /* For unions, only the first field is initialized. */
207 if (TREE_CODE (type) == UNION_TYPE)
211 /* Build a constructor to contain the initializations. */
212 init = build_constructor (type, v);
214 else if (TREE_CODE (type) == ARRAY_TYPE)
217 VEC(constructor_elt,gc) *v = NULL;
219 /* Iterate over the array elements, building initializations. */
221 max_index = fold_build2 (MINUS_EXPR, TREE_TYPE (nelts),
222 nelts, integer_one_node);
224 max_index = array_type_nelts (type);
225 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
227 /* A zero-sized array, which is accepted as an extension, will
228 have an upper bound of -1. */
229 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
233 v = VEC_alloc (constructor_elt, gc, 1);
234 ce = VEC_quick_push (constructor_elt, v, NULL);
236 /* If this is a one element array, we just use a regular init. */
237 if (tree_int_cst_equal (size_zero_node, max_index))
238 ce->index = size_zero_node;
240 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
243 ce->value = build_zero_init (TREE_TYPE (type),
248 /* Build a constructor to contain the initializations. */
249 init = build_constructor (type, v);
252 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
254 /* In all cases, the initializer is a constant. */
257 TREE_CONSTANT (init) = 1;
258 TREE_INVARIANT (init) = 1;
264 /* Build an expression for the default-initialization of an object of
265 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
266 ARRAY_TYPE, NELTS is the number of elements in the array. If
267 initialization of TYPE requires calling constructors, this function
268 returns NULL_TREE; the caller is responsible for arranging for the
269 constructors to be called. */
272 build_default_init (tree type, tree nelts)
276 To default-initialize an object of type T means:
278 --if T is a non-POD class type (clause _class_), the default construc-
279 tor for T is called (and the initialization is ill-formed if T has
280 no accessible default constructor);
282 --if T is an array type, each element is default-initialized;
284 --otherwise, the storage for the object is zero-initialized.
286 A program that calls for default-initialization of an entity of refer-
287 ence type is ill-formed. */
289 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
290 performing the initialization. This is confusing in that some
291 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
292 a class with a pointer-to-data member as a non-static data member
293 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
294 passing non-PODs to build_zero_init below, which is contrary to
295 the semantics quoted above from [dcl.init].
297 It happens, however, that the behavior of the constructor the
298 standard says we should have generated would be precisely the
299 same as that obtained by calling build_zero_init below, so things
301 if (TYPE_NEEDS_CONSTRUCTING (type)
302 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
305 /* At this point, TYPE is either a POD class type, an array of POD
306 classes, or something even more innocuous. */
307 return build_zero_init (type, nelts, /*static_storage_p=*/false);
310 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
311 arguments. If TREE_LIST is void_type_node, an empty initializer
312 list was given; if NULL_TREE no initializer was given. */
315 perform_member_init (tree member, tree init)
318 tree type = TREE_TYPE (member);
321 explicit = (init != NULL_TREE);
323 /* Effective C++ rule 12 requires that all data members be
325 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
326 warning (OPT_Weffc__, "%J%qD should be initialized in the member initialization "
327 "list", current_function_decl, member);
329 if (init == void_type_node)
332 /* Get an lvalue for the data member. */
333 decl = build_class_member_access_expr (current_class_ref, member,
334 /*access_path=*/NULL_TREE,
335 /*preserve_reference=*/true);
336 if (decl == error_mark_node)
339 /* Deal with this here, as we will get confused if we try to call the
340 assignment op for an anonymous union. This can happen in a
341 synthesized copy constructor. */
342 if (ANON_AGGR_TYPE_P (type))
346 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
347 finish_expr_stmt (init);
350 else if (TYPE_NEEDS_CONSTRUCTING (type))
353 && TREE_CODE (type) == ARRAY_TYPE
355 && TREE_CHAIN (init) == NULL_TREE
356 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
358 /* Initialization of one array from another. */
359 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
360 /*explicit_default_init_p=*/false,
364 finish_expr_stmt (build_aggr_init (decl, init, 0));
368 if (init == NULL_TREE)
372 init = build_default_init (type, /*nelts=*/NULL_TREE);
373 if (TREE_CODE (type) == REFERENCE_TYPE)
374 warning (0, "%Jdefault-initialization of %q#D, "
375 "which has reference type",
376 current_function_decl, member);
378 /* member traversal: note it leaves init NULL */
379 else if (TREE_CODE (type) == REFERENCE_TYPE)
380 pedwarn ("%Juninitialized reference member %qD",
381 current_function_decl, member);
382 else if (CP_TYPE_CONST_P (type))
383 pedwarn ("%Juninitialized member %qD with %<const%> type %qT",
384 current_function_decl, member, type);
386 else if (TREE_CODE (init) == TREE_LIST)
387 /* There was an explicit member initialization. Do some work
389 init = build_x_compound_expr_from_list (init, "member initializer");
392 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
395 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
399 expr = build_class_member_access_expr (current_class_ref, member,
400 /*access_path=*/NULL_TREE,
401 /*preserve_reference=*/false);
402 expr = build_delete (type, expr, sfk_complete_destructor,
403 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
405 if (expr != error_mark_node)
406 finish_eh_cleanup (expr);
410 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
411 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
414 build_field_list (tree t, tree list, int *uses_unions_p)
420 /* Note whether or not T is a union. */
421 if (TREE_CODE (t) == UNION_TYPE)
424 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
426 /* Skip CONST_DECLs for enumeration constants and so forth. */
427 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
430 /* Keep track of whether or not any fields are unions. */
431 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
434 /* For an anonymous struct or union, we must recursively
435 consider the fields of the anonymous type. They can be
436 directly initialized from the constructor. */
437 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
439 /* Add this field itself. Synthesized copy constructors
440 initialize the entire aggregate. */
441 list = tree_cons (fields, NULL_TREE, list);
442 /* And now add the fields in the anonymous aggregate. */
443 list = build_field_list (TREE_TYPE (fields), list,
446 /* Add this field. */
447 else if (DECL_NAME (fields))
448 list = tree_cons (fields, NULL_TREE, list);
454 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
455 a FIELD_DECL or BINFO in T that needs initialization. The
456 TREE_VALUE gives the initializer, or list of initializer arguments.
458 Return a TREE_LIST containing all of the initializations required
459 for T, in the order in which they should be performed. The output
460 list has the same format as the input. */
463 sort_mem_initializers (tree t, tree mem_inits)
466 tree base, binfo, base_binfo;
469 VEC(tree,gc) *vbases;
473 /* Build up a list of initializations. The TREE_PURPOSE of entry
474 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
475 TREE_VALUE will be the constructor arguments, or NULL if no
476 explicit initialization was provided. */
477 sorted_inits = NULL_TREE;
479 /* Process the virtual bases. */
480 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
481 VEC_iterate (tree, vbases, i, base); i++)
482 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
484 /* Process the direct bases. */
485 for (binfo = TYPE_BINFO (t), i = 0;
486 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
487 if (!BINFO_VIRTUAL_P (base_binfo))
488 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
490 /* Process the non-static data members. */
491 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
492 /* Reverse the entire list of initializations, so that they are in
493 the order that they will actually be performed. */
494 sorted_inits = nreverse (sorted_inits);
496 /* If the user presented the initializers in an order different from
497 that in which they will actually occur, we issue a warning. Keep
498 track of the next subobject which can be explicitly initialized
499 without issuing a warning. */
500 next_subobject = sorted_inits;
502 /* Go through the explicit initializers, filling in TREE_PURPOSE in
504 for (init = mem_inits; init; init = TREE_CHAIN (init))
509 subobject = TREE_PURPOSE (init);
511 /* If the explicit initializers are in sorted order, then
512 SUBOBJECT will be NEXT_SUBOBJECT, or something following
514 for (subobject_init = next_subobject;
516 subobject_init = TREE_CHAIN (subobject_init))
517 if (TREE_PURPOSE (subobject_init) == subobject)
520 /* Issue a warning if the explicit initializer order does not
521 match that which will actually occur.
522 ??? Are all these on the correct lines? */
523 if (warn_reorder && !subobject_init)
525 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
526 warning (OPT_Wreorder, "%q+D will be initialized after",
527 TREE_PURPOSE (next_subobject));
529 warning (OPT_Wreorder, "base %qT will be initialized after",
530 TREE_PURPOSE (next_subobject));
531 if (TREE_CODE (subobject) == FIELD_DECL)
532 warning (OPT_Wreorder, " %q+#D", subobject);
534 warning (OPT_Wreorder, " base %qT", subobject);
535 warning (OPT_Wreorder, "%J when initialized here", current_function_decl);
538 /* Look again, from the beginning of the list. */
541 subobject_init = sorted_inits;
542 while (TREE_PURPOSE (subobject_init) != subobject)
543 subobject_init = TREE_CHAIN (subobject_init);
546 /* It is invalid to initialize the same subobject more than
548 if (TREE_VALUE (subobject_init))
550 if (TREE_CODE (subobject) == FIELD_DECL)
551 error ("%Jmultiple initializations given for %qD",
552 current_function_decl, subobject);
554 error ("%Jmultiple initializations given for base %qT",
555 current_function_decl, subobject);
558 /* Record the initialization. */
559 TREE_VALUE (subobject_init) = TREE_VALUE (init);
560 next_subobject = subobject_init;
565 If a ctor-initializer specifies more than one mem-initializer for
566 multiple members of the same union (including members of
567 anonymous unions), the ctor-initializer is ill-formed. */
570 tree last_field = NULL_TREE;
571 for (init = sorted_inits; init; init = TREE_CHAIN (init))
577 /* Skip uninitialized members and base classes. */
578 if (!TREE_VALUE (init)
579 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
581 /* See if this field is a member of a union, or a member of a
582 structure contained in a union, etc. */
583 field = TREE_PURPOSE (init);
584 for (field_type = DECL_CONTEXT (field);
585 !same_type_p (field_type, t);
586 field_type = TYPE_CONTEXT (field_type))
587 if (TREE_CODE (field_type) == UNION_TYPE)
589 /* If this field is not a member of a union, skip it. */
590 if (TREE_CODE (field_type) != UNION_TYPE)
593 /* It's only an error if we have two initializers for the same
601 /* See if LAST_FIELD and the field initialized by INIT are
602 members of the same union. If so, there's a problem,
603 unless they're actually members of the same structure
604 which is itself a member of a union. For example, given:
606 union { struct { int i; int j; }; };
608 initializing both `i' and `j' makes sense. */
609 field_type = DECL_CONTEXT (field);
613 tree last_field_type;
615 last_field_type = DECL_CONTEXT (last_field);
618 if (same_type_p (last_field_type, field_type))
620 if (TREE_CODE (field_type) == UNION_TYPE)
621 error ("%Jinitializations for multiple members of %qT",
622 current_function_decl, last_field_type);
627 if (same_type_p (last_field_type, t))
630 last_field_type = TYPE_CONTEXT (last_field_type);
633 /* If we've reached the outermost class, then we're
635 if (same_type_p (field_type, t))
638 field_type = TYPE_CONTEXT (field_type);
649 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
650 is a TREE_LIST giving the explicit mem-initializer-list for the
651 constructor. The TREE_PURPOSE of each entry is a subobject (a
652 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
653 is a TREE_LIST giving the arguments to the constructor or
654 void_type_node for an empty list of arguments. */
657 emit_mem_initializers (tree mem_inits)
659 /* We will already have issued an error message about the fact that
660 the type is incomplete. */
661 if (!COMPLETE_TYPE_P (current_class_type))
664 /* Sort the mem-initializers into the order in which the
665 initializations should be performed. */
666 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
668 in_base_initializer = 1;
670 /* Initialize base classes. */
672 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
674 tree subobject = TREE_PURPOSE (mem_inits);
675 tree arguments = TREE_VALUE (mem_inits);
677 /* If these initializations are taking place in a copy
678 constructor, the base class should probably be explicitly
680 if (extra_warnings && !arguments
681 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
682 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
683 warning (OPT_Wextra, "%Jbase class %q#T should be explicitly initialized in the "
685 current_function_decl, BINFO_TYPE (subobject));
687 /* If an explicit -- but empty -- initializer list was present,
688 treat it just like default initialization at this point. */
689 if (arguments == void_type_node)
690 arguments = NULL_TREE;
692 /* Initialize the base. */
693 if (BINFO_VIRTUAL_P (subobject))
694 construct_virtual_base (subobject, arguments);
699 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
701 expand_aggr_init_1 (subobject, NULL_TREE,
702 build_indirect_ref (base_addr, NULL),
705 expand_cleanup_for_base (subobject, NULL_TREE);
708 mem_inits = TREE_CHAIN (mem_inits);
710 in_base_initializer = 0;
712 /* Initialize the vptrs. */
713 initialize_vtbl_ptrs (current_class_ptr);
715 /* Initialize the data members. */
718 perform_member_init (TREE_PURPOSE (mem_inits),
719 TREE_VALUE (mem_inits));
720 mem_inits = TREE_CHAIN (mem_inits);
724 /* Returns the address of the vtable (i.e., the value that should be
725 assigned to the vptr) for BINFO. */
728 build_vtbl_address (tree binfo)
730 tree binfo_for = binfo;
733 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
734 /* If this is a virtual primary base, then the vtable we want to store
735 is that for the base this is being used as the primary base of. We
736 can't simply skip the initialization, because we may be expanding the
737 inits of a subobject constructor where the virtual base layout
739 while (BINFO_PRIMARY_P (binfo_for))
740 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
742 /* Figure out what vtable BINFO's vtable is based on, and mark it as
744 vtbl = get_vtbl_decl_for_binfo (binfo_for);
745 assemble_external (vtbl);
746 TREE_USED (vtbl) = 1;
748 /* Now compute the address to use when initializing the vptr. */
749 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
750 if (TREE_CODE (vtbl) == VAR_DECL)
751 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
756 /* This code sets up the virtual function tables appropriate for
757 the pointer DECL. It is a one-ply initialization.
759 BINFO is the exact type that DECL is supposed to be. In
760 multiple inheritance, this might mean "C's A" if C : A, B. */
763 expand_virtual_init (tree binfo, tree decl)
768 /* Compute the initializer for vptr. */
769 vtbl = build_vtbl_address (binfo);
771 /* We may get this vptr from a VTT, if this is a subobject
772 constructor or subobject destructor. */
773 vtt_index = BINFO_VPTR_INDEX (binfo);
779 /* Compute the value to use, when there's a VTT. */
780 vtt_parm = current_vtt_parm;
781 vtbl2 = build2 (PLUS_EXPR,
782 TREE_TYPE (vtt_parm),
785 vtbl2 = build_indirect_ref (vtbl2, NULL);
786 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
788 /* The actual initializer is the VTT value only in the subobject
789 constructor. In maybe_clone_body we'll substitute NULL for
790 the vtt_parm in the case of the non-subobject constructor. */
791 vtbl = build3 (COND_EXPR,
793 build2 (EQ_EXPR, boolean_type_node,
794 current_in_charge_parm, integer_zero_node),
799 /* Compute the location of the vtpr. */
800 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
802 gcc_assert (vtbl_ptr != error_mark_node);
804 /* Assign the vtable to the vptr. */
805 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
806 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
809 /* If an exception is thrown in a constructor, those base classes already
810 constructed must be destroyed. This function creates the cleanup
811 for BINFO, which has just been constructed. If FLAG is non-NULL,
812 it is a DECL which is nonzero when this base needs to be
816 expand_cleanup_for_base (tree binfo, tree flag)
820 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
823 /* Call the destructor. */
824 expr = build_special_member_call (current_class_ref,
825 base_dtor_identifier,
828 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
830 expr = fold_build3 (COND_EXPR, void_type_node,
831 c_common_truthvalue_conversion (flag),
832 expr, integer_zero_node);
834 finish_eh_cleanup (expr);
837 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
841 construct_virtual_base (tree vbase, tree arguments)
847 /* If there are virtual base classes with destructors, we need to
848 emit cleanups to destroy them if an exception is thrown during
849 the construction process. These exception regions (i.e., the
850 period during which the cleanups must occur) begin from the time
851 the construction is complete to the end of the function. If we
852 create a conditional block in which to initialize the
853 base-classes, then the cleanup region for the virtual base begins
854 inside a block, and ends outside of that block. This situation
855 confuses the sjlj exception-handling code. Therefore, we do not
856 create a single conditional block, but one for each
857 initialization. (That way the cleanup regions always begin
858 in the outer block.) We trust the back-end to figure out
859 that the FLAG will not change across initializations, and
860 avoid doing multiple tests. */
861 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
862 inner_if_stmt = begin_if_stmt ();
863 finish_if_stmt_cond (flag, inner_if_stmt);
865 /* Compute the location of the virtual base. If we're
866 constructing virtual bases, then we must be the most derived
867 class. Therefore, we don't have to look up the virtual base;
868 we already know where it is. */
869 exp = convert_to_base_statically (current_class_ref, vbase);
871 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
873 finish_then_clause (inner_if_stmt);
874 finish_if_stmt (inner_if_stmt);
876 expand_cleanup_for_base (vbase, flag);
879 /* Find the context in which this FIELD can be initialized. */
882 initializing_context (tree field)
884 tree t = DECL_CONTEXT (field);
886 /* Anonymous union members can be initialized in the first enclosing
887 non-anonymous union context. */
888 while (t && ANON_AGGR_TYPE_P (t))
889 t = TYPE_CONTEXT (t);
893 /* Function to give error message if member initialization specification
894 is erroneous. FIELD is the member we decided to initialize.
895 TYPE is the type for which the initialization is being performed.
896 FIELD must be a member of TYPE.
898 MEMBER_NAME is the name of the member. */
901 member_init_ok_or_else (tree field, tree type, tree member_name)
903 if (field == error_mark_node)
907 error ("class %qT does not have any field named %qD", type,
911 if (TREE_CODE (field) == VAR_DECL)
913 error ("%q#D is a static data member; it can only be "
914 "initialized at its definition",
918 if (TREE_CODE (field) != FIELD_DECL)
920 error ("%q#D is not a non-static data member of %qT",
924 if (initializing_context (field) != type)
926 error ("class %qT does not have any field named %qD", type,
934 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
935 is a _TYPE node or TYPE_DECL which names a base for that type.
936 Check the validity of NAME, and return either the base _TYPE, base
937 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
938 NULL_TREE and issue a diagnostic.
940 An old style unnamed direct single base construction is permitted,
941 where NAME is NULL. */
944 expand_member_init (tree name)
949 if (!current_class_ref)
954 /* This is an obsolete unnamed base class initializer. The
955 parser will already have warned about its use. */
956 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
959 error ("unnamed initializer for %qT, which has no base classes",
963 basetype = BINFO_TYPE
964 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
967 error ("unnamed initializer for %qT, which uses multiple inheritance",
972 else if (TYPE_P (name))
974 basetype = TYPE_MAIN_VARIANT (name);
975 name = TYPE_NAME (name);
977 else if (TREE_CODE (name) == TYPE_DECL)
978 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
980 basetype = NULL_TREE;
989 if (current_template_parms)
992 class_binfo = TYPE_BINFO (current_class_type);
993 direct_binfo = NULL_TREE;
994 virtual_binfo = NULL_TREE;
996 /* Look for a direct base. */
997 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
998 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
1001 /* Look for a virtual base -- unless the direct base is itself
1003 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
1004 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1006 /* [class.base.init]
1008 If a mem-initializer-id is ambiguous because it designates
1009 both a direct non-virtual base class and an inherited virtual
1010 base class, the mem-initializer is ill-formed. */
1011 if (direct_binfo && virtual_binfo)
1013 error ("%qD is both a direct base and an indirect virtual base",
1018 if (!direct_binfo && !virtual_binfo)
1020 if (CLASSTYPE_VBASECLASSES (current_class_type))
1021 error ("type %qT is not a direct or virtual base of %qT",
1022 basetype, current_class_type);
1024 error ("type %qT is not a direct base of %qT",
1025 basetype, current_class_type);
1029 return direct_binfo ? direct_binfo : virtual_binfo;
1033 if (TREE_CODE (name) == IDENTIFIER_NODE)
1034 field = lookup_field (current_class_type, name, 1, false);
1038 if (member_init_ok_or_else (field, current_class_type, name))
1045 /* This is like `expand_member_init', only it stores one aggregate
1048 INIT comes in two flavors: it is either a value which
1049 is to be stored in EXP, or it is a parameter list
1050 to go to a constructor, which will operate on EXP.
1051 If INIT is not a parameter list for a constructor, then set
1052 LOOKUP_ONLYCONVERTING.
1053 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1054 the initializer, if FLAGS is 0, then it is the (init) form.
1055 If `init' is a CONSTRUCTOR, then we emit a warning message,
1056 explaining that such initializations are invalid.
1058 If INIT resolves to a CALL_EXPR which happens to return
1059 something of the type we are looking for, then we know
1060 that we can safely use that call to perform the
1063 The virtual function table pointer cannot be set up here, because
1064 we do not really know its type.
1066 This never calls operator=().
1068 When initializing, nothing is CONST.
1070 A default copy constructor may have to be used to perform the
1073 A constructor or a conversion operator may have to be used to
1074 perform the initialization, but not both, as it would be ambiguous. */
1077 build_aggr_init (tree exp, tree init, int flags)
1082 tree type = TREE_TYPE (exp);
1083 int was_const = TREE_READONLY (exp);
1084 int was_volatile = TREE_THIS_VOLATILE (exp);
1087 if (init == error_mark_node)
1088 return error_mark_node;
1090 TREE_READONLY (exp) = 0;
1091 TREE_THIS_VOLATILE (exp) = 0;
1093 if (init && TREE_CODE (init) != TREE_LIST)
1094 flags |= LOOKUP_ONLYCONVERTING;
1096 if (TREE_CODE (type) == ARRAY_TYPE)
1100 /* An array may not be initialized use the parenthesized
1101 initialization form -- unless the initializer is "()". */
1102 if (init && TREE_CODE (init) == TREE_LIST)
1104 error ("bad array initializer");
1105 return error_mark_node;
1107 /* Must arrange to initialize each element of EXP
1108 from elements of INIT. */
1109 itype = init ? TREE_TYPE (init) : NULL_TREE;
1110 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1111 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1112 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1113 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1114 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1115 /*explicit_default_init_p=*/false,
1116 itype && same_type_p (itype,
1118 TREE_READONLY (exp) = was_const;
1119 TREE_THIS_VOLATILE (exp) = was_volatile;
1120 TREE_TYPE (exp) = type;
1122 TREE_TYPE (init) = itype;
1126 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1127 /* Just know that we've seen something for this node. */
1128 TREE_USED (exp) = 1;
1130 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1131 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1132 destroy_temps = stmts_are_full_exprs_p ();
1133 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1134 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1135 init, LOOKUP_NORMAL|flags);
1136 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1137 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1138 TREE_TYPE (exp) = type;
1139 TREE_READONLY (exp) = was_const;
1140 TREE_THIS_VOLATILE (exp) = was_volatile;
1146 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1148 tree type = TREE_TYPE (exp);
1151 /* It fails because there may not be a constructor which takes
1152 its own type as the first (or only parameter), but which does
1153 take other types via a conversion. So, if the thing initializing
1154 the expression is a unit element of type X, first try X(X&),
1155 followed by initialization by X. If neither of these work
1156 out, then look hard. */
1160 if (init && TREE_CODE (init) != TREE_LIST
1161 && (flags & LOOKUP_ONLYCONVERTING))
1163 /* Base subobjects should only get direct-initialization. */
1164 gcc_assert (true_exp == exp);
1166 if (flags & DIRECT_BIND)
1167 /* Do nothing. We hit this in two cases: Reference initialization,
1168 where we aren't initializing a real variable, so we don't want
1169 to run a new constructor; and catching an exception, where we
1170 have already built up the constructor call so we could wrap it
1171 in an exception region. */;
1172 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1174 /* A brace-enclosed initializer for an aggregate. */
1175 gcc_assert (CP_AGGREGATE_TYPE_P (type));
1176 init = digest_init (type, init);
1179 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1181 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1182 /* We need to protect the initialization of a catch parm with a
1183 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1184 around the TARGET_EXPR for the copy constructor. See
1185 initialize_handler_parm. */
1187 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1188 TREE_OPERAND (init, 0));
1189 TREE_TYPE (init) = void_type_node;
1192 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1193 TREE_SIDE_EFFECTS (init) = 1;
1194 finish_expr_stmt (init);
1198 if (init == NULL_TREE
1199 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1203 init = TREE_VALUE (parms);
1206 parms = build_tree_list (NULL_TREE, init);
1208 if (true_exp == exp)
1209 ctor_name = complete_ctor_identifier;
1211 ctor_name = base_ctor_identifier;
1213 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1214 if (TREE_SIDE_EFFECTS (rval))
1215 finish_expr_stmt (convert_to_void (rval, NULL));
1218 /* This function is responsible for initializing EXP with INIT
1221 BINFO is the binfo of the type for who we are performing the
1222 initialization. For example, if W is a virtual base class of A and B,
1224 If we are initializing B, then W must contain B's W vtable, whereas
1225 were we initializing C, W must contain C's W vtable.
1227 TRUE_EXP is nonzero if it is the true expression being initialized.
1228 In this case, it may be EXP, or may just contain EXP. The reason we
1229 need this is because if EXP is a base element of TRUE_EXP, we
1230 don't necessarily know by looking at EXP where its virtual
1231 baseclass fields should really be pointing. But we do know
1232 from TRUE_EXP. In constructors, we don't know anything about
1233 the value being initialized.
1235 FLAGS is just passed to `build_new_method_call'. See that function
1236 for its description. */
1239 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1241 tree type = TREE_TYPE (exp);
1243 gcc_assert (init != error_mark_node && type != error_mark_node);
1244 gcc_assert (building_stmt_tree ());
1246 /* Use a function returning the desired type to initialize EXP for us.
1247 If the function is a constructor, and its first argument is
1248 NULL_TREE, know that it was meant for us--just slide exp on
1249 in and expand the constructor. Constructors now come
1252 if (init && TREE_CODE (exp) == VAR_DECL
1253 && COMPOUND_LITERAL_P (init))
1255 /* If store_init_value returns NULL_TREE, the INIT has been
1256 recorded as the DECL_INITIAL for EXP. That means there's
1257 nothing more we have to do. */
1258 init = store_init_value (exp, init);
1260 finish_expr_stmt (init);
1264 /* We know that expand_default_init can handle everything we want
1266 expand_default_init (binfo, true_exp, exp, init, flags);
1269 /* Report an error if TYPE is not a user-defined, aggregate type. If
1270 OR_ELSE is nonzero, give an error message. */
1273 is_aggr_type (tree type, int or_else)
1275 if (type == error_mark_node)
1278 if (! IS_AGGR_TYPE (type)
1279 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1280 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1283 error ("%qT is not an aggregate type", type);
1290 get_type_value (tree name)
1292 if (name == error_mark_node)
1295 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1296 return IDENTIFIER_TYPE_VALUE (name);
1301 /* Build a reference to a member of an aggregate. This is not a C++
1302 `&', but really something which can have its address taken, and
1303 then act as a pointer to member, for example TYPE :: FIELD can have
1304 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1305 this expression is the operand of "&".
1307 @@ Prints out lousy diagnostics for operator <typename>
1310 @@ This function should be rewritten and placed in search.c. */
1313 build_offset_ref (tree type, tree member, bool address_p)
1316 tree basebinfo = NULL_TREE;
1318 /* class templates can come in as TEMPLATE_DECLs here. */
1319 if (TREE_CODE (member) == TEMPLATE_DECL)
1322 if (dependent_type_p (type) || type_dependent_expression_p (member))
1323 return build_qualified_name (NULL_TREE, type, member,
1324 /*template_p=*/false);
1326 gcc_assert (TYPE_P (type));
1327 if (! is_aggr_type (type, 1))
1328 return error_mark_node;
1330 gcc_assert (DECL_P (member) || BASELINK_P (member));
1331 /* Callers should call mark_used before this point. */
1332 gcc_assert (!DECL_P (member) || TREE_USED (member));
1334 if (!COMPLETE_TYPE_P (complete_type (type))
1335 && !TYPE_BEING_DEFINED (type))
1337 error ("incomplete type %qT does not have member %qD", type, member);
1338 return error_mark_node;
1341 /* Entities other than non-static members need no further
1343 if (TREE_CODE (member) == TYPE_DECL)
1345 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1346 return convert_from_reference (member);
1348 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1350 error ("invalid pointer to bit-field %qD", member);
1351 return error_mark_node;
1354 /* Set up BASEBINFO for member lookup. */
1355 decl = maybe_dummy_object (type, &basebinfo);
1357 /* A lot of this logic is now handled in lookup_member. */
1358 if (BASELINK_P (member))
1360 /* Go from the TREE_BASELINK to the member function info. */
1361 tree t = BASELINK_FUNCTIONS (member);
1363 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1365 /* Get rid of a potential OVERLOAD around it. */
1366 t = OVL_CURRENT (t);
1368 /* Unique functions are handled easily. */
1370 /* For non-static member of base class, we need a special rule
1371 for access checking [class.protected]:
1373 If the access is to form a pointer to member, the
1374 nested-name-specifier shall name the derived class
1375 (or any class derived from that class). */
1376 if (address_p && DECL_P (t)
1377 && DECL_NONSTATIC_MEMBER_P (t))
1378 perform_or_defer_access_check (TYPE_BINFO (type), t);
1380 perform_or_defer_access_check (basebinfo, t);
1382 if (DECL_STATIC_FUNCTION_P (t))
1387 TREE_TYPE (member) = unknown_type_node;
1389 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1390 /* We need additional test besides the one in
1391 check_accessibility_of_qualified_id in case it is
1392 a pointer to non-static member. */
1393 perform_or_defer_access_check (TYPE_BINFO (type), member);
1397 /* If MEMBER is non-static, then the program has fallen afoul of
1400 An id-expression that denotes a nonstatic data member or
1401 nonstatic member function of a class can only be used:
1403 -- as part of a class member access (_expr.ref_) in which the
1404 object-expression refers to the member's class or a class
1405 derived from that class, or
1407 -- to form a pointer to member (_expr.unary.op_), or
1409 -- in the body of a nonstatic member function of that class or
1410 of a class derived from that class (_class.mfct.nonstatic_), or
1412 -- in a mem-initializer for a constructor for that class or for
1413 a class derived from that class (_class.base.init_). */
1414 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1416 /* Build a representation of a the qualified name suitable
1417 for use as the operand to "&" -- even though the "&" is
1418 not actually present. */
1419 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1420 /* In Microsoft mode, treat a non-static member function as if
1421 it were a pointer-to-member. */
1422 if (flag_ms_extensions)
1424 PTRMEM_OK_P (member) = 1;
1425 return build_unary_op (ADDR_EXPR, member, 0);
1427 error ("invalid use of non-static member function %qD",
1428 TREE_OPERAND (member, 1));
1431 else if (TREE_CODE (member) == FIELD_DECL)
1433 error ("invalid use of non-static data member %qD", member);
1434 return error_mark_node;
1439 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1440 PTRMEM_OK_P (member) = 1;
1444 /* If DECL is a scalar enumeration constant or variable with a
1445 constant initializer, return the initializer (or, its initializers,
1446 recursively); otherwise, return DECL. If INTEGRAL_P, the
1447 initializer is only returned if DECL is an integral
1448 constant-expression. */
1451 constant_value_1 (tree decl, bool integral_p)
1453 while (TREE_CODE (decl) == CONST_DECL
1455 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl)
1456 : (TREE_CODE (decl) == VAR_DECL
1457 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))))
1460 /* Static data members in template classes may have
1461 non-dependent initializers. References to such non-static
1462 data members are not value-dependent, so we must retrieve the
1463 initializer here. The DECL_INITIAL will have the right type,
1464 but will not have been folded because that would prevent us
1465 from performing all appropriate semantic checks at
1466 instantiation time. */
1467 if (DECL_CLASS_SCOPE_P (decl)
1468 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl))
1469 && uses_template_parms (CLASSTYPE_TI_ARGS
1470 (DECL_CONTEXT (decl))))
1472 ++processing_template_decl;
1473 init = fold_non_dependent_expr (DECL_INITIAL (decl));
1474 --processing_template_decl;
1478 /* If DECL is a static data member in a template
1479 specialization, we must instantiate it here. The
1480 initializer for the static data member is not processed
1481 until needed; we need it now. */
1483 init = DECL_INITIAL (decl);
1485 if (init == error_mark_node)
1486 return error_mark_node;
1488 || !TREE_TYPE (init)
1490 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init))
1491 : (!TREE_CONSTANT (init)
1492 /* Do not return an aggregate constant (of which
1493 string literals are a special case), as we do not
1494 want to make inadvertent copies of such entities,
1495 and we must be sure that their addresses are the
1497 || TREE_CODE (init) == CONSTRUCTOR
1498 || TREE_CODE (init) == STRING_CST)))
1500 decl = unshare_expr (init);
1505 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1506 constant of integral or enumeration type, then return that value.
1507 These are those variables permitted in constant expressions by
1511 integral_constant_value (tree decl)
1513 return constant_value_1 (decl, /*integral_p=*/true);
1516 /* A more relaxed version of integral_constant_value, used by the
1517 common C/C++ code and by the C++ front-end for optimization
1521 decl_constant_value (tree decl)
1523 return constant_value_1 (decl,
1524 /*integral_p=*/processing_template_decl);
1527 /* Common subroutines of build_new and build_vec_delete. */
1529 /* Call the global __builtin_delete to delete ADDR. */
1532 build_builtin_delete_call (tree addr)
1534 mark_used (global_delete_fndecl);
1535 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1538 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1539 the type of the object being allocated; otherwise, it's just TYPE.
1540 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1541 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1542 the TREE_LIST of arguments to be provided as arguments to a
1543 placement new operator. This routine performs no semantic checks;
1544 it just creates and returns a NEW_EXPR. */
1547 build_raw_new_expr (tree placement, tree type, tree nelts, tree init,
1552 new_expr = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1554 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new;
1555 TREE_SIDE_EFFECTS (new_expr) = 1;
1560 /* Generate code for a new-expression, including calling the "operator
1561 new" function, initializing the object, and, if an exception occurs
1562 during construction, cleaning up. The arguments are as for
1563 build_raw_new_expr. */
1566 build_new_1 (tree placement, tree type, tree nelts, tree init,
1567 bool globally_qualified_p)
1571 /* True iff this is a call to "operator new[]" instead of just
1573 bool array_p = false;
1574 /* True iff ARRAY_P is true and the bound of the array type is
1575 not necessarily a compile time constant. For example, VLA_P is
1576 true for "new int[f()]". */
1578 /* The type being allocated. If ARRAY_P is true, this will be an
1581 /* If ARRAY_P is true, the element type of the array. This is an
1582 never ARRAY_TYPE; for something like "new int[3][4]", the
1583 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1586 /* The type of the new-expression. (This type is always a pointer
1589 /* A pointer type pointing to the FULL_TYPE. */
1590 tree full_pointer_type;
1591 tree outer_nelts = NULL_TREE;
1592 tree alloc_call, alloc_expr;
1593 /* The address returned by the call to "operator new". This node is
1594 a VAR_DECL and is therefore reusable. */
1597 tree cookie_expr, init_expr;
1598 int nothrow, check_new;
1599 int use_java_new = 0;
1600 /* If non-NULL, the number of extra bytes to allocate at the
1601 beginning of the storage allocated for an array-new expression in
1602 order to store the number of elements. */
1603 tree cookie_size = NULL_TREE;
1604 /* True if the function we are calling is a placement allocation
1606 bool placement_allocation_fn_p;
1607 tree args = NULL_TREE;
1608 /* True if the storage must be initialized, either by a constructor
1609 or due to an explicit new-initializer. */
1610 bool is_initialized;
1611 /* The address of the thing allocated, not including any cookie. In
1612 particular, if an array cookie is in use, DATA_ADDR is the
1613 address of the first array element. This node is a VAR_DECL, and
1614 is therefore reusable. */
1616 tree init_preeval_expr = NULL_TREE;
1622 outer_nelts = nelts;
1625 /* ??? The middle-end will error on us for building a VLA outside a
1626 function context. Methinks that's not it's purvey. So we'll do
1627 our own VLA layout later. */
1629 full_type = build_cplus_array_type (type, NULL_TREE);
1630 index = convert (sizetype, nelts);
1631 index = size_binop (MINUS_EXPR, index, size_one_node);
1632 TYPE_DOMAIN (full_type) = build_index_type (index);
1637 if (TREE_CODE (type) == ARRAY_TYPE)
1640 nelts = array_type_nelts_top (type);
1641 outer_nelts = nelts;
1642 type = TREE_TYPE (type);
1646 if (!complete_type_or_else (type, NULL_TREE))
1647 return error_mark_node;
1649 /* If our base type is an array, then make sure we know how many elements
1651 for (elt_type = type;
1652 TREE_CODE (elt_type) == ARRAY_TYPE;
1653 elt_type = TREE_TYPE (elt_type))
1654 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1655 array_type_nelts_top (elt_type));
1657 if (TREE_CODE (elt_type) == VOID_TYPE)
1659 error ("invalid type %<void%> for new");
1660 return error_mark_node;
1663 if (abstract_virtuals_error (NULL_TREE, elt_type))
1664 return error_mark_node;
1666 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1667 if (CP_TYPE_CONST_P (elt_type) && !is_initialized)
1669 error ("uninitialized const in %<new%> of %q#T", elt_type);
1670 return error_mark_node;
1673 size = size_in_bytes (elt_type);
1676 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1681 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1682 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1683 ...>> to be valid. */
1684 TYPE_SIZE_UNIT (full_type) = size;
1685 n = convert (bitsizetype, nelts);
1686 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1687 TYPE_SIZE (full_type) = bitsize;
1691 alloc_fn = NULL_TREE;
1693 /* Allocate the object. */
1694 if (! placement && TYPE_FOR_JAVA (elt_type))
1697 tree class_decl = build_java_class_ref (elt_type);
1698 static const char alloc_name[] = "_Jv_AllocObject";
1701 if (!get_global_value_if_present (get_identifier (alloc_name),
1704 error ("call to Java constructor with %qs undefined", alloc_name);
1705 return error_mark_node;
1707 else if (really_overloaded_fn (alloc_fn))
1709 error ("%qD should never be overloaded", alloc_fn);
1710 return error_mark_node;
1712 alloc_fn = OVL_CURRENT (alloc_fn);
1713 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1714 alloc_call = (build_function_call
1716 build_tree_list (NULL_TREE, class_addr)));
1723 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1725 if (!globally_qualified_p
1726 && CLASS_TYPE_P (elt_type)
1728 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1729 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1731 /* Use a class-specific operator new. */
1732 /* If a cookie is required, add some extra space. */
1733 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1735 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1736 size = size_binop (PLUS_EXPR, size, cookie_size);
1738 /* Create the argument list. */
1739 args = tree_cons (NULL_TREE, size, placement);
1740 /* Do name-lookup to find the appropriate operator. */
1741 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1742 if (fns == NULL_TREE)
1744 error ("no suitable %qD found in class %qT", fnname, elt_type);
1745 return error_mark_node;
1747 if (TREE_CODE (fns) == TREE_LIST)
1749 error ("request for member %qD is ambiguous", fnname);
1750 print_candidates (fns);
1751 return error_mark_node;
1753 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1755 /*conversion_path=*/NULL_TREE,
1761 /* Use a global operator new. */
1762 /* See if a cookie might be required. */
1763 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1764 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1766 cookie_size = NULL_TREE;
1768 alloc_call = build_operator_new_call (fnname, placement,
1769 &size, &cookie_size,
1774 if (alloc_call == error_mark_node)
1775 return error_mark_node;
1777 gcc_assert (alloc_fn != NULL_TREE);
1779 /* In the simple case, we can stop now. */
1780 pointer_type = build_pointer_type (type);
1781 if (!cookie_size && !is_initialized)
1782 return build_nop (pointer_type, alloc_call);
1784 /* While we're working, use a pointer to the type we've actually
1785 allocated. Store the result of the call in a variable so that we
1786 can use it more than once. */
1787 full_pointer_type = build_pointer_type (full_type);
1788 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1789 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1791 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1792 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1793 alloc_call = TREE_OPERAND (alloc_call, 1);
1795 /* Now, check to see if this function is actually a placement
1796 allocation function. This can happen even when PLACEMENT is NULL
1797 because we might have something like:
1799 struct S { void* operator new (size_t, int i = 0); };
1801 A call to `new S' will get this allocation function, even though
1802 there is no explicit placement argument. If there is more than
1803 one argument, or there are variable arguments, then this is a
1804 placement allocation function. */
1805 placement_allocation_fn_p
1806 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1807 || varargs_function_p (alloc_fn));
1809 /* Preevaluate the placement args so that we don't reevaluate them for a
1810 placement delete. */
1811 if (placement_allocation_fn_p)
1814 stabilize_call (alloc_call, &inits);
1816 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1820 /* unless an allocation function is declared with an empty excep-
1821 tion-specification (_except.spec_), throw(), it indicates failure to
1822 allocate storage by throwing a bad_alloc exception (clause _except_,
1823 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1824 cation function is declared with an empty exception-specification,
1825 throw(), it returns null to indicate failure to allocate storage and a
1826 non-null pointer otherwise.
1828 So check for a null exception spec on the op new we just called. */
1830 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
1831 check_new = (flag_check_new || nothrow) && ! use_java_new;
1838 /* Adjust so we're pointing to the start of the object. */
1839 data_addr = get_target_expr (build2 (PLUS_EXPR, full_pointer_type,
1840 alloc_node, cookie_size));
1842 /* Store the number of bytes allocated so that we can know how
1843 many elements to destroy later. We use the last sizeof
1844 (size_t) bytes to store the number of elements. */
1845 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
1846 data_addr, size_in_bytes (sizetype));
1847 cookie = build_indirect_ref (cookie_ptr, NULL);
1849 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
1851 if (targetm.cxx.cookie_has_size ())
1853 /* Also store the element size. */
1854 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
1855 cookie_ptr, size_in_bytes (sizetype));
1856 cookie = build_indirect_ref (cookie_ptr, NULL);
1857 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
1858 size_in_bytes(elt_type));
1859 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
1860 cookie, cookie_expr);
1862 data_addr = TARGET_EXPR_SLOT (data_addr);
1866 cookie_expr = NULL_TREE;
1867 data_addr = alloc_node;
1870 /* Now initialize the allocated object. Note that we preevaluate the
1871 initialization expression, apart from the actual constructor call or
1872 assignment--we do this because we want to delay the allocation as long
1873 as possible in order to minimize the size of the exception region for
1874 placement delete. */
1879 init_expr = build_indirect_ref (data_addr, NULL);
1883 bool explicit_default_init_p = false;
1885 if (init == void_zero_node)
1888 explicit_default_init_p = true;
1891 pedwarn ("ISO C++ forbids initialization in array new");
1894 = build_vec_init (init_expr,
1895 cp_build_binary_op (MINUS_EXPR, outer_nelts,
1898 explicit_default_init_p,
1901 /* An array initialization is stable because the initialization
1902 of each element is a full-expression, so the temporaries don't
1908 if (init == void_zero_node)
1909 init = build_default_init (full_type, nelts);
1911 if (TYPE_NEEDS_CONSTRUCTING (type))
1913 init_expr = build_special_member_call (init_expr,
1914 complete_ctor_identifier,
1917 stable = stabilize_init (init_expr, &init_preeval_expr);
1921 /* We are processing something like `new int (10)', which
1922 means allocate an int, and initialize it with 10. */
1924 if (TREE_CODE (init) == TREE_LIST)
1925 init = build_x_compound_expr_from_list (init,
1928 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
1929 || TREE_TYPE (init) != NULL_TREE);
1931 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
1932 stable = stabilize_init (init_expr, &init_preeval_expr);
1936 if (init_expr == error_mark_node)
1937 return error_mark_node;
1939 /* If any part of the object initialization terminates by throwing an
1940 exception and a suitable deallocation function can be found, the
1941 deallocation function is called to free the memory in which the
1942 object was being constructed, after which the exception continues
1943 to propagate in the context of the new-expression. If no
1944 unambiguous matching deallocation function can be found,
1945 propagating the exception does not cause the object's memory to be
1947 if (flag_exceptions && ! use_java_new)
1949 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
1952 /* The Standard is unclear here, but the right thing to do
1953 is to use the same method for finding deallocation
1954 functions that we use for finding allocation functions. */
1955 cleanup = build_op_delete_call (dcode, alloc_node, size,
1956 globally_qualified_p,
1957 (placement_allocation_fn_p
1958 ? alloc_call : NULL_TREE),
1959 (placement_allocation_fn_p
1960 ? alloc_fn : NULL_TREE));
1965 /* This is much simpler if we were able to preevaluate all of
1966 the arguments to the constructor call. */
1967 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
1968 init_expr, cleanup);
1970 /* Ack! First we allocate the memory. Then we set our sentry
1971 variable to true, and expand a cleanup that deletes the
1972 memory if sentry is true. Then we run the constructor, and
1973 finally clear the sentry.
1975 We need to do this because we allocate the space first, so
1976 if there are any temporaries with cleanups in the
1977 constructor args and we weren't able to preevaluate them, we
1978 need this EH region to extend until end of full-expression
1979 to preserve nesting. */
1981 tree end, sentry, begin;
1983 begin = get_target_expr (boolean_true_node);
1984 CLEANUP_EH_ONLY (begin) = 1;
1986 sentry = TARGET_EXPR_SLOT (begin);
1988 TARGET_EXPR_CLEANUP (begin)
1989 = build3 (COND_EXPR, void_type_node, sentry,
1990 cleanup, void_zero_node);
1992 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
1993 sentry, boolean_false_node);
1996 = build2 (COMPOUND_EXPR, void_type_node, begin,
1997 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2004 init_expr = NULL_TREE;
2006 /* Now build up the return value in reverse order. */
2011 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2013 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2015 if (rval == alloc_node)
2016 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2017 and return the call (which doesn't need to be adjusted). */
2018 rval = TARGET_EXPR_INITIAL (alloc_expr);
2023 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2025 rval = build_conditional_expr (ifexp, rval, alloc_node);
2028 /* Perform the allocation before anything else, so that ALLOC_NODE
2029 has been initialized before we start using it. */
2030 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2033 if (init_preeval_expr)
2034 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2036 /* Convert to the final type. */
2037 rval = build_nop (pointer_type, rval);
2039 /* A new-expression is never an lvalue. */
2040 gcc_assert (!lvalue_p (rval));
2045 /* Generate a representation for a C++ "new" expression. PLACEMENT is
2046 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
2047 NELTS is NULL, TYPE is the type of the storage to be allocated. If
2048 NELTS is not NULL, then this is an array-new allocation; TYPE is
2049 the type of the elements in the array and NELTS is the number of
2050 elements in the array. INIT, if non-NULL, is the initializer for
2051 the new object, or void_zero_node to indicate an initializer of
2052 "()". If USE_GLOBAL_NEW is true, then the user explicitly wrote
2053 "::new" rather than just "new". */
2056 build_new (tree placement, tree type, tree nelts, tree init,
2060 tree orig_placement;
2064 if (type == error_mark_node)
2065 return error_mark_node;
2067 orig_placement = placement;
2071 if (processing_template_decl)
2073 if (dependent_type_p (type)
2074 || any_type_dependent_arguments_p (placement)
2075 || (nelts && type_dependent_expression_p (nelts))
2076 || (init != void_zero_node
2077 && any_type_dependent_arguments_p (init)))
2078 return build_raw_new_expr (placement, type, nelts, init,
2080 placement = build_non_dependent_args (placement);
2082 nelts = build_non_dependent_expr (nelts);
2083 if (init != void_zero_node)
2084 init = build_non_dependent_args (init);
2089 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
2090 pedwarn ("size in array new must have integral type");
2091 nelts = save_expr (cp_convert (sizetype, nelts));
2092 if (nelts == integer_zero_node)
2093 warning (0, "zero size array reserves no space");
2096 /* ``A reference cannot be created by the new operator. A reference
2097 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2098 returned by new.'' ARM 5.3.3 */
2099 if (TREE_CODE (type) == REFERENCE_TYPE)
2101 error ("new cannot be applied to a reference type");
2102 type = TREE_TYPE (type);
2105 if (TREE_CODE (type) == FUNCTION_TYPE)
2107 error ("new cannot be applied to a function type");
2108 return error_mark_node;
2111 rval = build_new_1 (placement, type, nelts, init, use_global_new);
2112 if (rval == error_mark_node)
2113 return error_mark_node;
2115 if (processing_template_decl)
2116 return build_raw_new_expr (orig_placement, type, orig_nelts, orig_init,
2119 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2120 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2121 TREE_NO_WARNING (rval) = 1;
2126 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2129 build_java_class_ref (tree type)
2131 tree name = NULL_TREE, class_decl;
2132 static tree CL_suffix = NULL_TREE;
2133 if (CL_suffix == NULL_TREE)
2134 CL_suffix = get_identifier("class$");
2135 if (jclass_node == NULL_TREE)
2137 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2138 if (jclass_node == NULL_TREE)
2139 fatal_error ("call to Java constructor, while %<jclass%> undefined");
2141 jclass_node = TREE_TYPE (jclass_node);
2144 /* Mangle the class$ field. */
2147 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2148 if (DECL_NAME (field) == CL_suffix)
2150 mangle_decl (field);
2151 name = DECL_ASSEMBLER_NAME (field);
2155 internal_error ("can't find class$");
2158 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2159 if (class_decl == NULL_TREE)
2161 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2162 TREE_STATIC (class_decl) = 1;
2163 DECL_EXTERNAL (class_decl) = 1;
2164 TREE_PUBLIC (class_decl) = 1;
2165 DECL_ARTIFICIAL (class_decl) = 1;
2166 DECL_IGNORED_P (class_decl) = 1;
2167 pushdecl_top_level (class_decl);
2168 make_decl_rtl (class_decl);
2174 build_vec_delete_1 (tree base, tree maxindex, tree type,
2175 special_function_kind auto_delete_vec, int use_global_delete)
2178 tree ptype = build_pointer_type (type = complete_type (type));
2179 tree size_exp = size_in_bytes (type);
2181 /* Temporary variables used by the loop. */
2182 tree tbase, tbase_init;
2184 /* This is the body of the loop that implements the deletion of a
2185 single element, and moves temp variables to next elements. */
2188 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2191 /* This is the thing that governs what to do after the loop has run. */
2192 tree deallocate_expr = 0;
2194 /* This is the BIND_EXPR which holds the outermost iterator of the
2195 loop. It is convenient to set this variable up and test it before
2196 executing any other code in the loop.
2197 This is also the containing expression returned by this function. */
2198 tree controller = NULL_TREE;
2200 /* We should only have 1-D arrays here. */
2201 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2203 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2206 /* The below is short by the cookie size. */
2207 virtual_size = size_binop (MULT_EXPR, size_exp,
2208 convert (sizetype, maxindex));
2210 tbase = create_temporary_var (ptype);
2211 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2212 fold_build2 (PLUS_EXPR, ptype,
2215 DECL_REGISTER (tbase) = 1;
2216 controller = build3 (BIND_EXPR, void_type_node, tbase,
2217 NULL_TREE, NULL_TREE);
2218 TREE_SIDE_EFFECTS (controller) = 1;
2220 body = build1 (EXIT_EXPR, void_type_node,
2221 build2 (EQ_EXPR, boolean_type_node, tbase,
2222 fold_convert (ptype, base)));
2223 body = build_compound_expr
2224 (body, build_modify_expr (tbase, NOP_EXPR,
2225 build2 (MINUS_EXPR, ptype, tbase, size_exp)));
2226 body = build_compound_expr
2227 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2228 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2230 loop = build1 (LOOP_EXPR, void_type_node, body);
2231 loop = build_compound_expr (tbase_init, loop);
2234 /* If the delete flag is one, or anything else with the low bit set,
2235 delete the storage. */
2236 if (auto_delete_vec != sfk_base_destructor)
2240 /* The below is short by the cookie size. */
2241 virtual_size = size_binop (MULT_EXPR, size_exp,
2242 convert (sizetype, maxindex));
2244 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2251 cookie_size = targetm.cxx.get_cookie_size (type);
2253 = cp_convert (ptype,
2254 cp_build_binary_op (MINUS_EXPR,
2255 cp_convert (string_type_node,
2258 /* True size with header. */
2259 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2262 if (auto_delete_vec == sfk_deleting_destructor)
2263 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR,
2264 base_tbd, virtual_size,
2265 use_global_delete & 1,
2266 /*placement=*/NULL_TREE,
2267 /*alloc_fn=*/NULL_TREE);
2271 if (!deallocate_expr)
2274 body = deallocate_expr;
2276 body = build_compound_expr (body, deallocate_expr);
2279 body = integer_zero_node;
2281 /* Outermost wrapper: If pointer is null, punt. */
2282 body = fold_build3 (COND_EXPR, void_type_node,
2283 fold_build2 (NE_EXPR, boolean_type_node, base,
2284 convert (TREE_TYPE (base),
2285 integer_zero_node)),
2286 body, integer_zero_node);
2287 body = build1 (NOP_EXPR, void_type_node, body);
2291 TREE_OPERAND (controller, 1) = body;
2295 if (TREE_CODE (base) == SAVE_EXPR)
2296 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2297 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2299 return convert_to_void (body, /*implicit=*/NULL);
2302 /* Create an unnamed variable of the indicated TYPE. */
2305 create_temporary_var (tree type)
2309 decl = build_decl (VAR_DECL, NULL_TREE, type);
2310 TREE_USED (decl) = 1;
2311 DECL_ARTIFICIAL (decl) = 1;
2312 DECL_IGNORED_P (decl) = 1;
2313 DECL_SOURCE_LOCATION (decl) = input_location;
2314 DECL_CONTEXT (decl) = current_function_decl;
2319 /* Create a new temporary variable of the indicated TYPE, initialized
2322 It is not entered into current_binding_level, because that breaks
2323 things when it comes time to do final cleanups (which take place
2324 "outside" the binding contour of the function). */
2327 get_temp_regvar (tree type, tree init)
2331 decl = create_temporary_var (type);
2332 add_decl_expr (decl);
2334 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2339 /* `build_vec_init' returns tree structure that performs
2340 initialization of a vector of aggregate types.
2342 BASE is a reference to the vector, of ARRAY_TYPE.
2343 MAXINDEX is the maximum index of the array (one less than the
2344 number of elements). It is only used if
2345 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2347 INIT is the (possibly NULL) initializer.
2349 If EXPLICIT_DEFAULT_INIT_P is true, then INIT must be NULL. All
2350 elements in the array are default-initialized.
2352 FROM_ARRAY is 0 if we should init everything with INIT
2353 (i.e., every element initialized from INIT).
2354 FROM_ARRAY is 1 if we should index into INIT in parallel
2355 with initialization of DECL.
2356 FROM_ARRAY is 2 if we should index into INIT in parallel,
2357 but use assignment instead of initialization. */
2360 build_vec_init (tree base, tree maxindex, tree init,
2361 bool explicit_default_init_p,
2365 tree base2 = NULL_TREE;
2367 tree itype = NULL_TREE;
2369 /* The type of the array. */
2370 tree atype = TREE_TYPE (base);
2371 /* The type of an element in the array. */
2372 tree type = TREE_TYPE (atype);
2373 /* The element type reached after removing all outer array
2375 tree inner_elt_type;
2376 /* The type of a pointer to an element in the array. */
2381 tree try_block = NULL_TREE;
2382 int num_initialized_elts = 0;
2385 if (TYPE_DOMAIN (atype))
2386 maxindex = array_type_nelts (atype);
2388 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2389 return error_mark_node;
2391 if (explicit_default_init_p)
2394 inner_elt_type = strip_array_types (atype);
2397 ? (!CLASS_TYPE_P (inner_elt_type)
2398 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2399 : !TYPE_NEEDS_CONSTRUCTING (type))
2400 && ((TREE_CODE (init) == CONSTRUCTOR
2401 /* Don't do this if the CONSTRUCTOR might contain something
2402 that might throw and require us to clean up. */
2403 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2404 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2407 /* Do non-default initialization of POD arrays resulting from
2408 brace-enclosed initializers. In this case, digest_init and
2409 store_constructor will handle the semantics for us. */
2411 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2415 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2416 ptype = build_pointer_type (type);
2417 size = size_in_bytes (type);
2418 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2419 base = cp_convert (ptype, decay_conversion (base));
2421 /* The code we are generating looks like:
2425 ptrdiff_t iterator = maxindex;
2427 for (; iterator != -1; --iterator) {
2428 ... initialize *t1 ...
2432 ... destroy elements that were constructed ...
2437 We can omit the try and catch blocks if we know that the
2438 initialization will never throw an exception, or if the array
2439 elements do not have destructors. We can omit the loop completely if
2440 the elements of the array do not have constructors.
2442 We actually wrap the entire body of the above in a STMT_EXPR, for
2445 When copying from array to another, when the array elements have
2446 only trivial copy constructors, we should use __builtin_memcpy
2447 rather than generating a loop. That way, we could take advantage
2448 of whatever cleverness the back-end has for dealing with copies
2449 of blocks of memory. */
2451 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2452 destroy_temps = stmts_are_full_exprs_p ();
2453 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2454 rval = get_temp_regvar (ptype, base);
2455 base = get_temp_regvar (ptype, rval);
2456 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2458 /* Protect the entire array initialization so that we can destroy
2459 the partially constructed array if an exception is thrown.
2460 But don't do this if we're assigning. */
2461 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2464 try_block = begin_try_block ();
2467 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2469 /* Do non-default initialization of non-POD arrays resulting from
2470 brace-enclosed initializers. */
2471 unsigned HOST_WIDE_INT idx;
2475 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2477 tree baseref = build1 (INDIRECT_REF, type, base);
2479 num_initialized_elts++;
2481 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2482 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2483 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2485 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2487 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2489 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2490 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2493 /* Clear out INIT so that we don't get confused below. */
2496 else if (from_array)
2498 /* If initializing one array from another, initialize element by
2499 element. We rely upon the below calls the do argument
2503 base2 = decay_conversion (init);
2504 itype = TREE_TYPE (base2);
2505 base2 = get_temp_regvar (itype, base2);
2506 itype = TREE_TYPE (itype);
2508 else if (TYPE_LANG_SPECIFIC (type)
2509 && TYPE_NEEDS_CONSTRUCTING (type)
2510 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2512 error ("initializer ends prematurely");
2513 return error_mark_node;
2517 /* Now, default-initialize any remaining elements. We don't need to
2518 do that if a) the type does not need constructing, or b) we've
2519 already initialized all the elements.
2521 We do need to keep going if we're copying an array. */
2524 || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_default_init_p)
2525 && ! (host_integerp (maxindex, 0)
2526 && (num_initialized_elts
2527 == tree_low_cst (maxindex, 0) + 1))))
2529 /* If the ITERATOR is equal to -1, then we don't have to loop;
2530 we've already initialized all the elements. */
2535 for_stmt = begin_for_stmt ();
2536 finish_for_init_stmt (for_stmt);
2537 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator,
2538 build_int_cst (TREE_TYPE (iterator), -1)),
2540 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2543 to = build1 (INDIRECT_REF, type, base);
2550 from = build1 (INDIRECT_REF, itype, base2);
2554 if (from_array == 2)
2555 elt_init = build_modify_expr (to, NOP_EXPR, from);
2556 else if (TYPE_NEEDS_CONSTRUCTING (type))
2557 elt_init = build_aggr_init (to, from, 0);
2559 elt_init = build_modify_expr (to, NOP_EXPR, from);
2563 else if (TREE_CODE (type) == ARRAY_TYPE)
2567 ("cannot initialize multi-dimensional array with initializer");
2568 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2570 /*explicit_default_init_p=*/false,
2573 else if (!TYPE_NEEDS_CONSTRUCTING (type))
2574 elt_init = (build_modify_expr
2576 build_zero_init (type, size_one_node,
2577 /*static_storage_p=*/false)));
2579 elt_init = build_aggr_init (to, init, 0);
2581 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2582 finish_expr_stmt (elt_init);
2583 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2585 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2587 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2589 finish_for_stmt (for_stmt);
2592 /* Make sure to cleanup any partially constructed elements. */
2593 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2597 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2599 /* Flatten multi-dimensional array since build_vec_delete only
2600 expects one-dimensional array. */
2601 if (TREE_CODE (type) == ARRAY_TYPE)
2602 m = cp_build_binary_op (MULT_EXPR, m,
2603 array_type_nelts_total (type));
2605 finish_cleanup_try_block (try_block);
2606 e = build_vec_delete_1 (rval, m,
2607 inner_elt_type, sfk_base_destructor,
2608 /*use_global_delete=*/0);
2609 finish_cleanup (e, try_block);
2612 /* The value of the array initialization is the array itself, RVAL
2613 is a pointer to the first element. */
2614 finish_stmt_expr_expr (rval, stmt_expr);
2616 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2618 /* Now convert make the result have the correct type. */
2619 atype = build_pointer_type (atype);
2620 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2621 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2623 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2627 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2631 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2637 case sfk_complete_destructor:
2638 name = complete_dtor_identifier;
2641 case sfk_base_destructor:
2642 name = base_dtor_identifier;
2645 case sfk_deleting_destructor:
2646 name = deleting_dtor_identifier;
2652 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2653 return build_new_method_call (exp, fn,
2655 /*conversion_path=*/NULL_TREE,
2660 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2661 ADDR is an expression which yields the store to be destroyed.
2662 AUTO_DELETE is the name of the destructor to call, i.e., either
2663 sfk_complete_destructor, sfk_base_destructor, or
2664 sfk_deleting_destructor.
2666 FLAGS is the logical disjunction of zero or more LOOKUP_
2667 flags. See cp-tree.h for more info. */
2670 build_delete (tree type, tree addr, special_function_kind auto_delete,
2671 int flags, int use_global_delete)
2675 if (addr == error_mark_node)
2676 return error_mark_node;
2678 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2679 set to `error_mark_node' before it gets properly cleaned up. */
2680 if (type == error_mark_node)
2681 return error_mark_node;
2683 type = TYPE_MAIN_VARIANT (type);
2685 if (TREE_CODE (type) == POINTER_TYPE)
2687 bool complete_p = true;
2689 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2690 if (TREE_CODE (type) == ARRAY_TYPE)
2693 /* We don't want to warn about delete of void*, only other
2694 incomplete types. Deleting other incomplete types
2695 invokes undefined behavior, but it is not ill-formed, so
2696 compile to something that would even do The Right Thing
2697 (TM) should the type have a trivial dtor and no delete
2699 if (!VOID_TYPE_P (type))
2701 complete_type (type);
2702 if (!COMPLETE_TYPE_P (type))
2704 warning (0, "possible problem detected in invocation of "
2705 "delete operator:");
2706 cxx_incomplete_type_diagnostic (addr, type, 1);
2707 inform ("neither the destructor nor the class-specific "
2708 "operator delete will be called, even if they are "
2709 "declared when the class is defined.");
2713 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2714 /* Call the builtin operator delete. */
2715 return build_builtin_delete_call (addr);
2716 if (TREE_SIDE_EFFECTS (addr))
2717 addr = save_expr (addr);
2719 /* Throw away const and volatile on target type of addr. */
2720 addr = convert_force (build_pointer_type (type), addr, 0);
2722 else if (TREE_CODE (type) == ARRAY_TYPE)
2726 if (TYPE_DOMAIN (type) == NULL_TREE)
2728 error ("unknown array size in delete");
2729 return error_mark_node;
2731 return build_vec_delete (addr, array_type_nelts (type),
2732 auto_delete, use_global_delete);
2736 /* Don't check PROTECT here; leave that decision to the
2737 destructor. If the destructor is accessible, call it,
2738 else report error. */
2739 addr = build_unary_op (ADDR_EXPR, addr, 0);
2740 if (TREE_SIDE_EFFECTS (addr))
2741 addr = save_expr (addr);
2743 addr = convert_force (build_pointer_type (type), addr, 0);
2746 gcc_assert (IS_AGGR_TYPE (type));
2748 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2750 if (auto_delete != sfk_deleting_destructor)
2751 return void_zero_node;
2753 return build_op_delete_call (DELETE_EXPR, addr,
2754 cxx_sizeof_nowarn (type),
2756 /*placement=*/NULL_TREE,
2757 /*alloc_fn=*/NULL_TREE);
2761 tree do_delete = NULL_TREE;
2764 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
2765 lazily_declare_fn (sfk_destructor, type);
2767 /* For `::delete x', we must not use the deleting destructor
2768 since then we would not be sure to get the global `operator
2770 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2772 /* We will use ADDR multiple times so we must save it. */
2773 addr = save_expr (addr);
2774 /* Delete the object. */
2775 do_delete = build_builtin_delete_call (addr);
2776 /* Otherwise, treat this like a complete object destructor
2778 auto_delete = sfk_complete_destructor;
2780 /* If the destructor is non-virtual, there is no deleting
2781 variant. Instead, we must explicitly call the appropriate
2782 `operator delete' here. */
2783 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2784 && auto_delete == sfk_deleting_destructor)
2786 /* We will use ADDR multiple times so we must save it. */
2787 addr = save_expr (addr);
2788 /* Build the call. */
2789 do_delete = build_op_delete_call (DELETE_EXPR,
2791 cxx_sizeof_nowarn (type),
2793 /*placement=*/NULL_TREE,
2794 /*alloc_fn=*/NULL_TREE);
2795 /* Call the complete object destructor. */
2796 auto_delete = sfk_complete_destructor;
2798 else if (auto_delete == sfk_deleting_destructor
2799 && TYPE_GETS_REG_DELETE (type))
2801 /* Make sure we have access to the member op delete, even though
2802 we'll actually be calling it from the destructor. */
2803 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2805 /*placement=*/NULL_TREE,
2806 /*alloc_fn=*/NULL_TREE);
2809 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2810 auto_delete, flags);
2812 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
2814 if (flags & LOOKUP_DESTRUCTOR)
2815 /* Explicit destructor call; don't check for null pointer. */
2816 ifexp = integer_one_node;
2818 /* Handle deleting a null pointer. */
2819 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2821 if (ifexp != integer_one_node)
2822 expr = build3 (COND_EXPR, void_type_node,
2823 ifexp, expr, void_zero_node);
2829 /* At the beginning of a destructor, push cleanups that will call the
2830 destructors for our base classes and members.
2832 Called from begin_destructor_body. */
2835 push_base_cleanups (void)
2837 tree binfo, base_binfo;
2841 VEC(tree,gc) *vbases;
2843 /* Run destructors for all virtual baseclasses. */
2844 if (CLASSTYPE_VBASECLASSES (current_class_type))
2846 tree cond = (condition_conversion
2847 (build2 (BIT_AND_EXPR, integer_type_node,
2848 current_in_charge_parm,
2849 integer_two_node)));
2851 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2852 order, which is also the right order for pushing cleanups. */
2853 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
2854 VEC_iterate (tree, vbases, i, base_binfo); i++)
2856 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
2858 expr = build_special_member_call (current_class_ref,
2859 base_dtor_identifier,
2863 | LOOKUP_NONVIRTUAL));
2864 expr = build3 (COND_EXPR, void_type_node, cond,
2865 expr, void_zero_node);
2866 finish_decl_cleanup (NULL_TREE, expr);
2871 /* Take care of the remaining baseclasses. */
2872 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2873 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2875 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2876 || BINFO_VIRTUAL_P (base_binfo))
2879 expr = build_special_member_call (current_class_ref,
2880 base_dtor_identifier,
2881 NULL_TREE, base_binfo,
2882 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2883 finish_decl_cleanup (NULL_TREE, expr);
2886 for (member = TYPE_FIELDS (current_class_type); member;
2887 member = TREE_CHAIN (member))
2889 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2891 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2893 tree this_member = (build_class_member_access_expr
2894 (current_class_ref, member,
2895 /*access_path=*/NULL_TREE,
2896 /*preserve_reference=*/false));
2897 tree this_type = TREE_TYPE (member);
2898 expr = build_delete (this_type, this_member,
2899 sfk_complete_destructor,
2900 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2902 finish_decl_cleanup (NULL_TREE, expr);
2907 /* Build a C++ vector delete expression.
2908 MAXINDEX is the number of elements to be deleted.
2909 ELT_SIZE is the nominal size of each element in the vector.
2910 BASE is the expression that should yield the store to be deleted.
2911 This function expands (or synthesizes) these calls itself.
2912 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2914 This also calls delete for virtual baseclasses of elements of the vector.
2916 Update: MAXINDEX is no longer needed. The size can be extracted from the
2917 start of the vector for pointers, and from the type for arrays. We still
2918 use MAXINDEX for arrays because it happens to already have one of the
2919 values we'd have to extract. (We could use MAXINDEX with pointers to
2920 confirm the size, and trap if the numbers differ; not clear that it'd
2921 be worth bothering.) */
2924 build_vec_delete (tree base, tree maxindex,
2925 special_function_kind auto_delete_vec, int use_global_delete)
2929 tree base_init = NULL_TREE;
2931 type = TREE_TYPE (base);
2933 if (TREE_CODE (type) == POINTER_TYPE)
2935 /* Step back one from start of vector, and read dimension. */
2938 if (TREE_SIDE_EFFECTS (base))
2940 base_init = get_target_expr (base);
2941 base = TARGET_EXPR_SLOT (base_init);
2943 type = strip_array_types (TREE_TYPE (type));
2944 cookie_addr = build2 (MINUS_EXPR,
2945 build_pointer_type (sizetype),
2947 TYPE_SIZE_UNIT (sizetype));
2948 maxindex = build_indirect_ref (cookie_addr, NULL);
2950 else if (TREE_CODE (type) == ARRAY_TYPE)
2952 /* Get the total number of things in the array, maxindex is a
2954 maxindex = array_type_nelts_total (type);
2955 type = strip_array_types (type);
2956 base = build_unary_op (ADDR_EXPR, base, 1);
2957 if (TREE_SIDE_EFFECTS (base))
2959 base_init = get_target_expr (base);
2960 base = TARGET_EXPR_SLOT (base_init);
2965 if (base != error_mark_node)
2966 error ("type to vector delete is neither pointer or array type");
2967 return error_mark_node;
2970 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
2973 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);