1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC 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 GNU CC 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 GNU CC; 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. */
37 static void expand_aggr_vbase_init_1 PARAMS ((tree, tree, tree, tree));
38 static void construct_virtual_bases PARAMS ((tree, tree, tree, tree, tree));
39 static void expand_aggr_init_1 PARAMS ((tree, tree, tree, tree, int));
40 static void expand_default_init PARAMS ((tree, tree, tree, tree, int));
41 static tree build_vec_delete_1 PARAMS ((tree, tree, tree, special_function_kind, int));
42 static void perform_member_init PARAMS ((tree, tree, int));
43 static void sort_base_init PARAMS ((tree, tree, tree *, tree *));
44 static tree build_builtin_delete_call PARAMS ((tree));
45 static int member_init_ok_or_else PARAMS ((tree, tree, tree));
46 static void expand_virtual_init PARAMS ((tree, tree));
47 static tree sort_member_init PARAMS ((tree, tree));
48 static tree initializing_context PARAMS ((tree));
49 static void expand_cleanup_for_base PARAMS ((tree, tree));
50 static tree get_temp_regvar PARAMS ((tree, tree));
51 static tree dfs_initialize_vtbl_ptrs PARAMS ((tree, void *));
52 static tree build_default_init PARAMS ((tree));
53 static tree build_new_1 PARAMS ((tree));
54 static tree get_cookie_size PARAMS ((tree));
55 static tree build_dtor_call PARAMS ((tree, special_function_kind, int));
56 static tree build_field_list PARAMS ((tree, tree, int *));
57 static tree build_vtbl_address PARAMS ((tree));
59 /* We are about to generate some complex initialization code.
60 Conceptually, it is all a single expression. However, we may want
61 to include conditionals, loops, and other such statement-level
62 constructs. Therefore, we build the initialization code inside a
63 statement-expression. This function starts such an expression.
64 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
65 pass them back to finish_init_stmts when the expression is
69 begin_init_stmts (stmt_expr_p, compound_stmt_p)
71 tree *compound_stmt_p;
73 if (building_stmt_tree ())
74 *stmt_expr_p = begin_stmt_expr ();
76 *stmt_expr_p = begin_global_stmt_expr ();
78 if (building_stmt_tree ())
79 *compound_stmt_p = begin_compound_stmt (/*has_no_scope=*/1);
82 *compound_stmt_p = genrtl_begin_compound_stmt (has_no_scope=1);
86 /* Finish out the statement-expression begun by the previous call to
87 begin_init_stmts. Returns the statement-expression itself. */
90 finish_init_stmts (stmt_expr, compound_stmt)
95 if (building_stmt_tree ())
96 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
98 if (building_stmt_tree ())
99 stmt_expr = finish_stmt_expr (stmt_expr);
101 stmt_expr = finish_global_stmt_expr (stmt_expr);
103 /* To avoid spurious warnings about unused values, we set
106 TREE_USED (stmt_expr) = 1;
113 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
114 which we want to initialize the vtable pointer for, DATA is
115 TREE_LIST whose TREE_VALUE is the this ptr expression. */
118 dfs_initialize_vtbl_ptrs (binfo, data)
122 if ((!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
123 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
125 tree base_ptr = TREE_VALUE ((tree) data);
127 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
129 expand_virtual_init (binfo, base_ptr);
132 SET_BINFO_MARKED (binfo);
137 /* Initialize all the vtable pointers in the object pointed to by
141 initialize_vtbl_ptrs (addr)
147 type = TREE_TYPE (TREE_TYPE (addr));
148 list = build_tree_list (type, addr);
150 /* Walk through the hierarchy, initializing the vptr in each base
151 class. We do these in pre-order because can't find the virtual
152 bases for a class until we've initialized the vtbl for that
154 dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
155 NULL, dfs_unmarked_real_bases_queue_p, list);
156 dfs_walk (TYPE_BINFO (type), dfs_unmark,
157 dfs_marked_real_bases_queue_p, type);
162 To default-initialize an object of type T means:
164 --if T is a non-POD class type (clause _class_), the default construc-
165 tor for T is called (and the initialization is ill-formed if T has
166 no accessible default constructor);
168 --if T is an array type, each element is default-initialized;
170 --otherwise, the storage for the object is zero-initialized.
172 A program that calls for default-initialization of an entity of refer-
173 ence type is ill-formed. */
176 build_default_init (type)
179 tree init = NULL_TREE;
181 if (TYPE_NEEDS_CONSTRUCTING (type))
182 /* Other code will handle running the default constructor. We can't do
183 anything with a CONSTRUCTOR for arrays here, as that would imply
184 copy-initialization. */
186 else if (AGGREGATE_TYPE_P (type) && !TYPE_PTRMEMFUNC_P (type))
188 /* This is a default initialization of an aggregate, but not one of
189 non-POD class type. We cleverly notice that the initialization
190 rules in such a case are the same as for initialization with an
191 empty brace-initialization list. */
192 init = build (CONSTRUCTOR, NULL_TREE, NULL_TREE, NULL_TREE);
194 else if (TREE_CODE (type) == REFERENCE_TYPE)
195 /* --if T is a reference type, no initialization is performed. */
199 init = integer_zero_node;
201 if (TREE_CODE (type) == ENUMERAL_TYPE)
202 /* We must make enumeral types the right type. */
203 init = fold (build1 (NOP_EXPR, type, init));
206 init = digest_init (type, init, 0);
210 /* Subroutine of emit_base_init. */
213 perform_member_init (member, init, explicit)
218 tree type = TREE_TYPE (member);
220 decl = build_component_ref (current_class_ref, member, NULL_TREE, explicit);
222 if (decl == error_mark_node)
225 /* Deal with this here, as we will get confused if we try to call the
226 assignment op for an anonymous union. This can happen in a
227 synthesized copy constructor. */
228 if (ANON_AGGR_TYPE_P (type))
232 init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
233 finish_expr_stmt (init);
236 else if (TYPE_NEEDS_CONSTRUCTING (type)
237 || (init && TYPE_HAS_CONSTRUCTOR (type)))
239 /* Since `init' is already a TREE_LIST on the member_init_list,
240 only build it into one if we aren't already a list. */
241 if (init != NULL_TREE && TREE_CODE (init) != TREE_LIST)
242 init = build_tree_list (NULL_TREE, init);
245 && TREE_CODE (type) == ARRAY_TYPE
247 && TREE_CHAIN (init) == NULL_TREE
248 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
250 /* Initialization of one array from another. */
251 finish_expr_stmt (build_vec_init (decl, TREE_VALUE (init), 1));
254 finish_expr_stmt (build_aggr_init (decl, init, 0));
258 if (init == NULL_TREE)
262 init = build_default_init (type);
263 if (TREE_CODE (type) == REFERENCE_TYPE)
265 ("default-initialization of `%#D', which has reference type",
268 /* member traversal: note it leaves init NULL */
269 else if (TREE_CODE (type) == REFERENCE_TYPE)
270 pedwarn ("uninitialized reference member `%D'", member);
272 else if (TREE_CODE (init) == TREE_LIST)
274 /* There was an explicit member initialization. Do some
275 work in that case. */
276 if (TREE_CHAIN (init))
278 warning ("initializer list treated as compound expression");
279 init = build_compound_expr (init);
282 init = TREE_VALUE (init);
286 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
289 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
293 expr = build_component_ref (current_class_ref, member, NULL_TREE,
295 expr = build_delete (type, expr, sfk_complete_destructor,
296 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
298 if (expr != error_mark_node)
299 finish_subobject (expr);
303 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
304 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
307 build_field_list (t, list, uses_unions_p)
314 /* Note whether or not T is a union. */
315 if (TREE_CODE (t) == UNION_TYPE)
318 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
320 /* Skip CONST_DECLs for enumeration constants and so forth. */
321 if (TREE_CODE (fields) != FIELD_DECL)
324 /* Keep track of whether or not any fields are unions. */
325 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
328 /* For an anonymous struct or union, we must recursively
329 consider the fields of the anonymous type. They can be
330 directly initialized from the constructor. */
331 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
333 /* Add this field itself. Synthesized copy constructors
334 initialize the entire aggregate. */
335 list = tree_cons (fields, NULL_TREE, list);
336 /* And now add the fields in the anonymous aggregate. */
337 list = build_field_list (TREE_TYPE (fields), list,
340 /* Add this field. */
341 else if (DECL_NAME (fields))
342 list = tree_cons (fields, NULL_TREE, list);
348 /* The MEMBER_INIT_LIST is a TREE_LIST. The TREE_PURPOSE of each list
349 gives a FIELD_DECL in T that needs initialization. The TREE_VALUE
350 gives the initializer, or list of initializer arguments. Sort the
351 MEMBER_INIT_LIST, returning a version that contains the same
352 information but in the order that the fields should actually be
353 initialized. Perform error-checking in the process. */
356 sort_member_init (t, member_init_list)
358 tree member_init_list;
365 /* Build up a list of the various fields, in sorted order. */
366 init_list = nreverse (build_field_list (t, NULL_TREE, &uses_unions_p));
368 /* Go through the explicit initializers, adding them to the
370 last_field = init_list;
371 for (init = member_init_list; init; init = TREE_CHAIN (init))
374 tree initialized_field;
376 initialized_field = TREE_PURPOSE (init);
377 my_friendly_assert (TREE_CODE (initialized_field) == FIELD_DECL,
380 /* If the explicit initializers are in sorted order, then the
381 INITIALIZED_FIELD will be for a field following the
383 for (f = last_field; f; f = TREE_CHAIN (f))
384 if (TREE_PURPOSE (f) == initialized_field)
387 /* Give a warning, if appropriate. */
388 if (warn_reorder && !f)
390 cp_warning_at ("member initializers for `%#D'",
391 TREE_PURPOSE (last_field));
392 cp_warning_at (" and `%#D'", initialized_field);
393 warning (" will be re-ordered to match declaration order");
396 /* Look again, from the beginning of the list. We must find the
397 field on this loop. */
401 while (TREE_PURPOSE (f) != initialized_field)
405 /* If there was already an explicit initializer for this field,
408 error ("multiple initializations given for member `%D'",
412 /* Mark the field as explicitly initialized. */
413 TREE_TYPE (f) = error_mark_node;
414 /* And insert the initializer. */
415 TREE_VALUE (f) = TREE_VALUE (init);
418 /* Remember the location of the last explicitly initialized
425 If a ctor-initializer specifies more than one mem-initializer for
426 multiple members of the same union (including members of
427 anonymous unions), the ctor-initializer is ill-formed. */
430 last_field = NULL_TREE;
431 for (init = init_list; init; init = TREE_CHAIN (init))
437 /* Skip uninitialized members. */
438 if (!TREE_TYPE (init))
440 /* See if this field is a member of a union, or a member of a
441 structure contained in a union, etc. */
442 field = TREE_PURPOSE (init);
443 for (field_type = DECL_CONTEXT (field);
444 !same_type_p (field_type, t);
445 field_type = TYPE_CONTEXT (field_type))
446 if (TREE_CODE (field_type) == UNION_TYPE)
448 /* If this field is not a member of a union, skip it. */
449 if (TREE_CODE (field_type) != UNION_TYPE)
452 /* It's only an error if we have two initializers for the same
460 /* See if LAST_FIELD and the field initialized by INIT are
461 members of the same union. If so, there's a problem,
462 unless they're actually members of the same structure
463 which is itself a member of a union. For example, given:
465 union { struct { int i; int j; }; };
467 initializing both `i' and `j' makes sense. */
468 field_type = DECL_CONTEXT (field);
472 tree last_field_type;
474 last_field_type = DECL_CONTEXT (last_field);
477 if (same_type_p (last_field_type, field_type))
479 if (TREE_CODE (field_type) == UNION_TYPE)
480 error ("initializations for multiple members of `%T'",
486 if (same_type_p (last_field_type, t))
489 last_field_type = TYPE_CONTEXT (last_field_type);
492 /* If we've reached the outermost class, then we're
494 if (same_type_p (field_type, t))
497 field_type = TYPE_CONTEXT (field_type);
508 /* Like sort_member_init, but used for initializers of base classes.
509 *RBASE_PTR is filled in with the initializers for non-virtual bases;
510 vbase_ptr gets the virtual bases. */
513 sort_base_init (t, base_init_list, rbase_ptr, vbase_ptr)
516 tree *rbase_ptr, *vbase_ptr;
518 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
519 int n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
525 /* For warn_reorder. */
527 tree last_base = NULL_TREE;
529 tree rbases = NULL_TREE;
530 tree vbases = NULL_TREE;
532 /* First walk through and splice out vbase and invalid initializers.
533 Also replace types with binfos. */
535 last = tree_cons (NULL_TREE, NULL_TREE, base_init_list);
536 for (x = TREE_CHAIN (last); x; x = TREE_CHAIN (x))
538 tree basetype = TREE_PURPOSE (x);
539 tree binfo = (TREE_CODE (basetype) == TREE_VEC
540 ? basetype : binfo_or_else (basetype, t));
542 if (binfo == NULL_TREE)
543 /* BASETYPE might be an inaccessible direct base (because it
544 is also an indirect base). */
547 if (TREE_VIA_VIRTUAL (binfo))
549 /* Virtual base classes are special cases. Their
550 initializers are recorded with this constructor, and they
551 are used when this constructor is the top-level
552 constructor called. */
553 tree v = binfo_for_vbase (BINFO_TYPE (binfo), t);
554 vbases = tree_cons (v, TREE_VALUE (x), vbases);
558 /* Otherwise, it must be an immediate base class. */
560 (same_type_p (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
563 TREE_PURPOSE (x) = binfo;
564 TREE_CHAIN (last) = x;
568 TREE_CHAIN (last) = NULL_TREE;
570 /* Now walk through our regular bases and make sure they're initialized. */
572 for (i = 0; i < n_baseclasses; ++i)
574 /* The base for which we're currently initializing. */
575 tree base_binfo = TREE_VEC_ELT (binfos, i);
576 /* The initializer for BASE_BINFO. */
580 if (TREE_VIA_VIRTUAL (base_binfo))
583 /* We haven't found the BASE_BINFO yet. */
585 /* Loop through all the explicitly initialized bases, looking
586 for an appropriate initializer. */
587 for (x = base_init_list, pos = 0; x; x = TREE_CHAIN (x), ++pos)
589 tree binfo = TREE_PURPOSE (x);
591 if (binfo == base_binfo && !init)
597 cp_warning_at ("base initializers for `%#T'", last_base);
598 cp_warning_at (" and `%#T'", BINFO_TYPE (binfo));
599 warning (" will be re-ordered to match inheritance order");
602 last_base = BINFO_TYPE (binfo);
605 /* Make sure we won't try to work on this init again. */
606 TREE_PURPOSE (x) = NULL_TREE;
607 init = build_tree_list (binfo, TREE_VALUE (x));
609 else if (binfo == base_binfo)
611 error ("base class `%T' already initialized",
617 /* If we didn't find BASE_BINFO in the list, create a dummy entry
618 so the two lists (RBASES and the list of bases) will be
621 init = build_tree_list (NULL_TREE, NULL_TREE);
622 rbases = chainon (rbases, init);
629 /* Perform whatever initializations have yet to be done on the base
630 class, and non-static data members, of the CURRENT_CLASS_TYPE.
631 These actions are given by the BASE_INIT_LIST and MEM_INIT_LIST,
634 If there is a need for a call to a constructor, we must surround
635 that call with a pushlevel/poplevel pair, since we are technically
636 at the PARM level of scope. */
639 emit_base_init (mem_init_list, base_init_list)
644 tree rbase_init_list, vbase_init_list;
645 tree t = current_class_type;
646 tree t_binfo = TYPE_BINFO (t);
647 tree binfos = BINFO_BASETYPES (t_binfo);
649 int n_baseclasses = BINFO_N_BASETYPES (t_binfo);
651 mem_init_list = sort_member_init (t, mem_init_list);
652 sort_base_init (t, base_init_list, &rbase_init_list, &vbase_init_list);
654 /* First, initialize the virtual base classes, if we are
655 constructing the most-derived object. */
656 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
658 tree first_arg = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
659 construct_virtual_bases (t, current_class_ref, current_class_ptr,
660 vbase_init_list, first_arg);
663 /* Now, perform initialization of non-virtual base classes. */
664 for (i = 0; i < n_baseclasses; i++)
666 tree base_binfo = TREE_VEC_ELT (binfos, i);
667 tree init = void_list_node;
669 if (TREE_VIA_VIRTUAL (base_binfo))
672 my_friendly_assert (BINFO_INHERITANCE_CHAIN (base_binfo) == t_binfo,
675 if (TREE_PURPOSE (rbase_init_list))
676 init = TREE_VALUE (rbase_init_list);
677 else if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo)))
681 && DECL_COPY_CONSTRUCTOR_P (current_function_decl))
682 warning ("base class `%#T' should be explicitly initialized in the copy constructor",
683 BINFO_TYPE (base_binfo));
686 if (init != void_list_node)
688 member = build_base_path (PLUS_EXPR, current_class_ptr,
690 expand_aggr_init_1 (base_binfo, NULL_TREE,
691 build_indirect_ref (member, NULL), init,
695 expand_cleanup_for_base (base_binfo, NULL_TREE);
696 rbase_init_list = TREE_CHAIN (rbase_init_list);
699 /* Initialize the vtable pointers for the class. */
700 initialize_vtbl_ptrs (current_class_ptr);
702 while (mem_init_list)
708 member = TREE_PURPOSE (mem_init_list);
710 /* See if we had a user-specified member initialization. */
711 if (TREE_TYPE (mem_init_list))
713 init = TREE_VALUE (mem_init_list);
718 init = DECL_INITIAL (member);
721 /* Effective C++ rule 12. */
722 if (warn_ecpp && init == NULL_TREE
723 && !DECL_ARTIFICIAL (member)
724 && TREE_CODE (TREE_TYPE (member)) != ARRAY_TYPE)
725 warning ("`%D' should be initialized in the member initialization list", member);
728 perform_member_init (member, init, from_init_list);
729 mem_init_list = TREE_CHAIN (mem_init_list);
733 /* Returns the address of the vtable (i.e., the value that should be
734 assigned to the vptr) for BINFO. */
737 build_vtbl_address (binfo)
740 tree binfo_for = binfo;
743 if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
744 && BINFO_PRIMARY_P (binfo))
745 /* If this is a virtual primary base, then the vtable we want to store
746 is that for the base this is being used as the primary base of. We
747 can't simply skip the initialization, because we may be expanding the
748 inits of a subobject constructor where the virtual base layout
750 while (BINFO_PRIMARY_BASE_OF (binfo_for))
751 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
753 /* Figure out what vtable BINFO's vtable is based on, and mark it as
755 vtbl = get_vtbl_decl_for_binfo (binfo_for);
756 assemble_external (vtbl);
757 TREE_USED (vtbl) = 1;
759 /* Now compute the address to use when initializing the vptr. */
760 vtbl = BINFO_VTABLE (binfo_for);
761 if (TREE_CODE (vtbl) == VAR_DECL)
763 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
764 TREE_CONSTANT (vtbl) = 1;
770 /* This code sets up the virtual function tables appropriate for
771 the pointer DECL. It is a one-ply initialization.
773 BINFO is the exact type that DECL is supposed to be. In
774 multiple inheritance, this might mean "C's A" if C : A, B. */
777 expand_virtual_init (binfo, decl)
783 /* Compute the initializer for vptr. */
784 vtbl = build_vtbl_address (binfo);
786 /* We may get this vptr from a VTT, if this is a subobject
787 constructor or subobject destructor. */
788 vtt_index = BINFO_VPTR_INDEX (binfo);
794 /* Compute the value to use, when there's a VTT. */
795 vtt_parm = current_vtt_parm;
796 vtbl2 = build (PLUS_EXPR,
797 TREE_TYPE (vtt_parm),
800 vtbl2 = build1 (INDIRECT_REF, TREE_TYPE (vtbl), vtbl2);
802 /* The actual initializer is the VTT value only in the subobject
803 constructor. In maybe_clone_body we'll substitute NULL for
804 the vtt_parm in the case of the non-subobject constructor. */
805 vtbl = build (COND_EXPR,
807 build (EQ_EXPR, boolean_type_node,
808 current_in_charge_parm, integer_zero_node),
813 /* Compute the location of the vtpr. */
814 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
816 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
818 /* Assign the vtable to the vptr. */
819 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
820 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
823 /* If an exception is thrown in a constructor, those base classes already
824 constructed must be destroyed. This function creates the cleanup
825 for BINFO, which has just been constructed. If FLAG is non-NULL,
826 it is a DECL which is non-zero when this base needs to be
830 expand_cleanup_for_base (binfo, flag)
836 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
839 /* Call the destructor. */
840 expr = (build_scoped_method_call
841 (current_class_ref, binfo, base_dtor_identifier, NULL_TREE));
843 expr = fold (build (COND_EXPR, void_type_node,
844 truthvalue_conversion (flag),
845 expr, integer_zero_node));
847 finish_subobject (expr);
850 /* Subroutine of `expand_aggr_vbase_init'.
851 BINFO is the binfo of the type that is being initialized.
852 INIT_LIST is the list of initializers for the virtual baseclass. */
855 expand_aggr_vbase_init_1 (binfo, exp, addr, init_list)
856 tree binfo, exp, addr, init_list;
858 tree init = purpose_member (binfo, init_list);
859 tree ref = build_indirect_ref (addr, NULL);
862 init = TREE_VALUE (init);
863 /* Call constructors, but don't set up vtables. */
864 expand_aggr_init_1 (binfo, exp, ref, init, LOOKUP_COMPLAIN);
867 /* Construct the virtual base-classes of THIS_REF (whose address is
868 THIS_PTR). The object has the indicated TYPE. The construction
869 actually takes place only if FLAG is non-zero. INIT_LIST is list
870 of initializations for constructors to perform. */
873 construct_virtual_bases (type, this_ref, this_ptr, init_list, flag)
882 /* If there are no virtual baseclasses, we shouldn't even be here. */
883 my_friendly_assert (TYPE_USES_VIRTUAL_BASECLASSES (type), 19990621);
885 /* Now, run through the baseclasses, initializing each. */
886 for (vbases = CLASSTYPE_VBASECLASSES (type); vbases;
887 vbases = TREE_CHAIN (vbases))
894 /* If there are virtual base classes with destructors, we need to
895 emit cleanups to destroy them if an exception is thrown during
896 the construction process. These exception regions (i.e., the
897 period during which the cleanups must occur) begin from the time
898 the construction is complete to the end of the function. If we
899 create a conditional block in which to initialize the
900 base-classes, then the cleanup region for the virtual base begins
901 inside a block, and ends outside of that block. This situation
902 confuses the sjlj exception-handling code. Therefore, we do not
903 create a single conditional block, but one for each
904 initialization. (That way the cleanup regions always begin
905 in the outer block.) We trust the back-end to figure out
906 that the FLAG will not change across initializations, and
907 avoid doing multiple tests. */
908 inner_if_stmt = begin_if_stmt ();
909 finish_if_stmt_cond (flag, inner_if_stmt);
910 compound_stmt = begin_compound_stmt (/*has_no_scope=*/1);
912 /* Compute the location of the virtual base. If we're
913 constructing virtual bases, then we must be the most derived
914 class. Therefore, we don't have to look up the virtual base;
915 we already know where it is. */
916 vbase = TREE_VALUE (vbases);
917 exp = build (PLUS_EXPR,
918 TREE_TYPE (this_ptr),
920 fold (build1 (NOP_EXPR, TREE_TYPE (this_ptr),
921 BINFO_OFFSET (vbase))));
922 exp = build1 (NOP_EXPR,
923 build_pointer_type (BINFO_TYPE (vbase)),
926 expand_aggr_vbase_init_1 (vbase, this_ref, exp, init_list);
927 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
928 finish_then_clause (inner_if_stmt);
931 expand_cleanup_for_base (vbase, flag);
935 /* Find the context in which this FIELD can be initialized. */
938 initializing_context (field)
941 tree t = DECL_CONTEXT (field);
943 /* Anonymous union members can be initialized in the first enclosing
944 non-anonymous union context. */
945 while (t && ANON_AGGR_TYPE_P (t))
946 t = TYPE_CONTEXT (t);
950 /* Function to give error message if member initialization specification
951 is erroneous. FIELD is the member we decided to initialize.
952 TYPE is the type for which the initialization is being performed.
953 FIELD must be a member of TYPE.
955 MEMBER_NAME is the name of the member. */
958 member_init_ok_or_else (field, type, member_name)
963 if (field == error_mark_node)
965 if (field == NULL_TREE || initializing_context (field) != type)
967 error ("class `%T' does not have any field named `%D'", type,
971 if (TREE_STATIC (field))
973 error ("field `%#D' is static; the only point of initialization is its definition",
981 /* EXP is an expression of aggregate type. NAME is an IDENTIFIER_NODE
982 which names a field, or it is a _TYPE node or TYPE_DECL which names
983 a base for that type. INIT is a parameter list for that field's or
984 base's constructor. Check the validity of NAME, and return a
985 TREE_LIST of the base _TYPE or FIELD_DECL and the INIT. EXP is used
986 only to get its type. If NAME is invalid, return NULL_TREE and
989 An old style unnamed direct single base construction is permitted,
990 where NAME is NULL. */
993 expand_member_init (exp, name, init)
994 tree exp, name, init;
996 tree basetype = NULL_TREE, field;
999 if (exp == NULL_TREE)
1002 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1003 my_friendly_assert (IS_AGGR_TYPE (type), 20011113);
1007 /* This is an obsolete unnamed base class initializer. The
1008 parser will already have warned about its use. */
1009 switch (CLASSTYPE_N_BASECLASSES (type))
1012 error ("unnamed initializer for `%T', which has no base classes",
1016 basetype = TYPE_BINFO_BASETYPE (type, 0);
1019 error ("unnamed initializer for `%T', which uses multiple inheritance",
1024 else if (TYPE_P (name))
1027 name = TYPE_NAME (name);
1029 else if (TREE_CODE (name) == TYPE_DECL)
1030 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
1032 my_friendly_assert (init != NULL_TREE, 0);
1034 if (init == void_type_node)
1039 if (current_template_parms)
1041 else if (vec_binfo_member (basetype, TYPE_BINFO_BASETYPES (type)))
1042 /* A direct base. */;
1043 else if (binfo_for_vbase (basetype, type))
1044 /* A virtual base. */;
1047 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
1048 error ("type `%D' is not a direct or virtual base of `%T'",
1051 error ("type `%D' is not a direct base of `%T'",
1056 init = build_tree_list (basetype, init);
1060 field = lookup_field (type, name, 1, 0);
1062 if (! member_init_ok_or_else (field, type, name))
1065 init = build_tree_list (field, init);
1071 /* This is like `expand_member_init', only it stores one aggregate
1074 INIT comes in two flavors: it is either a value which
1075 is to be stored in EXP, or it is a parameter list
1076 to go to a constructor, which will operate on EXP.
1077 If INIT is not a parameter list for a constructor, then set
1078 LOOKUP_ONLYCONVERTING.
1079 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1080 the initializer, if FLAGS is 0, then it is the (init) form.
1081 If `init' is a CONSTRUCTOR, then we emit a warning message,
1082 explaining that such initializations are invalid.
1084 If INIT resolves to a CALL_EXPR which happens to return
1085 something of the type we are looking for, then we know
1086 that we can safely use that call to perform the
1089 The virtual function table pointer cannot be set up here, because
1090 we do not really know its type.
1092 Virtual baseclass pointers are also set up here.
1094 This never calls operator=().
1096 When initializing, nothing is CONST.
1098 A default copy constructor may have to be used to perform the
1101 A constructor or a conversion operator may have to be used to
1102 perform the initialization, but not both, as it would be ambiguous. */
1105 build_aggr_init (exp, init, flags)
1112 tree type = TREE_TYPE (exp);
1113 int was_const = TREE_READONLY (exp);
1114 int was_volatile = TREE_THIS_VOLATILE (exp);
1116 if (init == error_mark_node)
1117 return error_mark_node;
1119 TREE_READONLY (exp) = 0;
1120 TREE_THIS_VOLATILE (exp) = 0;
1122 if (init && TREE_CODE (init) != TREE_LIST)
1123 flags |= LOOKUP_ONLYCONVERTING;
1125 if (TREE_CODE (type) == ARRAY_TYPE)
1127 /* Must arrange to initialize each element of EXP
1128 from elements of INIT. */
1129 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1133 /* Handle bad initializers like:
1137 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1141 int main(int argc, char **argv) {
1142 COMPLEX zees(1.0, 0.0)[10];
1145 error ("bad array initializer");
1146 return error_mark_node;
1148 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1150 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1152 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1154 stmt_expr = build_vec_init (exp, init,
1155 init && same_type_p (TREE_TYPE (init),
1157 TREE_READONLY (exp) = was_const;
1158 TREE_THIS_VOLATILE (exp) = was_volatile;
1159 TREE_TYPE (exp) = type;
1161 TREE_TYPE (init) = itype;
1165 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1166 /* just know that we've seen something for this node */
1167 TREE_USED (exp) = 1;
1169 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1170 begin_init_stmts (&stmt_expr, &compound_stmt);
1171 destroy_temps = stmts_are_full_exprs_p ();
1172 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1173 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1174 init, LOOKUP_NORMAL|flags);
1175 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
1176 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1177 TREE_TYPE (exp) = type;
1178 TREE_READONLY (exp) = was_const;
1179 TREE_THIS_VOLATILE (exp) = was_volatile;
1184 /* Like build_aggr_init, but not just for aggregates. */
1187 build_init (decl, init, flags)
1193 if (IS_AGGR_TYPE (TREE_TYPE (decl))
1194 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1195 expr = build_aggr_init (decl, init, flags);
1198 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1199 TREE_SIDE_EFFECTS (expr) = 1;
1205 expand_default_init (binfo, true_exp, exp, init, flags)
1211 tree type = TREE_TYPE (exp);
1214 /* It fails because there may not be a constructor which takes
1215 its own type as the first (or only parameter), but which does
1216 take other types via a conversion. So, if the thing initializing
1217 the expression is a unit element of type X, first try X(X&),
1218 followed by initialization by X. If neither of these work
1219 out, then look hard. */
1223 if (init && TREE_CODE (init) != TREE_LIST
1224 && (flags & LOOKUP_ONLYCONVERTING))
1226 /* Base subobjects should only get direct-initialization. */
1227 if (true_exp != exp)
1230 if (flags & DIRECT_BIND)
1231 /* Do nothing. We hit this in two cases: Reference initialization,
1232 where we aren't initializing a real variable, so we don't want
1233 to run a new constructor; and catching an exception, where we
1234 have already built up the constructor call so we could wrap it
1235 in an exception region. */;
1236 else if (TREE_CODE (init) == CONSTRUCTOR)
1237 /* A brace-enclosed initializer has whatever type is
1238 required. There's no need to convert it. */
1241 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1243 if (TREE_CODE (init) == TRY_CATCH_EXPR)
1244 /* We need to protect the initialization of a catch parm
1245 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1246 around the TARGET_EXPR for the copy constructor. See
1247 expand_start_catch_block. */
1248 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1249 TREE_OPERAND (init, 0));
1251 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1252 TREE_SIDE_EFFECTS (init) = 1;
1253 finish_expr_stmt (init);
1257 if (init == NULL_TREE
1258 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1262 init = TREE_VALUE (parms);
1265 parms = build_tree_list (NULL_TREE, init);
1267 if (true_exp == exp)
1268 ctor_name = complete_ctor_identifier;
1270 ctor_name = base_ctor_identifier;
1272 rval = build_method_call (exp, ctor_name, parms, binfo, flags);
1273 if (TREE_SIDE_EFFECTS (rval))
1275 if (building_stmt_tree ())
1276 finish_expr_stmt (rval);
1278 genrtl_expr_stmt (rval);
1282 /* This function is responsible for initializing EXP with INIT
1285 BINFO is the binfo of the type for who we are performing the
1286 initialization. For example, if W is a virtual base class of A and B,
1288 If we are initializing B, then W must contain B's W vtable, whereas
1289 were we initializing C, W must contain C's W vtable.
1291 TRUE_EXP is nonzero if it is the true expression being initialized.
1292 In this case, it may be EXP, or may just contain EXP. The reason we
1293 need this is because if EXP is a base element of TRUE_EXP, we
1294 don't necessarily know by looking at EXP where its virtual
1295 baseclass fields should really be pointing. But we do know
1296 from TRUE_EXP. In constructors, we don't know anything about
1297 the value being initialized.
1299 FLAGS is just passes to `build_method_call'. See that function for
1303 expand_aggr_init_1 (binfo, true_exp, exp, init, flags)
1309 tree type = TREE_TYPE (exp);
1311 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1313 /* Use a function returning the desired type to initialize EXP for us.
1314 If the function is a constructor, and its first argument is
1315 NULL_TREE, know that it was meant for us--just slide exp on
1316 in and expand the constructor. Constructors now come
1319 if (init && TREE_CODE (exp) == VAR_DECL
1320 && TREE_CODE (init) == CONSTRUCTOR
1321 && TREE_HAS_CONSTRUCTOR (init))
1323 /* If store_init_value returns NULL_TREE, the INIT has been
1324 record in the DECL_INITIAL for EXP. That means there's
1325 nothing more we have to do. */
1326 if (!store_init_value (exp, init))
1328 if (!building_stmt_tree ())
1329 expand_decl_init (exp);
1332 finish_expr_stmt (build (INIT_EXPR, type, exp, init));
1336 /* We know that expand_default_init can handle everything we want
1338 expand_default_init (binfo, true_exp, exp, init, flags);
1341 /* Report an error if TYPE is not a user-defined, aggregate type. If
1342 OR_ELSE is nonzero, give an error message. */
1345 is_aggr_type (type, or_else)
1349 if (type == error_mark_node)
1352 if (! IS_AGGR_TYPE (type)
1353 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1354 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1357 error ("`%T' is not an aggregate type", type);
1363 /* Like is_aggr_typedef, but returns typedef if successful. */
1366 get_aggr_from_typedef (name, or_else)
1372 if (name == error_mark_node)
1375 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1376 type = IDENTIFIER_TYPE_VALUE (name);
1380 error ("`%T' fails to be an aggregate typedef", name);
1384 if (! IS_AGGR_TYPE (type)
1385 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1386 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1389 error ("type `%T' is of non-aggregate type", type);
1396 get_type_value (name)
1399 if (name == error_mark_node)
1402 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1403 return IDENTIFIER_TYPE_VALUE (name);
1409 /* This code could just as well go in `class.c', but is placed here for
1412 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1413 the appropriate function call. */
1416 build_member_call (type, name, parmlist)
1417 tree type, name, parmlist;
1422 tree basetype_path, decl;
1424 if (TREE_CODE (name) == TEMPLATE_ID_EXPR
1425 && TREE_CODE (type) == NAMESPACE_DECL)
1427 /* 'name' already refers to the decls from the namespace, since we
1428 hit do_identifier for template_ids. */
1429 method_name = TREE_OPERAND (name, 0);
1430 /* FIXME: Since we don't do independent names right yet, the
1431 name might also be a LOOKUP_EXPR. Once we resolve this to a
1432 real decl earlier, this can go. This may happen during
1434 if (TREE_CODE (method_name) == LOOKUP_EXPR)
1436 method_name = lookup_namespace_name
1437 (type, TREE_OPERAND (method_name, 0));
1438 TREE_OPERAND (name, 0) = method_name;
1440 my_friendly_assert (is_overloaded_fn (method_name), 980519);
1441 return build_x_function_call (name, parmlist, current_class_ref);
1445 name = DECL_NAME (name);
1447 if (TREE_CODE (type) == NAMESPACE_DECL)
1448 return build_x_function_call (lookup_namespace_name (type, name),
1449 parmlist, current_class_ref);
1451 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1453 method_name = TREE_OPERAND (name, 0);
1454 if (TREE_CODE (method_name) == COMPONENT_REF)
1455 method_name = TREE_OPERAND (method_name, 1);
1456 if (is_overloaded_fn (method_name))
1457 method_name = DECL_NAME (OVL_CURRENT (method_name));
1458 TREE_OPERAND (name, 0) = method_name;
1463 if (TREE_CODE (method_name) == BIT_NOT_EXPR)
1465 method_name = TREE_OPERAND (method_name, 0);
1469 /* This shouldn't be here, and build_member_call shouldn't appear in
1471 if (type && TREE_CODE (type) == IDENTIFIER_NODE
1472 && get_aggr_from_typedef (type, 0) == 0)
1474 tree ns = lookup_name (type, 0);
1475 if (ns && TREE_CODE (ns) == NAMESPACE_DECL)
1477 return build_x_function_call (build_offset_ref (type, name),
1478 parmlist, current_class_ref);
1482 if (type == NULL_TREE || ! is_aggr_type (type, 1))
1483 return error_mark_node;
1485 /* An operator we did not like. */
1486 if (name == NULL_TREE)
1487 return error_mark_node;
1491 error ("cannot call destructor `%T::~%T' without object", type,
1493 return error_mark_node;
1496 decl = maybe_dummy_object (type, &basetype_path);
1498 /* Convert 'this' to the specified type to disambiguate conversion
1499 to the function's context. Apparently Standard C++ says that we
1500 shouldn't do this. */
1501 if (decl == current_class_ref
1503 && ACCESSIBLY_UNIQUELY_DERIVED_P (type, current_class_type))
1505 tree olddecl = current_class_ptr;
1506 tree oldtype = TREE_TYPE (TREE_TYPE (olddecl));
1507 if (oldtype != type)
1509 tree newtype = build_qualified_type (type, TYPE_QUALS (oldtype));
1510 decl = convert_force (build_pointer_type (newtype), olddecl, 0);
1511 decl = build_indirect_ref (decl, NULL);
1515 if (method_name == constructor_name (type)
1516 || method_name == constructor_name_full (type))
1517 return build_functional_cast (type, parmlist);
1518 if (lookup_fnfields (basetype_path, method_name, 0))
1519 return build_method_call (decl,
1520 TREE_CODE (name) == TEMPLATE_ID_EXPR
1521 ? name : method_name,
1522 parmlist, basetype_path,
1523 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL);
1524 if (TREE_CODE (name) == IDENTIFIER_NODE
1525 && ((t = lookup_field (TYPE_BINFO (type), name, 1, 0))))
1527 if (t == error_mark_node)
1528 return error_mark_node;
1529 if (TREE_CODE (t) == FIELD_DECL)
1531 if (is_dummy_object (decl))
1533 error ("invalid use of non-static field `%D'", t);
1534 return error_mark_node;
1536 decl = build (COMPONENT_REF, TREE_TYPE (t), decl, t);
1538 else if (TREE_CODE (t) == VAR_DECL)
1542 error ("invalid use of member `%D'", t);
1543 return error_mark_node;
1545 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl)))
1546 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, decl,
1547 parmlist, NULL_TREE);
1548 return build_function_call (decl, parmlist);
1552 error ("no method `%T::%D'", type, name);
1553 return error_mark_node;
1557 /* Build a reference to a member of an aggregate. This is not a
1558 C++ `&', but really something which can have its address taken,
1559 and then act as a pointer to member, for example TYPE :: FIELD
1560 can have its address taken by saying & TYPE :: FIELD.
1562 @@ Prints out lousy diagnostics for operator <typename>
1565 @@ This function should be rewritten and placed in search.c. */
1568 build_offset_ref (type, name)
1571 tree decl, t = error_mark_node;
1573 tree basebinfo = NULL_TREE;
1574 tree orig_name = name;
1576 /* class templates can come in as TEMPLATE_DECLs here. */
1577 if (TREE_CODE (name) == TEMPLATE_DECL)
1580 if (processing_template_decl || uses_template_parms (type))
1581 return build_min_nt (SCOPE_REF, type, name);
1583 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1585 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1586 something like `a.template f<int>' or the like. For the most
1587 part, we treat this just like a.f. We do remember, however,
1588 the template-id that was used. */
1589 name = TREE_OPERAND (orig_name, 0);
1592 name = DECL_NAME (name);
1595 if (TREE_CODE (name) == LOOKUP_EXPR)
1596 /* This can happen during tsubst'ing. */
1597 name = TREE_OPERAND (name, 0);
1600 if (TREE_CODE (name) == COMPONENT_REF)
1601 name = TREE_OPERAND (name, 1);
1602 if (TREE_CODE (name) == OVERLOAD)
1603 name = DECL_NAME (OVL_CURRENT (name));
1607 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1610 if (type == NULL_TREE)
1611 return error_mark_node;
1613 /* Handle namespace names fully here. */
1614 if (TREE_CODE (type) == NAMESPACE_DECL)
1616 t = lookup_namespace_name (type, name);
1617 if (t == error_mark_node)
1619 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1620 /* Reconstruct the TEMPLATE_ID_EXPR. */
1621 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1622 t, TREE_OPERAND (orig_name, 1));
1623 if (! type_unknown_p (t))
1626 t = convert_from_reference (t);
1631 if (! is_aggr_type (type, 1))
1632 return error_mark_node;
1634 if (TREE_CODE (name) == BIT_NOT_EXPR)
1636 if (! check_dtor_name (type, name))
1637 error ("qualified type `%T' does not match destructor name `~%T'",
1638 type, TREE_OPERAND (name, 0));
1639 name = dtor_identifier;
1642 if (!COMPLETE_TYPE_P (complete_type (type))
1643 && !TYPE_BEING_DEFINED (type))
1645 error ("incomplete type `%T' does not have member `%D'", type,
1647 return error_mark_node;
1650 decl = maybe_dummy_object (type, &basebinfo);
1652 member = lookup_member (basebinfo, name, 1, 0);
1654 if (member == error_mark_node)
1655 return error_mark_node;
1657 /* A lot of this logic is now handled in lookup_member. */
1658 if (member && BASELINK_P (member))
1660 /* Go from the TREE_BASELINK to the member function info. */
1661 tree fnfields = member;
1662 t = TREE_VALUE (fnfields);
1664 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1666 /* The FNFIELDS are going to contain functions that aren't
1667 necessarily templates, and templates that don't
1668 necessarily match the explicit template parameters. We
1669 save all the functions, and the explicit parameters, and
1670 then figure out exactly what to instantiate with what
1671 arguments in instantiate_type. */
1673 if (TREE_CODE (t) != OVERLOAD)
1674 /* The code in instantiate_type which will process this
1675 expects to encounter OVERLOADs, not raw functions. */
1676 t = ovl_cons (t, NULL_TREE);
1678 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1679 TREE_OPERAND (orig_name, 1));
1680 t = build (OFFSET_REF, unknown_type_node, decl, t);
1682 PTRMEM_OK_P (t) = 1;
1687 if (!really_overloaded_fn (t))
1689 /* Get rid of a potential OVERLOAD around it */
1690 t = OVL_CURRENT (t);
1692 /* unique functions are handled easily. */
1693 if (!enforce_access (basebinfo, t))
1694 return error_mark_node;
1696 if (DECL_STATIC_FUNCTION_P (t))
1698 t = build (OFFSET_REF, TREE_TYPE (t), decl, t);
1699 PTRMEM_OK_P (t) = 1;
1703 TREE_TYPE (fnfields) = unknown_type_node;
1705 t = build (OFFSET_REF, unknown_type_node, decl, fnfields);
1706 PTRMEM_OK_P (t) = 1;
1714 error ("`%D' is not a member of type `%T'", name, type);
1715 return error_mark_node;
1718 if (TREE_CODE (t) == TYPE_DECL)
1723 /* static class members and class-specific enum
1724 values can be returned without further ado. */
1725 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == CONST_DECL)
1728 return convert_from_reference (t);
1731 if (TREE_CODE (t) == FIELD_DECL && DECL_C_BIT_FIELD (t))
1733 error ("illegal pointer to bit-field `%D'", t);
1734 return error_mark_node;
1737 /* static class functions too. */
1738 if (TREE_CODE (t) == FUNCTION_DECL
1739 && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
1742 /* In member functions, the form `type::name' is no longer
1743 equivalent to `this->type::name', at least not until
1744 resolve_offset_ref. */
1745 t = build (OFFSET_REF, build_offset_type (type, TREE_TYPE (t)), decl, t);
1746 PTRMEM_OK_P (t) = 1;
1750 /* If a OFFSET_REF made it through to here, then it did
1751 not have its address taken. */
1754 resolve_offset_ref (exp)
1757 tree type = TREE_TYPE (exp);
1758 tree base = NULL_TREE;
1760 tree basetype, addr;
1762 if (TREE_CODE (exp) == OFFSET_REF)
1764 member = TREE_OPERAND (exp, 1);
1765 base = TREE_OPERAND (exp, 0);
1769 my_friendly_assert (TREE_CODE (type) == OFFSET_TYPE, 214);
1770 if (TYPE_OFFSET_BASETYPE (type) != current_class_type)
1772 error ("object missing in use of pointer-to-member construct");
1773 return error_mark_node;
1776 type = TREE_TYPE (type);
1777 base = current_class_ref;
1780 if (BASELINK_P (member) || TREE_CODE (member) == TEMPLATE_ID_EXPR)
1781 return build_unary_op (ADDR_EXPR, exp, 0);
1783 if (TREE_CODE (TREE_TYPE (member)) == METHOD_TYPE)
1785 if (!flag_ms_extensions)
1786 /* A single non-static member, make sure we don't allow a
1787 pointer-to-member. */
1788 exp = ovl_cons (member, NULL_TREE);
1790 return build_unary_op (ADDR_EXPR, exp, 0);
1793 if ((TREE_CODE (member) == VAR_DECL
1794 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member))
1795 && ! TYPE_PTRMEM_P (TREE_TYPE (member)))
1796 || TREE_CODE (TREE_TYPE (member)) == FUNCTION_TYPE)
1798 /* These were static members. */
1799 if (mark_addressable (member) == 0)
1800 return error_mark_node;
1804 if (TREE_CODE (TREE_TYPE (member)) == POINTER_TYPE
1805 && TREE_CODE (TREE_TYPE (TREE_TYPE (member))) == METHOD_TYPE)
1808 /* Syntax error can cause a member which should
1809 have been seen as static to be grok'd as non-static. */
1810 if (TREE_CODE (member) == FIELD_DECL && current_class_ref == NULL_TREE)
1812 cp_error_at ("member `%D' is non-static but referenced as a static member",
1814 error ("at this point in file");
1815 return error_mark_node;
1818 /* The first case is really just a reference to a member of `this'. */
1819 if (TREE_CODE (member) == FIELD_DECL
1820 && (base == current_class_ref || is_dummy_object (base)))
1824 basetype = DECL_CONTEXT (member);
1826 /* Try to get to basetype from 'this'; if that doesn't work,
1828 base = current_class_ref;
1830 /* First convert to the intermediate base specified, if appropriate. */
1831 if (TREE_CODE (exp) == OFFSET_REF && TREE_CODE (type) == OFFSET_TYPE)
1832 base = build_scoped_ref (base, TYPE_OFFSET_BASETYPE (type));
1834 /* Don't check access on the conversion; we might be after a member
1835 promoted by an access- or using-declaration, and we have already
1836 checked access for the member itself. */
1837 basetype = lookup_base (TREE_TYPE (base), basetype, ba_ignore, NULL);
1838 expr = build_base_path (PLUS_EXPR, base, basetype, 1);
1840 if (expr == error_mark_node)
1841 return error_mark_node;
1843 type = TREE_TYPE (member);
1844 if (TREE_CODE (type) != REFERENCE_TYPE)
1846 int quals = cp_type_quals (type) | cp_type_quals (TREE_TYPE (expr));
1848 if (DECL_MUTABLE_P (member))
1849 quals &= ~TYPE_QUAL_CONST;
1851 type = cp_build_qualified_type (type, quals);
1854 expr = build (COMPONENT_REF, type, expr, member);
1855 return convert_from_reference (expr);
1858 /* Ensure that we have an object. */
1859 if (is_dummy_object (base))
1860 addr = error_mark_node;
1862 /* If this is a reference to a member function, then return the
1863 address of the member function (which may involve going
1864 through the object's vtable), otherwise, return an expression
1865 for the dereferenced pointer-to-member construct. */
1866 addr = build_unary_op (ADDR_EXPR, base, 0);
1868 if (TYPE_PTRMEM_P (TREE_TYPE (member)))
1870 if (addr == error_mark_node)
1872 error ("object missing in `%E'", exp);
1873 return error_mark_node;
1876 basetype = TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member)));
1877 basetype = lookup_base (TREE_TYPE (TREE_TYPE (addr)),
1878 basetype, ba_check, NULL);
1879 addr = build_base_path (PLUS_EXPR, addr, basetype, 1);
1881 member = cp_convert (ptrdiff_type_node, member);
1883 addr = build (PLUS_EXPR, build_pointer_type (type), addr, member);
1884 return build_indirect_ref (addr, 0);
1886 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
1888 return get_member_function_from_ptrfunc (&addr, member);
1895 /* If DECL is a `const' declaration, and its value is a known
1896 constant, then return that value. */
1899 decl_constant_value (decl)
1902 if (TREE_READONLY_DECL_P (decl)
1903 && ! TREE_THIS_VOLATILE (decl)
1904 && DECL_INITIAL (decl)
1905 && DECL_INITIAL (decl) != error_mark_node
1906 /* This is invalid if initial value is not constant.
1907 If it has either a function call, a memory reference,
1908 or a variable, then re-evaluating it could give different results. */
1909 && TREE_CONSTANT (DECL_INITIAL (decl))
1910 /* Check for cases where this is sub-optimal, even though valid. */
1911 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1912 return DECL_INITIAL (decl);
1916 /* Common subroutines of build_new and build_vec_delete. */
1918 /* Call the global __builtin_delete to delete ADDR. */
1921 build_builtin_delete_call (addr)
1924 mark_used (global_delete_fndecl);
1925 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1928 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1929 (which needs to go through some sort of groktypename) or it
1930 is the name of the class we are newing. INIT is an initialization value.
1931 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1932 If INIT is void_type_node, it means do *not* call a constructor
1935 For types with constructors, the data returned is initialized
1936 by the appropriate constructor.
1938 Whether the type has a constructor or not, if it has a pointer
1939 to a virtual function table, then that pointer is set up
1942 Unless I am mistaken, a call to new () will return initialized
1943 data regardless of whether the constructor itself is private or
1944 not. NOPE; new fails if the constructor is private (jcm).
1946 Note that build_new does nothing to assure that any special
1947 alignment requirements of the type are met. Rather, it leaves
1948 it up to malloc to do the right thing. Otherwise, folding to
1949 the right alignment cal cause problems if the user tries to later
1950 free the memory returned by `new'.
1952 PLACEMENT is the `placement' list for user-defined operator new (). */
1955 build_new (placement, decl, init, use_global_new)
1961 tree nelts = NULL_TREE, t;
1964 if (decl == error_mark_node)
1965 return error_mark_node;
1967 if (TREE_CODE (decl) == TREE_LIST)
1969 tree absdcl = TREE_VALUE (decl);
1970 tree last_absdcl = NULL_TREE;
1972 if (current_function_decl
1973 && DECL_CONSTRUCTOR_P (current_function_decl))
1974 my_friendly_assert (immediate_size_expand == 0, 19990926);
1976 nelts = integer_one_node;
1978 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1980 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1982 last_absdcl = absdcl;
1983 absdcl = TREE_OPERAND (absdcl, 0);
1986 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1988 /* probably meant to be a vec new */
1991 while (TREE_OPERAND (absdcl, 0)
1992 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1994 last_absdcl = absdcl;
1995 absdcl = TREE_OPERAND (absdcl, 0);
1999 this_nelts = TREE_OPERAND (absdcl, 1);
2000 if (this_nelts != error_mark_node)
2002 if (this_nelts == NULL_TREE)
2003 error ("new of array type fails to specify size");
2004 else if (processing_template_decl)
2007 absdcl = TREE_OPERAND (absdcl, 0);
2011 if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
2014 pedwarn ("size in array new must have integral type");
2016 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
2017 absdcl = TREE_OPERAND (absdcl, 0);
2018 if (this_nelts == integer_zero_node)
2020 warning ("zero size array reserves no space");
2021 nelts = integer_zero_node;
2024 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
2028 nelts = integer_zero_node;
2032 TREE_OPERAND (last_absdcl, 0) = absdcl;
2034 TREE_VALUE (decl) = absdcl;
2036 type = groktypename (decl);
2037 if (! type || type == error_mark_node)
2038 return error_mark_node;
2040 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
2042 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
2044 /* An aggregate type. */
2045 type = IDENTIFIER_TYPE_VALUE (decl);
2046 decl = TYPE_MAIN_DECL (type);
2050 /* A builtin type. */
2051 decl = lookup_name (decl, 1);
2052 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
2053 type = TREE_TYPE (decl);
2056 else if (TREE_CODE (decl) == TYPE_DECL)
2058 type = TREE_TYPE (decl);
2063 decl = TYPE_MAIN_DECL (type);
2066 if (processing_template_decl)
2069 t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
2070 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
2075 rval = build_min_nt (NEW_EXPR, placement, t, init);
2076 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2080 /* ``A reference cannot be created by the new operator. A reference
2081 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2082 returned by new.'' ARM 5.3.3 */
2083 if (TREE_CODE (type) == REFERENCE_TYPE)
2085 error ("new cannot be applied to a reference type");
2086 type = TREE_TYPE (type);
2089 if (TREE_CODE (type) == FUNCTION_TYPE)
2091 error ("new cannot be applied to a function type");
2092 return error_mark_node;
2095 /* When the object being created is an array, the new-expression yields a
2096 pointer to the initial element (if any) of the array. For example,
2097 both new int and new int[10] return an int*. 5.3.4. */
2098 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
2100 nelts = array_type_nelts_top (type);
2102 type = TREE_TYPE (type);
2106 t = build_nt (ARRAY_REF, type, nelts);
2110 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
2111 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2112 TREE_SIDE_EFFECTS (rval) = 1;
2113 rval = build_new_1 (rval);
2114 if (rval == error_mark_node)
2115 return error_mark_node;
2117 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2118 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2119 TREE_NO_UNUSED_WARNING (rval) = 1;
2124 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2127 build_java_class_ref (type)
2130 tree name = NULL_TREE, class_decl;
2131 static tree CL_suffix = NULL_TREE;
2132 if (CL_suffix == NULL_TREE)
2133 CL_suffix = get_identifier("class$");
2134 if (jclass_node == NULL_TREE)
2136 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2137 if (jclass_node == NULL_TREE)
2138 fatal_error ("call to Java constructor, while `jclass' undefined");
2140 jclass_node = TREE_TYPE (jclass_node);
2143 /* Mangle the class$ field */
2146 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2147 if (DECL_NAME (field) == CL_suffix)
2149 mangle_decl (field);
2150 name = DECL_ASSEMBLER_NAME (field);
2154 internal_error ("can't find class$");
2157 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2158 if (class_decl == NULL_TREE)
2160 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2161 TREE_STATIC (class_decl) = 1;
2162 DECL_EXTERNAL (class_decl) = 1;
2163 TREE_PUBLIC (class_decl) = 1;
2164 DECL_ARTIFICIAL (class_decl) = 1;
2165 DECL_IGNORED_P (class_decl) = 1;
2166 pushdecl_top_level (class_decl);
2167 make_decl_rtl (class_decl, NULL);
2172 /* Returns the size of the cookie to use when allocating an array
2173 whose elements have the indicated TYPE. Assumes that it is already
2174 known that a cookie is needed. */
2177 get_cookie_size (type)
2182 /* We need to allocate an additional max (sizeof (size_t), alignof
2183 (true_type)) bytes. */
2187 sizetype_size = size_in_bytes (sizetype);
2188 type_align = size_int (TYPE_ALIGN_UNIT (type));
2189 if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
2190 cookie_size = sizetype_size;
2192 cookie_size = type_align;
2197 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2198 value is immediately handed to expand_expr. */
2204 tree placement, init;
2205 tree type, true_type, size, rval, t;
2207 tree nelts = NULL_TREE;
2208 tree alloc_call, alloc_expr, alloc_node;
2209 tree cookie_expr, init_expr;
2211 enum tree_code code;
2212 int use_cookie, nothrow, check_new;
2213 /* Nonzero if the user wrote `::new' rather than just `new'. */
2214 int globally_qualified_p;
2215 /* Nonzero if we're going to call a global operator new, rather than
2216 a class-specific version. */
2218 int use_java_new = 0;
2219 /* If non-NULL, the number of extra bytes to allocate at the
2220 beginning of the storage allocated for an array-new expression in
2221 order to store the number of elements. */
2222 tree cookie_size = NULL_TREE;
2223 /* True if the function we are calling is a placement allocation
2225 bool placement_allocation_fn_p;
2227 placement = TREE_OPERAND (exp, 0);
2228 type = TREE_OPERAND (exp, 1);
2229 init = TREE_OPERAND (exp, 2);
2230 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
2232 if (TREE_CODE (type) == ARRAY_REF)
2235 nelts = TREE_OPERAND (type, 1);
2236 type = TREE_OPERAND (type, 0);
2238 full_type = cp_build_binary_op (MINUS_EXPR, nelts, integer_one_node);
2239 full_type = build_index_type (full_type);
2240 full_type = build_cplus_array_type (type, full_type);
2247 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
2249 /* If our base type is an array, then make sure we know how many elements
2251 while (TREE_CODE (true_type) == ARRAY_TYPE)
2253 tree this_nelts = array_type_nelts_top (true_type);
2254 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
2255 true_type = TREE_TYPE (true_type);
2258 if (!complete_type_or_else (true_type, exp))
2259 return error_mark_node;
2261 size = size_in_bytes (true_type);
2263 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2265 if (TREE_CODE (true_type) == VOID_TYPE)
2267 error ("invalid type `void' for new");
2268 return error_mark_node;
2271 if (abstract_virtuals_error (NULL_TREE, true_type))
2272 return error_mark_node;
2274 /* Figure out whether or not we're going to use the global operator
2276 if (!globally_qualified_p
2277 && IS_AGGR_TYPE (true_type)
2279 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2280 : TYPE_HAS_NEW_OPERATOR (true_type)))
2285 /* We only need cookies for arrays containing types for which we
2287 if (!has_array || !TYPE_VEC_NEW_USES_COOKIE (true_type))
2289 /* When using placement new, users may not realize that they need
2290 the extra storage. We require that the operator called be
2291 the global placement operator delete[]. */
2292 else if (placement && !TREE_CHAIN (placement)
2293 && same_type_p (TREE_TYPE (TREE_VALUE (placement)),
2295 use_cookie = !use_global_new;
2296 /* Otherwise, we need the cookie. */
2300 /* Compute the number of extra bytes to allocate, now that we know
2301 whether or not we need the cookie. */
2304 cookie_size = get_cookie_size (true_type);
2305 size = size_binop (PLUS_EXPR, size, cookie_size);
2308 /* Allocate the object. */
2310 if (! placement && TYPE_FOR_JAVA (true_type))
2312 tree class_addr, alloc_decl;
2313 tree class_decl = build_java_class_ref (true_type);
2314 tree class_size = size_in_bytes (true_type);
2315 static const char alloc_name[] = "_Jv_AllocObject";
2317 alloc_decl = IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name));
2318 if (alloc_decl == NULL_TREE)
2319 fatal_error ("call to Java constructor with `%s' undefined",
2322 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2323 alloc_call = (build_function_call
2325 tree_cons (NULL_TREE, class_addr,
2326 build_tree_list (NULL_TREE, class_size))));
2333 args = tree_cons (NULL_TREE, size, placement);
2334 fnname = ansi_opname (code);
2337 alloc_call = (build_new_function_call
2338 (lookup_function_nonclass (fnname, args),
2341 alloc_call = build_method_call (build_dummy_object (true_type),
2342 fnname, args, NULL_TREE,
2346 if (alloc_call == error_mark_node)
2347 return error_mark_node;
2349 /* The ALLOC_CALL should be a CALL_EXPR, and the first operand
2350 should be the address of a known FUNCTION_DECL. */
2351 my_friendly_assert (TREE_CODE (alloc_call) == CALL_EXPR, 20000521);
2352 t = TREE_OPERAND (alloc_call, 0);
2353 my_friendly_assert (TREE_CODE (t) == ADDR_EXPR, 20000521);
2354 t = TREE_OPERAND (t, 0);
2355 my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL, 20000521);
2356 /* Now, check to see if this function is actually a placement
2357 allocation function. This can happen even when PLACEMENT is NULL
2358 because we might have something like:
2360 struct S { void* operator new (size_t, int i = 0); };
2362 A call to `new S' will get this allocation function, even though
2363 there is no explicit placement argument. If there is more than
2364 one argument, or there are variable arguments, then this is a
2365 placement allocation function. */
2366 placement_allocation_fn_p
2367 = (type_num_arguments (TREE_TYPE (t)) > 1 || varargs_function_p (t));
2369 /* unless an allocation function is declared with an empty excep-
2370 tion-specification (_except.spec_), throw(), it indicates failure to
2371 allocate storage by throwing a bad_alloc exception (clause _except_,
2372 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2373 cation function is declared with an empty exception-specification,
2374 throw(), it returns null to indicate failure to allocate storage and a
2375 non-null pointer otherwise.
2377 So check for a null exception spec on the op new we just called. */
2379 /* The ADDR_EXPR. */
2380 t = TREE_OPERAND (alloc_call, 0);
2382 t = TREE_OPERAND (t, 0);
2383 nothrow = TYPE_NOTHROW_P (TREE_TYPE (t));
2384 check_new = (flag_check_new || nothrow) && ! use_java_new;
2386 alloc_expr = alloc_call;
2389 /* Adjust so we're pointing to the start of the object. */
2390 alloc_expr = build (PLUS_EXPR, TREE_TYPE (alloc_expr),
2391 alloc_expr, cookie_size);
2393 /* While we're working, use a pointer to the type we've actually
2395 alloc_expr = convert (build_pointer_type (full_type), alloc_expr);
2397 /* Now save the allocation expression so we only evaluate it once. */
2398 alloc_expr = get_target_expr (alloc_expr);
2399 alloc_node = TREE_OPERAND (alloc_expr, 0);
2401 /* Now initialize the cookie. */
2406 /* Store the number of bytes allocated so that we can know how
2407 many elements to destroy later. We use the last sizeof
2408 (size_t) bytes to store the number of elements. */
2409 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2410 alloc_node, size_in_bytes (sizetype));
2411 cookie = build_indirect_ref (cookie, NULL);
2413 cookie_expr = build (MODIFY_EXPR, void_type_node, cookie, nelts);
2414 TREE_SIDE_EFFECTS (cookie_expr) = 1;
2417 cookie_expr = NULL_TREE;
2419 /* Now initialize the allocated object. */
2420 init_expr = NULL_TREE;
2421 if (TYPE_NEEDS_CONSTRUCTING (type) || init)
2423 init_expr = build_indirect_ref (alloc_node, NULL);
2425 if (init == void_zero_node)
2426 init = build_default_init (full_type);
2427 else if (init && pedantic && has_array)
2428 pedwarn ("ISO C++ forbids initialization in array new");
2431 init_expr = build_vec_init (init_expr, init, 0);
2432 else if (TYPE_NEEDS_CONSTRUCTING (type))
2433 init_expr = build_method_call (init_expr,
2434 complete_ctor_identifier,
2435 init, TYPE_BINFO (true_type),
2439 /* We are processing something like `new int (10)', which
2440 means allocate an int, and initialize it with 10. */
2442 if (TREE_CODE (init) == TREE_LIST)
2444 if (TREE_CHAIN (init) != NULL_TREE)
2446 ("initializer list being treated as compound expression");
2447 init = build_compound_expr (init);
2449 else if (TREE_CODE (init) == CONSTRUCTOR
2450 && TREE_TYPE (init) == NULL_TREE)
2452 pedwarn ("ISO C++ forbids aggregate initializer to new");
2453 init = digest_init (type, init, 0);
2456 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2459 if (init_expr == error_mark_node)
2460 return error_mark_node;
2462 /* If any part of the object initialization terminates by throwing an
2463 exception and a suitable deallocation function can be found, the
2464 deallocation function is called to free the memory in which the
2465 object was being constructed, after which the exception continues
2466 to propagate in the context of the new-expression. If no
2467 unambiguous matching deallocation function can be found,
2468 propagating the exception does not cause the object's memory to be
2470 if (flag_exceptions && ! use_java_new)
2472 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2474 int flags = (LOOKUP_NORMAL
2475 | (globally_qualified_p * LOOKUP_GLOBAL));
2477 /* The Standard is unclear here, but the right thing to do
2478 is to use the same method for finding deallocation
2479 functions that we use for finding allocation functions. */
2480 flags |= LOOKUP_SPECULATIVELY;
2482 cleanup = build_op_delete_call (dcode, alloc_node, size, flags,
2483 (placement_allocation_fn_p
2484 ? alloc_call : NULL_TREE));
2486 /* Ack! First we allocate the memory. Then we set our sentry
2487 variable to true, and expand a cleanup that deletes the memory
2488 if sentry is true. Then we run the constructor, and finally
2491 It would be nice to be able to handle this without the sentry
2492 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2493 work. We allocate the space first, so if there are any
2494 temporaries with cleanups in the constructor args we need this
2495 EH region to extend until end of full-expression to preserve
2498 If the backend had some mechanism so that we could force the
2499 allocation to be expanded after all the other args to the
2500 constructor, that would fix the nesting problem and we could
2501 do away with this complexity. But that would complicate other
2502 things; in particular, it would make it difficult to bail out
2503 if the allocation function returns null. */
2507 tree end, sentry, begin;
2509 begin = get_target_expr (boolean_true_node);
2510 sentry = TREE_OPERAND (begin, 0);
2512 TREE_OPERAND (begin, 2)
2513 = build (COND_EXPR, void_type_node, sentry,
2514 cleanup, void_zero_node);
2516 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2517 sentry, boolean_false_node);
2520 = build (COMPOUND_EXPR, void_type_node, begin,
2521 build (COMPOUND_EXPR, void_type_node, init_expr,
2526 else if (CP_TYPE_CONST_P (true_type))
2527 error ("uninitialized const in `new' of `%#T'", true_type);
2529 /* Now build up the return value in reverse order. */
2534 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2536 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2538 if (rval == alloc_node)
2539 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2541 rval = TREE_OPERAND (alloc_expr, 1);
2546 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2548 rval = build_conditional_expr (ifexp, rval, alloc_node);
2551 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2554 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2556 rval = convert (build_pointer_type (type), rval);
2562 build_vec_delete_1 (base, maxindex, type, auto_delete_vec, use_global_delete)
2563 tree base, maxindex, type;
2564 special_function_kind auto_delete_vec;
2565 int use_global_delete;
2568 tree ptype = build_pointer_type (type = complete_type (type));
2569 tree size_exp = size_in_bytes (type);
2571 /* Temporary variables used by the loop. */
2572 tree tbase, tbase_init;
2574 /* This is the body of the loop that implements the deletion of a
2575 single element, and moves temp variables to next elements. */
2578 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2581 /* This is the thing that governs what to do after the loop has run. */
2582 tree deallocate_expr = 0;
2584 /* This is the BIND_EXPR which holds the outermost iterator of the
2585 loop. It is convenient to set this variable up and test it before
2586 executing any other code in the loop.
2587 This is also the containing expression returned by this function. */
2588 tree controller = NULL_TREE;
2590 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2592 loop = integer_zero_node;
2596 /* The below is short by the cookie size. */
2597 virtual_size = size_binop (MULT_EXPR, size_exp,
2598 convert (sizetype, maxindex));
2600 tbase = create_temporary_var (ptype);
2601 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2602 fold (build (PLUS_EXPR, ptype,
2605 DECL_REGISTER (tbase) = 1;
2606 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2607 TREE_SIDE_EFFECTS (controller) = 1;
2611 body = tree_cons (NULL_TREE,
2612 build_delete (ptype, tbase, sfk_complete_destructor,
2613 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1),
2616 body = tree_cons (NULL_TREE,
2617 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
2620 body = tree_cons (NULL_TREE,
2621 build (EXIT_EXPR, void_type_node,
2622 build (EQ_EXPR, boolean_type_node, base, tbase)),
2625 loop = build (LOOP_EXPR, void_type_node, build_compound_expr (body));
2627 loop = tree_cons (NULL_TREE, tbase_init,
2628 tree_cons (NULL_TREE, loop, NULL_TREE));
2629 loop = build_compound_expr (loop);
2632 /* If the delete flag is one, or anything else with the low bit set,
2633 delete the storage. */
2634 deallocate_expr = integer_zero_node;
2635 if (auto_delete_vec != sfk_base_destructor)
2639 /* The below is short by the cookie size. */
2640 virtual_size = size_binop (MULT_EXPR, size_exp,
2641 convert (sizetype, maxindex));
2643 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2650 cookie_size = get_cookie_size (type);
2652 = cp_convert (ptype,
2653 cp_build_binary_op (MINUS_EXPR,
2654 cp_convert (string_type_node,
2657 /* True size with header. */
2658 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2661 if (auto_delete_vec == sfk_deleting_destructor)
2662 deallocate_expr = build_x_delete (base_tbd,
2663 2 | use_global_delete,
2667 if (loop && deallocate_expr != integer_zero_node)
2669 body = tree_cons (NULL_TREE, loop,
2670 tree_cons (NULL_TREE, deallocate_expr, NULL_TREE));
2671 body = build_compound_expr (body);
2676 /* Outermost wrapper: If pointer is null, punt. */
2677 body = fold (build (COND_EXPR, void_type_node,
2678 fold (build (NE_EXPR, boolean_type_node, base,
2679 integer_zero_node)),
2680 body, integer_zero_node));
2681 body = build1 (NOP_EXPR, void_type_node, body);
2685 TREE_OPERAND (controller, 1) = body;
2689 return cp_convert (void_type_node, body);
2692 /* Create an unnamed variable of the indicated TYPE. */
2695 create_temporary_var (type)
2700 decl = build_decl (VAR_DECL, NULL_TREE, type);
2701 TREE_USED (decl) = 1;
2702 DECL_ARTIFICIAL (decl) = 1;
2703 DECL_SOURCE_FILE (decl) = input_filename;
2704 DECL_SOURCE_LINE (decl) = lineno;
2705 DECL_IGNORED_P (decl) = 1;
2706 DECL_CONTEXT (decl) = current_function_decl;
2711 /* Create a new temporary variable of the indicated TYPE, initialized
2714 It is not entered into current_binding_level, because that breaks
2715 things when it comes time to do final cleanups (which take place
2716 "outside" the binding contour of the function). */
2719 get_temp_regvar (type, init)
2724 decl = create_temporary_var (type);
2725 if (building_stmt_tree ())
2726 add_decl_stmt (decl);
2727 if (!building_stmt_tree ())
2728 SET_DECL_RTL (decl, assign_temp (type, 2, 0, 1));
2729 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2734 /* `build_vec_init' returns tree structure that performs
2735 initialization of a vector of aggregate types.
2737 BASE is a reference to the vector, of ARRAY_TYPE.
2738 INIT is the (possibly NULL) initializer.
2740 FROM_ARRAY is 0 if we should init everything with INIT
2741 (i.e., every element initialized from INIT).
2742 FROM_ARRAY is 1 if we should index into INIT in parallel
2743 with initialization of DECL.
2744 FROM_ARRAY is 2 if we should index into INIT in parallel,
2745 but use assignment instead of initialization. */
2748 build_vec_init (base, init, from_array)
2753 tree base2 = NULL_TREE;
2755 tree itype = NULL_TREE;
2757 /* The type of the array. */
2758 tree atype = TREE_TYPE (base);
2759 /* The type of an element in the array. */
2760 tree type = TREE_TYPE (atype);
2761 /* The type of a pointer to an element in the array. */
2766 tree try_block = NULL_TREE;
2767 tree try_body = NULL_TREE;
2768 int num_initialized_elts = 0;
2769 tree maxindex = array_type_nelts (TREE_TYPE (base));
2771 if (maxindex == error_mark_node)
2772 return error_mark_node;
2774 /* For g++.ext/arrnew.C. */
2775 if (init && TREE_CODE (init) == CONSTRUCTOR && TREE_TYPE (init) == NULL_TREE)
2776 init = digest_init (atype, init, 0);
2778 if (init && !TYPE_NEEDS_CONSTRUCTING (type)
2779 && ((TREE_CODE (init) == CONSTRUCTOR
2780 /* Don't do this if the CONSTRUCTOR might contain something
2781 that might throw and require us to clean up. */
2782 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2783 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2786 /* Do non-default initialization of POD arrays resulting from
2787 brace-enclosed initializers. In this case, digest_init and
2788 store_constructor will handle the semantics for us. */
2790 stmt_expr = build (INIT_EXPR, atype, base, init);
2791 TREE_SIDE_EFFECTS (stmt_expr) = 1;
2795 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2796 ptype = build_pointer_type (type);
2797 size = size_in_bytes (type);
2798 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2799 base = cp_convert (ptype, default_conversion (base));
2801 /* The code we are generating looks like:
2805 ptrdiff_t iterator = maxindex;
2808 ... initialize *t1 ...
2810 } while (--iterator != -1);
2812 ... destroy elements that were constructed ...
2816 We can omit the try and catch blocks if we know that the
2817 initialization will never throw an exception, or if the array
2818 elements do not have destructors. We can omit the loop completely if
2819 the elements of the array do not have constructors.
2821 We actually wrap the entire body of the above in a STMT_EXPR, for
2824 When copying from array to another, when the array elements have
2825 only trivial copy constructors, we should use __builtin_memcpy
2826 rather than generating a loop. That way, we could take advantage
2827 of whatever cleverness the back-end has for dealing with copies
2828 of blocks of memory. */
2830 begin_init_stmts (&stmt_expr, &compound_stmt);
2831 destroy_temps = stmts_are_full_exprs_p ();
2832 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2833 rval = get_temp_regvar (ptype, base);
2834 base = get_temp_regvar (ptype, rval);
2835 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2837 /* Protect the entire array initialization so that we can destroy
2838 the partially constructed array if an exception is thrown.
2839 But don't do this if we're assigning. */
2840 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2843 try_block = begin_try_block ();
2844 try_body = begin_compound_stmt (/*has_no_scope=*/1);
2847 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2849 /* Do non-default initialization of non-POD arrays resulting from
2850 brace-enclosed initializers. */
2855 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2857 tree elt = TREE_VALUE (elts);
2858 tree baseref = build1 (INDIRECT_REF, type, base);
2860 num_initialized_elts++;
2862 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2863 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2865 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2868 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2869 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2872 /* Clear out INIT so that we don't get confused below. */
2875 else if (from_array)
2877 /* If initializing one array from another, initialize element by
2878 element. We rely upon the below calls the do argument
2882 base2 = default_conversion (init);
2883 itype = TREE_TYPE (base2);
2884 base2 = get_temp_regvar (itype, base2);
2885 itype = TREE_TYPE (itype);
2887 else if (TYPE_LANG_SPECIFIC (type)
2888 && TYPE_NEEDS_CONSTRUCTING (type)
2889 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2891 error ("initializer ends prematurely");
2892 return error_mark_node;
2896 /* Now, default-initialize any remaining elements. We don't need to
2897 do that if a) the type does not need constructing, or b) we've
2898 already initialized all the elements.
2900 We do need to keep going if we're copying an array. */
2903 || (TYPE_NEEDS_CONSTRUCTING (type)
2904 && ! (host_integerp (maxindex, 0)
2905 && (num_initialized_elts
2906 == tree_low_cst (maxindex, 0) + 1))))
2908 /* If the ITERATOR is equal to -1, then we don't have to loop;
2909 we've already initialized all the elements. */
2915 if_stmt = begin_if_stmt ();
2916 finish_if_stmt_cond (build (NE_EXPR, boolean_type_node,
2917 iterator, integer_minus_one_node),
2920 /* Otherwise, loop through the elements. */
2921 do_stmt = begin_do_stmt ();
2922 do_body = begin_compound_stmt (/*has_no_scope=*/1);
2924 /* When we're not building a statement-tree, things are a little
2925 complicated. If, when we recursively call build_aggr_init,
2926 an expression containing a TARGET_EXPR is expanded, then it
2927 may get a cleanup. Then, the result of that expression is
2928 passed to finish_expr_stmt, which will call
2929 expand_start_target_temps/expand_end_target_temps. However,
2930 the latter call will not cause the cleanup to run because
2931 that block will still be on the block stack. So, we call
2932 expand_start_target_temps here manually; the corresponding
2933 call to expand_end_target_temps below will cause the cleanup
2935 if (!building_stmt_tree ())
2936 expand_start_target_temps ();
2940 tree to = build1 (INDIRECT_REF, type, base);
2944 from = build1 (INDIRECT_REF, itype, base2);
2948 if (from_array == 2)
2949 elt_init = build_modify_expr (to, NOP_EXPR, from);
2950 else if (TYPE_NEEDS_CONSTRUCTING (type))
2951 elt_init = build_aggr_init (to, from, 0);
2953 elt_init = build_modify_expr (to, NOP_EXPR, from);
2957 else if (TREE_CODE (type) == ARRAY_TYPE)
2961 ("cannot initialize multi-dimensional array with initializer");
2962 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2966 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2969 /* The initialization of each array element is a
2970 full-expression, as per core issue 124. */
2971 if (!building_stmt_tree ())
2973 genrtl_expr_stmt (elt_init);
2974 expand_end_target_temps ();
2978 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2979 finish_expr_stmt (elt_init);
2980 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2983 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2985 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2987 finish_compound_stmt (/*has_no_scope=*/1, do_body);
2988 finish_do_body (do_stmt);
2989 finish_do_stmt (build (NE_EXPR, boolean_type_node,
2990 build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2991 integer_minus_one_node),
2994 finish_then_clause (if_stmt);
2998 /* Make sure to cleanup any partially constructed elements. */
2999 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
3004 finish_compound_stmt (/*has_no_scope=*/1, try_body);
3005 finish_cleanup_try_block (try_block);
3006 e = build_vec_delete_1 (rval,
3007 cp_build_binary_op (MINUS_EXPR, maxindex,
3010 sfk_base_destructor,
3011 /*use_global_delete=*/0);
3012 finish_cleanup (e, try_block);
3015 /* The value of the array initialization is the address of the
3016 first element in the array. */
3017 finish_expr_stmt (rval);
3019 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
3020 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3024 /* Free up storage of type TYPE, at address ADDR.
3026 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
3029 VIRTUAL_SIZE is the amount of storage that was allocated, and is
3030 used as the second argument to operator delete. It can include
3031 things like padding and magic size cookies. It has virtual in it,
3032 because if you have a base pointer and you delete through a virtual
3033 destructor, it should be the size of the dynamic object, not the
3034 static object, see Free Store 12.5 ISO C++.
3036 This does not call any destructors. */
3039 build_x_delete (addr, which_delete, virtual_size)
3044 int use_global_delete = which_delete & 1;
3045 int use_vec_delete = !!(which_delete & 2);
3046 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
3047 int flags = LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL);
3049 return build_op_delete_call (code, addr, virtual_size, flags, NULL_TREE);
3052 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3056 build_dtor_call (exp, dtor_kind, flags)
3058 special_function_kind dtor_kind;
3065 case sfk_complete_destructor:
3066 name = complete_dtor_identifier;
3069 case sfk_base_destructor:
3070 name = base_dtor_identifier;
3073 case sfk_deleting_destructor:
3074 name = deleting_dtor_identifier;
3080 return build_method_call (exp, name, NULL_TREE, NULL_TREE, flags);
3083 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3084 ADDR is an expression which yields the store to be destroyed.
3085 AUTO_DELETE is the name of the destructor to call, i.e., either
3086 sfk_complete_destructor, sfk_base_destructor, or
3087 sfk_deleting_destructor.
3089 FLAGS is the logical disjunction of zero or more LOOKUP_
3090 flags. See cp-tree.h for more info. */
3093 build_delete (type, addr, auto_delete, flags, use_global_delete)
3095 special_function_kind auto_delete;
3097 int use_global_delete;
3101 if (addr == error_mark_node)
3102 return error_mark_node;
3104 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3105 set to `error_mark_node' before it gets properly cleaned up. */
3106 if (type == error_mark_node)
3107 return error_mark_node;
3109 type = TYPE_MAIN_VARIANT (type);
3111 if (TREE_CODE (type) == POINTER_TYPE)
3113 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3114 if (!VOID_TYPE_P (type) && !complete_type_or_else (type, addr))
3115 return error_mark_node;
3116 if (TREE_CODE (type) == ARRAY_TYPE)
3118 if (! IS_AGGR_TYPE (type))
3120 /* Call the builtin operator delete. */
3121 return build_builtin_delete_call (addr);
3123 if (TREE_SIDE_EFFECTS (addr))
3124 addr = save_expr (addr);
3126 /* throw away const and volatile on target type of addr */
3127 addr = convert_force (build_pointer_type (type), addr, 0);
3129 else if (TREE_CODE (type) == ARRAY_TYPE)
3132 if (TREE_SIDE_EFFECTS (addr))
3133 addr = save_expr (addr);
3134 if (TYPE_DOMAIN (type) == NULL_TREE)
3136 error ("unknown array size in delete");
3137 return error_mark_node;
3139 return build_vec_delete (addr, array_type_nelts (type),
3140 auto_delete, use_global_delete);
3144 /* Don't check PROTECT here; leave that decision to the
3145 destructor. If the destructor is accessible, call it,
3146 else report error. */
3147 addr = build_unary_op (ADDR_EXPR, addr, 0);
3148 if (TREE_SIDE_EFFECTS (addr))
3149 addr = save_expr (addr);
3151 addr = convert_force (build_pointer_type (type), addr, 0);
3154 my_friendly_assert (IS_AGGR_TYPE (type), 220);
3156 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3158 if (auto_delete != sfk_deleting_destructor)
3159 return void_zero_node;
3161 return build_op_delete_call
3162 (DELETE_EXPR, addr, c_sizeof_nowarn (type),
3163 LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL),
3168 tree do_delete = NULL_TREE;
3171 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
3173 /* For `::delete x', we must not use the deleting destructor
3174 since then we would not be sure to get the global `operator
3176 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3178 /* We will use ADDR multiple times so we must save it. */
3179 addr = save_expr (addr);
3180 /* Delete the object. */
3181 do_delete = build_builtin_delete_call (addr);
3182 /* Otherwise, treat this like a complete object destructor
3184 auto_delete = sfk_complete_destructor;
3186 /* If the destructor is non-virtual, there is no deleting
3187 variant. Instead, we must explicitly call the appropriate
3188 `operator delete' here. */
3189 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3190 && auto_delete == sfk_deleting_destructor)
3192 /* We will use ADDR multiple times so we must save it. */
3193 addr = save_expr (addr);
3194 /* Build the call. */
3195 do_delete = build_op_delete_call (DELETE_EXPR,
3197 c_sizeof_nowarn (type),
3200 /* Call the complete object destructor. */
3201 auto_delete = sfk_complete_destructor;
3204 expr = build_dtor_call (build_indirect_ref (addr, NULL),
3205 auto_delete, flags);
3207 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3209 if (flags & LOOKUP_DESTRUCTOR)
3210 /* Explicit destructor call; don't check for null pointer. */
3211 ifexp = integer_one_node;
3213 /* Handle deleting a null pointer. */
3214 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
3216 if (ifexp != integer_one_node)
3217 expr = build (COND_EXPR, void_type_node,
3218 ifexp, expr, void_zero_node);
3224 /* At the beginning of a destructor, push cleanups that will call the
3225 destructors for our base classes and members.
3227 Called from setup_vtbl_ptr. */
3230 push_base_cleanups ()
3233 int i, n_baseclasses;
3237 /* Run destructors for all virtual baseclasses. */
3238 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
3241 tree cond = (condition_conversion
3242 (build (BIT_AND_EXPR, integer_type_node,
3243 current_in_charge_parm,
3244 integer_two_node)));
3246 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3247 /* The CLASSTYPE_VBASECLASSES list is in initialization
3248 order, which is also the right order for pushing cleanups. */
3250 vbases = TREE_CHAIN (vbases))
3252 tree vbase = TREE_VALUE (vbases);
3253 tree base_type = BINFO_TYPE (vbase);
3255 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3257 tree base_ptr_type = build_pointer_type (base_type);
3258 expr = current_class_ptr;
3260 /* Convert to the basetype here, as we know the layout is
3261 fixed. What is more, if we let build_method_call do it,
3262 it will use the vtable, which may have been clobbered
3263 by the deletion of our primary base. */
3265 expr = build1 (NOP_EXPR, base_ptr_type, expr);
3266 expr = build (PLUS_EXPR, base_ptr_type, expr,
3267 BINFO_OFFSET (vbase));
3268 expr = build_indirect_ref (expr, NULL);
3269 expr = build_method_call (expr, base_dtor_identifier,
3272 expr = build (COND_EXPR, void_type_node, cond,
3273 expr, void_zero_node);
3274 finish_decl_cleanup (NULL_TREE, expr);
3279 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3280 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3282 /* Take care of the remaining baseclasses. */
3283 for (i = 0; i < n_baseclasses; i++)
3285 tree base_binfo = TREE_VEC_ELT (binfos, i);
3286 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3287 || TREE_VIA_VIRTUAL (base_binfo))
3290 expr = build_scoped_method_call (current_class_ref, base_binfo,
3291 base_dtor_identifier,
3294 finish_decl_cleanup (NULL_TREE, expr);
3297 for (member = TYPE_FIELDS (current_class_type); member;
3298 member = TREE_CHAIN (member))
3300 if (TREE_CODE (member) != FIELD_DECL)
3302 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3304 tree this_member = (build_component_ref
3305 (current_class_ref, DECL_NAME (member),
3307 tree this_type = TREE_TYPE (member);
3308 expr = build_delete (this_type, this_member,
3309 sfk_complete_destructor,
3310 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3312 finish_decl_cleanup (NULL_TREE, expr);
3317 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3320 build_vbase_delete (type, decl)
3323 tree vbases = CLASSTYPE_VBASECLASSES (type);
3324 tree result = NULL_TREE;
3325 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3327 my_friendly_assert (addr != error_mark_node, 222);
3332 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))),
3334 result = tree_cons (NULL_TREE,
3335 build_delete (TREE_TYPE (this_addr), this_addr,
3336 sfk_base_destructor,
3337 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0),
3339 vbases = TREE_CHAIN (vbases);
3341 return build_compound_expr (nreverse (result));
3344 /* Build a C++ vector delete expression.
3345 MAXINDEX is the number of elements to be deleted.
3346 ELT_SIZE is the nominal size of each element in the vector.
3347 BASE is the expression that should yield the store to be deleted.
3348 This function expands (or synthesizes) these calls itself.
3349 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3351 This also calls delete for virtual baseclasses of elements of the vector.
3353 Update: MAXINDEX is no longer needed. The size can be extracted from the
3354 start of the vector for pointers, and from the type for arrays. We still
3355 use MAXINDEX for arrays because it happens to already have one of the
3356 values we'd have to extract. (We could use MAXINDEX with pointers to
3357 confirm the size, and trap if the numbers differ; not clear that it'd
3358 be worth bothering.) */
3361 build_vec_delete (base, maxindex, auto_delete_vec, use_global_delete)
3362 tree base, maxindex;
3363 special_function_kind auto_delete_vec;
3364 int use_global_delete;
3368 if (TREE_CODE (base) == OFFSET_REF)
3369 base = resolve_offset_ref (base);
3371 type = TREE_TYPE (base);
3373 base = stabilize_reference (base);
3375 /* Since we can use base many times, save_expr it. */
3376 if (TREE_SIDE_EFFECTS (base))
3377 base = save_expr (base);
3379 if (TREE_CODE (type) == POINTER_TYPE)
3381 /* Step back one from start of vector, and read dimension. */
3384 type = strip_array_types (TREE_TYPE (type));
3385 cookie_addr = build (MINUS_EXPR,
3386 build_pointer_type (sizetype),
3388 TYPE_SIZE_UNIT (sizetype));
3389 maxindex = build_indirect_ref (cookie_addr, NULL);
3391 else if (TREE_CODE (type) == ARRAY_TYPE)
3393 /* get the total number of things in the array, maxindex is a bad name */
3394 maxindex = array_type_nelts_total (type);
3395 type = strip_array_types (type);
3396 base = build_unary_op (ADDR_EXPR, base, 1);
3400 if (base != error_mark_node)
3401 error ("type to vector delete is neither pointer or array type");
3402 return error_mark_node;
3405 return build_vec_delete_1 (base, maxindex, type, auto_delete_vec,