1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* High-level class interface. */
37 static void construct_virtual_base (tree, tree);
38 static void expand_aggr_init_1 PARAMS ((tree, tree, tree, tree, int));
39 static void expand_default_init PARAMS ((tree, tree, tree, tree, int));
40 static tree build_vec_delete_1 PARAMS ((tree, tree, tree, special_function_kind, int));
41 static void perform_member_init (tree, tree);
42 static tree build_builtin_delete_call PARAMS ((tree));
43 static int member_init_ok_or_else PARAMS ((tree, tree, tree));
44 static void expand_virtual_init PARAMS ((tree, tree));
45 static tree sort_mem_initializers (tree, tree);
46 static tree initializing_context PARAMS ((tree));
47 static void expand_cleanup_for_base PARAMS ((tree, tree));
48 static tree get_temp_regvar PARAMS ((tree, tree));
49 static tree dfs_initialize_vtbl_ptrs PARAMS ((tree, void *));
50 static tree build_default_init PARAMS ((tree));
51 static tree build_new_1 PARAMS ((tree));
52 static tree get_cookie_size PARAMS ((tree));
53 static tree build_dtor_call PARAMS ((tree, special_function_kind, int));
54 static tree build_field_list PARAMS ((tree, tree, int *));
55 static tree build_vtbl_address PARAMS ((tree));
57 /* We are about to generate some complex initialization code.
58 Conceptually, it is all a single expression. However, we may want
59 to include conditionals, loops, and other such statement-level
60 constructs. Therefore, we build the initialization code inside a
61 statement-expression. This function starts such an expression.
62 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
63 pass them back to finish_init_stmts when the expression is
67 begin_init_stmts (stmt_expr_p, compound_stmt_p)
69 tree *compound_stmt_p;
71 if (building_stmt_tree ())
72 *stmt_expr_p = begin_stmt_expr ();
74 *stmt_expr_p = begin_global_stmt_expr ();
76 if (building_stmt_tree ())
77 *compound_stmt_p = begin_compound_stmt (/*has_no_scope=*/1);
80 /* Finish out the statement-expression begun by the previous call to
81 begin_init_stmts. Returns the statement-expression itself. */
84 finish_init_stmts (stmt_expr, compound_stmt)
89 if (building_stmt_tree ())
90 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
92 if (building_stmt_tree ())
94 stmt_expr = finish_stmt_expr (stmt_expr);
95 STMT_EXPR_NO_SCOPE (stmt_expr) = true;
98 stmt_expr = finish_global_stmt_expr (stmt_expr);
100 /* To avoid spurious warnings about unused values, we set
103 TREE_USED (stmt_expr) = 1;
110 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
111 which we want to initialize the vtable pointer for, DATA is
112 TREE_LIST whose TREE_VALUE is the this ptr expression. */
115 dfs_initialize_vtbl_ptrs (binfo, data)
119 if ((!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
120 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
122 tree base_ptr = TREE_VALUE ((tree) data);
124 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
126 expand_virtual_init (binfo, base_ptr);
129 SET_BINFO_MARKED (binfo);
134 /* Initialize all the vtable pointers in the object pointed to by
138 initialize_vtbl_ptrs (addr)
144 type = TREE_TYPE (TREE_TYPE (addr));
145 list = build_tree_list (type, addr);
147 /* Walk through the hierarchy, initializing the vptr in each base
148 class. We do these in pre-order because can't find the virtual
149 bases for a class until we've initialized the vtbl for that
151 dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
152 NULL, dfs_unmarked_real_bases_queue_p, list);
153 dfs_walk (TYPE_BINFO (type), dfs_unmark,
154 dfs_marked_real_bases_queue_p, 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, TREE_VALUE (init), 1));
358 finish_expr_stmt (build_aggr_init (decl, init, 0));
362 if (init == NULL_TREE)
366 init = build_default_init (type);
367 if (TREE_CODE (type) == REFERENCE_TYPE)
369 ("default-initialization of `%#D', which has reference type",
372 /* member traversal: note it leaves init NULL */
373 else if (TREE_CODE (type) == REFERENCE_TYPE)
374 pedwarn ("uninitialized reference member `%D'", member);
376 else if (TREE_CODE (init) == TREE_LIST)
378 /* There was an explicit member initialization. Do some
379 work in that case. */
380 if (TREE_CHAIN (init))
382 warning ("initializer list treated as compound expression");
383 init = build_compound_expr (init);
386 init = TREE_VALUE (init);
390 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
393 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
397 expr = build_class_member_access_expr (current_class_ref, member,
398 /*access_path=*/NULL_TREE,
399 /*preserve_reference=*/false);
400 expr = build_delete (type, expr, sfk_complete_destructor,
401 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
403 if (expr != error_mark_node)
404 finish_eh_cleanup (expr);
408 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
409 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
412 build_field_list (t, list, uses_unions_p)
421 /* Note whether or not T is a union. */
422 if (TREE_CODE (t) == UNION_TYPE)
425 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
427 /* Skip CONST_DECLs for enumeration constants and so forth. */
428 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
431 /* Keep track of whether or not any fields are unions. */
432 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
435 /* For an anonymous struct or union, we must recursively
436 consider the fields of the anonymous type. They can be
437 directly initialized from the constructor. */
438 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
440 /* Add this field itself. Synthesized copy constructors
441 initialize the entire aggregate. */
442 list = tree_cons (fields, NULL_TREE, list);
443 /* And now add the fields in the anonymous aggregate. */
444 list = build_field_list (TREE_TYPE (fields), list,
447 /* Add this field. */
448 else if (DECL_NAME (fields))
449 list = tree_cons (fields, NULL_TREE, list);
455 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
456 a FIELD_DECL or BINFO in T that needs initialization. The
457 TREE_VALUE gives the initializer, or list of initializer arguments.
459 Return a TREE_LIST containing all of the initializations required
460 for T, in the order in which they should be performed. The output
461 list has the same format as the input. */
464 sort_mem_initializers (tree t, tree mem_inits)
473 /* Build up a list of initializations. The TREE_PURPOSE of entry
474 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
475 TREE_VALUE will be the constructor arguments, or NULL if no
476 explicit initialization was provided. */
477 sorted_inits = NULL_TREE;
478 /* Process the virtual bases. */
479 for (base = CLASSTYPE_VBASECLASSES (t); base; base = TREE_CHAIN (base))
480 sorted_inits = tree_cons (TREE_VALUE (base), NULL_TREE, sorted_inits);
481 /* Process the direct bases. */
482 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
484 base = BINFO_BASETYPE (TYPE_BINFO (t), i);
485 if (!TREE_VIA_VIRTUAL (base))
486 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
488 /* Process the non-static data members. */
489 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
490 /* Reverse the entire list of initializations, so that they are in
491 the order that they will actually be performed. */
492 sorted_inits = nreverse (sorted_inits);
494 /* If the user presented the initializers in an order different from
495 that in which they will actually occur, we issue a warning. Keep
496 track of the next subobject which can be explicitly initialized
497 without issuing a warning. */
498 next_subobject = sorted_inits;
500 /* Go through the explicit initializers, filling in TREE_PURPOSE in
502 for (init = mem_inits; init; init = TREE_CHAIN (init))
507 subobject = TREE_PURPOSE (init);
509 /* If the explicit initializers are in sorted order, then
510 SUBOBJECT will be NEXT_SUBOBJECT, or something following
512 for (subobject_init = next_subobject;
514 subobject_init = TREE_CHAIN (subobject_init))
515 if (TREE_PURPOSE (subobject_init) == subobject)
518 /* Issue a warning if the explicit initializer order does not
519 match that which will actually occur. */
520 if (warn_reorder && !subobject_init)
522 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
523 cp_warning_at ("`%D' will be initialized after",
524 TREE_PURPOSE (next_subobject));
526 warning ("base `%T' will be initialized after",
527 TREE_PURPOSE (next_subobject));
528 if (TREE_CODE (subobject) == FIELD_DECL)
529 cp_warning_at (" `%#D'", subobject);
531 warning (" base `%T'", subobject);
534 /* Look again, from the beginning of the list. */
537 subobject_init = sorted_inits;
538 while (TREE_PURPOSE (subobject_init) != subobject)
539 subobject_init = TREE_CHAIN (subobject_init);
542 /* It is invalid to initialize the same subobject more than
544 if (TREE_VALUE (subobject_init))
546 if (TREE_CODE (subobject) == FIELD_DECL)
547 error ("multiple initializations given for `%D'", subobject);
549 error ("multiple initializations given for base `%T'",
553 /* Record the initialization. */
554 TREE_VALUE (subobject_init) = TREE_VALUE (init);
555 next_subobject = subobject_init;
560 If a ctor-initializer specifies more than one mem-initializer for
561 multiple members of the same union (including members of
562 anonymous unions), the ctor-initializer is ill-formed. */
565 tree last_field = NULL_TREE;
566 for (init = sorted_inits; init; init = TREE_CHAIN (init))
572 /* Skip uninitialized members and base classes. */
573 if (!TREE_VALUE (init)
574 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
576 /* See if this field is a member of a union, or a member of a
577 structure contained in a union, etc. */
578 field = TREE_PURPOSE (init);
579 for (field_type = DECL_CONTEXT (field);
580 !same_type_p (field_type, t);
581 field_type = TYPE_CONTEXT (field_type))
582 if (TREE_CODE (field_type) == UNION_TYPE)
584 /* If this field is not a member of a union, skip it. */
585 if (TREE_CODE (field_type) != UNION_TYPE)
588 /* It's only an error if we have two initializers for the same
596 /* See if LAST_FIELD and the field initialized by INIT are
597 members of the same union. If so, there's a problem,
598 unless they're actually members of the same structure
599 which is itself a member of a union. For example, given:
601 union { struct { int i; int j; }; };
603 initializing both `i' and `j' makes sense. */
604 field_type = DECL_CONTEXT (field);
608 tree last_field_type;
610 last_field_type = DECL_CONTEXT (last_field);
613 if (same_type_p (last_field_type, field_type))
615 if (TREE_CODE (field_type) == UNION_TYPE)
616 error ("initializations for multiple members of `%T'",
622 if (same_type_p (last_field_type, t))
625 last_field_type = TYPE_CONTEXT (last_field_type);
628 /* If we've reached the outermost class, then we're
630 if (same_type_p (field_type, t))
633 field_type = TYPE_CONTEXT (field_type);
644 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
645 is a TREE_LIST giving the explicit mem-initializer-list for the
646 constructor. The TREE_PURPOSE of each entry is a subobject (a
647 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
648 is a TREE_LIST giving the arguments to the constructor or
649 void_type_node for an empty list of arguments. */
652 emit_mem_initializers (tree mem_inits)
654 /* Sort the mem-initializers into the order in which the
655 initializations should be performed. */
656 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
658 /* Initialize base classes. */
660 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
662 tree subobject = TREE_PURPOSE (mem_inits);
663 tree arguments = TREE_VALUE (mem_inits);
665 /* If these initializations are taking place in a copy
666 constructor, the base class should probably be explicitly
668 if (extra_warnings && !arguments
669 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
670 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
671 warning ("base class `%#T' should be explicitly initialized in the "
673 BINFO_TYPE (subobject));
675 /* If an explicit -- but empty -- initializer list was present,
676 treat it just like default initialization at this point. */
677 if (arguments == void_type_node)
678 arguments = NULL_TREE;
680 /* Initialize the base. */
681 if (TREE_VIA_VIRTUAL (subobject))
682 construct_virtual_base (subobject, arguments);
687 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
689 expand_aggr_init_1 (subobject, NULL_TREE,
690 build_indirect_ref (base_addr, NULL),
693 expand_cleanup_for_base (subobject, NULL_TREE);
696 mem_inits = TREE_CHAIN (mem_inits);
699 /* Initialize the vptrs. */
700 initialize_vtbl_ptrs (current_class_ptr);
702 /* Initialize the data members. */
705 perform_member_init (TREE_PURPOSE (mem_inits),
706 TREE_VALUE (mem_inits));
707 mem_inits = TREE_CHAIN (mem_inits);
711 /* Returns the address of the vtable (i.e., the value that should be
712 assigned to the vptr) for BINFO. */
715 build_vtbl_address (binfo)
718 tree binfo_for = binfo;
721 if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
722 && BINFO_PRIMARY_P (binfo))
723 /* If this is a virtual primary base, then the vtable we want to store
724 is that for the base this is being used as the primary base of. We
725 can't simply skip the initialization, because we may be expanding the
726 inits of a subobject constructor where the virtual base layout
728 while (BINFO_PRIMARY_BASE_OF (binfo_for))
729 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
731 /* Figure out what vtable BINFO's vtable is based on, and mark it as
733 vtbl = get_vtbl_decl_for_binfo (binfo_for);
734 assemble_external (vtbl);
735 TREE_USED (vtbl) = 1;
737 /* Now compute the address to use when initializing the vptr. */
738 vtbl = BINFO_VTABLE (binfo_for);
739 if (TREE_CODE (vtbl) == VAR_DECL)
741 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
742 TREE_CONSTANT (vtbl) = 1;
748 /* This code sets up the virtual function tables appropriate for
749 the pointer DECL. It is a one-ply initialization.
751 BINFO is the exact type that DECL is supposed to be. In
752 multiple inheritance, this might mean "C's A" if C : A, B. */
755 expand_virtual_init (binfo, decl)
761 /* Compute the initializer for vptr. */
762 vtbl = build_vtbl_address (binfo);
764 /* We may get this vptr from a VTT, if this is a subobject
765 constructor or subobject destructor. */
766 vtt_index = BINFO_VPTR_INDEX (binfo);
772 /* Compute the value to use, when there's a VTT. */
773 vtt_parm = current_vtt_parm;
774 vtbl2 = build (PLUS_EXPR,
775 TREE_TYPE (vtt_parm),
778 vtbl2 = build1 (INDIRECT_REF, TREE_TYPE (vtbl), vtbl2);
780 /* The actual initializer is the VTT value only in the subobject
781 constructor. In maybe_clone_body we'll substitute NULL for
782 the vtt_parm in the case of the non-subobject constructor. */
783 vtbl = build (COND_EXPR,
785 build (EQ_EXPR, boolean_type_node,
786 current_in_charge_parm, integer_zero_node),
791 /* Compute the location of the vtpr. */
792 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
794 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
796 /* Assign the vtable to the vptr. */
797 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
798 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
801 /* If an exception is thrown in a constructor, those base classes already
802 constructed must be destroyed. This function creates the cleanup
803 for BINFO, which has just been constructed. If FLAG is non-NULL,
804 it is a DECL which is nonzero when this base needs to be
808 expand_cleanup_for_base (binfo, flag)
814 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
817 /* Call the destructor. */
818 expr = build_special_member_call (current_class_ref,
819 base_dtor_identifier,
822 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
824 expr = fold (build (COND_EXPR, void_type_node,
825 c_common_truthvalue_conversion (flag),
826 expr, integer_zero_node));
828 finish_eh_cleanup (expr);
831 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
835 construct_virtual_base (tree vbase, tree arguments)
842 /* If there are virtual base classes with destructors, we need to
843 emit cleanups to destroy them if an exception is thrown during
844 the construction process. These exception regions (i.e., the
845 period during which the cleanups must occur) begin from the time
846 the construction is complete to the end of the function. If we
847 create a conditional block in which to initialize the
848 base-classes, then the cleanup region for the virtual base begins
849 inside a block, and ends outside of that block. This situation
850 confuses the sjlj exception-handling code. Therefore, we do not
851 create a single conditional block, but one for each
852 initialization. (That way the cleanup regions always begin
853 in the outer block.) We trust the back-end to figure out
854 that the FLAG will not change across initializations, and
855 avoid doing multiple tests. */
856 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
857 inner_if_stmt = begin_if_stmt ();
858 finish_if_stmt_cond (flag, inner_if_stmt);
859 compound_stmt = begin_compound_stmt (/*has_no_scope=*/1);
861 /* Compute the location of the virtual base. If we're
862 constructing virtual bases, then we must be the most derived
863 class. Therefore, we don't have to look up the virtual base;
864 we already know where it is. */
865 exp = build (PLUS_EXPR,
866 TREE_TYPE (current_class_ptr),
868 fold (build1 (NOP_EXPR, TREE_TYPE (current_class_ptr),
869 BINFO_OFFSET (vbase))));
870 exp = build1 (NOP_EXPR,
871 build_pointer_type (BINFO_TYPE (vbase)),
873 exp = build1 (INDIRECT_REF, BINFO_TYPE (vbase), exp);
875 expand_aggr_init_1 (vbase, current_class_ref, exp,
876 arguments, LOOKUP_COMPLAIN);
877 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt);
878 finish_then_clause (inner_if_stmt);
881 expand_cleanup_for_base (vbase, flag);
884 /* Find the context in which this FIELD can be initialized. */
887 initializing_context (field)
890 tree t = DECL_CONTEXT (field);
892 /* Anonymous union members can be initialized in the first enclosing
893 non-anonymous union context. */
894 while (t && ANON_AGGR_TYPE_P (t))
895 t = TYPE_CONTEXT (t);
899 /* Function to give error message if member initialization specification
900 is erroneous. FIELD is the member we decided to initialize.
901 TYPE is the type for which the initialization is being performed.
902 FIELD must be a member of TYPE.
904 MEMBER_NAME is the name of the member. */
907 member_init_ok_or_else (field, type, member_name)
912 if (field == error_mark_node)
914 if (field == NULL_TREE || initializing_context (field) != type)
916 error ("class `%T' does not have any field named `%D'", type,
920 if (TREE_STATIC (field))
922 error ("field `%#D' is static; the only point of initialization is its definition",
930 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
931 is a _TYPE node or TYPE_DECL which names a base for that type.
932 INIT is a parameter list for that field's or base's constructor.
933 Check the validity of NAME, and return a TREE_LIST of the base
934 _TYPE or FIELD_DECL and the INIT. If NAME is invalid, return
935 NULL_TREE and issue a diagnostic.
937 An old style unnamed direct single base construction is permitted,
938 where NAME is NULL. */
941 expand_member_init (tree name, tree init)
946 if (!current_class_ref)
951 /* This is an obsolete unnamed base class initializer. The
952 parser will already have warned about its use. */
953 switch (CLASSTYPE_N_BASECLASSES (current_class_type))
956 error ("unnamed initializer for `%T', which has no base classes",
960 basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
963 error ("unnamed initializer for `%T', which uses multiple inheritance",
968 else if (TYPE_P (name))
971 name = TYPE_NAME (name);
973 else if (TREE_CODE (name) == TYPE_DECL)
974 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
976 basetype = NULL_TREE;
978 my_friendly_assert (init != NULL_TREE, 0);
984 if (current_template_parms)
985 return build_tree_list (basetype, init);
987 binfo = lookup_base (current_class_type, basetype,
991 if (TREE_VIA_VIRTUAL (binfo))
992 binfo = binfo_for_vbase (basetype, current_class_type);
993 else if (BINFO_INHERITANCE_CHAIN (binfo)
994 != TYPE_BINFO (current_class_type))
999 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1000 error ("type `%D' is not a direct or virtual base of `%T'",
1001 name, current_class_type);
1003 error ("type `%D' is not a direct base of `%T'",
1004 name, current_class_type);
1009 return build_tree_list (binfo, init);
1013 if (TREE_CODE (name) == IDENTIFIER_NODE)
1014 field = lookup_field (current_class_type, name, 1, 0);
1018 if (member_init_ok_or_else (field, current_class_type, name))
1019 return build_tree_list (field, init);
1025 /* This is like `expand_member_init', only it stores one aggregate
1028 INIT comes in two flavors: it is either a value which
1029 is to be stored in EXP, or it is a parameter list
1030 to go to a constructor, which will operate on EXP.
1031 If INIT is not a parameter list for a constructor, then set
1032 LOOKUP_ONLYCONVERTING.
1033 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1034 the initializer, if FLAGS is 0, then it is the (init) form.
1035 If `init' is a CONSTRUCTOR, then we emit a warning message,
1036 explaining that such initializations are invalid.
1038 If INIT resolves to a CALL_EXPR which happens to return
1039 something of the type we are looking for, then we know
1040 that we can safely use that call to perform the
1043 The virtual function table pointer cannot be set up here, because
1044 we do not really know its type.
1046 This never calls operator=().
1048 When initializing, nothing is CONST.
1050 A default copy constructor may have to be used to perform the
1053 A constructor or a conversion operator may have to be used to
1054 perform the initialization, but not both, as it would be ambiguous. */
1057 build_aggr_init (exp, init, flags)
1064 tree type = TREE_TYPE (exp);
1065 int was_const = TREE_READONLY (exp);
1066 int was_volatile = TREE_THIS_VOLATILE (exp);
1068 if (init == error_mark_node)
1069 return error_mark_node;
1071 TREE_READONLY (exp) = 0;
1072 TREE_THIS_VOLATILE (exp) = 0;
1074 if (init && TREE_CODE (init) != TREE_LIST)
1075 flags |= LOOKUP_ONLYCONVERTING;
1077 if (TREE_CODE (type) == ARRAY_TYPE)
1079 /* Must arrange to initialize each element of EXP
1080 from elements of INIT. */
1081 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1085 /* Handle bad initializers like:
1089 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1093 int main(int argc, char **argv) {
1094 COMPLEX zees(1.0, 0.0)[10];
1097 error ("bad array initializer");
1098 return error_mark_node;
1100 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1101 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1102 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1103 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1104 stmt_expr = build_vec_init (exp, init,
1105 init && same_type_p (TREE_TYPE (init),
1107 TREE_READONLY (exp) = was_const;
1108 TREE_THIS_VOLATILE (exp) = was_volatile;
1109 TREE_TYPE (exp) = type;
1111 TREE_TYPE (init) = itype;
1115 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1116 /* just know that we've seen something for this node */
1117 TREE_USED (exp) = 1;
1119 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1120 begin_init_stmts (&stmt_expr, &compound_stmt);
1121 destroy_temps = stmts_are_full_exprs_p ();
1122 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1123 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1124 init, LOOKUP_NORMAL|flags);
1125 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
1126 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1127 TREE_TYPE (exp) = type;
1128 TREE_READONLY (exp) = was_const;
1129 TREE_THIS_VOLATILE (exp) = was_volatile;
1134 /* Like build_aggr_init, but not just for aggregates. */
1137 build_init (decl, init, flags)
1143 if (IS_AGGR_TYPE (TREE_TYPE (decl))
1144 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1145 expr = build_aggr_init (decl, init, flags);
1147 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1153 expand_default_init (binfo, true_exp, exp, init, flags)
1159 tree type = TREE_TYPE (exp);
1162 /* It fails because there may not be a constructor which takes
1163 its own type as the first (or only parameter), but which does
1164 take other types via a conversion. So, if the thing initializing
1165 the expression is a unit element of type X, first try X(X&),
1166 followed by initialization by X. If neither of these work
1167 out, then look hard. */
1171 if (init && TREE_CODE (init) != TREE_LIST
1172 && (flags & LOOKUP_ONLYCONVERTING))
1174 /* Base subobjects should only get direct-initialization. */
1175 if (true_exp != exp)
1178 if (flags & DIRECT_BIND)
1179 /* Do nothing. We hit this in two cases: Reference initialization,
1180 where we aren't initializing a real variable, so we don't want
1181 to run a new constructor; and catching an exception, where we
1182 have already built up the constructor call so we could wrap it
1183 in an exception region. */;
1184 else if (TREE_CODE (init) == CONSTRUCTOR)
1186 if (!TYPE_HAS_CONSTRUCTOR (type))
1187 /* A brace-enclosed initializer has whatever type is
1188 required. There's no need to convert it. */
1191 init = ocp_convert (type,
1192 TREE_VALUE (CONSTRUCTOR_ELTS (init)),
1193 CONV_IMPLICIT | CONV_FORCE_TEMP,
1197 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1199 if (TREE_CODE (init) == TRY_CATCH_EXPR)
1200 /* We need to protect the initialization of a catch parm
1201 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1202 around the TARGET_EXPR for the copy constructor. See
1203 expand_start_catch_block. */
1204 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1205 TREE_OPERAND (init, 0));
1207 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1208 TREE_SIDE_EFFECTS (init) = 1;
1209 finish_expr_stmt (init);
1213 if (init == NULL_TREE
1214 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1218 init = TREE_VALUE (parms);
1221 parms = build_tree_list (NULL_TREE, init);
1223 if (true_exp == exp)
1224 ctor_name = complete_ctor_identifier;
1226 ctor_name = base_ctor_identifier;
1228 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1229 if (TREE_SIDE_EFFECTS (rval))
1231 if (building_stmt_tree ())
1232 finish_expr_stmt (rval);
1234 genrtl_expr_stmt (rval);
1238 /* This function is responsible for initializing EXP with INIT
1241 BINFO is the binfo of the type for who we are performing the
1242 initialization. For example, if W is a virtual base class of A and B,
1244 If we are initializing B, then W must contain B's W vtable, whereas
1245 were we initializing C, W must contain C's W vtable.
1247 TRUE_EXP is nonzero if it is the true expression being initialized.
1248 In this case, it may be EXP, or may just contain EXP. The reason we
1249 need this is because if EXP is a base element of TRUE_EXP, we
1250 don't necessarily know by looking at EXP where its virtual
1251 baseclass fields should really be pointing. But we do know
1252 from TRUE_EXP. In constructors, we don't know anything about
1253 the value being initialized.
1255 FLAGS is just passes to `build_method_call'. See that function for
1259 expand_aggr_init_1 (binfo, true_exp, exp, init, flags)
1265 tree type = TREE_TYPE (exp);
1267 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1268 my_friendly_assert (building_stmt_tree (), 20021010);
1270 /* Use a function returning the desired type to initialize EXP for us.
1271 If the function is a constructor, and its first argument is
1272 NULL_TREE, know that it was meant for us--just slide exp on
1273 in and expand the constructor. Constructors now come
1276 if (init && TREE_CODE (exp) == VAR_DECL
1277 && TREE_CODE (init) == CONSTRUCTOR
1278 && TREE_HAS_CONSTRUCTOR (init))
1280 /* If store_init_value returns NULL_TREE, the INIT has been
1281 record in the DECL_INITIAL for EXP. That means there's
1282 nothing more we have to do. */
1283 if (store_init_value (exp, init))
1284 finish_expr_stmt (build (INIT_EXPR, type, exp, init));
1288 /* We know that expand_default_init can handle everything we want
1290 expand_default_init (binfo, true_exp, exp, init, flags);
1293 /* Report an error if TYPE is not a user-defined, aggregate type. If
1294 OR_ELSE is nonzero, give an error message. */
1297 is_aggr_type (type, or_else)
1301 if (type == error_mark_node)
1304 if (! IS_AGGR_TYPE (type)
1305 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1306 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1309 error ("`%T' is not an aggregate type", type);
1315 /* Like is_aggr_typedef, but returns typedef if successful. */
1318 get_aggr_from_typedef (name, or_else)
1324 if (name == error_mark_node)
1327 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1328 type = IDENTIFIER_TYPE_VALUE (name);
1332 error ("`%T' fails to be an aggregate typedef", name);
1336 if (! IS_AGGR_TYPE (type)
1337 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1338 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1341 error ("type `%T' is of non-aggregate type", type);
1348 get_type_value (name)
1351 if (name == error_mark_node)
1354 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1355 return IDENTIFIER_TYPE_VALUE (name);
1361 /* This code could just as well go in `class.c', but is placed here for
1364 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1365 the appropriate function call. */
1368 build_member_call (type, name, parmlist)
1369 tree type, name, parmlist;
1375 tree basetype_path, decl;
1377 if (TREE_CODE (name) == TEMPLATE_ID_EXPR
1378 && TREE_CODE (type) == NAMESPACE_DECL)
1380 /* 'name' already refers to the decls from the namespace, since we
1381 hit do_identifier for template_ids. */
1382 method_name = TREE_OPERAND (name, 0);
1383 /* FIXME: Since we don't do independent names right yet, the
1384 name might also be a LOOKUP_EXPR. Once we resolve this to a
1385 real decl earlier, this can go. This may happen during
1387 if (TREE_CODE (method_name) == LOOKUP_EXPR)
1389 method_name = lookup_namespace_name
1390 (type, TREE_OPERAND (method_name, 0));
1391 TREE_OPERAND (name, 0) = method_name;
1393 my_friendly_assert (is_overloaded_fn (method_name), 980519);
1394 return finish_call_expr (name, parmlist, /*disallow_virtual=*/true);
1398 name = DECL_NAME (name);
1400 if (TREE_CODE (type) == NAMESPACE_DECL)
1401 return finish_call_expr (lookup_namespace_name (type, name),
1403 /*disallow_virtual=*/true);
1405 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1407 method_name = TREE_OPERAND (name, 0);
1408 if (TREE_CODE (method_name) == COMPONENT_REF)
1409 method_name = TREE_OPERAND (method_name, 1);
1410 if (is_overloaded_fn (method_name))
1411 method_name = DECL_NAME (OVL_CURRENT (method_name));
1412 TREE_OPERAND (name, 0) = method_name;
1417 if (TREE_CODE (method_name) == BIT_NOT_EXPR)
1419 method_name = TREE_OPERAND (method_name, 0);
1423 /* This shouldn't be here, and build_member_call shouldn't appear in
1425 if (type && TREE_CODE (type) == IDENTIFIER_NODE
1426 && get_aggr_from_typedef (type, 0) == 0)
1428 tree ns = lookup_name (type, 0);
1429 if (ns && TREE_CODE (ns) == NAMESPACE_DECL)
1430 return finish_call_expr (lookup_namespace_name (ns, name),
1432 /*disallow_virtual=*/true);
1435 if (type == NULL_TREE || ! is_aggr_type (type, 1))
1436 return error_mark_node;
1438 /* An operator we did not like. */
1439 if (name == NULL_TREE)
1440 return error_mark_node;
1444 error ("cannot call destructor `%T::~%T' without object", type,
1446 return error_mark_node;
1449 decl = maybe_dummy_object (type, &basetype_path);
1451 fns = lookup_fnfields (basetype_path, method_name, 0);
1454 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1455 BASELINK_FUNCTIONS (fns) = build_nt (TEMPLATE_ID_EXPR,
1456 BASELINK_FUNCTIONS (fns),
1457 TREE_OPERAND (name, 1));
1458 return build_new_method_call (decl, fns, parmlist,
1459 /*conversion_path=*/NULL_TREE,
1460 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL);
1463 /* Convert 'this' to the specified type to disambiguate conversion
1464 to the function's context. */
1465 if (decl == current_class_ref
1466 /* ??? this is wrong, but if this conversion is invalid we need to
1467 defer it until we know whether we are calling a static or
1468 non-static member function. Be conservative for now. */
1469 && ACCESSIBLY_UNIQUELY_DERIVED_P (type, current_class_type))
1471 basetype_path = NULL_TREE;
1472 decl = build_scoped_ref (decl, type, &basetype_path);
1473 if (decl == error_mark_node)
1474 return error_mark_node;
1477 if (constructor_name_p (method_name, type))
1478 return build_functional_cast (type, parmlist);
1479 if (TREE_CODE (name) == IDENTIFIER_NODE
1480 && ((t = lookup_field (TYPE_BINFO (type), name, 1, 0))))
1482 if (t == error_mark_node)
1483 return error_mark_node;
1484 if (TREE_CODE (t) == FIELD_DECL)
1486 if (is_dummy_object (decl))
1488 error ("invalid use of non-static field `%D'", t);
1489 return error_mark_node;
1491 decl = build (COMPONENT_REF, TREE_TYPE (t), decl, t);
1493 else if (TREE_CODE (t) == VAR_DECL)
1497 error ("invalid use of member `%D'", t);
1498 return error_mark_node;
1500 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl)))
1501 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, decl,
1502 parmlist, NULL_TREE);
1503 return build_function_call (decl, parmlist);
1507 error ("no method `%T::%D'", type, name);
1508 return error_mark_node;
1512 /* Build a reference to a member of an aggregate. This is not a
1513 C++ `&', but really something which can have its address taken,
1514 and then act as a pointer to member, for example TYPE :: FIELD
1515 can have its address taken by saying & TYPE :: FIELD.
1517 @@ Prints out lousy diagnostics for operator <typename>
1520 @@ This function should be rewritten and placed in search.c. */
1523 build_offset_ref (type, name)
1526 tree decl, t = error_mark_node;
1528 tree basebinfo = NULL_TREE;
1529 tree orig_name = name;
1531 /* class templates can come in as TEMPLATE_DECLs here. */
1532 if (TREE_CODE (name) == TEMPLATE_DECL)
1535 if (processing_template_decl || uses_template_parms (type))
1536 return build_min_nt (SCOPE_REF, type, name);
1538 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1540 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1541 something like `a.template f<int>' or the like. For the most
1542 part, we treat this just like a.f. We do remember, however,
1543 the template-id that was used. */
1544 name = TREE_OPERAND (orig_name, 0);
1547 name = DECL_NAME (name);
1550 if (TREE_CODE (name) == LOOKUP_EXPR)
1551 /* This can happen during tsubst'ing. */
1552 name = TREE_OPERAND (name, 0);
1555 if (TREE_CODE (name) == COMPONENT_REF)
1556 name = TREE_OPERAND (name, 1);
1557 if (TREE_CODE (name) == OVERLOAD)
1558 name = DECL_NAME (OVL_CURRENT (name));
1562 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1565 if (type == NULL_TREE)
1566 return error_mark_node;
1568 /* Handle namespace names fully here. */
1569 if (TREE_CODE (type) == NAMESPACE_DECL)
1571 t = lookup_namespace_name (type, name);
1572 if (t == error_mark_node)
1574 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1575 /* Reconstruct the TEMPLATE_ID_EXPR. */
1576 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1577 t, TREE_OPERAND (orig_name, 1));
1578 if (! type_unknown_p (t))
1581 t = convert_from_reference (t);
1586 if (! is_aggr_type (type, 1))
1587 return error_mark_node;
1589 if (TREE_CODE (name) == BIT_NOT_EXPR)
1591 if (! check_dtor_name (type, name))
1592 error ("qualified type `%T' does not match destructor name `~%T'",
1593 type, TREE_OPERAND (name, 0));
1594 name = dtor_identifier;
1597 if (!COMPLETE_TYPE_P (complete_type (type))
1598 && !TYPE_BEING_DEFINED (type))
1600 error ("incomplete type `%T' does not have member `%D'", type,
1602 return error_mark_node;
1605 decl = maybe_dummy_object (type, &basebinfo);
1607 if (BASELINK_P (name))
1611 member = lookup_member (basebinfo, name, 1, 0);
1613 if (member == error_mark_node)
1614 return error_mark_node;
1617 /* A lot of this logic is now handled in lookup_member. */
1618 if (member && BASELINK_P (member))
1620 /* Go from the TREE_BASELINK to the member function info. */
1621 tree fnfields = member;
1622 t = BASELINK_FUNCTIONS (fnfields);
1624 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1626 /* The FNFIELDS are going to contain functions that aren't
1627 necessarily templates, and templates that don't
1628 necessarily match the explicit template parameters. We
1629 save all the functions, and the explicit parameters, and
1630 then figure out exactly what to instantiate with what
1631 arguments in instantiate_type. */
1633 if (TREE_CODE (t) != OVERLOAD)
1634 /* The code in instantiate_type which will process this
1635 expects to encounter OVERLOADs, not raw functions. */
1636 t = ovl_cons (t, NULL_TREE);
1638 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1639 TREE_OPERAND (orig_name, 1));
1640 t = build (OFFSET_REF, unknown_type_node, decl, t);
1642 PTRMEM_OK_P (t) = 1;
1647 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1649 /* Get rid of a potential OVERLOAD around it */
1650 t = OVL_CURRENT (t);
1652 /* unique functions are handled easily. */
1653 if (!enforce_access (basebinfo, t))
1654 return error_mark_node;
1656 if (DECL_STATIC_FUNCTION_P (t))
1658 t = build (OFFSET_REF, TREE_TYPE (t), decl, t);
1659 PTRMEM_OK_P (t) = 1;
1663 TREE_TYPE (fnfields) = unknown_type_node;
1665 t = build (OFFSET_REF, unknown_type_node, decl, fnfields);
1666 PTRMEM_OK_P (t) = 1;
1674 error ("`%D' is not a member of type `%T'", name, type);
1675 return error_mark_node;
1678 if (TREE_CODE (t) == TYPE_DECL)
1683 /* static class members and class-specific enum
1684 values can be returned without further ado. */
1685 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == CONST_DECL)
1688 return convert_from_reference (t);
1691 if (TREE_CODE (t) == FIELD_DECL && DECL_C_BIT_FIELD (t))
1693 error ("invalid pointer to bit-field `%D'", t);
1694 return error_mark_node;
1697 /* static class functions too. */
1698 if (TREE_CODE (t) == FUNCTION_DECL
1699 && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
1702 /* In member functions, the form `type::name' is no longer
1703 equivalent to `this->type::name', at least not until
1704 resolve_offset_ref. */
1705 t = build (OFFSET_REF, build_offset_type (type, TREE_TYPE (t)), decl, t);
1706 PTRMEM_OK_P (t) = 1;
1710 /* If a OFFSET_REF made it through to here, then it did
1711 not have its address taken. */
1714 resolve_offset_ref (exp)
1717 tree type = TREE_TYPE (exp);
1718 tree base = NULL_TREE;
1720 tree basetype, addr;
1722 if (TREE_CODE (exp) == OFFSET_REF)
1724 member = TREE_OPERAND (exp, 1);
1725 base = TREE_OPERAND (exp, 0);
1729 my_friendly_assert (TREE_CODE (type) == OFFSET_TYPE, 214);
1730 if (TYPE_OFFSET_BASETYPE (type) != current_class_type)
1732 error ("object missing in use of pointer-to-member construct");
1733 return error_mark_node;
1736 type = TREE_TYPE (type);
1737 base = current_class_ref;
1740 if (BASELINK_P (member) || TREE_CODE (member) == TEMPLATE_ID_EXPR)
1741 return build_unary_op (ADDR_EXPR, exp, 0);
1743 if (TREE_CODE (TREE_TYPE (member)) == METHOD_TYPE)
1745 if (!flag_ms_extensions)
1746 /* A single non-static member, make sure we don't allow a
1747 pointer-to-member. */
1748 exp = ovl_cons (member, NULL_TREE);
1750 return build_unary_op (ADDR_EXPR, exp, 0);
1753 if ((TREE_CODE (member) == VAR_DECL
1754 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member))
1755 && ! TYPE_PTRMEM_P (TREE_TYPE (member)))
1756 || TREE_CODE (TREE_TYPE (member)) == FUNCTION_TYPE)
1758 /* These were static members. */
1759 if (!cxx_mark_addressable (member))
1760 return error_mark_node;
1764 if (TREE_CODE (TREE_TYPE (member)) == POINTER_TYPE
1765 && TREE_CODE (TREE_TYPE (TREE_TYPE (member))) == METHOD_TYPE)
1768 /* Syntax error can cause a member which should
1769 have been seen as static to be grok'd as non-static. */
1770 if (TREE_CODE (member) == FIELD_DECL && current_class_ref == NULL_TREE)
1772 cp_error_at ("member `%D' is non-static but referenced as a static member",
1774 error ("at this point in file");
1775 return error_mark_node;
1778 /* The first case is really just a reference to a member of `this'. */
1779 if (TREE_CODE (member) == FIELD_DECL
1780 && (base == current_class_ref || is_dummy_object (base)))
1782 tree binfo = NULL_TREE;
1784 /* Try to get to basetype from 'this'; if that doesn't work,
1786 base = current_class_ref;
1788 /* First convert to the intermediate base specified, if appropriate. */
1789 if (TREE_CODE (exp) == OFFSET_REF && TREE_CODE (type) == OFFSET_TYPE)
1790 base = build_scoped_ref (base, TYPE_OFFSET_BASETYPE (type), &binfo);
1792 return build_class_member_access_expr (base, member,
1793 /*access_path=*/NULL_TREE,
1794 /*preserve_reference=*/false);
1797 /* Ensure that we have an object. */
1798 if (is_dummy_object (base))
1799 addr = error_mark_node;
1801 /* If this is a reference to a member function, then return the
1802 address of the member function (which may involve going
1803 through the object's vtable), otherwise, return an expression
1804 for the dereferenced pointer-to-member construct. */
1805 addr = build_unary_op (ADDR_EXPR, base, 0);
1807 if (TYPE_PTRMEM_P (TREE_TYPE (member)))
1809 if (addr == error_mark_node)
1811 error ("object missing in `%E'", exp);
1812 return error_mark_node;
1815 basetype = TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member)));
1816 basetype = lookup_base (TREE_TYPE (TREE_TYPE (addr)),
1817 basetype, ba_check, NULL);
1818 addr = build_base_path (PLUS_EXPR, addr, basetype, 1);
1820 member = cp_convert (ptrdiff_type_node, member);
1822 addr = build (PLUS_EXPR, build_pointer_type (type), addr, member);
1823 return build_indirect_ref (addr, 0);
1825 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
1827 return get_member_function_from_ptrfunc (&addr, member);
1834 /* If DECL is a `const' declaration, and its value is a known
1835 constant, then return that value. */
1838 decl_constant_value (decl)
1841 if (TREE_READONLY_DECL_P (decl)
1842 && ! TREE_THIS_VOLATILE (decl)
1843 && DECL_INITIAL (decl)
1844 && DECL_INITIAL (decl) != error_mark_node
1845 /* This is invalid if initial value is not constant.
1846 If it has either a function call, a memory reference,
1847 or a variable, then re-evaluating it could give different results. */
1848 && TREE_CONSTANT (DECL_INITIAL (decl))
1849 /* Check for cases where this is sub-optimal, even though valid. */
1850 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1851 return DECL_INITIAL (decl);
1855 /* Common subroutines of build_new and build_vec_delete. */
1857 /* Call the global __builtin_delete to delete ADDR. */
1860 build_builtin_delete_call (addr)
1863 mark_used (global_delete_fndecl);
1864 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1867 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1868 (which needs to go through some sort of groktypename) or it
1869 is the name of the class we are newing. INIT is an initialization value.
1870 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1871 If INIT is void_type_node, it means do *not* call a constructor
1874 For types with constructors, the data returned is initialized
1875 by the appropriate constructor.
1877 Whether the type has a constructor or not, if it has a pointer
1878 to a virtual function table, then that pointer is set up
1881 Unless I am mistaken, a call to new () will return initialized
1882 data regardless of whether the constructor itself is private or
1883 not. NOPE; new fails if the constructor is private (jcm).
1885 Note that build_new does nothing to assure that any special
1886 alignment requirements of the type are met. Rather, it leaves
1887 it up to malloc to do the right thing. Otherwise, folding to
1888 the right alignment cal cause problems if the user tries to later
1889 free the memory returned by `new'.
1891 PLACEMENT is the `placement' list for user-defined operator new (). */
1894 build_new (placement, decl, init, use_global_new)
1900 tree nelts = NULL_TREE, t;
1903 if (decl == error_mark_node)
1904 return error_mark_node;
1906 if (TREE_CODE (decl) == TREE_LIST)
1908 tree absdcl = TREE_VALUE (decl);
1909 tree last_absdcl = NULL_TREE;
1911 if (current_function_decl
1912 && DECL_CONSTRUCTOR_P (current_function_decl))
1913 my_friendly_assert (immediate_size_expand == 0, 19990926);
1915 nelts = integer_one_node;
1917 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1919 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1921 last_absdcl = absdcl;
1922 absdcl = TREE_OPERAND (absdcl, 0);
1925 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1927 /* probably meant to be a vec new */
1930 while (TREE_OPERAND (absdcl, 0)
1931 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1933 last_absdcl = absdcl;
1934 absdcl = TREE_OPERAND (absdcl, 0);
1938 this_nelts = TREE_OPERAND (absdcl, 1);
1939 if (this_nelts != error_mark_node)
1941 if (this_nelts == NULL_TREE)
1942 error ("new of array type fails to specify size");
1943 else if (processing_template_decl)
1946 absdcl = TREE_OPERAND (absdcl, 0);
1950 if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1953 pedwarn ("size in array new must have integral type");
1955 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1956 absdcl = TREE_OPERAND (absdcl, 0);
1957 if (this_nelts == integer_zero_node)
1959 warning ("zero size array reserves no space");
1960 nelts = integer_zero_node;
1963 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1967 nelts = integer_zero_node;
1971 TREE_OPERAND (last_absdcl, 0) = absdcl;
1973 TREE_VALUE (decl) = absdcl;
1975 type = groktypename (decl);
1976 if (! type || type == error_mark_node)
1977 return error_mark_node;
1979 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1981 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1983 /* An aggregate type. */
1984 type = IDENTIFIER_TYPE_VALUE (decl);
1985 decl = TYPE_MAIN_DECL (type);
1989 /* A builtin type. */
1990 decl = lookup_name (decl, 1);
1991 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1992 type = TREE_TYPE (decl);
1995 else if (TREE_CODE (decl) == TYPE_DECL)
1997 type = TREE_TYPE (decl);
2002 decl = TYPE_MAIN_DECL (type);
2005 if (processing_template_decl)
2008 t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
2009 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
2014 rval = build_min_nt (NEW_EXPR, placement, t, init);
2015 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2019 /* ``A reference cannot be created by the new operator. A reference
2020 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2021 returned by new.'' ARM 5.3.3 */
2022 if (TREE_CODE (type) == REFERENCE_TYPE)
2024 error ("new cannot be applied to a reference type");
2025 type = TREE_TYPE (type);
2028 if (TREE_CODE (type) == FUNCTION_TYPE)
2030 error ("new cannot be applied to a function type");
2031 return error_mark_node;
2034 /* When the object being created is an array, the new-expression yields a
2035 pointer to the initial element (if any) of the array. For example,
2036 both new int and new int[10] return an int*. 5.3.4. */
2037 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
2039 nelts = array_type_nelts_top (type);
2041 type = TREE_TYPE (type);
2045 t = build_nt (ARRAY_REF, type, nelts);
2049 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
2050 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2051 TREE_SIDE_EFFECTS (rval) = 1;
2052 rval = build_new_1 (rval);
2053 if (rval == error_mark_node)
2054 return error_mark_node;
2056 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2057 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2058 TREE_NO_UNUSED_WARNING (rval) = 1;
2063 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2066 build_java_class_ref (type)
2069 tree name = NULL_TREE, class_decl;
2070 static tree CL_suffix = NULL_TREE;
2071 if (CL_suffix == NULL_TREE)
2072 CL_suffix = get_identifier("class$");
2073 if (jclass_node == NULL_TREE)
2075 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2076 if (jclass_node == NULL_TREE)
2077 fatal_error ("call to Java constructor, while `jclass' undefined");
2079 jclass_node = TREE_TYPE (jclass_node);
2082 /* Mangle the class$ field */
2085 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2086 if (DECL_NAME (field) == CL_suffix)
2088 mangle_decl (field);
2089 name = DECL_ASSEMBLER_NAME (field);
2093 internal_error ("can't find class$");
2096 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2097 if (class_decl == NULL_TREE)
2099 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2100 TREE_STATIC (class_decl) = 1;
2101 DECL_EXTERNAL (class_decl) = 1;
2102 TREE_PUBLIC (class_decl) = 1;
2103 DECL_ARTIFICIAL (class_decl) = 1;
2104 DECL_IGNORED_P (class_decl) = 1;
2105 pushdecl_top_level (class_decl);
2106 make_decl_rtl (class_decl, NULL);
2111 /* Returns the size of the cookie to use when allocating an array
2112 whose elements have the indicated TYPE. Assumes that it is already
2113 known that a cookie is needed. */
2116 get_cookie_size (type)
2121 /* We need to allocate an additional max (sizeof (size_t), alignof
2122 (true_type)) bytes. */
2126 sizetype_size = size_in_bytes (sizetype);
2127 type_align = size_int (TYPE_ALIGN_UNIT (type));
2128 if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
2129 cookie_size = sizetype_size;
2131 cookie_size = type_align;
2136 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2137 value is immediately handed to expand_expr. */
2143 tree placement, init;
2144 tree type, true_type, size, rval, t;
2146 tree nelts = NULL_TREE;
2147 tree alloc_call, alloc_expr, alloc_node;
2149 tree cookie_expr, init_expr;
2151 enum tree_code code;
2152 int use_cookie, nothrow, check_new;
2153 /* Nonzero if the user wrote `::new' rather than just `new'. */
2154 int globally_qualified_p;
2155 /* Nonzero if we're going to call a global operator new, rather than
2156 a class-specific version. */
2158 int use_java_new = 0;
2159 /* If non-NULL, the number of extra bytes to allocate at the
2160 beginning of the storage allocated for an array-new expression in
2161 order to store the number of elements. */
2162 tree cookie_size = NULL_TREE;
2163 /* True if the function we are calling is a placement allocation
2165 bool placement_allocation_fn_p;
2167 placement = TREE_OPERAND (exp, 0);
2168 type = TREE_OPERAND (exp, 1);
2169 init = TREE_OPERAND (exp, 2);
2170 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
2172 if (TREE_CODE (type) == ARRAY_REF)
2175 nelts = TREE_OPERAND (type, 1);
2176 type = TREE_OPERAND (type, 0);
2178 full_type = cp_build_binary_op (MINUS_EXPR, nelts, integer_one_node);
2179 full_type = build_index_type (full_type);
2180 full_type = build_cplus_array_type (type, full_type);
2187 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
2189 /* If our base type is an array, then make sure we know how many elements
2191 while (TREE_CODE (true_type) == ARRAY_TYPE)
2193 tree this_nelts = array_type_nelts_top (true_type);
2194 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
2195 true_type = TREE_TYPE (true_type);
2198 if (!complete_type_or_else (true_type, exp))
2199 return error_mark_node;
2201 size = size_in_bytes (true_type);
2203 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2205 if (TREE_CODE (true_type) == VOID_TYPE)
2207 error ("invalid type `void' for new");
2208 return error_mark_node;
2211 if (abstract_virtuals_error (NULL_TREE, true_type))
2212 return error_mark_node;
2214 /* Figure out whether or not we're going to use the global operator
2216 if (!globally_qualified_p
2217 && IS_AGGR_TYPE (true_type)
2219 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2220 : TYPE_HAS_NEW_OPERATOR (true_type)))
2225 /* We only need cookies for arrays containing types for which we
2227 if (!has_array || !TYPE_VEC_NEW_USES_COOKIE (true_type))
2229 /* When using placement new, users may not realize that they need
2230 the extra storage. We require that the operator called be
2231 the global placement operator new[]. */
2232 else if (placement && !TREE_CHAIN (placement)
2233 && same_type_p (TREE_TYPE (TREE_VALUE (placement)),
2235 use_cookie = !use_global_new;
2236 /* Otherwise, we need the cookie. */
2240 /* Compute the number of extra bytes to allocate, now that we know
2241 whether or not we need the cookie. */
2244 cookie_size = get_cookie_size (true_type);
2245 size = size_binop (PLUS_EXPR, size, cookie_size);
2248 /* Allocate the object. */
2250 if (! placement && TYPE_FOR_JAVA (true_type))
2252 tree class_addr, alloc_decl;
2253 tree class_decl = build_java_class_ref (true_type);
2254 tree class_size = size_in_bytes (true_type);
2255 static const char alloc_name[] = "_Jv_AllocObject";
2257 alloc_decl = IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name));
2258 if (alloc_decl == NULL_TREE)
2259 fatal_error ("call to Java constructor with `%s' undefined",
2262 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2263 alloc_call = (build_function_call
2265 tree_cons (NULL_TREE, class_addr,
2266 build_tree_list (NULL_TREE, class_size))));
2273 args = tree_cons (NULL_TREE, size, placement);
2274 fnname = ansi_opname (code);
2277 alloc_call = (build_new_function_call
2278 (lookup_function_nonclass (fnname, args),
2281 alloc_call = build_method_call (build_dummy_object (true_type),
2283 TYPE_BINFO (true_type),
2287 if (alloc_call == error_mark_node)
2288 return error_mark_node;
2290 /* The ALLOC_CALL should be a CALL_EXPR -- or a COMPOUND_EXPR whose
2291 right-hand-side is ultimately a CALL_EXPR -- and the first
2292 operand should be the address of a known FUNCTION_DECL. */
2294 while (TREE_CODE (t) == COMPOUND_EXPR)
2295 t = TREE_OPERAND (t, 1);
2296 alloc_fn = get_callee_fndecl (t);
2297 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2298 /* Now, check to see if this function is actually a placement
2299 allocation function. This can happen even when PLACEMENT is NULL
2300 because we might have something like:
2302 struct S { void* operator new (size_t, int i = 0); };
2304 A call to `new S' will get this allocation function, even though
2305 there is no explicit placement argument. If there is more than
2306 one argument, or there are variable arguments, then this is a
2307 placement allocation function. */
2308 placement_allocation_fn_p
2309 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2310 || varargs_function_p (alloc_fn));
2312 /* unless an allocation function is declared with an empty excep-
2313 tion-specification (_except.spec_), throw(), it indicates failure to
2314 allocate storage by throwing a bad_alloc exception (clause _except_,
2315 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2316 cation function is declared with an empty exception-specification,
2317 throw(), it returns null to indicate failure to allocate storage and a
2318 non-null pointer otherwise.
2320 So check for a null exception spec on the op new we just called. */
2322 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2323 check_new = (flag_check_new || nothrow) && ! use_java_new;
2325 alloc_expr = alloc_call;
2328 /* Adjust so we're pointing to the start of the object. */
2329 alloc_expr = build (PLUS_EXPR, TREE_TYPE (alloc_expr),
2330 alloc_expr, cookie_size);
2332 /* While we're working, use a pointer to the type we've actually
2334 alloc_expr = convert (build_pointer_type (full_type), alloc_expr);
2336 /* Now save the allocation expression so we only evaluate it once. */
2337 alloc_expr = get_target_expr (alloc_expr);
2338 alloc_node = TREE_OPERAND (alloc_expr, 0);
2340 /* Now initialize the cookie. */
2345 /* Store the number of bytes allocated so that we can know how
2346 many elements to destroy later. We use the last sizeof
2347 (size_t) bytes to store the number of elements. */
2348 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2349 alloc_node, size_in_bytes (sizetype));
2350 cookie = build_indirect_ref (cookie, NULL);
2352 cookie_expr = build (MODIFY_EXPR, void_type_node, cookie, nelts);
2353 TREE_SIDE_EFFECTS (cookie_expr) = 1;
2356 cookie_expr = NULL_TREE;
2358 /* Now initialize the allocated object. */
2359 init_expr = NULL_TREE;
2360 if (TYPE_NEEDS_CONSTRUCTING (type) || init)
2362 init_expr = build_indirect_ref (alloc_node, NULL);
2364 if (init == void_zero_node)
2365 init = build_default_init (full_type);
2366 else if (init && pedantic && has_array)
2367 pedwarn ("ISO C++ forbids initialization in array new");
2370 init_expr = build_vec_init (init_expr, init, 0);
2371 else if (TYPE_NEEDS_CONSTRUCTING (type))
2372 init_expr = build_special_member_call (init_expr,
2373 complete_ctor_identifier,
2374 init, TYPE_BINFO (true_type),
2378 /* We are processing something like `new int (10)', which
2379 means allocate an int, and initialize it with 10. */
2381 if (TREE_CODE (init) == TREE_LIST)
2383 if (TREE_CHAIN (init) != NULL_TREE)
2385 ("initializer list being treated as compound expression");
2386 init = build_compound_expr (init);
2388 else if (TREE_CODE (init) == CONSTRUCTOR
2389 && TREE_TYPE (init) == NULL_TREE)
2391 pedwarn ("ISO C++ forbids aggregate initializer to new");
2392 init = digest_init (type, init, 0);
2395 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2398 if (init_expr == error_mark_node)
2399 return error_mark_node;
2401 /* If any part of the object initialization terminates by throwing an
2402 exception and a suitable deallocation function can be found, the
2403 deallocation function is called to free the memory in which the
2404 object was being constructed, after which the exception continues
2405 to propagate in the context of the new-expression. If no
2406 unambiguous matching deallocation function can be found,
2407 propagating the exception does not cause the object's memory to be
2409 if (flag_exceptions && ! use_java_new)
2411 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2413 int flags = (LOOKUP_NORMAL
2414 | (globally_qualified_p * LOOKUP_GLOBAL));
2418 /* Subtract the padding back out to get to the pointer returned
2419 from operator new. */
2420 delete_node = fold (build (MINUS_EXPR, TREE_TYPE (alloc_node),
2421 alloc_node, cookie_size));
2423 delete_node = alloc_node;
2425 /* The Standard is unclear here, but the right thing to do
2426 is to use the same method for finding deallocation
2427 functions that we use for finding allocation functions. */
2428 flags |= LOOKUP_SPECULATIVELY;
2430 cleanup = build_op_delete_call (dcode, delete_node, size, flags,
2431 (placement_allocation_fn_p
2432 ? alloc_call : NULL_TREE));
2434 /* Ack! First we allocate the memory. Then we set our sentry
2435 variable to true, and expand a cleanup that deletes the memory
2436 if sentry is true. Then we run the constructor, and finally
2439 It would be nice to be able to handle this without the sentry
2440 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2441 work. We allocate the space first, so if there are any
2442 temporaries with cleanups in the constructor args we need this
2443 EH region to extend until end of full-expression to preserve
2446 If the backend had some mechanism so that we could force the
2447 allocation to be expanded after all the other args to the
2448 constructor, that would fix the nesting problem and we could
2449 do away with this complexity. But that would complicate other
2450 things; in particular, it would make it difficult to bail out
2451 if the allocation function returns null. Er, no, it wouldn't;
2452 we just don't run the constructor. The standard says it's
2453 unspecified whether or not the args are evaluated. */
2457 tree end, sentry, begin;
2459 begin = get_target_expr (boolean_true_node);
2460 CLEANUP_EH_ONLY (begin) = 1;
2462 sentry = TARGET_EXPR_SLOT (begin);
2464 TARGET_EXPR_CLEANUP (begin)
2465 = build (COND_EXPR, void_type_node, sentry,
2466 cleanup, void_zero_node);
2468 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2469 sentry, boolean_false_node);
2472 = build (COMPOUND_EXPR, void_type_node, begin,
2473 build (COMPOUND_EXPR, void_type_node, init_expr,
2478 else if (CP_TYPE_CONST_P (true_type))
2479 error ("uninitialized const in `new' of `%#T'", true_type);
2481 /* Now build up the return value in reverse order. */
2486 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2488 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2490 if (rval == alloc_node)
2491 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2493 rval = TREE_OPERAND (alloc_expr, 1);
2498 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2500 rval = build_conditional_expr (ifexp, rval, alloc_node);
2503 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2506 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2508 rval = convert (build_pointer_type (type), rval);
2514 build_vec_delete_1 (base, maxindex, type, auto_delete_vec, use_global_delete)
2515 tree base, maxindex, type;
2516 special_function_kind auto_delete_vec;
2517 int use_global_delete;
2520 tree ptype = build_pointer_type (type = complete_type (type));
2521 tree size_exp = size_in_bytes (type);
2523 /* Temporary variables used by the loop. */
2524 tree tbase, tbase_init;
2526 /* This is the body of the loop that implements the deletion of a
2527 single element, and moves temp variables to next elements. */
2530 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2533 /* This is the thing that governs what to do after the loop has run. */
2534 tree deallocate_expr = 0;
2536 /* This is the BIND_EXPR which holds the outermost iterator of the
2537 loop. It is convenient to set this variable up and test it before
2538 executing any other code in the loop.
2539 This is also the containing expression returned by this function. */
2540 tree controller = NULL_TREE;
2542 /* We should only have 1-D arrays here. */
2543 if (TREE_CODE (type) == ARRAY_TYPE)
2546 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2548 loop = integer_zero_node;
2552 /* The below is short by the cookie size. */
2553 virtual_size = size_binop (MULT_EXPR, size_exp,
2554 convert (sizetype, maxindex));
2556 tbase = create_temporary_var (ptype);
2557 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2558 fold (build (PLUS_EXPR, ptype,
2561 DECL_REGISTER (tbase) = 1;
2562 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2563 TREE_SIDE_EFFECTS (controller) = 1;
2567 body = tree_cons (NULL_TREE,
2568 build_delete (ptype, tbase, sfk_complete_destructor,
2569 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1),
2572 body = tree_cons (NULL_TREE,
2573 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
2576 body = tree_cons (NULL_TREE,
2577 build (EXIT_EXPR, void_type_node,
2578 build (EQ_EXPR, boolean_type_node, base, tbase)),
2581 loop = build (LOOP_EXPR, void_type_node, build_compound_expr (body));
2583 loop = tree_cons (NULL_TREE, tbase_init,
2584 tree_cons (NULL_TREE, loop, NULL_TREE));
2585 loop = build_compound_expr (loop);
2588 /* If the delete flag is one, or anything else with the low bit set,
2589 delete the storage. */
2590 deallocate_expr = integer_zero_node;
2591 if (auto_delete_vec != sfk_base_destructor)
2595 /* The below is short by the cookie size. */
2596 virtual_size = size_binop (MULT_EXPR, size_exp,
2597 convert (sizetype, maxindex));
2599 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2606 cookie_size = get_cookie_size (type);
2608 = cp_convert (ptype,
2609 cp_build_binary_op (MINUS_EXPR,
2610 cp_convert (string_type_node,
2613 /* True size with header. */
2614 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2617 if (auto_delete_vec == sfk_deleting_destructor)
2618 deallocate_expr = build_x_delete (base_tbd,
2619 2 | use_global_delete,
2623 if (loop && deallocate_expr != integer_zero_node)
2625 body = tree_cons (NULL_TREE, loop,
2626 tree_cons (NULL_TREE, deallocate_expr, NULL_TREE));
2627 body = build_compound_expr (body);
2632 /* Outermost wrapper: If pointer is null, punt. */
2633 body = fold (build (COND_EXPR, void_type_node,
2634 fold (build (NE_EXPR, boolean_type_node, base,
2635 integer_zero_node)),
2636 body, integer_zero_node));
2637 body = build1 (NOP_EXPR, void_type_node, body);
2641 TREE_OPERAND (controller, 1) = body;
2645 return cp_convert (void_type_node, body);
2648 /* Create an unnamed variable of the indicated TYPE. */
2651 create_temporary_var (type)
2656 decl = build_decl (VAR_DECL, NULL_TREE, type);
2657 TREE_USED (decl) = 1;
2658 DECL_ARTIFICIAL (decl) = 1;
2659 DECL_SOURCE_FILE (decl) = input_filename;
2660 DECL_SOURCE_LINE (decl) = lineno;
2661 DECL_IGNORED_P (decl) = 1;
2662 DECL_CONTEXT (decl) = current_function_decl;
2667 /* Create a new temporary variable of the indicated TYPE, initialized
2670 It is not entered into current_binding_level, because that breaks
2671 things when it comes time to do final cleanups (which take place
2672 "outside" the binding contour of the function). */
2675 get_temp_regvar (type, init)
2680 decl = create_temporary_var (type);
2681 if (building_stmt_tree ())
2682 add_decl_stmt (decl);
2683 if (!building_stmt_tree ())
2684 SET_DECL_RTL (decl, assign_temp (type, 2, 0, 1));
2685 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2690 /* `build_vec_init' returns tree structure that performs
2691 initialization of a vector of aggregate types.
2693 BASE is a reference to the vector, of ARRAY_TYPE.
2694 INIT is the (possibly NULL) initializer.
2696 FROM_ARRAY is 0 if we should init everything with INIT
2697 (i.e., every element initialized from INIT).
2698 FROM_ARRAY is 1 if we should index into INIT in parallel
2699 with initialization of DECL.
2700 FROM_ARRAY is 2 if we should index into INIT in parallel,
2701 but use assignment instead of initialization. */
2704 build_vec_init (base, init, from_array)
2709 tree base2 = NULL_TREE;
2711 tree itype = NULL_TREE;
2713 /* The type of the array. */
2714 tree atype = TREE_TYPE (base);
2715 /* The type of an element in the array. */
2716 tree type = TREE_TYPE (atype);
2717 /* The type of a pointer to an element in the array. */
2722 tree try_block = NULL_TREE;
2723 tree try_body = NULL_TREE;
2724 int num_initialized_elts = 0;
2725 tree maxindex = array_type_nelts (TREE_TYPE (base));
2727 if (maxindex == error_mark_node)
2728 return error_mark_node;
2732 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2733 : !TYPE_NEEDS_CONSTRUCTING (type))
2734 && ((TREE_CODE (init) == CONSTRUCTOR
2735 /* Don't do this if the CONSTRUCTOR might contain something
2736 that might throw and require us to clean up. */
2737 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2738 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2741 /* Do non-default initialization of POD arrays resulting from
2742 brace-enclosed initializers. In this case, digest_init and
2743 store_constructor will handle the semantics for us. */
2745 stmt_expr = build (INIT_EXPR, atype, base, init);
2749 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2750 ptype = build_pointer_type (type);
2751 size = size_in_bytes (type);
2752 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2753 base = cp_convert (ptype, default_conversion (base));
2755 /* The code we are generating looks like:
2759 ptrdiff_t iterator = maxindex;
2762 ... initialize *t1 ...
2764 } while (--iterator != -1);
2766 ... destroy elements that were constructed ...
2770 We can omit the try and catch blocks if we know that the
2771 initialization will never throw an exception, or if the array
2772 elements do not have destructors. We can omit the loop completely if
2773 the elements of the array do not have constructors.
2775 We actually wrap the entire body of the above in a STMT_EXPR, for
2778 When copying from array to another, when the array elements have
2779 only trivial copy constructors, we should use __builtin_memcpy
2780 rather than generating a loop. That way, we could take advantage
2781 of whatever cleverness the back-end has for dealing with copies
2782 of blocks of memory. */
2784 begin_init_stmts (&stmt_expr, &compound_stmt);
2785 destroy_temps = stmts_are_full_exprs_p ();
2786 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2787 rval = get_temp_regvar (ptype, base);
2788 base = get_temp_regvar (ptype, rval);
2789 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2791 /* Protect the entire array initialization so that we can destroy
2792 the partially constructed array if an exception is thrown.
2793 But don't do this if we're assigning. */
2794 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2797 try_block = begin_try_block ();
2798 try_body = begin_compound_stmt (/*has_no_scope=*/1);
2801 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2803 /* Do non-default initialization of non-POD arrays resulting from
2804 brace-enclosed initializers. */
2809 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2811 tree elt = TREE_VALUE (elts);
2812 tree baseref = build1 (INDIRECT_REF, type, base);
2814 num_initialized_elts++;
2816 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2817 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2819 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2822 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2823 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2826 /* Clear out INIT so that we don't get confused below. */
2829 else if (from_array)
2831 /* If initializing one array from another, initialize element by
2832 element. We rely upon the below calls the do argument
2836 base2 = default_conversion (init);
2837 itype = TREE_TYPE (base2);
2838 base2 = get_temp_regvar (itype, base2);
2839 itype = TREE_TYPE (itype);
2841 else if (TYPE_LANG_SPECIFIC (type)
2842 && TYPE_NEEDS_CONSTRUCTING (type)
2843 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2845 error ("initializer ends prematurely");
2846 return error_mark_node;
2850 /* Now, default-initialize any remaining elements. We don't need to
2851 do that if a) the type does not need constructing, or b) we've
2852 already initialized all the elements.
2854 We do need to keep going if we're copying an array. */
2857 || (TYPE_NEEDS_CONSTRUCTING (type)
2858 && ! (host_integerp (maxindex, 0)
2859 && (num_initialized_elts
2860 == tree_low_cst (maxindex, 0) + 1))))
2862 /* If the ITERATOR is equal to -1, then we don't have to loop;
2863 we've already initialized all the elements. */
2869 if_stmt = begin_if_stmt ();
2870 finish_if_stmt_cond (build (NE_EXPR, boolean_type_node,
2871 iterator, integer_minus_one_node),
2874 /* Otherwise, loop through the elements. */
2875 do_stmt = begin_do_stmt ();
2876 do_body = begin_compound_stmt (/*has_no_scope=*/1);
2878 /* When we're not building a statement-tree, things are a little
2879 complicated. If, when we recursively call build_aggr_init,
2880 an expression containing a TARGET_EXPR is expanded, then it
2881 may get a cleanup. Then, the result of that expression is
2882 passed to finish_expr_stmt, which will call
2883 expand_start_target_temps/expand_end_target_temps. However,
2884 the latter call will not cause the cleanup to run because
2885 that block will still be on the block stack. So, we call
2886 expand_start_target_temps here manually; the corresponding
2887 call to expand_end_target_temps below will cause the cleanup
2889 if (!building_stmt_tree ())
2890 expand_start_target_temps ();
2894 tree to = build1 (INDIRECT_REF, type, base);
2898 from = build1 (INDIRECT_REF, itype, base2);
2902 if (from_array == 2)
2903 elt_init = build_modify_expr (to, NOP_EXPR, from);
2904 else if (TYPE_NEEDS_CONSTRUCTING (type))
2905 elt_init = build_aggr_init (to, from, 0);
2907 elt_init = build_modify_expr (to, NOP_EXPR, from);
2911 else if (TREE_CODE (type) == ARRAY_TYPE)
2915 ("cannot initialize multi-dimensional array with initializer");
2916 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2920 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2923 /* The initialization of each array element is a
2924 full-expression, as per core issue 124. */
2925 if (!building_stmt_tree ())
2927 genrtl_expr_stmt (elt_init);
2928 expand_end_target_temps ();
2932 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2933 finish_expr_stmt (elt_init);
2934 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2937 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2939 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2941 finish_compound_stmt (/*has_no_scope=*/1, do_body);
2942 finish_do_body (do_stmt);
2943 finish_do_stmt (build (NE_EXPR, boolean_type_node,
2944 build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2945 integer_minus_one_node),
2948 finish_then_clause (if_stmt);
2952 /* Make sure to cleanup any partially constructed elements. */
2953 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2957 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2959 /* Flatten multi-dimensional array since build_vec_delete only
2960 expects one-dimensional array. */
2961 if (TREE_CODE (type) == ARRAY_TYPE)
2963 m = cp_build_binary_op (MULT_EXPR, m,
2964 array_type_nelts_total (type));
2965 type = strip_array_types (type);
2968 finish_compound_stmt (/*has_no_scope=*/1, try_body);
2969 finish_cleanup_try_block (try_block);
2970 e = build_vec_delete_1 (rval, m,
2972 sfk_base_destructor,
2973 /*use_global_delete=*/0);
2974 finish_cleanup (e, try_block);
2977 /* The value of the array initialization is the address of the
2978 first element in the array. */
2979 finish_expr_stmt (rval);
2981 stmt_expr = finish_init_stmts (stmt_expr, compound_stmt);
2982 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2986 /* Free up storage of type TYPE, at address ADDR.
2988 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2991 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2992 used as the second argument to operator delete. It can include
2993 things like padding and magic size cookies. It has virtual in it,
2994 because if you have a base pointer and you delete through a virtual
2995 destructor, it should be the size of the dynamic object, not the
2996 static object, see Free Store 12.5 ISO C++.
2998 This does not call any destructors. */
3001 build_x_delete (addr, which_delete, virtual_size)
3006 int use_global_delete = which_delete & 1;
3007 int use_vec_delete = !!(which_delete & 2);
3008 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
3009 int flags = LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL);
3011 return build_op_delete_call (code, addr, virtual_size, flags, NULL_TREE);
3014 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3018 build_dtor_call (exp, dtor_kind, flags)
3020 special_function_kind dtor_kind;
3027 case sfk_complete_destructor:
3028 name = complete_dtor_identifier;
3031 case sfk_base_destructor:
3032 name = base_dtor_identifier;
3035 case sfk_deleting_destructor:
3036 name = deleting_dtor_identifier;
3042 return build_method_call (exp, name, NULL_TREE,
3043 TYPE_BINFO (TREE_TYPE (exp)), flags);
3046 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3047 ADDR is an expression which yields the store to be destroyed.
3048 AUTO_DELETE is the name of the destructor to call, i.e., either
3049 sfk_complete_destructor, sfk_base_destructor, or
3050 sfk_deleting_destructor.
3052 FLAGS is the logical disjunction of zero or more LOOKUP_
3053 flags. See cp-tree.h for more info. */
3056 build_delete (type, addr, auto_delete, flags, use_global_delete)
3058 special_function_kind auto_delete;
3060 int use_global_delete;
3064 if (addr == error_mark_node)
3065 return error_mark_node;
3067 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3068 set to `error_mark_node' before it gets properly cleaned up. */
3069 if (type == error_mark_node)
3070 return error_mark_node;
3072 type = TYPE_MAIN_VARIANT (type);
3074 if (TREE_CODE (type) == POINTER_TYPE)
3076 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3077 if (TREE_CODE (type) == ARRAY_TYPE)
3080 if (VOID_TYPE_P (type)
3081 /* We don't want to warn about delete of void*, only other
3082 incomplete types. Deleting other incomplete types
3083 invokes undefined behavior, but it is not ill-formed, so
3084 compile to something that would even do The Right Thing
3085 (TM) should the type have a trivial dtor and no delete
3087 || !complete_type_or_diagnostic (type, addr, 1)
3088 || !IS_AGGR_TYPE (type))
3090 /* Call the builtin operator delete. */
3091 return build_builtin_delete_call (addr);
3093 if (TREE_SIDE_EFFECTS (addr))
3094 addr = save_expr (addr);
3096 /* throw away const and volatile on target type of addr */
3097 addr = convert_force (build_pointer_type (type), addr, 0);
3099 else if (TREE_CODE (type) == ARRAY_TYPE)
3102 if (TREE_SIDE_EFFECTS (addr))
3103 addr = save_expr (addr);
3104 if (TYPE_DOMAIN (type) == NULL_TREE)
3106 error ("unknown array size in delete");
3107 return error_mark_node;
3109 return build_vec_delete (addr, array_type_nelts (type),
3110 auto_delete, use_global_delete);
3114 /* Don't check PROTECT here; leave that decision to the
3115 destructor. If the destructor is accessible, call it,
3116 else report error. */
3117 addr = build_unary_op (ADDR_EXPR, addr, 0);
3118 if (TREE_SIDE_EFFECTS (addr))
3119 addr = save_expr (addr);
3121 addr = convert_force (build_pointer_type (type), addr, 0);
3124 my_friendly_assert (IS_AGGR_TYPE (type), 220);
3126 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
3128 if (auto_delete != sfk_deleting_destructor)
3129 return void_zero_node;
3131 return build_op_delete_call
3132 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3133 LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL),
3138 tree do_delete = NULL_TREE;
3141 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
3143 /* For `::delete x', we must not use the deleting destructor
3144 since then we would not be sure to get the global `operator
3146 if (use_global_delete && auto_delete == sfk_deleting_destructor)
3148 /* We will use ADDR multiple times so we must save it. */
3149 addr = save_expr (addr);
3150 /* Delete the object. */
3151 do_delete = build_builtin_delete_call (addr);
3152 /* Otherwise, treat this like a complete object destructor
3154 auto_delete = sfk_complete_destructor;
3156 /* If the destructor is non-virtual, there is no deleting
3157 variant. Instead, we must explicitly call the appropriate
3158 `operator delete' here. */
3159 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
3160 && auto_delete == sfk_deleting_destructor)
3162 /* We will use ADDR multiple times so we must save it. */
3163 addr = save_expr (addr);
3164 /* Build the call. */
3165 do_delete = build_op_delete_call (DELETE_EXPR,
3167 cxx_sizeof_nowarn (type),
3170 /* Call the complete object destructor. */
3171 auto_delete = sfk_complete_destructor;
3173 else if (auto_delete == sfk_deleting_destructor
3174 && TYPE_GETS_REG_DELETE (type))
3176 /* Make sure we have access to the member op delete, even though
3177 we'll actually be calling it from the destructor. */
3178 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
3179 LOOKUP_NORMAL, NULL_TREE);
3182 expr = build_dtor_call (build_indirect_ref (addr, NULL),
3183 auto_delete, flags);
3185 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3187 if (flags & LOOKUP_DESTRUCTOR)
3188 /* Explicit destructor call; don't check for null pointer. */
3189 ifexp = integer_one_node;
3191 /* Handle deleting a null pointer. */
3192 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
3194 if (ifexp != integer_one_node)
3195 expr = build (COND_EXPR, void_type_node,
3196 ifexp, expr, void_zero_node);
3202 /* At the beginning of a destructor, push cleanups that will call the
3203 destructors for our base classes and members.
3205 Called from begin_destructor_body. */
3208 push_base_cleanups ()
3211 int i, n_baseclasses;
3215 /* Run destructors for all virtual baseclasses. */
3216 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
3219 tree cond = (condition_conversion
3220 (build (BIT_AND_EXPR, integer_type_node,
3221 current_in_charge_parm,
3222 integer_two_node)));
3224 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3225 /* The CLASSTYPE_VBASECLASSES list is in initialization
3226 order, which is also the right order for pushing cleanups. */
3228 vbases = TREE_CHAIN (vbases))
3230 tree vbase = TREE_VALUE (vbases);
3231 tree base_type = BINFO_TYPE (vbase);
3233 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3235 expr = build_special_member_call (current_class_ref,
3236 base_dtor_identifier,
3240 | LOOKUP_NONVIRTUAL));
3241 expr = build (COND_EXPR, void_type_node, cond,
3242 expr, void_zero_node);
3243 finish_decl_cleanup (NULL_TREE, expr);
3248 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3249 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3251 /* Take care of the remaining baseclasses. */
3252 for (i = 0; i < n_baseclasses; i++)
3254 tree base_binfo = TREE_VEC_ELT (binfos, i);
3255 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3256 || TREE_VIA_VIRTUAL (base_binfo))
3259 expr = build_special_member_call (current_class_ref,
3260 base_dtor_identifier,
3261 NULL_TREE, base_binfo,
3262 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3263 finish_decl_cleanup (NULL_TREE, expr);
3266 for (member = TYPE_FIELDS (current_class_type); member;
3267 member = TREE_CHAIN (member))
3269 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3271 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3273 tree this_member = (build_class_member_access_expr
3274 (current_class_ref, member,
3275 /*access_path=*/NULL_TREE,
3276 /*preserve_reference=*/false));
3277 tree this_type = TREE_TYPE (member);
3278 expr = build_delete (this_type, this_member,
3279 sfk_complete_destructor,
3280 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3282 finish_decl_cleanup (NULL_TREE, expr);
3287 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3290 build_vbase_delete (type, decl)
3293 tree vbases = CLASSTYPE_VBASECLASSES (type);
3294 tree result = NULL_TREE;
3295 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3297 my_friendly_assert (addr != error_mark_node, 222);
3302 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))),
3304 result = tree_cons (NULL_TREE,
3305 build_delete (TREE_TYPE (this_addr), this_addr,
3306 sfk_base_destructor,
3307 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0),
3309 vbases = TREE_CHAIN (vbases);
3311 return build_compound_expr (nreverse (result));
3314 /* Build a C++ vector delete expression.
3315 MAXINDEX is the number of elements to be deleted.
3316 ELT_SIZE is the nominal size of each element in the vector.
3317 BASE is the expression that should yield the store to be deleted.
3318 This function expands (or synthesizes) these calls itself.
3319 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3321 This also calls delete for virtual baseclasses of elements of the vector.
3323 Update: MAXINDEX is no longer needed. The size can be extracted from the
3324 start of the vector for pointers, and from the type for arrays. We still
3325 use MAXINDEX for arrays because it happens to already have one of the
3326 values we'd have to extract. (We could use MAXINDEX with pointers to
3327 confirm the size, and trap if the numbers differ; not clear that it'd
3328 be worth bothering.) */
3331 build_vec_delete (base, maxindex, auto_delete_vec, use_global_delete)
3332 tree base, maxindex;
3333 special_function_kind auto_delete_vec;
3334 int use_global_delete;
3338 if (TREE_CODE (base) == OFFSET_REF)
3339 base = resolve_offset_ref (base);
3341 type = TREE_TYPE (base);
3343 base = stabilize_reference (base);
3345 /* Since we can use base many times, save_expr it. */
3346 if (TREE_SIDE_EFFECTS (base))
3347 base = save_expr (base);
3349 if (TREE_CODE (type) == POINTER_TYPE)
3351 /* Step back one from start of vector, and read dimension. */
3354 type = strip_array_types (TREE_TYPE (type));
3355 cookie_addr = build (MINUS_EXPR,
3356 build_pointer_type (sizetype),
3358 TYPE_SIZE_UNIT (sizetype));
3359 maxindex = build_indirect_ref (cookie_addr, NULL);
3361 else if (TREE_CODE (type) == ARRAY_TYPE)
3363 /* get the total number of things in the array, maxindex is a bad name */
3364 maxindex = array_type_nelts_total (type);
3365 type = strip_array_types (type);
3366 base = build_unary_op (ADDR_EXPR, base, 1);
3370 if (base != error_mark_node)
3371 error ("type to vector delete is neither pointer or array type");
3372 return error_mark_node;
3375 return build_vec_delete_1 (base, maxindex, type, auto_delete_vec,