1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC 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 GNU CC 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 GNU CC; 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. */
37 static void construct_virtual_base (tree
, tree
);
38 static void expand_aggr_init_1
PARAMS ((tree
, tree
, tree
, tree
, int));
39 static void expand_default_init
PARAMS ((tree
, tree
, tree
, tree
, int));
40 static tree build_vec_delete_1
PARAMS ((tree
, tree
, tree
, special_function_kind
, int));
41 static void perform_member_init (tree
, tree
);
42 static tree build_builtin_delete_call
PARAMS ((tree
));
43 static int member_init_ok_or_else
PARAMS ((tree
, tree
, tree
));
44 static void expand_virtual_init
PARAMS ((tree
, tree
));
45 static tree
sort_mem_initializers (tree
, tree
);
46 static tree initializing_context
PARAMS ((tree
));
47 static void expand_cleanup_for_base
PARAMS ((tree
, tree
));
48 static tree get_temp_regvar
PARAMS ((tree
, tree
));
49 static tree dfs_initialize_vtbl_ptrs
PARAMS ((tree
, void *));
50 static tree build_default_init
PARAMS ((tree
));
51 static tree build_new_1
PARAMS ((tree
));
52 static tree get_cookie_size
PARAMS ((tree
));
53 static tree build_dtor_call
PARAMS ((tree
, special_function_kind
, int));
54 static tree build_field_list
PARAMS ((tree
, tree
, int *));
55 static tree build_vtbl_address
PARAMS ((tree
));
57 /* We are about to generate some complex initialization code.
58 Conceptually, it is all a single expression. However, we may want
59 to include conditionals, loops, and other such statement-level
60 constructs. Therefore, we build the initialization code inside a
61 statement-expression. This function starts such an expression.
62 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
63 pass them back to finish_init_stmts when the expression is
67 begin_init_stmts (stmt_expr_p
, compound_stmt_p
)
69 tree
*compound_stmt_p
;
71 if (building_stmt_tree ())
72 *stmt_expr_p
= begin_stmt_expr ();
74 *stmt_expr_p
= begin_global_stmt_expr ();
76 if (building_stmt_tree ())
77 *compound_stmt_p
= begin_compound_stmt (/*has_no_scope=*/1);
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 (stmt_expr
, compound_stmt
)
89 if (building_stmt_tree ())
90 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt
);
92 if (building_stmt_tree ())
94 stmt_expr
= finish_stmt_expr (stmt_expr
);
95 STMT_EXPR_NO_SCOPE (stmt_expr
) = true;
98 stmt_expr
= finish_global_stmt_expr (stmt_expr
);
100 /* To avoid spurious warnings about unused values, we set
103 TREE_USED (stmt_expr
) = 1;
110 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
111 which we want to initialize the vtable pointer for, DATA is
112 TREE_LIST whose TREE_VALUE is the this ptr expression. */
115 dfs_initialize_vtbl_ptrs (binfo
, data
)
119 if ((!BINFO_PRIMARY_P (binfo
) || TREE_VIA_VIRTUAL (binfo
))
120 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo
)))
122 tree base_ptr
= TREE_VALUE ((tree
) data
);
124 base_ptr
= build_base_path (PLUS_EXPR
, base_ptr
, binfo
, /*nonnull=*/1);
126 expand_virtual_init (binfo
, base_ptr
);
129 SET_BINFO_MARKED (binfo
);
134 /* Initialize all the vtable pointers in the object pointed to by
138 initialize_vtbl_ptrs (addr
)
144 type
= TREE_TYPE (TREE_TYPE (addr
));
145 list
= build_tree_list (type
, addr
);
147 /* Walk through the hierarchy, initializing the vptr in each base
148 class. We do these in pre-order because can't find the virtual
149 bases for a class until we've initialized the vtbl for that
151 dfs_walk_real (TYPE_BINFO (type
), dfs_initialize_vtbl_ptrs
,
152 NULL
, dfs_unmarked_real_bases_queue_p
, list
);
153 dfs_walk (TYPE_BINFO (type
), dfs_unmark
,
154 dfs_marked_real_bases_queue_p
, type
);
157 /* Return an expression for the zero-initialization of an object with
158 type T. This expression will either be a constant (in the case
159 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
160 aggregate). In either case, the value can be used as DECL_INITIAL
161 for a decl of the indicated TYPE; it is a valid static initializer.
162 If STATIC_STORAGE_P is TRUE, initializers are only generated for
163 entities for which zero-initialization does not simply mean filling
164 the storage with zero bytes. */
167 build_zero_init (tree type
, bool static_storage_p
)
169 tree init
= NULL_TREE
;
173 To zero-initialization storage for an object of type T means:
175 -- if T is a scalar type, the storage is set to the value of zero
178 -- if T is a non-union class type, the storage for each nonstatic
179 data member and each base-class subobject is zero-initialized.
181 -- if T is a union type, the storage for its first data member is
184 -- if T is an array type, the storage for each element is
187 -- if T is a reference type, no initialization is performed. */
189 if (type
== error_mark_node
)
191 else if (static_storage_p
&& zero_init_p (type
))
192 /* In order to save space, we do not explicitly build initializers
193 for items that do not need them. GCC's semantics are that
194 items with static storage duration that are not otherwise
195 initialized are initialized to zero. */
197 else if (SCALAR_TYPE_P (type
))
198 init
= convert (type
, integer_zero_node
);
199 else if (CLASS_TYPE_P (type
))
204 /* Build a constructor to contain the initializations. */
205 init
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
206 /* Iterate over the fields, building initializations. */
208 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
210 if (TREE_CODE (field
) != FIELD_DECL
)
213 /* Note that for class types there will be FIELD_DECLs
214 corresponding to base classes as well. Thus, iterating
215 over TYPE_FIELDs will result in correct initialization of
216 all of the subobjects. */
217 if (static_storage_p
&& !zero_init_p (TREE_TYPE (field
)))
218 inits
= tree_cons (field
,
219 build_zero_init (TREE_TYPE (field
),
223 /* For unions, only the first field is initialized. */
224 if (TREE_CODE (type
) == UNION_TYPE
)
227 CONSTRUCTOR_ELTS (init
) = nreverse (inits
);
229 else if (TREE_CODE (type
) == ARRAY_TYPE
)
235 /* Build a constructor to contain the initializations. */
236 init
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
237 /* Iterate over the array elements, building initializations. */
239 for (index
= size_zero_node
, max_index
= array_type_nelts (type
);
240 !tree_int_cst_lt (max_index
, index
);
241 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
242 inits
= tree_cons (index
,
243 build_zero_init (TREE_TYPE (type
),
246 CONSTRUCTOR_ELTS (init
) = nreverse (inits
);
248 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
253 /* In all cases, the initializer is a constant. */
255 TREE_CONSTANT (init
) = 1;
260 /* Build an expression for the default-initialization of an object
261 with type T. If initialization T requires calling constructors,
262 this function returns NULL_TREE; the caller is responsible for
263 arranging for the constructors to be called. */
266 build_default_init (type
)
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
))
299 /* At this point, TYPE is either a POD class type, an array of POD
300 classes, or something even more inoccuous. */
301 return build_zero_init (type
, /*static_storage_p=*/false);
304 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
305 arguments. If TREE_LIST is void_type_node, an empty initializer
306 list was given; if NULL_TREE no initializer was given. */
309 perform_member_init (tree member
, tree init
)
312 tree type
= TREE_TYPE (member
);
315 explicit = (init
!= NULL_TREE
);
317 /* Effective C++ rule 12 requires that all data members be
319 if (warn_ecpp
&& !explicit && TREE_CODE (type
) != ARRAY_TYPE
)
320 warning ("`%D' should be initialized in the member initialization "
324 if (init
== void_type_node
)
327 /* Get an lvalue for the data member. */
328 decl
= build_class_member_access_expr (current_class_ref
, member
,
329 /*access_path=*/NULL_TREE
,
330 /*preserve_reference=*/true);
331 if (decl
== error_mark_node
)
334 /* Deal with this here, as we will get confused if we try to call the
335 assignment op for an anonymous union. This can happen in a
336 synthesized copy constructor. */
337 if (ANON_AGGR_TYPE_P (type
))
341 init
= build (INIT_EXPR
, type
, decl
, TREE_VALUE (init
));
342 finish_expr_stmt (init
);
345 else if (TYPE_NEEDS_CONSTRUCTING (type
)
346 || (init
&& TYPE_HAS_CONSTRUCTOR (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
, TREE_VALUE (init
), 1));
358 finish_expr_stmt (build_aggr_init (decl
, init
, 0));
362 if (init
== NULL_TREE
)
366 init
= build_default_init (type
);
367 if (TREE_CODE (type
) == REFERENCE_TYPE
)
369 ("default-initialization of `%#D', which has reference type",
372 /* member traversal: note it leaves init NULL */
373 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
374 pedwarn ("uninitialized reference member `%D'", member
);
376 else if (TREE_CODE (init
) == TREE_LIST
)
378 /* There was an explicit member initialization. Do some
379 work in that case. */
380 if (TREE_CHAIN (init
))
382 warning ("initializer list treated as compound expression");
383 init
= build_compound_expr (init
);
386 init
= TREE_VALUE (init
);
390 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
393 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
397 expr
= build_class_member_access_expr (current_class_ref
, member
,
398 /*access_path=*/NULL_TREE
,
399 /*preserve_reference=*/false);
400 expr
= build_delete (type
, expr
, sfk_complete_destructor
,
401 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
403 if (expr
!= error_mark_node
)
404 finish_eh_cleanup (expr
);
408 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
409 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
412 build_field_list (t
, list
, uses_unions_p
)
421 /* Note whether or not T is a union. */
422 if (TREE_CODE (t
) == UNION_TYPE
)
425 for (fields
= TYPE_FIELDS (t
); fields
; fields
= TREE_CHAIN (fields
))
427 /* Skip CONST_DECLs for enumeration constants and so forth. */
428 if (TREE_CODE (fields
) != FIELD_DECL
|| DECL_ARTIFICIAL (fields
))
431 /* Keep track of whether or not any fields are unions. */
432 if (TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
435 /* For an anonymous struct or union, we must recursively
436 consider the fields of the anonymous type. They can be
437 directly initialized from the constructor. */
438 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
440 /* Add this field itself. Synthesized copy constructors
441 initialize the entire aggregate. */
442 list
= tree_cons (fields
, NULL_TREE
, list
);
443 /* And now add the fields in the anonymous aggregate. */
444 list
= build_field_list (TREE_TYPE (fields
), list
,
447 /* Add this field. */
448 else if (DECL_NAME (fields
))
449 list
= tree_cons (fields
, NULL_TREE
, list
);
455 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
456 a FIELD_DECL or BINFO in T that needs initialization. The
457 TREE_VALUE gives the initializer, or list of initializer arguments.
459 Return a TREE_LIST containing all of the initializations required
460 for T, in the order in which they should be performed. The output
461 list has the same format as the input. */
464 sort_mem_initializers (tree t
, tree mem_inits
)
473 /* Build up a list of initializations. The TREE_PURPOSE of entry
474 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
475 TREE_VALUE will be the constructor arguments, or NULL if no
476 explicit initialization was provided. */
477 sorted_inits
= NULL_TREE
;
478 /* Process the virtual bases. */
479 for (base
= CLASSTYPE_VBASECLASSES (t
); base
; base
= TREE_CHAIN (base
))
480 sorted_inits
= tree_cons (TREE_VALUE (base
), NULL_TREE
, sorted_inits
);
481 /* Process the direct bases. */
482 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (t
); ++i
)
484 base
= BINFO_BASETYPE (TYPE_BINFO (t
), i
);
485 if (!TREE_VIA_VIRTUAL (base
))
486 sorted_inits
= tree_cons (base
, NULL_TREE
, sorted_inits
);
488 /* Process the non-static data members. */
489 sorted_inits
= build_field_list (t
, sorted_inits
, &uses_unions_p
);
490 /* Reverse the entire list of initializations, so that they are in
491 the order that they will actually be performed. */
492 sorted_inits
= nreverse (sorted_inits
);
494 /* If the user presented the initializers in an order different from
495 that in which they will actually occur, we issue a warning. Keep
496 track of the next subobject which can be explicitly initialized
497 without issuing a warning. */
498 next_subobject
= sorted_inits
;
500 /* Go through the explicit initializers, filling in TREE_PURPOSE in
502 for (init
= mem_inits
; init
; init
= TREE_CHAIN (init
))
507 subobject
= TREE_PURPOSE (init
);
509 /* If the explicit initializers are in sorted order, then
510 SUBOBJECT will be NEXT_SUBOBJECT, or something following
512 for (subobject_init
= next_subobject
;
514 subobject_init
= TREE_CHAIN (subobject_init
))
515 if (TREE_PURPOSE (subobject_init
) == subobject
)
518 /* Issue a warning if the explicit initializer order does not
519 match that which will actually occur. */
520 if (warn_reorder
&& !subobject_init
)
522 if (TREE_CODE (TREE_PURPOSE (next_subobject
)) == FIELD_DECL
)
523 cp_warning_at ("`%D' will be initialized after",
524 TREE_PURPOSE (next_subobject
));
526 warning ("base `%T' will be initialized after",
527 TREE_PURPOSE (next_subobject
));
528 if (TREE_CODE (subobject
) == FIELD_DECL
)
529 cp_warning_at (" `%#D'", subobject
);
531 warning (" base `%T'", subobject
);
534 /* Look again, from the beginning of the list. */
537 subobject_init
= sorted_inits
;
538 while (TREE_PURPOSE (subobject_init
) != subobject
)
539 subobject_init
= TREE_CHAIN (subobject_init
);
542 /* It is invalid to initialize the same subobject more than
544 if (TREE_VALUE (subobject_init
))
546 if (TREE_CODE (subobject
) == FIELD_DECL
)
547 error ("multiple initializations given for `%D'", subobject
);
549 error ("multiple initializations given for base `%T'",
553 /* Record the initialization. */
554 TREE_VALUE (subobject_init
) = TREE_VALUE (init
);
555 next_subobject
= subobject_init
;
560 If a ctor-initializer specifies more than one mem-initializer for
561 multiple members of the same union (including members of
562 anonymous unions), the ctor-initializer is ill-formed. */
565 tree last_field
= NULL_TREE
;
566 for (init
= sorted_inits
; init
; init
= TREE_CHAIN (init
))
572 /* Skip uninitialized members and base classes. */
573 if (!TREE_VALUE (init
)
574 || TREE_CODE (TREE_PURPOSE (init
)) != FIELD_DECL
)
576 /* See if this field is a member of a union, or a member of a
577 structure contained in a union, etc. */
578 field
= TREE_PURPOSE (init
);
579 for (field_type
= DECL_CONTEXT (field
);
580 !same_type_p (field_type
, t
);
581 field_type
= TYPE_CONTEXT (field_type
))
582 if (TREE_CODE (field_type
) == UNION_TYPE
)
584 /* If this field is not a member of a union, skip it. */
585 if (TREE_CODE (field_type
) != UNION_TYPE
)
588 /* It's only an error if we have two initializers for the same
596 /* See if LAST_FIELD and the field initialized by INIT are
597 members of the same union. If so, there's a problem,
598 unless they're actually members of the same structure
599 which is itself a member of a union. For example, given:
601 union { struct { int i; int j; }; };
603 initializing both `i' and `j' makes sense. */
604 field_type
= DECL_CONTEXT (field
);
608 tree last_field_type
;
610 last_field_type
= DECL_CONTEXT (last_field
);
613 if (same_type_p (last_field_type
, field_type
))
615 if (TREE_CODE (field_type
) == UNION_TYPE
)
616 error ("initializations for multiple members of `%T'",
622 if (same_type_p (last_field_type
, t
))
625 last_field_type
= TYPE_CONTEXT (last_field_type
);
628 /* If we've reached the outermost class, then we're
630 if (same_type_p (field_type
, t
))
633 field_type
= TYPE_CONTEXT (field_type
);
644 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
645 is a TREE_LIST giving the explicit mem-initializer-list for the
646 constructor. The TREE_PURPOSE of each entry is a subobject (a
647 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
648 is a TREE_LIST giving the arguments to the constructor or
649 void_type_node for an empty list of arguments. */
652 emit_mem_initializers (tree mem_inits
)
654 /* Sort the mem-initializers into the order in which the
655 initializations should be performed. */
656 mem_inits
= sort_mem_initializers (current_class_type
, mem_inits
);
658 /* Initialize base classes. */
660 && TREE_CODE (TREE_PURPOSE (mem_inits
)) != FIELD_DECL
)
662 tree subobject
= TREE_PURPOSE (mem_inits
);
663 tree arguments
= TREE_VALUE (mem_inits
);
665 /* If these initializations are taking place in a copy
666 constructor, the base class should probably be explicitly
668 if (extra_warnings
&& !arguments
669 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
)
670 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject
)))
671 warning ("base class `%#T' should be explicitly initialized in the "
673 BINFO_TYPE (subobject
));
675 /* If an explicit -- but empty -- initializer list was present,
676 treat it just like default initialization at this point. */
677 if (arguments
== void_type_node
)
678 arguments
= NULL_TREE
;
680 /* Initialize the base. */
681 if (TREE_VIA_VIRTUAL (subobject
))
682 construct_virtual_base (subobject
, arguments
);
687 base_addr
= build_base_path (PLUS_EXPR
, current_class_ptr
,
689 expand_aggr_init_1 (subobject
, NULL_TREE
,
690 build_indirect_ref (base_addr
, NULL
),
693 expand_cleanup_for_base (subobject
, NULL_TREE
);
696 mem_inits
= TREE_CHAIN (mem_inits
);
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 (binfo
)
718 tree binfo_for
= binfo
;
721 if (BINFO_VPTR_INDEX (binfo
) && TREE_VIA_VIRTUAL (binfo
)
722 && BINFO_PRIMARY_P (binfo
))
723 /* If this is a virtual primary base, then the vtable we want to store
724 is that for the base this is being used as the primary base of. We
725 can't simply skip the initialization, because we may be expanding the
726 inits of a subobject constructor where the virtual base layout
728 while (BINFO_PRIMARY_BASE_OF (binfo_for
))
729 binfo_for
= BINFO_PRIMARY_BASE_OF (binfo_for
);
731 /* Figure out what vtable BINFO's vtable is based on, and mark it as
733 vtbl
= get_vtbl_decl_for_binfo (binfo_for
);
734 assemble_external (vtbl
);
735 TREE_USED (vtbl
) = 1;
737 /* Now compute the address to use when initializing the vptr. */
738 vtbl
= BINFO_VTABLE (binfo_for
);
739 if (TREE_CODE (vtbl
) == VAR_DECL
)
741 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
742 TREE_CONSTANT (vtbl
) = 1;
748 /* This code sets up the virtual function tables appropriate for
749 the pointer DECL. It is a one-ply initialization.
751 BINFO is the exact type that DECL is supposed to be. In
752 multiple inheritance, this might mean "C's A" if C : A, B. */
755 expand_virtual_init (binfo
, decl
)
761 /* Compute the initializer for vptr. */
762 vtbl
= build_vtbl_address (binfo
);
764 /* We may get this vptr from a VTT, if this is a subobject
765 constructor or subobject destructor. */
766 vtt_index
= BINFO_VPTR_INDEX (binfo
);
772 /* Compute the value to use, when there's a VTT. */
773 vtt_parm
= current_vtt_parm
;
774 vtbl2
= build (PLUS_EXPR
,
775 TREE_TYPE (vtt_parm
),
778 vtbl2
= build1 (INDIRECT_REF
, TREE_TYPE (vtbl
), vtbl2
);
780 /* The actual initializer is the VTT value only in the subobject
781 constructor. In maybe_clone_body we'll substitute NULL for
782 the vtt_parm in the case of the non-subobject constructor. */
783 vtbl
= build (COND_EXPR
,
785 build (EQ_EXPR
, boolean_type_node
,
786 current_in_charge_parm
, integer_zero_node
),
791 /* Compute the location of the vtpr. */
792 vtbl_ptr
= build_vfield_ref (build_indirect_ref (decl
, NULL
),
794 my_friendly_assert (vtbl_ptr
!= error_mark_node
, 20010730);
796 /* Assign the vtable to the vptr. */
797 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
798 finish_expr_stmt (build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
));
801 /* If an exception is thrown in a constructor, those base classes already
802 constructed must be destroyed. This function creates the cleanup
803 for BINFO, which has just been constructed. If FLAG is non-NULL,
804 it is a DECL which is nonzero when this base needs to be
808 expand_cleanup_for_base (binfo
, flag
)
814 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
817 /* Call the destructor. */
818 expr
= build_special_member_call (current_class_ref
,
819 base_dtor_identifier
,
822 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
);
824 expr
= fold (build (COND_EXPR
, void_type_node
,
825 c_common_truthvalue_conversion (flag
),
826 expr
, integer_zero_node
));
828 finish_eh_cleanup (expr
);
831 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
835 construct_virtual_base (tree vbase
, tree arguments
)
842 /* If there are virtual base classes with destructors, we need to
843 emit cleanups to destroy them if an exception is thrown during
844 the construction process. These exception regions (i.e., the
845 period during which the cleanups must occur) begin from the time
846 the construction is complete to the end of the function. If we
847 create a conditional block in which to initialize the
848 base-classes, then the cleanup region for the virtual base begins
849 inside a block, and ends outside of that block. This situation
850 confuses the sjlj exception-handling code. Therefore, we do not
851 create a single conditional block, but one for each
852 initialization. (That way the cleanup regions always begin
853 in the outer block.) We trust the back-end to figure out
854 that the FLAG will not change across initializations, and
855 avoid doing multiple tests. */
856 flag
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
857 inner_if_stmt
= begin_if_stmt ();
858 finish_if_stmt_cond (flag
, inner_if_stmt
);
859 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/1);
861 /* Compute the location of the virtual base. If we're
862 constructing virtual bases, then we must be the most derived
863 class. Therefore, we don't have to look up the virtual base;
864 we already know where it is. */
865 exp
= build (PLUS_EXPR
,
866 TREE_TYPE (current_class_ptr
),
868 fold (build1 (NOP_EXPR
, TREE_TYPE (current_class_ptr
),
869 BINFO_OFFSET (vbase
))));
870 exp
= build1 (NOP_EXPR
,
871 build_pointer_type (BINFO_TYPE (vbase
)),
873 exp
= build1 (INDIRECT_REF
, BINFO_TYPE (vbase
), exp
);
875 expand_aggr_init_1 (vbase
, current_class_ref
, exp
,
876 arguments
, LOOKUP_COMPLAIN
);
877 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt
);
878 finish_then_clause (inner_if_stmt
);
881 expand_cleanup_for_base (vbase
, flag
);
884 /* Find the context in which this FIELD can be initialized. */
887 initializing_context (field
)
890 tree t
= DECL_CONTEXT (field
);
892 /* Anonymous union members can be initialized in the first enclosing
893 non-anonymous union context. */
894 while (t
&& ANON_AGGR_TYPE_P (t
))
895 t
= TYPE_CONTEXT (t
);
899 /* Function to give error message if member initialization specification
900 is erroneous. FIELD is the member we decided to initialize.
901 TYPE is the type for which the initialization is being performed.
902 FIELD must be a member of TYPE.
904 MEMBER_NAME is the name of the member. */
907 member_init_ok_or_else (field
, type
, member_name
)
912 if (field
== error_mark_node
)
914 if (field
== NULL_TREE
|| initializing_context (field
) != type
)
916 error ("class `%T' does not have any field named `%D'", type
,
920 if (TREE_STATIC (field
))
922 error ("field `%#D' is static; the only point of initialization is its definition",
930 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
931 is a _TYPE node or TYPE_DECL which names a base for that type.
932 INIT is a parameter list for that field's or base's constructor.
933 Check the validity of NAME, and return a TREE_LIST of the base
934 _TYPE or FIELD_DECL and the INIT. If NAME is invalid, return
935 NULL_TREE and issue a diagnostic.
937 An old style unnamed direct single base construction is permitted,
938 where NAME is NULL. */
941 expand_member_init (tree name
, tree init
)
946 if (!current_class_ref
)
951 /* This is an obsolete unnamed base class initializer. The
952 parser will already have warned about its use. */
953 switch (CLASSTYPE_N_BASECLASSES (current_class_type
))
956 error ("unnamed initializer for `%T', which has no base classes",
960 basetype
= TYPE_BINFO_BASETYPE (current_class_type
, 0);
963 error ("unnamed initializer for `%T', which uses multiple inheritance",
968 else if (TYPE_P (name
))
970 basetype
= TYPE_MAIN_VARIANT (name
);
971 name
= TYPE_NAME (name
);
973 else if (TREE_CODE (name
) == TYPE_DECL
)
974 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
976 basetype
= NULL_TREE
;
978 my_friendly_assert (init
!= NULL_TREE
, 0);
984 if (current_template_parms
)
985 return build_tree_list (basetype
, init
);
987 binfo
= lookup_base (current_class_type
, basetype
,
991 if (TREE_VIA_VIRTUAL (binfo
))
992 binfo
= binfo_for_vbase (basetype
, current_class_type
);
993 else if (BINFO_INHERITANCE_CHAIN (binfo
)
994 != TYPE_BINFO (current_class_type
))
999 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
1000 error ("type `%D' is not a direct or virtual base of `%T'",
1001 name
, current_class_type
);
1003 error ("type `%D' is not a direct base of `%T'",
1004 name
, current_class_type
);
1009 return build_tree_list (binfo
, init
);
1013 if (TREE_CODE (name
) == IDENTIFIER_NODE
)
1014 field
= lookup_field (current_class_type
, name
, 1, 0);
1018 if (member_init_ok_or_else (field
, current_class_type
, name
))
1019 return build_tree_list (field
, init
);
1025 /* This is like `expand_member_init', only it stores one aggregate
1028 INIT comes in two flavors: it is either a value which
1029 is to be stored in EXP, or it is a parameter list
1030 to go to a constructor, which will operate on EXP.
1031 If INIT is not a parameter list for a constructor, then set
1032 LOOKUP_ONLYCONVERTING.
1033 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1034 the initializer, if FLAGS is 0, then it is the (init) form.
1035 If `init' is a CONSTRUCTOR, then we emit a warning message,
1036 explaining that such initializations are invalid.
1038 If INIT resolves to a CALL_EXPR which happens to return
1039 something of the type we are looking for, then we know
1040 that we can safely use that call to perform the
1043 The virtual function table pointer cannot be set up here, because
1044 we do not really know its type.
1046 This never calls operator=().
1048 When initializing, nothing is CONST.
1050 A default copy constructor may have to be used to perform the
1053 A constructor or a conversion operator may have to be used to
1054 perform the initialization, but not both, as it would be ambiguous. */
1057 build_aggr_init (exp
, init
, flags
)
1064 tree type
= TREE_TYPE (exp
);
1065 int was_const
= TREE_READONLY (exp
);
1066 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1068 if (init
== error_mark_node
)
1069 return error_mark_node
;
1071 TREE_READONLY (exp
) = 0;
1072 TREE_THIS_VOLATILE (exp
) = 0;
1074 if (init
&& TREE_CODE (init
) != TREE_LIST
)
1075 flags
|= LOOKUP_ONLYCONVERTING
;
1077 if (TREE_CODE (type
) == ARRAY_TYPE
)
1079 /* Must arrange to initialize each element of EXP
1080 from elements of INIT. */
1081 tree itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1085 /* Handle bad initializers like:
1089 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1093 int main(int argc, char **argv) {
1094 COMPLEX zees(1.0, 0.0)[10];
1097 error ("bad array initializer");
1098 return error_mark_node
;
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 TREE_TYPE (init
) = TYPE_MAIN_VARIANT (itype
);
1104 stmt_expr
= build_vec_init (exp
, init
,
1105 init
&& same_type_p (TREE_TYPE (init
),
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 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 (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 (decl
, init
, flags
)
1143 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
1144 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1145 expr
= build_aggr_init (decl
, init
, flags
);
1147 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
1153 expand_default_init (binfo
, true_exp
, exp
, init
, 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 (TREE_CODE (init
) == CONSTRUCTOR
1185 && TREE_HAS_CONSTRUCTOR (init
))
1187 /* A brace-enclosed initializer for an aggregate. */
1188 my_friendly_assert (CP_AGGREGATE_TYPE_P (type
), 20021016);
1189 init
= digest_init (type
, init
, (tree
*)NULL
);
1192 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1194 if (TREE_CODE (init
) == TRY_CATCH_EXPR
)
1195 /* We need to protect the initialization of a catch parm
1196 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1197 around the TARGET_EXPR for the copy constructor. See
1198 expand_start_catch_block. */
1199 TREE_OPERAND (init
, 0) = build (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1200 TREE_OPERAND (init
, 0));
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
))
1226 if (building_stmt_tree ())
1227 finish_expr_stmt (rval
);
1229 genrtl_expr_stmt (rval
);
1233 /* This function is responsible for initializing EXP with INIT
1236 BINFO is the binfo of the type for who we are performing the
1237 initialization. For example, if W is a virtual base class of A and B,
1239 If we are initializing B, then W must contain B's W vtable, whereas
1240 were we initializing C, W must contain C's W vtable.
1242 TRUE_EXP is nonzero if it is the true expression being initialized.
1243 In this case, it may be EXP, or may just contain EXP. The reason we
1244 need this is because if EXP is a base element of TRUE_EXP, we
1245 don't necessarily know by looking at EXP where its virtual
1246 baseclass fields should really be pointing. But we do know
1247 from TRUE_EXP. In constructors, we don't know anything about
1248 the value being initialized.
1250 FLAGS is just passes to `build_method_call'. See that function for
1254 expand_aggr_init_1 (binfo
, true_exp
, exp
, init
, flags
)
1260 tree type
= TREE_TYPE (exp
);
1262 my_friendly_assert (init
!= error_mark_node
&& type
!= error_mark_node
, 211);
1263 my_friendly_assert (building_stmt_tree (), 20021010);
1265 /* Use a function returning the desired type to initialize EXP for us.
1266 If the function is a constructor, and its first argument is
1267 NULL_TREE, know that it was meant for us--just slide exp on
1268 in and expand the constructor. Constructors now come
1271 if (init
&& TREE_CODE (exp
) == VAR_DECL
1272 && TREE_CODE (init
) == CONSTRUCTOR
1273 && TREE_HAS_CONSTRUCTOR (init
))
1275 /* If store_init_value returns NULL_TREE, the INIT has been
1276 record in the DECL_INITIAL for EXP. That means there's
1277 nothing more we have to do. */
1278 if (store_init_value (exp
, init
))
1279 finish_expr_stmt (build (INIT_EXPR
, type
, exp
, init
));
1283 /* We know that expand_default_init can handle everything we want
1285 expand_default_init (binfo
, true_exp
, exp
, init
, flags
);
1288 /* Report an error if TYPE is not a user-defined, aggregate type. If
1289 OR_ELSE is nonzero, give an error message. */
1292 is_aggr_type (type
, or_else
)
1296 if (type
== error_mark_node
)
1299 if (! IS_AGGR_TYPE (type
)
1300 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1301 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1304 error ("`%T' is not an aggregate type", type
);
1310 /* Like is_aggr_typedef, but returns typedef if successful. */
1313 get_aggr_from_typedef (name
, or_else
)
1319 if (name
== error_mark_node
)
1322 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1323 type
= IDENTIFIER_TYPE_VALUE (name
);
1327 error ("`%T' fails to be an aggregate typedef", name
);
1331 if (! IS_AGGR_TYPE (type
)
1332 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1333 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1336 error ("type `%T' is of non-aggregate type", type
);
1343 get_type_value (name
)
1346 if (name
== error_mark_node
)
1349 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1350 return IDENTIFIER_TYPE_VALUE (name
);
1356 /* This code could just as well go in `class.c', but is placed here for
1359 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1360 the appropriate function call. */
1363 build_member_call (type
, name
, parmlist
)
1364 tree type
, name
, parmlist
;
1370 tree basetype_path
, decl
;
1372 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
1373 && TREE_CODE (type
) == NAMESPACE_DECL
)
1375 /* 'name' already refers to the decls from the namespace, since we
1376 hit do_identifier for template_ids. */
1377 method_name
= TREE_OPERAND (name
, 0);
1378 /* FIXME: Since we don't do independent names right yet, the
1379 name might also be a LOOKUP_EXPR. Once we resolve this to a
1380 real decl earlier, this can go. This may happen during
1382 if (TREE_CODE (method_name
) == LOOKUP_EXPR
)
1384 method_name
= lookup_namespace_name
1385 (type
, TREE_OPERAND (method_name
, 0));
1386 TREE_OPERAND (name
, 0) = method_name
;
1388 my_friendly_assert (is_overloaded_fn (method_name
), 980519);
1389 return finish_call_expr (name
, parmlist
, /*disallow_virtual=*/true);
1393 name
= DECL_NAME (name
);
1395 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1396 return finish_call_expr (lookup_namespace_name (type
, name
),
1398 /*disallow_virtual=*/true);
1400 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1402 method_name
= TREE_OPERAND (name
, 0);
1403 if (TREE_CODE (method_name
) == COMPONENT_REF
)
1404 method_name
= TREE_OPERAND (method_name
, 1);
1405 if (is_overloaded_fn (method_name
))
1406 method_name
= DECL_NAME (OVL_CURRENT (method_name
));
1407 TREE_OPERAND (name
, 0) = method_name
;
1412 if (TREE_CODE (method_name
) == BIT_NOT_EXPR
)
1414 method_name
= TREE_OPERAND (method_name
, 0);
1418 /* This shouldn't be here, and build_member_call shouldn't appear in
1420 if (type
&& TREE_CODE (type
) == IDENTIFIER_NODE
1421 && get_aggr_from_typedef (type
, 0) == 0)
1423 tree ns
= lookup_name (type
, 0);
1424 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
)
1425 return finish_call_expr (lookup_namespace_name (ns
, name
),
1427 /*disallow_virtual=*/true);
1430 if (type
== NULL_TREE
|| ! is_aggr_type (type
, 1))
1431 return error_mark_node
;
1433 /* An operator we did not like. */
1434 if (name
== NULL_TREE
)
1435 return error_mark_node
;
1439 error ("cannot call destructor `%T::~%T' without object", type
,
1441 return error_mark_node
;
1444 decl
= maybe_dummy_object (type
, &basetype_path
);
1446 fns
= lookup_fnfields (basetype_path
, method_name
, 0);
1449 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1450 BASELINK_FUNCTIONS (fns
) = build_nt (TEMPLATE_ID_EXPR
,
1451 BASELINK_FUNCTIONS (fns
),
1452 TREE_OPERAND (name
, 1));
1453 return build_new_method_call (decl
, fns
, parmlist
,
1454 /*conversion_path=*/NULL_TREE
,
1455 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
);
1458 /* Convert 'this' to the specified type to disambiguate conversion
1459 to the function's context. */
1460 if (decl
== current_class_ref
1461 /* ??? this is wrong, but if this conversion is invalid we need to
1462 defer it until we know whether we are calling a static or
1463 non-static member function. Be conservative for now. */
1464 && ACCESSIBLY_UNIQUELY_DERIVED_P (type
, current_class_type
))
1466 basetype_path
= NULL_TREE
;
1467 decl
= build_scoped_ref (decl
, type
, &basetype_path
);
1468 if (decl
== error_mark_node
)
1469 return error_mark_node
;
1472 if (constructor_name_p (method_name
, type
))
1473 return build_functional_cast (type
, parmlist
);
1474 if (TREE_CODE (name
) == IDENTIFIER_NODE
1475 && ((t
= lookup_field (TYPE_BINFO (type
), name
, 1, 0))))
1477 if (t
== error_mark_node
)
1478 return error_mark_node
;
1479 if (TREE_CODE (t
) == FIELD_DECL
)
1481 if (is_dummy_object (decl
))
1483 error ("invalid use of non-static field `%D'", t
);
1484 return error_mark_node
;
1486 decl
= build (COMPONENT_REF
, TREE_TYPE (t
), decl
, t
);
1488 else if (TREE_CODE (t
) == VAR_DECL
)
1492 error ("invalid use of member `%D'", t
);
1493 return error_mark_node
;
1495 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl
)))
1496 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, decl
,
1497 parmlist
, NULL_TREE
);
1498 return build_function_call (decl
, parmlist
);
1502 error ("no method `%T::%D'", type
, name
);
1503 return error_mark_node
;
1507 /* Build a reference to a member of an aggregate. This is not a
1508 C++ `&', but really something which can have its address taken,
1509 and then act as a pointer to member, for example TYPE :: FIELD
1510 can have its address taken by saying & TYPE :: FIELD.
1512 @@ Prints out lousy diagnostics for operator <typename>
1515 @@ This function should be rewritten and placed in search.c. */
1518 build_offset_ref (type
, name
)
1521 tree decl
, t
= error_mark_node
;
1523 tree basebinfo
= NULL_TREE
;
1524 tree orig_name
= name
;
1526 /* class templates can come in as TEMPLATE_DECLs here. */
1527 if (TREE_CODE (name
) == TEMPLATE_DECL
)
1530 if (processing_template_decl
|| uses_template_parms (type
))
1531 return build_min_nt (SCOPE_REF
, type
, name
);
1533 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1535 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1536 something like `a.template f<int>' or the like. For the most
1537 part, we treat this just like a.f. We do remember, however,
1538 the template-id that was used. */
1539 name
= TREE_OPERAND (orig_name
, 0);
1542 name
= DECL_NAME (name
);
1545 if (TREE_CODE (name
) == LOOKUP_EXPR
)
1546 /* This can happen during tsubst'ing. */
1547 name
= TREE_OPERAND (name
, 0);
1550 if (TREE_CODE (name
) == COMPONENT_REF
)
1551 name
= TREE_OPERAND (name
, 1);
1552 if (TREE_CODE (name
) == OVERLOAD
)
1553 name
= DECL_NAME (OVL_CURRENT (name
));
1557 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 0);
1560 if (type
== NULL_TREE
)
1561 return error_mark_node
;
1563 /* Handle namespace names fully here. */
1564 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1566 t
= lookup_namespace_name (type
, name
);
1567 if (t
== error_mark_node
)
1569 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1570 /* Reconstruct the TEMPLATE_ID_EXPR. */
1571 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
),
1572 t
, TREE_OPERAND (orig_name
, 1));
1573 if (! type_unknown_p (t
))
1576 t
= convert_from_reference (t
);
1581 if (! is_aggr_type (type
, 1))
1582 return error_mark_node
;
1584 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1586 if (! check_dtor_name (type
, name
))
1587 error ("qualified type `%T' does not match destructor name `~%T'",
1588 type
, TREE_OPERAND (name
, 0));
1589 name
= dtor_identifier
;
1592 if (!COMPLETE_TYPE_P (complete_type (type
))
1593 && !TYPE_BEING_DEFINED (type
))
1595 error ("incomplete type `%T' does not have member `%D'", type
,
1597 return error_mark_node
;
1600 decl
= maybe_dummy_object (type
, &basebinfo
);
1602 if (BASELINK_P (name
))
1606 member
= lookup_member (basebinfo
, name
, 1, 0);
1608 if (member
== error_mark_node
)
1609 return error_mark_node
;
1612 /* A lot of this logic is now handled in lookup_member. */
1613 if (member
&& BASELINK_P (member
))
1615 /* Go from the TREE_BASELINK to the member function info. */
1616 tree fnfields
= member
;
1617 t
= BASELINK_FUNCTIONS (fnfields
);
1619 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1621 /* The FNFIELDS are going to contain functions that aren't
1622 necessarily templates, and templates that don't
1623 necessarily match the explicit template parameters. We
1624 save all the functions, and the explicit parameters, and
1625 then figure out exactly what to instantiate with what
1626 arguments in instantiate_type. */
1628 if (TREE_CODE (t
) != OVERLOAD
)
1629 /* The code in instantiate_type which will process this
1630 expects to encounter OVERLOADs, not raw functions. */
1631 t
= ovl_cons (t
, NULL_TREE
);
1633 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
), t
,
1634 TREE_OPERAND (orig_name
, 1));
1635 t
= build (OFFSET_REF
, unknown_type_node
, decl
, t
);
1637 PTRMEM_OK_P (t
) = 1;
1642 if (TREE_CODE (t
) != TEMPLATE_ID_EXPR
&& !really_overloaded_fn (t
))
1644 /* Get rid of a potential OVERLOAD around it */
1645 t
= OVL_CURRENT (t
);
1647 /* unique functions are handled easily. */
1648 if (!enforce_access (basebinfo
, t
))
1649 return error_mark_node
;
1651 if (DECL_STATIC_FUNCTION_P (t
))
1653 t
= build (OFFSET_REF
, TREE_TYPE (t
), decl
, t
);
1654 PTRMEM_OK_P (t
) = 1;
1658 TREE_TYPE (fnfields
) = unknown_type_node
;
1660 t
= build (OFFSET_REF
, unknown_type_node
, decl
, fnfields
);
1661 PTRMEM_OK_P (t
) = 1;
1669 error ("`%D' is not a member of type `%T'", name
, type
);
1670 return error_mark_node
;
1673 if (TREE_CODE (t
) == TYPE_DECL
)
1678 /* static class members and class-specific enum
1679 values can be returned without further ado. */
1680 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == CONST_DECL
)
1683 return convert_from_reference (t
);
1686 if (TREE_CODE (t
) == FIELD_DECL
&& DECL_C_BIT_FIELD (t
))
1688 error ("invalid pointer to bit-field `%D'", t
);
1689 return error_mark_node
;
1692 /* static class functions too. */
1693 if (TREE_CODE (t
) == FUNCTION_DECL
1694 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1697 /* In member functions, the form `type::name' is no longer
1698 equivalent to `this->type::name', at least not until
1699 resolve_offset_ref. */
1700 t
= build (OFFSET_REF
, build_offset_type (type
, TREE_TYPE (t
)), decl
, t
);
1701 PTRMEM_OK_P (t
) = 1;
1705 /* If a OFFSET_REF made it through to here, then it did
1706 not have its address taken. */
1709 resolve_offset_ref (exp
)
1712 tree type
= TREE_TYPE (exp
);
1713 tree base
= NULL_TREE
;
1715 tree basetype
, addr
;
1717 if (TREE_CODE (exp
) == OFFSET_REF
)
1719 member
= TREE_OPERAND (exp
, 1);
1720 base
= TREE_OPERAND (exp
, 0);
1724 my_friendly_assert (TREE_CODE (type
) == OFFSET_TYPE
, 214);
1725 if (TYPE_OFFSET_BASETYPE (type
) != current_class_type
)
1727 error ("object missing in use of pointer-to-member construct");
1728 return error_mark_node
;
1731 type
= TREE_TYPE (type
);
1732 base
= current_class_ref
;
1735 if (BASELINK_P (member
) || TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
1736 return build_unary_op (ADDR_EXPR
, exp
, 0);
1738 if (TREE_CODE (TREE_TYPE (member
)) == METHOD_TYPE
)
1740 if (!flag_ms_extensions
)
1741 /* A single non-static member, make sure we don't allow a
1742 pointer-to-member. */
1743 exp
= ovl_cons (member
, NULL_TREE
);
1745 return build_unary_op (ADDR_EXPR
, exp
, 0);
1748 if ((TREE_CODE (member
) == VAR_DECL
1749 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member
))
1750 && ! TYPE_PTRMEM_P (TREE_TYPE (member
)))
1751 || TREE_CODE (TREE_TYPE (member
)) == FUNCTION_TYPE
)
1753 /* These were static members. */
1754 if (!cxx_mark_addressable (member
))
1755 return error_mark_node
;
1759 if (TREE_CODE (TREE_TYPE (member
)) == POINTER_TYPE
1760 && TREE_CODE (TREE_TYPE (TREE_TYPE (member
))) == METHOD_TYPE
)
1763 /* Syntax error can cause a member which should
1764 have been seen as static to be grok'd as non-static. */
1765 if (TREE_CODE (member
) == FIELD_DECL
&& current_class_ref
== NULL_TREE
)
1767 cp_error_at ("member `%D' is non-static but referenced as a static member",
1769 error ("at this point in file");
1770 return error_mark_node
;
1773 /* The first case is really just a reference to a member of `this'. */
1774 if (TREE_CODE (member
) == FIELD_DECL
1775 && (base
== current_class_ref
|| is_dummy_object (base
)))
1777 tree binfo
= NULL_TREE
;
1779 /* Try to get to basetype from 'this'; if that doesn't work,
1781 base
= current_class_ref
;
1783 /* First convert to the intermediate base specified, if appropriate. */
1784 if (TREE_CODE (exp
) == OFFSET_REF
&& TREE_CODE (type
) == OFFSET_TYPE
)
1785 base
= build_scoped_ref (base
, TYPE_OFFSET_BASETYPE (type
), &binfo
);
1787 return build_class_member_access_expr (base
, member
,
1788 /*access_path=*/NULL_TREE
,
1789 /*preserve_reference=*/false);
1792 /* Ensure that we have an object. */
1793 if (is_dummy_object (base
))
1794 addr
= error_mark_node
;
1796 /* If this is a reference to a member function, then return the
1797 address of the member function (which may involve going
1798 through the object's vtable), otherwise, return an expression
1799 for the dereferenced pointer-to-member construct. */
1800 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1802 if (TYPE_PTRMEM_P (TREE_TYPE (member
)))
1804 if (addr
== error_mark_node
)
1806 error ("object missing in `%E'", exp
);
1807 return error_mark_node
;
1810 basetype
= TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member
)));
1811 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (addr
)),
1812 basetype
, ba_check
, NULL
);
1813 addr
= build_base_path (PLUS_EXPR
, addr
, basetype
, 1);
1815 member
= cp_convert (ptrdiff_type_node
, member
);
1817 addr
= build (PLUS_EXPR
, build_pointer_type (type
), addr
, member
);
1818 return build_indirect_ref (addr
, 0);
1820 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member
)))
1822 return get_member_function_from_ptrfunc (&addr
, member
);
1829 /* If DECL is a `const' declaration, and its value is a known
1830 constant, then return that value. */
1833 decl_constant_value (decl
)
1836 if (TREE_READONLY_DECL_P (decl
)
1837 && ! TREE_THIS_VOLATILE (decl
)
1838 && DECL_INITIAL (decl
)
1839 && DECL_INITIAL (decl
) != error_mark_node
1840 /* This is invalid if initial value is not constant.
1841 If it has either a function call, a memory reference,
1842 or a variable, then re-evaluating it could give different results. */
1843 && TREE_CONSTANT (DECL_INITIAL (decl
))
1844 /* Check for cases where this is sub-optimal, even though valid. */
1845 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1846 return DECL_INITIAL (decl
);
1850 /* Common subroutines of build_new and build_vec_delete. */
1852 /* Call the global __builtin_delete to delete ADDR. */
1855 build_builtin_delete_call (addr
)
1858 mark_used (global_delete_fndecl
);
1859 return build_call (global_delete_fndecl
, build_tree_list (NULL_TREE
, addr
));
1862 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1863 (which needs to go through some sort of groktypename) or it
1864 is the name of the class we are newing. INIT is an initialization value.
1865 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1866 If INIT is void_type_node, it means do *not* call a constructor
1869 For types with constructors, the data returned is initialized
1870 by the appropriate constructor.
1872 Whether the type has a constructor or not, if it has a pointer
1873 to a virtual function table, then that pointer is set up
1876 Unless I am mistaken, a call to new () will return initialized
1877 data regardless of whether the constructor itself is private or
1878 not. NOPE; new fails if the constructor is private (jcm).
1880 Note that build_new does nothing to assure that any special
1881 alignment requirements of the type are met. Rather, it leaves
1882 it up to malloc to do the right thing. Otherwise, folding to
1883 the right alignment cal cause problems if the user tries to later
1884 free the memory returned by `new'.
1886 PLACEMENT is the `placement' list for user-defined operator new (). */
1889 build_new (placement
, decl
, init
, use_global_new
)
1895 tree nelts
= NULL_TREE
, t
;
1898 if (decl
== error_mark_node
)
1899 return error_mark_node
;
1901 if (TREE_CODE (decl
) == TREE_LIST
)
1903 tree absdcl
= TREE_VALUE (decl
);
1904 tree last_absdcl
= NULL_TREE
;
1906 if (current_function_decl
1907 && DECL_CONSTRUCTOR_P (current_function_decl
))
1908 my_friendly_assert (immediate_size_expand
== 0, 19990926);
1910 nelts
= integer_one_node
;
1912 if (absdcl
&& TREE_CODE (absdcl
) == CALL_EXPR
)
1914 while (absdcl
&& TREE_CODE (absdcl
) == INDIRECT_REF
)
1916 last_absdcl
= absdcl
;
1917 absdcl
= TREE_OPERAND (absdcl
, 0);
1920 if (absdcl
&& TREE_CODE (absdcl
) == ARRAY_REF
)
1922 /* probably meant to be a vec new */
1925 while (TREE_OPERAND (absdcl
, 0)
1926 && TREE_CODE (TREE_OPERAND (absdcl
, 0)) == ARRAY_REF
)
1928 last_absdcl
= absdcl
;
1929 absdcl
= TREE_OPERAND (absdcl
, 0);
1933 this_nelts
= TREE_OPERAND (absdcl
, 1);
1934 if (this_nelts
!= error_mark_node
)
1936 if (this_nelts
== NULL_TREE
)
1937 error ("new of array type fails to specify size");
1938 else if (processing_template_decl
)
1941 absdcl
= TREE_OPERAND (absdcl
, 0);
1945 if (build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
1948 pedwarn ("size in array new must have integral type");
1950 this_nelts
= save_expr (cp_convert (sizetype
, this_nelts
));
1951 absdcl
= TREE_OPERAND (absdcl
, 0);
1952 if (this_nelts
== integer_zero_node
)
1954 warning ("zero size array reserves no space");
1955 nelts
= integer_zero_node
;
1958 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
1962 nelts
= integer_zero_node
;
1966 TREE_OPERAND (last_absdcl
, 0) = absdcl
;
1968 TREE_VALUE (decl
) = absdcl
;
1970 type
= groktypename (decl
);
1971 if (! type
|| type
== error_mark_node
)
1972 return error_mark_node
;
1974 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
1976 if (IDENTIFIER_HAS_TYPE_VALUE (decl
))
1978 /* An aggregate type. */
1979 type
= IDENTIFIER_TYPE_VALUE (decl
);
1980 decl
= TYPE_MAIN_DECL (type
);
1984 /* A builtin type. */
1985 decl
= lookup_name (decl
, 1);
1986 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 215);
1987 type
= TREE_TYPE (decl
);
1990 else if (TREE_CODE (decl
) == TYPE_DECL
)
1992 type
= TREE_TYPE (decl
);
1997 decl
= TYPE_MAIN_DECL (type
);
2000 if (processing_template_decl
)
2003 t
= tree_cons (tree_cons (NULL_TREE
, type
, NULL_TREE
),
2004 build_min_nt (ARRAY_REF
, NULL_TREE
, nelts
),
2009 rval
= build_min_nt (NEW_EXPR
, placement
, t
, init
);
2010 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2014 /* ``A reference cannot be created by the new operator. A reference
2015 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2016 returned by new.'' ARM 5.3.3 */
2017 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2019 error ("new cannot be applied to a reference type");
2020 type
= TREE_TYPE (type
);
2023 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2025 error ("new cannot be applied to a function type");
2026 return error_mark_node
;
2029 /* When the object being created is an array, the new-expression yields a
2030 pointer to the initial element (if any) of the array. For example,
2031 both new int and new int[10] return an int*. 5.3.4. */
2032 if (TREE_CODE (type
) == ARRAY_TYPE
&& has_array
== 0)
2034 nelts
= array_type_nelts_top (type
);
2036 type
= TREE_TYPE (type
);
2040 t
= build_nt (ARRAY_REF
, type
, nelts
);
2044 rval
= build (NEW_EXPR
, build_pointer_type (type
), placement
, t
, init
);
2045 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2046 TREE_SIDE_EFFECTS (rval
) = 1;
2047 rval
= build_new_1 (rval
);
2048 if (rval
== error_mark_node
)
2049 return error_mark_node
;
2051 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2052 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
2053 TREE_NO_UNUSED_WARNING (rval
) = 1;
2058 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2061 build_java_class_ref (type
)
2064 tree name
= NULL_TREE
, class_decl
;
2065 static tree CL_suffix
= NULL_TREE
;
2066 if (CL_suffix
== NULL_TREE
)
2067 CL_suffix
= get_identifier("class$");
2068 if (jclass_node
== NULL_TREE
)
2070 jclass_node
= IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2071 if (jclass_node
== NULL_TREE
)
2072 fatal_error ("call to Java constructor, while `jclass' undefined");
2074 jclass_node
= TREE_TYPE (jclass_node
);
2077 /* Mangle the class$ field */
2080 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2081 if (DECL_NAME (field
) == CL_suffix
)
2083 mangle_decl (field
);
2084 name
= DECL_ASSEMBLER_NAME (field
);
2088 internal_error ("can't find class$");
2091 class_decl
= IDENTIFIER_GLOBAL_VALUE (name
);
2092 if (class_decl
== NULL_TREE
)
2094 class_decl
= build_decl (VAR_DECL
, name
, TREE_TYPE (jclass_node
));
2095 TREE_STATIC (class_decl
) = 1;
2096 DECL_EXTERNAL (class_decl
) = 1;
2097 TREE_PUBLIC (class_decl
) = 1;
2098 DECL_ARTIFICIAL (class_decl
) = 1;
2099 DECL_IGNORED_P (class_decl
) = 1;
2100 pushdecl_top_level (class_decl
);
2101 make_decl_rtl (class_decl
, NULL
);
2106 /* Returns the size of the cookie to use when allocating an array
2107 whose elements have the indicated TYPE. Assumes that it is already
2108 known that a cookie is needed. */
2111 get_cookie_size (type
)
2116 /* We need to allocate an additional max (sizeof (size_t), alignof
2117 (true_type)) bytes. */
2121 sizetype_size
= size_in_bytes (sizetype
);
2122 type_align
= size_int (TYPE_ALIGN_UNIT (type
));
2123 if (INT_CST_LT_UNSIGNED (type_align
, sizetype_size
))
2124 cookie_size
= sizetype_size
;
2126 cookie_size
= type_align
;
2131 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2132 value is immediately handed to expand_expr. */
2138 tree placement
, init
;
2139 tree type
, true_type
, size
, rval
, t
;
2141 tree nelts
= NULL_TREE
;
2142 tree alloc_call
, alloc_expr
, alloc_node
;
2144 tree cookie_expr
, init_expr
;
2146 enum tree_code code
;
2147 int use_cookie
, nothrow
, check_new
;
2148 /* Nonzero if the user wrote `::new' rather than just `new'. */
2149 int globally_qualified_p
;
2150 /* Nonzero if we're going to call a global operator new, rather than
2151 a class-specific version. */
2153 int use_java_new
= 0;
2154 /* If non-NULL, the number of extra bytes to allocate at the
2155 beginning of the storage allocated for an array-new expression in
2156 order to store the number of elements. */
2157 tree cookie_size
= NULL_TREE
;
2158 /* True if the function we are calling is a placement allocation
2160 bool placement_allocation_fn_p
;
2162 placement
= TREE_OPERAND (exp
, 0);
2163 type
= TREE_OPERAND (exp
, 1);
2164 init
= TREE_OPERAND (exp
, 2);
2165 globally_qualified_p
= NEW_EXPR_USE_GLOBAL (exp
);
2167 if (TREE_CODE (type
) == ARRAY_REF
)
2170 nelts
= TREE_OPERAND (type
, 1);
2171 type
= TREE_OPERAND (type
, 0);
2173 full_type
= cp_build_binary_op (MINUS_EXPR
, nelts
, integer_one_node
);
2174 full_type
= build_index_type (full_type
);
2175 full_type
= build_cplus_array_type (type
, full_type
);
2182 code
= has_array
? VEC_NEW_EXPR
: NEW_EXPR
;
2184 /* If our base type is an array, then make sure we know how many elements
2186 while (TREE_CODE (true_type
) == ARRAY_TYPE
)
2188 tree this_nelts
= array_type_nelts_top (true_type
);
2189 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
2190 true_type
= TREE_TYPE (true_type
);
2193 if (!complete_type_or_else (true_type
, exp
))
2194 return error_mark_node
;
2196 size
= size_in_bytes (true_type
);
2198 size
= size_binop (MULT_EXPR
, size
, convert (sizetype
, nelts
));
2200 if (TREE_CODE (true_type
) == VOID_TYPE
)
2202 error ("invalid type `void' for new");
2203 return error_mark_node
;
2206 if (abstract_virtuals_error (NULL_TREE
, true_type
))
2207 return error_mark_node
;
2209 /* Figure out whether or not we're going to use the global operator
2211 if (!globally_qualified_p
2212 && IS_AGGR_TYPE (true_type
)
2214 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type
)
2215 : TYPE_HAS_NEW_OPERATOR (true_type
)))
2220 /* We only need cookies for arrays containing types for which we
2222 if (!has_array
|| !TYPE_VEC_NEW_USES_COOKIE (true_type
))
2224 /* When using placement new, users may not realize that they need
2225 the extra storage. We require that the operator called be
2226 the global placement operator new[]. */
2227 else if (placement
&& !TREE_CHAIN (placement
)
2228 && same_type_p (TREE_TYPE (TREE_VALUE (placement
)),
2230 use_cookie
= !use_global_new
;
2231 /* Otherwise, we need the cookie. */
2235 /* Compute the number of extra bytes to allocate, now that we know
2236 whether or not we need the cookie. */
2239 cookie_size
= get_cookie_size (true_type
);
2240 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
2243 /* Allocate the object. */
2245 if (! placement
&& TYPE_FOR_JAVA (true_type
))
2247 tree class_addr
, alloc_decl
;
2248 tree class_decl
= build_java_class_ref (true_type
);
2249 tree class_size
= size_in_bytes (true_type
);
2250 static const char alloc_name
[] = "_Jv_AllocObject";
2252 alloc_decl
= IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name
));
2253 if (alloc_decl
== NULL_TREE
)
2254 fatal_error ("call to Java constructor with `%s' undefined",
2257 class_addr
= build1 (ADDR_EXPR
, jclass_node
, class_decl
);
2258 alloc_call
= (build_function_call
2260 tree_cons (NULL_TREE
, class_addr
,
2261 build_tree_list (NULL_TREE
, class_size
))));
2268 args
= tree_cons (NULL_TREE
, size
, placement
);
2269 fnname
= ansi_opname (code
);
2272 alloc_call
= (build_new_function_call
2273 (lookup_function_nonclass (fnname
, args
),
2276 alloc_call
= build_method_call (build_dummy_object (true_type
),
2278 TYPE_BINFO (true_type
),
2282 if (alloc_call
== error_mark_node
)
2283 return error_mark_node
;
2285 /* The ALLOC_CALL should be a CALL_EXPR -- or a COMPOUND_EXPR whose
2286 right-hand-side is ultimately a CALL_EXPR -- and the first
2287 operand should be the address of a known FUNCTION_DECL. */
2289 while (TREE_CODE (t
) == COMPOUND_EXPR
)
2290 t
= TREE_OPERAND (t
, 1);
2291 alloc_fn
= get_callee_fndecl (t
);
2292 my_friendly_assert (alloc_fn
!= NULL_TREE
, 20020325);
2293 /* Now, check to see if this function is actually a placement
2294 allocation function. This can happen even when PLACEMENT is NULL
2295 because we might have something like:
2297 struct S { void* operator new (size_t, int i = 0); };
2299 A call to `new S' will get this allocation function, even though
2300 there is no explicit placement argument. If there is more than
2301 one argument, or there are variable arguments, then this is a
2302 placement allocation function. */
2303 placement_allocation_fn_p
2304 = (type_num_arguments (TREE_TYPE (alloc_fn
)) > 1
2305 || varargs_function_p (alloc_fn
));
2307 /* unless an allocation function is declared with an empty excep-
2308 tion-specification (_except.spec_), throw(), it indicates failure to
2309 allocate storage by throwing a bad_alloc exception (clause _except_,
2310 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2311 cation function is declared with an empty exception-specification,
2312 throw(), it returns null to indicate failure to allocate storage and a
2313 non-null pointer otherwise.
2315 So check for a null exception spec on the op new we just called. */
2317 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (alloc_fn
));
2318 check_new
= (flag_check_new
|| nothrow
) && ! use_java_new
;
2320 alloc_expr
= alloc_call
;
2323 /* Adjust so we're pointing to the start of the object. */
2324 alloc_expr
= build (PLUS_EXPR
, TREE_TYPE (alloc_expr
),
2325 alloc_expr
, cookie_size
);
2327 /* While we're working, use a pointer to the type we've actually
2329 alloc_expr
= convert (build_pointer_type (full_type
), alloc_expr
);
2331 /* Now save the allocation expression so we only evaluate it once. */
2332 alloc_expr
= get_target_expr (alloc_expr
);
2333 alloc_node
= TREE_OPERAND (alloc_expr
, 0);
2335 /* Now initialize the cookie. */
2340 /* Store the number of bytes allocated so that we can know how
2341 many elements to destroy later. We use the last sizeof
2342 (size_t) bytes to store the number of elements. */
2343 cookie
= build (MINUS_EXPR
, build_pointer_type (sizetype
),
2344 alloc_node
, size_in_bytes (sizetype
));
2345 cookie
= build_indirect_ref (cookie
, NULL
);
2347 cookie_expr
= build (MODIFY_EXPR
, void_type_node
, cookie
, nelts
);
2348 TREE_SIDE_EFFECTS (cookie_expr
) = 1;
2351 cookie_expr
= NULL_TREE
;
2353 /* Now initialize the allocated object. */
2354 init_expr
= NULL_TREE
;
2355 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
)
2357 init_expr
= build_indirect_ref (alloc_node
, NULL
);
2359 if (init
== void_zero_node
)
2360 init
= build_default_init (full_type
);
2361 else if (init
&& pedantic
&& has_array
)
2362 pedwarn ("ISO C++ forbids initialization in array new");
2365 init_expr
= build_vec_init (init_expr
, init
, 0);
2366 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2367 init_expr
= build_special_member_call (init_expr
,
2368 complete_ctor_identifier
,
2369 init
, TYPE_BINFO (true_type
),
2373 /* We are processing something like `new int (10)', which
2374 means allocate an int, and initialize it with 10. */
2376 if (TREE_CODE (init
) == TREE_LIST
)
2378 if (TREE_CHAIN (init
) != NULL_TREE
)
2380 ("initializer list being treated as compound expression");
2381 init
= build_compound_expr (init
);
2383 else if (TREE_CODE (init
) == CONSTRUCTOR
2384 && TREE_TYPE (init
) == NULL_TREE
)
2386 pedwarn ("ISO C++ forbids aggregate initializer to new");
2387 init
= digest_init (type
, init
, 0);
2390 init_expr
= build_modify_expr (init_expr
, INIT_EXPR
, init
);
2393 if (init_expr
== error_mark_node
)
2394 return error_mark_node
;
2396 /* If any part of the object initialization terminates by throwing an
2397 exception and a suitable deallocation function can be found, the
2398 deallocation function is called to free the memory in which the
2399 object was being constructed, after which the exception continues
2400 to propagate in the context of the new-expression. If no
2401 unambiguous matching deallocation function can be found,
2402 propagating the exception does not cause the object's memory to be
2404 if (flag_exceptions
&& ! use_java_new
)
2406 enum tree_code dcode
= has_array
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2408 int flags
= (LOOKUP_NORMAL
2409 | (globally_qualified_p
* LOOKUP_GLOBAL
));
2413 /* Subtract the padding back out to get to the pointer returned
2414 from operator new. */
2415 delete_node
= fold (build (MINUS_EXPR
, TREE_TYPE (alloc_node
),
2416 alloc_node
, cookie_size
));
2418 delete_node
= alloc_node
;
2420 /* The Standard is unclear here, but the right thing to do
2421 is to use the same method for finding deallocation
2422 functions that we use for finding allocation functions. */
2423 flags
|= LOOKUP_SPECULATIVELY
;
2425 cleanup
= build_op_delete_call (dcode
, delete_node
, size
, flags
,
2426 (placement_allocation_fn_p
2427 ? alloc_call
: NULL_TREE
));
2429 /* Ack! First we allocate the memory. Then we set our sentry
2430 variable to true, and expand a cleanup that deletes the memory
2431 if sentry is true. Then we run the constructor, and finally
2434 It would be nice to be able to handle this without the sentry
2435 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2436 work. We allocate the space first, so if there are any
2437 temporaries with cleanups in the constructor args we need this
2438 EH region to extend until end of full-expression to preserve
2441 If the backend had some mechanism so that we could force the
2442 allocation to be expanded after all the other args to the
2443 constructor, that would fix the nesting problem and we could
2444 do away with this complexity. But that would complicate other
2445 things; in particular, it would make it difficult to bail out
2446 if the allocation function returns null. Er, no, it wouldn't;
2447 we just don't run the constructor. The standard says it's
2448 unspecified whether or not the args are evaluated. */
2452 tree end
, sentry
, begin
;
2454 begin
= get_target_expr (boolean_true_node
);
2455 CLEANUP_EH_ONLY (begin
) = 1;
2457 sentry
= TARGET_EXPR_SLOT (begin
);
2459 TARGET_EXPR_CLEANUP (begin
)
2460 = build (COND_EXPR
, void_type_node
, sentry
,
2461 cleanup
, void_zero_node
);
2463 end
= build (MODIFY_EXPR
, TREE_TYPE (sentry
),
2464 sentry
, boolean_false_node
);
2467 = build (COMPOUND_EXPR
, void_type_node
, begin
,
2468 build (COMPOUND_EXPR
, void_type_node
, init_expr
,
2473 else if (CP_TYPE_CONST_P (true_type
))
2474 error ("uninitialized const in `new' of `%#T'", true_type
);
2476 /* Now build up the return value in reverse order. */
2481 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
2483 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
2485 if (rval
== alloc_node
)
2486 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2488 rval
= TREE_OPERAND (alloc_expr
, 1);
2493 tree ifexp
= cp_build_binary_op (NE_EXPR
, alloc_node
,
2495 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
);
2498 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2501 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2503 rval
= convert (build_pointer_type (type
), rval
);
2509 build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
, use_global_delete
)
2510 tree base
, maxindex
, type
;
2511 special_function_kind auto_delete_vec
;
2512 int use_global_delete
;
2515 tree ptype
= build_pointer_type (type
= complete_type (type
));
2516 tree size_exp
= size_in_bytes (type
);
2518 /* Temporary variables used by the loop. */
2519 tree tbase
, tbase_init
;
2521 /* This is the body of the loop that implements the deletion of a
2522 single element, and moves temp variables to next elements. */
2525 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2528 /* This is the thing that governs what to do after the loop has run. */
2529 tree deallocate_expr
= 0;
2531 /* This is the BIND_EXPR which holds the outermost iterator of the
2532 loop. It is convenient to set this variable up and test it before
2533 executing any other code in the loop.
2534 This is also the containing expression returned by this function. */
2535 tree controller
= NULL_TREE
;
2537 /* We should only have 1-D arrays here. */
2538 if (TREE_CODE (type
) == ARRAY_TYPE
)
2541 if (! IS_AGGR_TYPE (type
) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2543 loop
= integer_zero_node
;
2547 /* The below is short by the cookie size. */
2548 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2549 convert (sizetype
, maxindex
));
2551 tbase
= create_temporary_var (ptype
);
2552 tbase_init
= build_modify_expr (tbase
, NOP_EXPR
,
2553 fold (build (PLUS_EXPR
, ptype
,
2556 DECL_REGISTER (tbase
) = 1;
2557 controller
= build (BIND_EXPR
, void_type_node
, tbase
, NULL_TREE
, NULL_TREE
);
2558 TREE_SIDE_EFFECTS (controller
) = 1;
2562 body
= tree_cons (NULL_TREE
,
2563 build_delete (ptype
, tbase
, sfk_complete_destructor
,
2564 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1),
2567 body
= tree_cons (NULL_TREE
,
2568 build_modify_expr (tbase
, NOP_EXPR
, build (MINUS_EXPR
, ptype
, tbase
, size_exp
)),
2571 body
= tree_cons (NULL_TREE
,
2572 build (EXIT_EXPR
, void_type_node
,
2573 build (EQ_EXPR
, boolean_type_node
, base
, tbase
)),
2576 loop
= build (LOOP_EXPR
, void_type_node
, build_compound_expr (body
));
2578 loop
= tree_cons (NULL_TREE
, tbase_init
,
2579 tree_cons (NULL_TREE
, loop
, NULL_TREE
));
2580 loop
= build_compound_expr (loop
);
2583 /* If the delete flag is one, or anything else with the low bit set,
2584 delete the storage. */
2585 deallocate_expr
= integer_zero_node
;
2586 if (auto_delete_vec
!= sfk_base_destructor
)
2590 /* The below is short by the cookie size. */
2591 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2592 convert (sizetype
, maxindex
));
2594 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2601 cookie_size
= get_cookie_size (type
);
2603 = cp_convert (ptype
,
2604 cp_build_binary_op (MINUS_EXPR
,
2605 cp_convert (string_type_node
,
2608 /* True size with header. */
2609 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
2612 if (auto_delete_vec
== sfk_deleting_destructor
)
2613 deallocate_expr
= build_x_delete (base_tbd
,
2614 2 | use_global_delete
,
2618 if (loop
&& deallocate_expr
!= integer_zero_node
)
2620 body
= tree_cons (NULL_TREE
, loop
,
2621 tree_cons (NULL_TREE
, deallocate_expr
, NULL_TREE
));
2622 body
= build_compound_expr (body
);
2627 /* Outermost wrapper: If pointer is null, punt. */
2628 body
= fold (build (COND_EXPR
, void_type_node
,
2629 fold (build (NE_EXPR
, boolean_type_node
, base
,
2630 integer_zero_node
)),
2631 body
, integer_zero_node
));
2632 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2636 TREE_OPERAND (controller
, 1) = body
;
2640 return cp_convert (void_type_node
, body
);
2643 /* Create an unnamed variable of the indicated TYPE. */
2646 create_temporary_var (type
)
2651 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2652 TREE_USED (decl
) = 1;
2653 DECL_ARTIFICIAL (decl
) = 1;
2654 DECL_SOURCE_FILE (decl
) = input_filename
;
2655 DECL_SOURCE_LINE (decl
) = lineno
;
2656 DECL_IGNORED_P (decl
) = 1;
2657 DECL_CONTEXT (decl
) = current_function_decl
;
2662 /* Create a new temporary variable of the indicated TYPE, initialized
2665 It is not entered into current_binding_level, because that breaks
2666 things when it comes time to do final cleanups (which take place
2667 "outside" the binding contour of the function). */
2670 get_temp_regvar (type
, init
)
2675 decl
= create_temporary_var (type
);
2676 if (building_stmt_tree ())
2677 add_decl_stmt (decl
);
2678 if (!building_stmt_tree ())
2679 SET_DECL_RTL (decl
, assign_temp (type
, 2, 0, 1));
2680 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
2685 /* `build_vec_init' returns tree structure that performs
2686 initialization of a vector of aggregate types.
2688 BASE is a reference to the vector, of ARRAY_TYPE.
2689 INIT is the (possibly NULL) initializer.
2691 FROM_ARRAY is 0 if we should init everything with INIT
2692 (i.e., every element initialized from INIT).
2693 FROM_ARRAY is 1 if we should index into INIT in parallel
2694 with initialization of DECL.
2695 FROM_ARRAY is 2 if we should index into INIT in parallel,
2696 but use assignment instead of initialization. */
2699 build_vec_init (base
, init
, from_array
)
2704 tree base2
= NULL_TREE
;
2706 tree itype
= NULL_TREE
;
2708 /* The type of the array. */
2709 tree atype
= TREE_TYPE (base
);
2710 /* The type of an element in the array. */
2711 tree type
= TREE_TYPE (atype
);
2712 /* The type of a pointer to an element in the array. */
2717 tree try_block
= NULL_TREE
;
2718 tree try_body
= NULL_TREE
;
2719 int num_initialized_elts
= 0;
2720 tree maxindex
= array_type_nelts (TREE_TYPE (base
));
2722 if (maxindex
== error_mark_node
)
2723 return error_mark_node
;
2727 ? (!CLASS_TYPE_P (type
) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
2728 : !TYPE_NEEDS_CONSTRUCTING (type
))
2729 && ((TREE_CODE (init
) == CONSTRUCTOR
2730 /* Don't do this if the CONSTRUCTOR might contain something
2731 that might throw and require us to clean up. */
2732 && (CONSTRUCTOR_ELTS (init
) == NULL_TREE
2733 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type
))))
2736 /* Do non-default initialization of POD arrays resulting from
2737 brace-enclosed initializers. In this case, digest_init and
2738 store_constructor will handle the semantics for us. */
2740 stmt_expr
= build (INIT_EXPR
, atype
, base
, init
);
2744 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2745 ptype
= build_pointer_type (type
);
2746 size
= size_in_bytes (type
);
2747 if (TREE_CODE (TREE_TYPE (base
)) == ARRAY_TYPE
)
2748 base
= cp_convert (ptype
, default_conversion (base
));
2750 /* The code we are generating looks like:
2754 ptrdiff_t iterator = maxindex;
2757 ... initialize *t1 ...
2759 } while (--iterator != -1);
2761 ... destroy elements that were constructed ...
2765 We can omit the try and catch blocks if we know that the
2766 initialization will never throw an exception, or if the array
2767 elements do not have destructors. We can omit the loop completely if
2768 the elements of the array do not have constructors.
2770 We actually wrap the entire body of the above in a STMT_EXPR, for
2773 When copying from array to another, when the array elements have
2774 only trivial copy constructors, we should use __builtin_memcpy
2775 rather than generating a loop. That way, we could take advantage
2776 of whatever cleverness the back-end has for dealing with copies
2777 of blocks of memory. */
2779 begin_init_stmts (&stmt_expr
, &compound_stmt
);
2780 destroy_temps
= stmts_are_full_exprs_p ();
2781 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2782 rval
= get_temp_regvar (ptype
, base
);
2783 base
= get_temp_regvar (ptype
, rval
);
2784 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2786 /* Protect the entire array initialization so that we can destroy
2787 the partially constructed array if an exception is thrown.
2788 But don't do this if we're assigning. */
2789 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2792 try_block
= begin_try_block ();
2793 try_body
= begin_compound_stmt (/*has_no_scope=*/1);
2796 if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
2798 /* Do non-default initialization of non-POD arrays resulting from
2799 brace-enclosed initializers. */
2804 for (elts
= CONSTRUCTOR_ELTS (init
); elts
; elts
= TREE_CHAIN (elts
))
2806 tree elt
= TREE_VALUE (elts
);
2807 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2809 num_initialized_elts
++;
2811 if (IS_AGGR_TYPE (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
2812 finish_expr_stmt (build_aggr_init (baseref
, elt
, 0));
2814 finish_expr_stmt (build_modify_expr (baseref
, NOP_EXPR
,
2817 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2818 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR
, iterator
, 0));
2821 /* Clear out INIT so that we don't get confused below. */
2824 else if (from_array
)
2826 /* If initializing one array from another, initialize element by
2827 element. We rely upon the below calls the do argument
2831 base2
= default_conversion (init
);
2832 itype
= TREE_TYPE (base2
);
2833 base2
= get_temp_regvar (itype
, base2
);
2834 itype
= TREE_TYPE (itype
);
2836 else if (TYPE_LANG_SPECIFIC (type
)
2837 && TYPE_NEEDS_CONSTRUCTING (type
)
2838 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2840 error ("initializer ends prematurely");
2841 return error_mark_node
;
2845 /* Now, default-initialize any remaining elements. We don't need to
2846 do that if a) the type does not need constructing, or b) we've
2847 already initialized all the elements.
2849 We do need to keep going if we're copying an array. */
2852 || (TYPE_NEEDS_CONSTRUCTING (type
)
2853 && ! (host_integerp (maxindex
, 0)
2854 && (num_initialized_elts
2855 == tree_low_cst (maxindex
, 0) + 1))))
2857 /* If the ITERATOR is equal to -1, then we don't have to loop;
2858 we've already initialized all the elements. */
2864 if_stmt
= begin_if_stmt ();
2865 finish_if_stmt_cond (build (NE_EXPR
, boolean_type_node
,
2866 iterator
, integer_minus_one_node
),
2869 /* Otherwise, loop through the elements. */
2870 do_stmt
= begin_do_stmt ();
2871 do_body
= begin_compound_stmt (/*has_no_scope=*/1);
2873 /* When we're not building a statement-tree, things are a little
2874 complicated. If, when we recursively call build_aggr_init,
2875 an expression containing a TARGET_EXPR is expanded, then it
2876 may get a cleanup. Then, the result of that expression is
2877 passed to finish_expr_stmt, which will call
2878 expand_start_target_temps/expand_end_target_temps. However,
2879 the latter call will not cause the cleanup to run because
2880 that block will still be on the block stack. So, we call
2881 expand_start_target_temps here manually; the corresponding
2882 call to expand_end_target_temps below will cause the cleanup
2884 if (!building_stmt_tree ())
2885 expand_start_target_temps ();
2889 tree to
= build1 (INDIRECT_REF
, type
, base
);
2893 from
= build1 (INDIRECT_REF
, itype
, base2
);
2897 if (from_array
== 2)
2898 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
2899 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2900 elt_init
= build_aggr_init (to
, from
, 0);
2902 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
2906 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2910 ("cannot initialize multi-dimensional array with initializer");
2911 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
2915 elt_init
= build_aggr_init (build1 (INDIRECT_REF
, type
, base
),
2918 /* The initialization of each array element is a
2919 full-expression, as per core issue 124. */
2920 if (!building_stmt_tree ())
2922 genrtl_expr_stmt (elt_init
);
2923 expand_end_target_temps ();
2927 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
2928 finish_expr_stmt (elt_init
);
2929 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2932 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2934 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base2
, 0));
2936 finish_compound_stmt (/*has_no_scope=*/1, do_body
);
2937 finish_do_body (do_stmt
);
2938 finish_do_stmt (build (NE_EXPR
, boolean_type_node
,
2939 build_unary_op (PREDECREMENT_EXPR
, iterator
, 0),
2940 integer_minus_one_node
),
2943 finish_then_clause (if_stmt
);
2947 /* Make sure to cleanup any partially constructed elements. */
2948 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2952 tree m
= cp_build_binary_op (MINUS_EXPR
, maxindex
, iterator
);
2954 /* Flatten multi-dimensional array since build_vec_delete only
2955 expects one-dimensional array. */
2956 if (TREE_CODE (type
) == ARRAY_TYPE
)
2958 m
= cp_build_binary_op (MULT_EXPR
, m
,
2959 array_type_nelts_total (type
));
2960 type
= strip_array_types (type
);
2963 finish_compound_stmt (/*has_no_scope=*/1, try_body
);
2964 finish_cleanup_try_block (try_block
);
2965 e
= build_vec_delete_1 (rval
, m
,
2967 sfk_base_destructor
,
2968 /*use_global_delete=*/0);
2969 finish_cleanup (e
, try_block
);
2972 /* The value of the array initialization is the address of the
2973 first element in the array. */
2974 finish_expr_stmt (rval
);
2976 stmt_expr
= finish_init_stmts (stmt_expr
, compound_stmt
);
2977 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
2981 /* Free up storage of type TYPE, at address ADDR.
2983 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2986 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2987 used as the second argument to operator delete. It can include
2988 things like padding and magic size cookies. It has virtual in it,
2989 because if you have a base pointer and you delete through a virtual
2990 destructor, it should be the size of the dynamic object, not the
2991 static object, see Free Store 12.5 ISO C++.
2993 This does not call any destructors. */
2996 build_x_delete (addr
, which_delete
, virtual_size
)
3001 int use_global_delete
= which_delete
& 1;
3002 int use_vec_delete
= !!(which_delete
& 2);
3003 enum tree_code code
= use_vec_delete
? VEC_DELETE_EXPR
: DELETE_EXPR
;
3004 int flags
= LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
);
3006 return build_op_delete_call (code
, addr
, virtual_size
, flags
, NULL_TREE
);
3009 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3013 build_dtor_call (exp
, dtor_kind
, flags
)
3015 special_function_kind dtor_kind
;
3022 case sfk_complete_destructor
:
3023 name
= complete_dtor_identifier
;
3026 case sfk_base_destructor
:
3027 name
= base_dtor_identifier
;
3030 case sfk_deleting_destructor
:
3031 name
= deleting_dtor_identifier
;
3037 return build_method_call (exp
, name
, NULL_TREE
,
3038 TYPE_BINFO (TREE_TYPE (exp
)), flags
);
3041 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3042 ADDR is an expression which yields the store to be destroyed.
3043 AUTO_DELETE is the name of the destructor to call, i.e., either
3044 sfk_complete_destructor, sfk_base_destructor, or
3045 sfk_deleting_destructor.
3047 FLAGS is the logical disjunction of zero or more LOOKUP_
3048 flags. See cp-tree.h for more info. */
3051 build_delete (type
, addr
, auto_delete
, flags
, use_global_delete
)
3053 special_function_kind auto_delete
;
3055 int use_global_delete
;
3059 if (addr
== error_mark_node
)
3060 return error_mark_node
;
3062 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3063 set to `error_mark_node' before it gets properly cleaned up. */
3064 if (type
== error_mark_node
)
3065 return error_mark_node
;
3067 type
= TYPE_MAIN_VARIANT (type
);
3069 if (TREE_CODE (type
) == POINTER_TYPE
)
3071 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3072 if (TREE_CODE (type
) == ARRAY_TYPE
)
3075 if (VOID_TYPE_P (type
)
3076 /* We don't want to warn about delete of void*, only other
3077 incomplete types. Deleting other incomplete types
3078 invokes undefined behavior, but it is not ill-formed, so
3079 compile to something that would even do The Right Thing
3080 (TM) should the type have a trivial dtor and no delete
3082 || !complete_type_or_diagnostic (type
, addr
, 1)
3083 || !IS_AGGR_TYPE (type
))
3085 /* Call the builtin operator delete. */
3086 return build_builtin_delete_call (addr
);
3088 if (TREE_SIDE_EFFECTS (addr
))
3089 addr
= save_expr (addr
);
3091 /* throw away const and volatile on target type of addr */
3092 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3094 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3098 if (TYPE_DOMAIN (type
) == NULL_TREE
)
3100 error ("unknown array size in delete");
3101 return error_mark_node
;
3103 return build_vec_delete (addr
, array_type_nelts (type
),
3104 auto_delete
, use_global_delete
);
3108 /* Don't check PROTECT here; leave that decision to the
3109 destructor. If the destructor is accessible, call it,
3110 else report error. */
3111 addr
= build_unary_op (ADDR_EXPR
, addr
, 0);
3112 if (TREE_SIDE_EFFECTS (addr
))
3113 addr
= save_expr (addr
);
3115 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3118 my_friendly_assert (IS_AGGR_TYPE (type
), 220);
3120 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
3122 if (auto_delete
!= sfk_deleting_destructor
)
3123 return void_zero_node
;
3125 return build_op_delete_call
3126 (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
),
3127 LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
),
3132 tree do_delete
= NULL_TREE
;
3135 my_friendly_assert (TYPE_HAS_DESTRUCTOR (type
), 20011213);
3137 /* For `::delete x', we must not use the deleting destructor
3138 since then we would not be sure to get the global `operator
3140 if (use_global_delete
&& auto_delete
== sfk_deleting_destructor
)
3142 /* We will use ADDR multiple times so we must save it. */
3143 addr
= save_expr (addr
);
3144 /* Delete the object. */
3145 do_delete
= build_builtin_delete_call (addr
);
3146 /* Otherwise, treat this like a complete object destructor
3148 auto_delete
= sfk_complete_destructor
;
3150 /* If the destructor is non-virtual, there is no deleting
3151 variant. Instead, we must explicitly call the appropriate
3152 `operator delete' here. */
3153 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type
))
3154 && auto_delete
== sfk_deleting_destructor
)
3156 /* We will use ADDR multiple times so we must save it. */
3157 addr
= save_expr (addr
);
3158 /* Build the call. */
3159 do_delete
= build_op_delete_call (DELETE_EXPR
,
3161 cxx_sizeof_nowarn (type
),
3164 /* Call the complete object destructor. */
3165 auto_delete
= sfk_complete_destructor
;
3167 else if (auto_delete
== sfk_deleting_destructor
3168 && TYPE_GETS_REG_DELETE (type
))
3170 /* Make sure we have access to the member op delete, even though
3171 we'll actually be calling it from the destructor. */
3172 build_op_delete_call (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
),
3173 LOOKUP_NORMAL
, NULL_TREE
);
3176 expr
= build_dtor_call (build_indirect_ref (addr
, NULL
),
3177 auto_delete
, flags
);
3179 expr
= build (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
3181 if (flags
& LOOKUP_DESTRUCTOR
)
3182 /* Explicit destructor call; don't check for null pointer. */
3183 ifexp
= integer_one_node
;
3185 /* Handle deleting a null pointer. */
3186 ifexp
= fold (cp_build_binary_op (NE_EXPR
, addr
, integer_zero_node
));
3188 if (ifexp
!= integer_one_node
)
3189 expr
= build (COND_EXPR
, void_type_node
,
3190 ifexp
, expr
, void_zero_node
);
3196 /* At the beginning of a destructor, push cleanups that will call the
3197 destructors for our base classes and members.
3199 Called from begin_destructor_body. */
3202 push_base_cleanups ()
3205 int i
, n_baseclasses
;
3209 /* Run destructors for all virtual baseclasses. */
3210 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
3213 tree cond
= (condition_conversion
3214 (build (BIT_AND_EXPR
, integer_type_node
,
3215 current_in_charge_parm
,
3216 integer_two_node
)));
3218 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
3219 /* The CLASSTYPE_VBASECLASSES list is in initialization
3220 order, which is also the right order for pushing cleanups. */
3222 vbases
= TREE_CHAIN (vbases
))
3224 tree vbase
= TREE_VALUE (vbases
);
3225 tree base_type
= BINFO_TYPE (vbase
);
3227 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
3229 expr
= build_special_member_call (current_class_ref
,
3230 base_dtor_identifier
,
3234 | LOOKUP_NONVIRTUAL
));
3235 expr
= build (COND_EXPR
, void_type_node
, cond
,
3236 expr
, void_zero_node
);
3237 finish_decl_cleanup (NULL_TREE
, expr
);
3242 binfos
= BINFO_BASETYPES (TYPE_BINFO (current_class_type
));
3243 n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
3245 /* Take care of the remaining baseclasses. */
3246 for (i
= 0; i
< n_baseclasses
; i
++)
3248 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
3249 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
))
3250 || TREE_VIA_VIRTUAL (base_binfo
))
3253 expr
= build_special_member_call (current_class_ref
,
3254 base_dtor_identifier
,
3255 NULL_TREE
, base_binfo
,
3256 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
);
3257 finish_decl_cleanup (NULL_TREE
, expr
);
3260 for (member
= TYPE_FIELDS (current_class_type
); member
;
3261 member
= TREE_CHAIN (member
))
3263 if (TREE_CODE (member
) != FIELD_DECL
|| DECL_ARTIFICIAL (member
))
3265 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member
)))
3267 tree this_member
= (build_class_member_access_expr
3268 (current_class_ref
, member
,
3269 /*access_path=*/NULL_TREE
,
3270 /*preserve_reference=*/false));
3271 tree this_type
= TREE_TYPE (member
);
3272 expr
= build_delete (this_type
, this_member
,
3273 sfk_complete_destructor
,
3274 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
3276 finish_decl_cleanup (NULL_TREE
, expr
);
3281 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3284 build_vbase_delete (type
, decl
)
3287 tree vbases
= CLASSTYPE_VBASECLASSES (type
);
3288 tree result
= NULL_TREE
;
3289 tree addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
3291 my_friendly_assert (addr
!= error_mark_node
, 222);
3296 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases
))),
3298 result
= tree_cons (NULL_TREE
,
3299 build_delete (TREE_TYPE (this_addr
), this_addr
,
3300 sfk_base_destructor
,
3301 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0),
3303 vbases
= TREE_CHAIN (vbases
);
3305 return build_compound_expr (nreverse (result
));
3308 /* Build a C++ vector delete expression.
3309 MAXINDEX is the number of elements to be deleted.
3310 ELT_SIZE is the nominal size of each element in the vector.
3311 BASE is the expression that should yield the store to be deleted.
3312 This function expands (or synthesizes) these calls itself.
3313 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3315 This also calls delete for virtual baseclasses of elements of the vector.
3317 Update: MAXINDEX is no longer needed. The size can be extracted from the
3318 start of the vector for pointers, and from the type for arrays. We still
3319 use MAXINDEX for arrays because it happens to already have one of the
3320 values we'd have to extract. (We could use MAXINDEX with pointers to
3321 confirm the size, and trap if the numbers differ; not clear that it'd
3322 be worth bothering.) */
3325 build_vec_delete (base
, maxindex
, auto_delete_vec
, use_global_delete
)
3326 tree base
, maxindex
;
3327 special_function_kind auto_delete_vec
;
3328 int use_global_delete
;
3332 if (TREE_CODE (base
) == OFFSET_REF
)
3333 base
= resolve_offset_ref (base
);
3335 type
= TREE_TYPE (base
);
3337 base
= stabilize_reference (base
);
3339 if (TREE_CODE (type
) == POINTER_TYPE
)
3341 /* Step back one from start of vector, and read dimension. */
3344 if (TREE_SIDE_EFFECTS (base
))
3345 base
= save_expr (base
);
3346 type
= strip_array_types (TREE_TYPE (type
));
3347 cookie_addr
= build (MINUS_EXPR
,
3348 build_pointer_type (sizetype
),
3350 TYPE_SIZE_UNIT (sizetype
));
3351 maxindex
= build_indirect_ref (cookie_addr
, NULL
);
3353 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3355 /* get the total number of things in the array, maxindex is a bad name */
3356 maxindex
= array_type_nelts_total (type
);
3357 type
= strip_array_types (type
);
3358 base
= build_unary_op (ADDR_EXPR
, base
, 1);
3359 if (TREE_SIDE_EFFECTS (base
))
3360 base
= save_expr (base
);
3364 if (base
!= error_mark_node
)
3365 error ("type to vector delete is neither pointer or array type");
3366 return error_mark_node
;
3369 return build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
,