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_new_1 (tree);
56 static tree build_dtor_call (tree, special_function_kind, int);
57 static tree build_field_list (tree, tree, int *);
58 static tree build_vtbl_address (tree);
60 /* We are about to generate some complex initialization code.
61 Conceptually, it is all a single expression. However, we may want
62 to include conditionals, loops, and other such statement-level
63 constructs. Therefore, we build the initialization code inside a
64 statement-expression. This function starts such an expression.
65 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
66 pass them back to finish_init_stmts when the expression is
70 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
72 bool is_global = !building_stmt_tree ();
74 *stmt_expr_p = begin_stmt_expr ();
75 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
80 /* Finish out the statement-expression begun by the previous call to
81 begin_init_stmts. Returns the statement-expression itself. */
84 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
86 finish_compound_stmt (compound_stmt);
88 stmt_expr = finish_stmt_expr (stmt_expr, true);
90 gcc_assert (!building_stmt_tree () == is_global);
97 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
98 which we want to initialize the vtable pointer for, DATA is
99 TREE_LIST whose TREE_VALUE is the this ptr expression. */
102 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
104 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
105 return dfs_skip_bases;
107 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo))
109 tree base_ptr = TREE_VALUE ((tree) data);
111 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
113 expand_virtual_init (binfo, base_ptr);
119 /* Initialize all the vtable pointers in the object pointed to by
123 initialize_vtbl_ptrs (tree addr)
128 type = TREE_TYPE (TREE_TYPE (addr));
129 list = build_tree_list (type, addr);
131 /* Walk through the hierarchy, initializing the vptr in each base
132 class. We do these in pre-order because we can't find the virtual
133 bases for a class until we've initialized the vtbl for that
135 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list);
138 /* Return an expression for the zero-initialization of an object with
139 type T. This expression will either be a constant (in the case
140 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
141 aggregate). In either case, the value can be used as DECL_INITIAL
142 for a decl of the indicated TYPE; it is a valid static initializer.
143 If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
144 number of elements in the array. If STATIC_STORAGE_P is TRUE,
145 initializers are only generated for entities for which
146 zero-initialization does not simply mean filling the storage with
150 build_zero_init (tree type, tree nelts, bool static_storage_p)
152 tree init = NULL_TREE;
156 To zero-initialization storage for an object of type T means:
158 -- if T is a scalar type, the storage is set to the value of zero
161 -- if T is a non-union class type, the storage for each nonstatic
162 data member and each base-class subobject is zero-initialized.
164 -- if T is a union type, the storage for its first data member is
167 -- if T is an array type, the storage for each element is
170 -- if T is a reference type, no initialization is performed. */
172 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST);
174 if (type == error_mark_node)
176 else if (static_storage_p && zero_init_p (type))
177 /* In order to save space, we do not explicitly build initializers
178 for items that do not need them. GCC's semantics are that
179 items with static storage duration that are not otherwise
180 initialized are initialized to zero. */
182 else if (SCALAR_TYPE_P (type))
183 init = convert (type, integer_zero_node);
184 else if (CLASS_TYPE_P (type))
187 VEC(constructor_elt,gc) *v = NULL;
189 /* Iterate over the fields, building initializations. */
190 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
192 if (TREE_CODE (field) != FIELD_DECL)
195 /* Note that for class types there will be FIELD_DECLs
196 corresponding to base classes as well. Thus, iterating
197 over TYPE_FIELDs will result in correct initialization of
198 all of the subobjects. */
199 if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
201 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);
226 gcc_assert (TREE_CODE (max_index) == INTEGER_CST);
228 /* A zero-sized array, which is accepted as an extension, will
229 have an upper bound of -1. */
230 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
234 v = VEC_alloc (constructor_elt, gc, 1);
235 ce = VEC_quick_push (constructor_elt, v, NULL);
237 /* If this is a one element array, we just use a regular init. */
238 if (tree_int_cst_equal (size_zero_node, max_index))
239 ce->index = size_zero_node;
241 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node,
244 ce->value = build_zero_init (TREE_TYPE (type),
249 /* Build a constructor to contain the initializations. */
250 init = build_constructor (type, v);
253 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
255 /* In all cases, the initializer is a constant. */
258 TREE_CONSTANT (init) = 1;
259 TREE_INVARIANT (init) = 1;
265 /* Build an expression for the default-initialization of an object of
266 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
267 ARRAY_TYPE, NELTS is the number of elements in the array. If
268 initialization of TYPE requires calling constructors, this function
269 returns NULL_TREE; the caller is responsible for arranging for the
270 constructors to be called. */
273 build_default_init (tree type, tree nelts)
277 To default-initialize an object of type T means:
279 --if T is a non-POD class type (clause _class_), the default construc-
280 tor for T is called (and the initialization is ill-formed if T has
281 no accessible default constructor);
283 --if T is an array type, each element is default-initialized;
285 --otherwise, the storage for the object is zero-initialized.
287 A program that calls for default-initialization of an entity of refer-
288 ence type is ill-formed. */
290 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
291 performing the initialization. This is confusing in that some
292 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
293 a class with a pointer-to-data member as a non-static data member
294 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
295 passing non-PODs to build_zero_init below, which is contrary to
296 the semantics quoted above from [dcl.init].
298 It happens, however, that the behavior of the constructor the
299 standard says we should have generated would be precisely the
300 same as that obtained by calling build_zero_init below, so things
302 if (TYPE_NEEDS_CONSTRUCTING (type)
303 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
306 /* At this point, TYPE is either a POD class type, an array of POD
307 classes, or something even more innocuous. */
308 return build_zero_init (type, nelts, /*static_storage_p=*/false);
311 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
312 arguments. If TREE_LIST is void_type_node, an empty initializer
313 list was given; if NULL_TREE no initializer was given. */
316 perform_member_init (tree member, tree init)
319 tree type = TREE_TYPE (member);
322 explicit = (init != NULL_TREE);
324 /* Effective C++ rule 12 requires that all data members be
326 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
327 warning (0, "%J%qD should be initialized in the member initialization "
328 "list", current_function_decl, member);
330 if (init == void_type_node)
333 /* Get an lvalue for the data member. */
334 decl = build_class_member_access_expr (current_class_ref, member,
335 /*access_path=*/NULL_TREE,
336 /*preserve_reference=*/true);
337 if (decl == error_mark_node)
340 /* Deal with this here, as we will get confused if we try to call the
341 assignment op for an anonymous union. This can happen in a
342 synthesized copy constructor. */
343 if (ANON_AGGR_TYPE_P (type))
347 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
348 finish_expr_stmt (init);
351 else if (TYPE_NEEDS_CONSTRUCTING (type))
354 && TREE_CODE (type) == ARRAY_TYPE
356 && TREE_CHAIN (init) == NULL_TREE
357 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
359 /* Initialization of one array from another. */
360 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
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 (0, "%q+D will be initialized after",
527 TREE_PURPOSE (next_subobject));
529 warning (0, "base %qT will be initialized after",
530 TREE_PURPOSE (next_subobject));
531 if (TREE_CODE (subobject) == FIELD_DECL)
532 warning (0, " %q+#D", subobject);
534 warning (0, " base %qT", subobject);
535 warning (0, "%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 (0, "%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 %qD is not a direct or virtual base of %qT",
1022 name, current_class_type);
1024 error ("type %qD is not a direct base of %qT",
1025 name, 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 itype && same_type_p (itype,
1117 TREE_READONLY (exp) = was_const;
1118 TREE_THIS_VOLATILE (exp) = was_volatile;
1119 TREE_TYPE (exp) = type;
1121 TREE_TYPE (init) = itype;
1125 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1126 /* Just know that we've seen something for this node. */
1127 TREE_USED (exp) = 1;
1129 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1130 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1131 destroy_temps = stmts_are_full_exprs_p ();
1132 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1133 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1134 init, LOOKUP_NORMAL|flags);
1135 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1136 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1137 TREE_TYPE (exp) = type;
1138 TREE_READONLY (exp) = was_const;
1139 TREE_THIS_VOLATILE (exp) = was_volatile;
1144 /* Like build_aggr_init, but not just for aggregates. */
1147 build_init (tree decl, tree init, int flags)
1151 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1152 expr = build_aggr_init (decl, init, flags);
1153 else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1154 expr = build_special_member_call (decl, complete_ctor_identifier,
1155 build_tree_list (NULL_TREE, init),
1157 LOOKUP_NORMAL|flags);
1159 expr = build2 (INIT_EXPR, TREE_TYPE (decl), decl, init);
1165 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1167 tree type = TREE_TYPE (exp);
1170 /* It fails because there may not be a constructor which takes
1171 its own type as the first (or only parameter), but which does
1172 take other types via a conversion. So, if the thing initializing
1173 the expression is a unit element of type X, first try X(X&),
1174 followed by initialization by X. If neither of these work
1175 out, then look hard. */
1179 if (init && TREE_CODE (init) != TREE_LIST
1180 && (flags & LOOKUP_ONLYCONVERTING))
1182 /* Base subobjects should only get direct-initialization. */
1183 gcc_assert (true_exp == exp);
1185 if (flags & DIRECT_BIND)
1186 /* Do nothing. We hit this in two cases: Reference initialization,
1187 where we aren't initializing a real variable, so we don't want
1188 to run a new constructor; and catching an exception, where we
1189 have already built up the constructor call so we could wrap it
1190 in an exception region. */;
1191 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1193 /* A brace-enclosed initializer for an aggregate. */
1194 gcc_assert (CP_AGGREGATE_TYPE_P (type));
1195 init = digest_init (type, init);
1198 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1200 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1201 /* We need to protect the initialization of a catch parm with a
1202 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1203 around the TARGET_EXPR for the copy constructor. See
1204 initialize_handler_parm. */
1206 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1207 TREE_OPERAND (init, 0));
1208 TREE_TYPE (init) = void_type_node;
1211 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1212 TREE_SIDE_EFFECTS (init) = 1;
1213 finish_expr_stmt (init);
1217 if (init == NULL_TREE
1218 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1222 init = TREE_VALUE (parms);
1225 parms = build_tree_list (NULL_TREE, init);
1227 if (true_exp == exp)
1228 ctor_name = complete_ctor_identifier;
1230 ctor_name = base_ctor_identifier;
1232 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1233 if (TREE_SIDE_EFFECTS (rval))
1234 finish_expr_stmt (convert_to_void (rval, NULL));
1237 /* This function is responsible for initializing EXP with INIT
1240 BINFO is the binfo of the type for who we are performing the
1241 initialization. For example, if W is a virtual base class of A and B,
1243 If we are initializing B, then W must contain B's W vtable, whereas
1244 were we initializing C, W must contain C's W vtable.
1246 TRUE_EXP is nonzero if it is the true expression being initialized.
1247 In this case, it may be EXP, or may just contain EXP. The reason we
1248 need this is because if EXP is a base element of TRUE_EXP, we
1249 don't necessarily know by looking at EXP where its virtual
1250 baseclass fields should really be pointing. But we do know
1251 from TRUE_EXP. In constructors, we don't know anything about
1252 the value being initialized.
1254 FLAGS is just passed to `build_new_method_call'. See that function
1255 for its description. */
1258 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1260 tree type = TREE_TYPE (exp);
1262 gcc_assert (init != error_mark_node && type != error_mark_node);
1263 gcc_assert (building_stmt_tree ());
1265 /* Use a function returning the desired type to initialize EXP for us.
1266 If the function is a constructor, and its first argument is
1267 NULL_TREE, know that it was meant for us--just slide exp on
1268 in and expand the constructor. Constructors now come
1271 if (init && TREE_CODE (exp) == VAR_DECL
1272 && TREE_CODE (init) == CONSTRUCTOR
1273 && TREE_HAS_CONSTRUCTOR (init))
1275 /* If store_init_value returns NULL_TREE, the INIT has been
1276 record in the DECL_INITIAL for EXP. That means there's
1277 nothing more we have to do. */
1278 init = store_init_value (exp, init);
1280 finish_expr_stmt (init);
1284 /* We know that expand_default_init can handle everything we want
1286 expand_default_init (binfo, true_exp, exp, init, flags);
1289 /* Report an error if TYPE is not a user-defined, aggregate type. If
1290 OR_ELSE is nonzero, give an error message. */
1293 is_aggr_type (tree type, int or_else)
1295 if (type == error_mark_node)
1298 if (! IS_AGGR_TYPE (type)
1299 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1300 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1303 error ("%qT is not an aggregate type", type);
1310 get_type_value (tree name)
1312 if (name == error_mark_node)
1315 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1316 return IDENTIFIER_TYPE_VALUE (name);
1321 /* Build a reference to a member of an aggregate. This is not a C++
1322 `&', but really something which can have its address taken, and
1323 then act as a pointer to member, for example TYPE :: FIELD can have
1324 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1325 this expression is the operand of "&".
1327 @@ Prints out lousy diagnostics for operator <typename>
1330 @@ This function should be rewritten and placed in search.c. */
1333 build_offset_ref (tree type, tree name, bool address_p)
1337 tree basebinfo = NULL_TREE;
1338 tree orig_name = name;
1340 /* class templates can come in as TEMPLATE_DECLs here. */
1341 if (TREE_CODE (name) == TEMPLATE_DECL)
1344 if (dependent_type_p (type) || type_dependent_expression_p (name))
1345 return build_min_nt (SCOPE_REF, type, name);
1347 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1349 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1350 something like `a.template f<int>' or the like. For the most
1351 part, we treat this just like a.f. We do remember, however,
1352 the template-id that was used. */
1353 name = TREE_OPERAND (orig_name, 0);
1356 name = DECL_NAME (name);
1359 if (TREE_CODE (name) == COMPONENT_REF)
1360 name = TREE_OPERAND (name, 1);
1361 if (TREE_CODE (name) == OVERLOAD)
1362 name = DECL_NAME (OVL_CURRENT (name));
1365 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1368 if (type == NULL_TREE)
1369 return error_mark_node;
1371 /* Handle namespace names fully here. */
1372 if (TREE_CODE (type) == NAMESPACE_DECL)
1374 tree t = lookup_namespace_name (type, name);
1375 if (t == error_mark_node)
1377 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1378 /* Reconstruct the TEMPLATE_ID_EXPR. */
1379 t = build2 (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1380 t, TREE_OPERAND (orig_name, 1));
1381 if (! type_unknown_p (t))
1384 t = convert_from_reference (t);
1389 if (! is_aggr_type (type, 1))
1390 return error_mark_node;
1392 if (TREE_CODE (name) == BIT_NOT_EXPR)
1394 if (! check_dtor_name (type, name))
1395 error ("qualified type %qT does not match destructor name %<~%T%>",
1396 type, TREE_OPERAND (name, 0));
1397 name = dtor_identifier;
1400 if (!COMPLETE_TYPE_P (complete_type (type))
1401 && !TYPE_BEING_DEFINED (type))
1403 error ("incomplete type %qT does not have member %qD", type, name);
1404 return error_mark_node;
1407 /* Set up BASEBINFO for member lookup. */
1408 decl = maybe_dummy_object (type, &basebinfo);
1410 if (BASELINK_P (name) || DECL_P (name))
1414 member = lookup_member (basebinfo, name, 1, 0);
1416 if (member == error_mark_node)
1417 return error_mark_node;
1422 error ("%qD is not a member of type %qT", name, type);
1423 return error_mark_node;
1426 if (TREE_CODE (member) == TYPE_DECL)
1428 TREE_USED (member) = 1;
1431 /* static class members and class-specific enum
1432 values can be returned without further ado. */
1433 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1436 return convert_from_reference (member);
1439 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1441 error ("invalid pointer to bit-field %qD", member);
1442 return error_mark_node;
1445 /* A lot of this logic is now handled in lookup_member. */
1446 if (BASELINK_P (member))
1448 /* Go from the TREE_BASELINK to the member function info. */
1449 tree fnfields = member;
1450 tree t = BASELINK_FUNCTIONS (fnfields);
1452 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1454 /* The FNFIELDS are going to contain functions that aren't
1455 necessarily templates, and templates that don't
1456 necessarily match the explicit template parameters. We
1457 save all the functions, and the explicit parameters, and
1458 then figure out exactly what to instantiate with what
1459 arguments in instantiate_type. */
1461 if (TREE_CODE (t) != OVERLOAD)
1462 /* The code in instantiate_type which will process this
1463 expects to encounter OVERLOADs, not raw functions. */
1464 t = ovl_cons (t, NULL_TREE);
1466 t = build2 (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1467 TREE_OPERAND (orig_name, 1));
1468 t = build2 (OFFSET_REF, unknown_type_node, decl, t);
1470 PTRMEM_OK_P (t) = 1;
1475 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1477 /* Get rid of a potential OVERLOAD around it. */
1478 t = OVL_CURRENT (t);
1480 /* Unique functions are handled easily. */
1482 /* For non-static member of base class, we need a special rule
1483 for access checking [class.protected]:
1485 If the access is to form a pointer to member, the
1486 nested-name-specifier shall name the derived class
1487 (or any class derived from that class). */
1488 if (address_p && DECL_P (t)
1489 && DECL_NONSTATIC_MEMBER_P (t))
1490 perform_or_defer_access_check (TYPE_BINFO (type), t);
1492 perform_or_defer_access_check (basebinfo, t);
1495 if (DECL_STATIC_FUNCTION_P (t))
1501 TREE_TYPE (fnfields) = unknown_type_node;
1505 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1506 /* We need additional test besides the one in
1507 check_accessibility_of_qualified_id in case it is
1508 a pointer to non-static member. */
1509 perform_or_defer_access_check (TYPE_BINFO (type), member);
1513 /* If MEMBER is non-static, then the program has fallen afoul of
1516 An id-expression that denotes a nonstatic data member or
1517 nonstatic member function of a class can only be used:
1519 -- as part of a class member access (_expr.ref_) in which the
1520 object-expression refers to the member's class or a class
1521 derived from that class, or
1523 -- to form a pointer to member (_expr.unary.op_), or
1525 -- in the body of a nonstatic member function of that class or
1526 of a class derived from that class (_class.mfct.nonstatic_), or
1528 -- in a mem-initializer for a constructor for that class or for
1529 a class derived from that class (_class.base.init_). */
1530 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1532 /* Build a representation of a the qualified name suitable
1533 for use as the operand to "&" -- even though the "&" is
1534 not actually present. */
1535 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1536 /* In Microsoft mode, treat a non-static member function as if
1537 it were a pointer-to-member. */
1538 if (flag_ms_extensions)
1540 PTRMEM_OK_P (member) = 1;
1541 return build_unary_op (ADDR_EXPR, member, 0);
1543 error ("invalid use of non-static member function %qD",
1544 TREE_OPERAND (member, 1));
1547 else if (TREE_CODE (member) == FIELD_DECL)
1549 error ("invalid use of non-static data member %qD", member);
1550 return error_mark_node;
1555 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1556 PTRMEM_OK_P (member) = 1;
1560 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1561 constant of integral or enumeration type, then return that value.
1562 These are those variables permitted in constant expressions by
1563 [5.19/1]. FIXME:If we did lazy folding, this could be localized. */
1566 integral_constant_value (tree decl)
1568 while ((TREE_CODE (decl) == CONST_DECL
1569 || (TREE_CODE (decl) == VAR_DECL
1570 /* And so are variables with a 'const' type -- unless they
1571 are also 'volatile'. */
1572 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl))
1573 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)))
1574 && DECL_INITIAL (decl)
1575 && DECL_INITIAL (decl) != error_mark_node
1576 && TREE_TYPE (DECL_INITIAL (decl))
1577 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (DECL_INITIAL (decl))))
1578 decl = DECL_INITIAL (decl);
1582 /* A more relaxed version of integral_constant_value, for which type
1583 is not considered. This is used by the common C/C++ code, and not
1584 directly by the C++ front end. */
1587 decl_constant_value (tree decl)
1589 if ((TREE_CODE (decl) == CONST_DECL
1590 || (TREE_CODE (decl) == VAR_DECL
1591 /* And so are variables with a 'const' type -- unless they
1592 are also 'volatile'. */
1593 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl))))
1594 && DECL_INITIAL (decl)
1595 && DECL_INITIAL (decl) != error_mark_node
1596 /* This is invalid if initial value is not constant. If it has
1597 either a function call, a memory reference, or a variable,
1598 then re-evaluating it could give different results. */
1599 && TREE_CONSTANT (DECL_INITIAL (decl)))
1600 return DECL_INITIAL (decl);
1605 /* Common subroutines of build_new and build_vec_delete. */
1607 /* Call the global __builtin_delete to delete ADDR. */
1610 build_builtin_delete_call (tree addr)
1612 mark_used (global_delete_fndecl);
1613 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1616 /* Generate a representation for a C++ "new" expression. PLACEMENT is
1617 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
1618 NELTS is NULL, TYPE is the type of the storage to be allocated. If
1619 NELTS is not NULL, then this is an array-new allocation; TYPE is
1620 the type of the elements in the array and NELTS is the number of
1621 elements in the array. INIT, if non-NULL, is the initializer for
1622 the new object. If USE_GLOBAL_NEW is true, then the user
1623 explicitly wrote "::new" rather than just "new". */
1626 build_new (tree placement, tree type, tree nelts, tree init,
1631 if (type == error_mark_node)
1632 return error_mark_node;
1634 if (processing_template_decl)
1636 rval = build_min (NEW_EXPR, build_pointer_type (type),
1637 placement, type, nelts, init);
1638 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1639 TREE_SIDE_EFFECTS (rval) = 1;
1645 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
1646 pedwarn ("size in array new must have integral type");
1647 nelts = save_expr (cp_convert (sizetype, nelts));
1648 if (nelts == integer_zero_node)
1649 warning (0, "zero size array reserves no space");
1652 /* ``A reference cannot be created by the new operator. A reference
1653 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1654 returned by new.'' ARM 5.3.3 */
1655 if (TREE_CODE (type) == REFERENCE_TYPE)
1657 error ("new cannot be applied to a reference type");
1658 type = TREE_TYPE (type);
1661 if (TREE_CODE (type) == FUNCTION_TYPE)
1663 error ("new cannot be applied to a function type");
1664 return error_mark_node;
1667 rval = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1669 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1670 TREE_SIDE_EFFECTS (rval) = 1;
1671 rval = build_new_1 (rval);
1672 if (rval == error_mark_node)
1673 return error_mark_node;
1675 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1676 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1677 TREE_NO_WARNING (rval) = 1;
1682 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1685 build_java_class_ref (tree type)
1687 tree name = NULL_TREE, class_decl;
1688 static tree CL_suffix = NULL_TREE;
1689 if (CL_suffix == NULL_TREE)
1690 CL_suffix = get_identifier("class$");
1691 if (jclass_node == NULL_TREE)
1693 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1694 if (jclass_node == NULL_TREE)
1695 fatal_error ("call to Java constructor, while %<jclass%> undefined");
1697 jclass_node = TREE_TYPE (jclass_node);
1700 /* Mangle the class$ field. */
1703 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1704 if (DECL_NAME (field) == CL_suffix)
1706 mangle_decl (field);
1707 name = DECL_ASSEMBLER_NAME (field);
1711 internal_error ("can't find class$");
1714 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1715 if (class_decl == NULL_TREE)
1717 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1718 TREE_STATIC (class_decl) = 1;
1719 DECL_EXTERNAL (class_decl) = 1;
1720 TREE_PUBLIC (class_decl) = 1;
1721 DECL_ARTIFICIAL (class_decl) = 1;
1722 DECL_IGNORED_P (class_decl) = 1;
1723 pushdecl_top_level (class_decl);
1724 make_decl_rtl (class_decl);
1730 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1731 value is immediately handed to expand_expr. */
1734 build_new_1 (tree exp)
1736 tree placement, init;
1738 /* True iff this is a call to "operator new[]" instead of just
1740 bool array_p = false;
1741 /* True iff ARRAY_P is true and the bound of the array type is
1742 not necessarily a compile time constant. For example, VLA_P is
1743 true for "new int[f()]". */
1745 /* The type being allocated. If ARRAY_P is true, this will be an
1748 /* If ARRAY_P is true, the element type of the array. This is an
1749 never ARRAY_TYPE; for something like "new int[3][4]", the
1750 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1753 /* The type of the new-expression. (This type is always a pointer
1756 /* The type pointed to by POINTER_TYPE. This type may be different
1757 from ELT_TYPE for a multi-dimensional array; ELT_TYPE is never an
1758 ARRAY_TYPE, but TYPE may be an ARRAY_TYPE. */
1760 /* A pointer type pointing to the FULL_TYPE. */
1761 tree full_pointer_type;
1762 tree outer_nelts = NULL_TREE;
1763 tree nelts = NULL_TREE;
1764 tree alloc_call, alloc_expr;
1765 /* The address returned by the call to "operator new". This node is
1766 a VAR_DECL and is therefore reusable. */
1769 tree cookie_expr, init_expr;
1770 int nothrow, check_new;
1771 /* Nonzero if the user wrote `::new' rather than just `new'. */
1772 int globally_qualified_p;
1773 int use_java_new = 0;
1774 /* If non-NULL, the number of extra bytes to allocate at the
1775 beginning of the storage allocated for an array-new expression in
1776 order to store the number of elements. */
1777 tree cookie_size = NULL_TREE;
1778 /* True if the function we are calling is a placement allocation
1780 bool placement_allocation_fn_p;
1781 tree args = NULL_TREE;
1782 /* True if the storage must be initialized, either by a constructor
1783 or due to an explicit new-initializer. */
1784 bool is_initialized;
1785 /* The address of the thing allocated, not including any cookie. In
1786 particular, if an array cookie is in use, DATA_ADDR is the
1787 address of the first array element. This node is a VAR_DECL, and
1788 is therefore reusable. */
1790 tree init_preeval_expr = NULL_TREE;
1792 placement = TREE_OPERAND (exp, 0);
1793 type = TREE_OPERAND (exp, 1);
1794 nelts = TREE_OPERAND (exp, 2);
1795 init = TREE_OPERAND (exp, 3);
1796 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1802 outer_nelts = nelts;
1805 /* ??? The middle-end will error on us for building a VLA outside a
1806 function context. Methinks that's not it's purvey. So we'll do
1807 our own VLA layout later. */
1809 full_type = build_cplus_array_type (type, NULL_TREE);
1810 index = convert (sizetype, nelts);
1811 index = size_binop (MINUS_EXPR, index, size_one_node);
1812 TYPE_DOMAIN (full_type) = build_index_type (index);
1817 if (TREE_CODE (type) == ARRAY_TYPE)
1820 nelts = array_type_nelts_top (type);
1821 outer_nelts = nelts;
1822 type = TREE_TYPE (type);
1826 /* If our base type is an array, then make sure we know how many elements
1828 for (elt_type = type;
1829 TREE_CODE (elt_type) == ARRAY_TYPE;
1830 elt_type = TREE_TYPE (elt_type))
1831 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1832 array_type_nelts_top (elt_type));
1834 if (!complete_type_or_else (elt_type, exp))
1835 return error_mark_node;
1837 if (TREE_CODE (elt_type) == VOID_TYPE)
1839 error ("invalid type %<void%> for new");
1840 return error_mark_node;
1843 if (abstract_virtuals_error (NULL_TREE, elt_type))
1844 return error_mark_node;
1846 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1847 if (CP_TYPE_CONST_P (elt_type) && !is_initialized)
1849 error ("uninitialized const in %<new%> of %q#T", elt_type);
1850 return error_mark_node;
1853 size = size_in_bytes (elt_type);
1856 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1861 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1862 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1863 ...>> to be valid. */
1864 TYPE_SIZE_UNIT (full_type) = size;
1865 n = convert (bitsizetype, nelts);
1866 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1867 TYPE_SIZE (full_type) = bitsize;
1871 /* Allocate the object. */
1872 if (! placement && TYPE_FOR_JAVA (elt_type))
1874 tree class_addr, alloc_decl;
1875 tree class_decl = build_java_class_ref (elt_type);
1876 static const char alloc_name[] = "_Jv_AllocObject";
1880 if (!get_global_value_if_present (get_identifier (alloc_name),
1883 error ("call to Java constructor with %qs undefined", alloc_name);
1884 return error_mark_node;
1886 else if (really_overloaded_fn (alloc_decl))
1888 error ("%qD should never be overloaded", alloc_decl);
1889 return error_mark_node;
1891 alloc_decl = OVL_CURRENT (alloc_decl);
1892 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1893 alloc_call = (build_function_call
1895 build_tree_list (NULL_TREE, class_addr)));
1902 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1904 if (!globally_qualified_p
1905 && CLASS_TYPE_P (elt_type)
1907 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1908 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1910 /* Use a class-specific operator new. */
1911 /* If a cookie is required, add some extra space. */
1912 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1914 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1915 size = size_binop (PLUS_EXPR, size, cookie_size);
1917 /* Create the argument list. */
1918 args = tree_cons (NULL_TREE, size, placement);
1919 /* Do name-lookup to find the appropriate operator. */
1920 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1921 if (fns == NULL_TREE)
1923 error ("no suitable %qD found in class %qT", fnname, elt_type);
1924 return error_mark_node;
1926 if (TREE_CODE (fns) == TREE_LIST)
1928 error ("request for member %qD is ambiguous", fnname);
1929 print_candidates (fns);
1930 return error_mark_node;
1932 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1934 /*conversion_path=*/NULL_TREE,
1939 /* Use a global operator new. */
1940 /* See if a cookie might be required. */
1941 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1942 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1944 cookie_size = NULL_TREE;
1946 alloc_call = build_operator_new_call (fnname, placement,
1947 &size, &cookie_size);
1951 if (alloc_call == error_mark_node)
1952 return error_mark_node;
1954 /* In the simple case, we can stop now. */
1955 pointer_type = build_pointer_type (type);
1956 if (!cookie_size && !is_initialized)
1957 return build_nop (pointer_type, alloc_call);
1959 /* While we're working, use a pointer to the type we've actually
1960 allocated. Store the result of the call in a variable so that we
1961 can use it more than once. */
1962 full_pointer_type = build_pointer_type (full_type);
1963 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1964 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1966 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1967 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1968 alloc_call = TREE_OPERAND (alloc_call, 1);
1969 alloc_fn = get_callee_fndecl (alloc_call);
1970 gcc_assert (alloc_fn != NULL_TREE);
1972 /* Now, check to see if this function is actually a placement
1973 allocation function. This can happen even when PLACEMENT is NULL
1974 because we might have something like:
1976 struct S { void* operator new (size_t, int i = 0); };
1978 A call to `new S' will get this allocation function, even though
1979 there is no explicit placement argument. If there is more than
1980 one argument, or there are variable arguments, then this is a
1981 placement allocation function. */
1982 placement_allocation_fn_p
1983 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1984 || varargs_function_p (alloc_fn));
1986 /* Preevaluate the placement args so that we don't reevaluate them for a
1987 placement delete. */
1988 if (placement_allocation_fn_p)
1991 stabilize_call (alloc_call, &inits);
1993 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1997 /* unless an allocation function is declared with an empty excep-
1998 tion-specification (_except.spec_), throw(), it indicates failure to
1999 allocate storage by throwing a bad_alloc exception (clause _except_,
2000 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2001 cation function is declared with an empty exception-specification,
2002 throw(), it returns null to indicate failure to allocate storage and a
2003 non-null pointer otherwise.
2005 So check for a null exception spec on the op new we just called. */
2007 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2008 check_new = (flag_check_new || nothrow) && ! use_java_new;
2015 /* Adjust so we're pointing to the start of the object. */
2016 data_addr = get_target_expr (build2 (PLUS_EXPR, full_pointer_type,
2017 alloc_node, cookie_size));
2019 /* Store the number of bytes allocated so that we can know how
2020 many elements to destroy later. We use the last sizeof
2021 (size_t) bytes to store the number of elements. */
2022 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
2023 data_addr, size_in_bytes (sizetype));
2024 cookie = build_indirect_ref (cookie_ptr, NULL);
2026 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2028 if (targetm.cxx.cookie_has_size ())
2030 /* Also store the element size. */
2031 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
2032 cookie_ptr, size_in_bytes (sizetype));
2033 cookie = build_indirect_ref (cookie_ptr, NULL);
2034 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2035 size_in_bytes(elt_type));
2036 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2037 cookie, cookie_expr);
2039 data_addr = TARGET_EXPR_SLOT (data_addr);
2043 cookie_expr = NULL_TREE;
2044 data_addr = alloc_node;
2047 /* Now initialize the allocated object. Note that we preevaluate the
2048 initialization expression, apart from the actual constructor call or
2049 assignment--we do this because we want to delay the allocation as long
2050 as possible in order to minimize the size of the exception region for
2051 placement delete. */
2056 init_expr = build_indirect_ref (data_addr, NULL);
2058 if (init == void_zero_node)
2059 init = build_default_init (full_type, nelts);
2060 else if (init && array_p)
2061 pedwarn ("ISO C++ forbids initialization in array new");
2066 = build_vec_init (init_expr,
2067 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2069 init, /*from_array=*/0);
2071 /* An array initialization is stable because the initialization
2072 of each element is a full-expression, so the temporaries don't
2076 else if (TYPE_NEEDS_CONSTRUCTING (type))
2078 init_expr = build_special_member_call (init_expr,
2079 complete_ctor_identifier,
2082 stable = stabilize_init (init_expr, &init_preeval_expr);
2086 /* We are processing something like `new int (10)', which
2087 means allocate an int, and initialize it with 10. */
2089 if (TREE_CODE (init) == TREE_LIST)
2090 init = build_x_compound_expr_from_list (init, "new initializer");
2093 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
2094 || TREE_TYPE (init) != NULL_TREE);
2096 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2097 stable = stabilize_init (init_expr, &init_preeval_expr);
2100 if (init_expr == error_mark_node)
2101 return error_mark_node;
2103 /* If any part of the object initialization terminates by throwing an
2104 exception and a suitable deallocation function can be found, the
2105 deallocation function is called to free the memory in which the
2106 object was being constructed, after which the exception continues
2107 to propagate in the context of the new-expression. If no
2108 unambiguous matching deallocation function can be found,
2109 propagating the exception does not cause the object's memory to be
2111 if (flag_exceptions && ! use_java_new)
2113 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2116 /* The Standard is unclear here, but the right thing to do
2117 is to use the same method for finding deallocation
2118 functions that we use for finding allocation functions. */
2119 cleanup = build_op_delete_call (dcode, alloc_node, size,
2120 globally_qualified_p,
2121 (placement_allocation_fn_p
2122 ? alloc_call : NULL_TREE));
2127 /* This is much simpler if we were able to preevaluate all of
2128 the arguments to the constructor call. */
2129 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2130 init_expr, cleanup);
2132 /* Ack! First we allocate the memory. Then we set our sentry
2133 variable to true, and expand a cleanup that deletes the
2134 memory if sentry is true. Then we run the constructor, and
2135 finally clear the sentry.
2137 We need to do this because we allocate the space first, so
2138 if there are any temporaries with cleanups in the
2139 constructor args and we weren't able to preevaluate them, we
2140 need this EH region to extend until end of full-expression
2141 to preserve nesting. */
2143 tree end, sentry, begin;
2145 begin = get_target_expr (boolean_true_node);
2146 CLEANUP_EH_ONLY (begin) = 1;
2148 sentry = TARGET_EXPR_SLOT (begin);
2150 TARGET_EXPR_CLEANUP (begin)
2151 = build3 (COND_EXPR, void_type_node, sentry,
2152 cleanup, void_zero_node);
2154 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2155 sentry, boolean_false_node);
2158 = build2 (COMPOUND_EXPR, void_type_node, begin,
2159 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2166 init_expr = NULL_TREE;
2168 /* Now build up the return value in reverse order. */
2173 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2175 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2177 if (rval == alloc_node)
2178 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2179 and return the call (which doesn't need to be adjusted). */
2180 rval = TARGET_EXPR_INITIAL (alloc_expr);
2185 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2187 rval = build_conditional_expr (ifexp, rval, alloc_node);
2190 /* Perform the allocation before anything else, so that ALLOC_NODE
2191 has been initialized before we start using it. */
2192 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2195 if (init_preeval_expr)
2196 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2198 /* Convert to the final type. */
2199 rval = build_nop (pointer_type, rval);
2201 /* A new-expression is never an lvalue. */
2202 if (real_lvalue_p (rval))
2203 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2209 build_vec_delete_1 (tree base, tree maxindex, tree type,
2210 special_function_kind auto_delete_vec, int use_global_delete)
2213 tree ptype = build_pointer_type (type = complete_type (type));
2214 tree size_exp = size_in_bytes (type);
2216 /* Temporary variables used by the loop. */
2217 tree tbase, tbase_init;
2219 /* This is the body of the loop that implements the deletion of a
2220 single element, and moves temp variables to next elements. */
2223 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2226 /* This is the thing that governs what to do after the loop has run. */
2227 tree deallocate_expr = 0;
2229 /* This is the BIND_EXPR which holds the outermost iterator of the
2230 loop. It is convenient to set this variable up and test it before
2231 executing any other code in the loop.
2232 This is also the containing expression returned by this function. */
2233 tree controller = NULL_TREE;
2235 /* We should only have 1-D arrays here. */
2236 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2238 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2241 /* The below is short by the cookie size. */
2242 virtual_size = size_binop (MULT_EXPR, size_exp,
2243 convert (sizetype, maxindex));
2245 tbase = create_temporary_var (ptype);
2246 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2247 fold_build2 (PLUS_EXPR, ptype,
2250 DECL_REGISTER (tbase) = 1;
2251 controller = build3 (BIND_EXPR, void_type_node, tbase,
2252 NULL_TREE, NULL_TREE);
2253 TREE_SIDE_EFFECTS (controller) = 1;
2255 body = build1 (EXIT_EXPR, void_type_node,
2256 build2 (EQ_EXPR, boolean_type_node, base, tbase));
2257 body = build_compound_expr
2258 (body, build_modify_expr (tbase, NOP_EXPR,
2259 build2 (MINUS_EXPR, ptype, tbase, size_exp)));
2260 body = build_compound_expr
2261 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2262 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2264 loop = build1 (LOOP_EXPR, void_type_node, body);
2265 loop = build_compound_expr (tbase_init, loop);
2268 /* If the delete flag is one, or anything else with the low bit set,
2269 delete the storage. */
2270 if (auto_delete_vec != sfk_base_destructor)
2274 /* The below is short by the cookie size. */
2275 virtual_size = size_binop (MULT_EXPR, size_exp,
2276 convert (sizetype, maxindex));
2278 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2285 cookie_size = targetm.cxx.get_cookie_size (type);
2287 = cp_convert (ptype,
2288 cp_build_binary_op (MINUS_EXPR,
2289 cp_convert (string_type_node,
2292 /* True size with header. */
2293 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2296 if (auto_delete_vec == sfk_deleting_destructor)
2297 deallocate_expr = build_x_delete (base_tbd,
2298 2 | use_global_delete,
2303 if (!deallocate_expr)
2306 body = deallocate_expr;
2308 body = build_compound_expr (body, deallocate_expr);
2311 body = integer_zero_node;
2313 /* Outermost wrapper: If pointer is null, punt. */
2314 body = fold_build3 (COND_EXPR, void_type_node,
2315 fold_build2 (NE_EXPR, boolean_type_node, base,
2316 convert (TREE_TYPE (base),
2317 integer_zero_node)),
2318 body, integer_zero_node);
2319 body = build1 (NOP_EXPR, void_type_node, body);
2323 TREE_OPERAND (controller, 1) = body;
2327 if (TREE_CODE (base) == SAVE_EXPR)
2328 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2329 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2331 return convert_to_void (body, /*implicit=*/NULL);
2334 /* Create an unnamed variable of the indicated TYPE. */
2337 create_temporary_var (tree type)
2341 decl = build_decl (VAR_DECL, NULL_TREE, type);
2342 TREE_USED (decl) = 1;
2343 DECL_ARTIFICIAL (decl) = 1;
2344 DECL_IGNORED_P (decl) = 1;
2345 DECL_SOURCE_LOCATION (decl) = input_location;
2346 DECL_CONTEXT (decl) = current_function_decl;
2351 /* Create a new temporary variable of the indicated TYPE, initialized
2354 It is not entered into current_binding_level, because that breaks
2355 things when it comes time to do final cleanups (which take place
2356 "outside" the binding contour of the function). */
2359 get_temp_regvar (tree type, tree init)
2363 decl = create_temporary_var (type);
2364 add_decl_expr (decl);
2366 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2371 /* `build_vec_init' returns tree structure that performs
2372 initialization of a vector of aggregate types.
2374 BASE is a reference to the vector, of ARRAY_TYPE.
2375 MAXINDEX is the maximum index of the array (one less than the
2376 number of elements). It is only used if
2377 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2378 INIT is the (possibly NULL) initializer.
2380 FROM_ARRAY is 0 if we should init everything with INIT
2381 (i.e., every element initialized from INIT).
2382 FROM_ARRAY is 1 if we should index into INIT in parallel
2383 with initialization of DECL.
2384 FROM_ARRAY is 2 if we should index into INIT in parallel,
2385 but use assignment instead of initialization. */
2388 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2391 tree base2 = NULL_TREE;
2393 tree itype = NULL_TREE;
2395 /* The type of the array. */
2396 tree atype = TREE_TYPE (base);
2397 /* The type of an element in the array. */
2398 tree type = TREE_TYPE (atype);
2399 /* The element type reached after removing all outer array
2401 tree inner_elt_type;
2402 /* The type of a pointer to an element in the array. */
2407 tree try_block = NULL_TREE;
2408 int num_initialized_elts = 0;
2411 if (TYPE_DOMAIN (atype))
2412 maxindex = array_type_nelts (atype);
2414 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2415 return error_mark_node;
2417 inner_elt_type = strip_array_types (atype);
2420 ? (!CLASS_TYPE_P (inner_elt_type)
2421 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type))
2422 : !TYPE_NEEDS_CONSTRUCTING (type))
2423 && ((TREE_CODE (init) == CONSTRUCTOR
2424 /* Don't do this if the CONSTRUCTOR might contain something
2425 that might throw and require us to clean up. */
2426 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))
2427 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type)))
2430 /* Do non-default initialization of POD arrays resulting from
2431 brace-enclosed initializers. In this case, digest_init and
2432 store_constructor will handle the semantics for us. */
2434 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2438 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2439 ptype = build_pointer_type (type);
2440 size = size_in_bytes (type);
2441 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2442 base = cp_convert (ptype, decay_conversion (base));
2444 /* The code we are generating looks like:
2448 ptrdiff_t iterator = maxindex;
2450 for (; iterator != -1; --iterator) {
2451 ... initialize *t1 ...
2455 ... destroy elements that were constructed ...
2460 We can omit the try and catch blocks if we know that the
2461 initialization will never throw an exception, or if the array
2462 elements do not have destructors. We can omit the loop completely if
2463 the elements of the array do not have constructors.
2465 We actually wrap the entire body of the above in a STMT_EXPR, for
2468 When copying from array to another, when the array elements have
2469 only trivial copy constructors, we should use __builtin_memcpy
2470 rather than generating a loop. That way, we could take advantage
2471 of whatever cleverness the back-end has for dealing with copies
2472 of blocks of memory. */
2474 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2475 destroy_temps = stmts_are_full_exprs_p ();
2476 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2477 rval = get_temp_regvar (ptype, base);
2478 base = get_temp_regvar (ptype, rval);
2479 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2481 /* Protect the entire array initialization so that we can destroy
2482 the partially constructed array if an exception is thrown.
2483 But don't do this if we're assigning. */
2484 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2487 try_block = begin_try_block ();
2490 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2492 /* Do non-default initialization of non-POD arrays resulting from
2493 brace-enclosed initializers. */
2494 unsigned HOST_WIDE_INT idx;
2498 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
2500 tree baseref = build1 (INDIRECT_REF, type, base);
2502 num_initialized_elts++;
2504 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2505 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2506 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2508 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2510 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2512 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2513 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2516 /* Clear out INIT so that we don't get confused below. */
2519 else if (from_array)
2521 /* If initializing one array from another, initialize element by
2522 element. We rely upon the below calls the do argument
2526 base2 = decay_conversion (init);
2527 itype = TREE_TYPE (base2);
2528 base2 = get_temp_regvar (itype, base2);
2529 itype = TREE_TYPE (itype);
2531 else if (TYPE_LANG_SPECIFIC (type)
2532 && TYPE_NEEDS_CONSTRUCTING (type)
2533 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2535 error ("initializer ends prematurely");
2536 return error_mark_node;
2540 /* Now, default-initialize any remaining elements. We don't need to
2541 do that if a) the type does not need constructing, or b) we've
2542 already initialized all the elements.
2544 We do need to keep going if we're copying an array. */
2547 || (TYPE_NEEDS_CONSTRUCTING (type)
2548 && ! (host_integerp (maxindex, 0)
2549 && (num_initialized_elts
2550 == tree_low_cst (maxindex, 0) + 1))))
2552 /* If the ITERATOR is equal to -1, then we don't have to loop;
2553 we've already initialized all the elements. */
2557 for_stmt = begin_for_stmt ();
2558 finish_for_init_stmt (for_stmt);
2559 finish_for_cond (build2 (NE_EXPR, boolean_type_node,
2560 iterator, integer_minus_one_node),
2562 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2567 tree to = build1 (INDIRECT_REF, type, base);
2571 from = build1 (INDIRECT_REF, itype, base2);
2575 if (from_array == 2)
2576 elt_init = build_modify_expr (to, NOP_EXPR, from);
2577 else if (TYPE_NEEDS_CONSTRUCTING (type))
2578 elt_init = build_aggr_init (to, from, 0);
2580 elt_init = build_modify_expr (to, NOP_EXPR, from);
2584 else if (TREE_CODE (type) == ARRAY_TYPE)
2588 ("cannot initialize multi-dimensional array with initializer");
2589 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2593 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2596 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2597 finish_expr_stmt (elt_init);
2598 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2600 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2602 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2604 finish_for_stmt (for_stmt);
2607 /* Make sure to cleanup any partially constructed elements. */
2608 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2612 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2614 /* Flatten multi-dimensional array since build_vec_delete only
2615 expects one-dimensional array. */
2616 if (TREE_CODE (type) == ARRAY_TYPE)
2617 m = cp_build_binary_op (MULT_EXPR, m,
2618 array_type_nelts_total (type));
2620 finish_cleanup_try_block (try_block);
2621 e = build_vec_delete_1 (rval, m,
2622 inner_elt_type, sfk_base_destructor,
2623 /*use_global_delete=*/0);
2624 finish_cleanup (e, try_block);
2627 /* The value of the array initialization is the array itself, RVAL
2628 is a pointer to the first element. */
2629 finish_stmt_expr_expr (rval, stmt_expr);
2631 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2633 /* Now convert make the result have the correct type. */
2634 atype = build_pointer_type (atype);
2635 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2636 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2638 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2642 /* Free up storage of type TYPE, at address ADDR.
2644 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2647 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2648 used as the second argument to operator delete. It can include
2649 things like padding and magic size cookies. It has virtual in it,
2650 because if you have a base pointer and you delete through a virtual
2651 destructor, it should be the size of the dynamic object, not the
2652 static object, see Free Store 12.5 ISO C++.
2654 This does not call any destructors. */
2657 build_x_delete (tree addr, int which_delete, tree virtual_size)
2659 int use_global_delete = which_delete & 1;
2660 int use_vec_delete = !!(which_delete & 2);
2661 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2663 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2667 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2671 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2677 case sfk_complete_destructor:
2678 name = complete_dtor_identifier;
2681 case sfk_base_destructor:
2682 name = base_dtor_identifier;
2685 case sfk_deleting_destructor:
2686 name = deleting_dtor_identifier;
2692 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2693 return build_new_method_call (exp, fn,
2695 /*conversion_path=*/NULL_TREE,
2699 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2700 ADDR is an expression which yields the store to be destroyed.
2701 AUTO_DELETE is the name of the destructor to call, i.e., either
2702 sfk_complete_destructor, sfk_base_destructor, or
2703 sfk_deleting_destructor.
2705 FLAGS is the logical disjunction of zero or more LOOKUP_
2706 flags. See cp-tree.h for more info. */
2709 build_delete (tree type, tree addr, special_function_kind auto_delete,
2710 int flags, int use_global_delete)
2714 if (addr == error_mark_node)
2715 return error_mark_node;
2717 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2718 set to `error_mark_node' before it gets properly cleaned up. */
2719 if (type == error_mark_node)
2720 return error_mark_node;
2722 type = TYPE_MAIN_VARIANT (type);
2724 if (TREE_CODE (type) == POINTER_TYPE)
2726 bool complete_p = true;
2728 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2729 if (TREE_CODE (type) == ARRAY_TYPE)
2732 /* We don't want to warn about delete of void*, only other
2733 incomplete types. Deleting other incomplete types
2734 invokes undefined behavior, but it is not ill-formed, so
2735 compile to something that would even do The Right Thing
2736 (TM) should the type have a trivial dtor and no delete
2738 if (!VOID_TYPE_P (type))
2740 complete_type (type);
2741 if (!COMPLETE_TYPE_P (type))
2743 warning (0, "possible problem detected in invocation of "
2744 "delete operator:");
2745 cxx_incomplete_type_diagnostic (addr, type, 1);
2746 inform ("neither the destructor nor the class-specific "
2747 "operator delete will be called, even if they are "
2748 "declared when the class is defined.");
2752 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2753 /* Call the builtin operator delete. */
2754 return build_builtin_delete_call (addr);
2755 if (TREE_SIDE_EFFECTS (addr))
2756 addr = save_expr (addr);
2758 /* Throw away const and volatile on target type of addr. */
2759 addr = convert_force (build_pointer_type (type), addr, 0);
2761 else if (TREE_CODE (type) == ARRAY_TYPE)
2765 if (TYPE_DOMAIN (type) == NULL_TREE)
2767 error ("unknown array size in delete");
2768 return error_mark_node;
2770 return build_vec_delete (addr, array_type_nelts (type),
2771 auto_delete, use_global_delete);
2775 /* Don't check PROTECT here; leave that decision to the
2776 destructor. If the destructor is accessible, call it,
2777 else report error. */
2778 addr = build_unary_op (ADDR_EXPR, addr, 0);
2779 if (TREE_SIDE_EFFECTS (addr))
2780 addr = save_expr (addr);
2782 addr = convert_force (build_pointer_type (type), addr, 0);
2785 gcc_assert (IS_AGGR_TYPE (type));
2787 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2789 if (auto_delete != sfk_deleting_destructor)
2790 return void_zero_node;
2792 return build_op_delete_call
2793 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2798 tree do_delete = NULL_TREE;
2801 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
2802 lazily_declare_fn (sfk_destructor, type);
2804 /* For `::delete x', we must not use the deleting destructor
2805 since then we would not be sure to get the global `operator
2807 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2809 /* We will use ADDR multiple times so we must save it. */
2810 addr = save_expr (addr);
2811 /* Delete the object. */
2812 do_delete = build_builtin_delete_call (addr);
2813 /* Otherwise, treat this like a complete object destructor
2815 auto_delete = sfk_complete_destructor;
2817 /* If the destructor is non-virtual, there is no deleting
2818 variant. Instead, we must explicitly call the appropriate
2819 `operator delete' here. */
2820 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2821 && auto_delete == sfk_deleting_destructor)
2823 /* We will use ADDR multiple times so we must save it. */
2824 addr = save_expr (addr);
2825 /* Build the call. */
2826 do_delete = build_op_delete_call (DELETE_EXPR,
2828 cxx_sizeof_nowarn (type),
2831 /* Call the complete object destructor. */
2832 auto_delete = sfk_complete_destructor;
2834 else if (auto_delete == sfk_deleting_destructor
2835 && TYPE_GETS_REG_DELETE (type))
2837 /* Make sure we have access to the member op delete, even though
2838 we'll actually be calling it from the destructor. */
2839 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2840 /*global_p=*/false, NULL_TREE);
2843 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2844 auto_delete, flags);
2846 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
2848 if (flags & LOOKUP_DESTRUCTOR)
2849 /* Explicit destructor call; don't check for null pointer. */
2850 ifexp = integer_one_node;
2852 /* Handle deleting a null pointer. */
2853 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2855 if (ifexp != integer_one_node)
2856 expr = build3 (COND_EXPR, void_type_node,
2857 ifexp, expr, void_zero_node);
2863 /* At the beginning of a destructor, push cleanups that will call the
2864 destructors for our base classes and members.
2866 Called from begin_destructor_body. */
2869 push_base_cleanups (void)
2871 tree binfo, base_binfo;
2875 VEC(tree,gc) *vbases;
2877 /* Run destructors for all virtual baseclasses. */
2878 if (CLASSTYPE_VBASECLASSES (current_class_type))
2880 tree cond = (condition_conversion
2881 (build2 (BIT_AND_EXPR, integer_type_node,
2882 current_in_charge_parm,
2883 integer_two_node)));
2885 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2886 order, which is also the right order for pushing cleanups. */
2887 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
2888 VEC_iterate (tree, vbases, i, base_binfo); i++)
2890 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
2892 expr = build_special_member_call (current_class_ref,
2893 base_dtor_identifier,
2897 | LOOKUP_NONVIRTUAL));
2898 expr = build3 (COND_EXPR, void_type_node, cond,
2899 expr, void_zero_node);
2900 finish_decl_cleanup (NULL_TREE, expr);
2905 /* Take care of the remaining baseclasses. */
2906 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2907 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2909 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2910 || BINFO_VIRTUAL_P (base_binfo))
2913 expr = build_special_member_call (current_class_ref,
2914 base_dtor_identifier,
2915 NULL_TREE, base_binfo,
2916 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2917 finish_decl_cleanup (NULL_TREE, expr);
2920 for (member = TYPE_FIELDS (current_class_type); member;
2921 member = TREE_CHAIN (member))
2923 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2925 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2927 tree this_member = (build_class_member_access_expr
2928 (current_class_ref, member,
2929 /*access_path=*/NULL_TREE,
2930 /*preserve_reference=*/false));
2931 tree this_type = TREE_TYPE (member);
2932 expr = build_delete (this_type, this_member,
2933 sfk_complete_destructor,
2934 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2936 finish_decl_cleanup (NULL_TREE, expr);
2941 /* Build a C++ vector delete expression.
2942 MAXINDEX is the number of elements to be deleted.
2943 ELT_SIZE is the nominal size of each element in the vector.
2944 BASE is the expression that should yield the store to be deleted.
2945 This function expands (or synthesizes) these calls itself.
2946 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2948 This also calls delete for virtual baseclasses of elements of the vector.
2950 Update: MAXINDEX is no longer needed. The size can be extracted from the
2951 start of the vector for pointers, and from the type for arrays. We still
2952 use MAXINDEX for arrays because it happens to already have one of the
2953 values we'd have to extract. (We could use MAXINDEX with pointers to
2954 confirm the size, and trap if the numbers differ; not clear that it'd
2955 be worth bothering.) */
2958 build_vec_delete (tree base, tree maxindex,
2959 special_function_kind auto_delete_vec, int use_global_delete)
2963 tree base_init = NULL_TREE;
2965 type = TREE_TYPE (base);
2967 if (TREE_CODE (type) == POINTER_TYPE)
2969 /* Step back one from start of vector, and read dimension. */
2972 if (TREE_SIDE_EFFECTS (base))
2974 base_init = get_target_expr (base);
2975 base = TARGET_EXPR_SLOT (base_init);
2977 type = strip_array_types (TREE_TYPE (type));
2978 cookie_addr = build2 (MINUS_EXPR,
2979 build_pointer_type (sizetype),
2981 TYPE_SIZE_UNIT (sizetype));
2982 maxindex = build_indirect_ref (cookie_addr, NULL);
2984 else if (TREE_CODE (type) == ARRAY_TYPE)
2986 /* Get the total number of things in the array, maxindex is a
2988 maxindex = array_type_nelts_total (type);
2989 type = strip_array_types (type);
2990 base = build_unary_op (ADDR_EXPR, base, 1);
2991 if (TREE_SIDE_EFFECTS (base))
2993 base_init = get_target_expr (base);
2994 base = TARGET_EXPR_SLOT (base_init);
2999 if (base != error_mark_node)
3000 error ("type to vector delete is neither pointer or array type");
3001 return error_mark_node;
3004 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3007 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);