1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* High-level class interface. */
27 #include "coretypes.h"
39 static bool begin_init_stmts (tree
*, tree
*);
40 static tree
finish_init_stmts (bool, tree
, tree
);
41 static void construct_virtual_base (tree
, tree
);
42 static void expand_aggr_init_1 (tree
, tree
, tree
, tree
, int);
43 static void expand_default_init (tree
, tree
, tree
, tree
, int);
44 static tree
build_vec_delete_1 (tree
, tree
, tree
, special_function_kind
, int);
45 static void perform_member_init (tree
, tree
);
46 static tree
build_builtin_delete_call (tree
);
47 static int member_init_ok_or_else (tree
, tree
, tree
);
48 static void expand_virtual_init (tree
, tree
);
49 static tree
sort_mem_initializers (tree
, tree
);
50 static tree
initializing_context (tree
);
51 static void expand_cleanup_for_base (tree
, tree
);
52 static tree
get_temp_regvar (tree
, tree
);
53 static tree
dfs_initialize_vtbl_ptrs (tree
, void *);
54 static tree
build_default_init (tree
, tree
);
55 static tree
build_new_1 (tree
);
56 static tree
build_dtor_call (tree
, special_function_kind
, int);
57 static tree
build_field_list (tree
, tree
, int *);
58 static tree
build_vtbl_address (tree
);
60 /* We are about to generate some complex initialization code.
61 Conceptually, it is all a single expression. However, we may want
62 to include conditionals, loops, and other such statement-level
63 constructs. Therefore, we build the initialization code inside a
64 statement-expression. This function starts such an expression.
65 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
66 pass them back to finish_init_stmts when the expression is
70 begin_init_stmts (tree
*stmt_expr_p
, tree
*compound_stmt_p
)
72 bool is_global
= !building_stmt_tree ();
74 *stmt_expr_p
= begin_stmt_expr ();
75 *compound_stmt_p
= begin_compound_stmt (BCS_NO_SCOPE
);
80 /* Finish out the statement-expression begun by the previous call to
81 begin_init_stmts. Returns the statement-expression itself. */
84 finish_init_stmts (bool is_global
, tree stmt_expr
, tree compound_stmt
)
86 finish_compound_stmt (compound_stmt
);
88 stmt_expr
= finish_stmt_expr (stmt_expr
, true);
90 gcc_assert (!building_stmt_tree () == is_global
);
97 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
98 which we want to initialize the vtable pointer for, DATA is
99 TREE_LIST whose TREE_VALUE is the this ptr expression. */
102 dfs_initialize_vtbl_ptrs (tree binfo
, void *data
)
104 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
105 return dfs_skip_bases
;
107 if (!BINFO_PRIMARY_P (binfo
) || BINFO_VIRTUAL_P (binfo
))
109 tree base_ptr
= TREE_VALUE ((tree
) data
);
111 base_ptr
= build_base_path (PLUS_EXPR
, base_ptr
, binfo
, /*nonnull=*/1);
113 expand_virtual_init (binfo
, base_ptr
);
119 /* Initialize all the vtable pointers in the object pointed to by
123 initialize_vtbl_ptrs (tree addr
)
128 type
= TREE_TYPE (TREE_TYPE (addr
));
129 list
= build_tree_list (type
, addr
);
131 /* Walk through the hierarchy, initializing the vptr in each base
132 class. We do these in pre-order because we can't find the virtual
133 bases for a class until we've initialized the vtbl for that
135 dfs_walk_once (TYPE_BINFO (type
), dfs_initialize_vtbl_ptrs
, NULL
, list
);
138 /* Return an expression for the zero-initialization of an object with
139 type T. This expression will either be a constant (in the case
140 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
141 aggregate). In either case, the value can be used as DECL_INITIAL
142 for a decl of the indicated TYPE; it is a valid static initializer.
143 If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
144 number of elements in the array. If STATIC_STORAGE_P is TRUE,
145 initializers are only generated for entities for which
146 zero-initialization does not simply mean filling the storage with
150 build_zero_init (tree type
, tree nelts
, bool static_storage_p
)
152 tree init
= NULL_TREE
;
156 To zero-initialization storage for an object of type T means:
158 -- if T is a scalar type, the storage is set to the value of zero
161 -- if T is a non-union class type, the storage for each nonstatic
162 data member and each base-class subobject is zero-initialized.
164 -- if T is a union type, the storage for its first data member is
167 -- if T is an array type, the storage for each element is
170 -- if T is a reference type, no initialization is performed. */
172 gcc_assert (nelts
== NULL_TREE
|| TREE_CODE (nelts
) == INTEGER_CST
);
174 if (type
== error_mark_node
)
176 else if (static_storage_p
&& zero_init_p (type
))
177 /* In order to save space, we do not explicitly build initializers
178 for items that do not need them. GCC's semantics are that
179 items with static storage duration that are not otherwise
180 initialized are initialized to zero. */
182 else if (SCALAR_TYPE_P (type
))
183 init
= convert (type
, integer_zero_node
);
184 else if (CLASS_TYPE_P (type
))
189 /* Build a constructor to contain the initializations. */
190 init
= build_constructor (type
, NULL_TREE
);
191 /* Iterate over the fields, building initializations. */
193 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
195 if (TREE_CODE (field
) != FIELD_DECL
)
198 /* Note that for class types there will be FIELD_DECLs
199 corresponding to base classes as well. Thus, iterating
200 over TYPE_FIELDs will result in correct initialization of
201 all of the subobjects. */
202 if (static_storage_p
&& !zero_init_p (TREE_TYPE (field
)))
203 inits
= tree_cons (field
,
204 build_zero_init (TREE_TYPE (field
),
209 /* For unions, only the first field is initialized. */
210 if (TREE_CODE (type
) == UNION_TYPE
)
213 CONSTRUCTOR_ELTS (init
) = nreverse (inits
);
215 else if (TREE_CODE (type
) == ARRAY_TYPE
)
220 /* Build a constructor to contain the initializations. */
221 init
= build_constructor (type
, NULL_TREE
);
222 /* Iterate over the array elements, building initializations. */
224 max_index
= nelts
? nelts
: array_type_nelts (type
);
225 gcc_assert (TREE_CODE (max_index
) == INTEGER_CST
);
227 /* A zero-sized array, which is accepted as an extension, will
228 have an upper bound of -1. */
229 if (!tree_int_cst_equal (max_index
, integer_minus_one_node
))
231 tree elt_init
= build_zero_init (TREE_TYPE (type
),
236 /* If this is a one element array, we just use a regular init. */
237 if (tree_int_cst_equal (size_zero_node
, max_index
))
238 range
= size_zero_node
;
240 range
= build2 (RANGE_EXPR
, sizetype
, size_zero_node
, max_index
);
242 inits
= tree_cons (range
, elt_init
, inits
);
245 CONSTRUCTOR_ELTS (init
) = nreverse (inits
);
248 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
250 /* In all cases, the initializer is a constant. */
253 TREE_CONSTANT (init
) = 1;
254 TREE_INVARIANT (init
) = 1;
260 /* Build an expression for the default-initialization of an object of
261 the indicated TYPE. If NELTS is non-NULL, and TYPE is an
262 ARRAY_TYPE, NELTS is the number of elements in the array. If
263 initialization of TYPE requires calling constructors, this function
264 returns NULL_TREE; the caller is responsible for arranging for the
265 constructors to be called. */
268 build_default_init (tree type
, tree nelts
)
272 To default-initialize an object of type T means:
274 --if T is a non-POD class type (clause _class_), the default construc-
275 tor for T is called (and the initialization is ill-formed if T has
276 no accessible default constructor);
278 --if T is an array type, each element is default-initialized;
280 --otherwise, the storage for the object is zero-initialized.
282 A program that calls for default-initialization of an entity of refer-
283 ence type is ill-formed. */
285 /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
286 performing the initialization. This is confusing in that some
287 non-PODs do not have TYPE_NEEDS_CONSTRUCTING set. (For example,
288 a class with a pointer-to-data member as a non-static data member
289 does not have TYPE_NEEDS_CONSTRUCTING set.) Therefore, we end up
290 passing non-PODs to build_zero_init below, which is contrary to
291 the semantics quoted above from [dcl.init].
293 It happens, however, that the behavior of the constructor the
294 standard says we should have generated would be precisely the
295 same as that obtained by calling build_zero_init below, so things
297 if (TYPE_NEEDS_CONSTRUCTING (type
)
298 || (nelts
&& TREE_CODE (nelts
) != INTEGER_CST
))
301 /* At this point, TYPE is either a POD class type, an array of POD
302 classes, or something even more innocuous. */
303 return build_zero_init (type
, nelts
, /*static_storage_p=*/false);
306 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
307 arguments. If TREE_LIST is void_type_node, an empty initializer
308 list was given; if NULL_TREE no initializer was given. */
311 perform_member_init (tree member
, tree init
)
314 tree type
= TREE_TYPE (member
);
317 explicit = (init
!= NULL_TREE
);
319 /* Effective C++ rule 12 requires that all data members be
321 if (warn_ecpp
&& !explicit && TREE_CODE (type
) != ARRAY_TYPE
)
322 warning ("%J%qD should be initialized in the member initialization "
323 "list", current_function_decl
, member
);
325 if (init
== void_type_node
)
328 /* Get an lvalue for the data member. */
329 decl
= build_class_member_access_expr (current_class_ref
, member
,
330 /*access_path=*/NULL_TREE
,
331 /*preserve_reference=*/true);
332 if (decl
== error_mark_node
)
335 /* Deal with this here, as we will get confused if we try to call the
336 assignment op for an anonymous union. This can happen in a
337 synthesized copy constructor. */
338 if (ANON_AGGR_TYPE_P (type
))
342 init
= build2 (INIT_EXPR
, type
, decl
, TREE_VALUE (init
));
343 finish_expr_stmt (init
);
346 else if (TYPE_NEEDS_CONSTRUCTING (type
))
349 && TREE_CODE (type
) == ARRAY_TYPE
351 && TREE_CHAIN (init
) == NULL_TREE
352 && TREE_CODE (TREE_TYPE (TREE_VALUE (init
))) == ARRAY_TYPE
)
354 /* Initialization of one array from another. */
355 finish_expr_stmt (build_vec_init (decl
, NULL_TREE
, TREE_VALUE (init
),
359 finish_expr_stmt (build_aggr_init (decl
, init
, 0));
363 if (init
== NULL_TREE
)
367 init
= build_default_init (type
, /*nelts=*/NULL_TREE
);
368 if (TREE_CODE (type
) == REFERENCE_TYPE
)
369 warning ("%Jdefault-initialization of %q#D, "
370 "which has reference type",
371 current_function_decl
, member
);
373 /* member traversal: note it leaves init NULL */
374 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
375 pedwarn ("%Juninitialized reference member %qD",
376 current_function_decl
, member
);
377 else if (CP_TYPE_CONST_P (type
))
378 pedwarn ("%Juninitialized member %qD with %<const%> type %qT",
379 current_function_decl
, member
, type
);
381 else if (TREE_CODE (init
) == TREE_LIST
)
382 /* There was an explicit member initialization. Do some work
384 init
= build_x_compound_expr_from_list (init
, "member initializer");
387 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
390 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
394 expr
= build_class_member_access_expr (current_class_ref
, member
,
395 /*access_path=*/NULL_TREE
,
396 /*preserve_reference=*/false);
397 expr
= build_delete (type
, expr
, sfk_complete_destructor
,
398 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
400 if (expr
!= error_mark_node
)
401 finish_eh_cleanup (expr
);
405 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
406 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
409 build_field_list (tree t
, tree list
, int *uses_unions_p
)
415 /* Note whether or not T is a union. */
416 if (TREE_CODE (t
) == UNION_TYPE
)
419 for (fields
= TYPE_FIELDS (t
); fields
; fields
= TREE_CHAIN (fields
))
421 /* Skip CONST_DECLs for enumeration constants and so forth. */
422 if (TREE_CODE (fields
) != FIELD_DECL
|| DECL_ARTIFICIAL (fields
))
425 /* Keep track of whether or not any fields are unions. */
426 if (TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
429 /* For an anonymous struct or union, we must recursively
430 consider the fields of the anonymous type. They can be
431 directly initialized from the constructor. */
432 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
434 /* Add this field itself. Synthesized copy constructors
435 initialize the entire aggregate. */
436 list
= tree_cons (fields
, NULL_TREE
, list
);
437 /* And now add the fields in the anonymous aggregate. */
438 list
= build_field_list (TREE_TYPE (fields
), list
,
441 /* Add this field. */
442 else if (DECL_NAME (fields
))
443 list
= tree_cons (fields
, NULL_TREE
, list
);
449 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
450 a FIELD_DECL or BINFO in T that needs initialization. The
451 TREE_VALUE gives the initializer, or list of initializer arguments.
453 Return a TREE_LIST containing all of the initializations required
454 for T, in the order in which they should be performed. The output
455 list has the same format as the input. */
458 sort_mem_initializers (tree t
, tree mem_inits
)
461 tree base
, binfo
, base_binfo
;
468 /* Build up a list of initializations. The TREE_PURPOSE of entry
469 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
470 TREE_VALUE will be the constructor arguments, or NULL if no
471 explicit initialization was provided. */
472 sorted_inits
= NULL_TREE
;
474 /* Process the virtual bases. */
475 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
476 VEC_iterate (tree
, vbases
, i
, base
); i
++)
477 sorted_inits
= tree_cons (base
, NULL_TREE
, sorted_inits
);
479 /* Process the direct bases. */
480 for (binfo
= TYPE_BINFO (t
), i
= 0;
481 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
482 if (!BINFO_VIRTUAL_P (base_binfo
))
483 sorted_inits
= tree_cons (base_binfo
, NULL_TREE
, sorted_inits
);
485 /* Process the non-static data members. */
486 sorted_inits
= build_field_list (t
, sorted_inits
, &uses_unions_p
);
487 /* Reverse the entire list of initializations, so that they are in
488 the order that they will actually be performed. */
489 sorted_inits
= nreverse (sorted_inits
);
491 /* If the user presented the initializers in an order different from
492 that in which they will actually occur, we issue a warning. Keep
493 track of the next subobject which can be explicitly initialized
494 without issuing a warning. */
495 next_subobject
= sorted_inits
;
497 /* Go through the explicit initializers, filling in TREE_PURPOSE in
499 for (init
= mem_inits
; init
; init
= TREE_CHAIN (init
))
504 subobject
= TREE_PURPOSE (init
);
506 /* If the explicit initializers are in sorted order, then
507 SUBOBJECT will be NEXT_SUBOBJECT, or something following
509 for (subobject_init
= next_subobject
;
511 subobject_init
= TREE_CHAIN (subobject_init
))
512 if (TREE_PURPOSE (subobject_init
) == subobject
)
515 /* Issue a warning if the explicit initializer order does not
516 match that which will actually occur.
517 ??? Are all these on the correct lines? */
518 if (warn_reorder
&& !subobject_init
)
520 if (TREE_CODE (TREE_PURPOSE (next_subobject
)) == FIELD_DECL
)
521 cp_warning_at ("%qD will be initialized after",
522 TREE_PURPOSE (next_subobject
));
524 warning ("base %qT will be initialized after",
525 TREE_PURPOSE (next_subobject
));
526 if (TREE_CODE (subobject
) == FIELD_DECL
)
527 cp_warning_at (" %q#D", subobject
);
529 warning (" base %qT", subobject
);
530 warning ("%J when initialized here", current_function_decl
);
533 /* Look again, from the beginning of the list. */
536 subobject_init
= sorted_inits
;
537 while (TREE_PURPOSE (subobject_init
) != subobject
)
538 subobject_init
= TREE_CHAIN (subobject_init
);
541 /* It is invalid to initialize the same subobject more than
543 if (TREE_VALUE (subobject_init
))
545 if (TREE_CODE (subobject
) == FIELD_DECL
)
546 error ("%Jmultiple initializations given for %qD",
547 current_function_decl
, subobject
);
549 error ("%Jmultiple initializations given for base %qT",
550 current_function_decl
, subobject
);
553 /* Record the initialization. */
554 TREE_VALUE (subobject_init
) = TREE_VALUE (init
);
555 next_subobject
= subobject_init
;
560 If a ctor-initializer specifies more than one mem-initializer for
561 multiple members of the same union (including members of
562 anonymous unions), the ctor-initializer is ill-formed. */
565 tree last_field
= NULL_TREE
;
566 for (init
= sorted_inits
; init
; init
= TREE_CHAIN (init
))
572 /* Skip uninitialized members and base classes. */
573 if (!TREE_VALUE (init
)
574 || TREE_CODE (TREE_PURPOSE (init
)) != FIELD_DECL
)
576 /* See if this field is a member of a union, or a member of a
577 structure contained in a union, etc. */
578 field
= TREE_PURPOSE (init
);
579 for (field_type
= DECL_CONTEXT (field
);
580 !same_type_p (field_type
, t
);
581 field_type
= TYPE_CONTEXT (field_type
))
582 if (TREE_CODE (field_type
) == UNION_TYPE
)
584 /* If this field is not a member of a union, skip it. */
585 if (TREE_CODE (field_type
) != UNION_TYPE
)
588 /* It's only an error if we have two initializers for the same
596 /* See if LAST_FIELD and the field initialized by INIT are
597 members of the same union. If so, there's a problem,
598 unless they're actually members of the same structure
599 which is itself a member of a union. For example, given:
601 union { struct { int i; int j; }; };
603 initializing both `i' and `j' makes sense. */
604 field_type
= DECL_CONTEXT (field
);
608 tree last_field_type
;
610 last_field_type
= DECL_CONTEXT (last_field
);
613 if (same_type_p (last_field_type
, field_type
))
615 if (TREE_CODE (field_type
) == UNION_TYPE
)
616 error ("%Jinitializations for multiple members of %qT",
617 current_function_decl
, last_field_type
);
622 if (same_type_p (last_field_type
, t
))
625 last_field_type
= TYPE_CONTEXT (last_field_type
);
628 /* If we've reached the outermost class, then we're
630 if (same_type_p (field_type
, t
))
633 field_type
= TYPE_CONTEXT (field_type
);
644 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
645 is a TREE_LIST giving the explicit mem-initializer-list for the
646 constructor. The TREE_PURPOSE of each entry is a subobject (a
647 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
648 is a TREE_LIST giving the arguments to the constructor or
649 void_type_node for an empty list of arguments. */
652 emit_mem_initializers (tree mem_inits
)
654 /* Sort the mem-initializers into the order in which the
655 initializations should be performed. */
656 mem_inits
= sort_mem_initializers (current_class_type
, mem_inits
);
658 in_base_initializer
= 1;
660 /* Initialize base classes. */
662 && TREE_CODE (TREE_PURPOSE (mem_inits
)) != FIELD_DECL
)
664 tree subobject
= TREE_PURPOSE (mem_inits
);
665 tree arguments
= TREE_VALUE (mem_inits
);
667 /* If these initializations are taking place in a copy
668 constructor, the base class should probably be explicitly
670 if (extra_warnings
&& !arguments
671 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
)
672 && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject
)))
673 warning ("%Jbase class %q#T should be explicitly initialized in the "
675 current_function_decl
, BINFO_TYPE (subobject
));
677 /* If an explicit -- but empty -- initializer list was present,
678 treat it just like default initialization at this point. */
679 if (arguments
== void_type_node
)
680 arguments
= NULL_TREE
;
682 /* Initialize the base. */
683 if (BINFO_VIRTUAL_P (subobject
))
684 construct_virtual_base (subobject
, arguments
);
689 base_addr
= build_base_path (PLUS_EXPR
, current_class_ptr
,
691 expand_aggr_init_1 (subobject
, NULL_TREE
,
692 build_indirect_ref (base_addr
, NULL
),
695 expand_cleanup_for_base (subobject
, NULL_TREE
);
698 mem_inits
= TREE_CHAIN (mem_inits
);
700 in_base_initializer
= 0;
702 /* Initialize the vptrs. */
703 initialize_vtbl_ptrs (current_class_ptr
);
705 /* Initialize the data members. */
708 perform_member_init (TREE_PURPOSE (mem_inits
),
709 TREE_VALUE (mem_inits
));
710 mem_inits
= TREE_CHAIN (mem_inits
);
714 /* Returns the address of the vtable (i.e., the value that should be
715 assigned to the vptr) for BINFO. */
718 build_vtbl_address (tree binfo
)
720 tree binfo_for
= binfo
;
723 if (BINFO_VPTR_INDEX (binfo
) && BINFO_VIRTUAL_P (binfo
))
724 /* If this is a virtual primary base, then the vtable we want to store
725 is that for the base this is being used as the primary base of. We
726 can't simply skip the initialization, because we may be expanding the
727 inits of a subobject constructor where the virtual base layout
729 while (BINFO_PRIMARY_P (binfo_for
))
730 binfo_for
= BINFO_INHERITANCE_CHAIN (binfo_for
);
732 /* Figure out what vtable BINFO's vtable is based on, and mark it as
734 vtbl
= get_vtbl_decl_for_binfo (binfo_for
);
735 assemble_external (vtbl
);
736 TREE_USED (vtbl
) = 1;
738 /* Now compute the address to use when initializing the vptr. */
739 vtbl
= unshare_expr (BINFO_VTABLE (binfo_for
));
740 if (TREE_CODE (vtbl
) == VAR_DECL
)
741 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
746 /* This code sets up the virtual function tables appropriate for
747 the pointer DECL. It is a one-ply initialization.
749 BINFO is the exact type that DECL is supposed to be. In
750 multiple inheritance, this might mean "C's A" if C : A, B. */
753 expand_virtual_init (tree binfo
, tree decl
)
758 /* Compute the initializer for vptr. */
759 vtbl
= build_vtbl_address (binfo
);
761 /* We may get this vptr from a VTT, if this is a subobject
762 constructor or subobject destructor. */
763 vtt_index
= BINFO_VPTR_INDEX (binfo
);
769 /* Compute the value to use, when there's a VTT. */
770 vtt_parm
= current_vtt_parm
;
771 vtbl2
= build2 (PLUS_EXPR
,
772 TREE_TYPE (vtt_parm
),
775 vtbl2
= build_indirect_ref (vtbl2
, NULL
);
776 vtbl2
= convert (TREE_TYPE (vtbl
), vtbl2
);
778 /* The actual initializer is the VTT value only in the subobject
779 constructor. In maybe_clone_body we'll substitute NULL for
780 the vtt_parm in the case of the non-subobject constructor. */
781 vtbl
= build3 (COND_EXPR
,
783 build2 (EQ_EXPR
, boolean_type_node
,
784 current_in_charge_parm
, integer_zero_node
),
789 /* Compute the location of the vtpr. */
790 vtbl_ptr
= build_vfield_ref (build_indirect_ref (decl
, NULL
),
792 gcc_assert (vtbl_ptr
!= error_mark_node
);
794 /* Assign the vtable to the vptr. */
795 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
796 finish_expr_stmt (build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
));
799 /* If an exception is thrown in a constructor, those base classes already
800 constructed must be destroyed. This function creates the cleanup
801 for BINFO, which has just been constructed. If FLAG is non-NULL,
802 it is a DECL which is nonzero when this base needs to be
806 expand_cleanup_for_base (tree binfo
, tree flag
)
810 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
813 /* Call the destructor. */
814 expr
= build_special_member_call (current_class_ref
,
815 base_dtor_identifier
,
818 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
);
820 expr
= fold (build3 (COND_EXPR
, void_type_node
,
821 c_common_truthvalue_conversion (flag
),
822 expr
, integer_zero_node
));
824 finish_eh_cleanup (expr
);
827 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
831 construct_virtual_base (tree vbase
, tree arguments
)
837 /* If there are virtual base classes with destructors, we need to
838 emit cleanups to destroy them if an exception is thrown during
839 the construction process. These exception regions (i.e., the
840 period during which the cleanups must occur) begin from the time
841 the construction is complete to the end of the function. If we
842 create a conditional block in which to initialize the
843 base-classes, then the cleanup region for the virtual base begins
844 inside a block, and ends outside of that block. This situation
845 confuses the sjlj exception-handling code. Therefore, we do not
846 create a single conditional block, but one for each
847 initialization. (That way the cleanup regions always begin
848 in the outer block.) We trust the back-end to figure out
849 that the FLAG will not change across initializations, and
850 avoid doing multiple tests. */
851 flag
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
852 inner_if_stmt
= begin_if_stmt ();
853 finish_if_stmt_cond (flag
, inner_if_stmt
);
855 /* Compute the location of the virtual base. If we're
856 constructing virtual bases, then we must be the most derived
857 class. Therefore, we don't have to look up the virtual base;
858 we already know where it is. */
859 exp
= convert_to_base_statically (current_class_ref
, vbase
);
861 expand_aggr_init_1 (vbase
, current_class_ref
, exp
, arguments
,
863 finish_then_clause (inner_if_stmt
);
864 finish_if_stmt (inner_if_stmt
);
866 expand_cleanup_for_base (vbase
, flag
);
869 /* Find the context in which this FIELD can be initialized. */
872 initializing_context (tree field
)
874 tree t
= DECL_CONTEXT (field
);
876 /* Anonymous union members can be initialized in the first enclosing
877 non-anonymous union context. */
878 while (t
&& ANON_AGGR_TYPE_P (t
))
879 t
= TYPE_CONTEXT (t
);
883 /* Function to give error message if member initialization specification
884 is erroneous. FIELD is the member we decided to initialize.
885 TYPE is the type for which the initialization is being performed.
886 FIELD must be a member of TYPE.
888 MEMBER_NAME is the name of the member. */
891 member_init_ok_or_else (tree field
, tree type
, tree member_name
)
893 if (field
== error_mark_node
)
897 error ("class %qT does not have any field named %qD", type
,
901 if (TREE_CODE (field
) == VAR_DECL
)
903 error ("%q#D is a static data member; it can only be "
904 "initialized at its definition",
908 if (TREE_CODE (field
) != FIELD_DECL
)
910 error ("%q#D is not a non-static data member of %qT",
914 if (initializing_context (field
) != type
)
916 error ("class %qT does not have any field named %qD", type
,
924 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
925 is a _TYPE node or TYPE_DECL which names a base for that type.
926 Check the validity of NAME, and return either the base _TYPE, base
927 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
928 NULL_TREE and issue a diagnostic.
930 An old style unnamed direct single base construction is permitted,
931 where NAME is NULL. */
934 expand_member_init (tree name
)
939 if (!current_class_ref
)
944 /* This is an obsolete unnamed base class initializer. The
945 parser will already have warned about its use. */
946 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type
)))
949 error ("unnamed initializer for %qT, which has no base classes",
953 basetype
= BINFO_TYPE
954 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type
), 0));
957 error ("unnamed initializer for %qT, which uses multiple inheritance",
962 else if (TYPE_P (name
))
964 basetype
= TYPE_MAIN_VARIANT (name
);
965 name
= TYPE_NAME (name
);
967 else if (TREE_CODE (name
) == TYPE_DECL
)
968 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
970 basetype
= NULL_TREE
;
979 if (current_template_parms
)
982 class_binfo
= TYPE_BINFO (current_class_type
);
983 direct_binfo
= NULL_TREE
;
984 virtual_binfo
= NULL_TREE
;
986 /* Look for a direct base. */
987 for (i
= 0; BINFO_BASE_ITERATE (class_binfo
, i
, direct_binfo
); ++i
)
988 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo
), basetype
))
991 /* Look for a virtual base -- unless the direct base is itself
993 if (!direct_binfo
|| !BINFO_VIRTUAL_P (direct_binfo
))
994 virtual_binfo
= binfo_for_vbase (basetype
, current_class_type
);
998 If a mem-initializer-id is ambiguous because it designates
999 both a direct non-virtual base class and an inherited virtual
1000 base class, the mem-initializer is ill-formed. */
1001 if (direct_binfo
&& virtual_binfo
)
1003 error ("%qD is both a direct base and an indirect virtual base",
1008 if (!direct_binfo
&& !virtual_binfo
)
1010 if (CLASSTYPE_VBASECLASSES (current_class_type
))
1011 error ("type %qD is not a direct or virtual base of %qT",
1012 name
, current_class_type
);
1014 error ("type %qD is not a direct base of %qT",
1015 name
, current_class_type
);
1019 return direct_binfo
? direct_binfo
: virtual_binfo
;
1023 if (TREE_CODE (name
) == IDENTIFIER_NODE
)
1024 field
= lookup_field (current_class_type
, name
, 1, false);
1028 if (member_init_ok_or_else (field
, current_class_type
, name
))
1035 /* This is like `expand_member_init', only it stores one aggregate
1038 INIT comes in two flavors: it is either a value which
1039 is to be stored in EXP, or it is a parameter list
1040 to go to a constructor, which will operate on EXP.
1041 If INIT is not a parameter list for a constructor, then set
1042 LOOKUP_ONLYCONVERTING.
1043 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1044 the initializer, if FLAGS is 0, then it is the (init) form.
1045 If `init' is a CONSTRUCTOR, then we emit a warning message,
1046 explaining that such initializations are invalid.
1048 If INIT resolves to a CALL_EXPR which happens to return
1049 something of the type we are looking for, then we know
1050 that we can safely use that call to perform the
1053 The virtual function table pointer cannot be set up here, because
1054 we do not really know its type.
1056 This never calls operator=().
1058 When initializing, nothing is CONST.
1060 A default copy constructor may have to be used to perform the
1063 A constructor or a conversion operator may have to be used to
1064 perform the initialization, but not both, as it would be ambiguous. */
1067 build_aggr_init (tree exp
, tree init
, int flags
)
1072 tree type
= TREE_TYPE (exp
);
1073 int was_const
= TREE_READONLY (exp
);
1074 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1077 if (init
== error_mark_node
)
1078 return error_mark_node
;
1080 TREE_READONLY (exp
) = 0;
1081 TREE_THIS_VOLATILE (exp
) = 0;
1083 if (init
&& TREE_CODE (init
) != TREE_LIST
)
1084 flags
|= LOOKUP_ONLYCONVERTING
;
1086 if (TREE_CODE (type
) == ARRAY_TYPE
)
1090 /* An array may not be initialized use the parenthesized
1091 initialization form -- unless the initializer is "()". */
1092 if (init
&& TREE_CODE (init
) == TREE_LIST
)
1094 error ("bad array initializer");
1095 return error_mark_node
;
1097 /* Must arrange to initialize each element of EXP
1098 from elements of INIT. */
1099 itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1100 if (cp_type_quals (type
) != TYPE_UNQUALIFIED
)
1101 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1102 if (itype
&& cp_type_quals (itype
) != TYPE_UNQUALIFIED
)
1103 itype
= TREE_TYPE (init
) = TYPE_MAIN_VARIANT (itype
);
1104 stmt_expr
= build_vec_init (exp
, NULL_TREE
, init
,
1105 itype
&& same_type_p (itype
,
1107 TREE_READONLY (exp
) = was_const
;
1108 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1109 TREE_TYPE (exp
) = type
;
1111 TREE_TYPE (init
) = itype
;
1115 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1116 /* Just know that we've seen something for this node. */
1117 TREE_USED (exp
) = 1;
1119 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1120 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
1121 destroy_temps
= stmts_are_full_exprs_p ();
1122 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
1123 expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
1124 init
, LOOKUP_NORMAL
|flags
);
1125 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
1126 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
1127 TREE_TYPE (exp
) = type
;
1128 TREE_READONLY (exp
) = was_const
;
1129 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1134 /* Like build_aggr_init, but not just for aggregates. */
1137 build_init (tree decl
, tree init
, int flags
)
1141 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1142 expr
= build_aggr_init (decl
, init
, flags
);
1143 else if (CLASS_TYPE_P (TREE_TYPE (decl
)))
1144 expr
= build_special_member_call (decl
, complete_ctor_identifier
,
1145 build_tree_list (NULL_TREE
, init
),
1147 LOOKUP_NORMAL
|flags
);
1149 expr
= build2 (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
1155 expand_default_init (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
)
1157 tree type
= TREE_TYPE (exp
);
1160 /* It fails because there may not be a constructor which takes
1161 its own type as the first (or only parameter), but which does
1162 take other types via a conversion. So, if the thing initializing
1163 the expression is a unit element of type X, first try X(X&),
1164 followed by initialization by X. If neither of these work
1165 out, then look hard. */
1169 if (init
&& TREE_CODE (init
) != TREE_LIST
1170 && (flags
& LOOKUP_ONLYCONVERTING
))
1172 /* Base subobjects should only get direct-initialization. */
1173 gcc_assert (true_exp
== exp
);
1175 if (flags
& DIRECT_BIND
)
1176 /* Do nothing. We hit this in two cases: Reference initialization,
1177 where we aren't initializing a real variable, so we don't want
1178 to run a new constructor; and catching an exception, where we
1179 have already built up the constructor call so we could wrap it
1180 in an exception region. */;
1181 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
1183 /* A brace-enclosed initializer for an aggregate. */
1184 gcc_assert (CP_AGGREGATE_TYPE_P (type
));
1185 init
= digest_init (type
, init
, (tree
*)NULL
);
1188 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1190 if (TREE_CODE (init
) == MUST_NOT_THROW_EXPR
)
1191 /* We need to protect the initialization of a catch parm with a
1192 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1193 around the TARGET_EXPR for the copy constructor. See
1194 initialize_handler_parm. */
1196 TREE_OPERAND (init
, 0) = build2 (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1197 TREE_OPERAND (init
, 0));
1198 TREE_TYPE (init
) = void_type_node
;
1201 init
= build2 (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1202 TREE_SIDE_EFFECTS (init
) = 1;
1203 finish_expr_stmt (init
);
1207 if (init
== NULL_TREE
1208 || (TREE_CODE (init
) == TREE_LIST
&& ! TREE_TYPE (init
)))
1212 init
= TREE_VALUE (parms
);
1215 parms
= build_tree_list (NULL_TREE
, init
);
1217 if (true_exp
== exp
)
1218 ctor_name
= complete_ctor_identifier
;
1220 ctor_name
= base_ctor_identifier
;
1222 rval
= build_special_member_call (exp
, ctor_name
, parms
, binfo
, flags
);
1223 if (TREE_SIDE_EFFECTS (rval
))
1224 finish_expr_stmt (convert_to_void (rval
, NULL
));
1227 /* This function is responsible for initializing EXP with INIT
1230 BINFO is the binfo of the type for who we are performing the
1231 initialization. For example, if W is a virtual base class of A and B,
1233 If we are initializing B, then W must contain B's W vtable, whereas
1234 were we initializing C, W must contain C's W vtable.
1236 TRUE_EXP is nonzero if it is the true expression being initialized.
1237 In this case, it may be EXP, or may just contain EXP. The reason we
1238 need this is because if EXP is a base element of TRUE_EXP, we
1239 don't necessarily know by looking at EXP where its virtual
1240 baseclass fields should really be pointing. But we do know
1241 from TRUE_EXP. In constructors, we don't know anything about
1242 the value being initialized.
1244 FLAGS is just passed to `build_new_method_call'. See that function
1245 for its description. */
1248 expand_aggr_init_1 (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
)
1250 tree type
= TREE_TYPE (exp
);
1252 gcc_assert (init
!= error_mark_node
&& type
!= error_mark_node
);
1253 gcc_assert (building_stmt_tree ());
1255 /* Use a function returning the desired type to initialize EXP for us.
1256 If the function is a constructor, and its first argument is
1257 NULL_TREE, know that it was meant for us--just slide exp on
1258 in and expand the constructor. Constructors now come
1261 if (init
&& TREE_CODE (exp
) == VAR_DECL
1262 && TREE_CODE (init
) == CONSTRUCTOR
1263 && TREE_HAS_CONSTRUCTOR (init
))
1265 /* If store_init_value returns NULL_TREE, the INIT has been
1266 record in the DECL_INITIAL for EXP. That means there's
1267 nothing more we have to do. */
1268 init
= store_init_value (exp
, init
);
1270 finish_expr_stmt (init
);
1274 /* We know that expand_default_init can handle everything we want
1276 expand_default_init (binfo
, true_exp
, exp
, init
, flags
);
1279 /* Report an error if TYPE is not a user-defined, aggregate type. If
1280 OR_ELSE is nonzero, give an error message. */
1283 is_aggr_type (tree type
, int or_else
)
1285 if (type
== error_mark_node
)
1288 if (! IS_AGGR_TYPE (type
)
1289 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1290 && TREE_CODE (type
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
1293 error ("%qT is not an aggregate type", type
);
1300 get_type_value (tree name
)
1302 if (name
== error_mark_node
)
1305 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1306 return IDENTIFIER_TYPE_VALUE (name
);
1311 /* Build a reference to a member of an aggregate. This is not a C++
1312 `&', but really something which can have its address taken, and
1313 then act as a pointer to member, for example TYPE :: FIELD can have
1314 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1315 this expression is the operand of "&".
1317 @@ Prints out lousy diagnostics for operator <typename>
1320 @@ This function should be rewritten and placed in search.c. */
1323 build_offset_ref (tree type
, tree name
, bool address_p
)
1327 tree basebinfo
= NULL_TREE
;
1328 tree orig_name
= name
;
1330 /* class templates can come in as TEMPLATE_DECLs here. */
1331 if (TREE_CODE (name
) == TEMPLATE_DECL
)
1334 if (dependent_type_p (type
) || type_dependent_expression_p (name
))
1335 return build_min_nt (SCOPE_REF
, type
, name
);
1337 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1339 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1340 something like `a.template f<int>' or the like. For the most
1341 part, we treat this just like a.f. We do remember, however,
1342 the template-id that was used. */
1343 name
= TREE_OPERAND (orig_name
, 0);
1346 name
= DECL_NAME (name
);
1349 if (TREE_CODE (name
) == COMPONENT_REF
)
1350 name
= TREE_OPERAND (name
, 1);
1351 if (TREE_CODE (name
) == OVERLOAD
)
1352 name
= DECL_NAME (OVL_CURRENT (name
));
1355 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
1358 if (type
== NULL_TREE
)
1359 return error_mark_node
;
1361 /* Handle namespace names fully here. */
1362 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1364 tree t
= lookup_namespace_name (type
, name
);
1365 if (t
== error_mark_node
)
1367 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1368 /* Reconstruct the TEMPLATE_ID_EXPR. */
1369 t
= build2 (TEMPLATE_ID_EXPR
, TREE_TYPE (t
),
1370 t
, TREE_OPERAND (orig_name
, 1));
1371 if (! type_unknown_p (t
))
1374 t
= convert_from_reference (t
);
1379 if (! is_aggr_type (type
, 1))
1380 return error_mark_node
;
1382 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1384 if (! check_dtor_name (type
, name
))
1385 error ("qualified type %qT does not match destructor name %<~%T%>",
1386 type
, TREE_OPERAND (name
, 0));
1387 name
= dtor_identifier
;
1390 if (!COMPLETE_TYPE_P (complete_type (type
))
1391 && !TYPE_BEING_DEFINED (type
))
1393 error ("incomplete type %qT does not have member %qD", type
, name
);
1394 return error_mark_node
;
1397 /* Set up BASEBINFO for member lookup. */
1398 decl
= maybe_dummy_object (type
, &basebinfo
);
1400 if (BASELINK_P (name
) || DECL_P (name
))
1404 member
= lookup_member (basebinfo
, name
, 1, 0);
1406 if (member
== error_mark_node
)
1407 return error_mark_node
;
1412 error ("%qD is not a member of type %qT", name
, type
);
1413 return error_mark_node
;
1416 if (processing_template_decl
)
1418 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1419 return build_min (SCOPE_REF
, TREE_TYPE (member
), type
, orig_name
);
1421 return build_min (SCOPE_REF
, TREE_TYPE (member
), type
, name
);
1424 if (TREE_CODE (member
) == TYPE_DECL
)
1426 TREE_USED (member
) = 1;
1429 /* static class members and class-specific enum
1430 values can be returned without further ado. */
1431 if (TREE_CODE (member
) == VAR_DECL
|| TREE_CODE (member
) == CONST_DECL
)
1434 return convert_from_reference (member
);
1437 if (TREE_CODE (member
) == FIELD_DECL
&& DECL_C_BIT_FIELD (member
))
1439 error ("invalid pointer to bit-field %qD", member
);
1440 return error_mark_node
;
1443 /* A lot of this logic is now handled in lookup_member. */
1444 if (BASELINK_P (member
))
1446 /* Go from the TREE_BASELINK to the member function info. */
1447 tree fnfields
= member
;
1448 tree t
= BASELINK_FUNCTIONS (fnfields
);
1450 if (TREE_CODE (orig_name
) == TEMPLATE_ID_EXPR
)
1452 /* The FNFIELDS are going to contain functions that aren't
1453 necessarily templates, and templates that don't
1454 necessarily match the explicit template parameters. We
1455 save all the functions, and the explicit parameters, and
1456 then figure out exactly what to instantiate with what
1457 arguments in instantiate_type. */
1459 if (TREE_CODE (t
) != OVERLOAD
)
1460 /* The code in instantiate_type which will process this
1461 expects to encounter OVERLOADs, not raw functions. */
1462 t
= ovl_cons (t
, NULL_TREE
);
1464 t
= build2 (TEMPLATE_ID_EXPR
, TREE_TYPE (t
), t
,
1465 TREE_OPERAND (orig_name
, 1));
1466 t
= build2 (OFFSET_REF
, unknown_type_node
, decl
, t
);
1468 PTRMEM_OK_P (t
) = 1;
1473 if (TREE_CODE (t
) != TEMPLATE_ID_EXPR
&& !really_overloaded_fn (t
))
1475 /* Get rid of a potential OVERLOAD around it. */
1476 t
= OVL_CURRENT (t
);
1478 /* Unique functions are handled easily. */
1480 /* For non-static member of base class, we need a special rule
1481 for access checking [class.protected]:
1483 If the access is to form a pointer to member, the
1484 nested-name-specifier shall name the derived class
1485 (or any class derived from that class). */
1486 if (address_p
&& DECL_P (t
)
1487 && DECL_NONSTATIC_MEMBER_P (t
))
1488 perform_or_defer_access_check (TYPE_BINFO (type
), t
);
1490 perform_or_defer_access_check (basebinfo
, t
);
1493 if (DECL_STATIC_FUNCTION_P (t
))
1499 TREE_TYPE (fnfields
) = unknown_type_node
;
1503 else if (address_p
&& TREE_CODE (member
) == FIELD_DECL
)
1504 /* We need additional test besides the one in
1505 check_accessibility_of_qualified_id in case it is
1506 a pointer to non-static member. */
1507 perform_or_defer_access_check (TYPE_BINFO (type
), member
);
1511 /* If MEMBER is non-static, then the program has fallen afoul of
1514 An id-expression that denotes a nonstatic data member or
1515 nonstatic member function of a class can only be used:
1517 -- as part of a class member access (_expr.ref_) in which the
1518 object-expression refers to the member's class or a class
1519 derived from that class, or
1521 -- to form a pointer to member (_expr.unary.op_), or
1523 -- in the body of a nonstatic member function of that class or
1524 of a class derived from that class (_class.mfct.nonstatic_), or
1526 -- in a mem-initializer for a constructor for that class or for
1527 a class derived from that class (_class.base.init_). */
1528 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member
))
1530 /* Build a representation of a the qualified name suitable
1531 for use as the operand to "&" -- even though the "&" is
1532 not actually present. */
1533 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
1534 /* In Microsoft mode, treat a non-static member function as if
1535 it were a pointer-to-member. */
1536 if (flag_ms_extensions
)
1538 PTRMEM_OK_P (member
) = 1;
1539 return build_unary_op (ADDR_EXPR
, member
, 0);
1541 error ("invalid use of non-static member function %qD",
1542 TREE_OPERAND (member
, 1));
1545 else if (TREE_CODE (member
) == FIELD_DECL
)
1547 error ("invalid use of non-static data member %qD", member
);
1548 return error_mark_node
;
1553 /* In member functions, the form `type::name' is no longer
1554 equivalent to `this->type::name', at least not until
1555 resolve_offset_ref. */
1556 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
1557 PTRMEM_OK_P (member
) = 1;
1561 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1562 constant of integral or enumeration type, then return that value.
1563 These are those variables permitted in constant expressions by
1564 [5.19/1]. FIXME:If we did lazy folding, this could be localized. */
1567 integral_constant_value (tree decl
)
1569 if ((TREE_CODE (decl
) == CONST_DECL
1570 || (TREE_CODE (decl
) == VAR_DECL
1571 /* And so are variables with a 'const' type -- unless they
1572 are also 'volatile'. */
1573 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl
))
1574 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
)))
1575 && DECL_INITIAL (decl
)
1576 && DECL_INITIAL (decl
) != error_mark_node
1577 && TREE_TYPE (DECL_INITIAL (decl
))
1578 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (decl
)))
1579 return DECL_INITIAL (decl
);
1583 /* A more relaxed version of integral_constant_value, for which type
1584 is not considered. This is used by the common C/C++ code, and not
1585 directly by the C++ front end. */
1588 decl_constant_value (tree decl
)
1590 if ((TREE_CODE (decl
) == CONST_DECL
1591 || (TREE_CODE (decl
) == VAR_DECL
1592 /* And so are variables with a 'const' type -- unless they
1593 are also 'volatile'. */
1594 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl
))))
1595 && DECL_INITIAL (decl
)
1596 && DECL_INITIAL (decl
) != error_mark_node
1597 /* This is invalid if initial value is not constant. If it has
1598 either a function call, a memory reference, or a variable,
1599 then re-evaluating it could give different results. */
1600 && TREE_CONSTANT (DECL_INITIAL (decl
)))
1601 return DECL_INITIAL (decl
);
1606 /* Common subroutines of build_new and build_vec_delete. */
1608 /* Call the global __builtin_delete to delete ADDR. */
1611 build_builtin_delete_call (tree addr
)
1613 mark_used (global_delete_fndecl
);
1614 return build_call (global_delete_fndecl
, build_tree_list (NULL_TREE
, addr
));
1617 /* Generate a representation for a C++ "new" expression. PLACEMENT is
1618 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
1619 NELTS is NULL, TYPE is the type of the storage to be allocated. If
1620 NELTS is not NULL, then this is an array-new allocation; TYPE is
1621 the type of the elements in the array and NELTS is the number of
1622 elements in the array. INIT, if non-NULL, is the initializer for
1623 the new object. If USE_GLOBAL_NEW is true, then the user
1624 explicitly wrote "::new" rather than just "new". */
1627 build_new (tree placement
, tree type
, tree nelts
, tree init
,
1632 if (type
== error_mark_node
)
1633 return error_mark_node
;
1635 if (processing_template_decl
)
1637 rval
= build_min (NEW_EXPR
, build_pointer_type (type
),
1638 placement
, type
, nelts
, init
);
1639 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
1640 TREE_SIDE_EFFECTS (rval
) = 1;
1646 if (!build_expr_type_conversion (WANT_INT
| WANT_ENUM
, nelts
, false))
1647 pedwarn ("size in array new must have integral type");
1648 nelts
= save_expr (cp_convert (sizetype
, nelts
));
1649 if (nelts
== integer_zero_node
)
1650 warning ("zero size array reserves no space");
1653 /* ``A reference cannot be created by the new operator. A reference
1654 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1655 returned by new.'' ARM 5.3.3 */
1656 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1658 error ("new cannot be applied to a reference type");
1659 type
= TREE_TYPE (type
);
1662 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1664 error ("new cannot be applied to a function type");
1665 return error_mark_node
;
1668 rval
= build4 (NEW_EXPR
, build_pointer_type (type
), placement
, type
,
1670 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
1671 TREE_SIDE_EFFECTS (rval
) = 1;
1672 rval
= build_new_1 (rval
);
1673 if (rval
== error_mark_node
)
1674 return error_mark_node
;
1676 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
1677 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
1678 TREE_NO_WARNING (rval
) = 1;
1683 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
1686 build_java_class_ref (tree type
)
1688 tree name
= NULL_TREE
, class_decl
;
1689 static tree CL_suffix
= NULL_TREE
;
1690 if (CL_suffix
== NULL_TREE
)
1691 CL_suffix
= get_identifier("class$");
1692 if (jclass_node
== NULL_TREE
)
1694 jclass_node
= IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1695 if (jclass_node
== NULL_TREE
)
1696 fatal_error ("call to Java constructor, while %<jclass%> undefined");
1698 jclass_node
= TREE_TYPE (jclass_node
);
1701 /* Mangle the class$ field. */
1704 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1705 if (DECL_NAME (field
) == CL_suffix
)
1707 mangle_decl (field
);
1708 name
= DECL_ASSEMBLER_NAME (field
);
1712 internal_error ("can't find class$");
1715 class_decl
= IDENTIFIER_GLOBAL_VALUE (name
);
1716 if (class_decl
== NULL_TREE
)
1718 class_decl
= build_decl (VAR_DECL
, name
, TREE_TYPE (jclass_node
));
1719 TREE_STATIC (class_decl
) = 1;
1720 DECL_EXTERNAL (class_decl
) = 1;
1721 TREE_PUBLIC (class_decl
) = 1;
1722 DECL_ARTIFICIAL (class_decl
) = 1;
1723 DECL_IGNORED_P (class_decl
) = 1;
1724 pushdecl_top_level (class_decl
);
1725 make_decl_rtl (class_decl
);
1731 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
1732 value is immediately handed to expand_expr. */
1735 build_new_1 (tree exp
)
1737 tree placement
, init
;
1739 /* True iff this is a call to "operator new[]" instead of just
1741 bool array_p
= false;
1742 /* True iff ARRAY_P is true and the bound of the array type is
1743 not necessarily a compile time constant. For example, VLA_P is
1744 true for "new int[f()]". */
1746 /* The type being allocated. If ARRAY_P is true, this will be an
1749 /* If ARRAY_P is true, the element type of the array. This is an
1750 never ARRAY_TYPE; for something like "new int[3][4]", the
1751 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1754 /* The type of the new-expression. (This type is always a pointer
1757 /* The type pointed to by POINTER_TYPE. This type may be different
1758 from ELT_TYPE for a multi-dimensional array; ELT_TYPE is never an
1759 ARRAY_TYPE, but TYPE may be an ARRAY_TYPE. */
1761 /* A pointer type pointing to to the FULL_TYPE. */
1762 tree full_pointer_type
;
1763 tree outer_nelts
= NULL_TREE
;
1764 tree nelts
= NULL_TREE
;
1765 tree alloc_call
, alloc_expr
;
1766 /* The address returned by the call to "operator new". This node is
1767 a VAR_DECL and is therefore reusable. */
1770 tree cookie_expr
, init_expr
;
1771 int nothrow
, check_new
;
1772 /* Nonzero if the user wrote `::new' rather than just `new'. */
1773 int globally_qualified_p
;
1774 int use_java_new
= 0;
1775 /* If non-NULL, the number of extra bytes to allocate at the
1776 beginning of the storage allocated for an array-new expression in
1777 order to store the number of elements. */
1778 tree cookie_size
= NULL_TREE
;
1779 /* True if the function we are calling is a placement allocation
1781 bool placement_allocation_fn_p
;
1782 tree args
= NULL_TREE
;
1783 /* True if the storage must be initialized, either by a constructor
1784 or due to an explicit new-initializer. */
1785 bool is_initialized
;
1786 /* The address of the thing allocated, not including any cookie. In
1787 particular, if an array cookie is in use, DATA_ADDR is the
1788 address of the first array element. This node is a VAR_DECL, and
1789 is therefore reusable. */
1791 tree init_preeval_expr
= NULL_TREE
;
1793 placement
= TREE_OPERAND (exp
, 0);
1794 type
= TREE_OPERAND (exp
, 1);
1795 nelts
= TREE_OPERAND (exp
, 2);
1796 init
= TREE_OPERAND (exp
, 3);
1797 globally_qualified_p
= NEW_EXPR_USE_GLOBAL (exp
);
1803 outer_nelts
= nelts
;
1806 /* ??? The middle-end will error on us for building a VLA outside a
1807 function context. Methinks that's not it's purvey. So we'll do
1808 our own VLA layout later. */
1810 full_type
= build_cplus_array_type (type
, NULL_TREE
);
1811 index
= convert (sizetype
, nelts
);
1812 index
= size_binop (MINUS_EXPR
, index
, size_one_node
);
1813 TYPE_DOMAIN (full_type
) = build_index_type (index
);
1818 if (TREE_CODE (type
) == ARRAY_TYPE
)
1821 nelts
= array_type_nelts_top (type
);
1822 outer_nelts
= nelts
;
1823 type
= TREE_TYPE (type
);
1827 /* If our base type is an array, then make sure we know how many elements
1829 for (elt_type
= type
;
1830 TREE_CODE (elt_type
) == ARRAY_TYPE
;
1831 elt_type
= TREE_TYPE (elt_type
))
1832 nelts
= cp_build_binary_op (MULT_EXPR
, nelts
,
1833 array_type_nelts_top (elt_type
));
1835 if (!complete_type_or_else (elt_type
, exp
))
1836 return error_mark_node
;
1838 if (TREE_CODE (elt_type
) == VOID_TYPE
)
1840 error ("invalid type %<void%> for new");
1841 return error_mark_node
;
1844 if (abstract_virtuals_error (NULL_TREE
, elt_type
))
1845 return error_mark_node
;
1847 is_initialized
= (TYPE_NEEDS_CONSTRUCTING (elt_type
) || init
);
1848 if (CP_TYPE_CONST_P (elt_type
) && !is_initialized
)
1850 error ("uninitialized const in %<new%> of %q#T", elt_type
);
1851 return error_mark_node
;
1854 size
= size_in_bytes (elt_type
);
1857 size
= size_binop (MULT_EXPR
, size
, convert (sizetype
, nelts
));
1862 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1863 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1864 ...>> to be valid. */
1865 TYPE_SIZE_UNIT (full_type
) = size
;
1866 n
= convert (bitsizetype
, nelts
);
1867 bitsize
= size_binop (MULT_EXPR
, TYPE_SIZE (elt_type
), n
);
1868 TYPE_SIZE (full_type
) = bitsize
;
1872 /* Allocate the object. */
1873 if (! placement
&& TYPE_FOR_JAVA (elt_type
))
1875 tree class_addr
, alloc_decl
;
1876 tree class_decl
= build_java_class_ref (elt_type
);
1877 static const char alloc_name
[] = "_Jv_AllocObject";
1881 if (!get_global_value_if_present (get_identifier (alloc_name
),
1884 error ("call to Java constructor with %qs undefined", alloc_name
);
1885 return error_mark_node
;
1887 else if (really_overloaded_fn (alloc_decl
))
1889 error ("%qD should never be overloaded", alloc_decl
);
1890 return error_mark_node
;
1892 alloc_decl
= OVL_CURRENT (alloc_decl
);
1893 class_addr
= build1 (ADDR_EXPR
, jclass_node
, class_decl
);
1894 alloc_call
= (build_function_call
1896 build_tree_list (NULL_TREE
, class_addr
)));
1903 fnname
= ansi_opname (array_p
? VEC_NEW_EXPR
: NEW_EXPR
);
1905 if (!globally_qualified_p
1906 && CLASS_TYPE_P (elt_type
)
1908 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type
)
1909 : TYPE_HAS_NEW_OPERATOR (elt_type
)))
1911 /* Use a class-specific operator new. */
1912 /* If a cookie is required, add some extra space. */
1913 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
1915 cookie_size
= targetm
.cxx
.get_cookie_size (elt_type
);
1916 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
1918 /* Create the argument list. */
1919 args
= tree_cons (NULL_TREE
, size
, placement
);
1920 /* Do name-lookup to find the appropriate operator. */
1921 fns
= lookup_fnfields (elt_type
, fnname
, /*protect=*/2);
1922 if (TREE_CODE (fns
) == TREE_LIST
)
1924 error ("request for member %qD is ambiguous", fnname
);
1925 print_candidates (fns
);
1926 return error_mark_node
;
1928 alloc_call
= build_new_method_call (build_dummy_object (elt_type
),
1930 /*conversion_path=*/NULL_TREE
,
1935 /* Use a global operator new. */
1936 /* See if a cookie might be required. */
1937 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
1938 cookie_size
= targetm
.cxx
.get_cookie_size (elt_type
);
1940 cookie_size
= NULL_TREE
;
1942 alloc_call
= build_operator_new_call (fnname
, placement
,
1943 &size
, &cookie_size
);
1947 if (alloc_call
== error_mark_node
)
1948 return error_mark_node
;
1950 /* In the simple case, we can stop now. */
1951 pointer_type
= build_pointer_type (type
);
1952 if (!cookie_size
&& !is_initialized
)
1953 return build_nop (pointer_type
, alloc_call
);
1955 /* While we're working, use a pointer to the type we've actually
1956 allocated. Store the result of the call in a variable so that we
1957 can use it more than once. */
1958 full_pointer_type
= build_pointer_type (full_type
);
1959 alloc_expr
= get_target_expr (build_nop (full_pointer_type
, alloc_call
));
1960 alloc_node
= TARGET_EXPR_SLOT (alloc_expr
);
1962 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
1963 while (TREE_CODE (alloc_call
) == COMPOUND_EXPR
)
1964 alloc_call
= TREE_OPERAND (alloc_call
, 1);
1965 alloc_fn
= get_callee_fndecl (alloc_call
);
1966 gcc_assert (alloc_fn
!= NULL_TREE
);
1968 /* Now, check to see if this function is actually a placement
1969 allocation function. This can happen even when PLACEMENT is NULL
1970 because we might have something like:
1972 struct S { void* operator new (size_t, int i = 0); };
1974 A call to `new S' will get this allocation function, even though
1975 there is no explicit placement argument. If there is more than
1976 one argument, or there are variable arguments, then this is a
1977 placement allocation function. */
1978 placement_allocation_fn_p
1979 = (type_num_arguments (TREE_TYPE (alloc_fn
)) > 1
1980 || varargs_function_p (alloc_fn
));
1982 /* Preevaluate the placement args so that we don't reevaluate them for a
1983 placement delete. */
1984 if (placement_allocation_fn_p
)
1987 stabilize_call (alloc_call
, &inits
);
1989 alloc_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (alloc_expr
), inits
,
1993 /* unless an allocation function is declared with an empty excep-
1994 tion-specification (_except.spec_), throw(), it indicates failure to
1995 allocate storage by throwing a bad_alloc exception (clause _except_,
1996 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
1997 cation function is declared with an empty exception-specification,
1998 throw(), it returns null to indicate failure to allocate storage and a
1999 non-null pointer otherwise.
2001 So check for a null exception spec on the op new we just called. */
2003 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (alloc_fn
));
2004 check_new
= (flag_check_new
|| nothrow
) && ! use_java_new
;
2011 /* Adjust so we're pointing to the start of the object. */
2012 data_addr
= get_target_expr (build2 (PLUS_EXPR
, full_pointer_type
,
2013 alloc_node
, cookie_size
));
2015 /* Store the number of bytes allocated so that we can know how
2016 many elements to destroy later. We use the last sizeof
2017 (size_t) bytes to store the number of elements. */
2018 cookie_ptr
= build2 (MINUS_EXPR
, build_pointer_type (sizetype
),
2019 data_addr
, size_in_bytes (sizetype
));
2020 cookie
= build_indirect_ref (cookie_ptr
, NULL
);
2022 cookie_expr
= build2 (MODIFY_EXPR
, sizetype
, cookie
, nelts
);
2024 if (targetm
.cxx
.cookie_has_size ())
2026 /* Also store the element size. */
2027 cookie_ptr
= build2 (MINUS_EXPR
, build_pointer_type (sizetype
),
2028 cookie_ptr
, size_in_bytes (sizetype
));
2029 cookie
= build_indirect_ref (cookie_ptr
, NULL
);
2030 cookie
= build2 (MODIFY_EXPR
, sizetype
, cookie
,
2031 size_in_bytes(elt_type
));
2032 cookie_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cookie_expr
),
2033 cookie
, cookie_expr
);
2035 data_addr
= TARGET_EXPR_SLOT (data_addr
);
2039 cookie_expr
= NULL_TREE
;
2040 data_addr
= alloc_node
;
2043 /* Now initialize the allocated object. Note that we preevaluate the
2044 initialization expression, apart from the actual constructor call or
2045 assignment--we do this because we want to delay the allocation as long
2046 as possible in order to minimize the size of the exception region for
2047 placement delete. */
2052 init_expr
= build_indirect_ref (data_addr
, NULL
);
2054 if (init
== void_zero_node
)
2055 init
= build_default_init (full_type
, nelts
);
2056 else if (init
&& array_p
)
2057 pedwarn ("ISO C++ forbids initialization in array new");
2062 = build_vec_init (init_expr
,
2063 cp_build_binary_op (MINUS_EXPR
, outer_nelts
,
2065 init
, /*from_array=*/0);
2067 /* An array initialization is stable because the initialization
2068 of each element is a full-expression, so the temporaries don't
2072 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2074 init_expr
= build_special_member_call (init_expr
,
2075 complete_ctor_identifier
,
2078 stable
= stabilize_init (init_expr
, &init_preeval_expr
);
2082 /* We are processing something like `new int (10)', which
2083 means allocate an int, and initialize it with 10. */
2085 if (TREE_CODE (init
) == TREE_LIST
)
2086 init
= build_x_compound_expr_from_list (init
, "new initializer");
2089 gcc_assert (TREE_CODE (init
) != CONSTRUCTOR
2090 || TREE_TYPE (init
) != NULL_TREE
);
2092 init_expr
= build_modify_expr (init_expr
, INIT_EXPR
, init
);
2093 stable
= stabilize_init (init_expr
, &init_preeval_expr
);
2096 if (init_expr
== error_mark_node
)
2097 return error_mark_node
;
2099 /* If any part of the object initialization terminates by throwing an
2100 exception and a suitable deallocation function can be found, the
2101 deallocation function is called to free the memory in which the
2102 object was being constructed, after which the exception continues
2103 to propagate in the context of the new-expression. If no
2104 unambiguous matching deallocation function can be found,
2105 propagating the exception does not cause the object's memory to be
2107 if (flag_exceptions
&& ! use_java_new
)
2109 enum tree_code dcode
= array_p
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2112 /* The Standard is unclear here, but the right thing to do
2113 is to use the same method for finding deallocation
2114 functions that we use for finding allocation functions. */
2115 cleanup
= build_op_delete_call (dcode
, alloc_node
, size
,
2116 globally_qualified_p
,
2117 (placement_allocation_fn_p
2118 ? alloc_call
: NULL_TREE
));
2123 /* This is much simpler if we were able to preevaluate all of
2124 the arguments to the constructor call. */
2125 init_expr
= build2 (TRY_CATCH_EXPR
, void_type_node
,
2126 init_expr
, cleanup
);
2128 /* Ack! First we allocate the memory. Then we set our sentry
2129 variable to true, and expand a cleanup that deletes the
2130 memory if sentry is true. Then we run the constructor, and
2131 finally clear the sentry.
2133 We need to do this because we allocate the space first, so
2134 if there are any temporaries with cleanups in the
2135 constructor args and we weren't able to preevaluate them, we
2136 need this EH region to extend until end of full-expression
2137 to preserve nesting. */
2139 tree end
, sentry
, begin
;
2141 begin
= get_target_expr (boolean_true_node
);
2142 CLEANUP_EH_ONLY (begin
) = 1;
2144 sentry
= TARGET_EXPR_SLOT (begin
);
2146 TARGET_EXPR_CLEANUP (begin
)
2147 = build3 (COND_EXPR
, void_type_node
, sentry
,
2148 cleanup
, void_zero_node
);
2150 end
= build2 (MODIFY_EXPR
, TREE_TYPE (sentry
),
2151 sentry
, boolean_false_node
);
2154 = build2 (COMPOUND_EXPR
, void_type_node
, begin
,
2155 build2 (COMPOUND_EXPR
, void_type_node
, init_expr
,
2162 init_expr
= NULL_TREE
;
2164 /* Now build up the return value in reverse order. */
2169 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
2171 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
2173 if (rval
== alloc_node
)
2174 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2175 and return the call (which doesn't need to be adjusted). */
2176 rval
= TARGET_EXPR_INITIAL (alloc_expr
);
2181 tree ifexp
= cp_build_binary_op (NE_EXPR
, alloc_node
,
2183 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
);
2186 /* Perform the allocation before anything else, so that ALLOC_NODE
2187 has been initialized before we start using it. */
2188 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2191 if (init_preeval_expr
)
2192 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), init_preeval_expr
, rval
);
2194 /* Convert to the final type. */
2195 rval
= build_nop (pointer_type
, rval
);
2197 /* A new-expression is never an lvalue. */
2198 if (real_lvalue_p (rval
))
2199 rval
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (rval
), rval
);
2205 build_vec_delete_1 (tree base
, tree maxindex
, tree type
,
2206 special_function_kind auto_delete_vec
, int use_global_delete
)
2209 tree ptype
= build_pointer_type (type
= complete_type (type
));
2210 tree size_exp
= size_in_bytes (type
);
2212 /* Temporary variables used by the loop. */
2213 tree tbase
, tbase_init
;
2215 /* This is the body of the loop that implements the deletion of a
2216 single element, and moves temp variables to next elements. */
2219 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2222 /* This is the thing that governs what to do after the loop has run. */
2223 tree deallocate_expr
= 0;
2225 /* This is the BIND_EXPR which holds the outermost iterator of the
2226 loop. It is convenient to set this variable up and test it before
2227 executing any other code in the loop.
2228 This is also the containing expression returned by this function. */
2229 tree controller
= NULL_TREE
;
2231 /* We should only have 1-D arrays here. */
2232 gcc_assert (TREE_CODE (type
) != ARRAY_TYPE
);
2234 if (! IS_AGGR_TYPE (type
) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2237 /* The below is short by the cookie size. */
2238 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2239 convert (sizetype
, maxindex
));
2241 tbase
= create_temporary_var (ptype
);
2242 tbase_init
= build_modify_expr (tbase
, NOP_EXPR
,
2243 fold (build2 (PLUS_EXPR
, ptype
,
2246 DECL_REGISTER (tbase
) = 1;
2247 controller
= build3 (BIND_EXPR
, void_type_node
, tbase
,
2248 NULL_TREE
, NULL_TREE
);
2249 TREE_SIDE_EFFECTS (controller
) = 1;
2251 body
= build1 (EXIT_EXPR
, void_type_node
,
2252 build2 (EQ_EXPR
, boolean_type_node
, base
, tbase
));
2253 body
= build_compound_expr
2254 (body
, build_modify_expr (tbase
, NOP_EXPR
,
2255 build2 (MINUS_EXPR
, ptype
, tbase
, size_exp
)));
2256 body
= build_compound_expr
2257 (body
, build_delete (ptype
, tbase
, sfk_complete_destructor
,
2258 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1));
2260 loop
= build1 (LOOP_EXPR
, void_type_node
, body
);
2261 loop
= build_compound_expr (tbase_init
, loop
);
2264 /* If the delete flag is one, or anything else with the low bit set,
2265 delete the storage. */
2266 if (auto_delete_vec
!= sfk_base_destructor
)
2270 /* The below is short by the cookie size. */
2271 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2272 convert (sizetype
, maxindex
));
2274 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2281 cookie_size
= targetm
.cxx
.get_cookie_size (type
);
2283 = cp_convert (ptype
,
2284 cp_build_binary_op (MINUS_EXPR
,
2285 cp_convert (string_type_node
,
2288 /* True size with header. */
2289 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
2292 if (auto_delete_vec
== sfk_deleting_destructor
)
2293 deallocate_expr
= build_x_delete (base_tbd
,
2294 2 | use_global_delete
,
2299 if (!deallocate_expr
)
2302 body
= deallocate_expr
;
2304 body
= build_compound_expr (body
, deallocate_expr
);
2307 body
= integer_zero_node
;
2309 /* Outermost wrapper: If pointer is null, punt. */
2310 body
= fold (build3 (COND_EXPR
, void_type_node
,
2311 fold (build2 (NE_EXPR
, boolean_type_node
, base
,
2312 convert (TREE_TYPE (base
),
2313 integer_zero_node
))),
2314 body
, integer_zero_node
));
2315 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2319 TREE_OPERAND (controller
, 1) = body
;
2323 if (TREE_CODE (base
) == SAVE_EXPR
)
2324 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2325 body
= build2 (COMPOUND_EXPR
, void_type_node
, base
, body
);
2327 return convert_to_void (body
, /*implicit=*/NULL
);
2330 /* Create an unnamed variable of the indicated TYPE. */
2333 create_temporary_var (tree type
)
2337 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2338 TREE_USED (decl
) = 1;
2339 DECL_ARTIFICIAL (decl
) = 1;
2340 DECL_SOURCE_LOCATION (decl
) = input_location
;
2341 DECL_IGNORED_P (decl
) = 1;
2342 DECL_CONTEXT (decl
) = current_function_decl
;
2347 /* Create a new temporary variable of the indicated TYPE, initialized
2350 It is not entered into current_binding_level, because that breaks
2351 things when it comes time to do final cleanups (which take place
2352 "outside" the binding contour of the function). */
2355 get_temp_regvar (tree type
, tree init
)
2359 decl
= create_temporary_var (type
);
2360 add_decl_expr (decl
);
2362 finish_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
2367 /* `build_vec_init' returns tree structure that performs
2368 initialization of a vector of aggregate types.
2370 BASE is a reference to the vector, of ARRAY_TYPE.
2371 MAXINDEX is the maximum index of the array (one less than the
2372 number of elements). It is only used if
2373 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2374 INIT is the (possibly NULL) initializer.
2376 FROM_ARRAY is 0 if we should init everything with INIT
2377 (i.e., every element initialized from INIT).
2378 FROM_ARRAY is 1 if we should index into INIT in parallel
2379 with initialization of DECL.
2380 FROM_ARRAY is 2 if we should index into INIT in parallel,
2381 but use assignment instead of initialization. */
2384 build_vec_init (tree base
, tree maxindex
, tree init
, int from_array
)
2387 tree base2
= NULL_TREE
;
2389 tree itype
= NULL_TREE
;
2391 /* The type of the array. */
2392 tree atype
= TREE_TYPE (base
);
2393 /* The type of an element in the array. */
2394 tree type
= TREE_TYPE (atype
);
2395 /* The type of a pointer to an element in the array. */
2400 tree try_block
= NULL_TREE
;
2401 int num_initialized_elts
= 0;
2404 if (TYPE_DOMAIN (atype
))
2405 maxindex
= array_type_nelts (atype
);
2407 if (maxindex
== NULL_TREE
|| maxindex
== error_mark_node
)
2408 return error_mark_node
;
2412 ? (!CLASS_TYPE_P (type
) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
2413 : !TYPE_NEEDS_CONSTRUCTING (type
))
2414 && ((TREE_CODE (init
) == CONSTRUCTOR
2415 /* Don't do this if the CONSTRUCTOR might contain something
2416 that might throw and require us to clean up. */
2417 && (CONSTRUCTOR_ELTS (init
) == NULL_TREE
2418 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type
))))
2421 /* Do non-default initialization of POD arrays resulting from
2422 brace-enclosed initializers. In this case, digest_init and
2423 store_constructor will handle the semantics for us. */
2425 stmt_expr
= build2 (INIT_EXPR
, atype
, base
, init
);
2429 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2430 ptype
= build_pointer_type (type
);
2431 size
= size_in_bytes (type
);
2432 if (TREE_CODE (TREE_TYPE (base
)) == ARRAY_TYPE
)
2433 base
= cp_convert (ptype
, decay_conversion (base
));
2435 /* The code we are generating looks like:
2439 ptrdiff_t iterator = maxindex;
2441 for (; iterator != -1; --iterator) {
2442 ... initialize *t1 ...
2446 ... destroy elements that were constructed ...
2451 We can omit the try and catch blocks if we know that the
2452 initialization will never throw an exception, or if the array
2453 elements do not have destructors. We can omit the loop completely if
2454 the elements of the array do not have constructors.
2456 We actually wrap the entire body of the above in a STMT_EXPR, for
2459 When copying from array to another, when the array elements have
2460 only trivial copy constructors, we should use __builtin_memcpy
2461 rather than generating a loop. That way, we could take advantage
2462 of whatever cleverness the back-end has for dealing with copies
2463 of blocks of memory. */
2465 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
2466 destroy_temps
= stmts_are_full_exprs_p ();
2467 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2468 rval
= get_temp_regvar (ptype
, base
);
2469 base
= get_temp_regvar (ptype
, rval
);
2470 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2472 /* Protect the entire array initialization so that we can destroy
2473 the partially constructed array if an exception is thrown.
2474 But don't do this if we're assigning. */
2475 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2478 try_block
= begin_try_block ();
2481 if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
2483 /* Do non-default initialization of non-POD arrays resulting from
2484 brace-enclosed initializers. */
2489 for (elts
= CONSTRUCTOR_ELTS (init
); elts
; elts
= TREE_CHAIN (elts
))
2491 tree elt
= TREE_VALUE (elts
);
2492 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2494 num_initialized_elts
++;
2496 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
2497 if (IS_AGGR_TYPE (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
2498 finish_expr_stmt (build_aggr_init (baseref
, elt
, 0));
2500 finish_expr_stmt (build_modify_expr (baseref
, NOP_EXPR
,
2502 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2504 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2505 finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR
, iterator
, 0));
2508 /* Clear out INIT so that we don't get confused below. */
2511 else if (from_array
)
2513 /* If initializing one array from another, initialize element by
2514 element. We rely upon the below calls the do argument
2518 base2
= decay_conversion (init
);
2519 itype
= TREE_TYPE (base2
);
2520 base2
= get_temp_regvar (itype
, base2
);
2521 itype
= TREE_TYPE (itype
);
2523 else if (TYPE_LANG_SPECIFIC (type
)
2524 && TYPE_NEEDS_CONSTRUCTING (type
)
2525 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2527 error ("initializer ends prematurely");
2528 return error_mark_node
;
2532 /* Now, default-initialize any remaining elements. We don't need to
2533 do that if a) the type does not need constructing, or b) we've
2534 already initialized all the elements.
2536 We do need to keep going if we're copying an array. */
2539 || (TYPE_NEEDS_CONSTRUCTING (type
)
2540 && ! (host_integerp (maxindex
, 0)
2541 && (num_initialized_elts
2542 == tree_low_cst (maxindex
, 0) + 1))))
2544 /* If the ITERATOR is equal to -1, then we don't have to loop;
2545 we've already initialized all the elements. */
2549 for_stmt
= begin_for_stmt ();
2550 finish_for_init_stmt (for_stmt
);
2551 finish_for_cond (build2 (NE_EXPR
, boolean_type_node
,
2552 iterator
, integer_minus_one_node
),
2554 finish_for_expr (build_unary_op (PREDECREMENT_EXPR
, iterator
, 0),
2559 tree to
= build1 (INDIRECT_REF
, type
, base
);
2563 from
= build1 (INDIRECT_REF
, itype
, base2
);
2567 if (from_array
== 2)
2568 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
2569 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2570 elt_init
= build_aggr_init (to
, from
, 0);
2572 elt_init
= build_modify_expr (to
, NOP_EXPR
, from
);
2576 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2580 ("cannot initialize multi-dimensional array with initializer");
2581 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
2585 elt_init
= build_aggr_init (build1 (INDIRECT_REF
, type
, base
),
2588 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
2589 finish_expr_stmt (elt_init
);
2590 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2592 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base
, 0));
2594 finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR
, base2
, 0));
2596 finish_for_stmt (for_stmt
);
2599 /* Make sure to cleanup any partially constructed elements. */
2600 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2604 tree m
= cp_build_binary_op (MINUS_EXPR
, maxindex
, iterator
);
2606 /* Flatten multi-dimensional array since build_vec_delete only
2607 expects one-dimensional array. */
2608 if (TREE_CODE (type
) == ARRAY_TYPE
)
2610 m
= cp_build_binary_op (MULT_EXPR
, m
,
2611 array_type_nelts_total (type
));
2612 type
= strip_array_types (type
);
2615 finish_cleanup_try_block (try_block
);
2616 e
= build_vec_delete_1 (rval
, m
, type
, sfk_base_destructor
,
2617 /*use_global_delete=*/0);
2618 finish_cleanup (e
, try_block
);
2621 /* The value of the array initialization is the array itself, RVAL
2622 is a pointer to the first element. */
2623 finish_stmt_expr_expr (rval
, stmt_expr
);
2625 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
2627 /* Now convert make the result have the correct type. */
2628 atype
= build_pointer_type (atype
);
2629 stmt_expr
= build1 (NOP_EXPR
, atype
, stmt_expr
);
2630 stmt_expr
= build_indirect_ref (stmt_expr
, NULL
);
2632 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
2636 /* Free up storage of type TYPE, at address ADDR.
2638 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2641 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2642 used as the second argument to operator delete. It can include
2643 things like padding and magic size cookies. It has virtual in it,
2644 because if you have a base pointer and you delete through a virtual
2645 destructor, it should be the size of the dynamic object, not the
2646 static object, see Free Store 12.5 ISO C++.
2648 This does not call any destructors. */
2651 build_x_delete (tree addr
, int which_delete
, tree virtual_size
)
2653 int use_global_delete
= which_delete
& 1;
2654 int use_vec_delete
= !!(which_delete
& 2);
2655 enum tree_code code
= use_vec_delete
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2657 return build_op_delete_call (code
, addr
, virtual_size
, use_global_delete
,
2661 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2665 build_dtor_call (tree exp
, special_function_kind dtor_kind
, int flags
)
2671 case sfk_complete_destructor
:
2672 name
= complete_dtor_identifier
;
2675 case sfk_base_destructor
:
2676 name
= base_dtor_identifier
;
2679 case sfk_deleting_destructor
:
2680 name
= deleting_dtor_identifier
;
2686 fn
= lookup_fnfields (TREE_TYPE (exp
), name
, /*protect=*/2);
2687 return build_new_method_call (exp
, fn
,
2689 /*conversion_path=*/NULL_TREE
,
2693 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2694 ADDR is an expression which yields the store to be destroyed.
2695 AUTO_DELETE is the name of the destructor to call, i.e., either
2696 sfk_complete_destructor, sfk_base_destructor, or
2697 sfk_deleting_destructor.
2699 FLAGS is the logical disjunction of zero or more LOOKUP_
2700 flags. See cp-tree.h for more info. */
2703 build_delete (tree type
, tree addr
, special_function_kind auto_delete
,
2704 int flags
, int use_global_delete
)
2708 if (addr
== error_mark_node
)
2709 return error_mark_node
;
2711 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2712 set to `error_mark_node' before it gets properly cleaned up. */
2713 if (type
== error_mark_node
)
2714 return error_mark_node
;
2716 type
= TYPE_MAIN_VARIANT (type
);
2718 if (TREE_CODE (type
) == POINTER_TYPE
)
2720 bool complete_p
= true;
2722 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
2723 if (TREE_CODE (type
) == ARRAY_TYPE
)
2726 /* We don't want to warn about delete of void*, only other
2727 incomplete types. Deleting other incomplete types
2728 invokes undefined behavior, but it is not ill-formed, so
2729 compile to something that would even do The Right Thing
2730 (TM) should the type have a trivial dtor and no delete
2732 if (!VOID_TYPE_P (type
))
2734 complete_type (type
);
2735 if (!COMPLETE_TYPE_P (type
))
2737 warning ("possible problem detected in invocation of "
2738 "delete operator:");
2739 cxx_incomplete_type_diagnostic (addr
, type
, 1);
2740 inform ("neither the destructor nor the class-specific "
2741 "operator delete will be called, even if they are "
2742 "declared when the class is defined.");
2746 if (VOID_TYPE_P (type
) || !complete_p
|| !IS_AGGR_TYPE (type
))
2747 /* Call the builtin operator delete. */
2748 return build_builtin_delete_call (addr
);
2749 if (TREE_SIDE_EFFECTS (addr
))
2750 addr
= save_expr (addr
);
2752 /* Throw away const and volatile on target type of addr. */
2753 addr
= convert_force (build_pointer_type (type
), addr
, 0);
2755 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2759 if (TYPE_DOMAIN (type
) == NULL_TREE
)
2761 error ("unknown array size in delete");
2762 return error_mark_node
;
2764 return build_vec_delete (addr
, array_type_nelts (type
),
2765 auto_delete
, use_global_delete
);
2769 /* Don't check PROTECT here; leave that decision to the
2770 destructor. If the destructor is accessible, call it,
2771 else report error. */
2772 addr
= build_unary_op (ADDR_EXPR
, addr
, 0);
2773 if (TREE_SIDE_EFFECTS (addr
))
2774 addr
= save_expr (addr
);
2776 addr
= convert_force (build_pointer_type (type
), addr
, 0);
2779 gcc_assert (IS_AGGR_TYPE (type
));
2781 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2783 if (auto_delete
!= sfk_deleting_destructor
)
2784 return void_zero_node
;
2786 return build_op_delete_call
2787 (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
), use_global_delete
,
2792 tree do_delete
= NULL_TREE
;
2795 gcc_assert (TYPE_HAS_DESTRUCTOR (type
));
2797 /* For `::delete x', we must not use the deleting destructor
2798 since then we would not be sure to get the global `operator
2800 if (use_global_delete
&& auto_delete
== sfk_deleting_destructor
)
2802 /* We will use ADDR multiple times so we must save it. */
2803 addr
= save_expr (addr
);
2804 /* Delete the object. */
2805 do_delete
= build_builtin_delete_call (addr
);
2806 /* Otherwise, treat this like a complete object destructor
2808 auto_delete
= sfk_complete_destructor
;
2810 /* If the destructor is non-virtual, there is no deleting
2811 variant. Instead, we must explicitly call the appropriate
2812 `operator delete' here. */
2813 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type
))
2814 && auto_delete
== sfk_deleting_destructor
)
2816 /* We will use ADDR multiple times so we must save it. */
2817 addr
= save_expr (addr
);
2818 /* Build the call. */
2819 do_delete
= build_op_delete_call (DELETE_EXPR
,
2821 cxx_sizeof_nowarn (type
),
2824 /* Call the complete object destructor. */
2825 auto_delete
= sfk_complete_destructor
;
2827 else if (auto_delete
== sfk_deleting_destructor
2828 && TYPE_GETS_REG_DELETE (type
))
2830 /* Make sure we have access to the member op delete, even though
2831 we'll actually be calling it from the destructor. */
2832 build_op_delete_call (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
),
2833 /*global_p=*/false, NULL_TREE
);
2836 expr
= build_dtor_call (build_indirect_ref (addr
, NULL
),
2837 auto_delete
, flags
);
2839 expr
= build2 (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
2841 if (flags
& LOOKUP_DESTRUCTOR
)
2842 /* Explicit destructor call; don't check for null pointer. */
2843 ifexp
= integer_one_node
;
2845 /* Handle deleting a null pointer. */
2846 ifexp
= fold (cp_build_binary_op (NE_EXPR
, addr
, integer_zero_node
));
2848 if (ifexp
!= integer_one_node
)
2849 expr
= build3 (COND_EXPR
, void_type_node
,
2850 ifexp
, expr
, void_zero_node
);
2856 /* At the beginning of a destructor, push cleanups that will call the
2857 destructors for our base classes and members.
2859 Called from begin_destructor_body. */
2862 push_base_cleanups (void)
2864 tree binfo
, base_binfo
;
2870 /* Run destructors for all virtual baseclasses. */
2871 if (CLASSTYPE_VBASECLASSES (current_class_type
))
2873 tree cond
= (condition_conversion
2874 (build2 (BIT_AND_EXPR
, integer_type_node
,
2875 current_in_charge_parm
,
2876 integer_two_node
)));
2878 /* The CLASSTYPE_VBASECLASSES vector is in initialization
2879 order, which is also the right order for pushing cleanups. */
2880 for (vbases
= CLASSTYPE_VBASECLASSES (current_class_type
), i
= 0;
2881 VEC_iterate (tree
, vbases
, i
, base_binfo
); i
++)
2883 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
2885 expr
= build_special_member_call (current_class_ref
,
2886 base_dtor_identifier
,
2890 | LOOKUP_NONVIRTUAL
));
2891 expr
= build3 (COND_EXPR
, void_type_node
, cond
,
2892 expr
, void_zero_node
);
2893 finish_decl_cleanup (NULL_TREE
, expr
);
2898 /* Take care of the remaining baseclasses. */
2899 for (binfo
= TYPE_BINFO (current_class_type
), i
= 0;
2900 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
2902 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
))
2903 || BINFO_VIRTUAL_P (base_binfo
))
2906 expr
= build_special_member_call (current_class_ref
,
2907 base_dtor_identifier
,
2908 NULL_TREE
, base_binfo
,
2909 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
);
2910 finish_decl_cleanup (NULL_TREE
, expr
);
2913 for (member
= TYPE_FIELDS (current_class_type
); member
;
2914 member
= TREE_CHAIN (member
))
2916 if (TREE_CODE (member
) != FIELD_DECL
|| DECL_ARTIFICIAL (member
))
2918 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member
)))
2920 tree this_member
= (build_class_member_access_expr
2921 (current_class_ref
, member
,
2922 /*access_path=*/NULL_TREE
,
2923 /*preserve_reference=*/false));
2924 tree this_type
= TREE_TYPE (member
);
2925 expr
= build_delete (this_type
, this_member
,
2926 sfk_complete_destructor
,
2927 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
2929 finish_decl_cleanup (NULL_TREE
, expr
);
2934 /* For type TYPE, delete the virtual baseclass objects of DECL. */
2937 build_vbase_delete (tree type
, tree decl
)
2943 tree addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
2945 gcc_assert (addr
!= error_mark_node
);
2947 result
= convert_to_void (integer_zero_node
, NULL
);
2948 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
2949 VEC_iterate (tree
, vbases
, ix
, binfo
); ix
++)
2951 tree base_addr
= convert_force
2952 (build_pointer_type (BINFO_TYPE (binfo
)), addr
, 0);
2953 tree base_delete
= build_delete
2954 (TREE_TYPE (base_addr
), base_addr
, sfk_base_destructor
,
2955 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0);
2957 result
= build_compound_expr (result
, base_delete
);
2962 /* Build a C++ vector delete expression.
2963 MAXINDEX is the number of elements to be deleted.
2964 ELT_SIZE is the nominal size of each element in the vector.
2965 BASE is the expression that should yield the store to be deleted.
2966 This function expands (or synthesizes) these calls itself.
2967 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
2969 This also calls delete for virtual baseclasses of elements of the vector.
2971 Update: MAXINDEX is no longer needed. The size can be extracted from the
2972 start of the vector for pointers, and from the type for arrays. We still
2973 use MAXINDEX for arrays because it happens to already have one of the
2974 values we'd have to extract. (We could use MAXINDEX with pointers to
2975 confirm the size, and trap if the numbers differ; not clear that it'd
2976 be worth bothering.) */
2979 build_vec_delete (tree base
, tree maxindex
,
2980 special_function_kind auto_delete_vec
, int use_global_delete
)
2984 tree base_init
= NULL_TREE
;
2986 type
= TREE_TYPE (base
);
2988 if (TREE_CODE (type
) == POINTER_TYPE
)
2990 /* Step back one from start of vector, and read dimension. */
2993 if (TREE_SIDE_EFFECTS (base
))
2995 base_init
= get_target_expr (base
);
2996 base
= TARGET_EXPR_SLOT (base_init
);
2998 type
= strip_array_types (TREE_TYPE (type
));
2999 cookie_addr
= build2 (MINUS_EXPR
,
3000 build_pointer_type (sizetype
),
3002 TYPE_SIZE_UNIT (sizetype
));
3003 maxindex
= build_indirect_ref (cookie_addr
, NULL
);
3005 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3007 /* Get the total number of things in the array, maxindex is a
3009 maxindex
= array_type_nelts_total (type
);
3010 type
= strip_array_types (type
);
3011 base
= build_unary_op (ADDR_EXPR
, base
, 1);
3012 if (TREE_SIDE_EFFECTS (base
))
3014 base_init
= get_target_expr (base
);
3015 base
= TARGET_EXPR_SLOT (base_init
);
3020 if (base
!= error_mark_node
)
3021 error ("type to vector delete is neither pointer or array type");
3022 return error_mark_node
;
3025 rval
= build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
,
3028 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), base_init
, rval
);