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_P (binfo
) || TREE_VIA_VIRTUAL (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
) && !TYPE_PTRMEMFUNC_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. */
702 emit_base_init (mem_init_list
, base_init_list
)
707 tree rbase_init_list
, vbase_init_list
;
708 tree t
= current_class_type
;
709 tree t_binfo
= TYPE_BINFO (t
);
710 tree binfos
= BINFO_BASETYPES (t_binfo
);
712 int n_baseclasses
= BINFO_N_BASETYPES (t_binfo
);
714 mem_init_list
= sort_member_init (t
, mem_init_list
);
715 sort_base_init (t
, base_init_list
, &rbase_init_list
, &vbase_init_list
);
717 /* First, initialize the virtual base classes, if we are
718 constructing the most-derived object. */
719 if (TYPE_USES_VIRTUAL_BASECLASSES (t
))
721 tree first_arg
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
722 construct_virtual_bases (t
, current_class_ref
, current_class_ptr
,
723 vbase_init_list
, first_arg
);
726 /* Now, perform initialization of non-virtual base classes. */
727 for (i
= 0; i
< n_baseclasses
; i
++)
729 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
730 tree init
= void_list_node
;
732 if (TREE_VIA_VIRTUAL (base_binfo
))
735 my_friendly_assert (BINFO_INHERITANCE_CHAIN (base_binfo
) == t_binfo
,
738 if (TREE_PURPOSE (rbase_init_list
))
739 init
= TREE_VALUE (rbase_init_list
);
740 else if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo
)))
744 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
))
745 cp_warning ("base class `%#T' should be explicitly initialized in the copy constructor",
746 BINFO_TYPE (base_binfo
));
749 if (init
!= void_list_node
)
751 member
= convert_pointer_to_real (base_binfo
, current_class_ptr
);
752 expand_aggr_init_1 (base_binfo
, NULL_TREE
,
753 build_indirect_ref (member
, NULL
), init
,
757 expand_cleanup_for_base (base_binfo
, NULL_TREE
);
758 rbase_init_list
= TREE_CHAIN (rbase_init_list
);
761 /* Initialize the vtable pointers for the class. */
762 initialize_vtbl_ptrs (current_class_ptr
);
764 while (mem_init_list
)
770 member
= TREE_PURPOSE (mem_init_list
);
772 /* See if we had a user-specified member initialization. */
773 if (TREE_TYPE (mem_init_list
))
775 init
= TREE_VALUE (mem_init_list
);
780 init
= DECL_INITIAL (member
);
783 /* Effective C++ rule 12. */
784 if (warn_ecpp
&& init
== NULL_TREE
785 && !DECL_ARTIFICIAL (member
)
786 && TREE_CODE (TREE_TYPE (member
)) != ARRAY_TYPE
)
787 cp_warning ("`%D' should be initialized in the member initialization list", member
);
790 perform_member_init (member
, init
, from_init_list
);
791 mem_init_list
= TREE_CHAIN (mem_init_list
);
795 /* Returns the address of the vtable (i.e., the value that should be
796 assigned to the vptr) for BINFO. */
799 build_vtbl_address (binfo
)
802 tree binfo_for
= binfo
;
805 if (BINFO_VPTR_INDEX (binfo
) && TREE_VIA_VIRTUAL (binfo
)
806 && BINFO_PRIMARY_P (binfo
))
807 /* If this is a virtual primary base, then the vtable we want to store
808 is that for the base this is being used as the primary base of. We
809 can't simply skip the initialization, because we may be expanding the
810 inits of a subobject constructor where the virtual base layout
812 while (BINFO_PRIMARY_BASE_OF (binfo_for
))
813 binfo_for
= BINFO_PRIMARY_BASE_OF (binfo_for
);
815 /* Figure out what vtable BINFO's vtable is based on, and mark it as
817 vtbl
= get_vtbl_decl_for_binfo (binfo_for
);
818 assemble_external (vtbl
);
819 TREE_USED (vtbl
) = 1;
821 /* Now compute the address to use when initializing the vptr. */
822 vtbl
= BINFO_VTABLE (binfo_for
);
823 if (TREE_CODE (vtbl
) == VAR_DECL
)
825 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
826 TREE_CONSTANT (vtbl
) = 1;
832 /* This code sets up the virtual function tables appropriate for
833 the pointer DECL. It is a one-ply initialization.
835 BINFO is the exact type that DECL is supposed to be. In
836 multiple inheritance, this might mean "C's A" if C : A, B. */
839 expand_virtual_init (binfo
, decl
)
842 tree type
= BINFO_TYPE (binfo
);
844 tree vtype
, vtype_binfo
;
847 /* Compute the location of the vtable. */
848 vtype
= DECL_CONTEXT (TYPE_VFIELD (type
));
849 vtype_binfo
= get_binfo (vtype
, TREE_TYPE (TREE_TYPE (decl
)), 0);
851 /* Compute the initializer for vptr. */
852 vtbl
= build_vtbl_address (binfo
);
854 /* Under the new ABI, we may get this vptr from a VTT, if this is a
855 subobject constructor or subobject destructor. */
856 vtt_index
= BINFO_VPTR_INDEX (binfo
);
862 /* Compute the value to use, when there's a VTT. */
863 vtt_parm
= current_vtt_parm
;
864 vtbl2
= build (PLUS_EXPR
,
865 TREE_TYPE (vtt_parm
),
868 vtbl2
= build1 (INDIRECT_REF
, TREE_TYPE (vtbl
), vtbl2
);
870 /* The actual initializer is the VTT value only in the subobject
871 constructor. In maybe_clone_body we'll substitute NULL for
872 the vtt_parm in the case of the non-subobject constructor. */
873 vtbl
= build (COND_EXPR
,
875 build (EQ_EXPR
, boolean_type_node
,
876 current_in_charge_parm
, integer_zero_node
),
881 /* Compute the location of the vtpr. */
882 decl
= convert_pointer_to_real (vtype_binfo
, decl
);
883 vtbl_ptr
= build_vfield_ref (build_indirect_ref (decl
, NULL
), vtype
);
884 if (vtbl_ptr
== error_mark_node
)
887 /* Assign the vtable to the vptr. */
888 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
889 finish_expr_stmt (build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
));
892 /* If an exception is thrown in a constructor, those base classes already
893 constructed must be destroyed. This function creates the cleanup
894 for BINFO, which has just been constructed. If FLAG is non-NULL,
895 it is a DECL which is non-zero when this base needs to be
899 expand_cleanup_for_base (binfo
, flag
)
905 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
908 /* Call the destructor. */
909 expr
= (build_scoped_method_call
910 (current_class_ref
, binfo
, base_dtor_identifier
, NULL_TREE
));
912 expr
= fold (build (COND_EXPR
, void_type_node
,
913 truthvalue_conversion (flag
),
914 expr
, integer_zero_node
));
916 finish_subobject (expr
);
919 /* Subroutine of `expand_aggr_vbase_init'.
920 BINFO is the binfo of the type that is being initialized.
921 INIT_LIST is the list of initializers for the virtual baseclass. */
924 expand_aggr_vbase_init_1 (binfo
, exp
, addr
, init_list
)
925 tree binfo
, exp
, addr
, init_list
;
927 tree init
= purpose_member (binfo
, init_list
);
928 tree ref
= build_indirect_ref (addr
, NULL
);
931 init
= TREE_VALUE (init
);
932 /* Call constructors, but don't set up vtables. */
933 expand_aggr_init_1 (binfo
, exp
, ref
, init
, LOOKUP_COMPLAIN
);
936 /* Construct the virtual base-classes of THIS_REF (whose address is
937 THIS_PTR). The object has the indicated TYPE. The construction
938 actually takes place only if FLAG is non-zero. INIT_LIST is list
939 of initializations for constructors to perform. */
942 construct_virtual_bases (type
, this_ref
, this_ptr
, init_list
, flag
)
951 /* If there are no virtual baseclasses, we shouldn't even be here. */
952 my_friendly_assert (TYPE_USES_VIRTUAL_BASECLASSES (type
), 19990621);
954 /* First set the pointers in our object that tell us where to find
955 our virtual baseclasses. */
956 if (!vbase_offsets_in_vtable_p ())
961 if_stmt
= begin_if_stmt ();
962 finish_if_stmt_cond (flag
, if_stmt
);
963 result
= init_vbase_pointers (type
, this_ptr
);
965 finish_expr_stmt (build_compound_expr (result
));
966 finish_then_clause (if_stmt
);
970 /* Now, run through the baseclasses, initializing each. */
971 for (vbases
= CLASSTYPE_VBASECLASSES (type
); vbases
;
972 vbases
= TREE_CHAIN (vbases
))
979 /* If there are virtual base classes with destructors, we need to
980 emit cleanups to destroy them if an exception is thrown during
981 the construction process. These exception regions (i.e., the
982 period during which the cleanups must occur) begin from the time
983 the construction is complete to the end of the function. If we
984 create a conditional block in which to initialize the
985 base-classes, then the cleanup region for the virtual base begins
986 inside a block, and ends outside of that block. This situation
987 confuses the sjlj exception-handling code. Therefore, we do not
988 create a single conditional block, but one for each
989 initialization. (That way the cleanup regions always begin
990 in the outer block.) We trust the back-end to figure out
991 that the FLAG will not change across initializations, and
992 avoid doing multiple tests. */
993 inner_if_stmt
= begin_if_stmt ();
994 finish_if_stmt_cond (flag
, inner_if_stmt
);
995 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/1);
997 /* Compute the location of the virtual base. If we're
998 constructing virtual bases, then we must be the most derived
999 class. Therefore, we don't have to look up the virtual base;
1000 we already know where it is. */
1001 vbase
= TREE_VALUE (vbases
);
1002 exp
= build (PLUS_EXPR
,
1003 TREE_TYPE (this_ptr
),
1005 fold (build1 (NOP_EXPR
, TREE_TYPE (this_ptr
),
1006 BINFO_OFFSET (vbase
))));
1007 exp
= build1 (NOP_EXPR
,
1008 build_pointer_type (BINFO_TYPE (vbase
)),
1011 expand_aggr_vbase_init_1 (vbase
, this_ref
, exp
, init_list
);
1012 finish_compound_stmt (/*has_no_scope=*/1, compound_stmt
);
1013 finish_then_clause (inner_if_stmt
);
1016 expand_cleanup_for_base (vbase
, flag
);
1020 /* Find the context in which this FIELD can be initialized. */
1023 initializing_context (field
)
1026 tree t
= DECL_CONTEXT (field
);
1028 /* Anonymous union members can be initialized in the first enclosing
1029 non-anonymous union context. */
1030 while (t
&& ANON_AGGR_TYPE_P (t
))
1031 t
= TYPE_CONTEXT (t
);
1035 /* Function to give error message if member initialization specification
1036 is erroneous. FIELD is the member we decided to initialize.
1037 TYPE is the type for which the initialization is being performed.
1038 FIELD must be a member of TYPE.
1040 MEMBER_NAME is the name of the member. */
1043 member_init_ok_or_else (field
, type
, member_name
)
1046 const char *member_name
;
1048 if (field
== error_mark_node
)
1050 if (field
== NULL_TREE
|| initializing_context (field
) != type
)
1052 cp_error ("class `%T' does not have any field named `%s'", type
,
1056 if (TREE_STATIC (field
))
1058 cp_error ("field `%#D' is static; only point of initialization is its declaration",
1066 /* If NAME is a viable field name for the aggregate DECL,
1067 and PARMS is a viable parameter list, then expand an _EXPR
1068 which describes this initialization.
1070 Note that we do not need to chase through the class's base classes
1071 to look for NAME, because if it's in that list, it will be handled
1072 by the constructor for that base class.
1074 We do not yet have a fixed-point finder to instantiate types
1075 being fed to overloaded constructors. If there is a unique
1076 constructor, then argument types can be got from that one. */
1079 expand_member_init (exp
, name
, init
)
1080 tree exp
, name
, init
;
1082 tree basetype
= NULL_TREE
, field
;
1085 if (exp
== NULL_TREE
)
1088 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
1090 if (name
&& TYPE_P (name
))
1093 name
= TYPE_IDENTIFIER (name
);
1095 else if (name
&& TREE_CODE (name
) == TYPE_DECL
)
1097 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
1098 name
= DECL_NAME (name
);
1101 if (name
== NULL_TREE
&& IS_AGGR_TYPE (type
))
1102 switch (CLASSTYPE_N_BASECLASSES (type
))
1105 error ("base class initializer specified, but no base class to initialize");
1108 basetype
= TYPE_BINFO_BASETYPE (type
, 0);
1111 error ("initializer for unnamed base class ambiguous");
1112 cp_error ("(type `%T' uses multiple inheritance)", type
);
1116 my_friendly_assert (init
!= NULL_TREE
, 0);
1118 /* The grammar should not allow fields which have names that are
1119 TYPENAMEs. Therefore, if the field has a non-NULL TREE_TYPE, we
1120 may assume that this is an attempt to initialize a base class
1121 member of the current type. Otherwise, it is an attempt to
1122 initialize a member field. */
1124 if (init
== void_type_node
)
1127 if (name
== NULL_TREE
|| basetype
)
1129 if (name
== NULL_TREE
)
1133 name
= TYPE_IDENTIFIER (basetype
);
1136 error ("no base class to initialize");
1141 else if (basetype
!= type
1142 && ! current_template_parms
1143 && ! vec_binfo_member (basetype
,
1144 TYPE_BINFO_BASETYPES (type
))
1145 && ! binfo_for_vbase (basetype
, type
))
1147 if (IDENTIFIER_CLASS_VALUE (name
))
1149 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
1150 cp_error ("type `%T' is not an immediate or virtual basetype for `%T'",
1153 cp_error ("type `%T' is not an immediate basetype for `%T'",
1158 init
= build_tree_list (basetype
, init
);
1163 field
= lookup_field (type
, name
, 1, 0);
1165 if (! member_init_ok_or_else (field
, type
, IDENTIFIER_POINTER (name
)))
1168 init
= build_tree_list (field
, init
);
1174 /* This is like `expand_member_init', only it stores one aggregate
1177 INIT comes in two flavors: it is either a value which
1178 is to be stored in EXP, or it is a parameter list
1179 to go to a constructor, which will operate on EXP.
1180 If INIT is not a parameter list for a constructor, then set
1181 LOOKUP_ONLYCONVERTING.
1182 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1183 the initializer, if FLAGS is 0, then it is the (init) form.
1184 If `init' is a CONSTRUCTOR, then we emit a warning message,
1185 explaining that such initializations are invalid.
1187 If INIT resolves to a CALL_EXPR which happens to return
1188 something of the type we are looking for, then we know
1189 that we can safely use that call to perform the
1192 The virtual function table pointer cannot be set up here, because
1193 we do not really know its type.
1195 Virtual baseclass pointers are also set up here.
1197 This never calls operator=().
1199 When initializing, nothing is CONST.
1201 A default copy constructor may have to be used to perform the
1204 A constructor or a conversion operator may have to be used to
1205 perform the initialization, but not both, as it would be ambiguous. */
1208 build_aggr_init (exp
, init
, flags
)
1215 tree type
= TREE_TYPE (exp
);
1216 int was_const
= TREE_READONLY (exp
);
1217 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1219 if (init
== error_mark_node
)
1220 return error_mark_node
;
1222 TREE_READONLY (exp
) = 0;
1223 TREE_THIS_VOLATILE (exp
) = 0;
1225 if (init
&& TREE_CODE (init
) != TREE_LIST
)
1226 flags
|= LOOKUP_ONLYCONVERTING
;
1228 if (TREE_CODE (type
) == ARRAY_TYPE
)
1230 /* Must arrange to initialize each element of EXP
1231 from elements of INIT. */
1232 tree itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1236 /* Handle bad initializers like:
1240 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1244 int main(int argc, char **argv) {
1245 COMPLEX zees(1.0, 0.0)[10];
1248 cp_error ("bad array initializer");
1249 return error_mark_node
;
1251 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
1253 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1255 TREE_TYPE (init
) = TYPE_MAIN_VARIANT (itype
);
1257 stmt_expr
= build_vec_init (exp
, init
,
1258 init
&& same_type_p (TREE_TYPE (init
),
1260 TREE_READONLY (exp
) = was_const
;
1261 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1262 TREE_TYPE (exp
) = type
;
1264 TREE_TYPE (init
) = itype
;
1268 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1269 /* just know that we've seen something for this node */
1270 TREE_USED (exp
) = 1;
1272 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1273 begin_init_stmts (&stmt_expr
, &compound_stmt
);
1274 destroy_temps
= stmts_are_full_exprs_p ();
1275 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
1276 expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
1277 init
, LOOKUP_NORMAL
|flags
);
1278 stmt_expr
= finish_init_stmts (stmt_expr
, compound_stmt
);
1279 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
1280 TREE_TYPE (exp
) = type
;
1281 TREE_READONLY (exp
) = was_const
;
1282 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1288 expand_default_init (binfo
, true_exp
, exp
, init
, flags
)
1294 tree type
= TREE_TYPE (exp
);
1297 /* It fails because there may not be a constructor which takes
1298 its own type as the first (or only parameter), but which does
1299 take other types via a conversion. So, if the thing initializing
1300 the expression is a unit element of type X, first try X(X&),
1301 followed by initialization by X. If neither of these work
1302 out, then look hard. */
1306 if (init
&& TREE_CODE (init
) != TREE_LIST
1307 && (flags
& LOOKUP_ONLYCONVERTING
))
1309 /* Base subobjects should only get direct-initialization. */
1310 if (true_exp
!= exp
)
1313 if (flags
& DIRECT_BIND
)
1314 /* Do nothing. We hit this in two cases: Reference initialization,
1315 where we aren't initializing a real variable, so we don't want
1316 to run a new constructor; and catching an exception, where we
1317 have already built up the constructor call so we could wrap it
1318 in an exception region. */;
1319 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1320 /* A brace-enclosed initializer has whatever type is
1321 required. There's no need to convert it. */
1324 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1326 if (TREE_CODE (init
) == TRY_CATCH_EXPR
)
1327 /* We need to protect the initialization of a catch parm
1328 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1329 around the TARGET_EXPR for the copy constructor. See
1330 expand_start_catch_block. */
1331 TREE_OPERAND (init
, 0) = build (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1332 TREE_OPERAND (init
, 0));
1334 init
= build (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1335 TREE_SIDE_EFFECTS (init
) = 1;
1336 finish_expr_stmt (init
);
1340 if (init
== NULL_TREE
1341 || (TREE_CODE (init
) == TREE_LIST
&& ! TREE_TYPE (init
)))
1345 init
= TREE_VALUE (parms
);
1348 parms
= build_tree_list (NULL_TREE
, init
);
1350 if (true_exp
== exp
)
1351 ctor_name
= complete_ctor_identifier
;
1353 ctor_name
= base_ctor_identifier
;
1355 rval
= build_method_call (exp
, ctor_name
, parms
, binfo
, flags
);
1356 if (TREE_SIDE_EFFECTS (rval
))
1358 if (building_stmt_tree ())
1359 finish_expr_stmt (rval
);
1361 genrtl_expr_stmt (rval
);
1365 /* This function is responsible for initializing EXP with INIT
1368 BINFO is the binfo of the type for who we are performing the
1369 initialization. For example, if W is a virtual base class of A and B,
1371 If we are initializing B, then W must contain B's W vtable, whereas
1372 were we initializing C, W must contain C's W vtable.
1374 TRUE_EXP is nonzero if it is the true expression being initialized.
1375 In this case, it may be EXP, or may just contain EXP. The reason we
1376 need this is because if EXP is a base element of TRUE_EXP, we
1377 don't necessarily know by looking at EXP where its virtual
1378 baseclass fields should really be pointing. But we do know
1379 from TRUE_EXP. In constructors, we don't know anything about
1380 the value being initialized.
1382 FLAGS is just passes to `build_method_call'. See that function for
1386 expand_aggr_init_1 (binfo
, true_exp
, exp
, init
, flags
)
1392 tree type
= TREE_TYPE (exp
);
1394 my_friendly_assert (init
!= error_mark_node
&& type
!= error_mark_node
, 211);
1396 /* Use a function returning the desired type to initialize EXP for us.
1397 If the function is a constructor, and its first argument is
1398 NULL_TREE, know that it was meant for us--just slide exp on
1399 in and expand the constructor. Constructors now come
1402 if (init
&& TREE_CODE (exp
) == VAR_DECL
1403 && TREE_CODE (init
) == CONSTRUCTOR
1404 && TREE_HAS_CONSTRUCTOR (init
))
1406 /* If store_init_value returns NULL_TREE, the INIT has been
1407 record in the DECL_INITIAL for EXP. That means there's
1408 nothing more we have to do. */
1409 if (!store_init_value (exp
, init
))
1411 if (!building_stmt_tree ())
1412 expand_decl_init (exp
);
1415 finish_expr_stmt (build (INIT_EXPR
, type
, exp
, init
));
1419 /* We know that expand_default_init can handle everything we want
1421 expand_default_init (binfo
, true_exp
, exp
, init
, flags
);
1424 /* Report an error if TYPE is not a user-defined, aggregate type. If
1425 OR_ELSE is nonzero, give an error message. */
1428 is_aggr_type (type
, or_else
)
1432 if (type
== error_mark_node
)
1435 if (! IS_AGGR_TYPE (type
)
1436 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1437 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1440 cp_error ("`%T' is not an aggregate type", type
);
1446 /* Like is_aggr_typedef, but returns typedef if successful. */
1449 get_aggr_from_typedef (name
, or_else
)
1455 if (name
== error_mark_node
)
1458 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1459 type
= IDENTIFIER_TYPE_VALUE (name
);
1463 cp_error ("`%T' fails to be an aggregate typedef", name
);
1467 if (! IS_AGGR_TYPE (type
)
1468 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1469 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1472 cp_error ("type `%T' is of non-aggregate type", type
);
1479 get_type_value (name
)
1482 if (name
== error_mark_node
)
1485 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1486 return IDENTIFIER_TYPE_VALUE (name
);
1492 /* This code could just as well go in `class.c', but is placed here for
1495 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1496 the appropriate function call. */
1499 build_member_call (type
, name
, parmlist
)
1500 tree type
, name
, parmlist
;
1505 tree basetype_path
, decl
;
1507 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
1508 && TREE_CODE (type
) == NAMESPACE_DECL
)
1510 /* 'name' already refers to the decls from the namespace, since we
1511 hit do_identifier for template_ids. */
1512 method_name
= TREE_OPERAND (name
, 0);
1513 /* FIXME: Since we don't do independent names right yet, the
1514 name might also be a LOOKUP_EXPR. Once we resolve this to a
1515 real decl earlier, this can go. This may happen during
1517 if (TREE_CODE (method_name
) == LOOKUP_EXPR
)
1519 method_name
= lookup_namespace_name
1520 (type
, TREE_OPERAND (method_name
, 0));
1521 TREE_OPERAND (name
, 0) = method_name
;
1523 my_friendly_assert (is_overloaded_fn (method_name
), 980519);
1524 return build_x_function_call (name
, parmlist
, current_class_ref
);
1528 name
= DECL_NAME (name
);
1530 if (type
== fake_std_node
)
1531 return build_x_function_call (do_scoped_id (name
, 0), parmlist
,
1533 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1534 return build_x_function_call (lookup_namespace_name (type
, name
),
1535 parmlist
, current_class_ref
);
1537 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1539 method_name
= TREE_OPERAND (name
, 0);
1540 if (TREE_CODE (method_name
) == COMPONENT_REF
)
1541 method_name
= TREE_OPERAND (method_name
, 1);
1542 if (is_overloaded_fn (method_name
))
1543 method_name
= DECL_NAME (OVL_CURRENT (method_name
));
1544 TREE_OPERAND (name
, 0) = method_name
;
1549 if (TREE_CODE (method_name
) == BIT_NOT_EXPR
)
1551 method_name
= TREE_OPERAND (method_name
, 0);
1555 /* This shouldn't be here, and build_member_call shouldn't appear in
1557 if (type
&& TREE_CODE (type
) == IDENTIFIER_NODE
1558 && get_aggr_from_typedef (type
, 0) == 0)
1560 tree ns
= lookup_name (type
, 0);
1561 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
)
1563 return build_x_function_call (build_offset_ref (type
, name
), parmlist
, current_class_ref
);
1567 if (type
== NULL_TREE
|| ! is_aggr_type (type
, 1))
1568 return error_mark_node
;
1570 /* An operator we did not like. */
1571 if (name
== NULL_TREE
)
1572 return error_mark_node
;
1576 cp_error ("cannot call destructor `%T::~%T' without object", type
,
1578 return error_mark_node
;
1581 decl
= maybe_dummy_object (type
, &basetype_path
);
1583 /* Convert 'this' to the specified type to disambiguate conversion
1584 to the function's context. Apparently Standard C++ says that we
1585 shouldn't do this. */
1586 if (decl
== current_class_ref
1588 && ACCESSIBLY_UNIQUELY_DERIVED_P (type
, current_class_type
))
1590 tree olddecl
= current_class_ptr
;
1591 tree oldtype
= TREE_TYPE (TREE_TYPE (olddecl
));
1592 if (oldtype
!= type
)
1594 tree newtype
= build_qualified_type (type
, TYPE_QUALS (oldtype
));
1595 decl
= convert_force (build_pointer_type (newtype
), olddecl
, 0);
1596 decl
= build_indirect_ref (decl
, NULL
);
1600 if (method_name
== constructor_name (type
)
1601 || method_name
== constructor_name_full (type
))
1602 return build_functional_cast (type
, parmlist
);
1603 if (lookup_fnfields (basetype_path
, method_name
, 0))
1604 return build_method_call (decl
,
1605 TREE_CODE (name
) == TEMPLATE_ID_EXPR
1606 ? name
: method_name
,
1607 parmlist
, basetype_path
,
1608 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
);
1609 if (TREE_CODE (name
) == IDENTIFIER_NODE
1610 && ((t
= lookup_field (TYPE_BINFO (type
), name
, 1, 0))))
1612 if (t
== error_mark_node
)
1613 return error_mark_node
;
1614 if (TREE_CODE (t
) == FIELD_DECL
)
1616 if (is_dummy_object (decl
))
1618 cp_error ("invalid use of non-static field `%D'", t
);
1619 return error_mark_node
;
1621 decl
= build (COMPONENT_REF
, TREE_TYPE (t
), decl
, t
);
1623 else if (TREE_CODE (t
) == VAR_DECL
)
1627 cp_error ("invalid use of member `%D'", t
);
1628 return error_mark_node
;
1630 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl
)))
1631 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, decl
,
1632 parmlist
, NULL_TREE
);
1633 return build_function_call (decl
, parmlist
);
1637 cp_error ("no method `%T::%D'", type
, name
);
1638 return error_mark_node
;
1642 /* Build a reference to a member of an aggregate. This is not a
1643 C++ `&', but really something which can have its address taken,
1644 and then act as a pointer to member, for example TYPE :: FIELD
1645 can have its address taken by saying & TYPE :: FIELD.
1647 @@ Prints out lousy diagnostics for operator <typename>
1650 @@ This function should be rewritten and placed in search.c. */
1653 build_offset_ref (type
, name
)
1656 tree decl
, t
= error_mark_node
;
1658 tree basebinfo
= NULL_TREE
;
1659 tree orig_name
= name
;
1661 /* class templates can come in as TEMPLATE_DECLs here. */
1662 if (TREE_CODE (name
) == TEMPLATE_DECL
)
1665 if (type
== fake_std_node
)
1666 return do_scoped_id (name
, 0);
1668 if (processing_template_decl
|| uses_template_parms (type
))
1669 return build_min_nt (SCOPE_REF
, type
, name
);
1671 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1673 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1674 something like `a.template f<int>' or the like. For the most
1675 part, we treat this just like a.f. We do remember, however,
1676 the template-id that was used. */
1677 name
= TREE_OPERAND (orig_name
, 0);
1680 name
= DECL_NAME (name
);
1683 if (TREE_CODE (name
) == LOOKUP_EXPR
)
1684 /* This can happen during tsubst'ing. */
1685 name
= TREE_OPERAND (name
, 0);
1688 if (TREE_CODE (name
) == COMPONENT_REF
)
1689 name
= TREE_OPERAND (name
, 1);
1690 if (TREE_CODE (name
) == OVERLOAD
)
1691 name
= DECL_NAME (OVL_CURRENT (name
));
1695 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 0);
1698 if (type
== NULL_TREE
)
1699 return error_mark_node
;
1701 /* Handle namespace names fully here. */
1702 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1704 t
= lookup_namespace_name (type
, name
);
1705 if (t
== error_mark_node
)
1707 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1708 /* Reconstruct the TEMPLATE_ID_EXPR. */
1709 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
),
1710 t
, TREE_OPERAND (orig_name
, 1));
1711 if (! type_unknown_p (t
))
1714 t
= convert_from_reference (t
);
1719 if (! is_aggr_type (type
, 1))
1720 return error_mark_node
;
1722 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1724 if (! check_dtor_name (type
, name
))
1725 cp_error ("qualified type `%T' does not match destructor name `~%T'",
1726 type
, TREE_OPERAND (name
, 0));
1727 name
= dtor_identifier
;
1730 if (!COMPLETE_TYPE_P (complete_type (type
))
1731 && !TYPE_BEING_DEFINED (type
))
1733 cp_error ("incomplete type `%T' does not have member `%D'", type
,
1735 return error_mark_node
;
1738 decl
= maybe_dummy_object (type
, &basebinfo
);
1740 member
= lookup_member (basebinfo
, name
, 1, 0);
1742 if (member
== error_mark_node
)
1743 return error_mark_node
;
1745 /* A lot of this logic is now handled in lookup_member. */
1746 if (member
&& BASELINK_P (member
))
1748 /* Go from the TREE_BASELINK to the member function info. */
1749 tree fnfields
= member
;
1750 t
= TREE_VALUE (fnfields
);
1752 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1754 /* The FNFIELDS are going to contain functions that aren't
1755 necessarily templates, and templates that don't
1756 necessarily match the explicit template parameters. We
1757 save all the functions, and the explicit parameters, and
1758 then figure out exactly what to instantiate with what
1759 arguments in instantiate_type. */
1761 if (TREE_CODE (t
) != OVERLOAD
)
1762 /* The code in instantiate_type which will process this
1763 expects to encounter OVERLOADs, not raw functions. */
1764 t
= ovl_cons (t
, NULL_TREE
);
1766 t
= build (TEMPLATE_ID_EXPR
, TREE_TYPE (t
), t
,
1767 TREE_OPERAND (orig_name
, 1));
1768 t
= build (OFFSET_REF
, unknown_type_node
, decl
, t
);
1770 PTRMEM_OK_P (t
) = 1;
1775 if (!really_overloaded_fn (t
))
1777 /* Get rid of a potential OVERLOAD around it */
1778 t
= OVL_CURRENT (t
);
1780 /* unique functions are handled easily. */
1781 if (!enforce_access (basebinfo
, t
))
1782 return error_mark_node
;
1784 if (DECL_STATIC_FUNCTION_P (t
))
1786 t
= build (OFFSET_REF
, TREE_TYPE (t
), decl
, t
);
1787 PTRMEM_OK_P (t
) = 1;
1791 TREE_TYPE (fnfields
) = unknown_type_node
;
1793 t
= build (OFFSET_REF
, unknown_type_node
, decl
, fnfields
);
1794 PTRMEM_OK_P (t
) = 1;
1802 cp_error ("`%D' is not a member of type `%T'", name
, type
);
1803 return error_mark_node
;
1806 if (TREE_CODE (t
) == TYPE_DECL
)
1811 /* static class members and class-specific enum
1812 values can be returned without further ado. */
1813 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == CONST_DECL
)
1816 return convert_from_reference (t
);
1819 if (TREE_CODE (t
) == FIELD_DECL
&& DECL_C_BIT_FIELD (t
))
1821 cp_error ("illegal pointer to bit field `%D'", t
);
1822 return error_mark_node
;
1825 /* static class functions too. */
1826 if (TREE_CODE (t
) == FUNCTION_DECL
1827 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1828 my_friendly_abort (53);
1830 /* In member functions, the form `type::name' is no longer
1831 equivalent to `this->type::name', at least not until
1832 resolve_offset_ref. */
1833 t
= build (OFFSET_REF
, build_offset_type (type
, TREE_TYPE (t
)), decl
, t
);
1834 PTRMEM_OK_P (t
) = 1;
1838 /* If a OFFSET_REF made it through to here, then it did
1839 not have its address taken. */
1842 resolve_offset_ref (exp
)
1845 tree type
= TREE_TYPE (exp
);
1846 tree base
= NULL_TREE
;
1848 tree basetype
, addr
;
1850 if (TREE_CODE (exp
) == OFFSET_REF
)
1852 member
= TREE_OPERAND (exp
, 1);
1853 base
= TREE_OPERAND (exp
, 0);
1857 my_friendly_assert (TREE_CODE (type
) == OFFSET_TYPE
, 214);
1858 if (TYPE_OFFSET_BASETYPE (type
) != current_class_type
)
1860 error ("object missing in use of pointer-to-member construct");
1861 return error_mark_node
;
1864 type
= TREE_TYPE (type
);
1865 base
= current_class_ref
;
1868 if (BASELINK_P (member
) || TREE_CODE (member
) == TEMPLATE_ID_EXPR
)
1869 return build_unary_op (ADDR_EXPR
, exp
, 0);
1871 if (TREE_CODE (TREE_TYPE (member
)) == METHOD_TYPE
)
1873 if (!flag_ms_extensions
)
1874 /* A single non-static member, make sure we don't allow a
1875 pointer-to-member. */
1876 exp
= ovl_cons (member
, NULL_TREE
);
1878 return build_unary_op (ADDR_EXPR
, exp
, 0);
1881 if ((TREE_CODE (member
) == VAR_DECL
1882 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member
))
1883 && ! TYPE_PTRMEM_P (TREE_TYPE (member
)))
1884 || TREE_CODE (TREE_TYPE (member
)) == FUNCTION_TYPE
)
1886 /* These were static members. */
1887 if (mark_addressable (member
) == 0)
1888 return error_mark_node
;
1892 if (TREE_CODE (TREE_TYPE (member
)) == POINTER_TYPE
1893 && TREE_CODE (TREE_TYPE (TREE_TYPE (member
))) == METHOD_TYPE
)
1896 /* Syntax error can cause a member which should
1897 have been seen as static to be grok'd as non-static. */
1898 if (TREE_CODE (member
) == FIELD_DECL
&& current_class_ref
== NULL_TREE
)
1900 cp_error_at ("member `%D' is non-static but referenced as a static member",
1902 error ("at this point in file");
1903 return error_mark_node
;
1906 /* The first case is really just a reference to a member of `this'. */
1907 if (TREE_CODE (member
) == FIELD_DECL
1908 && (base
== current_class_ref
|| is_dummy_object (base
)))
1912 basetype
= DECL_CONTEXT (member
);
1914 /* Try to get to basetype from 'this'; if that doesn't work,
1916 base
= current_class_ref
;
1918 /* First convert to the intermediate base specified, if appropriate. */
1919 if (TREE_CODE (exp
) == OFFSET_REF
&& TREE_CODE (type
) == OFFSET_TYPE
)
1920 base
= build_scoped_ref (base
, TYPE_OFFSET_BASETYPE (type
));
1922 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1923 addr
= convert_pointer_to (basetype
, addr
);
1925 if (addr
== error_mark_node
)
1926 return error_mark_node
;
1928 expr
= build (COMPONENT_REF
, TREE_TYPE (member
),
1929 build_indirect_ref (addr
, NULL
), member
);
1930 return convert_from_reference (expr
);
1933 /* Ensure that we have an object. */
1934 if (is_dummy_object (base
))
1935 addr
= error_mark_node
;
1937 /* If this is a reference to a member function, then return the
1938 address of the member function (which may involve going
1939 through the object's vtable), otherwise, return an expression
1940 for the dereferenced pointer-to-member construct. */
1941 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1943 if (TYPE_PTRMEM_P (TREE_TYPE (member
)))
1945 if (addr
== error_mark_node
)
1947 cp_error ("object missing in `%E'", exp
);
1948 return error_mark_node
;
1951 basetype
= TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member
)));
1952 addr
= convert_pointer_to (basetype
, addr
);
1953 member
= cp_convert (ptrdiff_type_node
, member
);
1955 return build1 (INDIRECT_REF
, type
,
1956 build (PLUS_EXPR
, build_pointer_type (type
),
1959 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member
)))
1961 return get_member_function_from_ptrfunc (&addr
, member
);
1963 my_friendly_abort (56);
1968 /* If DECL is a `const' declaration, and its value is a known
1969 constant, then return that value. */
1972 decl_constant_value (decl
)
1975 if (TREE_READONLY_DECL_P (decl
)
1976 && ! TREE_THIS_VOLATILE (decl
)
1977 && DECL_INITIAL (decl
)
1978 && DECL_INITIAL (decl
) != error_mark_node
1979 /* This is invalid if initial value is not constant.
1980 If it has either a function call, a memory reference,
1981 or a variable, then re-evaluating it could give different results. */
1982 && TREE_CONSTANT (DECL_INITIAL (decl
))
1983 /* Check for cases where this is sub-optimal, even though valid. */
1984 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1985 return DECL_INITIAL (decl
);
1989 /* Common subroutines of build_new and build_vec_delete. */
1991 /* Call the global __builtin_delete to delete ADDR. */
1994 build_builtin_delete_call (addr
)
1997 mark_used (global_delete_fndecl
);
1998 return build_call (global_delete_fndecl
, build_tree_list (NULL_TREE
, addr
));
2001 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
2002 (which needs to go through some sort of groktypename) or it
2003 is the name of the class we are newing. INIT is an initialization value.
2004 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
2005 If INIT is void_type_node, it means do *not* call a constructor
2008 For types with constructors, the data returned is initialized
2009 by the appropriate constructor.
2011 Whether the type has a constructor or not, if it has a pointer
2012 to a virtual function table, then that pointer is set up
2015 Unless I am mistaken, a call to new () will return initialized
2016 data regardless of whether the constructor itself is private or
2017 not. NOPE; new fails if the constructor is private (jcm).
2019 Note that build_new does nothing to assure that any special
2020 alignment requirements of the type are met. Rather, it leaves
2021 it up to malloc to do the right thing. Otherwise, folding to
2022 the right alignment cal cause problems if the user tries to later
2023 free the memory returned by `new'.
2025 PLACEMENT is the `placement' list for user-defined operator new (). */
2028 build_new (placement
, decl
, init
, use_global_new
)
2034 tree nelts
= NULL_TREE
, t
;
2037 if (decl
== error_mark_node
)
2038 return error_mark_node
;
2040 if (TREE_CODE (decl
) == TREE_LIST
)
2042 tree absdcl
= TREE_VALUE (decl
);
2043 tree last_absdcl
= NULL_TREE
;
2045 if (current_function_decl
2046 && DECL_CONSTRUCTOR_P (current_function_decl
))
2047 my_friendly_assert (immediate_size_expand
== 0, 19990926);
2049 nelts
= integer_one_node
;
2051 if (absdcl
&& TREE_CODE (absdcl
) == CALL_EXPR
)
2052 my_friendly_abort (215);
2053 while (absdcl
&& TREE_CODE (absdcl
) == INDIRECT_REF
)
2055 last_absdcl
= absdcl
;
2056 absdcl
= TREE_OPERAND (absdcl
, 0);
2059 if (absdcl
&& TREE_CODE (absdcl
) == ARRAY_REF
)
2061 /* probably meant to be a vec new */
2064 while (TREE_OPERAND (absdcl
, 0)
2065 && TREE_CODE (TREE_OPERAND (absdcl
, 0)) == ARRAY_REF
)
2067 last_absdcl
= absdcl
;
2068 absdcl
= TREE_OPERAND (absdcl
, 0);
2072 this_nelts
= TREE_OPERAND (absdcl
, 1);
2073 if (this_nelts
!= error_mark_node
)
2075 if (this_nelts
== NULL_TREE
)
2076 error ("new of array type fails to specify size");
2077 else if (processing_template_decl
)
2080 absdcl
= TREE_OPERAND (absdcl
, 0);
2084 if (build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
2087 pedwarn ("size in array new must have integral type");
2089 this_nelts
= save_expr (cp_convert (sizetype
, this_nelts
));
2090 absdcl
= TREE_OPERAND (absdcl
, 0);
2091 if (this_nelts
== integer_zero_node
)
2093 warning ("zero size array reserves no space");
2094 nelts
= integer_zero_node
;
2097 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
2101 nelts
= integer_zero_node
;
2105 TREE_OPERAND (last_absdcl
, 0) = absdcl
;
2107 TREE_VALUE (decl
) = absdcl
;
2109 type
= groktypename (decl
);
2110 if (! type
|| type
== error_mark_node
)
2111 return error_mark_node
;
2113 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
2115 if (IDENTIFIER_HAS_TYPE_VALUE (decl
))
2117 /* An aggregate type. */
2118 type
= IDENTIFIER_TYPE_VALUE (decl
);
2119 decl
= TYPE_MAIN_DECL (type
);
2123 /* A builtin type. */
2124 decl
= lookup_name (decl
, 1);
2125 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 215);
2126 type
= TREE_TYPE (decl
);
2129 else if (TREE_CODE (decl
) == TYPE_DECL
)
2131 type
= TREE_TYPE (decl
);
2136 decl
= TYPE_MAIN_DECL (type
);
2139 if (processing_template_decl
)
2142 t
= tree_cons (tree_cons (NULL_TREE
, type
, NULL_TREE
),
2143 build_min_nt (ARRAY_REF
, NULL_TREE
, nelts
),
2148 rval
= build_min_nt (NEW_EXPR
, placement
, t
, init
);
2149 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2153 /* ``A reference cannot be created by the new operator. A reference
2154 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2155 returned by new.'' ARM 5.3.3 */
2156 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2158 error ("new cannot be applied to a reference type");
2159 type
= TREE_TYPE (type
);
2162 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2164 error ("new cannot be applied to a function type");
2165 return error_mark_node
;
2168 /* When the object being created is an array, the new-expression yields a
2169 pointer to the initial element (if any) of the array. For example,
2170 both new int and new int[10] return an int*. 5.3.4. */
2171 if (TREE_CODE (type
) == ARRAY_TYPE
&& has_array
== 0)
2173 nelts
= array_type_nelts_top (type
);
2175 type
= TREE_TYPE (type
);
2179 t
= build_nt (ARRAY_REF
, type
, nelts
);
2183 rval
= build (NEW_EXPR
, build_pointer_type (type
), placement
, t
, init
);
2184 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2185 TREE_SIDE_EFFECTS (rval
) = 1;
2186 rval
= build_new_1 (rval
);
2187 if (rval
== error_mark_node
)
2188 return error_mark_node
;
2190 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2191 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
2192 TREE_NO_UNUSED_WARNING (rval
) = 1;
2197 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2200 build_java_class_ref (type
)
2203 tree name
, class_decl
;
2204 static tree CL_suffix
= NULL_TREE
;
2205 if (CL_suffix
== NULL_TREE
)
2206 CL_suffix
= get_identifier("class$");
2207 if (jclass_node
== NULL_TREE
)
2209 jclass_node
= IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2210 if (jclass_node
== NULL_TREE
)
2211 fatal_error ("call to Java constructor, while `jclass' undefined");
2213 jclass_node
= TREE_TYPE (jclass_node
);
2216 /* 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 mangle_decl (field
);
2223 name
= DECL_ASSEMBLER_NAME (field
);
2227 internal_error ("Can't find class$");
2230 class_decl
= IDENTIFIER_GLOBAL_VALUE (name
);
2231 if (class_decl
== NULL_TREE
)
2233 class_decl
= build_decl (VAR_DECL
, name
, TREE_TYPE (jclass_node
));
2234 TREE_STATIC (class_decl
) = 1;
2235 DECL_EXTERNAL (class_decl
) = 1;
2236 TREE_PUBLIC (class_decl
) = 1;
2237 DECL_ARTIFICIAL (class_decl
) = 1;
2238 DECL_IGNORED_P (class_decl
) = 1;
2239 pushdecl_top_level (class_decl
);
2240 make_decl_rtl (class_decl
, NULL
);
2245 /* Returns the size of the cookie to use when allocating an array
2246 whose elements have the indicated TYPE. Assumes that it is already
2247 known that a cookie is needed. */
2250 get_cookie_size (type
)
2255 /* Under the new ABI, we need to allocate an additional max
2256 (sizeof (size_t), alignof (true_type)) bytes. */
2260 sizetype_size
= size_in_bytes (sizetype
);
2261 type_align
= size_int (TYPE_ALIGN_UNIT (type
));
2262 if (INT_CST_LT_UNSIGNED (type_align
, sizetype_size
))
2263 cookie_size
= sizetype_size
;
2265 cookie_size
= type_align
;
2270 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2271 value is immediately handed to expand_expr. */
2277 tree placement
, init
;
2278 tree type
, true_type
, size
, rval
, t
;
2280 tree nelts
= NULL_TREE
;
2281 tree alloc_call
, alloc_expr
, alloc_node
;
2282 tree cookie_expr
, init_expr
;
2284 enum tree_code code
;
2285 int use_cookie
, nothrow
, check_new
;
2286 /* Nonzero if the user wrote `::new' rather than just `new'. */
2287 int globally_qualified_p
;
2288 /* Nonzero if we're going to call a global operator new, rather than
2289 a class-specific version. */
2291 int use_java_new
= 0;
2292 /* If non-NULL, the number of extra bytes to allocate at the
2293 beginning of the storage allocated for an array-new expression in
2294 order to store the number of elements. */
2295 tree cookie_size
= NULL_TREE
;
2297 placement
= TREE_OPERAND (exp
, 0);
2298 type
= TREE_OPERAND (exp
, 1);
2299 init
= TREE_OPERAND (exp
, 2);
2300 globally_qualified_p
= NEW_EXPR_USE_GLOBAL (exp
);
2302 if (TREE_CODE (type
) == ARRAY_REF
)
2305 nelts
= TREE_OPERAND (type
, 1);
2306 type
= TREE_OPERAND (type
, 0);
2308 full_type
= cp_build_binary_op (MINUS_EXPR
, nelts
, integer_one_node
);
2309 full_type
= build_index_type (full_type
);
2310 full_type
= build_cplus_array_type (type
, full_type
);
2317 code
= has_array
? VEC_NEW_EXPR
: NEW_EXPR
;
2319 /* If our base type is an array, then make sure we know how many elements
2321 while (TREE_CODE (true_type
) == ARRAY_TYPE
)
2323 tree this_nelts
= array_type_nelts_top (true_type
);
2324 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
, this_nelts
);
2325 true_type
= TREE_TYPE (true_type
);
2328 if (!complete_type_or_else (true_type
, exp
))
2329 return error_mark_node
;
2331 size
= size_in_bytes (true_type
);
2333 size
= fold (cp_build_binary_op (MULT_EXPR
, size
, nelts
));
2335 if (TREE_CODE (true_type
) == VOID_TYPE
)
2337 error ("invalid type `void' for new");
2338 return error_mark_node
;
2341 if (abstract_virtuals_error (NULL_TREE
, true_type
))
2342 return error_mark_node
;
2344 /* Figure out whether or not we're going to use the global operator
2346 if (!globally_qualified_p
2347 && IS_AGGR_TYPE (true_type
)
2349 ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type
)
2350 : TYPE_HAS_NEW_OPERATOR (true_type
)))
2355 /* We only need cookies for arrays containing types for which we
2357 if (!has_array
|| !TYPE_VEC_NEW_USES_COOKIE (true_type
))
2359 /* When using placement new, users may not realize that they need
2360 the extra storage. Under the old ABI, we don't allocate the
2361 cookie whenever they use one placement argument of type `void
2362 *'. Under the new ABI, we require that the operator called be
2363 the global placement operator delete[]. */
2364 else if (placement
&& !TREE_CHAIN (placement
)
2365 && same_type_p (TREE_TYPE (TREE_VALUE (placement
)),
2367 use_cookie
= !use_global_new
;
2368 /* Otherwise, we need the cookie. */
2372 /* Compute the number of extra bytes to allocate, now that we know
2373 whether or not we need the cookie. */
2376 cookie_size
= get_cookie_size (true_type
);
2377 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
2380 /* Allocate the object. */
2382 if (! placement
&& TYPE_FOR_JAVA (true_type
))
2384 tree class_addr
, alloc_decl
;
2385 tree class_decl
= build_java_class_ref (true_type
);
2386 tree class_size
= size_in_bytes (true_type
);
2387 static char alloc_name
[] = "_Jv_AllocObject";
2389 alloc_decl
= IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name
));
2390 if (alloc_decl
== NULL_TREE
)
2391 fatal_error ("call to Java constructor with `%s' undefined",
2394 class_addr
= build1 (ADDR_EXPR
, jclass_node
, class_decl
);
2395 alloc_call
= (build_function_call
2397 tree_cons (NULL_TREE
, class_addr
,
2398 build_tree_list (NULL_TREE
, class_size
))));
2405 args
= tree_cons (NULL_TREE
, size
, placement
);
2406 fnname
= ansi_opname (code
);
2409 alloc_call
= (build_new_function_call
2410 (lookup_function_nonclass (fnname
, args
),
2413 alloc_call
= build_method_call (build_dummy_object (true_type
),
2414 fnname
, args
, NULL_TREE
,
2418 if (alloc_call
== error_mark_node
)
2419 return error_mark_node
;
2421 if (alloc_call
== NULL_TREE
)
2424 /* unless an allocation function is declared with an empty excep-
2425 tion-specification (_except.spec_), throw(), it indicates failure to
2426 allocate storage by throwing a bad_alloc exception (clause _except_,
2427 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2428 cation function is declared with an empty exception-specification,
2429 throw(), it returns null to indicate failure to allocate storage and a
2430 non-null pointer otherwise.
2432 So check for a null exception spec on the op new we just called. */
2434 /* The ADDR_EXPR. */
2435 t
= TREE_OPERAND (alloc_call
, 0);
2437 t
= TREE_OPERAND (t
, 0);
2438 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (t
));
2439 check_new
= (flag_check_new
|| nothrow
) && ! use_java_new
;
2441 alloc_expr
= alloc_call
;
2444 /* Adjust so we're pointing to the start of the object. */
2445 alloc_expr
= build (PLUS_EXPR
, TREE_TYPE (alloc_expr
),
2446 alloc_expr
, cookie_size
);
2448 /* While we're working, use a pointer to the type we've actually
2450 alloc_expr
= convert (build_pointer_type (full_type
), alloc_expr
);
2452 /* Now save the allocation expression so we only evaluate it once. */
2453 alloc_expr
= get_target_expr (alloc_expr
);
2454 alloc_node
= TREE_OPERAND (alloc_expr
, 0);
2456 /* Now initialize the cookie. */
2461 /* Store the number of bytes allocated so that we can know how
2462 many elements to destroy later. Under the new ABI, we use
2463 the last sizeof (size_t) bytes to store the number of
2465 cookie
= build (MINUS_EXPR
, build_pointer_type (sizetype
),
2466 alloc_node
, size_in_bytes (sizetype
));
2467 cookie
= build_indirect_ref (cookie
, NULL
);
2469 cookie_expr
= build (MODIFY_EXPR
, void_type_node
, cookie
, nelts
);
2470 TREE_SIDE_EFFECTS (cookie_expr
) = 1;
2473 cookie_expr
= NULL_TREE
;
2475 /* Now initialize the allocated object. */
2476 init_expr
= NULL_TREE
;
2477 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
)
2479 init_expr
= build_indirect_ref (alloc_node
, NULL
);
2481 if (init
== void_zero_node
)
2482 init
= build_default_init (full_type
);
2483 else if (init
&& pedantic
&& has_array
)
2484 cp_pedwarn ("ISO C++ forbids initialization in array new");
2487 init_expr
= build_vec_init (init_expr
, init
, 0);
2488 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2489 init_expr
= build_method_call (init_expr
,
2490 complete_ctor_identifier
,
2491 init
, TYPE_BINFO (true_type
),
2495 /* We are processing something like `new int (10)', which
2496 means allocate an int, and initialize it with 10. */
2498 if (TREE_CODE (init
) == TREE_LIST
)
2500 if (TREE_CHAIN (init
) != NULL_TREE
)
2502 ("initializer list being treated as compound expression");
2503 init
= build_compound_expr (init
);
2505 else if (TREE_CODE (init
) == CONSTRUCTOR
2506 && TREE_TYPE (init
) == NULL_TREE
)
2508 pedwarn ("ISO C++ forbids aggregate initializer to new");
2509 init
= digest_init (type
, init
, 0);
2512 init_expr
= build_modify_expr (init_expr
, INIT_EXPR
, init
);
2515 if (init_expr
== error_mark_node
)
2516 return error_mark_node
;
2518 /* If any part of the object initialization terminates by throwing an
2519 exception and a suitable deallocation function can be found, the
2520 deallocation function is called to free the memory in which the
2521 object was being constructed, after which the exception continues
2522 to propagate in the context of the new-expression. If no
2523 unambiguous matching deallocation function can be found,
2524 propagating the exception does not cause the object's memory to be
2526 if (flag_exceptions
&& ! use_java_new
)
2528 enum tree_code dcode
= has_array
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2530 int flags
= (LOOKUP_NORMAL
2531 | (globally_qualified_p
* LOOKUP_GLOBAL
));
2533 /* The Standard is unclear here, but the right thing to do
2534 is to use the same method for finding deallocation
2535 functions that we use for finding allocation functions. */
2536 flags
|= LOOKUP_SPECULATIVELY
;
2538 cleanup
= build_op_delete_call (dcode
, alloc_node
, size
, flags
,
2541 /* Ack! First we allocate the memory. Then we set our sentry
2542 variable to true, and expand a cleanup that deletes the memory
2543 if sentry is true. Then we run the constructor, and finally
2546 It would be nice to be able to handle this without the sentry
2547 variable, perhaps with a TRY_CATCH_EXPR, but this doesn't
2548 work. We allocate the space first, so if there are any
2549 temporaries with cleanups in the constructor args we need this
2550 EH region to extend until end of full-expression to preserve
2553 If the backend had some mechanism so that we could force the
2554 allocation to be expanded after all the other args to the
2555 constructor, that would fix the nesting problem and we could
2556 do away with this complexity. But that would complicate other
2557 things; in particular, it would make it difficult to bail out
2558 if the allocation function returns null. */
2562 tree end
, sentry
, begin
;
2564 begin
= get_target_expr (boolean_true_node
);
2565 sentry
= TREE_OPERAND (begin
, 0);
2567 TREE_OPERAND (begin
, 2)
2568 = build (COND_EXPR
, void_type_node
, sentry
,
2569 cleanup
, void_zero_node
);
2571 end
= build (MODIFY_EXPR
, TREE_TYPE (sentry
),
2572 sentry
, boolean_false_node
);
2575 = build (COMPOUND_EXPR
, void_type_node
, begin
,
2576 build (COMPOUND_EXPR
, void_type_node
, init_expr
,
2581 else if (CP_TYPE_CONST_P (true_type
))
2582 cp_error ("uninitialized const in `new' of `%#T'", true_type
);
2584 /* Now build up the return value in reverse order. */
2589 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
2591 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
2593 if (rval
== alloc_node
)
2594 /* If we didn't modify anything, strip the TARGET_EXPR and return the
2596 rval
= TREE_OPERAND (alloc_expr
, 1);
2601 tree ifexp
= cp_build_binary_op (NE_EXPR
, alloc_node
,
2603 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
);
2606 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2609 /* Now strip the outer ARRAY_TYPE, so we return a pointer to the first
2611 rval
= convert (build_pointer_type (type
), rval
);
2617 build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
, use_global_delete
)
2618 tree base
, maxindex
, type
;
2619 special_function_kind auto_delete_vec
;
2620 int use_global_delete
;
2623 tree ptype
= build_pointer_type (type
= complete_type (type
));
2624 tree size_exp
= size_in_bytes (type
);
2626 /* Temporary variables used by the loop. */
2627 tree tbase
, tbase_init
;
2629 /* This is the body of the loop that implements the deletion of a
2630 single element, and moves temp variables to next elements. */
2633 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2636 /* This is the thing that governs what to do after the loop has run. */
2637 tree deallocate_expr
= 0;
2639 /* This is the BIND_EXPR which holds the outermost iterator of the
2640 loop. It is convenient to set this variable up and test it before
2641 executing any other code in the loop.
2642 This is also the containing expression returned by this function. */
2643 tree controller
= NULL_TREE
;
2645 if (! IS_AGGR_TYPE (type
) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2647 loop
= integer_zero_node
;
2651 /* The below is short by the cookie size. */
2652 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2653 convert (sizetype
, maxindex
));
2655 tbase
= create_temporary_var (ptype
);
2656 tbase_init
= build_modify_expr (tbase
, NOP_EXPR
,
2657 fold (build (PLUS_EXPR
, ptype
,
2660 DECL_REGISTER (tbase
) = 1;
2661 controller
= build (BIND_EXPR
, void_type_node
, tbase
, NULL_TREE
, NULL_TREE
);
2662 TREE_SIDE_EFFECTS (controller
) = 1;
2666 body
= tree_cons (NULL_TREE
,
2667 build_delete (ptype
, tbase
, sfk_complete_destructor
,
2668 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1),
2671 body
= tree_cons (NULL_TREE
,
2672 build_modify_expr (tbase
, NOP_EXPR
, build (MINUS_EXPR
, ptype
, tbase
, size_exp
)),
2675 body
= tree_cons (NULL_TREE
,
2676 build (EXIT_EXPR
, void_type_node
,
2677 build (EQ_EXPR
, boolean_type_node
, base
, tbase
)),
2680 loop
= build (LOOP_EXPR
, void_type_node
, build_compound_expr (body
));
2682 loop
= tree_cons (NULL_TREE
, tbase_init
,
2683 tree_cons (NULL_TREE
, loop
, NULL_TREE
));
2684 loop
= build_compound_expr (loop
);
2687 /* If the delete flag is one, or anything else with the low bit set,
2688 delete the storage. */
2689 deallocate_expr
= integer_zero_node
;
2690 if (auto_delete_vec
!= sfk_base_destructor
)
2694 /* The below is short by the cookie size. */
2695 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2696 convert (sizetype
, maxindex
));
2698 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2705 cookie_size
= get_cookie_size (type
);
2707 = cp_convert (ptype
,
2708 cp_build_binary_op (MINUS_EXPR
,
2709 cp_convert (string_type_node
,
2712 /* True size with header. */
2713 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
2716 if (auto_delete_vec
== sfk_deleting_destructor
)
2717 deallocate_expr
= build_x_delete (base_tbd
,
2718 2 | use_global_delete
,
2722 if (loop
&& deallocate_expr
!= integer_zero_node
)
2724 body
= tree_cons (NULL_TREE
, loop
,
2725 tree_cons (NULL_TREE
, deallocate_expr
, NULL_TREE
));
2726 body
= build_compound_expr (body
);
2731 /* Outermost wrapper: If pointer is null, punt. */
2732 body
= fold (build (COND_EXPR
, void_type_node
,
2733 fold (build (NE_EXPR
, boolean_type_node
, base
,
2734 integer_zero_node
)),
2735 body
, integer_zero_node
));
2736 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2740 TREE_OPERAND (controller
, 1) = body
;
2744 return cp_convert (void_type_node
, body
);
2747 /* Create an unnamed variable of the indicated TYPE. */
2750 create_temporary_var (type
)
2755 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2756 TREE_USED (decl
) = 1;
2757 DECL_ARTIFICIAL (decl
) = 1;
2758 DECL_SOURCE_FILE (decl
) = input_filename
;
2759 DECL_SOURCE_LINE (decl
) = lineno
;
2760 DECL_IGNORED_P (decl
) = 1;
2761 DECL_CONTEXT (decl
) = current_function_decl
;
2766 /* Create a new temporary variable of the indicated TYPE, initialized
2769 It is not entered into current_binding_level, because that breaks
2770 things when it comes time to do final cleanups (which take place
2771 "outside" the binding contour of the function). */
2774 get_temp_regvar (type
, init
)
2779 decl
= create_temporary_var (type
);
2780 if (building_stmt_tree ())
2781 add_decl_stmt (decl
);
2782 if (!building_stmt_tree ())
2783 SET_DECL_RTL (decl
, assign_temp (type
, 2, 0, 1));
2784 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
2789 /* `build_vec_init' returns tree structure that performs
2790 initialization of a vector of aggregate types.
2792 BASE is a reference to the vector, of ARRAY_TYPE.
2793 INIT is the (possibly NULL) initializer.
2795 FROM_ARRAY is 0 if we should init everything with INIT
2796 (i.e., every element initialized from INIT).
2797 FROM_ARRAY is 1 if we should index into INIT in parallel
2798 with initialization of DECL.
2799 FROM_ARRAY is 2 if we should index into INIT in parallel,
2800 but use assignment instead of initialization. */
2803 build_vec_init (base
, init
, from_array
)
2808 tree base2
= NULL_TREE
;
2810 tree itype
= NULL_TREE
;
2812 /* The type of the array. */
2813 tree atype
= TREE_TYPE (base
);
2814 /* The type of an element in the array. */
2815 tree type
= TREE_TYPE (atype
);
2816 /* The type of a pointer to an element in the array. */
2821 tree try_block
= NULL_TREE
;
2822 tree try_body
= NULL_TREE
;
2823 int num_initialized_elts
= 0;
2824 tree maxindex
= array_type_nelts (TREE_TYPE (base
));
2826 if (maxindex
== error_mark_node
)
2827 return error_mark_node
;
2829 /* For g++.ext/arrnew.C. */
2830 if (init
&& TREE_CODE (init
) == CONSTRUCTOR
&& TREE_TYPE (init
) == NULL_TREE
)
2831 init
= digest_init (atype
, init
, 0);
2833 if (init
&& !TYPE_NEEDS_CONSTRUCTING (type
)
2834 && ((TREE_CODE (init
) == CONSTRUCTOR
2835 /* Don't do this if the CONSTRUCTOR might contain something
2836 that might throw and require us to clean up. */
2837 && (CONSTRUCTOR_ELTS (init
) == NULL_TREE
2838 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type
))))
2841 /* Do non-default initialization of POD arrays resulting from
2842 brace-enclosed initializers. In this case, digest_init and
2843 store_constructor will handle the semantics for us. */
2845 stmt_expr
= build (INIT_EXPR
, atype
, base
, init
);
2846 TREE_SIDE_EFFECTS (stmt_expr
) = 1;
2850 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2851 ptype
= build_pointer_type (type
);
2852 size
= size_in_bytes (type
);
2853 if (TREE_CODE (TREE_TYPE (base
)) == ARRAY_TYPE
)
2854 base
= cp_convert (ptype
, default_conversion (base
));
2856 /* The code we are generating looks like:
2860 ptrdiff_t iterator = maxindex;
2863 ... initialize *t1 ...
2865 } while (--iterator != -1);
2867 ... destroy elements that were constructed ...
2871 We can omit the try and catch blocks if we know that the
2872 initialization will never throw an exception, or if the array
2873 elements do not have destructors. We can omit the loop completely if
2874 the elements of the array do not have constructors.
2876 We actually wrap the entire body of the above in a STMT_EXPR, for
2879 When copying from array to another, when the array elements have
2880 only trivial copy constructors, we should use __builtin_memcpy
2881 rather than generating a loop. That way, we could take advantage
2882 of whatever cleverness the back-end has for dealing with copies
2883 of blocks of memory. */
2885 begin_init_stmts (&stmt_expr
, &compound_stmt
);
2886 destroy_temps
= stmts_are_full_exprs_p ();
2887 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2888 rval
= get_temp_regvar (ptype
, base
);
2889 base
= get_temp_regvar (ptype
, rval
);
2890 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2892 /* Protect the entire array initialization so that we can destroy
2893 the partially constructed array if an exception is thrown.
2894 But don't do this if we're assigning. */
2895 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2898 try_block
= begin_try_block ();
2899 try_body
= begin_compound_stmt (/*has_no_scope=*/1);
2902 if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
2904 /* Do non-default initialization of non-POD arrays resulting from
2905 brace-enclosed initializers. */
2910 for (elts
= CONSTRUCTOR_ELTS (init
); elts
; elts
= TREE_CHAIN (elts
))
2912 tree elt
= TREE_VALUE (elts
);
2913 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2915 num_initialized_elts
++;
2917 if (IS_AGGR_TYPE (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
2918 finish_expr_stmt (build_aggr_init (baseref
, elt
, 0));
2920 finish_expr_stmt (build_modify_expr (baseref
, NOP_EXPR
,
2923 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2924 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR
, iterator
, 0));
2927 /* Clear out INIT so that we don't get confused below. */
2930 else if (from_array
)
2932 /* If initializing one array from another, initialize element by
2933 element. We rely upon the below calls the do argument
2937 base2
= default_conversion (init
);
2938 itype
= TREE_TYPE (base2
);
2939 base2
= get_temp_regvar (itype
, base2
);
2940 itype
= TREE_TYPE (itype
);
2942 else if (TYPE_LANG_SPECIFIC (type
)
2943 && TYPE_NEEDS_CONSTRUCTING (type
)
2944 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2946 error ("initializer ends prematurely");
2947 return error_mark_node
;
2951 /* Now, default-initialize any remaining elements. We don't need to
2952 do that if a) the type does not need constructing, or b) we've
2953 already initialized all the elements.
2955 We do need to keep going if we're copying an array. */
2958 || (TYPE_NEEDS_CONSTRUCTING (type
)
2959 && ! (host_integerp (maxindex
, 0)
2960 && (num_initialized_elts
2961 == tree_low_cst (maxindex
, 0) + 1))))
2963 /* If the ITERATOR is equal to -1, then we don't have to loop;
2964 we've already initialized all the elements. */
2970 if_stmt
= begin_if_stmt ();
2971 finish_if_stmt_cond (build (NE_EXPR
, boolean_type_node
,
2972 iterator
, integer_minus_one_node
),
2975 /* Otherwise, loop through the elements. */
2976 do_stmt
= begin_do_stmt ();
2977 do_body
= begin_compound_stmt (/*has_no_scope=*/1);
2979 /* When we're not building a statement-tree, things are a little
2980 complicated. If, when we recursively call build_aggr_init,
2981 an expression containing a TARGET_EXPR is expanded, then it
2982 may get a cleanup. Then, the result of that expression is
2983 passed to finish_expr_stmt, which will call
2984 expand_start_target_temps/expand_end_target_temps. However,
2985 the latter call will not cause the cleanup to run because
2986 that block will still be on the block stack. So, we call
2987 expand_start_target_temps here manually; the corresponding
2988 call to expand_end_target_temps below will cause the cleanup
2990 if (!building_stmt_tree ())
2991 expand_start_target_temps ();
2995 tree to
= build1 (INDIRECT_REF
, type
, base
);
2999 from
= build1 (INDIRECT_REF
, itype
, base2
);
3003 if (from_array
== 2)
3004 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
3005 else if (TYPE_NEEDS_CONSTRUCTING (type
))
3006 elt_init
= build_aggr_init (to
, from
, 0);
3008 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
3010 my_friendly_abort (57);
3012 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3016 ("cannot initialize multi-dimensional array with initializer");
3017 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
3021 elt_init
= build_aggr_init (build1 (INDIRECT_REF
, type
, base
),
3024 /* The initialization of each array element is a
3025 full-expression, as per core issue 124. */
3026 if (!building_stmt_tree ())
3028 genrtl_expr_stmt (elt_init
);
3029 expand_end_target_temps ();
3033 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
3034 finish_expr_stmt (elt_init
);
3035 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
3038 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
3040 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base2
, 0));
3042 finish_compound_stmt (/*has_no_scope=*/1, do_body
);
3043 finish_do_body (do_stmt
);
3044 finish_do_stmt (build (NE_EXPR
, boolean_type_node
,
3045 build_unary_op (PREDECREMENT_EXPR
, iterator
, 0),
3046 integer_minus_one_node
),
3049 finish_then_clause (if_stmt
);
3053 /* Make sure to cleanup any partially constructed elements. */
3054 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
3059 finish_compound_stmt (/*has_no_scope=*/1, try_body
);
3060 finish_cleanup_try_block (try_block
);
3061 e
= build_vec_delete_1 (rval
,
3062 cp_build_binary_op (MINUS_EXPR
, maxindex
,
3065 sfk_base_destructor
,
3066 /*use_global_delete=*/0);
3067 finish_cleanup (e
, try_block
);
3070 /* The value of the array initialization is the address of the
3071 first element in the array. */
3072 finish_expr_stmt (rval
);
3074 stmt_expr
= finish_init_stmts (stmt_expr
, compound_stmt
);
3075 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
3079 /* Free up storage of type TYPE, at address ADDR.
3081 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
3084 VIRTUAL_SIZE is the amount of storage that was allocated, and is
3085 used as the second argument to operator delete. It can include
3086 things like padding and magic size cookies. It has virtual in it,
3087 because if you have a base pointer and you delete through a virtual
3088 destructor, it should be the size of the dynamic object, not the
3089 static object, see Free Store 12.5 ISO C++.
3091 This does not call any destructors. */
3094 build_x_delete (addr
, which_delete
, virtual_size
)
3099 int use_global_delete
= which_delete
& 1;
3100 int use_vec_delete
= !!(which_delete
& 2);
3101 enum tree_code code
= use_vec_delete
? VEC_DELETE_EXPR
: DELETE_EXPR
;
3102 int flags
= LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
);
3104 return build_op_delete_call (code
, addr
, virtual_size
, flags
, NULL_TREE
);
3107 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3111 build_dtor_call (exp
, dtor_kind
, flags
)
3113 special_function_kind dtor_kind
;
3120 case sfk_complete_destructor
:
3121 name
= complete_dtor_identifier
;
3124 case sfk_base_destructor
:
3125 name
= base_dtor_identifier
;
3128 case sfk_deleting_destructor
:
3129 name
= deleting_dtor_identifier
;
3133 my_friendly_abort (20000524);
3135 return build_method_call (exp
, name
, NULL_TREE
, NULL_TREE
, flags
);
3138 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3139 ADDR is an expression which yields the store to be destroyed.
3140 AUTO_DELETE is the name of the destructor to call, i.e., either
3141 sfk_complete_destructor, sfk_base_destructor, or
3142 sfk_deleting_destructor.
3144 FLAGS is the logical disjunction of zero or more LOOKUP_
3145 flags. See cp-tree.h for more info.
3147 This function does not delete an object's virtual base classes. */
3150 build_delete (type
, addr
, auto_delete
, flags
, use_global_delete
)
3152 special_function_kind auto_delete
;
3154 int use_global_delete
;
3159 if (addr
== error_mark_node
)
3160 return error_mark_node
;
3162 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3163 set to `error_mark_node' before it gets properly cleaned up. */
3164 if (type
== error_mark_node
)
3165 return error_mark_node
;
3167 type
= TYPE_MAIN_VARIANT (type
);
3169 if (TREE_CODE (type
) == POINTER_TYPE
)
3171 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3172 if (!VOID_TYPE_P (type
) && !complete_type_or_else (type
, addr
))
3173 return error_mark_node
;
3174 if (TREE_CODE (type
) == ARRAY_TYPE
)
3176 if (! IS_AGGR_TYPE (type
))
3178 /* Call the builtin operator delete. */
3179 return build_builtin_delete_call (addr
);
3181 if (TREE_SIDE_EFFECTS (addr
))
3182 addr
= save_expr (addr
);
3184 /* throw away const and volatile on target type of addr */
3185 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3187 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3190 if (TREE_SIDE_EFFECTS (addr
))
3191 addr
= save_expr (addr
);
3192 if (TYPE_DOMAIN (type
) == NULL_TREE
)
3194 error ("unknown array size in delete");
3195 return error_mark_node
;
3197 return build_vec_delete (addr
, array_type_nelts (type
),
3198 auto_delete
, use_global_delete
);
3202 /* Don't check PROTECT here; leave that decision to the
3203 destructor. If the destructor is accessible, call it,
3204 else report error. */
3205 addr
= build_unary_op (ADDR_EXPR
, addr
, 0);
3206 if (TREE_SIDE_EFFECTS (addr
))
3207 addr
= save_expr (addr
);
3209 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3212 my_friendly_assert (IS_AGGR_TYPE (type
), 220);
3214 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
3216 if (auto_delete
!= sfk_deleting_destructor
)
3217 return void_zero_node
;
3219 return build_op_delete_call
3220 (DELETE_EXPR
, addr
, c_sizeof_nowarn (type
),
3221 LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
),
3225 /* Below, we will reverse the order in which these calls are made.
3226 If we have a destructor, then that destructor will take care
3227 of the base classes; otherwise, we must do that here. */
3228 if (TYPE_HAS_DESTRUCTOR (type
))
3230 tree do_delete
= NULL_TREE
;
3233 /* For `::delete x', we must not use the deleting destructor
3234 since then we would not be sure to get the global `operator
3236 if (use_global_delete
&& auto_delete
== sfk_deleting_destructor
)
3238 /* We will use ADDR multiple times so we must save it. */
3239 addr
= save_expr (addr
);
3240 /* Delete the object. */
3241 do_delete
= build_builtin_delete_call (addr
);
3242 /* Otherwise, treat this like a complete object destructor
3244 auto_delete
= sfk_complete_destructor
;
3246 /* If the destructor is non-virtual, there is no deleting
3247 variant. Instead, we must explicitly call the appropriate
3248 `operator delete' here. */
3249 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type
))
3250 && auto_delete
== sfk_deleting_destructor
)
3252 /* We will use ADDR multiple times so we must save it. */
3253 addr
= save_expr (addr
);
3254 /* Build the call. */
3255 do_delete
= build_op_delete_call (DELETE_EXPR
,
3257 c_sizeof_nowarn (type
),
3260 /* Call the complete object destructor. */
3261 auto_delete
= sfk_complete_destructor
;
3264 expr
= build_dtor_call (build_indirect_ref (addr
, NULL
),
3265 auto_delete
, flags
);
3267 expr
= build (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
3269 if (flags
& LOOKUP_DESTRUCTOR
)
3270 /* Explicit destructor call; don't check for null pointer. */
3271 ifexp
= integer_one_node
;
3273 /* Handle deleting a null pointer. */
3274 ifexp
= fold (cp_build_binary_op (NE_EXPR
, addr
, integer_zero_node
));
3276 if (ifexp
!= integer_one_node
)
3277 expr
= build (COND_EXPR
, void_type_node
,
3278 ifexp
, expr
, void_zero_node
);
3284 /* We only get here from finish_function for a destructor. */
3285 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (type
));
3286 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (type
);
3287 tree base_binfo
= n_baseclasses
> 0 ? TREE_VEC_ELT (binfos
, 0) : NULL_TREE
;
3288 tree exprstmt
= NULL_TREE
;
3289 tree ref
= build_indirect_ref (addr
, NULL
);
3291 /* Set this again before we call anything, as we might get called
3293 TYPE_HAS_DESTRUCTOR (type
) = 1;
3295 /* If we have member delete or vbases, we call delete in
3297 my_friendly_assert (auto_delete
== sfk_base_destructor
, 20000411);
3299 /* Take care of the remaining baseclasses. */
3300 for (i
= 0; i
< n_baseclasses
; i
++)
3302 base_binfo
= TREE_VEC_ELT (binfos
, i
);
3303 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
))
3304 || TREE_VIA_VIRTUAL (base_binfo
))
3307 expr
= build_scoped_method_call (ref
, base_binfo
,
3308 base_dtor_identifier
,
3311 exprstmt
= tree_cons (NULL_TREE
, expr
, exprstmt
);
3314 for (member
= TYPE_FIELDS (type
); member
; member
= TREE_CHAIN (member
))
3316 if (TREE_CODE (member
) != FIELD_DECL
)
3318 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member
)))
3320 tree this_member
= build_component_ref (ref
, DECL_NAME (member
), NULL_TREE
, 0);
3321 tree this_type
= TREE_TYPE (member
);
3322 expr
= build_delete (this_type
, this_member
,
3323 sfk_complete_destructor
, flags
, 0);
3324 exprstmt
= tree_cons (NULL_TREE
, expr
, exprstmt
);
3329 return build_compound_expr (exprstmt
);
3330 /* Virtual base classes make this function do nothing. */
3331 return void_zero_node
;
3335 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3338 build_vbase_delete (type
, decl
)
3341 tree vbases
= CLASSTYPE_VBASECLASSES (type
);
3342 tree result
= NULL_TREE
;
3343 tree addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
3345 my_friendly_assert (addr
!= error_mark_node
, 222);
3350 = convert_force (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases
))),
3352 result
= tree_cons (NULL_TREE
,
3353 build_delete (TREE_TYPE (this_addr
), this_addr
,
3354 sfk_base_destructor
,
3355 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0),
3357 vbases
= TREE_CHAIN (vbases
);
3359 return build_compound_expr (nreverse (result
));
3362 /* Build a C++ vector delete expression.
3363 MAXINDEX is the number of elements to be deleted.
3364 ELT_SIZE is the nominal size of each element in the vector.
3365 BASE is the expression that should yield the store to be deleted.
3366 This function expands (or synthesizes) these calls itself.
3367 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3369 This also calls delete for virtual baseclasses of elements of the vector.
3371 Update: MAXINDEX is no longer needed. The size can be extracted from the
3372 start of the vector for pointers, and from the type for arrays. We still
3373 use MAXINDEX for arrays because it happens to already have one of the
3374 values we'd have to extract. (We could use MAXINDEX with pointers to
3375 confirm the size, and trap if the numbers differ; not clear that it'd
3376 be worth bothering.) */
3379 build_vec_delete (base
, maxindex
, auto_delete_vec
, use_global_delete
)
3380 tree base
, maxindex
;
3381 special_function_kind auto_delete_vec
;
3382 int use_global_delete
;
3386 if (TREE_CODE (base
) == OFFSET_REF
)
3387 base
= resolve_offset_ref (base
);
3389 type
= TREE_TYPE (base
);
3391 base
= stabilize_reference (base
);
3393 /* Since we can use base many times, save_expr it. */
3394 if (TREE_SIDE_EFFECTS (base
))
3395 base
= save_expr (base
);
3397 if (TREE_CODE (type
) == POINTER_TYPE
)
3399 /* Step back one from start of vector, and read dimension. */
3402 type
= strip_array_types (TREE_TYPE (type
));
3403 cookie_addr
= build (MINUS_EXPR
,
3404 build_pointer_type (sizetype
),
3406 TYPE_SIZE_UNIT (sizetype
));
3407 maxindex
= build_indirect_ref (cookie_addr
, NULL
);
3409 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3411 /* get the total number of things in the array, maxindex is a bad name */
3412 maxindex
= array_type_nelts_total (type
);
3413 type
= strip_array_types (type
);
3414 base
= build_unary_op (ADDR_EXPR
, base
, 1);
3418 if (base
!= error_mark_node
)
3419 error ("type to vector delete is neither pointer or array type");
3420 return error_mark_node
;
3423 return build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
,