1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 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 expand_aggr_vbase_init_1
PARAMS ((tree
, tree
, tree
, tree
));
38 static void construct_virtual_bases
PARAMS ((tree
, tree
, tree
, tree
, tree
));
39 static void expand_aggr_init_1
PARAMS ((tree
, tree
, tree
, tree
, int));
40 static void expand_default_init
PARAMS ((tree
, tree
, tree
, tree
, int));
41 static tree build_vec_delete_1
PARAMS ((tree
, tree
, tree
, special_function_kind
, int));
42 static void perform_member_init
PARAMS ((tree
, tree
, int));
43 static void sort_base_init
PARAMS ((tree
, tree
, tree
*, tree
*));
44 static tree build_builtin_delete_call
PARAMS ((tree
));
45 static int member_init_ok_or_else
PARAMS ((tree
, tree
, const char *));
46 static void expand_virtual_init
PARAMS ((tree
, tree
));
47 static tree sort_member_init
PARAMS ((tree
, tree
));
48 static tree initializing_context
PARAMS ((tree
));
49 static void expand_cleanup_for_base
PARAMS ((tree
, tree
));
50 static tree get_temp_regvar
PARAMS ((tree
, tree
));
51 static tree dfs_initialize_vtbl_ptrs
PARAMS ((tree
, void *));
52 static tree build_default_init
PARAMS ((tree
));
53 static tree build_new_1
PARAMS ((tree
));
54 static tree get_cookie_size
PARAMS ((tree
));
55 static tree build_dtor_call
PARAMS ((tree
, special_function_kind
, int));
56 static tree build_field_list
PARAMS ((tree
, tree
, int *));
57 static tree build_vtbl_address
PARAMS ((tree
));
59 /* Set up local variable for this file. MUST BE CALLED AFTER
60 INIT_DECL_PROCESSING. */
62 static tree BI_header_type
;
64 void init_init_processing ()
68 /* Define the structure that holds header information for
69 arrays allocated via operator new. */
70 BI_header_type
= make_aggr_type (RECORD_TYPE
);
71 fields
[0] = build_decl (FIELD_DECL
, nelts_identifier
, sizetype
);
73 finish_builtin_type (BI_header_type
, "__new_cookie", fields
,
76 ggc_add_tree_root (&BI_header_type
, 1);
79 /* We are about to generate some complex initialization code.
80 Conceptually, it is all a single expression. However, we may want
81 to include conditionals, loops, and other such statement-level
82 constructs. Therefore, we build the initialization code inside a
83 statement-expression. This function starts such an expression.
84 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
85 pass them back to finish_init_stmts when the expression is
89 begin_init_stmts (stmt_expr_p
, compound_stmt_p
)
91 tree
*compound_stmt_p
;
93 if (building_stmt_tree ())
94 *stmt_expr_p
= begin_stmt_expr ();
96 *stmt_expr_p
= begin_global_stmt_expr ();
98 if (building_stmt_tree ())
99 *compound_stmt_p
= begin_compound_stmt (/*has_no_scope=*/1);
102 *compound_stmt_p = genrtl_begin_compound_stmt (has_no_scope=1);
106 /* Finish out the statement-expression begun by the previous call to
107 begin_init_stmts. Returns the statement-expression itself. */
110 finish_init_stmts (stmt_expr
, compound_stmt
)
115 if (building_stmt_tree ())
116 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt
);
118 if (building_stmt_tree ())
119 stmt_expr
= finish_stmt_expr (stmt_expr
);
121 stmt_expr
= finish_global_stmt_expr (stmt_expr
);
123 /* To avoid spurious warnings about unused values, we set
126 TREE_USED (stmt_expr
) = 1;
133 /* Called from initialize_vtbl_ptrs via dfs_walk. */
136 dfs_initialize_vtbl_ptrs (binfo
, data
)
140 if (!BINFO_PRIMARY_MARKED_P (binfo
)
141 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo
)))
143 tree base_ptr
= TREE_VALUE ((tree
) data
);
145 if (TREE_VIA_VIRTUAL (binfo
))
146 base_ptr
= convert_pointer_to_vbase (BINFO_TYPE (binfo
),
150 = build_vbase_path (PLUS_EXPR
,
151 build_pointer_type (BINFO_TYPE (binfo
)),
156 expand_virtual_init (binfo
, base_ptr
);
159 SET_BINFO_MARKED (binfo
);
164 /* Initialize all the vtable pointers in the object pointed to by
168 initialize_vtbl_ptrs (addr
)
174 type
= TREE_TYPE (TREE_TYPE (addr
));
175 list
= build_tree_list (type
, addr
);
177 /* Walk through the hierarchy, initializing the vptr in each base
178 class. We do these in pre-order because under the new ABI we
179 can't find the virtual bases for a class until we've initialized
180 the vtbl for that class. */
181 dfs_walk_real (TYPE_BINFO (type
), dfs_initialize_vtbl_ptrs
,
182 NULL
, dfs_unmarked_real_bases_queue_p
, list
);
183 dfs_walk (TYPE_BINFO (type
), dfs_unmark
,
184 dfs_marked_real_bases_queue_p
, type
);
186 /* If we're not using thunks, we may need to adjust the deltas in
187 the vtable to handle virtual base classes correctly. When we are
188 using thunks, we either use construction vtables (which are
189 preloaded with the right answers) or nothing (in which case
190 vitual function calls sometimes don't work right.) */
191 if (TYPE_USES_VIRTUAL_BASECLASSES (type
) && !flag_vtable_thunks
)
192 fixup_all_virtual_upcast_offsets (addr
);
197 To default-initialize an object of type T means:
199 --if T is a non-POD class type (clause _class_), the default construc-
200 tor for T is called (and the initialization is ill-formed if T has
201 no accessible default constructor);
203 --if T is an array type, each element is default-initialized;
205 --otherwise, the storage for the object is zero-initialized.
207 A program that calls for default-initialization of an entity of refer-
208 ence type is ill-formed. */
211 build_default_init (type
)
214 tree init
= NULL_TREE
;
216 if (TYPE_NEEDS_CONSTRUCTING (type
))
217 /* Other code will handle running the default constructor. We can't do
218 anything with a CONSTRUCTOR for arrays here, as that would imply
219 copy-initialization. */
221 else if (AGGREGATE_TYPE_P (type
))
223 /* This is a default initialization of an aggregate, but not one of
224 non-POD class type. We cleverly notice that the initialization
225 rules in such a case are the same as for initialization with an
226 empty brace-initialization list. */
227 init
= build (CONSTRUCTOR
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
229 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
230 /* --if T is a reference type, no initialization is performed. */
234 init
= integer_zero_node
;
236 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
237 /* We must make enumeral types the right type. */
238 init
= fold (build1 (NOP_EXPR
, type
, init
));
241 init
= digest_init (type
, init
, 0);
245 /* Subroutine of emit_base_init. */
248 perform_member_init (member
, init
, explicit)
253 tree type
= TREE_TYPE (member
);
255 decl
= build_component_ref (current_class_ref
, member
, NULL_TREE
, explicit);
257 if (decl
== error_mark_node
)
260 /* Deal with this here, as we will get confused if we try to call the
261 assignment op for an anonymous union. This can happen in a
262 synthesized copy constructor. */
263 if (ANON_AGGR_TYPE_P (type
))
267 init
= build (INIT_EXPR
, type
, decl
, TREE_VALUE (init
));
268 finish_expr_stmt (init
);
271 else if (TYPE_NEEDS_CONSTRUCTING (type
)
272 || (init
&& TYPE_HAS_CONSTRUCTOR (type
)))
274 /* Since `init' is already a TREE_LIST on the member_init_list,
275 only build it into one if we aren't already a list. */
276 if (init
!= NULL_TREE
&& TREE_CODE (init
) != TREE_LIST
)
277 init
= build_tree_list (NULL_TREE
, init
);
280 && TREE_CODE (type
) == ARRAY_TYPE
282 && TREE_CHAIN (init
) == NULL_TREE
283 && TREE_CODE (TREE_TYPE (TREE_VALUE (init
))) == ARRAY_TYPE
)
285 /* Initialization of one array from another. */
286 finish_expr_stmt (build_vec_init (decl
, TREE_VALUE (init
), 1));
289 finish_expr_stmt (build_aggr_init (decl
, init
, 0));
293 if (init
== NULL_TREE
)
297 init
= build_default_init (type
);
298 if (TREE_CODE (type
) == REFERENCE_TYPE
)
300 ("default-initialization of `%#D', which has reference type",
303 /* member traversal: note it leaves init NULL */
304 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
305 cp_pedwarn ("uninitialized reference member `%D'", member
);
307 else if (TREE_CODE (init
) == TREE_LIST
)
309 /* There was an explicit member initialization. Do some
310 work in that case. */
311 if (TREE_CHAIN (init
))
313 warning ("initializer list treated as compound expression");
314 init
= build_compound_expr (init
);
317 init
= TREE_VALUE (init
);
321 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
324 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
328 expr
= build_component_ref (current_class_ref
, member
, NULL_TREE
,
330 expr
= build_delete (type
, expr
, sfk_complete_destructor
,
331 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
333 if (expr
!= error_mark_node
)
334 finish_subobject (expr
);
338 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
339 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
342 build_field_list (t
, list
, uses_unions_p
)
349 /* Note whether or not T is a union. */
350 if (TREE_CODE (t
) == UNION_TYPE
)
353 for (fields
= TYPE_FIELDS (t
); fields
; fields
= TREE_CHAIN (fields
))
355 /* Skip CONST_DECLs for enumeration constants and so forth. */
356 if (TREE_CODE (fields
) != FIELD_DECL
)
359 /* Keep track of whether or not any fields are unions. */
360 if (TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
363 /* For an anonymous struct or union, we must recursively
364 consider the fields of the anonymous type. They can be
365 directly initialized from the constructor. */
366 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
368 /* Add this field itself. Synthesized copy constructors
369 initialize the entire aggregate. */
370 list
= tree_cons (fields
, NULL_TREE
, list
);
371 /* And now add the fields in the anonymous aggregate. */
372 list
= build_field_list (TREE_TYPE (fields
), list
,
375 /* Add this field. */
376 else if (DECL_NAME (fields
))
377 list
= tree_cons (fields
, NULL_TREE
, list
);
383 /* The MEMBER_INIT_LIST is a TREE_LIST. The TREE_PURPOSE of each list
384 gives a FIELD_DECL in T that needs initialization. The TREE_VALUE
385 gives the initializer, or list of initializer arguments. Sort the
386 MEMBER_INIT_LIST, returning a version that contains the same
387 information but in the order that the fields should actually be
388 initialized. Perform error-checking in the process. */
391 sort_member_init (t
, member_init_list
)
393 tree member_init_list
;
400 /* Build up a list of the various fields, in sorted order. */
401 init_list
= nreverse (build_field_list (t
, NULL_TREE
, &uses_unions_p
));
403 /* Go through the explicit initializers, adding them to the
405 last_field
= init_list
;
406 for (init
= member_init_list
; init
; init
= TREE_CHAIN (init
))
409 tree initialized_field
;
411 initialized_field
= TREE_PURPOSE (init
);
412 my_friendly_assert (TREE_CODE (initialized_field
) == FIELD_DECL
,
415 /* If the explicit initializers are in sorted order, then the
416 INITIALIZED_FIELD will be for a field following the
418 for (f
= last_field
; f
; f
= TREE_CHAIN (f
))
419 if (TREE_PURPOSE (f
) == initialized_field
)
422 /* Give a warning, if appropriate. */
423 if (warn_reorder
&& !f
)
425 cp_warning_at ("member initializers for `%#D'",
426 TREE_PURPOSE (last_field
));
427 cp_warning_at (" and `%#D'", initialized_field
);
428 warning (" will be re-ordered to match declaration order");
431 /* Look again, from the beginning of the list. We must find the
432 field on this loop. */
436 while (TREE_PURPOSE (f
) != initialized_field
)
440 /* If there was already an explicit initializer for this field,
443 cp_error ("multiple initializations given for member `%D'",
447 /* Mark the field as explicitly initialized. */
448 TREE_TYPE (f
) = error_mark_node
;
449 /* And insert the initializer. */
450 TREE_VALUE (f
) = TREE_VALUE (init
);
453 /* Remember the location of the last explicitly initialized
460 If a ctor-initializer specifies more than one mem-initializer for
461 multiple members of the same union (including members of
462 anonymous unions), the ctor-initializer is ill-formed. */
465 last_field
= NULL_TREE
;
466 for (init
= init_list
; init
; init
= TREE_CHAIN (init
))
472 /* Skip uninitialized members. */
473 if (!TREE_TYPE (init
))
475 /* See if this field is a member of a union, or a member of a
476 structure contained in a union, etc. */
477 field
= TREE_PURPOSE (init
);
478 for (field_type
= DECL_CONTEXT (field
);
479 !same_type_p (field_type
, t
);
480 field_type
= TYPE_CONTEXT (field_type
))
481 if (TREE_CODE (field_type
) == UNION_TYPE
)
483 /* If this field is not a member of a union, skip it. */
484 if (TREE_CODE (field_type
) != UNION_TYPE
)
487 /* It's only an error if we have two initializers for the same
495 /* See if LAST_FIELD and the field initialized by INIT are
496 members of the same union. If so, there's a problem,
497 unless they're actually members of the same structure
498 which is itself a member of a union. For example, given:
500 union { struct { int i; int j; }; };
502 initializing both `i' and `j' makes sense. */
503 field_type
= DECL_CONTEXT (field
);
507 tree last_field_type
;
509 last_field_type
= DECL_CONTEXT (last_field
);
512 if (same_type_p (last_field_type
, field_type
))
514 if (TREE_CODE (field_type
) == UNION_TYPE
)
515 cp_error ("initializations for multiple members of `%T'",
521 if (same_type_p (last_field_type
, t
))
524 last_field_type
= TYPE_CONTEXT (last_field_type
);
527 /* If we've reached the outermost class, then we're
529 if (same_type_p (field_type
, t
))
532 field_type
= TYPE_CONTEXT (field_type
);
543 /* Like sort_member_init, but used for initializers of base classes.
544 *RBASE_PTR is filled in with the initializers for non-virtual bases;
545 vbase_ptr gets the virtual bases. */
548 sort_base_init (t
, base_init_list
, rbase_ptr
, vbase_ptr
)
551 tree
*rbase_ptr
, *vbase_ptr
;
553 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (t
));
554 int n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
560 /* For warn_reorder. */
562 tree last_base
= NULL_TREE
;
564 tree rbases
= NULL_TREE
;
565 tree vbases
= NULL_TREE
;
567 /* First walk through and splice out vbase and invalid initializers.
568 Also replace names with binfos. */
570 last
= tree_cons (NULL_TREE
, NULL_TREE
, base_init_list
);
571 for (x
= TREE_CHAIN (last
); x
; x
= TREE_CHAIN (x
))
573 tree basetype
= TREE_PURPOSE (x
);
574 tree binfo
= NULL_TREE
;
576 if (basetype
== NULL_TREE
)
578 /* Initializer for single base class. Must not
579 use multiple inheritance or this is ambiguous. */
580 switch (n_baseclasses
)
583 cp_error ("`%T' does not have a base class to initialize",
589 cp_error ("unnamed initializer ambiguous for `%T' which uses multiple inheritance",
593 binfo
= TREE_VEC_ELT (binfos
, 0);
595 else if (is_aggr_type (basetype
, 1))
597 binfo
= binfo_or_else (basetype
, t
);
598 if (binfo
== NULL_TREE
)
601 /* Virtual base classes are special cases. Their initializers
602 are recorded with this constructor, and they are used when
603 this constructor is the top-level constructor called. */
604 if (TREE_VIA_VIRTUAL (binfo
))
606 tree v
= binfo_for_vbase (BINFO_TYPE (binfo
), t
);
607 vbases
= tree_cons (v
, TREE_VALUE (x
), vbases
);
612 /* Otherwise, if it is not an immediate base class, complain. */
613 for (i
= n_baseclasses
-1; i
>= 0; i
--)
614 if (BINFO_TYPE (binfo
) == BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)))
618 cp_error ("`%T' is not an immediate base class of `%T'",
619 basetype
, current_class_type
);
625 my_friendly_abort (365);
627 TREE_PURPOSE (x
) = binfo
;
628 TREE_CHAIN (last
) = x
;
631 TREE_CHAIN (last
) = NULL_TREE
;
633 /* Now walk through our regular bases and make sure they're initialized. */
635 for (i
= 0; i
< n_baseclasses
; ++i
)
637 /* The base for which we're currently initializing. */
638 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
639 /* The initializer for BASE_BINFO. */
643 if (TREE_VIA_VIRTUAL (base_binfo
))
646 /* We haven't found the BASE_BINFO yet. */
648 /* Loop through all the explicitly initialized bases, looking
649 for an appropriate initializer. */
650 for (x
= base_init_list
, pos
= 0; x
; x
= TREE_CHAIN (x
), ++pos
)
652 tree binfo
= TREE_PURPOSE (x
);
654 if (binfo
== base_binfo
&& !init
)
660 cp_warning_at ("base initializers for `%#T'", last_base
);
661 cp_warning_at (" and `%#T'", BINFO_TYPE (binfo
));
662 warning (" will be re-ordered to match inheritance order");
665 last_base
= BINFO_TYPE (binfo
);
668 /* Make sure we won't try to work on this init again. */
669 TREE_PURPOSE (x
) = NULL_TREE
;
670 init
= build_tree_list (binfo
, TREE_VALUE (x
));
672 else if (binfo
== base_binfo
)
674 cp_error ("base class `%T' already initialized",
680 /* If we didn't find BASE_BINFO in the list, create a dummy entry
681 so the two lists (RBASES and the list of bases) will be
684 init
= build_tree_list (NULL_TREE
, NULL_TREE
);
685 rbases
= chainon (rbases
, init
);
692 /* Perform whatever initializations have yet to be done on the base
693 class, and non-static data members, of the CURRENT_CLASS_TYPE.
694 These actions are given by the BASE_INIT_LIST and MEM_INIT_LIST,
697 If there is a need for a call to a constructor, we must surround
698 that call with a pushlevel/poplevel pair, since we are technically
699 at the PARM level of scope.
701 Note that emit_base_init does *not* initialize virtual base
702 classes. That is done specially, elsewhere. */
705 emit_base_init (mem_init_list
, base_init_list
)
710 tree rbase_init_list
, vbase_init_list
;
711 tree t
= current_class_type
;
712 tree t_binfo
= TYPE_BINFO (t
);
713 tree binfos
= BINFO_BASETYPES (t_binfo
);
715 int n_baseclasses
= BINFO_N_BASETYPES (t_binfo
);
717 mem_init_list
= sort_member_init (t
, mem_init_list
);
718 sort_base_init (t
, base_init_list
, &rbase_init_list
, &vbase_init_list
);
720 /* First, initialize the virtual base classes, if we are
721 constructing the most-derived object. */
722 if (TYPE_USES_VIRTUAL_BASECLASSES (t
))
724 tree first_arg
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
725 construct_virtual_bases (t
, current_class_ref
, current_class_ptr
,
726 vbase_init_list
, first_arg
);
729 /* Now, perform initialization of non-virtual base classes. */
730 for (i
= 0; i
< n_baseclasses
; i
++)
732 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
733 tree init
= void_list_node
;
735 if (TREE_VIA_VIRTUAL (base_binfo
))
738 my_friendly_assert (BINFO_INHERITANCE_CHAIN (base_binfo
) == t_binfo
,
741 if (TREE_PURPOSE (rbase_init_list
))
742 init
= TREE_VALUE (rbase_init_list
);
743 else if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo
)))
747 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
))
748 cp_warning ("base class `%#T' should be explicitly initialized in the copy constructor",
749 BINFO_TYPE (base_binfo
));
752 if (init
!= void_list_node
)
754 member
= convert_pointer_to_real (base_binfo
, current_class_ptr
);
755 expand_aggr_init_1 (base_binfo
, NULL_TREE
,
756 build_indirect_ref (member
, NULL_PTR
), init
,
760 expand_cleanup_for_base (base_binfo
, NULL_TREE
);
761 rbase_init_list
= TREE_CHAIN (rbase_init_list
);
764 /* Initialize the vtable pointers for the class. */
765 initialize_vtbl_ptrs (current_class_ptr
);
767 while (mem_init_list
)
773 member
= TREE_PURPOSE (mem_init_list
);
775 /* See if we had a user-specified member initialization. */
776 if (TREE_TYPE (mem_init_list
))
778 init
= TREE_VALUE (mem_init_list
);
783 init
= DECL_INITIAL (member
);
786 /* Effective C++ rule 12. */
787 if (warn_ecpp
&& init
== NULL_TREE
788 && !DECL_ARTIFICIAL (member
)
789 && TREE_CODE (TREE_TYPE (member
)) != ARRAY_TYPE
)
790 cp_warning ("`%D' should be initialized in the member initialization list", member
);
793 perform_member_init (member
, init
, from_init_list
);
794 mem_init_list
= TREE_CHAIN (mem_init_list
);
798 /* Returns the address of the vtable (i.e., the value that should be
799 assigned to the vptr) for BINFO. */
802 build_vtbl_address (binfo
)
807 /* Figure out what vtable BINFO's vtable is based on, and mark it as
809 vtbl
= get_vtbl_decl_for_binfo (binfo
);
810 assemble_external (vtbl
);
811 TREE_USED (vtbl
) = 1;
813 /* Now compute the address to use when initializing the vptr. */
814 vtbl
= BINFO_VTABLE (binfo
);
815 if (TREE_CODE (vtbl
) == VAR_DECL
)
817 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
818 TREE_CONSTANT (vtbl
) = 1;
824 /* This code sets up the virtual function tables appropriate for
825 the pointer DECL. It is a one-ply initialization.
827 BINFO is the exact type that DECL is supposed to be. In
828 multiple inheritance, this might mean "C's A" if C : A, B. */
831 expand_virtual_init (binfo
, decl
)
834 tree type
= BINFO_TYPE (binfo
);
836 tree vtype
, vtype_binfo
;
839 /* Compute the location of the vtable. */
840 vtype
= DECL_CONTEXT (TYPE_VFIELD (type
));
841 vtype_binfo
= get_binfo (vtype
, TREE_TYPE (TREE_TYPE (decl
)), 0);
843 /* Compute the initializer for vptr. */
844 vtbl
= build_vtbl_address (binfo
);
846 /* Under the new ABI, we may get this vptr from a VTT, if this is a
847 subobject constructor or subobject destructor. */
848 vtt_index
= BINFO_VPTR_INDEX (binfo
);
854 /* Compute the value to use, when there's a VTT. */
855 vtt_parm
= DECL_VTT_PARM (current_function_decl
);
856 vtbl2
= build (PLUS_EXPR
,
857 TREE_TYPE (vtt_parm
),
860 vtbl2
= build1 (INDIRECT_REF
, TREE_TYPE (vtbl
), vtbl2
);
862 /* The actual initializer is the VTT value only in the subobject
863 constructor. In maybe_clone_body we'll substitute NULL for
864 the vtt_parm in the case of the non-subobject constructor. */
865 vtbl
= build (COND_EXPR
,
867 DECL_USE_VTT_PARM (current_function_decl
),
872 /* Compute the location of the vtpr. */
873 decl
= convert_pointer_to_real (vtype_binfo
, decl
);
874 vtbl_ptr
= build_vfield_ref (build_indirect_ref (decl
, NULL_PTR
), vtype
);
875 if (vtbl_ptr
== error_mark_node
)
878 /* Assign the vtable to the vptr. */
879 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
880 finish_expr_stmt (build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
));
883 /* If an exception is thrown in a constructor, those base classes already
884 constructed must be destroyed. This function creates the cleanup
885 for BINFO, which has just been constructed. If FLAG is non-NULL,
886 it is a DECL which is non-zero when this base needs to be
890 expand_cleanup_for_base (binfo
, flag
)
896 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
899 /* Call the destructor. */
900 expr
= (build_scoped_method_call
901 (current_class_ref
, binfo
, base_dtor_identifier
, NULL_TREE
));
903 expr
= fold (build (COND_EXPR
, void_type_node
,
904 truthvalue_conversion (flag
),
905 expr
, integer_zero_node
));
907 finish_subobject (expr
);
910 /* Subroutine of `expand_aggr_vbase_init'.
911 BINFO is the binfo of the type that is being initialized.
912 INIT_LIST is the list of initializers for the virtual baseclass. */
915 expand_aggr_vbase_init_1 (binfo
, exp
, addr
, init_list
)
916 tree binfo
, exp
, addr
, init_list
;
918 tree init
= purpose_member (binfo
, init_list
);
919 tree ref
= build_indirect_ref (addr
, NULL_PTR
);
922 init
= TREE_VALUE (init
);
923 /* Call constructors, but don't set up vtables. */
924 expand_aggr_init_1 (binfo
, exp
, ref
, init
, LOOKUP_COMPLAIN
);
927 /* Construct the virtual base-classes of THIS_REF (whose address is
928 THIS_PTR). The object has the indicated TYPE. The construction
929 actually takes place only if FLAG is non-zero. INIT_LIST is list
930 of initializations for constructors to perform. */
933 construct_virtual_bases (type
, this_ref
, this_ptr
, init_list
, flag
)
942 /* If there are no virtual baseclasses, we shouldn't even be here. */
943 my_friendly_assert (TYPE_USES_VIRTUAL_BASECLASSES (type
), 19990621);
945 /* First set the pointers in our object that tell us where to find
946 our virtual baseclasses. */
947 if (!vbase_offsets_in_vtable_p ())
952 if_stmt
= begin_if_stmt ();
953 finish_if_stmt_cond (flag
, if_stmt
);
954 result
= init_vbase_pointers (type
, this_ptr
);
956 finish_expr_stmt (build_compound_expr (result
));
957 finish_then_clause (if_stmt
);
961 /* Now, run through the baseclasses, initializing each. */
962 for (vbases
= CLASSTYPE_VBASECLASSES (type
); vbases
;
963 vbases
= TREE_CHAIN (vbases
))
970 /* If there are virtual base classes with destructors, we need to
971 emit cleanups to destroy them if an exception is thrown during
972 the construction process. These exception regions (i.e., the
973 period during which the cleanups must occur) begin from the time
974 the construction is complete to the end of the function. If we
975 create a conditional block in which to initialize the
976 base-classes, then the cleanup region for the virtual base begins
977 inside a block, and ends outside of that block. This situation
978 confuses the sjlj exception-handling code. Therefore, we do not
979 create a single conditional block, but one for each
980 initialization. (That way the cleanup regions always begin
981 in the outer block.) We trust the back-end to figure out
982 that the FLAG will not change across initializations, and
983 avoid doing multiple tests. */
984 inner_if_stmt
= begin_if_stmt ();
985 finish_if_stmt_cond (flag
, inner_if_stmt
);
986 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/1);
988 /* Compute the location of the virtual base. If we're
989 constructing virtual bases, then we must be the most derived
990 class. Therefore, we don't have to look up the virtual base;
991 we already know where it is. */
992 vbase
= TREE_VALUE (vbases
);
993 exp
= build (PLUS_EXPR
,
994 TREE_TYPE (this_ptr
),
996 fold (build1 (NOP_EXPR
, TREE_TYPE (this_ptr
),
997 BINFO_OFFSET (vbase
))));
998 exp
= build1 (NOP_EXPR
,
999 build_pointer_type (BINFO_TYPE (vbase
)),
1002 expand_aggr_vbase_init_1 (vbase
, this_ref
, exp
, init_list
);
1003 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt
);
1004 finish_then_clause (inner_if_stmt
);
1007 expand_cleanup_for_base (vbase
, flag
);
1011 /* Find the context in which this FIELD can be initialized. */
1014 initializing_context (field
)
1017 tree t
= DECL_CONTEXT (field
);
1019 /* Anonymous union members can be initialized in the first enclosing
1020 non-anonymous union context. */
1021 while (t
&& ANON_AGGR_TYPE_P (t
))
1022 t
= TYPE_CONTEXT (t
);
1026 /* Function to give error message if member initialization specification
1027 is erroneous. FIELD is the member we decided to initialize.
1028 TYPE is the type for which the initialization is being performed.
1029 FIELD must be a member of TYPE.
1031 MEMBER_NAME is the name of the member. */
1034 member_init_ok_or_else (field
, type
, member_name
)
1037 const char *member_name
;
1039 if (field
== error_mark_node
)
1041 if (field
== NULL_TREE
|| initializing_context (field
) != type
)
1043 cp_error ("class `%T' does not have any field named `%s'", type
,
1047 if (TREE_STATIC (field
))
1049 cp_error ("field `%#D' is static; only point of initialization is its declaration",
1057 /* If NAME is a viable field name for the aggregate DECL,
1058 and PARMS is a viable parameter list, then expand an _EXPR
1059 which describes this initialization.
1061 Note that we do not need to chase through the class's base classes
1062 to look for NAME, because if it's in that list, it will be handled
1063 by the constructor for that base class.
1065 We do not yet have a fixed-point finder to instantiate types
1066 being fed to overloaded constructors. If there is a unique
1067 constructor, then argument types can be got from that one. */
1070 expand_member_init (exp
, name
, init
)
1071 tree exp
, name
, init
;
1073 tree basetype
= NULL_TREE
, field
;
1076 if (exp
== NULL_TREE
)
1079 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
1081 if (name
&& TYPE_P (name
))
1084 name
= TYPE_IDENTIFIER (name
);
1086 else if (name
&& TREE_CODE (name
) == TYPE_DECL
)
1088 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
1089 name
= DECL_NAME (name
);
1092 if (name
== NULL_TREE
&& IS_AGGR_TYPE (type
))
1093 switch (CLASSTYPE_N_BASECLASSES (type
))
1096 error ("base class initializer specified, but no base class to initialize");
1099 basetype
= TYPE_BINFO_BASETYPE (type
, 0);
1102 error ("initializer for unnamed base class ambiguous");
1103 cp_error ("(type `%T' uses multiple inheritance)", type
);
1107 my_friendly_assert (init
!= NULL_TREE
, 0);
1109 /* The grammar should not allow fields which have names that are
1110 TYPENAMEs. Therefore, if the field has a non-NULL TREE_TYPE, we
1111 may assume that this is an attempt to initialize a base class
1112 member of the current type. Otherwise, it is an attempt to
1113 initialize a member field. */
1115 if (init
== void_type_node
)
1118 if (name
== NULL_TREE
|| basetype
)
1120 if (name
== NULL_TREE
)
1124 name
= TYPE_IDENTIFIER (basetype
);
1127 error ("no base class to initialize");
1132 else if (basetype
!= type
1133 && ! current_template_parms
1134 && ! vec_binfo_member (basetype
,
1135 TYPE_BINFO_BASETYPES (type
))
1136 && ! binfo_for_vbase (basetype
, type
))
1138 if (IDENTIFIER_CLASS_VALUE (name
))
1140 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
1141 cp_error ("type `%T' is not an immediate or virtual basetype for `%T'",
1144 cp_error ("type `%T' is not an immediate basetype for `%T'",
1149 init
= build_tree_list (basetype
, init
);
1154 field
= lookup_field (type
, name
, 1, 0);
1156 if (! member_init_ok_or_else (field
, type
, IDENTIFIER_POINTER (name
)))
1159 init
= build_tree_list (field
, init
);
1165 /* This is like `expand_member_init', only it stores one aggregate
1168 INIT comes in two flavors: it is either a value which
1169 is to be stored in EXP, or it is a parameter list
1170 to go to a constructor, which will operate on EXP.
1171 If INIT is not a parameter list for a constructor, then set
1172 LOOKUP_ONLYCONVERTING.
1173 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1174 the initializer, if FLAGS is 0, then it is the (init) form.
1175 If `init' is a CONSTRUCTOR, then we emit a warning message,
1176 explaining that such initializations are invalid.
1178 If INIT resolves to a CALL_EXPR which happens to return
1179 something of the type we are looking for, then we know
1180 that we can safely use that call to perform the
1183 The virtual function table pointer cannot be set up here, because
1184 we do not really know its type.
1186 Virtual baseclass pointers are also set up here.
1188 This never calls operator=().
1190 When initializing, nothing is CONST.
1192 A default copy constructor may have to be used to perform the
1195 A constructor or a conversion operator may have to be used to
1196 perform the initialization, but not both, as it would be ambiguous. */
1199 build_aggr_init (exp
, init
, flags
)
1206 tree type
= TREE_TYPE (exp
);
1207 int was_const
= TREE_READONLY (exp
);
1208 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1210 if (init
== error_mark_node
)
1211 return error_mark_node
;
1213 TREE_READONLY (exp
) = 0;
1214 TREE_THIS_VOLATILE (exp
) = 0;
1216 if (init
&& TREE_CODE (init
) != TREE_LIST
)
1217 flags
|= LOOKUP_ONLYCONVERTING
;
1219 if (TREE_CODE (type
) == ARRAY_TYPE
)
1221 /* Must arrange to initialize each element of EXP
1222 from elements of INIT. */
1223 tree itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1227 /* Handle bad initializers like:
1231 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1235 int main(int argc, char **argv) {
1236 COMPLEX zees(1.0, 0.0)[10];
1239 cp_error ("bad array initializer");
1240 return error_mark_node
;
1242 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
1244 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1246 TREE_TYPE (init
) = TYPE_MAIN_VARIANT (itype
);
1248 stmt_expr
= build_vec_init (exp
, init
,
1249 init
&& same_type_p (TREE_TYPE (init
),
1251 TREE_READONLY (exp
) = was_const
;
1252 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1253 TREE_TYPE (exp
) = type
;
1255 TREE_TYPE (init
) = itype
;
1259 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1260 /* just know that we've seen something for this node */
1261 TREE_USED (exp
) = 1;
1263 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1264 begin_init_stmts (&stmt_expr
, &compound_stmt
);
1265 destroy_temps
= stmts_are_full_exprs_p ();
1266 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
1267 expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
1268 init
, LOOKUP_NORMAL
|flags
);
1269 stmt_expr
= finish_init_stmts (stmt_expr
, compound_stmt
);
1270 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
1271 TREE_TYPE (exp
) = type
;
1272 TREE_READONLY (exp
) = was_const
;
1273 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1279 expand_default_init (binfo
, true_exp
, exp
, init
, flags
)
1285 tree type
= TREE_TYPE (exp
);
1288 /* It fails because there may not be a constructor which takes
1289 its own type as the first (or only parameter), but which does
1290 take other types via a conversion. So, if the thing initializing
1291 the expression is a unit element of type X, first try X(X&),
1292 followed by initialization by X. If neither of these work
1293 out, then look hard. */
1297 if (init
&& TREE_CODE (init
) != TREE_LIST
1298 && (flags
& LOOKUP_ONLYCONVERTING
))
1300 /* Base subobjects should only get direct-initialization. */
1301 if (true_exp
!= exp
)
1304 if (flags
& DIRECT_BIND
)
1305 /* Do nothing. We hit this in two cases: Reference initialization,
1306 where we aren't initializing a real variable, so we don't want
1307 to run a new constructor; and catching an exception, where we
1308 have already built up the constructor call so we could wrap it
1309 in an exception region. */;
1310 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1311 /* A brace-enclosed initializer has whatever type is
1312 required. There's no need to convert it. */
1315 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1317 if (TREE_CODE (init
) == TRY_CATCH_EXPR
)
1318 /* We need to protect the initialization of a catch parm
1319 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1320 around the TARGET_EXPR for the copy constructor. See
1321 expand_start_catch_block. */
1322 TREE_OPERAND (init
, 0) = build (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1323 TREE_OPERAND (init
, 0));
1325 init
= build (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1326 TREE_SIDE_EFFECTS (init
) = 1;
1327 finish_expr_stmt (init
);
1331 if (init
== NULL_TREE
1332 || (TREE_CODE (init
) == TREE_LIST
&& ! TREE_TYPE (init
)))
1336 init
= TREE_VALUE (parms
);
1339 parms
= build_tree_list (NULL_TREE
, init
);
1341 if (true_exp
== exp
)
1342 ctor_name
= complete_ctor_identifier
;
1344 ctor_name
= base_ctor_identifier
;
1346 rval
= build_method_call (exp
, ctor_name
, parms
, binfo
, flags
);
1347 if (TREE_SIDE_EFFECTS (rval
))
1349 if (building_stmt_tree ())
1350 finish_expr_stmt (rval
);
1352 genrtl_expr_stmt (rval
);
1356 /* This function is responsible for initializing EXP with INIT
1359 BINFO is the binfo of the type for who we are performing the
1360 initialization. For example, if W is a virtual base class of A and B,
1362 If we are initializing B, then W must contain B's W vtable, whereas
1363 were we initializing C, W must contain C's W vtable.
1365 TRUE_EXP is nonzero if it is the true expression being initialized.
1366 In this case, it may be EXP, or may just contain EXP. The reason we
1367 need this is because if EXP is a base element of TRUE_EXP, we
1368 don't necessarily know by looking at EXP where its virtual
1369 baseclass fields should really be pointing. But we do know
1370 from TRUE_EXP. In constructors, we don't know anything about
1371 the value being initialized.
1373 FLAGS is just passes to `build_method_call'. See that function for
1377 expand_aggr_init_1 (binfo
, true_exp
, exp
, init
, flags
)
1383 tree type
= TREE_TYPE (exp
);
1385 my_friendly_assert (init
!= error_mark_node
&& type
!= error_mark_node
, 211);
1387 /* Use a function returning the desired type to initialize EXP for us.
1388 If the function is a constructor, and its first argument is
1389 NULL_TREE, know that it was meant for us--just slide exp on
1390 in and expand the constructor. Constructors now come
1393 if (init
&& TREE_CODE (exp
) == VAR_DECL
1394 && TREE_CODE (init
) == CONSTRUCTOR
1395 && TREE_HAS_CONSTRUCTOR (init
))
1397 /* If store_init_value returns NULL_TREE, the INIT has been
1398 record in the DECL_INITIAL for EXP. That means there's
1399 nothing more we have to do. */
1400 if (!store_init_value (exp
, init
))
1402 if (!building_stmt_tree ())
1403 expand_decl_init (exp
);
1406 finish_expr_stmt (build (INIT_EXPR
, type
, exp
, init
));
1410 /* We know that expand_default_init can handle everything we want
1412 expand_default_init (binfo
, true_exp
, exp
, init
, flags
);
1415 /* Report an error if TYPE is not a user-defined, aggregate type. If
1416 OR_ELSE is nonzero, give an error message. */
1419 is_aggr_type (type
, or_else
)
1423 if (type
== error_mark_node
)
1426 if (! IS_AGGR_TYPE (type
)
1427 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1428 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1431 cp_error ("`%T' is not an aggregate type", type
);
1437 /* Like is_aggr_typedef, but returns typedef if successful. */
1440 get_aggr_from_typedef (name
, or_else
)
1446 if (name
== error_mark_node
)
1449 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1450 type
= IDENTIFIER_TYPE_VALUE (name
);
1454 cp_error ("`%T' fails to be an aggregate typedef", name
);
1458 if (! IS_AGGR_TYPE (type
)
1459 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1460 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1463 cp_error ("type `%T' is of non-aggregate type", type
);
1470 get_type_value (name
)
1473 if (name
== error_mark_node
)
1476 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1477 return IDENTIFIER_TYPE_VALUE (name
);
1483 /* This code could just as well go in `class.c', but is placed here for
1486 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1487 the appropriate function call. */
1490 build_member_call (type
, name
, parmlist
)
1491 tree type
, name
, parmlist
;
1496 tree basetype_path
, decl
;
1498 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
1499 && TREE_CODE (type
) == NAMESPACE_DECL
)
1501 /* 'name' already refers to the decls from the namespace, since we
1502 hit do_identifier for template_ids. */
1503 method_name
= TREE_OPERAND (name
, 0);
1504 /* FIXME: Since we don't do independent names right yet, the
1505 name might also be a LOOKUP_EXPR. Once we resolve this to a
1506 real decl earlier, this can go. This may happen during
1508 if (TREE_CODE (method_name
) == LOOKUP_EXPR
)
1510 method_name
= lookup_namespace_name
1511 (type
, TREE_OPERAND (method_name
, 0));
1512 TREE_OPERAND (name
, 0) = method_name
;
1514 my_friendly_assert (is_overloaded_fn (method_name
), 980519);
1515 return build_x_function_call (name
, parmlist
, current_class_ref
);
1519 name
= DECL_NAME (name
);
1521 if (type
== fake_std_node
)
1522 return build_x_function_call (do_scoped_id (name
, 0), parmlist
,
1524 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1525 return build_x_function_call (lookup_namespace_name (type
, name
),
1526 parmlist
, current_class_ref
);
1528 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1530 method_name
= TREE_OPERAND (name
, 0);
1531 if (TREE_CODE (method_name
) == COMPONENT_REF
)
1532 method_name
= TREE_OPERAND (method_name
, 1);
1533 if (is_overloaded_fn (method_name
))
1534 method_name
= DECL_NAME (OVL_CURRENT (method_name
));
1535 TREE_OPERAND (name
, 0) = method_name
;
1540 if (TREE_CODE (method_name
) == BIT_NOT_EXPR
)
1542 method_name
= TREE_OPERAND (method_name
, 0);
1546 /* This shouldn't be here, and build_member_call shouldn't appear in
1548 if (type
&& TREE_CODE (type
) == IDENTIFIER_NODE
1549 && get_aggr_from_typedef (type
, 0) == 0)
1551 tree ns
= lookup_name (type
, 0);
1552 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
)
1554 return build_x_function_call (build_offset_ref (type
, name
), parmlist
, current_class_ref
);
1558 if (type
== NULL_TREE
|| ! is_aggr_type (type
, 1))
1559 return error_mark_node
;
1561 /* An operator we did not like. */
1562 if (name
== NULL_TREE
)
1563 return error_mark_node
;
1567 cp_error ("cannot call destructor `%T::~%T' without object", type
,
1569 return error_mark_node
;
1572 decl
= maybe_dummy_object (type
, &basetype_path
);
1574 /* Convert 'this' to the specified type to disambiguate conversion
1575 to the function's context. Apparently Standard C++ says that we
1576 shouldn't do this. */
1577 if (decl
== current_class_ref
1579 && ACCESSIBLY_UNIQUELY_DERIVED_P (type
, current_class_type
))
1581 tree olddecl
= current_class_ptr
;
1582 tree oldtype
= TREE_TYPE (TREE_TYPE (olddecl
));
1583 if (oldtype
!= type
)
1585 tree newtype
= build_qualified_type (type
, TYPE_QUALS (oldtype
));
1586 decl
= convert_force (build_pointer_type (newtype
), olddecl
, 0);
1587 decl
= build_indirect_ref (decl
, NULL_PTR
);
1591 if (method_name
== constructor_name (type
)
1592 || method_name
== constructor_name_full (type
))
1593 return build_functional_cast (type
, parmlist
);
1594 if (lookup_fnfields (basetype_path
, method_name
, 0))
1595 return build_method_call (decl
,
1596 TREE_CODE (name
) == TEMPLATE_ID_EXPR
1597 ? name
: method_name
,
1598 parmlist
, basetype_path
,
1599 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
);
1600 if (TREE_CODE (name
) == IDENTIFIER_NODE
1601 && ((t
= lookup_field (TYPE_BINFO (type
), name
, 1, 0))))
1603 if (t
== error_mark_node
)
1604 return error_mark_node
;
1605 if (TREE_CODE (t
) == FIELD_DECL
)
1607 if (is_dummy_object (decl
))
1609 cp_error ("invalid use of non-static field `%D'", t
);
1610 return error_mark_node
;
1612 decl
= build (COMPONENT_REF
, TREE_TYPE (t
), decl
, t
);
1614 else if (TREE_CODE (t
) == VAR_DECL
)
1618 cp_error ("invalid use of member `%D'", t
);
1619 return error_mark_node
;
1621 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl
)))
1622 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, decl
,
1623 parmlist
, NULL_TREE
);
1624 return build_function_call (decl
, parmlist
);
1628 cp_error ("no method `%T::%D'", type
, name
);
1629 return error_mark_node
;
1633 /* Build a reference to a member of an aggregate. This is not a
1634 C++ `&', but really something which can have its address taken,
1635 and then act as a pointer to member, for example TYPE :: FIELD
1636 can have its address taken by saying & TYPE :: FIELD.
1638 @@ Prints out lousy diagnostics for operator <typename>
1641 @@ This function should be rewritten and placed in search.c. */
1644 build_offset_ref (type
, name
)
1647 tree decl
, t
= error_mark_node
;
1649 tree basebinfo
= NULL_TREE
;
1650 tree orig_name
= name
;
1652 /* class templates can come in as TEMPLATE_DECLs here. */
1653 if (TREE_CODE (name
) == TEMPLATE_DECL
)
1656 if (type
== fake_std_node
)
1657 return do_scoped_id (name
, 0);
1659 if (processing_template_decl
|| uses_template_parms (type
))
1660 return build_min_nt (SCOPE_REF
, type
, name
);
1662 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1664 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1665 something like `a.template f<int>' or the like. For the most
1666 part, we treat this just like a.f. We do remember, however,
1667 the template-id that was used. */
1668 name
= TREE_OPERAND (orig_name
, 0);
1671 name
= DECL_NAME (name
);
1674 if (TREE_CODE (name
) == LOOKUP_EXPR
)
1675 /* This can happen during tsubst'ing. */
1676 name
= TREE_OPERAND (name
, 0);
1679 if (TREE_CODE (name
) == COMPONENT_REF
)
1680 name
= TREE_OPERAND (name
, 1);
1681 if (TREE_CODE (name
) == OVERLOAD
)
1682 name
= DECL_NAME (OVL_CURRENT (name
));
1686 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 0);
1689 if (type
== NULL_TREE
)
1690 return error_mark_node
;
1692 /* Handle namespace names fully here. */
1693 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1695 t
= lookup_namespace_name (type
, name
);
1696 if (t
== error_mark_node
)
1698 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1699 /* Reconstruct the TEMPLATE_ID_EXPR. */
1700 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
),
1701 t
, TREE_OPERAND (orig_name
, 1));
1702 if (! type_unknown_p (t
))
1705 t
= convert_from_reference (t
);
1710 if (! is_aggr_type (type
, 1))
1711 return error_mark_node
;
1713 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1715 if (! check_dtor_name (type
, name
))
1716 cp_error ("qualified type `%T' does not match destructor name `~%T'",
1717 type
, TREE_OPERAND (name
, 0));
1718 name
= dtor_identifier
;
1721 if (!COMPLETE_TYPE_P (complete_type (type
))
1722 && !TYPE_BEING_DEFINED (type
))
1724 cp_error ("incomplete type `%T' does not have member `%D'", type
,
1726 return error_mark_node
;
1729 decl
= maybe_dummy_object (type
, &basebinfo
);
1731 member
= lookup_member (basebinfo
, name
, 1, 0);
1733 if (member
== error_mark_node
)
1734 return error_mark_node
;
1736 /* A lot of this logic is now handled in lookup_member. */
1737 if (member
&& BASELINK_P (member
))
1739 /* Go from the TREE_BASELINK to the member function info. */
1740 tree fnfields
= member
;
1741 t
= TREE_VALUE (fnfields
);
1743 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1745 /* The FNFIELDS are going to contain functions that aren't
1746 necessarily templates, and templates that don't
1747 necessarily match the explicit template parameters. We
1748 save all the functions, and the explicit parameters, and
1749 then figure out exactly what to instantiate with what
1750 arguments in instantiate_type. */
1752 if (TREE_CODE (t
) != OVERLOAD
)
1753 /* The code in instantiate_type which will process this
1754 expects to encounter OVERLOADs, not raw functions. */
1755 t
= ovl_cons (t
, NULL_TREE
);
1757 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
), t
,
1758 TREE_OPERAND (orig_name
, 1));
1759 t
= build (OFFSET_REF
, unknown_type_node
, decl
, t
);
1761 PTRMEM_OK_P (t
) = 1;
1766 if (!really_overloaded_fn (t
))
1768 /* Get rid of a potential OVERLOAD around it */
1769 t
= OVL_CURRENT (t
);
1771 /* unique functions are handled easily. */
1772 if (!enforce_access (basebinfo
, t
))
1773 return error_mark_node
;
1775 if (DECL_STATIC_FUNCTION_P (t
))
1777 t
= build (OFFSET_REF
, TREE_TYPE (t
), decl
, t
);
1778 PTRMEM_OK_P (t
) = 1;
1782 TREE_TYPE (fnfields
) = unknown_type_node
;
1784 t
= build (OFFSET_REF
, unknown_type_node
, decl
, fnfields
);
1785 PTRMEM_OK_P (t
) = 1;
1793 cp_error ("`%D' is not a member of type `%T'", name
, type
);
1794 return error_mark_node
;
1797 if (TREE_CODE (t
) == TYPE_DECL
)
1802 /* static class members and class-specific enum
1803 values can be returned without further ado. */
1804 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == CONST_DECL
)
1807 return convert_from_reference (t
);
1810 if (TREE_CODE (t
) == FIELD_DECL
&& DECL_C_BIT_FIELD (t
))
1812 cp_error ("illegal pointer to bit field `%D'", t
);
1813 return error_mark_node
;
1816 /* static class functions too. */
1817 if (TREE_CODE (t
) == FUNCTION_DECL
1818 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1819 my_friendly_abort (53);
1821 /* In member functions, the form `type::name' is no longer
1822 equivalent to `this->type::name', at least not until
1823 resolve_offset_ref. */
1824 t
= build (OFFSET_REF
, build_offset_type (type
, TREE_TYPE (t
)), decl
, t
);
1825 PTRMEM_OK_P (t
) = 1;
1829 /* If a OFFSET_REF made it through to here, then it did
1830 not have its address taken. */
1833 resolve_offset_ref (exp
)
1836 tree type
= TREE_TYPE (exp
);
1837 tree base
= NULL_TREE
;
1839 tree basetype
, addr
;
1841 if (TREE_CODE (exp
) == OFFSET_REF
)
1843 member
= TREE_OPERAND (exp
, 1);
1844 base
= TREE_OPERAND (exp
, 0);
1848 my_friendly_assert (TREE_CODE (type
) == OFFSET_TYPE
, 214);
1849 if (TYPE_OFFSET_BASETYPE (type
) != current_class_type
)
1851 error ("object missing in use of pointer-to-member construct");
1852 return error_mark_node
;
1855 type
= TREE_TYPE (type
);
1856 base
= current_class_ref
;
1859 if (BASELINK_P (member
) || TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
1860 return build_unary_op (ADDR_EXPR
, exp
, 0);
1862 if (TREE_CODE (TREE_TYPE (member
)) == METHOD_TYPE
)
1864 if (!flag_ms_extensions
)
1865 /* A single non-static member, make sure we don't allow a
1866 pointer-to-member. */
1867 exp
= ovl_cons (member
, NULL_TREE
);
1869 return build_unary_op (ADDR_EXPR
, exp
, 0);
1872 if ((TREE_CODE (member
) == VAR_DECL
1873 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member
))
1874 && ! TYPE_PTRMEM_P (TREE_TYPE (member
)))
1875 || TREE_CODE (TREE_TYPE (member
)) == FUNCTION_TYPE
)
1877 /* These were static members. */
1878 if (mark_addressable (member
) == 0)
1879 return error_mark_node
;
1883 if (TREE_CODE (TREE_TYPE (member
)) == POINTER_TYPE
1884 && TREE_CODE (TREE_TYPE (TREE_TYPE (member
))) == METHOD_TYPE
)
1887 /* Syntax error can cause a member which should
1888 have been seen as static to be grok'd as non-static. */
1889 if (TREE_CODE (member
) == FIELD_DECL
&& current_class_ref
== NULL_TREE
)
1891 cp_error_at ("member `%D' is non-static but referenced as a static member",
1893 error ("at this point in file");
1894 return error_mark_node
;
1897 /* The first case is really just a reference to a member of `this'. */
1898 if (TREE_CODE (member
) == FIELD_DECL
1899 && (base
== current_class_ref
|| is_dummy_object (base
)))
1903 basetype
= DECL_CONTEXT (member
);
1905 /* Try to get to basetype from 'this'; if that doesn't work,
1907 base
= current_class_ref
;
1909 /* First convert to the intermediate base specified, if appropriate. */
1910 if (TREE_CODE (exp
) == OFFSET_REF
&& TREE_CODE (type
) == OFFSET_TYPE
)
1911 base
= build_scoped_ref (base
, TYPE_OFFSET_BASETYPE (type
));
1913 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1914 addr
= convert_pointer_to (basetype
, addr
);
1916 if (addr
== error_mark_node
)
1917 return error_mark_node
;
1919 expr
= build (COMPONENT_REF
, TREE_TYPE (member
),
1920 build_indirect_ref (addr
, NULL_PTR
), member
);
1921 return convert_from_reference (expr
);
1924 /* Ensure that we have an object. */
1925 if (is_dummy_object (base
))
1926 addr
= error_mark_node
;
1928 /* If this is a reference to a member function, then return the
1929 address of the member function (which may involve going
1930 through the object's vtable), otherwise, return an expression
1931 for the dereferenced pointer-to-member construct. */
1932 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1934 if (TYPE_PTRMEM_P (TREE_TYPE (member
)))
1936 if (addr
== error_mark_node
)
1938 cp_error ("object missing in `%E'", exp
);
1939 return error_mark_node
;
1942 basetype
= TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member
)));
1943 addr
= convert_pointer_to (basetype
, addr
);
1944 member
= cp_convert (ptrdiff_type_node
, member
);
1947 /* Pointer to data members are offset by one, so that a null
1948 pointer with a real value of 0 is distinguishable from an
1949 offset of the first member of a structure. */
1950 member
= cp_build_binary_op (MINUS_EXPR
, member
,
1951 cp_convert (ptrdiff_type_node
,
1954 return build1 (INDIRECT_REF
, type
,
1955 build (PLUS_EXPR
, build_pointer_type (type
),
1958 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member
)))
1960 return get_member_function_from_ptrfunc (&addr
, member
);
1962 my_friendly_abort (56);
1967 /* If DECL is a `const' declaration, and its value is a known
1968 constant, then return that value. */
1971 decl_constant_value (decl
)
1974 if (TREE_READONLY_DECL_P (decl
)
1975 && ! TREE_THIS_VOLATILE (decl
)
1976 && DECL_INITIAL (decl
)
1977 && DECL_INITIAL (decl
) != error_mark_node
1978 /* This is invalid if initial value is not constant.
1979 If it has either a function call, a memory reference,
1980 or a variable, then re-evaluating it could give different results. */
1981 && TREE_CONSTANT (DECL_INITIAL (decl
))
1982 /* Check for cases where this is sub-optimal, even though valid. */
1983 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1984 return DECL_INITIAL (decl
);
1988 /* Common subroutines of build_new and build_vec_delete. */
1990 /* Call the global __builtin_delete to delete ADDR. */
1993 build_builtin_delete_call (addr
)
1996 mark_used (global_delete_fndecl
);
1997 return build_call (global_delete_fndecl
, build_tree_list (NULL_TREE
, addr
));
2000 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
2001 (which needs to go through some sort of groktypename) or it
2002 is the name of the class we are newing. INIT is an initialization value.
2003 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
2004 If INIT is void_type_node, it means do *not* call a constructor
2007 For types with constructors, the data returned is initialized
2008 by the appropriate constructor.
2010 Whether the type has a constructor or not, if it has a pointer
2011 to a virtual function table, then that pointer is set up
2014 Unless I am mistaken, a call to new () will return initialized
2015 data regardless of whether the constructor itself is private or
2016 not. NOPE; new fails if the constructor is private (jcm).
2018 Note that build_new does nothing to assure that any special
2019 alignment requirements of the type are met. Rather, it leaves
2020 it up to malloc to do the right thing. Otherwise, folding to
2021 the right alignment cal cause problems if the user tries to later
2022 free the memory returned by `new'.
2024 PLACEMENT is the `placement' list for user-defined operator new (). */
2027 build_new (placement
, decl
, init
, use_global_new
)
2033 tree nelts
= NULL_TREE
, t
;
2036 if (decl
== error_mark_node
)
2037 return error_mark_node
;
2039 if (TREE_CODE (decl
) == TREE_LIST
)
2041 tree absdcl
= TREE_VALUE (decl
);
2042 tree last_absdcl
= NULL_TREE
;
2044 if (current_function_decl
2045 && DECL_CONSTRUCTOR_P (current_function_decl
))
2046 my_friendly_assert (immediate_size_expand
== 0, 19990926);
2048 nelts
= integer_one_node
;
2050 if (absdcl
&& TREE_CODE (absdcl
) == CALL_EXPR
)
2051 my_friendly_abort (215);
2052 while (absdcl
&& TREE_CODE (absdcl
) == INDIRECT_REF
)
2054 last_absdcl
= absdcl
;
2055 absdcl
= TREE_OPERAND (absdcl
, 0);
2058 if (absdcl
&& TREE_CODE (absdcl
) == ARRAY_REF
)
2060 /* probably meant to be a vec new */
2063 while (TREE_OPERAND (absdcl
, 0)
2064 && TREE_CODE (TREE_OPERAND (absdcl
, 0)) == ARRAY_REF
)
2066 last_absdcl
= absdcl
;
2067 absdcl
= TREE_OPERAND (absdcl
, 0);
2071 this_nelts
= TREE_OPERAND (absdcl
, 1);
2072 if (this_nelts
!= error_mark_node
)
2074 if (this_nelts
== NULL_TREE
)
2075 error ("new of array type fails to specify size");
2076 else if (processing_template_decl
)
2079 absdcl
= TREE_OPERAND (absdcl
, 0);
2083 int flags
= pedantic
? WANT_INT
: (WANT_INT
| WANT_ENUM
);
2084 if (build_expr_type_conversion (flags
, this_nelts
, 0)
2086 pedwarn ("size in array new must have integral type");
2088 this_nelts
= save_expr (cp_convert (sizetype
, this_nelts
));
2089 absdcl
= TREE_OPERAND (absdcl
, 0);
2090 if (this_nelts
== integer_zero_node
)
2092 warning ("zero size array reserves no space");
2093 nelts
= integer_zero_node
;
2096 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
2100 nelts
= integer_zero_node
;
2104 TREE_OPERAND (last_absdcl
, 0) = absdcl
;
2106 TREE_VALUE (decl
) = absdcl
;
2108 type
= groktypename (decl
);
2109 if (! type
|| type
== error_mark_node
)
2110 return error_mark_node
;
2112 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
2114 if (IDENTIFIER_HAS_TYPE_VALUE (decl
))
2116 /* An aggregate type. */
2117 type
= IDENTIFIER_TYPE_VALUE (decl
);
2118 decl
= TYPE_MAIN_DECL (type
);
2122 /* A builtin type. */
2123 decl
= lookup_name (decl
, 1);
2124 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 215);
2125 type
= TREE_TYPE (decl
);
2128 else if (TREE_CODE (decl
) == TYPE_DECL
)
2130 type
= TREE_TYPE (decl
);
2135 decl
= TYPE_MAIN_DECL (type
);
2138 if (processing_template_decl
)
2141 t
= tree_cons (tree_cons (NULL_TREE
, type
, NULL_TREE
),
2142 build_min_nt (ARRAY_REF
, NULL_TREE
, nelts
),
2147 rval
= build_min_nt (NEW_EXPR
, placement
, t
, init
);
2148 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2152 /* ``A reference cannot be created by the new operator. A reference
2153 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2154 returned by new.'' ARM 5.3.3 */
2155 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2157 error ("new cannot be applied to a reference type");
2158 type
= TREE_TYPE (type
);
2161 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2163 error ("new cannot be applied to a function type");
2164 return error_mark_node
;
2167 /* When the object being created is an array, the new-expression yields a
2168 pointer to the initial element (if any) of the array. For example,
2169 both new int and new int[10] return an int*. 5.3.4. */
2170 if (TREE_CODE (type
) == ARRAY_TYPE
&& has_array
== 0)
2172 nelts
= array_type_nelts_top (type
);
2174 type
= TREE_TYPE (type
);
2178 t
= build_nt (ARRAY_REF
, type
, nelts
);
2182 rval
= build (NEW_EXPR
, build_pointer_type (type
), placement
, t
, init
);
2183 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2184 TREE_SIDE_EFFECTS (rval
) = 1;
2185 rval
= build_new_1 (rval
);
2186 if (rval
== error_mark_node
)
2187 return error_mark_node
;
2189 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2190 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
2191 TREE_NO_UNUSED_WARNING (rval
) = 1;
2196 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2199 build_java_class_ref (type
)
2202 tree name
, class_decl
;
2203 static tree CL_suffix
= NULL_TREE
;
2204 if (CL_suffix
== NULL_TREE
)
2205 CL_suffix
= get_identifier("class$");
2206 if (jclass_node
== NULL_TREE
)
2208 jclass_node
= IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2209 if (jclass_node
== NULL_TREE
)
2210 fatal_error ("call to Java constructor, while `jclass' undefined");
2212 jclass_node
= TREE_TYPE (jclass_node
);
2215 /* Mangle the class$ field, new and old ABI */
2219 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2220 if (DECL_NAME (field
) == CL_suffix
)
2222 name
= mangle_decl (field
);
2226 internal_error ("Can't find class$");
2229 name
= build_static_name (type
, CL_suffix
);
2231 class_decl
= IDENTIFIER_GLOBAL_VALUE (name
);
2232 if (class_decl
== NULL_TREE
)
2234 class_decl
= build_decl (VAR_DECL
, name
, TREE_TYPE (jclass_node
));
2235 TREE_STATIC (class_decl
) = 1;
2236 DECL_EXTERNAL (class_decl
) = 1;
2237 TREE_PUBLIC (class_decl
) = 1;
2238 DECL_ARTIFICIAL (class_decl
) = 1;
2239 DECL_IGNORED_P (class_decl
) = 1;
2240 pushdecl_top_level (class_decl
);
2241 make_decl_rtl (class_decl
, NULL_PTR
);
2246 /* Returns the size of the cookie to use when allocating an array
2247 whose elements have the indicated TYPE. Assumes that it is already
2248 known that a cookie is needed. */
2251 get_cookie_size (type
)
2258 /* Under the new ABI, we need to allocate an additional max
2259 (sizeof (size_t), alignof (true_type)) bytes. */
2263 sizetype_size
= size_in_bytes (sizetype
);
2264 type_align
= size_int (TYPE_ALIGN_UNIT (type
));
2265 if (INT_CST_LT_UNSIGNED (type_align
, sizetype_size
))
2266 cookie_size
= sizetype_size
;
2268 cookie_size
= type_align
;
2272 if (TYPE_ALIGN (type
) > TYPE_ALIGN (BI_header_type
))
2273 return size_int (TYPE_ALIGN_UNIT (type
));
2275 return size_in_bytes (BI_header_type
);
2281 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2282 value is immediately handed to expand_expr. */
2288 tree placement
, init
;
2289 tree type
, true_type
, size
, rval
, t
;
2291 tree nelts
= NULL_TREE
;
2292 tree alloc_call
, alloc_expr
, alloc_node
;
2293 tree cookie_expr
, init_expr
;
2295 enum tree_code code
;
2296 int use_cookie
, nothrow
, check_new
;
2297 /* Nonzero if the user wrote `::new' rather than just `new'. */
2298 int globally_qualified_p
;
2299 /* Nonzero if we're going to call a global operator new, rather than
2300 a class-specific version. */
2302 int use_java_new
= 0;
2303 /* If non-NULL, the number of extra bytes to allocate at the
2304 beginning of the storage allocated for an array-new expression in
2305 order to store the number of elements. */
2306 tree cookie_size
= NULL_TREE
;
2308 placement
= TREE_OPERAND (exp
, 0);
2309 type
= TREE_OPERAND (exp
, 1);
2310 init
= TREE_OPERAND (exp
, 2);
2311 globally_qualified_p
= NEW_EXPR_USE_GLOBAL (exp
);
2313 if (TREE_CODE (type
) == ARRAY_REF
)
2316 nelts
= TREE_OPERAND (type
, 1);
2317 type
= TREE_OPERAND (type
, 0);
2319 full_type
= cp_build_binary_op (MINUS_EXPR
, nelts
, integer_one_node
);
2320 full_type
= build_index_type (full_type
);
2321 full_type
= build_cplus_array_type (type
, full_type
);
2328 code
= has_array
? VEC_NEW_EXPR
: NEW_EXPR
;
2330 /* If our base type is an array, then make sure we know how many elements
2332 while (TREE_CODE (true_type
) == ARRAY_TYPE
)
2334 tree this_nelts
= array_type_nelts_top (true_type
);
2335 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
2336 true_type
= TREE_TYPE (true_type
);
2339 if (!complete_type_or_else (true_type
, exp
))
2340 return error_mark_node
;
2342 size
= size_in_bytes (true_type
);
2344 size
= fold (cp_build_binary_op (MULT_EXPR
, size
, nelts
));
2346 if (TREE_CODE (true_type
) == VOID_TYPE
)
2348 error ("invalid type `void' for new");
2349 return error_mark_node
;
2352 if (abstract_virtuals_error (NULL_TREE
, true_type
))
2353 return error_mark_node
;
2355 /* Figure out whether or not we're going to use the global operator
2357 if (!globally_qualified_p
2358 && IS_AGGR_TYPE (true_type
)
2360 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type
)
2361 : TYPE_HAS_NEW_OPERATOR (true_type
)))
2366 /* We only need cookies for arrays containing types for which we
2368 if (!has_array
|| !TYPE_VEC_NEW_USES_COOKIE (true_type
))
2370 /* When using placement new, users may not realize that they need
2371 the extra storage. Under the old ABI, we don't allocate the
2372 cookie whenever they use one placement argument of type `void
2373 *'. Under the new ABI, we require that the operator called be
2374 the global placement operator delete[]. */
2375 else if (placement
&& !TREE_CHAIN (placement
)
2376 && same_type_p (TREE_TYPE (TREE_VALUE (placement
)),
2378 use_cookie
= (!flag_new_abi
|| !use_global_new
);
2379 /* Otherwise, we need the cookie. */
2383 /* Compute the number of extra bytes to allocate, now that we know
2384 whether or not we need the cookie. */
2387 cookie_size
= get_cookie_size (true_type
);
2388 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
2391 /* Allocate the object. */
2393 if (! placement
&& TYPE_FOR_JAVA (true_type
))
2395 tree class_addr
, alloc_decl
;
2396 tree class_decl
= build_java_class_ref (true_type
);
2397 tree class_size
= size_in_bytes (true_type
);
2398 static char alloc_name
[] = "_Jv_AllocObject";
2400 alloc_decl
= IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name
));
2401 if (alloc_decl
== NULL_TREE
)
2402 fatal_error ("call to Java constructor with `%s' undefined",
2405 class_addr
= build1 (ADDR_EXPR
, jclass_node
, class_decl
);
2406 alloc_call
= (build_function_call
2408 tree_cons (NULL_TREE
, class_addr
,
2409 build_tree_list (NULL_TREE
, class_size
))));
2416 args
= tree_cons (NULL_TREE
, size
, placement
);
2417 fnname
= ansi_opname (code
);
2420 alloc_call
= (build_new_function_call
2421 (lookup_function_nonclass (fnname
, args
),
2424 alloc_call
= build_method_call (build_dummy_object (true_type
),
2425 fnname
, args
, NULL_TREE
,
2429 if (alloc_call
== error_mark_node
)
2430 return error_mark_node
;
2432 if (alloc_call
== NULL_TREE
)
2435 /* unless an allocation function is declared with an empty excep-
2436 tion-specification (_except.spec_), throw(), it indicates failure to
2437 allocate storage by throwing a bad_alloc exception (clause _except_,
2438 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2439 cation function is declared with an empty exception-specification,
2440 throw(), it returns null to indicate failure to allocate storage and a
2441 non-null pointer otherwise.
2443 So check for a null exception spec on the op new we just called. */
2445 /* The ADDR_EXPR. */
2446 t
= TREE_OPERAND (alloc_call
, 0);
2448 t
= TREE_OPERAND (t
, 0);
2449 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (t
));
2450 check_new
= (flag_check_new
|| nothrow
) && ! use_java_new
;
2452 alloc_expr
= alloc_call
;
2455 /* Adjust so we're pointing to the start of the object. */
2456 alloc_expr
= build (PLUS_EXPR
, TREE_TYPE (alloc_expr
),
2457 alloc_expr
, cookie_size
);
2459 /* While we're working, use a pointer to the type we've actually
2461 alloc_expr
= convert (build_pointer_type (full_type
), alloc_expr
);
2463 /* Now save the allocation expression so we only evaluate it once. */
2464 alloc_expr
= get_target_expr (alloc_expr
);
2465 alloc_node
= TREE_OPERAND (alloc_expr
, 0);
2467 /* Now initialize the cookie. */
2472 /* Store the number of bytes allocated so that we can know how
2473 many elements to destroy later. */
2476 /* Under the new ABI, we use the last sizeof (size_t) bytes
2477 to store the number of elements. */
2478 cookie
= build (MINUS_EXPR
, build_pointer_type (sizetype
),
2479 alloc_node
, size_in_bytes (sizetype
));
2480 cookie
= build_indirect_ref (cookie
, NULL_PTR
);
2484 cookie
= build (MINUS_EXPR
, build_pointer_type (BI_header_type
),
2485 alloc_node
, cookie_size
);
2486 cookie
= build_indirect_ref (cookie
, NULL_PTR
);
2487 cookie
= build_component_ref (cookie
, nelts_identifier
,
2490 cookie_expr
= build (MODIFY_EXPR
, void_type_node
, cookie
, nelts
);
2491 TREE_SIDE_EFFECTS (cookie_expr
) = 1;
2494 cookie_expr
= NULL_TREE
;
2496 /* Now initialize the allocated object. */
2497 init_expr
= NULL_TREE
;
2498 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
)
2500 init_expr
= build_indirect_ref (alloc_node
, NULL_PTR
);
2502 if (init
== void_zero_node
)
2503 init
= build_default_init (full_type
);
2504 else if (init
&& pedantic
&& has_array
)
2505 cp_pedwarn ("ISO C++ forbids initialization in array new");
2508 init_expr
= build_vec_init (init_expr
, init
, 0);
2509 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2510 init_expr
= build_method_call (init_expr
,
2511 complete_ctor_identifier
,
2512 init
, TYPE_BINFO (true_type
),
2516 /* We are processing something like `new int (10)', which
2517 means allocate an int, and initialize it with 10. */
2519 if (TREE_CODE (init
) == TREE_LIST
)
2521 if (TREE_CHAIN (init
) != NULL_TREE
)
2523 ("initializer list being treated as compound expression");
2524 init
= build_compound_expr (init
);
2526 else if (TREE_CODE (init
) == CONSTRUCTOR
2527 && TREE_TYPE (init
) == NULL_TREE
)
2529 pedwarn ("ISO C++ forbids aggregate initializer to new");
2530 init
= digest_init (type
, init
, 0);
2533 init_expr
= build_modify_expr (init_expr
, INIT_EXPR
, init
);
2536 if (init_expr
== error_mark_node
)
2537 return error_mark_node
;
2539 /* If any part of the object initialization terminates by throwing an
2540 exception and a suitable deallocation function can be found, the
2541 deallocation function is called to free the memory in which the
2542 object was being constructed, after which the exception continues
2543 to propagate in the context of the new-expression. If no
2544 unambiguous matching deallocation function can be found,
2545 propagating the exception does not cause the object's memory to be
2547 if (flag_exceptions
&& ! use_java_new
)
2549 enum tree_code dcode
= has_array
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2551 int flags
= (LOOKUP_NORMAL
2552 | (globally_qualified_p
* LOOKUP_GLOBAL
));
2554 /* The Standard is unclear here, but the right thing to do
2555 is to use the same method for finding deallocation
2556 functions that we use for finding allocation functions. */
2557 flags
|= LOOKUP_SPECULATIVELY
;
2559 cleanup
= build_op_delete_call (dcode
, alloc_node
, size
, flags
,
2562 /* Ack! First we allocate the memory. Then we set our sentry
2563 variable to true, and expand a cleanup that deletes the memory
2564 if sentry is true. Then we run the constructor, and finally
2567 It would be nice to be able to handle this without the sentry
2568 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2569 work. We allocate the space first, so if there are any
2570 temporaries with cleanups in the constructor args we need this
2571 EH region to extend until end of full-expression to preserve
2574 If the backend had some mechanism so that we could force the
2575 allocation to be expanded after all the other args to the
2576 constructor, that would fix the nesting problem and we could
2577 do away with this complexity. But that would complicate other
2578 things; in particular, it would make it difficult to bail out
2579 if the allocation function returns null. */
2583 tree end
, sentry
, begin
;
2585 begin
= get_target_expr (boolean_true_node
);
2586 sentry
= TREE_OPERAND (begin
, 0);
2588 TREE_OPERAND (begin
, 2)
2589 = build (COND_EXPR
, void_type_node
, sentry
,
2590 cleanup
, void_zero_node
);
2592 end
= build (MODIFY_EXPR
, TREE_TYPE (sentry
),
2593 sentry
, boolean_false_node
);
2596 = build (COMPOUND_EXPR
, void_type_node
, begin
,
2597 build (COMPOUND_EXPR
, void_type_node
, init_expr
,
2602 else if (CP_TYPE_CONST_P (true_type
))
2603 cp_error ("uninitialized const in `new' of `%#T'", true_type
);
2605 /* Now build up the return value in reverse order. */
2610 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
2612 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
2614 if (rval
== alloc_node
)
2615 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2617 rval
= TREE_OPERAND (alloc_expr
, 1);
2622 tree ifexp
= cp_build_binary_op (NE_EXPR
, alloc_node
,
2624 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
);
2627 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2630 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2632 rval
= convert (build_pointer_type (type
), rval
);
2638 build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
, use_global_delete
)
2639 tree base
, maxindex
, type
;
2640 special_function_kind auto_delete_vec
;
2641 int use_global_delete
;
2644 tree ptype
= build_pointer_type (type
= complete_type (type
));
2645 tree size_exp
= size_in_bytes (type
);
2647 /* Temporary variables used by the loop. */
2648 tree tbase
, tbase_init
;
2650 /* This is the body of the loop that implements the deletion of a
2651 single element, and moves temp variables to next elements. */
2654 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2657 /* This is the thing that governs what to do after the loop has run. */
2658 tree deallocate_expr
= 0;
2660 /* This is the BIND_EXPR which holds the outermost iterator of the
2661 loop. It is convenient to set this variable up and test it before
2662 executing any other code in the loop.
2663 This is also the containing expression returned by this function. */
2664 tree controller
= NULL_TREE
;
2666 if (! IS_AGGR_TYPE (type
) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2668 loop
= integer_zero_node
;
2672 /* The below is short by the cookie size. */
2673 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2674 convert (sizetype
, maxindex
));
2676 tbase
= create_temporary_var (ptype
);
2677 tbase_init
= build_modify_expr (tbase
, NOP_EXPR
,
2678 fold (build (PLUS_EXPR
, ptype
,
2681 DECL_REGISTER (tbase
) = 1;
2682 controller
= build (BIND_EXPR
, void_type_node
, tbase
, NULL_TREE
, NULL_TREE
);
2683 TREE_SIDE_EFFECTS (controller
) = 1;
2687 body
= tree_cons (NULL_TREE
,
2688 build_delete (ptype
, tbase
, sfk_complete_destructor
,
2689 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1),
2692 body
= tree_cons (NULL_TREE
,
2693 build_modify_expr (tbase
, NOP_EXPR
, build (MINUS_EXPR
, ptype
, tbase
, size_exp
)),
2696 body
= tree_cons (NULL_TREE
,
2697 build (EXIT_EXPR
, void_type_node
,
2698 build (EQ_EXPR
, boolean_type_node
, base
, tbase
)),
2701 loop
= build (LOOP_EXPR
, void_type_node
, build_compound_expr (body
));
2703 loop
= tree_cons (NULL_TREE
, tbase_init
,
2704 tree_cons (NULL_TREE
, loop
, NULL_TREE
));
2705 loop
= build_compound_expr (loop
);
2708 /* If the delete flag is one, or anything else with the low bit set,
2709 delete the storage. */
2710 deallocate_expr
= integer_zero_node
;
2711 if (auto_delete_vec
!= sfk_base_destructor
)
2715 /* The below is short by the cookie size. */
2716 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2717 convert (sizetype
, maxindex
));
2719 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2726 cookie_size
= get_cookie_size (type
);
2728 = cp_convert (ptype
,
2729 cp_build_binary_op (MINUS_EXPR
,
2730 cp_convert (string_type_node
,
2733 /* True size with header. */
2734 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
2737 if (auto_delete_vec
== sfk_deleting_destructor
)
2738 deallocate_expr
= build_x_delete (base_tbd
,
2739 2 | use_global_delete
,
2743 if (loop
&& deallocate_expr
!= integer_zero_node
)
2745 body
= tree_cons (NULL_TREE
, loop
,
2746 tree_cons (NULL_TREE
, deallocate_expr
, NULL_TREE
));
2747 body
= build_compound_expr (body
);
2752 /* Outermost wrapper: If pointer is null, punt. */
2753 body
= fold (build (COND_EXPR
, void_type_node
,
2754 fold (build (NE_EXPR
, boolean_type_node
, base
,
2755 integer_zero_node
)),
2756 body
, integer_zero_node
));
2757 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2761 TREE_OPERAND (controller
, 1) = body
;
2765 return cp_convert (void_type_node
, body
);
2768 /* Create an unnamed variable of the indicated TYPE. */
2771 create_temporary_var (type
)
2776 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2777 TREE_USED (decl
) = 1;
2778 DECL_ARTIFICIAL (decl
) = 1;
2779 DECL_SOURCE_FILE (decl
) = input_filename
;
2780 DECL_SOURCE_LINE (decl
) = lineno
;
2781 DECL_IGNORED_P (decl
) = 1;
2782 DECL_CONTEXT (decl
) = current_function_decl
;
2787 /* Create a new temporary variable of the indicated TYPE, initialized
2790 It is not entered into current_binding_level, because that breaks
2791 things when it comes time to do final cleanups (which take place
2792 "outside" the binding contour of the function). */
2795 get_temp_regvar (type
, init
)
2800 decl
= create_temporary_var (type
);
2801 if (building_stmt_tree ())
2802 add_decl_stmt (decl
);
2803 if (!building_stmt_tree ())
2804 DECL_RTL (decl
) = assign_temp (type
, 2, 0, 1);
2805 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
2810 /* `build_vec_init' returns tree structure that performs
2811 initialization of a vector of aggregate types.
2813 BASE is a reference to the vector, of ARRAY_TYPE.
2814 INIT is the (possibly NULL) initializer.
2816 FROM_ARRAY is 0 if we should init everything with INIT
2817 (i.e., every element initialized from INIT).
2818 FROM_ARRAY is 1 if we should index into INIT in parallel
2819 with initialization of DECL.
2820 FROM_ARRAY is 2 if we should index into INIT in parallel,
2821 but use assignment instead of initialization. */
2824 build_vec_init (base
, init
, from_array
)
2829 tree base2
= NULL_TREE
;
2831 tree itype
= NULL_TREE
;
2833 /* The type of the array. */
2834 tree atype
= TREE_TYPE (base
);
2835 /* The type of an element in the array. */
2836 tree type
= TREE_TYPE (atype
);
2837 /* The type of a pointer to an element in the array. */
2842 tree try_block
= NULL_TREE
;
2843 tree try_body
= NULL_TREE
;
2844 int num_initialized_elts
= 0;
2845 tree maxindex
= array_type_nelts (TREE_TYPE (base
));
2847 if (maxindex
== error_mark_node
)
2848 return error_mark_node
;
2850 /* For g++.ext/arrnew.C. */
2851 if (init
&& TREE_CODE (init
) == CONSTRUCTOR
&& TREE_TYPE (init
) == NULL_TREE
)
2852 init
= digest_init (atype
, init
, 0);
2854 if (init
&& !TYPE_NEEDS_CONSTRUCTING (type
)
2855 && ((TREE_CODE (init
) == CONSTRUCTOR
2856 /* Don't do this if the CONSTRUCTOR might contain something
2857 that might throw and require us to clean up. */
2858 && (CONSTRUCTOR_ELTS (init
) == NULL_TREE
2859 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type
))))
2862 /* Do non-default initialization of POD arrays resulting from
2863 brace-enclosed initializers. In this case, digest_init and
2864 store_constructor will handle the semantics for us. */
2866 stmt_expr
= build (INIT_EXPR
, atype
, base
, init
);
2867 TREE_SIDE_EFFECTS (stmt_expr
) = 1;
2871 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2872 ptype
= build_pointer_type (type
);
2873 size
= size_in_bytes (type
);
2874 if (TREE_CODE (TREE_TYPE (base
)) == ARRAY_TYPE
)
2875 base
= cp_convert (ptype
, default_conversion (base
));
2877 /* The code we are generating looks like:
2881 ptrdiff_t iterator = maxindex;
2884 ... initialize *t1 ...
2886 } while (--iterator != -1);
2888 ... destroy elements that were constructed ...
2892 We can omit the try and catch blocks if we know that the
2893 initialization will never throw an exception, or if the array
2894 elements do not have destructors. We can omit the loop completely if
2895 the elements of the array do not have constructors.
2897 We actually wrap the entire body of the above in a STMT_EXPR, for
2900 When copying from array to another, when the array elements have
2901 only trivial copy constructors, we should use __builtin_memcpy
2902 rather than generating a loop. That way, we could take advantage
2903 of whatever cleverness the back-end has for dealing with copies
2904 of blocks of memory. */
2906 begin_init_stmts (&stmt_expr
, &compound_stmt
);
2907 destroy_temps
= stmts_are_full_exprs_p ();
2908 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2909 rval
= get_temp_regvar (ptype
, base
);
2910 base
= get_temp_regvar (ptype
, rval
);
2911 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2913 /* Protect the entire array initialization so that we can destroy
2914 the partially constructed array if an exception is thrown.
2915 But don't do this if we're assigning. */
2916 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2919 try_block
= begin_try_block ();
2920 try_body
= begin_compound_stmt (/*has_no_scope=*/1);
2923 if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
2925 /* Do non-default initialization of non-POD arrays resulting from
2926 brace-enclosed initializers. */
2931 for (elts
= CONSTRUCTOR_ELTS (init
); elts
; elts
= TREE_CHAIN (elts
))
2933 tree elt
= TREE_VALUE (elts
);
2934 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2936 num_initialized_elts
++;
2938 if (IS_AGGR_TYPE (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
2939 finish_expr_stmt (build_aggr_init (baseref
, elt
, 0));
2941 finish_expr_stmt (build_modify_expr (baseref
, NOP_EXPR
,
2944 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2945 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR
, iterator
, 0));
2948 /* Clear out INIT so that we don't get confused below. */
2951 else if (from_array
)
2953 /* If initializing one array from another, initialize element by
2954 element. We rely upon the below calls the do argument
2958 base2
= default_conversion (init
);
2959 itype
= TREE_TYPE (base2
);
2960 base2
= get_temp_regvar (itype
, base2
);
2961 itype
= TREE_TYPE (itype
);
2963 else if (TYPE_LANG_SPECIFIC (type
)
2964 && TYPE_NEEDS_CONSTRUCTING (type
)
2965 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2967 error ("initializer ends prematurely");
2968 return error_mark_node
;
2972 /* Now, default-initialize any remaining elements. We don't need to
2973 do that if a) the type does not need constructing, or b) we've
2974 already initialized all the elements.
2976 We do need to keep going if we're copying an array. */
2979 || (TYPE_NEEDS_CONSTRUCTING (type
)
2980 && ! (host_integerp (maxindex
, 0)
2981 && (num_initialized_elts
2982 == tree_low_cst (maxindex
, 0) + 1))))
2984 /* If the ITERATOR is equal to -1, then we don't have to loop;
2985 we've already initialized all the elements. */
2991 if_stmt
= begin_if_stmt ();
2992 finish_if_stmt_cond (build (NE_EXPR
, boolean_type_node
,
2993 iterator
, integer_minus_one_node
),
2996 /* Otherwise, loop through the elements. */
2997 do_stmt
= begin_do_stmt ();
2998 do_body
= begin_compound_stmt (/*has_no_scope=*/1);
3000 /* When we're not building a statement-tree, things are a little
3001 complicated. If, when we recursively call build_aggr_init,
3002 an expression containing a TARGET_EXPR is expanded, then it
3003 may get a cleanup. Then, the result of that expression is
3004 passed to finish_expr_stmt, which will call
3005 expand_start_target_temps/expand_end_target_temps. However,
3006 the latter call will not cause the cleanup to run because
3007 that block will still be on the block stack. So, we call
3008 expand_start_target_temps here manually; the corresponding
3009 call to expand_end_target_temps below will cause the cleanup
3011 if (!building_stmt_tree ())
3012 expand_start_target_temps ();
3016 tree to
= build1 (INDIRECT_REF
, type
, base
);
3020 from
= build1 (INDIRECT_REF
, itype
, base2
);
3024 if (from_array
== 2)
3025 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
3026 else if (TYPE_NEEDS_CONSTRUCTING (type
))
3027 elt_init
= build_aggr_init (to
, from
, 0);
3029 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
3031 my_friendly_abort (57);
3033 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3037 ("cannot initialize multi-dimensional array with initializer");
3038 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
3042 elt_init
= build_aggr_init (build1 (INDIRECT_REF
, type
, base
),
3045 /* The initialization of each array element is a
3046 full-expression, as per core issue 124. */
3047 if (!building_stmt_tree ())
3049 genrtl_expr_stmt (elt_init
);
3050 expand_end_target_temps ();
3054 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
3055 finish_expr_stmt (elt_init
);
3056 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
3059 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
3061 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base2
, 0));
3063 finish_compound_stmt (/*has_no_scope=*/1, do_body
);
3064 finish_do_body (do_stmt
);
3065 finish_do_stmt (build (NE_EXPR
, boolean_type_node
,
3066 build_unary_op (PREDECREMENT_EXPR
, iterator
, 0),
3067 integer_minus_one_node
),
3070 finish_then_clause (if_stmt
);
3074 /* Make sure to cleanup any partially constructed elements. */
3075 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
3080 finish_compound_stmt (/*has_no_scope=*/1, try_body
);
3081 finish_cleanup_try_block (try_block
);
3082 e
= build_vec_delete_1 (rval
,
3083 cp_build_binary_op (MINUS_EXPR
, maxindex
,
3086 sfk_base_destructor
,
3087 /*use_global_delete=*/0);
3088 finish_cleanup (e
, try_block
);
3091 /* The value of the array initialization is the address of the
3092 first element in the array. */
3093 finish_expr_stmt (rval
);
3095 stmt_expr
= finish_init_stmts (stmt_expr
, compound_stmt
);
3096 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
3100 /* Free up storage of type TYPE, at address ADDR.
3102 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
3105 VIRTUAL_SIZE is the amount of storage that was allocated, and is
3106 used as the second argument to operator delete. It can include
3107 things like padding and magic size cookies. It has virtual in it,
3108 because if you have a base pointer and you delete through a virtual
3109 destructor, it should be the size of the dynamic object, not the
3110 static object, see Free Store 12.5 ISO C++.
3112 This does not call any destructors. */
3115 build_x_delete (addr
, which_delete
, virtual_size
)
3120 int use_global_delete
= which_delete
& 1;
3121 int use_vec_delete
= !!(which_delete
& 2);
3122 enum tree_code code
= use_vec_delete
? VEC_DELETE_EXPR
: DELETE_EXPR
;
3123 int flags
= LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
);
3125 return build_op_delete_call (code
, addr
, virtual_size
, flags
, NULL_TREE
);
3128 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3132 build_dtor_call (exp
, dtor_kind
, flags
)
3134 special_function_kind dtor_kind
;
3141 case sfk_complete_destructor
:
3142 name
= complete_dtor_identifier
;
3145 case sfk_base_destructor
:
3146 name
= base_dtor_identifier
;
3149 case sfk_deleting_destructor
:
3150 name
= deleting_dtor_identifier
;
3154 my_friendly_abort (20000524);
3156 return build_method_call (exp
, name
, NULL_TREE
, NULL_TREE
, flags
);
3159 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3160 ADDR is an expression which yields the store to be destroyed.
3161 AUTO_DELETE is the name of the destructor to call, i.e., either
3162 sfk_complete_destructor, sfk_base_destructor, or
3163 sfk_deleting_destructor.
3165 FLAGS is the logical disjunction of zero or more LOOKUP_
3166 flags. See cp-tree.h for more info.
3168 This function does not delete an object's virtual base classes. */
3171 build_delete (type
, addr
, auto_delete
, flags
, use_global_delete
)
3173 special_function_kind auto_delete
;
3175 int use_global_delete
;
3181 if (addr
== error_mark_node
)
3182 return error_mark_node
;
3184 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3185 set to `error_mark_node' before it gets properly cleaned up. */
3186 if (type
== error_mark_node
)
3187 return error_mark_node
;
3189 type
= TYPE_MAIN_VARIANT (type
);
3191 if (TREE_CODE (type
) == POINTER_TYPE
)
3193 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3194 if (!VOID_TYPE_P (type
) && !complete_type_or_else (type
, addr
))
3195 return error_mark_node
;
3196 if (TREE_CODE (type
) == ARRAY_TYPE
)
3198 if (! IS_AGGR_TYPE (type
))
3200 /* Call the builtin operator delete. */
3201 return build_builtin_delete_call (addr
);
3203 if (TREE_SIDE_EFFECTS (addr
))
3204 addr
= save_expr (addr
);
3206 /* throw away const and volatile on target type of addr */
3207 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3208 ref
= build_indirect_ref (addr
, NULL_PTR
);
3210 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3213 if (TREE_SIDE_EFFECTS (addr
))
3214 addr
= save_expr (addr
);
3215 if (TYPE_DOMAIN (type
) == NULL_TREE
)
3217 error ("unknown array size in delete");
3218 return error_mark_node
;
3220 return build_vec_delete (addr
, array_type_nelts (type
),
3221 auto_delete
, use_global_delete
);
3225 /* Don't check PROTECT here; leave that decision to the
3226 destructor. If the destructor is accessible, call it,
3227 else report error. */
3228 addr
= build_unary_op (ADDR_EXPR
, addr
, 0);
3229 if (TREE_SIDE_EFFECTS (addr
))
3230 addr
= save_expr (addr
);
3232 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3234 ref
= build_indirect_ref (addr
, NULL_PTR
);
3237 my_friendly_assert (IS_AGGR_TYPE (type
), 220);
3239 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
3241 if (auto_delete
!= sfk_deleting_destructor
)
3242 return void_zero_node
;
3244 return build_op_delete_call
3245 (DELETE_EXPR
, addr
, c_sizeof_nowarn (type
),
3246 LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
),
3250 /* Below, we will reverse the order in which these calls are made.
3251 If we have a destructor, then that destructor will take care
3252 of the base classes; otherwise, we must do that here. */
3253 if (TYPE_HAS_DESTRUCTOR (type
))
3255 tree do_delete
= NULL_TREE
;
3258 if (use_global_delete
&& auto_delete
== sfk_deleting_destructor
)
3260 /* Delete the object. */
3261 do_delete
= build_builtin_delete_call (addr
);
3262 /* Otherwise, treat this like a complete object destructor
3264 auto_delete
= sfk_complete_destructor
;
3267 expr
= build_dtor_call (ref
, auto_delete
, flags
);
3269 expr
= build (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
3271 if (flags
& LOOKUP_DESTRUCTOR
)
3272 /* Explicit destructor call; don't check for null pointer. */
3273 ifexp
= integer_one_node
;
3275 /* Handle deleting a null pointer. */
3276 ifexp
= fold (cp_build_binary_op (NE_EXPR
, addr
, integer_zero_node
));
3278 if (ifexp
!= integer_one_node
)
3279 expr
= build (COND_EXPR
, void_type_node
,
3280 ifexp
, expr
, void_zero_node
);
3286 /* We only get here from finish_function for a destructor. */
3287 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (type
));
3288 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (type
);
3289 tree base_binfo
= n_baseclasses
> 0 ? TREE_VEC_ELT (binfos
, 0) : NULL_TREE
;
3290 tree exprstmt
= NULL_TREE
;
3292 /* Set this again before we call anything, as we might get called
3294 TYPE_HAS_DESTRUCTOR (type
) = 1;
3296 /* If we have member delete or vbases, we call delete in
3298 my_friendly_assert (auto_delete
== sfk_base_destructor
, 20000411);
3300 /* Take care of the remaining baseclasses. */
3301 for (i
= 0; i
< n_baseclasses
; i
++)
3303 base_binfo
= TREE_VEC_ELT (binfos
, i
);
3304 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
))
3305 || TREE_VIA_VIRTUAL (base_binfo
))
3308 expr
= build_scoped_method_call (ref
, base_binfo
,
3309 base_dtor_identifier
,
3312 exprstmt
= tree_cons (NULL_TREE
, expr
, exprstmt
);
3315 for (member
= TYPE_FIELDS (type
); member
; member
= TREE_CHAIN (member
))
3317 if (TREE_CODE (member
) != FIELD_DECL
)
3319 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member
)))
3321 tree this_member
= build_component_ref (ref
, DECL_NAME (member
), NULL_TREE
, 0);
3322 tree this_type
= TREE_TYPE (member
);
3323 expr
= build_delete (this_type
, this_member
,
3324 sfk_complete_destructor
, flags
, 0);
3325 exprstmt
= tree_cons (NULL_TREE
, expr
, exprstmt
);
3330 return build_compound_expr (exprstmt
);
3331 /* Virtual base classes make this function do nothing. */
3332 return void_zero_node
;
3336 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3339 build_vbase_delete (type
, decl
)
3342 tree vbases
= CLASSTYPE_VBASECLASSES (type
);
3343 tree result
= NULL_TREE
;
3344 tree addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
3346 my_friendly_assert (addr
!= error_mark_node
, 222);
3351 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases
))),
3353 result
= tree_cons (NULL_TREE
,
3354 build_delete (TREE_TYPE (this_addr
), this_addr
,
3355 sfk_base_destructor
,
3356 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0),
3358 vbases
= TREE_CHAIN (vbases
);
3360 return build_compound_expr (nreverse (result
));
3363 /* Build a C++ vector delete expression.
3364 MAXINDEX is the number of elements to be deleted.
3365 ELT_SIZE is the nominal size of each element in the vector.
3366 BASE is the expression that should yield the store to be deleted.
3367 This function expands (or synthesizes) these calls itself.
3368 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3370 This also calls delete for virtual baseclasses of elements of the vector.
3372 Update: MAXINDEX is no longer needed. The size can be extracted from the
3373 start of the vector for pointers, and from the type for arrays. We still
3374 use MAXINDEX for arrays because it happens to already have one of the
3375 values we'd have to extract. (We could use MAXINDEX with pointers to
3376 confirm the size, and trap if the numbers differ; not clear that it'd
3377 be worth bothering.) */
3380 build_vec_delete (base
, maxindex
, auto_delete_vec
, use_global_delete
)
3381 tree base
, maxindex
;
3382 special_function_kind auto_delete_vec
;
3383 int use_global_delete
;
3387 if (TREE_CODE (base
) == OFFSET_REF
)
3388 base
= resolve_offset_ref (base
);
3390 type
= TREE_TYPE (base
);
3392 base
= stabilize_reference (base
);
3394 /* Since we can use base many times, save_expr it. */
3395 if (TREE_SIDE_EFFECTS (base
))
3396 base
= save_expr (base
);
3398 if (TREE_CODE (type
) == POINTER_TYPE
)
3400 /* Step back one from start of vector, and read dimension. */
3403 type
= strip_array_types (TREE_TYPE (type
));
3406 cookie_addr
= build (MINUS_EXPR
,
3407 build_pointer_type (sizetype
),
3409 TYPE_SIZE_UNIT (sizetype
));
3410 maxindex
= build_indirect_ref (cookie_addr
, NULL_PTR
);
3416 cookie_addr
= build (MINUS_EXPR
, build_pointer_type (BI_header_type
),
3417 base
, get_cookie_size (type
));
3418 cookie
= build_indirect_ref (cookie_addr
, NULL_PTR
);
3419 maxindex
= build_component_ref (cookie
, nelts_identifier
,
3423 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3425 /* get the total number of things in the array, maxindex is a bad name */
3426 maxindex
= array_type_nelts_total (type
);
3427 type
= strip_array_types (type
);
3428 base
= build_unary_op (ADDR_EXPR
, base
, 1);
3432 if (base
!= error_mark_node
)
3433 error ("type to vector delete is neither pointer or array type");
3434 return error_mark_node
;
3437 return build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
,