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);
375 else if (TREE_CODE (init) == TREE_LIST)
376 /* There was an explicit member initialization. Do some work
378 init = build_x_compound_expr_from_list (init, "member initializer");
381 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
384 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
388 expr = build_class_member_access_expr (current_class_ref, member,
389 /*access_path=*/NULL_TREE,
390 /*preserve_reference=*/false);
391 expr = build_delete (type, expr, sfk_complete_destructor,
392 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
394 if (expr != error_mark_node)
395 finish_eh_cleanup (expr);
399 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
400 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
403 build_field_list (tree t, tree list, int *uses_unions_p)
409 /* Note whether or not T is a union. */
410 if (TREE_CODE (t) == UNION_TYPE)
413 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
415 /* Skip CONST_DECLs for enumeration constants and so forth. */
416 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
419 /* Keep track of whether or not any fields are unions. */
420 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
423 /* For an anonymous struct or union, we must recursively
424 consider the fields of the anonymous type. They can be
425 directly initialized from the constructor. */
426 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
428 /* Add this field itself. Synthesized copy constructors
429 initialize the entire aggregate. */
430 list = tree_cons (fields, NULL_TREE, list);
431 /* And now add the fields in the anonymous aggregate. */
432 list = build_field_list (TREE_TYPE (fields), list,
435 /* Add this field. */
436 else if (DECL_NAME (fields))
437 list = tree_cons (fields, NULL_TREE, list);
443 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
444 a FIELD_DECL or BINFO in T that needs initialization. The
445 TREE_VALUE gives the initializer, or list of initializer arguments.
447 Return a TREE_LIST containing all of the initializations required
448 for T, in the order in which they should be performed. The output
449 list has the same format as the input. */
452 sort_mem_initializers (tree t, tree mem_inits)
461 /* Build up a list of initializations. The TREE_PURPOSE of entry
462 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
463 TREE_VALUE will be the constructor arguments, or NULL if no
464 explicit initialization was provided. */
465 sorted_inits = NULL_TREE;
466 /* Process the virtual bases. */
467 for (base = CLASSTYPE_VBASECLASSES (t); base; base = TREE_CHAIN (base))
468 sorted_inits = tree_cons (TREE_VALUE (base), NULL_TREE, sorted_inits);
469 /* Process the direct bases. */
470 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
472 base = BINFO_BASETYPE (TYPE_BINFO (t), i);
473 if (!TREE_VIA_VIRTUAL (base))
474 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
476 /* Process the non-static data members. */
477 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
478 /* Reverse the entire list of initializations, so that they are in
479 the order that they will actually be performed. */
480 sorted_inits = nreverse (sorted_inits);
482 /* If the user presented the initializers in an order different from
483 that in which they will actually occur, we issue a warning. Keep
484 track of the next subobject which can be explicitly initialized
485 without issuing a warning. */
486 next_subobject = sorted_inits;
488 /* Go through the explicit initializers, filling in TREE_PURPOSE in
490 for (init = mem_inits; init; init = TREE_CHAIN (init))
495 subobject = TREE_PURPOSE (init);
497 /* If the explicit initializers are in sorted order, then
498 SUBOBJECT will be NEXT_SUBOBJECT, or something following
500 for (subobject_init = next_subobject;
502 subobject_init = TREE_CHAIN (subobject_init))
503 if (TREE_PURPOSE (subobject_init) == subobject)
506 /* Issue a warning if the explicit initializer order does not
507 match that which will actually occur. */
508 if (warn_reorder && !subobject_init)
510 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
511 cp_warning_at ("`%D' will be initialized after",
512 TREE_PURPOSE (next_subobject));
514 warning ("base `%T' will be initialized after",
515 TREE_PURPOSE (next_subobject));
516 if (TREE_CODE (subobject) == FIELD_DECL)
517 cp_warning_at (" `%#D'", subobject);
519 warning (" base `%T'", subobject);
520 warning (" when initialized here");
523 /* Look again, from the beginning of the list. */
526 subobject_init = sorted_inits;
527 while (TREE_PURPOSE (subobject_init) != subobject)
528 subobject_init = TREE_CHAIN (subobject_init);
531 /* It is invalid to initialize the same subobject more than
533 if (TREE_VALUE (subobject_init))
535 if (TREE_CODE (subobject) == FIELD_DECL)
536 error ("multiple initializations given for `%D'", subobject);
538 error ("multiple initializations given for base `%T'",
542 /* Record the initialization. */
543 TREE_VALUE (subobject_init) = TREE_VALUE (init);
544 next_subobject = subobject_init;
549 If a ctor-initializer specifies more than one mem-initializer for
550 multiple members of the same union (including members of
551 anonymous unions), the ctor-initializer is ill-formed. */
554 tree last_field = NULL_TREE;
555 for (init = sorted_inits; init; init = TREE_CHAIN (init))
561 /* Skip uninitialized members and base classes. */
562 if (!TREE_VALUE (init)
563 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
565 /* See if this field is a member of a union, or a member of a
566 structure contained in a union, etc. */
567 field = TREE_PURPOSE (init);
568 for (field_type = DECL_CONTEXT (field);
569 !same_type_p (field_type, t);
570 field_type = TYPE_CONTEXT (field_type))
571 if (TREE_CODE (field_type) == UNION_TYPE)
573 /* If this field is not a member of a union, skip it. */
574 if (TREE_CODE (field_type) != UNION_TYPE)
577 /* It's only an error if we have two initializers for the same
585 /* See if LAST_FIELD and the field initialized by INIT are
586 members of the same union. If so, there's a problem,
587 unless they're actually members of the same structure
588 which is itself a member of a union. For example, given:
590 union { struct { int i; int j; }; };
592 initializing both `i' and `j' makes sense. */
593 field_type = DECL_CONTEXT (field);
597 tree last_field_type;
599 last_field_type = DECL_CONTEXT (last_field);
602 if (same_type_p (last_field_type, field_type))
604 if (TREE_CODE (field_type) == UNION_TYPE)
605 error ("initializations for multiple members of `%T'",
611 if (same_type_p (last_field_type, t))
614 last_field_type = TYPE_CONTEXT (last_field_type);
617 /* If we've reached the outermost class, then we're
619 if (same_type_p (field_type, t))
622 field_type = TYPE_CONTEXT (field_type);
633 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
634 is a TREE_LIST giving the explicit mem-initializer-list for the
635 constructor. The TREE_PURPOSE of each entry is a subobject (a
636 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
637 is a TREE_LIST giving the arguments to the constructor or
638 void_type_node for an empty list of arguments. */
641 emit_mem_initializers (tree mem_inits)
643 /* Sort the mem-initializers into the order in which the
644 initializations should be performed. */
645 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
647 in_base_initializer = 1;
649 /* Initialize base classes. */
651 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
653 tree subobject = TREE_PURPOSE (mem_inits);
654 tree arguments = TREE_VALUE (mem_inits);
656 /* If these initializations are taking place in a copy
657 constructor, the base class should probably be explicitly
659 if (extra_warnings && !arguments
660 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
661 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
662 warning ("base class `%#T' should be explicitly initialized in the "
664 BINFO_TYPE (subobject));
666 /* If an explicit -- but empty -- initializer list was present,
667 treat it just like default initialization at this point. */
668 if (arguments == void_type_node)
669 arguments = NULL_TREE;
671 /* Initialize the base. */
672 if (TREE_VIA_VIRTUAL (subobject))
673 construct_virtual_base (subobject, arguments);
678 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
680 expand_aggr_init_1 (subobject, NULL_TREE,
681 build_indirect_ref (base_addr, NULL),
684 expand_cleanup_for_base (subobject, NULL_TREE);
687 mem_inits = TREE_CHAIN (mem_inits);
689 in_base_initializer = 0;
691 /* Initialize the vptrs. */
692 initialize_vtbl_ptrs (current_class_ptr);
694 /* Initialize the data members. */
697 perform_member_init (TREE_PURPOSE (mem_inits),
698 TREE_VALUE (mem_inits));
699 mem_inits = TREE_CHAIN (mem_inits);
703 /* Returns the address of the vtable (i.e., the value that should be
704 assigned to the vptr) for BINFO. */
707 build_vtbl_address (tree binfo)
709 tree binfo_for = binfo;
712 if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
713 && BINFO_PRIMARY_P (binfo))
714 /* If this is a virtual primary base, then the vtable we want to store
715 is that for the base this is being used as the primary base of. We
716 can't simply skip the initialization, because we may be expanding the
717 inits of a subobject constructor where the virtual base layout
719 while (BINFO_PRIMARY_BASE_OF (binfo_for))
720 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
722 /* Figure out what vtable BINFO's vtable is based on, and mark it as
724 vtbl = get_vtbl_decl_for_binfo (binfo_for);
725 assemble_external (vtbl);
726 TREE_USED (vtbl) = 1;
728 /* Now compute the address to use when initializing the vptr. */
729 vtbl = BINFO_VTABLE (binfo_for);
730 if (TREE_CODE (vtbl) == VAR_DECL)
732 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
733 TREE_CONSTANT (vtbl) = 1;
739 /* This code sets up the virtual function tables appropriate for
740 the pointer DECL. It is a one-ply initialization.
742 BINFO is the exact type that DECL is supposed to be. In
743 multiple inheritance, this might mean "C's A" if C : A, B. */
746 expand_virtual_init (tree binfo, tree decl)
751 /* Compute the initializer for vptr. */
752 vtbl = build_vtbl_address (binfo);
754 /* We may get this vptr from a VTT, if this is a subobject
755 constructor or subobject destructor. */
756 vtt_index = BINFO_VPTR_INDEX (binfo);
762 /* Compute the value to use, when there's a VTT. */
763 vtt_parm = current_vtt_parm;
764 vtbl2 = build (PLUS_EXPR,
765 TREE_TYPE (vtt_parm),
768 vtbl2 = build1 (INDIRECT_REF, TREE_TYPE (vtbl), vtbl2);
770 /* The actual initializer is the VTT value only in the subobject
771 constructor. In maybe_clone_body we'll substitute NULL for
772 the vtt_parm in the case of the non-subobject constructor. */
773 vtbl = build (COND_EXPR,
775 build (EQ_EXPR, boolean_type_node,
776 current_in_charge_parm, integer_zero_node),
781 /* Compute the location of the vtpr. */
782 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
784 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
786 /* Assign the vtable to the vptr. */
787 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
788 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
791 /* If an exception is thrown in a constructor, those base classes already
792 constructed must be destroyed. This function creates the cleanup
793 for BINFO, which has just been constructed. If FLAG is non-NULL,
794 it is a DECL which is nonzero when this base needs to be
798 expand_cleanup_for_base (tree binfo, tree flag)
802 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
805 /* Call the destructor. */
806 expr = build_special_member_call (current_class_ref,
807 base_dtor_identifier,
810 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
812 expr = fold (build (COND_EXPR, void_type_node,
813 c_common_truthvalue_conversion (flag),
814 expr, integer_zero_node));
816 finish_eh_cleanup (expr);
819 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
823 construct_virtual_base (tree vbase, tree arguments)
830 /* If there are virtual base classes with destructors, we need to
831 emit cleanups to destroy them if an exception is thrown during
832 the construction process. These exception regions (i.e., the
833 period during which the cleanups must occur) begin from the time
834 the construction is complete to the end of the function. If we
835 create a conditional block in which to initialize the
836 base-classes, then the cleanup region for the virtual base begins
837 inside a block, and ends outside of that block. This situation
838 confuses the sjlj exception-handling code. Therefore, we do not
839 create a single conditional block, but one for each
840 initialization. (That way the cleanup regions always begin
841 in the outer block.) We trust the back-end to figure out
842 that the FLAG will not change across initializations, and
843 avoid doing multiple tests. */
844 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
845 inner_if_stmt = begin_if_stmt ();
846 finish_if_stmt_cond (flag, inner_if_stmt);
847 compound_stmt = begin_compound_stmt (/*has_no_scope=*/true);
849 /* Compute the location of the virtual base. If we're
850 constructing virtual bases, then we must be the most derived
851 class. Therefore, we don't have to look up the virtual base;
852 we already know where it is. */
853 exp = convert_to_base_statically (current_class_ref, vbase);
855 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
857 finish_compound_stmt (compound_stmt);
858 finish_then_clause (inner_if_stmt);
861 expand_cleanup_for_base (vbase, flag);
864 /* Find the context in which this FIELD can be initialized. */
867 initializing_context (tree field)
869 tree t = DECL_CONTEXT (field);
871 /* Anonymous union members can be initialized in the first enclosing
872 non-anonymous union context. */
873 while (t && ANON_AGGR_TYPE_P (t))
874 t = TYPE_CONTEXT (t);
878 /* Function to give error message if member initialization specification
879 is erroneous. FIELD is the member we decided to initialize.
880 TYPE is the type for which the initialization is being performed.
881 FIELD must be a member of TYPE.
883 MEMBER_NAME is the name of the member. */
886 member_init_ok_or_else (tree field, tree type, tree member_name)
888 if (field == error_mark_node)
892 error ("class `%T' does not have any field named `%D'", type,
896 if (TREE_CODE (field) == VAR_DECL)
898 error ("`%#D' is a static data member; it can only be "
899 "initialized at its definition",
903 if (TREE_CODE (field) != FIELD_DECL)
905 error ("`%#D' is not a non-static data member of `%T'",
909 if (initializing_context (field) != type)
911 error ("class `%T' does not have any field named `%D'", type,
919 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
920 is a _TYPE node or TYPE_DECL which names a base for that type.
921 Check the validity of NAME, and return either the base _TYPE, base
922 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
923 NULL_TREE and issue a diagnostic.
925 An old style unnamed direct single base construction is permitted,
926 where NAME is NULL. */
929 expand_member_init (tree name)
934 if (!current_class_ref)
939 /* This is an obsolete unnamed base class initializer. The
940 parser will already have warned about its use. */
941 switch (CLASSTYPE_N_BASECLASSES (current_class_type))
944 error ("unnamed initializer for `%T', which has no base classes",
948 basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
951 error ("unnamed initializer for `%T', which uses multiple inheritance",
956 else if (TYPE_P (name))
958 basetype = TYPE_MAIN_VARIANT (name);
959 name = TYPE_NAME (name);
961 else if (TREE_CODE (name) == TYPE_DECL)
962 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
964 basetype = NULL_TREE;
973 if (current_template_parms)
976 class_binfo = TYPE_BINFO (current_class_type);
977 direct_binfo = NULL_TREE;
978 virtual_binfo = NULL_TREE;
980 /* Look for a direct base. */
981 for (i = 0; i < BINFO_N_BASETYPES (class_binfo); ++i)
982 if (same_type_p (basetype,
983 TYPE_BINFO_BASETYPE (current_class_type, i)))
985 direct_binfo = BINFO_BASETYPE (class_binfo, i);
988 /* Look for a virtual base -- unless the direct base is itself
990 if (!direct_binfo || !TREE_VIA_VIRTUAL (direct_binfo))
993 = purpose_member (basetype,
994 CLASSTYPE_VBASECLASSES (current_class_type));
996 virtual_binfo = TREE_VALUE (virtual_binfo);
1001 If a mem-initializer-id is ambiguous because it designates
1002 both a direct non-virtual base class and an inherited virtual
1003 base class, the mem-initializer is ill-formed. */
1004 if (direct_binfo && virtual_binfo)
1006 error ("'%D' is both a direct base and an indirect virtual base",
1011 if (!direct_binfo && !virtual_binfo)
1013 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1014 error ("type `%D' is not a direct or virtual base of `%T'",
1015 name, current_class_type);
1017 error ("type `%D' is not a direct base of `%T'",
1018 name, current_class_type);
1022 return direct_binfo ? direct_binfo : virtual_binfo;
1026 if (TREE_CODE (name) == IDENTIFIER_NODE)
1027 field = lookup_field (current_class_type, name, 1, false);
1031 if (member_init_ok_or_else (field, current_class_type, name))
1038 /* This is like `expand_member_init', only it stores one aggregate
1041 INIT comes in two flavors: it is either a value which
1042 is to be stored in EXP, or it is a parameter list
1043 to go to a constructor, which will operate on EXP.
1044 If INIT is not a parameter list for a constructor, then set
1045 LOOKUP_ONLYCONVERTING.
1046 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1047 the initializer, if FLAGS is 0, then it is the (init) form.
1048 If `init' is a CONSTRUCTOR, then we emit a warning message,
1049 explaining that such initializations are invalid.
1051 If INIT resolves to a CALL_EXPR which happens to return
1052 something of the type we are looking for, then we know
1053 that we can safely use that call to perform the
1056 The virtual function table pointer cannot be set up here, because
1057 we do not really know its type.
1059 This never calls operator=().
1061 When initializing, nothing is CONST.
1063 A default copy constructor may have to be used to perform the
1066 A constructor or a conversion operator may have to be used to
1067 perform the initialization, but not both, as it would be ambiguous. */
1070 build_aggr_init (tree exp, tree init, int flags)
1075 tree type = TREE_TYPE (exp);
1076 int was_const = TREE_READONLY (exp);
1077 int was_volatile = TREE_THIS_VOLATILE (exp);
1080 if (init == error_mark_node)
1081 return error_mark_node;
1083 TREE_READONLY (exp) = 0;
1084 TREE_THIS_VOLATILE (exp) = 0;
1086 if (init && TREE_CODE (init) != TREE_LIST)
1087 flags |= LOOKUP_ONLYCONVERTING;
1089 if (TREE_CODE (type) == ARRAY_TYPE)
1091 /* Must arrange to initialize each element of EXP
1092 from elements of INIT. */
1093 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1097 /* Handle bad initializers like:
1101 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1105 int main(int argc, char **argv) {
1106 COMPLEX zees(1.0, 0.0)[10];
1109 error ("bad array initializer");
1110 return error_mark_node;
1112 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1113 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1114 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1115 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1116 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1117 init && same_type_p (TREE_TYPE (init),
1119 TREE_READONLY (exp) = was_const;
1120 TREE_THIS_VOLATILE (exp) = was_volatile;
1121 TREE_TYPE (exp) = type;
1123 TREE_TYPE (init) = itype;
1127 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1128 /* Just know that we've seen something for this node. */
1129 TREE_USED (exp) = 1;
1131 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1132 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1133 destroy_temps = stmts_are_full_exprs_p ();
1134 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1135 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1136 init, LOOKUP_NORMAL|flags);
1137 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1138 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1139 TREE_TYPE (exp) = type;
1140 TREE_READONLY (exp) = was_const;
1141 TREE_THIS_VOLATILE (exp) = was_volatile;
1146 /* Like build_aggr_init, but not just for aggregates. */
1149 build_init (tree decl, tree init, int flags)
1153 if (IS_AGGR_TYPE (TREE_TYPE (decl))
1154 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1155 expr = build_aggr_init (decl, init, flags);
1157 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1163 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1165 tree type = TREE_TYPE (exp);
1168 /* It fails because there may not be a constructor which takes
1169 its own type as the first (or only parameter), but which does
1170 take other types via a conversion. So, if the thing initializing
1171 the expression is a unit element of type X, first try X(X&),
1172 followed by initialization by X. If neither of these work
1173 out, then look hard. */
1177 if (init && TREE_CODE (init) != TREE_LIST
1178 && (flags & LOOKUP_ONLYCONVERTING))
1180 /* Base subobjects should only get direct-initialization. */
1181 if (true_exp != exp)
1184 if (flags & DIRECT_BIND)
1185 /* Do nothing. We hit this in two cases: Reference initialization,
1186 where we aren't initializing a real variable, so we don't want
1187 to run a new constructor; and catching an exception, where we
1188 have already built up the constructor call so we could wrap it
1189 in an exception region. */;
1190 else if (TREE_CODE (init) == CONSTRUCTOR
1191 && TREE_HAS_CONSTRUCTOR (init))
1193 /* A brace-enclosed initializer for an aggregate. */
1194 my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1195 init = digest_init (type, init, (tree *)NULL);
1198 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1200 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1201 /* We need to protect the initialization of a catch parm with a
1202 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1203 around the TARGET_EXPR for the copy constructor. See
1204 initialize_handler_parm. */
1206 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1207 TREE_OPERAND (init, 0));
1208 TREE_TYPE (init) = void_type_node;
1211 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1212 TREE_SIDE_EFFECTS (init) = 1;
1213 finish_expr_stmt (init);
1217 if (init == NULL_TREE
1218 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1222 init = TREE_VALUE (parms);
1225 parms = build_tree_list (NULL_TREE, init);
1227 if (true_exp == exp)
1228 ctor_name = complete_ctor_identifier;
1230 ctor_name = base_ctor_identifier;
1232 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1233 if (TREE_SIDE_EFFECTS (rval))
1234 finish_expr_stmt (convert_to_void (rval, NULL));
1237 /* This function is responsible for initializing EXP with INIT
1240 BINFO is the binfo of the type for who we are performing the
1241 initialization. For example, if W is a virtual base class of A and B,
1243 If we are initializing B, then W must contain B's W vtable, whereas
1244 were we initializing C, W must contain C's W vtable.
1246 TRUE_EXP is nonzero if it is the true expression being initialized.
1247 In this case, it may be EXP, or may just contain EXP. The reason we
1248 need this is because if EXP is a base element of TRUE_EXP, we
1249 don't necessarily know by looking at EXP where its virtual
1250 baseclass fields should really be pointing. But we do know
1251 from TRUE_EXP. In constructors, we don't know anything about
1252 the value being initialized.
1254 FLAGS is just passed to `build_new_method_call'. See that function
1255 for its description. */
1258 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1260 tree type = TREE_TYPE (exp);
1262 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1263 my_friendly_assert (building_stmt_tree (), 20021010);
1265 /* Use a function returning the desired type to initialize EXP for us.
1266 If the function is a constructor, and its first argument is
1267 NULL_TREE, know that it was meant for us--just slide exp on
1268 in and expand the constructor. Constructors now come
1271 if (init && TREE_CODE (exp) == VAR_DECL
1272 && TREE_CODE (init) == CONSTRUCTOR
1273 && TREE_HAS_CONSTRUCTOR (init))
1275 /* If store_init_value returns NULL_TREE, the INIT has been
1276 record in the DECL_INITIAL for EXP. That means there's
1277 nothing more we have to do. */
1278 init = store_init_value (exp, init);
1280 finish_expr_stmt (init);
1284 /* We know that expand_default_init can handle everything we want
1286 expand_default_init (binfo, true_exp, exp, init, flags);
1289 /* Report an error if TYPE is not a user-defined, aggregate type. If
1290 OR_ELSE is nonzero, give an error message. */
1293 is_aggr_type (tree type, int or_else)
1295 if (type == error_mark_node)
1298 if (! IS_AGGR_TYPE (type)
1299 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1300 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1303 error ("`%T' is not an aggregate type", type);
1309 /* Like is_aggr_typedef, but returns typedef if successful. */
1312 get_aggr_from_typedef (tree name, int or_else)
1316 if (name == error_mark_node)
1319 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1320 type = IDENTIFIER_TYPE_VALUE (name);
1324 error ("`%T' fails to be an aggregate typedef", name);
1328 if (! IS_AGGR_TYPE (type)
1329 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1330 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1333 error ("type `%T' is of non-aggregate type", type);
1340 get_type_value (tree name)
1342 if (name == error_mark_node)
1345 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1346 return IDENTIFIER_TYPE_VALUE (name);
1351 /* Build a reference to a member of an aggregate. This is not a C++
1352 `&', but really something which can have its address taken, and
1353 then act as a pointer to member, for example TYPE :: FIELD can have
1354 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1355 this expression is the operand of "&".
1357 @@ Prints out lousy diagnostics for operator <typename>
1360 @@ This function should be rewritten and placed in search.c. */
1363 build_offset_ref (tree type, tree name, bool address_p)
1367 tree basebinfo = NULL_TREE;
1368 tree orig_name = name;
1370 /* class templates can come in as TEMPLATE_DECLs here. */
1371 if (TREE_CODE (name) == TEMPLATE_DECL)
1374 if (processing_template_decl || uses_template_parms (type))
1375 return build_min_nt (SCOPE_REF, type, name);
1377 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1379 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1380 something like `a.template f<int>' or the like. For the most
1381 part, we treat this just like a.f. We do remember, however,
1382 the template-id that was used. */
1383 name = TREE_OPERAND (orig_name, 0);
1386 name = DECL_NAME (name);
1389 if (TREE_CODE (name) == COMPONENT_REF)
1390 name = TREE_OPERAND (name, 1);
1391 if (TREE_CODE (name) == OVERLOAD)
1392 name = DECL_NAME (OVL_CURRENT (name));
1395 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1398 if (type == NULL_TREE)
1399 return error_mark_node;
1401 /* Handle namespace names fully here. */
1402 if (TREE_CODE (type) == NAMESPACE_DECL)
1404 tree t = lookup_namespace_name (type, name);
1405 if (t == error_mark_node)
1407 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1408 /* Reconstruct the TEMPLATE_ID_EXPR. */
1409 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1410 t, TREE_OPERAND (orig_name, 1));
1411 if (! type_unknown_p (t))
1414 t = convert_from_reference (t);
1419 if (! is_aggr_type (type, 1))
1420 return error_mark_node;
1422 if (TREE_CODE (name) == BIT_NOT_EXPR)
1424 if (! check_dtor_name (type, name))
1425 error ("qualified type `%T' does not match destructor name `~%T'",
1426 type, TREE_OPERAND (name, 0));
1427 name = dtor_identifier;
1430 if (!COMPLETE_TYPE_P (complete_type (type))
1431 && !TYPE_BEING_DEFINED (type))
1433 error ("incomplete type `%T' does not have member `%D'", type,
1435 return error_mark_node;
1438 decl = maybe_dummy_object (type, &basebinfo);
1440 if (BASELINK_P (name) || DECL_P (name))
1444 member = lookup_member (basebinfo, name, 1, 0);
1446 if (member == error_mark_node)
1447 return error_mark_node;
1452 error ("`%D' is not a member of type `%T'", name, type);
1453 return error_mark_node;
1456 if (TREE_CODE (member) == TYPE_DECL)
1458 TREE_USED (member) = 1;
1461 /* static class members and class-specific enum
1462 values can be returned without further ado. */
1463 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1466 return convert_from_reference (member);
1469 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1471 error ("invalid pointer to bit-field `%D'", member);
1472 return error_mark_node;
1475 /* A lot of this logic is now handled in lookup_member. */
1476 if (BASELINK_P (member))
1478 /* Go from the TREE_BASELINK to the member function info. */
1479 tree fnfields = member;
1480 tree t = BASELINK_FUNCTIONS (fnfields);
1482 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1484 /* The FNFIELDS are going to contain functions that aren't
1485 necessarily templates, and templates that don't
1486 necessarily match the explicit template parameters. We
1487 save all the functions, and the explicit parameters, and
1488 then figure out exactly what to instantiate with what
1489 arguments in instantiate_type. */
1491 if (TREE_CODE (t) != OVERLOAD)
1492 /* The code in instantiate_type which will process this
1493 expects to encounter OVERLOADs, not raw functions. */
1494 t = ovl_cons (t, NULL_TREE);
1496 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1497 TREE_OPERAND (orig_name, 1));
1498 t = build (OFFSET_REF, unknown_type_node, decl, t);
1500 PTRMEM_OK_P (t) = 1;
1505 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1507 /* Get rid of a potential OVERLOAD around it. */
1508 t = OVL_CURRENT (t);
1510 /* Unique functions are handled easily. */
1512 /* For non-static member of base class, we need a special rule
1513 for access checking [class.protected]:
1515 If the access is to form a pointer to member, the
1516 nested-name-specifier shall name the derived class
1517 (or any class derived from that class). */
1518 if (address_p && DECL_P (t)
1519 && DECL_NONSTATIC_MEMBER_P (t))
1520 perform_or_defer_access_check (TYPE_BINFO (type), t);
1522 perform_or_defer_access_check (basebinfo, t);
1525 if (DECL_STATIC_FUNCTION_P (t))
1531 TREE_TYPE (fnfields) = unknown_type_node;
1535 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1536 /* We need additional test besides the one in
1537 check_accessibility_of_qualified_id in case it is
1538 a pointer to non-static member. */
1539 perform_or_defer_access_check (TYPE_BINFO (type), member);
1543 /* If MEMBER is non-static, then the program has fallen afoul of
1546 An id-expression that denotes a nonstatic data member or
1547 nonstatic member function of a class can only be used:
1549 -- as part of a class member access (_expr.ref_) in which the
1550 object-expression refers to the member's class or a class
1551 derived from that class, or
1553 -- to form a pointer to member (_expr.unary.op_), or
1555 -- in the body of a nonstatic member function of that class or
1556 of a class derived from that class (_class.mfct.nonstatic_), or
1558 -- in a mem-initializer for a constructor for that class or for
1559 a class derived from that class (_class.base.init_). */
1560 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1562 /* In Microsoft mode, treat a non-static member function as if
1563 it were a pointer-to-member. */
1564 if (flag_ms_extensions)
1566 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1567 PTRMEM_OK_P (member) = 1;
1568 return build_unary_op (ADDR_EXPR, member, 0);
1570 error ("invalid use of non-static member function `%D'", member);
1571 return error_mark_node;
1573 else if (TREE_CODE (member) == FIELD_DECL)
1575 error ("invalid use of non-static data member `%D'", member);
1576 return error_mark_node;
1581 /* In member functions, the form `type::name' is no longer
1582 equivalent to `this->type::name', at least not until
1583 resolve_offset_ref. */
1584 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1585 PTRMEM_OK_P (member) = 1;
1589 /* If DECL is a `const' declaration, and its value is a known
1590 constant, then return that value. */
1593 decl_constant_value (tree decl)
1595 /* When we build a COND_EXPR, we don't know whether it will be used
1596 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1597 to replace the second and third operands with their
1598 initializers. So, we do that here. */
1599 if (TREE_CODE (decl) == COND_EXPR)
1604 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1605 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1607 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1608 return build (COND_EXPR,
1610 TREE_OPERAND (decl, 0), d1, d2);
1613 if (TREE_READONLY_DECL_P (decl)
1614 && ! TREE_THIS_VOLATILE (decl)
1615 && DECL_INITIAL (decl)
1616 && DECL_INITIAL (decl) != error_mark_node
1617 /* This is invalid if initial value is not constant.
1618 If it has either a function call, a memory reference,
1619 or a variable, then re-evaluating it could give different results. */
1620 && TREE_CONSTANT (DECL_INITIAL (decl))
1621 /* Check for cases where this is sub-optimal, even though valid. */
1622 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1623 return DECL_INITIAL (decl);
1627 /* Common subroutines of build_new and build_vec_delete. */
1629 /* Call the global __builtin_delete to delete ADDR. */
1632 build_builtin_delete_call (tree addr)
1634 mark_used (global_delete_fndecl);
1635 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1638 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1639 (which needs to go through some sort of groktypename) or it
1640 is the name of the class we are newing. INIT is an initialization value.
1641 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1642 If INIT is void_type_node, it means do *not* call a constructor
1645 For types with constructors, the data returned is initialized
1646 by the appropriate constructor.
1648 Whether the type has a constructor or not, if it has a pointer
1649 to a virtual function table, then that pointer is set up
1652 Unless I am mistaken, a call to new () will return initialized
1653 data regardless of whether the constructor itself is private or
1654 not. NOPE; new fails if the constructor is private (jcm).
1656 Note that build_new does nothing to assure that any special
1657 alignment requirements of the type are met. Rather, it leaves
1658 it up to malloc to do the right thing. Otherwise, folding to
1659 the right alignment cal cause problems if the user tries to later
1660 free the memory returned by `new'.
1662 PLACEMENT is the `placement' list for user-defined operator new (). */
1665 build_new (tree placement, tree decl, tree init, int use_global_new)
1668 tree nelts = NULL_TREE, t;
1671 if (decl == error_mark_node)
1672 return error_mark_node;
1674 if (TREE_CODE (decl) == TREE_LIST)
1676 tree absdcl = TREE_VALUE (decl);
1677 tree last_absdcl = NULL_TREE;
1679 if (current_function_decl
1680 && DECL_CONSTRUCTOR_P (current_function_decl))
1681 my_friendly_assert (immediate_size_expand == 0, 19990926);
1683 nelts = integer_one_node;
1685 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1687 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1689 last_absdcl = absdcl;
1690 absdcl = TREE_OPERAND (absdcl, 0);
1693 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1695 /* Probably meant to be a vec new. */
1698 while (TREE_OPERAND (absdcl, 0)
1699 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1701 last_absdcl = absdcl;
1702 absdcl = TREE_OPERAND (absdcl, 0);
1706 this_nelts = TREE_OPERAND (absdcl, 1);
1707 if (this_nelts != error_mark_node)
1709 if (this_nelts == NULL_TREE)
1710 error ("new of array type fails to specify size");
1711 else if (processing_template_decl)
1714 absdcl = TREE_OPERAND (absdcl, 0);
1718 if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1721 pedwarn ("size in array new must have integral type");
1723 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1724 absdcl = TREE_OPERAND (absdcl, 0);
1725 if (this_nelts == integer_zero_node)
1727 warning ("zero size array reserves no space");
1728 nelts = integer_zero_node;
1731 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1735 nelts = integer_zero_node;
1739 TREE_OPERAND (last_absdcl, 0) = absdcl;
1741 TREE_VALUE (decl) = absdcl;
1743 type = groktypename (decl);
1744 if (! type || type == error_mark_node)
1745 return error_mark_node;
1747 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1749 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1751 /* An aggregate type. */
1752 type = IDENTIFIER_TYPE_VALUE (decl);
1753 decl = TYPE_MAIN_DECL (type);
1757 /* A builtin type. */
1758 decl = lookup_name (decl, 1);
1759 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1760 type = TREE_TYPE (decl);
1763 else if (TREE_CODE (decl) == TYPE_DECL)
1765 type = TREE_TYPE (decl);
1770 decl = TYPE_MAIN_DECL (type);
1773 if (processing_template_decl)
1776 t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
1777 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
1782 rval = build_min (NEW_EXPR, build_pointer_type (type),
1783 placement, t, init);
1784 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1788 /* ``A reference cannot be created by the new operator. A reference
1789 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1790 returned by new.'' ARM 5.3.3 */
1791 if (TREE_CODE (type) == REFERENCE_TYPE)
1793 error ("new cannot be applied to a reference type");
1794 type = TREE_TYPE (type);
1797 if (TREE_CODE (type) == FUNCTION_TYPE)
1799 error ("new cannot be applied to a function type");
1800 return error_mark_node;
1803 /* When the object being created is an array, the new-expression yields a
1804 pointer to the initial element (if any) of the array. For example,
1805 both new int and new int[10] return an int*. 5.3.4. */
1806 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
1808 nelts = array_type_nelts_top (type);
1810 type = TREE_TYPE (type);
1814 t = build_nt (ARRAY_REF, type, nelts);
1818 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
1819 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1820 TREE_SIDE_EFFECTS (rval) = 1;
1821 rval = build_new_1 (rval);
1822 if (rval == error_mark_node)
1823 return error_mark_node;
1825 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1826 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1827 TREE_NO_UNUSED_WARNING (rval) = 1;
1832 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1835 build_java_class_ref (tree type)
1837 tree name = NULL_TREE, class_decl;
1838 static tree CL_suffix = NULL_TREE;
1839 if (CL_suffix == NULL_TREE)
1840 CL_suffix = get_identifier("class$");
1841 if (jclass_node == NULL_TREE)
1843 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1844 if (jclass_node == NULL_TREE)
1845 fatal_error ("call to Java constructor, while `jclass' undefined");
1847 jclass_node = TREE_TYPE (jclass_node);
1850 /* Mangle the class$ field. */
1853 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1854 if (DECL_NAME (field) == CL_suffix)
1856 mangle_decl (field);
1857 name = DECL_ASSEMBLER_NAME (field);
1861 internal_error ("can't find class$");
1864 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1865 if (class_decl == NULL_TREE)
1867 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1868 TREE_STATIC (class_decl) = 1;
1869 DECL_EXTERNAL (class_decl) = 1;
1870 TREE_PUBLIC (class_decl) = 1;
1871 DECL_ARTIFICIAL (class_decl) = 1;
1872 DECL_IGNORED_P (class_decl) = 1;
1873 pushdecl_top_level (class_decl);
1874 make_decl_rtl (class_decl, NULL);
1879 /* Returns the size of the cookie to use when allocating an array
1880 whose elements have the indicated TYPE. Assumes that it is already
1881 known that a cookie is needed. */
1884 get_cookie_size (tree type)
1888 /* We need to allocate an additional max (sizeof (size_t), alignof
1889 (true_type)) bytes. */
1893 sizetype_size = size_in_bytes (sizetype);
1894 type_align = size_int (TYPE_ALIGN_UNIT (type));
1895 if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
1896 cookie_size = sizetype_size;
1898 cookie_size = type_align;
1903 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1904 value is immediately handed to expand_expr. */
1907 build_new_1 (tree exp)
1909 tree placement, init;
1910 tree true_type, size, rval, t;
1911 /* The type of the new-expression. (This type is always a pointer
1914 /* The type pointed to by POINTER_TYPE. */
1916 /* The type being allocated. For "new T[...]" this will be an
1919 /* A pointer type pointing to to the FULL_TYPE. */
1920 tree full_pointer_type;
1921 tree outer_nelts = NULL_TREE;
1922 tree nelts = NULL_TREE;
1923 tree alloc_call, alloc_expr;
1924 /* The address returned by the call to "operator new". This node is
1925 a VAR_DECL and is therefore reusable. */
1928 tree cookie_expr, init_expr;
1930 enum tree_code code;
1931 int nothrow, check_new;
1932 /* Nonzero if the user wrote `::new' rather than just `new'. */
1933 int globally_qualified_p;
1934 int use_java_new = 0;
1935 /* If non-NULL, the number of extra bytes to allocate at the
1936 beginning of the storage allocated for an array-new expression in
1937 order to store the number of elements. */
1938 tree cookie_size = NULL_TREE;
1939 /* True if the function we are calling is a placement allocation
1941 bool placement_allocation_fn_p;
1942 tree args = NULL_TREE;
1943 /* True if the storage must be initialized, either by a constructor
1944 or due to an explicit new-initializer. */
1945 bool is_initialized;
1946 /* The address of the thing allocated, not including any cookie. In
1947 particular, if an array cookie is in use, DATA_ADDR is the
1948 address of the first array element. This node is a VAR_DECL, and
1949 is therefore reusable. */
1952 placement = TREE_OPERAND (exp, 0);
1953 type = TREE_OPERAND (exp, 1);
1954 init = TREE_OPERAND (exp, 2);
1955 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1957 if (TREE_CODE (type) == ARRAY_REF)
1960 nelts = outer_nelts = TREE_OPERAND (type, 1);
1961 type = TREE_OPERAND (type, 0);
1963 /* Use an incomplete array type to avoid VLA headaches. */
1964 full_type = build_cplus_array_type (type, NULL_TREE);
1971 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1973 /* If our base type is an array, then make sure we know how many elements
1975 while (TREE_CODE (true_type) == ARRAY_TYPE)
1977 tree this_nelts = array_type_nelts_top (true_type);
1978 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1979 true_type = TREE_TYPE (true_type);
1982 if (!complete_type_or_else (true_type, exp))
1983 return error_mark_node;
1985 if (TREE_CODE (true_type) == VOID_TYPE)
1987 error ("invalid type `void' for new");
1988 return error_mark_node;
1991 if (abstract_virtuals_error (NULL_TREE, true_type))
1992 return error_mark_node;
1994 is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
1995 if (CP_TYPE_CONST_P (true_type) && !is_initialized)
1997 error ("uninitialized const in `new' of `%#T'", true_type);
1998 return error_mark_node;
2001 size = size_in_bytes (true_type);
2003 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2005 /* Allocate the object. */
2006 if (! placement && TYPE_FOR_JAVA (true_type))
2008 tree class_addr, alloc_decl;
2009 tree class_decl = build_java_class_ref (true_type);
2010 tree class_size = size_in_bytes (true_type);
2011 static const char alloc_name[] = "_Jv_AllocObject";
2013 if (!get_global_value_if_present (get_identifier (alloc_name),
2016 error ("call to Java constructor with `%s' undefined", alloc_name);
2017 return error_mark_node;
2019 else if (really_overloaded_fn (alloc_decl))
2021 error ("`%D' should never be overloaded", alloc_decl);
2022 return error_mark_node;
2024 alloc_decl = OVL_CURRENT (alloc_decl);
2025 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2026 alloc_call = (build_function_call
2028 tree_cons (NULL_TREE, class_addr,
2029 build_tree_list (NULL_TREE, class_size))));
2036 fnname = ansi_opname (code);
2038 if (!globally_qualified_p
2039 && CLASS_TYPE_P (true_type)
2041 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2042 : TYPE_HAS_NEW_OPERATOR (true_type)))
2044 /* Use a class-specific operator new. */
2045 /* If a cookie is required, add some extra space. */
2046 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2048 cookie_size = get_cookie_size (true_type);
2049 size = size_binop (PLUS_EXPR, size, cookie_size);
2051 /* Create the argument list. */
2052 args = tree_cons (NULL_TREE, size, placement);
2053 /* Do name-lookup to find the appropriate operator. */
2054 fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
2055 if (TREE_CODE (fns) == TREE_LIST)
2057 error ("request for member `%D' is ambiguous", fnname);
2058 print_candidates (fns);
2059 return error_mark_node;
2061 alloc_call = build_new_method_call (build_dummy_object (true_type),
2063 /*conversion_path=*/NULL_TREE,
2068 /* Use a global operator new. */
2069 /* See if a cookie might be required. */
2070 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2071 cookie_size = get_cookie_size (true_type);
2073 cookie_size = NULL_TREE;
2075 alloc_call = build_operator_new_call (fnname, placement,
2076 &size, &cookie_size);
2080 if (alloc_call == error_mark_node)
2081 return error_mark_node;
2083 /* In the simple case, we can stop now. */
2084 pointer_type = build_pointer_type (type);
2085 if (!cookie_size && !is_initialized)
2086 return build_nop (pointer_type, alloc_call);
2088 /* While we're working, use a pointer to the type we've actually
2089 allocated. Store the result of the call in a variable so that we
2090 can use it more than once. */
2091 full_pointer_type = build_pointer_type (full_type);
2092 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2093 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2095 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2096 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2097 alloc_call = TREE_OPERAND (alloc_call, 1);
2098 alloc_fn = get_callee_fndecl (alloc_call);
2099 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2101 /* Now, check to see if this function is actually a placement
2102 allocation function. This can happen even when PLACEMENT is NULL
2103 because we might have something like:
2105 struct S { void* operator new (size_t, int i = 0); };
2107 A call to `new S' will get this allocation function, even though
2108 there is no explicit placement argument. If there is more than
2109 one argument, or there are variable arguments, then this is a
2110 placement allocation function. */
2111 placement_allocation_fn_p
2112 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2113 || varargs_function_p (alloc_fn));
2115 /* Preevaluate the placement args so that we don't reevaluate them for a
2116 placement delete. */
2117 if (placement_allocation_fn_p)
2119 tree inits = NULL_TREE;
2120 t = TREE_CHAIN (TREE_OPERAND (alloc_call, 1));
2121 for (; t; t = TREE_CHAIN (t))
2122 if (TREE_SIDE_EFFECTS (TREE_VALUE (t)))
2125 TREE_VALUE (t) = stabilize_expr (TREE_VALUE (t), &init);
2127 inits = build (COMPOUND_EXPR, void_type_node, inits, init);
2132 alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2136 /* unless an allocation function is declared with an empty excep-
2137 tion-specification (_except.spec_), throw(), it indicates failure to
2138 allocate storage by throwing a bad_alloc exception (clause _except_,
2139 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2140 cation function is declared with an empty exception-specification,
2141 throw(), it returns null to indicate failure to allocate storage and a
2142 non-null pointer otherwise.
2144 So check for a null exception spec on the op new we just called. */
2146 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2147 check_new = (flag_check_new || nothrow) && ! use_java_new;
2153 /* Adjust so we're pointing to the start of the object. */
2154 data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2155 alloc_node, cookie_size));
2157 /* Store the number of bytes allocated so that we can know how
2158 many elements to destroy later. We use the last sizeof
2159 (size_t) bytes to store the number of elements. */
2160 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2161 data_addr, size_in_bytes (sizetype));
2162 cookie = build_indirect_ref (cookie, NULL);
2164 cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2165 data_addr = TARGET_EXPR_SLOT (data_addr);
2169 cookie_expr = NULL_TREE;
2170 data_addr = alloc_node;
2173 /* Now initialize the allocated object. */
2176 init_expr = build_indirect_ref (data_addr, NULL);
2178 if (init == void_zero_node)
2179 init = build_default_init (full_type, nelts);
2180 else if (init && pedantic && has_array)
2181 pedwarn ("ISO C++ forbids initialization in array new");
2185 = build_vec_init (init_expr,
2186 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2188 init, /*from_array=*/0);
2189 else if (TYPE_NEEDS_CONSTRUCTING (type))
2190 init_expr = build_special_member_call (init_expr,
2191 complete_ctor_identifier,
2192 init, TYPE_BINFO (true_type),
2196 /* We are processing something like `new int (10)', which
2197 means allocate an int, and initialize it with 10. */
2199 if (TREE_CODE (init) == TREE_LIST)
2200 init = build_x_compound_expr_from_list (init, "new initializer");
2202 else if (TREE_CODE (init) == CONSTRUCTOR
2203 && TREE_TYPE (init) == NULL_TREE)
2205 pedwarn ("ISO C++ forbids aggregate initializer to new");
2206 init = digest_init (type, init, 0);
2209 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2212 if (init_expr == error_mark_node)
2213 return error_mark_node;
2215 /* If any part of the object initialization terminates by throwing an
2216 exception and a suitable deallocation function can be found, the
2217 deallocation function is called to free the memory in which the
2218 object was being constructed, after which the exception continues
2219 to propagate in the context of the new-expression. If no
2220 unambiguous matching deallocation function can be found,
2221 propagating the exception does not cause the object's memory to be
2223 if (flag_exceptions && ! use_java_new)
2225 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2227 int flags = (LOOKUP_NORMAL
2228 | (globally_qualified_p * LOOKUP_GLOBAL));
2230 /* The Standard is unclear here, but the right thing to do
2231 is to use the same method for finding deallocation
2232 functions that we use for finding allocation functions. */
2233 flags |= LOOKUP_SPECULATIVELY;
2235 cleanup = build_op_delete_call (dcode, alloc_node, size, flags,
2236 (placement_allocation_fn_p
2237 ? alloc_call : NULL_TREE));
2239 /* Ack! First we allocate the memory. Then we set our sentry
2240 variable to true, and expand a cleanup that deletes the memory
2241 if sentry is true. Then we run the constructor, and finally
2244 It would be nice to be able to handle this without the sentry
2245 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2246 work. We allocate the space first, so if there are any
2247 temporaries with cleanups in the constructor args we need this
2248 EH region to extend until end of full-expression to preserve
2251 If the backend had some mechanism so that we could force the
2252 allocation to be expanded after all the other args to the
2253 constructor, that would fix the nesting problem and we could
2254 do away with this complexity. But that would complicate other
2255 things; in particular, it would make it difficult to bail out
2256 if the allocation function returns null. Er, no, it wouldn't;
2257 we just don't run the constructor. The standard says it's
2258 unspecified whether or not the args are evaluated.
2260 FIXME FIXME FIXME inline invisible refs as refs. That way we
2261 can preevaluate value parameters. */
2265 tree end, sentry, begin;
2267 begin = get_target_expr (boolean_true_node);
2268 CLEANUP_EH_ONLY (begin) = 1;
2270 sentry = TARGET_EXPR_SLOT (begin);
2272 TARGET_EXPR_CLEANUP (begin)
2273 = build (COND_EXPR, void_type_node, sentry,
2274 cleanup, void_zero_node);
2276 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2277 sentry, boolean_false_node);
2280 = build (COMPOUND_EXPR, void_type_node, begin,
2281 build (COMPOUND_EXPR, void_type_node, init_expr,
2287 init_expr = NULL_TREE;
2289 /* Now build up the return value in reverse order. */
2294 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2296 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2298 if (rval == alloc_node)
2299 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2300 and return the call (which doesn't need to be adjusted). */
2301 rval = TARGET_EXPR_INITIAL (alloc_expr);
2306 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2308 rval = build_conditional_expr (ifexp, rval, alloc_node);
2311 /* Perform the allocation before anything else, so that ALLOC_NODE
2312 has been initialized before we start using it. */
2313 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2316 /* Convert to the final type. */
2317 rval = build_nop (pointer_type, rval);
2319 /* A new-expression is never an lvalue. */
2320 if (real_lvalue_p (rval))
2321 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2327 build_vec_delete_1 (tree base, tree maxindex, tree type,
2328 special_function_kind auto_delete_vec, int use_global_delete)
2331 tree ptype = build_pointer_type (type = complete_type (type));
2332 tree size_exp = size_in_bytes (type);
2334 /* Temporary variables used by the loop. */
2335 tree tbase, tbase_init;
2337 /* This is the body of the loop that implements the deletion of a
2338 single element, and moves temp variables to next elements. */
2341 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2344 /* This is the thing that governs what to do after the loop has run. */
2345 tree deallocate_expr = 0;
2347 /* This is the BIND_EXPR which holds the outermost iterator of the
2348 loop. It is convenient to set this variable up and test it before
2349 executing any other code in the loop.
2350 This is also the containing expression returned by this function. */
2351 tree controller = NULL_TREE;
2353 /* We should only have 1-D arrays here. */
2354 if (TREE_CODE (type) == ARRAY_TYPE)
2357 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2360 /* The below is short by the cookie size. */
2361 virtual_size = size_binop (MULT_EXPR, size_exp,
2362 convert (sizetype, maxindex));
2364 tbase = create_temporary_var (ptype);
2365 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2366 fold (build (PLUS_EXPR, ptype,
2369 DECL_REGISTER (tbase) = 1;
2370 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2371 TREE_SIDE_EFFECTS (controller) = 1;
2373 body = build (EXIT_EXPR, void_type_node,
2374 build (EQ_EXPR, boolean_type_node, base, tbase));
2375 body = build_compound_expr
2376 (body, build_modify_expr (tbase, NOP_EXPR,
2377 build (MINUS_EXPR, ptype, tbase, size_exp)));
2378 body = build_compound_expr
2379 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2380 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2382 loop = build (LOOP_EXPR, void_type_node, body);
2383 loop = build_compound_expr (tbase_init, loop);
2386 /* If the delete flag is one, or anything else with the low bit set,
2387 delete the storage. */
2388 if (auto_delete_vec != sfk_base_destructor)
2392 /* The below is short by the cookie size. */
2393 virtual_size = size_binop (MULT_EXPR, size_exp,
2394 convert (sizetype, maxindex));
2396 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2403 cookie_size = get_cookie_size (type);
2405 = cp_convert (ptype,
2406 cp_build_binary_op (MINUS_EXPR,
2407 cp_convert (string_type_node,
2410 /* True size with header. */
2411 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2414 if (auto_delete_vec == sfk_deleting_destructor)
2415 deallocate_expr = build_x_delete (base_tbd,
2416 2 | use_global_delete,
2421 if (!deallocate_expr)
2424 body = deallocate_expr;
2426 body = build_compound_expr (body, deallocate_expr);
2429 body = integer_zero_node;
2431 /* Outermost wrapper: If pointer is null, punt. */
2432 body = fold (build (COND_EXPR, void_type_node,
2433 fold (build (NE_EXPR, boolean_type_node, base,
2434 integer_zero_node)),
2435 body, integer_zero_node));
2436 body = build1 (NOP_EXPR, void_type_node, body);
2440 TREE_OPERAND (controller, 1) = body;
2444 if (TREE_CODE (base) == SAVE_EXPR)
2445 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2446 body = build (COMPOUND_EXPR, void_type_node, base, body);
2448 return convert_to_void (body, /*implicit=*/NULL);
2451 /* Create an unnamed variable of the indicated TYPE. */
2454 create_temporary_var (tree type)
2458 decl = build_decl (VAR_DECL, NULL_TREE, type);
2459 TREE_USED (decl) = 1;
2460 DECL_ARTIFICIAL (decl) = 1;
2461 DECL_SOURCE_LOCATION (decl) = input_location;
2462 DECL_IGNORED_P (decl) = 1;
2463 DECL_CONTEXT (decl) = current_function_decl;
2468 /* Create a new temporary variable of the indicated TYPE, initialized
2471 It is not entered into current_binding_level, because that breaks
2472 things when it comes time to do final cleanups (which take place
2473 "outside" the binding contour of the function). */
2476 get_temp_regvar (tree type, tree init)
2480 decl = create_temporary_var (type);
2481 add_decl_stmt (decl);
2483 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2488 /* `build_vec_init' returns tree structure that performs
2489 initialization of a vector of aggregate types.
2491 BASE is a reference to the vector, of ARRAY_TYPE.
2492 MAXINDEX is the maximum index of the array (one less than the
2493 number of elements). It is only used if
2494 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2495 INIT is the (possibly NULL) initializer.
2497 FROM_ARRAY is 0 if we should init everything with INIT
2498 (i.e., every element initialized from INIT).
2499 FROM_ARRAY is 1 if we should index into INIT in parallel
2500 with initialization of DECL.
2501 FROM_ARRAY is 2 if we should index into INIT in parallel,
2502 but use assignment instead of initialization. */
2505 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2508 tree base2 = NULL_TREE;
2510 tree itype = NULL_TREE;
2512 /* The type of the array. */
2513 tree atype = TREE_TYPE (base);
2514 /* The type of an element in the array. */
2515 tree type = TREE_TYPE (atype);
2516 /* The type of a pointer to an element in the array. */
2521 tree try_block = NULL_TREE;
2522 tree try_body = NULL_TREE;
2523 int num_initialized_elts = 0;
2526 if (TYPE_DOMAIN (atype))
2527 maxindex = array_type_nelts (atype);
2529 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2530 return error_mark_node;
2534 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2535 : !TYPE_NEEDS_CONSTRUCTING (type))
2536 && ((TREE_CODE (init) == CONSTRUCTOR
2537 /* Don't do this if the CONSTRUCTOR might contain something
2538 that might throw and require us to clean up. */
2539 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2540 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2543 /* Do non-default initialization of POD arrays resulting from
2544 brace-enclosed initializers. In this case, digest_init and
2545 store_constructor will handle the semantics for us. */
2547 stmt_expr = build (INIT_EXPR, atype, base, init);
2551 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2552 ptype = build_pointer_type (type);
2553 size = size_in_bytes (type);
2554 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2555 base = cp_convert (ptype, decay_conversion (base));
2557 /* The code we are generating looks like:
2561 ptrdiff_t iterator = maxindex;
2563 for (; iterator != -1; --iterator) {
2564 ... initialize *t1 ...
2568 ... destroy elements that were constructed ...
2573 We can omit the try and catch blocks if we know that the
2574 initialization will never throw an exception, or if the array
2575 elements do not have destructors. We can omit the loop completely if
2576 the elements of the array do not have constructors.
2578 We actually wrap the entire body of the above in a STMT_EXPR, for
2581 When copying from array to another, when the array elements have
2582 only trivial copy constructors, we should use __builtin_memcpy
2583 rather than generating a loop. That way, we could take advantage
2584 of whatever cleverness the back-end has for dealing with copies
2585 of blocks of memory. */
2587 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2588 destroy_temps = stmts_are_full_exprs_p ();
2589 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2590 rval = get_temp_regvar (ptype, base);
2591 base = get_temp_regvar (ptype, rval);
2592 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2594 /* Protect the entire array initialization so that we can destroy
2595 the partially constructed array if an exception is thrown.
2596 But don't do this if we're assigning. */
2597 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2600 try_block = begin_try_block ();
2601 try_body = begin_compound_stmt (/*has_no_scope=*/true);
2604 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2606 /* Do non-default initialization of non-POD arrays resulting from
2607 brace-enclosed initializers. */
2612 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2614 tree elt = TREE_VALUE (elts);
2615 tree baseref = build1 (INDIRECT_REF, type, base);
2617 num_initialized_elts++;
2619 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2620 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2621 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2623 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2625 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2627 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2628 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2631 /* Clear out INIT so that we don't get confused below. */
2634 else if (from_array)
2636 /* If initializing one array from another, initialize element by
2637 element. We rely upon the below calls the do argument
2641 base2 = decay_conversion (init);
2642 itype = TREE_TYPE (base2);
2643 base2 = get_temp_regvar (itype, base2);
2644 itype = TREE_TYPE (itype);
2646 else if (TYPE_LANG_SPECIFIC (type)
2647 && TYPE_NEEDS_CONSTRUCTING (type)
2648 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2650 error ("initializer ends prematurely");
2651 return error_mark_node;
2655 /* Now, default-initialize any remaining elements. We don't need to
2656 do that if a) the type does not need constructing, or b) we've
2657 already initialized all the elements.
2659 We do need to keep going if we're copying an array. */
2662 || (TYPE_NEEDS_CONSTRUCTING (type)
2663 && ! (host_integerp (maxindex, 0)
2664 && (num_initialized_elts
2665 == tree_low_cst (maxindex, 0) + 1))))
2667 /* If the ITERATOR is equal to -1, then we don't have to loop;
2668 we've already initialized all the elements. */
2673 for_stmt = begin_for_stmt ();
2674 finish_for_init_stmt (for_stmt);
2675 finish_for_cond (build (NE_EXPR, boolean_type_node,
2676 iterator, integer_minus_one_node),
2678 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2681 /* Otherwise, loop through the elements. */
2682 for_body = begin_compound_stmt (/*has_no_scope=*/true);
2686 tree to = build1 (INDIRECT_REF, type, base);
2690 from = build1 (INDIRECT_REF, itype, base2);
2694 if (from_array == 2)
2695 elt_init = build_modify_expr (to, NOP_EXPR, from);
2696 else if (TYPE_NEEDS_CONSTRUCTING (type))
2697 elt_init = build_aggr_init (to, from, 0);
2699 elt_init = build_modify_expr (to, NOP_EXPR, from);
2703 else if (TREE_CODE (type) == ARRAY_TYPE)
2707 ("cannot initialize multi-dimensional array with initializer");
2708 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2712 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2715 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2716 finish_expr_stmt (elt_init);
2717 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2719 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2721 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2723 finish_compound_stmt (for_body);
2724 finish_for_stmt (for_stmt);
2727 /* Make sure to cleanup any partially constructed elements. */
2728 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2732 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2734 /* Flatten multi-dimensional array since build_vec_delete only
2735 expects one-dimensional array. */
2736 if (TREE_CODE (type) == ARRAY_TYPE)
2738 m = cp_build_binary_op (MULT_EXPR, m,
2739 array_type_nelts_total (type));
2740 type = strip_array_types (type);
2743 finish_compound_stmt (try_body);
2744 finish_cleanup_try_block (try_block);
2745 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2746 /*use_global_delete=*/0);
2747 finish_cleanup (e, try_block);
2750 /* The value of the array initialization is the array itself, RVAL
2751 is a pointer to the first element. */
2752 finish_stmt_expr_expr (rval);
2754 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2756 /* Now convert make the result have the correct type. */
2757 atype = build_pointer_type (atype);
2758 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2759 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2761 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2765 /* Free up storage of type TYPE, at address ADDR.
2767 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2770 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2771 used as the second argument to operator delete. It can include
2772 things like padding and magic size cookies. It has virtual in it,
2773 because if you have a base pointer and you delete through a virtual
2774 destructor, it should be the size of the dynamic object, not the
2775 static object, see Free Store 12.5 ISO C++.
2777 This does not call any destructors. */
2780 build_x_delete (tree addr, int which_delete, tree virtual_size)
2782 int use_global_delete = which_delete & 1;
2783 int use_vec_delete = !!(which_delete & 2);
2784 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2785 int flags = LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL);
2787 return build_op_delete_call (code, addr, virtual_size, flags, NULL_TREE);
2790 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2794 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2800 case sfk_complete_destructor:
2801 name = complete_dtor_identifier;
2804 case sfk_base_destructor:
2805 name = base_dtor_identifier;
2808 case sfk_deleting_destructor:
2809 name = deleting_dtor_identifier;
2816 exp = convert_from_reference (exp);
2817 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2818 return build_new_method_call (exp, fn,
2820 /*conversion_path=*/NULL_TREE,
2824 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2825 ADDR is an expression which yields the store to be destroyed.
2826 AUTO_DELETE is the name of the destructor to call, i.e., either
2827 sfk_complete_destructor, sfk_base_destructor, or
2828 sfk_deleting_destructor.
2830 FLAGS is the logical disjunction of zero or more LOOKUP_
2831 flags. See cp-tree.h for more info. */
2834 build_delete (tree type, tree addr, special_function_kind auto_delete,
2835 int flags, int use_global_delete)
2839 if (addr == error_mark_node)
2840 return error_mark_node;
2842 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2843 set to `error_mark_node' before it gets properly cleaned up. */
2844 if (type == error_mark_node)
2845 return error_mark_node;
2847 type = TYPE_MAIN_VARIANT (type);
2849 if (TREE_CODE (type) == POINTER_TYPE)
2851 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2852 if (TREE_CODE (type) == ARRAY_TYPE)
2855 if (VOID_TYPE_P (type)
2856 /* We don't want to warn about delete of void*, only other
2857 incomplete types. Deleting other incomplete types
2858 invokes undefined behavior, but it is not ill-formed, so
2859 compile to something that would even do The Right Thing
2860 (TM) should the type have a trivial dtor and no delete
2862 || !complete_type_or_diagnostic (type, addr, 1)
2863 || !IS_AGGR_TYPE (type))
2865 /* Call the builtin operator delete. */
2866 return build_builtin_delete_call (addr);
2868 if (TREE_SIDE_EFFECTS (addr))
2869 addr = save_expr (addr);
2871 /* Throw away const and volatile on target type of addr. */
2872 addr = convert_force (build_pointer_type (type), addr, 0);
2874 else if (TREE_CODE (type) == ARRAY_TYPE)
2878 if (TYPE_DOMAIN (type) == NULL_TREE)
2880 error ("unknown array size in delete");
2881 return error_mark_node;
2883 return build_vec_delete (addr, array_type_nelts (type),
2884 auto_delete, use_global_delete);
2888 /* Don't check PROTECT here; leave that decision to the
2889 destructor. If the destructor is accessible, call it,
2890 else report error. */
2891 addr = build_unary_op (ADDR_EXPR, addr, 0);
2892 if (TREE_SIDE_EFFECTS (addr))
2893 addr = save_expr (addr);
2895 addr = convert_force (build_pointer_type (type), addr, 0);
2898 my_friendly_assert (IS_AGGR_TYPE (type), 220);
2900 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2902 if (auto_delete != sfk_deleting_destructor)
2903 return void_zero_node;
2905 return build_op_delete_call
2906 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2907 LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL),
2912 tree do_delete = NULL_TREE;
2915 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2917 /* For `::delete x', we must not use the deleting destructor
2918 since then we would not be sure to get the global `operator
2920 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2922 /* We will use ADDR multiple times so we must save it. */
2923 addr = save_expr (addr);
2924 /* Delete the object. */
2925 do_delete = build_builtin_delete_call (addr);
2926 /* Otherwise, treat this like a complete object destructor
2928 auto_delete = sfk_complete_destructor;
2930 /* If the destructor is non-virtual, there is no deleting
2931 variant. Instead, we must explicitly call the appropriate
2932 `operator delete' here. */
2933 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2934 && auto_delete == sfk_deleting_destructor)
2936 /* We will use ADDR multiple times so we must save it. */
2937 addr = save_expr (addr);
2938 /* Build the call. */
2939 do_delete = build_op_delete_call (DELETE_EXPR,
2941 cxx_sizeof_nowarn (type),
2944 /* Call the complete object destructor. */
2945 auto_delete = sfk_complete_destructor;
2947 else if (auto_delete == sfk_deleting_destructor
2948 && TYPE_GETS_REG_DELETE (type))
2950 /* Make sure we have access to the member op delete, even though
2951 we'll actually be calling it from the destructor. */
2952 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2953 LOOKUP_NORMAL, NULL_TREE);
2956 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2957 auto_delete, flags);
2959 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2961 if (flags & LOOKUP_DESTRUCTOR)
2962 /* Explicit destructor call; don't check for null pointer. */
2963 ifexp = integer_one_node;
2965 /* Handle deleting a null pointer. */
2966 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2968 if (ifexp != integer_one_node)
2969 expr = build (COND_EXPR, void_type_node,
2970 ifexp, expr, void_zero_node);
2976 /* At the beginning of a destructor, push cleanups that will call the
2977 destructors for our base classes and members.
2979 Called from begin_destructor_body. */
2982 push_base_cleanups (void)
2985 int i, n_baseclasses;
2989 /* Run destructors for all virtual baseclasses. */
2990 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
2993 tree cond = (condition_conversion
2994 (build (BIT_AND_EXPR, integer_type_node,
2995 current_in_charge_parm,
2996 integer_two_node)));
2998 vbases = CLASSTYPE_VBASECLASSES (current_class_type);
2999 /* The CLASSTYPE_VBASECLASSES list is in initialization
3000 order, which is also the right order for pushing cleanups. */
3002 vbases = TREE_CHAIN (vbases))
3004 tree vbase = TREE_VALUE (vbases);
3005 tree base_type = BINFO_TYPE (vbase);
3007 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3009 expr = build_special_member_call (current_class_ref,
3010 base_dtor_identifier,
3014 | LOOKUP_NONVIRTUAL));
3015 expr = build (COND_EXPR, void_type_node, cond,
3016 expr, void_zero_node);
3017 finish_decl_cleanup (NULL_TREE, expr);
3022 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3023 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3025 /* Take care of the remaining baseclasses. */
3026 for (i = 0; i < n_baseclasses; i++)
3028 tree base_binfo = TREE_VEC_ELT (binfos, i);
3029 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3030 || TREE_VIA_VIRTUAL (base_binfo))
3033 expr = build_special_member_call (current_class_ref,
3034 base_dtor_identifier,
3035 NULL_TREE, base_binfo,
3036 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3037 finish_decl_cleanup (NULL_TREE, expr);
3040 for (member = TYPE_FIELDS (current_class_type); member;
3041 member = TREE_CHAIN (member))
3043 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3045 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3047 tree this_member = (build_class_member_access_expr
3048 (current_class_ref, member,
3049 /*access_path=*/NULL_TREE,
3050 /*preserve_reference=*/false));
3051 tree this_type = TREE_TYPE (member);
3052 expr = build_delete (this_type, this_member,
3053 sfk_complete_destructor,
3054 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3056 finish_decl_cleanup (NULL_TREE, expr);
3061 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3064 build_vbase_delete (tree type, tree decl)
3066 tree vbases = CLASSTYPE_VBASECLASSES (type);
3068 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3070 my_friendly_assert (addr != error_mark_node, 222);
3072 for (result = convert_to_void (integer_zero_node, NULL);
3073 vbases; vbases = TREE_CHAIN (vbases))
3075 tree base_addr = convert_force
3076 (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))), addr, 0);
3077 tree base_delete = build_delete
3078 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
3079 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
3081 result = build_compound_expr (result, base_delete);
3086 /* Build a C++ vector delete expression.
3087 MAXINDEX is the number of elements to be deleted.
3088 ELT_SIZE is the nominal size of each element in the vector.
3089 BASE is the expression that should yield the store to be deleted.
3090 This function expands (or synthesizes) these calls itself.
3091 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3093 This also calls delete for virtual baseclasses of elements of the vector.
3095 Update: MAXINDEX is no longer needed. The size can be extracted from the
3096 start of the vector for pointers, and from the type for arrays. We still
3097 use MAXINDEX for arrays because it happens to already have one of the
3098 values we'd have to extract. (We could use MAXINDEX with pointers to
3099 confirm the size, and trap if the numbers differ; not clear that it'd
3100 be worth bothering.) */
3103 build_vec_delete (tree base, tree maxindex,
3104 special_function_kind auto_delete_vec, int use_global_delete)
3108 tree base_init = NULL_TREE;
3110 type = TREE_TYPE (base);
3112 if (TREE_CODE (type) == POINTER_TYPE)
3114 /* Step back one from start of vector, and read dimension. */
3117 if (TREE_SIDE_EFFECTS (base))
3119 base_init = get_target_expr (base);
3120 base = TARGET_EXPR_SLOT (base_init);
3122 type = strip_array_types (TREE_TYPE (type));
3123 cookie_addr = build (MINUS_EXPR,
3124 build_pointer_type (sizetype),
3126 TYPE_SIZE_UNIT (sizetype));
3127 maxindex = build_indirect_ref (cookie_addr, NULL);
3129 else if (TREE_CODE (type) == ARRAY_TYPE)
3131 /* Get the total number of things in the array, maxindex is a
3133 maxindex = array_type_nelts_total (type);
3134 type = strip_array_types (type);
3135 base = build_unary_op (ADDR_EXPR, base, 1);
3136 if (TREE_SIDE_EFFECTS (base))
3138 base_init = get_target_expr (base);
3139 base = TARGET_EXPR_SLOT (base_init);
3144 if (base != error_mark_node)
3145 error ("type to vector delete is neither pointer or array type");
3146 return error_mark_node;
3149 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3152 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);