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) || TREE_VIA_VIRTUAL (binfo))
105 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
107 tree base_ptr = TREE_VALUE ((tree) data);
109 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
111 expand_virtual_init (binfo, base_ptr);
114 BINFO_MARKED (binfo) = 1;
119 /* Initialize all the vtable pointers in the object pointed to by
123 initialize_vtbl_ptrs (tree addr)
128 type = TREE_TYPE (TREE_TYPE (addr));
129 list = build_tree_list (type, addr);
131 /* Walk through the hierarchy, initializing the vptr in each base
132 class. We do these in pre-order because we can't find the virtual
133 bases for a class until we've initialized the vtbl for that
135 dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
136 NULL, unmarkedp, list);
137 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, type);
140 /* Return an expression for the zero-initialization of an object with
141 type T. This expression will either be a constant (in the case
142 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
143 aggregate). In either case, the value can be used as DECL_INITIAL
144 for a decl of the indicated TYPE; it is a valid static initializer.
145 If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
146 number of elements in the array. If STATIC_STORAGE_P is TRUE,
147 initializers are only generated for entities for which
148 zero-initialization does not simply mean filling the storage with
152 build_zero_init (tree type, tree nelts, bool static_storage_p)
154 tree init = NULL_TREE;
158 To zero-initialization storage for an object of type T means:
160 -- if T is a scalar type, the storage is set to the value of zero
163 -- if T is a non-union class type, the storage for each nonstatic
164 data member and each base-class subobject is zero-initialized.
166 -- if T is a union type, the storage for its first data member is
169 -- if T is an array type, the storage for each element is
172 -- if T is a reference type, no initialization is performed. */
174 my_friendly_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST,
177 if (type == error_mark_node)
179 else if (static_storage_p && zero_init_p (type))
180 /* In order to save space, we do not explicitly build initializers
181 for items that do not need them. GCC's semantics are that
182 items with static storage duration that are not otherwise
183 initialized are initialized to zero. */
185 else if (SCALAR_TYPE_P (type))
186 init = convert (type, integer_zero_node);
187 else if (CLASS_TYPE_P (type))
192 /* Build a constructor to contain the initializations. */
193 init = build_constructor (type, NULL_TREE);
194 /* Iterate over the fields, building initializations. */
196 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
198 if (TREE_CODE (field) != FIELD_DECL)
201 /* Note that for class types there will be FIELD_DECLs
202 corresponding to base classes as well. Thus, iterating
203 over TYPE_FIELDs will result in correct initialization of
204 all of the subobjects. */
205 if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
206 inits = tree_cons (field,
207 build_zero_init (TREE_TYPE (field),
212 /* For unions, only the first field is initialized. */
213 if (TREE_CODE (type) == UNION_TYPE)
216 CONSTRUCTOR_ELTS (init) = nreverse (inits);
218 else if (TREE_CODE (type) == ARRAY_TYPE)
224 /* Build a constructor to contain the initializations. */
225 init = build_constructor (type, NULL_TREE);
226 /* Iterate over the array elements, building initializations. */
228 max_index = nelts ? nelts : array_type_nelts (type);
229 my_friendly_assert (TREE_CODE (max_index) == INTEGER_CST, 20030618);
231 /* A zero-sized array, which is accepted as an extension, will
232 have an upper bound of -1. */
233 if (!tree_int_cst_equal (max_index, integer_minus_one_node))
234 for (index = size_zero_node;
235 !tree_int_cst_lt (max_index, index);
236 index = size_binop (PLUS_EXPR, index, size_one_node))
237 inits = tree_cons (index,
238 build_zero_init (TREE_TYPE (type),
242 CONSTRUCTOR_ELTS (init) = nreverse (inits);
244 else if (TREE_CODE (type) == REFERENCE_TYPE)
249 /* In all cases, the initializer is a constant. */
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 < CLASSTYPE_N_BASECLASSES (t); ++i)
480 base = BINFO_BASETYPE (TYPE_BINFO (t), i);
481 if (!TREE_VIA_VIRTUAL (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 (TREE_VIA_VIRTUAL (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) && TREE_VIA_VIRTUAL (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 (CLASSTYPE_N_BASECLASSES (current_class_type))
947 error ("unnamed initializer for `%T', which has no base classes",
951 basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
954 error ("unnamed initializer for `%T', which uses multiple inheritance",
959 else if (TYPE_P (name))
961 basetype = TYPE_MAIN_VARIANT (name);
962 name = TYPE_NAME (name);
964 else if (TREE_CODE (name) == TYPE_DECL)
965 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
967 basetype = NULL_TREE;
976 if (current_template_parms)
979 class_binfo = TYPE_BINFO (current_class_type);
980 direct_binfo = NULL_TREE;
981 virtual_binfo = NULL_TREE;
983 /* Look for a direct base. */
984 for (i = 0; i < BINFO_N_BASETYPES (class_binfo); ++i)
985 if (same_type_p (basetype,
986 TYPE_BINFO_BASETYPE (current_class_type, i)))
988 direct_binfo = BINFO_BASETYPE (class_binfo, i);
991 /* Look for a virtual base -- unless the direct base is itself
993 if (!direct_binfo || !TREE_VIA_VIRTUAL (direct_binfo))
994 virtual_binfo = binfo_for_vbase (basetype, current_class_type);
998 If a mem-initializer-id is ambiguous because it designates
999 both a direct non-virtual base class and an inherited virtual
1000 base class, the mem-initializer is ill-formed. */
1001 if (direct_binfo && virtual_binfo)
1003 error ("'%D' is both a direct base and an indirect virtual base",
1008 if (!direct_binfo && !virtual_binfo)
1010 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1011 error ("type `%D' is not a direct or virtual base of `%T'",
1012 name, current_class_type);
1014 error ("type `%D' is not a direct base of `%T'",
1015 name, current_class_type);
1019 return direct_binfo ? direct_binfo : virtual_binfo;
1023 if (TREE_CODE (name) == IDENTIFIER_NODE)
1024 field = lookup_field (current_class_type, name, 1, false);
1028 if (member_init_ok_or_else (field, current_class_type, name))
1035 /* This is like `expand_member_init', only it stores one aggregate
1038 INIT comes in two flavors: it is either a value which
1039 is to be stored in EXP, or it is a parameter list
1040 to go to a constructor, which will operate on EXP.
1041 If INIT is not a parameter list for a constructor, then set
1042 LOOKUP_ONLYCONVERTING.
1043 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1044 the initializer, if FLAGS is 0, then it is the (init) form.
1045 If `init' is a CONSTRUCTOR, then we emit a warning message,
1046 explaining that such initializations are invalid.
1048 If INIT resolves to a CALL_EXPR which happens to return
1049 something of the type we are looking for, then we know
1050 that we can safely use that call to perform the
1053 The virtual function table pointer cannot be set up here, because
1054 we do not really know its type.
1056 This never calls operator=().
1058 When initializing, nothing is CONST.
1060 A default copy constructor may have to be used to perform the
1063 A constructor or a conversion operator may have to be used to
1064 perform the initialization, but not both, as it would be ambiguous. */
1067 build_aggr_init (tree exp, tree init, int flags)
1072 tree type = TREE_TYPE (exp);
1073 int was_const = TREE_READONLY (exp);
1074 int was_volatile = TREE_THIS_VOLATILE (exp);
1077 if (init == error_mark_node)
1078 return error_mark_node;
1080 TREE_READONLY (exp) = 0;
1081 TREE_THIS_VOLATILE (exp) = 0;
1083 if (init && TREE_CODE (init) != TREE_LIST)
1084 flags |= LOOKUP_ONLYCONVERTING;
1086 if (TREE_CODE (type) == ARRAY_TYPE)
1090 /* An array may not be initialized use the parenthesized
1091 initialization form -- unless the initializer is "()". */
1092 if (init && TREE_CODE (init) == TREE_LIST)
1094 error ("bad array initializer");
1095 return error_mark_node;
1097 /* Must arrange to initialize each element of EXP
1098 from elements of INIT. */
1099 itype = init ? TREE_TYPE (init) : NULL_TREE;
1100 if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1101 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1102 if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1103 itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1104 stmt_expr = build_vec_init (exp, NULL_TREE, init,
1105 itype && same_type_p (itype,
1107 TREE_READONLY (exp) = was_const;
1108 TREE_THIS_VOLATILE (exp) = was_volatile;
1109 TREE_TYPE (exp) = type;
1111 TREE_TYPE (init) = itype;
1115 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1116 /* Just know that we've seen something for this node. */
1117 TREE_USED (exp) = 1;
1119 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1120 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1121 destroy_temps = stmts_are_full_exprs_p ();
1122 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1123 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1124 init, LOOKUP_NORMAL|flags);
1125 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1126 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1127 TREE_TYPE (exp) = type;
1128 TREE_READONLY (exp) = was_const;
1129 TREE_THIS_VOLATILE (exp) = was_volatile;
1134 /* Like build_aggr_init, but not just for aggregates. */
1137 build_init (tree decl, tree init, int flags)
1141 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1142 expr = build_aggr_init (decl, init, flags);
1143 else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1144 expr = build_special_member_call (decl, complete_ctor_identifier,
1145 build_tree_list (NULL_TREE, init),
1146 TYPE_BINFO (TREE_TYPE (decl)),
1147 LOOKUP_NORMAL|flags);
1149 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1155 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1157 tree type = TREE_TYPE (exp);
1160 /* It fails because there may not be a constructor which takes
1161 its own type as the first (or only parameter), but which does
1162 take other types via a conversion. So, if the thing initializing
1163 the expression is a unit element of type X, first try X(X&),
1164 followed by initialization by X. If neither of these work
1165 out, then look hard. */
1169 if (init && TREE_CODE (init) != TREE_LIST
1170 && (flags & LOOKUP_ONLYCONVERTING))
1172 /* Base subobjects should only get direct-initialization. */
1173 if (true_exp != exp)
1176 if (flags & DIRECT_BIND)
1177 /* Do nothing. We hit this in two cases: Reference initialization,
1178 where we aren't initializing a real variable, so we don't want
1179 to run a new constructor; and catching an exception, where we
1180 have already built up the constructor call so we could wrap it
1181 in an exception region. */;
1182 else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1184 /* A brace-enclosed initializer for an aggregate. */
1185 my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1186 init = digest_init (type, init, (tree *)NULL);
1189 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1191 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1192 /* We need to protect the initialization of a catch parm with a
1193 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1194 around the TARGET_EXPR for the copy constructor. See
1195 initialize_handler_parm. */
1197 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1198 TREE_OPERAND (init, 0));
1199 TREE_TYPE (init) = void_type_node;
1202 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1203 TREE_SIDE_EFFECTS (init) = 1;
1204 finish_expr_stmt (init);
1208 if (init == NULL_TREE
1209 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1213 init = TREE_VALUE (parms);
1216 parms = build_tree_list (NULL_TREE, init);
1218 if (true_exp == exp)
1219 ctor_name = complete_ctor_identifier;
1221 ctor_name = base_ctor_identifier;
1223 rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1224 if (TREE_SIDE_EFFECTS (rval))
1225 finish_expr_stmt (convert_to_void (rval, NULL));
1228 /* This function is responsible for initializing EXP with INIT
1231 BINFO is the binfo of the type for who we are performing the
1232 initialization. For example, if W is a virtual base class of A and B,
1234 If we are initializing B, then W must contain B's W vtable, whereas
1235 were we initializing C, W must contain C's W vtable.
1237 TRUE_EXP is nonzero if it is the true expression being initialized.
1238 In this case, it may be EXP, or may just contain EXP. The reason we
1239 need this is because if EXP is a base element of TRUE_EXP, we
1240 don't necessarily know by looking at EXP where its virtual
1241 baseclass fields should really be pointing. But we do know
1242 from TRUE_EXP. In constructors, we don't know anything about
1243 the value being initialized.
1245 FLAGS is just passed to `build_new_method_call'. See that function
1246 for its description. */
1249 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1251 tree type = TREE_TYPE (exp);
1253 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1254 my_friendly_assert (building_stmt_tree (), 20021010);
1256 /* Use a function returning the desired type to initialize EXP for us.
1257 If the function is a constructor, and its first argument is
1258 NULL_TREE, know that it was meant for us--just slide exp on
1259 in and expand the constructor. Constructors now come
1262 if (init && TREE_CODE (exp) == VAR_DECL
1263 && TREE_CODE (init) == CONSTRUCTOR
1264 && TREE_HAS_CONSTRUCTOR (init))
1266 /* If store_init_value returns NULL_TREE, the INIT has been
1267 record in the DECL_INITIAL for EXP. That means there's
1268 nothing more we have to do. */
1269 init = store_init_value (exp, init);
1271 finish_expr_stmt (init);
1275 /* We know that expand_default_init can handle everything we want
1277 expand_default_init (binfo, true_exp, exp, init, flags);
1280 /* Report an error if TYPE is not a user-defined, aggregate type. If
1281 OR_ELSE is nonzero, give an error message. */
1284 is_aggr_type (tree type, int or_else)
1286 if (type == error_mark_node)
1289 if (! IS_AGGR_TYPE (type)
1290 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1291 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1294 error ("`%T' is not an aggregate type", type);
1300 /* Like is_aggr_typedef, but returns typedef if successful. */
1303 get_aggr_from_typedef (tree name, int or_else)
1307 if (name == error_mark_node)
1310 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1311 type = IDENTIFIER_TYPE_VALUE (name);
1315 error ("`%T' fails to be an aggregate typedef", name);
1319 if (! IS_AGGR_TYPE (type)
1320 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1321 && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1324 error ("type `%T' is of non-aggregate type", type);
1331 get_type_value (tree name)
1333 if (name == error_mark_node)
1336 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1337 return IDENTIFIER_TYPE_VALUE (name);
1342 /* Build a reference to a member of an aggregate. This is not a C++
1343 `&', but really something which can have its address taken, and
1344 then act as a pointer to member, for example TYPE :: FIELD can have
1345 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1346 this expression is the operand of "&".
1348 @@ Prints out lousy diagnostics for operator <typename>
1351 @@ This function should be rewritten and placed in search.c. */
1354 build_offset_ref (tree type, tree name, bool address_p)
1358 tree basebinfo = NULL_TREE;
1359 tree orig_name = name;
1361 /* class templates can come in as TEMPLATE_DECLs here. */
1362 if (TREE_CODE (name) == TEMPLATE_DECL)
1365 if (processing_template_decl || uses_template_parms (type))
1366 return build_min_nt (SCOPE_REF, type, name);
1368 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1370 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1371 something like `a.template f<int>' or the like. For the most
1372 part, we treat this just like a.f. We do remember, however,
1373 the template-id that was used. */
1374 name = TREE_OPERAND (orig_name, 0);
1377 name = DECL_NAME (name);
1380 if (TREE_CODE (name) == COMPONENT_REF)
1381 name = TREE_OPERAND (name, 1);
1382 if (TREE_CODE (name) == OVERLOAD)
1383 name = DECL_NAME (OVL_CURRENT (name));
1386 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1389 if (type == NULL_TREE)
1390 return error_mark_node;
1392 /* Handle namespace names fully here. */
1393 if (TREE_CODE (type) == NAMESPACE_DECL)
1395 tree t = lookup_namespace_name (type, name);
1396 if (t == error_mark_node)
1398 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1399 /* Reconstruct the TEMPLATE_ID_EXPR. */
1400 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1401 t, TREE_OPERAND (orig_name, 1));
1402 if (! type_unknown_p (t))
1405 t = convert_from_reference (t);
1410 if (! is_aggr_type (type, 1))
1411 return error_mark_node;
1413 if (TREE_CODE (name) == BIT_NOT_EXPR)
1415 if (! check_dtor_name (type, name))
1416 error ("qualified type `%T' does not match destructor name `~%T'",
1417 type, TREE_OPERAND (name, 0));
1418 name = dtor_identifier;
1421 if (!COMPLETE_TYPE_P (complete_type (type))
1422 && !TYPE_BEING_DEFINED (type))
1424 error ("incomplete type `%T' does not have member `%D'", type,
1426 return error_mark_node;
1429 decl = maybe_dummy_object (type, &basebinfo);
1431 if (BASELINK_P (name) || DECL_P (name))
1435 member = lookup_member (basebinfo, name, 1, 0);
1437 if (member == error_mark_node)
1438 return error_mark_node;
1443 error ("`%D' is not a member of type `%T'", name, type);
1444 return error_mark_node;
1447 if (TREE_CODE (member) == TYPE_DECL)
1449 TREE_USED (member) = 1;
1452 /* static class members and class-specific enum
1453 values can be returned without further ado. */
1454 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1457 return convert_from_reference (member);
1460 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1462 error ("invalid pointer to bit-field `%D'", member);
1463 return error_mark_node;
1466 /* A lot of this logic is now handled in lookup_member. */
1467 if (BASELINK_P (member))
1469 /* Go from the TREE_BASELINK to the member function info. */
1470 tree fnfields = member;
1471 tree t = BASELINK_FUNCTIONS (fnfields);
1473 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1475 /* The FNFIELDS are going to contain functions that aren't
1476 necessarily templates, and templates that don't
1477 necessarily match the explicit template parameters. We
1478 save all the functions, and the explicit parameters, and
1479 then figure out exactly what to instantiate with what
1480 arguments in instantiate_type. */
1482 if (TREE_CODE (t) != OVERLOAD)
1483 /* The code in instantiate_type which will process this
1484 expects to encounter OVERLOADs, not raw functions. */
1485 t = ovl_cons (t, NULL_TREE);
1487 t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1488 TREE_OPERAND (orig_name, 1));
1489 t = build (OFFSET_REF, unknown_type_node, decl, t);
1491 PTRMEM_OK_P (t) = 1;
1496 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1498 /* Get rid of a potential OVERLOAD around it. */
1499 t = OVL_CURRENT (t);
1501 /* Unique functions are handled easily. */
1503 /* For non-static member of base class, we need a special rule
1504 for access checking [class.protected]:
1506 If the access is to form a pointer to member, the
1507 nested-name-specifier shall name the derived class
1508 (or any class derived from that class). */
1509 if (address_p && DECL_P (t)
1510 && DECL_NONSTATIC_MEMBER_P (t))
1511 perform_or_defer_access_check (TYPE_BINFO (type), t);
1513 perform_or_defer_access_check (basebinfo, t);
1516 if (DECL_STATIC_FUNCTION_P (t))
1522 TREE_TYPE (fnfields) = unknown_type_node;
1526 else if (address_p && TREE_CODE (member) == FIELD_DECL)
1527 /* We need additional test besides the one in
1528 check_accessibility_of_qualified_id in case it is
1529 a pointer to non-static member. */
1530 perform_or_defer_access_check (TYPE_BINFO (type), member);
1534 /* If MEMBER is non-static, then the program has fallen afoul of
1537 An id-expression that denotes a nonstatic data member or
1538 nonstatic member function of a class can only be used:
1540 -- as part of a class member access (_expr.ref_) in which the
1541 object-expression refers to the member's class or a class
1542 derived from that class, or
1544 -- to form a pointer to member (_expr.unary.op_), or
1546 -- in the body of a nonstatic member function of that class or
1547 of a class derived from that class (_class.mfct.nonstatic_), or
1549 -- in a mem-initializer for a constructor for that class or for
1550 a class derived from that class (_class.base.init_). */
1551 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1553 /* Build a representation of a the qualified name suitable
1554 for use as the operand to "&" -- even though the "&" is
1555 not actually present. */
1556 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1557 /* In Microsoft mode, treat a non-static member function as if
1558 it were a pointer-to-member. */
1559 if (flag_ms_extensions)
1561 PTRMEM_OK_P (member) = 1;
1562 return build_unary_op (ADDR_EXPR, member, 0);
1564 error ("invalid use of non-static member function `%D'",
1565 TREE_OPERAND (member, 1));
1568 else if (TREE_CODE (member) == FIELD_DECL)
1570 error ("invalid use of non-static data member `%D'", member);
1571 return error_mark_node;
1576 /* In member functions, the form `type::name' is no longer
1577 equivalent to `this->type::name', at least not until
1578 resolve_offset_ref. */
1579 member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1580 PTRMEM_OK_P (member) = 1;
1584 /* If DECL is a `const' declaration, and its value is a known
1585 constant, then return that value. */
1588 decl_constant_value (tree decl)
1590 /* When we build a COND_EXPR, we don't know whether it will be used
1591 as an lvalue or as an rvalue. If it is an lvalue, it's not safe
1592 to replace the second and third operands with their
1593 initializers. So, we do that here. */
1594 if (TREE_CODE (decl) == COND_EXPR)
1599 d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1600 d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1602 if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1603 return build (COND_EXPR,
1605 TREE_OPERAND (decl, 0), d1, d2);
1609 && (/* Enumeration constants are constant. */
1610 TREE_CODE (decl) == CONST_DECL
1611 /* And so are variables with a 'const' type -- unless they
1612 are also 'volatile'. */
1613 || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1614 && TREE_CODE (decl) != PARM_DECL
1615 && DECL_INITIAL (decl)
1616 && DECL_INITIAL (decl) != error_mark_node
1617 /* This is invalid if initial value is not constant.
1618 If it has either a function call, a memory reference,
1619 or a variable, then re-evaluating it could give different results. */
1620 && TREE_CONSTANT (DECL_INITIAL (decl))
1621 /* Check for cases where this is sub-optimal, even though valid. */
1622 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1623 return DECL_INITIAL (decl);
1627 /* Common subroutines of build_new and build_vec_delete. */
1629 /* Call the global __builtin_delete to delete ADDR. */
1632 build_builtin_delete_call (tree addr)
1634 mark_used (global_delete_fndecl);
1635 return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1638 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1639 (which needs to go through some sort of groktypename) or it
1640 is the name of the class we are newing. INIT is an initialization value.
1641 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1642 If INIT is void_type_node, it means do *not* call a constructor
1645 For types with constructors, the data returned is initialized
1646 by the appropriate constructor.
1648 Whether the type has a constructor or not, if it has a pointer
1649 to a virtual function table, then that pointer is set up
1652 Unless I am mistaken, a call to new () will return initialized
1653 data regardless of whether the constructor itself is private or
1654 not. NOPE; new fails if the constructor is private (jcm).
1656 Note that build_new does nothing to assure that any special
1657 alignment requirements of the type are met. Rather, it leaves
1658 it up to malloc to do the right thing. Otherwise, folding to
1659 the right alignment cal cause problems if the user tries to later
1660 free the memory returned by `new'.
1662 PLACEMENT is the `placement' list for user-defined operator new (). */
1665 build_new (tree placement, tree type, tree nelts, tree init,
1670 if (type == error_mark_node)
1671 return error_mark_node;
1673 if (processing_template_decl)
1675 rval = build_min (NEW_EXPR, build_pointer_type (type),
1676 placement, type, nelts, init);
1677 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1678 TREE_SIDE_EFFECTS (rval) = 1;
1682 /* ``A reference cannot be created by the new operator. A reference
1683 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1684 returned by new.'' ARM 5.3.3 */
1685 if (TREE_CODE (type) == REFERENCE_TYPE)
1687 error ("new cannot be applied to a reference type");
1688 type = TREE_TYPE (type);
1691 if (TREE_CODE (type) == FUNCTION_TYPE)
1693 error ("new cannot be applied to a function type");
1694 return error_mark_node;
1697 rval = build (NEW_EXPR, build_pointer_type (type), placement, type,
1699 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1700 TREE_SIDE_EFFECTS (rval) = 1;
1701 rval = build_new_1 (rval);
1702 if (rval == error_mark_node)
1703 return error_mark_node;
1705 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1706 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1707 TREE_NO_WARNING (rval) = 1;
1712 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1715 build_java_class_ref (tree type)
1717 tree name = NULL_TREE, class_decl;
1718 static tree CL_suffix = NULL_TREE;
1719 if (CL_suffix == NULL_TREE)
1720 CL_suffix = get_identifier("class$");
1721 if (jclass_node == NULL_TREE)
1723 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1724 if (jclass_node == NULL_TREE)
1725 fatal_error ("call to Java constructor, while `jclass' undefined");
1727 jclass_node = TREE_TYPE (jclass_node);
1730 /* Mangle the class$ field. */
1733 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1734 if (DECL_NAME (field) == CL_suffix)
1736 mangle_decl (field);
1737 name = DECL_ASSEMBLER_NAME (field);
1741 internal_error ("can't find class$");
1744 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1745 if (class_decl == NULL_TREE)
1747 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1748 TREE_STATIC (class_decl) = 1;
1749 DECL_EXTERNAL (class_decl) = 1;
1750 TREE_PUBLIC (class_decl) = 1;
1751 DECL_ARTIFICIAL (class_decl) = 1;
1752 DECL_IGNORED_P (class_decl) = 1;
1753 pushdecl_top_level (class_decl);
1754 make_decl_rtl (class_decl, NULL);
1760 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1761 value is immediately handed to expand_expr. */
1764 build_new_1 (tree exp)
1766 tree placement, init;
1767 tree true_type, size, rval;
1768 /* The type of the new-expression. (This type is always a pointer
1771 /* The type pointed to by POINTER_TYPE. */
1773 /* The type being allocated. For "new T[...]" this will be an
1776 /* A pointer type pointing to to the FULL_TYPE. */
1777 tree full_pointer_type;
1778 tree outer_nelts = NULL_TREE;
1779 tree nelts = NULL_TREE;
1780 tree alloc_call, alloc_expr;
1781 /* The address returned by the call to "operator new". This node is
1782 a VAR_DECL and is therefore reusable. */
1785 tree cookie_expr, init_expr;
1787 enum tree_code code;
1788 int nothrow, check_new;
1789 /* Nonzero if the user wrote `::new' rather than just `new'. */
1790 int globally_qualified_p;
1791 int use_java_new = 0;
1792 /* If non-NULL, the number of extra bytes to allocate at the
1793 beginning of the storage allocated for an array-new expression in
1794 order to store the number of elements. */
1795 tree cookie_size = NULL_TREE;
1796 /* True if the function we are calling is a placement allocation
1798 bool placement_allocation_fn_p;
1799 tree args = NULL_TREE;
1800 /* True if the storage must be initialized, either by a constructor
1801 or due to an explicit new-initializer. */
1802 bool is_initialized;
1803 /* The address of the thing allocated, not including any cookie. In
1804 particular, if an array cookie is in use, DATA_ADDR is the
1805 address of the first array element. This node is a VAR_DECL, and
1806 is therefore reusable. */
1808 tree init_preeval_expr = NULL_TREE;
1810 placement = TREE_OPERAND (exp, 0);
1811 type = TREE_OPERAND (exp, 1);
1812 nelts = TREE_OPERAND (exp, 2);
1813 init = TREE_OPERAND (exp, 3);
1814 globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1819 outer_nelts = nelts;
1820 /* Use an incomplete array type to avoid VLA headaches. */
1821 full_type = build_cplus_array_type (type, NULL_TREE);
1828 code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1830 /* If our base type is an array, then make sure we know how many elements
1832 while (TREE_CODE (true_type) == ARRAY_TYPE)
1834 tree this_nelts = array_type_nelts_top (true_type);
1835 nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1836 true_type = TREE_TYPE (true_type);
1839 if (!complete_type_or_else (true_type, exp))
1840 return error_mark_node;
1842 if (TREE_CODE (true_type) == VOID_TYPE)
1844 error ("invalid type `void' for new");
1845 return error_mark_node;
1848 if (abstract_virtuals_error (NULL_TREE, true_type))
1849 return error_mark_node;
1851 is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
1852 if (CP_TYPE_CONST_P (true_type) && !is_initialized)
1854 error ("uninitialized const in `new' of `%#T'", true_type);
1855 return error_mark_node;
1858 size = size_in_bytes (true_type);
1860 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
1862 /* Allocate the object. */
1863 if (! placement && TYPE_FOR_JAVA (true_type))
1865 tree class_addr, alloc_decl;
1866 tree class_decl = build_java_class_ref (true_type);
1867 static const char alloc_name[] = "_Jv_AllocObject";
1871 if (!get_global_value_if_present (get_identifier (alloc_name),
1874 error ("call to Java constructor with `%s' undefined", alloc_name);
1875 return error_mark_node;
1877 else if (really_overloaded_fn (alloc_decl))
1879 error ("`%D' should never be overloaded", alloc_decl);
1880 return error_mark_node;
1882 alloc_decl = OVL_CURRENT (alloc_decl);
1883 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
1884 alloc_call = (build_function_call
1886 build_tree_list (NULL_TREE, class_addr)));
1893 fnname = ansi_opname (code);
1895 if (!globally_qualified_p
1896 && CLASS_TYPE_P (true_type)
1898 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
1899 : TYPE_HAS_NEW_OPERATOR (true_type)))
1901 /* Use a class-specific operator new. */
1902 /* If a cookie is required, add some extra space. */
1903 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1905 cookie_size = targetm.cxx.get_cookie_size (true_type);
1906 size = size_binop (PLUS_EXPR, size, cookie_size);
1908 /* Create the argument list. */
1909 args = tree_cons (NULL_TREE, size, placement);
1910 /* Do name-lookup to find the appropriate operator. */
1911 fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
1912 if (TREE_CODE (fns) == TREE_LIST)
1914 error ("request for member `%D' is ambiguous", fnname);
1915 print_candidates (fns);
1916 return error_mark_node;
1918 alloc_call = build_new_method_call (build_dummy_object (true_type),
1920 /*conversion_path=*/NULL_TREE,
1925 /* Use a global operator new. */
1926 /* See if a cookie might be required. */
1927 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
1928 cookie_size = targetm.cxx.get_cookie_size (true_type);
1930 cookie_size = NULL_TREE;
1932 alloc_call = build_operator_new_call (fnname, placement,
1933 &size, &cookie_size);
1937 if (alloc_call == error_mark_node)
1938 return error_mark_node;
1940 /* In the simple case, we can stop now. */
1941 pointer_type = build_pointer_type (type);
1942 if (!cookie_size && !is_initialized)
1943 return build_nop (pointer_type, alloc_call);
1945 /* While we're working, use a pointer to the type we've actually
1946 allocated. Store the result of the call in a variable so that we
1947 can use it more than once. */
1948 full_pointer_type = build_pointer_type (full_type);
1949 alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
1950 alloc_node = TARGET_EXPR_SLOT (alloc_expr);
1952 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1953 while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
1954 alloc_call = TREE_OPERAND (alloc_call, 1);
1955 alloc_fn = get_callee_fndecl (alloc_call);
1956 my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
1958 /* Now, check to see if this function is actually a placement
1959 allocation function. This can happen even when PLACEMENT is NULL
1960 because we might have something like:
1962 struct S { void* operator new (size_t, int i = 0); };
1964 A call to `new S' will get this allocation function, even though
1965 there is no explicit placement argument. If there is more than
1966 one argument, or there are variable arguments, then this is a
1967 placement allocation function. */
1968 placement_allocation_fn_p
1969 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
1970 || varargs_function_p (alloc_fn));
1972 /* Preevaluate the placement args so that we don't reevaluate them for a
1973 placement delete. */
1974 if (placement_allocation_fn_p)
1977 stabilize_call (alloc_call, &inits);
1979 alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
1983 /* unless an allocation function is declared with an empty excep-
1984 tion-specification (_except.spec_), throw(), it indicates failure to
1985 allocate storage by throwing a bad_alloc exception (clause _except_,
1986 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1987 cation function is declared with an empty exception-specification,
1988 throw(), it returns null to indicate failure to allocate storage and a
1989 non-null pointer otherwise.
1991 So check for a null exception spec on the op new we just called. */
1993 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
1994 check_new = (flag_check_new || nothrow) && ! use_java_new;
2001 /* Adjust so we're pointing to the start of the object. */
2002 data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2003 alloc_node, cookie_size));
2005 /* Store the number of bytes allocated so that we can know how
2006 many elements to destroy later. We use the last sizeof
2007 (size_t) bytes to store the number of elements. */
2008 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2009 data_addr, size_in_bytes (sizetype));
2010 cookie = build_indirect_ref (cookie_ptr, NULL);
2012 cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2014 if (targetm.cxx.cookie_has_size ())
2016 /* Also store the element size. */
2017 cookie_ptr = build (MINUS_EXPR, build_pointer_type (sizetype),
2018 cookie_ptr, size_in_bytes (sizetype));
2019 cookie = build_indirect_ref (cookie_ptr, NULL);
2020 cookie = build (MODIFY_EXPR, sizetype, cookie,
2021 size_in_bytes(true_type));
2022 cookie_expr = build (COMPOUND_EXPR, TREE_TYPE (cookie_expr),
2023 cookie, cookie_expr);
2025 data_addr = TARGET_EXPR_SLOT (data_addr);
2029 cookie_expr = NULL_TREE;
2030 data_addr = alloc_node;
2033 /* Now initialize the allocated object. Note that we preevaluate the
2034 initialization expression, apart from the actual constructor call or
2035 assignment--we do this because we want to delay the allocation as long
2036 as possible in order to minimize the size of the exception region for
2037 placement delete. */
2042 init_expr = build_indirect_ref (data_addr, NULL);
2044 if (init == void_zero_node)
2045 init = build_default_init (full_type, nelts);
2046 else if (init && has_array)
2047 pedwarn ("ISO C++ forbids initialization in array new");
2052 = build_vec_init (init_expr,
2053 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2055 init, /*from_array=*/0);
2057 /* An array initialization is stable because the initialization
2058 of each element is a full-expression, so the temporaries don't
2062 else if (TYPE_NEEDS_CONSTRUCTING (type))
2064 init_expr = build_special_member_call (init_expr,
2065 complete_ctor_identifier,
2066 init, TYPE_BINFO (true_type),
2068 stable = stabilize_init (init_expr, &init_preeval_expr);
2072 /* We are processing something like `new int (10)', which
2073 means allocate an int, and initialize it with 10. */
2075 if (TREE_CODE (init) == TREE_LIST)
2076 init = build_x_compound_expr_from_list (init, "new initializer");
2078 else if (TREE_CODE (init) == CONSTRUCTOR
2079 && TREE_TYPE (init) == NULL_TREE)
2082 init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2083 stable = stabilize_init (init_expr, &init_preeval_expr);
2086 if (init_expr == error_mark_node)
2087 return error_mark_node;
2089 /* If any part of the object initialization terminates by throwing an
2090 exception and a suitable deallocation function can be found, the
2091 deallocation function is called to free the memory in which the
2092 object was being constructed, after which the exception continues
2093 to propagate in the context of the new-expression. If no
2094 unambiguous matching deallocation function can be found,
2095 propagating the exception does not cause the object's memory to be
2097 if (flag_exceptions && ! use_java_new)
2099 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2102 /* The Standard is unclear here, but the right thing to do
2103 is to use the same method for finding deallocation
2104 functions that we use for finding allocation functions. */
2105 cleanup = build_op_delete_call (dcode, alloc_node, size,
2106 globally_qualified_p,
2107 (placement_allocation_fn_p
2108 ? alloc_call : NULL_TREE));
2113 /* This is much simpler if we were able to preevaluate all of
2114 the arguments to the constructor call. */
2115 init_expr = build (TRY_CATCH_EXPR, void_type_node,
2116 init_expr, cleanup);
2118 /* Ack! First we allocate the memory. Then we set our sentry
2119 variable to true, and expand a cleanup that deletes the
2120 memory if sentry is true. Then we run the constructor, and
2121 finally clear the sentry.
2123 We need to do this because we allocate the space first, so
2124 if there are any temporaries with cleanups in the
2125 constructor args and we weren't able to preevaluate them, we
2126 need this EH region to extend until end of full-expression
2127 to preserve nesting. */
2129 tree end, sentry, begin;
2131 begin = get_target_expr (boolean_true_node);
2132 CLEANUP_EH_ONLY (begin) = 1;
2134 sentry = TARGET_EXPR_SLOT (begin);
2136 TARGET_EXPR_CLEANUP (begin)
2137 = build (COND_EXPR, void_type_node, sentry,
2138 cleanup, void_zero_node);
2140 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2141 sentry, boolean_false_node);
2144 = build (COMPOUND_EXPR, void_type_node, begin,
2145 build (COMPOUND_EXPR, void_type_node, init_expr,
2152 init_expr = NULL_TREE;
2154 /* Now build up the return value in reverse order. */
2159 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2161 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2163 if (rval == alloc_node)
2164 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2165 and return the call (which doesn't need to be adjusted). */
2166 rval = TARGET_EXPR_INITIAL (alloc_expr);
2171 tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2173 rval = build_conditional_expr (ifexp, rval, alloc_node);
2176 /* Perform the allocation before anything else, so that ALLOC_NODE
2177 has been initialized before we start using it. */
2178 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2181 if (init_preeval_expr)
2182 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2184 /* Convert to the final type. */
2185 rval = build_nop (pointer_type, rval);
2187 /* A new-expression is never an lvalue. */
2188 if (real_lvalue_p (rval))
2189 rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2195 build_vec_delete_1 (tree base, tree maxindex, tree type,
2196 special_function_kind auto_delete_vec, int use_global_delete)
2199 tree ptype = build_pointer_type (type = complete_type (type));
2200 tree size_exp = size_in_bytes (type);
2202 /* Temporary variables used by the loop. */
2203 tree tbase, tbase_init;
2205 /* This is the body of the loop that implements the deletion of a
2206 single element, and moves temp variables to next elements. */
2209 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2212 /* This is the thing that governs what to do after the loop has run. */
2213 tree deallocate_expr = 0;
2215 /* This is the BIND_EXPR which holds the outermost iterator of the
2216 loop. It is convenient to set this variable up and test it before
2217 executing any other code in the loop.
2218 This is also the containing expression returned by this function. */
2219 tree controller = NULL_TREE;
2221 /* We should only have 1-D arrays here. */
2222 if (TREE_CODE (type) == ARRAY_TYPE)
2225 if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2228 /* The below is short by the cookie size. */
2229 virtual_size = size_binop (MULT_EXPR, size_exp,
2230 convert (sizetype, maxindex));
2232 tbase = create_temporary_var (ptype);
2233 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2234 fold (build (PLUS_EXPR, ptype,
2237 DECL_REGISTER (tbase) = 1;
2238 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2239 TREE_SIDE_EFFECTS (controller) = 1;
2241 body = build (EXIT_EXPR, void_type_node,
2242 build (EQ_EXPR, boolean_type_node, base, tbase));
2243 body = build_compound_expr
2244 (body, build_modify_expr (tbase, NOP_EXPR,
2245 build (MINUS_EXPR, ptype, tbase, size_exp)));
2246 body = build_compound_expr
2247 (body, build_delete (ptype, tbase, sfk_complete_destructor,
2248 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2250 loop = build (LOOP_EXPR, void_type_node, body);
2251 loop = build_compound_expr (tbase_init, loop);
2254 /* If the delete flag is one, or anything else with the low bit set,
2255 delete the storage. */
2256 if (auto_delete_vec != sfk_base_destructor)
2260 /* The below is short by the cookie size. */
2261 virtual_size = size_binop (MULT_EXPR, size_exp,
2262 convert (sizetype, maxindex));
2264 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2271 cookie_size = targetm.cxx.get_cookie_size (type);
2273 = cp_convert (ptype,
2274 cp_build_binary_op (MINUS_EXPR,
2275 cp_convert (string_type_node,
2278 /* True size with header. */
2279 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2282 if (auto_delete_vec == sfk_deleting_destructor)
2283 deallocate_expr = build_x_delete (base_tbd,
2284 2 | use_global_delete,
2289 if (!deallocate_expr)
2292 body = deallocate_expr;
2294 body = build_compound_expr (body, deallocate_expr);
2297 body = integer_zero_node;
2299 /* Outermost wrapper: If pointer is null, punt. */
2300 body = fold (build (COND_EXPR, void_type_node,
2301 fold (build (NE_EXPR, boolean_type_node, base,
2302 convert (TREE_TYPE (base),
2303 integer_zero_node))),
2304 body, integer_zero_node));
2305 body = build1 (NOP_EXPR, void_type_node, body);
2309 TREE_OPERAND (controller, 1) = body;
2313 if (TREE_CODE (base) == SAVE_EXPR)
2314 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2315 body = build (COMPOUND_EXPR, void_type_node, base, body);
2317 return convert_to_void (body, /*implicit=*/NULL);
2320 /* Create an unnamed variable of the indicated TYPE. */
2323 create_temporary_var (tree type)
2327 decl = build_decl (VAR_DECL, NULL_TREE, type);
2328 TREE_USED (decl) = 1;
2329 DECL_ARTIFICIAL (decl) = 1;
2330 DECL_SOURCE_LOCATION (decl) = input_location;
2331 DECL_IGNORED_P (decl) = 1;
2332 DECL_CONTEXT (decl) = current_function_decl;
2337 /* Create a new temporary variable of the indicated TYPE, initialized
2340 It is not entered into current_binding_level, because that breaks
2341 things when it comes time to do final cleanups (which take place
2342 "outside" the binding contour of the function). */
2345 get_temp_regvar (tree type, tree init)
2349 decl = create_temporary_var (type);
2350 add_decl_expr (decl);
2352 finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2357 /* `build_vec_init' returns tree structure that performs
2358 initialization of a vector of aggregate types.
2360 BASE is a reference to the vector, of ARRAY_TYPE.
2361 MAXINDEX is the maximum index of the array (one less than the
2362 number of elements). It is only used if
2363 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2364 INIT is the (possibly NULL) initializer.
2366 FROM_ARRAY is 0 if we should init everything with INIT
2367 (i.e., every element initialized from INIT).
2368 FROM_ARRAY is 1 if we should index into INIT in parallel
2369 with initialization of DECL.
2370 FROM_ARRAY is 2 if we should index into INIT in parallel,
2371 but use assignment instead of initialization. */
2374 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2377 tree base2 = NULL_TREE;
2379 tree itype = NULL_TREE;
2381 /* The type of the array. */
2382 tree atype = TREE_TYPE (base);
2383 /* The type of an element in the array. */
2384 tree type = TREE_TYPE (atype);
2385 /* The type of a pointer to an element in the array. */
2390 tree try_block = NULL_TREE;
2391 int num_initialized_elts = 0;
2394 if (TYPE_DOMAIN (atype))
2395 maxindex = array_type_nelts (atype);
2397 if (maxindex == NULL_TREE || maxindex == error_mark_node)
2398 return error_mark_node;
2402 ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2403 : !TYPE_NEEDS_CONSTRUCTING (type))
2404 && ((TREE_CODE (init) == CONSTRUCTOR
2405 /* Don't do this if the CONSTRUCTOR might contain something
2406 that might throw and require us to clean up. */
2407 && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2408 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2411 /* Do non-default initialization of POD arrays resulting from
2412 brace-enclosed initializers. In this case, digest_init and
2413 store_constructor will handle the semantics for us. */
2415 stmt_expr = build (INIT_EXPR, atype, base, init);
2419 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2420 ptype = build_pointer_type (type);
2421 size = size_in_bytes (type);
2422 if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2423 base = cp_convert (ptype, decay_conversion (base));
2425 /* The code we are generating looks like:
2429 ptrdiff_t iterator = maxindex;
2431 for (; iterator != -1; --iterator) {
2432 ... initialize *t1 ...
2436 ... destroy elements that were constructed ...
2441 We can omit the try and catch blocks if we know that the
2442 initialization will never throw an exception, or if the array
2443 elements do not have destructors. We can omit the loop completely if
2444 the elements of the array do not have constructors.
2446 We actually wrap the entire body of the above in a STMT_EXPR, for
2449 When copying from array to another, when the array elements have
2450 only trivial copy constructors, we should use __builtin_memcpy
2451 rather than generating a loop. That way, we could take advantage
2452 of whatever cleverness the back-end has for dealing with copies
2453 of blocks of memory. */
2455 is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2456 destroy_temps = stmts_are_full_exprs_p ();
2457 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2458 rval = get_temp_regvar (ptype, base);
2459 base = get_temp_regvar (ptype, rval);
2460 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2462 /* Protect the entire array initialization so that we can destroy
2463 the partially constructed array if an exception is thrown.
2464 But don't do this if we're assigning. */
2465 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2468 try_block = begin_try_block ();
2471 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2473 /* Do non-default initialization of non-POD arrays resulting from
2474 brace-enclosed initializers. */
2479 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2481 tree elt = TREE_VALUE (elts);
2482 tree baseref = build1 (INDIRECT_REF, type, base);
2484 num_initialized_elts++;
2486 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2487 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2488 finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2490 finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2492 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2494 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2495 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2498 /* Clear out INIT so that we don't get confused below. */
2501 else if (from_array)
2503 /* If initializing one array from another, initialize element by
2504 element. We rely upon the below calls the do argument
2508 base2 = decay_conversion (init);
2509 itype = TREE_TYPE (base2);
2510 base2 = get_temp_regvar (itype, base2);
2511 itype = TREE_TYPE (itype);
2513 else if (TYPE_LANG_SPECIFIC (type)
2514 && TYPE_NEEDS_CONSTRUCTING (type)
2515 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2517 error ("initializer ends prematurely");
2518 return error_mark_node;
2522 /* Now, default-initialize any remaining elements. We don't need to
2523 do that if a) the type does not need constructing, or b) we've
2524 already initialized all the elements.
2526 We do need to keep going if we're copying an array. */
2529 || (TYPE_NEEDS_CONSTRUCTING (type)
2530 && ! (host_integerp (maxindex, 0)
2531 && (num_initialized_elts
2532 == tree_low_cst (maxindex, 0) + 1))))
2534 /* If the ITERATOR is equal to -1, then we don't have to loop;
2535 we've already initialized all the elements. */
2539 for_stmt = begin_for_stmt ();
2540 finish_for_init_stmt (for_stmt);
2541 finish_for_cond (build (NE_EXPR, boolean_type_node,
2542 iterator, integer_minus_one_node),
2544 finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2549 tree to = build1 (INDIRECT_REF, type, base);
2553 from = build1 (INDIRECT_REF, itype, base2);
2557 if (from_array == 2)
2558 elt_init = build_modify_expr (to, NOP_EXPR, from);
2559 else if (TYPE_NEEDS_CONSTRUCTING (type))
2560 elt_init = build_aggr_init (to, from, 0);
2562 elt_init = build_modify_expr (to, NOP_EXPR, from);
2566 else if (TREE_CODE (type) == ARRAY_TYPE)
2570 ("cannot initialize multi-dimensional array with initializer");
2571 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2575 elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2578 current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2579 finish_expr_stmt (elt_init);
2580 current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2582 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2584 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2586 finish_for_stmt (for_stmt);
2589 /* Make sure to cleanup any partially constructed elements. */
2590 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2594 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2596 /* Flatten multi-dimensional array since build_vec_delete only
2597 expects one-dimensional array. */
2598 if (TREE_CODE (type) == ARRAY_TYPE)
2600 m = cp_build_binary_op (MULT_EXPR, m,
2601 array_type_nelts_total (type));
2602 type = strip_array_types (type);
2605 finish_cleanup_try_block (try_block);
2606 e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2607 /*use_global_delete=*/0);
2608 finish_cleanup (e, try_block);
2611 /* The value of the array initialization is the array itself, RVAL
2612 is a pointer to the first element. */
2613 finish_stmt_expr_expr (rval, stmt_expr);
2615 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2617 /* Now convert make the result have the correct type. */
2618 atype = build_pointer_type (atype);
2619 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2620 stmt_expr = build_indirect_ref (stmt_expr, NULL);
2622 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2626 /* Free up storage of type TYPE, at address ADDR.
2628 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2631 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2632 used as the second argument to operator delete. It can include
2633 things like padding and magic size cookies. It has virtual in it,
2634 because if you have a base pointer and you delete through a virtual
2635 destructor, it should be the size of the dynamic object, not the
2636 static object, see Free Store 12.5 ISO C++.
2638 This does not call any destructors. */
2641 build_x_delete (tree addr, int which_delete, tree virtual_size)
2643 int use_global_delete = which_delete & 1;
2644 int use_vec_delete = !!(which_delete & 2);
2645 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2647 return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2651 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2655 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2661 case sfk_complete_destructor:
2662 name = complete_dtor_identifier;
2665 case sfk_base_destructor:
2666 name = base_dtor_identifier;
2669 case sfk_deleting_destructor:
2670 name = deleting_dtor_identifier;
2677 exp = convert_from_reference (exp);
2678 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2679 return build_new_method_call (exp, fn,
2681 /*conversion_path=*/NULL_TREE,
2685 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2686 ADDR is an expression which yields the store to be destroyed.
2687 AUTO_DELETE is the name of the destructor to call, i.e., either
2688 sfk_complete_destructor, sfk_base_destructor, or
2689 sfk_deleting_destructor.
2691 FLAGS is the logical disjunction of zero or more LOOKUP_
2692 flags. See cp-tree.h for more info. */
2695 build_delete (tree type, tree addr, special_function_kind auto_delete,
2696 int flags, int use_global_delete)
2700 if (addr == error_mark_node)
2701 return error_mark_node;
2703 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2704 set to `error_mark_node' before it gets properly cleaned up. */
2705 if (type == error_mark_node)
2706 return error_mark_node;
2708 type = TYPE_MAIN_VARIANT (type);
2710 if (TREE_CODE (type) == POINTER_TYPE)
2712 bool complete_p = true;
2714 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2715 if (TREE_CODE (type) == ARRAY_TYPE)
2718 /* We don't want to warn about delete of void*, only other
2719 incomplete types. Deleting other incomplete types
2720 invokes undefined behavior, but it is not ill-formed, so
2721 compile to something that would even do The Right Thing
2722 (TM) should the type have a trivial dtor and no delete
2724 if (!VOID_TYPE_P (type))
2726 complete_type (type);
2727 if (!COMPLETE_TYPE_P (type))
2729 warning ("possible problem detected in invocation of "
2730 "delete operator:");
2731 cxx_incomplete_type_diagnostic (addr, type, 1);
2732 inform ("neither the destructor nor the class-specific "
2733 "operator delete will be called, even if they are "
2734 "declared when the class is defined.");
2738 if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2739 /* Call the builtin operator delete. */
2740 return build_builtin_delete_call (addr);
2741 if (TREE_SIDE_EFFECTS (addr))
2742 addr = save_expr (addr);
2744 /* Throw away const and volatile on target type of addr. */
2745 addr = convert_force (build_pointer_type (type), addr, 0);
2747 else if (TREE_CODE (type) == ARRAY_TYPE)
2751 if (TYPE_DOMAIN (type) == NULL_TREE)
2753 error ("unknown array size in delete");
2754 return error_mark_node;
2756 return build_vec_delete (addr, array_type_nelts (type),
2757 auto_delete, use_global_delete);
2761 /* Don't check PROTECT here; leave that decision to the
2762 destructor. If the destructor is accessible, call it,
2763 else report error. */
2764 addr = build_unary_op (ADDR_EXPR, addr, 0);
2765 if (TREE_SIDE_EFFECTS (addr))
2766 addr = save_expr (addr);
2768 addr = convert_force (build_pointer_type (type), addr, 0);
2771 my_friendly_assert (IS_AGGR_TYPE (type), 220);
2773 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2775 if (auto_delete != sfk_deleting_destructor)
2776 return void_zero_node;
2778 return build_op_delete_call
2779 (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2784 tree do_delete = NULL_TREE;
2787 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2789 /* For `::delete x', we must not use the deleting destructor
2790 since then we would not be sure to get the global `operator
2792 if (use_global_delete && auto_delete == sfk_deleting_destructor)
2794 /* We will use ADDR multiple times so we must save it. */
2795 addr = save_expr (addr);
2796 /* Delete the object. */
2797 do_delete = build_builtin_delete_call (addr);
2798 /* Otherwise, treat this like a complete object destructor
2800 auto_delete = sfk_complete_destructor;
2802 /* If the destructor is non-virtual, there is no deleting
2803 variant. Instead, we must explicitly call the appropriate
2804 `operator delete' here. */
2805 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2806 && auto_delete == sfk_deleting_destructor)
2808 /* We will use ADDR multiple times so we must save it. */
2809 addr = save_expr (addr);
2810 /* Build the call. */
2811 do_delete = build_op_delete_call (DELETE_EXPR,
2813 cxx_sizeof_nowarn (type),
2816 /* Call the complete object destructor. */
2817 auto_delete = sfk_complete_destructor;
2819 else if (auto_delete == sfk_deleting_destructor
2820 && TYPE_GETS_REG_DELETE (type))
2822 /* Make sure we have access to the member op delete, even though
2823 we'll actually be calling it from the destructor. */
2824 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2825 /*global_p=*/false, NULL_TREE);
2828 expr = build_dtor_call (build_indirect_ref (addr, NULL),
2829 auto_delete, flags);
2831 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2833 if (flags & LOOKUP_DESTRUCTOR)
2834 /* Explicit destructor call; don't check for null pointer. */
2835 ifexp = integer_one_node;
2837 /* Handle deleting a null pointer. */
2838 ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2840 if (ifexp != integer_one_node)
2841 expr = build (COND_EXPR, void_type_node,
2842 ifexp, expr, void_zero_node);
2848 /* At the beginning of a destructor, push cleanups that will call the
2849 destructors for our base classes and members.
2851 Called from begin_destructor_body. */
2854 push_base_cleanups (void)
2857 int i, n_baseclasses;
2861 /* Run destructors for all virtual baseclasses. */
2862 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
2864 tree cond = (condition_conversion
2865 (build (BIT_AND_EXPR, integer_type_node,
2866 current_in_charge_parm,
2867 integer_two_node)));
2869 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2870 order, which is also the right order for pushing cleanups. */
2871 for (i = 0; (binfos = VEC_iterate
2872 (tree, CLASSTYPE_VBASECLASSES (current_class_type), i));
2875 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (binfos)))
2877 expr = build_special_member_call (current_class_ref,
2878 base_dtor_identifier,
2882 | LOOKUP_NONVIRTUAL));
2883 expr = build (COND_EXPR, void_type_node, cond,
2884 expr, void_zero_node);
2885 finish_decl_cleanup (NULL_TREE, expr);
2890 binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
2891 n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
2893 /* Take care of the remaining baseclasses. */
2894 for (i = 0; i < n_baseclasses; i++)
2896 tree base_binfo = TREE_VEC_ELT (binfos, i);
2897 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
2898 || TREE_VIA_VIRTUAL (base_binfo))
2901 expr = build_special_member_call (current_class_ref,
2902 base_dtor_identifier,
2903 NULL_TREE, base_binfo,
2904 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
2905 finish_decl_cleanup (NULL_TREE, expr);
2908 for (member = TYPE_FIELDS (current_class_type); member;
2909 member = TREE_CHAIN (member))
2911 if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
2913 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
2915 tree this_member = (build_class_member_access_expr
2916 (current_class_ref, member,
2917 /*access_path=*/NULL_TREE,
2918 /*preserve_reference=*/false));
2919 tree this_type = TREE_TYPE (member);
2920 expr = build_delete (this_type, this_member,
2921 sfk_complete_destructor,
2922 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
2924 finish_decl_cleanup (NULL_TREE, expr);
2929 /* For type TYPE, delete the virtual baseclass objects of DECL. */
2932 build_vbase_delete (tree type, tree decl)
2937 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
2939 my_friendly_assert (addr != error_mark_node, 222);
2941 result = convert_to_void (integer_zero_node, NULL);
2942 for (ix = 0; (binfo = VEC_iterate
2943 (tree, CLASSTYPE_VBASECLASSES (type), ix)); ix++)
2945 tree base_addr = convert_force
2946 (build_pointer_type (BINFO_TYPE (binfo)), addr, 0);
2947 tree base_delete = build_delete
2948 (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
2949 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
2951 result = build_compound_expr (result, base_delete);
2956 /* Build a C++ vector delete expression.
2957 MAXINDEX is the number of elements to be deleted.
2958 ELT_SIZE is the nominal size of each element in the vector.
2959 BASE is the expression that should yield the store to be deleted.
2960 This function expands (or synthesizes) these calls itself.
2961 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2963 This also calls delete for virtual baseclasses of elements of the vector.
2965 Update: MAXINDEX is no longer needed. The size can be extracted from the
2966 start of the vector for pointers, and from the type for arrays. We still
2967 use MAXINDEX for arrays because it happens to already have one of the
2968 values we'd have to extract. (We could use MAXINDEX with pointers to
2969 confirm the size, and trap if the numbers differ; not clear that it'd
2970 be worth bothering.) */
2973 build_vec_delete (tree base, tree maxindex,
2974 special_function_kind auto_delete_vec, int use_global_delete)
2978 tree base_init = NULL_TREE;
2980 type = TREE_TYPE (base);
2982 if (TREE_CODE (type) == POINTER_TYPE)
2984 /* Step back one from start of vector, and read dimension. */
2987 if (TREE_SIDE_EFFECTS (base))
2989 base_init = get_target_expr (base);
2990 base = TARGET_EXPR_SLOT (base_init);
2992 type = strip_array_types (TREE_TYPE (type));
2993 cookie_addr = build (MINUS_EXPR,
2994 build_pointer_type (sizetype),
2996 TYPE_SIZE_UNIT (sizetype));
2997 maxindex = build_indirect_ref (cookie_addr, NULL);
2999 else if (TREE_CODE (type) == ARRAY_TYPE)
3001 /* Get the total number of things in the array, maxindex is a
3003 maxindex = array_type_nelts_total (type);
3004 type = strip_array_types (type);
3005 base = build_unary_op (ADDR_EXPR, base, 1);
3006 if (TREE_SIDE_EFFECTS (base))
3008 base_init = get_target_expr (base);
3009 base = TARGET_EXPR_SLOT (base_init);
3014 if (base != error_mark_node)
3015 error ("type to vector delete is neither pointer or array type");
3016 return error_mark_node;
3019 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3022 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);