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 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, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, 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))
189 /* Build a constructor to contain the initializations. */
190 init = build_constructor (type, NULL_TREE);
191 /* Iterate over the fields, building initializations. */
193 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
195 if (TREE_CODE (field) != FIELD_DECL)
198 /* Note that for class types there will be FIELD_DECLs
199 corresponding to base classes as well. Thus, iterating
200 over TYPE_FIELDs will result in correct initialization of
201 all of the subobjects. */
202 if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
203 inits = tree_cons (field,
204 build_zero_init (TREE_TYPE (field),
209 /* For unions, only the first field is initialized. */
210 if (TREE_CODE (type) == UNION_TYPE)
213 CONSTRUCTOR_ELTS (init) = nreverse (inits);
215 else if (TREE_CODE (type) == ARRAY_TYPE)
220 /* Build a constructor to contain the initializations. */
221 init = build_constructor (type, NULL_TREE);
222 /* Iterate over the array elements, building initializations. */
224 max_index = nelts ? nelts : 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))
231 tree elt_init = build_zero_init (TREE_TYPE (type),
234 tree range = build2 (RANGE_EXPR,
235 sizetype, size_zero_node, max_index);
237 inits = tree_cons (range, elt_init, inits);
240 CONSTRUCTOR_ELTS (init) = nreverse (inits);
243 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
245 /* In all cases, the initializer is a constant. */
248 TREE_CONSTANT (init) = 1;
249 TREE_INVARIANT (init) = 1;
255 /* Build an expression for the default-initialization of an object of
256 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
257 ARRAY_TYPE, NELTS is the number of elements in the array. If
258 initialization of TYPE requires calling constructors, this function
259 returns NULL_TREE; the caller is responsible for arranging for the
260 constructors to be called. */
263 build_default_init (tree type, tree nelts)
267 To default-initialize an object of type T means:
269 --if T is a non-POD class type (clause _class_), the default construc-
270 tor for T is called (and the initialization is ill-formed if T has
271 no accessible default constructor);
273 --if T is an array type, each element is default-initialized;
275 --otherwise, the storage for the object is zero-initialized.
277 A program that calls for default-initialization of an entity of refer-
278 ence type is ill-formed. */
280 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
281 performing the initialization. This is confusing in that some
282 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
283 a class with a pointer-to-data member as a non-static data member
284 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
285 passing non-PODs to build_zero_init below, which is contrary to
286 the semantics quoted above from [dcl.init].
288 It happens, however, that the behavior of the constructor the
289 standard says we should have generated would be precisely the
290 same as that obtained by calling build_zero_init below, so things
292 if (TYPE_NEEDS_CONSTRUCTING (type)
293 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
296 /* At this point, TYPE is either a POD class type, an array of POD
297 classes, or something even more innocuous. */
298 return build_zero_init (type, nelts, /*static_storage_p=*/false);
301 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
302 arguments. If TREE_LIST is void_type_node, an empty initializer
303 list was given; if NULL_TREE no initializer was given. */
306 perform_member_init (tree member, tree init)
309 tree type = TREE_TYPE (member);
312 explicit = (init != NULL_TREE);
314 /* Effective C++ rule 12 requires that all data members be
316 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
317 warning ("%J%qD should be initialized in the member initialization "
318 "list", current_function_decl, member);
320 if (init == void_type_node)
323 /* Get an lvalue for the data member. */
324 decl = build_class_member_access_expr (current_class_ref, member,
325 /*access_path=*/NULL_TREE,
326 /*preserve_reference=*/true);
327 if (decl == error_mark_node)
330 /* Deal with this here, as we will get confused if we try to call the
331 assignment op for an anonymous union. This can happen in a
332 synthesized copy constructor. */
333 if (ANON_AGGR_TYPE_P (type))
337 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init));
338 finish_expr_stmt (init);
341 else if (TYPE_NEEDS_CONSTRUCTING (type))
344 && TREE_CODE (type) == ARRAY_TYPE
346 && TREE_CHAIN (init) == NULL_TREE
347 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
349 /* Initialization of one array from another. */
350 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
354 finish_expr_stmt (build_aggr_init (decl, init, 0));
358 if (init == NULL_TREE)
362 init = build_default_init (type, /*nelts=*/NULL_TREE);
363 if (TREE_CODE (type) == REFERENCE_TYPE)
364 warning ("%Jdefault-initialization of %q#D, "
365 "which has reference type",
366 current_function_decl, member);
368 /* member traversal: note it leaves init NULL */
369 else if (TREE_CODE (type) == REFERENCE_TYPE)
370 pedwarn ("%Juninitialized reference member %qD",
371 current_function_decl, member);
372 else if (CP_TYPE_CONST_P (type))
373 pedwarn ("%Juninitialized member %qD with %<const%> type %qT",
374 current_function_decl, member, type);
376 else if (TREE_CODE (init) == TREE_LIST)
377 /* There was an explicit member initialization. Do some work
379 init = build_x_compound_expr_from_list (init, "member initializer");
382 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
385 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
389 expr = build_class_member_access_expr (current_class_ref, member,
390 /*access_path=*/NULL_TREE,
391 /*preserve_reference=*/false);
392 expr = build_delete (type, expr, sfk_complete_destructor,
393 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
395 if (expr != error_mark_node)
396 finish_eh_cleanup (expr);
400 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
401 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
404 build_field_list (tree t, tree list, int *uses_unions_p)
410 /* Note whether or not T is a union. */
411 if (TREE_CODE (t) == UNION_TYPE)
414 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
416 /* Skip CONST_DECLs for enumeration constants and so forth. */
417 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
420 /* Keep track of whether or not any fields are unions. */
421 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
424 /* For an anonymous struct or union, we must recursively
425 consider the fields of the anonymous type. They can be
426 directly initialized from the constructor. */
427 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
429 /* Add this field itself. Synthesized copy constructors
430 initialize the entire aggregate. */
431 list = tree_cons (fields, NULL_TREE, list);
432 /* And now add the fields in the anonymous aggregate. */
433 list = build_field_list (TREE_TYPE (fields), list,
436 /* Add this field. */
437 else if (DECL_NAME (fields))
438 list = tree_cons (fields, NULL_TREE, list);
444 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
445 a FIELD_DECL or BINFO in T that needs initialization. The
446 TREE_VALUE gives the initializer, or list of initializer arguments.
448 Return a TREE_LIST containing all of the initializations required
449 for T, in the order in which they should be performed. The output
450 list has the same format as the input. */
453 sort_mem_initializers (tree t, tree mem_inits)
456 tree base, binfo, base_binfo;
463 /* Build up a list of initializations. The TREE_PURPOSE of entry
464 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
465 TREE_VALUE will be the constructor arguments, or NULL if no
466 explicit initialization was provided. */
467 sorted_inits = NULL_TREE;
469 /* Process the virtual bases. */
470 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
471 VEC_iterate (tree, vbases, i, base); i++)
472 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
474 /* Process the direct bases. */
475 for (binfo = TYPE_BINFO (t), i = 0;
476 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
477 if (!BINFO_VIRTUAL_P (base_binfo))
478 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits);
480 /* Process the non-static data members. */
481 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
482 /* Reverse the entire list of initializations, so that they are in
483 the order that they will actually be performed. */
484 sorted_inits = nreverse (sorted_inits);
486 /* If the user presented the initializers in an order different from
487 that in which they will actually occur, we issue a warning. Keep
488 track of the next subobject which can be explicitly initialized
489 without issuing a warning. */
490 next_subobject = sorted_inits;
492 /* Go through the explicit initializers, filling in TREE_PURPOSE in
494 for (init = mem_inits; init; init = TREE_CHAIN (init))
499 subobject = TREE_PURPOSE (init);
501 /* If the explicit initializers are in sorted order, then
502 SUBOBJECT will be NEXT_SUBOBJECT, or something following
504 for (subobject_init = next_subobject;
506 subobject_init = TREE_CHAIN (subobject_init))
507 if (TREE_PURPOSE (subobject_init) == subobject)
510 /* Issue a warning if the explicit initializer order does not
511 match that which will actually occur.
512 ??? Are all these on the correct lines? */
513 if (warn_reorder && !subobject_init)
515 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
516 cp_warning_at ("%qD will be initialized after",
517 TREE_PURPOSE (next_subobject));
519 warning ("base %qT will be initialized after",
520 TREE_PURPOSE (next_subobject));
521 if (TREE_CODE (subobject) == FIELD_DECL)
522 cp_warning_at (" %q#D", subobject);
524 warning (" base %qT", subobject);
525 warning ("%J when initialized here", current_function_decl);
528 /* Look again, from the beginning of the list. */
531 subobject_init = sorted_inits;
532 while (TREE_PURPOSE (subobject_init) != subobject)
533 subobject_init = TREE_CHAIN (subobject_init);
536 /* It is invalid to initialize the same subobject more than
538 if (TREE_VALUE (subobject_init))
540 if (TREE_CODE (subobject) == FIELD_DECL)
541 error ("%Jmultiple initializations given for %qD",
542 current_function_decl, subobject);
544 error ("%Jmultiple initializations given for base %qT",
545 current_function_decl, subobject);
548 /* Record the initialization. */
549 TREE_VALUE (subobject_init) = TREE_VALUE (init);
550 next_subobject = subobject_init;
555 If a ctor-initializer specifies more than one mem-initializer for
556 multiple members of the same union (including members of
557 anonymous unions), the ctor-initializer is ill-formed. */
560 tree last_field = NULL_TREE;
561 for (init = sorted_inits; init; init = TREE_CHAIN (init))
567 /* Skip uninitialized members and base classes. */
568 if (!TREE_VALUE (init)
569 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
571 /* See if this field is a member of a union, or a member of a
572 structure contained in a union, etc. */
573 field = TREE_PURPOSE (init);
574 for (field_type = DECL_CONTEXT (field);
575 !same_type_p (field_type, t);
576 field_type = TYPE_CONTEXT (field_type))
577 if (TREE_CODE (field_type) == UNION_TYPE)
579 /* If this field is not a member of a union, skip it. */
580 if (TREE_CODE (field_type) != UNION_TYPE)
583 /* It's only an error if we have two initializers for the same
591 /* See if LAST_FIELD and the field initialized by INIT are
592 members of the same union. If so, there's a problem,
593 unless they're actually members of the same structure
594 which is itself a member of a union. For example, given:
596 union { struct { int i; int j; }; };
598 initializing both `i' and `j' makes sense. */
599 field_type = DECL_CONTEXT (field);
603 tree last_field_type;
605 last_field_type = DECL_CONTEXT (last_field);
608 if (same_type_p (last_field_type, field_type))
610 if (TREE_CODE (field_type) == UNION_TYPE)
611 error ("%Jinitializations for multiple members of %qT",
612 current_function_decl, last_field_type);
617 if (same_type_p (last_field_type, t))
620 last_field_type = TYPE_CONTEXT (last_field_type);
623 /* If we've reached the outermost class, then we're
625 if (same_type_p (field_type, t))
628 field_type = TYPE_CONTEXT (field_type);
639 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
640 is a TREE_LIST giving the explicit mem-initializer-list for the
641 constructor. The TREE_PURPOSE of each entry is a subobject (a
642 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
643 is a TREE_LIST giving the arguments to the constructor or
644 void_type_node for an empty list of arguments. */
647 emit_mem_initializers (tree mem_inits)
649 /* Sort the mem-initializers into the order in which the
650 initializations should be performed. */
651 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
653 in_base_initializer = 1;
655 /* Initialize base classes. */
657 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
659 tree subobject = TREE_PURPOSE (mem_inits);
660 tree arguments = TREE_VALUE (mem_inits);
662 /* If these initializations are taking place in a copy
663 constructor, the base class should probably be explicitly
665 if (extra_warnings && !arguments
666 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
667 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
668 warning ("%Jbase class %q#T should be explicitly initialized in the "
670 current_function_decl, BINFO_TYPE (subobject));
672 /* If an explicit -- but empty -- initializer list was present,
673 treat it just like default initialization at this point. */
674 if (arguments == void_type_node)
675 arguments = NULL_TREE;
677 /* Initialize the base. */
678 if (BINFO_VIRTUAL_P (subobject))
679 construct_virtual_base (subobject, arguments);
684 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
686 expand_aggr_init_1 (subobject, NULL_TREE,
687 build_indirect_ref (base_addr, NULL),
690 expand_cleanup_for_base (subobject, NULL_TREE);
693 mem_inits = TREE_CHAIN (mem_inits);
695 in_base_initializer = 0;
697 /* Initialize the vptrs. */
698 initialize_vtbl_ptrs (current_class_ptr);
700 /* Initialize the data members. */
703 perform_member_init (TREE_PURPOSE (mem_inits),
704 TREE_VALUE (mem_inits));
705 mem_inits = TREE_CHAIN (mem_inits);
709 /* Returns the address of the vtable (i.e., the value that should be
710 assigned to the vptr) for BINFO. */
713 build_vtbl_address (tree binfo)
715 tree binfo_for = binfo;
718 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo))
719 /* If this is a virtual primary base, then the vtable we want to store
720 is that for the base this is being used as the primary base of. We
721 can't simply skip the initialization, because we may be expanding the
722 inits of a subobject constructor where the virtual base layout
724 while (BINFO_PRIMARY_P (binfo_for))
725 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for);
727 /* Figure out what vtable BINFO's vtable is based on, and mark it as
729 vtbl = get_vtbl_decl_for_binfo (binfo_for);
730 assemble_external (vtbl);
731 TREE_USED (vtbl) = 1;
733 /* Now compute the address to use when initializing the vptr. */
734 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
735 if (TREE_CODE (vtbl) == VAR_DECL)
736 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
741 /* This code sets up the virtual function tables appropriate for
742 the pointer DECL. It is a one-ply initialization.
744 BINFO is the exact type that DECL is supposed to be. In
745 multiple inheritance, this might mean "C's A" if C : A, B. */
748 expand_virtual_init (tree binfo, tree decl)
753 /* Compute the initializer for vptr. */
754 vtbl = build_vtbl_address (binfo);
756 /* We may get this vptr from a VTT, if this is a subobject
757 constructor or subobject destructor. */
758 vtt_index = BINFO_VPTR_INDEX (binfo);
764 /* Compute the value to use, when there's a VTT. */
765 vtt_parm = current_vtt_parm;
766 vtbl2 = build2 (PLUS_EXPR,
767 TREE_TYPE (vtt_parm),
770 vtbl2 = build_indirect_ref (vtbl2, NULL);
771 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
773 /* The actual initializer is the VTT value only in the subobject
774 constructor. In maybe_clone_body we'll substitute NULL for
775 the vtt_parm in the case of the non-subobject constructor. */
776 vtbl = build3 (COND_EXPR,
778 build2 (EQ_EXPR, boolean_type_node,
779 current_in_charge_parm, integer_zero_node),
784 /* Compute the location of the vtpr. */
785 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
787 gcc_assert (vtbl_ptr != error_mark_node);
789 /* Assign the vtable to the vptr. */
790 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
791 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
794 /* If an exception is thrown in a constructor, those base classes already
795 constructed must be destroyed. This function creates the cleanup
796 for BINFO, which has just been constructed. If FLAG is non-NULL,
797 it is a DECL which is nonzero when this base needs to be
801 expand_cleanup_for_base (tree binfo, tree flag)
805 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
808 /* Call the destructor. */
809 expr = build_special_member_call (current_class_ref,
810 base_dtor_identifier,
813 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
815 expr = fold (build3 (COND_EXPR, void_type_node,
816 c_common_truthvalue_conversion (flag),
817 expr, integer_zero_node));
819 finish_eh_cleanup (expr);
822 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
826 construct_virtual_base (tree vbase, tree arguments)
832 /* If there are virtual base classes with destructors, we need to
833 emit cleanups to destroy them if an exception is thrown during
834 the construction process. These exception regions (i.e., the
835 period during which the cleanups must occur) begin from the time
836 the construction is complete to the end of the function. If we
837 create a conditional block in which to initialize the
838 base-classes, then the cleanup region for the virtual base begins
839 inside a block, and ends outside of that block. This situation
840 confuses the sjlj exception-handling code. Therefore, we do not
841 create a single conditional block, but one for each
842 initialization. (That way the cleanup regions always begin
843 in the outer block.) We trust the back-end to figure out
844 that the FLAG will not change across initializations, and
845 avoid doing multiple tests. */
846 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
847 inner_if_stmt = begin_if_stmt ();
848 finish_if_stmt_cond (flag, inner_if_stmt);
850 /* Compute the location of the virtual base. If we're
851 constructing virtual bases, then we must be the most derived
852 class. Therefore, we don't have to look up the virtual base;
853 we already know where it is. */
854 exp = convert_to_base_statically (current_class_ref, vbase);
856 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
858 finish_then_clause (inner_if_stmt);
859 finish_if_stmt (inner_if_stmt);
861 expand_cleanup_for_base (vbase, flag);
864 /* Find the context in which this FIELD can be initialized. */
867 initializing_context (tree field)
869 tree t = DECL_CONTEXT (field);
871 /* Anonymous union members can be initialized in the first enclosing
872 non-anonymous union context. */
873 while (t && ANON_AGGR_TYPE_P (t))
874 t = TYPE_CONTEXT (t);
878 /* Function to give error message if member initialization specification
879 is erroneous. FIELD is the member we decided to initialize.
880 TYPE is the type for which the initialization is being performed.
881 FIELD must be a member of TYPE.
883 MEMBER_NAME is the name of the member. */
886 member_init_ok_or_else (tree field, tree type, tree member_name)
888 if (field == error_mark_node)
892 error ("class %qT does not have any field named %qD", type,
896 if (TREE_CODE (field) == VAR_DECL)
898 error ("%q#D is a static data member; it can only be "
899 "initialized at its definition",
903 if (TREE_CODE (field) != FIELD_DECL)
905 error ("%q#D is not a non-static data member of %qT",
909 if (initializing_context (field) != type)
911 error ("class %qT does not have any field named %qD", type,
919 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
920 is a _TYPE node or TYPE_DECL which names a base for that type.
921 Check the validity of NAME, and return either the base _TYPE, base
922 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
923 NULL_TREE and issue a diagnostic.
925 An old style unnamed direct single base construction is permitted,
926 where NAME is NULL. */
929 expand_member_init (tree name)
934 if (!current_class_ref)
939 /* This is an obsolete unnamed base class initializer. The
940 parser will already have warned about its use. */
941 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
944 error ("unnamed initializer for %qT, which has no base classes",
948 basetype = BINFO_TYPE
949 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
952 error ("unnamed initializer for %qT, which uses multiple inheritance",
957 else if (TYPE_P (name))
959 basetype = TYPE_MAIN_VARIANT (name);
960 name = TYPE_NAME (name);
962 else if (TREE_CODE (name) == TYPE_DECL)
963 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
965 basetype = NULL_TREE;
974 if (current_template_parms)
977 class_binfo = TYPE_BINFO (current_class_type);
978 direct_binfo = NULL_TREE;
979 virtual_binfo = NULL_TREE;
981 /* Look for a direct base. */
982 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i)
983 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype))
986 /* Look for a virtual base -- unless the direct base is itself
988 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
989 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
993 If a mem-initializer-id is ambiguous because it designates
994 both a direct non-virtual base class and an inherited virtual
995 base class, the mem-initializer is ill-formed. */
996 if (direct_binfo && virtual_binfo)
998 error ("%qD is both a direct base and an indirect virtual base",
1003 if (!direct_binfo && !virtual_binfo)
1005 if (CLASSTYPE_VBASECLASSES (current_class_type))
1006 error ("type %qD is not a direct or virtual base of %qT",
1007 name, current_class_type);
1009 error ("type %qD is not a direct base of %qT",
1010 name, current_class_type);
1014 return direct_binfo ? direct_binfo : virtual_binfo;
1018 if (TREE_CODE (name) == IDENTIFIER_NODE)
1019 field = lookup_field (current_class_type, name, 1, false);
1023 if (member_init_ok_or_else (field, current_class_type, name))
1030 /* This is like `expand_member_init', only it stores one aggregate
1033 INIT comes in two flavors: it is either a value which
1034 is to be stored in EXP, or it is a parameter list
1035 to go to a constructor, which will operate on EXP.
1036 If INIT is not a parameter list for a constructor, then set
1037 LOOKUP_ONLYCONVERTING.
1038 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1039 the initializer, if FLAGS is 0, then it is the (init) form.
1040 If `init' is a CONSTRUCTOR, then we emit a warning message,
1041 explaining that such initializations are invalid.
1043 If INIT resolves to a CALL_EXPR which happens to return
1044 something of the type we are looking for, then we know
1045 that we can safely use that call to perform the
1048 The virtual function table pointer cannot be set up here, because
1049 we do not really know its type.
1051 This never calls operator=().
1053 When initializing, nothing is CONST.
1055 A default copy constructor may have to be used to perform the
1058 A constructor or a conversion operator may have to be used to
1059 perform the initialization, but not both, as it would be ambiguous. */
1062 build_aggr_init (tree exp, tree init, int flags)
1067 tree type = TREE_TYPE (exp);
1068 int was_const = TREE_READONLY (exp);
1069 int was_volatile = TREE_THIS_VOLATILE (exp);
1072 if (init == error_mark_node)
1073 return error_mark_node;
1075 TREE_READONLY (exp) = 0;
1076 TREE_THIS_VOLATILE (exp) = 0;
1078 if (init && TREE_CODE (init) != TREE_LIST)
1079 flags |= LOOKUP_ONLYCONVERTING;
1081 if (TREE_CODE (type) == ARRAY_TYPE)
1085 /* An array may not be initialized use the parenthesized
1086 initialization form -- unless the initializer is "()". */
1087 if (init && TREE_CODE (init) == TREE_LIST)
1089 error ("bad array initializer");
1090 return error_mark_node;
1092 /* Must arrange to initialize each element of EXP
1093 from elements of INIT. */
1094 itype = init ? TREE_TYPE (init) : NULL_TREE;
1095 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1096 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1097 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1098 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1099 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1100 itype && same_type_p (itype,
1102 TREE_READONLY (exp) = was_const;
1103 TREE_THIS_VOLATILE (exp) = was_volatile;
1104 TREE_TYPE (exp) = type;
1106 TREE_TYPE (init) = itype;
1110 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1111 /* Just know that we've seen something for this node. */
1112 TREE_USED (exp) = 1;
1114 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1115 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1116 destroy_temps = stmts_are_full_exprs_p ();
1117 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1118 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1119 init, LOOKUP_NORMAL|flags);
1120 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1121 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1122 TREE_TYPE (exp) = type;
1123 TREE_READONLY (exp) = was_const;
1124 TREE_THIS_VOLATILE (exp) = was_volatile;
1129 /* Like build_aggr_init, but not just for aggregates. */
1132 build_init (tree decl, tree init, int flags)
1136 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1137 expr = build_aggr_init (decl, init, flags);
1138 else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1139 expr = build_special_member_call (decl, complete_ctor_identifier,
1140 build_tree_list (NULL_TREE, init),
1142 LOOKUP_NORMAL|flags);
1144 expr = build2 (INIT_EXPR, TREE_TYPE (decl), decl, init);
1150 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1152 tree type = TREE_TYPE (exp);
1155 /* It fails because there may not be a constructor which takes
1156 its own type as the first (or only parameter), but which does
1157 take other types via a conversion. So, if the thing initializing
1158 the expression is a unit element of type X, first try X(X&),
1159 followed by initialization by X. If neither of these work
1160 out, then look hard. */
1164 if (init && TREE_CODE (init) != TREE_LIST
1165 && (flags & LOOKUP_ONLYCONVERTING))
1167 /* Base subobjects should only get direct-initialization. */
1168 gcc_assert (true_exp == exp);
1170 if (flags & DIRECT_BIND)
1171 /* Do nothing. We hit this in two cases: Reference initialization,
1172 where we aren't initializing a real variable, so we don't want
1173 to run a new constructor; and catching an exception, where we
1174 have already built up the constructor call so we could wrap it
1175 in an exception region. */;
1176 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1178 /* A brace-enclosed initializer for an aggregate. */
1179 gcc_assert (CP_AGGREGATE_TYPE_P (type));
1180 init = digest_init (type, init, (tree *)NULL);
1183 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1185 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1186 /* We need to protect the initialization of a catch parm with a
1187 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1188 around the TARGET_EXPR for the copy constructor. See
1189 initialize_handler_parm. */
1191 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp,
1192 TREE_OPERAND (init, 0));
1193 TREE_TYPE (init) = void_type_node;
1196 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init);
1197 TREE_SIDE_EFFECTS (init) = 1;
1198 finish_expr_stmt (init);
1202 if (init == NULL_TREE
1203 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1207 init = TREE_VALUE (parms);
1210 parms = build_tree_list (NULL_TREE, init);
1212 if (true_exp == exp)
1213 ctor_name = complete_ctor_identifier;
1215 ctor_name = base_ctor_identifier;
1217 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1218 if (TREE_SIDE_EFFECTS (rval))
1219 finish_expr_stmt (convert_to_void (rval, NULL));
1222 /* This function is responsible for initializing EXP with INIT
1225 BINFO is the binfo of the type for who we are performing the
1226 initialization. For example, if W is a virtual base class of A and B,
1228 If we are initializing B, then W must contain B's W vtable, whereas
1229 were we initializing C, W must contain C's W vtable.
1231 TRUE_EXP is nonzero if it is the true expression being initialized.
1232 In this case, it may be EXP, or may just contain EXP. The reason we
1233 need this is because if EXP is a base element of TRUE_EXP, we
1234 don't necessarily know by looking at EXP where its virtual
1235 baseclass fields should really be pointing. But we do know
1236 from TRUE_EXP. In constructors, we don't know anything about
1237 the value being initialized.
1239 FLAGS is just passed to `build_new_method_call'. See that function
1240 for its description. */
1243 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1245 tree type = TREE_TYPE (exp);
1247 gcc_assert (init != error_mark_node && type != error_mark_node);
1248 gcc_assert (building_stmt_tree ());
1250 /* Use a function returning the desired type to initialize EXP for us.
1251 If the function is a constructor, and its first argument is
1252 NULL_TREE, know that it was meant for us--just slide exp on
1253 in and expand the constructor. Constructors now come
1256 if (init && TREE_CODE (exp) == VAR_DECL
1257 && TREE_CODE (init) == CONSTRUCTOR
1258 && TREE_HAS_CONSTRUCTOR (init))
1260 /* If store_init_value returns NULL_TREE, the INIT has been
1261 record in the DECL_INITIAL for EXP. That means there's
1262 nothing more we have to do. */
1263 init = store_init_value (exp, init);
1265 finish_expr_stmt (init);
1269 /* We know that expand_default_init can handle everything we want
1271 expand_default_init (binfo, true_exp, exp, init, flags);
1274 /* Report an error if TYPE is not a user-defined, aggregate type. If
1275 OR_ELSE is nonzero, give an error message. */
1278 is_aggr_type (tree type, int or_else)
1280 if (type == error_mark_node)
1283 if (! IS_AGGR_TYPE (type)
1284 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1285 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1288 error ("%qT is not an aggregate type", type);
1295 get_type_value (tree name)
1297 if (name == error_mark_node)
1300 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1301 return IDENTIFIER_TYPE_VALUE (name);
1306 /* Build a reference to a member of an aggregate. This is not a C++
1307 `&', but really something which can have its address taken, and
1308 then act as a pointer to member, for example TYPE :: FIELD can have
1309 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1310 this expression is the operand of "&".
1312 @@ Prints out lousy diagnostics for operator <typename>
1315 @@ This function should be rewritten and placed in search.c. */
1318 build_offset_ref (tree type, tree name, bool address_p)
1322 tree basebinfo = NULL_TREE;
1323 tree orig_name = name;
1325 /* class templates can come in as TEMPLATE_DECLs here. */
1326 if (TREE_CODE (name) == TEMPLATE_DECL)
1329 if (dependent_type_p (type) || type_dependent_expression_p (name))
1330 return build_min_nt (SCOPE_REF, type, name);
1332 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1334 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1335 something like `a.template f<int>' or the like. For the most
1336 part, we treat this just like a.f. We do remember, however,
1337 the template-id that was used. */
1338 name = TREE_OPERAND (orig_name, 0);
1341 name = DECL_NAME (name);
1344 if (TREE_CODE (name) == COMPONENT_REF)
1345 name = TREE_OPERAND (name, 1);
1346 if (TREE_CODE (name) == OVERLOAD)
1347 name = DECL_NAME (OVL_CURRENT (name));
1350 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1353 if (type == NULL_TREE)
1354 return error_mark_node;
1356 /* Handle namespace names fully here. */
1357 if (TREE_CODE (type) == NAMESPACE_DECL)
1359 tree t = lookup_namespace_name (type, name);
1360 if (t == error_mark_node)
1362 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1363 /* Reconstruct the TEMPLATE_ID_EXPR. */
1364 t = build2 (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1365 t, TREE_OPERAND (orig_name, 1));
1366 if (! type_unknown_p (t))
1369 t = convert_from_reference (t);
1374 if (! is_aggr_type (type, 1))
1375 return error_mark_node;
1377 if (TREE_CODE (name) == BIT_NOT_EXPR)
1379 if (! check_dtor_name (type, name))
1380 error ("qualified type %qT does not match destructor name %<~%T%>",
1381 type, TREE_OPERAND (name, 0));
1382 name = dtor_identifier;
1385 if (!COMPLETE_TYPE_P (complete_type (type))
1386 && !TYPE_BEING_DEFINED (type))
1388 error ("incomplete type %qT does not have member %qD", type, name);
1389 return error_mark_node;
1392 /* Set up BASEBINFO for member lookup. */
1393 decl = maybe_dummy_object (type, &basebinfo);
1395 if (BASELINK_P (name) || DECL_P (name))
1399 member = lookup_member (basebinfo, name, 1, 0);
1401 if (member == error_mark_node)
1402 return error_mark_node;
1407 error ("%qD is not a member of type %qT", name, type);
1408 return error_mark_node;
1411 if (processing_template_decl)
1413 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1414 return build_min (SCOPE_REF, TREE_TYPE (member), type, orig_name);
1416 return build_min (SCOPE_REF, TREE_TYPE (member), type, name);
1419 if (TREE_CODE (member) == TYPE_DECL)
1421 TREE_USED (member) = 1;
1424 /* static class members and class-specific enum
1425 values can be returned without further ado. */
1426 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1429 return convert_from_reference (member);
1432 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1434 error ("invalid pointer to bit-field %qD", member);
1435 return error_mark_node;
1438 /* A lot of this logic is now handled in lookup_member. */
1439 if (BASELINK_P (member))
1441 /* Go from the TREE_BASELINK to the member function info. */
1442 tree fnfields = member;
1443 tree t = BASELINK_FUNCTIONS (fnfields);
1445 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1447 /* The FNFIELDS are going to contain functions that aren't
1448 necessarily templates, and templates that don't
1449 necessarily match the explicit template parameters. We
1450 save all the functions, and the explicit parameters, and
1451 then figure out exactly what to instantiate with what
1452 arguments in instantiate_type. */
1454 if (TREE_CODE (t) != OVERLOAD)
1455 /* The code in instantiate_type which will process this
1456 expects to encounter OVERLOADs, not raw functions. */
1457 t = ovl_cons (t, NULL_TREE);
1459 t = build2 (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1460 TREE_OPERAND (orig_name, 1));
1461 t = build2 (OFFSET_REF, unknown_type_node, decl, t);
1463 PTRMEM_OK_P (t) = 1;
1468 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1470 /* Get rid of a potential OVERLOAD around it. */
1471 t = OVL_CURRENT (t);
1473 /* Unique functions are handled easily. */
1475 /* For non-static member of base class, we need a special rule
1476 for access checking [class.protected]:
1478 If the access is to form a pointer to member, the
1479 nested-name-specifier shall name the derived class
1480 (or any class derived from that class). */
1481 if (address_p && DECL_P (t)
1482 && DECL_NONSTATIC_MEMBER_P (t))
1483 perform_or_defer_access_check (TYPE_BINFO (type), t);
1485 perform_or_defer_access_check (basebinfo, t);
1488 if (DECL_STATIC_FUNCTION_P (t))
1494 TREE_TYPE (fnfields) = unknown_type_node;
1498 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1499 /* We need additional test besides the one in
1500 check_accessibility_of_qualified_id in case it is
1501 a pointer to non-static member. */
1502 perform_or_defer_access_check (TYPE_BINFO (type), member);
1506 /* If MEMBER is non-static, then the program has fallen afoul of
1509 An id-expression that denotes a nonstatic data member or
1510 nonstatic member function of a class can only be used:
1512 -- as part of a class member access (_expr.ref_) in which the
1513 object-expression refers to the member's class or a class
1514 derived from that class, or
1516 -- to form a pointer to member (_expr.unary.op_), or
1518 -- in the body of a nonstatic member function of that class or
1519 of a class derived from that class (_class.mfct.nonstatic_), or
1521 -- in a mem-initializer for a constructor for that class or for
1522 a class derived from that class (_class.base.init_). */
1523 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1525 /* Build a representation of a the qualified name suitable
1526 for use as the operand to "&" -- even though the "&" is
1527 not actually present. */
1528 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1529 /* In Microsoft mode, treat a non-static member function as if
1530 it were a pointer-to-member. */
1531 if (flag_ms_extensions)
1533 PTRMEM_OK_P (member) = 1;
1534 return build_unary_op (ADDR_EXPR, member, 0);
1536 error ("invalid use of non-static member function %qD",
1537 TREE_OPERAND (member, 1));
1540 else if (TREE_CODE (member) == FIELD_DECL)
1542 error ("invalid use of non-static data member %qD", member);
1543 return error_mark_node;
1548 /* In member functions, the form `type::name' is no longer
1549 equivalent to `this->type::name', at least not until
1550 resolve_offset_ref. */
1551 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member);
1552 PTRMEM_OK_P (member) = 1;
1556 /* If DECL is a `const' declaration, and its value is a known
1557 constant, then return that value. */
1560 decl_constant_value (tree decl)
1562 /* When we build a COND_EXPR, we don't know whether it will be used
1563 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1564 to replace the second and third operands with their
1565 initializers. So, we do that here. */
1566 if (TREE_CODE (decl) == COND_EXPR)
1571 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1572 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1574 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1575 return build3 (COND_EXPR,
1577 TREE_OPERAND (decl, 0), d1, d2);
1581 && (/* Enumeration constants are constant. */
1582 TREE_CODE (decl) == CONST_DECL
1583 /* And so are variables with a 'const' type -- unless they
1584 are also 'volatile'. */
1585 || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1586 && TREE_CODE (decl) != PARM_DECL
1587 && DECL_INITIAL (decl)
1588 && DECL_INITIAL (decl) != error_mark_node
1589 /* This is invalid if initial value is not constant.
1590 If it has either a function call, a memory reference,
1591 or a variable, then re-evaluating it could give different results. */
1592 && TREE_CONSTANT (DECL_INITIAL (decl))
1593 /* Check for cases where this is sub-optimal, even though valid. */
1594 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1595 return DECL_INITIAL (decl);
1599 /* Common subroutines of build_new and build_vec_delete. */
1601 /* Call the global __builtin_delete to delete ADDR. */
1604 build_builtin_delete_call (tree addr)
1606 mark_used (global_delete_fndecl);
1607 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1610 /* Generate a representation for a C++ "new" expression. PLACEMENT is
1611 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
1612 NELTS is NULL, TYPE is the type of the storage to be allocated. If
1613 NELTS is not NULL, then this is an array-new allocation; TYPE is
1614 the type of the elements in the array and NELTS is the number of
1615 elements in the array. INIT, if non-NULL, is the initializer for
1616 the new object. If USE_GLOBAL_NEW is true, then the user
1617 explicitly wrote "::new" rather than just "new". */
1620 build_new (tree placement, tree type, tree nelts, tree init,
1625 if (type == error_mark_node)
1626 return error_mark_node;
1628 if (processing_template_decl)
1630 rval = build_min (NEW_EXPR, build_pointer_type (type),
1631 placement, type, nelts, init);
1632 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1633 TREE_SIDE_EFFECTS (rval) = 1;
1639 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false))
1640 pedwarn ("size in array new must have integral type");
1641 nelts = save_expr (cp_convert (sizetype, nelts));
1642 if (nelts == integer_zero_node)
1643 warning ("zero size array reserves no space");
1646 /* ``A reference cannot be created by the new operator. A reference
1647 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1648 returned by new.'' ARM 5.3.3 */
1649 if (TREE_CODE (type) == REFERENCE_TYPE)
1651 error ("new cannot be applied to a reference type");
1652 type = TREE_TYPE (type);
1655 if (TREE_CODE (type) == FUNCTION_TYPE)
1657 error ("new cannot be applied to a function type");
1658 return error_mark_node;
1661 rval = build4 (NEW_EXPR, build_pointer_type (type), placement, type,
1663 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1664 TREE_SIDE_EFFECTS (rval) = 1;
1665 rval = build_new_1 (rval);
1666 if (rval == error_mark_node)
1667 return error_mark_node;
1669 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1670 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1671 TREE_NO_WARNING (rval) = 1;
1676 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1679 build_java_class_ref (tree type)
1681 tree name = NULL_TREE, class_decl;
1682 static tree CL_suffix = NULL_TREE;
1683 if (CL_suffix == NULL_TREE)
1684 CL_suffix = get_identifier("class$");
1685 if (jclass_node == NULL_TREE)
1687 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1688 if (jclass_node == NULL_TREE)
1689 fatal_error ("call to Java constructor, while %<jclass%> undefined");
1691 jclass_node = TREE_TYPE (jclass_node);
1694 /* Mangle the class$ field. */
1697 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1698 if (DECL_NAME (field) == CL_suffix)
1700 mangle_decl (field);
1701 name = DECL_ASSEMBLER_NAME (field);
1705 internal_error ("can't find class$");
1708 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1709 if (class_decl == NULL_TREE)
1711 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1712 TREE_STATIC (class_decl) = 1;
1713 DECL_EXTERNAL (class_decl) = 1;
1714 TREE_PUBLIC (class_decl) = 1;
1715 DECL_ARTIFICIAL (class_decl) = 1;
1716 DECL_IGNORED_P (class_decl) = 1;
1717 pushdecl_top_level (class_decl);
1718 make_decl_rtl (class_decl);
1724 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1725 value is immediately handed to expand_expr. */
1728 build_new_1 (tree exp)
1730 tree placement, init;
1732 /* True iff this is a call to "operator new[]" instead of just
1734 bool array_p = false;
1735 /* True iff ARRAY_P is true and the bound of the array type is
1736 not necessarily a compile time constant. For example, VLA_P is
1737 true for "new int[f()]". */
1739 /* The type being allocated. If ARRAY_P is true, this will be an
1742 /* If ARRAY_P is true, the element type of the array. This is an
1743 never ARRAY_TYPE; for something like "new int[3][4]", the
1744 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1747 /* The type of the new-expression. (This type is always a pointer
1750 /* The type pointed to by POINTER_TYPE. This type may be different
1751 from ELT_TYPE for a multi-dimensional array; ELT_TYPE is never an
1752 ARRAY_TYPE, but TYPE may be an ARRAY_TYPE. */
1754 /* A pointer type pointing to to the FULL_TYPE. */
1755 tree full_pointer_type;
1756 tree outer_nelts = NULL_TREE;
1757 tree nelts = NULL_TREE;
1758 tree alloc_call, alloc_expr;
1759 /* The address returned by the call to "operator new". This node is
1760 a VAR_DECL and is therefore reusable. */
1763 tree cookie_expr, init_expr;
1764 int nothrow, check_new;
1765 /* Nonzero if the user wrote `::new' rather than just `new'. */
1766 int globally_qualified_p;
1767 int use_java_new = 0;
1768 /* If non-NULL, the number of extra bytes to allocate at the
1769 beginning of the storage allocated for an array-new expression in
1770 order to store the number of elements. */
1771 tree cookie_size = NULL_TREE;
1772 /* True if the function we are calling is a placement allocation
1774 bool placement_allocation_fn_p;
1775 tree args = NULL_TREE;
1776 /* True if the storage must be initialized, either by a constructor
1777 or due to an explicit new-initializer. */
1778 bool is_initialized;
1779 /* The address of the thing allocated, not including any cookie. In
1780 particular, if an array cookie is in use, DATA_ADDR is the
1781 address of the first array element. This node is a VAR_DECL, and
1782 is therefore reusable. */
1784 tree init_preeval_expr = NULL_TREE;
1786 placement = TREE_OPERAND (exp, 0);
1787 type = TREE_OPERAND (exp, 1);
1788 nelts = TREE_OPERAND (exp, 2);
1789 init = TREE_OPERAND (exp, 3);
1790 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1796 outer_nelts = nelts;
1799 /* ??? The middle-end will error on us for building a VLA outside a
1800 function context. Methinks that's not it's purvey. So we'll do
1801 our own VLA layout later. */
1803 full_type = build_cplus_array_type (type, NULL_TREE);
1804 index = convert (sizetype, nelts);
1805 index = size_binop (MINUS_EXPR, index, size_one_node);
1806 TYPE_DOMAIN (full_type) = build_index_type (index);
1811 if (TREE_CODE (type) == ARRAY_TYPE)
1814 nelts = array_type_nelts_top (type);
1815 outer_nelts = nelts;
1816 type = TREE_TYPE (type);
1820 /* If our base type is an array, then make sure we know how many elements
1822 for (elt_type = type;
1823 TREE_CODE (elt_type) == ARRAY_TYPE;
1824 elt_type = TREE_TYPE (elt_type))
1825 nelts = cp_build_binary_op (MULT_EXPR, nelts,
1826 array_type_nelts_top (elt_type));
1828 if (!complete_type_or_else (elt_type, exp))
1829 return error_mark_node;
1831 if (TREE_CODE (elt_type) == VOID_TYPE)
1833 error ("invalid type %<void%> for new");
1834 return error_mark_node;
1837 if (abstract_virtuals_error (NULL_TREE, elt_type))
1838 return error_mark_node;
1840 is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || init);
1841 if (CP_TYPE_CONST_P (elt_type) && !is_initialized)
1843 error ("uninitialized const in %<new%> of %q#T", elt_type);
1844 return error_mark_node;
1847 size = size_in_bytes (elt_type);
1850 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1855 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1856 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1857 ...>> to be valid. */
1858 TYPE_SIZE_UNIT (full_type) = size;
1859 n = convert (bitsizetype, nelts);
1860 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (elt_type), n);
1861 TYPE_SIZE (full_type) = bitsize;
1865 /* Allocate the object. */
1866 if (! placement && TYPE_FOR_JAVA (elt_type))
1868 tree class_addr, alloc_decl;
1869 tree class_decl = build_java_class_ref (elt_type);
1870 static const char alloc_name[] = "_Jv_AllocObject";
1874 if (!get_global_value_if_present (get_identifier (alloc_name),
1877 error ("call to Java constructor with %qs undefined", alloc_name);
1878 return error_mark_node;
1880 else if (really_overloaded_fn (alloc_decl))
1882 error ("%qD should never be overloaded", alloc_decl);
1883 return error_mark_node;
1885 alloc_decl = OVL_CURRENT (alloc_decl);
1886 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1887 alloc_call = (build_function_call
1889 build_tree_list (NULL_TREE, class_addr)));
1896 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR);
1898 if (!globally_qualified_p
1899 && CLASS_TYPE_P (elt_type)
1901 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type)
1902 : TYPE_HAS_NEW_OPERATOR (elt_type)))
1904 /* Use a class-specific operator new. */
1905 /* If a cookie is required, add some extra space. */
1906 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1908 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1909 size = size_binop (PLUS_EXPR, size, cookie_size);
1911 /* Create the argument list. */
1912 args = tree_cons (NULL_TREE, size, placement);
1913 /* Do name-lookup to find the appropriate operator. */
1914 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2);
1915 if (TREE_CODE (fns) == TREE_LIST)
1917 error ("request for member %qD is ambiguous", fnname);
1918 print_candidates (fns);
1919 return error_mark_node;
1921 alloc_call = build_new_method_call (build_dummy_object (elt_type),
1923 /*conversion_path=*/NULL_TREE,
1928 /* Use a global operator new. */
1929 /* See if a cookie might be required. */
1930 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))
1931 cookie_size = targetm.cxx.get_cookie_size (elt_type);
1933 cookie_size = NULL_TREE;
1935 alloc_call = build_operator_new_call (fnname, placement,
1936 &size, &cookie_size);
1940 if (alloc_call == error_mark_node)
1941 return error_mark_node;
1943 /* In the simple case, we can stop now. */
1944 pointer_type = build_pointer_type (type);
1945 if (!cookie_size && !is_initialized)
1946 return build_nop (pointer_type, alloc_call);
1948 /* While we're working, use a pointer to the type we've actually
1949 allocated. Store the result of the call in a variable so that we
1950 can use it more than once. */
1951 full_pointer_type = build_pointer_type (full_type);
1952 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1953 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1955 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1956 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1957 alloc_call = TREE_OPERAND (alloc_call, 1);
1958 alloc_fn = get_callee_fndecl (alloc_call);
1959 gcc_assert (alloc_fn != NULL_TREE);
1961 /* Now, check to see if this function is actually a placement
1962 allocation function. This can happen even when PLACEMENT is NULL
1963 because we might have something like:
1965 struct S { void* operator new (size_t, int i = 0); };
1967 A call to `new S' will get this allocation function, even though
1968 there is no explicit placement argument. If there is more than
1969 one argument, or there are variable arguments, then this is a
1970 placement allocation function. */
1971 placement_allocation_fn_p
1972 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1973 || varargs_function_p (alloc_fn));
1975 /* Preevaluate the placement args so that we don't reevaluate them for a
1976 placement delete. */
1977 if (placement_allocation_fn_p)
1980 stabilize_call (alloc_call, &inits);
1982 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1986 /* unless an allocation function is declared with an empty excep-
1987 tion-specification (_except.spec_), throw(), it indicates failure to
1988 allocate storage by throwing a bad_alloc exception (clause _except_,
1989 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1990 cation function is declared with an empty exception-specification,
1991 throw(), it returns null to indicate failure to allocate storage and a
1992 non-null pointer otherwise.
1994 So check for a null exception spec on the op new we just called. */
1996 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
1997 check_new = (flag_check_new || nothrow) && ! use_java_new;
2004 /* Adjust so we're pointing to the start of the object. */
2005 data_addr = get_target_expr (build2 (PLUS_EXPR, full_pointer_type,
2006 alloc_node, cookie_size));
2008 /* Store the number of bytes allocated so that we can know how
2009 many elements to destroy later. We use the last sizeof
2010 (size_t) bytes to store the number of elements. */
2011 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
2012 data_addr, size_in_bytes (sizetype));
2013 cookie = build_indirect_ref (cookie_ptr, NULL);
2015 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts);
2017 if (targetm.cxx.cookie_has_size ())
2019 /* Also store the element size. */
2020 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype),
2021 cookie_ptr, size_in_bytes (sizetype));
2022 cookie = build_indirect_ref (cookie_ptr, NULL);
2023 cookie = build2 (MODIFY_EXPR, sizetype, cookie,
2024 size_in_bytes(elt_type));
2025 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2026 cookie, cookie_expr);
2028 data_addr = TARGET_EXPR_SLOT (data_addr);
2032 cookie_expr = NULL_TREE;
2033 data_addr = alloc_node;
2036 /* Now initialize the allocated object. Note that we preevaluate the
2037 initialization expression, apart from the actual constructor call or
2038 assignment--we do this because we want to delay the allocation as long
2039 as possible in order to minimize the size of the exception region for
2040 placement delete. */
2045 init_expr = build_indirect_ref (data_addr, NULL);
2047 if (init == void_zero_node)
2048 init = build_default_init (full_type, nelts);
2049 else if (init && array_p)
2050 pedwarn ("ISO C++ forbids initialization in array new");
2055 = build_vec_init (init_expr,
2056 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2058 init, /*from_array=*/0);
2060 /* An array initialization is stable because the initialization
2061 of each element is a full-expression, so the temporaries don't
2065 else if (TYPE_NEEDS_CONSTRUCTING (type))
2067 init_expr = build_special_member_call (init_expr,
2068 complete_ctor_identifier,
2071 stable = stabilize_init (init_expr, &init_preeval_expr);
2075 /* We are processing something like `new int (10)', which
2076 means allocate an int, and initialize it with 10. */
2078 if (TREE_CODE (init) == TREE_LIST)
2079 init = build_x_compound_expr_from_list (init, "new initializer");
2082 gcc_assert (TREE_CODE (init) != CONSTRUCTOR
2083 || TREE_TYPE (init) != NULL_TREE);
2085 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2086 stable = stabilize_init (init_expr, &init_preeval_expr);
2089 if (init_expr == error_mark_node)
2090 return error_mark_node;
2092 /* If any part of the object initialization terminates by throwing an
2093 exception and a suitable deallocation function can be found, the
2094 deallocation function is called to free the memory in which the
2095 object was being constructed, after which the exception continues
2096 to propagate in the context of the new-expression. If no
2097 unambiguous matching deallocation function can be found,
2098 propagating the exception does not cause the object's memory to be
2100 if (flag_exceptions && ! use_java_new)
2102 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR;
2105 /* The Standard is unclear here, but the right thing to do
2106 is to use the same method for finding deallocation
2107 functions that we use for finding allocation functions. */
2108 cleanup = build_op_delete_call (dcode, alloc_node, size,
2109 globally_qualified_p,
2110 (placement_allocation_fn_p
2111 ? alloc_call : NULL_TREE));
2116 /* This is much simpler if we were able to preevaluate all of
2117 the arguments to the constructor call. */
2118 init_expr = build2 (TRY_CATCH_EXPR, void_type_node,
2119 init_expr, cleanup);
2121 /* Ack! First we allocate the memory. Then we set our sentry
2122 variable to true, and expand a cleanup that deletes the
2123 memory if sentry is true. Then we run the constructor, and
2124 finally clear the sentry.
2126 We need to do this because we allocate the space first, so
2127 if there are any temporaries with cleanups in the
2128 constructor args and we weren't able to preevaluate them, we
2129 need this EH region to extend until end of full-expression
2130 to preserve nesting. */
2132 tree end, sentry, begin;
2134 begin = get_target_expr (boolean_true_node);
2135 CLEANUP_EH_ONLY (begin) = 1;
2137 sentry = TARGET_EXPR_SLOT (begin);
2139 TARGET_EXPR_CLEANUP (begin)
2140 = build3 (COND_EXPR, void_type_node, sentry,
2141 cleanup, void_zero_node);
2143 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry),
2144 sentry, boolean_false_node);
2147 = build2 (COMPOUND_EXPR, void_type_node, begin,
2148 build2 (COMPOUND_EXPR, void_type_node, init_expr,
2155 init_expr = NULL_TREE;
2157 /* Now build up the return value in reverse order. */
2162 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2164 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2166 if (rval == alloc_node)
2167 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2168 and return the call (which doesn't need to be adjusted). */
2169 rval = TARGET_EXPR_INITIAL (alloc_expr);
2174 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2176 rval = build_conditional_expr (ifexp, rval, alloc_node);
2179 /* Perform the allocation before anything else, so that ALLOC_NODE
2180 has been initialized before we start using it. */
2181 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2184 if (init_preeval_expr)
2185 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2187 /* Convert to the final type. */
2188 rval = build_nop (pointer_type, rval);
2190 /* A new-expression is never an lvalue. */
2191 if (real_lvalue_p (rval))
2192 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2198 build_vec_delete_1 (tree base, tree maxindex, tree type,
2199 special_function_kind auto_delete_vec, int use_global_delete)
2202 tree ptype = build_pointer_type (type = complete_type (type));
2203 tree size_exp = size_in_bytes (type);
2205 /* Temporary variables used by the loop. */
2206 tree tbase, tbase_init;
2208 /* This is the body of the loop that implements the deletion of a
2209 single element, and moves temp variables to next elements. */
2212 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2215 /* This is the thing that governs what to do after the loop has run. */
2216 tree deallocate_expr = 0;
2218 /* This is the BIND_EXPR which holds the outermost iterator of the
2219 loop. It is convenient to set this variable up and test it before
2220 executing any other code in the loop.
2221 This is also the containing expression returned by this function. */
2222 tree controller = NULL_TREE;
2224 /* We should only have 1-D arrays here. */
2225 gcc_assert (TREE_CODE (type) != ARRAY_TYPE);
2227 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2230 /* The below is short by the cookie size. */
2231 virtual_size = size_binop (MULT_EXPR, size_exp,
2232 convert (sizetype, maxindex));
2234 tbase = create_temporary_var (ptype);
2235 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2236 fold (build2 (PLUS_EXPR, ptype,
2239 DECL_REGISTER (tbase) = 1;
2240 controller = build3 (BIND_EXPR, void_type_node, tbase,
2241 NULL_TREE, NULL_TREE);
2242 TREE_SIDE_EFFECTS (controller) = 1;
2244 body = build1 (EXIT_EXPR, void_type_node,
2245 build2 (EQ_EXPR, boolean_type_node, base, tbase));
2246 body = build_compound_expr
2247 (body, build_modify_expr (tbase, NOP_EXPR,
2248 build2 (MINUS_EXPR, ptype, tbase, size_exp)));
2249 body = build_compound_expr
2250 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2251 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2253 loop = build1 (LOOP_EXPR, void_type_node, body);
2254 loop = build_compound_expr (tbase_init, loop);
2257 /* If the delete flag is one, or anything else with the low bit set,
2258 delete the storage. */
2259 if (auto_delete_vec != sfk_base_destructor)
2263 /* The below is short by the cookie size. */
2264 virtual_size = size_binop (MULT_EXPR, size_exp,
2265 convert (sizetype, maxindex));
2267 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2274 cookie_size = targetm.cxx.get_cookie_size (type);
2276 = cp_convert (ptype,
2277 cp_build_binary_op (MINUS_EXPR,
2278 cp_convert (string_type_node,
2281 /* True size with header. */
2282 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2285 if (auto_delete_vec == sfk_deleting_destructor)
2286 deallocate_expr = build_x_delete (base_tbd,
2287 2 | use_global_delete,
2292 if (!deallocate_expr)
2295 body = deallocate_expr;
2297 body = build_compound_expr (body, deallocate_expr);
2300 body = integer_zero_node;
2302 /* Outermost wrapper: If pointer is null, punt. */
2303 body = fold (build3 (COND_EXPR, void_type_node,
2304 fold (build2 (NE_EXPR, boolean_type_node, base,
2305 convert (TREE_TYPE (base),
2306 integer_zero_node))),
2307 body, integer_zero_node));
2308 body = build1 (NOP_EXPR, void_type_node, body);
2312 TREE_OPERAND (controller, 1) = body;
2316 if (TREE_CODE (base) == SAVE_EXPR)
2317 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2318 body = build2 (COMPOUND_EXPR, void_type_node, base, body);
2320 return convert_to_void (body, /*implicit=*/NULL);
2323 /* Create an unnamed variable of the indicated TYPE. */
2326 create_temporary_var (tree type)
2330 decl = build_decl (VAR_DECL, NULL_TREE, type);
2331 TREE_USED (decl) = 1;
2332 DECL_ARTIFICIAL (decl) = 1;
2333 DECL_SOURCE_LOCATION (decl) = input_location;
2334 DECL_IGNORED_P (decl) = 1;
2335 DECL_CONTEXT (decl) = current_function_decl;
2340 /* Create a new temporary variable of the indicated TYPE, initialized
2343 It is not entered into current_binding_level, because that breaks
2344 things when it comes time to do final cleanups (which take place
2345 "outside" the binding contour of the function). */
2348 get_temp_regvar (tree type, tree init)
2352 decl = create_temporary_var (type);
2353 add_decl_expr (decl);
2355 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2360 /* `build_vec_init' returns tree structure that performs
2361 initialization of a vector of aggregate types.
2363 BASE is a reference to the vector, of ARRAY_TYPE.
2364 MAXINDEX is the maximum index of the array (one less than the
2365 number of elements). It is only used if
2366 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2367 INIT is the (possibly NULL) initializer.
2369 FROM_ARRAY is 0 if we should init everything with INIT
2370 (i.e., every element initialized from INIT).
2371 FROM_ARRAY is 1 if we should index into INIT in parallel
2372 with initialization of DECL.
2373 FROM_ARRAY is 2 if we should index into INIT in parallel,
2374 but use assignment instead of initialization. */
2377 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2380 tree base2 = NULL_TREE;
2382 tree itype = NULL_TREE;
2384 /* The type of the array. */
2385 tree atype = TREE_TYPE (base);
2386 /* The type of an element in the array. */
2387 tree type = TREE_TYPE (atype);
2388 /* The type of a pointer to an element in the array. */
2393 tree try_block = NULL_TREE;
2394 int num_initialized_elts = 0;
2397 if (TYPE_DOMAIN (atype))
2398 maxindex = array_type_nelts (atype);
2400 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2401 return error_mark_node;
2405 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2406 : !TYPE_NEEDS_CONSTRUCTING (type))
2407 && ((TREE_CODE (init) == CONSTRUCTOR
2408 /* Don't do this if the CONSTRUCTOR might contain something
2409 that might throw and require us to clean up. */
2410 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2411 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2414 /* Do non-default initialization of POD arrays resulting from
2415 brace-enclosed initializers. In this case, digest_init and
2416 store_constructor will handle the semantics for us. */
2418 stmt_expr = build2 (INIT_EXPR, atype, base, init);
2422 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2423 ptype = build_pointer_type (type);
2424 size = size_in_bytes (type);
2425 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2426 base = cp_convert (ptype, decay_conversion (base));
2428 /* The code we are generating looks like:
2432 ptrdiff_t iterator = maxindex;
2434 for (; iterator != -1; --iterator) {
2435 ... initialize *t1 ...
2439 ... destroy elements that were constructed ...
2444 We can omit the try and catch blocks if we know that the
2445 initialization will never throw an exception, or if the array
2446 elements do not have destructors. We can omit the loop completely if
2447 the elements of the array do not have constructors.
2449 We actually wrap the entire body of the above in a STMT_EXPR, for
2452 When copying from array to another, when the array elements have
2453 only trivial copy constructors, we should use __builtin_memcpy
2454 rather than generating a loop. That way, we could take advantage
2455 of whatever cleverness the back-end has for dealing with copies
2456 of blocks of memory. */
2458 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2459 destroy_temps = stmts_are_full_exprs_p ();
2460 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2461 rval = get_temp_regvar (ptype, base);
2462 base = get_temp_regvar (ptype, rval);
2463 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2465 /* Protect the entire array initialization so that we can destroy
2466 the partially constructed array if an exception is thrown.
2467 But don't do this if we're assigning. */
2468 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2471 try_block = begin_try_block ();
2474 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2476 /* Do non-default initialization of non-POD arrays resulting from
2477 brace-enclosed initializers. */
2482 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2484 tree elt = TREE_VALUE (elts);
2485 tree baseref = build1 (INDIRECT_REF, type, base);
2487 num_initialized_elts++;
2489 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2490 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2491 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2493 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2495 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2497 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2498 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2501 /* Clear out INIT so that we don't get confused below. */
2504 else if (from_array)
2506 /* If initializing one array from another, initialize element by
2507 element. We rely upon the below calls the do argument
2511 base2 = decay_conversion (init);
2512 itype = TREE_TYPE (base2);
2513 base2 = get_temp_regvar (itype, base2);
2514 itype = TREE_TYPE (itype);
2516 else if (TYPE_LANG_SPECIFIC (type)
2517 && TYPE_NEEDS_CONSTRUCTING (type)
2518 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2520 error ("initializer ends prematurely");
2521 return error_mark_node;
2525 /* Now, default-initialize any remaining elements. We don't need to
2526 do that if a) the type does not need constructing, or b) we've
2527 already initialized all the elements.
2529 We do need to keep going if we're copying an array. */
2532 || (TYPE_NEEDS_CONSTRUCTING (type)
2533 && ! (host_integerp (maxindex, 0)
2534 && (num_initialized_elts
2535 == tree_low_cst (maxindex, 0) + 1))))
2537 /* If the ITERATOR is equal to -1, then we don't have to loop;
2538 we've already initialized all the elements. */
2542 for_stmt = begin_for_stmt ();
2543 finish_for_init_stmt (for_stmt);
2544 finish_for_cond (build2 (NE_EXPR, boolean_type_node,
2545 iterator, integer_minus_one_node),
2547 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2552 tree to = build1 (INDIRECT_REF, type, base);
2556 from = build1 (INDIRECT_REF, itype, base2);
2560 if (from_array == 2)
2561 elt_init = build_modify_expr (to, NOP_EXPR, from);
2562 else if (TYPE_NEEDS_CONSTRUCTING (type))
2563 elt_init = build_aggr_init (to, from, 0);
2565 elt_init = build_modify_expr (to, NOP_EXPR, from);
2569 else if (TREE_CODE (type) == ARRAY_TYPE)
2573 ("cannot initialize multi-dimensional array with initializer");
2574 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2578 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
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)
2603 m = cp_build_binary_op (MULT_EXPR, m,
2604 array_type_nelts_total (type));
2605 type = strip_array_types (type);
2608 finish_cleanup_try_block (try_block);
2609 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2610 /*use_global_delete=*/0);
2611 finish_cleanup (e, try_block);
2614 /* The value of the array initialization is the array itself, RVAL
2615 is a pointer to the first element. */
2616 finish_stmt_expr_expr (rval, stmt_expr);
2618 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2620 /* Now convert make the result have the correct type. */
2621 atype = build_pointer_type (atype);
2622 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2623 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2625 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2629 /* Free up storage of type TYPE, at address ADDR.
2631 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2634 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2635 used as the second argument to operator delete. It can include
2636 things like padding and magic size cookies. It has virtual in it,
2637 because if you have a base pointer and you delete through a virtual
2638 destructor, it should be the size of the dynamic object, not the
2639 static object, see Free Store 12.5 ISO C++.
2641 This does not call any destructors. */
2644 build_x_delete (tree addr, int which_delete, tree virtual_size)
2646 int use_global_delete = which_delete & 1;
2647 int use_vec_delete = !!(which_delete & 2);
2648 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2650 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2654 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2658 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2664 case sfk_complete_destructor:
2665 name = complete_dtor_identifier;
2668 case sfk_base_destructor:
2669 name = base_dtor_identifier;
2672 case sfk_deleting_destructor:
2673 name = deleting_dtor_identifier;
2679 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2680 return build_new_method_call (exp, fn,
2682 /*conversion_path=*/NULL_TREE,
2686 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2687 ADDR is an expression which yields the store to be destroyed.
2688 AUTO_DELETE is the name of the destructor to call, i.e., either
2689 sfk_complete_destructor, sfk_base_destructor, or
2690 sfk_deleting_destructor.
2692 FLAGS is the logical disjunction of zero or more LOOKUP_
2693 flags. See cp-tree.h for more info. */
2696 build_delete (tree type, tree addr, special_function_kind auto_delete,
2697 int flags, int use_global_delete)
2701 if (addr == error_mark_node)
2702 return error_mark_node;
2704 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2705 set to `error_mark_node' before it gets properly cleaned up. */
2706 if (type == error_mark_node)
2707 return error_mark_node;
2709 type = TYPE_MAIN_VARIANT (type);
2711 if (TREE_CODE (type) == POINTER_TYPE)
2713 bool complete_p = true;
2715 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2716 if (TREE_CODE (type) == ARRAY_TYPE)
2719 /* We don't want to warn about delete of void*, only other
2720 incomplete types. Deleting other incomplete types
2721 invokes undefined behavior, but it is not ill-formed, so
2722 compile to something that would even do The Right Thing
2723 (TM) should the type have a trivial dtor and no delete
2725 if (!VOID_TYPE_P (type))
2727 complete_type (type);
2728 if (!COMPLETE_TYPE_P (type))
2730 warning ("possible problem detected in invocation of "
2731 "delete operator:");
2732 cxx_incomplete_type_diagnostic (addr, type, 1);
2733 inform ("neither the destructor nor the class-specific "
2734 "operator delete will be called, even if they are "
2735 "declared when the class is defined.");
2739 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2740 /* Call the builtin operator delete. */
2741 return build_builtin_delete_call (addr);
2742 if (TREE_SIDE_EFFECTS (addr))
2743 addr = save_expr (addr);
2745 /* Throw away const and volatile on target type of addr. */
2746 addr = convert_force (build_pointer_type (type), addr, 0);
2748 else if (TREE_CODE (type) == ARRAY_TYPE)
2752 if (TYPE_DOMAIN (type) == NULL_TREE)
2754 error ("unknown array size in delete");
2755 return error_mark_node;
2757 return build_vec_delete (addr, array_type_nelts (type),
2758 auto_delete, use_global_delete);
2762 /* Don't check PROTECT here; leave that decision to the
2763 destructor. If the destructor is accessible, call it,
2764 else report error. */
2765 addr = build_unary_op (ADDR_EXPR, addr, 0);
2766 if (TREE_SIDE_EFFECTS (addr))
2767 addr = save_expr (addr);
2769 addr = convert_force (build_pointer_type (type), addr, 0);
2772 gcc_assert (IS_AGGR_TYPE (type));
2774 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2776 if (auto_delete != sfk_deleting_destructor)
2777 return void_zero_node;
2779 return build_op_delete_call
2780 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2785 tree do_delete = NULL_TREE;
2788 gcc_assert (TYPE_HAS_DESTRUCTOR (type));
2790 /* For `::delete x', we must not use the deleting destructor
2791 since then we would not be sure to get the global `operator
2793 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2795 /* We will use ADDR multiple times so we must save it. */
2796 addr = save_expr (addr);
2797 /* Delete the object. */
2798 do_delete = build_builtin_delete_call (addr);
2799 /* Otherwise, treat this like a complete object destructor
2801 auto_delete = sfk_complete_destructor;
2803 /* If the destructor is non-virtual, there is no deleting
2804 variant. Instead, we must explicitly call the appropriate
2805 `operator delete' here. */
2806 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2807 && auto_delete == sfk_deleting_destructor)
2809 /* We will use ADDR multiple times so we must save it. */
2810 addr = save_expr (addr);
2811 /* Build the call. */
2812 do_delete = build_op_delete_call (DELETE_EXPR,
2814 cxx_sizeof_nowarn (type),
2817 /* Call the complete object destructor. */
2818 auto_delete = sfk_complete_destructor;
2820 else if (auto_delete == sfk_deleting_destructor
2821 && TYPE_GETS_REG_DELETE (type))
2823 /* Make sure we have access to the member op delete, even though
2824 we'll actually be calling it from the destructor. */
2825 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2826 /*global_p=*/false, NULL_TREE);
2829 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2830 auto_delete, flags);
2832 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete);
2834 if (flags & LOOKUP_DESTRUCTOR)
2835 /* Explicit destructor call; don't check for null pointer. */
2836 ifexp = integer_one_node;
2838 /* Handle deleting a null pointer. */
2839 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2841 if (ifexp != integer_one_node)
2842 expr = build3 (COND_EXPR, void_type_node,
2843 ifexp, expr, void_zero_node);
2849 /* At the beginning of a destructor, push cleanups that will call the
2850 destructors for our base classes and members.
2852 Called from begin_destructor_body. */
2855 push_base_cleanups (void)
2857 tree binfo, base_binfo;
2863 /* Run destructors for all virtual baseclasses. */
2864 if (CLASSTYPE_VBASECLASSES (current_class_type))
2866 tree cond = (condition_conversion
2867 (build2 (BIT_AND_EXPR, integer_type_node,
2868 current_in_charge_parm,
2869 integer_two_node)));
2871 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2872 order, which is also the right order for pushing cleanups. */
2873 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0;
2874 VEC_iterate (tree, vbases, i, base_binfo); i++)
2876 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)))
2878 expr = build_special_member_call (current_class_ref,
2879 base_dtor_identifier,
2883 | LOOKUP_NONVIRTUAL));
2884 expr = build3 (COND_EXPR, void_type_node, cond,
2885 expr, void_zero_node);
2886 finish_decl_cleanup (NULL_TREE, expr);
2891 /* Take care of the remaining baseclasses. */
2892 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2893 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2895 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2896 || BINFO_VIRTUAL_P (base_binfo))
2899 expr = build_special_member_call (current_class_ref,
2900 base_dtor_identifier,
2901 NULL_TREE, base_binfo,
2902 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2903 finish_decl_cleanup (NULL_TREE, expr);
2906 for (member = TYPE_FIELDS (current_class_type); member;
2907 member = TREE_CHAIN (member))
2909 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2911 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2913 tree this_member = (build_class_member_access_expr
2914 (current_class_ref, member,
2915 /*access_path=*/NULL_TREE,
2916 /*preserve_reference=*/false));
2917 tree this_type = TREE_TYPE (member);
2918 expr = build_delete (this_type, this_member,
2919 sfk_complete_destructor,
2920 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2922 finish_decl_cleanup (NULL_TREE, expr);
2927 /* For type TYPE, delete the virtual baseclass objects of DECL. */
2930 build_vbase_delete (tree type, tree decl)
2936 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
2938 gcc_assert (addr != error_mark_node);
2940 result = convert_to_void (integer_zero_node, NULL);
2941 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
2942 VEC_iterate (tree, vbases, ix, binfo); ix++)
2944 tree base_addr = convert_force
2945 (build_pointer_type (BINFO_TYPE (binfo)), addr, 0);
2946 tree base_delete = build_delete
2947 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
2948 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
2950 result = build_compound_expr (result, base_delete);
2955 /* Build a C++ vector delete expression.
2956 MAXINDEX is the number of elements to be deleted.
2957 ELT_SIZE is the nominal size of each element in the vector.
2958 BASE is the expression that should yield the store to be deleted.
2959 This function expands (or synthesizes) these calls itself.
2960 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2962 This also calls delete for virtual baseclasses of elements of the vector.
2964 Update: MAXINDEX is no longer needed. The size can be extracted from the
2965 start of the vector for pointers, and from the type for arrays. We still
2966 use MAXINDEX for arrays because it happens to already have one of the
2967 values we'd have to extract. (We could use MAXINDEX with pointers to
2968 confirm the size, and trap if the numbers differ; not clear that it'd
2969 be worth bothering.) */
2972 build_vec_delete (tree base, tree maxindex,
2973 special_function_kind auto_delete_vec, int use_global_delete)
2977 tree base_init = NULL_TREE;
2979 type = TREE_TYPE (base);
2981 if (TREE_CODE (type) == POINTER_TYPE)
2983 /* Step back one from start of vector, and read dimension. */
2986 if (TREE_SIDE_EFFECTS (base))
2988 base_init = get_target_expr (base);
2989 base = TARGET_EXPR_SLOT (base_init);
2991 type = strip_array_types (TREE_TYPE (type));
2992 cookie_addr = build2 (MINUS_EXPR,
2993 build_pointer_type (sizetype),
2995 TYPE_SIZE_UNIT (sizetype));
2996 maxindex = build_indirect_ref (cookie_addr, NULL);
2998 else if (TREE_CODE (type) == ARRAY_TYPE)
3000 /* Get the total number of things in the array, maxindex is a
3002 maxindex = array_type_nelts_total (type);
3003 type = strip_array_types (type);
3004 base = build_unary_op (ADDR_EXPR, base, 1);
3005 if (TREE_SIDE_EFFECTS (base))
3007 base_init = get_target_expr (base);
3008 base = TARGET_EXPR_SLOT (base_init);
3013 if (base != error_mark_node)
3014 error ("type to vector delete is neither pointer or array type");
3015 return error_mark_node;
3018 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3021 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);