1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003 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"
38 static void construct_virtual_base (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 (tree, tree);
43 static tree build_builtin_delete_call PARAMS ((tree));
44 static int member_init_ok_or_else PARAMS ((tree, tree, tree));
45 static void expand_virtual_init PARAMS ((tree, tree));
46 static tree sort_mem_initializers (tree, tree);
47 static tree initializing_context PARAMS ((tree));
48 static void expand_cleanup_for_base PARAMS ((tree, tree));
49 static tree get_temp_regvar PARAMS ((tree, tree));
50 static tree dfs_initialize_vtbl_ptrs PARAMS ((tree, void *));
51 static tree build_default_init PARAMS ((tree));
52 static tree build_new_1 PARAMS ((tree));
53 static tree get_cookie_size PARAMS ((tree));
54 static tree build_dtor_call PARAMS ((tree, special_function_kind, int));
55 static tree build_field_list PARAMS ((tree, tree, int *));
56 static tree build_vtbl_address PARAMS ((tree));
58 /* We are about to generate some complex initialization code.
59 Conceptually, it is all a single expression. However, we may want
60 to include conditionals, loops, and other such statement-level
61 constructs. Therefore, we build the initialization code inside a
62 statement-expression. This function starts such an expression.
63 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
64 pass them back to finish_init_stmts when the expression is
68 begin_init_stmts (stmt_expr_p, compound_stmt_p)
70 tree *compound_stmt_p;
72 if (building_stmt_tree ())
73 *stmt_expr_p = begin_stmt_expr ();
75 *stmt_expr_p = begin_global_stmt_expr ();
77 if (building_stmt_tree ())
78 *compound_stmt_p = begin_compound_stmt (/*has_no_scope=*/1);
81 /* Finish out the statement-expression begun by the previous call to
82 begin_init_stmts. Returns the statement-expression itself. */
85 finish_init_stmts (stmt_expr, compound_stmt)
90 if (building_stmt_tree ())
91 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
93 if (building_stmt_tree ())
95 stmt_expr = finish_stmt_expr (stmt_expr);
96 STMT_EXPR_NO_SCOPE (stmt_expr) = true;
99 stmt_expr = finish_global_stmt_expr (stmt_expr);
101 /* To avoid spurious warnings about unused values, we set
104 TREE_USED (stmt_expr) = 1;
111 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
112 which we want to initialize the vtable pointer for, DATA is
113 TREE_LIST whose TREE_VALUE is the this ptr expression. */
116 dfs_initialize_vtbl_ptrs (binfo, data)
120 if ((!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
121 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
123 tree base_ptr = TREE_VALUE ((tree) data);
125 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
127 expand_virtual_init (binfo, base_ptr);
130 BINFO_MARKED (binfo) = 1;
135 /* Initialize all the vtable pointers in the object pointed to by
139 initialize_vtbl_ptrs (addr)
145 type = TREE_TYPE (TREE_TYPE (addr));
146 list = build_tree_list (type, addr);
148 /* Walk through the hierarchy, initializing the vptr in each base
149 class. We do these in pre-order because can't find the virtual
150 bases for a class until we've initialized the vtbl for that
152 dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
153 NULL, unmarkedp, list);
154 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, type);
157 /* Return an expression for the zero-initialization of an object with
158 type T. This expression will either be a constant (in the case
159 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
160 aggregate). In either case, the value can be used as DECL_INITIAL
161 for a decl of the indicated TYPE; it is a valid static initializer.
162 If STATIC_STORAGE_P is TRUE, initializers are only generated for
163 entities for which zero-initialization does not simply mean filling
164 the storage with zero bytes. */
167 build_zero_init (tree type, bool static_storage_p)
169 tree init = NULL_TREE;
173 To zero-initialization storage for an object of type T means:
175 -- if T is a scalar type, the storage is set to the value of zero
178 -- if T is a non-union class type, the storage for each nonstatic
179 data member and each base-class subobject is zero-initialized.
181 -- if T is a union type, the storage for its first data member is
184 -- if T is an array type, the storage for each element is
187 -- if T is a reference type, no initialization is performed. */
189 if (type == error_mark_node)
191 else if (static_storage_p && zero_init_p (type))
192 /* In order to save space, we do not explicitly build initializers
193 for items that do not need them. GCC's semantics are that
194 items with static storage duration that are not otherwise
195 initialized are initialized to zero. */
197 else if (SCALAR_TYPE_P (type))
198 init = convert (type, integer_zero_node);
199 else if (CLASS_TYPE_P (type))
204 /* Build a constructor to contain the initializations. */
205 init = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
206 /* Iterate over the fields, building initializations. */
208 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
210 if (TREE_CODE (field) != FIELD_DECL)
213 /* Note that for class types there will be FIELD_DECLs
214 corresponding to base classes as well. Thus, iterating
215 over TYPE_FIELDs will result in correct initialization of
216 all of the subobjects. */
217 if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
218 inits = tree_cons (field,
219 build_zero_init (TREE_TYPE (field),
223 /* For unions, only the first field is initialized. */
224 if (TREE_CODE (type) == UNION_TYPE)
227 CONSTRUCTOR_ELTS (init) = nreverse (inits);
229 else if (TREE_CODE (type) == ARRAY_TYPE)
235 /* Build a constructor to contain the initializations. */
236 init = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
237 /* Iterate over the array elements, building initializations. */
239 for (index = size_zero_node, max_index = array_type_nelts (type);
240 !tree_int_cst_lt (max_index, index);
241 index = size_binop (PLUS_EXPR, index, size_one_node))
242 inits = tree_cons (index,
243 build_zero_init (TREE_TYPE (type),
246 CONSTRUCTOR_ELTS (init) = nreverse (inits);
248 else if (TREE_CODE (type) == REFERENCE_TYPE)
253 /* In all cases, the initializer is a constant. */
255 TREE_CONSTANT (init) = 1;
260 /* Build an expression for the default-initialization of an object
261 with type T. If initialization T requires calling constructors,
262 this function returns NULL_TREE; the caller is responsible for
263 arranging for the constructors to be called. */
266 build_default_init (type)
271 To default-initialize an object of type T means:
273 --if T is a non-POD class type (clause _class_), the default construc-
274 tor for T is called (and the initialization is ill-formed if T has
275 no accessible default constructor);
277 --if T is an array type, each element is default-initialized;
279 --otherwise, the storage for the object is zero-initialized.
281 A program that calls for default-initialization of an entity of refer-
282 ence type is ill-formed. */
284 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
285 performing the initialization. This is confusing in that some
286 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
287 a class with a pointer-to-data member as a non-static data member
288 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
289 passing non-PODs to build_zero_init below, which is contrary to
290 the semantics quoted above from [dcl.init].
292 It happens, however, that the behavior of the constructor the
293 standard says we should have generated would be precisely the
294 same as that obtained by calling build_zero_init below, so things
296 if (TYPE_NEEDS_CONSTRUCTING (type))
299 /* At this point, TYPE is either a POD class type, an array of POD
300 classes, or something even more inoccuous. */
301 return build_zero_init (type, /*static_storage_p=*/false);
304 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
305 arguments. If TREE_LIST is void_type_node, an empty initializer
306 list was given; if NULL_TREE no initializer was given. */
309 perform_member_init (tree member, tree init)
312 tree type = TREE_TYPE (member);
315 explicit = (init != NULL_TREE);
317 /* Effective C++ rule 12 requires that all data members be
319 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
320 warning ("`%D' should be initialized in the member initialization "
324 if (init == void_type_node)
327 /* Get an lvalue for the data member. */
328 decl = build_class_member_access_expr (current_class_ref, member,
329 /*access_path=*/NULL_TREE,
330 /*preserve_reference=*/true);
331 if (decl == error_mark_node)
334 /* Deal with this here, as we will get confused if we try to call the
335 assignment op for an anonymous union. This can happen in a
336 synthesized copy constructor. */
337 if (ANON_AGGR_TYPE_P (type))
341 init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
342 finish_expr_stmt (init);
345 else if (TYPE_NEEDS_CONSTRUCTING (type)
346 || (init && TYPE_HAS_CONSTRUCTOR (type)))
349 && TREE_CODE (type) == ARRAY_TYPE
351 && TREE_CHAIN (init) == NULL_TREE
352 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
354 /* Initialization of one array from another. */
355 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
359 finish_expr_stmt (build_aggr_init (decl, init, 0));
363 if (init == NULL_TREE)
367 init = build_default_init (type);
368 if (TREE_CODE (type) == REFERENCE_TYPE)
370 ("default-initialization of `%#D', which has reference type",
373 /* member traversal: note it leaves init NULL */
374 else if (TREE_CODE (type) == REFERENCE_TYPE)
375 pedwarn ("uninitialized reference member `%D'", member);
377 else if (TREE_CODE (init) == TREE_LIST)
379 /* There was an explicit member initialization. Do some
380 work in that case. */
381 if (TREE_CHAIN (init))
383 warning ("initializer list treated as compound expression");
384 init = build_compound_expr (init);
387 init = TREE_VALUE (init);
391 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
394 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
398 expr = build_class_member_access_expr (current_class_ref, member,
399 /*access_path=*/NULL_TREE,
400 /*preserve_reference=*/false);
401 expr = build_delete (type, expr, sfk_complete_destructor,
402 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
404 if (expr != error_mark_node)
405 finish_eh_cleanup (expr);
409 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
410 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
413 build_field_list (t, list, uses_unions_p)
422 /* Note whether or not T is a union. */
423 if (TREE_CODE (t) == UNION_TYPE)
426 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
428 /* Skip CONST_DECLs for enumeration constants and so forth. */
429 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
432 /* Keep track of whether or not any fields are unions. */
433 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
436 /* For an anonymous struct or union, we must recursively
437 consider the fields of the anonymous type. They can be
438 directly initialized from the constructor. */
439 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
441 /* Add this field itself. Synthesized copy constructors
442 initialize the entire aggregate. */
443 list = tree_cons (fields, NULL_TREE, list);
444 /* And now add the fields in the anonymous aggregate. */
445 list = build_field_list (TREE_TYPE (fields), list,
448 /* Add this field. */
449 else if (DECL_NAME (fields))
450 list = tree_cons (fields, NULL_TREE, list);
456 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
457 a FIELD_DECL or BINFO in T that needs initialization. The
458 TREE_VALUE gives the initializer, or list of initializer arguments.
460 Return a TREE_LIST containing all of the initializations required
461 for T, in the order in which they should be performed. The output
462 list has the same format as the input. */
465 sort_mem_initializers (tree t, tree mem_inits)
474 /* Build up a list of initializations. The TREE_PURPOSE of entry
475 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
476 TREE_VALUE will be the constructor arguments, or NULL if no
477 explicit initialization was provided. */
478 sorted_inits = NULL_TREE;
479 /* Process the virtual bases. */
480 for (base = CLASSTYPE_VBASECLASSES (t); base; base = TREE_CHAIN (base))
481 sorted_inits = tree_cons (TREE_VALUE (base), NULL_TREE, sorted_inits);
482 /* Process the direct bases. */
483 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
485 base = BINFO_BASETYPE (TYPE_BINFO (t), i);
486 if (!TREE_VIA_VIRTUAL (base))
487 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
489 /* Process the non-static data members. */
490 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
491 /* Reverse the entire list of initializations, so that they are in
492 the order that they will actually be performed. */
493 sorted_inits = nreverse (sorted_inits);
495 /* If the user presented the initializers in an order different from
496 that in which they will actually occur, we issue a warning. Keep
497 track of the next subobject which can be explicitly initialized
498 without issuing a warning. */
499 next_subobject = sorted_inits;
501 /* Go through the explicit initializers, filling in TREE_PURPOSE in
503 for (init = mem_inits; init; init = TREE_CHAIN (init))
508 subobject = TREE_PURPOSE (init);
510 /* If the explicit initializers are in sorted order, then
511 SUBOBJECT will be NEXT_SUBOBJECT, or something following
513 for (subobject_init = next_subobject;
515 subobject_init = TREE_CHAIN (subobject_init))
516 if (TREE_PURPOSE (subobject_init) == subobject)
519 /* Issue a warning if the explicit initializer order does not
520 match that which will actually occur. */
521 if (warn_reorder && !subobject_init)
523 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
524 cp_warning_at ("`%D' will be initialized after",
525 TREE_PURPOSE (next_subobject));
527 warning ("base `%T' will be initialized after",
528 TREE_PURPOSE (next_subobject));
529 if (TREE_CODE (subobject) == FIELD_DECL)
530 cp_warning_at (" `%#D'", subobject);
532 warning (" base `%T'", subobject);
535 /* Look again, from the beginning of the list. */
538 subobject_init = sorted_inits;
539 while (TREE_PURPOSE (subobject_init) != subobject)
540 subobject_init = TREE_CHAIN (subobject_init);
543 /* It is invalid to initialize the same subobject more than
545 if (TREE_VALUE (subobject_init))
547 if (TREE_CODE (subobject) == FIELD_DECL)
548 error ("multiple initializations given for `%D'", subobject);
550 error ("multiple initializations given for base `%T'",
554 /* Record the initialization. */
555 TREE_VALUE (subobject_init) = TREE_VALUE (init);
556 next_subobject = subobject_init;
561 If a ctor-initializer specifies more than one mem-initializer for
562 multiple members of the same union (including members of
563 anonymous unions), the ctor-initializer is ill-formed. */
566 tree last_field = NULL_TREE;
567 for (init = sorted_inits; init; init = TREE_CHAIN (init))
573 /* Skip uninitialized members and base classes. */
574 if (!TREE_VALUE (init)
575 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
577 /* See if this field is a member of a union, or a member of a
578 structure contained in a union, etc. */
579 field = TREE_PURPOSE (init);
580 for (field_type = DECL_CONTEXT (field);
581 !same_type_p (field_type, t);
582 field_type = TYPE_CONTEXT (field_type))
583 if (TREE_CODE (field_type) == UNION_TYPE)
585 /* If this field is not a member of a union, skip it. */
586 if (TREE_CODE (field_type) != UNION_TYPE)
589 /* It's only an error if we have two initializers for the same
597 /* See if LAST_FIELD and the field initialized by INIT are
598 members of the same union. If so, there's a problem,
599 unless they're actually members of the same structure
600 which is itself a member of a union. For example, given:
602 union { struct { int i; int j; }; };
604 initializing both `i' and `j' makes sense. */
605 field_type = DECL_CONTEXT (field);
609 tree last_field_type;
611 last_field_type = DECL_CONTEXT (last_field);
614 if (same_type_p (last_field_type, field_type))
616 if (TREE_CODE (field_type) == UNION_TYPE)
617 error ("initializations for multiple members of `%T'",
623 if (same_type_p (last_field_type, t))
626 last_field_type = TYPE_CONTEXT (last_field_type);
629 /* If we've reached the outermost class, then we're
631 if (same_type_p (field_type, t))
634 field_type = TYPE_CONTEXT (field_type);
645 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
646 is a TREE_LIST giving the explicit mem-initializer-list for the
647 constructor. The TREE_PURPOSE of each entry is a subobject (a
648 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
649 is a TREE_LIST giving the arguments to the constructor or
650 void_type_node for an empty list of arguments. */
653 emit_mem_initializers (tree mem_inits)
655 /* Sort the mem-initializers into the order in which the
656 initializations should be performed. */
657 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
659 /* Initialize base classes. */
661 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
663 tree subobject = TREE_PURPOSE (mem_inits);
664 tree arguments = TREE_VALUE (mem_inits);
666 /* If these initializations are taking place in a copy
667 constructor, the base class should probably be explicitly
669 if (extra_warnings && !arguments
670 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
671 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
672 warning ("base class `%#T' should be explicitly initialized in the "
674 BINFO_TYPE (subobject));
676 /* If an explicit -- but empty -- initializer list was present,
677 treat it just like default initialization at this point. */
678 if (arguments == void_type_node)
679 arguments = NULL_TREE;
681 /* Initialize the base. */
682 if (TREE_VIA_VIRTUAL (subobject))
683 construct_virtual_base (subobject, arguments);
688 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
690 expand_aggr_init_1 (subobject, NULL_TREE,
691 build_indirect_ref (base_addr, NULL),
694 expand_cleanup_for_base (subobject, NULL_TREE);
697 mem_inits = TREE_CHAIN (mem_inits);
700 /* Initialize the vptrs. */
701 initialize_vtbl_ptrs (current_class_ptr);
703 /* Initialize the data members. */
706 perform_member_init (TREE_PURPOSE (mem_inits),
707 TREE_VALUE (mem_inits));
708 mem_inits = TREE_CHAIN (mem_inits);
712 /* Returns the address of the vtable (i.e., the value that should be
713 assigned to the vptr) for BINFO. */
716 build_vtbl_address (binfo)
719 tree binfo_for = binfo;
722 if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
723 && BINFO_PRIMARY_P (binfo))
724 /* If this is a virtual primary base, then the vtable we want to store
725 is that for the base this is being used as the primary base of. We
726 can't simply skip the initialization, because we may be expanding the
727 inits of a subobject constructor where the virtual base layout
729 while (BINFO_PRIMARY_BASE_OF (binfo_for))
730 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
732 /* Figure out what vtable BINFO's vtable is based on, and mark it as
734 vtbl = get_vtbl_decl_for_binfo (binfo_for);
735 assemble_external (vtbl);
736 TREE_USED (vtbl) = 1;
738 /* Now compute the address to use when initializing the vptr. */
739 vtbl = BINFO_VTABLE (binfo_for);
740 if (TREE_CODE (vtbl) == VAR_DECL)
742 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
743 TREE_CONSTANT (vtbl) = 1;
749 /* This code sets up the virtual function tables appropriate for
750 the pointer DECL. It is a one-ply initialization.
752 BINFO is the exact type that DECL is supposed to be. In
753 multiple inheritance, this might mean "C's A" if C : A, B. */
756 expand_virtual_init (binfo, decl)
762 /* Compute the initializer for vptr. */
763 vtbl = build_vtbl_address (binfo);
765 /* We may get this vptr from a VTT, if this is a subobject
766 constructor or subobject destructor. */
767 vtt_index = BINFO_VPTR_INDEX (binfo);
773 /* Compute the value to use, when there's a VTT. */
774 vtt_parm = current_vtt_parm;
775 vtbl2 = build (PLUS_EXPR,
776 TREE_TYPE (vtt_parm),
779 vtbl2 = build1 (INDIRECT_REF, TREE_TYPE (vtbl), vtbl2);
781 /* The actual initializer is the VTT value only in the subobject
782 constructor. In maybe_clone_body we'll substitute NULL for
783 the vtt_parm in the case of the non-subobject constructor. */
784 vtbl = build (COND_EXPR,
786 build (EQ_EXPR, boolean_type_node,
787 current_in_charge_parm, integer_zero_node),
792 /* Compute the location of the vtpr. */
793 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
795 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
797 /* Assign the vtable to the vptr. */
798 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
799 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
802 /* If an exception is thrown in a constructor, those base classes already
803 constructed must be destroyed. This function creates the cleanup
804 for BINFO, which has just been constructed. If FLAG is non-NULL,
805 it is a DECL which is nonzero when this base needs to be
809 expand_cleanup_for_base (binfo, flag)
815 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
818 /* Call the destructor. */
819 expr = build_special_member_call (current_class_ref,
820 base_dtor_identifier,
823 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
825 expr = fold (build (COND_EXPR, void_type_node,
826 c_common_truthvalue_conversion (flag),
827 expr, integer_zero_node));
829 finish_eh_cleanup (expr);
832 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
836 construct_virtual_base (tree vbase, tree arguments)
843 /* If there are virtual base classes with destructors, we need to
844 emit cleanups to destroy them if an exception is thrown during
845 the construction process. These exception regions (i.e., the
846 period during which the cleanups must occur) begin from the time
847 the construction is complete to the end of the function. If we
848 create a conditional block in which to initialize the
849 base-classes, then the cleanup region for the virtual base begins
850 inside a block, and ends outside of that block. This situation
851 confuses the sjlj exception-handling code. Therefore, we do not
852 create a single conditional block, but one for each
853 initialization. (That way the cleanup regions always begin
854 in the outer block.) We trust the back-end to figure out
855 that the FLAG will not change across initializations, and
856 avoid doing multiple tests. */
857 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
858 inner_if_stmt = begin_if_stmt ();
859 finish_if_stmt_cond (flag, inner_if_stmt);
860 compound_stmt = begin_compound_stmt (/*has_no_scope=*/1);
862 /* Compute the location of the virtual base. If we're
863 constructing virtual bases, then we must be the most derived
864 class. Therefore, we don't have to look up the virtual base;
865 we already know where it is. */
866 exp = build (PLUS_EXPR,
867 TREE_TYPE (current_class_ptr),
869 fold (build1 (NOP_EXPR, TREE_TYPE (current_class_ptr),
870 BINFO_OFFSET (vbase))));
871 exp = build1 (NOP_EXPR,
872 build_pointer_type (BINFO_TYPE (vbase)),
874 exp = build1 (INDIRECT_REF, BINFO_TYPE (vbase), exp);
876 expand_aggr_init_1 (vbase, current_class_ref, exp,
877 arguments, LOOKUP_COMPLAIN);
878 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
879 finish_then_clause (inner_if_stmt);
882 expand_cleanup_for_base (vbase, flag);
885 /* Find the context in which this FIELD can be initialized. */
888 initializing_context (field)
891 tree t = DECL_CONTEXT (field);
893 /* Anonymous union members can be initialized in the first enclosing
894 non-anonymous union context. */
895 while (t && ANON_AGGR_TYPE_P (t))
896 t = TYPE_CONTEXT (t);
900 /* Function to give error message if member initialization specification
901 is erroneous. FIELD is the member we decided to initialize.
902 TYPE is the type for which the initialization is being performed.
903 FIELD must be a member of TYPE.
905 MEMBER_NAME is the name of the member. */
908 member_init_ok_or_else (field, type, member_name)
913 if (field == error_mark_node)
917 error ("class `%T' does not have any field named `%D'", type,
921 if (TREE_CODE (field) == VAR_DECL)
923 error ("`%#D' is a static data member; it can only be "
924 "initialized at its definition",
928 if (TREE_CODE (field) != FIELD_DECL)
930 error ("`%#D' is not a non-static data member of `%T'",
934 if (initializing_context (field) != type)
936 error ("class `%T' does not have any field named `%D'", type,
944 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
945 is a _TYPE node or TYPE_DECL which names a base for that type.
946 INIT is a parameter list for that field's or base's constructor.
947 Check the validity of NAME, and return a TREE_LIST of the base
948 _TYPE or FIELD_DECL and the INIT. If NAME is invalid, return
949 NULL_TREE and issue a diagnostic.
951 An old style unnamed direct single base construction is permitted,
952 where NAME is NULL. */
955 expand_member_init (tree name, tree init)
960 if (!current_class_ref)
965 /* This is an obsolete unnamed base class initializer. The
966 parser will already have warned about its use. */
967 switch (CLASSTYPE_N_BASECLASSES (current_class_type))
970 error ("unnamed initializer for `%T', which has no base classes",
974 basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
977 error ("unnamed initializer for `%T', which uses multiple inheritance",
982 else if (TYPE_P (name))
984 basetype = TYPE_MAIN_VARIANT (name);
985 name = TYPE_NAME (name);
987 else if (TREE_CODE (name) == TYPE_DECL)
988 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
990 basetype = NULL_TREE;
992 my_friendly_assert (init != NULL_TREE, 0);
998 if (current_template_parms)
999 return build_tree_list (basetype, init);
1001 binfo = lookup_base (current_class_type, basetype,
1003 if (!binfo || (!TREE_VIA_VIRTUAL (binfo)
1004 && (BINFO_INHERITANCE_CHAIN (binfo)
1005 != TYPE_BINFO (current_class_type))))
1007 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1008 error ("type `%D' is not a direct or virtual base of `%T'",
1009 name, current_class_type);
1011 error ("type `%D' is not a direct base of `%T'",
1012 name, current_class_type);
1015 return build_tree_list (binfo, init);
1019 if (TREE_CODE (name) == IDENTIFIER_NODE)
1020 field = lookup_field (current_class_type, name, 1, false);
1024 if (member_init_ok_or_else (field, current_class_type, name))
1025 return build_tree_list (field, init);
1031 /* This is like `expand_member_init', only it stores one aggregate
1034 INIT comes in two flavors: it is either a value which
1035 is to be stored in EXP, or it is a parameter list
1036 to go to a constructor, which will operate on EXP.
1037 If INIT is not a parameter list for a constructor, then set
1038 LOOKUP_ONLYCONVERTING.
1039 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1040 the initializer, if FLAGS is 0, then it is the (init) form.
1041 If `init' is a CONSTRUCTOR, then we emit a warning message,
1042 explaining that such initializations are invalid.
1044 If INIT resolves to a CALL_EXPR which happens to return
1045 something of the type we are looking for, then we know
1046 that we can safely use that call to perform the
1049 The virtual function table pointer cannot be set up here, because
1050 we do not really know its type.
1052 This never calls operator=().
1054 When initializing, nothing is CONST.
1056 A default copy constructor may have to be used to perform the
1059 A constructor or a conversion operator may have to be used to
1060 perform the initialization, but not both, as it would be ambiguous. */
1063 build_aggr_init (exp, init, flags)
1070 tree type = TREE_TYPE (exp);
1071 int was_const = TREE_READONLY (exp);
1072 int was_volatile = TREE_THIS_VOLATILE (exp);
1074 if (init == error_mark_node)
1075 return error_mark_node;
1077 TREE_READONLY (exp) = 0;
1078 TREE_THIS_VOLATILE (exp) = 0;
1080 if (init && TREE_CODE (init) != TREE_LIST)
1081 flags |= LOOKUP_ONLYCONVERTING;
1083 if (TREE_CODE (type) == ARRAY_TYPE)
1085 /* Must arrange to initialize each element of EXP
1086 from elements of INIT. */
1087 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1091 /* Handle bad initializers like:
1095 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1099 int main(int argc, char **argv) {
1100 COMPLEX zees(1.0, 0.0)[10];
1103 error ("bad array initializer");
1104 return error_mark_node;
1106 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1107 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1108 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1109 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1110 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1111 init && same_type_p (TREE_TYPE (init),
1113 TREE_READONLY (exp) = was_const;
1114 TREE_THIS_VOLATILE (exp) = was_volatile;
1115 TREE_TYPE (exp) = type;
1117 TREE_TYPE (init) = itype;
1121 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1122 /* just know that we've seen something for this node */
1123 TREE_USED (exp) = 1;
1125 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1126 begin_init_stmts (&stmt_expr, &compound_stmt);
1127 destroy_temps = stmts_are_full_exprs_p ();
1128 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1129 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1130 init, LOOKUP_NORMAL|flags);
1131 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
1132 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1133 TREE_TYPE (exp) = type;
1134 TREE_READONLY (exp) = was_const;
1135 TREE_THIS_VOLATILE (exp) = was_volatile;
1140 /* Like build_aggr_init, but not just for aggregates. */
1143 build_init (decl, init, flags)
1149 if (IS_AGGR_TYPE (TREE_TYPE (decl))
1150 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1151 expr = build_aggr_init (decl, init, flags);
1153 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1159 expand_default_init (binfo, true_exp, exp, init, flags)
1165 tree type = TREE_TYPE (exp);
1168 /* It fails because there may not be a constructor which takes
1169 its own type as the first (or only parameter), but which does
1170 take other types via a conversion. So, if the thing initializing
1171 the expression is a unit element of type X, first try X(X&),
1172 followed by initialization by X. If neither of these work
1173 out, then look hard. */
1177 if (init && TREE_CODE (init) != TREE_LIST
1178 && (flags & LOOKUP_ONLYCONVERTING))
1180 /* Base subobjects should only get direct-initialization. */
1181 if (true_exp != exp)
1184 if (flags & DIRECT_BIND)
1185 /* Do nothing. We hit this in two cases: Reference initialization,
1186 where we aren't initializing a real variable, so we don't want
1187 to run a new constructor; and catching an exception, where we
1188 have already built up the constructor call so we could wrap it
1189 in an exception region. */;
1190 else if (TREE_CODE (init) == CONSTRUCTOR
1191 && TREE_HAS_CONSTRUCTOR (init))
1193 /* A brace-enclosed initializer for an aggregate. */
1194 my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1195 init = digest_init (type, init, (tree *)NULL);
1198 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1200 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1201 /* We need to protect the initialization of a catch parm with a
1202 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1203 around the TARGET_EXPR for the copy constructor. See
1204 initialize_handler_parm. */
1206 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1207 TREE_OPERAND (init, 0));
1208 TREE_TYPE (init) = void_type_node;
1211 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1212 TREE_SIDE_EFFECTS (init) = 1;
1213 finish_expr_stmt (init);
1217 if (init == NULL_TREE
1218 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1222 init = TREE_VALUE (parms);
1225 parms = build_tree_list (NULL_TREE, init);
1227 if (true_exp == exp)
1228 ctor_name = complete_ctor_identifier;
1230 ctor_name = base_ctor_identifier;
1232 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1233 if (TREE_SIDE_EFFECTS (rval))
1235 if (building_stmt_tree ())
1236 finish_expr_stmt (rval);
1238 genrtl_expr_stmt (rval);
1242 /* This function is responsible for initializing EXP with INIT
1245 BINFO is the binfo of the type for who we are performing the
1246 initialization. For example, if W is a virtual base class of A and B,
1248 If we are initializing B, then W must contain B's W vtable, whereas
1249 were we initializing C, W must contain C's W vtable.
1251 TRUE_EXP is nonzero if it is the true expression being initialized.
1252 In this case, it may be EXP, or may just contain EXP. The reason we
1253 need this is because if EXP is a base element of TRUE_EXP, we
1254 don't necessarily know by looking at EXP where its virtual
1255 baseclass fields should really be pointing. But we do know
1256 from TRUE_EXP. In constructors, we don't know anything about
1257 the value being initialized.
1259 FLAGS is just passes to `build_method_call'. See that function for
1263 expand_aggr_init_1 (binfo, true_exp, exp, init, flags)
1269 tree type = TREE_TYPE (exp);
1271 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1272 my_friendly_assert (building_stmt_tree (), 20021010);
1274 /* Use a function returning the desired type to initialize EXP for us.
1275 If the function is a constructor, and its first argument is
1276 NULL_TREE, know that it was meant for us--just slide exp on
1277 in and expand the constructor. Constructors now come
1280 if (init && TREE_CODE (exp) == VAR_DECL
1281 && TREE_CODE (init) == CONSTRUCTOR
1282 && TREE_HAS_CONSTRUCTOR (init))
1284 /* If store_init_value returns NULL_TREE, the INIT has been
1285 record in the DECL_INITIAL for EXP. That means there's
1286 nothing more we have to do. */
1287 if (store_init_value (exp, init))
1288 finish_expr_stmt (build (INIT_EXPR, type, exp, init));
1292 /* We know that expand_default_init can handle everything we want
1294 expand_default_init (binfo, true_exp, exp, init, flags);
1297 /* Report an error if TYPE is not a user-defined, aggregate type. If
1298 OR_ELSE is nonzero, give an error message. */
1301 is_aggr_type (type, or_else)
1305 if (type == error_mark_node)
1308 if (! IS_AGGR_TYPE (type)
1309 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1310 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1313 error ("`%T' is not an aggregate type", type);
1319 /* Like is_aggr_typedef, but returns typedef if successful. */
1322 get_aggr_from_typedef (name, or_else)
1328 if (name == error_mark_node)
1331 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1332 type = IDENTIFIER_TYPE_VALUE (name);
1336 error ("`%T' fails to be an aggregate typedef", name);
1340 if (! IS_AGGR_TYPE (type)
1341 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1342 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1345 error ("type `%T' is of non-aggregate type", type);
1352 get_type_value (name)
1355 if (name == error_mark_node)
1358 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1359 return IDENTIFIER_TYPE_VALUE (name);
1365 /* This code could just as well go in `class.c', but is placed here for
1368 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1369 the appropriate function call. */
1372 build_member_call (type, name, parmlist)
1373 tree type, name, parmlist;
1379 tree basetype_path, decl;
1381 if (TREE_CODE (name) == TEMPLATE_ID_EXPR
1382 && TREE_CODE (type) == NAMESPACE_DECL)
1384 /* 'name' already refers to the decls from the namespace, since we
1385 hit do_identifier for template_ids. */
1386 method_name = TREE_OPERAND (name, 0);
1387 /* FIXME: Since we don't do independent names right yet, the
1388 name might also be a LOOKUP_EXPR. Once we resolve this to a
1389 real decl earlier, this can go. This may happen during
1391 if (TREE_CODE (method_name) == LOOKUP_EXPR)
1393 method_name = lookup_namespace_name
1394 (type, TREE_OPERAND (method_name, 0));
1395 TREE_OPERAND (name, 0) = method_name;
1397 my_friendly_assert (is_overloaded_fn (method_name), 980519);
1398 return finish_call_expr (name, parmlist, /*disallow_virtual=*/true);
1402 name = DECL_NAME (name);
1404 if (TREE_CODE (type) == NAMESPACE_DECL)
1405 return finish_call_expr (lookup_namespace_name (type, name),
1407 /*disallow_virtual=*/true);
1409 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1411 method_name = TREE_OPERAND (name, 0);
1412 if (TREE_CODE (method_name) == COMPONENT_REF)
1413 method_name = TREE_OPERAND (method_name, 1);
1414 if (is_overloaded_fn (method_name))
1415 method_name = DECL_NAME (OVL_CURRENT (method_name));
1416 TREE_OPERAND (name, 0) = method_name;
1421 if (TREE_CODE (method_name) == BIT_NOT_EXPR)
1423 method_name = TREE_OPERAND (method_name, 0);
1427 /* This shouldn't be here, and build_member_call shouldn't appear in
1429 if (type && TREE_CODE (type) == IDENTIFIER_NODE
1430 && get_aggr_from_typedef (type, 0) == 0)
1432 tree ns = lookup_name (type, 0);
1433 if (ns && TREE_CODE (ns) == NAMESPACE_DECL)
1434 return finish_call_expr (lookup_namespace_name (ns, name),
1436 /*disallow_virtual=*/true);
1439 if (type == NULL_TREE || ! is_aggr_type (type, 1))
1440 return error_mark_node;
1442 /* An operator we did not like. */
1443 if (name == NULL_TREE)
1444 return error_mark_node;
1448 error ("cannot call destructor `%T::~%T' without object", type,
1450 return error_mark_node;
1453 decl = maybe_dummy_object (type, &basetype_path);
1455 fns = lookup_fnfields (basetype_path, method_name, 0);
1458 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1459 BASELINK_FUNCTIONS (fns) = build_nt (TEMPLATE_ID_EXPR,
1460 BASELINK_FUNCTIONS (fns),
1461 TREE_OPERAND (name, 1));
1462 return build_new_method_call (decl, fns, parmlist,
1463 /*conversion_path=*/NULL_TREE,
1464 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL);
1467 /* Convert 'this' to the specified type to disambiguate conversion
1468 to the function's context. */
1469 if (decl == current_class_ref
1470 /* ??? this is wrong, but if this conversion is invalid we need to
1471 defer it until we know whether we are calling a static or
1472 non-static member function. Be conservative for now. */
1473 && ACCESSIBLY_UNIQUELY_DERIVED_P (type, current_class_type))
1475 basetype_path = NULL_TREE;
1476 decl = build_scoped_ref (decl, type, &basetype_path);
1477 if (decl == error_mark_node)
1478 return error_mark_node;
1481 if (constructor_name_p (method_name, type))
1482 return build_functional_cast (type, parmlist);
1483 if (TREE_CODE (name) == IDENTIFIER_NODE
1484 && ((t = lookup_field (TYPE_BINFO (type), name, 1, false))))
1486 if (t == error_mark_node)
1487 return error_mark_node;
1488 if (TREE_CODE (t) == FIELD_DECL)
1490 if (is_dummy_object (decl))
1492 error ("invalid use of non-static field `%D'", t);
1493 return error_mark_node;
1495 decl = build (COMPONENT_REF, TREE_TYPE (t), decl, t);
1497 else if (TREE_CODE (t) == VAR_DECL)
1501 error ("invalid use of member `%D'", t);
1502 return error_mark_node;
1504 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl)))
1505 return build_new_op (CALL_EXPR, LOOKUP_NORMAL, decl,
1506 parmlist, NULL_TREE);
1507 return build_function_call (decl, parmlist);
1511 error ("no method `%T::%D'", type, name);
1512 return error_mark_node;
1516 /* Build a reference to a member of an aggregate. This is not a
1517 C++ `&', but really something which can have its address taken,
1518 and then act as a pointer to member, for example TYPE :: FIELD
1519 can have its address taken by saying & TYPE :: FIELD.
1521 @@ Prints out lousy diagnostics for operator <typename>
1524 @@ This function should be rewritten and placed in search.c. */
1527 build_offset_ref (type, name)
1530 tree decl, t = error_mark_node;
1532 tree basebinfo = NULL_TREE;
1533 tree orig_name = name;
1535 /* class templates can come in as TEMPLATE_DECLs here. */
1536 if (TREE_CODE (name) == TEMPLATE_DECL)
1539 if (processing_template_decl || uses_template_parms (type))
1540 return build_min_nt (SCOPE_REF, type, name);
1542 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1544 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1545 something like `a.template f<int>' or the like. For the most
1546 part, we treat this just like a.f. We do remember, however,
1547 the template-id that was used. */
1548 name = TREE_OPERAND (orig_name, 0);
1551 name = DECL_NAME (name);
1554 if (TREE_CODE (name) == LOOKUP_EXPR)
1555 /* This can happen during tsubst'ing. */
1556 name = TREE_OPERAND (name, 0);
1559 if (TREE_CODE (name) == COMPONENT_REF)
1560 name = TREE_OPERAND (name, 1);
1561 if (TREE_CODE (name) == OVERLOAD)
1562 name = DECL_NAME (OVL_CURRENT (name));
1566 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1569 if (type == NULL_TREE)
1570 return error_mark_node;
1572 /* Handle namespace names fully here. */
1573 if (TREE_CODE (type) == NAMESPACE_DECL)
1575 t = lookup_namespace_name (type, name);
1576 if (t == error_mark_node)
1578 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1579 /* Reconstruct the TEMPLATE_ID_EXPR. */
1580 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1581 t, TREE_OPERAND (orig_name, 1));
1582 if (! type_unknown_p (t))
1585 t = convert_from_reference (t);
1590 if (! is_aggr_type (type, 1))
1591 return error_mark_node;
1593 if (TREE_CODE (name) == BIT_NOT_EXPR)
1595 if (! check_dtor_name (type, name))
1596 error ("qualified type `%T' does not match destructor name `~%T'",
1597 type, TREE_OPERAND (name, 0));
1598 name = dtor_identifier;
1601 if (!COMPLETE_TYPE_P (complete_type (type))
1602 && !TYPE_BEING_DEFINED (type))
1604 error ("incomplete type `%T' does not have member `%D'", type,
1606 return error_mark_node;
1609 decl = maybe_dummy_object (type, &basebinfo);
1611 if (BASELINK_P (name) || DECL_P (name))
1615 member = lookup_member (basebinfo, name, 1, 0);
1617 if (member == error_mark_node)
1618 return error_mark_node;
1621 /* A lot of this logic is now handled in lookup_member. */
1622 if (member && BASELINK_P (member))
1624 /* Go from the TREE_BASELINK to the member function info. */
1625 tree fnfields = member;
1626 t = BASELINK_FUNCTIONS (fnfields);
1628 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1630 /* The FNFIELDS are going to contain functions that aren't
1631 necessarily templates, and templates that don't
1632 necessarily match the explicit template parameters. We
1633 save all the functions, and the explicit parameters, and
1634 then figure out exactly what to instantiate with what
1635 arguments in instantiate_type. */
1637 if (TREE_CODE (t) != OVERLOAD)
1638 /* The code in instantiate_type which will process this
1639 expects to encounter OVERLOADs, not raw functions. */
1640 t = ovl_cons (t, NULL_TREE);
1642 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1643 TREE_OPERAND (orig_name, 1));
1644 t = build (OFFSET_REF, unknown_type_node, decl, t);
1646 PTRMEM_OK_P (t) = 1;
1651 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1653 /* Get rid of a potential OVERLOAD around it */
1654 t = OVL_CURRENT (t);
1656 /* unique functions are handled easily. */
1657 if (!enforce_access (basebinfo, t))
1658 return error_mark_node;
1660 if (DECL_STATIC_FUNCTION_P (t))
1662 t = build (OFFSET_REF, TREE_TYPE (t), decl, t);
1663 PTRMEM_OK_P (t) = 1;
1667 TREE_TYPE (fnfields) = unknown_type_node;
1669 t = build (OFFSET_REF, unknown_type_node, decl, fnfields);
1670 PTRMEM_OK_P (t) = 1;
1678 error ("`%D' is not a member of type `%T'", name, type);
1679 return error_mark_node;
1682 if (TREE_CODE (t) == TYPE_DECL)
1687 /* static class members and class-specific enum
1688 values can be returned without further ado. */
1689 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == CONST_DECL)
1692 return convert_from_reference (t);
1695 if (TREE_CODE (t) == FIELD_DECL && DECL_C_BIT_FIELD (t))
1697 error ("invalid pointer to bit-field `%D'", t);
1698 return error_mark_node;
1701 /* static class functions too. */
1702 if (TREE_CODE (t) == FUNCTION_DECL
1703 && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
1706 /* In member functions, the form `type::name' is no longer
1707 equivalent to `this->type::name', at least not until
1708 resolve_offset_ref. */
1709 t = build (OFFSET_REF, build_offset_type (type, TREE_TYPE (t)), decl, t);
1710 PTRMEM_OK_P (t) = 1;
1714 /* If a OFFSET_REF made it through to here, then it did
1715 not have its address taken. */
1718 resolve_offset_ref (exp)
1721 tree type = TREE_TYPE (exp);
1722 tree base = NULL_TREE;
1724 tree basetype, addr;
1726 if (TREE_CODE (exp) == OFFSET_REF)
1728 member = TREE_OPERAND (exp, 1);
1729 base = TREE_OPERAND (exp, 0);
1733 my_friendly_assert (TREE_CODE (type) == OFFSET_TYPE, 214);
1734 if (TYPE_OFFSET_BASETYPE (type) != current_class_type)
1736 error ("object missing in use of pointer-to-member construct");
1737 return error_mark_node;
1740 type = TREE_TYPE (type);
1741 base = current_class_ref;
1744 if (BASELINK_P (member) || TREE_CODE (member) == TEMPLATE_ID_EXPR)
1745 return build_unary_op (ADDR_EXPR, exp, 0);
1747 if (TREE_CODE (TREE_TYPE (member)) == METHOD_TYPE)
1749 if (!flag_ms_extensions)
1750 /* A single non-static member, make sure we don't allow a
1751 pointer-to-member. */
1752 exp = ovl_cons (member, NULL_TREE);
1754 return build_unary_op (ADDR_EXPR, exp, 0);
1757 if ((TREE_CODE (member) == VAR_DECL
1758 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member))
1759 && ! TYPE_PTRMEM_P (TREE_TYPE (member)))
1760 || TREE_CODE (TREE_TYPE (member)) == FUNCTION_TYPE)
1762 /* These were static members. */
1763 if (!cxx_mark_addressable (member))
1764 return error_mark_node;
1768 if (TREE_CODE (TREE_TYPE (member)) == POINTER_TYPE
1769 && TREE_CODE (TREE_TYPE (TREE_TYPE (member))) == METHOD_TYPE)
1772 /* Syntax error can cause a member which should
1773 have been seen as static to be grok'd as non-static. */
1774 if (TREE_CODE (member) == FIELD_DECL && current_class_ref == NULL_TREE)
1776 cp_error_at ("member `%D' is non-static but referenced as a static member",
1778 error ("at this point in file");
1779 return error_mark_node;
1782 /* The first case is really just a reference to a member of `this'. */
1783 if (TREE_CODE (member) == FIELD_DECL
1784 && (base == current_class_ref || is_dummy_object (base)))
1786 tree binfo = NULL_TREE;
1788 /* Try to get to basetype from 'this'; if that doesn't work,
1790 base = current_class_ref;
1792 /* First convert to the intermediate base specified, if appropriate. */
1793 if (TREE_CODE (exp) == OFFSET_REF && TREE_CODE (type) == OFFSET_TYPE)
1794 base = build_scoped_ref (base, TYPE_OFFSET_BASETYPE (type), &binfo);
1796 return build_class_member_access_expr (base, member,
1797 /*access_path=*/NULL_TREE,
1798 /*preserve_reference=*/false);
1801 /* Ensure that we have an object. */
1802 if (is_dummy_object (base))
1803 addr = error_mark_node;
1805 /* If this is a reference to a member function, then return the
1806 address of the member function (which may involve going
1807 through the object's vtable), otherwise, return an expression
1808 for the dereferenced pointer-to-member construct. */
1809 addr = build_unary_op (ADDR_EXPR, base, 0);
1811 if (TYPE_PTRMEM_P (TREE_TYPE (member)))
1813 if (addr == error_mark_node)
1815 error ("object missing in `%E'", exp);
1816 return error_mark_node;
1819 basetype = TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member)));
1820 basetype = lookup_base (TREE_TYPE (TREE_TYPE (addr)),
1821 basetype, ba_check, NULL);
1822 addr = build_base_path (PLUS_EXPR, addr, basetype, 1);
1824 member = cp_convert (ptrdiff_type_node, member);
1826 addr = build (PLUS_EXPR, build_pointer_type (type), addr, member);
1827 return build_indirect_ref (addr, 0);
1829 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
1831 return get_member_function_from_ptrfunc (&addr, member);
1838 /* If DECL is a `const' declaration, and its value is a known
1839 constant, then return that value. */
1842 decl_constant_value (decl)
1845 if (TREE_READONLY_DECL_P (decl)
1846 && ! TREE_THIS_VOLATILE (decl)
1847 && DECL_INITIAL (decl)
1848 && DECL_INITIAL (decl) != error_mark_node
1849 /* This is invalid if initial value is not constant.
1850 If it has either a function call, a memory reference,
1851 or a variable, then re-evaluating it could give different results. */
1852 && TREE_CONSTANT (DECL_INITIAL (decl))
1853 /* Check for cases where this is sub-optimal, even though valid. */
1854 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1855 return DECL_INITIAL (decl);
1859 /* Common subroutines of build_new and build_vec_delete. */
1861 /* Call the global __builtin_delete to delete ADDR. */
1864 build_builtin_delete_call (addr)
1867 mark_used (global_delete_fndecl);
1868 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1871 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1872 (which needs to go through some sort of groktypename) or it
1873 is the name of the class we are newing. INIT is an initialization value.
1874 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1875 If INIT is void_type_node, it means do *not* call a constructor
1878 For types with constructors, the data returned is initialized
1879 by the appropriate constructor.
1881 Whether the type has a constructor or not, if it has a pointer
1882 to a virtual function table, then that pointer is set up
1885 Unless I am mistaken, a call to new () will return initialized
1886 data regardless of whether the constructor itself is private or
1887 not. NOPE; new fails if the constructor is private (jcm).
1889 Note that build_new does nothing to assure that any special
1890 alignment requirements of the type are met. Rather, it leaves
1891 it up to malloc to do the right thing. Otherwise, folding to
1892 the right alignment cal cause problems if the user tries to later
1893 free the memory returned by `new'.
1895 PLACEMENT is the `placement' list for user-defined operator new (). */
1898 build_new (placement, decl, init, use_global_new)
1904 tree nelts = NULL_TREE, t;
1907 if (decl == error_mark_node)
1908 return error_mark_node;
1910 if (TREE_CODE (decl) == TREE_LIST)
1912 tree absdcl = TREE_VALUE (decl);
1913 tree last_absdcl = NULL_TREE;
1915 if (current_function_decl
1916 && DECL_CONSTRUCTOR_P (current_function_decl))
1917 my_friendly_assert (immediate_size_expand == 0, 19990926);
1919 nelts = integer_one_node;
1921 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1923 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1925 last_absdcl = absdcl;
1926 absdcl = TREE_OPERAND (absdcl, 0);
1929 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1931 /* probably meant to be a vec new */
1934 while (TREE_OPERAND (absdcl, 0)
1935 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1937 last_absdcl = absdcl;
1938 absdcl = TREE_OPERAND (absdcl, 0);
1942 this_nelts = TREE_OPERAND (absdcl, 1);
1943 if (this_nelts != error_mark_node)
1945 if (this_nelts == NULL_TREE)
1946 error ("new of array type fails to specify size");
1947 else if (processing_template_decl)
1950 absdcl = TREE_OPERAND (absdcl, 0);
1954 if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1957 pedwarn ("size in array new must have integral type");
1959 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1960 absdcl = TREE_OPERAND (absdcl, 0);
1961 if (this_nelts == integer_zero_node)
1963 warning ("zero size array reserves no space");
1964 nelts = integer_zero_node;
1967 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1971 nelts = integer_zero_node;
1975 TREE_OPERAND (last_absdcl, 0) = absdcl;
1977 TREE_VALUE (decl) = absdcl;
1979 type = groktypename (decl);
1980 if (! type || type == error_mark_node)
1981 return error_mark_node;
1983 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1985 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1987 /* An aggregate type. */
1988 type = IDENTIFIER_TYPE_VALUE (decl);
1989 decl = TYPE_MAIN_DECL (type);
1993 /* A builtin type. */
1994 decl = lookup_name (decl, 1);
1995 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1996 type = TREE_TYPE (decl);
1999 else if (TREE_CODE (decl) == TYPE_DECL)
2001 type = TREE_TYPE (decl);
2006 decl = TYPE_MAIN_DECL (type);
2009 if (processing_template_decl)
2012 t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
2013 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
2018 rval = build_min (NEW_EXPR, build_pointer_type (type),
2019 placement, t, init);
2020 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2024 /* ``A reference cannot be created by the new operator. A reference
2025 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2026 returned by new.'' ARM 5.3.3 */
2027 if (TREE_CODE (type) == REFERENCE_TYPE)
2029 error ("new cannot be applied to a reference type");
2030 type = TREE_TYPE (type);
2033 if (TREE_CODE (type) == FUNCTION_TYPE)
2035 error ("new cannot be applied to a function type");
2036 return error_mark_node;
2039 /* When the object being created is an array, the new-expression yields a
2040 pointer to the initial element (if any) of the array. For example,
2041 both new int and new int[10] return an int*. 5.3.4. */
2042 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
2044 nelts = array_type_nelts_top (type);
2046 type = TREE_TYPE (type);
2050 t = build_nt (ARRAY_REF, type, nelts);
2054 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
2055 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2056 TREE_SIDE_EFFECTS (rval) = 1;
2057 rval = build_new_1 (rval);
2058 if (rval == error_mark_node)
2059 return error_mark_node;
2061 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2062 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2063 TREE_NO_UNUSED_WARNING (rval) = 1;
2068 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2071 build_java_class_ref (type)
2074 tree name = NULL_TREE, class_decl;
2075 static tree CL_suffix = NULL_TREE;
2076 if (CL_suffix == NULL_TREE)
2077 CL_suffix = get_identifier("class$");
2078 if (jclass_node == NULL_TREE)
2080 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2081 if (jclass_node == NULL_TREE)
2082 fatal_error ("call to Java constructor, while `jclass' undefined");
2084 jclass_node = TREE_TYPE (jclass_node);
2087 /* Mangle the class$ field */
2090 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2091 if (DECL_NAME (field) == CL_suffix)
2093 mangle_decl (field);
2094 name = DECL_ASSEMBLER_NAME (field);
2098 internal_error ("can't find class$");
2101 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2102 if (class_decl == NULL_TREE)
2104 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2105 TREE_STATIC (class_decl) = 1;
2106 DECL_EXTERNAL (class_decl) = 1;
2107 TREE_PUBLIC (class_decl) = 1;
2108 DECL_ARTIFICIAL (class_decl) = 1;
2109 DECL_IGNORED_P (class_decl) = 1;
2110 pushdecl_top_level (class_decl);
2111 make_decl_rtl (class_decl, NULL);
2116 /* Returns the size of the cookie to use when allocating an array
2117 whose elements have the indicated TYPE. Assumes that it is already
2118 known that a cookie is needed. */
2121 get_cookie_size (type)
2126 /* We need to allocate an additional max (sizeof (size_t), alignof
2127 (true_type)) bytes. */
2131 sizetype_size = size_in_bytes (sizetype);
2132 type_align = size_int (TYPE_ALIGN_UNIT (type));
2133 if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
2134 cookie_size = sizetype_size;
2136 cookie_size = type_align;
2141 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2142 value is immediately handed to expand_expr. */
2148 tree placement, init;
2149 tree type, true_type, size, rval, t;
2151 tree outer_nelts = NULL_TREE;
2152 tree nelts = NULL_TREE;
2153 tree alloc_call, alloc_expr, alloc_node;
2155 tree cookie_expr, init_expr;
2157 enum tree_code code;
2158 int use_cookie, nothrow, check_new;
2159 /* Nonzero if the user wrote `::new' rather than just `new'. */
2160 int globally_qualified_p;
2161 /* Nonzero if we're going to call a global operator new, rather than
2162 a class-specific version. */
2164 int use_java_new = 0;
2165 /* If non-NULL, the number of extra bytes to allocate at the
2166 beginning of the storage allocated for an array-new expression in
2167 order to store the number of elements. */
2168 tree cookie_size = NULL_TREE;
2169 /* True if the function we are calling is a placement allocation
2171 bool placement_allocation_fn_p;
2173 placement = TREE_OPERAND (exp, 0);
2174 type = TREE_OPERAND (exp, 1);
2175 init = TREE_OPERAND (exp, 2);
2176 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
2178 if (TREE_CODE (type) == ARRAY_REF)
2181 nelts = outer_nelts = TREE_OPERAND (type, 1);
2182 type = TREE_OPERAND (type, 0);
2184 /* Use an incomplete array type to avoid VLA headaches. */
2185 full_type = build_cplus_array_type (type, NULL_TREE);
2192 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
2194 /* If our base type is an array, then make sure we know how many elements
2196 while (TREE_CODE (true_type) == ARRAY_TYPE)
2198 tree this_nelts = array_type_nelts_top (true_type);
2199 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
2200 true_type = TREE_TYPE (true_type);
2203 if (!complete_type_or_else (true_type, exp))
2204 return error_mark_node;
2206 size = size_in_bytes (true_type);
2208 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2210 if (TREE_CODE (true_type) == VOID_TYPE)
2212 error ("invalid type `void' for new");
2213 return error_mark_node;
2216 if (abstract_virtuals_error (NULL_TREE, true_type))
2217 return error_mark_node;
2219 /* Figure out whether or not we're going to use the global operator
2221 if (!globally_qualified_p
2222 && IS_AGGR_TYPE (true_type)
2224 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2225 : TYPE_HAS_NEW_OPERATOR (true_type)))
2230 /* We only need cookies for arrays containing types for which we
2232 if (!has_array || !TYPE_VEC_NEW_USES_COOKIE (true_type))
2234 /* When using placement new, users may not realize that they need
2235 the extra storage. We require that the operator called be
2236 the global placement operator new[]. */
2237 else if (placement && !TREE_CHAIN (placement)
2238 && same_type_p (TREE_TYPE (TREE_VALUE (placement)),
2240 use_cookie = !use_global_new;
2241 /* Otherwise, we need the cookie. */
2245 /* Compute the number of extra bytes to allocate, now that we know
2246 whether or not we need the cookie. */
2249 cookie_size = get_cookie_size (true_type);
2250 size = size_binop (PLUS_EXPR, size, cookie_size);
2253 /* Allocate the object. */
2255 if (! placement && TYPE_FOR_JAVA (true_type))
2257 tree class_addr, alloc_decl;
2258 tree class_decl = build_java_class_ref (true_type);
2259 tree class_size = size_in_bytes (true_type);
2260 static const char alloc_name[] = "_Jv_AllocObject";
2262 alloc_decl = IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name));
2263 if (alloc_decl == NULL_TREE)
2264 fatal_error ("call to Java constructor with `%s' undefined",
2267 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2268 alloc_call = (build_function_call
2270 tree_cons (NULL_TREE, class_addr,
2271 build_tree_list (NULL_TREE, class_size))));
2278 args = tree_cons (NULL_TREE, size, placement);
2279 fnname = ansi_opname (code);
2282 alloc_call = (build_new_function_call
2283 (lookup_function_nonclass (fnname, args),
2286 alloc_call = build_method_call (build_dummy_object (true_type),
2288 TYPE_BINFO (true_type),
2292 if (alloc_call == error_mark_node)
2293 return error_mark_node;
2295 /* The ALLOC_CALL should be a CALL_EXPR -- or a COMPOUND_EXPR whose
2296 right-hand-side is ultimately a CALL_EXPR -- and the first
2297 operand should be the address of a known FUNCTION_DECL. */
2299 while (TREE_CODE (t) == COMPOUND_EXPR)
2300 t = TREE_OPERAND (t, 1);
2301 alloc_fn = get_callee_fndecl (t);
2302 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2303 /* Now, check to see if this function is actually a placement
2304 allocation function. This can happen even when PLACEMENT is NULL
2305 because we might have something like:
2307 struct S { void* operator new (size_t, int i = 0); };
2309 A call to `new S' will get this allocation function, even though
2310 there is no explicit placement argument. If there is more than
2311 one argument, or there are variable arguments, then this is a
2312 placement allocation function. */
2313 placement_allocation_fn_p
2314 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2315 || varargs_function_p (alloc_fn));
2317 /* unless an allocation function is declared with an empty excep-
2318 tion-specification (_except.spec_), throw(), it indicates failure to
2319 allocate storage by throwing a bad_alloc exception (clause _except_,
2320 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2321 cation function is declared with an empty exception-specification,
2322 throw(), it returns null to indicate failure to allocate storage and a
2323 non-null pointer otherwise.
2325 So check for a null exception spec on the op new we just called. */
2327 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2328 check_new = (flag_check_new || nothrow) && ! use_java_new;
2330 alloc_expr = alloc_call;
2333 /* Adjust so we're pointing to the start of the object. */
2334 alloc_expr = build (PLUS_EXPR, TREE_TYPE (alloc_expr),
2335 alloc_expr, cookie_size);
2337 /* While we're working, use a pointer to the type we've actually
2339 alloc_expr = convert (build_pointer_type (full_type), alloc_expr);
2341 /* Now save the allocation expression so we only evaluate it once. */
2342 alloc_expr = get_target_expr (alloc_expr);
2343 alloc_node = TREE_OPERAND (alloc_expr, 0);
2345 /* Now initialize the cookie. */
2350 /* Store the number of bytes allocated so that we can know how
2351 many elements to destroy later. We use the last sizeof
2352 (size_t) bytes to store the number of elements. */
2353 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2354 alloc_node, size_in_bytes (sizetype));
2355 cookie = build_indirect_ref (cookie, NULL);
2357 cookie_expr = build (MODIFY_EXPR, void_type_node, cookie, nelts);
2358 TREE_SIDE_EFFECTS (cookie_expr) = 1;
2361 cookie_expr = NULL_TREE;
2363 /* Now initialize the allocated object. */
2364 init_expr = NULL_TREE;
2365 if (TYPE_NEEDS_CONSTRUCTING (type) || init)
2367 init_expr = build_indirect_ref (alloc_node, NULL);
2369 if (init == void_zero_node)
2370 init = build_default_init (full_type);
2371 else if (init && pedantic && has_array)
2372 pedwarn ("ISO C++ forbids initialization in array new");
2376 = build_vec_init (init_expr,
2377 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2379 init, /*from_array=*/0);
2380 else if (TYPE_NEEDS_CONSTRUCTING (type))
2381 init_expr = build_special_member_call (init_expr,
2382 complete_ctor_identifier,
2383 init, TYPE_BINFO (true_type),
2387 /* We are processing something like `new int (10)', which
2388 means allocate an int, and initialize it with 10. */
2390 if (TREE_CODE (init) == TREE_LIST)
2392 if (TREE_CHAIN (init) != NULL_TREE)
2394 ("initializer list being treated as compound expression");
2395 init = build_compound_expr (init);
2397 else if (TREE_CODE (init) == CONSTRUCTOR
2398 && TREE_TYPE (init) == NULL_TREE)
2400 pedwarn ("ISO C++ forbids aggregate initializer to new");
2401 init = digest_init (type, init, 0);
2404 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2407 if (init_expr == error_mark_node)
2408 return error_mark_node;
2410 /* If any part of the object initialization terminates by throwing an
2411 exception and a suitable deallocation function can be found, the
2412 deallocation function is called to free the memory in which the
2413 object was being constructed, after which the exception continues
2414 to propagate in the context of the new-expression. If no
2415 unambiguous matching deallocation function can be found,
2416 propagating the exception does not cause the object's memory to be
2418 if (flag_exceptions && ! use_java_new)
2420 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2422 int flags = (LOOKUP_NORMAL
2423 | (globally_qualified_p * LOOKUP_GLOBAL));
2427 /* Subtract the padding back out to get to the pointer returned
2428 from operator new. */
2429 delete_node = fold (build (MINUS_EXPR, TREE_TYPE (alloc_node),
2430 alloc_node, cookie_size));
2432 delete_node = alloc_node;
2434 /* The Standard is unclear here, but the right thing to do
2435 is to use the same method for finding deallocation
2436 functions that we use for finding allocation functions. */
2437 flags |= LOOKUP_SPECULATIVELY;
2439 cleanup = build_op_delete_call (dcode, delete_node, size, flags,
2440 (placement_allocation_fn_p
2441 ? alloc_call : NULL_TREE));
2443 /* Ack! First we allocate the memory. Then we set our sentry
2444 variable to true, and expand a cleanup that deletes the memory
2445 if sentry is true. Then we run the constructor, and finally
2448 It would be nice to be able to handle this without the sentry
2449 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2450 work. We allocate the space first, so if there are any
2451 temporaries with cleanups in the constructor args we need this
2452 EH region to extend until end of full-expression to preserve
2455 If the backend had some mechanism so that we could force the
2456 allocation to be expanded after all the other args to the
2457 constructor, that would fix the nesting problem and we could
2458 do away with this complexity. But that would complicate other
2459 things; in particular, it would make it difficult to bail out
2460 if the allocation function returns null. Er, no, it wouldn't;
2461 we just don't run the constructor. The standard says it's
2462 unspecified whether or not the args are evaluated.
2464 FIXME FIXME FIXME inline invisible refs as refs. That way we
2465 can preevaluate value parameters. */
2469 tree end, sentry, begin;
2471 begin = get_target_expr (boolean_true_node);
2472 CLEANUP_EH_ONLY (begin) = 1;
2474 sentry = TARGET_EXPR_SLOT (begin);
2476 TARGET_EXPR_CLEANUP (begin)
2477 = build (COND_EXPR, void_type_node, sentry,
2478 cleanup, void_zero_node);
2480 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2481 sentry, boolean_false_node);
2484 = build (COMPOUND_EXPR, void_type_node, begin,
2485 build (COMPOUND_EXPR, void_type_node, init_expr,
2490 else if (CP_TYPE_CONST_P (true_type))
2491 error ("uninitialized const in `new' of `%#T'", true_type);
2493 /* Now build up the return value in reverse order. */
2498 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2500 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2502 if (rval == alloc_node)
2503 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2505 rval = TREE_OPERAND (alloc_expr, 1);
2510 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2512 rval = build_conditional_expr (ifexp, rval, alloc_node);
2515 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2518 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2520 rval = convert (build_pointer_type (type), rval);
2526 build_vec_delete_1 (base, maxindex, type, auto_delete_vec, use_global_delete)
2527 tree base, maxindex, type;
2528 special_function_kind auto_delete_vec;
2529 int use_global_delete;
2532 tree ptype = build_pointer_type (type = complete_type (type));
2533 tree size_exp = size_in_bytes (type);
2535 /* Temporary variables used by the loop. */
2536 tree tbase, tbase_init;
2538 /* This is the body of the loop that implements the deletion of a
2539 single element, and moves temp variables to next elements. */
2542 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2545 /* This is the thing that governs what to do after the loop has run. */
2546 tree deallocate_expr = 0;
2548 /* This is the BIND_EXPR which holds the outermost iterator of the
2549 loop. It is convenient to set this variable up and test it before
2550 executing any other code in the loop.
2551 This is also the containing expression returned by this function. */
2552 tree controller = NULL_TREE;
2554 /* We should only have 1-D arrays here. */
2555 if (TREE_CODE (type) == ARRAY_TYPE)
2558 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2560 loop = integer_zero_node;
2564 /* The below is short by the cookie size. */
2565 virtual_size = size_binop (MULT_EXPR, size_exp,
2566 convert (sizetype, maxindex));
2568 tbase = create_temporary_var (ptype);
2569 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2570 fold (build (PLUS_EXPR, ptype,
2573 DECL_REGISTER (tbase) = 1;
2574 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2575 TREE_SIDE_EFFECTS (controller) = 1;
2579 body = tree_cons (NULL_TREE,
2580 build_delete (ptype, tbase, sfk_complete_destructor,
2581 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1),
2584 body = tree_cons (NULL_TREE,
2585 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
2588 body = tree_cons (NULL_TREE,
2589 build (EXIT_EXPR, void_type_node,
2590 build (EQ_EXPR, boolean_type_node, base, tbase)),
2593 loop = build (LOOP_EXPR, void_type_node, build_compound_expr (body));
2595 loop = tree_cons (NULL_TREE, tbase_init,
2596 tree_cons (NULL_TREE, loop, NULL_TREE));
2597 loop = build_compound_expr (loop);
2600 /* If the delete flag is one, or anything else with the low bit set,
2601 delete the storage. */
2602 deallocate_expr = integer_zero_node;
2603 if (auto_delete_vec != sfk_base_destructor)
2607 /* The below is short by the cookie size. */
2608 virtual_size = size_binop (MULT_EXPR, size_exp,
2609 convert (sizetype, maxindex));
2611 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2618 cookie_size = get_cookie_size (type);
2620 = cp_convert (ptype,
2621 cp_build_binary_op (MINUS_EXPR,
2622 cp_convert (string_type_node,
2625 /* True size with header. */
2626 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2629 if (auto_delete_vec == sfk_deleting_destructor)
2630 deallocate_expr = build_x_delete (base_tbd,
2631 2 | use_global_delete,
2635 if (loop && deallocate_expr != integer_zero_node)
2637 body = tree_cons (NULL_TREE, loop,
2638 tree_cons (NULL_TREE, deallocate_expr, NULL_TREE));
2639 body = build_compound_expr (body);
2644 /* Outermost wrapper: If pointer is null, punt. */
2645 body = fold (build (COND_EXPR, void_type_node,
2646 fold (build (NE_EXPR, boolean_type_node, base,
2647 integer_zero_node)),
2648 body, integer_zero_node));
2649 body = build1 (NOP_EXPR, void_type_node, body);
2653 TREE_OPERAND (controller, 1) = body;
2657 if (TREE_CODE (base) == SAVE_EXPR)
2658 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2659 body = build (COMPOUND_EXPR, void_type_node, base, body);
2661 return cp_convert (void_type_node, body);
2664 /* Create an unnamed variable of the indicated TYPE. */
2667 create_temporary_var (type)
2672 decl = build_decl (VAR_DECL, NULL_TREE, type);
2673 TREE_USED (decl) = 1;
2674 DECL_ARTIFICIAL (decl) = 1;
2675 DECL_SOURCE_FILE (decl) = input_filename;
2676 DECL_SOURCE_LINE (decl) = lineno;
2677 DECL_IGNORED_P (decl) = 1;
2678 DECL_CONTEXT (decl) = current_function_decl;
2683 /* Create a new temporary variable of the indicated TYPE, initialized
2686 It is not entered into current_binding_level, because that breaks
2687 things when it comes time to do final cleanups (which take place
2688 "outside" the binding contour of the function). */
2691 get_temp_regvar (type, init)
2696 decl = create_temporary_var (type);
2697 if (building_stmt_tree ())
2698 add_decl_stmt (decl);
2700 SET_DECL_RTL (decl, assign_temp (type, 2, 0, 1));
2701 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2706 /* `build_vec_init' returns tree structure that performs
2707 initialization of a vector of aggregate types.
2709 BASE is a reference to the vector, of ARRAY_TYPE.
2710 MAXINDEX is the maximum index of the array (one less than the
2711 number of elements). It is only used if
2712 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2713 INIT is the (possibly NULL) initializer.
2715 FROM_ARRAY is 0 if we should init everything with INIT
2716 (i.e., every element initialized from INIT).
2717 FROM_ARRAY is 1 if we should index into INIT in parallel
2718 with initialization of DECL.
2719 FROM_ARRAY is 2 if we should index into INIT in parallel,
2720 but use assignment instead of initialization. */
2723 build_vec_init (base, maxindex, init, from_array)
2724 tree base, init, maxindex;
2728 tree base2 = NULL_TREE;
2730 tree itype = NULL_TREE;
2732 /* The type of the array. */
2733 tree atype = TREE_TYPE (base);
2734 /* The type of an element in the array. */
2735 tree type = TREE_TYPE (atype);
2736 /* The type of a pointer to an element in the array. */
2741 tree try_block = NULL_TREE;
2742 tree try_body = NULL_TREE;
2743 int num_initialized_elts = 0;
2745 if (TYPE_DOMAIN (atype))
2746 maxindex = array_type_nelts (atype);
2748 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2749 return error_mark_node;
2753 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2754 : !TYPE_NEEDS_CONSTRUCTING (type))
2755 && ((TREE_CODE (init) == CONSTRUCTOR
2756 /* Don't do this if the CONSTRUCTOR might contain something
2757 that might throw and require us to clean up. */
2758 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2759 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2762 /* Do non-default initialization of POD arrays resulting from
2763 brace-enclosed initializers. In this case, digest_init and
2764 store_constructor will handle the semantics for us. */
2766 stmt_expr = build (INIT_EXPR, atype, base, init);
2770 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2771 ptype = build_pointer_type (type);
2772 size = size_in_bytes (type);
2773 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2774 base = cp_convert (ptype, default_conversion (base));
2776 /* The code we are generating looks like:
2780 ptrdiff_t iterator = maxindex;
2782 for (; iterator != -1; --iterator) {
2783 ... initialize *t1 ...
2787 ... destroy elements that were constructed ...
2791 We can omit the try and catch blocks if we know that the
2792 initialization will never throw an exception, or if the array
2793 elements do not have destructors. We can omit the loop completely if
2794 the elements of the array do not have constructors.
2796 We actually wrap the entire body of the above in a STMT_EXPR, for
2799 When copying from array to another, when the array elements have
2800 only trivial copy constructors, we should use __builtin_memcpy
2801 rather than generating a loop. That way, we could take advantage
2802 of whatever cleverness the back-end has for dealing with copies
2803 of blocks of memory. */
2805 begin_init_stmts (&stmt_expr, &compound_stmt);
2806 destroy_temps = stmts_are_full_exprs_p ();
2807 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2808 rval = get_temp_regvar (ptype, base);
2809 base = get_temp_regvar (ptype, rval);
2810 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2812 /* Protect the entire array initialization so that we can destroy
2813 the partially constructed array if an exception is thrown.
2814 But don't do this if we're assigning. */
2815 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2818 try_block = begin_try_block ();
2819 try_body = begin_compound_stmt (/*has_no_scope=*/1);
2822 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2824 /* Do non-default initialization of non-POD arrays resulting from
2825 brace-enclosed initializers. */
2830 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2832 tree elt = TREE_VALUE (elts);
2833 tree baseref = build1 (INDIRECT_REF, type, base);
2835 num_initialized_elts++;
2837 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2838 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2840 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2843 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2844 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2847 /* Clear out INIT so that we don't get confused below. */
2850 else if (from_array)
2852 /* If initializing one array from another, initialize element by
2853 element. We rely upon the below calls the do argument
2857 base2 = default_conversion (init);
2858 itype = TREE_TYPE (base2);
2859 base2 = get_temp_regvar (itype, base2);
2860 itype = TREE_TYPE (itype);
2862 else if (TYPE_LANG_SPECIFIC (type)
2863 && TYPE_NEEDS_CONSTRUCTING (type)
2864 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2866 error ("initializer ends prematurely");
2867 return error_mark_node;
2871 /* Now, default-initialize any remaining elements. We don't need to
2872 do that if a) the type does not need constructing, or b) we've
2873 already initialized all the elements.
2875 We do need to keep going if we're copying an array. */
2878 || (TYPE_NEEDS_CONSTRUCTING (type)
2879 && ! (host_integerp (maxindex, 0)
2880 && (num_initialized_elts
2881 == tree_low_cst (maxindex, 0) + 1))))
2883 /* If the ITERATOR is equal to -1, then we don't have to loop;
2884 we've already initialized all the elements. */
2889 for_stmt = begin_for_stmt ();
2890 finish_for_init_stmt (for_stmt);
2891 finish_for_cond (build (NE_EXPR, boolean_type_node,
2892 iterator, integer_minus_one_node),
2894 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2897 /* Otherwise, loop through the elements. */
2898 for_body = begin_compound_stmt (/*has_no_scope=*/1);
2900 /* When we're not building a statement-tree, things are a little
2901 complicated. If, when we recursively call build_aggr_init,
2902 an expression containing a TARGET_EXPR is expanded, then it
2903 may get a cleanup. Then, the result of that expression is
2904 passed to finish_expr_stmt, which will call
2905 expand_start_target_temps/expand_end_target_temps. However,
2906 the latter call will not cause the cleanup to run because
2907 that block will still be on the block stack. So, we call
2908 expand_start_target_temps here manually; the corresponding
2909 call to expand_end_target_temps below will cause the cleanup
2911 if (!building_stmt_tree ())
2912 expand_start_target_temps ();
2916 tree to = build1 (INDIRECT_REF, type, base);
2920 from = build1 (INDIRECT_REF, itype, base2);
2924 if (from_array == 2)
2925 elt_init = build_modify_expr (to, NOP_EXPR, from);
2926 else if (TYPE_NEEDS_CONSTRUCTING (type))
2927 elt_init = build_aggr_init (to, from, 0);
2929 elt_init = build_modify_expr (to, NOP_EXPR, from);
2933 else if (TREE_CODE (type) == ARRAY_TYPE)
2937 ("cannot initialize multi-dimensional array with initializer");
2938 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2942 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2945 /* The initialization of each array element is a
2946 full-expression, as per core issue 124. */
2947 if (!building_stmt_tree ())
2949 genrtl_expr_stmt (elt_init);
2950 expand_end_target_temps ();
2954 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2955 finish_expr_stmt (elt_init);
2956 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2959 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2961 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2963 finish_compound_stmt (/*has_no_scope=*/1, for_body);
2964 finish_for_stmt (for_stmt);
2967 /* Make sure to cleanup any partially constructed elements. */
2968 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2972 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2974 /* Flatten multi-dimensional array since build_vec_delete only
2975 expects one-dimensional array. */
2976 if (TREE_CODE (type) == ARRAY_TYPE)
2978 m = cp_build_binary_op (MULT_EXPR, m,
2979 array_type_nelts_total (type));
2980 type = strip_array_types (type);
2983 finish_compound_stmt (/*has_no_scope=*/1, try_body);
2984 finish_cleanup_try_block (try_block);
2985 e = build_vec_delete_1 (rval, m,
2987 sfk_base_destructor,
2988 /*use_global_delete=*/0);
2989 finish_cleanup (e, try_block);
2992 /* The value of the array initialization is the address of the
2993 first element in the array. */
2994 finish_expr_stmt (rval);
2996 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
2997 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
3001 /* Free up storage of type TYPE, at address ADDR.
3003 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
3006 VIRTUAL_SIZE is the amount of storage that was allocated, and is
3007 used as the second argument to operator delete. It can include
3008 things like padding and magic size cookies. It has virtual in it,
3009 because if you have a base pointer and you delete through a virtual
3010 destructor, it should be the size of the dynamic object, not the
3011 static object, see Free Store 12.5 ISO C++.
3013 This does not call any destructors. */
3016 build_x_delete (addr, which_delete, virtual_size)
3021 int use_global_delete = which_delete & 1;
3022 int use_vec_delete = !!(which_delete & 2);
3023 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
3024 int flags = LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL);
3026 return build_op_delete_call (code, addr, virtual_size, flags, NULL_TREE);
3029 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3033 build_dtor_call (exp, dtor_kind, flags)
3035 special_function_kind dtor_kind;
3042 case sfk_complete_destructor:
3043 name = complete_dtor_identifier;
3046 case sfk_base_destructor:
3047 name = base_dtor_identifier;
3050 case sfk_deleting_destructor:
3051 name = deleting_dtor_identifier;
3057 return build_method_call (exp, name, NULL_TREE,
3058 TYPE_BINFO (TREE_TYPE (exp)), flags);
3061 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3062 ADDR is an expression which yields the store to be destroyed.
3063 AUTO_DELETE is the name of the destructor to call, i.e., either
3064 sfk_complete_destructor, sfk_base_destructor, or
3065 sfk_deleting_destructor.
3067 FLAGS is the logical disjunction of zero or more LOOKUP_
3068 flags. See cp-tree.h for more info. */
3071 build_delete (type, addr, auto_delete, flags, use_global_delete)
3073 special_function_kind auto_delete;
3075 int use_global_delete;
3079 if (addr == error_mark_node)
3080 return error_mark_node;
3082 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3083 set to `error_mark_node' before it gets properly cleaned up. */
3084 if (type == error_mark_node)
3085 return error_mark_node;
3087 type = TYPE_MAIN_VARIANT (type);
3089 if (TREE_CODE (type) == POINTER_TYPE)
3091 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3092 if (TREE_CODE (type) == ARRAY_TYPE)
3095 if (VOID_TYPE_P (type)
3096 /* We don't want to warn about delete of void*, only other
3097 incomplete types. Deleting other incomplete types
3098 invokes undefined behavior, but it is not ill-formed, so
3099 compile to something that would even do The Right Thing
3100 (TM) should the type have a trivial dtor and no delete
3102 || !complete_type_or_diagnostic (type, addr, 1)
3103 || !IS_AGGR_TYPE (type))
3105 /* Call the builtin operator delete. */
3106 return build_builtin_delete_call (addr);
3108 if (TREE_SIDE_EFFECTS (addr))
3109 addr = save_expr (addr);
3111 /* throw away const and volatile on target type of addr */
3112 addr = convert_force (build_pointer_type (type), addr, 0);
3114 else if (TREE_CODE (type) == ARRAY_TYPE)
3118 if (TYPE_DOMAIN (type) == NULL_TREE)
3120 error ("unknown array size in delete");
3121 return error_mark_node;
3123 return build_vec_delete (addr, array_type_nelts (type),
3124 auto_delete, use_global_delete);
3128 /* Don't check PROTECT here; leave that decision to the
3129 destructor. If the destructor is accessible, call it,
3130 else report error. */
3131 addr = build_unary_op (ADDR_EXPR, addr, 0);
3132 if (TREE_SIDE_EFFECTS (addr))
3133 addr = save_expr (addr);
3135 addr = convert_force (build_pointer_type (type), addr, 0);
3138 my_friendly_assert (IS_AGGR_TYPE (type), 220);
3140 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3142 if (auto_delete != sfk_deleting_destructor)
3143 return void_zero_node;
3145 return build_op_delete_call
3146 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3147 LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL),
3152 tree do_delete = NULL_TREE;
3155 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
3157 /* For `::delete x', we must not use the deleting destructor
3158 since then we would not be sure to get the global `operator
3160 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3162 /* We will use ADDR multiple times so we must save it. */
3163 addr = save_expr (addr);
3164 /* Delete the object. */
3165 do_delete = build_builtin_delete_call (addr);
3166 /* Otherwise, treat this like a complete object destructor
3168 auto_delete = sfk_complete_destructor;
3170 /* If the destructor is non-virtual, there is no deleting
3171 variant. Instead, we must explicitly call the appropriate
3172 `operator delete' here. */
3173 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3174 && auto_delete == sfk_deleting_destructor)
3176 /* We will use ADDR multiple times so we must save it. */
3177 addr = save_expr (addr);
3178 /* Build the call. */
3179 do_delete = build_op_delete_call (DELETE_EXPR,
3181 cxx_sizeof_nowarn (type),
3184 /* Call the complete object destructor. */
3185 auto_delete = sfk_complete_destructor;
3187 else if (auto_delete == sfk_deleting_destructor
3188 && TYPE_GETS_REG_DELETE (type))
3190 /* Make sure we have access to the member op delete, even though
3191 we'll actually be calling it from the destructor. */
3192 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3193 LOOKUP_NORMAL, NULL_TREE);
3196 expr = build_dtor_call (build_indirect_ref (addr, NULL),
3197 auto_delete, flags);
3199 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3201 if (flags & LOOKUP_DESTRUCTOR)
3202 /* Explicit destructor call; don't check for null pointer. */
3203 ifexp = integer_one_node;
3205 /* Handle deleting a null pointer. */
3206 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
3208 if (ifexp != integer_one_node)
3209 expr = build (COND_EXPR, void_type_node,
3210 ifexp, expr, void_zero_node);
3216 /* At the beginning of a destructor, push cleanups that will call the
3217 destructors for our base classes and members.
3219 Called from begin_destructor_body. */
3222 push_base_cleanups ()
3225 int i, n_baseclasses;
3229 /* Run destructors for all virtual baseclasses. */
3230 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
3233 tree cond = (condition_conversion
3234 (build (BIT_AND_EXPR, integer_type_node,
3235 current_in_charge_parm,
3236 integer_two_node)));
3238 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3239 /* The CLASSTYPE_VBASECLASSES list is in initialization
3240 order, which is also the right order for pushing cleanups. */
3242 vbases = TREE_CHAIN (vbases))
3244 tree vbase = TREE_VALUE (vbases);
3245 tree base_type = BINFO_TYPE (vbase);
3247 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3249 expr = build_special_member_call (current_class_ref,
3250 base_dtor_identifier,
3254 | LOOKUP_NONVIRTUAL));
3255 expr = build (COND_EXPR, void_type_node, cond,
3256 expr, void_zero_node);
3257 finish_decl_cleanup (NULL_TREE, expr);
3262 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3263 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3265 /* Take care of the remaining baseclasses. */
3266 for (i = 0; i < n_baseclasses; i++)
3268 tree base_binfo = TREE_VEC_ELT (binfos, i);
3269 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3270 || TREE_VIA_VIRTUAL (base_binfo))
3273 expr = build_special_member_call (current_class_ref,
3274 base_dtor_identifier,
3275 NULL_TREE, base_binfo,
3276 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3277 finish_decl_cleanup (NULL_TREE, expr);
3280 for (member = TYPE_FIELDS (current_class_type); member;
3281 member = TREE_CHAIN (member))
3283 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3285 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3287 tree this_member = (build_class_member_access_expr
3288 (current_class_ref, member,
3289 /*access_path=*/NULL_TREE,
3290 /*preserve_reference=*/false));
3291 tree this_type = TREE_TYPE (member);
3292 expr = build_delete (this_type, this_member,
3293 sfk_complete_destructor,
3294 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3296 finish_decl_cleanup (NULL_TREE, expr);
3301 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3304 build_vbase_delete (type, decl)
3307 tree vbases = CLASSTYPE_VBASECLASSES (type);
3308 tree result = NULL_TREE;
3309 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3311 my_friendly_assert (addr != error_mark_node, 222);
3316 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))),
3318 result = tree_cons (NULL_TREE,
3319 build_delete (TREE_TYPE (this_addr), this_addr,
3320 sfk_base_destructor,
3321 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0),
3323 vbases = TREE_CHAIN (vbases);
3325 return build_compound_expr (nreverse (result));
3328 /* Build a C++ vector delete expression.
3329 MAXINDEX is the number of elements to be deleted.
3330 ELT_SIZE is the nominal size of each element in the vector.
3331 BASE is the expression that should yield the store to be deleted.
3332 This function expands (or synthesizes) these calls itself.
3333 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3335 This also calls delete for virtual baseclasses of elements of the vector.
3337 Update: MAXINDEX is no longer needed. The size can be extracted from the
3338 start of the vector for pointers, and from the type for arrays. We still
3339 use MAXINDEX for arrays because it happens to already have one of the
3340 values we'd have to extract. (We could use MAXINDEX with pointers to
3341 confirm the size, and trap if the numbers differ; not clear that it'd
3342 be worth bothering.) */
3345 build_vec_delete (base, maxindex, auto_delete_vec, use_global_delete)
3346 tree base, maxindex;
3347 special_function_kind auto_delete_vec;
3348 int use_global_delete;
3352 if (TREE_CODE (base) == OFFSET_REF)
3353 base = resolve_offset_ref (base);
3355 type = TREE_TYPE (base);
3357 base = stabilize_reference (base);
3359 if (TREE_CODE (type) == POINTER_TYPE)
3361 /* Step back one from start of vector, and read dimension. */
3364 if (TREE_SIDE_EFFECTS (base))
3365 base = save_expr (base);
3366 type = strip_array_types (TREE_TYPE (type));
3367 cookie_addr = build (MINUS_EXPR,
3368 build_pointer_type (sizetype),
3370 TYPE_SIZE_UNIT (sizetype));
3371 maxindex = build_indirect_ref (cookie_addr, NULL);
3373 else if (TREE_CODE (type) == ARRAY_TYPE)
3375 /* get the total number of things in the array, maxindex is a bad name */
3376 maxindex = array_type_nelts_total (type);
3377 type = strip_array_types (type);
3378 base = build_unary_op (ADDR_EXPR, base, 1);
3379 if (TREE_SIDE_EFFECTS (base))
3380 base = save_expr (base);
3384 if (base != error_mark_node)
3385 error ("type to vector delete is neither pointer or array type");
3386 return error_mark_node;
3389 return build_vec_delete_1 (base, maxindex, type, auto_delete_vec,