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, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
36 static bool begin_init_stmts (tree
*, tree
*);
37 static tree
finish_init_stmts (bool, tree
, tree
);
38 static void construct_virtual_base (tree
, tree
);
39 static void expand_aggr_init_1 (tree
, tree
, tree
, tree
, int, tsubst_flags_t
);
40 static void expand_default_init (tree
, tree
, tree
, tree
, int, tsubst_flags_t
);
41 static tree
build_vec_delete_1 (tree
, tree
, tree
, special_function_kind
, int);
42 static void perform_member_init (tree
, tree
);
43 static tree
build_builtin_delete_call (tree
);
44 static int member_init_ok_or_else (tree
, tree
, tree
);
45 static void expand_virtual_init (tree
, tree
);
46 static tree
sort_mem_initializers (tree
, tree
);
47 static tree
initializing_context (tree
);
48 static void expand_cleanup_for_base (tree
, tree
);
49 static tree
get_temp_regvar (tree
, tree
);
50 static tree
dfs_initialize_vtbl_ptrs (tree
, void *);
51 static tree
build_dtor_call (tree
, special_function_kind
, int);
52 static tree
build_field_list (tree
, tree
, int *);
53 static tree
build_vtbl_address (tree
);
54 static int diagnose_uninitialized_cst_or_ref_member_1 (tree
, tree
, bool, bool);
56 /* We are about to generate some complex initialization code.
57 Conceptually, it is all a single expression. However, we may want
58 to include conditionals, loops, and other such statement-level
59 constructs. Therefore, we build the initialization code inside a
60 statement-expression. This function starts such an expression.
61 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
62 pass them back to finish_init_stmts when the expression is
66 begin_init_stmts (tree
*stmt_expr_p
, tree
*compound_stmt_p
)
68 bool is_global
= !building_stmt_tree ();
70 *stmt_expr_p
= begin_stmt_expr ();
71 *compound_stmt_p
= begin_compound_stmt (BCS_NO_SCOPE
);
76 /* Finish out the statement-expression begun by the previous call to
77 begin_init_stmts. Returns the statement-expression itself. */
80 finish_init_stmts (bool is_global
, tree stmt_expr
, tree compound_stmt
)
82 finish_compound_stmt (compound_stmt
);
84 stmt_expr
= finish_stmt_expr (stmt_expr
, true);
86 gcc_assert (!building_stmt_tree () == is_global
);
93 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
94 which we want to initialize the vtable pointer for, DATA is
95 TREE_LIST whose TREE_VALUE is the this ptr expression. */
98 dfs_initialize_vtbl_ptrs (tree binfo
, void *data
)
100 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
101 return dfs_skip_bases
;
103 if (!BINFO_PRIMARY_P (binfo
) || BINFO_VIRTUAL_P (binfo
))
105 tree base_ptr
= TREE_VALUE ((tree
) data
);
107 base_ptr
= build_base_path (PLUS_EXPR
, base_ptr
, binfo
, /*nonnull=*/1);
109 expand_virtual_init (binfo
, base_ptr
);
115 /* Initialize all the vtable pointers in the object pointed to by
119 initialize_vtbl_ptrs (tree addr
)
124 type
= TREE_TYPE (TREE_TYPE (addr
));
125 list
= build_tree_list (type
, addr
);
127 /* Walk through the hierarchy, initializing the vptr in each base
128 class. We do these in pre-order because we can't find the virtual
129 bases for a class until we've initialized the vtbl for that
131 dfs_walk_once (TYPE_BINFO (type
), dfs_initialize_vtbl_ptrs
, NULL
, list
);
134 /* Return an expression for the zero-initialization of an object with
135 type T. This expression will either be a constant (in the case
136 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
137 aggregate), or NULL (in the case that T does not require
138 initialization). In either case, the value can be used as
139 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
140 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
141 is the number of elements in the array. If STATIC_STORAGE_P is
142 TRUE, initializers are only generated for entities for which
143 zero-initialization does not simply mean filling the storage with
147 build_zero_init (tree type
, tree nelts
, bool static_storage_p
)
149 tree init
= NULL_TREE
;
153 To zero-initialize an object of type T means:
155 -- if T is a scalar type, the storage is set to the value of zero
158 -- if T is a non-union class type, the storage for each nonstatic
159 data member and each base-class subobject is zero-initialized.
161 -- if T is a union type, the storage for its first data member is
164 -- if T is an array type, the storage for each element is
167 -- if T is a reference type, no initialization is performed. */
169 gcc_assert (nelts
== NULL_TREE
|| TREE_CODE (nelts
) == INTEGER_CST
);
171 if (type
== error_mark_node
)
173 else if (static_storage_p
&& zero_init_p (type
))
174 /* In order to save space, we do not explicitly build initializers
175 for items that do not need them. GCC's semantics are that
176 items with static storage duration that are not otherwise
177 initialized are initialized to zero. */
179 else if (SCALAR_TYPE_P (type
))
180 init
= convert (type
, integer_zero_node
);
181 else if (CLASS_TYPE_P (type
))
184 VEC(constructor_elt
,gc
) *v
= NULL
;
186 /* Iterate over the fields, building initializations. */
187 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
189 if (TREE_CODE (field
) != FIELD_DECL
)
192 /* Note that for class types there will be FIELD_DECLs
193 corresponding to base classes as well. Thus, iterating
194 over TYPE_FIELDs will result in correct initialization of
195 all of the subobjects. */
196 if (!static_storage_p
|| !zero_init_p (TREE_TYPE (field
)))
198 tree value
= build_zero_init (TREE_TYPE (field
),
202 CONSTRUCTOR_APPEND_ELT(v
, field
, value
);
205 /* For unions, only the first field is initialized. */
206 if (TREE_CODE (type
) == UNION_TYPE
)
210 /* Build a constructor to contain the initializations. */
211 init
= build_constructor (type
, v
);
213 else if (TREE_CODE (type
) == ARRAY_TYPE
)
216 VEC(constructor_elt
,gc
) *v
= NULL
;
218 /* Iterate over the array elements, building initializations. */
220 max_index
= fold_build2_loc (input_location
,
221 MINUS_EXPR
, TREE_TYPE (nelts
),
222 nelts
, integer_one_node
);
224 max_index
= array_type_nelts (type
);
226 /* If we have an error_mark here, we should just return error mark
227 as we don't know the size of the array yet. */
228 if (max_index
== error_mark_node
)
229 return error_mark_node
;
230 gcc_assert (TREE_CODE (max_index
) == INTEGER_CST
);
232 /* A zero-sized array, which is accepted as an extension, will
233 have an upper bound of -1. */
234 if (!tree_int_cst_equal (max_index
, integer_minus_one_node
))
238 v
= VEC_alloc (constructor_elt
, gc
, 1);
239 ce
= VEC_quick_push (constructor_elt
, v
, NULL
);
241 /* If this is a one element array, we just use a regular init. */
242 if (tree_int_cst_equal (size_zero_node
, max_index
))
243 ce
->index
= size_zero_node
;
245 ce
->index
= build2 (RANGE_EXPR
, sizetype
, size_zero_node
,
248 ce
->value
= build_zero_init (TREE_TYPE (type
),
253 /* Build a constructor to contain the initializations. */
254 init
= build_constructor (type
, v
);
256 else if (TREE_CODE (type
) == VECTOR_TYPE
)
257 init
= fold_convert (type
, integer_zero_node
);
259 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
261 /* In all cases, the initializer is a constant. */
263 TREE_CONSTANT (init
) = 1;
268 /* Return a suitable initializer for value-initializing an object of type
269 TYPE, as described in [dcl.init]. */
272 build_value_init (tree type
)
276 To value-initialize an object of type T means:
278 - if T is a class type (clause 9) with a user-provided constructor
279 (12.1), then the default constructor for T is called (and the
280 initialization is ill-formed if T has no accessible default
283 - if T is a non-union class type without a user-provided constructor,
284 then every non-static data member and base-class component of T is
285 value-initialized;92)
287 - if T is an array type, then each element is value-initialized;
289 - otherwise, the object is zero-initialized.
291 A program that calls for default-initialization or
292 value-initialization of an entity of reference type is ill-formed.
294 92) Value-initialization for such a class object may be implemented by
295 zero-initializing the object and then calling the default
298 if (CLASS_TYPE_P (type
))
300 if (type_has_user_provided_constructor (type
))
301 return build_aggr_init_expr
303 build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
304 NULL
, type
, LOOKUP_NORMAL
,
305 tf_warning_or_error
));
306 else if (TREE_CODE (type
) != UNION_TYPE
&& TYPE_NEEDS_CONSTRUCTING (type
))
308 /* This is a class that needs constructing, but doesn't have
309 a user-provided constructor. So we need to zero-initialize
310 the object and then call the implicitly defined ctor.
311 This will be handled in simplify_aggr_init_expr. */
312 tree ctor
= build_special_member_call
313 (NULL_TREE
, complete_ctor_identifier
,
314 NULL
, type
, LOOKUP_NORMAL
, tf_warning_or_error
);
316 ctor
= build_aggr_init_expr (type
, ctor
);
317 AGGR_INIT_ZERO_FIRST (ctor
) = 1;
321 return build_value_init_noctor (type
);
324 /* Like build_value_init, but don't call the constructor for TYPE. Used
325 for base initializers. */
328 build_value_init_noctor (tree type
)
330 if (CLASS_TYPE_P (type
))
332 gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type
));
334 if (TREE_CODE (type
) != UNION_TYPE
)
337 VEC(constructor_elt
,gc
) *v
= NULL
;
339 /* Iterate over the fields, building initializations. */
340 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
344 if (TREE_CODE (field
) != FIELD_DECL
)
347 ftype
= TREE_TYPE (field
);
349 if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
350 error ("value-initialization of reference");
352 /* We could skip vfields and fields of types with
353 user-defined constructors, but I think that won't improve
354 performance at all; it should be simpler in general just
355 to zero out the entire object than try to only zero the
356 bits that actually need it. */
358 /* Note that for class types there will be FIELD_DECLs
359 corresponding to base classes as well. Thus, iterating
360 over TYPE_FIELDs will result in correct initialization of
361 all of the subobjects. */
362 value
= build_value_init (ftype
);
365 CONSTRUCTOR_APPEND_ELT(v
, field
, value
);
368 /* Build a constructor to contain the zero- initializations. */
369 return build_constructor (type
, v
);
372 else if (TREE_CODE (type
) == ARRAY_TYPE
)
374 VEC(constructor_elt
,gc
) *v
= NULL
;
376 /* Iterate over the array elements, building initializations. */
377 tree max_index
= array_type_nelts (type
);
379 /* If we have an error_mark here, we should just return error mark
380 as we don't know the size of the array yet. */
381 if (max_index
== error_mark_node
)
382 return error_mark_node
;
383 gcc_assert (TREE_CODE (max_index
) == INTEGER_CST
);
385 /* A zero-sized array, which is accepted as an extension, will
386 have an upper bound of -1. */
387 if (!tree_int_cst_equal (max_index
, integer_minus_one_node
))
391 v
= VEC_alloc (constructor_elt
, gc
, 1);
392 ce
= VEC_quick_push (constructor_elt
, v
, NULL
);
394 /* If this is a one element array, we just use a regular init. */
395 if (tree_int_cst_equal (size_zero_node
, max_index
))
396 ce
->index
= size_zero_node
;
398 ce
->index
= build2 (RANGE_EXPR
, sizetype
, size_zero_node
,
401 ce
->value
= build_value_init (TREE_TYPE (type
));
403 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
404 gcc_assert (TREE_CODE (ce
->value
) != TARGET_EXPR
405 && TREE_CODE (ce
->value
) != AGGR_INIT_EXPR
);
408 /* Build a constructor to contain the initializations. */
409 return build_constructor (type
, v
);
412 return build_zero_init (type
, NULL_TREE
, /*static_storage_p=*/false);
415 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
416 arguments. If TREE_LIST is void_type_node, an empty initializer
417 list was given; if NULL_TREE no initializer was given. */
420 perform_member_init (tree member
, tree init
)
423 tree type
= TREE_TYPE (member
);
425 /* Effective C++ rule 12 requires that all data members be
427 if (warn_ecpp
&& init
== NULL_TREE
&& TREE_CODE (type
) != ARRAY_TYPE
)
428 warning_at (DECL_SOURCE_LOCATION (current_function_decl
), OPT_Weffc__
,
429 "%qD should be initialized in the member initialization list",
432 /* Get an lvalue for the data member. */
433 decl
= build_class_member_access_expr (current_class_ref
, member
,
434 /*access_path=*/NULL_TREE
,
435 /*preserve_reference=*/true,
436 tf_warning_or_error
);
437 if (decl
== error_mark_node
)
440 if (init
== void_type_node
)
442 /* mem() means value-initialization. */
443 if (TREE_CODE (type
) == ARRAY_TYPE
)
445 init
= build_vec_init (decl
, NULL_TREE
, NULL_TREE
,
446 /*explicit_value_init_p=*/true,
448 tf_warning_or_error
);
449 finish_expr_stmt (init
);
453 if (TREE_CODE (type
) == REFERENCE_TYPE
)
454 permerror (DECL_SOURCE_LOCATION (current_function_decl
),
455 "value-initialization of %q#D, which has reference type",
459 init
= build2 (INIT_EXPR
, type
, decl
, build_value_init (type
));
460 finish_expr_stmt (init
);
464 /* Deal with this here, as we will get confused if we try to call the
465 assignment op for an anonymous union. This can happen in a
466 synthesized copy constructor. */
467 else if (ANON_AGGR_TYPE_P (type
))
471 init
= build2 (INIT_EXPR
, type
, decl
, TREE_VALUE (init
));
472 finish_expr_stmt (init
);
475 else if (TYPE_NEEDS_CONSTRUCTING (type
))
477 if (init
!= NULL_TREE
478 && TREE_CODE (type
) == ARRAY_TYPE
479 && TREE_CHAIN (init
) == NULL_TREE
480 && TREE_CODE (TREE_TYPE (TREE_VALUE (init
))) == ARRAY_TYPE
)
482 /* Initialization of one array from another. */
483 finish_expr_stmt (build_vec_init (decl
, NULL_TREE
, TREE_VALUE (init
),
484 /*explicit_value_init_p=*/false,
486 tf_warning_or_error
));
490 if (CP_TYPE_CONST_P (type
)
492 && !type_has_user_provided_default_constructor (type
))
493 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
494 vtable; still give this diagnostic. */
495 permerror (DECL_SOURCE_LOCATION (current_function_decl
),
496 "uninitialized member %qD with %<const%> type %qT",
498 finish_expr_stmt (build_aggr_init (decl
, init
, 0,
499 tf_warning_or_error
));
504 if (init
== NULL_TREE
)
507 /* member traversal: note it leaves init NULL */
508 if (TREE_CODE (type
) == REFERENCE_TYPE
)
509 permerror (DECL_SOURCE_LOCATION (current_function_decl
),
510 "uninitialized reference member %qD",
512 else if (CP_TYPE_CONST_P (type
))
513 permerror (DECL_SOURCE_LOCATION (current_function_decl
),
514 "uninitialized member %qD with %<const%> type %qT",
517 core_type
= strip_array_types (type
);
518 if (CLASS_TYPE_P (core_type
)
519 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
)
520 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
)))
521 diagnose_uninitialized_cst_or_ref_member (core_type
,
525 else if (TREE_CODE (init
) == TREE_LIST
)
526 /* There was an explicit member initialization. Do some work
528 init
= build_x_compound_expr_from_list (init
, ELK_MEM_INIT
);
531 finish_expr_stmt (cp_build_modify_expr (decl
, INIT_EXPR
, init
,
532 tf_warning_or_error
));
535 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
539 expr
= build_class_member_access_expr (current_class_ref
, member
,
540 /*access_path=*/NULL_TREE
,
541 /*preserve_reference=*/false,
542 tf_warning_or_error
);
543 expr
= build_delete (type
, expr
, sfk_complete_destructor
,
544 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
546 if (expr
!= error_mark_node
)
547 finish_eh_cleanup (expr
);
551 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
552 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
555 build_field_list (tree t
, tree list
, int *uses_unions_p
)
561 /* Note whether or not T is a union. */
562 if (TREE_CODE (t
) == UNION_TYPE
)
565 for (fields
= TYPE_FIELDS (t
); fields
; fields
= TREE_CHAIN (fields
))
567 /* Skip CONST_DECLs for enumeration constants and so forth. */
568 if (TREE_CODE (fields
) != FIELD_DECL
|| DECL_ARTIFICIAL (fields
))
571 /* Keep track of whether or not any fields are unions. */
572 if (TREE_CODE (TREE_TYPE (fields
)) == UNION_TYPE
)
575 /* For an anonymous struct or union, we must recursively
576 consider the fields of the anonymous type. They can be
577 directly initialized from the constructor. */
578 if (ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
580 /* Add this field itself. Synthesized copy constructors
581 initialize the entire aggregate. */
582 list
= tree_cons (fields
, NULL_TREE
, list
);
583 /* And now add the fields in the anonymous aggregate. */
584 list
= build_field_list (TREE_TYPE (fields
), list
,
587 /* Add this field. */
588 else if (DECL_NAME (fields
))
589 list
= tree_cons (fields
, NULL_TREE
, list
);
595 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
596 a FIELD_DECL or BINFO in T that needs initialization. The
597 TREE_VALUE gives the initializer, or list of initializer arguments.
599 Return a TREE_LIST containing all of the initializations required
600 for T, in the order in which they should be performed. The output
601 list has the same format as the input. */
604 sort_mem_initializers (tree t
, tree mem_inits
)
607 tree base
, binfo
, base_binfo
;
610 VEC(tree
,gc
) *vbases
;
614 /* Build up a list of initializations. The TREE_PURPOSE of entry
615 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
616 TREE_VALUE will be the constructor arguments, or NULL if no
617 explicit initialization was provided. */
618 sorted_inits
= NULL_TREE
;
620 /* Process the virtual bases. */
621 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
622 VEC_iterate (tree
, vbases
, i
, base
); i
++)
623 sorted_inits
= tree_cons (base
, NULL_TREE
, sorted_inits
);
625 /* Process the direct bases. */
626 for (binfo
= TYPE_BINFO (t
), i
= 0;
627 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
628 if (!BINFO_VIRTUAL_P (base_binfo
))
629 sorted_inits
= tree_cons (base_binfo
, NULL_TREE
, sorted_inits
);
631 /* Process the non-static data members. */
632 sorted_inits
= build_field_list (t
, sorted_inits
, &uses_unions_p
);
633 /* Reverse the entire list of initializations, so that they are in
634 the order that they will actually be performed. */
635 sorted_inits
= nreverse (sorted_inits
);
637 /* If the user presented the initializers in an order different from
638 that in which they will actually occur, we issue a warning. Keep
639 track of the next subobject which can be explicitly initialized
640 without issuing a warning. */
641 next_subobject
= sorted_inits
;
643 /* Go through the explicit initializers, filling in TREE_PURPOSE in
645 for (init
= mem_inits
; init
; init
= TREE_CHAIN (init
))
650 subobject
= TREE_PURPOSE (init
);
652 /* If the explicit initializers are in sorted order, then
653 SUBOBJECT will be NEXT_SUBOBJECT, or something following
655 for (subobject_init
= next_subobject
;
657 subobject_init
= TREE_CHAIN (subobject_init
))
658 if (TREE_PURPOSE (subobject_init
) == subobject
)
661 /* Issue a warning if the explicit initializer order does not
662 match that which will actually occur.
663 ??? Are all these on the correct lines? */
664 if (warn_reorder
&& !subobject_init
)
666 if (TREE_CODE (TREE_PURPOSE (next_subobject
)) == FIELD_DECL
)
667 warning (OPT_Wreorder
, "%q+D will be initialized after",
668 TREE_PURPOSE (next_subobject
));
670 warning (OPT_Wreorder
, "base %qT will be initialized after",
671 TREE_PURPOSE (next_subobject
));
672 if (TREE_CODE (subobject
) == FIELD_DECL
)
673 warning (OPT_Wreorder
, " %q+#D", subobject
);
675 warning (OPT_Wreorder
, " base %qT", subobject
);
676 warning_at (DECL_SOURCE_LOCATION (current_function_decl
),
677 OPT_Wreorder
, " when initialized here");
680 /* Look again, from the beginning of the list. */
683 subobject_init
= sorted_inits
;
684 while (TREE_PURPOSE (subobject_init
) != subobject
)
685 subobject_init
= TREE_CHAIN (subobject_init
);
688 /* It is invalid to initialize the same subobject more than
690 if (TREE_VALUE (subobject_init
))
692 if (TREE_CODE (subobject
) == FIELD_DECL
)
693 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
694 "multiple initializations given for %qD",
697 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
698 "multiple initializations given for base %qT",
702 /* Record the initialization. */
703 TREE_VALUE (subobject_init
) = TREE_VALUE (init
);
704 next_subobject
= subobject_init
;
709 If a ctor-initializer specifies more than one mem-initializer for
710 multiple members of the same union (including members of
711 anonymous unions), the ctor-initializer is ill-formed. */
714 tree last_field
= NULL_TREE
;
715 for (init
= sorted_inits
; init
; init
= TREE_CHAIN (init
))
721 /* Skip uninitialized members and base classes. */
722 if (!TREE_VALUE (init
)
723 || TREE_CODE (TREE_PURPOSE (init
)) != FIELD_DECL
)
725 /* See if this field is a member of a union, or a member of a
726 structure contained in a union, etc. */
727 field
= TREE_PURPOSE (init
);
728 for (field_type
= DECL_CONTEXT (field
);
729 !same_type_p (field_type
, t
);
730 field_type
= TYPE_CONTEXT (field_type
))
731 if (TREE_CODE (field_type
) == UNION_TYPE
)
733 /* If this field is not a member of a union, skip it. */
734 if (TREE_CODE (field_type
) != UNION_TYPE
)
737 /* It's only an error if we have two initializers for the same
745 /* See if LAST_FIELD and the field initialized by INIT are
746 members of the same union. If so, there's a problem,
747 unless they're actually members of the same structure
748 which is itself a member of a union. For example, given:
750 union { struct { int i; int j; }; };
752 initializing both `i' and `j' makes sense. */
753 field_type
= DECL_CONTEXT (field
);
757 tree last_field_type
;
759 last_field_type
= DECL_CONTEXT (last_field
);
762 if (same_type_p (last_field_type
, field_type
))
764 if (TREE_CODE (field_type
) == UNION_TYPE
)
765 error_at (DECL_SOURCE_LOCATION (current_function_decl
),
766 "initializations for multiple members of %qT",
772 if (same_type_p (last_field_type
, t
))
775 last_field_type
= TYPE_CONTEXT (last_field_type
);
778 /* If we've reached the outermost class, then we're
780 if (same_type_p (field_type
, t
))
783 field_type
= TYPE_CONTEXT (field_type
);
794 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
795 is a TREE_LIST giving the explicit mem-initializer-list for the
796 constructor. The TREE_PURPOSE of each entry is a subobject (a
797 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
798 is a TREE_LIST giving the arguments to the constructor or
799 void_type_node for an empty list of arguments. */
802 emit_mem_initializers (tree mem_inits
)
804 /* We will already have issued an error message about the fact that
805 the type is incomplete. */
806 if (!COMPLETE_TYPE_P (current_class_type
))
809 /* Sort the mem-initializers into the order in which the
810 initializations should be performed. */
811 mem_inits
= sort_mem_initializers (current_class_type
, mem_inits
);
813 in_base_initializer
= 1;
815 /* Initialize base classes. */
817 && TREE_CODE (TREE_PURPOSE (mem_inits
)) != FIELD_DECL
)
819 tree subobject
= TREE_PURPOSE (mem_inits
);
820 tree arguments
= TREE_VALUE (mem_inits
);
822 /* If these initializations are taking place in a copy constructor,
823 the base class should probably be explicitly initialized if there
824 is a user-defined constructor in the base class (other than the
825 default constructor, which will be called anyway). */
826 if (extra_warnings
&& !arguments
827 && DECL_COPY_CONSTRUCTOR_P (current_function_decl
)
828 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject
)))
829 warning_at (DECL_SOURCE_LOCATION (current_function_decl
), OPT_Wextra
,
830 "base class %q#T should be explicitly initialized in the "
832 BINFO_TYPE (subobject
));
834 /* Initialize the base. */
835 if (BINFO_VIRTUAL_P (subobject
))
836 construct_virtual_base (subobject
, arguments
);
841 base_addr
= build_base_path (PLUS_EXPR
, current_class_ptr
,
843 expand_aggr_init_1 (subobject
, NULL_TREE
,
844 cp_build_indirect_ref (base_addr
, RO_NULL
,
845 tf_warning_or_error
),
848 tf_warning_or_error
);
849 expand_cleanup_for_base (subobject
, NULL_TREE
);
852 mem_inits
= TREE_CHAIN (mem_inits
);
854 in_base_initializer
= 0;
856 /* Initialize the vptrs. */
857 initialize_vtbl_ptrs (current_class_ptr
);
859 /* Initialize the data members. */
862 perform_member_init (TREE_PURPOSE (mem_inits
),
863 TREE_VALUE (mem_inits
));
864 mem_inits
= TREE_CHAIN (mem_inits
);
868 /* Returns the address of the vtable (i.e., the value that should be
869 assigned to the vptr) for BINFO. */
872 build_vtbl_address (tree binfo
)
874 tree binfo_for
= binfo
;
877 if (BINFO_VPTR_INDEX (binfo
) && BINFO_VIRTUAL_P (binfo
))
878 /* If this is a virtual primary base, then the vtable we want to store
879 is that for the base this is being used as the primary base of. We
880 can't simply skip the initialization, because we may be expanding the
881 inits of a subobject constructor where the virtual base layout
883 while (BINFO_PRIMARY_P (binfo_for
))
884 binfo_for
= BINFO_INHERITANCE_CHAIN (binfo_for
);
886 /* Figure out what vtable BINFO's vtable is based on, and mark it as
888 vtbl
= get_vtbl_decl_for_binfo (binfo_for
);
889 TREE_USED (vtbl
) = 1;
891 /* Now compute the address to use when initializing the vptr. */
892 vtbl
= unshare_expr (BINFO_VTABLE (binfo_for
));
893 if (TREE_CODE (vtbl
) == VAR_DECL
)
894 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
899 /* This code sets up the virtual function tables appropriate for
900 the pointer DECL. It is a one-ply initialization.
902 BINFO is the exact type that DECL is supposed to be. In
903 multiple inheritance, this might mean "C's A" if C : A, B. */
906 expand_virtual_init (tree binfo
, tree decl
)
911 /* Compute the initializer for vptr. */
912 vtbl
= build_vtbl_address (binfo
);
914 /* We may get this vptr from a VTT, if this is a subobject
915 constructor or subobject destructor. */
916 vtt_index
= BINFO_VPTR_INDEX (binfo
);
922 /* Compute the value to use, when there's a VTT. */
923 vtt_parm
= current_vtt_parm
;
924 vtbl2
= build2 (POINTER_PLUS_EXPR
,
925 TREE_TYPE (vtt_parm
),
928 vtbl2
= cp_build_indirect_ref (vtbl2
, RO_NULL
, tf_warning_or_error
);
929 vtbl2
= convert (TREE_TYPE (vtbl
), vtbl2
);
931 /* The actual initializer is the VTT value only in the subobject
932 constructor. In maybe_clone_body we'll substitute NULL for
933 the vtt_parm in the case of the non-subobject constructor. */
934 vtbl
= build3 (COND_EXPR
,
936 build2 (EQ_EXPR
, boolean_type_node
,
937 current_in_charge_parm
, integer_zero_node
),
942 /* Compute the location of the vtpr. */
943 vtbl_ptr
= build_vfield_ref (cp_build_indirect_ref (decl
, RO_NULL
,
944 tf_warning_or_error
),
946 gcc_assert (vtbl_ptr
!= error_mark_node
);
948 /* Assign the vtable to the vptr. */
949 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
950 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
,
951 tf_warning_or_error
));
954 /* If an exception is thrown in a constructor, those base classes already
955 constructed must be destroyed. This function creates the cleanup
956 for BINFO, which has just been constructed. If FLAG is non-NULL,
957 it is a DECL which is nonzero when this base needs to be
961 expand_cleanup_for_base (tree binfo
, tree flag
)
965 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo
)))
968 /* Call the destructor. */
969 expr
= build_special_member_call (current_class_ref
,
970 base_dtor_identifier
,
973 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
,
974 tf_warning_or_error
);
976 expr
= fold_build3_loc (input_location
,
977 COND_EXPR
, void_type_node
,
978 c_common_truthvalue_conversion (input_location
, flag
),
979 expr
, integer_zero_node
);
981 finish_eh_cleanup (expr
);
984 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
988 construct_virtual_base (tree vbase
, tree arguments
)
994 /* If there are virtual base classes with destructors, we need to
995 emit cleanups to destroy them if an exception is thrown during
996 the construction process. These exception regions (i.e., the
997 period during which the cleanups must occur) begin from the time
998 the construction is complete to the end of the function. If we
999 create a conditional block in which to initialize the
1000 base-classes, then the cleanup region for the virtual base begins
1001 inside a block, and ends outside of that block. This situation
1002 confuses the sjlj exception-handling code. Therefore, we do not
1003 create a single conditional block, but one for each
1004 initialization. (That way the cleanup regions always begin
1005 in the outer block.) We trust the back end to figure out
1006 that the FLAG will not change across initializations, and
1007 avoid doing multiple tests. */
1008 flag
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
1009 inner_if_stmt
= begin_if_stmt ();
1010 finish_if_stmt_cond (flag
, inner_if_stmt
);
1012 /* Compute the location of the virtual base. If we're
1013 constructing virtual bases, then we must be the most derived
1014 class. Therefore, we don't have to look up the virtual base;
1015 we already know where it is. */
1016 exp
= convert_to_base_statically (current_class_ref
, vbase
);
1018 expand_aggr_init_1 (vbase
, current_class_ref
, exp
, arguments
,
1019 LOOKUP_COMPLAIN
, tf_warning_or_error
);
1020 finish_then_clause (inner_if_stmt
);
1021 finish_if_stmt (inner_if_stmt
);
1023 expand_cleanup_for_base (vbase
, flag
);
1026 /* Find the context in which this FIELD can be initialized. */
1029 initializing_context (tree field
)
1031 tree t
= DECL_CONTEXT (field
);
1033 /* Anonymous union members can be initialized in the first enclosing
1034 non-anonymous union context. */
1035 while (t
&& ANON_AGGR_TYPE_P (t
))
1036 t
= TYPE_CONTEXT (t
);
1040 /* Function to give error message if member initialization specification
1041 is erroneous. FIELD is the member we decided to initialize.
1042 TYPE is the type for which the initialization is being performed.
1043 FIELD must be a member of TYPE.
1045 MEMBER_NAME is the name of the member. */
1048 member_init_ok_or_else (tree field
, tree type
, tree member_name
)
1050 if (field
== error_mark_node
)
1054 error ("class %qT does not have any field named %qD", type
,
1058 if (TREE_CODE (field
) == VAR_DECL
)
1060 error ("%q#D is a static data member; it can only be "
1061 "initialized at its definition",
1065 if (TREE_CODE (field
) != FIELD_DECL
)
1067 error ("%q#D is not a non-static data member of %qT",
1071 if (initializing_context (field
) != type
)
1073 error ("class %qT does not have any field named %qD", type
,
1081 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1082 is a _TYPE node or TYPE_DECL which names a base for that type.
1083 Check the validity of NAME, and return either the base _TYPE, base
1084 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1085 NULL_TREE and issue a diagnostic.
1087 An old style unnamed direct single base construction is permitted,
1088 where NAME is NULL. */
1091 expand_member_init (tree name
)
1096 if (!current_class_ref
)
1101 /* This is an obsolete unnamed base class initializer. The
1102 parser will already have warned about its use. */
1103 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type
)))
1106 error ("unnamed initializer for %qT, which has no base classes",
1107 current_class_type
);
1110 basetype
= BINFO_TYPE
1111 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type
), 0));
1114 error ("unnamed initializer for %qT, which uses multiple inheritance",
1115 current_class_type
);
1119 else if (TYPE_P (name
))
1121 basetype
= TYPE_MAIN_VARIANT (name
);
1122 name
= TYPE_NAME (name
);
1124 else if (TREE_CODE (name
) == TYPE_DECL
)
1125 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (name
));
1127 basetype
= NULL_TREE
;
1136 if (current_template_parms
)
1139 class_binfo
= TYPE_BINFO (current_class_type
);
1140 direct_binfo
= NULL_TREE
;
1141 virtual_binfo
= NULL_TREE
;
1143 /* Look for a direct base. */
1144 for (i
= 0; BINFO_BASE_ITERATE (class_binfo
, i
, direct_binfo
); ++i
)
1145 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo
), basetype
))
1148 /* Look for a virtual base -- unless the direct base is itself
1150 if (!direct_binfo
|| !BINFO_VIRTUAL_P (direct_binfo
))
1151 virtual_binfo
= binfo_for_vbase (basetype
, current_class_type
);
1153 /* [class.base.init]
1155 If a mem-initializer-id is ambiguous because it designates
1156 both a direct non-virtual base class and an inherited virtual
1157 base class, the mem-initializer is ill-formed. */
1158 if (direct_binfo
&& virtual_binfo
)
1160 error ("%qD is both a direct base and an indirect virtual base",
1165 if (!direct_binfo
&& !virtual_binfo
)
1167 if (CLASSTYPE_VBASECLASSES (current_class_type
))
1168 error ("type %qT is not a direct or virtual base of %qT",
1169 basetype
, current_class_type
);
1171 error ("type %qT is not a direct base of %qT",
1172 basetype
, current_class_type
);
1176 return direct_binfo
? direct_binfo
: virtual_binfo
;
1180 if (TREE_CODE (name
) == IDENTIFIER_NODE
)
1181 field
= lookup_field (current_class_type
, name
, 1, false);
1185 if (member_init_ok_or_else (field
, current_class_type
, name
))
1192 /* This is like `expand_member_init', only it stores one aggregate
1195 INIT comes in two flavors: it is either a value which
1196 is to be stored in EXP, or it is a parameter list
1197 to go to a constructor, which will operate on EXP.
1198 If INIT is not a parameter list for a constructor, then set
1199 LOOKUP_ONLYCONVERTING.
1200 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1201 the initializer, if FLAGS is 0, then it is the (init) form.
1202 If `init' is a CONSTRUCTOR, then we emit a warning message,
1203 explaining that such initializations are invalid.
1205 If INIT resolves to a CALL_EXPR which happens to return
1206 something of the type we are looking for, then we know
1207 that we can safely use that call to perform the
1210 The virtual function table pointer cannot be set up here, because
1211 we do not really know its type.
1213 This never calls operator=().
1215 When initializing, nothing is CONST.
1217 A default copy constructor may have to be used to perform the
1220 A constructor or a conversion operator may have to be used to
1221 perform the initialization, but not both, as it would be ambiguous. */
1224 build_aggr_init (tree exp
, tree init
, int flags
, tsubst_flags_t complain
)
1229 tree type
= TREE_TYPE (exp
);
1230 int was_const
= TREE_READONLY (exp
);
1231 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1234 if (init
== error_mark_node
)
1235 return error_mark_node
;
1237 TREE_READONLY (exp
) = 0;
1238 TREE_THIS_VOLATILE (exp
) = 0;
1240 if (init
&& TREE_CODE (init
) != TREE_LIST
1241 && !(BRACE_ENCLOSED_INITIALIZER_P (init
)
1242 && CONSTRUCTOR_IS_DIRECT_INIT (init
)))
1243 flags
|= LOOKUP_ONLYCONVERTING
;
1245 if (TREE_CODE (type
) == ARRAY_TYPE
)
1249 /* An array may not be initialized use the parenthesized
1250 initialization form -- unless the initializer is "()". */
1251 if (init
&& TREE_CODE (init
) == TREE_LIST
)
1253 if (complain
& tf_error
)
1254 error ("bad array initializer");
1255 return error_mark_node
;
1257 /* Must arrange to initialize each element of EXP
1258 from elements of INIT. */
1259 itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1260 if (cv_qualified_p (type
))
1261 TREE_TYPE (exp
) = cv_unqualified (type
);
1262 if (itype
&& cv_qualified_p (itype
))
1263 TREE_TYPE (init
) = cv_unqualified (itype
);
1264 stmt_expr
= build_vec_init (exp
, NULL_TREE
, init
,
1265 /*explicit_value_init_p=*/false,
1266 itype
&& same_type_p (TREE_TYPE (init
),
1269 TREE_READONLY (exp
) = was_const
;
1270 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1271 TREE_TYPE (exp
) = type
;
1273 TREE_TYPE (init
) = itype
;
1277 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1278 /* Just know that we've seen something for this node. */
1279 TREE_USED (exp
) = 1;
1281 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
1282 destroy_temps
= stmts_are_full_exprs_p ();
1283 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
1284 expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
1285 init
, LOOKUP_NORMAL
|flags
, complain
);
1286 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
1287 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
1288 TREE_READONLY (exp
) = was_const
;
1289 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1295 expand_default_init (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
,
1296 tsubst_flags_t complain
)
1298 tree type
= TREE_TYPE (exp
);
1301 /* It fails because there may not be a constructor which takes
1302 its own type as the first (or only parameter), but which does
1303 take other types via a conversion. So, if the thing initializing
1304 the expression is a unit element of type X, first try X(X&),
1305 followed by initialization by X. If neither of these work
1306 out, then look hard. */
1308 VEC(tree
,gc
) *parms
;
1310 if (init
&& BRACE_ENCLOSED_INITIALIZER_P (init
)
1311 && CP_AGGREGATE_TYPE_P (type
))
1313 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1314 happen for direct-initialization, too. */
1315 init
= digest_init (type
, init
);
1316 init
= build2 (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1317 TREE_SIDE_EFFECTS (init
) = 1;
1318 finish_expr_stmt (init
);
1322 if (init
&& TREE_CODE (init
) != TREE_LIST
1323 && (flags
& LOOKUP_ONLYCONVERTING
))
1325 /* Base subobjects should only get direct-initialization. */
1326 gcc_assert (true_exp
== exp
);
1328 if (flags
& DIRECT_BIND
)
1329 /* Do nothing. We hit this in two cases: Reference initialization,
1330 where we aren't initializing a real variable, so we don't want
1331 to run a new constructor; and catching an exception, where we
1332 have already built up the constructor call so we could wrap it
1333 in an exception region. */;
1335 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1337 if (TREE_CODE (init
) == MUST_NOT_THROW_EXPR
)
1338 /* We need to protect the initialization of a catch parm with a
1339 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1340 around the TARGET_EXPR for the copy constructor. See
1341 initialize_handler_parm. */
1343 TREE_OPERAND (init
, 0) = build2 (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1344 TREE_OPERAND (init
, 0));
1345 TREE_TYPE (init
) = void_type_node
;
1348 init
= build2 (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1349 TREE_SIDE_EFFECTS (init
) = 1;
1350 finish_expr_stmt (init
);
1354 if (init
== NULL_TREE
)
1356 else if (TREE_CODE (init
) == TREE_LIST
&& !TREE_TYPE (init
))
1358 parms
= make_tree_vector ();
1359 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
1360 VEC_safe_push (tree
, gc
, parms
, TREE_VALUE (init
));
1363 parms
= make_tree_vector_single (init
);
1365 if (true_exp
== exp
)
1366 ctor_name
= complete_ctor_identifier
;
1368 ctor_name
= base_ctor_identifier
;
1370 rval
= build_special_member_call (exp
, ctor_name
, &parms
, binfo
, flags
,
1374 release_tree_vector (parms
);
1376 if (TREE_SIDE_EFFECTS (rval
))
1377 finish_expr_stmt (convert_to_void (rval
, NULL
, complain
));
1380 /* This function is responsible for initializing EXP with INIT
1383 BINFO is the binfo of the type for who we are performing the
1384 initialization. For example, if W is a virtual base class of A and B,
1386 If we are initializing B, then W must contain B's W vtable, whereas
1387 were we initializing C, W must contain C's W vtable.
1389 TRUE_EXP is nonzero if it is the true expression being initialized.
1390 In this case, it may be EXP, or may just contain EXP. The reason we
1391 need this is because if EXP is a base element of TRUE_EXP, we
1392 don't necessarily know by looking at EXP where its virtual
1393 baseclass fields should really be pointing. But we do know
1394 from TRUE_EXP. In constructors, we don't know anything about
1395 the value being initialized.
1397 FLAGS is just passed to `build_new_method_call'. See that function
1398 for its description. */
1401 expand_aggr_init_1 (tree binfo
, tree true_exp
, tree exp
, tree init
, int flags
,
1402 tsubst_flags_t complain
)
1404 tree type
= TREE_TYPE (exp
);
1406 gcc_assert (init
!= error_mark_node
&& type
!= error_mark_node
);
1407 gcc_assert (building_stmt_tree ());
1409 /* Use a function returning the desired type to initialize EXP for us.
1410 If the function is a constructor, and its first argument is
1411 NULL_TREE, know that it was meant for us--just slide exp on
1412 in and expand the constructor. Constructors now come
1415 if (init
&& TREE_CODE (exp
) == VAR_DECL
1416 && COMPOUND_LITERAL_P (init
))
1418 /* If store_init_value returns NULL_TREE, the INIT has been
1419 recorded as the DECL_INITIAL for EXP. That means there's
1420 nothing more we have to do. */
1421 init
= store_init_value (exp
, init
, flags
);
1423 finish_expr_stmt (init
);
1427 /* If an explicit -- but empty -- initializer list was present,
1428 that's value-initialization. */
1429 if (init
== void_type_node
)
1431 /* If there's a user-provided constructor, we just call that. */
1432 if (type_has_user_provided_constructor (type
))
1433 /* Fall through. */;
1434 /* If there isn't, but we still need to call the constructor,
1435 zero out the object first. */
1436 else if (TYPE_NEEDS_CONSTRUCTING (type
))
1438 init
= build_zero_init (type
, NULL_TREE
, /*static_storage_p=*/false);
1439 init
= build2 (INIT_EXPR
, type
, exp
, init
);
1440 finish_expr_stmt (init
);
1441 /* And then call the constructor. */
1443 /* If we don't need to mess with the constructor at all,
1444 then just zero out the object and we're done. */
1447 init
= build2 (INIT_EXPR
, type
, exp
, build_value_init_noctor (type
));
1448 finish_expr_stmt (init
);
1454 /* We know that expand_default_init can handle everything we want
1456 expand_default_init (binfo
, true_exp
, exp
, init
, flags
, complain
);
1459 /* Report an error if TYPE is not a user-defined, class type. If
1460 OR_ELSE is nonzero, give an error message. */
1463 is_class_type (tree type
, int or_else
)
1465 if (type
== error_mark_node
)
1468 if (! CLASS_TYPE_P (type
))
1471 error ("%qT is not a class type", type
);
1478 get_type_value (tree name
)
1480 if (name
== error_mark_node
)
1483 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1484 return IDENTIFIER_TYPE_VALUE (name
);
1489 /* Build a reference to a member of an aggregate. This is not a C++
1490 `&', but really something which can have its address taken, and
1491 then act as a pointer to member, for example TYPE :: FIELD can have
1492 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1493 this expression is the operand of "&".
1495 @@ Prints out lousy diagnostics for operator <typename>
1498 @@ This function should be rewritten and placed in search.c. */
1501 build_offset_ref (tree type
, tree member
, bool address_p
)
1504 tree basebinfo
= NULL_TREE
;
1506 /* class templates can come in as TEMPLATE_DECLs here. */
1507 if (TREE_CODE (member
) == TEMPLATE_DECL
)
1510 if (dependent_type_p (type
) || type_dependent_expression_p (member
))
1511 return build_qualified_name (NULL_TREE
, type
, member
,
1512 /*template_p=*/false);
1514 gcc_assert (TYPE_P (type
));
1515 if (! is_class_type (type
, 1))
1516 return error_mark_node
;
1518 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
1519 /* Callers should call mark_used before this point. */
1520 gcc_assert (!DECL_P (member
) || TREE_USED (member
));
1522 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type
)))
1524 error ("incomplete type %qT does not have member %qD", type
, member
);
1525 return error_mark_node
;
1528 /* Entities other than non-static members need no further
1530 if (TREE_CODE (member
) == TYPE_DECL
)
1532 if (TREE_CODE (member
) == VAR_DECL
|| TREE_CODE (member
) == CONST_DECL
)
1533 return convert_from_reference (member
);
1535 if (TREE_CODE (member
) == FIELD_DECL
&& DECL_C_BIT_FIELD (member
))
1537 error ("invalid pointer to bit-field %qD", member
);
1538 return error_mark_node
;
1541 /* Set up BASEBINFO for member lookup. */
1542 decl
= maybe_dummy_object (type
, &basebinfo
);
1544 /* A lot of this logic is now handled in lookup_member. */
1545 if (BASELINK_P (member
))
1547 /* Go from the TREE_BASELINK to the member function info. */
1548 tree t
= BASELINK_FUNCTIONS (member
);
1550 if (TREE_CODE (t
) != TEMPLATE_ID_EXPR
&& !really_overloaded_fn (t
))
1552 /* Get rid of a potential OVERLOAD around it. */
1553 t
= OVL_CURRENT (t
);
1555 /* Unique functions are handled easily. */
1557 /* For non-static member of base class, we need a special rule
1558 for access checking [class.protected]:
1560 If the access is to form a pointer to member, the
1561 nested-name-specifier shall name the derived class
1562 (or any class derived from that class). */
1563 if (address_p
&& DECL_P (t
)
1564 && DECL_NONSTATIC_MEMBER_P (t
))
1565 perform_or_defer_access_check (TYPE_BINFO (type
), t
, t
);
1567 perform_or_defer_access_check (basebinfo
, t
, t
);
1569 if (DECL_STATIC_FUNCTION_P (t
))
1574 TREE_TYPE (member
) = unknown_type_node
;
1576 else if (address_p
&& TREE_CODE (member
) == FIELD_DECL
)
1577 /* We need additional test besides the one in
1578 check_accessibility_of_qualified_id in case it is
1579 a pointer to non-static member. */
1580 perform_or_defer_access_check (TYPE_BINFO (type
), member
, member
);
1584 /* If MEMBER is non-static, then the program has fallen afoul of
1587 An id-expression that denotes a nonstatic data member or
1588 nonstatic member function of a class can only be used:
1590 -- as part of a class member access (_expr.ref_) in which the
1591 object-expression refers to the member's class or a class
1592 derived from that class, or
1594 -- to form a pointer to member (_expr.unary.op_), or
1596 -- in the body of a nonstatic member function of that class or
1597 of a class derived from that class (_class.mfct.nonstatic_), or
1599 -- in a mem-initializer for a constructor for that class or for
1600 a class derived from that class (_class.base.init_). */
1601 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member
))
1603 /* Build a representation of the qualified name suitable
1604 for use as the operand to "&" -- even though the "&" is
1605 not actually present. */
1606 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
1607 /* In Microsoft mode, treat a non-static member function as if
1608 it were a pointer-to-member. */
1609 if (flag_ms_extensions
)
1611 PTRMEM_OK_P (member
) = 1;
1612 return cp_build_unary_op (ADDR_EXPR
, member
, 0,
1613 tf_warning_or_error
);
1615 error ("invalid use of non-static member function %qD",
1616 TREE_OPERAND (member
, 1));
1617 return error_mark_node
;
1619 else if (TREE_CODE (member
) == FIELD_DECL
)
1621 error ("invalid use of non-static data member %qD", member
);
1622 return error_mark_node
;
1627 member
= build2 (OFFSET_REF
, TREE_TYPE (member
), decl
, member
);
1628 PTRMEM_OK_P (member
) = 1;
1632 /* If DECL is a scalar enumeration constant or variable with a
1633 constant initializer, return the initializer (or, its initializers,
1634 recursively); otherwise, return DECL. If INTEGRAL_P, the
1635 initializer is only returned if DECL is an integral
1636 constant-expression. */
1639 constant_value_1 (tree decl
, bool integral_p
)
1641 while (TREE_CODE (decl
) == CONST_DECL
1643 ? DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
1644 : (TREE_CODE (decl
) == VAR_DECL
1645 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl
)))))
1648 /* Static data members in template classes may have
1649 non-dependent initializers. References to such non-static
1650 data members are not value-dependent, so we must retrieve the
1651 initializer here. The DECL_INITIAL will have the right type,
1652 but will not have been folded because that would prevent us
1653 from performing all appropriate semantic checks at
1654 instantiation time. */
1655 if (DECL_CLASS_SCOPE_P (decl
)
1656 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
1657 && uses_template_parms (CLASSTYPE_TI_ARGS
1658 (DECL_CONTEXT (decl
))))
1660 ++processing_template_decl
;
1661 init
= fold_non_dependent_expr (DECL_INITIAL (decl
));
1662 --processing_template_decl
;
1666 /* If DECL is a static data member in a template
1667 specialization, we must instantiate it here. The
1668 initializer for the static data member is not processed
1669 until needed; we need it now. */
1671 init
= DECL_INITIAL (decl
);
1673 if (init
== error_mark_node
)
1675 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
))
1676 /* Treat the error as a constant to avoid cascading errors on
1677 excessively recursive template instantiation (c++/9335). */
1682 /* Initializers in templates are generally expanded during
1683 instantiation, so before that for const int i(2)
1684 INIT is a TREE_LIST with the actual initializer as
1686 if (processing_template_decl
1688 && TREE_CODE (init
) == TREE_LIST
1689 && TREE_CHAIN (init
) == NULL_TREE
)
1690 init
= TREE_VALUE (init
);
1692 || !TREE_TYPE (init
)
1694 ? !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (init
))
1695 : (!TREE_CONSTANT (init
)
1696 /* Do not return an aggregate constant (of which
1697 string literals are a special case), as we do not
1698 want to make inadvertent copies of such entities,
1699 and we must be sure that their addresses are the
1701 || TREE_CODE (init
) == CONSTRUCTOR
1702 || TREE_CODE (init
) == STRING_CST
)))
1704 decl
= unshare_expr (init
);
1709 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1710 constant of integral or enumeration type, then return that value.
1711 These are those variables permitted in constant expressions by
1715 integral_constant_value (tree decl
)
1717 return constant_value_1 (decl
, /*integral_p=*/true);
1720 /* A more relaxed version of integral_constant_value, used by the
1721 common C/C++ code and by the C++ front end for optimization
1725 decl_constant_value (tree decl
)
1727 return constant_value_1 (decl
,
1728 /*integral_p=*/processing_template_decl
);
1731 /* Common subroutines of build_new and build_vec_delete. */
1733 /* Call the global __builtin_delete to delete ADDR. */
1736 build_builtin_delete_call (tree addr
)
1738 mark_used (global_delete_fndecl
);
1739 return build_call_n (global_delete_fndecl
, 1, addr
);
1742 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1743 the type of the object being allocated; otherwise, it's just TYPE.
1744 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1745 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1746 a vector of arguments to be provided as arguments to a placement
1747 new operator. This routine performs no semantic checks; it just
1748 creates and returns a NEW_EXPR. */
1751 build_raw_new_expr (VEC(tree
,gc
) *placement
, tree type
, tree nelts
,
1752 VEC(tree
,gc
) *init
, int use_global_new
)
1757 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1758 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1759 permits us to distinguish the case of a missing initializer "new
1760 int" from an empty initializer "new int()". */
1762 init_list
= NULL_TREE
;
1763 else if (VEC_empty (tree
, init
))
1764 init_list
= void_zero_node
;
1766 init_list
= build_tree_list_vec (init
);
1768 new_expr
= build4 (NEW_EXPR
, build_pointer_type (type
),
1769 build_tree_list_vec (placement
), type
, nelts
,
1771 NEW_EXPR_USE_GLOBAL (new_expr
) = use_global_new
;
1772 TREE_SIDE_EFFECTS (new_expr
) = 1;
1777 /* Diagnose uninitialized const members or reference members of type
1778 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1779 new expression without a new-initializer and a declaration. Returns
1783 diagnose_uninitialized_cst_or_ref_member_1 (tree type
, tree origin
,
1784 bool using_new
, bool complain
)
1787 int error_count
= 0;
1789 if (type_has_user_provided_constructor (type
))
1792 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1796 if (TREE_CODE (field
) != FIELD_DECL
)
1799 field_type
= strip_array_types (TREE_TYPE (field
));
1801 if (TREE_CODE (field_type
) == REFERENCE_TYPE
)
1807 error ("uninitialized reference member in %q#T "
1808 "using %<new%> without new-initializer", origin
);
1810 error ("uninitialized reference member in %q#T", origin
);
1811 inform (DECL_SOURCE_LOCATION (field
),
1812 "%qD should be initialized", field
);
1816 if (CP_TYPE_CONST_P (field_type
))
1822 error ("uninitialized const member in %q#T "
1823 "using %<new%> without new-initializer", origin
);
1825 error ("uninitialized const member in %q#T", origin
);
1826 inform (DECL_SOURCE_LOCATION (field
),
1827 "%qD should be initialized", field
);
1831 if (CLASS_TYPE_P (field_type
))
1833 += diagnose_uninitialized_cst_or_ref_member_1 (field_type
, origin
,
1834 using_new
, complain
);
1840 diagnose_uninitialized_cst_or_ref_member (tree type
, bool using_new
, bool complain
)
1842 return diagnose_uninitialized_cst_or_ref_member_1 (type
, type
, using_new
, complain
);
1845 /* Generate code for a new-expression, including calling the "operator
1846 new" function, initializing the object, and, if an exception occurs
1847 during construction, cleaning up. The arguments are as for
1848 build_raw_new_expr. This may change PLACEMENT and INIT. */
1851 build_new_1 (VEC(tree
,gc
) **placement
, tree type
, tree nelts
,
1852 VEC(tree
,gc
) **init
, bool globally_qualified_p
,
1853 tsubst_flags_t complain
)
1856 /* True iff this is a call to "operator new[]" instead of just
1858 bool array_p
= false;
1859 /* If ARRAY_P is true, the element type of the array. This is never
1860 an ARRAY_TYPE; for something like "new int[3][4]", the
1861 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1864 /* The type of the new-expression. (This type is always a pointer
1867 tree non_const_pointer_type
;
1868 tree outer_nelts
= NULL_TREE
;
1869 tree alloc_call
, alloc_expr
;
1870 /* The address returned by the call to "operator new". This node is
1871 a VAR_DECL and is therefore reusable. */
1874 tree cookie_expr
, init_expr
;
1875 int nothrow
, check_new
;
1876 int use_java_new
= 0;
1877 /* If non-NULL, the number of extra bytes to allocate at the
1878 beginning of the storage allocated for an array-new expression in
1879 order to store the number of elements. */
1880 tree cookie_size
= NULL_TREE
;
1881 tree placement_first
;
1882 tree placement_expr
= NULL_TREE
;
1883 /* True if the function we are calling is a placement allocation
1885 bool placement_allocation_fn_p
;
1886 /* True if the storage must be initialized, either by a constructor
1887 or due to an explicit new-initializer. */
1888 bool is_initialized
;
1889 /* The address of the thing allocated, not including any cookie. In
1890 particular, if an array cookie is in use, DATA_ADDR is the
1891 address of the first array element. This node is a VAR_DECL, and
1892 is therefore reusable. */
1894 tree init_preeval_expr
= NULL_TREE
;
1898 outer_nelts
= nelts
;
1901 else if (TREE_CODE (type
) == ARRAY_TYPE
)
1904 nelts
= array_type_nelts_top (type
);
1905 outer_nelts
= nelts
;
1906 type
= TREE_TYPE (type
);
1909 /* If our base type is an array, then make sure we know how many elements
1911 for (elt_type
= type
;
1912 TREE_CODE (elt_type
) == ARRAY_TYPE
;
1913 elt_type
= TREE_TYPE (elt_type
))
1914 nelts
= cp_build_binary_op (input_location
,
1916 array_type_nelts_top (elt_type
),
1919 if (TREE_CODE (elt_type
) == VOID_TYPE
)
1921 if (complain
& tf_error
)
1922 error ("invalid type %<void%> for new");
1923 return error_mark_node
;
1926 if (abstract_virtuals_error (NULL_TREE
, elt_type
))
1927 return error_mark_node
;
1929 is_initialized
= (TYPE_NEEDS_CONSTRUCTING (elt_type
) || *init
!= NULL
);
1933 bool maybe_uninitialized_error
= false;
1934 /* A program that calls for default-initialization [...] of an
1935 entity of reference type is ill-formed. */
1936 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type
))
1937 maybe_uninitialized_error
= true;
1939 /* A new-expression that creates an object of type T initializes
1940 that object as follows:
1941 - If the new-initializer is omitted:
1942 -- If T is a (possibly cv-qualified) non-POD class type
1943 (or array thereof), the object is default-initialized (8.5).
1945 -- Otherwise, the object created has indeterminate
1946 value. If T is a const-qualified type, or a (possibly
1947 cv-qualified) POD class type (or array thereof)
1948 containing (directly or indirectly) a member of
1949 const-qualified type, the program is ill-formed; */
1951 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type
))
1952 maybe_uninitialized_error
= true;
1954 if (maybe_uninitialized_error
1955 && diagnose_uninitialized_cst_or_ref_member (elt_type
,
1957 complain
& tf_error
))
1958 return error_mark_node
;
1961 if (CP_TYPE_CONST_P (elt_type
) && *init
== NULL
1962 && !type_has_user_provided_default_constructor (elt_type
))
1964 if (complain
& tf_error
)
1965 error ("uninitialized const in %<new%> of %q#T", elt_type
);
1966 return error_mark_node
;
1969 size
= size_in_bytes (elt_type
);
1971 size
= size_binop (MULT_EXPR
, size
, convert (sizetype
, nelts
));
1973 alloc_fn
= NULL_TREE
;
1975 /* If PLACEMENT is a single simple pointer type not passed by
1976 reference, prepare to capture it in a temporary variable. Do
1977 this now, since PLACEMENT will change in the calls below. */
1978 placement_first
= NULL_TREE
;
1979 if (VEC_length (tree
, *placement
) == 1
1980 && (TREE_CODE (TREE_TYPE (VEC_index (tree
, *placement
, 0)))
1982 placement_first
= VEC_index (tree
, *placement
, 0);
1984 /* Allocate the object. */
1985 if (VEC_empty (tree
, *placement
) && TYPE_FOR_JAVA (elt_type
))
1988 tree class_decl
= build_java_class_ref (elt_type
);
1989 static const char alloc_name
[] = "_Jv_AllocObject";
1991 if (class_decl
== error_mark_node
)
1992 return error_mark_node
;
1995 if (!get_global_value_if_present (get_identifier (alloc_name
),
1998 if (complain
& tf_error
)
1999 error ("call to Java constructor with %qs undefined", alloc_name
);
2000 return error_mark_node
;
2002 else if (really_overloaded_fn (alloc_fn
))
2004 if (complain
& tf_error
)
2005 error ("%qD should never be overloaded", alloc_fn
);
2006 return error_mark_node
;
2008 alloc_fn
= OVL_CURRENT (alloc_fn
);
2009 class_addr
= build1 (ADDR_EXPR
, jclass_node
, class_decl
);
2010 alloc_call
= (cp_build_function_call
2012 build_tree_list (NULL_TREE
, class_addr
),
2015 else if (TYPE_FOR_JAVA (elt_type
) && MAYBE_CLASS_TYPE_P (elt_type
))
2017 error ("Java class %q#T object allocated using placement new", elt_type
);
2018 return error_mark_node
;
2025 fnname
= ansi_opname (array_p
? VEC_NEW_EXPR
: NEW_EXPR
);
2027 if (!globally_qualified_p
2028 && CLASS_TYPE_P (elt_type
)
2030 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type
)
2031 : TYPE_HAS_NEW_OPERATOR (elt_type
)))
2033 /* Use a class-specific operator new. */
2034 /* If a cookie is required, add some extra space. */
2035 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
2037 cookie_size
= targetm
.cxx
.get_cookie_size (elt_type
);
2038 size
= size_binop (PLUS_EXPR
, size
, cookie_size
);
2040 /* Create the argument list. */
2041 VEC_safe_insert (tree
, gc
, *placement
, 0, size
);
2042 /* Do name-lookup to find the appropriate operator. */
2043 fns
= lookup_fnfields (elt_type
, fnname
, /*protect=*/2);
2044 if (fns
== NULL_TREE
)
2046 if (complain
& tf_error
)
2047 error ("no suitable %qD found in class %qT", fnname
, elt_type
);
2048 return error_mark_node
;
2050 if (TREE_CODE (fns
) == TREE_LIST
)
2052 if (complain
& tf_error
)
2054 error ("request for member %qD is ambiguous", fnname
);
2055 print_candidates (fns
);
2057 return error_mark_node
;
2059 alloc_call
= build_new_method_call (build_dummy_object (elt_type
),
2061 /*conversion_path=*/NULL_TREE
,
2068 /* Use a global operator new. */
2069 /* See if a cookie might be required. */
2070 if (array_p
&& TYPE_VEC_NEW_USES_COOKIE (elt_type
))
2071 cookie_size
= targetm
.cxx
.get_cookie_size (elt_type
);
2073 cookie_size
= NULL_TREE
;
2075 alloc_call
= build_operator_new_call (fnname
, placement
,
2076 &size
, &cookie_size
,
2081 if (alloc_call
== error_mark_node
)
2082 return error_mark_node
;
2084 gcc_assert (alloc_fn
!= NULL_TREE
);
2086 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2087 into a temporary variable. */
2088 if (!processing_template_decl
2089 && placement_first
!= NULL_TREE
2090 && TREE_CODE (alloc_call
) == CALL_EXPR
2091 && call_expr_nargs (alloc_call
) == 2
2092 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call
, 0))) == INTEGER_TYPE
2093 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call
, 1))) == POINTER_TYPE
)
2095 tree placement_arg
= CALL_EXPR_ARG (alloc_call
, 1);
2097 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg
)))
2098 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg
))))
2100 placement_expr
= get_target_expr (placement_first
);
2101 CALL_EXPR_ARG (alloc_call
, 1)
2102 = convert (TREE_TYPE (placement_arg
), placement_expr
);
2106 /* In the simple case, we can stop now. */
2107 pointer_type
= build_pointer_type (type
);
2108 if (!cookie_size
&& !is_initialized
)
2109 return build_nop (pointer_type
, alloc_call
);
2111 /* Store the result of the allocation call in a variable so that we can
2112 use it more than once. */
2113 alloc_expr
= get_target_expr (alloc_call
);
2114 alloc_node
= TARGET_EXPR_SLOT (alloc_expr
);
2116 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2117 while (TREE_CODE (alloc_call
) == COMPOUND_EXPR
)
2118 alloc_call
= TREE_OPERAND (alloc_call
, 1);
2120 /* Now, check to see if this function is actually a placement
2121 allocation function. This can happen even when PLACEMENT is NULL
2122 because we might have something like:
2124 struct S { void* operator new (size_t, int i = 0); };
2126 A call to `new S' will get this allocation function, even though
2127 there is no explicit placement argument. If there is more than
2128 one argument, or there are variable arguments, then this is a
2129 placement allocation function. */
2130 placement_allocation_fn_p
2131 = (type_num_arguments (TREE_TYPE (alloc_fn
)) > 1
2132 || varargs_function_p (alloc_fn
));
2134 /* Preevaluate the placement args so that we don't reevaluate them for a
2135 placement delete. */
2136 if (placement_allocation_fn_p
)
2139 stabilize_call (alloc_call
, &inits
);
2141 alloc_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (alloc_expr
), inits
,
2145 /* unless an allocation function is declared with an empty excep-
2146 tion-specification (_except.spec_), throw(), it indicates failure to
2147 allocate storage by throwing a bad_alloc exception (clause _except_,
2148 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2149 cation function is declared with an empty exception-specification,
2150 throw(), it returns null to indicate failure to allocate storage and a
2151 non-null pointer otherwise.
2153 So check for a null exception spec on the op new we just called. */
2155 nothrow
= TYPE_NOTHROW_P (TREE_TYPE (alloc_fn
));
2156 check_new
= (flag_check_new
|| nothrow
) && ! use_java_new
;
2164 /* Adjust so we're pointing to the start of the object. */
2165 data_addr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (alloc_node
),
2166 alloc_node
, cookie_size
);
2168 /* Store the number of bytes allocated so that we can know how
2169 many elements to destroy later. We use the last sizeof
2170 (size_t) bytes to store the number of elements. */
2171 cookie_ptr
= size_binop (MINUS_EXPR
, cookie_size
, size_in_bytes (sizetype
));
2172 cookie_ptr
= fold_build2_loc (input_location
,
2173 POINTER_PLUS_EXPR
, TREE_TYPE (alloc_node
),
2174 alloc_node
, cookie_ptr
);
2175 size_ptr_type
= build_pointer_type (sizetype
);
2176 cookie_ptr
= fold_convert (size_ptr_type
, cookie_ptr
);
2177 cookie
= cp_build_indirect_ref (cookie_ptr
, RO_NULL
, complain
);
2179 cookie_expr
= build2 (MODIFY_EXPR
, sizetype
, cookie
, nelts
);
2181 if (targetm
.cxx
.cookie_has_size ())
2183 /* Also store the element size. */
2184 cookie_ptr
= build2 (POINTER_PLUS_EXPR
, size_ptr_type
, cookie_ptr
,
2185 fold_build1_loc (input_location
,
2186 NEGATE_EXPR
, sizetype
,
2187 size_in_bytes (sizetype
)));
2189 cookie
= cp_build_indirect_ref (cookie_ptr
, RO_NULL
, complain
);
2190 cookie
= build2 (MODIFY_EXPR
, sizetype
, cookie
,
2191 size_in_bytes (elt_type
));
2192 cookie_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cookie_expr
),
2193 cookie
, cookie_expr
);
2198 cookie_expr
= NULL_TREE
;
2199 data_addr
= alloc_node
;
2202 /* Now use a pointer to the type we've actually allocated. */
2204 /* But we want to operate on a non-const version to start with,
2205 since we'll be modifying the elements. */
2206 non_const_pointer_type
= build_pointer_type
2207 (cp_build_qualified_type (type
, cp_type_quals (type
) & ~TYPE_QUAL_CONST
));
2209 data_addr
= fold_convert (non_const_pointer_type
, data_addr
);
2210 /* Any further uses of alloc_node will want this type, too. */
2211 alloc_node
= fold_convert (non_const_pointer_type
, alloc_node
);
2213 /* Now initialize the allocated object. Note that we preevaluate the
2214 initialization expression, apart from the actual constructor call or
2215 assignment--we do this because we want to delay the allocation as long
2216 as possible in order to minimize the size of the exception region for
2217 placement delete. */
2221 bool explicit_value_init_p
= false;
2223 if (*init
!= NULL
&& VEC_empty (tree
, *init
))
2226 explicit_value_init_p
= true;
2231 tree vecinit
= NULL_TREE
;
2232 if (*init
&& VEC_length (tree
, *init
) == 1
2233 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *init
, 0))
2234 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *init
, 0)))
2236 tree arraytype
, domain
;
2237 vecinit
= VEC_index (tree
, *init
, 0);
2238 if (TREE_CONSTANT (nelts
))
2239 domain
= compute_array_index_type (NULL_TREE
, nelts
);
2243 if (CONSTRUCTOR_NELTS (vecinit
) > 0)
2244 warning (0, "non-constant array size in new, unable to "
2245 "verify length of initializer-list");
2247 arraytype
= build_cplus_array_type (type
, domain
);
2248 vecinit
= digest_init (arraytype
, vecinit
);
2252 if (complain
& tf_error
)
2253 permerror (input_location
, "ISO C++ forbids initialization in array new");
2255 return error_mark_node
;
2256 vecinit
= build_tree_list_vec (*init
);
2259 = build_vec_init (data_addr
,
2260 cp_build_binary_op (input_location
,
2261 MINUS_EXPR
, outer_nelts
,
2265 explicit_value_init_p
,
2269 /* An array initialization is stable because the initialization
2270 of each element is a full-expression, so the temporaries don't
2276 init_expr
= cp_build_indirect_ref (data_addr
, RO_NULL
, complain
);
2278 if (TYPE_NEEDS_CONSTRUCTING (type
) && !explicit_value_init_p
)
2280 init_expr
= build_special_member_call (init_expr
,
2281 complete_ctor_identifier
,
2286 else if (explicit_value_init_p
)
2288 /* Something like `new int()'. */
2289 init_expr
= build2 (INIT_EXPR
, type
,
2290 init_expr
, build_value_init (type
));
2296 /* We are processing something like `new int (10)', which
2297 means allocate an int, and initialize it with 10. */
2299 ie
= build_x_compound_expr_from_vec (*init
, "new initializer");
2300 init_expr
= cp_build_modify_expr (init_expr
, INIT_EXPR
, ie
,
2303 stable
= stabilize_init (init_expr
, &init_preeval_expr
);
2306 if (init_expr
== error_mark_node
)
2307 return error_mark_node
;
2309 /* If any part of the object initialization terminates by throwing an
2310 exception and a suitable deallocation function can be found, the
2311 deallocation function is called to free the memory in which the
2312 object was being constructed, after which the exception continues
2313 to propagate in the context of the new-expression. If no
2314 unambiguous matching deallocation function can be found,
2315 propagating the exception does not cause the object's memory to be
2317 if (flag_exceptions
&& ! use_java_new
)
2319 enum tree_code dcode
= array_p
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2322 /* The Standard is unclear here, but the right thing to do
2323 is to use the same method for finding deallocation
2324 functions that we use for finding allocation functions. */
2325 cleanup
= (build_op_delete_call
2329 globally_qualified_p
,
2330 placement_allocation_fn_p
? alloc_call
: NULL_TREE
,
2336 /* This is much simpler if we were able to preevaluate all of
2337 the arguments to the constructor call. */
2339 /* CLEANUP is compiler-generated, so no diagnostics. */
2340 TREE_NO_WARNING (cleanup
) = true;
2341 init_expr
= build2 (TRY_CATCH_EXPR
, void_type_node
,
2342 init_expr
, cleanup
);
2343 /* Likewise, this try-catch is compiler-generated. */
2344 TREE_NO_WARNING (init_expr
) = true;
2347 /* Ack! First we allocate the memory. Then we set our sentry
2348 variable to true, and expand a cleanup that deletes the
2349 memory if sentry is true. Then we run the constructor, and
2350 finally clear the sentry.
2352 We need to do this because we allocate the space first, so
2353 if there are any temporaries with cleanups in the
2354 constructor args and we weren't able to preevaluate them, we
2355 need this EH region to extend until end of full-expression
2356 to preserve nesting. */
2358 tree end
, sentry
, begin
;
2360 begin
= get_target_expr (boolean_true_node
);
2361 CLEANUP_EH_ONLY (begin
) = 1;
2363 sentry
= TARGET_EXPR_SLOT (begin
);
2365 /* CLEANUP is compiler-generated, so no diagnostics. */
2366 TREE_NO_WARNING (cleanup
) = true;
2368 TARGET_EXPR_CLEANUP (begin
)
2369 = build3 (COND_EXPR
, void_type_node
, sentry
,
2370 cleanup
, void_zero_node
);
2372 end
= build2 (MODIFY_EXPR
, TREE_TYPE (sentry
),
2373 sentry
, boolean_false_node
);
2376 = build2 (COMPOUND_EXPR
, void_type_node
, begin
,
2377 build2 (COMPOUND_EXPR
, void_type_node
, init_expr
,
2379 /* Likewise, this is compiler-generated. */
2380 TREE_NO_WARNING (init_expr
) = true;
2385 init_expr
= NULL_TREE
;
2387 /* Now build up the return value in reverse order. */
2392 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), init_expr
, rval
);
2394 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), cookie_expr
, rval
);
2396 if (rval
== data_addr
)
2397 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2398 and return the call (which doesn't need to be adjusted). */
2399 rval
= TARGET_EXPR_INITIAL (alloc_expr
);
2404 tree ifexp
= cp_build_binary_op (input_location
,
2405 NE_EXPR
, alloc_node
,
2408 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
,
2412 /* Perform the allocation before anything else, so that ALLOC_NODE
2413 has been initialized before we start using it. */
2414 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2417 if (init_preeval_expr
)
2418 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), init_preeval_expr
, rval
);
2420 /* A new-expression is never an lvalue. */
2421 gcc_assert (!lvalue_p (rval
));
2423 return convert (pointer_type
, rval
);
2426 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2427 is a vector of placement-new arguments (or NULL if none). If NELTS
2428 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2429 is not NULL, then this is an array-new allocation; TYPE is the type
2430 of the elements in the array and NELTS is the number of elements in
2431 the array. *INIT, if non-NULL, is the initializer for the new
2432 object, or an empty vector to indicate an initializer of "()". If
2433 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2434 rather than just "new". This may change PLACEMENT and INIT. */
2437 build_new (VEC(tree
,gc
) **placement
, tree type
, tree nelts
,
2438 VEC(tree
,gc
) **init
, int use_global_new
, tsubst_flags_t complain
)
2441 VEC(tree
,gc
) *orig_placement
= NULL
;
2442 tree orig_nelts
= NULL_TREE
;
2443 VEC(tree
,gc
) *orig_init
= NULL
;
2445 if (type
== error_mark_node
)
2446 return error_mark_node
;
2448 if (nelts
== NULL_TREE
&& VEC_length (tree
, *init
) == 1)
2450 tree auto_node
= type_uses_auto (type
);
2451 if (auto_node
&& describable_type (VEC_index (tree
, *init
, 0)))
2452 type
= do_auto_deduction (type
, VEC_index (tree
, *init
, 0), auto_node
);
2455 if (processing_template_decl
)
2457 if (dependent_type_p (type
)
2458 || any_type_dependent_arguments_p (*placement
)
2459 || (nelts
&& type_dependent_expression_p (nelts
))
2460 || any_type_dependent_arguments_p (*init
))
2461 return build_raw_new_expr (*placement
, type
, nelts
, *init
,
2464 orig_placement
= make_tree_vector_copy (*placement
);
2466 orig_init
= make_tree_vector_copy (*init
);
2468 make_args_non_dependent (*placement
);
2470 nelts
= build_non_dependent_expr (nelts
);
2471 make_args_non_dependent (*init
);
2476 if (!build_expr_type_conversion (WANT_INT
| WANT_ENUM
, nelts
, false))
2478 if (complain
& tf_error
)
2479 permerror (input_location
, "size in array new must have integral type");
2481 return error_mark_node
;
2483 nelts
= mark_rvalue_use (nelts
);
2484 nelts
= cp_save_expr (cp_convert (sizetype
, nelts
));
2487 /* ``A reference cannot be created by the new operator. A reference
2488 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2489 returned by new.'' ARM 5.3.3 */
2490 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2492 if (complain
& tf_error
)
2493 error ("new cannot be applied to a reference type");
2495 return error_mark_node
;
2496 type
= TREE_TYPE (type
);
2499 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2501 if (complain
& tf_error
)
2502 error ("new cannot be applied to a function type");
2503 return error_mark_node
;
2506 /* The type allocated must be complete. If the new-type-id was
2507 "T[N]" then we are just checking that "T" is complete here, but
2508 that is equivalent, since the value of "N" doesn't matter. */
2509 if (!complete_type_or_else (type
, NULL_TREE
))
2510 return error_mark_node
;
2512 rval
= build_new_1 (placement
, type
, nelts
, init
, use_global_new
, complain
);
2513 if (rval
== error_mark_node
)
2514 return error_mark_node
;
2516 if (processing_template_decl
)
2518 tree ret
= build_raw_new_expr (orig_placement
, type
, orig_nelts
,
2519 orig_init
, use_global_new
);
2520 release_tree_vector (orig_placement
);
2521 release_tree_vector (orig_init
);
2525 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2526 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
2527 TREE_NO_WARNING (rval
) = 1;
2532 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2535 build_java_class_ref (tree type
)
2537 tree name
= NULL_TREE
, class_decl
;
2538 static tree CL_suffix
= NULL_TREE
;
2539 if (CL_suffix
== NULL_TREE
)
2540 CL_suffix
= get_identifier("class$");
2541 if (jclass_node
== NULL_TREE
)
2543 jclass_node
= IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
2544 if (jclass_node
== NULL_TREE
)
2546 error ("call to Java constructor, while %<jclass%> undefined");
2547 return error_mark_node
;
2549 jclass_node
= TREE_TYPE (jclass_node
);
2552 /* Mangle the class$ field. */
2555 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2556 if (DECL_NAME (field
) == CL_suffix
)
2558 mangle_decl (field
);
2559 name
= DECL_ASSEMBLER_NAME (field
);
2564 error ("can't find %<class$%> in %qT", type
);
2565 return error_mark_node
;
2569 class_decl
= IDENTIFIER_GLOBAL_VALUE (name
);
2570 if (class_decl
== NULL_TREE
)
2572 class_decl
= build_decl (input_location
,
2573 VAR_DECL
, name
, TREE_TYPE (jclass_node
));
2574 TREE_STATIC (class_decl
) = 1;
2575 DECL_EXTERNAL (class_decl
) = 1;
2576 TREE_PUBLIC (class_decl
) = 1;
2577 DECL_ARTIFICIAL (class_decl
) = 1;
2578 DECL_IGNORED_P (class_decl
) = 1;
2579 pushdecl_top_level (class_decl
);
2580 make_decl_rtl (class_decl
);
2586 build_vec_delete_1 (tree base
, tree maxindex
, tree type
,
2587 special_function_kind auto_delete_vec
, int use_global_delete
)
2590 tree ptype
= build_pointer_type (type
= complete_type (type
));
2591 tree size_exp
= size_in_bytes (type
);
2593 /* Temporary variables used by the loop. */
2594 tree tbase
, tbase_init
;
2596 /* This is the body of the loop that implements the deletion of a
2597 single element, and moves temp variables to next elements. */
2600 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2603 /* This is the thing that governs what to do after the loop has run. */
2604 tree deallocate_expr
= 0;
2606 /* This is the BIND_EXPR which holds the outermost iterator of the
2607 loop. It is convenient to set this variable up and test it before
2608 executing any other code in the loop.
2609 This is also the containing expression returned by this function. */
2610 tree controller
= NULL_TREE
;
2613 /* We should only have 1-D arrays here. */
2614 gcc_assert (TREE_CODE (type
) != ARRAY_TYPE
);
2616 if (! MAYBE_CLASS_TYPE_P (type
) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
2619 /* The below is short by the cookie size. */
2620 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2621 convert (sizetype
, maxindex
));
2623 tbase
= create_temporary_var (ptype
);
2624 tbase_init
= cp_build_modify_expr (tbase
, NOP_EXPR
,
2625 fold_build2_loc (input_location
,
2626 POINTER_PLUS_EXPR
, ptype
,
2627 fold_convert (ptype
, base
),
2629 tf_warning_or_error
);
2630 controller
= build3 (BIND_EXPR
, void_type_node
, tbase
,
2631 NULL_TREE
, NULL_TREE
);
2632 TREE_SIDE_EFFECTS (controller
) = 1;
2634 body
= build1 (EXIT_EXPR
, void_type_node
,
2635 build2 (EQ_EXPR
, boolean_type_node
, tbase
,
2636 fold_convert (ptype
, base
)));
2637 tmp
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, size_exp
);
2638 body
= build_compound_expr
2640 body
, cp_build_modify_expr (tbase
, NOP_EXPR
,
2641 build2 (POINTER_PLUS_EXPR
, ptype
, tbase
, tmp
),
2642 tf_warning_or_error
));
2643 body
= build_compound_expr
2645 body
, build_delete (ptype
, tbase
, sfk_complete_destructor
,
2646 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1));
2648 loop
= build1 (LOOP_EXPR
, void_type_node
, body
);
2649 loop
= build_compound_expr (input_location
, tbase_init
, loop
);
2652 /* If the delete flag is one, or anything else with the low bit set,
2653 delete the storage. */
2654 if (auto_delete_vec
!= sfk_base_destructor
)
2658 /* The below is short by the cookie size. */
2659 virtual_size
= size_binop (MULT_EXPR
, size_exp
,
2660 convert (sizetype
, maxindex
));
2662 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2669 cookie_size
= targetm
.cxx
.get_cookie_size (type
);
2671 = cp_convert (ptype
,
2672 cp_build_binary_op (input_location
,
2674 cp_convert (string_type_node
,
2677 tf_warning_or_error
));
2678 /* True size with header. */
2679 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, cookie_size
);
2682 if (auto_delete_vec
== sfk_deleting_destructor
)
2683 deallocate_expr
= build_op_delete_call (VEC_DELETE_EXPR
,
2684 base_tbd
, virtual_size
,
2685 use_global_delete
& 1,
2686 /*placement=*/NULL_TREE
,
2687 /*alloc_fn=*/NULL_TREE
);
2691 if (!deallocate_expr
)
2694 body
= deallocate_expr
;
2696 body
= build_compound_expr (input_location
, body
, deallocate_expr
);
2699 body
= integer_zero_node
;
2701 /* Outermost wrapper: If pointer is null, punt. */
2702 body
= fold_build3_loc (input_location
, COND_EXPR
, void_type_node
,
2703 fold_build2_loc (input_location
,
2704 NE_EXPR
, boolean_type_node
, base
,
2705 convert (TREE_TYPE (base
),
2706 integer_zero_node
)),
2707 body
, integer_zero_node
);
2708 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2712 TREE_OPERAND (controller
, 1) = body
;
2716 if (TREE_CODE (base
) == SAVE_EXPR
)
2717 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2718 body
= build2 (COMPOUND_EXPR
, void_type_node
, base
, body
);
2720 return convert_to_void (body
, /*implicit=*/NULL
, tf_warning_or_error
);
2723 /* Create an unnamed variable of the indicated TYPE. */
2726 create_temporary_var (tree type
)
2730 decl
= build_decl (input_location
,
2731 VAR_DECL
, NULL_TREE
, type
);
2732 TREE_USED (decl
) = 1;
2733 DECL_ARTIFICIAL (decl
) = 1;
2734 DECL_IGNORED_P (decl
) = 1;
2735 DECL_CONTEXT (decl
) = current_function_decl
;
2740 /* Create a new temporary variable of the indicated TYPE, initialized
2743 It is not entered into current_binding_level, because that breaks
2744 things when it comes time to do final cleanups (which take place
2745 "outside" the binding contour of the function). */
2748 get_temp_regvar (tree type
, tree init
)
2752 decl
= create_temporary_var (type
);
2753 add_decl_expr (decl
);
2755 finish_expr_stmt (cp_build_modify_expr (decl
, INIT_EXPR
, init
,
2756 tf_warning_or_error
));
2761 /* `build_vec_init' returns tree structure that performs
2762 initialization of a vector of aggregate types.
2764 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2765 to the first element, of POINTER_TYPE.
2766 MAXINDEX is the maximum index of the array (one less than the
2767 number of elements). It is only used if BASE is a pointer or
2768 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2770 INIT is the (possibly NULL) initializer.
2772 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2773 elements in the array are value-initialized.
2775 FROM_ARRAY is 0 if we should init everything with INIT
2776 (i.e., every element initialized from INIT).
2777 FROM_ARRAY is 1 if we should index into INIT in parallel
2778 with initialization of DECL.
2779 FROM_ARRAY is 2 if we should index into INIT in parallel,
2780 but use assignment instead of initialization. */
2783 build_vec_init (tree base
, tree maxindex
, tree init
,
2784 bool explicit_value_init_p
,
2785 int from_array
, tsubst_flags_t complain
)
2788 tree base2
= NULL_TREE
;
2789 tree itype
= NULL_TREE
;
2791 /* The type of BASE. */
2792 tree atype
= TREE_TYPE (base
);
2793 /* The type of an element in the array. */
2794 tree type
= TREE_TYPE (atype
);
2795 /* The element type reached after removing all outer array
2797 tree inner_elt_type
;
2798 /* The type of a pointer to an element in the array. */
2803 tree try_block
= NULL_TREE
;
2804 int num_initialized_elts
= 0;
2807 if (TREE_CODE (atype
) == ARRAY_TYPE
&& TYPE_DOMAIN (atype
))
2808 maxindex
= array_type_nelts (atype
);
2810 if (maxindex
== NULL_TREE
|| maxindex
== error_mark_node
)
2811 return error_mark_node
;
2813 if (explicit_value_init_p
)
2816 inner_elt_type
= strip_array_types (type
);
2818 /* Look through the TARGET_EXPR around a compound literal. */
2819 if (init
&& TREE_CODE (init
) == TARGET_EXPR
2820 && TREE_CODE (TARGET_EXPR_INITIAL (init
)) == CONSTRUCTOR
2822 init
= TARGET_EXPR_INITIAL (init
);
2825 && TREE_CODE (atype
) == ARRAY_TYPE
2827 ? (!CLASS_TYPE_P (inner_elt_type
)
2828 || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type
))
2829 : !TYPE_NEEDS_CONSTRUCTING (type
))
2830 && ((TREE_CODE (init
) == CONSTRUCTOR
2831 /* Don't do this if the CONSTRUCTOR might contain something
2832 that might throw and require us to clean up. */
2833 && (VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (init
))
2834 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type
)))
2837 /* Do non-default initialization of trivial arrays resulting from
2838 brace-enclosed initializers. In this case, digest_init and
2839 store_constructor will handle the semantics for us. */
2841 stmt_expr
= build2 (INIT_EXPR
, atype
, base
, init
);
2845 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2846 if (TREE_CODE (atype
) == ARRAY_TYPE
)
2848 ptype
= build_pointer_type (type
);
2849 base
= cp_convert (ptype
, decay_conversion (base
));
2854 /* The code we are generating looks like:
2858 ptrdiff_t iterator = maxindex;
2860 for (; iterator != -1; --iterator) {
2861 ... initialize *t1 ...
2865 ... destroy elements that were constructed ...
2870 We can omit the try and catch blocks if we know that the
2871 initialization will never throw an exception, or if the array
2872 elements do not have destructors. We can omit the loop completely if
2873 the elements of the array do not have constructors.
2875 We actually wrap the entire body of the above in a STMT_EXPR, for
2878 When copying from array to another, when the array elements have
2879 only trivial copy constructors, we should use __builtin_memcpy
2880 rather than generating a loop. That way, we could take advantage
2881 of whatever cleverness the back end has for dealing with copies
2882 of blocks of memory. */
2884 is_global
= begin_init_stmts (&stmt_expr
, &compound_stmt
);
2885 destroy_temps
= stmts_are_full_exprs_p ();
2886 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2887 rval
= get_temp_regvar (ptype
, base
);
2888 base
= get_temp_regvar (ptype
, rval
);
2889 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2891 /* If initializing one array from another, initialize element by
2892 element. We rely upon the below calls to do the argument
2893 checking. Evaluate the initializer before entering the try block. */
2894 if (from_array
&& init
&& TREE_CODE (init
) != CONSTRUCTOR
)
2896 base2
= decay_conversion (init
);
2897 itype
= TREE_TYPE (base2
);
2898 base2
= get_temp_regvar (itype
, base2
);
2899 itype
= TREE_TYPE (itype
);
2902 /* Protect the entire array initialization so that we can destroy
2903 the partially constructed array if an exception is thrown.
2904 But don't do this if we're assigning. */
2905 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2908 try_block
= begin_try_block ();
2911 if (init
!= NULL_TREE
&& TREE_CODE (init
) == CONSTRUCTOR
)
2913 /* Do non-default initialization of non-trivial arrays resulting from
2914 brace-enclosed initializers. */
2915 unsigned HOST_WIDE_INT idx
;
2919 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
2921 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2923 num_initialized_elts
++;
2925 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
2926 if (MAYBE_CLASS_TYPE_P (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
2927 finish_expr_stmt (build_aggr_init (baseref
, elt
, 0, complain
));
2929 finish_expr_stmt (cp_build_modify_expr (baseref
, NOP_EXPR
,
2931 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
2933 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR
, base
, 0,
2935 finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR
, iterator
, 0,
2939 /* Clear out INIT so that we don't get confused below. */
2942 else if (from_array
)
2945 /* OK, we set base2 above. */;
2946 else if (TYPE_LANG_SPECIFIC (type
)
2947 && TYPE_NEEDS_CONSTRUCTING (type
)
2948 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2950 if (complain
& tf_error
)
2951 error ("initializer ends prematurely");
2952 return error_mark_node
;
2956 /* Now, default-initialize any remaining elements. We don't need to
2957 do that if a) the type does not need constructing, or b) we've
2958 already initialized all the elements.
2960 We do need to keep going if we're copying an array. */
2963 || ((TYPE_NEEDS_CONSTRUCTING (type
) || explicit_value_init_p
)
2964 && ! (host_integerp (maxindex
, 0)
2965 && (num_initialized_elts
2966 == tree_low_cst (maxindex
, 0) + 1))))
2968 /* If the ITERATOR is equal to -1, then we don't have to loop;
2969 we've already initialized all the elements. */
2974 for_stmt
= begin_for_stmt ();
2975 finish_for_init_stmt (for_stmt
);
2976 finish_for_cond (build2 (NE_EXPR
, boolean_type_node
, iterator
,
2977 build_int_cst (TREE_TYPE (iterator
), -1)),
2979 finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR
, iterator
, 0,
2983 to
= build1 (INDIRECT_REF
, type
, base
);
2990 from
= build1 (INDIRECT_REF
, itype
, base2
);
2994 if (from_array
== 2)
2995 elt_init
= cp_build_modify_expr (to
, NOP_EXPR
, from
,
2997 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2998 elt_init
= build_aggr_init (to
, from
, 0, complain
);
3000 elt_init
= cp_build_modify_expr (to
, NOP_EXPR
, from
,
3005 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3009 ("cannot initialize multi-dimensional array with initializer");
3010 elt_init
= build_vec_init (build1 (INDIRECT_REF
, type
, base
),
3012 explicit_value_init_p
,
3015 else if (explicit_value_init_p
)
3016 elt_init
= build2 (INIT_EXPR
, type
, to
,
3017 build_value_init (type
));
3020 gcc_assert (TYPE_NEEDS_CONSTRUCTING (type
));
3021 elt_init
= build_aggr_init (to
, init
, 0, complain
);
3024 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
3025 finish_expr_stmt (elt_init
);
3026 current_stmt_tree ()->stmts_are_full_exprs_p
= 0;
3028 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR
, base
, 0,
3031 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR
, base2
, 0,
3034 finish_for_stmt (for_stmt
);
3037 /* Make sure to cleanup any partially constructed elements. */
3038 if (flag_exceptions
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
3042 tree m
= cp_build_binary_op (input_location
,
3043 MINUS_EXPR
, maxindex
, iterator
,
3046 /* Flatten multi-dimensional array since build_vec_delete only
3047 expects one-dimensional array. */
3048 if (TREE_CODE (type
) == ARRAY_TYPE
)
3049 m
= cp_build_binary_op (input_location
,
3051 array_type_nelts_total (type
),
3054 finish_cleanup_try_block (try_block
);
3055 e
= build_vec_delete_1 (rval
, m
,
3056 inner_elt_type
, sfk_base_destructor
,
3057 /*use_global_delete=*/0);
3058 finish_cleanup (e
, try_block
);
3061 /* The value of the array initialization is the array itself, RVAL
3062 is a pointer to the first element. */
3063 finish_stmt_expr_expr (rval
, stmt_expr
);
3065 stmt_expr
= finish_init_stmts (is_global
, stmt_expr
, compound_stmt
);
3067 /* Now make the result have the correct type. */
3068 if (TREE_CODE (atype
) == ARRAY_TYPE
)
3070 atype
= build_pointer_type (atype
);
3071 stmt_expr
= build1 (NOP_EXPR
, atype
, stmt_expr
);
3072 stmt_expr
= cp_build_indirect_ref (stmt_expr
, RO_NULL
, complain
);
3073 TREE_NO_WARNING (stmt_expr
) = 1;
3076 current_stmt_tree ()->stmts_are_full_exprs_p
= destroy_temps
;
3080 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3084 build_dtor_call (tree exp
, special_function_kind dtor_kind
, int flags
)
3090 case sfk_complete_destructor
:
3091 name
= complete_dtor_identifier
;
3094 case sfk_base_destructor
:
3095 name
= base_dtor_identifier
;
3098 case sfk_deleting_destructor
:
3099 name
= deleting_dtor_identifier
;
3105 fn
= lookup_fnfields (TREE_TYPE (exp
), name
, /*protect=*/2);
3106 return build_new_method_call (exp
, fn
,
3108 /*conversion_path=*/NULL_TREE
,
3111 tf_warning_or_error
);
3114 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3115 ADDR is an expression which yields the store to be destroyed.
3116 AUTO_DELETE is the name of the destructor to call, i.e., either
3117 sfk_complete_destructor, sfk_base_destructor, or
3118 sfk_deleting_destructor.
3120 FLAGS is the logical disjunction of zero or more LOOKUP_
3121 flags. See cp-tree.h for more info. */
3124 build_delete (tree type
, tree addr
, special_function_kind auto_delete
,
3125 int flags
, int use_global_delete
)
3129 if (addr
== error_mark_node
)
3130 return error_mark_node
;
3132 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3133 set to `error_mark_node' before it gets properly cleaned up. */
3134 if (type
== error_mark_node
)
3135 return error_mark_node
;
3137 type
= TYPE_MAIN_VARIANT (type
);
3139 addr
= mark_rvalue_use (addr
);
3141 if (TREE_CODE (type
) == POINTER_TYPE
)
3143 bool complete_p
= true;
3145 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3146 if (TREE_CODE (type
) == ARRAY_TYPE
)
3149 /* We don't want to warn about delete of void*, only other
3150 incomplete types. Deleting other incomplete types
3151 invokes undefined behavior, but it is not ill-formed, so
3152 compile to something that would even do The Right Thing
3153 (TM) should the type have a trivial dtor and no delete
3155 if (!VOID_TYPE_P (type
))
3157 complete_type (type
);
3158 if (!COMPLETE_TYPE_P (type
))
3160 if (warning (0, "possible problem detected in invocation of "
3161 "delete operator:"))
3163 cxx_incomplete_type_diagnostic (addr
, type
, DK_WARNING
);
3164 inform (input_location
, "neither the destructor nor the class-specific "
3165 "operator delete will be called, even if they are "
3166 "declared when the class is defined.");
3171 if (VOID_TYPE_P (type
) || !complete_p
|| !MAYBE_CLASS_TYPE_P (type
))
3172 /* Call the builtin operator delete. */
3173 return build_builtin_delete_call (addr
);
3174 if (TREE_SIDE_EFFECTS (addr
))
3175 addr
= save_expr (addr
);
3177 /* Throw away const and volatile on target type of addr. */
3178 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3180 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3184 if (TYPE_DOMAIN (type
) == NULL_TREE
)
3186 error ("unknown array size in delete");
3187 return error_mark_node
;
3189 return build_vec_delete (addr
, array_type_nelts (type
),
3190 auto_delete
, use_global_delete
);
3194 /* Don't check PROTECT here; leave that decision to the
3195 destructor. If the destructor is accessible, call it,
3196 else report error. */
3197 addr
= cp_build_unary_op (ADDR_EXPR
, addr
, 0, tf_warning_or_error
);
3198 if (TREE_SIDE_EFFECTS (addr
))
3199 addr
= save_expr (addr
);
3201 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3204 gcc_assert (MAYBE_CLASS_TYPE_P (type
));
3206 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
3208 if (auto_delete
!= sfk_deleting_destructor
)
3209 return void_zero_node
;
3211 return build_op_delete_call (DELETE_EXPR
, addr
,
3212 cxx_sizeof_nowarn (type
),
3214 /*placement=*/NULL_TREE
,
3215 /*alloc_fn=*/NULL_TREE
);
3219 tree head
= NULL_TREE
;
3220 tree do_delete
= NULL_TREE
;
3223 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
3224 lazily_declare_fn (sfk_destructor
, type
);
3226 /* For `::delete x', we must not use the deleting destructor
3227 since then we would not be sure to get the global `operator
3229 if (use_global_delete
&& auto_delete
== sfk_deleting_destructor
)
3231 /* We will use ADDR multiple times so we must save it. */
3232 addr
= save_expr (addr
);
3233 head
= get_target_expr (build_headof (addr
));
3234 /* Delete the object. */
3235 do_delete
= build_builtin_delete_call (head
);
3236 /* Otherwise, treat this like a complete object destructor
3238 auto_delete
= sfk_complete_destructor
;
3240 /* If the destructor is non-virtual, there is no deleting
3241 variant. Instead, we must explicitly call the appropriate
3242 `operator delete' here. */
3243 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type
))
3244 && auto_delete
== sfk_deleting_destructor
)
3246 /* We will use ADDR multiple times so we must save it. */
3247 addr
= save_expr (addr
);
3248 /* Build the call. */
3249 do_delete
= build_op_delete_call (DELETE_EXPR
,
3251 cxx_sizeof_nowarn (type
),
3253 /*placement=*/NULL_TREE
,
3254 /*alloc_fn=*/NULL_TREE
);
3255 /* Call the complete object destructor. */
3256 auto_delete
= sfk_complete_destructor
;
3258 else if (auto_delete
== sfk_deleting_destructor
3259 && TYPE_GETS_REG_DELETE (type
))
3261 /* Make sure we have access to the member op delete, even though
3262 we'll actually be calling it from the destructor. */
3263 build_op_delete_call (DELETE_EXPR
, addr
, cxx_sizeof_nowarn (type
),
3265 /*placement=*/NULL_TREE
,
3266 /*alloc_fn=*/NULL_TREE
);
3269 expr
= build_dtor_call (cp_build_indirect_ref (addr
, RO_NULL
,
3270 tf_warning_or_error
),
3271 auto_delete
, flags
);
3273 expr
= build2 (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
3275 /* We need to calculate this before the dtor changes the vptr. */
3277 expr
= build2 (COMPOUND_EXPR
, void_type_node
, head
, expr
);
3279 if (flags
& LOOKUP_DESTRUCTOR
)
3280 /* Explicit destructor call; don't check for null pointer. */
3281 ifexp
= integer_one_node
;
3283 /* Handle deleting a null pointer. */
3284 ifexp
= fold (cp_build_binary_op (input_location
,
3285 NE_EXPR
, addr
, integer_zero_node
,
3286 tf_warning_or_error
));
3288 if (ifexp
!= integer_one_node
)
3289 expr
= build3 (COND_EXPR
, void_type_node
,
3290 ifexp
, expr
, void_zero_node
);
3296 /* At the beginning of a destructor, push cleanups that will call the
3297 destructors for our base classes and members.
3299 Called from begin_destructor_body. */
3302 push_base_cleanups (void)
3304 tree binfo
, base_binfo
;
3308 VEC(tree
,gc
) *vbases
;
3310 /* Run destructors for all virtual baseclasses. */
3311 if (CLASSTYPE_VBASECLASSES (current_class_type
))
3313 tree cond
= (condition_conversion
3314 (build2 (BIT_AND_EXPR
, integer_type_node
,
3315 current_in_charge_parm
,
3316 integer_two_node
)));
3318 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3319 order, which is also the right order for pushing cleanups. */
3320 for (vbases
= CLASSTYPE_VBASECLASSES (current_class_type
), i
= 0;
3321 VEC_iterate (tree
, vbases
, i
, base_binfo
); i
++)
3323 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
3325 expr
= build_special_member_call (current_class_ref
,
3326 base_dtor_identifier
,
3330 | LOOKUP_NONVIRTUAL
),
3331 tf_warning_or_error
);
3332 expr
= build3 (COND_EXPR
, void_type_node
, cond
,
3333 expr
, void_zero_node
);
3334 finish_decl_cleanup (NULL_TREE
, expr
);
3339 /* Take care of the remaining baseclasses. */
3340 for (binfo
= TYPE_BINFO (current_class_type
), i
= 0;
3341 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
3343 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo
))
3344 || BINFO_VIRTUAL_P (base_binfo
))
3347 expr
= build_special_member_call (current_class_ref
,
3348 base_dtor_identifier
,
3350 LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
,
3351 tf_warning_or_error
);
3352 finish_decl_cleanup (NULL_TREE
, expr
);
3355 for (member
= TYPE_FIELDS (current_class_type
); member
;
3356 member
= TREE_CHAIN (member
))
3358 if (TREE_TYPE (member
) == error_mark_node
3359 || TREE_CODE (member
) != FIELD_DECL
3360 || DECL_ARTIFICIAL (member
))
3362 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member
)))
3364 tree this_member
= (build_class_member_access_expr
3365 (current_class_ref
, member
,
3366 /*access_path=*/NULL_TREE
,
3367 /*preserve_reference=*/false,
3368 tf_warning_or_error
));
3369 tree this_type
= TREE_TYPE (member
);
3370 expr
= build_delete (this_type
, this_member
,
3371 sfk_complete_destructor
,
3372 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
3374 finish_decl_cleanup (NULL_TREE
, expr
);
3379 /* Build a C++ vector delete expression.
3380 MAXINDEX is the number of elements to be deleted.
3381 ELT_SIZE is the nominal size of each element in the vector.
3382 BASE is the expression that should yield the store to be deleted.
3383 This function expands (or synthesizes) these calls itself.
3384 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3386 This also calls delete for virtual baseclasses of elements of the vector.
3388 Update: MAXINDEX is no longer needed. The size can be extracted from the
3389 start of the vector for pointers, and from the type for arrays. We still
3390 use MAXINDEX for arrays because it happens to already have one of the
3391 values we'd have to extract. (We could use MAXINDEX with pointers to
3392 confirm the size, and trap if the numbers differ; not clear that it'd
3393 be worth bothering.) */
3396 build_vec_delete (tree base
, tree maxindex
,
3397 special_function_kind auto_delete_vec
, int use_global_delete
)
3401 tree base_init
= NULL_TREE
;
3403 type
= TREE_TYPE (base
);
3405 if (TREE_CODE (type
) == POINTER_TYPE
)
3407 /* Step back one from start of vector, and read dimension. */
3409 tree size_ptr_type
= build_pointer_type (sizetype
);
3411 if (TREE_SIDE_EFFECTS (base
))
3413 base_init
= get_target_expr (base
);
3414 base
= TARGET_EXPR_SLOT (base_init
);
3416 type
= strip_array_types (TREE_TYPE (type
));
3417 cookie_addr
= fold_build1_loc (input_location
, NEGATE_EXPR
,
3418 sizetype
, TYPE_SIZE_UNIT (sizetype
));
3419 cookie_addr
= build2 (POINTER_PLUS_EXPR
,
3421 fold_convert (size_ptr_type
, base
),
3423 maxindex
= cp_build_indirect_ref (cookie_addr
, RO_NULL
, tf_warning_or_error
);
3425 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3427 /* Get the total number of things in the array, maxindex is a
3429 maxindex
= array_type_nelts_total (type
);
3430 type
= strip_array_types (type
);
3431 base
= cp_build_unary_op (ADDR_EXPR
, base
, 1, tf_warning_or_error
);
3432 if (TREE_SIDE_EFFECTS (base
))
3434 base_init
= get_target_expr (base
);
3435 base
= TARGET_EXPR_SLOT (base_init
);
3440 if (base
!= error_mark_node
)
3441 error ("type to vector delete is neither pointer or array type");
3442 return error_mark_node
;
3445 rval
= build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
,
3448 rval
= build2 (COMPOUND_EXPR
, TREE_TYPE (rval
), base_init
, rval
);