1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* High-level class interface. */
27 #include "coretypes.h"
38 static bool begin_init_stmts (tree *, tree *);
39 static tree finish_init_stmts (bool, tree, tree);
40 static void construct_virtual_base (tree, tree);
41 static void expand_aggr_init_1 (tree, tree, tree, tree, int);
42 static void expand_default_init (tree, tree, tree, tree, int);
43 static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int);
44 static void perform_member_init (tree, tree);
45 static tree build_builtin_delete_call (tree);
46 static int member_init_ok_or_else (tree, tree, tree);
47 static void expand_virtual_init (tree, tree);
48 static tree sort_mem_initializers (tree, tree);
49 static tree initializing_context (tree);
50 static void expand_cleanup_for_base (tree, tree);
51 static tree get_temp_regvar (tree, tree);
52 static tree dfs_initialize_vtbl_ptrs (tree, void *);
53 static tree build_default_init (tree, tree);
54 static tree build_new_1 (tree);
55 static tree get_cookie_size (tree);
56 static tree build_dtor_call (tree, special_function_kind, int);
57 static tree build_field_list (tree, tree, int *);
58 static tree build_vtbl_address (tree);
60 /* We are about to generate some complex initialization code.
61 Conceptually, it is all a single expression. However, we may want
62 to include conditionals, loops, and other such statement-level
63 constructs. Therefore, we build the initialization code inside a
64 statement-expression. This function starts such an expression.
65 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
66 pass them back to finish_init_stmts when the expression is
70 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
72 bool is_global = !building_stmt_tree ();
74 *stmt_expr_p = begin_stmt_expr ();
75 *compound_stmt_p = begin_compound_stmt (/*has_no_scope=*/true);
80 /* Finish out the statement-expression begun by the previous call to
81 begin_init_stmts. Returns the statement-expression itself. */
84 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
86 finish_compound_stmt (compound_stmt);
88 stmt_expr = finish_stmt_expr (stmt_expr, true);
90 my_friendly_assert (!building_stmt_tree () == is_global, 20030726);
97 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
98 which we want to initialize the vtable pointer for, DATA is
99 TREE_LIST whose TREE_VALUE is the this ptr expression. */
102 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
104 if ((!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
105 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
107 tree base_ptr = TREE_VALUE ((tree) data);
109 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
111 expand_virtual_init (binfo, base_ptr);
114 BINFO_MARKED (binfo) = 1;
119 /* Initialize all the vtable pointers in the object pointed to by
123 initialize_vtbl_ptrs (tree addr)
128 type = TREE_TYPE (TREE_TYPE (addr));
129 list = build_tree_list (type, addr);
131 /* Walk through the hierarchy, initializing the vptr in each base
132 class. We do these in pre-order because we can't find the virtual
133 bases for a class until we've initialized the vtbl for that
135 dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
136 NULL, unmarkedp, list);
137 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, type);
140 /* Return an expression for the zero-initialization of an object with
141 type T. This expression will either be a constant (in the case
142 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
143 aggregate). In either case, the value can be used as DECL_INITIAL
144 for a decl of the indicated TYPE; it is a valid static initializer.
145 If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
146 number of elements in the array. If STATIC_STORAGE_P is TRUE,
147 initializers are only generated for entities for which
148 zero-initialization does not simply mean filling the storage with
152 build_zero_init (tree type, tree nelts, bool static_storage_p)
154 tree init = NULL_TREE;
158 To zero-initialization storage for an object of type T means:
160 -- if T is a scalar type, the storage is set to the value of zero
163 -- if T is a non-union class type, the storage for each nonstatic
164 data member and each base-class subobject is zero-initialized.
166 -- if T is a union type, the storage for its first data member is
169 -- if T is an array type, the storage for each element is
172 -- if T is a reference type, no initialization is performed. */
174 my_friendly_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST,
177 if (type == error_mark_node)
179 else if (static_storage_p && zero_init_p (type))
180 /* In order to save space, we do not explicitly build initializers
181 for items that do not need them. GCC's semantics are that
182 items with static storage duration that are not otherwise
183 initialized are initialized to zero. */
185 else if (SCALAR_TYPE_P (type))
186 init = convert (type, integer_zero_node);
187 else if (CLASS_TYPE_P (type))
192 /* Build a constructor to contain the initializations. */
193 init = build_constructor (type, NULL_TREE);
194 /* Iterate over the fields, building initializations. */
196 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
198 if (TREE_CODE (field) != FIELD_DECL)
201 /* Note that for class types there will be FIELD_DECLs
202 corresponding to base classes as well. Thus, iterating
203 over TYPE_FIELDs will result in correct initialization of
204 all of the subobjects. */
205 if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
206 inits = tree_cons (field,
207 build_zero_init (TREE_TYPE (field),
212 /* For unions, only the first field is initialized. */
213 if (TREE_CODE (type) == UNION_TYPE)
216 CONSTRUCTOR_ELTS (init) = nreverse (inits);
218 else if (TREE_CODE (type) == ARRAY_TYPE)
224 /* Build a constructor to contain the initializations. */
225 init = build_constructor (type, NULL_TREE);
226 /* Iterate over the array elements, building initializations. */
228 max_index = nelts ? nelts : array_type_nelts (type);
229 my_friendly_assert (TREE_CODE (max_index) == INTEGER_CST, 20030618);
231 /* A zero-sized array, which is accepted as an extension, will
232 have an upper bound of -1. */
233 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
234 for (index = size_zero_node;
235 !tree_int_cst_lt (max_index, index);
236 index = size_binop (PLUS_EXPR, index, size_one_node))
237 inits = tree_cons (index,
238 build_zero_init (TREE_TYPE (type),
242 CONSTRUCTOR_ELTS (init) = nreverse (inits);
244 else if (TREE_CODE (type) == REFERENCE_TYPE)
249 /* In all cases, the initializer is a constant. */
251 TREE_CONSTANT (init) = 1;
256 /* Build an expression for the default-initialization of an object of
257 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
258 ARRAY_TYPE, NELTS is the number of elements in the array. If
259 initialization of TYPE requires calling constructors, this function
260 returns NULL_TREE; the caller is responsible for arranging for the
261 constructors to be called. */
264 build_default_init (tree type, tree nelts)
268 To default-initialize an object of type T means:
270 --if T is a non-POD class type (clause _class_), the default construc-
271 tor for T is called (and the initialization is ill-formed if T has
272 no accessible default constructor);
274 --if T is an array type, each element is default-initialized;
276 --otherwise, the storage for the object is zero-initialized.
278 A program that calls for default-initialization of an entity of refer-
279 ence type is ill-formed. */
281 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
282 performing the initialization. This is confusing in that some
283 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
284 a class with a pointer-to-data member as a non-static data member
285 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
286 passing non-PODs to build_zero_init below, which is contrary to
287 the semantics quoted above from [dcl.init].
289 It happens, however, that the behavior of the constructor the
290 standard says we should have generated would be precisely the
291 same as that obtained by calling build_zero_init below, so things
293 if (TYPE_NEEDS_CONSTRUCTING (type)
294 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
297 /* At this point, TYPE is either a POD class type, an array of POD
298 classes, or something even more innocuous. */
299 return build_zero_init (type, nelts, /*static_storage_p=*/false);
302 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
303 arguments. If TREE_LIST is void_type_node, an empty initializer
304 list was given; if NULL_TREE no initializer was given. */
307 perform_member_init (tree member, tree init)
310 tree type = TREE_TYPE (member);
313 explicit = (init != NULL_TREE);
315 /* Effective C++ rule 12 requires that all data members be
317 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
318 warning ("`%D' should be initialized in the member initialization "
322 if (init == void_type_node)
325 /* Get an lvalue for the data member. */
326 decl = build_class_member_access_expr (current_class_ref, member,
327 /*access_path=*/NULL_TREE,
328 /*preserve_reference=*/true);
329 if (decl == error_mark_node)
332 /* Deal with this here, as we will get confused if we try to call the
333 assignment op for an anonymous union. This can happen in a
334 synthesized copy constructor. */
335 if (ANON_AGGR_TYPE_P (type))
339 init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
340 finish_expr_stmt (init);
343 else if (TYPE_NEEDS_CONSTRUCTING (type)
344 || (init && TYPE_HAS_CONSTRUCTOR (type)))
347 && TREE_CODE (type) == ARRAY_TYPE
349 && TREE_CHAIN (init) == NULL_TREE
350 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
352 /* Initialization of one array from another. */
353 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
357 finish_expr_stmt (build_aggr_init (decl, init, 0));
361 if (init == NULL_TREE)
365 init = build_default_init (type, /*nelts=*/NULL_TREE);
366 if (TREE_CODE (type) == REFERENCE_TYPE)
368 ("default-initialization of `%#D', which has reference type",
371 /* member traversal: note it leaves init NULL */
372 else if (TREE_CODE (type) == REFERENCE_TYPE)
373 pedwarn ("uninitialized reference member `%D'", member);
374 else if (CP_TYPE_CONST_P (type))
375 pedwarn ("uninitialized member `%D' with `const' type `%T'",
378 else if (TREE_CODE (init) == TREE_LIST)
379 /* There was an explicit member initialization. Do some work
381 init = build_x_compound_expr_from_list (init, "member initializer");
384 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
387 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
391 expr = build_class_member_access_expr (current_class_ref, member,
392 /*access_path=*/NULL_TREE,
393 /*preserve_reference=*/false);
394 expr = build_delete (type, expr, sfk_complete_destructor,
395 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
397 if (expr != error_mark_node)
398 finish_eh_cleanup (expr);
402 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
403 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
406 build_field_list (tree t, tree list, int *uses_unions_p)
412 /* Note whether or not T is a union. */
413 if (TREE_CODE (t) == UNION_TYPE)
416 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
418 /* Skip CONST_DECLs for enumeration constants and so forth. */
419 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
422 /* Keep track of whether or not any fields are unions. */
423 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
426 /* For an anonymous struct or union, we must recursively
427 consider the fields of the anonymous type. They can be
428 directly initialized from the constructor. */
429 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
431 /* Add this field itself. Synthesized copy constructors
432 initialize the entire aggregate. */
433 list = tree_cons (fields, NULL_TREE, list);
434 /* And now add the fields in the anonymous aggregate. */
435 list = build_field_list (TREE_TYPE (fields), list,
438 /* Add this field. */
439 else if (DECL_NAME (fields))
440 list = tree_cons (fields, NULL_TREE, list);
446 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
447 a FIELD_DECL or BINFO in T that needs initialization. The
448 TREE_VALUE gives the initializer, or list of initializer arguments.
450 Return a TREE_LIST containing all of the initializations required
451 for T, in the order in which they should be performed. The output
452 list has the same format as the input. */
455 sort_mem_initializers (tree t, tree mem_inits)
464 /* Build up a list of initializations. The TREE_PURPOSE of entry
465 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
466 TREE_VALUE will be the constructor arguments, or NULL if no
467 explicit initialization was provided. */
468 sorted_inits = NULL_TREE;
469 /* Process the virtual bases. */
470 for (base = CLASSTYPE_VBASECLASSES (t); base; base = TREE_CHAIN (base))
471 sorted_inits = tree_cons (TREE_VALUE (base), NULL_TREE, sorted_inits);
472 /* Process the direct bases. */
473 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
475 base = BINFO_BASETYPE (TYPE_BINFO (t), i);
476 if (!TREE_VIA_VIRTUAL (base))
477 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
479 /* Process the non-static data members. */
480 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
481 /* Reverse the entire list of initializations, so that they are in
482 the order that they will actually be performed. */
483 sorted_inits = nreverse (sorted_inits);
485 /* If the user presented the initializers in an order different from
486 that in which they will actually occur, we issue a warning. Keep
487 track of the next subobject which can be explicitly initialized
488 without issuing a warning. */
489 next_subobject = sorted_inits;
491 /* Go through the explicit initializers, filling in TREE_PURPOSE in
493 for (init = mem_inits; init; init = TREE_CHAIN (init))
498 subobject = TREE_PURPOSE (init);
500 /* If the explicit initializers are in sorted order, then
501 SUBOBJECT will be NEXT_SUBOBJECT, or something following
503 for (subobject_init = next_subobject;
505 subobject_init = TREE_CHAIN (subobject_init))
506 if (TREE_PURPOSE (subobject_init) == subobject)
509 /* Issue a warning if the explicit initializer order does not
510 match that which will actually occur. */
511 if (warn_reorder && !subobject_init)
513 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
514 cp_warning_at ("`%D' will be initialized after",
515 TREE_PURPOSE (next_subobject));
517 warning ("base `%T' will be initialized after",
518 TREE_PURPOSE (next_subobject));
519 if (TREE_CODE (subobject) == FIELD_DECL)
520 cp_warning_at (" `%#D'", subobject);
522 warning (" base `%T'", subobject);
523 warning (" when initialized here");
526 /* Look again, from the beginning of the list. */
529 subobject_init = sorted_inits;
530 while (TREE_PURPOSE (subobject_init) != subobject)
531 subobject_init = TREE_CHAIN (subobject_init);
534 /* It is invalid to initialize the same subobject more than
536 if (TREE_VALUE (subobject_init))
538 if (TREE_CODE (subobject) == FIELD_DECL)
539 error ("multiple initializations given for `%D'", subobject);
541 error ("multiple initializations given for base `%T'",
545 /* Record the initialization. */
546 TREE_VALUE (subobject_init) = TREE_VALUE (init);
547 next_subobject = subobject_init;
552 If a ctor-initializer specifies more than one mem-initializer for
553 multiple members of the same union (including members of
554 anonymous unions), the ctor-initializer is ill-formed. */
557 tree last_field = NULL_TREE;
558 for (init = sorted_inits; init; init = TREE_CHAIN (init))
564 /* Skip uninitialized members and base classes. */
565 if (!TREE_VALUE (init)
566 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
568 /* See if this field is a member of a union, or a member of a
569 structure contained in a union, etc. */
570 field = TREE_PURPOSE (init);
571 for (field_type = DECL_CONTEXT (field);
572 !same_type_p (field_type, t);
573 field_type = TYPE_CONTEXT (field_type))
574 if (TREE_CODE (field_type) == UNION_TYPE)
576 /* If this field is not a member of a union, skip it. */
577 if (TREE_CODE (field_type) != UNION_TYPE)
580 /* It's only an error if we have two initializers for the same
588 /* See if LAST_FIELD and the field initialized by INIT are
589 members of the same union. If so, there's a problem,
590 unless they're actually members of the same structure
591 which is itself a member of a union. For example, given:
593 union { struct { int i; int j; }; };
595 initializing both `i' and `j' makes sense. */
596 field_type = DECL_CONTEXT (field);
600 tree last_field_type;
602 last_field_type = DECL_CONTEXT (last_field);
605 if (same_type_p (last_field_type, field_type))
607 if (TREE_CODE (field_type) == UNION_TYPE)
608 error ("initializations for multiple members of `%T'",
614 if (same_type_p (last_field_type, t))
617 last_field_type = TYPE_CONTEXT (last_field_type);
620 /* If we've reached the outermost class, then we're
622 if (same_type_p (field_type, t))
625 field_type = TYPE_CONTEXT (field_type);
636 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
637 is a TREE_LIST giving the explicit mem-initializer-list for the
638 constructor. The TREE_PURPOSE of each entry is a subobject (a
639 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
640 is a TREE_LIST giving the arguments to the constructor or
641 void_type_node for an empty list of arguments. */
644 emit_mem_initializers (tree mem_inits)
646 /* Sort the mem-initializers into the order in which the
647 initializations should be performed. */
648 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
650 in_base_initializer = 1;
652 /* Initialize base classes. */
654 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
656 tree subobject = TREE_PURPOSE (mem_inits);
657 tree arguments = TREE_VALUE (mem_inits);
659 /* If these initializations are taking place in a copy
660 constructor, the base class should probably be explicitly
662 if (extra_warnings && !arguments
663 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
664 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
665 warning ("base class `%#T' should be explicitly initialized in the "
667 BINFO_TYPE (subobject));
669 /* If an explicit -- but empty -- initializer list was present,
670 treat it just like default initialization at this point. */
671 if (arguments == void_type_node)
672 arguments = NULL_TREE;
674 /* Initialize the base. */
675 if (TREE_VIA_VIRTUAL (subobject))
676 construct_virtual_base (subobject, arguments);
681 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
683 expand_aggr_init_1 (subobject, NULL_TREE,
684 build_indirect_ref (base_addr, NULL),
687 expand_cleanup_for_base (subobject, NULL_TREE);
690 mem_inits = TREE_CHAIN (mem_inits);
692 in_base_initializer = 0;
694 /* Initialize the vptrs. */
695 initialize_vtbl_ptrs (current_class_ptr);
697 /* Initialize the data members. */
700 perform_member_init (TREE_PURPOSE (mem_inits),
701 TREE_VALUE (mem_inits));
702 mem_inits = TREE_CHAIN (mem_inits);
706 /* Returns the address of the vtable (i.e., the value that should be
707 assigned to the vptr) for BINFO. */
710 build_vtbl_address (tree binfo)
712 tree binfo_for = binfo;
715 if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
716 && BINFO_PRIMARY_P (binfo))
717 /* If this is a virtual primary base, then the vtable we want to store
718 is that for the base this is being used as the primary base of. We
719 can't simply skip the initialization, because we may be expanding the
720 inits of a subobject constructor where the virtual base layout
722 while (BINFO_PRIMARY_BASE_OF (binfo_for))
723 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
725 /* Figure out what vtable BINFO's vtable is based on, and mark it as
727 vtbl = get_vtbl_decl_for_binfo (binfo_for);
728 assemble_external (vtbl);
729 TREE_USED (vtbl) = 1;
731 /* Now compute the address to use when initializing the vptr. */
732 vtbl = BINFO_VTABLE (binfo_for);
733 if (TREE_CODE (vtbl) == VAR_DECL)
735 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
736 TREE_CONSTANT (vtbl) = 1;
742 /* This code sets up the virtual function tables appropriate for
743 the pointer DECL. It is a one-ply initialization.
745 BINFO is the exact type that DECL is supposed to be. In
746 multiple inheritance, this might mean "C's A" if C : A, B. */
749 expand_virtual_init (tree binfo, tree decl)
754 /* Compute the initializer for vptr. */
755 vtbl = build_vtbl_address (binfo);
757 /* We may get this vptr from a VTT, if this is a subobject
758 constructor or subobject destructor. */
759 vtt_index = BINFO_VPTR_INDEX (binfo);
765 /* Compute the value to use, when there's a VTT. */
766 vtt_parm = current_vtt_parm;
767 vtbl2 = build (PLUS_EXPR,
768 TREE_TYPE (vtt_parm),
771 vtbl2 = build1 (INDIRECT_REF, TREE_TYPE (vtbl), vtbl2);
773 /* The actual initializer is the VTT value only in the subobject
774 constructor. In maybe_clone_body we'll substitute NULL for
775 the vtt_parm in the case of the non-subobject constructor. */
776 vtbl = build (COND_EXPR,
778 build (EQ_EXPR, boolean_type_node,
779 current_in_charge_parm, integer_zero_node),
784 /* Compute the location of the vtpr. */
785 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
787 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
789 /* Assign the vtable to the vptr. */
790 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
791 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
794 /* If an exception is thrown in a constructor, those base classes already
795 constructed must be destroyed. This function creates the cleanup
796 for BINFO, which has just been constructed. If FLAG is non-NULL,
797 it is a DECL which is nonzero when this base needs to be
801 expand_cleanup_for_base (tree binfo, tree flag)
805 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
808 /* Call the destructor. */
809 expr = build_special_member_call (current_class_ref,
810 base_dtor_identifier,
813 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
815 expr = fold (build (COND_EXPR, void_type_node,
816 c_common_truthvalue_conversion (flag),
817 expr, integer_zero_node));
819 finish_eh_cleanup (expr);
822 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
826 construct_virtual_base (tree vbase, tree arguments)
833 /* If there are virtual base classes with destructors, we need to
834 emit cleanups to destroy them if an exception is thrown during
835 the construction process. These exception regions (i.e., the
836 period during which the cleanups must occur) begin from the time
837 the construction is complete to the end of the function. If we
838 create a conditional block in which to initialize the
839 base-classes, then the cleanup region for the virtual base begins
840 inside a block, and ends outside of that block. This situation
841 confuses the sjlj exception-handling code. Therefore, we do not
842 create a single conditional block, but one for each
843 initialization. (That way the cleanup regions always begin
844 in the outer block.) We trust the back-end to figure out
845 that the FLAG will not change across initializations, and
846 avoid doing multiple tests. */
847 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
848 inner_if_stmt = begin_if_stmt ();
849 finish_if_stmt_cond (flag, inner_if_stmt);
850 compound_stmt = begin_compound_stmt (/*has_no_scope=*/true);
852 /* Compute the location of the virtual base. If we're
853 constructing virtual bases, then we must be the most derived
854 class. Therefore, we don't have to look up the virtual base;
855 we already know where it is. */
856 exp = convert_to_base_statically (current_class_ref, vbase);
858 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
860 finish_compound_stmt (compound_stmt);
861 finish_then_clause (inner_if_stmt);
864 expand_cleanup_for_base (vbase, flag);
867 /* Find the context in which this FIELD can be initialized. */
870 initializing_context (tree field)
872 tree t = DECL_CONTEXT (field);
874 /* Anonymous union members can be initialized in the first enclosing
875 non-anonymous union context. */
876 while (t && ANON_AGGR_TYPE_P (t))
877 t = TYPE_CONTEXT (t);
881 /* Function to give error message if member initialization specification
882 is erroneous. FIELD is the member we decided to initialize.
883 TYPE is the type for which the initialization is being performed.
884 FIELD must be a member of TYPE.
886 MEMBER_NAME is the name of the member. */
889 member_init_ok_or_else (tree field, tree type, tree member_name)
891 if (field == error_mark_node)
895 error ("class `%T' does not have any field named `%D'", type,
899 if (TREE_CODE (field) == VAR_DECL)
901 error ("`%#D' is a static data member; it can only be "
902 "initialized at its definition",
906 if (TREE_CODE (field) != FIELD_DECL)
908 error ("`%#D' is not a non-static data member of `%T'",
912 if (initializing_context (field) != type)
914 error ("class `%T' does not have any field named `%D'", type,
922 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
923 is a _TYPE node or TYPE_DECL which names a base for that type.
924 Check the validity of NAME, and return either the base _TYPE, base
925 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
926 NULL_TREE and issue a diagnostic.
928 An old style unnamed direct single base construction is permitted,
929 where NAME is NULL. */
932 expand_member_init (tree name)
937 if (!current_class_ref)
942 /* This is an obsolete unnamed base class initializer. The
943 parser will already have warned about its use. */
944 switch (CLASSTYPE_N_BASECLASSES (current_class_type))
947 error ("unnamed initializer for `%T', which has no base classes",
951 basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
954 error ("unnamed initializer for `%T', which uses multiple inheritance",
959 else if (TYPE_P (name))
961 basetype = TYPE_MAIN_VARIANT (name);
962 name = TYPE_NAME (name);
964 else if (TREE_CODE (name) == TYPE_DECL)
965 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
967 basetype = NULL_TREE;
976 if (current_template_parms)
979 class_binfo = TYPE_BINFO (current_class_type);
980 direct_binfo = NULL_TREE;
981 virtual_binfo = NULL_TREE;
983 /* Look for a direct base. */
984 for (i = 0; i < BINFO_N_BASETYPES (class_binfo); ++i)
985 if (same_type_p (basetype,
986 TYPE_BINFO_BASETYPE (current_class_type, i)))
988 direct_binfo = BINFO_BASETYPE (class_binfo, i);
991 /* Look for a virtual base -- unless the direct base is itself
993 if (!direct_binfo || !TREE_VIA_VIRTUAL (direct_binfo))
996 = purpose_member (basetype,
997 CLASSTYPE_VBASECLASSES (current_class_type));
999 virtual_binfo = TREE_VALUE (virtual_binfo);
1002 /* [class.base.init]
1004 If a mem-initializer-id is ambiguous because it designates
1005 both a direct non-virtual base class and an inherited virtual
1006 base class, the mem-initializer is ill-formed. */
1007 if (direct_binfo && virtual_binfo)
1009 error ("'%D' is both a direct base and an indirect virtual base",
1014 if (!direct_binfo && !virtual_binfo)
1016 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1017 error ("type `%D' is not a direct or virtual base of `%T'",
1018 name, current_class_type);
1020 error ("type `%D' is not a direct base of `%T'",
1021 name, current_class_type);
1025 return direct_binfo ? direct_binfo : virtual_binfo;
1029 if (TREE_CODE (name) == IDENTIFIER_NODE)
1030 field = lookup_field (current_class_type, name, 1, false);
1034 if (member_init_ok_or_else (field, current_class_type, name))
1041 /* This is like `expand_member_init', only it stores one aggregate
1044 INIT comes in two flavors: it is either a value which
1045 is to be stored in EXP, or it is a parameter list
1046 to go to a constructor, which will operate on EXP.
1047 If INIT is not a parameter list for a constructor, then set
1048 LOOKUP_ONLYCONVERTING.
1049 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1050 the initializer, if FLAGS is 0, then it is the (init) form.
1051 If `init' is a CONSTRUCTOR, then we emit a warning message,
1052 explaining that such initializations are invalid.
1054 If INIT resolves to a CALL_EXPR which happens to return
1055 something of the type we are looking for, then we know
1056 that we can safely use that call to perform the
1059 The virtual function table pointer cannot be set up here, because
1060 we do not really know its type.
1062 This never calls operator=().
1064 When initializing, nothing is CONST.
1066 A default copy constructor may have to be used to perform the
1069 A constructor or a conversion operator may have to be used to
1070 perform the initialization, but not both, as it would be ambiguous. */
1073 build_aggr_init (tree exp, tree init, int flags)
1078 tree type = TREE_TYPE (exp);
1079 int was_const = TREE_READONLY (exp);
1080 int was_volatile = TREE_THIS_VOLATILE (exp);
1083 if (init == error_mark_node)
1084 return error_mark_node;
1086 TREE_READONLY (exp) = 0;
1087 TREE_THIS_VOLATILE (exp) = 0;
1089 if (init && TREE_CODE (init) != TREE_LIST)
1090 flags |= LOOKUP_ONLYCONVERTING;
1092 if (TREE_CODE (type) == ARRAY_TYPE)
1094 /* Must arrange to initialize each element of EXP
1095 from elements of INIT. */
1096 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1100 /* Handle bad initializers like:
1104 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1108 int main(int argc, char **argv) {
1109 COMPLEX zees(1.0, 0.0)[10];
1112 error ("bad array initializer");
1113 return error_mark_node;
1115 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1116 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1117 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1118 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1119 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1120 init && same_type_p (TREE_TYPE (init),
1122 TREE_READONLY (exp) = was_const;
1123 TREE_THIS_VOLATILE (exp) = was_volatile;
1124 TREE_TYPE (exp) = type;
1126 TREE_TYPE (init) = itype;
1130 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1131 /* Just know that we've seen something for this node. */
1132 TREE_USED (exp) = 1;
1134 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1135 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1136 destroy_temps = stmts_are_full_exprs_p ();
1137 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1138 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1139 init, LOOKUP_NORMAL|flags);
1140 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1141 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1142 TREE_TYPE (exp) = type;
1143 TREE_READONLY (exp) = was_const;
1144 TREE_THIS_VOLATILE (exp) = was_volatile;
1149 /* Like build_aggr_init, but not just for aggregates. */
1152 build_init (tree decl, tree init, int flags)
1156 if (IS_AGGR_TYPE (TREE_TYPE (decl))
1157 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1158 expr = build_aggr_init (decl, init, flags);
1160 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1166 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1168 tree type = TREE_TYPE (exp);
1171 /* It fails because there may not be a constructor which takes
1172 its own type as the first (or only parameter), but which does
1173 take other types via a conversion. So, if the thing initializing
1174 the expression is a unit element of type X, first try X(X&),
1175 followed by initialization by X. If neither of these work
1176 out, then look hard. */
1180 if (init && TREE_CODE (init) != TREE_LIST
1181 && (flags & LOOKUP_ONLYCONVERTING))
1183 /* Base subobjects should only get direct-initialization. */
1184 if (true_exp != exp)
1187 if (flags & DIRECT_BIND)
1188 /* Do nothing. We hit this in two cases: Reference initialization,
1189 where we aren't initializing a real variable, so we don't want
1190 to run a new constructor; and catching an exception, where we
1191 have already built up the constructor call so we could wrap it
1192 in an exception region. */;
1193 else if (TREE_CODE (init) == CONSTRUCTOR
1194 && TREE_HAS_CONSTRUCTOR (init))
1196 /* A brace-enclosed initializer for an aggregate. */
1197 my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1198 init = digest_init (type, init, (tree *)NULL);
1201 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1203 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1204 /* We need to protect the initialization of a catch parm with a
1205 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1206 around the TARGET_EXPR for the copy constructor. See
1207 initialize_handler_parm. */
1209 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1210 TREE_OPERAND (init, 0));
1211 TREE_TYPE (init) = void_type_node;
1214 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1215 TREE_SIDE_EFFECTS (init) = 1;
1216 finish_expr_stmt (init);
1220 if (init == NULL_TREE
1221 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1225 init = TREE_VALUE (parms);
1228 parms = build_tree_list (NULL_TREE, init);
1230 if (true_exp == exp)
1231 ctor_name = complete_ctor_identifier;
1233 ctor_name = base_ctor_identifier;
1235 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1236 if (TREE_SIDE_EFFECTS (rval))
1237 finish_expr_stmt (convert_to_void (rval, NULL));
1240 /* This function is responsible for initializing EXP with INIT
1243 BINFO is the binfo of the type for who we are performing the
1244 initialization. For example, if W is a virtual base class of A and B,
1246 If we are initializing B, then W must contain B's W vtable, whereas
1247 were we initializing C, W must contain C's W vtable.
1249 TRUE_EXP is nonzero if it is the true expression being initialized.
1250 In this case, it may be EXP, or may just contain EXP. The reason we
1251 need this is because if EXP is a base element of TRUE_EXP, we
1252 don't necessarily know by looking at EXP where its virtual
1253 baseclass fields should really be pointing. But we do know
1254 from TRUE_EXP. In constructors, we don't know anything about
1255 the value being initialized.
1257 FLAGS is just passed to `build_new_method_call'. See that function
1258 for its description. */
1261 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1263 tree type = TREE_TYPE (exp);
1265 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1266 my_friendly_assert (building_stmt_tree (), 20021010);
1268 /* Use a function returning the desired type to initialize EXP for us.
1269 If the function is a constructor, and its first argument is
1270 NULL_TREE, know that it was meant for us--just slide exp on
1271 in and expand the constructor. Constructors now come
1274 if (init && TREE_CODE (exp) == VAR_DECL
1275 && TREE_CODE (init) == CONSTRUCTOR
1276 && TREE_HAS_CONSTRUCTOR (init))
1278 /* If store_init_value returns NULL_TREE, the INIT has been
1279 record in the DECL_INITIAL for EXP. That means there's
1280 nothing more we have to do. */
1281 init = store_init_value (exp, init);
1283 finish_expr_stmt (init);
1287 /* We know that expand_default_init can handle everything we want
1289 expand_default_init (binfo, true_exp, exp, init, flags);
1292 /* Report an error if TYPE is not a user-defined, aggregate type. If
1293 OR_ELSE is nonzero, give an error message. */
1296 is_aggr_type (tree type, int or_else)
1298 if (type == error_mark_node)
1301 if (! IS_AGGR_TYPE (type)
1302 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1303 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1306 error ("`%T' is not an aggregate type", type);
1312 /* Like is_aggr_typedef, but returns typedef if successful. */
1315 get_aggr_from_typedef (tree name, int or_else)
1319 if (name == error_mark_node)
1322 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1323 type = IDENTIFIER_TYPE_VALUE (name);
1327 error ("`%T' fails to be an aggregate typedef", name);
1331 if (! IS_AGGR_TYPE (type)
1332 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1333 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1336 error ("type `%T' is of non-aggregate type", type);
1343 get_type_value (tree name)
1345 if (name == error_mark_node)
1348 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1349 return IDENTIFIER_TYPE_VALUE (name);
1354 /* Build a reference to a member of an aggregate. This is not a C++
1355 `&', but really something which can have its address taken, and
1356 then act as a pointer to member, for example TYPE :: FIELD can have
1357 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1358 this expression is the operand of "&".
1360 @@ Prints out lousy diagnostics for operator <typename>
1363 @@ This function should be rewritten and placed in search.c. */
1366 build_offset_ref (tree type, tree name, bool address_p)
1370 tree basebinfo = NULL_TREE;
1371 tree orig_name = name;
1373 /* class templates can come in as TEMPLATE_DECLs here. */
1374 if (TREE_CODE (name) == TEMPLATE_DECL)
1377 if (processing_template_decl || uses_template_parms (type))
1378 return build_min_nt (SCOPE_REF, type, name);
1380 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1382 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1383 something like `a.template f<int>' or the like. For the most
1384 part, we treat this just like a.f. We do remember, however,
1385 the template-id that was used. */
1386 name = TREE_OPERAND (orig_name, 0);
1389 name = DECL_NAME (name);
1392 if (TREE_CODE (name) == COMPONENT_REF)
1393 name = TREE_OPERAND (name, 1);
1394 if (TREE_CODE (name) == OVERLOAD)
1395 name = DECL_NAME (OVL_CURRENT (name));
1398 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1401 if (type == NULL_TREE)
1402 return error_mark_node;
1404 /* Handle namespace names fully here. */
1405 if (TREE_CODE (type) == NAMESPACE_DECL)
1407 tree t = lookup_namespace_name (type, name);
1408 if (t == error_mark_node)
1410 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1411 /* Reconstruct the TEMPLATE_ID_EXPR. */
1412 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1413 t, TREE_OPERAND (orig_name, 1));
1414 if (! type_unknown_p (t))
1417 t = convert_from_reference (t);
1422 if (! is_aggr_type (type, 1))
1423 return error_mark_node;
1425 if (TREE_CODE (name) == BIT_NOT_EXPR)
1427 if (! check_dtor_name (type, name))
1428 error ("qualified type `%T' does not match destructor name `~%T'",
1429 type, TREE_OPERAND (name, 0));
1430 name = dtor_identifier;
1433 if (!COMPLETE_TYPE_P (complete_type (type))
1434 && !TYPE_BEING_DEFINED (type))
1436 error ("incomplete type `%T' does not have member `%D'", type,
1438 return error_mark_node;
1441 decl = maybe_dummy_object (type, &basebinfo);
1443 if (BASELINK_P (name) || DECL_P (name))
1447 member = lookup_member (basebinfo, name, 1, 0);
1449 if (member == error_mark_node)
1450 return error_mark_node;
1455 error ("`%D' is not a member of type `%T'", name, type);
1456 return error_mark_node;
1459 if (TREE_CODE (member) == TYPE_DECL)
1461 TREE_USED (member) = 1;
1464 /* static class members and class-specific enum
1465 values can be returned without further ado. */
1466 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1469 return convert_from_reference (member);
1472 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1474 error ("invalid pointer to bit-field `%D'", member);
1475 return error_mark_node;
1478 /* A lot of this logic is now handled in lookup_member. */
1479 if (BASELINK_P (member))
1481 /* Go from the TREE_BASELINK to the member function info. */
1482 tree fnfields = member;
1483 tree t = BASELINK_FUNCTIONS (fnfields);
1485 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1487 /* The FNFIELDS are going to contain functions that aren't
1488 necessarily templates, and templates that don't
1489 necessarily match the explicit template parameters. We
1490 save all the functions, and the explicit parameters, and
1491 then figure out exactly what to instantiate with what
1492 arguments in instantiate_type. */
1494 if (TREE_CODE (t) != OVERLOAD)
1495 /* The code in instantiate_type which will process this
1496 expects to encounter OVERLOADs, not raw functions. */
1497 t = ovl_cons (t, NULL_TREE);
1499 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1500 TREE_OPERAND (orig_name, 1));
1501 t = build (OFFSET_REF, unknown_type_node, decl, t);
1503 PTRMEM_OK_P (t) = 1;
1508 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1510 /* Get rid of a potential OVERLOAD around it. */
1511 t = OVL_CURRENT (t);
1513 /* Unique functions are handled easily. */
1515 /* For non-static member of base class, we need a special rule
1516 for access checking [class.protected]:
1518 If the access is to form a pointer to member, the
1519 nested-name-specifier shall name the derived class
1520 (or any class derived from that class). */
1521 if (address_p && DECL_P (t)
1522 && DECL_NONSTATIC_MEMBER_P (t))
1523 perform_or_defer_access_check (TYPE_BINFO (type), t);
1525 perform_or_defer_access_check (basebinfo, t);
1528 if (DECL_STATIC_FUNCTION_P (t))
1534 TREE_TYPE (fnfields) = unknown_type_node;
1538 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1539 /* We need additional test besides the one in
1540 check_accessibility_of_qualified_id in case it is
1541 a pointer to non-static member. */
1542 perform_or_defer_access_check (TYPE_BINFO (type), member);
1546 /* If MEMBER is non-static, then the program has fallen afoul of
1549 An id-expression that denotes a nonstatic data member or
1550 nonstatic member function of a class can only be used:
1552 -- as part of a class member access (_expr.ref_) in which the
1553 object-expression refers to the member's class or a class
1554 derived from that class, or
1556 -- to form a pointer to member (_expr.unary.op_), or
1558 -- in the body of a nonstatic member function of that class or
1559 of a class derived from that class (_class.mfct.nonstatic_), or
1561 -- in a mem-initializer for a constructor for that class or for
1562 a class derived from that class (_class.base.init_). */
1563 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1565 /* Build a representation of a the qualified name suitable
1566 for use as the operand to "&" -- even though the "&" is
1567 not actually present. */
1568 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1569 /* In Microsoft mode, treat a non-static member function as if
1570 it were a pointer-to-member. */
1571 if (flag_ms_extensions)
1573 PTRMEM_OK_P (member) = 1;
1574 return build_unary_op (ADDR_EXPR, member, 0);
1576 error ("invalid use of non-static member function `%D'",
1577 TREE_OPERAND (member, 1));
1580 else if (TREE_CODE (member) == FIELD_DECL)
1582 error ("invalid use of non-static data member `%D'", member);
1583 return error_mark_node;
1588 /* In member functions, the form `type::name' is no longer
1589 equivalent to `this->type::name', at least not until
1590 resolve_offset_ref. */
1591 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1592 PTRMEM_OK_P (member) = 1;
1596 /* If DECL is a `const' declaration, and its value is a known
1597 constant, then return that value. */
1600 decl_constant_value (tree decl)
1602 /* When we build a COND_EXPR, we don't know whether it will be used
1603 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1604 to replace the second and third operands with their
1605 initializers. So, we do that here. */
1606 if (TREE_CODE (decl) == COND_EXPR)
1611 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1612 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1614 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1615 return build (COND_EXPR,
1617 TREE_OPERAND (decl, 0), d1, d2);
1621 && (/* Enumeration constants are constant. */
1622 TREE_CODE (decl) == CONST_DECL
1623 /* And so are variables with a 'const' type -- unless they
1624 are also 'volatile'. */
1625 || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1626 && TREE_CODE (decl) != PARM_DECL
1627 && DECL_INITIAL (decl)
1628 && DECL_INITIAL (decl) != error_mark_node
1629 /* This is invalid if initial value is not constant.
1630 If it has either a function call, a memory reference,
1631 or a variable, then re-evaluating it could give different results. */
1632 && TREE_CONSTANT (DECL_INITIAL (decl))
1633 /* Check for cases where this is sub-optimal, even though valid. */
1634 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1635 return DECL_INITIAL (decl);
1639 /* Common subroutines of build_new and build_vec_delete. */
1641 /* Call the global __builtin_delete to delete ADDR. */
1644 build_builtin_delete_call (tree addr)
1646 mark_used (global_delete_fndecl);
1647 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1650 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1651 (which needs to go through some sort of groktypename) or it
1652 is the name of the class we are newing. INIT is an initialization value.
1653 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1654 If INIT is void_type_node, it means do *not* call a constructor
1657 For types with constructors, the data returned is initialized
1658 by the appropriate constructor.
1660 Whether the type has a constructor or not, if it has a pointer
1661 to a virtual function table, then that pointer is set up
1664 Unless I am mistaken, a call to new () will return initialized
1665 data regardless of whether the constructor itself is private or
1666 not. NOPE; new fails if the constructor is private (jcm).
1668 Note that build_new does nothing to assure that any special
1669 alignment requirements of the type are met. Rather, it leaves
1670 it up to malloc to do the right thing. Otherwise, folding to
1671 the right alignment cal cause problems if the user tries to later
1672 free the memory returned by `new'.
1674 PLACEMENT is the `placement' list for user-defined operator new (). */
1677 build_new (tree placement, tree decl, tree init, int use_global_new)
1680 tree nelts = NULL_TREE, t;
1683 if (decl == error_mark_node)
1684 return error_mark_node;
1686 if (TREE_CODE (decl) == TREE_LIST)
1688 tree absdcl = TREE_VALUE (decl);
1689 tree last_absdcl = NULL_TREE;
1691 if (current_function_decl
1692 && DECL_CONSTRUCTOR_P (current_function_decl))
1693 my_friendly_assert (immediate_size_expand == 0, 19990926);
1695 nelts = integer_one_node;
1697 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1699 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1701 last_absdcl = absdcl;
1702 absdcl = TREE_OPERAND (absdcl, 0);
1705 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1707 /* Probably meant to be a vec new. */
1710 while (TREE_OPERAND (absdcl, 0)
1711 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1713 last_absdcl = absdcl;
1714 absdcl = TREE_OPERAND (absdcl, 0);
1718 this_nelts = TREE_OPERAND (absdcl, 1);
1719 if (this_nelts != error_mark_node)
1721 if (this_nelts == NULL_TREE)
1722 error ("new of array type fails to specify size");
1723 else if (processing_template_decl)
1726 absdcl = TREE_OPERAND (absdcl, 0);
1730 if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1733 pedwarn ("size in array new must have integral type");
1735 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1736 absdcl = TREE_OPERAND (absdcl, 0);
1737 if (this_nelts == integer_zero_node)
1739 warning ("zero size array reserves no space");
1740 nelts = integer_zero_node;
1743 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1747 nelts = integer_zero_node;
1751 TREE_OPERAND (last_absdcl, 0) = absdcl;
1753 TREE_VALUE (decl) = absdcl;
1755 type = groktypename (decl);
1756 if (! type || type == error_mark_node)
1757 return error_mark_node;
1759 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1761 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1763 /* An aggregate type. */
1764 type = IDENTIFIER_TYPE_VALUE (decl);
1765 decl = TYPE_MAIN_DECL (type);
1769 /* A builtin type. */
1770 decl = lookup_name (decl, 1);
1771 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1772 type = TREE_TYPE (decl);
1775 else if (TREE_CODE (decl) == TYPE_DECL)
1777 type = TREE_TYPE (decl);
1782 decl = TYPE_MAIN_DECL (type);
1785 if (processing_template_decl)
1788 t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
1789 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
1794 rval = build_min (NEW_EXPR, build_pointer_type (type),
1795 placement, t, init);
1796 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1800 /* ``A reference cannot be created by the new operator. A reference
1801 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1802 returned by new.'' ARM 5.3.3 */
1803 if (TREE_CODE (type) == REFERENCE_TYPE)
1805 error ("new cannot be applied to a reference type");
1806 type = TREE_TYPE (type);
1809 if (TREE_CODE (type) == FUNCTION_TYPE)
1811 error ("new cannot be applied to a function type");
1812 return error_mark_node;
1815 /* When the object being created is an array, the new-expression yields a
1816 pointer to the initial element (if any) of the array. For example,
1817 both new int and new int[10] return an int*. 5.3.4. */
1818 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
1820 nelts = array_type_nelts_top (type);
1822 type = TREE_TYPE (type);
1826 t = build_nt (ARRAY_REF, type, nelts);
1830 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
1831 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1832 TREE_SIDE_EFFECTS (rval) = 1;
1833 rval = build_new_1 (rval);
1834 if (rval == error_mark_node)
1835 return error_mark_node;
1837 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1838 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1839 TREE_NO_UNUSED_WARNING (rval) = 1;
1844 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1847 build_java_class_ref (tree type)
1849 tree name = NULL_TREE, class_decl;
1850 static tree CL_suffix = NULL_TREE;
1851 if (CL_suffix == NULL_TREE)
1852 CL_suffix = get_identifier("class$");
1853 if (jclass_node == NULL_TREE)
1855 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1856 if (jclass_node == NULL_TREE)
1857 fatal_error ("call to Java constructor, while `jclass' undefined");
1859 jclass_node = TREE_TYPE (jclass_node);
1862 /* Mangle the class$ field. */
1865 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1866 if (DECL_NAME (field) == CL_suffix)
1868 mangle_decl (field);
1869 name = DECL_ASSEMBLER_NAME (field);
1873 internal_error ("can't find class$");
1876 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1877 if (class_decl == NULL_TREE)
1879 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1880 TREE_STATIC (class_decl) = 1;
1881 DECL_EXTERNAL (class_decl) = 1;
1882 TREE_PUBLIC (class_decl) = 1;
1883 DECL_ARTIFICIAL (class_decl) = 1;
1884 DECL_IGNORED_P (class_decl) = 1;
1885 pushdecl_top_level (class_decl);
1886 make_decl_rtl (class_decl, NULL);
1891 /* Returns the size of the cookie to use when allocating an array
1892 whose elements have the indicated TYPE. Assumes that it is already
1893 known that a cookie is needed. */
1896 get_cookie_size (tree type)
1900 /* We need to allocate an additional max (sizeof (size_t), alignof
1901 (true_type)) bytes. */
1905 sizetype_size = size_in_bytes (sizetype);
1906 type_align = size_int (TYPE_ALIGN_UNIT (type));
1907 if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
1908 cookie_size = sizetype_size;
1910 cookie_size = type_align;
1915 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1916 value is immediately handed to expand_expr. */
1919 build_new_1 (tree exp)
1921 tree placement, init;
1922 tree true_type, size, rval, t;
1923 /* The type of the new-expression. (This type is always a pointer
1926 /* The type pointed to by POINTER_TYPE. */
1928 /* The type being allocated. For "new T[...]" this will be an
1931 /* A pointer type pointing to to the FULL_TYPE. */
1932 tree full_pointer_type;
1933 tree outer_nelts = NULL_TREE;
1934 tree nelts = NULL_TREE;
1935 tree alloc_call, alloc_expr;
1936 /* The address returned by the call to "operator new". This node is
1937 a VAR_DECL and is therefore reusable. */
1940 tree cookie_expr, init_expr;
1942 enum tree_code code;
1943 int nothrow, check_new;
1944 /* Nonzero if the user wrote `::new' rather than just `new'. */
1945 int globally_qualified_p;
1946 int use_java_new = 0;
1947 /* If non-NULL, the number of extra bytes to allocate at the
1948 beginning of the storage allocated for an array-new expression in
1949 order to store the number of elements. */
1950 tree cookie_size = NULL_TREE;
1951 /* True if the function we are calling is a placement allocation
1953 bool placement_allocation_fn_p;
1954 tree args = NULL_TREE;
1955 /* True if the storage must be initialized, either by a constructor
1956 or due to an explicit new-initializer. */
1957 bool is_initialized;
1958 /* The address of the thing allocated, not including any cookie. In
1959 particular, if an array cookie is in use, DATA_ADDR is the
1960 address of the first array element. This node is a VAR_DECL, and
1961 is therefore reusable. */
1964 placement = TREE_OPERAND (exp, 0);
1965 type = TREE_OPERAND (exp, 1);
1966 init = TREE_OPERAND (exp, 2);
1967 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1969 if (TREE_CODE (type) == ARRAY_REF)
1972 nelts = outer_nelts = TREE_OPERAND (type, 1);
1973 type = TREE_OPERAND (type, 0);
1975 /* Use an incomplete array type to avoid VLA headaches. */
1976 full_type = build_cplus_array_type (type, NULL_TREE);
1983 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1985 /* If our base type is an array, then make sure we know how many elements
1987 while (TREE_CODE (true_type) == ARRAY_TYPE)
1989 tree this_nelts = array_type_nelts_top (true_type);
1990 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1991 true_type = TREE_TYPE (true_type);
1994 if (!complete_type_or_else (true_type, exp))
1995 return error_mark_node;
1997 if (TREE_CODE (true_type) == VOID_TYPE)
1999 error ("invalid type `void' for new");
2000 return error_mark_node;
2003 if (abstract_virtuals_error (NULL_TREE, true_type))
2004 return error_mark_node;
2006 is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
2007 if (CP_TYPE_CONST_P (true_type) && !is_initialized)
2009 error ("uninitialized const in `new' of `%#T'", true_type);
2010 return error_mark_node;
2013 size = size_in_bytes (true_type);
2015 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2017 /* Allocate the object. */
2018 if (! placement && TYPE_FOR_JAVA (true_type))
2020 tree class_addr, alloc_decl;
2021 tree class_decl = build_java_class_ref (true_type);
2022 static const char alloc_name[] = "_Jv_AllocObject";
2024 if (!get_global_value_if_present (get_identifier (alloc_name),
2027 error ("call to Java constructor with `%s' undefined", alloc_name);
2028 return error_mark_node;
2030 else if (really_overloaded_fn (alloc_decl))
2032 error ("`%D' should never be overloaded", alloc_decl);
2033 return error_mark_node;
2035 alloc_decl = OVL_CURRENT (alloc_decl);
2036 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2037 alloc_call = (build_function_call
2039 build_tree_list (NULL_TREE, class_addr)));
2046 fnname = ansi_opname (code);
2048 if (!globally_qualified_p
2049 && CLASS_TYPE_P (true_type)
2051 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2052 : TYPE_HAS_NEW_OPERATOR (true_type)))
2054 /* Use a class-specific operator new. */
2055 /* If a cookie is required, add some extra space. */
2056 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2058 cookie_size = get_cookie_size (true_type);
2059 size = size_binop (PLUS_EXPR, size, cookie_size);
2061 /* Create the argument list. */
2062 args = tree_cons (NULL_TREE, size, placement);
2063 /* Do name-lookup to find the appropriate operator. */
2064 fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
2065 if (TREE_CODE (fns) == TREE_LIST)
2067 error ("request for member `%D' is ambiguous", fnname);
2068 print_candidates (fns);
2069 return error_mark_node;
2071 alloc_call = build_new_method_call (build_dummy_object (true_type),
2073 /*conversion_path=*/NULL_TREE,
2078 /* Use a global operator new. */
2079 /* See if a cookie might be required. */
2080 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2081 cookie_size = get_cookie_size (true_type);
2083 cookie_size = NULL_TREE;
2085 alloc_call = build_operator_new_call (fnname, placement,
2086 &size, &cookie_size);
2090 if (alloc_call == error_mark_node)
2091 return error_mark_node;
2093 /* In the simple case, we can stop now. */
2094 pointer_type = build_pointer_type (type);
2095 if (!cookie_size && !is_initialized)
2096 return build_nop (pointer_type, alloc_call);
2098 /* While we're working, use a pointer to the type we've actually
2099 allocated. Store the result of the call in a variable so that we
2100 can use it more than once. */
2101 full_pointer_type = build_pointer_type (full_type);
2102 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2103 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2105 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2106 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2107 alloc_call = TREE_OPERAND (alloc_call, 1);
2108 alloc_fn = get_callee_fndecl (alloc_call);
2109 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2111 /* Now, check to see if this function is actually a placement
2112 allocation function. This can happen even when PLACEMENT is NULL
2113 because we might have something like:
2115 struct S { void* operator new (size_t, int i = 0); };
2117 A call to `new S' will get this allocation function, even though
2118 there is no explicit placement argument. If there is more than
2119 one argument, or there are variable arguments, then this is a
2120 placement allocation function. */
2121 placement_allocation_fn_p
2122 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2123 || varargs_function_p (alloc_fn));
2125 /* Preevaluate the placement args so that we don't reevaluate them for a
2126 placement delete. */
2127 if (placement_allocation_fn_p)
2129 tree inits = NULL_TREE;
2130 t = TREE_CHAIN (TREE_OPERAND (alloc_call, 1));
2131 for (; t; t = TREE_CHAIN (t))
2132 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2135 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2137 inits = build (COMPOUND_EXPR, void_type_node, inits, init);
2142 alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2146 /* unless an allocation function is declared with an empty excep-
2147 tion-specification (_except.spec_), throw(), it indicates failure to
2148 allocate storage by throwing a bad_alloc exception (clause _except_,
2149 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2150 cation function is declared with an empty exception-specification,
2151 throw(), it returns null to indicate failure to allocate storage and a
2152 non-null pointer otherwise.
2154 So check for a null exception spec on the op new we just called. */
2156 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2157 check_new = (flag_check_new || nothrow) && ! use_java_new;
2163 /* Adjust so we're pointing to the start of the object. */
2164 data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2165 alloc_node, cookie_size));
2167 /* Store the number of bytes allocated so that we can know how
2168 many elements to destroy later. We use the last sizeof
2169 (size_t) bytes to store the number of elements. */
2170 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2171 data_addr, size_in_bytes (sizetype));
2172 cookie = build_indirect_ref (cookie, NULL);
2174 cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2175 data_addr = TARGET_EXPR_SLOT (data_addr);
2179 cookie_expr = NULL_TREE;
2180 data_addr = alloc_node;
2183 /* Now initialize the allocated object. */
2186 init_expr = build_indirect_ref (data_addr, NULL);
2188 if (init == void_zero_node)
2189 init = build_default_init (full_type, nelts);
2190 else if (init && pedantic && has_array)
2191 pedwarn ("ISO C++ forbids initialization in array new");
2195 = build_vec_init (init_expr,
2196 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2198 init, /*from_array=*/0);
2199 else if (TYPE_NEEDS_CONSTRUCTING (type))
2200 init_expr = build_special_member_call (init_expr,
2201 complete_ctor_identifier,
2202 init, TYPE_BINFO (true_type),
2206 /* We are processing something like `new int (10)', which
2207 means allocate an int, and initialize it with 10. */
2209 if (TREE_CODE (init) == TREE_LIST)
2210 init = build_x_compound_expr_from_list (init, "new initializer");
2212 else if (TREE_CODE (init) == CONSTRUCTOR
2213 && TREE_TYPE (init) == NULL_TREE)
2215 pedwarn ("ISO C++ forbids aggregate initializer to new");
2216 init = digest_init (type, init, 0);
2219 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2222 if (init_expr == error_mark_node)
2223 return error_mark_node;
2225 /* If any part of the object initialization terminates by throwing an
2226 exception and a suitable deallocation function can be found, the
2227 deallocation function is called to free the memory in which the
2228 object was being constructed, after which the exception continues
2229 to propagate in the context of the new-expression. If no
2230 unambiguous matching deallocation function can be found,
2231 propagating the exception does not cause the object's memory to be
2233 if (flag_exceptions && ! use_java_new)
2235 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2238 /* The Standard is unclear here, but the right thing to do
2239 is to use the same method for finding deallocation
2240 functions that we use for finding allocation functions. */
2241 cleanup = build_op_delete_call (dcode, alloc_node, size,
2242 globally_qualified_p,
2243 (placement_allocation_fn_p
2244 ? alloc_call : NULL_TREE));
2246 /* Ack! First we allocate the memory. Then we set our sentry
2247 variable to true, and expand a cleanup that deletes the memory
2248 if sentry is true. Then we run the constructor, and finally
2251 It would be nice to be able to handle this without the sentry
2252 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2253 work. We allocate the space first, so if there are any
2254 temporaries with cleanups in the constructor args we need this
2255 EH region to extend until end of full-expression to preserve
2258 If the backend had some mechanism so that we could force the
2259 allocation to be expanded after all the other args to the
2260 constructor, that would fix the nesting problem and we could
2261 do away with this complexity. But that would complicate other
2262 things; in particular, it would make it difficult to bail out
2263 if the allocation function returns null. Er, no, it wouldn't;
2264 we just don't run the constructor. The standard says it's
2265 unspecified whether or not the args are evaluated.
2267 FIXME FIXME FIXME inline invisible refs as refs. That way we
2268 can preevaluate value parameters. */
2272 tree end, sentry, begin;
2274 begin = get_target_expr (boolean_true_node);
2275 CLEANUP_EH_ONLY (begin) = 1;
2277 sentry = TARGET_EXPR_SLOT (begin);
2279 TARGET_EXPR_CLEANUP (begin)
2280 = build (COND_EXPR, void_type_node, sentry,
2281 cleanup, void_zero_node);
2283 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2284 sentry, boolean_false_node);
2287 = build (COMPOUND_EXPR, void_type_node, begin,
2288 build (COMPOUND_EXPR, void_type_node, init_expr,
2294 init_expr = NULL_TREE;
2296 /* Now build up the return value in reverse order. */
2301 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2303 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2305 if (rval == alloc_node)
2306 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2307 and return the call (which doesn't need to be adjusted). */
2308 rval = TARGET_EXPR_INITIAL (alloc_expr);
2313 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2315 rval = build_conditional_expr (ifexp, rval, alloc_node);
2318 /* Perform the allocation before anything else, so that ALLOC_NODE
2319 has been initialized before we start using it. */
2320 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2323 /* Convert to the final type. */
2324 rval = build_nop (pointer_type, rval);
2326 /* A new-expression is never an lvalue. */
2327 if (real_lvalue_p (rval))
2328 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2334 build_vec_delete_1 (tree base, tree maxindex, tree type,
2335 special_function_kind auto_delete_vec, int use_global_delete)
2338 tree ptype = build_pointer_type (type = complete_type (type));
2339 tree size_exp = size_in_bytes (type);
2341 /* Temporary variables used by the loop. */
2342 tree tbase, tbase_init;
2344 /* This is the body of the loop that implements the deletion of a
2345 single element, and moves temp variables to next elements. */
2348 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2351 /* This is the thing that governs what to do after the loop has run. */
2352 tree deallocate_expr = 0;
2354 /* This is the BIND_EXPR which holds the outermost iterator of the
2355 loop. It is convenient to set this variable up and test it before
2356 executing any other code in the loop.
2357 This is also the containing expression returned by this function. */
2358 tree controller = NULL_TREE;
2360 /* We should only have 1-D arrays here. */
2361 if (TREE_CODE (type) == ARRAY_TYPE)
2364 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2367 /* The below is short by the cookie size. */
2368 virtual_size = size_binop (MULT_EXPR, size_exp,
2369 convert (sizetype, maxindex));
2371 tbase = create_temporary_var (ptype);
2372 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2373 fold (build (PLUS_EXPR, ptype,
2376 DECL_REGISTER (tbase) = 1;
2377 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2378 TREE_SIDE_EFFECTS (controller) = 1;
2380 body = build (EXIT_EXPR, void_type_node,
2381 build (EQ_EXPR, boolean_type_node, base, tbase));
2382 body = build_compound_expr
2383 (body, build_modify_expr (tbase, NOP_EXPR,
2384 build (MINUS_EXPR, ptype, tbase, size_exp)));
2385 body = build_compound_expr
2386 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2387 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2389 loop = build (LOOP_EXPR, void_type_node, body);
2390 loop = build_compound_expr (tbase_init, loop);
2393 /* If the delete flag is one, or anything else with the low bit set,
2394 delete the storage. */
2395 if (auto_delete_vec != sfk_base_destructor)
2399 /* The below is short by the cookie size. */
2400 virtual_size = size_binop (MULT_EXPR, size_exp,
2401 convert (sizetype, maxindex));
2403 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2410 cookie_size = get_cookie_size (type);
2412 = cp_convert (ptype,
2413 cp_build_binary_op (MINUS_EXPR,
2414 cp_convert (string_type_node,
2417 /* True size with header. */
2418 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2421 if (auto_delete_vec == sfk_deleting_destructor)
2422 deallocate_expr = build_x_delete (base_tbd,
2423 2 | use_global_delete,
2428 if (!deallocate_expr)
2431 body = deallocate_expr;
2433 body = build_compound_expr (body, deallocate_expr);
2436 body = integer_zero_node;
2438 /* Outermost wrapper: If pointer is null, punt. */
2439 body = fold (build (COND_EXPR, void_type_node,
2440 fold (build (NE_EXPR, boolean_type_node, base,
2441 convert (TREE_TYPE (base),
2442 integer_zero_node))),
2443 body, integer_zero_node));
2444 body = build1 (NOP_EXPR, void_type_node, body);
2448 TREE_OPERAND (controller, 1) = body;
2452 if (TREE_CODE (base) == SAVE_EXPR)
2453 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2454 body = build (COMPOUND_EXPR, void_type_node, base, body);
2456 return convert_to_void (body, /*implicit=*/NULL);
2459 /* Create an unnamed variable of the indicated TYPE. */
2462 create_temporary_var (tree type)
2466 decl = build_decl (VAR_DECL, NULL_TREE, type);
2467 TREE_USED (decl) = 1;
2468 DECL_ARTIFICIAL (decl) = 1;
2469 DECL_SOURCE_LOCATION (decl) = input_location;
2470 DECL_IGNORED_P (decl) = 1;
2471 DECL_CONTEXT (decl) = current_function_decl;
2476 /* Create a new temporary variable of the indicated TYPE, initialized
2479 It is not entered into current_binding_level, because that breaks
2480 things when it comes time to do final cleanups (which take place
2481 "outside" the binding contour of the function). */
2484 get_temp_regvar (tree type, tree init)
2488 decl = create_temporary_var (type);
2489 add_decl_stmt (decl);
2491 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2496 /* `build_vec_init' returns tree structure that performs
2497 initialization of a vector of aggregate types.
2499 BASE is a reference to the vector, of ARRAY_TYPE.
2500 MAXINDEX is the maximum index of the array (one less than the
2501 number of elements). It is only used if
2502 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2503 INIT is the (possibly NULL) initializer.
2505 FROM_ARRAY is 0 if we should init everything with INIT
2506 (i.e., every element initialized from INIT).
2507 FROM_ARRAY is 1 if we should index into INIT in parallel
2508 with initialization of DECL.
2509 FROM_ARRAY is 2 if we should index into INIT in parallel,
2510 but use assignment instead of initialization. */
2513 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2516 tree base2 = NULL_TREE;
2518 tree itype = NULL_TREE;
2520 /* The type of the array. */
2521 tree atype = TREE_TYPE (base);
2522 /* The type of an element in the array. */
2523 tree type = TREE_TYPE (atype);
2524 /* The type of a pointer to an element in the array. */
2529 tree try_block = NULL_TREE;
2530 tree try_body = NULL_TREE;
2531 int num_initialized_elts = 0;
2534 if (TYPE_DOMAIN (atype))
2535 maxindex = array_type_nelts (atype);
2537 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2538 return error_mark_node;
2542 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2543 : !TYPE_NEEDS_CONSTRUCTING (type))
2544 && ((TREE_CODE (init) == CONSTRUCTOR
2545 /* Don't do this if the CONSTRUCTOR might contain something
2546 that might throw and require us to clean up. */
2547 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2548 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2551 /* Do non-default initialization of POD arrays resulting from
2552 brace-enclosed initializers. In this case, digest_init and
2553 store_constructor will handle the semantics for us. */
2555 stmt_expr = build (INIT_EXPR, atype, base, init);
2559 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2560 ptype = build_pointer_type (type);
2561 size = size_in_bytes (type);
2562 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2563 base = cp_convert (ptype, decay_conversion (base));
2565 /* The code we are generating looks like:
2569 ptrdiff_t iterator = maxindex;
2571 for (; iterator != -1; --iterator) {
2572 ... initialize *t1 ...
2576 ... destroy elements that were constructed ...
2581 We can omit the try and catch blocks if we know that the
2582 initialization will never throw an exception, or if the array
2583 elements do not have destructors. We can omit the loop completely if
2584 the elements of the array do not have constructors.
2586 We actually wrap the entire body of the above in a STMT_EXPR, for
2589 When copying from array to another, when the array elements have
2590 only trivial copy constructors, we should use __builtin_memcpy
2591 rather than generating a loop. That way, we could take advantage
2592 of whatever cleverness the back-end has for dealing with copies
2593 of blocks of memory. */
2595 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2596 destroy_temps = stmts_are_full_exprs_p ();
2597 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2598 rval = get_temp_regvar (ptype, base);
2599 base = get_temp_regvar (ptype, rval);
2600 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2602 /* Protect the entire array initialization so that we can destroy
2603 the partially constructed array if an exception is thrown.
2604 But don't do this if we're assigning. */
2605 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2608 try_block = begin_try_block ();
2609 try_body = begin_compound_stmt (/*has_no_scope=*/true);
2612 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2614 /* Do non-default initialization of non-POD arrays resulting from
2615 brace-enclosed initializers. */
2620 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2622 tree elt = TREE_VALUE (elts);
2623 tree baseref = build1 (INDIRECT_REF, type, base);
2625 num_initialized_elts++;
2627 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2628 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2629 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2631 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2633 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2635 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2636 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2639 /* Clear out INIT so that we don't get confused below. */
2642 else if (from_array)
2644 /* If initializing one array from another, initialize element by
2645 element. We rely upon the below calls the do argument
2649 base2 = decay_conversion (init);
2650 itype = TREE_TYPE (base2);
2651 base2 = get_temp_regvar (itype, base2);
2652 itype = TREE_TYPE (itype);
2654 else if (TYPE_LANG_SPECIFIC (type)
2655 && TYPE_NEEDS_CONSTRUCTING (type)
2656 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2658 error ("initializer ends prematurely");
2659 return error_mark_node;
2663 /* Now, default-initialize any remaining elements. We don't need to
2664 do that if a) the type does not need constructing, or b) we've
2665 already initialized all the elements.
2667 We do need to keep going if we're copying an array. */
2670 || (TYPE_NEEDS_CONSTRUCTING (type)
2671 && ! (host_integerp (maxindex, 0)
2672 && (num_initialized_elts
2673 == tree_low_cst (maxindex, 0) + 1))))
2675 /* If the ITERATOR is equal to -1, then we don't have to loop;
2676 we've already initialized all the elements. */
2681 for_stmt = begin_for_stmt ();
2682 finish_for_init_stmt (for_stmt);
2683 finish_for_cond (build (NE_EXPR, boolean_type_node,
2684 iterator, integer_minus_one_node),
2686 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2689 /* Otherwise, loop through the elements. */
2690 for_body = begin_compound_stmt (/*has_no_scope=*/true);
2694 tree to = build1 (INDIRECT_REF, type, base);
2698 from = build1 (INDIRECT_REF, itype, base2);
2702 if (from_array == 2)
2703 elt_init = build_modify_expr (to, NOP_EXPR, from);
2704 else if (TYPE_NEEDS_CONSTRUCTING (type))
2705 elt_init = build_aggr_init (to, from, 0);
2707 elt_init = build_modify_expr (to, NOP_EXPR, from);
2711 else if (TREE_CODE (type) == ARRAY_TYPE)
2715 ("cannot initialize multi-dimensional array with initializer");
2716 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2720 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2723 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2724 finish_expr_stmt (elt_init);
2725 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2727 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2729 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2731 finish_compound_stmt (for_body);
2732 finish_for_stmt (for_stmt);
2735 /* Make sure to cleanup any partially constructed elements. */
2736 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2740 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2742 /* Flatten multi-dimensional array since build_vec_delete only
2743 expects one-dimensional array. */
2744 if (TREE_CODE (type) == ARRAY_TYPE)
2746 m = cp_build_binary_op (MULT_EXPR, m,
2747 array_type_nelts_total (type));
2748 type = strip_array_types (type);
2751 finish_compound_stmt (try_body);
2752 finish_cleanup_try_block (try_block);
2753 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2754 /*use_global_delete=*/0);
2755 finish_cleanup (e, try_block);
2758 /* The value of the array initialization is the array itself, RVAL
2759 is a pointer to the first element. */
2760 finish_stmt_expr_expr (rval);
2762 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2764 /* Now convert make the result have the correct type. */
2765 atype = build_pointer_type (atype);
2766 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2767 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2769 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2773 /* Free up storage of type TYPE, at address ADDR.
2775 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2778 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2779 used as the second argument to operator delete. It can include
2780 things like padding and magic size cookies. It has virtual in it,
2781 because if you have a base pointer and you delete through a virtual
2782 destructor, it should be the size of the dynamic object, not the
2783 static object, see Free Store 12.5 ISO C++.
2785 This does not call any destructors. */
2788 build_x_delete (tree addr, int which_delete, tree virtual_size)
2790 int use_global_delete = which_delete & 1;
2791 int use_vec_delete = !!(which_delete & 2);
2792 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2794 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2798 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2802 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2808 case sfk_complete_destructor:
2809 name = complete_dtor_identifier;
2812 case sfk_base_destructor:
2813 name = base_dtor_identifier;
2816 case sfk_deleting_destructor:
2817 name = deleting_dtor_identifier;
2824 exp = convert_from_reference (exp);
2825 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2826 return build_new_method_call (exp, fn,
2828 /*conversion_path=*/NULL_TREE,
2832 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2833 ADDR is an expression which yields the store to be destroyed.
2834 AUTO_DELETE is the name of the destructor to call, i.e., either
2835 sfk_complete_destructor, sfk_base_destructor, or
2836 sfk_deleting_destructor.
2838 FLAGS is the logical disjunction of zero or more LOOKUP_
2839 flags. See cp-tree.h for more info. */
2842 build_delete (tree type, tree addr, special_function_kind auto_delete,
2843 int flags, int use_global_delete)
2847 if (addr == error_mark_node)
2848 return error_mark_node;
2850 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2851 set to `error_mark_node' before it gets properly cleaned up. */
2852 if (type == error_mark_node)
2853 return error_mark_node;
2855 type = TYPE_MAIN_VARIANT (type);
2857 if (TREE_CODE (type) == POINTER_TYPE)
2859 bool complete_p = true;
2861 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2862 if (TREE_CODE (type) == ARRAY_TYPE)
2865 /* We don't want to warn about delete of void*, only other
2866 incomplete types. Deleting other incomplete types
2867 invokes undefined behavior, but it is not ill-formed, so
2868 compile to something that would even do The Right Thing
2869 (TM) should the type have a trivial dtor and no delete
2871 if (!VOID_TYPE_P (type))
2873 complete_type (type);
2874 if (!COMPLETE_TYPE_P (type))
2876 warning ("possible problem detected in invocation of "
2877 "delete operator:");
2878 cxx_incomplete_type_diagnostic (addr, type, 1);
2879 inform ("neither the destructor nor the class-specific "
\r
2880 "operator delete will be called, even if they are "
\r
2881 "declared when the class is defined.");
2885 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2886 /* Call the builtin operator delete. */
2887 return build_builtin_delete_call (addr);
2888 if (TREE_SIDE_EFFECTS (addr))
2889 addr = save_expr (addr);
2891 /* Throw away const and volatile on target type of addr. */
2892 addr = convert_force (build_pointer_type (type), addr, 0);
2894 else if (TREE_CODE (type) == ARRAY_TYPE)
2898 if (TYPE_DOMAIN (type) == NULL_TREE)
2900 error ("unknown array size in delete");
2901 return error_mark_node;
2903 return build_vec_delete (addr, array_type_nelts (type),
2904 auto_delete, use_global_delete);
2908 /* Don't check PROTECT here; leave that decision to the
2909 destructor. If the destructor is accessible, call it,
2910 else report error. */
2911 addr = build_unary_op (ADDR_EXPR, addr, 0);
2912 if (TREE_SIDE_EFFECTS (addr))
2913 addr = save_expr (addr);
2915 addr = convert_force (build_pointer_type (type), addr, 0);
2918 my_friendly_assert (IS_AGGR_TYPE (type), 220);
2920 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2922 if (auto_delete != sfk_deleting_destructor)
2923 return void_zero_node;
2925 return build_op_delete_call
2926 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2931 tree do_delete = NULL_TREE;
2934 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2936 /* For `::delete x', we must not use the deleting destructor
2937 since then we would not be sure to get the global `operator
2939 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2941 /* We will use ADDR multiple times so we must save it. */
2942 addr = save_expr (addr);
2943 /* Delete the object. */
2944 do_delete = build_builtin_delete_call (addr);
2945 /* Otherwise, treat this like a complete object destructor
2947 auto_delete = sfk_complete_destructor;
2949 /* If the destructor is non-virtual, there is no deleting
2950 variant. Instead, we must explicitly call the appropriate
2951 `operator delete' here. */
2952 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2953 && auto_delete == sfk_deleting_destructor)
2955 /* We will use ADDR multiple times so we must save it. */
2956 addr = save_expr (addr);
2957 /* Build the call. */
2958 do_delete = build_op_delete_call (DELETE_EXPR,
2960 cxx_sizeof_nowarn (type),
2963 /* Call the complete object destructor. */
2964 auto_delete = sfk_complete_destructor;
2966 else if (auto_delete == sfk_deleting_destructor
2967 && TYPE_GETS_REG_DELETE (type))
2969 /* Make sure we have access to the member op delete, even though
2970 we'll actually be calling it from the destructor. */
2971 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2972 /*global_p=*/false, NULL_TREE);
2975 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2976 auto_delete, flags);
2978 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2980 if (flags & LOOKUP_DESTRUCTOR)
2981 /* Explicit destructor call; don't check for null pointer. */
2982 ifexp = integer_one_node;
2984 /* Handle deleting a null pointer. */
2985 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2987 if (ifexp != integer_one_node)
2988 expr = build (COND_EXPR, void_type_node,
2989 ifexp, expr, void_zero_node);
2995 /* At the beginning of a destructor, push cleanups that will call the
2996 destructors for our base classes and members.
2998 Called from begin_destructor_body. */
3001 push_base_cleanups (void)
3004 int i, n_baseclasses;
3008 /* Run destructors for all virtual baseclasses. */
3009 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
3012 tree cond = (condition_conversion
3013 (build (BIT_AND_EXPR, integer_type_node,
3014 current_in_charge_parm,
3015 integer_two_node)));
3017 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3018 /* The CLASSTYPE_VBASECLASSES list is in initialization
3019 order, which is also the right order for pushing cleanups. */
3021 vbases = TREE_CHAIN (vbases))
3023 tree vbase = TREE_VALUE (vbases);
3024 tree base_type = BINFO_TYPE (vbase);
3026 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3028 expr = build_special_member_call (current_class_ref,
3029 base_dtor_identifier,
3033 | LOOKUP_NONVIRTUAL));
3034 expr = build (COND_EXPR, void_type_node, cond,
3035 expr, void_zero_node);
3036 finish_decl_cleanup (NULL_TREE, expr);
3041 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3042 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3044 /* Take care of the remaining baseclasses. */
3045 for (i = 0; i < n_baseclasses; i++)
3047 tree base_binfo = TREE_VEC_ELT (binfos, i);
3048 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3049 || TREE_VIA_VIRTUAL (base_binfo))
3052 expr = build_special_member_call (current_class_ref,
3053 base_dtor_identifier,
3054 NULL_TREE, base_binfo,
3055 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3056 finish_decl_cleanup (NULL_TREE, expr);
3059 for (member = TYPE_FIELDS (current_class_type); member;
3060 member = TREE_CHAIN (member))
3062 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3064 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3066 tree this_member = (build_class_member_access_expr
3067 (current_class_ref, member,
3068 /*access_path=*/NULL_TREE,
3069 /*preserve_reference=*/false));
3070 tree this_type = TREE_TYPE (member);
3071 expr = build_delete (this_type, this_member,
3072 sfk_complete_destructor,
3073 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3075 finish_decl_cleanup (NULL_TREE, expr);
3080 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3083 build_vbase_delete (tree type, tree decl)
3085 tree vbases = CLASSTYPE_VBASECLASSES (type);
3087 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3089 my_friendly_assert (addr != error_mark_node, 222);
3091 for (result = convert_to_void (integer_zero_node, NULL);
3092 vbases; vbases = TREE_CHAIN (vbases))
3094 tree base_addr = convert_force
3095 (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))), addr, 0);
3096 tree base_delete = build_delete
3097 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
3098 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
3100 result = build_compound_expr (result, base_delete);
3105 /* Build a C++ vector delete expression.
3106 MAXINDEX is the number of elements to be deleted.
3107 ELT_SIZE is the nominal size of each element in the vector.
3108 BASE is the expression that should yield the store to be deleted.
3109 This function expands (or synthesizes) these calls itself.
3110 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3112 This also calls delete for virtual baseclasses of elements of the vector.
3114 Update: MAXINDEX is no longer needed. The size can be extracted from the
3115 start of the vector for pointers, and from the type for arrays. We still
3116 use MAXINDEX for arrays because it happens to already have one of the
3117 values we'd have to extract. (We could use MAXINDEX with pointers to
3118 confirm the size, and trap if the numbers differ; not clear that it'd
3119 be worth bothering.) */
3122 build_vec_delete (tree base, tree maxindex,
3123 special_function_kind auto_delete_vec, int use_global_delete)
3127 tree base_init = NULL_TREE;
3129 type = TREE_TYPE (base);
3131 if (TREE_CODE (type) == POINTER_TYPE)
3133 /* Step back one from start of vector, and read dimension. */
3136 if (TREE_SIDE_EFFECTS (base))
3138 base_init = get_target_expr (base);
3139 base = TARGET_EXPR_SLOT (base_init);
3141 type = strip_array_types (TREE_TYPE (type));
3142 cookie_addr = build (MINUS_EXPR,
3143 build_pointer_type (sizetype),
3145 TYPE_SIZE_UNIT (sizetype));
3146 maxindex = build_indirect_ref (cookie_addr, NULL);
3148 else if (TREE_CODE (type) == ARRAY_TYPE)
3150 /* Get the total number of things in the array, maxindex is a
3152 maxindex = array_type_nelts_total (type);
3153 type = strip_array_types (type);
3154 base = build_unary_op (ADDR_EXPR, base, 1);
3155 if (TREE_SIDE_EFFECTS (base))
3157 base_init = get_target_expr (base);
3158 base = TARGET_EXPR_SLOT (base_init);
3163 if (base != error_mark_node)
3164 error ("type to vector delete is neither pointer or array type");
3165 return error_mark_node;
3168 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3171 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);