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),
1148 TYPE_BINFO (TREE_TYPE (decl)),
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);
1302 /* Like is_aggr_typedef, but returns typedef if successful. */
1305 get_aggr_from_typedef (tree name, int or_else)
1309 if (name == error_mark_node)
1312 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1313 type = IDENTIFIER_TYPE_VALUE (name);
1317 error ("`%T' fails to be an aggregate typedef", name);
1321 if (! IS_AGGR_TYPE (type)
1322 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1323 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1326 error ("type `%T' is of non-aggregate type", type);
1333 get_type_value (tree name)
1335 if (name == error_mark_node)
1338 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1339 return IDENTIFIER_TYPE_VALUE (name);
1344 /* Build a reference to a member of an aggregate. This is not a C++
1345 `&', but really something which can have its address taken, and
1346 then act as a pointer to member, for example TYPE :: FIELD can have
1347 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1348 this expression is the operand of "&".
1350 @@ Prints out lousy diagnostics for operator <typename>
1353 @@ This function should be rewritten and placed in search.c. */
1356 build_offset_ref (tree type, tree name, bool address_p)
1360 tree basebinfo = NULL_TREE;
1361 tree orig_name = name;
1363 /* class templates can come in as TEMPLATE_DECLs here. */
1364 if (TREE_CODE (name) == TEMPLATE_DECL)
1367 if (processing_template_decl || uses_template_parms (type))
1368 return build_min_nt (SCOPE_REF, type, name);
1370 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1372 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1373 something like `a.template f<int>' or the like. For the most
1374 part, we treat this just like a.f. We do remember, however,
1375 the template-id that was used. */
1376 name = TREE_OPERAND (orig_name, 0);
1379 name = DECL_NAME (name);
1382 if (TREE_CODE (name) == COMPONENT_REF)
1383 name = TREE_OPERAND (name, 1);
1384 if (TREE_CODE (name) == OVERLOAD)
1385 name = DECL_NAME (OVL_CURRENT (name));
1388 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1391 if (type == NULL_TREE)
1392 return error_mark_node;
1394 /* Handle namespace names fully here. */
1395 if (TREE_CODE (type) == NAMESPACE_DECL)
1397 tree t = lookup_namespace_name (type, name);
1398 if (t == error_mark_node)
1400 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1401 /* Reconstruct the TEMPLATE_ID_EXPR. */
1402 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1403 t, TREE_OPERAND (orig_name, 1));
1404 if (! type_unknown_p (t))
1407 t = convert_from_reference (t);
1412 if (! is_aggr_type (type, 1))
1413 return error_mark_node;
1415 if (TREE_CODE (name) == BIT_NOT_EXPR)
1417 if (! check_dtor_name (type, name))
1418 error ("qualified type `%T' does not match destructor name `~%T'",
1419 type, TREE_OPERAND (name, 0));
1420 name = dtor_identifier;
1423 if (!COMPLETE_TYPE_P (complete_type (type))
1424 && !TYPE_BEING_DEFINED (type))
1426 error ("incomplete type `%T' does not have member `%D'", type,
1428 return error_mark_node;
1431 decl = maybe_dummy_object (type, &basebinfo);
1433 if (BASELINK_P (name) || DECL_P (name))
1437 member = lookup_member (basebinfo, name, 1, 0);
1439 if (member == error_mark_node)
1440 return error_mark_node;
1445 error ("`%D' is not a member of type `%T'", name, type);
1446 return error_mark_node;
1449 if (TREE_CODE (member) == TYPE_DECL)
1451 TREE_USED (member) = 1;
1454 /* static class members and class-specific enum
1455 values can be returned without further ado. */
1456 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1459 return convert_from_reference (member);
1462 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1464 error ("invalid pointer to bit-field `%D'", member);
1465 return error_mark_node;
1468 /* A lot of this logic is now handled in lookup_member. */
1469 if (BASELINK_P (member))
1471 /* Go from the TREE_BASELINK to the member function info. */
1472 tree fnfields = member;
1473 tree t = BASELINK_FUNCTIONS (fnfields);
1475 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1477 /* The FNFIELDS are going to contain functions that aren't
1478 necessarily templates, and templates that don't
1479 necessarily match the explicit template parameters. We
1480 save all the functions, and the explicit parameters, and
1481 then figure out exactly what to instantiate with what
1482 arguments in instantiate_type. */
1484 if (TREE_CODE (t) != OVERLOAD)
1485 /* The code in instantiate_type which will process this
1486 expects to encounter OVERLOADs, not raw functions. */
1487 t = ovl_cons (t, NULL_TREE);
1489 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1490 TREE_OPERAND (orig_name, 1));
1491 t = build (OFFSET_REF, unknown_type_node, decl, t);
1493 PTRMEM_OK_P (t) = 1;
1498 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1500 /* Get rid of a potential OVERLOAD around it. */
1501 t = OVL_CURRENT (t);
1503 /* Unique functions are handled easily. */
1505 /* For non-static member of base class, we need a special rule
1506 for access checking [class.protected]:
1508 If the access is to form a pointer to member, the
1509 nested-name-specifier shall name the derived class
1510 (or any class derived from that class). */
1511 if (address_p && DECL_P (t)
1512 && DECL_NONSTATIC_MEMBER_P (t))
1513 perform_or_defer_access_check (TYPE_BINFO (type), t);
1515 perform_or_defer_access_check (basebinfo, t);
1518 if (DECL_STATIC_FUNCTION_P (t))
1524 TREE_TYPE (fnfields) = unknown_type_node;
1528 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1529 /* We need additional test besides the one in
1530 check_accessibility_of_qualified_id in case it is
1531 a pointer to non-static member. */
1532 perform_or_defer_access_check (TYPE_BINFO (type), member);
1536 /* If MEMBER is non-static, then the program has fallen afoul of
1539 An id-expression that denotes a nonstatic data member or
1540 nonstatic member function of a class can only be used:
1542 -- as part of a class member access (_expr.ref_) in which the
1543 object-expression refers to the member's class or a class
1544 derived from that class, or
1546 -- to form a pointer to member (_expr.unary.op_), or
1548 -- in the body of a nonstatic member function of that class or
1549 of a class derived from that class (_class.mfct.nonstatic_), or
1551 -- in a mem-initializer for a constructor for that class or for
1552 a class derived from that class (_class.base.init_). */
1553 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1555 /* Build a representation of a the qualified name suitable
1556 for use as the operand to "&" -- even though the "&" is
1557 not actually present. */
1558 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1559 /* In Microsoft mode, treat a non-static member function as if
1560 it were a pointer-to-member. */
1561 if (flag_ms_extensions)
1563 PTRMEM_OK_P (member) = 1;
1564 return build_unary_op (ADDR_EXPR, member, 0);
1566 error ("invalid use of non-static member function `%D'",
1567 TREE_OPERAND (member, 1));
1570 else if (TREE_CODE (member) == FIELD_DECL)
1572 error ("invalid use of non-static data member `%D'", member);
1573 return error_mark_node;
1578 /* In member functions, the form `type::name' is no longer
1579 equivalent to `this->type::name', at least not until
1580 resolve_offset_ref. */
1581 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1582 PTRMEM_OK_P (member) = 1;
1586 /* If DECL is a `const' declaration, and its value is a known
1587 constant, then return that value. */
1590 decl_constant_value (tree decl)
1592 /* When we build a COND_EXPR, we don't know whether it will be used
1593 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1594 to replace the second and third operands with their
1595 initializers. So, we do that here. */
1596 if (TREE_CODE (decl) == COND_EXPR)
1601 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1602 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1604 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1605 return build (COND_EXPR,
1607 TREE_OPERAND (decl, 0), d1, d2);
1611 && (/* Enumeration constants are constant. */
1612 TREE_CODE (decl) == CONST_DECL
1613 /* And so are variables with a 'const' type -- unless they
1614 are also 'volatile'. */
1615 || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1616 && TREE_CODE (decl) != PARM_DECL
1617 && DECL_INITIAL (decl)
1618 && DECL_INITIAL (decl) != error_mark_node
1619 /* This is invalid if initial value is not constant.
1620 If it has either a function call, a memory reference,
1621 or a variable, then re-evaluating it could give different results. */
1622 && TREE_CONSTANT (DECL_INITIAL (decl))
1623 /* Check for cases where this is sub-optimal, even though valid. */
1624 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1625 return DECL_INITIAL (decl);
1629 /* Common subroutines of build_new and build_vec_delete. */
1631 /* Call the global __builtin_delete to delete ADDR. */
1634 build_builtin_delete_call (tree addr)
1636 mark_used (global_delete_fndecl);
1637 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1640 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1641 (which needs to go through some sort of groktypename) or it
1642 is the name of the class we are newing. INIT is an initialization value.
1643 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1644 If INIT is void_type_node, it means do *not* call a constructor
1647 For types with constructors, the data returned is initialized
1648 by the appropriate constructor.
1650 Whether the type has a constructor or not, if it has a pointer
1651 to a virtual function table, then that pointer is set up
1654 Unless I am mistaken, a call to new () will return initialized
1655 data regardless of whether the constructor itself is private or
1656 not. NOPE; new fails if the constructor is private (jcm).
1658 Note that build_new does nothing to assure that any special
1659 alignment requirements of the type are met. Rather, it leaves
1660 it up to malloc to do the right thing. Otherwise, folding to
1661 the right alignment cal cause problems if the user tries to later
1662 free the memory returned by `new'.
1664 PLACEMENT is the `placement' list for user-defined operator new (). */
1667 build_new (tree placement, tree type, tree nelts, tree init,
1672 if (type == error_mark_node)
1673 return error_mark_node;
1675 if (processing_template_decl)
1677 rval = build_min (NEW_EXPR, build_pointer_type (type),
1678 placement, type, nelts, init);
1679 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1680 TREE_SIDE_EFFECTS (rval) = 1;
1684 /* ``A reference cannot be created by the new operator. A reference
1685 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1686 returned by new.'' ARM 5.3.3 */
1687 if (TREE_CODE (type) == REFERENCE_TYPE)
1689 error ("new cannot be applied to a reference type");
1690 type = TREE_TYPE (type);
1693 if (TREE_CODE (type) == FUNCTION_TYPE)
1695 error ("new cannot be applied to a function type");
1696 return error_mark_node;
1699 rval = build (NEW_EXPR, build_pointer_type (type), placement, type,
1701 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1702 TREE_SIDE_EFFECTS (rval) = 1;
1703 rval = build_new_1 (rval);
1704 if (rval == error_mark_node)
1705 return error_mark_node;
1707 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1708 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1709 TREE_NO_WARNING (rval) = 1;
1714 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1717 build_java_class_ref (tree type)
1719 tree name = NULL_TREE, class_decl;
1720 static tree CL_suffix = NULL_TREE;
1721 if (CL_suffix == NULL_TREE)
1722 CL_suffix = get_identifier("class$");
1723 if (jclass_node == NULL_TREE)
1725 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1726 if (jclass_node == NULL_TREE)
1727 fatal_error ("call to Java constructor, while `jclass' undefined");
1729 jclass_node = TREE_TYPE (jclass_node);
1732 /* Mangle the class$ field. */
1735 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1736 if (DECL_NAME (field) == CL_suffix)
1738 mangle_decl (field);
1739 name = DECL_ASSEMBLER_NAME (field);
1743 internal_error ("can't find class$");
1746 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1747 if (class_decl == NULL_TREE)
1749 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1750 TREE_STATIC (class_decl) = 1;
1751 DECL_EXTERNAL (class_decl) = 1;
1752 TREE_PUBLIC (class_decl) = 1;
1753 DECL_ARTIFICIAL (class_decl) = 1;
1754 DECL_IGNORED_P (class_decl) = 1;
1755 pushdecl_top_level (class_decl);
1756 make_decl_rtl (class_decl, NULL);
1762 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1763 value is immediately handed to expand_expr. */
1766 build_new_1 (tree exp)
1768 tree placement, init;
1769 tree true_type, size, rval;
1770 /* The type of the new-expression. (This type is always a pointer
1773 /* The type pointed to by POINTER_TYPE. */
1775 /* The type being allocated. For "new T[...]" this will be an
1778 /* A pointer type pointing to to the FULL_TYPE. */
1779 tree full_pointer_type;
1780 tree outer_nelts = NULL_TREE;
1781 tree nelts = NULL_TREE;
1782 tree alloc_call, alloc_expr;
1783 /* The address returned by the call to "operator new". This node is
1784 a VAR_DECL and is therefore reusable. */
1787 tree cookie_expr, init_expr;
1789 enum tree_code code;
1790 int nothrow, check_new;
1791 /* Nonzero if the user wrote `::new' rather than just `new'. */
1792 int globally_qualified_p;
1793 int use_java_new = 0;
1794 /* If non-NULL, the number of extra bytes to allocate at the
1795 beginning of the storage allocated for an array-new expression in
1796 order to store the number of elements. */
1797 tree cookie_size = NULL_TREE;
1798 /* True if the function we are calling is a placement allocation
1800 bool placement_allocation_fn_p;
1801 tree args = NULL_TREE;
1802 /* True if the storage must be initialized, either by a constructor
1803 or due to an explicit new-initializer. */
1804 bool is_initialized;
1805 /* The address of the thing allocated, not including any cookie. In
1806 particular, if an array cookie is in use, DATA_ADDR is the
1807 address of the first array element. This node is a VAR_DECL, and
1808 is therefore reusable. */
1810 tree init_preeval_expr = NULL_TREE;
1812 placement = TREE_OPERAND (exp, 0);
1813 type = TREE_OPERAND (exp, 1);
1814 nelts = TREE_OPERAND (exp, 2);
1815 init = TREE_OPERAND (exp, 3);
1816 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1823 outer_nelts = nelts;
1825 /* ??? The middle-end will error on us for building a VLA outside a
1826 function context. Methinks that's not it's purvey. So we'll do
1827 our own VLA layout later. */
1829 full_type = build_cplus_array_type (type, NULL_TREE);
1831 index = convert (sizetype, nelts);
1832 index = size_binop (MINUS_EXPR, index, size_one_node);
1833 TYPE_DOMAIN (full_type) = build_index_type (index);
1840 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1842 /* If our base type is an array, then make sure we know how many elements
1844 while (TREE_CODE (true_type) == ARRAY_TYPE)
1846 tree this_nelts = array_type_nelts_top (true_type);
1847 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1848 true_type = TREE_TYPE (true_type);
1851 if (!complete_type_or_else (true_type, exp))
1852 return error_mark_node;
1854 if (TREE_CODE (true_type) == VOID_TYPE)
1856 error ("invalid type `void' for new");
1857 return error_mark_node;
1860 if (abstract_virtuals_error (NULL_TREE, true_type))
1861 return error_mark_node;
1863 is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
1864 if (CP_TYPE_CONST_P (true_type) && !is_initialized)
1866 error ("uninitialized const in `new' of `%#T'", true_type);
1867 return error_mark_node;
1870 size = size_in_bytes (true_type);
1875 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is necessary in
1876 order for the <INIT_EXPR <*foo> <CONSTRUCTOR ...>> to be valid. */
1878 n = convert (sizetype, nelts);
1879 size = size_binop (MULT_EXPR, size, n);
1880 TYPE_SIZE_UNIT (full_type) = size;
1882 n = convert (bitsizetype, nelts);
1883 bitsize = size_binop (MULT_EXPR, TYPE_SIZE (true_type), n);
1884 TYPE_SIZE (full_type) = bitsize;
1887 /* Allocate the object. */
1888 if (! placement && TYPE_FOR_JAVA (true_type))
1890 tree class_addr, alloc_decl;
1891 tree class_decl = build_java_class_ref (true_type);
1892 static const char alloc_name[] = "_Jv_AllocObject";
1896 if (!get_global_value_if_present (get_identifier (alloc_name),
1899 error ("call to Java constructor with `%s' undefined", alloc_name);
1900 return error_mark_node;
1902 else if (really_overloaded_fn (alloc_decl))
1904 error ("`%D' should never be overloaded", alloc_decl);
1905 return error_mark_node;
1907 alloc_decl = OVL_CURRENT (alloc_decl);
1908 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1909 alloc_call = (build_function_call
1911 build_tree_list (NULL_TREE, class_addr)));
1918 fnname = ansi_opname (code);
1920 if (!globally_qualified_p
1921 && CLASS_TYPE_P (true_type)
1923 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
1924 : TYPE_HAS_NEW_OPERATOR (true_type)))
1926 /* Use a class-specific operator new. */
1927 /* If a cookie is required, add some extra space. */
1928 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1930 cookie_size = targetm.cxx.get_cookie_size (true_type);
1931 size = size_binop (PLUS_EXPR, size, cookie_size);
1933 /* Create the argument list. */
1934 args = tree_cons (NULL_TREE, size, placement);
1935 /* Do name-lookup to find the appropriate operator. */
1936 fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
1937 if (TREE_CODE (fns) == TREE_LIST)
1939 error ("request for member `%D' is ambiguous", fnname);
1940 print_candidates (fns);
1941 return error_mark_node;
1943 alloc_call = build_new_method_call (build_dummy_object (true_type),
1945 /*conversion_path=*/NULL_TREE,
1950 /* Use a global operator new. */
1951 /* See if a cookie might be required. */
1952 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1953 cookie_size = targetm.cxx.get_cookie_size (true_type);
1955 cookie_size = NULL_TREE;
1957 alloc_call = build_operator_new_call (fnname, placement,
1958 &size, &cookie_size);
1962 if (alloc_call == error_mark_node)
1963 return error_mark_node;
1965 /* In the simple case, we can stop now. */
1966 pointer_type = build_pointer_type (type);
1967 if (!cookie_size && !is_initialized)
1968 return build_nop (pointer_type, alloc_call);
1970 /* While we're working, use a pointer to the type we've actually
1971 allocated. Store the result of the call in a variable so that we
1972 can use it more than once. */
1973 full_pointer_type = build_pointer_type (full_type);
1974 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1975 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1977 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1978 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1979 alloc_call = TREE_OPERAND (alloc_call, 1);
1980 alloc_fn = get_callee_fndecl (alloc_call);
1981 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
1983 /* Now, check to see if this function is actually a placement
1984 allocation function. This can happen even when PLACEMENT is NULL
1985 because we might have something like:
1987 struct S { void* operator new (size_t, int i = 0); };
1989 A call to `new S' will get this allocation function, even though
1990 there is no explicit placement argument. If there is more than
1991 one argument, or there are variable arguments, then this is a
1992 placement allocation function. */
1993 placement_allocation_fn_p
1994 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1995 || varargs_function_p (alloc_fn));
1997 /* Preevaluate the placement args so that we don't reevaluate them for a
1998 placement delete. */
1999 if (placement_allocation_fn_p)
2002 stabilize_call (alloc_call, &inits);
2004 alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2008 /* unless an allocation function is declared with an empty excep-
2009 tion-specification (_except.spec_), throw(), it indicates failure to
2010 allocate storage by throwing a bad_alloc exception (clause _except_,
2011 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2012 cation function is declared with an empty exception-specification,
2013 throw(), it returns null to indicate failure to allocate storage and a
2014 non-null pointer otherwise.
2016 So check for a null exception spec on the op new we just called. */
2018 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2019 check_new = (flag_check_new || nothrow) && ! use_java_new;
2026 /* Adjust so we're pointing to the start of the object. */
2027 data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2028 alloc_node, cookie_size));
2030 /* Store the number of bytes allocated so that we can know how
2031 many elements to destroy later. We use the last sizeof
2032 (size_t) bytes to store the number of elements. */
2033 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2034 data_addr, size_in_bytes (sizetype));
2035 cookie = build_indirect_ref (cookie_ptr, NULL);
2037 cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2039 if (targetm.cxx.cookie_has_size ())
2041 /* Also store the element size. */
2042 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2043 cookie_ptr, size_in_bytes (sizetype));
2044 cookie = build_indirect_ref (cookie_ptr, NULL);
2045 cookie = build (MODIFY_EXPR, sizetype, cookie,
2046 size_in_bytes(true_type));
2047 cookie_expr = build (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2048 cookie, cookie_expr);
2050 data_addr = TARGET_EXPR_SLOT (data_addr);
2054 cookie_expr = NULL_TREE;
2055 data_addr = alloc_node;
2058 /* Now initialize the allocated object. Note that we preevaluate the
2059 initialization expression, apart from the actual constructor call or
2060 assignment--we do this because we want to delay the allocation as long
2061 as possible in order to minimize the size of the exception region for
2062 placement delete. */
2067 init_expr = build_indirect_ref (data_addr, NULL);
2069 if (init == void_zero_node)
2070 init = build_default_init (full_type, nelts);
2071 else if (init && has_array)
2072 pedwarn ("ISO C++ forbids initialization in array new");
2077 = build_vec_init (init_expr,
2078 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2080 init, /*from_array=*/0);
2082 /* An array initialization is stable because the initialization
2083 of each element is a full-expression, so the temporaries don't
2087 else if (TYPE_NEEDS_CONSTRUCTING (type))
2089 init_expr = build_special_member_call (init_expr,
2090 complete_ctor_identifier,
2091 init, TYPE_BINFO (true_type),
2093 stable = stabilize_init (init_expr, &init_preeval_expr);
2097 /* We are processing something like `new int (10)', which
2098 means allocate an int, and initialize it with 10. */
2100 if (TREE_CODE (init) == TREE_LIST)
2101 init = build_x_compound_expr_from_list (init, "new initializer");
2103 else if (TREE_CODE (init) == CONSTRUCTOR
2104 && TREE_TYPE (init) == NULL_TREE)
2107 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2108 stable = stabilize_init (init_expr, &init_preeval_expr);
2111 if (init_expr == error_mark_node)
2112 return error_mark_node;
2114 /* If any part of the object initialization terminates by throwing an
2115 exception and a suitable deallocation function can be found, the
2116 deallocation function is called to free the memory in which the
2117 object was being constructed, after which the exception continues
2118 to propagate in the context of the new-expression. If no
2119 unambiguous matching deallocation function can be found,
2120 propagating the exception does not cause the object's memory to be
2122 if (flag_exceptions && ! use_java_new)
2124 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2127 /* The Standard is unclear here, but the right thing to do
2128 is to use the same method for finding deallocation
2129 functions that we use for finding allocation functions. */
2130 cleanup = build_op_delete_call (dcode, alloc_node, size,
2131 globally_qualified_p,
2132 (placement_allocation_fn_p
2133 ? alloc_call : NULL_TREE));
2138 /* This is much simpler if we were able to preevaluate all of
2139 the arguments to the constructor call. */
2140 init_expr = build (TRY_CATCH_EXPR, void_type_node,
2141 init_expr, cleanup);
2143 /* Ack! First we allocate the memory. Then we set our sentry
2144 variable to true, and expand a cleanup that deletes the
2145 memory if sentry is true. Then we run the constructor, and
2146 finally clear the sentry.
2148 We need to do this because we allocate the space first, so
2149 if there are any temporaries with cleanups in the
2150 constructor args and we weren't able to preevaluate them, we
2151 need this EH region to extend until end of full-expression
2152 to preserve nesting. */
2154 tree end, sentry, begin;
2156 begin = get_target_expr (boolean_true_node);
2157 CLEANUP_EH_ONLY (begin) = 1;
2159 sentry = TARGET_EXPR_SLOT (begin);
2161 TARGET_EXPR_CLEANUP (begin)
2162 = build (COND_EXPR, void_type_node, sentry,
2163 cleanup, void_zero_node);
2165 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2166 sentry, boolean_false_node);
2169 = build (COMPOUND_EXPR, void_type_node, begin,
2170 build (COMPOUND_EXPR, void_type_node, init_expr,
2177 init_expr = NULL_TREE;
2179 /* Now build up the return value in reverse order. */
2184 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2186 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2188 if (rval == alloc_node)
2189 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2190 and return the call (which doesn't need to be adjusted). */
2191 rval = TARGET_EXPR_INITIAL (alloc_expr);
2196 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2198 rval = build_conditional_expr (ifexp, rval, alloc_node);
2201 /* Perform the allocation before anything else, so that ALLOC_NODE
2202 has been initialized before we start using it. */
2203 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2206 if (init_preeval_expr)
2207 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2209 /* Convert to the final type. */
2210 rval = build_nop (pointer_type, rval);
2212 /* A new-expression is never an lvalue. */
2213 if (real_lvalue_p (rval))
2214 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2220 build_vec_delete_1 (tree base, tree maxindex, tree type,
2221 special_function_kind auto_delete_vec, int use_global_delete)
2224 tree ptype = build_pointer_type (type = complete_type (type));
2225 tree size_exp = size_in_bytes (type);
2227 /* Temporary variables used by the loop. */
2228 tree tbase, tbase_init;
2230 /* This is the body of the loop that implements the deletion of a
2231 single element, and moves temp variables to next elements. */
2234 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2237 /* This is the thing that governs what to do after the loop has run. */
2238 tree deallocate_expr = 0;
2240 /* This is the BIND_EXPR which holds the outermost iterator of the
2241 loop. It is convenient to set this variable up and test it before
2242 executing any other code in the loop.
2243 This is also the containing expression returned by this function. */
2244 tree controller = NULL_TREE;
2246 /* We should only have 1-D arrays here. */
2247 if (TREE_CODE (type) == ARRAY_TYPE)
2250 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2253 /* The below is short by the cookie size. */
2254 virtual_size = size_binop (MULT_EXPR, size_exp,
2255 convert (sizetype, maxindex));
2257 tbase = create_temporary_var (ptype);
2258 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2259 fold (build (PLUS_EXPR, ptype,
2262 DECL_REGISTER (tbase) = 1;
2263 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2264 TREE_SIDE_EFFECTS (controller) = 1;
2266 body = build (EXIT_EXPR, void_type_node,
2267 build (EQ_EXPR, boolean_type_node, base, tbase));
2268 body = build_compound_expr
2269 (body, build_modify_expr (tbase, NOP_EXPR,
2270 build (MINUS_EXPR, ptype, tbase, size_exp)));
2271 body = build_compound_expr
2272 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2273 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2275 loop = build (LOOP_EXPR, void_type_node, body);
2276 loop = build_compound_expr (tbase_init, loop);
2279 /* If the delete flag is one, or anything else with the low bit set,
2280 delete the storage. */
2281 if (auto_delete_vec != sfk_base_destructor)
2285 /* The below is short by the cookie size. */
2286 virtual_size = size_binop (MULT_EXPR, size_exp,
2287 convert (sizetype, maxindex));
2289 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2296 cookie_size = targetm.cxx.get_cookie_size (type);
2298 = cp_convert (ptype,
2299 cp_build_binary_op (MINUS_EXPR,
2300 cp_convert (string_type_node,
2303 /* True size with header. */
2304 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2307 if (auto_delete_vec == sfk_deleting_destructor)
2308 deallocate_expr = build_x_delete (base_tbd,
2309 2 | use_global_delete,
2314 if (!deallocate_expr)
2317 body = deallocate_expr;
2319 body = build_compound_expr (body, deallocate_expr);
2322 body = integer_zero_node;
2324 /* Outermost wrapper: If pointer is null, punt. */
2325 body = fold (build (COND_EXPR, void_type_node,
2326 fold (build (NE_EXPR, boolean_type_node, base,
2327 convert (TREE_TYPE (base),
2328 integer_zero_node))),
2329 body, integer_zero_node));
2330 body = build1 (NOP_EXPR, void_type_node, body);
2334 TREE_OPERAND (controller, 1) = body;
2338 if (TREE_CODE (base) == SAVE_EXPR)
2339 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2340 body = build (COMPOUND_EXPR, void_type_node, base, body);
2342 return convert_to_void (body, /*implicit=*/NULL);
2345 /* Create an unnamed variable of the indicated TYPE. */
2348 create_temporary_var (tree type)
2352 decl = build_decl (VAR_DECL, NULL_TREE, type);
2353 TREE_USED (decl) = 1;
2354 DECL_ARTIFICIAL (decl) = 1;
2355 DECL_SOURCE_LOCATION (decl) = input_location;
2356 DECL_IGNORED_P (decl) = 1;
2357 DECL_CONTEXT (decl) = current_function_decl;
2362 /* Create a new temporary variable of the indicated TYPE, initialized
2365 It is not entered into current_binding_level, because that breaks
2366 things when it comes time to do final cleanups (which take place
2367 "outside" the binding contour of the function). */
2370 get_temp_regvar (tree type, tree init)
2374 decl = create_temporary_var (type);
2375 add_decl_expr (decl);
2377 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2382 /* `build_vec_init' returns tree structure that performs
2383 initialization of a vector of aggregate types.
2385 BASE is a reference to the vector, of ARRAY_TYPE.
2386 MAXINDEX is the maximum index of the array (one less than the
2387 number of elements). It is only used if
2388 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2389 INIT is the (possibly NULL) initializer.
2391 FROM_ARRAY is 0 if we should init everything with INIT
2392 (i.e., every element initialized from INIT).
2393 FROM_ARRAY is 1 if we should index into INIT in parallel
2394 with initialization of DECL.
2395 FROM_ARRAY is 2 if we should index into INIT in parallel,
2396 but use assignment instead of initialization. */
2399 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2402 tree base2 = NULL_TREE;
2404 tree itype = NULL_TREE;
2406 /* The type of the array. */
2407 tree atype = TREE_TYPE (base);
2408 /* The type of an element in the array. */
2409 tree type = TREE_TYPE (atype);
2410 /* The type of a pointer to an element in the array. */
2415 tree try_block = NULL_TREE;
2416 int num_initialized_elts = 0;
2419 if (TYPE_DOMAIN (atype))
2420 maxindex = array_type_nelts (atype);
2422 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2423 return error_mark_node;
2427 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2428 : !TYPE_NEEDS_CONSTRUCTING (type))
2429 && ((TREE_CODE (init) == CONSTRUCTOR
2430 /* Don't do this if the CONSTRUCTOR might contain something
2431 that might throw and require us to clean up. */
2432 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2433 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2436 /* Do non-default initialization of POD arrays resulting from
2437 brace-enclosed initializers. In this case, digest_init and
2438 store_constructor will handle the semantics for us. */
2440 stmt_expr = build (INIT_EXPR, atype, base, init);
2444 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2445 ptype = build_pointer_type (type);
2446 size = size_in_bytes (type);
2447 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2448 base = cp_convert (ptype, decay_conversion (base));
2450 /* The code we are generating looks like:
2454 ptrdiff_t iterator = maxindex;
2456 for (; iterator != -1; --iterator) {
2457 ... initialize *t1 ...
2461 ... destroy elements that were constructed ...
2466 We can omit the try and catch blocks if we know that the
2467 initialization will never throw an exception, or if the array
2468 elements do not have destructors. We can omit the loop completely if
2469 the elements of the array do not have constructors.
2471 We actually wrap the entire body of the above in a STMT_EXPR, for
2474 When copying from array to another, when the array elements have
2475 only trivial copy constructors, we should use __builtin_memcpy
2476 rather than generating a loop. That way, we could take advantage
2477 of whatever cleverness the back-end has for dealing with copies
2478 of blocks of memory. */
2480 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2481 destroy_temps = stmts_are_full_exprs_p ();
2482 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2483 rval = get_temp_regvar (ptype, base);
2484 base = get_temp_regvar (ptype, rval);
2485 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2487 /* Protect the entire array initialization so that we can destroy
2488 the partially constructed array if an exception is thrown.
2489 But don't do this if we're assigning. */
2490 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2493 try_block = begin_try_block ();
2496 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2498 /* Do non-default initialization of non-POD arrays resulting from
2499 brace-enclosed initializers. */
2504 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2506 tree elt = TREE_VALUE (elts);
2507 tree baseref = build1 (INDIRECT_REF, type, base);
2509 num_initialized_elts++;
2511 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2512 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2513 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2515 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2517 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2519 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2520 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2523 /* Clear out INIT so that we don't get confused below. */
2526 else if (from_array)
2528 /* If initializing one array from another, initialize element by
2529 element. We rely upon the below calls the do argument
2533 base2 = decay_conversion (init);
2534 itype = TREE_TYPE (base2);
2535 base2 = get_temp_regvar (itype, base2);
2536 itype = TREE_TYPE (itype);
2538 else if (TYPE_LANG_SPECIFIC (type)
2539 && TYPE_NEEDS_CONSTRUCTING (type)
2540 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2542 error ("initializer ends prematurely");
2543 return error_mark_node;
2547 /* Now, default-initialize any remaining elements. We don't need to
2548 do that if a) the type does not need constructing, or b) we've
2549 already initialized all the elements.
2551 We do need to keep going if we're copying an array. */
2554 || (TYPE_NEEDS_CONSTRUCTING (type)
2555 && ! (host_integerp (maxindex, 0)
2556 && (num_initialized_elts
2557 == tree_low_cst (maxindex, 0) + 1))))
2559 /* If the ITERATOR is equal to -1, then we don't have to loop;
2560 we've already initialized all the elements. */
2564 for_stmt = begin_for_stmt ();
2565 finish_for_init_stmt (for_stmt);
2566 finish_for_cond (build (NE_EXPR, boolean_type_node,
2567 iterator, integer_minus_one_node),
2569 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2574 tree to = build1 (INDIRECT_REF, type, base);
2578 from = build1 (INDIRECT_REF, itype, base2);
2582 if (from_array == 2)
2583 elt_init = build_modify_expr (to, NOP_EXPR, from);
2584 else if (TYPE_NEEDS_CONSTRUCTING (type))
2585 elt_init = build_aggr_init (to, from, 0);
2587 elt_init = build_modify_expr (to, NOP_EXPR, from);
2591 else if (TREE_CODE (type) == ARRAY_TYPE)
2595 ("cannot initialize multi-dimensional array with initializer");
2596 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2600 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2603 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2604 finish_expr_stmt (elt_init);
2605 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2607 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2609 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2611 finish_for_stmt (for_stmt);
2614 /* Make sure to cleanup any partially constructed elements. */
2615 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2619 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2621 /* Flatten multi-dimensional array since build_vec_delete only
2622 expects one-dimensional array. */
2623 if (TREE_CODE (type) == ARRAY_TYPE)
2625 m = cp_build_binary_op (MULT_EXPR, m,
2626 array_type_nelts_total (type));
2627 type = strip_array_types (type);
2630 finish_cleanup_try_block (try_block);
2631 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2632 /*use_global_delete=*/0);
2633 finish_cleanup (e, try_block);
2636 /* The value of the array initialization is the array itself, RVAL
2637 is a pointer to the first element. */
2638 finish_stmt_expr_expr (rval, stmt_expr);
2640 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2642 /* Now convert make the result have the correct type. */
2643 atype = build_pointer_type (atype);
2644 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2645 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2647 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2651 /* Free up storage of type TYPE, at address ADDR.
2653 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2656 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2657 used as the second argument to operator delete. It can include
2658 things like padding and magic size cookies. It has virtual in it,
2659 because if you have a base pointer and you delete through a virtual
2660 destructor, it should be the size of the dynamic object, not the
2661 static object, see Free Store 12.5 ISO C++.
2663 This does not call any destructors. */
2666 build_x_delete (tree addr, int which_delete, tree virtual_size)
2668 int use_global_delete = which_delete & 1;
2669 int use_vec_delete = !!(which_delete & 2);
2670 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2672 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2676 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2680 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2686 case sfk_complete_destructor:
2687 name = complete_dtor_identifier;
2690 case sfk_base_destructor:
2691 name = base_dtor_identifier;
2694 case sfk_deleting_destructor:
2695 name = deleting_dtor_identifier;
2702 exp = convert_from_reference (exp);
2703 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2704 return build_new_method_call (exp, fn,
2706 /*conversion_path=*/NULL_TREE,
2710 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2711 ADDR is an expression which yields the store to be destroyed.
2712 AUTO_DELETE is the name of the destructor to call, i.e., either
2713 sfk_complete_destructor, sfk_base_destructor, or
2714 sfk_deleting_destructor.
2716 FLAGS is the logical disjunction of zero or more LOOKUP_
2717 flags. See cp-tree.h for more info. */
2720 build_delete (tree type, tree addr, special_function_kind auto_delete,
2721 int flags, int use_global_delete)
2725 if (addr == error_mark_node)
2726 return error_mark_node;
2728 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2729 set to `error_mark_node' before it gets properly cleaned up. */
2730 if (type == error_mark_node)
2731 return error_mark_node;
2733 type = TYPE_MAIN_VARIANT (type);
2735 if (TREE_CODE (type) == POINTER_TYPE)
2737 bool complete_p = true;
2739 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2740 if (TREE_CODE (type) == ARRAY_TYPE)
2743 /* We don't want to warn about delete of void*, only other
2744 incomplete types. Deleting other incomplete types
2745 invokes undefined behavior, but it is not ill-formed, so
2746 compile to something that would even do The Right Thing
2747 (TM) should the type have a trivial dtor and no delete
2749 if (!VOID_TYPE_P (type))
2751 complete_type (type);
2752 if (!COMPLETE_TYPE_P (type))
2754 warning ("possible problem detected in invocation of "
2755 "delete operator:");
2756 cxx_incomplete_type_diagnostic (addr, type, 1);
2757 inform ("neither the destructor nor the class-specific "
2758 "operator delete will be called, even if they are "
2759 "declared when the class is defined.");
2763 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2764 /* Call the builtin operator delete. */
2765 return build_builtin_delete_call (addr);
2766 if (TREE_SIDE_EFFECTS (addr))
2767 addr = save_expr (addr);
2769 /* Throw away const and volatile on target type of addr. */
2770 addr = convert_force (build_pointer_type (type), addr, 0);
2772 else if (TREE_CODE (type) == ARRAY_TYPE)
2776 if (TYPE_DOMAIN (type) == NULL_TREE)
2778 error ("unknown array size in delete");
2779 return error_mark_node;
2781 return build_vec_delete (addr, array_type_nelts (type),
2782 auto_delete, use_global_delete);
2786 /* Don't check PROTECT here; leave that decision to the
2787 destructor. If the destructor is accessible, call it,
2788 else report error. */
2789 addr = build_unary_op (ADDR_EXPR, addr, 0);
2790 if (TREE_SIDE_EFFECTS (addr))
2791 addr = save_expr (addr);
2793 addr = convert_force (build_pointer_type (type), addr, 0);
2796 my_friendly_assert (IS_AGGR_TYPE (type), 220);
2798 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2800 if (auto_delete != sfk_deleting_destructor)
2801 return void_zero_node;
2803 return build_op_delete_call
2804 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2809 tree do_delete = NULL_TREE;
2812 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2814 /* For `::delete x', we must not use the deleting destructor
2815 since then we would not be sure to get the global `operator
2817 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2819 /* We will use ADDR multiple times so we must save it. */
2820 addr = save_expr (addr);
2821 /* Delete the object. */
2822 do_delete = build_builtin_delete_call (addr);
2823 /* Otherwise, treat this like a complete object destructor
2825 auto_delete = sfk_complete_destructor;
2827 /* If the destructor is non-virtual, there is no deleting
2828 variant. Instead, we must explicitly call the appropriate
2829 `operator delete' here. */
2830 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2831 && auto_delete == sfk_deleting_destructor)
2833 /* We will use ADDR multiple times so we must save it. */
2834 addr = save_expr (addr);
2835 /* Build the call. */
2836 do_delete = build_op_delete_call (DELETE_EXPR,
2838 cxx_sizeof_nowarn (type),
2841 /* Call the complete object destructor. */
2842 auto_delete = sfk_complete_destructor;
2844 else if (auto_delete == sfk_deleting_destructor
2845 && TYPE_GETS_REG_DELETE (type))
2847 /* Make sure we have access to the member op delete, even though
2848 we'll actually be calling it from the destructor. */
2849 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2850 /*global_p=*/false, NULL_TREE);
2853 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2854 auto_delete, flags);
2856 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2858 if (flags & LOOKUP_DESTRUCTOR)
2859 /* Explicit destructor call; don't check for null pointer. */
2860 ifexp = integer_one_node;
2862 /* Handle deleting a null pointer. */
2863 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2865 if (ifexp != integer_one_node)
2866 expr = build (COND_EXPR, void_type_node,
2867 ifexp, expr, void_zero_node);
2873 /* At the beginning of a destructor, push cleanups that will call the
2874 destructors for our base classes and members.
2876 Called from begin_destructor_body. */
2879 push_base_cleanups (void)
2882 int i, n_baseclasses;
2886 /* Run destructors for all virtual baseclasses. */
2887 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
2889 tree cond = (condition_conversion
2890 (build (BIT_AND_EXPR, integer_type_node,
2891 current_in_charge_parm,
2892 integer_two_node)));
2894 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2895 order, which is also the right order for pushing cleanups. */
2896 for (i = 0; (binfos = VEC_iterate
2897 (tree, CLASSTYPE_VBASECLASSES (current_class_type), i));
2900 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (binfos)))
2902 expr = build_special_member_call (current_class_ref,
2903 base_dtor_identifier,
2907 | LOOKUP_NONVIRTUAL));
2908 expr = build (COND_EXPR, void_type_node, cond,
2909 expr, void_zero_node);
2910 finish_decl_cleanup (NULL_TREE, expr);
2915 binfos = BINFO_BASE_BINFOS (TYPE_BINFO (current_class_type));
2916 n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type));
2918 /* Take care of the remaining baseclasses. */
2919 for (i = 0; i < n_baseclasses; i++)
2921 tree base_binfo = TREE_VEC_ELT (binfos, i);
2922 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2923 || BINFO_VIRTUAL_P (base_binfo))
2926 expr = build_special_member_call (current_class_ref,
2927 base_dtor_identifier,
2928 NULL_TREE, base_binfo,
2929 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2930 finish_decl_cleanup (NULL_TREE, expr);
2933 for (member = TYPE_FIELDS (current_class_type); member;
2934 member = TREE_CHAIN (member))
2936 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2938 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2940 tree this_member = (build_class_member_access_expr
2941 (current_class_ref, member,
2942 /*access_path=*/NULL_TREE,
2943 /*preserve_reference=*/false));
2944 tree this_type = TREE_TYPE (member);
2945 expr = build_delete (this_type, this_member,
2946 sfk_complete_destructor,
2947 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2949 finish_decl_cleanup (NULL_TREE, expr);
2954 /* For type TYPE, delete the virtual baseclass objects of DECL. */
2957 build_vbase_delete (tree type, tree decl)
2962 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
2964 my_friendly_assert (addr != error_mark_node, 222);
2966 result = convert_to_void (integer_zero_node, NULL);
2967 for (ix = 0; (binfo = VEC_iterate
2968 (tree, CLASSTYPE_VBASECLASSES (type), ix)); ix++)
2970 tree base_addr = convert_force
2971 (build_pointer_type (BINFO_TYPE (binfo)), addr, 0);
2972 tree base_delete = build_delete
2973 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
2974 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
2976 result = build_compound_expr (result, base_delete);
2981 /* Build a C++ vector delete expression.
2982 MAXINDEX is the number of elements to be deleted.
2983 ELT_SIZE is the nominal size of each element in the vector.
2984 BASE is the expression that should yield the store to be deleted.
2985 This function expands (or synthesizes) these calls itself.
2986 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2988 This also calls delete for virtual baseclasses of elements of the vector.
2990 Update: MAXINDEX is no longer needed. The size can be extracted from the
2991 start of the vector for pointers, and from the type for arrays. We still
2992 use MAXINDEX for arrays because it happens to already have one of the
2993 values we'd have to extract. (We could use MAXINDEX with pointers to
2994 confirm the size, and trap if the numbers differ; not clear that it'd
2995 be worth bothering.) */
2998 build_vec_delete (tree base, tree maxindex,
2999 special_function_kind auto_delete_vec, int use_global_delete)
3003 tree base_init = NULL_TREE;
3005 type = TREE_TYPE (base);
3007 if (TREE_CODE (type) == POINTER_TYPE)
3009 /* Step back one from start of vector, and read dimension. */
3012 if (TREE_SIDE_EFFECTS (base))
3014 base_init = get_target_expr (base);
3015 base = TARGET_EXPR_SLOT (base_init);
3017 type = strip_array_types (TREE_TYPE (type));
3018 cookie_addr = build (MINUS_EXPR,
3019 build_pointer_type (sizetype),
3021 TYPE_SIZE_UNIT (sizetype));
3022 maxindex = build_indirect_ref (cookie_addr, NULL);
3024 else if (TREE_CODE (type) == ARRAY_TYPE)
3026 /* Get the total number of things in the array, maxindex is a
3028 maxindex = array_type_nelts_total (type);
3029 type = strip_array_types (type);
3030 base = build_unary_op (ADDR_EXPR, base, 1);
3031 if (TREE_SIDE_EFFECTS (base))
3033 base_init = get_target_expr (base);
3034 base = TARGET_EXPR_SLOT (base_init);
3039 if (base != error_mark_node)
3040 error ("type to vector delete is neither pointer or array type");
3041 return error_mark_node;
3044 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3047 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);