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"
39 static bool begin_init_stmts (tree *, tree *);
40 static tree finish_init_stmts (bool, tree, tree);
41 static void construct_virtual_base (tree, tree);
42 static void expand_aggr_init_1 (tree, tree, tree, tree, int);
43 static void expand_default_init (tree, tree, tree, tree, int);
44 static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int);
45 static void perform_member_init (tree, tree);
46 static tree build_builtin_delete_call (tree);
47 static int member_init_ok_or_else (tree, tree, tree);
48 static void expand_virtual_init (tree, tree);
49 static tree sort_mem_initializers (tree, tree);
50 static tree initializing_context (tree);
51 static void expand_cleanup_for_base (tree, tree);
52 static tree get_temp_regvar (tree, tree);
53 static tree dfs_initialize_vtbl_ptrs (tree, void *);
54 static tree build_default_init (tree, tree);
55 static tree build_new_1 (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 (BCS_NO_SCOPE);
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) || BINFO_VIRTUAL_P (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. */
252 TREE_CONSTANT (init) = 1;
253 TREE_INVARIANT (init) = 1;
259 /* Build an expression for the default-initialization of an object of
260 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
261 ARRAY_TYPE, NELTS is the number of elements in the array. If
262 initialization of TYPE requires calling constructors, this function
263 returns NULL_TREE; the caller is responsible for arranging for the
264 constructors to be called. */
267 build_default_init (tree type, tree nelts)
271 To default-initialize an object of type T means:
273 --if T is a non-POD class type (clause _class_), the default construc-
274 tor for T is called (and the initialization is ill-formed if T has
275 no accessible default constructor);
277 --if T is an array type, each element is default-initialized;
279 --otherwise, the storage for the object is zero-initialized.
281 A program that calls for default-initialization of an entity of refer-
282 ence type is ill-formed. */
284 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
285 performing the initialization. This is confusing in that some
286 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
287 a class with a pointer-to-data member as a non-static data member
288 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
289 passing non-PODs to build_zero_init below, which is contrary to
290 the semantics quoted above from [dcl.init].
292 It happens, however, that the behavior of the constructor the
293 standard says we should have generated would be precisely the
294 same as that obtained by calling build_zero_init below, so things
296 if (TYPE_NEEDS_CONSTRUCTING (type)
297 || (nelts && TREE_CODE (nelts) != INTEGER_CST))
300 /* At this point, TYPE is either a POD class type, an array of POD
301 classes, or something even more innocuous. */
302 return build_zero_init (type, nelts, /*static_storage_p=*/false);
305 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
306 arguments. If TREE_LIST is void_type_node, an empty initializer
307 list was given; if NULL_TREE no initializer was given. */
310 perform_member_init (tree member, tree init)
313 tree type = TREE_TYPE (member);
316 explicit = (init != NULL_TREE);
318 /* Effective C++ rule 12 requires that all data members be
320 if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
321 warning ("`%D' should be initialized in the member initialization "
325 if (init == void_type_node)
328 /* Get an lvalue for the data member. */
329 decl = build_class_member_access_expr (current_class_ref, member,
330 /*access_path=*/NULL_TREE,
331 /*preserve_reference=*/true);
332 if (decl == error_mark_node)
335 /* Deal with this here, as we will get confused if we try to call the
336 assignment op for an anonymous union. This can happen in a
337 synthesized copy constructor. */
338 if (ANON_AGGR_TYPE_P (type))
342 init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
343 finish_expr_stmt (init);
346 else if (TYPE_NEEDS_CONSTRUCTING (type))
349 && TREE_CODE (type) == ARRAY_TYPE
351 && TREE_CHAIN (init) == NULL_TREE
352 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
354 /* Initialization of one array from another. */
355 finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
359 finish_expr_stmt (build_aggr_init (decl, init, 0));
363 if (init == NULL_TREE)
367 init = build_default_init (type, /*nelts=*/NULL_TREE);
368 if (TREE_CODE (type) == REFERENCE_TYPE)
370 ("default-initialization of `%#D', which has reference type",
373 /* member traversal: note it leaves init NULL */
374 else if (TREE_CODE (type) == REFERENCE_TYPE)
375 pedwarn ("uninitialized reference member `%D'", member);
376 else if (CP_TYPE_CONST_P (type))
377 pedwarn ("uninitialized member `%D' with `const' type `%T'",
380 else if (TREE_CODE (init) == TREE_LIST)
381 /* There was an explicit member initialization. Do some work
383 init = build_x_compound_expr_from_list (init, "member initializer");
386 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
389 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
393 expr = build_class_member_access_expr (current_class_ref, member,
394 /*access_path=*/NULL_TREE,
395 /*preserve_reference=*/false);
396 expr = build_delete (type, expr, sfk_complete_destructor,
397 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
399 if (expr != error_mark_node)
400 finish_eh_cleanup (expr);
404 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
405 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
408 build_field_list (tree t, tree list, int *uses_unions_p)
414 /* Note whether or not T is a union. */
415 if (TREE_CODE (t) == UNION_TYPE)
418 for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
420 /* Skip CONST_DECLs for enumeration constants and so forth. */
421 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
424 /* Keep track of whether or not any fields are unions. */
425 if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
428 /* For an anonymous struct or union, we must recursively
429 consider the fields of the anonymous type. They can be
430 directly initialized from the constructor. */
431 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
433 /* Add this field itself. Synthesized copy constructors
434 initialize the entire aggregate. */
435 list = tree_cons (fields, NULL_TREE, list);
436 /* And now add the fields in the anonymous aggregate. */
437 list = build_field_list (TREE_TYPE (fields), list,
440 /* Add this field. */
441 else if (DECL_NAME (fields))
442 list = tree_cons (fields, NULL_TREE, list);
448 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
449 a FIELD_DECL or BINFO in T that needs initialization. The
450 TREE_VALUE gives the initializer, or list of initializer arguments.
452 Return a TREE_LIST containing all of the initializations required
453 for T, in the order in which they should be performed. The output
454 list has the same format as the input. */
457 sort_mem_initializers (tree t, tree mem_inits)
466 /* Build up a list of initializations. The TREE_PURPOSE of entry
467 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
468 TREE_VALUE will be the constructor arguments, or NULL if no
469 explicit initialization was provided. */
470 sorted_inits = NULL_TREE;
472 /* Process the virtual bases. */
473 for (i = 0; (base = VEC_iterate
474 (tree, CLASSTYPE_VBASECLASSES (t), i)); i++)
475 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
477 /* Process the direct bases. */
478 for (i = 0; i < BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); ++i)
480 base = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
481 if (!BINFO_VIRTUAL_P (base))
482 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
484 /* Process the non-static data members. */
485 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
486 /* Reverse the entire list of initializations, so that they are in
487 the order that they will actually be performed. */
488 sorted_inits = nreverse (sorted_inits);
490 /* If the user presented the initializers in an order different from
491 that in which they will actually occur, we issue a warning. Keep
492 track of the next subobject which can be explicitly initialized
493 without issuing a warning. */
494 next_subobject = sorted_inits;
496 /* Go through the explicit initializers, filling in TREE_PURPOSE in
498 for (init = mem_inits; init; init = TREE_CHAIN (init))
503 subobject = TREE_PURPOSE (init);
505 /* If the explicit initializers are in sorted order, then
506 SUBOBJECT will be NEXT_SUBOBJECT, or something following
508 for (subobject_init = next_subobject;
510 subobject_init = TREE_CHAIN (subobject_init))
511 if (TREE_PURPOSE (subobject_init) == subobject)
514 /* Issue a warning if the explicit initializer order does not
515 match that which will actually occur. */
516 if (warn_reorder && !subobject_init)
518 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
519 cp_warning_at ("`%D' will be initialized after",
520 TREE_PURPOSE (next_subobject));
522 warning ("base `%T' will be initialized after",
523 TREE_PURPOSE (next_subobject));
524 if (TREE_CODE (subobject) == FIELD_DECL)
525 cp_warning_at (" `%#D'", subobject);
527 warning (" base `%T'", subobject);
528 warning (" when initialized here");
531 /* Look again, from the beginning of the list. */
534 subobject_init = sorted_inits;
535 while (TREE_PURPOSE (subobject_init) != subobject)
536 subobject_init = TREE_CHAIN (subobject_init);
539 /* It is invalid to initialize the same subobject more than
541 if (TREE_VALUE (subobject_init))
543 if (TREE_CODE (subobject) == FIELD_DECL)
544 error ("multiple initializations given for `%D'", subobject);
546 error ("multiple initializations given for base `%T'",
550 /* Record the initialization. */
551 TREE_VALUE (subobject_init) = TREE_VALUE (init);
552 next_subobject = subobject_init;
557 If a ctor-initializer specifies more than one mem-initializer for
558 multiple members of the same union (including members of
559 anonymous unions), the ctor-initializer is ill-formed. */
562 tree last_field = NULL_TREE;
563 for (init = sorted_inits; init; init = TREE_CHAIN (init))
569 /* Skip uninitialized members and base classes. */
570 if (!TREE_VALUE (init)
571 || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
573 /* See if this field is a member of a union, or a member of a
574 structure contained in a union, etc. */
575 field = TREE_PURPOSE (init);
576 for (field_type = DECL_CONTEXT (field);
577 !same_type_p (field_type, t);
578 field_type = TYPE_CONTEXT (field_type))
579 if (TREE_CODE (field_type) == UNION_TYPE)
581 /* If this field is not a member of a union, skip it. */
582 if (TREE_CODE (field_type) != UNION_TYPE)
585 /* It's only an error if we have two initializers for the same
593 /* See if LAST_FIELD and the field initialized by INIT are
594 members of the same union. If so, there's a problem,
595 unless they're actually members of the same structure
596 which is itself a member of a union. For example, given:
598 union { struct { int i; int j; }; };
600 initializing both `i' and `j' makes sense. */
601 field_type = DECL_CONTEXT (field);
605 tree last_field_type;
607 last_field_type = DECL_CONTEXT (last_field);
610 if (same_type_p (last_field_type, field_type))
612 if (TREE_CODE (field_type) == UNION_TYPE)
613 error ("initializations for multiple members of `%T'",
619 if (same_type_p (last_field_type, t))
622 last_field_type = TYPE_CONTEXT (last_field_type);
625 /* If we've reached the outermost class, then we're
627 if (same_type_p (field_type, t))
630 field_type = TYPE_CONTEXT (field_type);
641 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
642 is a TREE_LIST giving the explicit mem-initializer-list for the
643 constructor. The TREE_PURPOSE of each entry is a subobject (a
644 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
645 is a TREE_LIST giving the arguments to the constructor or
646 void_type_node for an empty list of arguments. */
649 emit_mem_initializers (tree mem_inits)
651 /* Sort the mem-initializers into the order in which the
652 initializations should be performed. */
653 mem_inits = sort_mem_initializers (current_class_type, mem_inits);
655 in_base_initializer = 1;
657 /* Initialize base classes. */
659 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
661 tree subobject = TREE_PURPOSE (mem_inits);
662 tree arguments = TREE_VALUE (mem_inits);
664 /* If these initializations are taking place in a copy
665 constructor, the base class should probably be explicitly
667 if (extra_warnings && !arguments
668 && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
669 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
670 warning ("base class `%#T' should be explicitly initialized in the "
672 BINFO_TYPE (subobject));
674 /* If an explicit -- but empty -- initializer list was present,
675 treat it just like default initialization at this point. */
676 if (arguments == void_type_node)
677 arguments = NULL_TREE;
679 /* Initialize the base. */
680 if (BINFO_VIRTUAL_P (subobject))
681 construct_virtual_base (subobject, arguments);
686 base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
688 expand_aggr_init_1 (subobject, NULL_TREE,
689 build_indirect_ref (base_addr, NULL),
692 expand_cleanup_for_base (subobject, NULL_TREE);
695 mem_inits = TREE_CHAIN (mem_inits);
697 in_base_initializer = 0;
699 /* Initialize the vptrs. */
700 initialize_vtbl_ptrs (current_class_ptr);
702 /* Initialize the data members. */
705 perform_member_init (TREE_PURPOSE (mem_inits),
706 TREE_VALUE (mem_inits));
707 mem_inits = TREE_CHAIN (mem_inits);
711 /* Returns the address of the vtable (i.e., the value that should be
712 assigned to the vptr) for BINFO. */
715 build_vtbl_address (tree binfo)
717 tree binfo_for = binfo;
720 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo)
721 && BINFO_PRIMARY_P (binfo))
722 /* If this is a virtual primary base, then the vtable we want to store
723 is that for the base this is being used as the primary base of. We
724 can't simply skip the initialization, because we may be expanding the
725 inits of a subobject constructor where the virtual base layout
727 while (BINFO_PRIMARY_BASE_OF (binfo_for))
728 binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
730 /* Figure out what vtable BINFO's vtable is based on, and mark it as
732 vtbl = get_vtbl_decl_for_binfo (binfo_for);
733 assemble_external (vtbl);
734 TREE_USED (vtbl) = 1;
736 /* Now compute the address to use when initializing the vptr. */
737 vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
738 if (TREE_CODE (vtbl) == VAR_DECL)
739 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
744 /* This code sets up the virtual function tables appropriate for
745 the pointer DECL. It is a one-ply initialization.
747 BINFO is the exact type that DECL is supposed to be. In
748 multiple inheritance, this might mean "C's A" if C : A, B. */
751 expand_virtual_init (tree binfo, tree decl)
756 /* Compute the initializer for vptr. */
757 vtbl = build_vtbl_address (binfo);
759 /* We may get this vptr from a VTT, if this is a subobject
760 constructor or subobject destructor. */
761 vtt_index = BINFO_VPTR_INDEX (binfo);
767 /* Compute the value to use, when there's a VTT. */
768 vtt_parm = current_vtt_parm;
769 vtbl2 = build (PLUS_EXPR,
770 TREE_TYPE (vtt_parm),
773 vtbl2 = build_indirect_ref (vtbl2, NULL);
774 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
776 /* The actual initializer is the VTT value only in the subobject
777 constructor. In maybe_clone_body we'll substitute NULL for
778 the vtt_parm in the case of the non-subobject constructor. */
779 vtbl = build (COND_EXPR,
781 build (EQ_EXPR, boolean_type_node,
782 current_in_charge_parm, integer_zero_node),
787 /* Compute the location of the vtpr. */
788 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
790 my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
792 /* Assign the vtable to the vptr. */
793 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
794 finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
797 /* If an exception is thrown in a constructor, those base classes already
798 constructed must be destroyed. This function creates the cleanup
799 for BINFO, which has just been constructed. If FLAG is non-NULL,
800 it is a DECL which is nonzero when this base needs to be
804 expand_cleanup_for_base (tree binfo, tree flag)
808 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
811 /* Call the destructor. */
812 expr = build_special_member_call (current_class_ref,
813 base_dtor_identifier,
816 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
818 expr = fold (build (COND_EXPR, void_type_node,
819 c_common_truthvalue_conversion (flag),
820 expr, integer_zero_node));
822 finish_eh_cleanup (expr);
825 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
829 construct_virtual_base (tree vbase, tree arguments)
835 /* If there are virtual base classes with destructors, we need to
836 emit cleanups to destroy them if an exception is thrown during
837 the construction process. These exception regions (i.e., the
838 period during which the cleanups must occur) begin from the time
839 the construction is complete to the end of the function. If we
840 create a conditional block in which to initialize the
841 base-classes, then the cleanup region for the virtual base begins
842 inside a block, and ends outside of that block. This situation
843 confuses the sjlj exception-handling code. Therefore, we do not
844 create a single conditional block, but one for each
845 initialization. (That way the cleanup regions always begin
846 in the outer block.) We trust the back-end to figure out
847 that the FLAG will not change across initializations, and
848 avoid doing multiple tests. */
849 flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
850 inner_if_stmt = begin_if_stmt ();
851 finish_if_stmt_cond (flag, inner_if_stmt);
853 /* Compute the location of the virtual base. If we're
854 constructing virtual bases, then we must be the most derived
855 class. Therefore, we don't have to look up the virtual base;
856 we already know where it is. */
857 exp = convert_to_base_statically (current_class_ref, vbase);
859 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
861 finish_then_clause (inner_if_stmt);
862 finish_if_stmt (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 (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type)))
947 error ("unnamed initializer for `%T', which has no base classes",
951 basetype = BINFO_TYPE
952 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0));
955 error ("unnamed initializer for `%T', which uses multiple inheritance",
960 else if (TYPE_P (name))
962 basetype = TYPE_MAIN_VARIANT (name);
963 name = TYPE_NAME (name);
965 else if (TREE_CODE (name) == TYPE_DECL)
966 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
968 basetype = NULL_TREE;
977 if (current_template_parms)
980 class_binfo = TYPE_BINFO (current_class_type);
981 direct_binfo = NULL_TREE;
982 virtual_binfo = NULL_TREE;
984 /* Look for a direct base. */
985 for (i = 0; i < BINFO_N_BASE_BINFOS (class_binfo); ++i)
987 (basetype, BINFO_TYPE
988 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), i))))
990 direct_binfo = BINFO_BASE_BINFO (class_binfo, i);
993 /* Look for a virtual base -- unless the direct base is itself
995 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo))
996 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
1000 If a mem-initializer-id is ambiguous because it designates
1001 both a direct non-virtual base class and an inherited virtual
1002 base class, the mem-initializer is ill-formed. */
1003 if (direct_binfo && virtual_binfo)
1005 error ("'%D' is both a direct base and an indirect virtual base",
1010 if (!direct_binfo && !virtual_binfo)
1012 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1013 error ("type `%D' is not a direct or virtual base of `%T'",
1014 name, current_class_type);
1016 error ("type `%D' is not a direct base of `%T'",
1017 name, current_class_type);
1021 return direct_binfo ? direct_binfo : virtual_binfo;
1025 if (TREE_CODE (name) == IDENTIFIER_NODE)
1026 field = lookup_field (current_class_type, name, 1, false);
1030 if (member_init_ok_or_else (field, current_class_type, name))
1037 /* This is like `expand_member_init', only it stores one aggregate
1040 INIT comes in two flavors: it is either a value which
1041 is to be stored in EXP, or it is a parameter list
1042 to go to a constructor, which will operate on EXP.
1043 If INIT is not a parameter list for a constructor, then set
1044 LOOKUP_ONLYCONVERTING.
1045 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1046 the initializer, if FLAGS is 0, then it is the (init) form.
1047 If `init' is a CONSTRUCTOR, then we emit a warning message,
1048 explaining that such initializations are invalid.
1050 If INIT resolves to a CALL_EXPR which happens to return
1051 something of the type we are looking for, then we know
1052 that we can safely use that call to perform the
1055 The virtual function table pointer cannot be set up here, because
1056 we do not really know its type.
1058 This never calls operator=().
1060 When initializing, nothing is CONST.
1062 A default copy constructor may have to be used to perform the
1065 A constructor or a conversion operator may have to be used to
1066 perform the initialization, but not both, as it would be ambiguous. */
1069 build_aggr_init (tree exp, tree init, int flags)
1074 tree type = TREE_TYPE (exp);
1075 int was_const = TREE_READONLY (exp);
1076 int was_volatile = TREE_THIS_VOLATILE (exp);
1079 if (init == error_mark_node)
1080 return error_mark_node;
1082 TREE_READONLY (exp) = 0;
1083 TREE_THIS_VOLATILE (exp) = 0;
1085 if (init && TREE_CODE (init) != TREE_LIST)
1086 flags |= LOOKUP_ONLYCONVERTING;
1088 if (TREE_CODE (type) == ARRAY_TYPE)
1092 /* An array may not be initialized use the parenthesized
1093 initialization form -- unless the initializer is "()". */
1094 if (init && TREE_CODE (init) == TREE_LIST)
1096 error ("bad array initializer");
1097 return error_mark_node;
1099 /* Must arrange to initialize each element of EXP
1100 from elements of INIT. */
1101 itype = init ? TREE_TYPE (init) : NULL_TREE;
1102 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1103 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1104 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1105 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1106 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1107 itype && same_type_p (itype,
1109 TREE_READONLY (exp) = was_const;
1110 TREE_THIS_VOLATILE (exp) = was_volatile;
1111 TREE_TYPE (exp) = type;
1113 TREE_TYPE (init) = itype;
1117 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1118 /* Just know that we've seen something for this node. */
1119 TREE_USED (exp) = 1;
1121 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1122 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1123 destroy_temps = stmts_are_full_exprs_p ();
1124 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1125 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1126 init, LOOKUP_NORMAL|flags);
1127 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1128 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1129 TREE_TYPE (exp) = type;
1130 TREE_READONLY (exp) = was_const;
1131 TREE_THIS_VOLATILE (exp) = was_volatile;
1136 /* Like build_aggr_init, but not just for aggregates. */
1139 build_init (tree decl, tree init, int flags)
1143 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1144 expr = build_aggr_init (decl, init, flags);
1145 else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1146 expr = build_special_member_call (decl, complete_ctor_identifier,
1147 build_tree_list (NULL_TREE, init),
1149 LOOKUP_NORMAL|flags);
1151 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1157 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1159 tree type = TREE_TYPE (exp);
1162 /* It fails because there may not be a constructor which takes
1163 its own type as the first (or only parameter), but which does
1164 take other types via a conversion. So, if the thing initializing
1165 the expression is a unit element of type X, first try X(X&),
1166 followed by initialization by X. If neither of these work
1167 out, then look hard. */
1171 if (init && TREE_CODE (init) != TREE_LIST
1172 && (flags & LOOKUP_ONLYCONVERTING))
1174 /* Base subobjects should only get direct-initialization. */
1175 if (true_exp != exp)
1178 if (flags & DIRECT_BIND)
1179 /* Do nothing. We hit this in two cases: Reference initialization,
1180 where we aren't initializing a real variable, so we don't want
1181 to run a new constructor; and catching an exception, where we
1182 have already built up the constructor call so we could wrap it
1183 in an exception region. */;
1184 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1186 /* A brace-enclosed initializer for an aggregate. */
1187 my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1188 init = digest_init (type, init, (tree *)NULL);
1191 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1193 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1194 /* We need to protect the initialization of a catch parm with a
1195 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1196 around the TARGET_EXPR for the copy constructor. See
1197 initialize_handler_parm. */
1199 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1200 TREE_OPERAND (init, 0));
1201 TREE_TYPE (init) = void_type_node;
1204 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1205 TREE_SIDE_EFFECTS (init) = 1;
1206 finish_expr_stmt (init);
1210 if (init == NULL_TREE
1211 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1215 init = TREE_VALUE (parms);
1218 parms = build_tree_list (NULL_TREE, init);
1220 if (true_exp == exp)
1221 ctor_name = complete_ctor_identifier;
1223 ctor_name = base_ctor_identifier;
1225 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1226 if (TREE_SIDE_EFFECTS (rval))
1227 finish_expr_stmt (convert_to_void (rval, NULL));
1230 /* This function is responsible for initializing EXP with INIT
1233 BINFO is the binfo of the type for who we are performing the
1234 initialization. For example, if W is a virtual base class of A and B,
1236 If we are initializing B, then W must contain B's W vtable, whereas
1237 were we initializing C, W must contain C's W vtable.
1239 TRUE_EXP is nonzero if it is the true expression being initialized.
1240 In this case, it may be EXP, or may just contain EXP. The reason we
1241 need this is because if EXP is a base element of TRUE_EXP, we
1242 don't necessarily know by looking at EXP where its virtual
1243 baseclass fields should really be pointing. But we do know
1244 from TRUE_EXP. In constructors, we don't know anything about
1245 the value being initialized.
1247 FLAGS is just passed to `build_new_method_call'. See that function
1248 for its description. */
1251 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1253 tree type = TREE_TYPE (exp);
1255 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1256 my_friendly_assert (building_stmt_tree (), 20021010);
1258 /* Use a function returning the desired type to initialize EXP for us.
1259 If the function is a constructor, and its first argument is
1260 NULL_TREE, know that it was meant for us--just slide exp on
1261 in and expand the constructor. Constructors now come
1264 if (init && TREE_CODE (exp) == VAR_DECL
1265 && TREE_CODE (init) == CONSTRUCTOR
1266 && TREE_HAS_CONSTRUCTOR (init))
1268 /* If store_init_value returns NULL_TREE, the INIT has been
1269 record in the DECL_INITIAL for EXP. That means there's
1270 nothing more we have to do. */
1271 init = store_init_value (exp, init);
1273 finish_expr_stmt (init);
1277 /* We know that expand_default_init can handle everything we want
1279 expand_default_init (binfo, true_exp, exp, init, flags);
1282 /* Report an error if TYPE is not a user-defined, aggregate type. If
1283 OR_ELSE is nonzero, give an error message. */
1286 is_aggr_type (tree type, int or_else)
1288 if (type == error_mark_node)
1291 if (! IS_AGGR_TYPE (type)
1292 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1293 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1296 error ("`%T' is not an aggregate type", type);
1303 get_type_value (tree name)
1305 if (name == error_mark_node)
1308 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1309 return IDENTIFIER_TYPE_VALUE (name);
1314 /* Build a reference to a member of an aggregate. This is not a C++
1315 `&', but really something which can have its address taken, and
1316 then act as a pointer to member, for example TYPE :: FIELD can have
1317 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1318 this expression is the operand of "&".
1320 @@ Prints out lousy diagnostics for operator <typename>
1323 @@ This function should be rewritten and placed in search.c. */
1326 build_offset_ref (tree type, tree name, bool address_p)
1330 tree basebinfo = NULL_TREE;
1331 tree orig_name = name;
1333 /* class templates can come in as TEMPLATE_DECLs here. */
1334 if (TREE_CODE (name) == TEMPLATE_DECL)
1337 if (processing_template_decl || uses_template_parms (type))
1338 return build_min_nt (SCOPE_REF, type, name);
1340 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1342 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1343 something like `a.template f<int>' or the like. For the most
1344 part, we treat this just like a.f. We do remember, however,
1345 the template-id that was used. */
1346 name = TREE_OPERAND (orig_name, 0);
1349 name = DECL_NAME (name);
1352 if (TREE_CODE (name) == COMPONENT_REF)
1353 name = TREE_OPERAND (name, 1);
1354 if (TREE_CODE (name) == OVERLOAD)
1355 name = DECL_NAME (OVL_CURRENT (name));
1358 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1361 if (type == NULL_TREE)
1362 return error_mark_node;
1364 /* Handle namespace names fully here. */
1365 if (TREE_CODE (type) == NAMESPACE_DECL)
1367 tree t = lookup_namespace_name (type, name);
1368 if (t == error_mark_node)
1370 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1371 /* Reconstruct the TEMPLATE_ID_EXPR. */
1372 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1373 t, TREE_OPERAND (orig_name, 1));
1374 if (! type_unknown_p (t))
1377 t = convert_from_reference (t);
1382 if (! is_aggr_type (type, 1))
1383 return error_mark_node;
1385 if (TREE_CODE (name) == BIT_NOT_EXPR)
1387 if (! check_dtor_name (type, name))
1388 error ("qualified type `%T' does not match destructor name `~%T'",
1389 type, TREE_OPERAND (name, 0));
1390 name = dtor_identifier;
1393 if (!COMPLETE_TYPE_P (complete_type (type))
1394 && !TYPE_BEING_DEFINED (type))
1396 error ("incomplete type `%T' does not have member `%D'", type,
1398 return error_mark_node;
1401 decl = maybe_dummy_object (type, &basebinfo);
1403 if (BASELINK_P (name) || DECL_P (name))
1407 member = lookup_member (basebinfo, name, 1, 0);
1409 if (member == error_mark_node)
1410 return error_mark_node;
1415 error ("`%D' is not a member of type `%T'", name, type);
1416 return error_mark_node;
1419 if (TREE_CODE (member) == TYPE_DECL)
1421 TREE_USED (member) = 1;
1424 /* static class members and class-specific enum
1425 values can be returned without further ado. */
1426 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1429 return convert_from_reference (member);
1432 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1434 error ("invalid pointer to bit-field `%D'", member);
1435 return error_mark_node;
1438 /* A lot of this logic is now handled in lookup_member. */
1439 if (BASELINK_P (member))
1441 /* Go from the TREE_BASELINK to the member function info. */
1442 tree fnfields = member;
1443 tree t = BASELINK_FUNCTIONS (fnfields);
1445 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1447 /* The FNFIELDS are going to contain functions that aren't
1448 necessarily templates, and templates that don't
1449 necessarily match the explicit template parameters. We
1450 save all the functions, and the explicit parameters, and
1451 then figure out exactly what to instantiate with what
1452 arguments in instantiate_type. */
1454 if (TREE_CODE (t) != OVERLOAD)
1455 /* The code in instantiate_type which will process this
1456 expects to encounter OVERLOADs, not raw functions. */
1457 t = ovl_cons (t, NULL_TREE);
1459 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1460 TREE_OPERAND (orig_name, 1));
1461 t = build (OFFSET_REF, unknown_type_node, decl, t);
1463 PTRMEM_OK_P (t) = 1;
1468 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1470 /* Get rid of a potential OVERLOAD around it. */
1471 t = OVL_CURRENT (t);
1473 /* Unique functions are handled easily. */
1475 /* For non-static member of base class, we need a special rule
1476 for access checking [class.protected]:
1478 If the access is to form a pointer to member, the
1479 nested-name-specifier shall name the derived class
1480 (or any class derived from that class). */
1481 if (address_p && DECL_P (t)
1482 && DECL_NONSTATIC_MEMBER_P (t))
1483 perform_or_defer_access_check (TYPE_BINFO (type), t);
1485 perform_or_defer_access_check (basebinfo, t);
1488 if (DECL_STATIC_FUNCTION_P (t))
1494 TREE_TYPE (fnfields) = unknown_type_node;
1498 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1499 /* We need additional test besides the one in
1500 check_accessibility_of_qualified_id in case it is
1501 a pointer to non-static member. */
1502 perform_or_defer_access_check (TYPE_BINFO (type), member);
1506 /* If MEMBER is non-static, then the program has fallen afoul of
1509 An id-expression that denotes a nonstatic data member or
1510 nonstatic member function of a class can only be used:
1512 -- as part of a class member access (_expr.ref_) in which the
1513 object-expression refers to the member's class or a class
1514 derived from that class, or
1516 -- to form a pointer to member (_expr.unary.op_), or
1518 -- in the body of a nonstatic member function of that class or
1519 of a class derived from that class (_class.mfct.nonstatic_), or
1521 -- in a mem-initializer for a constructor for that class or for
1522 a class derived from that class (_class.base.init_). */
1523 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1525 /* Build a representation of a the qualified name suitable
1526 for use as the operand to "&" -- even though the "&" is
1527 not actually present. */
1528 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1529 /* In Microsoft mode, treat a non-static member function as if
1530 it were a pointer-to-member. */
1531 if (flag_ms_extensions)
1533 PTRMEM_OK_P (member) = 1;
1534 return build_unary_op (ADDR_EXPR, member, 0);
1536 error ("invalid use of non-static member function `%D'",
1537 TREE_OPERAND (member, 1));
1540 else if (TREE_CODE (member) == FIELD_DECL)
1542 error ("invalid use of non-static data member `%D'", member);
1543 return error_mark_node;
1548 /* In member functions, the form `type::name' is no longer
1549 equivalent to `this->type::name', at least not until
1550 resolve_offset_ref. */
1551 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1552 PTRMEM_OK_P (member) = 1;
1556 /* If DECL is a `const' declaration, and its value is a known
1557 constant, then return that value. */
1560 decl_constant_value (tree decl)
1562 /* When we build a COND_EXPR, we don't know whether it will be used
1563 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1564 to replace the second and third operands with their
1565 initializers. So, we do that here. */
1566 if (TREE_CODE (decl) == COND_EXPR)
1571 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1572 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1574 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1575 return build (COND_EXPR,
1577 TREE_OPERAND (decl, 0), d1, d2);
1581 && (/* Enumeration constants are constant. */
1582 TREE_CODE (decl) == CONST_DECL
1583 /* And so are variables with a 'const' type -- unless they
1584 are also 'volatile'. */
1585 || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1586 && TREE_CODE (decl) != PARM_DECL
1587 && DECL_INITIAL (decl)
1588 && DECL_INITIAL (decl) != error_mark_node
1589 /* This is invalid if initial value is not constant.
1590 If it has either a function call, a memory reference,
1591 or a variable, then re-evaluating it could give different results. */
1592 && TREE_CONSTANT (DECL_INITIAL (decl))
1593 /* Check for cases where this is sub-optimal, even though valid. */
1594 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1595 return DECL_INITIAL (decl);
1599 /* Common subroutines of build_new and build_vec_delete. */
1601 /* Call the global __builtin_delete to delete ADDR. */
1604 build_builtin_delete_call (tree addr)
1606 mark_used (global_delete_fndecl);
1607 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1610 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1611 (which needs to go through some sort of groktypename) or it
1612 is the name of the class we are newing. INIT is an initialization value.
1613 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1614 If INIT is void_type_node, it means do *not* call a constructor
1617 For types with constructors, the data returned is initialized
1618 by the appropriate constructor.
1620 Whether the type has a constructor or not, if it has a pointer
1621 to a virtual function table, then that pointer is set up
1624 Unless I am mistaken, a call to new () will return initialized
1625 data regardless of whether the constructor itself is private or
1626 not. NOPE; new fails if the constructor is private (jcm).
1628 Note that build_new does nothing to assure that any special
1629 alignment requirements of the type are met. Rather, it leaves
1630 it up to malloc to do the right thing. Otherwise, folding to
1631 the right alignment cal cause problems if the user tries to later
1632 free the memory returned by `new'.
1634 PLACEMENT is the `placement' list for user-defined operator new (). */
1637 build_new (tree placement, tree type, tree nelts, tree init,
1642 if (type == error_mark_node)
1643 return error_mark_node;
1645 if (processing_template_decl)
1647 rval = build_min (NEW_EXPR, build_pointer_type (type),
1648 placement, type, nelts, init);
1649 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1650 TREE_SIDE_EFFECTS (rval) = 1;
1654 /* ``A reference cannot be created by the new operator. A reference
1655 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1656 returned by new.'' ARM 5.3.3 */
1657 if (TREE_CODE (type) == REFERENCE_TYPE)
1659 error ("new cannot be applied to a reference type");
1660 type = TREE_TYPE (type);
1663 if (TREE_CODE (type) == FUNCTION_TYPE)
1665 error ("new cannot be applied to a function type");
1666 return error_mark_node;
1669 rval = build (NEW_EXPR, build_pointer_type (type), placement, type,
1671 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1672 TREE_SIDE_EFFECTS (rval) = 1;
1673 rval = build_new_1 (rval);
1674 if (rval == error_mark_node)
1675 return error_mark_node;
1677 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1678 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1679 TREE_NO_WARNING (rval) = 1;
1684 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1687 build_java_class_ref (tree type)
1689 tree name = NULL_TREE, class_decl;
1690 static tree CL_suffix = NULL_TREE;
1691 if (CL_suffix == NULL_TREE)
1692 CL_suffix = get_identifier("class$");
1693 if (jclass_node == NULL_TREE)
1695 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1696 if (jclass_node == NULL_TREE)
1697 fatal_error ("call to Java constructor, while `jclass' undefined");
1699 jclass_node = TREE_TYPE (jclass_node);
1702 /* Mangle the class$ field. */
1705 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1706 if (DECL_NAME (field) == CL_suffix)
1708 mangle_decl (field);
1709 name = DECL_ASSEMBLER_NAME (field);
1713 internal_error ("can't find class$");
1716 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1717 if (class_decl == NULL_TREE)
1719 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1720 TREE_STATIC (class_decl) = 1;
1721 DECL_EXTERNAL (class_decl) = 1;
1722 TREE_PUBLIC (class_decl) = 1;
1723 DECL_ARTIFICIAL (class_decl) = 1;
1724 DECL_IGNORED_P (class_decl) = 1;
1725 pushdecl_top_level (class_decl);
1726 make_decl_rtl (class_decl, NULL);
1732 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1733 value is immediately handed to expand_expr. */
1736 build_new_1 (tree exp)
1738 tree placement, init;
1739 tree true_type, size, rval;
1740 /* The type of the new-expression. (This type is always a pointer
1743 /* The type pointed to by POINTER_TYPE. */
1745 /* The type being allocated. For "new T[...]" this will be an
1748 /* A pointer type pointing to to the FULL_TYPE. */
1749 tree full_pointer_type;
1750 tree outer_nelts = NULL_TREE;
1751 tree nelts = NULL_TREE;
1752 tree alloc_call, alloc_expr;
1753 /* The address returned by the call to "operator new". This node is
1754 a VAR_DECL and is therefore reusable. */
1757 tree cookie_expr, init_expr;
1759 enum tree_code code;
1760 int nothrow, check_new;
1761 /* Nonzero if the user wrote `::new' rather than just `new'. */
1762 int globally_qualified_p;
1763 int use_java_new = 0;
1764 /* If non-NULL, the number of extra bytes to allocate at the
1765 beginning of the storage allocated for an array-new expression in
1766 order to store the number of elements. */
1767 tree cookie_size = NULL_TREE;
1768 /* True if the function we are calling is a placement allocation
1770 bool placement_allocation_fn_p;
1771 tree args = NULL_TREE;
1772 /* True if the storage must be initialized, either by a constructor
1773 or due to an explicit new-initializer. */
1774 bool is_initialized;
1775 /* The address of the thing allocated, not including any cookie. In
1776 particular, if an array cookie is in use, DATA_ADDR is the
1777 address of the first array element. This node is a VAR_DECL, and
1778 is therefore reusable. */
1780 tree init_preeval_expr = NULL_TREE;
1782 placement = TREE_OPERAND (exp, 0);
1783 type = TREE_OPERAND (exp, 1);
1784 nelts = TREE_OPERAND (exp, 2);
1785 init = TREE_OPERAND (exp, 3);
1786 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1793 outer_nelts = nelts;
1795 /* ??? The middle-end will error on us for building a VLA outside a
1796 function context. Methinks that's not it's purvey. So we'll do
1797 our own VLA layout later. */
1799 full_type = build_cplus_array_type (type, NULL_TREE);
1801 index = convert (sizetype, nelts);
1802 index = size_binop (MINUS_EXPR, index, size_one_node);
1803 TYPE_DOMAIN (full_type) = build_index_type (index);
1810 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1812 /* If our base type is an array, then make sure we know how many elements
1814 while (TREE_CODE (true_type) == ARRAY_TYPE)
1816 tree this_nelts = array_type_nelts_top (true_type);
1817 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1818 true_type = TREE_TYPE (true_type);
1821 if (!complete_type_or_else (true_type, exp))
1822 return error_mark_node;
1824 if (TREE_CODE (true_type) == VOID_TYPE)
1826 error ("invalid type `void' for new");
1827 return error_mark_node;
1830 if (abstract_virtuals_error (NULL_TREE, true_type))
1831 return error_mark_node;
1833 is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
1834 if (CP_TYPE_CONST_P (true_type) && !is_initialized)
1836 error ("uninitialized const in `new' of `%#T'", true_type);
1837 return error_mark_node;
1840 size = size_in_bytes (true_type);
1845 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is necessary in
1846 order for the <INIT_EXPR <*foo> <CONSTRUCTOR ...>> to be valid. */
1848 n = convert (sizetype, nelts);
1849 size = size_binop (MULT_EXPR, size, n);
1850 TYPE_SIZE_UNIT (full_type) = size;
1852 n = convert (bitsizetype, nelts);
1853 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (true_type), n);
1854 TYPE_SIZE (full_type) = bitsize;
1857 /* Allocate the object. */
1858 if (! placement && TYPE_FOR_JAVA (true_type))
1860 tree class_addr, alloc_decl;
1861 tree class_decl = build_java_class_ref (true_type);
1862 static const char alloc_name[] = "_Jv_AllocObject";
1866 if (!get_global_value_if_present (get_identifier (alloc_name),
1869 error ("call to Java constructor with `%s' undefined", alloc_name);
1870 return error_mark_node;
1872 else if (really_overloaded_fn (alloc_decl))
1874 error ("`%D' should never be overloaded", alloc_decl);
1875 return error_mark_node;
1877 alloc_decl = OVL_CURRENT (alloc_decl);
1878 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1879 alloc_call = (build_function_call
1881 build_tree_list (NULL_TREE, class_addr)));
1888 fnname = ansi_opname (code);
1890 if (!globally_qualified_p
1891 && CLASS_TYPE_P (true_type)
1893 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
1894 : TYPE_HAS_NEW_OPERATOR (true_type)))
1896 /* Use a class-specific operator new. */
1897 /* If a cookie is required, add some extra space. */
1898 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1900 cookie_size = targetm.cxx.get_cookie_size (true_type);
1901 size = size_binop (PLUS_EXPR, size, cookie_size);
1903 /* Create the argument list. */
1904 args = tree_cons (NULL_TREE, size, placement);
1905 /* Do name-lookup to find the appropriate operator. */
1906 fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
1907 if (TREE_CODE (fns) == TREE_LIST)
1909 error ("request for member `%D' is ambiguous", fnname);
1910 print_candidates (fns);
1911 return error_mark_node;
1913 alloc_call = build_new_method_call (build_dummy_object (true_type),
1915 /*conversion_path=*/NULL_TREE,
1920 /* Use a global operator new. */
1921 /* See if a cookie might be required. */
1922 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1923 cookie_size = targetm.cxx.get_cookie_size (true_type);
1925 cookie_size = NULL_TREE;
1927 alloc_call = build_operator_new_call (fnname, placement,
1928 &size, &cookie_size);
1932 if (alloc_call == error_mark_node)
1933 return error_mark_node;
1935 /* In the simple case, we can stop now. */
1936 pointer_type = build_pointer_type (type);
1937 if (!cookie_size && !is_initialized)
1938 return build_nop (pointer_type, alloc_call);
1940 /* While we're working, use a pointer to the type we've actually
1941 allocated. Store the result of the call in a variable so that we
1942 can use it more than once. */
1943 full_pointer_type = build_pointer_type (full_type);
1944 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1945 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1947 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1948 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1949 alloc_call = TREE_OPERAND (alloc_call, 1);
1950 alloc_fn = get_callee_fndecl (alloc_call);
1951 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
1953 /* Now, check to see if this function is actually a placement
1954 allocation function. This can happen even when PLACEMENT is NULL
1955 because we might have something like:
1957 struct S { void* operator new (size_t, int i = 0); };
1959 A call to `new S' will get this allocation function, even though
1960 there is no explicit placement argument. If there is more than
1961 one argument, or there are variable arguments, then this is a
1962 placement allocation function. */
1963 placement_allocation_fn_p
1964 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1965 || varargs_function_p (alloc_fn));
1967 /* Preevaluate the placement args so that we don't reevaluate them for a
1968 placement delete. */
1969 if (placement_allocation_fn_p)
1972 stabilize_call (alloc_call, &inits);
1974 alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1978 /* unless an allocation function is declared with an empty excep-
1979 tion-specification (_except.spec_), throw(), it indicates failure to
1980 allocate storage by throwing a bad_alloc exception (clause _except_,
1981 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1982 cation function is declared with an empty exception-specification,
1983 throw(), it returns null to indicate failure to allocate storage and a
1984 non-null pointer otherwise.
1986 So check for a null exception spec on the op new we just called. */
1988 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
1989 check_new = (flag_check_new || nothrow) && ! use_java_new;
1996 /* Adjust so we're pointing to the start of the object. */
1997 data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
1998 alloc_node, cookie_size));
2000 /* Store the number of bytes allocated so that we can know how
2001 many elements to destroy later. We use the last sizeof
2002 (size_t) bytes to store the number of elements. */
2003 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2004 data_addr, size_in_bytes (sizetype));
2005 cookie = build_indirect_ref (cookie_ptr, NULL);
2007 cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2009 if (targetm.cxx.cookie_has_size ())
2011 /* Also store the element size. */
2012 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2013 cookie_ptr, size_in_bytes (sizetype));
2014 cookie = build_indirect_ref (cookie_ptr, NULL);
2015 cookie = build (MODIFY_EXPR, sizetype, cookie,
2016 size_in_bytes(true_type));
2017 cookie_expr = build (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2018 cookie, cookie_expr);
2020 data_addr = TARGET_EXPR_SLOT (data_addr);
2024 cookie_expr = NULL_TREE;
2025 data_addr = alloc_node;
2028 /* Now initialize the allocated object. Note that we preevaluate the
2029 initialization expression, apart from the actual constructor call or
2030 assignment--we do this because we want to delay the allocation as long
2031 as possible in order to minimize the size of the exception region for
2032 placement delete. */
2037 init_expr = build_indirect_ref (data_addr, NULL);
2039 if (init == void_zero_node)
2040 init = build_default_init (full_type, nelts);
2041 else if (init && has_array)
2042 pedwarn ("ISO C++ forbids initialization in array new");
2047 = build_vec_init (init_expr,
2048 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2050 init, /*from_array=*/0);
2052 /* An array initialization is stable because the initialization
2053 of each element is a full-expression, so the temporaries don't
2057 else if (TYPE_NEEDS_CONSTRUCTING (type))
2059 init_expr = build_special_member_call (init_expr,
2060 complete_ctor_identifier,
2063 stable = stabilize_init (init_expr, &init_preeval_expr);
2067 /* We are processing something like `new int (10)', which
2068 means allocate an int, and initialize it with 10. */
2070 if (TREE_CODE (init) == TREE_LIST)
2071 init = build_x_compound_expr_from_list (init, "new initializer");
2073 else if (TREE_CODE (init) == CONSTRUCTOR
2074 && TREE_TYPE (init) == NULL_TREE)
2077 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2078 stable = stabilize_init (init_expr, &init_preeval_expr);
2081 if (init_expr == error_mark_node)
2082 return error_mark_node;
2084 /* If any part of the object initialization terminates by throwing an
2085 exception and a suitable deallocation function can be found, the
2086 deallocation function is called to free the memory in which the
2087 object was being constructed, after which the exception continues
2088 to propagate in the context of the new-expression. If no
2089 unambiguous matching deallocation function can be found,
2090 propagating the exception does not cause the object's memory to be
2092 if (flag_exceptions && ! use_java_new)
2094 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2097 /* The Standard is unclear here, but the right thing to do
2098 is to use the same method for finding deallocation
2099 functions that we use for finding allocation functions. */
2100 cleanup = build_op_delete_call (dcode, alloc_node, size,
2101 globally_qualified_p,
2102 (placement_allocation_fn_p
2103 ? alloc_call : NULL_TREE));
2108 /* This is much simpler if we were able to preevaluate all of
2109 the arguments to the constructor call. */
2110 init_expr = build (TRY_CATCH_EXPR, void_type_node,
2111 init_expr, cleanup);
2113 /* Ack! First we allocate the memory. Then we set our sentry
2114 variable to true, and expand a cleanup that deletes the
2115 memory if sentry is true. Then we run the constructor, and
2116 finally clear the sentry.
2118 We need to do this because we allocate the space first, so
2119 if there are any temporaries with cleanups in the
2120 constructor args and we weren't able to preevaluate them, we
2121 need this EH region to extend until end of full-expression
2122 to preserve nesting. */
2124 tree end, sentry, begin;
2126 begin = get_target_expr (boolean_true_node);
2127 CLEANUP_EH_ONLY (begin) = 1;
2129 sentry = TARGET_EXPR_SLOT (begin);
2131 TARGET_EXPR_CLEANUP (begin)
2132 = build (COND_EXPR, void_type_node, sentry,
2133 cleanup, void_zero_node);
2135 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2136 sentry, boolean_false_node);
2139 = build (COMPOUND_EXPR, void_type_node, begin,
2140 build (COMPOUND_EXPR, void_type_node, init_expr,
2147 init_expr = NULL_TREE;
2149 /* Now build up the return value in reverse order. */
2154 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2156 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2158 if (rval == alloc_node)
2159 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2160 and return the call (which doesn't need to be adjusted). */
2161 rval = TARGET_EXPR_INITIAL (alloc_expr);
2166 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2168 rval = build_conditional_expr (ifexp, rval, alloc_node);
2171 /* Perform the allocation before anything else, so that ALLOC_NODE
2172 has been initialized before we start using it. */
2173 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2176 if (init_preeval_expr)
2177 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2179 /* Convert to the final type. */
2180 rval = build_nop (pointer_type, rval);
2182 /* A new-expression is never an lvalue. */
2183 if (real_lvalue_p (rval))
2184 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2190 build_vec_delete_1 (tree base, tree maxindex, tree type,
2191 special_function_kind auto_delete_vec, int use_global_delete)
2194 tree ptype = build_pointer_type (type = complete_type (type));
2195 tree size_exp = size_in_bytes (type);
2197 /* Temporary variables used by the loop. */
2198 tree tbase, tbase_init;
2200 /* This is the body of the loop that implements the deletion of a
2201 single element, and moves temp variables to next elements. */
2204 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2207 /* This is the thing that governs what to do after the loop has run. */
2208 tree deallocate_expr = 0;
2210 /* This is the BIND_EXPR which holds the outermost iterator of the
2211 loop. It is convenient to set this variable up and test it before
2212 executing any other code in the loop.
2213 This is also the containing expression returned by this function. */
2214 tree controller = NULL_TREE;
2216 /* We should only have 1-D arrays here. */
2217 if (TREE_CODE (type) == ARRAY_TYPE)
2220 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2223 /* The below is short by the cookie size. */
2224 virtual_size = size_binop (MULT_EXPR, size_exp,
2225 convert (sizetype, maxindex));
2227 tbase = create_temporary_var (ptype);
2228 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2229 fold (build (PLUS_EXPR, ptype,
2232 DECL_REGISTER (tbase) = 1;
2233 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2234 TREE_SIDE_EFFECTS (controller) = 1;
2236 body = build (EXIT_EXPR, void_type_node,
2237 build (EQ_EXPR, boolean_type_node, base, tbase));
2238 body = build_compound_expr
2239 (body, build_modify_expr (tbase, NOP_EXPR,
2240 build (MINUS_EXPR, ptype, tbase, size_exp)));
2241 body = build_compound_expr
2242 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2243 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2245 loop = build (LOOP_EXPR, void_type_node, body);
2246 loop = build_compound_expr (tbase_init, loop);
2249 /* If the delete flag is one, or anything else with the low bit set,
2250 delete the storage. */
2251 if (auto_delete_vec != sfk_base_destructor)
2255 /* The below is short by the cookie size. */
2256 virtual_size = size_binop (MULT_EXPR, size_exp,
2257 convert (sizetype, maxindex));
2259 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2266 cookie_size = targetm.cxx.get_cookie_size (type);
2268 = cp_convert (ptype,
2269 cp_build_binary_op (MINUS_EXPR,
2270 cp_convert (string_type_node,
2273 /* True size with header. */
2274 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2277 if (auto_delete_vec == sfk_deleting_destructor)
2278 deallocate_expr = build_x_delete (base_tbd,
2279 2 | use_global_delete,
2284 if (!deallocate_expr)
2287 body = deallocate_expr;
2289 body = build_compound_expr (body, deallocate_expr);
2292 body = integer_zero_node;
2294 /* Outermost wrapper: If pointer is null, punt. */
2295 body = fold (build (COND_EXPR, void_type_node,
2296 fold (build (NE_EXPR, boolean_type_node, base,
2297 convert (TREE_TYPE (base),
2298 integer_zero_node))),
2299 body, integer_zero_node));
2300 body = build1 (NOP_EXPR, void_type_node, body);
2304 TREE_OPERAND (controller, 1) = body;
2308 if (TREE_CODE (base) == SAVE_EXPR)
2309 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2310 body = build (COMPOUND_EXPR, void_type_node, base, body);
2312 return convert_to_void (body, /*implicit=*/NULL);
2315 /* Create an unnamed variable of the indicated TYPE. */
2318 create_temporary_var (tree type)
2322 decl = build_decl (VAR_DECL, NULL_TREE, type);
2323 TREE_USED (decl) = 1;
2324 DECL_ARTIFICIAL (decl) = 1;
2325 DECL_SOURCE_LOCATION (decl) = input_location;
2326 DECL_IGNORED_P (decl) = 1;
2327 DECL_CONTEXT (decl) = current_function_decl;
2332 /* Create a new temporary variable of the indicated TYPE, initialized
2335 It is not entered into current_binding_level, because that breaks
2336 things when it comes time to do final cleanups (which take place
2337 "outside" the binding contour of the function). */
2340 get_temp_regvar (tree type, tree init)
2344 decl = create_temporary_var (type);
2345 add_decl_expr (decl);
2347 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2352 /* `build_vec_init' returns tree structure that performs
2353 initialization of a vector of aggregate types.
2355 BASE is a reference to the vector, of ARRAY_TYPE.
2356 MAXINDEX is the maximum index of the array (one less than the
2357 number of elements). It is only used if
2358 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2359 INIT is the (possibly NULL) initializer.
2361 FROM_ARRAY is 0 if we should init everything with INIT
2362 (i.e., every element initialized from INIT).
2363 FROM_ARRAY is 1 if we should index into INIT in parallel
2364 with initialization of DECL.
2365 FROM_ARRAY is 2 if we should index into INIT in parallel,
2366 but use assignment instead of initialization. */
2369 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2372 tree base2 = NULL_TREE;
2374 tree itype = NULL_TREE;
2376 /* The type of the array. */
2377 tree atype = TREE_TYPE (base);
2378 /* The type of an element in the array. */
2379 tree type = TREE_TYPE (atype);
2380 /* The type of a pointer to an element in the array. */
2385 tree try_block = NULL_TREE;
2386 int num_initialized_elts = 0;
2389 if (TYPE_DOMAIN (atype))
2390 maxindex = array_type_nelts (atype);
2392 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2393 return error_mark_node;
2397 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2398 : !TYPE_NEEDS_CONSTRUCTING (type))
2399 && ((TREE_CODE (init) == CONSTRUCTOR
2400 /* Don't do this if the CONSTRUCTOR might contain something
2401 that might throw and require us to clean up. */
2402 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2403 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2406 /* Do non-default initialization of POD arrays resulting from
2407 brace-enclosed initializers. In this case, digest_init and
2408 store_constructor will handle the semantics for us. */
2410 stmt_expr = build (INIT_EXPR, atype, base, init);
2414 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2415 ptype = build_pointer_type (type);
2416 size = size_in_bytes (type);
2417 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2418 base = cp_convert (ptype, decay_conversion (base));
2420 /* The code we are generating looks like:
2424 ptrdiff_t iterator = maxindex;
2426 for (; iterator != -1; --iterator) {
2427 ... initialize *t1 ...
2431 ... destroy elements that were constructed ...
2436 We can omit the try and catch blocks if we know that the
2437 initialization will never throw an exception, or if the array
2438 elements do not have destructors. We can omit the loop completely if
2439 the elements of the array do not have constructors.
2441 We actually wrap the entire body of the above in a STMT_EXPR, for
2444 When copying from array to another, when the array elements have
2445 only trivial copy constructors, we should use __builtin_memcpy
2446 rather than generating a loop. That way, we could take advantage
2447 of whatever cleverness the back-end has for dealing with copies
2448 of blocks of memory. */
2450 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2451 destroy_temps = stmts_are_full_exprs_p ();
2452 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2453 rval = get_temp_regvar (ptype, base);
2454 base = get_temp_regvar (ptype, rval);
2455 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2457 /* Protect the entire array initialization so that we can destroy
2458 the partially constructed array if an exception is thrown.
2459 But don't do this if we're assigning. */
2460 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2463 try_block = begin_try_block ();
2466 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2468 /* Do non-default initialization of non-POD arrays resulting from
2469 brace-enclosed initializers. */
2474 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2476 tree elt = TREE_VALUE (elts);
2477 tree baseref = build1 (INDIRECT_REF, type, base);
2479 num_initialized_elts++;
2481 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2482 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2483 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2485 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2487 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2489 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2490 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2493 /* Clear out INIT so that we don't get confused below. */
2496 else if (from_array)
2498 /* If initializing one array from another, initialize element by
2499 element. We rely upon the below calls the do argument
2503 base2 = decay_conversion (init);
2504 itype = TREE_TYPE (base2);
2505 base2 = get_temp_regvar (itype, base2);
2506 itype = TREE_TYPE (itype);
2508 else if (TYPE_LANG_SPECIFIC (type)
2509 && TYPE_NEEDS_CONSTRUCTING (type)
2510 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2512 error ("initializer ends prematurely");
2513 return error_mark_node;
2517 /* Now, default-initialize any remaining elements. We don't need to
2518 do that if a) the type does not need constructing, or b) we've
2519 already initialized all the elements.
2521 We do need to keep going if we're copying an array. */
2524 || (TYPE_NEEDS_CONSTRUCTING (type)
2525 && ! (host_integerp (maxindex, 0)
2526 && (num_initialized_elts
2527 == tree_low_cst (maxindex, 0) + 1))))
2529 /* If the ITERATOR is equal to -1, then we don't have to loop;
2530 we've already initialized all the elements. */
2534 for_stmt = begin_for_stmt ();
2535 finish_for_init_stmt (for_stmt);
2536 finish_for_cond (build (NE_EXPR, boolean_type_node,
2537 iterator, integer_minus_one_node),
2539 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2544 tree to = build1 (INDIRECT_REF, type, base);
2548 from = build1 (INDIRECT_REF, itype, base2);
2552 if (from_array == 2)
2553 elt_init = build_modify_expr (to, NOP_EXPR, from);
2554 else if (TYPE_NEEDS_CONSTRUCTING (type))
2555 elt_init = build_aggr_init (to, from, 0);
2557 elt_init = build_modify_expr (to, NOP_EXPR, from);
2561 else if (TREE_CODE (type) == ARRAY_TYPE)
2565 ("cannot initialize multi-dimensional array with initializer");
2566 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2570 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2573 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2574 finish_expr_stmt (elt_init);
2575 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2577 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2579 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2581 finish_for_stmt (for_stmt);
2584 /* Make sure to cleanup any partially constructed elements. */
2585 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2589 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2591 /* Flatten multi-dimensional array since build_vec_delete only
2592 expects one-dimensional array. */
2593 if (TREE_CODE (type) == ARRAY_TYPE)
2595 m = cp_build_binary_op (MULT_EXPR, m,
2596 array_type_nelts_total (type));
2597 type = strip_array_types (type);
2600 finish_cleanup_try_block (try_block);
2601 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2602 /*use_global_delete=*/0);
2603 finish_cleanup (e, try_block);
2606 /* The value of the array initialization is the array itself, RVAL
2607 is a pointer to the first element. */
2608 finish_stmt_expr_expr (rval, stmt_expr);
2610 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2612 /* Now convert make the result have the correct type. */
2613 atype = build_pointer_type (atype);
2614 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2615 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2617 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2621 /* Free up storage of type TYPE, at address ADDR.
2623 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2626 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2627 used as the second argument to operator delete. It can include
2628 things like padding and magic size cookies. It has virtual in it,
2629 because if you have a base pointer and you delete through a virtual
2630 destructor, it should be the size of the dynamic object, not the
2631 static object, see Free Store 12.5 ISO C++.
2633 This does not call any destructors. */
2636 build_x_delete (tree addr, int which_delete, tree virtual_size)
2638 int use_global_delete = which_delete & 1;
2639 int use_vec_delete = !!(which_delete & 2);
2640 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2642 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2646 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2650 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2656 case sfk_complete_destructor:
2657 name = complete_dtor_identifier;
2660 case sfk_base_destructor:
2661 name = base_dtor_identifier;
2664 case sfk_deleting_destructor:
2665 name = deleting_dtor_identifier;
2672 exp = convert_from_reference (exp);
2673 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2674 return build_new_method_call (exp, fn,
2676 /*conversion_path=*/NULL_TREE,
2680 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2681 ADDR is an expression which yields the store to be destroyed.
2682 AUTO_DELETE is the name of the destructor to call, i.e., either
2683 sfk_complete_destructor, sfk_base_destructor, or
2684 sfk_deleting_destructor.
2686 FLAGS is the logical disjunction of zero or more LOOKUP_
2687 flags. See cp-tree.h for more info. */
2690 build_delete (tree type, tree addr, special_function_kind auto_delete,
2691 int flags, int use_global_delete)
2695 if (addr == error_mark_node)
2696 return error_mark_node;
2698 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2699 set to `error_mark_node' before it gets properly cleaned up. */
2700 if (type == error_mark_node)
2701 return error_mark_node;
2703 type = TYPE_MAIN_VARIANT (type);
2705 if (TREE_CODE (type) == POINTER_TYPE)
2707 bool complete_p = true;
2709 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2710 if (TREE_CODE (type) == ARRAY_TYPE)
2713 /* We don't want to warn about delete of void*, only other
2714 incomplete types. Deleting other incomplete types
2715 invokes undefined behavior, but it is not ill-formed, so
2716 compile to something that would even do The Right Thing
2717 (TM) should the type have a trivial dtor and no delete
2719 if (!VOID_TYPE_P (type))
2721 complete_type (type);
2722 if (!COMPLETE_TYPE_P (type))
2724 warning ("possible problem detected in invocation of "
2725 "delete operator:");
2726 cxx_incomplete_type_diagnostic (addr, type, 1);
2727 inform ("neither the destructor nor the class-specific "
2728 "operator delete will be called, even if they are "
2729 "declared when the class is defined.");
2733 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2734 /* Call the builtin operator delete. */
2735 return build_builtin_delete_call (addr);
2736 if (TREE_SIDE_EFFECTS (addr))
2737 addr = save_expr (addr);
2739 /* Throw away const and volatile on target type of addr. */
2740 addr = convert_force (build_pointer_type (type), addr, 0);
2742 else if (TREE_CODE (type) == ARRAY_TYPE)
2746 if (TYPE_DOMAIN (type) == NULL_TREE)
2748 error ("unknown array size in delete");
2749 return error_mark_node;
2751 return build_vec_delete (addr, array_type_nelts (type),
2752 auto_delete, use_global_delete);
2756 /* Don't check PROTECT here; leave that decision to the
2757 destructor. If the destructor is accessible, call it,
2758 else report error. */
2759 addr = build_unary_op (ADDR_EXPR, addr, 0);
2760 if (TREE_SIDE_EFFECTS (addr))
2761 addr = save_expr (addr);
2763 addr = convert_force (build_pointer_type (type), addr, 0);
2766 my_friendly_assert (IS_AGGR_TYPE (type), 220);
2768 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2770 if (auto_delete != sfk_deleting_destructor)
2771 return void_zero_node;
2773 return build_op_delete_call
2774 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2779 tree do_delete = NULL_TREE;
2782 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2784 /* For `::delete x', we must not use the deleting destructor
2785 since then we would not be sure to get the global `operator
2787 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2789 /* We will use ADDR multiple times so we must save it. */
2790 addr = save_expr (addr);
2791 /* Delete the object. */
2792 do_delete = build_builtin_delete_call (addr);
2793 /* Otherwise, treat this like a complete object destructor
2795 auto_delete = sfk_complete_destructor;
2797 /* If the destructor is non-virtual, there is no deleting
2798 variant. Instead, we must explicitly call the appropriate
2799 `operator delete' here. */
2800 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2801 && auto_delete == sfk_deleting_destructor)
2803 /* We will use ADDR multiple times so we must save it. */
2804 addr = save_expr (addr);
2805 /* Build the call. */
2806 do_delete = build_op_delete_call (DELETE_EXPR,
2808 cxx_sizeof_nowarn (type),
2811 /* Call the complete object destructor. */
2812 auto_delete = sfk_complete_destructor;
2814 else if (auto_delete == sfk_deleting_destructor
2815 && TYPE_GETS_REG_DELETE (type))
2817 /* Make sure we have access to the member op delete, even though
2818 we'll actually be calling it from the destructor. */
2819 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2820 /*global_p=*/false, NULL_TREE);
2823 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2824 auto_delete, flags);
2826 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2828 if (flags & LOOKUP_DESTRUCTOR)
2829 /* Explicit destructor call; don't check for null pointer. */
2830 ifexp = integer_one_node;
2832 /* Handle deleting a null pointer. */
2833 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2835 if (ifexp != integer_one_node)
2836 expr = build (COND_EXPR, void_type_node,
2837 ifexp, expr, void_zero_node);
2843 /* At the beginning of a destructor, push cleanups that will call the
2844 destructors for our base classes and members.
2846 Called from begin_destructor_body. */
2849 push_base_cleanups (void)
2852 int i, n_baseclasses;
2856 /* Run destructors for all virtual baseclasses. */
2857 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
2859 tree cond = (condition_conversion
2860 (build (BIT_AND_EXPR, integer_type_node,
2861 current_in_charge_parm,
2862 integer_two_node)));
2864 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2865 order, which is also the right order for pushing cleanups. */
2866 for (i = 0; (binfos = VEC_iterate
2867 (tree, CLASSTYPE_VBASECLASSES (current_class_type), i));
2870 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (binfos)))
2872 expr = build_special_member_call (current_class_ref,
2873 base_dtor_identifier,
2877 | LOOKUP_NONVIRTUAL));
2878 expr = build (COND_EXPR, void_type_node, cond,
2879 expr, void_zero_node);
2880 finish_decl_cleanup (NULL_TREE, expr);
2885 binfos = BINFO_BASE_BINFOS (TYPE_BINFO (current_class_type));
2886 n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type));
2888 /* Take care of the remaining baseclasses. */
2889 for (i = 0; i < n_baseclasses; i++)
2891 tree base_binfo = TREE_VEC_ELT (binfos, i);
2892 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2893 || BINFO_VIRTUAL_P (base_binfo))
2896 expr = build_special_member_call (current_class_ref,
2897 base_dtor_identifier,
2898 NULL_TREE, base_binfo,
2899 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2900 finish_decl_cleanup (NULL_TREE, expr);
2903 for (member = TYPE_FIELDS (current_class_type); member;
2904 member = TREE_CHAIN (member))
2906 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2908 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2910 tree this_member = (build_class_member_access_expr
2911 (current_class_ref, member,
2912 /*access_path=*/NULL_TREE,
2913 /*preserve_reference=*/false));
2914 tree this_type = TREE_TYPE (member);
2915 expr = build_delete (this_type, this_member,
2916 sfk_complete_destructor,
2917 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2919 finish_decl_cleanup (NULL_TREE, expr);
2924 /* For type TYPE, delete the virtual baseclass objects of DECL. */
2927 build_vbase_delete (tree type, tree decl)
2932 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
2934 my_friendly_assert (addr != error_mark_node, 222);
2936 result = convert_to_void (integer_zero_node, NULL);
2937 for (ix = 0; (binfo = VEC_iterate
2938 (tree, CLASSTYPE_VBASECLASSES (type), ix)); ix++)
2940 tree base_addr = convert_force
2941 (build_pointer_type (BINFO_TYPE (binfo)), addr, 0);
2942 tree base_delete = build_delete
2943 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
2944 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
2946 result = build_compound_expr (result, base_delete);
2951 /* Build a C++ vector delete expression.
2952 MAXINDEX is the number of elements to be deleted.
2953 ELT_SIZE is the nominal size of each element in the vector.
2954 BASE is the expression that should yield the store to be deleted.
2955 This function expands (or synthesizes) these calls itself.
2956 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2958 This also calls delete for virtual baseclasses of elements of the vector.
2960 Update: MAXINDEX is no longer needed. The size can be extracted from the
2961 start of the vector for pointers, and from the type for arrays. We still
2962 use MAXINDEX for arrays because it happens to already have one of the
2963 values we'd have to extract. (We could use MAXINDEX with pointers to
2964 confirm the size, and trap if the numbers differ; not clear that it'd
2965 be worth bothering.) */
2968 build_vec_delete (tree base, tree maxindex,
2969 special_function_kind auto_delete_vec, int use_global_delete)
2973 tree base_init = NULL_TREE;
2975 type = TREE_TYPE (base);
2977 if (TREE_CODE (type) == POINTER_TYPE)
2979 /* Step back one from start of vector, and read dimension. */
2982 if (TREE_SIDE_EFFECTS (base))
2984 base_init = get_target_expr (base);
2985 base = TARGET_EXPR_SLOT (base_init);
2987 type = strip_array_types (TREE_TYPE (type));
2988 cookie_addr = build (MINUS_EXPR,
2989 build_pointer_type (sizetype),
2991 TYPE_SIZE_UNIT (sizetype));
2992 maxindex = build_indirect_ref (cookie_addr, NULL);
2994 else if (TREE_CODE (type) == ARRAY_TYPE)
2996 /* Get the total number of things in the array, maxindex is a
2998 maxindex = array_type_nelts_total (type);
2999 type = strip_array_types (type);
3000 base = build_unary_op (ADDR_EXPR, base, 1);
3001 if (TREE_SIDE_EFFECTS (base))
3003 base_init = get_target_expr (base);
3004 base = TARGET_EXPR_SLOT (base_init);
3009 if (base != error_mark_node)
3010 error ("type to vector delete is neither pointer or array type");
3011 return error_mark_node;
3014 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3017 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);