]>
Commit | Line | Data |
---|---|---|
471086d6 | 1 | /* Handle initialization things in C++. |
107c7f39 | 2 | Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
2bc64004 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 |
66723563 | 4 | Free Software Foundation, Inc. |
471086d6 | 5 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
6 | ||
6f0d25a6 | 7 | This file is part of GCC. |
471086d6 | 8 | |
6f0d25a6 | 9 | GCC is free software; you can redistribute it and/or modify |
471086d6 | 10 | it under the terms of the GNU General Public License as published by |
aa139c3f | 11 | the Free Software Foundation; either version 3, or (at your option) |
471086d6 | 12 | any later version. |
13 | ||
6f0d25a6 | 14 | GCC is distributed in the hope that it will be useful, |
471086d6 | 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. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
aa139c3f | 20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
471086d6 | 22 | |
96624a9e | 23 | /* High-level class interface. */ |
471086d6 | 24 | |
25 | #include "config.h" | |
b3ef7553 | 26 | #include "system.h" |
805e22b2 | 27 | #include "coretypes.h" |
28 | #include "tm.h" | |
471086d6 | 29 | #include "tree.h" |
471086d6 | 30 | #include "cp-tree.h" |
31 | #include "flags.h" | |
3f7d79e4 | 32 | #include "output.h" |
2a4e40b0 | 33 | #include "toplev.h" |
600f4be7 | 34 | #include "target.h" |
471086d6 | 35 | |
4bd132ff | 36 | static bool begin_init_stmts (tree *, tree *); |
37 | static tree finish_init_stmts (bool, tree, tree); | |
6507cda8 | 38 | static void construct_virtual_base (tree, tree); |
ebd21de4 | 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); | |
6c5ad428 | 41 | static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int); |
6507cda8 | 42 | static void perform_member_init (tree, tree); |
6c5ad428 | 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); | |
6507cda8 | 46 | static tree sort_mem_initializers (tree, tree); |
6c5ad428 | 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 *); | |
6c5ad428 | 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); | |
fa60f42b | 54 | static int diagnose_uninitialized_cst_or_ref_member_1 (tree, tree, bool, bool); |
471086d6 | 55 | |
bb855ff9 | 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 | |
63 | complete. */ | |
64 | ||
4bd132ff | 65 | static bool |
6c5ad428 | 66 | begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p) |
bb855ff9 | 67 | { |
4bd132ff | 68 | bool is_global = !building_stmt_tree (); |
9031d10b | 69 | |
4bd132ff | 70 | *stmt_expr_p = begin_stmt_expr (); |
2363ef00 | 71 | *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE); |
4bd132ff | 72 | |
73 | return is_global; | |
bb855ff9 | 74 | } |
75 | ||
76 | /* Finish out the statement-expression begun by the previous call to | |
77 | begin_init_stmts. Returns the statement-expression itself. */ | |
78 | ||
4bd132ff | 79 | static tree |
80 | finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt) | |
9031d10b | 81 | { |
68f8f8cc | 82 | finish_compound_stmt (compound_stmt); |
9031d10b | 83 | |
face0cb7 | 84 | stmt_expr = finish_stmt_expr (stmt_expr, true); |
bb855ff9 | 85 | |
b4df430b | 86 | gcc_assert (!building_stmt_tree () == is_global); |
9031d10b | 87 | |
bb855ff9 | 88 | return stmt_expr; |
89 | } | |
90 | ||
91 | /* Constructors */ | |
92 | ||
4a2680fc | 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. */ | |
b0722fac | 96 | |
a3a903ef | 97 | static tree |
6c5ad428 | 98 | dfs_initialize_vtbl_ptrs (tree binfo, void *data) |
a3a903ef | 99 | { |
398b91ef | 100 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
101 | return dfs_skip_bases; | |
9031d10b | 102 | |
398b91ef | 103 | if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo)) |
a3a903ef | 104 | { |
105 | tree base_ptr = TREE_VALUE ((tree) data); | |
b0722fac | 106 | |
4a2680fc | 107 | base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1); |
a3a903ef | 108 | |
109 | expand_virtual_init (binfo, base_ptr); | |
110 | } | |
b0722fac | 111 | |
a3a903ef | 112 | return NULL_TREE; |
113 | } | |
114 | ||
9e92dee9 | 115 | /* Initialize all the vtable pointers in the object pointed to by |
116 | ADDR. */ | |
96624a9e | 117 | |
471086d6 | 118 | void |
6c5ad428 | 119 | initialize_vtbl_ptrs (tree addr) |
471086d6 | 120 | { |
9e92dee9 | 121 | tree list; |
122 | tree type; | |
123 | ||
124 | type = TREE_TYPE (TREE_TYPE (addr)); | |
125 | list = build_tree_list (type, addr); | |
a3a903ef | 126 | |
b53fb33d | 127 | /* Walk through the hierarchy, initializing the vptr in each base |
5f1653d2 | 128 | class. We do these in pre-order because we can't find the virtual |
5ad590ad | 129 | bases for a class until we've initialized the vtbl for that |
130 | class. */ | |
398b91ef | 131 | dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list); |
471086d6 | 132 | } |
a3a903ef | 133 | |
23ed74d8 | 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 | |
e64c07b9 | 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 | |
5d3c3f21 | 143 | zero-initialization does not simply mean filling the storage with |
144 | zero bytes. */ | |
e63bd8ae | 145 | |
146 | tree | |
5d3c3f21 | 147 | build_zero_init (tree type, tree nelts, bool static_storage_p) |
e63bd8ae | 148 | { |
23ed74d8 | 149 | tree init = NULL_TREE; |
150 | ||
151 | /* [dcl.init] | |
152 | ||
930e8175 | 153 | To zero-initialize an object of type T means: |
23ed74d8 | 154 | |
155 | -- if T is a scalar type, the storage is set to the value of zero | |
653e5405 | 156 | converted to T. |
23ed74d8 | 157 | |
158 | -- if T is a non-union class type, the storage for each nonstatic | |
653e5405 | 159 | data member and each base-class subobject is zero-initialized. |
23ed74d8 | 160 | |
161 | -- if T is a union type, the storage for its first data member is | |
653e5405 | 162 | zero-initialized. |
23ed74d8 | 163 | |
164 | -- if T is an array type, the storage for each element is | |
653e5405 | 165 | zero-initialized. |
23ed74d8 | 166 | |
167 | -- if T is a reference type, no initialization is performed. */ | |
e63bd8ae | 168 | |
b4df430b | 169 | gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST); |
6e7144d5 | 170 | |
23ed74d8 | 171 | if (type == error_mark_node) |
172 | ; | |
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. */ | |
178 | ; | |
04791a75 | 179 | else if (SCALAR_TYPE_P (type)) |
23ed74d8 | 180 | init = convert (type, integer_zero_node); |
181 | else if (CLASS_TYPE_P (type)) | |
182 | { | |
183 | tree field; | |
c75b4594 | 184 | VEC(constructor_elt,gc) *v = NULL; |
23ed74d8 | 185 | |
23ed74d8 | 186 | /* Iterate over the fields, building initializations. */ |
23ed74d8 | 187 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) |
188 | { | |
189 | if (TREE_CODE (field) != FIELD_DECL) | |
190 | continue; | |
191 | ||
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. */ | |
62116ec3 | 196 | if (!static_storage_p || !zero_init_p (TREE_TYPE (field))) |
c75b4594 | 197 | { |
198 | tree value = build_zero_init (TREE_TYPE (field), | |
199 | /*nelts=*/NULL_TREE, | |
200 | static_storage_p); | |
e64c07b9 | 201 | if (value) |
202 | CONSTRUCTOR_APPEND_ELT(v, field, value); | |
c75b4594 | 203 | } |
23ed74d8 | 204 | |
205 | /* For unions, only the first field is initialized. */ | |
206 | if (TREE_CODE (type) == UNION_TYPE) | |
207 | break; | |
208 | } | |
c75b4594 | 209 | |
930e8175 | 210 | /* Build a constructor to contain the initializations. */ |
211 | init = build_constructor (type, v); | |
23ed74d8 | 212 | } |
213 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
e63bd8ae | 214 | { |
23ed74d8 | 215 | tree max_index; |
c75b4594 | 216 | VEC(constructor_elt,gc) *v = NULL; |
23ed74d8 | 217 | |
23ed74d8 | 218 | /* Iterate over the array elements, building initializations. */ |
6ffe4872 | 219 | if (nelts) |
389dd41b | 220 | max_index = fold_build2_loc (input_location, |
221 | MINUS_EXPR, TREE_TYPE (nelts), | |
b7837065 | 222 | nelts, integer_one_node); |
6ffe4872 | 223 | else |
224 | max_index = array_type_nelts (type); | |
5c638ac1 | 225 | |
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; | |
b4df430b | 230 | gcc_assert (TREE_CODE (max_index) == INTEGER_CST); |
6e7144d5 | 231 | |
8f034d15 | 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)) | |
93af82a0 | 235 | { |
c75b4594 | 236 | constructor_elt *ce; |
237 | ||
238 | v = VEC_alloc (constructor_elt, gc, 1); | |
239 | ce = VEC_quick_push (constructor_elt, v, NULL); | |
9031d10b | 240 | |
c47f5582 | 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)) | |
c75b4594 | 243 | ce->index = size_zero_node; |
c47f5582 | 244 | else |
c75b4594 | 245 | ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node, |
246 | max_index); | |
9031d10b | 247 | |
c75b4594 | 248 | ce->value = build_zero_init (TREE_TYPE (type), |
249 | /*nelts=*/NULL_TREE, | |
250 | static_storage_p); | |
93af82a0 | 251 | } |
9031d10b | 252 | |
c75b4594 | 253 | /* Build a constructor to contain the initializations. */ |
254 | init = build_constructor (type, v); | |
e63bd8ae | 255 | } |
00fe10b0 | 256 | else if (TREE_CODE (type) == VECTOR_TYPE) |
257 | init = fold_convert (type, integer_zero_node); | |
e63bd8ae | 258 | else |
092b1d6f | 259 | gcc_assert (TREE_CODE (type) == REFERENCE_TYPE); |
e63bd8ae | 260 | |
23ed74d8 | 261 | /* In all cases, the initializer is a constant. */ |
262 | if (init) | |
c7d4e749 | 263 | TREE_CONSTANT (init) = 1; |
e63bd8ae | 264 | |
265 | return init; | |
266 | } | |
267 | ||
930e8175 | 268 | /* Return a suitable initializer for value-initializing an object of type |
069304e3 | 269 | TYPE, as described in [dcl.init]. */ |
930e8175 | 270 | |
069304e3 | 271 | tree |
272 | build_value_init (tree type) | |
930e8175 | 273 | { |
274 | /* [dcl.init] | |
275 | ||
276 | To value-initialize an object of type T means: | |
277 | ||
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 | |
281 | constructor); | |
282 | ||
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) | |
286 | ||
287 | - if T is an array type, then each element is value-initialized; | |
288 | ||
289 | - otherwise, the object is zero-initialized. | |
290 | ||
291 | A program that calls for default-initialization or | |
292 | value-initialization of an entity of reference type is ill-formed. | |
293 | ||
294 | 92) Value-initialization for such a class object may be implemented by | |
295 | zero-initializing the object and then calling the default | |
296 | constructor. */ | |
297 | ||
298 | if (CLASS_TYPE_P (type)) | |
299 | { | |
069304e3 | 300 | if (type_has_user_provided_constructor (type)) |
0152e879 | 301 | return build_aggr_init_expr |
930e8175 | 302 | (type, |
303 | build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
f352a3fb | 304 | NULL, type, LOOKUP_NORMAL, |
ebd21de4 | 305 | tf_warning_or_error)); |
069304e3 | 306 | else if (TREE_CODE (type) != UNION_TYPE && TYPE_NEEDS_CONSTRUCTING (type)) |
307 | { | |
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. | |
a63dcad5 | 311 | This will be handled in simplify_aggr_init_expr. */ |
069304e3 | 312 | tree ctor = build_special_member_call |
313 | (NULL_TREE, complete_ctor_identifier, | |
f352a3fb | 314 | NULL, type, LOOKUP_NORMAL, tf_warning_or_error); |
069304e3 | 315 | |
a63dcad5 | 316 | ctor = build_aggr_init_expr (type, ctor); |
317 | AGGR_INIT_ZERO_FIRST (ctor) = 1; | |
069304e3 | 318 | return ctor; |
319 | } | |
daed64ba | 320 | } |
321 | return build_value_init_noctor (type); | |
322 | } | |
323 | ||
324 | /* Like build_value_init, but don't call the constructor for TYPE. Used | |
325 | for base initializers. */ | |
326 | ||
327 | tree | |
328 | build_value_init_noctor (tree type) | |
329 | { | |
330 | if (CLASS_TYPE_P (type)) | |
331 | { | |
332 | gcc_assert (!TYPE_NEEDS_CONSTRUCTING (type)); | |
333 | ||
334 | if (TREE_CODE (type) != UNION_TYPE) | |
930e8175 | 335 | { |
069304e3 | 336 | tree field; |
930e8175 | 337 | VEC(constructor_elt,gc) *v = NULL; |
930e8175 | 338 | |
339 | /* Iterate over the fields, building initializations. */ | |
340 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
341 | { | |
342 | tree ftype, value; | |
343 | ||
344 | if (TREE_CODE (field) != FIELD_DECL) | |
345 | continue; | |
346 | ||
347 | ftype = TREE_TYPE (field); | |
348 | ||
349 | if (TREE_CODE (ftype) == REFERENCE_TYPE) | |
350 | error ("value-initialization of reference"); | |
351 | ||
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. */ | |
357 | ||
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. */ | |
069304e3 | 362 | value = build_value_init (ftype); |
930e8175 | 363 | |
364 | if (value) | |
365 | CONSTRUCTOR_APPEND_ELT(v, field, value); | |
366 | } | |
367 | ||
368 | /* Build a constructor to contain the zero- initializations. */ | |
069304e3 | 369 | return build_constructor (type, v); |
930e8175 | 370 | } |
371 | } | |
372 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
373 | { | |
374 | VEC(constructor_elt,gc) *v = NULL; | |
375 | ||
376 | /* Iterate over the array elements, building initializations. */ | |
377 | tree max_index = array_type_nelts (type); | |
378 | ||
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); | |
384 | ||
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)) | |
388 | { | |
389 | constructor_elt *ce; | |
390 | ||
391 | v = VEC_alloc (constructor_elt, gc, 1); | |
392 | ce = VEC_quick_push (constructor_elt, v, NULL); | |
393 | ||
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; | |
397 | else | |
398 | ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node, | |
399 | max_index); | |
400 | ||
069304e3 | 401 | ce->value = build_value_init (TREE_TYPE (type)); |
4404dc82 | 402 | |
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); | |
930e8175 | 406 | } |
407 | ||
408 | /* Build a constructor to contain the initializations. */ | |
409 | return build_constructor (type, v); | |
410 | } | |
411 | ||
412 | return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false); | |
413 | } | |
414 | ||
6507cda8 | 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. */ | |
96624a9e | 418 | |
471086d6 | 419 | static void |
6507cda8 | 420 | perform_member_init (tree member, tree init) |
471086d6 | 421 | { |
422 | tree decl; | |
423 | tree type = TREE_TYPE (member); | |
6507cda8 | 424 | |
425 | /* Effective C++ rule 12 requires that all data members be | |
426 | initialized. */ | |
4404dc82 | 427 | if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE) |
712d2297 | 428 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__, |
429 | "%qD should be initialized in the member initialization list", | |
430 | member); | |
6507cda8 | 431 | |
6507cda8 | 432 | /* Get an lvalue for the data member. */ |
4ac852cb | 433 | decl = build_class_member_access_expr (current_class_ref, member, |
434 | /*access_path=*/NULL_TREE, | |
ebd21de4 | 435 | /*preserve_reference=*/true, |
436 | tf_warning_or_error); | |
812608b9 | 437 | if (decl == error_mark_node) |
438 | return; | |
439 | ||
4404dc82 | 440 | if (init == void_type_node) |
441 | { | |
442 | /* mem() means value-initialization. */ | |
443 | if (TREE_CODE (type) == ARRAY_TYPE) | |
a3ddabdc | 444 | { |
445 | init = build_vec_init (decl, NULL_TREE, NULL_TREE, | |
446 | /*explicit_value_init_p=*/true, | |
447 | /* from_array=*/0, | |
448 | tf_warning_or_error); | |
449 | finish_expr_stmt (init); | |
450 | } | |
4404dc82 | 451 | else |
452 | { | |
453 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
712d2297 | 454 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
455 | "value-initialization of %q#D, which has reference type", | |
456 | member); | |
a3ddabdc | 457 | else |
458 | { | |
459 | init = build2 (INIT_EXPR, type, decl, build_value_init (type)); | |
460 | finish_expr_stmt (init); | |
461 | } | |
4404dc82 | 462 | } |
4404dc82 | 463 | } |
128e1d72 | 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. */ | |
4404dc82 | 467 | else if (ANON_AGGR_TYPE_P (type)) |
128e1d72 | 468 | { |
c8470848 | 469 | if (init) |
470 | { | |
831d52a2 | 471 | init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init)); |
c8470848 | 472 | finish_expr_stmt (init); |
473 | } | |
128e1d72 | 474 | } |
e6517de8 | 475 | else if (TYPE_NEEDS_CONSTRUCTING (type)) |
471086d6 | 476 | { |
4404dc82 | 477 | if (init != NULL_TREE |
471086d6 | 478 | && TREE_CODE (type) == ARRAY_TYPE |
471086d6 | 479 | && TREE_CHAIN (init) == NULL_TREE |
480 | && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE) | |
481 | { | |
482 | /* Initialization of one array from another. */ | |
0473b1af | 483 | finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init), |
0152e879 | 484 | /*explicit_value_init_p=*/false, |
ebd21de4 | 485 | /* from_array=*/1, |
486 | tf_warning_or_error)); | |
471086d6 | 487 | } |
488 | else | |
2336da2a | 489 | { |
490 | if (CP_TYPE_CONST_P (type) | |
491 | && init == NULL_TREE | |
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. */ | |
712d2297 | 495 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
496 | "uninitialized member %qD with %<const%> type %qT", | |
497 | member, type); | |
2336da2a | 498 | finish_expr_stmt (build_aggr_init (decl, init, 0, |
499 | tf_warning_or_error)); | |
500 | } | |
471086d6 | 501 | } |
502 | else | |
503 | { | |
504 | if (init == NULL_TREE) | |
505 | { | |
a0bbd07d | 506 | tree core_type; |
471086d6 | 507 | /* member traversal: note it leaves init NULL */ |
4404dc82 | 508 | if (TREE_CODE (type) == REFERENCE_TYPE) |
712d2297 | 509 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
510 | "uninitialized reference member %qD", | |
511 | member); | |
28bbd27a | 512 | else if (CP_TYPE_CONST_P (type)) |
712d2297 | 513 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
514 | "uninitialized member %qD with %<const%> type %qT", | |
515 | member, type); | |
a0bbd07d | 516 | |
517 | core_type = strip_array_types (type); | |
40ab1ef4 | 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, | |
fa60f42b | 522 | /*using_new=*/false, |
523 | /*complain=*/true); | |
471086d6 | 524 | } |
525 | else if (TREE_CODE (init) == TREE_LIST) | |
8a4008da | 526 | /* There was an explicit member initialization. Do some work |
527 | in that case. */ | |
183407ee | 528 | init = build_x_compound_expr_from_list (init, ELK_MEM_INIT); |
471086d6 | 529 | |
db9d2b2e | 530 | if (init) |
ebd21de4 | 531 | finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, |
532 | tf_warning_or_error)); | |
471086d6 | 533 | } |
c76251c1 | 534 | |
89e923d8 | 535 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
1e66592c | 536 | { |
1adc02a5 | 537 | tree expr; |
538 | ||
4ac852cb | 539 | expr = build_class_member_access_expr (current_class_ref, member, |
540 | /*access_path=*/NULL_TREE, | |
ebd21de4 | 541 | /*preserve_reference=*/false, |
542 | tf_warning_or_error); | |
0ce25b06 | 543 | expr = build_delete (type, expr, sfk_complete_destructor, |
1e66592c | 544 | LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0); |
545 | ||
546 | if (expr != error_mark_node) | |
a9bc793b | 547 | finish_eh_cleanup (expr); |
1e66592c | 548 | } |
471086d6 | 549 | } |
550 | ||
c8470848 | 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. */ | |
553 | ||
9031d10b | 554 | static tree |
6c5ad428 | 555 | build_field_list (tree t, tree list, int *uses_unions_p) |
c8470848 | 556 | { |
557 | tree fields; | |
558 | ||
c07ea2ad | 559 | *uses_unions_p = 0; |
560 | ||
c8470848 | 561 | /* Note whether or not T is a union. */ |
562 | if (TREE_CODE (t) == UNION_TYPE) | |
563 | *uses_unions_p = 1; | |
564 | ||
565 | for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields)) | |
566 | { | |
567 | /* Skip CONST_DECLs for enumeration constants and so forth. */ | |
23ed74d8 | 568 | if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields)) |
c8470848 | 569 | continue; |
9031d10b | 570 | |
c8470848 | 571 | /* Keep track of whether or not any fields are unions. */ |
572 | if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE) | |
573 | *uses_unions_p = 1; | |
574 | ||
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))) | |
579 | { | |
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. */ | |
9031d10b | 584 | list = build_field_list (TREE_TYPE (fields), list, |
c8470848 | 585 | uses_unions_p); |
586 | } | |
587 | /* Add this field. */ | |
588 | else if (DECL_NAME (fields)) | |
589 | list = tree_cons (fields, NULL_TREE, list); | |
590 | } | |
591 | ||
592 | return list; | |
593 | } | |
594 | ||
6507cda8 | 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. | |
598 | ||
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. */ | |
96624a9e | 602 | |
471086d6 | 603 | static tree |
6507cda8 | 604 | sort_mem_initializers (tree t, tree mem_inits) |
471086d6 | 605 | { |
c8470848 | 606 | tree init; |
f6cc6a08 | 607 | tree base, binfo, base_binfo; |
6507cda8 | 608 | tree sorted_inits; |
609 | tree next_subobject; | |
046bfc77 | 610 | VEC(tree,gc) *vbases; |
6507cda8 | 611 | int i; |
c8470848 | 612 | int uses_unions_p; |
613 | ||
6507cda8 | 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; | |
9031d10b | 619 | |
6507cda8 | 620 | /* Process the virtual bases. */ |
930bdacf | 621 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
622 | VEC_iterate (tree, vbases, i, base); i++) | |
97c118b9 | 623 | sorted_inits = tree_cons (base, NULL_TREE, sorted_inits); |
9031d10b | 624 | |
6507cda8 | 625 | /* Process the direct bases. */ |
f6cc6a08 | 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); | |
630 | ||
6507cda8 | 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); | |
636 | ||
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; | |
642 | ||
643 | /* Go through the explicit initializers, filling in TREE_PURPOSE in | |
644 | the SORTED_INITS. */ | |
645 | for (init = mem_inits; init; init = TREE_CHAIN (init)) | |
646 | { | |
647 | tree subobject; | |
648 | tree subobject_init; | |
649 | ||
650 | subobject = TREE_PURPOSE (init); | |
651 | ||
652 | /* If the explicit initializers are in sorted order, then | |
9031d10b | 653 | SUBOBJECT will be NEXT_SUBOBJECT, or something following |
6507cda8 | 654 | it. */ |
9031d10b | 655 | for (subobject_init = next_subobject; |
656 | subobject_init; | |
6507cda8 | 657 | subobject_init = TREE_CHAIN (subobject_init)) |
658 | if (TREE_PURPOSE (subobject_init) == subobject) | |
c8470848 | 659 | break; |
660 | ||
6507cda8 | 661 | /* Issue a warning if the explicit initializer order does not |
b9dd3954 | 662 | match that which will actually occur. |
653e5405 | 663 | ??? Are all these on the correct lines? */ |
6507cda8 | 664 | if (warn_reorder && !subobject_init) |
c8470848 | 665 | { |
6507cda8 | 666 | if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL) |
ced7c954 | 667 | warning (OPT_Wreorder, "%q+D will be initialized after", |
3cf8b391 | 668 | TREE_PURPOSE (next_subobject)); |
6507cda8 | 669 | else |
ced7c954 | 670 | warning (OPT_Wreorder, "base %qT will be initialized after", |
6507cda8 | 671 | TREE_PURPOSE (next_subobject)); |
672 | if (TREE_CODE (subobject) == FIELD_DECL) | |
ced7c954 | 673 | warning (OPT_Wreorder, " %q+#D", subobject); |
6507cda8 | 674 | else |
ced7c954 | 675 | warning (OPT_Wreorder, " base %qT", subobject); |
712d2297 | 676 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), |
677 | OPT_Wreorder, " when initialized here"); | |
c8470848 | 678 | } |
1e66592c | 679 | |
6507cda8 | 680 | /* Look again, from the beginning of the list. */ |
681 | if (!subobject_init) | |
c8470848 | 682 | { |
6507cda8 | 683 | subobject_init = sorted_inits; |
684 | while (TREE_PURPOSE (subobject_init) != subobject) | |
685 | subobject_init = TREE_CHAIN (subobject_init); | |
c8470848 | 686 | } |
9031d10b | 687 | |
6507cda8 | 688 | /* It is invalid to initialize the same subobject more than |
689 | once. */ | |
690 | if (TREE_VALUE (subobject_init)) | |
c8470848 | 691 | { |
6507cda8 | 692 | if (TREE_CODE (subobject) == FIELD_DECL) |
712d2297 | 693 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
694 | "multiple initializations given for %qD", | |
695 | subobject); | |
6507cda8 | 696 | else |
712d2297 | 697 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
698 | "multiple initializations given for base %qT", | |
699 | subobject); | |
c8470848 | 700 | } |
701 | ||
6507cda8 | 702 | /* Record the initialization. */ |
703 | TREE_VALUE (subobject_init) = TREE_VALUE (init); | |
704 | next_subobject = subobject_init; | |
c8470848 | 705 | } |
706 | ||
707 | /* [class.base.init] | |
1e66592c | 708 | |
c8470848 | 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. */ | |
712 | if (uses_unions_p) | |
713 | { | |
6507cda8 | 714 | tree last_field = NULL_TREE; |
715 | for (init = sorted_inits; init; init = TREE_CHAIN (init)) | |
471086d6 | 716 | { |
c8470848 | 717 | tree field; |
718 | tree field_type; | |
719 | int done; | |
720 | ||
6507cda8 | 721 | /* Skip uninitialized members and base classes. */ |
9031d10b | 722 | if (!TREE_VALUE (init) |
6507cda8 | 723 | || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL) |
c8470848 | 724 | continue; |
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) | |
732 | break; | |
733 | /* If this field is not a member of a union, skip it. */ | |
734 | if (TREE_CODE (field_type) != UNION_TYPE) | |
471086d6 | 735 | continue; |
471086d6 | 736 | |
c8470848 | 737 | /* It's only an error if we have two initializers for the same |
738 | union type. */ | |
739 | if (!last_field) | |
128e1d72 | 740 | { |
c8470848 | 741 | last_field = field; |
742 | continue; | |
128e1d72 | 743 | } |
471086d6 | 744 | |
c8470848 | 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: | |
471086d6 | 749 | |
c8470848 | 750 | union { struct { int i; int j; }; }; |
751 | ||
752 | initializing both `i' and `j' makes sense. */ | |
753 | field_type = DECL_CONTEXT (field); | |
754 | done = 0; | |
755 | do | |
471086d6 | 756 | { |
c8470848 | 757 | tree last_field_type; |
758 | ||
759 | last_field_type = DECL_CONTEXT (last_field); | |
760 | while (1) | |
6495357a | 761 | { |
c8470848 | 762 | if (same_type_p (last_field_type, field_type)) |
6495357a | 763 | { |
c8470848 | 764 | if (TREE_CODE (field_type) == UNION_TYPE) |
712d2297 | 765 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
766 | "initializations for multiple members of %qT", | |
767 | last_field_type); | |
c8470848 | 768 | done = 1; |
769 | break; | |
6495357a | 770 | } |
471086d6 | 771 | |
c8470848 | 772 | if (same_type_p (last_field_type, t)) |
773 | break; | |
471086d6 | 774 | |
c8470848 | 775 | last_field_type = TYPE_CONTEXT (last_field_type); |
776 | } | |
9031d10b | 777 | |
c8470848 | 778 | /* If we've reached the outermost class, then we're |
779 | done. */ | |
780 | if (same_type_p (field_type, t)) | |
781 | break; | |
471086d6 | 782 | |
c8470848 | 783 | field_type = TYPE_CONTEXT (field_type); |
471086d6 | 784 | } |
c8470848 | 785 | while (!done); |
786 | ||
787 | last_field = field; | |
1e66592c | 788 | } |
789 | } | |
471086d6 | 790 | |
6507cda8 | 791 | return sorted_inits; |
1e66592c | 792 | } |
793 | ||
6507cda8 | 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. */ | |
d0622bdf | 800 | |
bb855ff9 | 801 | void |
6507cda8 | 802 | emit_mem_initializers (tree mem_inits) |
471086d6 | 803 | { |
41dbd8dc | 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)) | |
807 | return; | |
9031d10b | 808 | |
6507cda8 | 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); | |
471086d6 | 812 | |
5f1653d2 | 813 | in_base_initializer = 1; |
9031d10b | 814 | |
6507cda8 | 815 | /* Initialize base classes. */ |
9031d10b | 816 | while (mem_inits |
6507cda8 | 817 | && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL) |
471086d6 | 818 | { |
6507cda8 | 819 | tree subobject = TREE_PURPOSE (mem_inits); |
820 | tree arguments = TREE_VALUE (mem_inits); | |
821 | ||
ef3265ff | 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). */ | |
9031d10b | 826 | if (extra_warnings && !arguments |
6507cda8 | 827 | && DECL_COPY_CONSTRUCTOR_P (current_function_decl) |
ef3265ff | 828 | && type_has_user_nondefault_constructor (BINFO_TYPE (subobject))) |
712d2297 | 829 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Wextra, |
830 | "base class %q#T should be explicitly initialized in the " | |
831 | "copy constructor", | |
832 | BINFO_TYPE (subobject)); | |
6507cda8 | 833 | |
6507cda8 | 834 | /* Initialize the base. */ |
57c28194 | 835 | if (BINFO_VIRTUAL_P (subobject)) |
6507cda8 | 836 | construct_virtual_base (subobject, arguments); |
837 | else | |
1e66592c | 838 | { |
6507cda8 | 839 | tree base_addr; |
9031d10b | 840 | |
6507cda8 | 841 | base_addr = build_base_path (PLUS_EXPR, current_class_ptr, |
842 | subobject, 1); | |
843 | expand_aggr_init_1 (subobject, NULL_TREE, | |
f08923b3 | 844 | cp_build_indirect_ref (base_addr, RO_NULL, |
ebd21de4 | 845 | tf_warning_or_error), |
6507cda8 | 846 | arguments, |
ebd21de4 | 847 | LOOKUP_NORMAL, |
848 | tf_warning_or_error); | |
6507cda8 | 849 | expand_cleanup_for_base (subobject, NULL_TREE); |
471086d6 | 850 | } |
471086d6 | 851 | |
6507cda8 | 852 | mem_inits = TREE_CHAIN (mem_inits); |
471086d6 | 853 | } |
5f1653d2 | 854 | in_base_initializer = 0; |
471086d6 | 855 | |
6507cda8 | 856 | /* Initialize the vptrs. */ |
9e92dee9 | 857 | initialize_vtbl_ptrs (current_class_ptr); |
9031d10b | 858 | |
6507cda8 | 859 | /* Initialize the data members. */ |
860 | while (mem_inits) | |
471086d6 | 861 | { |
6507cda8 | 862 | perform_member_init (TREE_PURPOSE (mem_inits), |
863 | TREE_VALUE (mem_inits)); | |
864 | mem_inits = TREE_CHAIN (mem_inits); | |
1e66592c | 865 | } |
471086d6 | 866 | } |
867 | ||
0ce25b06 | 868 | /* Returns the address of the vtable (i.e., the value that should be |
869 | assigned to the vptr) for BINFO. */ | |
870 | ||
871 | static tree | |
6c5ad428 | 872 | build_vtbl_address (tree binfo) |
0ce25b06 | 873 | { |
f235209b | 874 | tree binfo_for = binfo; |
0ce25b06 | 875 | tree vtbl; |
876 | ||
eea75c62 | 877 | if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo)) |
f235209b | 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 | |
882 | can be different. */ | |
eea75c62 | 883 | while (BINFO_PRIMARY_P (binfo_for)) |
884 | binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for); | |
f235209b | 885 | |
0ce25b06 | 886 | /* Figure out what vtable BINFO's vtable is based on, and mark it as |
887 | used. */ | |
f235209b | 888 | vtbl = get_vtbl_decl_for_binfo (binfo_for); |
0ce25b06 | 889 | TREE_USED (vtbl) = 1; |
890 | ||
891 | /* Now compute the address to use when initializing the vptr. */ | |
4ee9c684 | 892 | vtbl = unshare_expr (BINFO_VTABLE (binfo_for)); |
0ce25b06 | 893 | if (TREE_CODE (vtbl) == VAR_DECL) |
4ee9c684 | 894 | vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl); |
0ce25b06 | 895 | |
896 | return vtbl; | |
897 | } | |
898 | ||
471086d6 | 899 | /* This code sets up the virtual function tables appropriate for |
900 | the pointer DECL. It is a one-ply initialization. | |
901 | ||
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. */ | |
96624a9e | 904 | |
0543e7a9 | 905 | static void |
6c5ad428 | 906 | expand_virtual_init (tree binfo, tree decl) |
471086d6 | 907 | { |
471086d6 | 908 | tree vtbl, vtbl_ptr; |
0ce25b06 | 909 | tree vtt_index; |
471086d6 | 910 | |
0ce25b06 | 911 | /* Compute the initializer for vptr. */ |
912 | vtbl = build_vtbl_address (binfo); | |
913 | ||
5ad590ad | 914 | /* We may get this vptr from a VTT, if this is a subobject |
915 | constructor or subobject destructor. */ | |
0ce25b06 | 916 | vtt_index = BINFO_VPTR_INDEX (binfo); |
917 | if (vtt_index) | |
918 | { | |
919 | tree vtbl2; | |
920 | tree vtt_parm; | |
921 | ||
922 | /* Compute the value to use, when there's a VTT. */ | |
dcbeb3ef | 923 | vtt_parm = current_vtt_parm; |
0de36bdb | 924 | vtbl2 = build2 (POINTER_PLUS_EXPR, |
9031d10b | 925 | TREE_TYPE (vtt_parm), |
831d52a2 | 926 | vtt_parm, |
927 | vtt_index); | |
f08923b3 | 928 | vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error); |
4ee9c684 | 929 | vtbl2 = convert (TREE_TYPE (vtbl), vtbl2); |
0ce25b06 | 930 | |
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. */ | |
9031d10b | 934 | vtbl = build3 (COND_EXPR, |
935 | TREE_TYPE (vtbl), | |
831d52a2 | 936 | build2 (EQ_EXPR, boolean_type_node, |
937 | current_in_charge_parm, integer_zero_node), | |
9031d10b | 938 | vtbl2, |
831d52a2 | 939 | vtbl); |
0ce25b06 | 940 | } |
d3cc25c3 | 941 | |
942 | /* Compute the location of the vtpr. */ | |
f08923b3 | 943 | vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL, |
ebd21de4 | 944 | tf_warning_or_error), |
4a2680fc | 945 | TREE_TYPE (binfo)); |
b4df430b | 946 | gcc_assert (vtbl_ptr != error_mark_node); |
471086d6 | 947 | |
d3cc25c3 | 948 | /* Assign the vtable to the vptr. */ |
a74e8896 | 949 | vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0); |
ebd21de4 | 950 | finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl, |
951 | tf_warning_or_error)); | |
471086d6 | 952 | } |
953 | ||
1fb2fa9c | 954 | /* If an exception is thrown in a constructor, those base classes already |
955 | constructed must be destroyed. This function creates the cleanup | |
dcd15001 | 956 | for BINFO, which has just been constructed. If FLAG is non-NULL, |
3160db1d | 957 | it is a DECL which is nonzero when this base needs to be |
dcd15001 | 958 | destroyed. */ |
1fb2fa9c | 959 | |
960 | static void | |
6c5ad428 | 961 | expand_cleanup_for_base (tree binfo, tree flag) |
1fb2fa9c | 962 | { |
963 | tree expr; | |
964 | ||
89e923d8 | 965 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo))) |
1fb2fa9c | 966 | return; |
967 | ||
dcd15001 | 968 | /* Call the destructor. */ |
9031d10b | 969 | expr = build_special_member_call (current_class_ref, |
f70cb9e6 | 970 | base_dtor_identifier, |
f352a3fb | 971 | NULL, |
f70cb9e6 | 972 | binfo, |
ebd21de4 | 973 | LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, |
974 | tf_warning_or_error); | |
dcd15001 | 975 | if (flag) |
389dd41b | 976 | expr = fold_build3_loc (input_location, |
977 | COND_EXPR, void_type_node, | |
8e70fb09 | 978 | c_common_truthvalue_conversion (input_location, flag), |
b7837065 | 979 | expr, integer_zero_node); |
dcd15001 | 980 | |
a9bc793b | 981 | finish_eh_cleanup (expr); |
1fb2fa9c | 982 | } |
983 | ||
6507cda8 | 984 | /* Construct the virtual base-class VBASE passing the ARGUMENTS to its |
985 | constructor. */ | |
96624a9e | 986 | |
471086d6 | 987 | static void |
6507cda8 | 988 | construct_virtual_base (tree vbase, tree arguments) |
471086d6 | 989 | { |
6507cda8 | 990 | tree inner_if_stmt; |
6507cda8 | 991 | tree exp; |
9031d10b | 992 | tree flag; |
6507cda8 | 993 | |
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 | |
a17c2a3a | 1005 | in the outer block.) We trust the back end to figure out |
6507cda8 | 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); | |
6507cda8 | 1011 | |
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. */ | |
c1c5bfe2 | 1016 | exp = convert_to_base_statically (current_class_ref, vbase); |
1017 | ||
9031d10b | 1018 | expand_aggr_init_1 (vbase, current_class_ref, exp, arguments, |
ebd21de4 | 1019 | LOOKUP_COMPLAIN, tf_warning_or_error); |
6507cda8 | 1020 | finish_then_clause (inner_if_stmt); |
2363ef00 | 1021 | finish_if_stmt (inner_if_stmt); |
6507cda8 | 1022 | |
1023 | expand_cleanup_for_base (vbase, flag); | |
471086d6 | 1024 | } |
1025 | ||
de9554eb | 1026 | /* Find the context in which this FIELD can be initialized. */ |
96624a9e | 1027 | |
de9554eb | 1028 | static tree |
6c5ad428 | 1029 | initializing_context (tree field) |
de9554eb | 1030 | { |
1031 | tree t = DECL_CONTEXT (field); | |
1032 | ||
1033 | /* Anonymous union members can be initialized in the first enclosing | |
1034 | non-anonymous union context. */ | |
128e1d72 | 1035 | while (t && ANON_AGGR_TYPE_P (t)) |
de9554eb | 1036 | t = TYPE_CONTEXT (t); |
1037 | return t; | |
1038 | } | |
1039 | ||
471086d6 | 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. | |
3d4e092a | 1043 | FIELD must be a member of TYPE. |
9031d10b | 1044 | |
471086d6 | 1045 | MEMBER_NAME is the name of the member. */ |
1046 | ||
1047 | static int | |
6c5ad428 | 1048 | member_init_ok_or_else (tree field, tree type, tree member_name) |
471086d6 | 1049 | { |
1050 | if (field == error_mark_node) | |
1051 | return 0; | |
0a3b29ad | 1052 | if (!field) |
471086d6 | 1053 | { |
05949fae | 1054 | error ("class %qT does not have any field named %qD", type, |
0a3b29ad | 1055 | member_name); |
471086d6 | 1056 | return 0; |
1057 | } | |
0a3b29ad | 1058 | if (TREE_CODE (field) == VAR_DECL) |
1e66592c | 1059 | { |
05949fae | 1060 | error ("%q#D is a static data member; it can only be " |
0a3b29ad | 1061 | "initialized at its definition", |
1062 | field); | |
1063 | return 0; | |
1064 | } | |
1065 | if (TREE_CODE (field) != FIELD_DECL) | |
1066 | { | |
05949fae | 1067 | error ("%q#D is not a non-static data member of %qT", |
0a3b29ad | 1068 | field, type); |
1069 | return 0; | |
1070 | } | |
1071 | if (initializing_context (field) != type) | |
1072 | { | |
05949fae | 1073 | error ("class %qT does not have any field named %qD", type, |
0a3b29ad | 1074 | member_name); |
1e66592c | 1075 | return 0; |
1076 | } | |
1077 | ||
471086d6 | 1078 | return 1; |
1079 | } | |
1080 | ||
6507cda8 | 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. | |
5f1653d2 | 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 | |
6507cda8 | 1085 | NULL_TREE and issue a diagnostic. |
471086d6 | 1086 | |
4e7d3e4d | 1087 | An old style unnamed direct single base construction is permitted, |
1088 | where NAME is NULL. */ | |
471086d6 | 1089 | |
bc577f39 | 1090 | tree |
5f1653d2 | 1091 | expand_member_init (tree name) |
471086d6 | 1092 | { |
6507cda8 | 1093 | tree basetype; |
1094 | tree field; | |
471086d6 | 1095 | |
6507cda8 | 1096 | if (!current_class_ref) |
bc577f39 | 1097 | return NULL_TREE; |
471086d6 | 1098 | |
4e7d3e4d | 1099 | if (!name) |
8b1e0315 | 1100 | { |
4e7d3e4d | 1101 | /* This is an obsolete unnamed base class initializer. The |
1102 | parser will already have warned about its use. */ | |
2cfde4f3 | 1103 | switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type))) |
4e7d3e4d | 1104 | { |
1105 | case 0: | |
05949fae | 1106 | error ("unnamed initializer for %qT, which has no base classes", |
6507cda8 | 1107 | current_class_type); |
4e7d3e4d | 1108 | return NULL_TREE; |
1109 | case 1: | |
2cfde4f3 | 1110 | basetype = BINFO_TYPE |
1111 | (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0)); | |
4e7d3e4d | 1112 | break; |
1113 | default: | |
05949fae | 1114 | error ("unnamed initializer for %qT, which uses multiple inheritance", |
6507cda8 | 1115 | current_class_type); |
4e7d3e4d | 1116 | return NULL_TREE; |
1117 | } | |
8b1e0315 | 1118 | } |
4e7d3e4d | 1119 | else if (TYPE_P (name)) |
652e1a2d | 1120 | { |
d085a847 | 1121 | basetype = TYPE_MAIN_VARIANT (name); |
4e7d3e4d | 1122 | name = TYPE_NAME (name); |
652e1a2d | 1123 | } |
4e7d3e4d | 1124 | else if (TREE_CODE (name) == TYPE_DECL) |
1125 | basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name)); | |
6507cda8 | 1126 | else |
1127 | basetype = NULL_TREE; | |
471086d6 | 1128 | |
4e7d3e4d | 1129 | if (basetype) |
bf356568 | 1130 | { |
f7a7eabc | 1131 | tree class_binfo; |
1132 | tree direct_binfo; | |
1133 | tree virtual_binfo; | |
1134 | int i; | |
6507cda8 | 1135 | |
4e7d3e4d | 1136 | if (current_template_parms) |
5f1653d2 | 1137 | return basetype; |
6507cda8 | 1138 | |
f7a7eabc | 1139 | class_binfo = TYPE_BINFO (current_class_type); |
1140 | direct_binfo = NULL_TREE; | |
1141 | virtual_binfo = NULL_TREE; | |
1142 | ||
1143 | /* Look for a direct base. */ | |
f6cc6a08 | 1144 | for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i) |
5e8d5ca1 | 1145 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype)) |
f6cc6a08 | 1146 | break; |
1147 | ||
f7a7eabc | 1148 | /* Look for a virtual base -- unless the direct base is itself |
1149 | virtual. */ | |
57c28194 | 1150 | if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo)) |
97c118b9 | 1151 | virtual_binfo = binfo_for_vbase (basetype, current_class_type); |
f7a7eabc | 1152 | |
1153 | /* [class.base.init] | |
9031d10b | 1154 | |
653e5405 | 1155 | If a mem-initializer-id is ambiguous because it designates |
f7a7eabc | 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) | |
1159 | { | |
05949fae | 1160 | error ("%qD is both a direct base and an indirect virtual base", |
f7a7eabc | 1161 | basetype); |
1162 | return NULL_TREE; | |
1163 | } | |
1164 | ||
1165 | if (!direct_binfo && !virtual_binfo) | |
471086d6 | 1166 | { |
1f0b839e | 1167 | if (CLASSTYPE_VBASECLASSES (current_class_type)) |
6c3d4e0b | 1168 | error ("type %qT is not a direct or virtual base of %qT", |
1169 | basetype, current_class_type); | |
bf356568 | 1170 | else |
6c3d4e0b | 1171 | error ("type %qT is not a direct base of %qT", |
1172 | basetype, current_class_type); | |
bc577f39 | 1173 | return NULL_TREE; |
bf356568 | 1174 | } |
f7a7eabc | 1175 | |
1176 | return direct_binfo ? direct_binfo : virtual_binfo; | |
bf356568 | 1177 | } |
1178 | else | |
1179 | { | |
6507cda8 | 1180 | if (TREE_CODE (name) == IDENTIFIER_NODE) |
b330805e | 1181 | field = lookup_field (current_class_type, name, 1, false); |
6507cda8 | 1182 | else |
1183 | field = name; | |
471086d6 | 1184 | |
6507cda8 | 1185 | if (member_init_ok_or_else (field, current_class_type, name)) |
5f1653d2 | 1186 | return field; |
bf356568 | 1187 | } |
bc577f39 | 1188 | |
6507cda8 | 1189 | return NULL_TREE; |
471086d6 | 1190 | } |
1191 | ||
1192 | /* This is like `expand_member_init', only it stores one aggregate | |
1193 | value into another. | |
1194 | ||
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. | |
ce28ee2e | 1198 | If INIT is not a parameter list for a constructor, then set |
1199 | LOOKUP_ONLYCONVERTING. | |
a74e8896 | 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. | |
471086d6 | 1202 | If `init' is a CONSTRUCTOR, then we emit a warning message, |
3748625f | 1203 | explaining that such initializations are invalid. |
471086d6 | 1204 | |
471086d6 | 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 | |
1208 | initialization. | |
1209 | ||
1210 | The virtual function table pointer cannot be set up here, because | |
1211 | we do not really know its type. | |
1212 | ||
471086d6 | 1213 | This never calls operator=(). |
1214 | ||
1215 | When initializing, nothing is CONST. | |
1216 | ||
1217 | A default copy constructor may have to be used to perform the | |
1218 | initialization. | |
1219 | ||
1220 | A constructor or a conversion operator may have to be used to | |
96624a9e | 1221 | perform the initialization, but not both, as it would be ambiguous. */ |
471086d6 | 1222 | |
b48733fd | 1223 | tree |
ebd21de4 | 1224 | build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain) |
471086d6 | 1225 | { |
b48733fd | 1226 | tree stmt_expr; |
1227 | tree compound_stmt; | |
1228 | int destroy_temps; | |
471086d6 | 1229 | tree type = TREE_TYPE (exp); |
1230 | int was_const = TREE_READONLY (exp); | |
ce28ee2e | 1231 | int was_volatile = TREE_THIS_VOLATILE (exp); |
4bd132ff | 1232 | int is_global; |
471086d6 | 1233 | |
1234 | if (init == error_mark_node) | |
b48733fd | 1235 | return error_mark_node; |
471086d6 | 1236 | |
1237 | TREE_READONLY (exp) = 0; | |
ce28ee2e | 1238 | TREE_THIS_VOLATILE (exp) = 0; |
1239 | ||
f955934c | 1240 | if (init && TREE_CODE (init) != TREE_LIST |
1241 | && !(BRACE_ENCLOSED_INITIALIZER_P (init) | |
1242 | && CONSTRUCTOR_IS_DIRECT_INIT (init))) | |
ce28ee2e | 1243 | flags |= LOOKUP_ONLYCONVERTING; |
471086d6 | 1244 | |
1245 | if (TREE_CODE (type) == ARRAY_TYPE) | |
1246 | { | |
edbb6c80 | 1247 | tree itype; |
1248 | ||
e6517de8 | 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) | |
471086d6 | 1252 | { |
ebd21de4 | 1253 | if (complain & tf_error) |
1254 | error ("bad array initializer"); | |
b48733fd | 1255 | return error_mark_node; |
471086d6 | 1256 | } |
e6517de8 | 1257 | /* Must arrange to initialize each element of EXP |
1258 | from elements of INIT. */ | |
edbb6c80 | 1259 | itype = init ? TREE_TYPE (init) : NULL_TREE; |
f3943982 | 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); | |
0473b1af | 1264 | stmt_expr = build_vec_init (exp, NULL_TREE, init, |
0152e879 | 1265 | /*explicit_value_init_p=*/false, |
f3943982 | 1266 | itype && same_type_p (TREE_TYPE (init), |
ebd21de4 | 1267 | TREE_TYPE (exp)), |
1268 | complain); | |
471086d6 | 1269 | TREE_READONLY (exp) = was_const; |
ce28ee2e | 1270 | TREE_THIS_VOLATILE (exp) = was_volatile; |
471086d6 | 1271 | TREE_TYPE (exp) = type; |
c38086bd | 1272 | if (init) |
1273 | TREE_TYPE (init) = itype; | |
b48733fd | 1274 | return stmt_expr; |
471086d6 | 1275 | } |
1276 | ||
1277 | if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL) | |
331bc0ad | 1278 | /* Just know that we've seen something for this node. */ |
471086d6 | 1279 | TREE_USED (exp) = 1; |
1280 | ||
4bd132ff | 1281 | is_global = begin_init_stmts (&stmt_expr, &compound_stmt); |
5c3247a9 | 1282 | destroy_temps = stmts_are_full_exprs_p (); |
a08e60ae | 1283 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
471086d6 | 1284 | expand_aggr_init_1 (TYPE_BINFO (type), exp, exp, |
ebd21de4 | 1285 | init, LOOKUP_NORMAL|flags, complain); |
4bd132ff | 1286 | stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); |
a08e60ae | 1287 | current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; |
471086d6 | 1288 | TREE_READONLY (exp) = was_const; |
ce28ee2e | 1289 | TREE_THIS_VOLATILE (exp) = was_volatile; |
b48733fd | 1290 | |
1291 | return stmt_expr; | |
471086d6 | 1292 | } |
1293 | ||
1294 | static void | |
ebd21de4 | 1295 | expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags, |
1296 | tsubst_flags_t complain) | |
471086d6 | 1297 | { |
d2a15a12 | 1298 | tree type = TREE_TYPE (exp); |
cfb46e1f | 1299 | tree ctor_name; |
d2a15a12 | 1300 | |
471086d6 | 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. */ | |
1307 | tree rval; | |
f352a3fb | 1308 | VEC(tree,gc) *parms; |
471086d6 | 1309 | |
dbfcf378 | 1310 | if (init && BRACE_ENCLOSED_INITIALIZER_P (init) |
1311 | && CP_AGGREGATE_TYPE_P (type)) | |
1312 | { | |
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); | |
1319 | return; | |
1320 | } | |
1321 | ||
0a4be248 | 1322 | if (init && TREE_CODE (init) != TREE_LIST |
860740a7 | 1323 | && (flags & LOOKUP_ONLYCONVERTING)) |
1324 | { | |
1325 | /* Base subobjects should only get direct-initialization. */ | |
092b1d6f | 1326 | gcc_assert (true_exp == exp); |
860740a7 | 1327 | |
011310f7 | 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. */; | |
1334 | else | |
c4a8ac95 | 1335 | init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags); |
860740a7 | 1336 | |
bdb2219e | 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 | |
edf8c644 | 1340 | around the TARGET_EXPR for the copy constructor. See |
bdb2219e | 1341 | initialize_handler_parm. */ |
1342 | { | |
831d52a2 | 1343 | TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp, |
1344 | TREE_OPERAND (init, 0)); | |
bdb2219e | 1345 | TREE_TYPE (init) = void_type_node; |
1346 | } | |
edf8c644 | 1347 | else |
831d52a2 | 1348 | init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init); |
edf8c644 | 1349 | TREE_SIDE_EFFECTS (init) = 1; |
b48733fd | 1350 | finish_expr_stmt (init); |
860740a7 | 1351 | return; |
1352 | } | |
1353 | ||
f352a3fb | 1354 | if (init == NULL_TREE) |
1355 | parms = NULL; | |
1356 | else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init)) | |
471086d6 | 1357 | { |
f352a3fb | 1358 | parms = make_tree_vector (); |
1359 | for (; init != NULL_TREE; init = TREE_CHAIN (init)) | |
1360 | VEC_safe_push (tree, gc, parms, TREE_VALUE (init)); | |
471086d6 | 1361 | } |
471086d6 | 1362 | else |
f352a3fb | 1363 | parms = make_tree_vector_single (init); |
471086d6 | 1364 | |
cfb46e1f | 1365 | if (true_exp == exp) |
1366 | ctor_name = complete_ctor_identifier; | |
1367 | else | |
1368 | ctor_name = base_ctor_identifier; | |
471086d6 | 1369 | |
f352a3fb | 1370 | rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags, |
ebd21de4 | 1371 | complain); |
f352a3fb | 1372 | |
1373 | if (parms != NULL) | |
1374 | release_tree_vector (parms); | |
1375 | ||
3aa622aa | 1376 | if (TREE_SIDE_EFFECTS (rval)) |
ebd21de4 | 1377 | finish_expr_stmt (convert_to_void (rval, NULL, complain)); |
471086d6 | 1378 | } |
1379 | ||
1380 | /* This function is responsible for initializing EXP with INIT | |
1381 | (if any). | |
1382 | ||
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, | |
1385 | and C : A, 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. | |
1388 | ||
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. | |
1396 | ||
3c33f9f3 | 1397 | FLAGS is just passed to `build_new_method_call'. See that function |
1398 | for its description. */ | |
471086d6 | 1399 | |
1400 | static void | |
ebd21de4 | 1401 | expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags, |
1402 | tsubst_flags_t complain) | |
471086d6 | 1403 | { |
1404 | tree type = TREE_TYPE (exp); | |
471086d6 | 1405 | |
b4df430b | 1406 | gcc_assert (init != error_mark_node && type != error_mark_node); |
1407 | gcc_assert (building_stmt_tree ()); | |
471086d6 | 1408 | |
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 | |
1413 | as TARGET_EXPRs. */ | |
860740a7 | 1414 | |
1415 | if (init && TREE_CODE (exp) == VAR_DECL | |
79b01846 | 1416 | && COMPOUND_LITERAL_P (init)) |
860740a7 | 1417 | { |
b48733fd | 1418 | /* If store_init_value returns NULL_TREE, the INIT has been |
79b01846 | 1419 | recorded as the DECL_INITIAL for EXP. That means there's |
b48733fd | 1420 | nothing more we have to do. */ |
cf7aa2e5 | 1421 | init = store_init_value (exp, init, flags); |
3afe9b43 | 1422 | if (init) |
1423 | finish_expr_stmt (init); | |
860740a7 | 1424 | return; |
1425 | } | |
1426 | ||
daed64ba | 1427 | /* If an explicit -- but empty -- initializer list was present, |
1428 | that's value-initialization. */ | |
1429 | if (init == void_type_node) | |
1430 | { | |
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)) | |
1437 | { | |
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. */ | |
1442 | } | |
1443 | /* If we don't need to mess with the constructor at all, | |
1444 | then just zero out the object and we're done. */ | |
1445 | else | |
1446 | { | |
1447 | init = build2 (INIT_EXPR, type, exp, build_value_init_noctor (type)); | |
1448 | finish_expr_stmt (init); | |
1449 | return; | |
1450 | } | |
1451 | init = NULL_TREE; | |
1452 | } | |
1453 | ||
63b1d638 | 1454 | /* We know that expand_default_init can handle everything we want |
1455 | at this point. */ | |
ebd21de4 | 1456 | expand_default_init (binfo, true_exp, exp, init, flags, complain); |
471086d6 | 1457 | } |
1458 | ||
95397ff9 | 1459 | /* Report an error if TYPE is not a user-defined, class type. If |
652e1a2d | 1460 | OR_ELSE is nonzero, give an error message. */ |
96624a9e | 1461 | |
652e1a2d | 1462 | int |
95397ff9 | 1463 | is_class_type (tree type, int or_else) |
652e1a2d | 1464 | { |
1465 | if (type == error_mark_node) | |
1466 | return 0; | |
1467 | ||
95397ff9 | 1468 | if (! CLASS_TYPE_P (type)) |
652e1a2d | 1469 | { |
1470 | if (or_else) | |
95397ff9 | 1471 | error ("%qT is not a class type", type); |
652e1a2d | 1472 | return 0; |
1473 | } | |
1474 | return 1; | |
1475 | } | |
1476 | ||
471086d6 | 1477 | tree |
6c5ad428 | 1478 | get_type_value (tree name) |
471086d6 | 1479 | { |
471086d6 | 1480 | if (name == error_mark_node) |
1481 | return NULL_TREE; | |
1482 | ||
1483 | if (IDENTIFIER_HAS_TYPE_VALUE (name)) | |
1484 | return IDENTIFIER_TYPE_VALUE (name); | |
471086d6 | 1485 | else |
1486 | return NULL_TREE; | |
1487 | } | |
d0d8836b | 1488 | |
1bc16cab | 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 "&". | |
471086d6 | 1494 | |
1495 | @@ Prints out lousy diagnostics for operator <typename> | |
1496 | @@ fields. | |
1497 | ||
ac9386a0 | 1498 | @@ This function should be rewritten and placed in search.c. */ |
96624a9e | 1499 | |
471086d6 | 1500 | tree |
528638c9 | 1501 | build_offset_ref (tree type, tree member, bool address_p) |
471086d6 | 1502 | { |
120c0017 | 1503 | tree decl; |
d2a15a12 | 1504 | tree basebinfo = NULL_TREE; |
471086d6 | 1505 | |
7a623747 | 1506 | /* class templates can come in as TEMPLATE_DECLs here. */ |
528638c9 | 1507 | if (TREE_CODE (member) == TEMPLATE_DECL) |
1508 | return member; | |
1ac9b32b | 1509 | |
528638c9 | 1510 | if (dependent_type_p (type) || type_dependent_expression_p (member)) |
074ab442 | 1511 | return build_qualified_name (NULL_TREE, type, member, |
fbb01da7 | 1512 | /*template_p=*/false); |
e857e9c7 | 1513 | |
528638c9 | 1514 | gcc_assert (TYPE_P (type)); |
95397ff9 | 1515 | if (! is_class_type (type, 1)) |
feb98619 | 1516 | return error_mark_node; |
1517 | ||
528638c9 | 1518 | gcc_assert (DECL_P (member) || BASELINK_P (member)); |
1519 | /* Callers should call mark_used before this point. */ | |
411978d2 | 1520 | gcc_assert (!DECL_P (member) || TREE_USED (member)); |
652e1a2d | 1521 | |
869dcfe4 | 1522 | if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type))) |
471086d6 | 1523 | { |
528638c9 | 1524 | error ("incomplete type %qT does not have member %qD", type, member); |
1bc16cab | 1525 | return error_mark_node; |
1526 | } | |
1527 | ||
528638c9 | 1528 | /* Entities other than non-static members need no further |
074ab442 | 1529 | processing. */ |
1bc16cab | 1530 | if (TREE_CODE (member) == TYPE_DECL) |
528638c9 | 1531 | return member; |
1bc16cab | 1532 | if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL) |
528638c9 | 1533 | return convert_from_reference (member); |
1bc16cab | 1534 | |
1535 | if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member)) | |
1536 | { | |
05949fae | 1537 | error ("invalid pointer to bit-field %qD", member); |
1bc16cab | 1538 | return error_mark_node; |
1539 | } | |
1540 | ||
528638c9 | 1541 | /* Set up BASEBINFO for member lookup. */ |
1542 | decl = maybe_dummy_object (type, &basebinfo); | |
1543 | ||
c161288a | 1544 | /* A lot of this logic is now handled in lookup_member. */ |
1bc16cab | 1545 | if (BASELINK_P (member)) |
471086d6 | 1546 | { |
471086d6 | 1547 | /* Go from the TREE_BASELINK to the member function info. */ |
55acdbb2 | 1548 | tree t = BASELINK_FUNCTIONS (member); |
471086d6 | 1549 | |
4ac852cb | 1550 | if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t)) |
471086d6 | 1551 | { |
331bc0ad | 1552 | /* Get rid of a potential OVERLOAD around it. */ |
8417823c | 1553 | t = OVL_CURRENT (t); |
1554 | ||
3d5bde25 | 1555 | /* Unique functions are handled easily. */ |
1556 | ||
1557 | /* For non-static member of base class, we need a special rule | |
1558 | for access checking [class.protected]: | |
1559 | ||
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)) | |
579bb663 | 1565 | perform_or_defer_access_check (TYPE_BINFO (type), t, t); |
3d5bde25 | 1566 | else |
579bb663 | 1567 | perform_or_defer_access_check (basebinfo, t, t); |
3d5bde25 | 1568 | |
95b2ac55 | 1569 | if (DECL_STATIC_FUNCTION_P (t)) |
1570 | return t; | |
1bc16cab | 1571 | member = t; |
1572 | } | |
1573 | else | |
55acdbb2 | 1574 | TREE_TYPE (member) = unknown_type_node; |
471086d6 | 1575 | } |
3d5bde25 | 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. */ | |
579bb663 | 1580 | perform_or_defer_access_check (TYPE_BINFO (type), member, member); |
471086d6 | 1581 | |
1bc16cab | 1582 | if (!address_p) |
471086d6 | 1583 | { |
1bc16cab | 1584 | /* If MEMBER is non-static, then the program has fallen afoul of |
1585 | [expr.prim]: | |
471086d6 | 1586 | |
1bc16cab | 1587 | An id-expression that denotes a nonstatic data member or |
1588 | nonstatic member function of a class can only be used: | |
471086d6 | 1589 | |
1bc16cab | 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 | |
1e66592c | 1593 | |
1bc16cab | 1594 | -- to form a pointer to member (_expr.unary.op_), or |
1595 | ||
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 | |
1598 | ||
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)) | |
1602 | { | |
08cc44e7 | 1603 | /* Build a representation of the qualified name suitable |
b3beaf30 | 1604 | for use as the operand to "&" -- even though the "&" is |
1605 | not actually present. */ | |
831d52a2 | 1606 | member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); |
1bc16cab | 1607 | /* In Microsoft mode, treat a non-static member function as if |
1608 | it were a pointer-to-member. */ | |
1609 | if (flag_ms_extensions) | |
1610 | { | |
1bc16cab | 1611 | PTRMEM_OK_P (member) = 1; |
ebd21de4 | 1612 | return cp_build_unary_op (ADDR_EXPR, member, 0, |
1613 | tf_warning_or_error); | |
1bc16cab | 1614 | } |
9031d10b | 1615 | error ("invalid use of non-static member function %qD", |
b3beaf30 | 1616 | TREE_OPERAND (member, 1)); |
c9e1b8d8 | 1617 | return error_mark_node; |
1bc16cab | 1618 | } |
1619 | else if (TREE_CODE (member) == FIELD_DECL) | |
1620 | { | |
05949fae | 1621 | error ("invalid use of non-static data member %qD", member); |
1bc16cab | 1622 | return error_mark_node; |
1623 | } | |
1624 | return member; | |
1625 | } | |
471086d6 | 1626 | |
831d52a2 | 1627 | member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); |
120c0017 | 1628 | PTRMEM_OK_P (member) = 1; |
1629 | return member; | |
471086d6 | 1630 | } |
1631 | ||
409afdd4 | 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. */ | |
471086d6 | 1637 | |
409afdd4 | 1638 | static tree |
1639 | constant_value_1 (tree decl, bool integral_p) | |
471086d6 | 1640 | { |
4cd9e88b | 1641 | while (TREE_CODE (decl) == CONST_DECL |
074ab442 | 1642 | || (integral_p |
409afdd4 | 1643 | ? DECL_INTEGRAL_CONSTANT_VAR_P (decl) |
1644 | : (TREE_CODE (decl) == VAR_DECL | |
1645 | && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl))))) | |
e6ef0e42 | 1646 | { |
1647 | tree init; | |
5c028b29 | 1648 | /* Static data members in template classes may have |
1649 | non-dependent initializers. References to such non-static | |
d91303a6 | 1650 | data members are not value-dependent, so we must retrieve the |
5c028b29 | 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)) | |
074ab442 | 1657 | && uses_template_parms (CLASSTYPE_TI_ARGS |
5c028b29 | 1658 | (DECL_CONTEXT (decl)))) |
d91303a6 | 1659 | { |
1660 | ++processing_template_decl; | |
1661 | init = fold_non_dependent_expr (DECL_INITIAL (decl)); | |
1662 | --processing_template_decl; | |
1663 | } | |
5c028b29 | 1664 | else |
1665 | { | |
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. */ | |
1670 | mark_used (decl); | |
1671 | init = DECL_INITIAL (decl); | |
1672 | } | |
d91303a6 | 1673 | if (init == error_mark_node) |
7a00f939 | 1674 | { |
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). */ | |
1678 | return init; | |
1679 | else | |
1680 | return decl; | |
1681 | } | |
d6832042 | 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 | |
1685 | TREE_VALUE. */ | |
1686 | if (processing_template_decl | |
1687 | && init | |
1688 | && TREE_CODE (init) == TREE_LIST | |
1689 | && TREE_CHAIN (init) == NULL_TREE) | |
1690 | init = TREE_VALUE (init); | |
d91303a6 | 1691 | if (!init |
e6ef0e42 | 1692 | || !TREE_TYPE (init) |
409afdd4 | 1693 | || (integral_p |
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 | |
ae915c82 | 1698 | want to make inadvertent copies of such entities, |
409afdd4 | 1699 | and we must be sure that their addresses are the |
1700 | same everywhere. */ | |
1701 | || TREE_CODE (init) == CONSTRUCTOR | |
1702 | || TREE_CODE (init) == STRING_CST))) | |
e6ef0e42 | 1703 | break; |
07801057 | 1704 | decl = unshare_expr (init); |
e6ef0e42 | 1705 | } |
13f0eb20 | 1706 | return decl; |
1707 | } | |
338c7b53 | 1708 | |
409afdd4 | 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 | |
1712 | [5.19/1]. */ | |
338c7b53 | 1713 | |
13f0eb20 | 1714 | tree |
409afdd4 | 1715 | integral_constant_value (tree decl) |
13f0eb20 | 1716 | { |
409afdd4 | 1717 | return constant_value_1 (decl, /*integral_p=*/true); |
1718 | } | |
9031d10b | 1719 | |
409afdd4 | 1720 | /* A more relaxed version of integral_constant_value, used by the |
a17c2a3a | 1721 | common C/C++ code and by the C++ front end for optimization |
409afdd4 | 1722 | purposes. */ |
1723 | ||
1724 | tree | |
1725 | decl_constant_value (tree decl) | |
1726 | { | |
074ab442 | 1727 | return constant_value_1 (decl, |
409afdd4 | 1728 | /*integral_p=*/processing_template_decl); |
471086d6 | 1729 | } |
1730 | \f | |
471086d6 | 1731 | /* Common subroutines of build_new and build_vec_delete. */ |
1732 | ||
2b600561 | 1733 | /* Call the global __builtin_delete to delete ADDR. */ |
471086d6 | 1734 | |
b465397d | 1735 | static tree |
6c5ad428 | 1736 | build_builtin_delete_call (tree addr) |
471086d6 | 1737 | { |
bc935550 | 1738 | mark_used (global_delete_fndecl); |
d01f58f9 | 1739 | return build_call_n (global_delete_fndecl, 1, addr); |
471086d6 | 1740 | } |
1741 | \f | |
393f878f | 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 | |
f352a3fb | 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. */ | |
d383a10c | 1749 | |
393f878f | 1750 | static tree |
f352a3fb | 1751 | build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts, |
1752 | VEC(tree,gc) *init, int use_global_new) | |
bb6e087e | 1753 | { |
f352a3fb | 1754 | tree init_list; |
393f878f | 1755 | tree new_expr; |
074ab442 | 1756 | |
f352a3fb | 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()". */ | |
1761 | if (init == NULL) | |
1762 | init_list = NULL_TREE; | |
1763 | else if (VEC_empty (tree, init)) | |
1764 | init_list = void_zero_node; | |
1765 | else | |
1766 | init_list = build_tree_list_vec (init); | |
1767 | ||
1768 | new_expr = build4 (NEW_EXPR, build_pointer_type (type), | |
1769 | build_tree_list_vec (placement), type, nelts, | |
1770 | init_list); | |
393f878f | 1771 | NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new; |
1772 | TREE_SIDE_EFFECTS (new_expr) = 1; | |
1773 | ||
1774 | return new_expr; | |
bb6e087e | 1775 | } |
1776 | ||
2bc64004 | 1777 | /* Diagnose uninitialized const members or reference members of type |
1778 | TYPE. USING_NEW is used to disambiguate the diagnostic between a | |
fa60f42b | 1779 | new expression without a new-initializer and a declaration. Returns |
1780 | the error count. */ | |
2bc64004 | 1781 | |
fa60f42b | 1782 | static int |
2bc64004 | 1783 | diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin, |
fa60f42b | 1784 | bool using_new, bool complain) |
2bc64004 | 1785 | { |
1786 | tree field; | |
fa60f42b | 1787 | int error_count = 0; |
2bc64004 | 1788 | |
f65ee287 | 1789 | if (type_has_user_provided_constructor (type)) |
fa60f42b | 1790 | return 0; |
f65ee287 | 1791 | |
2bc64004 | 1792 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) |
1793 | { | |
1794 | tree field_type; | |
1795 | ||
1796 | if (TREE_CODE (field) != FIELD_DECL) | |
1797 | continue; | |
1798 | ||
1799 | field_type = strip_array_types (TREE_TYPE (field)); | |
1800 | ||
1801 | if (TREE_CODE (field_type) == REFERENCE_TYPE) | |
1802 | { | |
fa60f42b | 1803 | ++ error_count; |
1804 | if (complain) | |
1805 | { | |
1806 | if (using_new) | |
1807 | error ("uninitialized reference member in %q#T " | |
1808 | "using %<new%> without new-initializer", origin); | |
1809 | else | |
1810 | error ("uninitialized reference member in %q#T", origin); | |
1811 | inform (DECL_SOURCE_LOCATION (field), | |
1812 | "%qD should be initialized", field); | |
1813 | } | |
2bc64004 | 1814 | } |
1815 | ||
1816 | if (CP_TYPE_CONST_P (field_type)) | |
1817 | { | |
fa60f42b | 1818 | ++ error_count; |
1819 | if (complain) | |
1820 | { | |
1821 | if (using_new) | |
1822 | error ("uninitialized const member in %q#T " | |
1823 | "using %<new%> without new-initializer", origin); | |
1824 | else | |
1825 | error ("uninitialized const member in %q#T", origin); | |
1826 | inform (DECL_SOURCE_LOCATION (field), | |
1827 | "%qD should be initialized", field); | |
1828 | } | |
2bc64004 | 1829 | } |
1830 | ||
1831 | if (CLASS_TYPE_P (field_type)) | |
fa60f42b | 1832 | error_count |
1833 | += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin, | |
1834 | using_new, complain); | |
2bc64004 | 1835 | } |
fa60f42b | 1836 | return error_count; |
2bc64004 | 1837 | } |
1838 | ||
fa60f42b | 1839 | int |
1840 | diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain) | |
2bc64004 | 1841 | { |
fa60f42b | 1842 | return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain); |
2bc64004 | 1843 | } |
1844 | ||
393f878f | 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 | |
f352a3fb | 1848 | build_raw_new_expr. This may change PLACEMENT and INIT. */ |
d383a10c | 1849 | |
89e923d8 | 1850 | static tree |
f352a3fb | 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) | |
d383a10c | 1854 | { |
40156ad1 | 1855 | tree size, rval; |
1856 | /* True iff this is a call to "operator new[]" instead of just | |
9031d10b | 1857 | "operator new". */ |
40156ad1 | 1858 | bool array_p = false; |
79b458ae | 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 | |
40156ad1 | 1861 | ELT_TYPE is "int". If ARRAY_P is false, this is the same type as |
79b458ae | 1862 | TYPE. */ |
40156ad1 | 1863 | tree elt_type; |
e1a63cdb | 1864 | /* The type of the new-expression. (This type is always a pointer |
1865 | type.) */ | |
1866 | tree pointer_type; | |
a8fe6bf4 | 1867 | tree non_const_pointer_type; |
0473b1af | 1868 | tree outer_nelts = NULL_TREE; |
e1a63cdb | 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. */ | |
1872 | tree alloc_node; | |
f3e7610e | 1873 | tree alloc_fn; |
4ef49933 | 1874 | tree cookie_expr, init_expr; |
98060e63 | 1875 | int nothrow, check_new; |
bb6e087e | 1876 | int use_java_new = 0; |
89e923d8 | 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; | |
f352a3fb | 1881 | tree placement_first; |
d4600b3e | 1882 | tree placement_expr = NULL_TREE; |
49603c0f | 1883 | /* True if the function we are calling is a placement allocation |
1884 | function. */ | |
1885 | bool placement_allocation_fn_p; | |
e1a63cdb | 1886 | /* True if the storage must be initialized, either by a constructor |
755edffd | 1887 | or due to an explicit new-initializer. */ |
e1a63cdb | 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. */ | |
1893 | tree data_addr; | |
4ee9c684 | 1894 | tree init_preeval_expr = NULL_TREE; |
d383a10c | 1895 | |
3046c0a3 | 1896 | if (nelts) |
d383a10c | 1897 | { |
3046c0a3 | 1898 | outer_nelts = nelts; |
40156ad1 | 1899 | array_p = true; |
d383a10c | 1900 | } |
79b458ae | 1901 | else if (TREE_CODE (type) == ARRAY_TYPE) |
40156ad1 | 1902 | { |
79b458ae | 1903 | array_p = true; |
1904 | nelts = array_type_nelts_top (type); | |
1905 | outer_nelts = nelts; | |
1906 | type = TREE_TYPE (type); | |
40156ad1 | 1907 | } |
89e923d8 | 1908 | |
471086d6 | 1909 | /* If our base type is an array, then make sure we know how many elements |
1910 | it has. */ | |
40156ad1 | 1911 | for (elt_type = type; |
1912 | TREE_CODE (elt_type) == ARRAY_TYPE; | |
1913 | elt_type = TREE_TYPE (elt_type)) | |
8e70fb09 | 1914 | nelts = cp_build_binary_op (input_location, |
1915 | MULT_EXPR, nelts, | |
ebd21de4 | 1916 | array_type_nelts_top (elt_type), |
1917 | complain); | |
e857e9c7 | 1918 | |
40156ad1 | 1919 | if (TREE_CODE (elt_type) == VOID_TYPE) |
bcf789d7 | 1920 | { |
ebd21de4 | 1921 | if (complain & tf_error) |
1922 | error ("invalid type %<void%> for new"); | |
bcf789d7 | 1923 | return error_mark_node; |
1924 | } | |
1925 | ||
40156ad1 | 1926 | if (abstract_virtuals_error (NULL_TREE, elt_type)) |
8c18e707 | 1927 | return error_mark_node; |
0543e7a9 | 1928 | |
f352a3fb | 1929 | is_initialized = (TYPE_NEEDS_CONSTRUCTING (elt_type) || *init != NULL); |
2336da2a | 1930 | |
fa60f42b | 1931 | if (*init == NULL) |
2bc64004 | 1932 | { |
fa60f42b | 1933 | bool maybe_uninitialized_error = false; |
2bc64004 | 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)) | |
fa60f42b | 1937 | maybe_uninitialized_error = true; |
2bc64004 | 1938 | |
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). | |
1944 | [...] | |
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; */ | |
1950 | ||
1951 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type)) | |
fa60f42b | 1952 | maybe_uninitialized_error = true; |
2bc64004 | 1953 | |
fa60f42b | 1954 | if (maybe_uninitialized_error |
1955 | && diagnose_uninitialized_cst_or_ref_member (elt_type, | |
1956 | /*using_new=*/true, | |
1957 | complain & tf_error)) | |
1958 | return error_mark_node; | |
2bc64004 | 1959 | } |
1960 | ||
f352a3fb | 1961 | if (CP_TYPE_CONST_P (elt_type) && *init == NULL |
2336da2a | 1962 | && !type_has_user_provided_default_constructor (elt_type)) |
e1a63cdb | 1963 | { |
ebd21de4 | 1964 | if (complain & tf_error) |
1965 | error ("uninitialized const in %<new%> of %q#T", elt_type); | |
e1a63cdb | 1966 | return error_mark_node; |
1967 | } | |
1968 | ||
40156ad1 | 1969 | size = size_in_bytes (elt_type); |
1970 | if (array_p) | |
79b458ae | 1971 | size = size_binop (MULT_EXPR, size, convert (sizetype, nelts)); |
e581f478 | 1972 | |
393f878f | 1973 | alloc_fn = NULL_TREE; |
1974 | ||
f352a3fb | 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. */ | |
f352a3fb | 1978 | placement_first = NULL_TREE; |
1979 | if (VEC_length (tree, *placement) == 1 | |
1980 | && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0))) | |
1981 | == POINTER_TYPE)) | |
1982 | placement_first = VEC_index (tree, *placement, 0); | |
1983 | ||
96624a9e | 1984 | /* Allocate the object. */ |
f352a3fb | 1985 | if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type)) |
bb6e087e | 1986 | { |
393f878f | 1987 | tree class_addr; |
40156ad1 | 1988 | tree class_decl = build_java_class_ref (elt_type); |
e99c3a1d | 1989 | static const char alloc_name[] = "_Jv_AllocObject"; |
4ee9c684 | 1990 | |
457556f8 | 1991 | if (class_decl == error_mark_node) |
1992 | return error_mark_node; | |
1993 | ||
bb6e087e | 1994 | use_java_new = 1; |
9031d10b | 1995 | if (!get_global_value_if_present (get_identifier (alloc_name), |
393f878f | 1996 | &alloc_fn)) |
8a0fd506 | 1997 | { |
ebd21de4 | 1998 | if (complain & tf_error) |
1999 | error ("call to Java constructor with %qs undefined", alloc_name); | |
2fab99a6 | 2000 | return error_mark_node; |
2001 | } | |
393f878f | 2002 | else if (really_overloaded_fn (alloc_fn)) |
8a0fd506 | 2003 | { |
ebd21de4 | 2004 | if (complain & tf_error) |
2005 | error ("%qD should never be overloaded", alloc_fn); | |
2fab99a6 | 2006 | return error_mark_node; |
2007 | } | |
393f878f | 2008 | alloc_fn = OVL_CURRENT (alloc_fn); |
bb6e087e | 2009 | class_addr = build1 (ADDR_EXPR, jclass_node, class_decl); |
ebd21de4 | 2010 | alloc_call = (cp_build_function_call |
393f878f | 2011 | (alloc_fn, |
ebd21de4 | 2012 | build_tree_list (NULL_TREE, class_addr), |
2013 | complain)); | |
bb6e087e | 2014 | } |
95397ff9 | 2015 | else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type)) |
faf19a81 | 2016 | { |
2017 | error ("Java class %q#T object allocated using placement new", elt_type); | |
2018 | return error_mark_node; | |
2019 | } | |
471086d6 | 2020 | else |
2021 | { | |
89e923d8 | 2022 | tree fnname; |
3c33f9f3 | 2023 | tree fns; |
89e923d8 | 2024 | |
40156ad1 | 2025 | fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR); |
89e923d8 | 2026 | |
9031d10b | 2027 | if (!globally_qualified_p |
40156ad1 | 2028 | && CLASS_TYPE_P (elt_type) |
2029 | && (array_p | |
2030 | ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type) | |
2031 | : TYPE_HAS_NEW_OPERATOR (elt_type))) | |
98060e63 | 2032 | { |
2033 | /* Use a class-specific operator new. */ | |
2034 | /* If a cookie is required, add some extra space. */ | |
40156ad1 | 2035 | if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type)) |
98060e63 | 2036 | { |
40156ad1 | 2037 | cookie_size = targetm.cxx.get_cookie_size (elt_type); |
98060e63 | 2038 | size = size_binop (PLUS_EXPR, size, cookie_size); |
2039 | } | |
2040 | /* Create the argument list. */ | |
f352a3fb | 2041 | VEC_safe_insert (tree, gc, *placement, 0, size); |
3c33f9f3 | 2042 | /* Do name-lookup to find the appropriate operator. */ |
40156ad1 | 2043 | fns = lookup_fnfields (elt_type, fnname, /*protect=*/2); |
db6ec059 | 2044 | if (fns == NULL_TREE) |
2045 | { | |
ebd21de4 | 2046 | if (complain & tf_error) |
2047 | error ("no suitable %qD found in class %qT", fnname, elt_type); | |
db6ec059 | 2048 | return error_mark_node; |
2049 | } | |
3c33f9f3 | 2050 | if (TREE_CODE (fns) == TREE_LIST) |
2051 | { | |
ebd21de4 | 2052 | if (complain & tf_error) |
2053 | { | |
2054 | error ("request for member %qD is ambiguous", fnname); | |
2055 | print_candidates (fns); | |
2056 | } | |
3c33f9f3 | 2057 | return error_mark_node; |
2058 | } | |
40156ad1 | 2059 | alloc_call = build_new_method_call (build_dummy_object (elt_type), |
f352a3fb | 2060 | fns, placement, |
3c33f9f3 | 2061 | /*conversion_path=*/NULL_TREE, |
393f878f | 2062 | LOOKUP_NORMAL, |
ebd21de4 | 2063 | &alloc_fn, |
2064 | complain); | |
98060e63 | 2065 | } |
89e923d8 | 2066 | else |
98060e63 | 2067 | { |
2068 | /* Use a global operator new. */ | |
c6a06e1f | 2069 | /* See if a cookie might be required. */ |
40156ad1 | 2070 | if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type)) |
2071 | cookie_size = targetm.cxx.get_cookie_size (elt_type); | |
c6a06e1f | 2072 | else |
2073 | cookie_size = NULL_TREE; | |
2074 | ||
9031d10b | 2075 | alloc_call = build_operator_new_call (fnname, placement, |
393f878f | 2076 | &size, &cookie_size, |
2077 | &alloc_fn); | |
98060e63 | 2078 | } |
471086d6 | 2079 | } |
2080 | ||
4d7e6f4c | 2081 | if (alloc_call == error_mark_node) |
f9b9bf39 | 2082 | return error_mark_node; |
2083 | ||
393f878f | 2084 | gcc_assert (alloc_fn != NULL_TREE); |
2085 | ||
f352a3fb | 2086 | /* If we found a simple case of PLACEMENT_EXPR above, then copy it |
2087 | into a temporary variable. */ | |
d4600b3e | 2088 | if (!processing_template_decl |
f352a3fb | 2089 | && placement_first != NULL_TREE |
d4600b3e | 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) | |
2094 | { | |
2095 | tree placement_arg = CALL_EXPR_ARG (alloc_call, 1); | |
2096 | ||
b3353c23 | 2097 | if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))) |
d4600b3e | 2098 | || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))) |
2099 | { | |
f352a3fb | 2100 | placement_expr = get_target_expr (placement_first); |
d4600b3e | 2101 | CALL_EXPR_ARG (alloc_call, 1) |
2102 | = convert (TREE_TYPE (placement_arg), placement_expr); | |
2103 | } | |
2104 | } | |
2105 | ||
9aa757df | 2106 | /* In the simple case, we can stop now. */ |
2107 | pointer_type = build_pointer_type (type); | |
2108 | if (!cookie_size && !is_initialized) | |
2a3ebafa | 2109 | return build_nop (pointer_type, alloc_call); |
9aa757df | 2110 | |
0da58a6f | 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); | |
9aa757df | 2114 | alloc_node = TARGET_EXPR_SLOT (alloc_expr); |
2115 | ||
2116 | /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */ | |
9031d10b | 2117 | while (TREE_CODE (alloc_call) == COMPOUND_EXPR) |
9aa757df | 2118 | alloc_call = TREE_OPERAND (alloc_call, 1); |
98060e63 | 2119 | |
49603c0f | 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: | |
2123 | ||
2124 | struct S { void* operator new (size_t, int i = 0); }; | |
2125 | ||
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. */ | |
9031d10b | 2130 | placement_allocation_fn_p |
2131 | = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1 | |
f3e7610e | 2132 | || varargs_function_p (alloc_fn)); |
4d7e6f4c | 2133 | |
9aa757df | 2134 | /* Preevaluate the placement args so that we don't reevaluate them for a |
2135 | placement delete. */ | |
2136 | if (placement_allocation_fn_p) | |
2137 | { | |
4ee9c684 | 2138 | tree inits; |
2139 | stabilize_call (alloc_call, &inits); | |
9aa757df | 2140 | if (inits) |
831d52a2 | 2141 | alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits, |
2142 | alloc_expr); | |
9aa757df | 2143 | } |
2144 | ||
c0918dd5 | 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. | |
2152 | ||
2153 | So check for a null exception spec on the op new we just called. */ | |
2154 | ||
f3e7610e | 2155 | nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn)); |
bb6e087e | 2156 | check_new = (flag_check_new || nothrow) && ! use_java_new; |
c0918dd5 | 2157 | |
98060e63 | 2158 | if (cookie_size) |
471086d6 | 2159 | { |
4d7e6f4c | 2160 | tree cookie; |
600f4be7 | 2161 | tree cookie_ptr; |
69db191c | 2162 | tree size_ptr_type; |
e1a63cdb | 2163 | |
2164 | /* Adjust so we're pointing to the start of the object. */ | |
0da58a6f | 2165 | data_addr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (alloc_node), |
2166 | alloc_node, cookie_size); | |
4d7e6f4c | 2167 | |
89e923d8 | 2168 | /* Store the number of bytes allocated so that we can know how |
5ad590ad | 2169 | many elements to destroy later. We use the last sizeof |
2170 | (size_t) bytes to store the number of elements. */ | |
0da58a6f | 2171 | cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype)); |
389dd41b | 2172 | cookie_ptr = fold_build2_loc (input_location, |
2173 | POINTER_PLUS_EXPR, TREE_TYPE (alloc_node), | |
0da58a6f | 2174 | alloc_node, cookie_ptr); |
69db191c | 2175 | size_ptr_type = build_pointer_type (sizetype); |
0da58a6f | 2176 | cookie_ptr = fold_convert (size_ptr_type, cookie_ptr); |
f08923b3 | 2177 | cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); |
606b494c | 2178 | |
831d52a2 | 2179 | cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts); |
600f4be7 | 2180 | |
2181 | if (targetm.cxx.cookie_has_size ()) | |
2182 | { | |
2183 | /* Also store the element size. */ | |
3db039d8 | 2184 | cookie_ptr = build2 (POINTER_PLUS_EXPR, size_ptr_type, cookie_ptr, |
389dd41b | 2185 | fold_build1_loc (input_location, |
2186 | NEGATE_EXPR, sizetype, | |
3db039d8 | 2187 | size_in_bytes (sizetype))); |
2188 | ||
f08923b3 | 2189 | cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); |
831d52a2 | 2190 | cookie = build2 (MODIFY_EXPR, sizetype, cookie, |
0da58a6f | 2191 | size_in_bytes (elt_type)); |
831d52a2 | 2192 | cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr), |
2193 | cookie, cookie_expr); | |
600f4be7 | 2194 | } |
471086d6 | 2195 | } |
4d7e6f4c | 2196 | else |
4ef49933 | 2197 | { |
2198 | cookie_expr = NULL_TREE; | |
2199 | data_addr = alloc_node; | |
2200 | } | |
471086d6 | 2201 | |
0da58a6f | 2202 | /* Now use a pointer to the type we've actually allocated. */ |
a8fe6bf4 | 2203 | |
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 | |
ce494fcf | 2207 | (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST)); |
a8fe6bf4 | 2208 | |
2209 | data_addr = fold_convert (non_const_pointer_type, data_addr); | |
79b458ae | 2210 | /* Any further uses of alloc_node will want this type, too. */ |
a8fe6bf4 | 2211 | alloc_node = fold_convert (non_const_pointer_type, alloc_node); |
0da58a6f | 2212 | |
4ee9c684 | 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. */ | |
e1a63cdb | 2218 | if (is_initialized) |
471086d6 | 2219 | { |
4ee9c684 | 2220 | bool stable; |
0152e879 | 2221 | bool explicit_value_init_p = false; |
4ee9c684 | 2222 | |
f352a3fb | 2223 | if (*init != NULL && VEC_empty (tree, *init)) |
4ee9c684 | 2224 | { |
f352a3fb | 2225 | *init = NULL; |
0152e879 | 2226 | explicit_value_init_p = true; |
2227 | } | |
687a1c50 | 2228 | |
0152e879 | 2229 | if (array_p) |
2230 | { | |
a8fe6bf4 | 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))) | |
2235 | { | |
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); | |
2240 | else | |
2241 | { | |
2242 | domain = NULL_TREE; | |
2243 | if (CONSTRUCTOR_NELTS (vecinit) > 0) | |
2244 | warning (0, "non-constant array size in new, unable to " | |
2245 | "verify length of initializer-list"); | |
2246 | } | |
2247 | arraytype = build_cplus_array_type (type, domain); | |
2248 | vecinit = digest_init (arraytype, vecinit); | |
2249 | } | |
2250 | else if (*init) | |
ebd21de4 | 2251 | { |
2252 | if (complain & tf_error) | |
2b9e3597 | 2253 | permerror (input_location, "ISO C++ forbids initialization in array new"); |
ebd21de4 | 2254 | else |
2255 | return error_mark_node; | |
a8fe6bf4 | 2256 | vecinit = build_tree_list_vec (*init); |
ebd21de4 | 2257 | } |
4ee9c684 | 2258 | init_expr |
79b458ae | 2259 | = build_vec_init (data_addr, |
8e70fb09 | 2260 | cp_build_binary_op (input_location, |
2261 | MINUS_EXPR, outer_nelts, | |
ebd21de4 | 2262 | integer_one_node, |
2263 | complain), | |
a8fe6bf4 | 2264 | vecinit, |
0152e879 | 2265 | explicit_value_init_p, |
ebd21de4 | 2266 | /*from_array=*/0, |
2267 | complain); | |
4ee9c684 | 2268 | |
2269 | /* An array initialization is stable because the initialization | |
2270 | of each element is a full-expression, so the temporaries don't | |
2271 | leak out. */ | |
2272 | stable = true; | |
2273 | } | |
a3691386 | 2274 | else |
471086d6 | 2275 | { |
f08923b3 | 2276 | init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain); |
79b458ae | 2277 | |
0152e879 | 2278 | if (TYPE_NEEDS_CONSTRUCTING (type) && !explicit_value_init_p) |
687a1c50 | 2279 | { |
2280 | init_expr = build_special_member_call (init_expr, | |
2281 | complete_ctor_identifier, | |
2282 | init, elt_type, | |
ebd21de4 | 2283 | LOOKUP_NORMAL, |
2284 | complain); | |
0152e879 | 2285 | } |
2286 | else if (explicit_value_init_p) | |
2287 | { | |
2288 | /* Something like `new int()'. */ | |
79b458ae | 2289 | init_expr = build2 (INIT_EXPR, type, |
2290 | init_expr, build_value_init (type)); | |
687a1c50 | 2291 | } |
092b1d6f | 2292 | else |
687a1c50 | 2293 | { |
f352a3fb | 2294 | tree ie; |
2295 | ||
687a1c50 | 2296 | /* We are processing something like `new int (10)', which |
2297 | means allocate an int, and initialize it with 10. */ | |
074ab442 | 2298 | |
f352a3fb | 2299 | ie = build_x_compound_expr_from_vec (*init, "new initializer"); |
2300 | init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie, | |
ebd21de4 | 2301 | complain); |
687a1c50 | 2302 | } |
0152e879 | 2303 | stable = stabilize_init (init_expr, &init_preeval_expr); |
4d7e6f4c | 2304 | } |
2305 | ||
2306 | if (init_expr == error_mark_node) | |
2307 | return error_mark_node; | |
c8559ab6 | 2308 | |
c961c636 | 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 | |
2316 | freed. */ | |
4d7e6f4c | 2317 | if (flag_exceptions && ! use_java_new) |
c8559ab6 | 2318 | { |
40156ad1 | 2319 | enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR; |
4d7e6f4c | 2320 | tree cleanup; |
db173e97 | 2321 | |
01665f3a | 2322 | /* The Standard is unclear here, but the right thing to do |
e1a63cdb | 2323 | is to use the same method for finding deallocation |
2324 | functions that we use for finding allocation functions. */ | |
0da58a6f | 2325 | cleanup = (build_op_delete_call |
2326 | (dcode, | |
79b458ae | 2327 | alloc_node, |
0da58a6f | 2328 | size, |
2329 | globally_qualified_p, | |
2330 | placement_allocation_fn_p ? alloc_call : NULL_TREE, | |
2331 | alloc_fn)); | |
d70beda9 | 2332 | |
4ee9c684 | 2333 | if (!cleanup) |
2334 | /* We're done. */; | |
2335 | else if (stable) | |
2336 | /* This is much simpler if we were able to preevaluate all of | |
2337 | the arguments to the constructor call. */ | |
e627cda1 | 2338 | { |
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; | |
2345 | } | |
4ee9c684 | 2346 | else |
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. | |
2351 | ||
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. */ | |
fa000d3a | 2357 | { |
4d7e6f4c | 2358 | tree end, sentry, begin; |
692f5aa7 | 2359 | |
2360 | begin = get_target_expr (boolean_true_node); | |
a9bc793b | 2361 | CLEANUP_EH_ONLY (begin) = 1; |
692f5aa7 | 2362 | |
a9bc793b | 2363 | sentry = TARGET_EXPR_SLOT (begin); |
2364 | ||
e627cda1 | 2365 | /* CLEANUP is compiler-generated, so no diagnostics. */ |
2366 | TREE_NO_WARNING (cleanup) = true; | |
2367 | ||
a9bc793b | 2368 | TARGET_EXPR_CLEANUP (begin) |
831d52a2 | 2369 | = build3 (COND_EXPR, void_type_node, sentry, |
2370 | cleanup, void_zero_node); | |
692f5aa7 | 2371 | |
831d52a2 | 2372 | end = build2 (MODIFY_EXPR, TREE_TYPE (sentry), |
2373 | sentry, boolean_false_node); | |
692f5aa7 | 2374 | |
4d7e6f4c | 2375 | init_expr |
831d52a2 | 2376 | = build2 (COMPOUND_EXPR, void_type_node, begin, |
2377 | build2 (COMPOUND_EXPR, void_type_node, init_expr, | |
2378 | end)); | |
e627cda1 | 2379 | /* Likewise, this is compiler-generated. */ |
2380 | TREE_NO_WARNING (init_expr) = true; | |
fa000d3a | 2381 | } |
c8559ab6 | 2382 | } |
e1a63cdb | 2383 | } |
4ef49933 | 2384 | else |
2385 | init_expr = NULL_TREE; | |
2386 | ||
2387 | /* Now build up the return value in reverse order. */ | |
4d7e6f4c | 2388 | |
4ef49933 | 2389 | rval = data_addr; |
692f5aa7 | 2390 | |
4ef49933 | 2391 | if (init_expr) |
831d52a2 | 2392 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval); |
4ef49933 | 2393 | if (cookie_expr) |
831d52a2 | 2394 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval); |
4ef49933 | 2395 | |
0da58a6f | 2396 | if (rval == data_addr) |
4ef49933 | 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); | |
2400 | else | |
42f3e1b9 | 2401 | { |
4ef49933 | 2402 | if (check_new) |
2403 | { | |
8e70fb09 | 2404 | tree ifexp = cp_build_binary_op (input_location, |
2405 | NE_EXPR, alloc_node, | |
ebd21de4 | 2406 | integer_zero_node, |
2407 | complain); | |
2408 | rval = build_conditional_expr (ifexp, rval, alloc_node, | |
2409 | complain); | |
4ef49933 | 2410 | } |
42f3e1b9 | 2411 | |
4ef49933 | 2412 | /* Perform the allocation before anything else, so that ALLOC_NODE |
2413 | has been initialized before we start using it. */ | |
831d52a2 | 2414 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval); |
4ef49933 | 2415 | } |
ac9386a0 | 2416 | |
4ee9c684 | 2417 | if (init_preeval_expr) |
831d52a2 | 2418 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval); |
4ee9c684 | 2419 | |
6d84574d | 2420 | /* A new-expression is never an lvalue. */ |
a4a591f9 | 2421 | gcc_assert (!lvalue_p (rval)); |
66723563 | 2422 | |
a8fe6bf4 | 2423 | return convert (pointer_type, rval); |
471086d6 | 2424 | } |
393f878f | 2425 | |
f352a3fb | 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. */ | |
393f878f | 2435 | |
2436 | tree | |
f352a3fb | 2437 | build_new (VEC(tree,gc) **placement, tree type, tree nelts, |
2438 | VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain) | |
393f878f | 2439 | { |
2440 | tree rval; | |
f352a3fb | 2441 | VEC(tree,gc) *orig_placement = NULL; |
2442 | tree orig_nelts = NULL_TREE; | |
2443 | VEC(tree,gc) *orig_init = NULL; | |
393f878f | 2444 | |
f352a3fb | 2445 | if (type == error_mark_node) |
393f878f | 2446 | return error_mark_node; |
2447 | ||
f352a3fb | 2448 | if (nelts == NULL_TREE && VEC_length (tree, *init) == 1) |
46f4817e | 2449 | { |
2450 | tree auto_node = type_uses_auto (type); | |
f352a3fb | 2451 | if (auto_node && describable_type (VEC_index (tree, *init, 0))) |
2452 | type = do_auto_deduction (type, VEC_index (tree, *init, 0), auto_node); | |
46f4817e | 2453 | } |
2454 | ||
393f878f | 2455 | if (processing_template_decl) |
2456 | { | |
2457 | if (dependent_type_p (type) | |
f352a3fb | 2458 | || any_type_dependent_arguments_p (*placement) |
393f878f | 2459 | || (nelts && type_dependent_expression_p (nelts)) |
f352a3fb | 2460 | || any_type_dependent_arguments_p (*init)) |
2461 | return build_raw_new_expr (*placement, type, nelts, *init, | |
393f878f | 2462 | use_global_new); |
f352a3fb | 2463 | |
2464 | orig_placement = make_tree_vector_copy (*placement); | |
2465 | orig_nelts = nelts; | |
2466 | orig_init = make_tree_vector_copy (*init); | |
2467 | ||
2468 | make_args_non_dependent (*placement); | |
393f878f | 2469 | if (nelts) |
2470 | nelts = build_non_dependent_expr (nelts); | |
f352a3fb | 2471 | make_args_non_dependent (*init); |
393f878f | 2472 | } |
2473 | ||
2474 | if (nelts) | |
2475 | { | |
2476 | if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false)) | |
ebd21de4 | 2477 | { |
2478 | if (complain & tf_error) | |
2b9e3597 | 2479 | permerror (input_location, "size in array new must have integral type"); |
ebd21de4 | 2480 | else |
2481 | return error_mark_node; | |
2482 | } | |
fbb73d9b | 2483 | nelts = mark_rvalue_use (nelts); |
4a761740 | 2484 | nelts = cp_save_expr (cp_convert (sizetype, nelts)); |
393f878f | 2485 | } |
2486 | ||
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) | |
2491 | { | |
ebd21de4 | 2492 | if (complain & tf_error) |
2493 | error ("new cannot be applied to a reference type"); | |
2494 | else | |
2495 | return error_mark_node; | |
393f878f | 2496 | type = TREE_TYPE (type); |
2497 | } | |
2498 | ||
2499 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
2500 | { | |
ebd21de4 | 2501 | if (complain & tf_error) |
2502 | error ("new cannot be applied to a function type"); | |
393f878f | 2503 | return error_mark_node; |
2504 | } | |
2505 | ||
644253d1 | 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. */ | |
dcf091d4 | 2509 | if (!complete_type_or_else (type, NULL_TREE)) |
2510 | return error_mark_node; | |
2511 | ||
ebd21de4 | 2512 | rval = build_new_1 (placement, type, nelts, init, use_global_new, complain); |
393f878f | 2513 | if (rval == error_mark_node) |
2514 | return error_mark_node; | |
2515 | ||
2516 | if (processing_template_decl) | |
f352a3fb | 2517 | { |
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); | |
2522 | return ret; | |
2523 | } | |
393f878f | 2524 | |
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; | |
2528 | ||
2529 | return rval; | |
2530 | } | |
2531 | ||
2532 | /* Given a Java class, return a decl for the corresponding java.lang.Class. */ | |
2533 | ||
2534 | tree | |
2535 | build_java_class_ref (tree type) | |
2536 | { | |
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) | |
2542 | { | |
2543 | jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass")); | |
2544 | if (jclass_node == NULL_TREE) | |
457556f8 | 2545 | { |
2546 | error ("call to Java constructor, while %<jclass%> undefined"); | |
2547 | return error_mark_node; | |
2548 | } | |
393f878f | 2549 | jclass_node = TREE_TYPE (jclass_node); |
2550 | } | |
2551 | ||
2552 | /* Mangle the class$ field. */ | |
2553 | { | |
2554 | tree field; | |
2555 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
2556 | if (DECL_NAME (field) == CL_suffix) | |
2557 | { | |
2558 | mangle_decl (field); | |
2559 | name = DECL_ASSEMBLER_NAME (field); | |
2560 | break; | |
2561 | } | |
2562 | if (!field) | |
457556f8 | 2563 | { |
2564 | error ("can't find %<class$%> in %qT", type); | |
2565 | return error_mark_node; | |
2566 | } | |
2567 | } | |
393f878f | 2568 | |
2569 | class_decl = IDENTIFIER_GLOBAL_VALUE (name); | |
2570 | if (class_decl == NULL_TREE) | |
2571 | { | |
e60a6f7b | 2572 | class_decl = build_decl (input_location, |
2573 | VAR_DECL, name, TREE_TYPE (jclass_node)); | |
393f878f | 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); | |
2581 | } | |
2582 | return class_decl; | |
2583 | } | |
471086d6 | 2584 | \f |
ce28ee2e | 2585 | static tree |
6c5ad428 | 2586 | build_vec_delete_1 (tree base, tree maxindex, tree type, |
2587 | special_function_kind auto_delete_vec, int use_global_delete) | |
ce28ee2e | 2588 | { |
2589 | tree virtual_size; | |
96624a9e | 2590 | tree ptype = build_pointer_type (type = complete_type (type)); |
ce28ee2e | 2591 | tree size_exp = size_in_bytes (type); |
2592 | ||
2593 | /* Temporary variables used by the loop. */ | |
2594 | tree tbase, tbase_init; | |
2595 | ||
2596 | /* This is the body of the loop that implements the deletion of a | |
2597 | single element, and moves temp variables to next elements. */ | |
2598 | tree body; | |
2599 | ||
2600 | /* This is the LOOP_EXPR that governs the deletion of the elements. */ | |
8a4008da | 2601 | tree loop = 0; |
ce28ee2e | 2602 | |
2603 | /* This is the thing that governs what to do after the loop has run. */ | |
2604 | tree deallocate_expr = 0; | |
2605 | ||
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; | |
0de36bdb | 2611 | tree tmp; |
ce28ee2e | 2612 | |
34b1bc3b | 2613 | /* We should only have 1-D arrays here. */ |
092b1d6f | 2614 | gcc_assert (TREE_CODE (type) != ARRAY_TYPE); |
34b1bc3b | 2615 | |
95397ff9 | 2616 | if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) |
8a4008da | 2617 | goto no_destructor; |
ce28ee2e | 2618 | |
30de7d91 | 2619 | /* The below is short by the cookie size. */ |
902de8ed | 2620 | virtual_size = size_binop (MULT_EXPR, size_exp, |
2621 | convert (sizetype, maxindex)); | |
ce28ee2e | 2622 | |
31236dcd | 2623 | tbase = create_temporary_var (ptype); |
ebd21de4 | 2624 | tbase_init = cp_build_modify_expr (tbase, NOP_EXPR, |
389dd41b | 2625 | fold_build2_loc (input_location, |
2626 | POINTER_PLUS_EXPR, ptype, | |
ebd21de4 | 2627 | fold_convert (ptype, base), |
2628 | virtual_size), | |
2629 | tf_warning_or_error); | |
831d52a2 | 2630 | controller = build3 (BIND_EXPR, void_type_node, tbase, |
2631 | NULL_TREE, NULL_TREE); | |
ce28ee2e | 2632 | TREE_SIDE_EFFECTS (controller) = 1; |
ce28ee2e | 2633 | |
831d52a2 | 2634 | body = build1 (EXIT_EXPR, void_type_node, |
eb5b85b5 | 2635 | build2 (EQ_EXPR, boolean_type_node, tbase, |
2636 | fold_convert (ptype, base))); | |
389dd41b | 2637 | tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp); |
8a4008da | 2638 | body = build_compound_expr |
e60a6f7b | 2639 | (input_location, |
2640 | body, cp_build_modify_expr (tbase, NOP_EXPR, | |
ebd21de4 | 2641 | build2 (POINTER_PLUS_EXPR, ptype, tbase, tmp), |
717ecce9 | 2642 | tf_warning_or_error)); |
8a4008da | 2643 | body = build_compound_expr |
e60a6f7b | 2644 | (input_location, |
2645 | body, build_delete (ptype, tbase, sfk_complete_destructor, | |
717ecce9 | 2646 | LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1)); |
ce28ee2e | 2647 | |
831d52a2 | 2648 | loop = build1 (LOOP_EXPR, void_type_node, body); |
e60a6f7b | 2649 | loop = build_compound_expr (input_location, tbase_init, loop); |
ce28ee2e | 2650 | |
2651 | no_destructor: | |
2652 | /* If the delete flag is one, or anything else with the low bit set, | |
2653 | delete the storage. */ | |
675996d9 | 2654 | if (auto_delete_vec != sfk_base_destructor) |
ce28ee2e | 2655 | { |
2656 | tree base_tbd; | |
2657 | ||
30de7d91 | 2658 | /* The below is short by the cookie size. */ |
902de8ed | 2659 | virtual_size = size_binop (MULT_EXPR, size_exp, |
2660 | convert (sizetype, maxindex)); | |
ce28ee2e | 2661 | |
2662 | if (! TYPE_VEC_NEW_USES_COOKIE (type)) | |
2663 | /* no header */ | |
2664 | base_tbd = base; | |
2665 | else | |
2666 | { | |
89e923d8 | 2667 | tree cookie_size; |
2668 | ||
600f4be7 | 2669 | cookie_size = targetm.cxx.get_cookie_size (type); |
9031d10b | 2670 | base_tbd |
89e923d8 | 2671 | = cp_convert (ptype, |
8e70fb09 | 2672 | cp_build_binary_op (input_location, |
2673 | MINUS_EXPR, | |
9031d10b | 2674 | cp_convert (string_type_node, |
29d00ba7 | 2675 | base), |
ebd21de4 | 2676 | cookie_size, |
2677 | tf_warning_or_error)); | |
96624a9e | 2678 | /* True size with header. */ |
89e923d8 | 2679 | virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size); |
ce28ee2e | 2680 | } |
675996d9 | 2681 | |
2682 | if (auto_delete_vec == sfk_deleting_destructor) | |
cd5cd0b3 | 2683 | deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR, |
2684 | base_tbd, virtual_size, | |
2685 | use_global_delete & 1, | |
074ab442 | 2686 | /*placement=*/NULL_TREE, |
393f878f | 2687 | /*alloc_fn=*/NULL_TREE); |
ce28ee2e | 2688 | } |
2689 | ||
8a4008da | 2690 | body = loop; |
2691 | if (!deallocate_expr) | |
2692 | ; | |
2693 | else if (!body) | |
2694 | body = deallocate_expr; | |
ce28ee2e | 2695 | else |
e60a6f7b | 2696 | body = build_compound_expr (input_location, body, deallocate_expr); |
9031d10b | 2697 | |
8a4008da | 2698 | if (!body) |
2699 | body = integer_zero_node; | |
9031d10b | 2700 | |
ce28ee2e | 2701 | /* Outermost wrapper: If pointer is null, punt. */ |
389dd41b | 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, | |
b7837065 | 2705 | convert (TREE_TYPE (base), |
2706 | integer_zero_node)), | |
2707 | body, integer_zero_node); | |
ce28ee2e | 2708 | body = build1 (NOP_EXPR, void_type_node, body); |
2709 | ||
2710 | if (controller) | |
2711 | { | |
2712 | TREE_OPERAND (controller, 1) = body; | |
bdb2219e | 2713 | body = controller; |
ce28ee2e | 2714 | } |
bdb2219e | 2715 | |
2716 | if (TREE_CODE (base) == SAVE_EXPR) | |
2717 | /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */ | |
831d52a2 | 2718 | body = build2 (COMPOUND_EXPR, void_type_node, base, body); |
bdb2219e | 2719 | |
ebd21de4 | 2720 | return convert_to_void (body, /*implicit=*/NULL, tf_warning_or_error); |
ce28ee2e | 2721 | } |
2722 | ||
9031d10b | 2723 | /* Create an unnamed variable of the indicated TYPE. */ |
4eb32e62 | 2724 | |
b48733fd | 2725 | tree |
6c5ad428 | 2726 | create_temporary_var (tree type) |
8d89508b | 2727 | { |
b48733fd | 2728 | tree decl; |
9031d10b | 2729 | |
e60a6f7b | 2730 | decl = build_decl (input_location, |
2731 | VAR_DECL, NULL_TREE, type); | |
b48733fd | 2732 | TREE_USED (decl) = 1; |
2733 | DECL_ARTIFICIAL (decl) = 1; | |
b48733fd | 2734 | DECL_IGNORED_P (decl) = 1; |
e0e489c4 | 2735 | DECL_CONTEXT (decl) = current_function_decl; |
b48733fd | 2736 | |
b48733fd | 2737 | return decl; |
8d89508b | 2738 | } |
2739 | ||
b48733fd | 2740 | /* Create a new temporary variable of the indicated TYPE, initialized |
2741 | to INIT. | |
8d89508b | 2742 | |
b48733fd | 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). */ | |
2746 | ||
2747 | static tree | |
6c5ad428 | 2748 | get_temp_regvar (tree type, tree init) |
ce28ee2e | 2749 | { |
b48733fd | 2750 | tree decl; |
8d89508b | 2751 | |
b48733fd | 2752 | decl = create_temporary_var (type); |
7dd37241 | 2753 | add_decl_expr (decl); |
9031d10b | 2754 | |
ebd21de4 | 2755 | finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, |
2756 | tf_warning_or_error)); | |
8d89508b | 2757 | |
b48733fd | 2758 | return decl; |
ce28ee2e | 2759 | } |
2760 | ||
b48733fd | 2761 | /* `build_vec_init' returns tree structure that performs |
2762 | initialization of a vector of aggregate types. | |
471086d6 | 2763 | |
79b458ae | 2764 | BASE is a reference to the vector, of ARRAY_TYPE, or a pointer |
2765 | to the first element, of POINTER_TYPE. | |
0473b1af | 2766 | MAXINDEX is the maximum index of the array (one less than the |
79b458ae | 2767 | number of elements). It is only used if BASE is a pointer or |
0473b1af | 2768 | TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE. |
687a1c50 | 2769 | |
471086d6 | 2770 | INIT is the (possibly NULL) initializer. |
2771 | ||
0152e879 | 2772 | If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All |
2773 | elements in the array are value-initialized. | |
687a1c50 | 2774 | |
471086d6 | 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. */ | |
2781 | ||
2782 | tree | |
074ab442 | 2783 | build_vec_init (tree base, tree maxindex, tree init, |
0152e879 | 2784 | bool explicit_value_init_p, |
ebd21de4 | 2785 | int from_array, tsubst_flags_t complain) |
471086d6 | 2786 | { |
2787 | tree rval; | |
8d89508b | 2788 | tree base2 = NULL_TREE; |
f0eaeecd | 2789 | tree itype = NULL_TREE; |
8d89508b | 2790 | tree iterator; |
79b458ae | 2791 | /* The type of BASE. */ |
a3691386 | 2792 | tree atype = TREE_TYPE (base); |
b48733fd | 2793 | /* The type of an element in the array. */ |
a3691386 | 2794 | tree type = TREE_TYPE (atype); |
9031d10b | 2795 | /* The element type reached after removing all outer array |
36145d1d | 2796 | types. */ |
2797 | tree inner_elt_type; | |
b48733fd | 2798 | /* The type of a pointer to an element in the array. */ |
2799 | tree ptype; | |
2800 | tree stmt_expr; | |
2801 | tree compound_stmt; | |
2802 | int destroy_temps; | |
b144fd49 | 2803 | tree try_block = NULL_TREE; |
8d89508b | 2804 | int num_initialized_elts = 0; |
4bd132ff | 2805 | bool is_global; |
9031d10b | 2806 | |
79b458ae | 2807 | if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype)) |
0473b1af | 2808 | maxindex = array_type_nelts (atype); |
2809 | ||
2810 | if (maxindex == NULL_TREE || maxindex == error_mark_node) | |
471086d6 | 2811 | return error_mark_node; |
2812 | ||
0152e879 | 2813 | if (explicit_value_init_p) |
687a1c50 | 2814 | gcc_assert (!init); |
2815 | ||
79b458ae | 2816 | inner_elt_type = strip_array_types (type); |
1ba56394 | 2817 | |
2818 | /* Look through the TARGET_EXPR around a compound literal. */ | |
2819 | if (init && TREE_CODE (init) == TARGET_EXPR | |
d748d5cd | 2820 | && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR |
2821 | && from_array != 2) | |
1ba56394 | 2822 | init = TARGET_EXPR_INITIAL (init); |
2823 | ||
2b4d70c6 | 2824 | if (init |
a8fe6bf4 | 2825 | && TREE_CODE (atype) == ARRAY_TYPE |
2b4d70c6 | 2826 | && (from_array == 2 |
9031d10b | 2827 | ? (!CLASS_TYPE_P (inner_elt_type) |
36145d1d | 2828 | || !TYPE_HAS_COMPLEX_ASSIGN_REF (inner_elt_type)) |
2b4d70c6 | 2829 | : !TYPE_NEEDS_CONSTRUCTING (type)) |
a3691386 | 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. */ | |
c75b4594 | 2833 | && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init)) |
36145d1d | 2834 | || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type))) |
a3691386 | 2835 | || from_array)) |
2836 | { | |
c1c67b4f | 2837 | /* Do non-default initialization of trivial arrays resulting from |
a3691386 | 2838 | brace-enclosed initializers. In this case, digest_init and |
2839 | store_constructor will handle the semantics for us. */ | |
2840 | ||
831d52a2 | 2841 | stmt_expr = build2 (INIT_EXPR, atype, base, init); |
a3691386 | 2842 | return stmt_expr; |
2843 | } | |
2844 | ||
2845 | maxindex = cp_convert (ptrdiff_type_node, maxindex); | |
79b458ae | 2846 | if (TREE_CODE (atype) == ARRAY_TYPE) |
2847 | { | |
2848 | ptype = build_pointer_type (type); | |
2849 | base = cp_convert (ptype, decay_conversion (base)); | |
2850 | } | |
2851 | else | |
2852 | ptype = atype; | |
471086d6 | 2853 | |
b48733fd | 2854 | /* The code we are generating looks like: |
face0cb7 | 2855 | ({ |
b48733fd | 2856 | T* t1 = (T*) base; |
a3691386 | 2857 | T* rval = t1; |
b48733fd | 2858 | ptrdiff_t iterator = maxindex; |
2859 | try { | |
805e22b2 | 2860 | for (; iterator != -1; --iterator) { |
a3691386 | 2861 | ... initialize *t1 ... |
2862 | ++t1; | |
805e22b2 | 2863 | } |
b48733fd | 2864 | } catch (...) { |
653e5405 | 2865 | ... destroy elements that were constructed ... |
b48733fd | 2866 | } |
face0cb7 | 2867 | rval; |
2868 | }) | |
9031d10b | 2869 | |
b48733fd | 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 | |
a3691386 | 2872 | elements do not have destructors. We can omit the loop completely if |
9031d10b | 2873 | the elements of the array do not have constructors. |
b48733fd | 2874 | |
2875 | We actually wrap the entire body of the above in a STMT_EXPR, for | |
9031d10b | 2876 | tidiness. |
b48733fd | 2877 | |
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 | |
a17c2a3a | 2881 | of whatever cleverness the back end has for dealing with copies |
b48733fd | 2882 | of blocks of memory. */ |
2883 | ||
4bd132ff | 2884 | is_global = begin_init_stmts (&stmt_expr, &compound_stmt); |
5c3247a9 | 2885 | destroy_temps = stmts_are_full_exprs_p (); |
a08e60ae | 2886 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
a3691386 | 2887 | rval = get_temp_regvar (ptype, base); |
b48733fd | 2888 | base = get_temp_regvar (ptype, rval); |
8d89508b | 2889 | iterator = get_temp_regvar (ptrdiff_type_node, maxindex); |
471086d6 | 2890 | |
d748d5cd | 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) | |
2895 | { | |
2896 | base2 = decay_conversion (init); | |
2897 | itype = TREE_TYPE (base2); | |
2898 | base2 = get_temp_regvar (itype, base2); | |
2899 | itype = TREE_TYPE (itype); | |
2900 | } | |
2901 | ||
8d89508b | 2902 | /* Protect the entire array initialization so that we can destroy |
a3691386 | 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) | |
2906 | && from_array != 2) | |
18a4cb16 | 2907 | { |
2908 | try_block = begin_try_block (); | |
18a4cb16 | 2909 | } |
8d89508b | 2910 | |
a3691386 | 2911 | if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR) |
471086d6 | 2912 | { |
c1c67b4f | 2913 | /* Do non-default initialization of non-trivial arrays resulting from |
a3691386 | 2914 | brace-enclosed initializers. */ |
c75b4594 | 2915 | unsigned HOST_WIDE_INT idx; |
2916 | tree elt; | |
435a15bf | 2917 | from_array = 0; |
2918 | ||
c75b4594 | 2919 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt) |
471086d6 | 2920 | { |
b48733fd | 2921 | tree baseref = build1 (INDIRECT_REF, type, base); |
471086d6 | 2922 | |
8d89508b | 2923 | num_initialized_elts++; |
471086d6 | 2924 | |
f47c1747 | 2925 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
95397ff9 | 2926 | if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE) |
ebd21de4 | 2927 | finish_expr_stmt (build_aggr_init (baseref, elt, 0, complain)); |
8d89508b | 2928 | else |
ebd21de4 | 2929 | finish_expr_stmt (cp_build_modify_expr (baseref, NOP_EXPR, |
2930 | elt, complain)); | |
f47c1747 | 2931 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
8d89508b | 2932 | |
ebd21de4 | 2933 | finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0, |
2934 | complain)); | |
2935 | finish_expr_stmt (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, | |
2936 | complain)); | |
471086d6 | 2937 | } |
471086d6 | 2938 | |
8d89508b | 2939 | /* Clear out INIT so that we don't get confused below. */ |
2940 | init = NULL_TREE; | |
471086d6 | 2941 | } |
8d89508b | 2942 | else if (from_array) |
471086d6 | 2943 | { |
8d89508b | 2944 | if (init) |
d748d5cd | 2945 | /* OK, we set base2 above. */; |
8d89508b | 2946 | else if (TYPE_LANG_SPECIFIC (type) |
2947 | && TYPE_NEEDS_CONSTRUCTING (type) | |
2948 | && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type)) | |
2949 | { | |
ebd21de4 | 2950 | if (complain & tf_error) |
2951 | error ("initializer ends prematurely"); | |
8d89508b | 2952 | return error_mark_node; |
2953 | } | |
2954 | } | |
471086d6 | 2955 | |
8d89508b | 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 | |
435a15bf | 2958 | already initialized all the elements. |
2959 | ||
2960 | We do need to keep going if we're copying an array. */ | |
2961 | ||
2962 | if (from_array | |
0152e879 | 2963 | || ((TYPE_NEEDS_CONSTRUCTING (type) || explicit_value_init_p) |
5d844ba2 | 2964 | && ! (host_integerp (maxindex, 0) |
a0c2c45b | 2965 | && (num_initialized_elts |
5d844ba2 | 2966 | == tree_low_cst (maxindex, 0) + 1)))) |
8d89508b | 2967 | { |
e2a136cd | 2968 | /* If the ITERATOR is equal to -1, then we don't have to loop; |
8d89508b | 2969 | we've already initialized all the elements. */ |
805e22b2 | 2970 | tree for_stmt; |
b48733fd | 2971 | tree elt_init; |
687a1c50 | 2972 | tree to; |
b48733fd | 2973 | |
805e22b2 | 2974 | for_stmt = begin_for_stmt (); |
2975 | finish_for_init_stmt (for_stmt); | |
dffc85a4 | 2976 | finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator, |
2977 | build_int_cst (TREE_TYPE (iterator), -1)), | |
805e22b2 | 2978 | for_stmt); |
ebd21de4 | 2979 | finish_for_expr (cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, |
2980 | complain), | |
805e22b2 | 2981 | for_stmt); |
471086d6 | 2982 | |
687a1c50 | 2983 | to = build1 (INDIRECT_REF, type, base); |
2984 | ||
471086d6 | 2985 | if (from_array) |
2986 | { | |
471086d6 | 2987 | tree from; |
2988 | ||
2989 | if (base2) | |
2990 | from = build1 (INDIRECT_REF, itype, base2); | |
2991 | else | |
2992 | from = NULL_TREE; | |
2993 | ||
2994 | if (from_array == 2) | |
ebd21de4 | 2995 | elt_init = cp_build_modify_expr (to, NOP_EXPR, from, |
2996 | complain); | |
471086d6 | 2997 | else if (TYPE_NEEDS_CONSTRUCTING (type)) |
ebd21de4 | 2998 | elt_init = build_aggr_init (to, from, 0, complain); |
471086d6 | 2999 | else if (from) |
ebd21de4 | 3000 | elt_init = cp_build_modify_expr (to, NOP_EXPR, from, |
3001 | complain); | |
471086d6 | 3002 | else |
092b1d6f | 3003 | gcc_unreachable (); |
471086d6 | 3004 | } |
3005 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
3006 | { | |
3007 | if (init != 0) | |
a3691386 | 3008 | sorry |
3009 | ("cannot initialize multi-dimensional array with initializer"); | |
3010 | elt_init = build_vec_init (build1 (INDIRECT_REF, type, base), | |
074ab442 | 3011 | 0, 0, |
0152e879 | 3012 | explicit_value_init_p, |
ebd21de4 | 3013 | 0, complain); |
b48733fd | 3014 | } |
0152e879 | 3015 | else if (explicit_value_init_p) |
3016 | elt_init = build2 (INIT_EXPR, type, to, | |
3017 | build_value_init (type)); | |
b48733fd | 3018 | else |
0152e879 | 3019 | { |
3020 | gcc_assert (TYPE_NEEDS_CONSTRUCTING (type)); | |
3021 | elt_init = build_aggr_init (to, init, 0, complain); | |
3022 | } | |
9031d10b | 3023 | |
4bd132ff | 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; | |
471086d6 | 3027 | |
ebd21de4 | 3028 | finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0, |
3029 | complain)); | |
471086d6 | 3030 | if (base2) |
ebd21de4 | 3031 | finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0, |
3032 | complain)); | |
ede3024b | 3033 | |
805e22b2 | 3034 | finish_for_stmt (for_stmt); |
471086d6 | 3035 | } |
8d89508b | 3036 | |
3037 | /* Make sure to cleanup any partially constructed elements. */ | |
a3691386 | 3038 | if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
3039 | && from_array != 2) | |
b48733fd | 3040 | { |
3041 | tree e; | |
8e70fb09 | 3042 | tree m = cp_build_binary_op (input_location, |
3043 | MINUS_EXPR, maxindex, iterator, | |
ebd21de4 | 3044 | complain); |
34b1bc3b | 3045 | |
3046 | /* Flatten multi-dimensional array since build_vec_delete only | |
3047 | expects one-dimensional array. */ | |
3048 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8e70fb09 | 3049 | m = cp_build_binary_op (input_location, |
3050 | MULT_EXPR, m, | |
ebd21de4 | 3051 | array_type_nelts_total (type), |
3052 | complain); | |
471086d6 | 3053 | |
18a4cb16 | 3054 | finish_cleanup_try_block (try_block); |
9031d10b | 3055 | e = build_vec_delete_1 (rval, m, |
36145d1d | 3056 | inner_elt_type, sfk_base_destructor, |
b48733fd | 3057 | /*use_global_delete=*/0); |
b48733fd | 3058 | finish_cleanup (e, try_block); |
3059 | } | |
3060 | ||
face0cb7 | 3061 | /* The value of the array initialization is the array itself, RVAL |
3062 | is a pointer to the first element. */ | |
2363ef00 | 3063 | finish_stmt_expr_expr (rval, stmt_expr); |
b48733fd | 3064 | |
4bd132ff | 3065 | stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); |
face0cb7 | 3066 | |
79b458ae | 3067 | /* Now make the result have the correct type. */ |
3068 | if (TREE_CODE (atype) == ARRAY_TYPE) | |
3069 | { | |
3070 | atype = build_pointer_type (atype); | |
3071 | stmt_expr = build1 (NOP_EXPR, atype, stmt_expr); | |
f08923b3 | 3072 | stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain); |
b6879aae | 3073 | TREE_NO_WARNING (stmt_expr) = 1; |
79b458ae | 3074 | } |
9031d10b | 3075 | |
a08e60ae | 3076 | current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; |
b48733fd | 3077 | return stmt_expr; |
471086d6 | 3078 | } |
3079 | ||
675996d9 | 3080 | /* Call the DTOR_KIND destructor for EXP. FLAGS are as for |
3081 | build_delete. */ | |
f04596da | 3082 | |
3083 | static tree | |
6c5ad428 | 3084 | build_dtor_call (tree exp, special_function_kind dtor_kind, int flags) |
f04596da | 3085 | { |
675996d9 | 3086 | tree name; |
ef4534a3 | 3087 | tree fn; |
675996d9 | 3088 | switch (dtor_kind) |
3089 | { | |
3090 | case sfk_complete_destructor: | |
3091 | name = complete_dtor_identifier; | |
3092 | break; | |
3093 | ||
3094 | case sfk_base_destructor: | |
3095 | name = base_dtor_identifier; | |
3096 | break; | |
3097 | ||
3098 | case sfk_deleting_destructor: | |
3099 | name = deleting_dtor_identifier; | |
3100 | break; | |
3101 | ||
3102 | default: | |
092b1d6f | 3103 | gcc_unreachable (); |
675996d9 | 3104 | } |
ef4534a3 | 3105 | fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2); |
9031d10b | 3106 | return build_new_method_call (exp, fn, |
f352a3fb | 3107 | /*args=*/NULL, |
ef4534a3 | 3108 | /*conversion_path=*/NULL_TREE, |
393f878f | 3109 | flags, |
ebd21de4 | 3110 | /*fn_p=*/NULL, |
3111 | tf_warning_or_error); | |
f04596da | 3112 | } |
3113 | ||
471086d6 | 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. | |
675996d9 | 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. | |
471086d6 | 3119 | |
3120 | FLAGS is the logical disjunction of zero or more LOOKUP_ | |
52616263 | 3121 | flags. See cp-tree.h for more info. */ |
96624a9e | 3122 | |
471086d6 | 3123 | tree |
6c5ad428 | 3124 | build_delete (tree type, tree addr, special_function_kind auto_delete, |
3125 | int flags, int use_global_delete) | |
471086d6 | 3126 | { |
471086d6 | 3127 | tree expr; |
471086d6 | 3128 | |
3129 | if (addr == error_mark_node) | |
3130 | return error_mark_node; | |
3131 | ||
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; | |
3136 | ||
3137 | type = TYPE_MAIN_VARIANT (type); | |
3138 | ||
fbb73d9b | 3139 | addr = mark_rvalue_use (addr); |
3140 | ||
471086d6 | 3141 | if (TREE_CODE (type) == POINTER_TYPE) |
3142 | { | |
8a0fd506 | 3143 | bool complete_p = true; |
3144 | ||
bb0726a1 | 3145 | type = TYPE_MAIN_VARIANT (TREE_TYPE (type)); |
471086d6 | 3146 | if (TREE_CODE (type) == ARRAY_TYPE) |
3147 | goto handle_array; | |
e097fb33 | 3148 | |
8a0fd506 | 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 | |
3154 | operator. */ | |
3155 | if (!VOID_TYPE_P (type)) | |
471086d6 | 3156 | { |
8a0fd506 | 3157 | complete_type (type); |
3158 | if (!COMPLETE_TYPE_P (type)) | |
3159 | { | |
a52d5726 | 3160 | if (warning (0, "possible problem detected in invocation of " |
3161 | "delete operator:")) | |
3162 | { | |
3163 | cxx_incomplete_type_diagnostic (addr, type, DK_WARNING); | |
5bcc316e | 3164 | inform (input_location, "neither the destructor nor the class-specific " |
a52d5726 | 3165 | "operator delete will be called, even if they are " |
3166 | "declared when the class is defined."); | |
3167 | } | |
8a0fd506 | 3168 | complete_p = false; |
3169 | } | |
471086d6 | 3170 | } |
95397ff9 | 3171 | if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type)) |
8a0fd506 | 3172 | /* Call the builtin operator delete. */ |
3173 | return build_builtin_delete_call (addr); | |
471086d6 | 3174 | if (TREE_SIDE_EFFECTS (addr)) |
3175 | addr = save_expr (addr); | |
bb0726a1 | 3176 | |
331bc0ad | 3177 | /* Throw away const and volatile on target type of addr. */ |
a74e8896 | 3178 | addr = convert_force (build_pointer_type (type), addr, 0); |
471086d6 | 3179 | } |
3180 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
3181 | { | |
3182 | handle_array: | |
9031d10b | 3183 | |
5c352956 | 3184 | if (TYPE_DOMAIN (type) == NULL_TREE) |
3185 | { | |
905d4035 | 3186 | error ("unknown array size in delete"); |
5c352956 | 3187 | return error_mark_node; |
3188 | } | |
471086d6 | 3189 | return build_vec_delete (addr, array_type_nelts (type), |
23033779 | 3190 | auto_delete, use_global_delete); |
471086d6 | 3191 | } |
3192 | else | |
3193 | { | |
3194 | /* Don't check PROTECT here; leave that decision to the | |
3195 | destructor. If the destructor is accessible, call it, | |
3196 | else report error. */ | |
ebd21de4 | 3197 | addr = cp_build_unary_op (ADDR_EXPR, addr, 0, tf_warning_or_error); |
471086d6 | 3198 | if (TREE_SIDE_EFFECTS (addr)) |
3199 | addr = save_expr (addr); | |
3200 | ||
06382f61 | 3201 | addr = convert_force (build_pointer_type (type), addr, 0); |
471086d6 | 3202 | } |
3203 | ||
95397ff9 | 3204 | gcc_assert (MAYBE_CLASS_TYPE_P (type)); |
471086d6 | 3205 | |
89e923d8 | 3206 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) |
471086d6 | 3207 | { |
06382f61 | 3208 | if (auto_delete != sfk_deleting_destructor) |
471086d6 | 3209 | return void_zero_node; |
3210 | ||
074ab442 | 3211 | return build_op_delete_call (DELETE_EXPR, addr, |
3212 | cxx_sizeof_nowarn (type), | |
393f878f | 3213 | use_global_delete, |
3214 | /*placement=*/NULL_TREE, | |
3215 | /*alloc_fn=*/NULL_TREE); | |
471086d6 | 3216 | } |
52616263 | 3217 | else |
471086d6 | 3218 | { |
56a58a8c | 3219 | tree head = NULL_TREE; |
94f3b32d | 3220 | tree do_delete = NULL_TREE; |
b465397d | 3221 | tree ifexp; |
94f3b32d | 3222 | |
ed36f1cf | 3223 | if (CLASSTYPE_LAZY_DESTRUCTOR (type)) |
3224 | lazily_declare_fn (sfk_destructor, type); | |
52616263 | 3225 | |
b429d3ee | 3226 | /* For `::delete x', we must not use the deleting destructor |
3227 | since then we would not be sure to get the global `operator | |
3228 | delete'. */ | |
675996d9 | 3229 | if (use_global_delete && auto_delete == sfk_deleting_destructor) |
94f3b32d | 3230 | { |
2aabb069 | 3231 | /* We will use ADDR multiple times so we must save it. */ |
3232 | addr = save_expr (addr); | |
56a58a8c | 3233 | head = get_target_expr (build_headof (addr)); |
47cd6605 | 3234 | /* Delete the object. */ |
56a58a8c | 3235 | do_delete = build_builtin_delete_call (head); |
675996d9 | 3236 | /* Otherwise, treat this like a complete object destructor |
3237 | call. */ | |
3238 | auto_delete = sfk_complete_destructor; | |
94f3b32d | 3239 | } |
b429d3ee | 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) | |
3245 | { | |
2aabb069 | 3246 | /* We will use ADDR multiple times so we must save it. */ |
3247 | addr = save_expr (addr); | |
3248 | /* Build the call. */ | |
b429d3ee | 3249 | do_delete = build_op_delete_call (DELETE_EXPR, |
3250 | addr, | |
d3a4d008 | 3251 | cxx_sizeof_nowarn (type), |
1611df57 | 3252 | /*global_p=*/false, |
393f878f | 3253 | /*placement=*/NULL_TREE, |
3254 | /*alloc_fn=*/NULL_TREE); | |
b429d3ee | 3255 | /* Call the complete object destructor. */ |
3256 | auto_delete = sfk_complete_destructor; | |
3257 | } | |
7203b0e1 | 3258 | else if (auto_delete == sfk_deleting_destructor |
3259 | && TYPE_GETS_REG_DELETE (type)) | |
3260 | { | |
3261 | /* Make sure we have access to the member op delete, even though | |
3262 | we'll actually be calling it from the destructor. */ | |
d3a4d008 | 3263 | build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), |
074ab442 | 3264 | /*global_p=*/false, |
393f878f | 3265 | /*placement=*/NULL_TREE, |
3266 | /*alloc_fn=*/NULL_TREE); | |
7203b0e1 | 3267 | } |
471086d6 | 3268 | |
f08923b3 | 3269 | expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL, |
ebd21de4 | 3270 | tf_warning_or_error), |
2aabb069 | 3271 | auto_delete, flags); |
b465397d | 3272 | if (do_delete) |
831d52a2 | 3273 | expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete); |
63b1d638 | 3274 | |
56a58a8c | 3275 | /* We need to calculate this before the dtor changes the vptr. */ |
3276 | if (head) | |
3277 | expr = build2 (COMPOUND_EXPR, void_type_node, head, expr); | |
3278 | ||
b465397d | 3279 | if (flags & LOOKUP_DESTRUCTOR) |
3280 | /* Explicit destructor call; don't check for null pointer. */ | |
3281 | ifexp = integer_one_node; | |
471086d6 | 3282 | else |
b465397d | 3283 | /* Handle deleting a null pointer. */ |
8e70fb09 | 3284 | ifexp = fold (cp_build_binary_op (input_location, |
3285 | NE_EXPR, addr, integer_zero_node, | |
ebd21de4 | 3286 | tf_warning_or_error)); |
471086d6 | 3287 | |
b465397d | 3288 | if (ifexp != integer_one_node) |
831d52a2 | 3289 | expr = build3 (COND_EXPR, void_type_node, |
3290 | ifexp, expr, void_zero_node); | |
471086d6 | 3291 | |
471086d6 | 3292 | return expr; |
3293 | } | |
52616263 | 3294 | } |
471086d6 | 3295 | |
52616263 | 3296 | /* At the beginning of a destructor, push cleanups that will call the |
3297 | destructors for our base classes and members. | |
6d55e442 | 3298 | |
8ef5085e | 3299 | Called from begin_destructor_body. */ |
471086d6 | 3300 | |
52616263 | 3301 | void |
eb32e911 | 3302 | push_base_cleanups (void) |
52616263 | 3303 | { |
f6cc6a08 | 3304 | tree binfo, base_binfo; |
3305 | int i; | |
52616263 | 3306 | tree member; |
3307 | tree expr; | |
046bfc77 | 3308 | VEC(tree,gc) *vbases; |
471086d6 | 3309 | |
52616263 | 3310 | /* Run destructors for all virtual baseclasses. */ |
1f0b839e | 3311 | if (CLASSTYPE_VBASECLASSES (current_class_type)) |
52616263 | 3312 | { |
52616263 | 3313 | tree cond = (condition_conversion |
831d52a2 | 3314 | (build2 (BIT_AND_EXPR, integer_type_node, |
3315 | current_in_charge_parm, | |
3316 | integer_two_node))); | |
471086d6 | 3317 | |
97c118b9 | 3318 | /* The CLASSTYPE_VBASECLASSES vector is in initialization |
52616263 | 3319 | order, which is also the right order for pushing cleanups. */ |
930bdacf | 3320 | for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0; |
3321 | VEC_iterate (tree, vbases, i, base_binfo); i++) | |
471086d6 | 3322 | { |
930bdacf | 3323 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))) |
471086d6 | 3324 | { |
9031d10b | 3325 | expr = build_special_member_call (current_class_ref, |
f70cb9e6 | 3326 | base_dtor_identifier, |
f352a3fb | 3327 | NULL, |
930bdacf | 3328 | base_binfo, |
9031d10b | 3329 | (LOOKUP_NORMAL |
ebd21de4 | 3330 | | LOOKUP_NONVIRTUAL), |
3331 | tf_warning_or_error); | |
831d52a2 | 3332 | expr = build3 (COND_EXPR, void_type_node, cond, |
3333 | expr, void_zero_node); | |
52616263 | 3334 | finish_decl_cleanup (NULL_TREE, expr); |
471086d6 | 3335 | } |
3336 | } | |
52616263 | 3337 | } |
3338 | ||
52616263 | 3339 | /* Take care of the remaining baseclasses. */ |
f6cc6a08 | 3340 | for (binfo = TYPE_BINFO (current_class_type), i = 0; |
3341 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
52616263 | 3342 | { |
52616263 | 3343 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)) |
57c28194 | 3344 | || BINFO_VIRTUAL_P (base_binfo)) |
52616263 | 3345 | continue; |
3346 | ||
9031d10b | 3347 | expr = build_special_member_call (current_class_ref, |
f70cb9e6 | 3348 | base_dtor_identifier, |
f352a3fb | 3349 | NULL, base_binfo, |
ebd21de4 | 3350 | LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, |
3351 | tf_warning_or_error); | |
52616263 | 3352 | finish_decl_cleanup (NULL_TREE, expr); |
3353 | } | |
3354 | ||
3355 | for (member = TYPE_FIELDS (current_class_type); member; | |
3356 | member = TREE_CHAIN (member)) | |
3357 | { | |
e9432e8f | 3358 | if (TREE_TYPE (member) == error_mark_node |
3359 | || TREE_CODE (member) != FIELD_DECL | |
3360 | || DECL_ARTIFICIAL (member)) | |
52616263 | 3361 | continue; |
3362 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member))) | |
3363 | { | |
9031d10b | 3364 | tree this_member = (build_class_member_access_expr |
3365 | (current_class_ref, member, | |
4ac852cb | 3366 | /*access_path=*/NULL_TREE, |
ebd21de4 | 3367 | /*preserve_reference=*/false, |
3368 | tf_warning_or_error)); | |
52616263 | 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, | |
3373 | 0); | |
3374 | finish_decl_cleanup (NULL_TREE, expr); | |
3375 | } | |
471086d6 | 3376 | } |
3377 | } | |
3378 | ||
471086d6 | 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. | |
471086d6 | 3383 | This function expands (or synthesizes) these calls itself. |
3384 | AUTO_DELETE_VEC says whether the container (vector) should be deallocated. | |
471086d6 | 3385 | |
3386 | This also calls delete for virtual baseclasses of elements of the vector. | |
3387 | ||
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.) */ | |
96624a9e | 3394 | |
471086d6 | 3395 | tree |
6c5ad428 | 3396 | build_vec_delete (tree base, tree maxindex, |
3397 | special_function_kind auto_delete_vec, int use_global_delete) | |
471086d6 | 3398 | { |
ce28ee2e | 3399 | tree type; |
95873270 | 3400 | tree rval; |
3401 | tree base_init = NULL_TREE; | |
471086d6 | 3402 | |
ce28ee2e | 3403 | type = TREE_TYPE (base); |
5c352956 | 3404 | |
ce28ee2e | 3405 | if (TREE_CODE (type) == POINTER_TYPE) |
471086d6 | 3406 | { |
3407 | /* Step back one from start of vector, and read dimension. */ | |
89e923d8 | 3408 | tree cookie_addr; |
75a70cf9 | 3409 | tree size_ptr_type = build_pointer_type (sizetype); |
89e923d8 | 3410 | |
6853f4fa | 3411 | if (TREE_SIDE_EFFECTS (base)) |
95873270 | 3412 | { |
3413 | base_init = get_target_expr (base); | |
3414 | base = TARGET_EXPR_SLOT (base_init); | |
3415 | } | |
30de7d91 | 3416 | type = strip_array_types (TREE_TYPE (type)); |
389dd41b | 3417 | cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR, |
3418 | sizetype, TYPE_SIZE_UNIT (sizetype)); | |
0de36bdb | 3419 | cookie_addr = build2 (POINTER_PLUS_EXPR, |
75a70cf9 | 3420 | size_ptr_type, |
3421 | fold_convert (size_ptr_type, base), | |
0de36bdb | 3422 | cookie_addr); |
f08923b3 | 3423 | maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, tf_warning_or_error); |
471086d6 | 3424 | } |
ce28ee2e | 3425 | else if (TREE_CODE (type) == ARRAY_TYPE) |
471086d6 | 3426 | { |
331bc0ad | 3427 | /* Get the total number of things in the array, maxindex is a |
3428 | bad name. */ | |
ce28ee2e | 3429 | maxindex = array_type_nelts_total (type); |
89e923d8 | 3430 | type = strip_array_types (type); |
ebd21de4 | 3431 | base = cp_build_unary_op (ADDR_EXPR, base, 1, tf_warning_or_error); |
6853f4fa | 3432 | if (TREE_SIDE_EFFECTS (base)) |
95873270 | 3433 | { |
3434 | base_init = get_target_expr (base); | |
3435 | base = TARGET_EXPR_SLOT (base_init); | |
3436 | } | |
471086d6 | 3437 | } |
3438 | else | |
3439 | { | |
63b1d638 | 3440 | if (base != error_mark_node) |
905d4035 | 3441 | error ("type to vector delete is neither pointer or array type"); |
471086d6 | 3442 | return error_mark_node; |
3443 | } | |
471086d6 | 3444 | |
95873270 | 3445 | rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec, |
ce28ee2e | 3446 | use_global_delete); |
95873270 | 3447 | if (base_init) |
831d52a2 | 3448 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval); |
95873270 | 3449 | |
3450 | return rval; | |
471086d6 | 3451 | } |