]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Handle initialization things in C++. |
d1e082c2 | 2 | Copyright (C) 1987-2013 Free Software Foundation, Inc. |
8d08fdba MS |
3 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
4 | ||
f5adbb8d | 5 | This file is part of GCC. |
8d08fdba | 6 | |
f5adbb8d | 7 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 8 | it under the terms of the GNU General Public License as published by |
e77f031d | 9 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
10 | any later version. |
11 | ||
f5adbb8d | 12 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba | 20 | |
e92cc029 | 21 | /* High-level class interface. */ |
8d08fdba MS |
22 | |
23 | #include "config.h" | |
8d052bc7 | 24 | #include "system.h" |
4977bab6 ZW |
25 | #include "coretypes.h" |
26 | #include "tm.h" | |
8d08fdba | 27 | #include "tree.h" |
8d08fdba MS |
28 | #include "cp-tree.h" |
29 | #include "flags.h" | |
46e995e0 | 30 | #include "target.h" |
8d08fdba | 31 | |
2a3398e1 NS |
32 | static bool begin_init_stmts (tree *, tree *); |
33 | static tree finish_init_stmts (bool, tree, tree); | |
2282d28d | 34 | static void construct_virtual_base (tree, tree); |
5ade1ed2 DG |
35 | static void expand_aggr_init_1 (tree, tree, tree, tree, int, tsubst_flags_t); |
36 | static void expand_default_init (tree, tree, tree, tree, int, tsubst_flags_t); | |
2282d28d | 37 | static void perform_member_init (tree, tree); |
362efdc1 NN |
38 | static tree build_builtin_delete_call (tree); |
39 | static int member_init_ok_or_else (tree, tree, tree); | |
40 | static void expand_virtual_init (tree, tree); | |
2282d28d | 41 | static tree sort_mem_initializers (tree, tree); |
362efdc1 NN |
42 | static tree initializing_context (tree); |
43 | static void expand_cleanup_for_base (tree, tree); | |
362efdc1 | 44 | static tree dfs_initialize_vtbl_ptrs (tree, void *); |
362efdc1 NN |
45 | static tree build_field_list (tree, tree, int *); |
46 | static tree build_vtbl_address (tree); | |
40bb78ad | 47 | static int diagnose_uninitialized_cst_or_ref_member_1 (tree, tree, bool, bool); |
8d08fdba | 48 | |
3dbc07b6 MM |
49 | /* We are about to generate some complex initialization code. |
50 | Conceptually, it is all a single expression. However, we may want | |
51 | to include conditionals, loops, and other such statement-level | |
52 | constructs. Therefore, we build the initialization code inside a | |
53 | statement-expression. This function starts such an expression. | |
54 | STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function; | |
55 | pass them back to finish_init_stmts when the expression is | |
56 | complete. */ | |
57 | ||
2a3398e1 | 58 | static bool |
362efdc1 | 59 | begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p) |
3dbc07b6 | 60 | { |
38e01f9e | 61 | bool is_global = !building_stmt_list_p (); |
c8094d83 | 62 | |
2a3398e1 | 63 | *stmt_expr_p = begin_stmt_expr (); |
325c3691 | 64 | *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE); |
2a3398e1 NS |
65 | |
66 | return is_global; | |
3dbc07b6 MM |
67 | } |
68 | ||
69 | /* Finish out the statement-expression begun by the previous call to | |
70 | begin_init_stmts. Returns the statement-expression itself. */ | |
71 | ||
2a3398e1 NS |
72 | static tree |
73 | finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt) | |
c8094d83 | 74 | { |
7a3397c7 | 75 | finish_compound_stmt (compound_stmt); |
c8094d83 | 76 | |
303b7406 | 77 | stmt_expr = finish_stmt_expr (stmt_expr, true); |
3dbc07b6 | 78 | |
38e01f9e | 79 | gcc_assert (!building_stmt_list_p () == is_global); |
c8094d83 | 80 | |
3dbc07b6 MM |
81 | return stmt_expr; |
82 | } | |
83 | ||
84 | /* Constructors */ | |
85 | ||
338d90b8 NS |
86 | /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base |
87 | which we want to initialize the vtable pointer for, DATA is | |
88 | TREE_LIST whose TREE_VALUE is the this ptr expression. */ | |
7177d104 | 89 | |
d569399b | 90 | static tree |
362efdc1 | 91 | dfs_initialize_vtbl_ptrs (tree binfo, void *data) |
d569399b | 92 | { |
5d5a519f NS |
93 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
94 | return dfs_skip_bases; | |
c8094d83 | 95 | |
5d5a519f | 96 | if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo)) |
d569399b MM |
97 | { |
98 | tree base_ptr = TREE_VALUE ((tree) data); | |
7177d104 | 99 | |
a271590a PC |
100 | base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1, |
101 | tf_warning_or_error); | |
d569399b MM |
102 | |
103 | expand_virtual_init (binfo, base_ptr); | |
104 | } | |
7177d104 | 105 | |
d569399b MM |
106 | return NULL_TREE; |
107 | } | |
108 | ||
cf2e003b MM |
109 | /* Initialize all the vtable pointers in the object pointed to by |
110 | ADDR. */ | |
e92cc029 | 111 | |
8d08fdba | 112 | void |
362efdc1 | 113 | initialize_vtbl_ptrs (tree addr) |
8d08fdba | 114 | { |
cf2e003b MM |
115 | tree list; |
116 | tree type; | |
117 | ||
118 | type = TREE_TYPE (TREE_TYPE (addr)); | |
119 | list = build_tree_list (type, addr); | |
d569399b | 120 | |
bbd15aac | 121 | /* Walk through the hierarchy, initializing the vptr in each base |
1f5a253a | 122 | class. We do these in pre-order because we can't find the virtual |
3461fba7 NS |
123 | bases for a class until we've initialized the vtbl for that |
124 | class. */ | |
5d5a519f | 125 | dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list); |
8d08fdba | 126 | } |
d569399b | 127 | |
17bbb839 MM |
128 | /* Return an expression for the zero-initialization of an object with |
129 | type T. This expression will either be a constant (in the case | |
130 | that T is a scalar), or a CONSTRUCTOR (in the case that T is an | |
b43d1bde PC |
131 | aggregate), or NULL (in the case that T does not require |
132 | initialization). In either case, the value can be used as | |
133 | DECL_INITIAL for a decl of the indicated TYPE; it is a valid static | |
134 | initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS | |
135 | is the number of elements in the array. If STATIC_STORAGE_P is | |
136 | TRUE, initializers are only generated for entities for which | |
1cb8292f | 137 | zero-initialization does not simply mean filling the storage with |
e33eba75 JJ |
138 | zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field, |
139 | subfields with bit positions at or above that bit size shouldn't | |
a8c1d899 JM |
140 | be added. Note that this only works when the result is assigned |
141 | to a base COMPONENT_REF; if we only have a pointer to the base subobject, | |
142 | expand_assignment will end up clearing the full size of TYPE. */ | |
94e6e4c4 | 143 | |
e33eba75 JJ |
144 | static tree |
145 | build_zero_init_1 (tree type, tree nelts, bool static_storage_p, | |
146 | tree field_size) | |
94e6e4c4 | 147 | { |
17bbb839 MM |
148 | tree init = NULL_TREE; |
149 | ||
150 | /* [dcl.init] | |
151 | ||
0fcedd9c | 152 | To zero-initialize an object of type T means: |
17bbb839 MM |
153 | |
154 | -- if T is a scalar type, the storage is set to the value of zero | |
0cbd7506 | 155 | converted to T. |
17bbb839 MM |
156 | |
157 | -- if T is a non-union class type, the storage for each nonstatic | |
0cbd7506 | 158 | data member and each base-class subobject is zero-initialized. |
17bbb839 MM |
159 | |
160 | -- if T is a union type, the storage for its first data member is | |
0cbd7506 | 161 | zero-initialized. |
17bbb839 MM |
162 | |
163 | -- if T is an array type, the storage for each element is | |
0cbd7506 | 164 | zero-initialized. |
17bbb839 MM |
165 | |
166 | -- if T is a reference type, no initialization is performed. */ | |
94e6e4c4 | 167 | |
50bc768d | 168 | gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST); |
7a1d37e9 | 169 | |
17bbb839 MM |
170 | if (type == error_mark_node) |
171 | ; | |
172 | else if (static_storage_p && zero_init_p (type)) | |
173 | /* In order to save space, we do not explicitly build initializers | |
174 | for items that do not need them. GCC's semantics are that | |
175 | items with static storage duration that are not otherwise | |
176 | initialized are initialized to zero. */ | |
177 | ; | |
66b1156a | 178 | else if (TYPE_PTR_OR_PTRMEM_P (type)) |
89401152 | 179 | init = convert (type, nullptr_node); |
b8063b29 | 180 | else if (SCALAR_TYPE_P (type)) |
908e152c | 181 | init = convert (type, integer_zero_node); |
5621a5d7 | 182 | else if (RECORD_OR_UNION_CODE_P (TREE_CODE (type))) |
17bbb839 MM |
183 | { |
184 | tree field; | |
9771b263 | 185 | vec<constructor_elt, va_gc> *v = NULL; |
17bbb839 | 186 | |
17bbb839 | 187 | /* Iterate over the fields, building initializations. */ |
910ad8de | 188 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
17bbb839 MM |
189 | { |
190 | if (TREE_CODE (field) != FIELD_DECL) | |
191 | continue; | |
192 | ||
e33eba75 JJ |
193 | /* Don't add virtual bases for base classes if they are beyond |
194 | the size of the current field, that means it is present | |
195 | somewhere else in the object. */ | |
196 | if (field_size) | |
197 | { | |
198 | tree bitpos = bit_position (field); | |
199 | if (TREE_CODE (bitpos) == INTEGER_CST | |
200 | && !tree_int_cst_lt (bitpos, field_size)) | |
201 | continue; | |
202 | } | |
203 | ||
17bbb839 MM |
204 | /* Note that for class types there will be FIELD_DECLs |
205 | corresponding to base classes as well. Thus, iterating | |
206 | over TYPE_FIELDs will result in correct initialization of | |
207 | all of the subobjects. */ | |
32a11c08 | 208 | if (!static_storage_p || !zero_init_p (TREE_TYPE (field))) |
4038c495 | 209 | { |
e33eba75 JJ |
210 | tree new_field_size |
211 | = (DECL_FIELD_IS_BASE (field) | |
212 | && DECL_SIZE (field) | |
213 | && TREE_CODE (DECL_SIZE (field)) == INTEGER_CST) | |
214 | ? DECL_SIZE (field) : NULL_TREE; | |
215 | tree value = build_zero_init_1 (TREE_TYPE (field), | |
216 | /*nelts=*/NULL_TREE, | |
217 | static_storage_p, | |
218 | new_field_size); | |
b43d1bde PC |
219 | if (value) |
220 | CONSTRUCTOR_APPEND_ELT(v, field, value); | |
4038c495 | 221 | } |
17bbb839 MM |
222 | |
223 | /* For unions, only the first field is initialized. */ | |
224 | if (TREE_CODE (type) == UNION_TYPE) | |
225 | break; | |
226 | } | |
4038c495 | 227 | |
0fcedd9c JM |
228 | /* Build a constructor to contain the initializations. */ |
229 | init = build_constructor (type, v); | |
17bbb839 MM |
230 | } |
231 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
94e6e4c4 | 232 | { |
17bbb839 | 233 | tree max_index; |
9771b263 | 234 | vec<constructor_elt, va_gc> *v = NULL; |
17bbb839 | 235 | |
17bbb839 | 236 | /* Iterate over the array elements, building initializations. */ |
6b6c8106 | 237 | if (nelts) |
db3927fb AH |
238 | max_index = fold_build2_loc (input_location, |
239 | MINUS_EXPR, TREE_TYPE (nelts), | |
7866705a | 240 | nelts, integer_one_node); |
6b6c8106 SB |
241 | else |
242 | max_index = array_type_nelts (type); | |
9bdb04a2 AP |
243 | |
244 | /* If we have an error_mark here, we should just return error mark | |
245 | as we don't know the size of the array yet. */ | |
246 | if (max_index == error_mark_node) | |
247 | return error_mark_node; | |
50bc768d | 248 | gcc_assert (TREE_CODE (max_index) == INTEGER_CST); |
7a1d37e9 | 249 | |
a8e6c82a MM |
250 | /* A zero-sized array, which is accepted as an extension, will |
251 | have an upper bound of -1. */ | |
252 | if (!tree_int_cst_equal (max_index, integer_minus_one_node)) | |
94763647 | 253 | { |
f32682ca | 254 | constructor_elt ce; |
4038c495 | 255 | |
b01f0d13 AP |
256 | /* If this is a one element array, we just use a regular init. */ |
257 | if (tree_int_cst_equal (size_zero_node, max_index)) | |
f32682ca | 258 | ce.index = size_zero_node; |
b01f0d13 | 259 | else |
f32682ca | 260 | ce.index = build2 (RANGE_EXPR, sizetype, size_zero_node, |
4038c495 | 261 | max_index); |
c8094d83 | 262 | |
f32682ca | 263 | ce.value = build_zero_init_1 (TREE_TYPE (type), |
e33eba75 JJ |
264 | /*nelts=*/NULL_TREE, |
265 | static_storage_p, NULL_TREE); | |
f11c7048 JJ |
266 | if (ce.value) |
267 | { | |
268 | vec_alloc (v, 1); | |
269 | v->quick_push (ce); | |
270 | } | |
94763647 | 271 | } |
c8094d83 | 272 | |
4038c495 GB |
273 | /* Build a constructor to contain the initializations. */ |
274 | init = build_constructor (type, v); | |
94e6e4c4 | 275 | } |
c846e8cd | 276 | else if (TREE_CODE (type) == VECTOR_TYPE) |
e8160c9a | 277 | init = build_zero_cst (type); |
94e6e4c4 | 278 | else |
8dc2b103 | 279 | gcc_assert (TREE_CODE (type) == REFERENCE_TYPE); |
94e6e4c4 | 280 | |
17bbb839 MM |
281 | /* In all cases, the initializer is a constant. */ |
282 | if (init) | |
51eed280 | 283 | TREE_CONSTANT (init) = 1; |
94e6e4c4 AO |
284 | |
285 | return init; | |
286 | } | |
287 | ||
e33eba75 JJ |
288 | /* Return an expression for the zero-initialization of an object with |
289 | type T. This expression will either be a constant (in the case | |
290 | that T is a scalar), or a CONSTRUCTOR (in the case that T is an | |
291 | aggregate), or NULL (in the case that T does not require | |
292 | initialization). In either case, the value can be used as | |
293 | DECL_INITIAL for a decl of the indicated TYPE; it is a valid static | |
294 | initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS | |
295 | is the number of elements in the array. If STATIC_STORAGE_P is | |
296 | TRUE, initializers are only generated for entities for which | |
297 | zero-initialization does not simply mean filling the storage with | |
298 | zero bytes. */ | |
299 | ||
300 | tree | |
301 | build_zero_init (tree type, tree nelts, bool static_storage_p) | |
302 | { | |
303 | return build_zero_init_1 (type, nelts, static_storage_p, NULL_TREE); | |
304 | } | |
305 | ||
0fcedd9c | 306 | /* Return a suitable initializer for value-initializing an object of type |
8f540f06 | 307 | TYPE, as described in [dcl.init]. */ |
0fcedd9c | 308 | |
8f540f06 | 309 | tree |
309714d4 | 310 | build_value_init (tree type, tsubst_flags_t complain) |
0fcedd9c JM |
311 | { |
312 | /* [dcl.init] | |
313 | ||
314 | To value-initialize an object of type T means: | |
315 | ||
316 | - if T is a class type (clause 9) with a user-provided constructor | |
317 | (12.1), then the default constructor for T is called (and the | |
318 | initialization is ill-formed if T has no accessible default | |
319 | constructor); | |
320 | ||
321 | - if T is a non-union class type without a user-provided constructor, | |
322 | then every non-static data member and base-class component of T is | |
323 | value-initialized;92) | |
324 | ||
325 | - if T is an array type, then each element is value-initialized; | |
326 | ||
327 | - otherwise, the object is zero-initialized. | |
328 | ||
329 | A program that calls for default-initialization or | |
330 | value-initialization of an entity of reference type is ill-formed. | |
331 | ||
332 | 92) Value-initialization for such a class object may be implemented by | |
333 | zero-initializing the object and then calling the default | |
334 | constructor. */ | |
335 | ||
95d7bdaa | 336 | /* The AGGR_INIT_EXPR tweaking below breaks in templates. */ |
14b1860e JJ |
337 | gcc_assert (!processing_template_decl |
338 | || (SCALAR_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)); | |
95d7bdaa | 339 | |
0fcedd9c JM |
340 | if (CLASS_TYPE_P (type)) |
341 | { | |
7b37a0c5 JM |
342 | /* Instead of the above, only consider the user-providedness of the |
343 | default constructor itself so value-initializing a class with an | |
344 | explicitly defaulted default constructor and another user-provided | |
345 | constructor works properly (c++std-core-19883). */ | |
346 | if (type_has_user_provided_default_constructor (type) | |
347 | || (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) | |
348 | && type_has_user_provided_constructor (type))) | |
844ae01d | 349 | return build_aggr_init_expr |
0fcedd9c JM |
350 | (type, |
351 | build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
c166b898 | 352 | NULL, type, LOOKUP_NORMAL, |
094484e7 | 353 | complain)); |
7b37a0c5 | 354 | else if (TYPE_HAS_COMPLEX_DFLT (type)) |
8f540f06 JM |
355 | { |
356 | /* This is a class that needs constructing, but doesn't have | |
357 | a user-provided constructor. So we need to zero-initialize | |
358 | the object and then call the implicitly defined ctor. | |
450a927a | 359 | This will be handled in simplify_aggr_init_expr. */ |
8f540f06 JM |
360 | tree ctor = build_special_member_call |
361 | (NULL_TREE, complete_ctor_identifier, | |
309714d4 | 362 | NULL, type, LOOKUP_NORMAL, complain); |
094484e7 | 363 | ctor = build_aggr_init_expr (type, ctor); |
272dc851 | 364 | if (ctor != error_mark_node) |
66403b38 | 365 | AGGR_INIT_ZERO_FIRST (ctor) = 1; |
8f540f06 JM |
366 | return ctor; |
367 | } | |
fd97a96a | 368 | } |
309714d4 | 369 | return build_value_init_noctor (type, complain); |
fd97a96a JM |
370 | } |
371 | ||
372 | /* Like build_value_init, but don't call the constructor for TYPE. Used | |
373 | for base initializers. */ | |
374 | ||
375 | tree | |
309714d4 | 376 | build_value_init_noctor (tree type, tsubst_flags_t complain) |
fd97a96a | 377 | { |
46a76d4b JM |
378 | if (!COMPLETE_TYPE_P (type)) |
379 | { | |
380 | if (complain & tf_error) | |
381 | error ("value-initialization of incomplete type %qT", type); | |
382 | return error_mark_node; | |
383 | } | |
4ddd8a74 JM |
384 | /* FIXME the class and array cases should just use digest_init once it is |
385 | SFINAE-enabled. */ | |
fd97a96a JM |
386 | if (CLASS_TYPE_P (type)) |
387 | { | |
7b37a0c5 | 388 | gcc_assert (!TYPE_HAS_COMPLEX_DFLT (type)); |
fd97a96a JM |
389 | |
390 | if (TREE_CODE (type) != UNION_TYPE) | |
0fcedd9c | 391 | { |
8f540f06 | 392 | tree field; |
9771b263 | 393 | vec<constructor_elt, va_gc> *v = NULL; |
0fcedd9c JM |
394 | |
395 | /* Iterate over the fields, building initializations. */ | |
910ad8de | 396 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
0fcedd9c JM |
397 | { |
398 | tree ftype, value; | |
399 | ||
400 | if (TREE_CODE (field) != FIELD_DECL) | |
401 | continue; | |
402 | ||
403 | ftype = TREE_TYPE (field); | |
404 | ||
0fcedd9c JM |
405 | /* We could skip vfields and fields of types with |
406 | user-defined constructors, but I think that won't improve | |
407 | performance at all; it should be simpler in general just | |
408 | to zero out the entire object than try to only zero the | |
409 | bits that actually need it. */ | |
410 | ||
411 | /* Note that for class types there will be FIELD_DECLs | |
412 | corresponding to base classes as well. Thus, iterating | |
413 | over TYPE_FIELDs will result in correct initialization of | |
414 | all of the subobjects. */ | |
309714d4 | 415 | value = build_value_init (ftype, complain); |
0fcedd9c | 416 | |
351ccf20 JM |
417 | if (value == error_mark_node) |
418 | return error_mark_node; | |
419 | ||
0fcedd9c JM |
420 | if (value) |
421 | CONSTRUCTOR_APPEND_ELT(v, field, value); | |
422 | } | |
423 | ||
424 | /* Build a constructor to contain the zero- initializations. */ | |
8f540f06 | 425 | return build_constructor (type, v); |
0fcedd9c JM |
426 | } |
427 | } | |
428 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
429 | { | |
9771b263 | 430 | vec<constructor_elt, va_gc> *v = NULL; |
0fcedd9c JM |
431 | |
432 | /* Iterate over the array elements, building initializations. */ | |
433 | tree max_index = array_type_nelts (type); | |
434 | ||
435 | /* If we have an error_mark here, we should just return error mark | |
436 | as we don't know the size of the array yet. */ | |
437 | if (max_index == error_mark_node) | |
462aa169 | 438 | { |
e2a009c7 JM |
439 | if (complain & tf_error) |
440 | error ("cannot value-initialize array of unknown bound %qT", | |
441 | type); | |
462aa169 JM |
442 | return error_mark_node; |
443 | } | |
0fcedd9c JM |
444 | gcc_assert (TREE_CODE (max_index) == INTEGER_CST); |
445 | ||
446 | /* A zero-sized array, which is accepted as an extension, will | |
447 | have an upper bound of -1. */ | |
448 | if (!tree_int_cst_equal (max_index, integer_minus_one_node)) | |
449 | { | |
f32682ca | 450 | constructor_elt ce; |
0fcedd9c | 451 | |
0fcedd9c JM |
452 | /* If this is a one element array, we just use a regular init. */ |
453 | if (tree_int_cst_equal (size_zero_node, max_index)) | |
f32682ca | 454 | ce.index = size_zero_node; |
0fcedd9c | 455 | else |
f32682ca | 456 | ce.index = build2 (RANGE_EXPR, sizetype, size_zero_node, max_index); |
0fcedd9c | 457 | |
f32682ca | 458 | ce.value = build_value_init (TREE_TYPE (type), complain); |
f11c7048 JJ |
459 | if (ce.value) |
460 | { | |
461 | if (ce.value == error_mark_node) | |
462 | return error_mark_node; | |
9dbd4406 | 463 | |
f11c7048 JJ |
464 | vec_alloc (v, 1); |
465 | v->quick_push (ce); | |
351ccf20 | 466 | |
f11c7048 JJ |
467 | /* We shouldn't have gotten here for anything that would need |
468 | non-trivial initialization, and gimplify_init_ctor_preeval | |
469 | would need to be fixed to allow it. */ | |
470 | gcc_assert (TREE_CODE (ce.value) != TARGET_EXPR | |
471 | && TREE_CODE (ce.value) != AGGR_INIT_EXPR); | |
472 | } | |
0fcedd9c JM |
473 | } |
474 | ||
475 | /* Build a constructor to contain the initializations. */ | |
476 | return build_constructor (type, v); | |
477 | } | |
2b8497cd JM |
478 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
479 | { | |
480 | if (complain & tf_error) | |
481 | error ("value-initialization of function type %qT", type); | |
482 | return error_mark_node; | |
483 | } | |
351ccf20 JM |
484 | else if (TREE_CODE (type) == REFERENCE_TYPE) |
485 | { | |
486 | if (complain & tf_error) | |
487 | error ("value-initialization of reference type %qT", type); | |
488 | return error_mark_node; | |
489 | } | |
0fcedd9c JM |
490 | |
491 | return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false); | |
492 | } | |
493 | ||
238e471c VV |
494 | /* Initialize current class with INIT, a TREE_LIST of |
495 | arguments for a target constructor. If TREE_LIST is void_type_node, | |
496 | an empty initializer list was given. */ | |
497 | ||
498 | static void | |
499 | perform_target_ctor (tree init) | |
500 | { | |
501 | tree decl = current_class_ref; | |
502 | tree type = current_class_type; | |
503 | ||
504 | finish_expr_stmt (build_aggr_init (decl, init, LOOKUP_NORMAL, | |
505 | tf_warning_or_error)); | |
506 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
507 | { | |
508 | tree expr = build_delete (type, decl, sfk_complete_destructor, | |
509 | LOOKUP_NORMAL | |
510 | |LOOKUP_NONVIRTUAL | |
511 | |LOOKUP_DESTRUCTOR, | |
512 | 0, tf_warning_or_error); | |
513 | if (expr != error_mark_node) | |
514 | finish_eh_cleanup (expr); | |
515 | } | |
516 | } | |
517 | ||
2282d28d MM |
518 | /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of |
519 | arguments. If TREE_LIST is void_type_node, an empty initializer | |
520 | list was given; if NULL_TREE no initializer was given. */ | |
e92cc029 | 521 | |
8d08fdba | 522 | static void |
2282d28d | 523 | perform_member_init (tree member, tree init) |
8d08fdba MS |
524 | { |
525 | tree decl; | |
526 | tree type = TREE_TYPE (member); | |
2282d28d | 527 | |
0e5f8a59 JM |
528 | /* Use the non-static data member initializer if there was no |
529 | mem-initializer for this field. */ | |
530 | if (init == NULL_TREE) | |
6fd44881 | 531 | { |
2598165f | 532 | if (DECL_LANG_SPECIFIC (member) && DECL_TEMPLATE_INFO (member)) |
6fd44881 JM |
533 | /* Do deferred instantiation of the NSDMI. */ |
534 | init = (tsubst_copy_and_build | |
2598165f JM |
535 | (DECL_INITIAL (DECL_TI_TEMPLATE (member)), |
536 | DECL_TI_ARGS (member), | |
6fd44881 JM |
537 | tf_warning_or_error, member, /*function_p=*/false, |
538 | /*integral_constant_expression_p=*/false)); | |
539 | else | |
e2df21bf JM |
540 | { |
541 | init = DECL_INITIAL (member); | |
a491b7be JM |
542 | if (init && TREE_CODE (init) == DEFAULT_ARG) |
543 | { | |
544 | error ("constructor required before non-static data member " | |
545 | "for %qD has been parsed", member); | |
546 | init = NULL_TREE; | |
547 | } | |
e2df21bf JM |
548 | /* Strip redundant TARGET_EXPR so we don't need to remap it, and |
549 | so the aggregate init code below will see a CONSTRUCTOR. */ | |
550 | if (init && TREE_CODE (init) == TARGET_EXPR | |
551 | && !VOID_TYPE_P (TREE_TYPE (TARGET_EXPR_INITIAL (init)))) | |
552 | init = TARGET_EXPR_INITIAL (init); | |
553 | init = break_out_target_exprs (init); | |
554 | } | |
6fd44881 | 555 | } |
0e5f8a59 | 556 | |
a9eba00e PC |
557 | if (init == error_mark_node) |
558 | return; | |
559 | ||
2282d28d MM |
560 | /* Effective C++ rule 12 requires that all data members be |
561 | initialized. */ | |
9dbd4406 | 562 | if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE) |
c5d75364 MLI |
563 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__, |
564 | "%qD should be initialized in the member initialization list", | |
565 | member); | |
2282d28d | 566 | |
2282d28d | 567 | /* Get an lvalue for the data member. */ |
50ad9642 MM |
568 | decl = build_class_member_access_expr (current_class_ref, member, |
569 | /*access_path=*/NULL_TREE, | |
5ade1ed2 DG |
570 | /*preserve_reference=*/true, |
571 | tf_warning_or_error); | |
2fbfe9b8 MS |
572 | if (decl == error_mark_node) |
573 | return; | |
574 | ||
c11e39b0 JW |
575 | if (warn_init_self && init && TREE_CODE (init) == TREE_LIST |
576 | && TREE_CHAIN (init) == NULL_TREE) | |
577 | { | |
578 | tree val = TREE_VALUE (init); | |
579 | if (TREE_CODE (val) == COMPONENT_REF && TREE_OPERAND (val, 1) == member | |
580 | && TREE_OPERAND (val, 0) == current_class_ref) | |
581 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), | |
0ccb505d | 582 | OPT_Winit_self, "%qD is initialized with itself", |
c11e39b0 JW |
583 | member); |
584 | } | |
585 | ||
9dbd4406 JM |
586 | if (init == void_type_node) |
587 | { | |
588 | /* mem() means value-initialization. */ | |
589 | if (TREE_CODE (type) == ARRAY_TYPE) | |
0f737a30 | 590 | { |
9c69dcea | 591 | init = build_vec_init_expr (type, init, tf_warning_or_error); |
4de2f020 | 592 | init = build2 (INIT_EXPR, type, decl, init); |
0f737a30 JJ |
593 | finish_expr_stmt (init); |
594 | } | |
9dbd4406 JM |
595 | else |
596 | { | |
48e5d119 PC |
597 | tree value = build_value_init (type, tf_warning_or_error); |
598 | if (value == error_mark_node) | |
599 | return; | |
600 | init = build2 (INIT_EXPR, type, decl, value); | |
351ccf20 | 601 | finish_expr_stmt (init); |
9dbd4406 | 602 | } |
9dbd4406 | 603 | } |
6bdb8141 JM |
604 | /* Deal with this here, as we will get confused if we try to call the |
605 | assignment op for an anonymous union. This can happen in a | |
606 | synthesized copy constructor. */ | |
9dbd4406 | 607 | else if (ANON_AGGR_TYPE_P (type)) |
6bdb8141 | 608 | { |
ff9f1a5d MM |
609 | if (init) |
610 | { | |
f293ce4b | 611 | init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init)); |
ff9f1a5d MM |
612 | finish_expr_stmt (init); |
613 | } | |
6bdb8141 | 614 | } |
e2df21bf JM |
615 | else if (init |
616 | && (TREE_CODE (type) == REFERENCE_TYPE | |
617 | /* Pre-digested NSDMI. */ | |
618 | || (((TREE_CODE (init) == CONSTRUCTOR | |
619 | && TREE_TYPE (init) == type) | |
620 | /* { } mem-initializer. */ | |
621 | || (TREE_CODE (init) == TREE_LIST | |
622 | && TREE_CODE (TREE_VALUE (init)) == CONSTRUCTOR | |
623 | && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init)))) | |
624 | && (CP_AGGREGATE_TYPE_P (type) | |
625 | || is_std_init_list (type))))) | |
626 | { | |
627 | /* With references and list-initialization, we need to deal with | |
628 | extending temporary lifetimes. 12.2p5: "A temporary bound to a | |
629 | reference member in a constructorâs ctor-initializer (12.6.2) | |
630 | persists until the constructor exits." */ | |
631 | unsigned i; tree t; | |
9771b263 | 632 | vec<tree, va_gc> *cleanups = make_tree_vector (); |
e2df21bf JM |
633 | if (TREE_CODE (init) == TREE_LIST) |
634 | init = build_x_compound_expr_from_list (init, ELK_MEM_INIT, | |
635 | tf_warning_or_error); | |
636 | if (TREE_TYPE (init) != type) | |
4794d4b5 JM |
637 | { |
638 | if (BRACE_ENCLOSED_INITIALIZER_P (init) | |
639 | && CP_AGGREGATE_TYPE_P (type)) | |
640 | init = reshape_init (type, init, tf_warning_or_error); | |
641 | init = digest_init (type, init, tf_warning_or_error); | |
642 | } | |
e2df21bf JM |
643 | if (init == error_mark_node) |
644 | return; | |
f3fae478 JM |
645 | /* A FIELD_DECL doesn't really have a suitable lifetime, but |
646 | make_temporary_var_for_ref_to_temp will treat it as automatic and | |
647 | set_up_extended_ref_temp wants to use the decl in a warning. */ | |
2c6f7927 | 648 | init = extend_ref_init_temps (member, init, &cleanups); |
e2df21bf JM |
649 | if (TREE_CODE (type) == ARRAY_TYPE |
650 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (type))) | |
651 | init = build_vec_init_expr (type, init, tf_warning_or_error); | |
652 | init = build2 (INIT_EXPR, type, decl, init); | |
653 | finish_expr_stmt (init); | |
9771b263 | 654 | FOR_EACH_VEC_ELT (*cleanups, i, t) |
e2df21bf JM |
655 | push_cleanup (decl, t, false); |
656 | release_tree_vector (cleanups); | |
657 | } | |
a0348261 JM |
658 | else if (type_build_ctor_call (type) |
659 | || (init && CLASS_TYPE_P (strip_array_types (type)))) | |
8d08fdba | 660 | { |
534ecb17 | 661 | if (TREE_CODE (type) == ARRAY_TYPE) |
8d08fdba | 662 | { |
534ecb17 JM |
663 | if (init) |
664 | { | |
dd56ca9f JM |
665 | if (TREE_CHAIN (init)) |
666 | init = error_mark_node; | |
667 | else | |
668 | init = TREE_VALUE (init); | |
f41349a3 JM |
669 | if (BRACE_ENCLOSED_INITIALIZER_P (init)) |
670 | init = digest_init (type, init, tf_warning_or_error); | |
534ecb17 JM |
671 | } |
672 | if (init == NULL_TREE | |
673 | || same_type_ignoring_top_level_qualifiers_p (type, | |
674 | TREE_TYPE (init))) | |
675 | { | |
9c69dcea | 676 | init = build_vec_init_expr (type, init, tf_warning_or_error); |
534ecb17 JM |
677 | init = build2 (INIT_EXPR, type, decl, init); |
678 | finish_expr_stmt (init); | |
679 | } | |
680 | else | |
681 | error ("invalid initializer for array member %q#D", member); | |
8d08fdba MS |
682 | } |
683 | else | |
b87d79e6 | 684 | { |
b8bf6ad9 JM |
685 | int flags = LOOKUP_NORMAL; |
686 | if (DECL_DEFAULTED_FN (current_function_decl)) | |
687 | flags |= LOOKUP_DEFAULTED; | |
b87d79e6 JM |
688 | if (CP_TYPE_CONST_P (type) |
689 | && init == NULL_TREE | |
6132bdd7 | 690 | && default_init_uninitialized_part (type)) |
b87d79e6 JM |
691 | /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a |
692 | vtable; still give this diagnostic. */ | |
c5d75364 MLI |
693 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
694 | "uninitialized member %qD with %<const%> type %qT", | |
695 | member, type); | |
b8bf6ad9 | 696 | finish_expr_stmt (build_aggr_init (decl, init, flags, |
b87d79e6 JM |
697 | tf_warning_or_error)); |
698 | } | |
8d08fdba MS |
699 | } |
700 | else | |
701 | { | |
702 | if (init == NULL_TREE) | |
703 | { | |
31d1acec | 704 | tree core_type; |
8d08fdba | 705 | /* member traversal: note it leaves init NULL */ |
9dbd4406 | 706 | if (TREE_CODE (type) == REFERENCE_TYPE) |
c5d75364 MLI |
707 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
708 | "uninitialized reference member %qD", | |
709 | member); | |
58ec3cc5 | 710 | else if (CP_TYPE_CONST_P (type)) |
c5d75364 MLI |
711 | permerror (DECL_SOURCE_LOCATION (current_function_decl), |
712 | "uninitialized member %qD with %<const%> type %qT", | |
713 | member, type); | |
31d1acec | 714 | |
69f36ba6 JM |
715 | core_type = strip_array_types (type); |
716 | ||
012e6a1e JM |
717 | if (CLASS_TYPE_P (core_type) |
718 | && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type) | |
719 | || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))) | |
720 | diagnose_uninitialized_cst_or_ref_member (core_type, | |
40bb78ad FC |
721 | /*using_new=*/false, |
722 | /*complain=*/true); | |
8d08fdba MS |
723 | } |
724 | else if (TREE_CODE (init) == TREE_LIST) | |
c7b62f14 NS |
725 | /* There was an explicit member initialization. Do some work |
726 | in that case. */ | |
d555b1c7 PC |
727 | init = build_x_compound_expr_from_list (init, ELK_MEM_INIT, |
728 | tf_warning_or_error); | |
8d08fdba | 729 | |
4f0aa416 | 730 | if (init) |
5ade1ed2 DG |
731 | finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, |
732 | tf_warning_or_error)); | |
8d08fdba | 733 | } |
eb66be0e | 734 | |
834c6dff | 735 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
b7484fbe | 736 | { |
de22184b MS |
737 | tree expr; |
738 | ||
50ad9642 MM |
739 | expr = build_class_member_access_expr (current_class_ref, member, |
740 | /*access_path=*/NULL_TREE, | |
5ade1ed2 DG |
741 | /*preserve_reference=*/false, |
742 | tf_warning_or_error); | |
3ec6bad3 | 743 | expr = build_delete (type, expr, sfk_complete_destructor, |
574cfaa4 JM |
744 | LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0, |
745 | tf_warning_or_error); | |
b7484fbe MS |
746 | |
747 | if (expr != error_mark_node) | |
659e5a7a | 748 | finish_eh_cleanup (expr); |
b7484fbe | 749 | } |
8d08fdba MS |
750 | } |
751 | ||
ff9f1a5d MM |
752 | /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all |
753 | the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */ | |
754 | ||
c8094d83 | 755 | static tree |
362efdc1 | 756 | build_field_list (tree t, tree list, int *uses_unions_p) |
ff9f1a5d MM |
757 | { |
758 | tree fields; | |
759 | ||
760 | /* Note whether or not T is a union. */ | |
761 | if (TREE_CODE (t) == UNION_TYPE) | |
762 | *uses_unions_p = 1; | |
763 | ||
910ad8de | 764 | for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields)) |
ff9f1a5d | 765 | { |
535335bf JM |
766 | tree fieldtype; |
767 | ||
ff9f1a5d | 768 | /* Skip CONST_DECLs for enumeration constants and so forth. */ |
17bbb839 | 769 | if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields)) |
ff9f1a5d | 770 | continue; |
c8094d83 | 771 | |
535335bf | 772 | fieldtype = TREE_TYPE (fields); |
ff9f1a5d | 773 | /* Keep track of whether or not any fields are unions. */ |
535335bf | 774 | if (TREE_CODE (fieldtype) == UNION_TYPE) |
ff9f1a5d MM |
775 | *uses_unions_p = 1; |
776 | ||
777 | /* For an anonymous struct or union, we must recursively | |
778 | consider the fields of the anonymous type. They can be | |
779 | directly initialized from the constructor. */ | |
535335bf | 780 | if (ANON_AGGR_TYPE_P (fieldtype)) |
ff9f1a5d MM |
781 | { |
782 | /* Add this field itself. Synthesized copy constructors | |
783 | initialize the entire aggregate. */ | |
784 | list = tree_cons (fields, NULL_TREE, list); | |
785 | /* And now add the fields in the anonymous aggregate. */ | |
535335bf | 786 | list = build_field_list (fieldtype, list, uses_unions_p); |
ff9f1a5d MM |
787 | } |
788 | /* Add this field. */ | |
789 | else if (DECL_NAME (fields)) | |
790 | list = tree_cons (fields, NULL_TREE, list); | |
791 | } | |
792 | ||
793 | return list; | |
794 | } | |
795 | ||
2282d28d MM |
796 | /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives |
797 | a FIELD_DECL or BINFO in T that needs initialization. The | |
798 | TREE_VALUE gives the initializer, or list of initializer arguments. | |
799 | ||
800 | Return a TREE_LIST containing all of the initializations required | |
801 | for T, in the order in which they should be performed. The output | |
802 | list has the same format as the input. */ | |
e92cc029 | 803 | |
8d08fdba | 804 | static tree |
2282d28d | 805 | sort_mem_initializers (tree t, tree mem_inits) |
8d08fdba | 806 | { |
ff9f1a5d | 807 | tree init; |
fa743e8c | 808 | tree base, binfo, base_binfo; |
2282d28d MM |
809 | tree sorted_inits; |
810 | tree next_subobject; | |
9771b263 | 811 | vec<tree, va_gc> *vbases; |
2282d28d | 812 | int i; |
adc651f3 | 813 | int uses_unions_p = 0; |
ff9f1a5d | 814 | |
2282d28d MM |
815 | /* Build up a list of initializations. The TREE_PURPOSE of entry |
816 | will be the subobject (a FIELD_DECL or BINFO) to initialize. The | |
817 | TREE_VALUE will be the constructor arguments, or NULL if no | |
818 | explicit initialization was provided. */ | |
819 | sorted_inits = NULL_TREE; | |
c8094d83 | 820 | |
2282d28d | 821 | /* Process the virtual bases. */ |
9ba5ff0f | 822 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 823 | vec_safe_iterate (vbases, i, &base); i++) |
58c42dc2 | 824 | sorted_inits = tree_cons (base, NULL_TREE, sorted_inits); |
c8094d83 | 825 | |
2282d28d | 826 | /* Process the direct bases. */ |
fa743e8c NS |
827 | for (binfo = TYPE_BINFO (t), i = 0; |
828 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
829 | if (!BINFO_VIRTUAL_P (base_binfo)) | |
830 | sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits); | |
831 | ||
2282d28d MM |
832 | /* Process the non-static data members. */ |
833 | sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p); | |
834 | /* Reverse the entire list of initializations, so that they are in | |
835 | the order that they will actually be performed. */ | |
836 | sorted_inits = nreverse (sorted_inits); | |
837 | ||
838 | /* If the user presented the initializers in an order different from | |
839 | that in which they will actually occur, we issue a warning. Keep | |
840 | track of the next subobject which can be explicitly initialized | |
841 | without issuing a warning. */ | |
842 | next_subobject = sorted_inits; | |
843 | ||
844 | /* Go through the explicit initializers, filling in TREE_PURPOSE in | |
845 | the SORTED_INITS. */ | |
846 | for (init = mem_inits; init; init = TREE_CHAIN (init)) | |
847 | { | |
848 | tree subobject; | |
849 | tree subobject_init; | |
850 | ||
851 | subobject = TREE_PURPOSE (init); | |
852 | ||
853 | /* If the explicit initializers are in sorted order, then | |
c8094d83 | 854 | SUBOBJECT will be NEXT_SUBOBJECT, or something following |
2282d28d | 855 | it. */ |
c8094d83 MS |
856 | for (subobject_init = next_subobject; |
857 | subobject_init; | |
2282d28d MM |
858 | subobject_init = TREE_CHAIN (subobject_init)) |
859 | if (TREE_PURPOSE (subobject_init) == subobject) | |
ff9f1a5d MM |
860 | break; |
861 | ||
2282d28d | 862 | /* Issue a warning if the explicit initializer order does not |
2cfe82fe | 863 | match that which will actually occur. |
0cbd7506 | 864 | ??? Are all these on the correct lines? */ |
2282d28d | 865 | if (warn_reorder && !subobject_init) |
ff9f1a5d | 866 | { |
2282d28d | 867 | if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL) |
b323323f | 868 | warning (OPT_Wreorder, "%q+D will be initialized after", |
dee15844 | 869 | TREE_PURPOSE (next_subobject)); |
2282d28d | 870 | else |
b323323f | 871 | warning (OPT_Wreorder, "base %qT will be initialized after", |
2282d28d MM |
872 | TREE_PURPOSE (next_subobject)); |
873 | if (TREE_CODE (subobject) == FIELD_DECL) | |
b323323f | 874 | warning (OPT_Wreorder, " %q+#D", subobject); |
2282d28d | 875 | else |
b323323f | 876 | warning (OPT_Wreorder, " base %qT", subobject); |
c5d75364 MLI |
877 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), |
878 | OPT_Wreorder, " when initialized here"); | |
ff9f1a5d | 879 | } |
b7484fbe | 880 | |
2282d28d MM |
881 | /* Look again, from the beginning of the list. */ |
882 | if (!subobject_init) | |
ff9f1a5d | 883 | { |
2282d28d MM |
884 | subobject_init = sorted_inits; |
885 | while (TREE_PURPOSE (subobject_init) != subobject) | |
886 | subobject_init = TREE_CHAIN (subobject_init); | |
ff9f1a5d | 887 | } |
c8094d83 | 888 | |
2282d28d MM |
889 | /* It is invalid to initialize the same subobject more than |
890 | once. */ | |
891 | if (TREE_VALUE (subobject_init)) | |
ff9f1a5d | 892 | { |
2282d28d | 893 | if (TREE_CODE (subobject) == FIELD_DECL) |
c5d75364 MLI |
894 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
895 | "multiple initializations given for %qD", | |
896 | subobject); | |
2282d28d | 897 | else |
c5d75364 MLI |
898 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
899 | "multiple initializations given for base %qT", | |
900 | subobject); | |
ff9f1a5d MM |
901 | } |
902 | ||
2282d28d MM |
903 | /* Record the initialization. */ |
904 | TREE_VALUE (subobject_init) = TREE_VALUE (init); | |
905 | next_subobject = subobject_init; | |
ff9f1a5d MM |
906 | } |
907 | ||
908 | /* [class.base.init] | |
b7484fbe | 909 | |
ff9f1a5d MM |
910 | If a ctor-initializer specifies more than one mem-initializer for |
911 | multiple members of the same union (including members of | |
57ece258 JM |
912 | anonymous unions), the ctor-initializer is ill-formed. |
913 | ||
914 | Here we also splice out uninitialized union members. */ | |
ff9f1a5d MM |
915 | if (uses_unions_p) |
916 | { | |
2282d28d | 917 | tree last_field = NULL_TREE; |
57ece258 JM |
918 | tree *p; |
919 | for (p = &sorted_inits; *p; ) | |
8d08fdba | 920 | { |
ff9f1a5d | 921 | tree field; |
535335bf | 922 | tree ctx; |
ff9f1a5d MM |
923 | int done; |
924 | ||
57ece258 JM |
925 | init = *p; |
926 | ||
927 | field = TREE_PURPOSE (init); | |
928 | ||
929 | /* Skip base classes. */ | |
930 | if (TREE_CODE (field) != FIELD_DECL) | |
931 | goto next; | |
932 | ||
933 | /* If this is an anonymous union with no explicit initializer, | |
934 | splice it out. */ | |
935 | if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field))) | |
936 | goto splice; | |
937 | ||
ff9f1a5d MM |
938 | /* See if this field is a member of a union, or a member of a |
939 | structure contained in a union, etc. */ | |
535335bf JM |
940 | for (ctx = DECL_CONTEXT (field); |
941 | !same_type_p (ctx, t); | |
942 | ctx = TYPE_CONTEXT (ctx)) | |
943 | if (TREE_CODE (ctx) == UNION_TYPE) | |
ff9f1a5d MM |
944 | break; |
945 | /* If this field is not a member of a union, skip it. */ | |
535335bf | 946 | if (TREE_CODE (ctx) != UNION_TYPE) |
57ece258 JM |
947 | goto next; |
948 | ||
949 | /* If this union member has no explicit initializer, splice | |
950 | it out. */ | |
951 | if (!TREE_VALUE (init)) | |
952 | goto splice; | |
8d08fdba | 953 | |
ff9f1a5d MM |
954 | /* It's only an error if we have two initializers for the same |
955 | union type. */ | |
956 | if (!last_field) | |
6bdb8141 | 957 | { |
ff9f1a5d | 958 | last_field = field; |
57ece258 | 959 | goto next; |
6bdb8141 | 960 | } |
8d08fdba | 961 | |
ff9f1a5d MM |
962 | /* See if LAST_FIELD and the field initialized by INIT are |
963 | members of the same union. If so, there's a problem, | |
964 | unless they're actually members of the same structure | |
965 | which is itself a member of a union. For example, given: | |
8d08fdba | 966 | |
ff9f1a5d MM |
967 | union { struct { int i; int j; }; }; |
968 | ||
969 | initializing both `i' and `j' makes sense. */ | |
535335bf | 970 | ctx = DECL_CONTEXT (field); |
ff9f1a5d MM |
971 | done = 0; |
972 | do | |
8d08fdba | 973 | { |
535335bf | 974 | tree last_ctx; |
ff9f1a5d | 975 | |
535335bf | 976 | last_ctx = DECL_CONTEXT (last_field); |
ff9f1a5d | 977 | while (1) |
00595019 | 978 | { |
535335bf | 979 | if (same_type_p (last_ctx, ctx)) |
00595019 | 980 | { |
535335bf | 981 | if (TREE_CODE (ctx) == UNION_TYPE) |
c5d75364 MLI |
982 | error_at (DECL_SOURCE_LOCATION (current_function_decl), |
983 | "initializations for multiple members of %qT", | |
535335bf | 984 | last_ctx); |
ff9f1a5d MM |
985 | done = 1; |
986 | break; | |
00595019 | 987 | } |
8d08fdba | 988 | |
535335bf | 989 | if (same_type_p (last_ctx, t)) |
ff9f1a5d | 990 | break; |
8d08fdba | 991 | |
535335bf | 992 | last_ctx = TYPE_CONTEXT (last_ctx); |
ff9f1a5d | 993 | } |
c8094d83 | 994 | |
ff9f1a5d MM |
995 | /* If we've reached the outermost class, then we're |
996 | done. */ | |
535335bf | 997 | if (same_type_p (ctx, t)) |
ff9f1a5d | 998 | break; |
8d08fdba | 999 | |
535335bf | 1000 | ctx = TYPE_CONTEXT (ctx); |
8d08fdba | 1001 | } |
ff9f1a5d MM |
1002 | while (!done); |
1003 | ||
1004 | last_field = field; | |
57ece258 JM |
1005 | |
1006 | next: | |
1007 | p = &TREE_CHAIN (*p); | |
1008 | continue; | |
1009 | splice: | |
1010 | *p = TREE_CHAIN (*p); | |
1011 | continue; | |
b7484fbe MS |
1012 | } |
1013 | } | |
8d08fdba | 1014 | |
2282d28d | 1015 | return sorted_inits; |
b7484fbe MS |
1016 | } |
1017 | ||
2282d28d MM |
1018 | /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS |
1019 | is a TREE_LIST giving the explicit mem-initializer-list for the | |
1020 | constructor. The TREE_PURPOSE of each entry is a subobject (a | |
1021 | FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE | |
1022 | is a TREE_LIST giving the arguments to the constructor or | |
1023 | void_type_node for an empty list of arguments. */ | |
a9aedbc2 | 1024 | |
3dbc07b6 | 1025 | void |
2282d28d | 1026 | emit_mem_initializers (tree mem_inits) |
8d08fdba | 1027 | { |
b8bf6ad9 JM |
1028 | int flags = LOOKUP_NORMAL; |
1029 | ||
72e4661a PC |
1030 | /* We will already have issued an error message about the fact that |
1031 | the type is incomplete. */ | |
1032 | if (!COMPLETE_TYPE_P (current_class_type)) | |
1033 | return; | |
c8094d83 | 1034 | |
238e471c VV |
1035 | if (mem_inits |
1036 | && TYPE_P (TREE_PURPOSE (mem_inits)) | |
1037 | && same_type_p (TREE_PURPOSE (mem_inits), current_class_type)) | |
1038 | { | |
1039 | /* Delegating constructor. */ | |
1040 | gcc_assert (TREE_CHAIN (mem_inits) == NULL_TREE); | |
1041 | perform_target_ctor (TREE_VALUE (mem_inits)); | |
1042 | return; | |
1043 | } | |
1044 | ||
85b5d65a JM |
1045 | if (DECL_DEFAULTED_FN (current_function_decl) |
1046 | && ! DECL_INHERITED_CTOR_BASE (current_function_decl)) | |
b8bf6ad9 JM |
1047 | flags |= LOOKUP_DEFAULTED; |
1048 | ||
2282d28d MM |
1049 | /* Sort the mem-initializers into the order in which the |
1050 | initializations should be performed. */ | |
1051 | mem_inits = sort_mem_initializers (current_class_type, mem_inits); | |
8d08fdba | 1052 | |
1f5a253a | 1053 | in_base_initializer = 1; |
c8094d83 | 1054 | |
2282d28d | 1055 | /* Initialize base classes. */ |
3b616f08 PC |
1056 | for (; (mem_inits |
1057 | && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL); | |
1058 | mem_inits = TREE_CHAIN (mem_inits)) | |
8d08fdba | 1059 | { |
2282d28d MM |
1060 | tree subobject = TREE_PURPOSE (mem_inits); |
1061 | tree arguments = TREE_VALUE (mem_inits); | |
1062 | ||
3b616f08 PC |
1063 | /* We already have issued an error message. */ |
1064 | if (arguments == error_mark_node) | |
1065 | continue; | |
1066 | ||
91ea6df3 GDR |
1067 | if (arguments == NULL_TREE) |
1068 | { | |
1069 | /* If these initializations are taking place in a copy constructor, | |
1070 | the base class should probably be explicitly initialized if there | |
1071 | is a user-defined constructor in the base class (other than the | |
1072 | default constructor, which will be called anyway). */ | |
1073 | if (extra_warnings | |
1074 | && DECL_COPY_CONSTRUCTOR_P (current_function_decl) | |
1075 | && type_has_user_nondefault_constructor (BINFO_TYPE (subobject))) | |
1076 | warning_at (DECL_SOURCE_LOCATION (current_function_decl), | |
1077 | OPT_Wextra, "base class %q#T should be explicitly " | |
1078 | "initialized in the copy constructor", | |
1079 | BINFO_TYPE (subobject)); | |
91ea6df3 | 1080 | } |
2282d28d | 1081 | |
2282d28d | 1082 | /* Initialize the base. */ |
809e3e7f | 1083 | if (BINFO_VIRTUAL_P (subobject)) |
2282d28d MM |
1084 | construct_virtual_base (subobject, arguments); |
1085 | else | |
b7484fbe | 1086 | { |
2282d28d | 1087 | tree base_addr; |
c8094d83 | 1088 | |
2282d28d | 1089 | base_addr = build_base_path (PLUS_EXPR, current_class_ptr, |
a271590a | 1090 | subobject, 1, tf_warning_or_error); |
2282d28d | 1091 | expand_aggr_init_1 (subobject, NULL_TREE, |
dd865ef6 | 1092 | cp_build_indirect_ref (base_addr, RO_NULL, |
5ade1ed2 | 1093 | tf_warning_or_error), |
2282d28d | 1094 | arguments, |
b8bf6ad9 | 1095 | flags, |
5ade1ed2 | 1096 | tf_warning_or_error); |
2282d28d | 1097 | expand_cleanup_for_base (subobject, NULL_TREE); |
8d08fdba | 1098 | } |
8d08fdba | 1099 | } |
1f5a253a | 1100 | in_base_initializer = 0; |
8d08fdba | 1101 | |
2282d28d | 1102 | /* Initialize the vptrs. */ |
cf2e003b | 1103 | initialize_vtbl_ptrs (current_class_ptr); |
c8094d83 | 1104 | |
2282d28d MM |
1105 | /* Initialize the data members. */ |
1106 | while (mem_inits) | |
8d08fdba | 1107 | { |
2282d28d MM |
1108 | perform_member_init (TREE_PURPOSE (mem_inits), |
1109 | TREE_VALUE (mem_inits)); | |
1110 | mem_inits = TREE_CHAIN (mem_inits); | |
b7484fbe | 1111 | } |
8d08fdba MS |
1112 | } |
1113 | ||
3ec6bad3 MM |
1114 | /* Returns the address of the vtable (i.e., the value that should be |
1115 | assigned to the vptr) for BINFO. */ | |
1116 | ||
1117 | static tree | |
362efdc1 | 1118 | build_vtbl_address (tree binfo) |
3ec6bad3 | 1119 | { |
9965d119 | 1120 | tree binfo_for = binfo; |
3ec6bad3 MM |
1121 | tree vtbl; |
1122 | ||
fc6633e0 | 1123 | if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo)) |
9965d119 NS |
1124 | /* If this is a virtual primary base, then the vtable we want to store |
1125 | is that for the base this is being used as the primary base of. We | |
1126 | can't simply skip the initialization, because we may be expanding the | |
1127 | inits of a subobject constructor where the virtual base layout | |
1128 | can be different. */ | |
fc6633e0 NS |
1129 | while (BINFO_PRIMARY_P (binfo_for)) |
1130 | binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for); | |
9965d119 | 1131 | |
3ec6bad3 MM |
1132 | /* Figure out what vtable BINFO's vtable is based on, and mark it as |
1133 | used. */ | |
9965d119 | 1134 | vtbl = get_vtbl_decl_for_binfo (binfo_for); |
3ec6bad3 MM |
1135 | TREE_USED (vtbl) = 1; |
1136 | ||
1137 | /* Now compute the address to use when initializing the vptr. */ | |
6de9cd9a | 1138 | vtbl = unshare_expr (BINFO_VTABLE (binfo_for)); |
5a6ccc94 | 1139 | if (VAR_P (vtbl)) |
6de9cd9a | 1140 | vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl); |
3ec6bad3 MM |
1141 | |
1142 | return vtbl; | |
1143 | } | |
1144 | ||
8d08fdba MS |
1145 | /* This code sets up the virtual function tables appropriate for |
1146 | the pointer DECL. It is a one-ply initialization. | |
1147 | ||
1148 | BINFO is the exact type that DECL is supposed to be. In | |
1149 | multiple inheritance, this might mean "C's A" if C : A, B. */ | |
e92cc029 | 1150 | |
8926095f | 1151 | static void |
362efdc1 | 1152 | expand_virtual_init (tree binfo, tree decl) |
8d08fdba | 1153 | { |
8d08fdba | 1154 | tree vtbl, vtbl_ptr; |
3ec6bad3 | 1155 | tree vtt_index; |
8d08fdba | 1156 | |
3ec6bad3 MM |
1157 | /* Compute the initializer for vptr. */ |
1158 | vtbl = build_vtbl_address (binfo); | |
1159 | ||
3461fba7 NS |
1160 | /* We may get this vptr from a VTT, if this is a subobject |
1161 | constructor or subobject destructor. */ | |
3ec6bad3 MM |
1162 | vtt_index = BINFO_VPTR_INDEX (binfo); |
1163 | if (vtt_index) | |
1164 | { | |
1165 | tree vtbl2; | |
1166 | tree vtt_parm; | |
1167 | ||
1168 | /* Compute the value to use, when there's a VTT. */ | |
e0fff4b3 | 1169 | vtt_parm = current_vtt_parm; |
5d49b6a7 | 1170 | vtbl2 = fold_build_pointer_plus (vtt_parm, vtt_index); |
dd865ef6 | 1171 | vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error); |
6de9cd9a | 1172 | vtbl2 = convert (TREE_TYPE (vtbl), vtbl2); |
3ec6bad3 MM |
1173 | |
1174 | /* The actual initializer is the VTT value only in the subobject | |
1175 | constructor. In maybe_clone_body we'll substitute NULL for | |
1176 | the vtt_parm in the case of the non-subobject constructor. */ | |
c8094d83 MS |
1177 | vtbl = build3 (COND_EXPR, |
1178 | TREE_TYPE (vtbl), | |
f293ce4b RS |
1179 | build2 (EQ_EXPR, boolean_type_node, |
1180 | current_in_charge_parm, integer_zero_node), | |
c8094d83 | 1181 | vtbl2, |
f293ce4b | 1182 | vtbl); |
3ec6bad3 | 1183 | } |
70ae3201 MM |
1184 | |
1185 | /* Compute the location of the vtpr. */ | |
dd865ef6 | 1186 | vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL, |
5ade1ed2 | 1187 | tf_warning_or_error), |
338d90b8 | 1188 | TREE_TYPE (binfo)); |
50bc768d | 1189 | gcc_assert (vtbl_ptr != error_mark_node); |
8d08fdba | 1190 | |
70ae3201 | 1191 | /* Assign the vtable to the vptr. */ |
4b978f96 | 1192 | vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0, tf_warning_or_error); |
5ade1ed2 DG |
1193 | finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl, |
1194 | tf_warning_or_error)); | |
8d08fdba MS |
1195 | } |
1196 | ||
f33e32a8 MM |
1197 | /* If an exception is thrown in a constructor, those base classes already |
1198 | constructed must be destroyed. This function creates the cleanup | |
0b8a1e58 | 1199 | for BINFO, which has just been constructed. If FLAG is non-NULL, |
838dfd8a | 1200 | it is a DECL which is nonzero when this base needs to be |
0b8a1e58 | 1201 | destroyed. */ |
f33e32a8 MM |
1202 | |
1203 | static void | |
362efdc1 | 1204 | expand_cleanup_for_base (tree binfo, tree flag) |
f33e32a8 MM |
1205 | { |
1206 | tree expr; | |
1207 | ||
834c6dff | 1208 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo))) |
f33e32a8 MM |
1209 | return; |
1210 | ||
0b8a1e58 | 1211 | /* Call the destructor. */ |
c8094d83 | 1212 | expr = build_special_member_call (current_class_ref, |
4ba126e4 | 1213 | base_dtor_identifier, |
c166b898 | 1214 | NULL, |
4ba126e4 | 1215 | binfo, |
5ade1ed2 DG |
1216 | LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, |
1217 | tf_warning_or_error); | |
0b8a1e58 | 1218 | if (flag) |
db3927fb AH |
1219 | expr = fold_build3_loc (input_location, |
1220 | COND_EXPR, void_type_node, | |
ba47d38d | 1221 | c_common_truthvalue_conversion (input_location, flag), |
7866705a | 1222 | expr, integer_zero_node); |
0b8a1e58 | 1223 | |
659e5a7a | 1224 | finish_eh_cleanup (expr); |
f33e32a8 MM |
1225 | } |
1226 | ||
2282d28d MM |
1227 | /* Construct the virtual base-class VBASE passing the ARGUMENTS to its |
1228 | constructor. */ | |
e92cc029 | 1229 | |
8d08fdba | 1230 | static void |
2282d28d | 1231 | construct_virtual_base (tree vbase, tree arguments) |
8d08fdba | 1232 | { |
2282d28d | 1233 | tree inner_if_stmt; |
2282d28d | 1234 | tree exp; |
c8094d83 | 1235 | tree flag; |
2282d28d MM |
1236 | |
1237 | /* If there are virtual base classes with destructors, we need to | |
1238 | emit cleanups to destroy them if an exception is thrown during | |
1239 | the construction process. These exception regions (i.e., the | |
1240 | period during which the cleanups must occur) begin from the time | |
1241 | the construction is complete to the end of the function. If we | |
1242 | create a conditional block in which to initialize the | |
1243 | base-classes, then the cleanup region for the virtual base begins | |
1244 | inside a block, and ends outside of that block. This situation | |
1245 | confuses the sjlj exception-handling code. Therefore, we do not | |
1246 | create a single conditional block, but one for each | |
1247 | initialization. (That way the cleanup regions always begin | |
3b426391 | 1248 | in the outer block.) We trust the back end to figure out |
2282d28d MM |
1249 | that the FLAG will not change across initializations, and |
1250 | avoid doing multiple tests. */ | |
910ad8de | 1251 | flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl)); |
2282d28d MM |
1252 | inner_if_stmt = begin_if_stmt (); |
1253 | finish_if_stmt_cond (flag, inner_if_stmt); | |
2282d28d MM |
1254 | |
1255 | /* Compute the location of the virtual base. If we're | |
1256 | constructing virtual bases, then we must be the most derived | |
1257 | class. Therefore, we don't have to look up the virtual base; | |
1258 | we already know where it is. */ | |
22ed7e5f MM |
1259 | exp = convert_to_base_statically (current_class_ref, vbase); |
1260 | ||
c8094d83 | 1261 | expand_aggr_init_1 (vbase, current_class_ref, exp, arguments, |
4b978f96 | 1262 | 0, tf_warning_or_error); |
2282d28d | 1263 | finish_then_clause (inner_if_stmt); |
325c3691 | 1264 | finish_if_stmt (inner_if_stmt); |
2282d28d MM |
1265 | |
1266 | expand_cleanup_for_base (vbase, flag); | |
8d08fdba MS |
1267 | } |
1268 | ||
2ee887f2 | 1269 | /* Find the context in which this FIELD can be initialized. */ |
e92cc029 | 1270 | |
2ee887f2 | 1271 | static tree |
362efdc1 | 1272 | initializing_context (tree field) |
2ee887f2 MS |
1273 | { |
1274 | tree t = DECL_CONTEXT (field); | |
1275 | ||
1276 | /* Anonymous union members can be initialized in the first enclosing | |
1277 | non-anonymous union context. */ | |
6bdb8141 | 1278 | while (t && ANON_AGGR_TYPE_P (t)) |
2ee887f2 MS |
1279 | t = TYPE_CONTEXT (t); |
1280 | return t; | |
1281 | } | |
1282 | ||
8d08fdba MS |
1283 | /* Function to give error message if member initialization specification |
1284 | is erroneous. FIELD is the member we decided to initialize. | |
1285 | TYPE is the type for which the initialization is being performed. | |
72b7eeff | 1286 | FIELD must be a member of TYPE. |
c8094d83 | 1287 | |
8d08fdba MS |
1288 | MEMBER_NAME is the name of the member. */ |
1289 | ||
1290 | static int | |
362efdc1 | 1291 | member_init_ok_or_else (tree field, tree type, tree member_name) |
8d08fdba MS |
1292 | { |
1293 | if (field == error_mark_node) | |
1294 | return 0; | |
a723baf1 | 1295 | if (!field) |
8d08fdba | 1296 | { |
15a7ee29 | 1297 | error ("class %qT does not have any field named %qD", type, |
a723baf1 | 1298 | member_name); |
8d08fdba MS |
1299 | return 0; |
1300 | } | |
5a6ccc94 | 1301 | if (VAR_P (field)) |
b7484fbe | 1302 | { |
15a7ee29 | 1303 | error ("%q#D is a static data member; it can only be " |
a723baf1 MM |
1304 | "initialized at its definition", |
1305 | field); | |
1306 | return 0; | |
1307 | } | |
1308 | if (TREE_CODE (field) != FIELD_DECL) | |
1309 | { | |
15a7ee29 | 1310 | error ("%q#D is not a non-static data member of %qT", |
a723baf1 MM |
1311 | field, type); |
1312 | return 0; | |
1313 | } | |
1314 | if (initializing_context (field) != type) | |
1315 | { | |
15a7ee29 | 1316 | error ("class %qT does not have any field named %qD", type, |
a723baf1 | 1317 | member_name); |
b7484fbe MS |
1318 | return 0; |
1319 | } | |
1320 | ||
8d08fdba MS |
1321 | return 1; |
1322 | } | |
1323 | ||
2282d28d MM |
1324 | /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it |
1325 | is a _TYPE node or TYPE_DECL which names a base for that type. | |
1f5a253a NS |
1326 | Check the validity of NAME, and return either the base _TYPE, base |
1327 | binfo, or the FIELD_DECL of the member. If NAME is invalid, return | |
2282d28d | 1328 | NULL_TREE and issue a diagnostic. |
8d08fdba | 1329 | |
36a68fe7 NS |
1330 | An old style unnamed direct single base construction is permitted, |
1331 | where NAME is NULL. */ | |
8d08fdba | 1332 | |
fd74ca0b | 1333 | tree |
1f5a253a | 1334 | expand_member_init (tree name) |
8d08fdba | 1335 | { |
2282d28d MM |
1336 | tree basetype; |
1337 | tree field; | |
8d08fdba | 1338 | |
2282d28d | 1339 | if (!current_class_ref) |
fd74ca0b | 1340 | return NULL_TREE; |
8d08fdba | 1341 | |
36a68fe7 | 1342 | if (!name) |
90418208 | 1343 | { |
36a68fe7 NS |
1344 | /* This is an obsolete unnamed base class initializer. The |
1345 | parser will already have warned about its use. */ | |
604a3205 | 1346 | switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type))) |
36a68fe7 NS |
1347 | { |
1348 | case 0: | |
15a7ee29 | 1349 | error ("unnamed initializer for %qT, which has no base classes", |
2282d28d | 1350 | current_class_type); |
36a68fe7 NS |
1351 | return NULL_TREE; |
1352 | case 1: | |
604a3205 NS |
1353 | basetype = BINFO_TYPE |
1354 | (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0)); | |
36a68fe7 NS |
1355 | break; |
1356 | default: | |
15a7ee29 | 1357 | error ("unnamed initializer for %qT, which uses multiple inheritance", |
2282d28d | 1358 | current_class_type); |
36a68fe7 NS |
1359 | return NULL_TREE; |
1360 | } | |
90418208 | 1361 | } |
36a68fe7 | 1362 | else if (TYPE_P (name)) |
be99da77 | 1363 | { |
a82d6da5 | 1364 | basetype = TYPE_MAIN_VARIANT (name); |
36a68fe7 | 1365 | name = TYPE_NAME (name); |
be99da77 | 1366 | } |
36a68fe7 NS |
1367 | else if (TREE_CODE (name) == TYPE_DECL) |
1368 | basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name)); | |
2282d28d MM |
1369 | else |
1370 | basetype = NULL_TREE; | |
8d08fdba | 1371 | |
36a68fe7 | 1372 | if (basetype) |
41efda8f | 1373 | { |
d9148cf4 MM |
1374 | tree class_binfo; |
1375 | tree direct_binfo; | |
1376 | tree virtual_binfo; | |
1377 | int i; | |
2282d28d | 1378 | |
5cd5a78c JM |
1379 | if (current_template_parms |
1380 | || same_type_p (basetype, current_class_type)) | |
238e471c | 1381 | return basetype; |
2282d28d | 1382 | |
d9148cf4 MM |
1383 | class_binfo = TYPE_BINFO (current_class_type); |
1384 | direct_binfo = NULL_TREE; | |
1385 | virtual_binfo = NULL_TREE; | |
1386 | ||
1387 | /* Look for a direct base. */ | |
fa743e8c | 1388 | for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i) |
539ed333 | 1389 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype)) |
fa743e8c NS |
1390 | break; |
1391 | ||
d9148cf4 MM |
1392 | /* Look for a virtual base -- unless the direct base is itself |
1393 | virtual. */ | |
809e3e7f | 1394 | if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo)) |
58c42dc2 | 1395 | virtual_binfo = binfo_for_vbase (basetype, current_class_type); |
d9148cf4 MM |
1396 | |
1397 | /* [class.base.init] | |
c8094d83 | 1398 | |
0cbd7506 | 1399 | If a mem-initializer-id is ambiguous because it designates |
d9148cf4 MM |
1400 | both a direct non-virtual base class and an inherited virtual |
1401 | base class, the mem-initializer is ill-formed. */ | |
1402 | if (direct_binfo && virtual_binfo) | |
1403 | { | |
15a7ee29 | 1404 | error ("%qD is both a direct base and an indirect virtual base", |
d9148cf4 MM |
1405 | basetype); |
1406 | return NULL_TREE; | |
1407 | } | |
1408 | ||
1409 | if (!direct_binfo && !virtual_binfo) | |
8d08fdba | 1410 | { |
5775a06a | 1411 | if (CLASSTYPE_VBASECLASSES (current_class_type)) |
c3115fd2 MM |
1412 | error ("type %qT is not a direct or virtual base of %qT", |
1413 | basetype, current_class_type); | |
41efda8f | 1414 | else |
c3115fd2 MM |
1415 | error ("type %qT is not a direct base of %qT", |
1416 | basetype, current_class_type); | |
fd74ca0b | 1417 | return NULL_TREE; |
41efda8f | 1418 | } |
d9148cf4 MM |
1419 | |
1420 | return direct_binfo ? direct_binfo : virtual_binfo; | |
41efda8f MM |
1421 | } |
1422 | else | |
1423 | { | |
9dc6f476 | 1424 | if (identifier_p (name)) |
86ac0575 | 1425 | field = lookup_field (current_class_type, name, 1, false); |
2282d28d MM |
1426 | else |
1427 | field = name; | |
8d08fdba | 1428 | |
2282d28d | 1429 | if (member_init_ok_or_else (field, current_class_type, name)) |
1f5a253a | 1430 | return field; |
41efda8f | 1431 | } |
fd74ca0b | 1432 | |
2282d28d | 1433 | return NULL_TREE; |
8d08fdba MS |
1434 | } |
1435 | ||
1436 | /* This is like `expand_member_init', only it stores one aggregate | |
1437 | value into another. | |
1438 | ||
1439 | INIT comes in two flavors: it is either a value which | |
1440 | is to be stored in EXP, or it is a parameter list | |
1441 | to go to a constructor, which will operate on EXP. | |
f30432d7 MS |
1442 | If INIT is not a parameter list for a constructor, then set |
1443 | LOOKUP_ONLYCONVERTING. | |
6060a796 MS |
1444 | If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of |
1445 | the initializer, if FLAGS is 0, then it is the (init) form. | |
8d08fdba | 1446 | If `init' is a CONSTRUCTOR, then we emit a warning message, |
59be0cdd | 1447 | explaining that such initializations are invalid. |
8d08fdba | 1448 | |
8d08fdba MS |
1449 | If INIT resolves to a CALL_EXPR which happens to return |
1450 | something of the type we are looking for, then we know | |
1451 | that we can safely use that call to perform the | |
1452 | initialization. | |
1453 | ||
1454 | The virtual function table pointer cannot be set up here, because | |
1455 | we do not really know its type. | |
1456 | ||
8d08fdba MS |
1457 | This never calls operator=(). |
1458 | ||
1459 | When initializing, nothing is CONST. | |
1460 | ||
1461 | A default copy constructor may have to be used to perform the | |
1462 | initialization. | |
1463 | ||
1464 | A constructor or a conversion operator may have to be used to | |
e92cc029 | 1465 | perform the initialization, but not both, as it would be ambiguous. */ |
8d08fdba | 1466 | |
f1dedc31 | 1467 | tree |
5ade1ed2 | 1468 | build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain) |
8d08fdba | 1469 | { |
f1dedc31 MM |
1470 | tree stmt_expr; |
1471 | tree compound_stmt; | |
1472 | int destroy_temps; | |
8d08fdba MS |
1473 | tree type = TREE_TYPE (exp); |
1474 | int was_const = TREE_READONLY (exp); | |
f30432d7 | 1475 | int was_volatile = TREE_THIS_VOLATILE (exp); |
2a3398e1 | 1476 | int is_global; |
8d08fdba MS |
1477 | |
1478 | if (init == error_mark_node) | |
f1dedc31 | 1479 | return error_mark_node; |
8d08fdba MS |
1480 | |
1481 | TREE_READONLY (exp) = 0; | |
f30432d7 MS |
1482 | TREE_THIS_VOLATILE (exp) = 0; |
1483 | ||
611d6f76 | 1484 | if (init && TREE_CODE (init) != TREE_LIST |
e08cc018 JM |
1485 | && !(TREE_CODE (init) == TARGET_EXPR |
1486 | && TARGET_EXPR_DIRECT_INIT_P (init)) | |
611d6f76 JM |
1487 | && !(BRACE_ENCLOSED_INITIALIZER_P (init) |
1488 | && CONSTRUCTOR_IS_DIRECT_INIT (init))) | |
f30432d7 | 1489 | flags |= LOOKUP_ONLYCONVERTING; |
8d08fdba MS |
1490 | |
1491 | if (TREE_CODE (type) == ARRAY_TYPE) | |
1492 | { | |
671cb993 MM |
1493 | tree itype; |
1494 | ||
92a62aad MM |
1495 | /* An array may not be initialized use the parenthesized |
1496 | initialization form -- unless the initializer is "()". */ | |
1497 | if (init && TREE_CODE (init) == TREE_LIST) | |
8d08fdba | 1498 | { |
5ade1ed2 DG |
1499 | if (complain & tf_error) |
1500 | error ("bad array initializer"); | |
f1dedc31 | 1501 | return error_mark_node; |
8d08fdba | 1502 | } |
92a62aad MM |
1503 | /* Must arrange to initialize each element of EXP |
1504 | from elements of INIT. */ | |
671cb993 | 1505 | itype = init ? TREE_TYPE (init) : NULL_TREE; |
36c37128 JM |
1506 | if (cv_qualified_p (type)) |
1507 | TREE_TYPE (exp) = cv_unqualified (type); | |
1508 | if (itype && cv_qualified_p (itype)) | |
1509 | TREE_TYPE (init) = cv_unqualified (itype); | |
a48cccea | 1510 | stmt_expr = build_vec_init (exp, NULL_TREE, init, |
844ae01d | 1511 | /*explicit_value_init_p=*/false, |
36c37128 | 1512 | itype && same_type_p (TREE_TYPE (init), |
5ade1ed2 DG |
1513 | TREE_TYPE (exp)), |
1514 | complain); | |
8d08fdba | 1515 | TREE_READONLY (exp) = was_const; |
f30432d7 | 1516 | TREE_THIS_VOLATILE (exp) = was_volatile; |
8d08fdba | 1517 | TREE_TYPE (exp) = type; |
f376e137 MS |
1518 | if (init) |
1519 | TREE_TYPE (init) = itype; | |
f1dedc31 | 1520 | return stmt_expr; |
8d08fdba MS |
1521 | } |
1522 | ||
5a6ccc94 | 1523 | if (VAR_P (exp) || TREE_CODE (exp) == PARM_DECL) |
f4f206f4 | 1524 | /* Just know that we've seen something for this node. */ |
8d08fdba MS |
1525 | TREE_USED (exp) = 1; |
1526 | ||
2a3398e1 | 1527 | is_global = begin_init_stmts (&stmt_expr, &compound_stmt); |
f2c5f623 | 1528 | destroy_temps = stmts_are_full_exprs_p (); |
ae499cce | 1529 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
8d08fdba | 1530 | expand_aggr_init_1 (TYPE_BINFO (type), exp, exp, |
5ade1ed2 | 1531 | init, LOOKUP_NORMAL|flags, complain); |
2a3398e1 | 1532 | stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); |
ae499cce | 1533 | current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; |
8d08fdba | 1534 | TREE_READONLY (exp) = was_const; |
f30432d7 | 1535 | TREE_THIS_VOLATILE (exp) = was_volatile; |
f1dedc31 MM |
1536 | |
1537 | return stmt_expr; | |
8d08fdba MS |
1538 | } |
1539 | ||
1540 | static void | |
5ade1ed2 DG |
1541 | expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags, |
1542 | tsubst_flags_t complain) | |
8d08fdba | 1543 | { |
fc378698 | 1544 | tree type = TREE_TYPE (exp); |
9eb71d8c | 1545 | tree ctor_name; |
fc378698 | 1546 | |
8d08fdba MS |
1547 | /* It fails because there may not be a constructor which takes |
1548 | its own type as the first (or only parameter), but which does | |
1549 | take other types via a conversion. So, if the thing initializing | |
1550 | the expression is a unit element of type X, first try X(X&), | |
1551 | followed by initialization by X. If neither of these work | |
1552 | out, then look hard. */ | |
1553 | tree rval; | |
9771b263 | 1554 | vec<tree, va_gc> *parms; |
8d08fdba | 1555 | |
2061820e JM |
1556 | /* If we have direct-initialization from an initializer list, pull |
1557 | it out of the TREE_LIST so the code below can see it. */ | |
1558 | if (init && TREE_CODE (init) == TREE_LIST | |
1559 | && BRACE_ENCLOSED_INITIALIZER_P (TREE_VALUE (init)) | |
1560 | && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init))) | |
1561 | { | |
1562 | gcc_checking_assert ((flags & LOOKUP_ONLYCONVERTING) == 0 | |
1563 | && TREE_CHAIN (init) == NULL_TREE); | |
1564 | init = TREE_VALUE (init); | |
1565 | } | |
1566 | ||
4c9b3895 JM |
1567 | if (init && BRACE_ENCLOSED_INITIALIZER_P (init) |
1568 | && CP_AGGREGATE_TYPE_P (type)) | |
e08cc018 JM |
1569 | /* A brace-enclosed initializer for an aggregate. In C++0x this can |
1570 | happen for direct-initialization, too. */ | |
1571 | init = digest_init (type, init, complain); | |
1572 | ||
1573 | /* A CONSTRUCTOR of the target's type is a previously digested | |
1574 | initializer, whether that happened just above or in | |
1575 | cp_parser_late_parsing_nsdmi. | |
1576 | ||
1577 | A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P | |
1578 | set represents the whole initialization, so we shouldn't build up | |
1579 | another ctor call. */ | |
1580 | if (init | |
1581 | && (TREE_CODE (init) == CONSTRUCTOR | |
1582 | || (TREE_CODE (init) == TARGET_EXPR | |
1583 | && (TARGET_EXPR_DIRECT_INIT_P (init) | |
1584 | || TARGET_EXPR_LIST_INIT_P (init)))) | |
1585 | && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (init), type)) | |
4c9b3895 | 1586 | { |
e08cc018 JM |
1587 | /* Early initialization via a TARGET_EXPR only works for |
1588 | complete objects. */ | |
1589 | gcc_assert (TREE_CODE (init) == CONSTRUCTOR || true_exp == exp); | |
1590 | ||
4c9b3895 JM |
1591 | init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init); |
1592 | TREE_SIDE_EFFECTS (init) = 1; | |
1593 | finish_expr_stmt (init); | |
1594 | return; | |
1595 | } | |
1596 | ||
277294d7 | 1597 | if (init && TREE_CODE (init) != TREE_LIST |
faf5394a MS |
1598 | && (flags & LOOKUP_ONLYCONVERTING)) |
1599 | { | |
1600 | /* Base subobjects should only get direct-initialization. */ | |
8dc2b103 | 1601 | gcc_assert (true_exp == exp); |
faf5394a | 1602 | |
c37dc68e JM |
1603 | if (flags & DIRECT_BIND) |
1604 | /* Do nothing. We hit this in two cases: Reference initialization, | |
1605 | where we aren't initializing a real variable, so we don't want | |
1606 | to run a new constructor; and catching an exception, where we | |
1607 | have already built up the constructor call so we could wrap it | |
1608 | in an exception region. */; | |
1609 | else | |
4b978f96 PC |
1610 | init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, |
1611 | flags, complain); | |
faf5394a | 1612 | |
4e8dca1c JM |
1613 | if (TREE_CODE (init) == MUST_NOT_THROW_EXPR) |
1614 | /* We need to protect the initialization of a catch parm with a | |
1615 | call to terminate(), which shows up as a MUST_NOT_THROW_EXPR | |
c7ae64f2 | 1616 | around the TARGET_EXPR for the copy constructor. See |
4e8dca1c JM |
1617 | initialize_handler_parm. */ |
1618 | { | |
f293ce4b RS |
1619 | TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp, |
1620 | TREE_OPERAND (init, 0)); | |
4e8dca1c JM |
1621 | TREE_TYPE (init) = void_type_node; |
1622 | } | |
c7ae64f2 | 1623 | else |
f293ce4b | 1624 | init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init); |
c7ae64f2 | 1625 | TREE_SIDE_EFFECTS (init) = 1; |
f1dedc31 | 1626 | finish_expr_stmt (init); |
faf5394a MS |
1627 | return; |
1628 | } | |
1629 | ||
c166b898 ILT |
1630 | if (init == NULL_TREE) |
1631 | parms = NULL; | |
1632 | else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init)) | |
8d08fdba | 1633 | { |
c166b898 ILT |
1634 | parms = make_tree_vector (); |
1635 | for (; init != NULL_TREE; init = TREE_CHAIN (init)) | |
9771b263 | 1636 | vec_safe_push (parms, TREE_VALUE (init)); |
8d08fdba | 1637 | } |
8d08fdba | 1638 | else |
c166b898 | 1639 | parms = make_tree_vector_single (init); |
8d08fdba | 1640 | |
238e471c VV |
1641 | if (exp == current_class_ref && current_function_decl |
1642 | && DECL_HAS_IN_CHARGE_PARM_P (current_function_decl)) | |
1643 | { | |
1644 | /* Delegating constructor. */ | |
1645 | tree complete; | |
1646 | tree base; | |
c4ce224c JM |
1647 | tree elt; unsigned i; |
1648 | ||
1649 | /* Unshare the arguments for the second call. */ | |
9771b263 DN |
1650 | vec<tree, va_gc> *parms2 = make_tree_vector (); |
1651 | FOR_EACH_VEC_SAFE_ELT (parms, i, elt) | |
c4ce224c JM |
1652 | { |
1653 | elt = break_out_target_exprs (elt); | |
9771b263 | 1654 | vec_safe_push (parms2, elt); |
c4ce224c | 1655 | } |
238e471c | 1656 | complete = build_special_member_call (exp, complete_ctor_identifier, |
c4ce224c JM |
1657 | &parms2, binfo, flags, |
1658 | complain); | |
1659 | complete = fold_build_cleanup_point_expr (void_type_node, complete); | |
1660 | release_tree_vector (parms2); | |
1661 | ||
238e471c VV |
1662 | base = build_special_member_call (exp, base_ctor_identifier, |
1663 | &parms, binfo, flags, | |
1664 | complain); | |
c4ce224c JM |
1665 | base = fold_build_cleanup_point_expr (void_type_node, base); |
1666 | rval = build3 (COND_EXPR, void_type_node, | |
1667 | build2 (EQ_EXPR, boolean_type_node, | |
1668 | current_in_charge_parm, integer_zero_node), | |
1669 | base, | |
1670 | complete); | |
238e471c VV |
1671 | } |
1672 | else | |
1673 | { | |
1674 | if (true_exp == exp) | |
1675 | ctor_name = complete_ctor_identifier; | |
1676 | else | |
1677 | ctor_name = base_ctor_identifier; | |
1678 | rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags, | |
1679 | complain); | |
1680 | } | |
c166b898 ILT |
1681 | |
1682 | if (parms != NULL) | |
1683 | release_tree_vector (parms); | |
1684 | ||
fa2200cb JM |
1685 | if (exp == true_exp && TREE_CODE (rval) == CALL_EXPR) |
1686 | { | |
1687 | tree fn = get_callee_fndecl (rval); | |
a76c13bf | 1688 | if (fn && DECL_DECLARED_CONSTEXPR_P (fn)) |
fa2200cb | 1689 | { |
07a9e891 | 1690 | tree e = maybe_constant_init (rval); |
fa2200cb JM |
1691 | if (TREE_CONSTANT (e)) |
1692 | rval = build2 (INIT_EXPR, type, exp, e); | |
1693 | } | |
1694 | } | |
1695 | ||
1696 | /* FIXME put back convert_to_void? */ | |
25eb19ff | 1697 | if (TREE_SIDE_EFFECTS (rval)) |
fa2200cb | 1698 | finish_expr_stmt (rval); |
8d08fdba MS |
1699 | } |
1700 | ||
1701 | /* This function is responsible for initializing EXP with INIT | |
1702 | (if any). | |
1703 | ||
1704 | BINFO is the binfo of the type for who we are performing the | |
1705 | initialization. For example, if W is a virtual base class of A and B, | |
1706 | and C : A, B. | |
1707 | If we are initializing B, then W must contain B's W vtable, whereas | |
1708 | were we initializing C, W must contain C's W vtable. | |
1709 | ||
1710 | TRUE_EXP is nonzero if it is the true expression being initialized. | |
1711 | In this case, it may be EXP, or may just contain EXP. The reason we | |
1712 | need this is because if EXP is a base element of TRUE_EXP, we | |
1713 | don't necessarily know by looking at EXP where its virtual | |
1714 | baseclass fields should really be pointing. But we do know | |
1715 | from TRUE_EXP. In constructors, we don't know anything about | |
1716 | the value being initialized. | |
1717 | ||
9f880ef9 MM |
1718 | FLAGS is just passed to `build_new_method_call'. See that function |
1719 | for its description. */ | |
8d08fdba MS |
1720 | |
1721 | static void | |
5ade1ed2 DG |
1722 | expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags, |
1723 | tsubst_flags_t complain) | |
8d08fdba MS |
1724 | { |
1725 | tree type = TREE_TYPE (exp); | |
8d08fdba | 1726 | |
50bc768d | 1727 | gcc_assert (init != error_mark_node && type != error_mark_node); |
38e01f9e | 1728 | gcc_assert (building_stmt_list_p ()); |
8d08fdba MS |
1729 | |
1730 | /* Use a function returning the desired type to initialize EXP for us. | |
1731 | If the function is a constructor, and its first argument is | |
1732 | NULL_TREE, know that it was meant for us--just slide exp on | |
1733 | in and expand the constructor. Constructors now come | |
1734 | as TARGET_EXPRs. */ | |
faf5394a | 1735 | |
5a6ccc94 | 1736 | if (init && VAR_P (exp) |
3b2db49f | 1737 | && COMPOUND_LITERAL_P (init)) |
faf5394a | 1738 | { |
9771b263 | 1739 | vec<tree, va_gc> *cleanups = NULL; |
f1dedc31 | 1740 | /* If store_init_value returns NULL_TREE, the INIT has been |
3b2db49f | 1741 | recorded as the DECL_INITIAL for EXP. That means there's |
f1dedc31 | 1742 | nothing more we have to do. */ |
b25dd954 | 1743 | init = store_init_value (exp, init, &cleanups, flags); |
25ebb82a RH |
1744 | if (init) |
1745 | finish_expr_stmt (init); | |
b25dd954 | 1746 | gcc_assert (!cleanups); |
faf5394a MS |
1747 | return; |
1748 | } | |
1749 | ||
fd97a96a JM |
1750 | /* If an explicit -- but empty -- initializer list was present, |
1751 | that's value-initialization. */ | |
1752 | if (init == void_type_node) | |
1753 | { | |
c2b3ec18 JM |
1754 | /* If the type has data but no user-provided ctor, we need to zero |
1755 | out the object. */ | |
1756 | if (!type_has_user_provided_constructor (type) | |
1757 | && !is_really_empty_class (type)) | |
fd97a96a | 1758 | { |
1fb0b801 JM |
1759 | tree field_size = NULL_TREE; |
1760 | if (exp != true_exp && CLASSTYPE_AS_BASE (type) != type) | |
1761 | /* Don't clobber already initialized virtual bases. */ | |
1762 | field_size = TYPE_SIZE (CLASSTYPE_AS_BASE (type)); | |
1763 | init = build_zero_init_1 (type, NULL_TREE, /*static_storage_p=*/false, | |
1764 | field_size); | |
fd97a96a JM |
1765 | init = build2 (INIT_EXPR, type, exp, init); |
1766 | finish_expr_stmt (init); | |
fd97a96a | 1767 | } |
1fb0b801 | 1768 | |
fd97a96a | 1769 | /* If we don't need to mess with the constructor at all, |
1fb0b801 JM |
1770 | then we're done. */ |
1771 | if (! type_build_ctor_call (type)) | |
1772 | return; | |
1773 | ||
1774 | /* Otherwise fall through and call the constructor. */ | |
fd97a96a JM |
1775 | init = NULL_TREE; |
1776 | } | |
1777 | ||
9e9ff709 MS |
1778 | /* We know that expand_default_init can handle everything we want |
1779 | at this point. */ | |
5ade1ed2 | 1780 | expand_default_init (binfo, true_exp, exp, init, flags, complain); |
8d08fdba MS |
1781 | } |
1782 | ||
9e1e64ec | 1783 | /* Report an error if TYPE is not a user-defined, class type. If |
be99da77 | 1784 | OR_ELSE is nonzero, give an error message. */ |
e92cc029 | 1785 | |
be99da77 | 1786 | int |
9e1e64ec | 1787 | is_class_type (tree type, int or_else) |
be99da77 MS |
1788 | { |
1789 | if (type == error_mark_node) | |
1790 | return 0; | |
1791 | ||
9e1e64ec | 1792 | if (! CLASS_TYPE_P (type)) |
be99da77 MS |
1793 | { |
1794 | if (or_else) | |
9e1e64ec | 1795 | error ("%qT is not a class type", type); |
be99da77 MS |
1796 | return 0; |
1797 | } | |
1798 | return 1; | |
1799 | } | |
1800 | ||
8d08fdba | 1801 | tree |
362efdc1 | 1802 | get_type_value (tree name) |
8d08fdba | 1803 | { |
8d08fdba MS |
1804 | if (name == error_mark_node) |
1805 | return NULL_TREE; | |
1806 | ||
1807 | if (IDENTIFIER_HAS_TYPE_VALUE (name)) | |
1808 | return IDENTIFIER_TYPE_VALUE (name); | |
8d08fdba MS |
1809 | else |
1810 | return NULL_TREE; | |
1811 | } | |
051e6fd7 | 1812 | |
a5ac359a MM |
1813 | /* Build a reference to a member of an aggregate. This is not a C++ |
1814 | `&', but really something which can have its address taken, and | |
1815 | then act as a pointer to member, for example TYPE :: FIELD can have | |
1816 | its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if | |
1817 | this expression is the operand of "&". | |
8d08fdba MS |
1818 | |
1819 | @@ Prints out lousy diagnostics for operator <typename> | |
1820 | @@ fields. | |
1821 | ||
51c184be | 1822 | @@ This function should be rewritten and placed in search.c. */ |
e92cc029 | 1823 | |
8d08fdba | 1824 | tree |
a378996b PC |
1825 | build_offset_ref (tree type, tree member, bool address_p, |
1826 | tsubst_flags_t complain) | |
8d08fdba | 1827 | { |
8d245821 | 1828 | tree decl; |
fc378698 | 1829 | tree basebinfo = NULL_TREE; |
8d08fdba | 1830 | |
5f311aec | 1831 | /* class templates can come in as TEMPLATE_DECLs here. */ |
d4f0f205 MM |
1832 | if (TREE_CODE (member) == TEMPLATE_DECL) |
1833 | return member; | |
93cdc044 | 1834 | |
627bc938 JM |
1835 | if (dependent_scope_p (type) || type_dependent_expression_p (member)) |
1836 | return build_qualified_name (NULL_TREE, type, member, | |
2d660b7f | 1837 | /*template_p=*/false); |
5566b478 | 1838 | |
d4f0f205 | 1839 | gcc_assert (TYPE_P (type)); |
9e1e64ec | 1840 | if (! is_class_type (type, 1)) |
c833d2be NS |
1841 | return error_mark_node; |
1842 | ||
d4f0f205 MM |
1843 | gcc_assert (DECL_P (member) || BASELINK_P (member)); |
1844 | /* Callers should call mark_used before this point. */ | |
3146f36f | 1845 | gcc_assert (!DECL_P (member) || TREE_USED (member)); |
be99da77 | 1846 | |
627bc938 | 1847 | type = TYPE_MAIN_VARIANT (type); |
01628e54 | 1848 | if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type))) |
8d08fdba | 1849 | { |
a378996b PC |
1850 | if (complain & tf_error) |
1851 | error ("incomplete type %qT does not have member %qD", type, member); | |
a5ac359a MM |
1852 | return error_mark_node; |
1853 | } | |
1854 | ||
d4f0f205 | 1855 | /* Entities other than non-static members need no further |
3db45ab5 | 1856 | processing. */ |
a5ac359a | 1857 | if (TREE_CODE (member) == TYPE_DECL) |
d4f0f205 | 1858 | return member; |
5a6ccc94 | 1859 | if (VAR_P (member) || TREE_CODE (member) == CONST_DECL) |
d4f0f205 | 1860 | return convert_from_reference (member); |
a5ac359a MM |
1861 | |
1862 | if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member)) | |
1863 | { | |
a378996b PC |
1864 | if (complain & tf_error) |
1865 | error ("invalid pointer to bit-field %qD", member); | |
a5ac359a MM |
1866 | return error_mark_node; |
1867 | } | |
1868 | ||
d4f0f205 MM |
1869 | /* Set up BASEBINFO for member lookup. */ |
1870 | decl = maybe_dummy_object (type, &basebinfo); | |
1871 | ||
aa52c1ff | 1872 | /* A lot of this logic is now handled in lookup_member. */ |
a5ac359a | 1873 | if (BASELINK_P (member)) |
8d08fdba | 1874 | { |
8d08fdba | 1875 | /* Go from the TREE_BASELINK to the member function info. */ |
7304fcb4 | 1876 | tree t = BASELINK_FUNCTIONS (member); |
8d08fdba | 1877 | |
50ad9642 | 1878 | if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t)) |
8d08fdba | 1879 | { |
f4f206f4 | 1880 | /* Get rid of a potential OVERLOAD around it. */ |
2c73f9f5 ML |
1881 | t = OVL_CURRENT (t); |
1882 | ||
b54f5338 KL |
1883 | /* Unique functions are handled easily. */ |
1884 | ||
1885 | /* For non-static member of base class, we need a special rule | |
1886 | for access checking [class.protected]: | |
1887 | ||
1888 | If the access is to form a pointer to member, the | |
1889 | nested-name-specifier shall name the derived class | |
1890 | (or any class derived from that class). */ | |
1891 | if (address_p && DECL_P (t) | |
1892 | && DECL_NONSTATIC_MEMBER_P (t)) | |
0e69fdf0 | 1893 | perform_or_defer_access_check (TYPE_BINFO (type), t, t, |
a378996b | 1894 | complain); |
b54f5338 | 1895 | else |
0e69fdf0 | 1896 | perform_or_defer_access_check (basebinfo, t, t, |
a378996b | 1897 | complain); |
b54f5338 | 1898 | |
848b92e1 JM |
1899 | if (DECL_STATIC_FUNCTION_P (t)) |
1900 | return t; | |
a5ac359a MM |
1901 | member = t; |
1902 | } | |
1903 | else | |
7304fcb4 | 1904 | TREE_TYPE (member) = unknown_type_node; |
8d08fdba | 1905 | } |
b54f5338 KL |
1906 | else if (address_p && TREE_CODE (member) == FIELD_DECL) |
1907 | /* We need additional test besides the one in | |
1908 | check_accessibility_of_qualified_id in case it is | |
1909 | a pointer to non-static member. */ | |
0e69fdf0 | 1910 | perform_or_defer_access_check (TYPE_BINFO (type), member, member, |
a378996b | 1911 | complain); |
8d08fdba | 1912 | |
a5ac359a | 1913 | if (!address_p) |
8d08fdba | 1914 | { |
a5ac359a MM |
1915 | /* If MEMBER is non-static, then the program has fallen afoul of |
1916 | [expr.prim]: | |
8d08fdba | 1917 | |
a5ac359a MM |
1918 | An id-expression that denotes a nonstatic data member or |
1919 | nonstatic member function of a class can only be used: | |
8d08fdba | 1920 | |
a5ac359a MM |
1921 | -- as part of a class member access (_expr.ref_) in which the |
1922 | object-expression refers to the member's class or a class | |
1923 | derived from that class, or | |
b7484fbe | 1924 | |
a5ac359a MM |
1925 | -- to form a pointer to member (_expr.unary.op_), or |
1926 | ||
1927 | -- in the body of a nonstatic member function of that class or | |
1928 | of a class derived from that class (_class.mfct.nonstatic_), or | |
1929 | ||
1930 | -- in a mem-initializer for a constructor for that class or for | |
1931 | a class derived from that class (_class.base.init_). */ | |
1932 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member)) | |
1933 | { | |
39a13be5 | 1934 | /* Build a representation of the qualified name suitable |
e9525111 MM |
1935 | for use as the operand to "&" -- even though the "&" is |
1936 | not actually present. */ | |
f293ce4b | 1937 | member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); |
a5ac359a MM |
1938 | /* In Microsoft mode, treat a non-static member function as if |
1939 | it were a pointer-to-member. */ | |
1940 | if (flag_ms_extensions) | |
1941 | { | |
a5ac359a | 1942 | PTRMEM_OK_P (member) = 1; |
a378996b | 1943 | return cp_build_addr_expr (member, complain); |
a5ac359a | 1944 | } |
a378996b PC |
1945 | if (complain & tf_error) |
1946 | error ("invalid use of non-static member function %qD", | |
1947 | TREE_OPERAND (member, 1)); | |
07471dfb | 1948 | return error_mark_node; |
a5ac359a MM |
1949 | } |
1950 | else if (TREE_CODE (member) == FIELD_DECL) | |
1951 | { | |
a378996b PC |
1952 | if (complain & tf_error) |
1953 | error ("invalid use of non-static data member %qD", member); | |
a5ac359a MM |
1954 | return error_mark_node; |
1955 | } | |
1956 | return member; | |
1957 | } | |
8d08fdba | 1958 | |
f293ce4b | 1959 | member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); |
8d245821 MM |
1960 | PTRMEM_OK_P (member) = 1; |
1961 | return member; | |
8d08fdba MS |
1962 | } |
1963 | ||
393e756d MM |
1964 | /* If DECL is a scalar enumeration constant or variable with a |
1965 | constant initializer, return the initializer (or, its initializers, | |
1966 | recursively); otherwise, return DECL. If INTEGRAL_P, the | |
1967 | initializer is only returned if DECL is an integral | |
90454da1 PC |
1968 | constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to |
1969 | return an aggregate constant. */ | |
8d08fdba | 1970 | |
393e756d | 1971 | static tree |
90454da1 | 1972 | constant_value_1 (tree decl, bool integral_p, bool return_aggregate_cst_ok_p) |
8d08fdba | 1973 | { |
f513e31f | 1974 | while (TREE_CODE (decl) == CONST_DECL |
3db45ab5 | 1975 | || (integral_p |
fa2200cb | 1976 | ? decl_constant_var_p (decl) |
5a6ccc94 | 1977 | : (VAR_P (decl) |
393e756d | 1978 | && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl))))) |
b794e321 MM |
1979 | { |
1980 | tree init; | |
fa2200cb JM |
1981 | /* If DECL is a static data member in a template |
1982 | specialization, we must instantiate it here. The | |
1983 | initializer for the static data member is not processed | |
1984 | until needed; we need it now. */ | |
1985 | mark_used (decl); | |
1986 | mark_rvalue_use (decl); | |
1987 | init = DECL_INITIAL (decl); | |
d174af6c | 1988 | if (init == error_mark_node) |
88274c4d JM |
1989 | { |
1990 | if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)) | |
1991 | /* Treat the error as a constant to avoid cascading errors on | |
1992 | excessively recursive template instantiation (c++/9335). */ | |
1993 | return init; | |
1994 | else | |
1995 | return decl; | |
1996 | } | |
73ce7fcb JJ |
1997 | /* Initializers in templates are generally expanded during |
1998 | instantiation, so before that for const int i(2) | |
1999 | INIT is a TREE_LIST with the actual initializer as | |
2000 | TREE_VALUE. */ | |
2001 | if (processing_template_decl | |
2002 | && init | |
2003 | && TREE_CODE (init) == TREE_LIST | |
2004 | && TREE_CHAIN (init) == NULL_TREE) | |
2005 | init = TREE_VALUE (init); | |
d174af6c | 2006 | if (!init |
b794e321 | 2007 | || !TREE_TYPE (init) |
8152661b | 2008 | || !TREE_CONSTANT (init) |
90454da1 PC |
2009 | || (!integral_p && !return_aggregate_cst_ok_p |
2010 | /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not | |
2011 | return an aggregate constant (of which string | |
2012 | literals are a special case), as we do not want | |
2013 | to make inadvertent copies of such entities, and | |
2014 | we must be sure that their addresses are the | |
2015 | same everywhere. */ | |
8152661b JM |
2016 | && (TREE_CODE (init) == CONSTRUCTOR |
2017 | || TREE_CODE (init) == STRING_CST))) | |
b794e321 | 2018 | break; |
57b37fe3 | 2019 | decl = unshare_expr (init); |
b794e321 | 2020 | } |
8a784e4a NS |
2021 | return decl; |
2022 | } | |
a1652802 | 2023 | |
393e756d MM |
2024 | /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by |
2025 | constant of integral or enumeration type, then return that value. | |
2026 | These are those variables permitted in constant expressions by | |
2027 | [5.19/1]. */ | |
a1652802 | 2028 | |
8a784e4a | 2029 | tree |
393e756d | 2030 | integral_constant_value (tree decl) |
8a784e4a | 2031 | { |
90454da1 PC |
2032 | return constant_value_1 (decl, /*integral_p=*/true, |
2033 | /*return_aggregate_cst_ok_p=*/false); | |
393e756d | 2034 | } |
c8094d83 | 2035 | |
393e756d | 2036 | /* A more relaxed version of integral_constant_value, used by the |
90454da1 | 2037 | common C/C++ code. */ |
393e756d MM |
2038 | |
2039 | tree | |
2040 | decl_constant_value (tree decl) | |
2041 | { | |
90454da1 PC |
2042 | return constant_value_1 (decl, /*integral_p=*/processing_template_decl, |
2043 | /*return_aggregate_cst_ok_p=*/true); | |
2044 | } | |
2045 | ||
2046 | /* A version of integral_constant_value used by the C++ front end for | |
2047 | optimization purposes. */ | |
2048 | ||
2049 | tree | |
2050 | decl_constant_value_safe (tree decl) | |
2051 | { | |
2052 | return constant_value_1 (decl, /*integral_p=*/processing_template_decl, | |
2053 | /*return_aggregate_cst_ok_p=*/false); | |
8d08fdba MS |
2054 | } |
2055 | \f | |
8d08fdba MS |
2056 | /* Common subroutines of build_new and build_vec_delete. */ |
2057 | ||
c787dd82 | 2058 | /* Call the global __builtin_delete to delete ADDR. */ |
8d08fdba | 2059 | |
bd6dd845 | 2060 | static tree |
362efdc1 | 2061 | build_builtin_delete_call (tree addr) |
8d08fdba | 2062 | { |
a6ecf8b6 | 2063 | mark_used (global_delete_fndecl); |
94a0dd7b | 2064 | return build_call_n (global_delete_fndecl, 1, addr); |
8d08fdba MS |
2065 | } |
2066 | \f | |
63c9a190 MM |
2067 | /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is |
2068 | the type of the object being allocated; otherwise, it's just TYPE. | |
2069 | INIT is the initializer, if any. USE_GLOBAL_NEW is true if the | |
2070 | user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is | |
c166b898 ILT |
2071 | a vector of arguments to be provided as arguments to a placement |
2072 | new operator. This routine performs no semantic checks; it just | |
2073 | creates and returns a NEW_EXPR. */ | |
a0d5fba7 | 2074 | |
63c9a190 | 2075 | static tree |
9771b263 DN |
2076 | build_raw_new_expr (vec<tree, va_gc> *placement, tree type, tree nelts, |
2077 | vec<tree, va_gc> *init, int use_global_new) | |
743f140d | 2078 | { |
c166b898 | 2079 | tree init_list; |
63c9a190 | 2080 | tree new_expr; |
3db45ab5 | 2081 | |
c166b898 ILT |
2082 | /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR. |
2083 | If INIT is not NULL, then we want to store VOID_ZERO_NODE. This | |
2084 | permits us to distinguish the case of a missing initializer "new | |
2085 | int" from an empty initializer "new int()". */ | |
2086 | if (init == NULL) | |
2087 | init_list = NULL_TREE; | |
9771b263 | 2088 | else if (init->is_empty ()) |
c166b898 ILT |
2089 | init_list = void_zero_node; |
2090 | else | |
2091 | init_list = build_tree_list_vec (init); | |
2092 | ||
2093 | new_expr = build4 (NEW_EXPR, build_pointer_type (type), | |
2094 | build_tree_list_vec (placement), type, nelts, | |
2095 | init_list); | |
63c9a190 MM |
2096 | NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new; |
2097 | TREE_SIDE_EFFECTS (new_expr) = 1; | |
2098 | ||
2099 | return new_expr; | |
743f140d PB |
2100 | } |
2101 | ||
9d809e8f FC |
2102 | /* Diagnose uninitialized const members or reference members of type |
2103 | TYPE. USING_NEW is used to disambiguate the diagnostic between a | |
40bb78ad FC |
2104 | new expression without a new-initializer and a declaration. Returns |
2105 | the error count. */ | |
9d809e8f | 2106 | |
40bb78ad | 2107 | static int |
9d809e8f | 2108 | diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin, |
40bb78ad | 2109 | bool using_new, bool complain) |
9d809e8f FC |
2110 | { |
2111 | tree field; | |
40bb78ad | 2112 | int error_count = 0; |
9d809e8f | 2113 | |
10ab8f62 | 2114 | if (type_has_user_provided_constructor (type)) |
40bb78ad | 2115 | return 0; |
10ab8f62 | 2116 | |
910ad8de | 2117 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
9d809e8f FC |
2118 | { |
2119 | tree field_type; | |
2120 | ||
2121 | if (TREE_CODE (field) != FIELD_DECL) | |
2122 | continue; | |
2123 | ||
2124 | field_type = strip_array_types (TREE_TYPE (field)); | |
2125 | ||
1c682d06 FC |
2126 | if (type_has_user_provided_constructor (field_type)) |
2127 | continue; | |
2128 | ||
9d809e8f FC |
2129 | if (TREE_CODE (field_type) == REFERENCE_TYPE) |
2130 | { | |
40bb78ad FC |
2131 | ++ error_count; |
2132 | if (complain) | |
2133 | { | |
2134 | if (using_new) | |
2135 | error ("uninitialized reference member in %q#T " | |
2136 | "using %<new%> without new-initializer", origin); | |
2137 | else | |
2138 | error ("uninitialized reference member in %q#T", origin); | |
2139 | inform (DECL_SOURCE_LOCATION (field), | |
2140 | "%qD should be initialized", field); | |
2141 | } | |
9d809e8f FC |
2142 | } |
2143 | ||
2144 | if (CP_TYPE_CONST_P (field_type)) | |
2145 | { | |
40bb78ad FC |
2146 | ++ error_count; |
2147 | if (complain) | |
2148 | { | |
2149 | if (using_new) | |
2150 | error ("uninitialized const member in %q#T " | |
2151 | "using %<new%> without new-initializer", origin); | |
2152 | else | |
2153 | error ("uninitialized const member in %q#T", origin); | |
2154 | inform (DECL_SOURCE_LOCATION (field), | |
2155 | "%qD should be initialized", field); | |
2156 | } | |
9d809e8f FC |
2157 | } |
2158 | ||
2159 | if (CLASS_TYPE_P (field_type)) | |
40bb78ad FC |
2160 | error_count |
2161 | += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin, | |
2162 | using_new, complain); | |
9d809e8f | 2163 | } |
40bb78ad | 2164 | return error_count; |
9d809e8f FC |
2165 | } |
2166 | ||
40bb78ad FC |
2167 | int |
2168 | diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain) | |
9d809e8f | 2169 | { |
40bb78ad | 2170 | return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain); |
9d809e8f FC |
2171 | } |
2172 | ||
7d5e76c8 JM |
2173 | /* Call __cxa_bad_array_new_length to indicate that the size calculation |
2174 | overflowed. Pretend it returns sizetype so that it plays nicely in the | |
2175 | COND_EXPR. */ | |
2176 | ||
2177 | tree | |
2178 | throw_bad_array_new_length (void) | |
2179 | { | |
2180 | tree fn = get_identifier ("__cxa_throw_bad_array_new_length"); | |
2181 | if (!get_global_value_if_present (fn, &fn)) | |
2182 | fn = push_throw_library_fn (fn, build_function_type_list (sizetype, | |
2183 | NULL_TREE)); | |
2184 | ||
2185 | return build_cxx_call (fn, 0, NULL, tf_warning_or_error); | |
2186 | } | |
2187 | ||
0138d6b2 JM |
2188 | /* Call __cxa_bad_array_length to indicate that there were too many |
2189 | initializers. */ | |
2190 | ||
2191 | tree | |
2192 | throw_bad_array_length (void) | |
2193 | { | |
2194 | tree fn = get_identifier ("__cxa_throw_bad_array_length"); | |
2195 | if (!get_global_value_if_present (fn, &fn)) | |
2196 | fn = push_throw_library_fn (fn, build_function_type_list (void_type_node, | |
2197 | NULL_TREE)); | |
2198 | ||
2199 | return build_cxx_call (fn, 0, NULL, tf_warning_or_error); | |
2200 | } | |
2201 | ||
63c9a190 MM |
2202 | /* Generate code for a new-expression, including calling the "operator |
2203 | new" function, initializing the object, and, if an exception occurs | |
2204 | during construction, cleaning up. The arguments are as for | |
c166b898 | 2205 | build_raw_new_expr. This may change PLACEMENT and INIT. */ |
a0d5fba7 | 2206 | |
834c6dff | 2207 | static tree |
9771b263 DN |
2208 | build_new_1 (vec<tree, va_gc> **placement, tree type, tree nelts, |
2209 | vec<tree, va_gc> **init, bool globally_qualified_p, | |
c166b898 | 2210 | tsubst_flags_t complain) |
a0d5fba7 | 2211 | { |
d746e87d MM |
2212 | tree size, rval; |
2213 | /* True iff this is a call to "operator new[]" instead of just | |
c8094d83 | 2214 | "operator new". */ |
d746e87d | 2215 | bool array_p = false; |
9207099b JM |
2216 | /* If ARRAY_P is true, the element type of the array. This is never |
2217 | an ARRAY_TYPE; for something like "new int[3][4]", the | |
d746e87d | 2218 | ELT_TYPE is "int". If ARRAY_P is false, this is the same type as |
9207099b | 2219 | TYPE. */ |
d746e87d | 2220 | tree elt_type; |
f4f4610e MM |
2221 | /* The type of the new-expression. (This type is always a pointer |
2222 | type.) */ | |
2223 | tree pointer_type; | |
25357d1e | 2224 | tree non_const_pointer_type; |
a48cccea | 2225 | tree outer_nelts = NULL_TREE; |
4a84253c FW |
2226 | /* For arrays, a bounds checks on the NELTS parameter. */ |
2227 | tree outer_nelts_check = NULL_TREE; | |
4ebc46e9 | 2228 | bool outer_nelts_from_type = false; |
4a84253c | 2229 | double_int inner_nelts_count = double_int_one; |
f4f4610e | 2230 | tree alloc_call, alloc_expr; |
92d38f38 FW |
2231 | /* Size of the inner array elements. */ |
2232 | double_int inner_size; | |
f4f4610e MM |
2233 | /* The address returned by the call to "operator new". This node is |
2234 | a VAR_DECL and is therefore reusable. */ | |
2235 | tree alloc_node; | |
46ff5047 | 2236 | tree alloc_fn; |
8b5e2ce4 | 2237 | tree cookie_expr, init_expr; |
089d6ea7 | 2238 | int nothrow, check_new; |
743f140d | 2239 | int use_java_new = 0; |
834c6dff MM |
2240 | /* If non-NULL, the number of extra bytes to allocate at the |
2241 | beginning of the storage allocated for an array-new expression in | |
2242 | order to store the number of elements. */ | |
2243 | tree cookie_size = NULL_TREE; | |
c166b898 | 2244 | tree placement_first; |
a9de800a | 2245 | tree placement_expr = NULL_TREE; |
3f41ffd8 MM |
2246 | /* True if the function we are calling is a placement allocation |
2247 | function. */ | |
2248 | bool placement_allocation_fn_p; | |
f4f4610e | 2249 | /* True if the storage must be initialized, either by a constructor |
34cd5ae7 | 2250 | or due to an explicit new-initializer. */ |
f4f4610e MM |
2251 | bool is_initialized; |
2252 | /* The address of the thing allocated, not including any cookie. In | |
2253 | particular, if an array cookie is in use, DATA_ADDR is the | |
2254 | address of the first array element. This node is a VAR_DECL, and | |
2255 | is therefore reusable. */ | |
2256 | tree data_addr; | |
6de9cd9a | 2257 | tree init_preeval_expr = NULL_TREE; |
a0d5fba7 | 2258 | |
058b15c1 | 2259 | if (nelts) |
a0d5fba7 | 2260 | { |
058b15c1 | 2261 | outer_nelts = nelts; |
d746e87d | 2262 | array_p = true; |
a0d5fba7 | 2263 | } |
9207099b | 2264 | else if (TREE_CODE (type) == ARRAY_TYPE) |
d746e87d | 2265 | { |
4ebc46e9 FW |
2266 | /* Transforms new (T[N]) to new T[N]. The former is a GNU |
2267 | extension for variable N. (This also covers new T where T is | |
2268 | a VLA typedef.) */ | |
9207099b JM |
2269 | array_p = true; |
2270 | nelts = array_type_nelts_top (type); | |
2271 | outer_nelts = nelts; | |
2272 | type = TREE_TYPE (type); | |
4ebc46e9 | 2273 | outer_nelts_from_type = true; |
d746e87d | 2274 | } |
834c6dff | 2275 | |
8d08fdba MS |
2276 | /* If our base type is an array, then make sure we know how many elements |
2277 | it has. */ | |
d746e87d MM |
2278 | for (elt_type = type; |
2279 | TREE_CODE (elt_type) == ARRAY_TYPE; | |
2280 | elt_type = TREE_TYPE (elt_type)) | |
4ebc46e9 FW |
2281 | { |
2282 | tree inner_nelts = array_type_nelts_top (elt_type); | |
2283 | tree inner_nelts_cst = maybe_constant_value (inner_nelts); | |
e1f10dd9 | 2284 | if (TREE_CODE (inner_nelts_cst) == INTEGER_CST) |
4a84253c | 2285 | { |
9be0ac8c LC |
2286 | bool overflow; |
2287 | double_int result = TREE_INT_CST (inner_nelts_cst) | |
2288 | .mul_with_sign (inner_nelts_count, | |
2289 | false, &overflow); | |
2290 | if (overflow) | |
4a84253c FW |
2291 | { |
2292 | if (complain & tf_error) | |
2293 | error ("integer overflow in array size"); | |
2294 | nelts = error_mark_node; | |
2295 | } | |
2296 | inner_nelts_count = result; | |
2297 | } | |
2298 | else | |
4ebc46e9 FW |
2299 | { |
2300 | if (complain & tf_error) | |
2301 | { | |
2302 | error_at (EXPR_LOC_OR_HERE (inner_nelts), | |
2303 | "array size in operator new must be constant"); | |
2304 | cxx_constant_value(inner_nelts); | |
2305 | } | |
2306 | nelts = error_mark_node; | |
2307 | } | |
2308 | if (nelts != error_mark_node) | |
2309 | nelts = cp_build_binary_op (input_location, | |
2310 | MULT_EXPR, nelts, | |
2311 | inner_nelts_cst, | |
2312 | complain); | |
2313 | } | |
2314 | ||
2315 | if (variably_modified_type_p (elt_type, NULL_TREE) && (complain & tf_error)) | |
2316 | { | |
2317 | error ("variably modified type not allowed in operator new"); | |
2318 | return error_mark_node; | |
2319 | } | |
2320 | ||
2321 | if (nelts == error_mark_node) | |
2322 | return error_mark_node; | |
2323 | ||
2324 | /* Warn if we performed the (T[N]) to T[N] transformation and N is | |
2325 | variable. */ | |
2326 | if (outer_nelts_from_type | |
2327 | && !TREE_CONSTANT (maybe_constant_value (outer_nelts))) | |
2328 | { | |
2329 | if (complain & tf_warning_or_error) | |
2330 | pedwarn(EXPR_LOC_OR_HERE (outer_nelts), OPT_Wvla, | |
2331 | "ISO C++ does not support variable-length array types"); | |
2332 | else | |
2333 | return error_mark_node; | |
2334 | } | |
5566b478 | 2335 | |
50e10fa8 | 2336 | if (VOID_TYPE_P (elt_type)) |
e1cd6e56 | 2337 | { |
5ade1ed2 DG |
2338 | if (complain & tf_error) |
2339 | error ("invalid type %<void%> for new"); | |
e1cd6e56 MS |
2340 | return error_mark_node; |
2341 | } | |
2342 | ||
2df663cc | 2343 | if (abstract_virtuals_error_sfinae (ACU_NEW, elt_type, complain)) |
a7a64a77 | 2344 | return error_mark_node; |
8926095f | 2345 | |
95552437 | 2346 | is_initialized = (type_build_ctor_call (elt_type) || *init != NULL); |
b87d79e6 | 2347 | |
40bb78ad | 2348 | if (*init == NULL) |
9d809e8f | 2349 | { |
40bb78ad | 2350 | bool maybe_uninitialized_error = false; |
9d809e8f FC |
2351 | /* A program that calls for default-initialization [...] of an |
2352 | entity of reference type is ill-formed. */ | |
2353 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type)) | |
40bb78ad | 2354 | maybe_uninitialized_error = true; |
9d809e8f FC |
2355 | |
2356 | /* A new-expression that creates an object of type T initializes | |
2357 | that object as follows: | |
2358 | - If the new-initializer is omitted: | |
2359 | -- If T is a (possibly cv-qualified) non-POD class type | |
2360 | (or array thereof), the object is default-initialized (8.5). | |
2361 | [...] | |
2362 | -- Otherwise, the object created has indeterminate | |
2363 | value. If T is a const-qualified type, or a (possibly | |
2364 | cv-qualified) POD class type (or array thereof) | |
2365 | containing (directly or indirectly) a member of | |
2366 | const-qualified type, the program is ill-formed; */ | |
2367 | ||
2368 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type)) | |
40bb78ad | 2369 | maybe_uninitialized_error = true; |
9d809e8f | 2370 | |
40bb78ad FC |
2371 | if (maybe_uninitialized_error |
2372 | && diagnose_uninitialized_cst_or_ref_member (elt_type, | |
2373 | /*using_new=*/true, | |
2374 | complain & tf_error)) | |
2375 | return error_mark_node; | |
9d809e8f FC |
2376 | } |
2377 | ||
c166b898 | 2378 | if (CP_TYPE_CONST_P (elt_type) && *init == NULL |
6132bdd7 | 2379 | && default_init_uninitialized_part (elt_type)) |
f4f4610e | 2380 | { |
5ade1ed2 DG |
2381 | if (complain & tf_error) |
2382 | error ("uninitialized const in %<new%> of %q#T", elt_type); | |
f4f4610e MM |
2383 | return error_mark_node; |
2384 | } | |
2385 | ||
d746e87d MM |
2386 | size = size_in_bytes (elt_type); |
2387 | if (array_p) | |
4a84253c FW |
2388 | { |
2389 | /* Maximum available size in bytes. Half of the address space | |
2390 | minus the cookie size. */ | |
2391 | double_int max_size | |
9be0ac8c LC |
2392 | = double_int_one.llshift (TYPE_PRECISION (sizetype) - 1, |
2393 | HOST_BITS_PER_DOUBLE_INT); | |
4a84253c FW |
2394 | /* Maximum number of outer elements which can be allocated. */ |
2395 | double_int max_outer_nelts; | |
2396 | tree max_outer_nelts_tree; | |
2397 | ||
2398 | gcc_assert (TREE_CODE (size) == INTEGER_CST); | |
2399 | cookie_size = targetm.cxx.get_cookie_size (elt_type); | |
2400 | gcc_assert (TREE_CODE (cookie_size) == INTEGER_CST); | |
9be0ac8c | 2401 | gcc_checking_assert (TREE_INT_CST (cookie_size).ult (max_size)); |
4a84253c FW |
2402 | /* Unconditionally substract the cookie size. This decreases the |
2403 | maximum object size and is safe even if we choose not to use | |
2404 | a cookie after all. */ | |
9be0ac8c LC |
2405 | max_size -= TREE_INT_CST (cookie_size); |
2406 | bool overflow; | |
2407 | inner_size = TREE_INT_CST (size) | |
2408 | .mul_with_sign (inner_nelts_count, false, &overflow); | |
2409 | if (overflow || inner_size.ugt (max_size)) | |
4a84253c FW |
2410 | { |
2411 | if (complain & tf_error) | |
2412 | error ("size of array is too large"); | |
2413 | return error_mark_node; | |
2414 | } | |
9be0ac8c | 2415 | max_outer_nelts = max_size.udiv (inner_size, TRUNC_DIV_EXPR); |
4a84253c FW |
2416 | /* Only keep the top-most seven bits, to simplify encoding the |
2417 | constant in the instruction stream. */ | |
2418 | { | |
2419 | unsigned shift = HOST_BITS_PER_DOUBLE_INT - 7 | |
2420 | - (max_outer_nelts.high ? clz_hwi (max_outer_nelts.high) | |
2421 | : (HOST_BITS_PER_WIDE_INT + clz_hwi (max_outer_nelts.low))); | |
2422 | max_outer_nelts | |
9be0ac8c LC |
2423 | = max_outer_nelts.lrshift (shift, HOST_BITS_PER_DOUBLE_INT) |
2424 | .llshift (shift, HOST_BITS_PER_DOUBLE_INT); | |
4a84253c FW |
2425 | } |
2426 | max_outer_nelts_tree = double_int_to_tree (sizetype, max_outer_nelts); | |
2427 | ||
2428 | size = size_binop (MULT_EXPR, size, convert (sizetype, nelts)); | |
2429 | outer_nelts_check = fold_build2 (LE_EXPR, boolean_type_node, | |
2430 | outer_nelts, | |
2431 | max_outer_nelts_tree); | |
2432 | } | |
a28e3c7f | 2433 | |
63c9a190 MM |
2434 | alloc_fn = NULL_TREE; |
2435 | ||
c166b898 ILT |
2436 | /* If PLACEMENT is a single simple pointer type not passed by |
2437 | reference, prepare to capture it in a temporary variable. Do | |
2438 | this now, since PLACEMENT will change in the calls below. */ | |
c166b898 | 2439 | placement_first = NULL_TREE; |
9771b263 | 2440 | if (vec_safe_length (*placement) == 1 |
50e10fa8 | 2441 | && (TYPE_PTR_P (TREE_TYPE ((**placement)[0])))) |
9771b263 | 2442 | placement_first = (**placement)[0]; |
c166b898 | 2443 | |
e92cc029 | 2444 | /* Allocate the object. */ |
9771b263 | 2445 | if (vec_safe_is_empty (*placement) && TYPE_FOR_JAVA (elt_type)) |
743f140d | 2446 | { |
63c9a190 | 2447 | tree class_addr; |
d746e87d | 2448 | tree class_decl = build_java_class_ref (elt_type); |
8b60264b | 2449 | static const char alloc_name[] = "_Jv_AllocObject"; |
6de9cd9a | 2450 | |
a3d536f1 VR |
2451 | if (class_decl == error_mark_node) |
2452 | return error_mark_node; | |
2453 | ||
743f140d | 2454 | use_java_new = 1; |
c8094d83 | 2455 | if (!get_global_value_if_present (get_identifier (alloc_name), |
63c9a190 | 2456 | &alloc_fn)) |
b1e5b86c | 2457 | { |
5ade1ed2 DG |
2458 | if (complain & tf_error) |
2459 | error ("call to Java constructor with %qs undefined", alloc_name); | |
6961a592 GB |
2460 | return error_mark_node; |
2461 | } | |
63c9a190 | 2462 | else if (really_overloaded_fn (alloc_fn)) |
b1e5b86c | 2463 | { |
5ade1ed2 DG |
2464 | if (complain & tf_error) |
2465 | error ("%qD should never be overloaded", alloc_fn); | |
6961a592 GB |
2466 | return error_mark_node; |
2467 | } | |
63c9a190 | 2468 | alloc_fn = OVL_CURRENT (alloc_fn); |
743f140d | 2469 | class_addr = build1 (ADDR_EXPR, jclass_node, class_decl); |
6998c7ed NF |
2470 | alloc_call = cp_build_function_call_nary (alloc_fn, complain, |
2471 | class_addr, NULL_TREE); | |
743f140d | 2472 | } |
9e1e64ec | 2473 | else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type)) |
360f866c JJ |
2474 | { |
2475 | error ("Java class %q#T object allocated using placement new", elt_type); | |
2476 | return error_mark_node; | |
2477 | } | |
8d08fdba MS |
2478 | else |
2479 | { | |
834c6dff | 2480 | tree fnname; |
9f880ef9 | 2481 | tree fns; |
834c6dff | 2482 | |
d746e87d | 2483 | fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR); |
834c6dff | 2484 | |
c8094d83 | 2485 | if (!globally_qualified_p |
d746e87d MM |
2486 | && CLASS_TYPE_P (elt_type) |
2487 | && (array_p | |
2488 | ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type) | |
2489 | : TYPE_HAS_NEW_OPERATOR (elt_type))) | |
089d6ea7 MM |
2490 | { |
2491 | /* Use a class-specific operator new. */ | |
2492 | /* If a cookie is required, add some extra space. */ | |
d746e87d | 2493 | if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type)) |
4a84253c FW |
2494 | size = size_binop (PLUS_EXPR, size, cookie_size); |
2495 | else | |
92d38f38 FW |
2496 | { |
2497 | cookie_size = NULL_TREE; | |
2498 | /* No size arithmetic necessary, so the size check is | |
2499 | not needed. */ | |
2500 | if (outer_nelts_check != NULL && inner_size.is_one ()) | |
2501 | outer_nelts_check = NULL_TREE; | |
2502 | } | |
4a84253c | 2503 | /* Perform the overflow check. */ |
7d5e76c8 JM |
2504 | tree errval = TYPE_MAX_VALUE (sizetype); |
2505 | if (cxx_dialect >= cxx11) | |
2506 | errval = throw_bad_array_new_length (); | |
4a84253c FW |
2507 | if (outer_nelts_check != NULL_TREE) |
2508 | size = fold_build3 (COND_EXPR, sizetype, outer_nelts_check, | |
7d5e76c8 | 2509 | size, errval); |
089d6ea7 | 2510 | /* Create the argument list. */ |
9771b263 | 2511 | vec_safe_insert (*placement, 0, size); |
9f880ef9 | 2512 | /* Do name-lookup to find the appropriate operator. */ |
d746e87d | 2513 | fns = lookup_fnfields (elt_type, fnname, /*protect=*/2); |
a85cb0d7 VR |
2514 | if (fns == NULL_TREE) |
2515 | { | |
5ade1ed2 DG |
2516 | if (complain & tf_error) |
2517 | error ("no suitable %qD found in class %qT", fnname, elt_type); | |
a85cb0d7 VR |
2518 | return error_mark_node; |
2519 | } | |
9f880ef9 MM |
2520 | if (TREE_CODE (fns) == TREE_LIST) |
2521 | { | |
5ade1ed2 DG |
2522 | if (complain & tf_error) |
2523 | { | |
2524 | error ("request for member %qD is ambiguous", fnname); | |
2525 | print_candidates (fns); | |
2526 | } | |
9f880ef9 MM |
2527 | return error_mark_node; |
2528 | } | |
d746e87d | 2529 | alloc_call = build_new_method_call (build_dummy_object (elt_type), |
c166b898 | 2530 | fns, placement, |
9f880ef9 | 2531 | /*conversion_path=*/NULL_TREE, |
63c9a190 | 2532 | LOOKUP_NORMAL, |
5ade1ed2 DG |
2533 | &alloc_fn, |
2534 | complain); | |
089d6ea7 | 2535 | } |
834c6dff | 2536 | else |
089d6ea7 MM |
2537 | { |
2538 | /* Use a global operator new. */ | |
125e6594 | 2539 | /* See if a cookie might be required. */ |
4a84253c | 2540 | if (!(array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type))) |
92d38f38 FW |
2541 | { |
2542 | cookie_size = NULL_TREE; | |
2543 | /* No size arithmetic necessary, so the size check is | |
2544 | not needed. */ | |
2545 | if (outer_nelts_check != NULL && inner_size.is_one ()) | |
2546 | outer_nelts_check = NULL_TREE; | |
2547 | } | |
125e6594 | 2548 | |
c8094d83 | 2549 | alloc_call = build_operator_new_call (fnname, placement, |
63c9a190 | 2550 | &size, &cookie_size, |
4a84253c | 2551 | outer_nelts_check, |
b40e334f | 2552 | &alloc_fn, complain); |
089d6ea7 | 2553 | } |
8d08fdba MS |
2554 | } |
2555 | ||
96790071 | 2556 | if (alloc_call == error_mark_node) |
2bb5d995 JM |
2557 | return error_mark_node; |
2558 | ||
63c9a190 MM |
2559 | gcc_assert (alloc_fn != NULL_TREE); |
2560 | ||
c166b898 ILT |
2561 | /* If we found a simple case of PLACEMENT_EXPR above, then copy it |
2562 | into a temporary variable. */ | |
a9de800a | 2563 | if (!processing_template_decl |
c166b898 | 2564 | && placement_first != NULL_TREE |
a9de800a JJ |
2565 | && TREE_CODE (alloc_call) == CALL_EXPR |
2566 | && call_expr_nargs (alloc_call) == 2 | |
2567 | && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE | |
50e10fa8 | 2568 | && TYPE_PTR_P (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1)))) |
a9de800a JJ |
2569 | { |
2570 | tree placement_arg = CALL_EXPR_ARG (alloc_call, 1); | |
2571 | ||
550a799d | 2572 | if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))) |
a9de800a JJ |
2573 | || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))) |
2574 | { | |
c166b898 | 2575 | placement_expr = get_target_expr (placement_first); |
a9de800a JJ |
2576 | CALL_EXPR_ARG (alloc_call, 1) |
2577 | = convert (TREE_TYPE (placement_arg), placement_expr); | |
2578 | } | |
2579 | } | |
2580 | ||
a6111661 JM |
2581 | /* In the simple case, we can stop now. */ |
2582 | pointer_type = build_pointer_type (type); | |
2583 | if (!cookie_size && !is_initialized) | |
4d7a65ea | 2584 | return build_nop (pointer_type, alloc_call); |
a6111661 | 2585 | |
10ee5386 JM |
2586 | /* Store the result of the allocation call in a variable so that we can |
2587 | use it more than once. */ | |
2588 | alloc_expr = get_target_expr (alloc_call); | |
a6111661 JM |
2589 | alloc_node = TARGET_EXPR_SLOT (alloc_expr); |
2590 | ||
2591 | /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */ | |
c8094d83 | 2592 | while (TREE_CODE (alloc_call) == COMPOUND_EXPR) |
a6111661 | 2593 | alloc_call = TREE_OPERAND (alloc_call, 1); |
089d6ea7 | 2594 | |
3f41ffd8 MM |
2595 | /* Now, check to see if this function is actually a placement |
2596 | allocation function. This can happen even when PLACEMENT is NULL | |
2597 | because we might have something like: | |
2598 | ||
2599 | struct S { void* operator new (size_t, int i = 0); }; | |
2600 | ||
2601 | A call to `new S' will get this allocation function, even though | |
2602 | there is no explicit placement argument. If there is more than | |
2603 | one argument, or there are variable arguments, then this is a | |
2604 | placement allocation function. */ | |
c8094d83 MS |
2605 | placement_allocation_fn_p |
2606 | = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1 | |
46ff5047 | 2607 | || varargs_function_p (alloc_fn)); |
96790071 | 2608 | |
a6111661 JM |
2609 | /* Preevaluate the placement args so that we don't reevaluate them for a |
2610 | placement delete. */ | |
2611 | if (placement_allocation_fn_p) | |
2612 | { | |
6de9cd9a DN |
2613 | tree inits; |
2614 | stabilize_call (alloc_call, &inits); | |
a6111661 | 2615 | if (inits) |
f293ce4b RS |
2616 | alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits, |
2617 | alloc_expr); | |
a6111661 JM |
2618 | } |
2619 | ||
047f64a3 JM |
2620 | /* unless an allocation function is declared with an empty excep- |
2621 | tion-specification (_except.spec_), throw(), it indicates failure to | |
2622 | allocate storage by throwing a bad_alloc exception (clause _except_, | |
2623 | _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo- | |
2624 | cation function is declared with an empty exception-specification, | |
2625 | throw(), it returns null to indicate failure to allocate storage and a | |
2626 | non-null pointer otherwise. | |
2627 | ||
2628 | So check for a null exception spec on the op new we just called. */ | |
2629 | ||
46ff5047 | 2630 | nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn)); |
743f140d | 2631 | check_new = (flag_check_new || nothrow) && ! use_java_new; |
047f64a3 | 2632 | |
089d6ea7 | 2633 | if (cookie_size) |
8d08fdba | 2634 | { |
96790071 | 2635 | tree cookie; |
46e995e0 | 2636 | tree cookie_ptr; |
b5119fa1 | 2637 | tree size_ptr_type; |
f4f4610e MM |
2638 | |
2639 | /* Adjust so we're pointing to the start of the object. */ | |
5d49b6a7 | 2640 | data_addr = fold_build_pointer_plus (alloc_node, cookie_size); |
96790071 | 2641 | |
834c6dff | 2642 | /* Store the number of bytes allocated so that we can know how |
3461fba7 NS |
2643 | many elements to destroy later. We use the last sizeof |
2644 | (size_t) bytes to store the number of elements. */ | |
10ee5386 | 2645 | cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype)); |
5d49b6a7 RG |
2646 | cookie_ptr = fold_build_pointer_plus_loc (input_location, |
2647 | alloc_node, cookie_ptr); | |
b5119fa1 | 2648 | size_ptr_type = build_pointer_type (sizetype); |
10ee5386 | 2649 | cookie_ptr = fold_convert (size_ptr_type, cookie_ptr); |
dd865ef6 | 2650 | cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); |
1f84ec23 | 2651 | |
f293ce4b | 2652 | cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts); |
46e995e0 PB |
2653 | |
2654 | if (targetm.cxx.cookie_has_size ()) | |
2655 | { | |
2656 | /* Also store the element size. */ | |
5d49b6a7 | 2657 | cookie_ptr = fold_build_pointer_plus (cookie_ptr, |
db3927fb | 2658 | fold_build1_loc (input_location, |
5d49b6a7 RG |
2659 | NEGATE_EXPR, sizetype, |
2660 | size_in_bytes (sizetype))); | |
b2ec1738 | 2661 | |
dd865ef6 | 2662 | cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); |
f293ce4b | 2663 | cookie = build2 (MODIFY_EXPR, sizetype, cookie, |
10ee5386 | 2664 | size_in_bytes (elt_type)); |
f293ce4b RS |
2665 | cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr), |
2666 | cookie, cookie_expr); | |
46e995e0 | 2667 | } |
8d08fdba | 2668 | } |
96790071 | 2669 | else |
8b5e2ce4 JM |
2670 | { |
2671 | cookie_expr = NULL_TREE; | |
2672 | data_addr = alloc_node; | |
2673 | } | |
8d08fdba | 2674 | |
10ee5386 | 2675 | /* Now use a pointer to the type we've actually allocated. */ |
25357d1e JM |
2676 | |
2677 | /* But we want to operate on a non-const version to start with, | |
2678 | since we'll be modifying the elements. */ | |
2679 | non_const_pointer_type = build_pointer_type | |
a3360e77 | 2680 | (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST)); |
25357d1e JM |
2681 | |
2682 | data_addr = fold_convert (non_const_pointer_type, data_addr); | |
9207099b | 2683 | /* Any further uses of alloc_node will want this type, too. */ |
25357d1e | 2684 | alloc_node = fold_convert (non_const_pointer_type, alloc_node); |
10ee5386 | 2685 | |
6de9cd9a DN |
2686 | /* Now initialize the allocated object. Note that we preevaluate the |
2687 | initialization expression, apart from the actual constructor call or | |
2688 | assignment--we do this because we want to delay the allocation as long | |
2689 | as possible in order to minimize the size of the exception region for | |
2690 | placement delete. */ | |
f4f4610e | 2691 | if (is_initialized) |
8d08fdba | 2692 | { |
6de9cd9a | 2693 | bool stable; |
844ae01d | 2694 | bool explicit_value_init_p = false; |
6de9cd9a | 2695 | |
9771b263 | 2696 | if (*init != NULL && (*init)->is_empty ()) |
6de9cd9a | 2697 | { |
c166b898 | 2698 | *init = NULL; |
844ae01d JM |
2699 | explicit_value_init_p = true; |
2700 | } | |
b84f4651 | 2701 | |
a67e7daa JM |
2702 | if (processing_template_decl && explicit_value_init_p) |
2703 | { | |
2704 | /* build_value_init doesn't work in templates, and we don't need | |
2705 | the initializer anyway since we're going to throw it away and | |
2706 | rebuild it at instantiation time, so just build up a single | |
2707 | constructor call to get any appropriate diagnostics. */ | |
2708 | init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain); | |
95552437 | 2709 | if (type_build_ctor_call (elt_type)) |
a67e7daa JM |
2710 | init_expr = build_special_member_call (init_expr, |
2711 | complete_ctor_identifier, | |
2712 | init, elt_type, | |
2713 | LOOKUP_NORMAL, | |
2714 | complain); | |
2715 | stable = stabilize_init (init_expr, &init_preeval_expr); | |
2716 | } | |
2717 | else if (array_p) | |
844ae01d | 2718 | { |
25357d1e | 2719 | tree vecinit = NULL_TREE; |
9771b263 DN |
2720 | if (vec_safe_length (*init) == 1 |
2721 | && BRACE_ENCLOSED_INITIALIZER_P ((**init)[0]) | |
2722 | && CONSTRUCTOR_IS_DIRECT_INIT ((**init)[0])) | |
25357d1e | 2723 | { |
9771b263 | 2724 | vecinit = (**init)[0]; |
1f65a8c8 JM |
2725 | if (CONSTRUCTOR_NELTS (vecinit) == 0) |
2726 | /* List-value-initialization, leave it alone. */; | |
25357d1e JM |
2727 | else |
2728 | { | |
1f65a8c8 JM |
2729 | tree arraytype, domain; |
2730 | if (TREE_CONSTANT (nelts)) | |
2731 | domain = compute_array_index_type (NULL_TREE, nelts, | |
2732 | complain); | |
2733 | else | |
7d5e76c8 JM |
2734 | /* We'll check the length at runtime. */ |
2735 | domain = NULL_TREE; | |
1f65a8c8 JM |
2736 | arraytype = build_cplus_array_type (type, domain); |
2737 | vecinit = digest_init (arraytype, vecinit, complain); | |
25357d1e | 2738 | } |
25357d1e JM |
2739 | } |
2740 | else if (*init) | |
5ade1ed2 DG |
2741 | { |
2742 | if (complain & tf_error) | |
1f65a8c8 JM |
2743 | permerror (input_location, |
2744 | "parenthesized initializer in array new"); | |
5ade1ed2 DG |
2745 | else |
2746 | return error_mark_node; | |
25357d1e | 2747 | vecinit = build_tree_list_vec (*init); |
5ade1ed2 | 2748 | } |
6de9cd9a | 2749 | init_expr |
b73a4704 JM |
2750 | = build_vec_init (data_addr, |
2751 | cp_build_binary_op (input_location, | |
2752 | MINUS_EXPR, outer_nelts, | |
2753 | integer_one_node, | |
2754 | complain), | |
2755 | vecinit, | |
2756 | explicit_value_init_p, | |
2757 | /*from_array=*/0, | |
2758 | complain); | |
6de9cd9a DN |
2759 | |
2760 | /* An array initialization is stable because the initialization | |
2761 | of each element is a full-expression, so the temporaries don't | |
2762 | leak out. */ | |
2763 | stable = true; | |
2764 | } | |
f30efcb7 | 2765 | else |
8d08fdba | 2766 | { |
dd865ef6 | 2767 | init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain); |
9207099b | 2768 | |
95552437 | 2769 | if (type_build_ctor_call (type) && !explicit_value_init_p) |
b84f4651 MM |
2770 | { |
2771 | init_expr = build_special_member_call (init_expr, | |
2772 | complete_ctor_identifier, | |
2773 | init, elt_type, | |
5ade1ed2 DG |
2774 | LOOKUP_NORMAL, |
2775 | complain); | |
844ae01d JM |
2776 | } |
2777 | else if (explicit_value_init_p) | |
2778 | { | |
a67e7daa JM |
2779 | /* Something like `new int()'. */ |
2780 | tree val = build_value_init (type, complain); | |
2781 | if (val == error_mark_node) | |
2782 | return error_mark_node; | |
2783 | init_expr = build2 (INIT_EXPR, type, init_expr, val); | |
b84f4651 | 2784 | } |
8dc2b103 | 2785 | else |
b84f4651 | 2786 | { |
c166b898 ILT |
2787 | tree ie; |
2788 | ||
b84f4651 MM |
2789 | /* We are processing something like `new int (10)', which |
2790 | means allocate an int, and initialize it with 10. */ | |
3db45ab5 | 2791 | |
e2e03032 PC |
2792 | ie = build_x_compound_expr_from_vec (*init, "new initializer", |
2793 | complain); | |
c166b898 | 2794 | init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie, |
5ade1ed2 | 2795 | complain); |
b84f4651 | 2796 | } |
844ae01d | 2797 | stable = stabilize_init (init_expr, &init_preeval_expr); |
96790071 JM |
2798 | } |
2799 | ||
2800 | if (init_expr == error_mark_node) | |
2801 | return error_mark_node; | |
1f109f0f | 2802 | |
20c39572 JM |
2803 | /* If any part of the object initialization terminates by throwing an |
2804 | exception and a suitable deallocation function can be found, the | |
2805 | deallocation function is called to free the memory in which the | |
2806 | object was being constructed, after which the exception continues | |
2807 | to propagate in the context of the new-expression. If no | |
2808 | unambiguous matching deallocation function can be found, | |
2809 | propagating the exception does not cause the object's memory to be | |
2810 | freed. */ | |
96790071 | 2811 | if (flag_exceptions && ! use_java_new) |
1f109f0f | 2812 | { |
d746e87d | 2813 | enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR; |
96790071 | 2814 | tree cleanup; |
a7d87521 | 2815 | |
5355deec | 2816 | /* The Standard is unclear here, but the right thing to do |
f4f4610e MM |
2817 | is to use the same method for finding deallocation |
2818 | functions that we use for finding allocation functions. */ | |
10ee5386 JM |
2819 | cleanup = (build_op_delete_call |
2820 | (dcode, | |
9207099b | 2821 | alloc_node, |
10ee5386 JM |
2822 | size, |
2823 | globally_qualified_p, | |
2824 | placement_allocation_fn_p ? alloc_call : NULL_TREE, | |
4b978f96 PC |
2825 | alloc_fn, |
2826 | complain)); | |
2bb14213 | 2827 | |
6de9cd9a DN |
2828 | if (!cleanup) |
2829 | /* We're done. */; | |
2830 | else if (stable) | |
2831 | /* This is much simpler if we were able to preevaluate all of | |
2832 | the arguments to the constructor call. */ | |
d665b6e5 MLI |
2833 | { |
2834 | /* CLEANUP is compiler-generated, so no diagnostics. */ | |
2835 | TREE_NO_WARNING (cleanup) = true; | |
2836 | init_expr = build2 (TRY_CATCH_EXPR, void_type_node, | |
2837 | init_expr, cleanup); | |
2838 | /* Likewise, this try-catch is compiler-generated. */ | |
2839 | TREE_NO_WARNING (init_expr) = true; | |
2840 | } | |
6de9cd9a DN |
2841 | else |
2842 | /* Ack! First we allocate the memory. Then we set our sentry | |
2843 | variable to true, and expand a cleanup that deletes the | |
2844 | memory if sentry is true. Then we run the constructor, and | |
2845 | finally clear the sentry. | |
2846 | ||
2847 | We need to do this because we allocate the space first, so | |
2848 | if there are any temporaries with cleanups in the | |
2849 | constructor args and we weren't able to preevaluate them, we | |
2850 | need this EH region to extend until end of full-expression | |
2851 | to preserve nesting. */ | |
da4768fe | 2852 | { |
96790071 | 2853 | tree end, sentry, begin; |
2face519 JM |
2854 | |
2855 | begin = get_target_expr (boolean_true_node); | |
659e5a7a | 2856 | CLEANUP_EH_ONLY (begin) = 1; |
2face519 | 2857 | |
659e5a7a JM |
2858 | sentry = TARGET_EXPR_SLOT (begin); |
2859 | ||
d665b6e5 MLI |
2860 | /* CLEANUP is compiler-generated, so no diagnostics. */ |
2861 | TREE_NO_WARNING (cleanup) = true; | |
2862 | ||
659e5a7a | 2863 | TARGET_EXPR_CLEANUP (begin) |
f293ce4b RS |
2864 | = build3 (COND_EXPR, void_type_node, sentry, |
2865 | cleanup, void_zero_node); | |
2face519 | 2866 | |
f293ce4b RS |
2867 | end = build2 (MODIFY_EXPR, TREE_TYPE (sentry), |
2868 | sentry, boolean_false_node); | |
2face519 | 2869 | |
96790071 | 2870 | init_expr |
f293ce4b RS |
2871 | = build2 (COMPOUND_EXPR, void_type_node, begin, |
2872 | build2 (COMPOUND_EXPR, void_type_node, init_expr, | |
2873 | end)); | |
d665b6e5 MLI |
2874 | /* Likewise, this is compiler-generated. */ |
2875 | TREE_NO_WARNING (init_expr) = true; | |
da4768fe | 2876 | } |
1f109f0f | 2877 | } |
f4f4610e | 2878 | } |
8b5e2ce4 JM |
2879 | else |
2880 | init_expr = NULL_TREE; | |
2881 | ||
2882 | /* Now build up the return value in reverse order. */ | |
96790071 | 2883 | |
8b5e2ce4 | 2884 | rval = data_addr; |
2face519 | 2885 | |
8b5e2ce4 | 2886 | if (init_expr) |
f293ce4b | 2887 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval); |
8b5e2ce4 | 2888 | if (cookie_expr) |
f293ce4b | 2889 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval); |
8b5e2ce4 | 2890 | |
10ee5386 | 2891 | if (rval == data_addr) |
8b5e2ce4 JM |
2892 | /* If we don't have an initializer or a cookie, strip the TARGET_EXPR |
2893 | and return the call (which doesn't need to be adjusted). */ | |
2894 | rval = TARGET_EXPR_INITIAL (alloc_expr); | |
2895 | else | |
d18c083e | 2896 | { |
8b5e2ce4 JM |
2897 | if (check_new) |
2898 | { | |
ba47d38d AH |
2899 | tree ifexp = cp_build_binary_op (input_location, |
2900 | NE_EXPR, alloc_node, | |
6d96d7ff | 2901 | nullptr_node, |
5ade1ed2 DG |
2902 | complain); |
2903 | rval = build_conditional_expr (ifexp, rval, alloc_node, | |
2904 | complain); | |
8b5e2ce4 | 2905 | } |
d18c083e | 2906 | |
8b5e2ce4 JM |
2907 | /* Perform the allocation before anything else, so that ALLOC_NODE |
2908 | has been initialized before we start using it. */ | |
f293ce4b | 2909 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval); |
8b5e2ce4 | 2910 | } |
51c184be | 2911 | |
6de9cd9a | 2912 | if (init_preeval_expr) |
f293ce4b | 2913 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval); |
6de9cd9a | 2914 | |
d04a575f | 2915 | /* A new-expression is never an lvalue. */ |
41990f96 | 2916 | gcc_assert (!lvalue_p (rval)); |
058dcc25 | 2917 | |
25357d1e | 2918 | return convert (pointer_type, rval); |
8d08fdba | 2919 | } |
63c9a190 | 2920 | |
c166b898 ILT |
2921 | /* Generate a representation for a C++ "new" expression. *PLACEMENT |
2922 | is a vector of placement-new arguments (or NULL if none). If NELTS | |
2923 | is NULL, TYPE is the type of the storage to be allocated. If NELTS | |
2924 | is not NULL, then this is an array-new allocation; TYPE is the type | |
2925 | of the elements in the array and NELTS is the number of elements in | |
2926 | the array. *INIT, if non-NULL, is the initializer for the new | |
2927 | object, or an empty vector to indicate an initializer of "()". If | |
2928 | USE_GLOBAL_NEW is true, then the user explicitly wrote "::new" | |
2929 | rather than just "new". This may change PLACEMENT and INIT. */ | |
63c9a190 MM |
2930 | |
2931 | tree | |
9771b263 DN |
2932 | build_new (vec<tree, va_gc> **placement, tree type, tree nelts, |
2933 | vec<tree, va_gc> **init, int use_global_new, tsubst_flags_t complain) | |
63c9a190 MM |
2934 | { |
2935 | tree rval; | |
9771b263 | 2936 | vec<tree, va_gc> *orig_placement = NULL; |
c166b898 | 2937 | tree orig_nelts = NULL_TREE; |
9771b263 | 2938 | vec<tree, va_gc> *orig_init = NULL; |
63c9a190 | 2939 | |
c166b898 | 2940 | if (type == error_mark_node) |
63c9a190 MM |
2941 | return error_mark_node; |
2942 | ||
9771b263 | 2943 | if (nelts == NULL_TREE && vec_safe_length (*init) == 1 |
c19267cb JM |
2944 | /* Don't do auto deduction where it might affect mangling. */ |
2945 | && (!processing_template_decl || at_function_scope_p ())) | |
86a09a9e JM |
2946 | { |
2947 | tree auto_node = type_uses_auto (type); | |
2e5748d2 JM |
2948 | if (auto_node) |
2949 | { | |
9771b263 | 2950 | tree d_init = (**init)[0]; |
2e5748d2 | 2951 | d_init = resolve_nondeduced_context (d_init); |
d84572a4 | 2952 | type = do_auto_deduction (type, d_init, auto_node); |
2e5748d2 | 2953 | } |
86a09a9e JM |
2954 | } |
2955 | ||
63c9a190 MM |
2956 | if (processing_template_decl) |
2957 | { | |
2958 | if (dependent_type_p (type) | |
c166b898 | 2959 | || any_type_dependent_arguments_p (*placement) |
63c9a190 | 2960 | || (nelts && type_dependent_expression_p (nelts)) |
879b0a1d | 2961 | || (nelts && *init) |
c166b898 ILT |
2962 | || any_type_dependent_arguments_p (*init)) |
2963 | return build_raw_new_expr (*placement, type, nelts, *init, | |
63c9a190 | 2964 | use_global_new); |
c166b898 ILT |
2965 | |
2966 | orig_placement = make_tree_vector_copy (*placement); | |
2967 | orig_nelts = nelts; | |
a4bbf910 PC |
2968 | if (*init) |
2969 | orig_init = make_tree_vector_copy (*init); | |
c166b898 ILT |
2970 | |
2971 | make_args_non_dependent (*placement); | |
63c9a190 MM |
2972 | if (nelts) |
2973 | nelts = build_non_dependent_expr (nelts); | |
c166b898 | 2974 | make_args_non_dependent (*init); |
63c9a190 MM |
2975 | } |
2976 | ||
2977 | if (nelts) | |
2978 | { | |
2979 | if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false)) | |
5ade1ed2 DG |
2980 | { |
2981 | if (complain & tf_error) | |
cbe5f3b3 | 2982 | permerror (input_location, "size in array new must have integral type"); |
5ade1ed2 DG |
2983 | else |
2984 | return error_mark_node; | |
2985 | } | |
03a904b5 | 2986 | nelts = mark_rvalue_use (nelts); |
4b978f96 | 2987 | nelts = cp_save_expr (cp_convert (sizetype, nelts, complain)); |
63c9a190 MM |
2988 | } |
2989 | ||
2990 | /* ``A reference cannot be created by the new operator. A reference | |
2991 | is not an object (8.2.2, 8.4.3), so a pointer to it could not be | |
2992 | returned by new.'' ARM 5.3.3 */ | |
2993 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
2994 | { | |
5ade1ed2 DG |
2995 | if (complain & tf_error) |
2996 | error ("new cannot be applied to a reference type"); | |
2997 | else | |
2998 | return error_mark_node; | |
63c9a190 MM |
2999 | type = TREE_TYPE (type); |
3000 | } | |
3001 | ||
3002 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
3003 | { | |
5ade1ed2 DG |
3004 | if (complain & tf_error) |
3005 | error ("new cannot be applied to a function type"); | |
63c9a190 MM |
3006 | return error_mark_node; |
3007 | } | |
3008 | ||
57ccb546 MM |
3009 | /* The type allocated must be complete. If the new-type-id was |
3010 | "T[N]" then we are just checking that "T" is complete here, but | |
3011 | that is equivalent, since the value of "N" doesn't matter. */ | |
309714d4 | 3012 | if (!complete_type_or_maybe_complain (type, NULL_TREE, complain)) |
39fb9d72 DB |
3013 | return error_mark_node; |
3014 | ||
5ade1ed2 | 3015 | rval = build_new_1 (placement, type, nelts, init, use_global_new, complain); |
63c9a190 MM |
3016 | if (rval == error_mark_node) |
3017 | return error_mark_node; | |
3018 | ||
3019 | if (processing_template_decl) | |
c166b898 ILT |
3020 | { |
3021 | tree ret = build_raw_new_expr (orig_placement, type, orig_nelts, | |
3022 | orig_init, use_global_new); | |
3023 | release_tree_vector (orig_placement); | |
3024 | release_tree_vector (orig_init); | |
3025 | return ret; | |
3026 | } | |
63c9a190 MM |
3027 | |
3028 | /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */ | |
3029 | rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval); | |
3030 | TREE_NO_WARNING (rval) = 1; | |
3031 | ||
3032 | return rval; | |
3033 | } | |
3034 | ||
3035 | /* Given a Java class, return a decl for the corresponding java.lang.Class. */ | |
3036 | ||
3037 | tree | |
3038 | build_java_class_ref (tree type) | |
3039 | { | |
3040 | tree name = NULL_TREE, class_decl; | |
3041 | static tree CL_suffix = NULL_TREE; | |
3042 | if (CL_suffix == NULL_TREE) | |
3043 | CL_suffix = get_identifier("class$"); | |
3044 | if (jclass_node == NULL_TREE) | |
3045 | { | |
3046 | jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass")); | |
3047 | if (jclass_node == NULL_TREE) | |
a3d536f1 VR |
3048 | { |
3049 | error ("call to Java constructor, while %<jclass%> undefined"); | |
3050 | return error_mark_node; | |
3051 | } | |
63c9a190 MM |
3052 | jclass_node = TREE_TYPE (jclass_node); |
3053 | } | |
3054 | ||
3055 | /* Mangle the class$ field. */ | |
3056 | { | |
3057 | tree field; | |
910ad8de | 3058 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
63c9a190 MM |
3059 | if (DECL_NAME (field) == CL_suffix) |
3060 | { | |
3061 | mangle_decl (field); | |
3062 | name = DECL_ASSEMBLER_NAME (field); | |
3063 | break; | |
3064 | } | |
3065 | if (!field) | |
a3d536f1 | 3066 | { |
d8a07487 | 3067 | error ("can%'t find %<class$%> in %qT", type); |
a3d536f1 VR |
3068 | return error_mark_node; |
3069 | } | |
3070 | } | |
63c9a190 MM |
3071 | |
3072 | class_decl = IDENTIFIER_GLOBAL_VALUE (name); | |
3073 | if (class_decl == NULL_TREE) | |
3074 | { | |
c2255bc4 AH |
3075 | class_decl = build_decl (input_location, |
3076 | VAR_DECL, name, TREE_TYPE (jclass_node)); | |
63c9a190 MM |
3077 | TREE_STATIC (class_decl) = 1; |
3078 | DECL_EXTERNAL (class_decl) = 1; | |
3079 | TREE_PUBLIC (class_decl) = 1; | |
3080 | DECL_ARTIFICIAL (class_decl) = 1; | |
3081 | DECL_IGNORED_P (class_decl) = 1; | |
3082 | pushdecl_top_level (class_decl); | |
3083 | make_decl_rtl (class_decl); | |
3084 | } | |
3085 | return class_decl; | |
3086 | } | |
8d08fdba | 3087 | \f |
f30432d7 | 3088 | static tree |
362efdc1 | 3089 | build_vec_delete_1 (tree base, tree maxindex, tree type, |
574cfaa4 JM |
3090 | special_function_kind auto_delete_vec, |
3091 | int use_global_delete, tsubst_flags_t complain) | |
f30432d7 MS |
3092 | { |
3093 | tree virtual_size; | |
e92cc029 | 3094 | tree ptype = build_pointer_type (type = complete_type (type)); |
f30432d7 MS |
3095 | tree size_exp = size_in_bytes (type); |
3096 | ||
3097 | /* Temporary variables used by the loop. */ | |
3098 | tree tbase, tbase_init; | |
3099 | ||
3100 | /* This is the body of the loop that implements the deletion of a | |
3101 | single element, and moves temp variables to next elements. */ | |
3102 | tree body; | |
3103 | ||
3104 | /* This is the LOOP_EXPR that governs the deletion of the elements. */ | |
c7b62f14 | 3105 | tree loop = 0; |
f30432d7 MS |
3106 | |
3107 | /* This is the thing that governs what to do after the loop has run. */ | |
3108 | tree deallocate_expr = 0; | |
3109 | ||
3110 | /* This is the BIND_EXPR which holds the outermost iterator of the | |
3111 | loop. It is convenient to set this variable up and test it before | |
3112 | executing any other code in the loop. | |
3113 | This is also the containing expression returned by this function. */ | |
3114 | tree controller = NULL_TREE; | |
5be014d5 | 3115 | tree tmp; |
f30432d7 | 3116 | |
b2153b98 | 3117 | /* We should only have 1-D arrays here. */ |
8dc2b103 | 3118 | gcc_assert (TREE_CODE (type) != ARRAY_TYPE); |
b2153b98 | 3119 | |
574cfaa4 JM |
3120 | if (base == error_mark_node || maxindex == error_mark_node) |
3121 | return error_mark_node; | |
3122 | ||
9e1e64ec | 3123 | if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) |
c7b62f14 | 3124 | goto no_destructor; |
f30432d7 | 3125 | |
708cae97 | 3126 | /* The below is short by the cookie size. */ |
fed3cef0 RK |
3127 | virtual_size = size_binop (MULT_EXPR, size_exp, |
3128 | convert (sizetype, maxindex)); | |
f30432d7 | 3129 | |
46e8c075 | 3130 | tbase = create_temporary_var (ptype); |
5d49b6a7 RG |
3131 | tbase_init |
3132 | = cp_build_modify_expr (tbase, NOP_EXPR, | |
3133 | fold_build_pointer_plus_loc (input_location, | |
3134 | fold_convert (ptype, | |
3135 | base), | |
3136 | virtual_size), | |
3137 | complain); | |
574cfaa4 JM |
3138 | if (tbase_init == error_mark_node) |
3139 | return error_mark_node; | |
f293ce4b RS |
3140 | controller = build3 (BIND_EXPR, void_type_node, tbase, |
3141 | NULL_TREE, NULL_TREE); | |
f30432d7 | 3142 | TREE_SIDE_EFFECTS (controller) = 1; |
f30432d7 | 3143 | |
f293ce4b | 3144 | body = build1 (EXIT_EXPR, void_type_node, |
5cd88d68 RS |
3145 | build2 (EQ_EXPR, boolean_type_node, tbase, |
3146 | fold_convert (ptype, base))); | |
db3927fb | 3147 | tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp); |
5d49b6a7 | 3148 | tmp = fold_build_pointer_plus (tbase, tmp); |
574cfaa4 JM |
3149 | tmp = cp_build_modify_expr (tbase, NOP_EXPR, tmp, complain); |
3150 | if (tmp == error_mark_node) | |
3151 | return error_mark_node; | |
3152 | body = build_compound_expr (input_location, body, tmp); | |
3153 | tmp = build_delete (ptype, tbase, sfk_complete_destructor, | |
3154 | LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1, | |
3155 | complain); | |
3156 | if (tmp == error_mark_node) | |
3157 | return error_mark_node; | |
3158 | body = build_compound_expr (input_location, body, tmp); | |
f30432d7 | 3159 | |
f293ce4b | 3160 | loop = build1 (LOOP_EXPR, void_type_node, body); |
c2255bc4 | 3161 | loop = build_compound_expr (input_location, tbase_init, loop); |
f30432d7 MS |
3162 | |
3163 | no_destructor: | |
e79a6b40 JM |
3164 | /* Delete the storage if appropriate. */ |
3165 | if (auto_delete_vec == sfk_deleting_destructor) | |
f30432d7 MS |
3166 | { |
3167 | tree base_tbd; | |
3168 | ||
708cae97 | 3169 | /* The below is short by the cookie size. */ |
fed3cef0 RK |
3170 | virtual_size = size_binop (MULT_EXPR, size_exp, |
3171 | convert (sizetype, maxindex)); | |
f30432d7 MS |
3172 | |
3173 | if (! TYPE_VEC_NEW_USES_COOKIE (type)) | |
3174 | /* no header */ | |
3175 | base_tbd = base; | |
3176 | else | |
3177 | { | |
834c6dff MM |
3178 | tree cookie_size; |
3179 | ||
46e995e0 | 3180 | cookie_size = targetm.cxx.get_cookie_size (type); |
574cfaa4 JM |
3181 | base_tbd = cp_build_binary_op (input_location, |
3182 | MINUS_EXPR, | |
3183 | cp_convert (string_type_node, | |
4b978f96 | 3184 | base, complain), |
574cfaa4 JM |
3185 | cookie_size, |
3186 | complain); | |
3187 | if (base_tbd == error_mark_node) | |
3188 | return error_mark_node; | |
4b978f96 | 3189 | base_tbd = cp_convert (ptype, base_tbd, complain); |
e92cc029 | 3190 | /* True size with header. */ |
834c6dff | 3191 | virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size); |
f30432d7 | 3192 | } |
86f45d2c | 3193 | |
e79a6b40 JM |
3194 | deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR, |
3195 | base_tbd, virtual_size, | |
3196 | use_global_delete & 1, | |
3197 | /*placement=*/NULL_TREE, | |
4b978f96 PC |
3198 | /*alloc_fn=*/NULL_TREE, |
3199 | complain); | |
f30432d7 MS |
3200 | } |
3201 | ||
c7b62f14 NS |
3202 | body = loop; |
3203 | if (!deallocate_expr) | |
3204 | ; | |
3205 | else if (!body) | |
3206 | body = deallocate_expr; | |
f30432d7 | 3207 | else |
c2255bc4 | 3208 | body = build_compound_expr (input_location, body, deallocate_expr); |
c8094d83 | 3209 | |
c7b62f14 NS |
3210 | if (!body) |
3211 | body = integer_zero_node; | |
c8094d83 | 3212 | |
f30432d7 | 3213 | /* Outermost wrapper: If pointer is null, punt. */ |
db3927fb AH |
3214 | body = fold_build3_loc (input_location, COND_EXPR, void_type_node, |
3215 | fold_build2_loc (input_location, | |
3216 | NE_EXPR, boolean_type_node, base, | |
7866705a | 3217 | convert (TREE_TYPE (base), |
6d96d7ff | 3218 | nullptr_node)), |
7866705a | 3219 | body, integer_zero_node); |
f30432d7 MS |
3220 | body = build1 (NOP_EXPR, void_type_node, body); |
3221 | ||
3222 | if (controller) | |
3223 | { | |
3224 | TREE_OPERAND (controller, 1) = body; | |
4e8dca1c | 3225 | body = controller; |
f30432d7 | 3226 | } |
4e8dca1c JM |
3227 | |
3228 | if (TREE_CODE (base) == SAVE_EXPR) | |
3229 | /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */ | |
f293ce4b | 3230 | body = build2 (COMPOUND_EXPR, void_type_node, base, body); |
4e8dca1c | 3231 | |
574cfaa4 | 3232 | return convert_to_void (body, ICV_CAST, complain); |
f30432d7 MS |
3233 | } |
3234 | ||
c8094d83 | 3235 | /* Create an unnamed variable of the indicated TYPE. */ |
c395453c | 3236 | |
f1dedc31 | 3237 | tree |
362efdc1 | 3238 | create_temporary_var (tree type) |
8a72a046 | 3239 | { |
f1dedc31 | 3240 | tree decl; |
c8094d83 | 3241 | |
c2255bc4 AH |
3242 | decl = build_decl (input_location, |
3243 | VAR_DECL, NULL_TREE, type); | |
f1dedc31 MM |
3244 | TREE_USED (decl) = 1; |
3245 | DECL_ARTIFICIAL (decl) = 1; | |
f1dedc31 | 3246 | DECL_IGNORED_P (decl) = 1; |
b35d4555 | 3247 | DECL_CONTEXT (decl) = current_function_decl; |
f1dedc31 | 3248 | |
f1dedc31 | 3249 | return decl; |
8a72a046 MM |
3250 | } |
3251 | ||
f1dedc31 MM |
3252 | /* Create a new temporary variable of the indicated TYPE, initialized |
3253 | to INIT. | |
8a72a046 | 3254 | |
f1dedc31 MM |
3255 | It is not entered into current_binding_level, because that breaks |
3256 | things when it comes time to do final cleanups (which take place | |
3257 | "outside" the binding contour of the function). */ | |
3258 | ||
fe5b5c36 | 3259 | tree |
362efdc1 | 3260 | get_temp_regvar (tree type, tree init) |
f30432d7 | 3261 | { |
f1dedc31 | 3262 | tree decl; |
8a72a046 | 3263 | |
f1dedc31 | 3264 | decl = create_temporary_var (type); |
350fae66 | 3265 | add_decl_expr (decl); |
c8094d83 | 3266 | |
5ade1ed2 DG |
3267 | finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, |
3268 | tf_warning_or_error)); | |
8a72a046 | 3269 | |
f1dedc31 | 3270 | return decl; |
f30432d7 MS |
3271 | } |
3272 | ||
f1dedc31 MM |
3273 | /* `build_vec_init' returns tree structure that performs |
3274 | initialization of a vector of aggregate types. | |
8d08fdba | 3275 | |
9207099b JM |
3276 | BASE is a reference to the vector, of ARRAY_TYPE, or a pointer |
3277 | to the first element, of POINTER_TYPE. | |
a48cccea | 3278 | MAXINDEX is the maximum index of the array (one less than the |
9207099b | 3279 | number of elements). It is only used if BASE is a pointer or |
a48cccea | 3280 | TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE. |
b84f4651 | 3281 | |
8d08fdba MS |
3282 | INIT is the (possibly NULL) initializer. |
3283 | ||
844ae01d JM |
3284 | If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All |
3285 | elements in the array are value-initialized. | |
b84f4651 | 3286 | |
8d08fdba MS |
3287 | FROM_ARRAY is 0 if we should init everything with INIT |
3288 | (i.e., every element initialized from INIT). | |
3289 | FROM_ARRAY is 1 if we should index into INIT in parallel | |
3290 | with initialization of DECL. | |
3291 | FROM_ARRAY is 2 if we should index into INIT in parallel, | |
3292 | but use assignment instead of initialization. */ | |
3293 | ||
3294 | tree | |
3db45ab5 | 3295 | build_vec_init (tree base, tree maxindex, tree init, |
844ae01d | 3296 | bool explicit_value_init_p, |
5ade1ed2 | 3297 | int from_array, tsubst_flags_t complain) |
8d08fdba MS |
3298 | { |
3299 | tree rval; | |
8a72a046 | 3300 | tree base2 = NULL_TREE; |
e833cb11 | 3301 | tree itype = NULL_TREE; |
8a72a046 | 3302 | tree iterator; |
9207099b | 3303 | /* The type of BASE. */ |
f30efcb7 | 3304 | tree atype = TREE_TYPE (base); |
f1dedc31 | 3305 | /* The type of an element in the array. */ |
f30efcb7 | 3306 | tree type = TREE_TYPE (atype); |
c8094d83 | 3307 | /* The element type reached after removing all outer array |
b5af3133 MM |
3308 | types. */ |
3309 | tree inner_elt_type; | |
f1dedc31 MM |
3310 | /* The type of a pointer to an element in the array. */ |
3311 | tree ptype; | |
3312 | tree stmt_expr; | |
3313 | tree compound_stmt; | |
3314 | int destroy_temps; | |
f5984164 | 3315 | tree try_block = NULL_TREE; |
8a72a046 | 3316 | int num_initialized_elts = 0; |
2a3398e1 | 3317 | bool is_global; |
fa2200cb JM |
3318 | tree const_init = NULL_TREE; |
3319 | tree obase = base; | |
f91352dc | 3320 | bool xvalue = false; |
574cfaa4 | 3321 | bool errors = false; |
7d5e76c8 | 3322 | tree length_check = NULL_TREE; |
c8094d83 | 3323 | |
9207099b | 3324 | if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype)) |
a48cccea JM |
3325 | maxindex = array_type_nelts (atype); |
3326 | ||
ddffee68 | 3327 | if (maxindex == NULL_TREE || maxindex == error_mark_node) |
8d08fdba MS |
3328 | return error_mark_node; |
3329 | ||
844ae01d | 3330 | if (explicit_value_init_p) |
b84f4651 MM |
3331 | gcc_assert (!init); |
3332 | ||
9207099b | 3333 | inner_elt_type = strip_array_types (type); |
567ef749 JM |
3334 | |
3335 | /* Look through the TARGET_EXPR around a compound literal. */ | |
3336 | if (init && TREE_CODE (init) == TARGET_EXPR | |
5a4d8044 JM |
3337 | && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR |
3338 | && from_array != 2) | |
567ef749 JM |
3339 | init = TARGET_EXPR_INITIAL (init); |
3340 | ||
7d5e76c8 JM |
3341 | /* If we have a braced-init-list, make sure that the array |
3342 | is big enough for all the initializers. */ | |
3343 | if (init && TREE_CODE (init) == CONSTRUCTOR | |
3344 | && CONSTRUCTOR_NELTS (init) > 0 | |
3345 | && !TREE_CONSTANT (maxindex)) | |
3346 | length_check = fold_build2 (LT_EXPR, boolean_type_node, maxindex, | |
3347 | size_int (CONSTRUCTOR_NELTS (init) - 1)); | |
3348 | ||
c8a3d889 | 3349 | if (init |
25357d1e | 3350 | && TREE_CODE (atype) == ARRAY_TYPE |
c8a3d889 | 3351 | && (from_array == 2 |
c8094d83 | 3352 | ? (!CLASS_TYPE_P (inner_elt_type) |
066ec0a4 | 3353 | || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type)) |
c8a3d889 | 3354 | : !TYPE_NEEDS_CONSTRUCTING (type)) |
f30efcb7 JM |
3355 | && ((TREE_CODE (init) == CONSTRUCTOR |
3356 | /* Don't do this if the CONSTRUCTOR might contain something | |
3357 | that might throw and require us to clean up. */ | |
9771b263 | 3358 | && (vec_safe_is_empty (CONSTRUCTOR_ELTS (init)) |
b5af3133 | 3359 | || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type))) |
f30efcb7 JM |
3360 | || from_array)) |
3361 | { | |
c32097d8 | 3362 | /* Do non-default initialization of trivial arrays resulting from |
f30efcb7 JM |
3363 | brace-enclosed initializers. In this case, digest_init and |
3364 | store_constructor will handle the semantics for us. */ | |
3365 | ||
f293ce4b | 3366 | stmt_expr = build2 (INIT_EXPR, atype, base, init); |
0138d6b2 JM |
3367 | if (length_check) |
3368 | stmt_expr = build3 (COND_EXPR, atype, length_check, | |
3369 | throw_bad_array_length (), | |
3370 | stmt_expr); | |
f30efcb7 JM |
3371 | return stmt_expr; |
3372 | } | |
3373 | ||
4b978f96 | 3374 | maxindex = cp_convert (ptrdiff_type_node, maxindex, complain); |
9207099b JM |
3375 | if (TREE_CODE (atype) == ARRAY_TYPE) |
3376 | { | |
3377 | ptype = build_pointer_type (type); | |
89fcabaf PC |
3378 | base = decay_conversion (base, complain); |
3379 | if (base == error_mark_node) | |
3380 | return error_mark_node; | |
4b978f96 | 3381 | base = cp_convert (ptype, base, complain); |
9207099b JM |
3382 | } |
3383 | else | |
3384 | ptype = atype; | |
8d08fdba | 3385 | |
f1dedc31 | 3386 | /* The code we are generating looks like: |
303b7406 | 3387 | ({ |
f1dedc31 | 3388 | T* t1 = (T*) base; |
f30efcb7 | 3389 | T* rval = t1; |
f1dedc31 MM |
3390 | ptrdiff_t iterator = maxindex; |
3391 | try { | |
4977bab6 | 3392 | for (; iterator != -1; --iterator) { |
f30efcb7 JM |
3393 | ... initialize *t1 ... |
3394 | ++t1; | |
4977bab6 | 3395 | } |
f1dedc31 | 3396 | } catch (...) { |
0cbd7506 | 3397 | ... destroy elements that were constructed ... |
f1dedc31 | 3398 | } |
303b7406 NS |
3399 | rval; |
3400 | }) | |
c8094d83 | 3401 | |
f1dedc31 MM |
3402 | We can omit the try and catch blocks if we know that the |
3403 | initialization will never throw an exception, or if the array | |
f30efcb7 | 3404 | elements do not have destructors. We can omit the loop completely if |
c8094d83 | 3405 | the elements of the array do not have constructors. |
f1dedc31 MM |
3406 | |
3407 | We actually wrap the entire body of the above in a STMT_EXPR, for | |
c8094d83 | 3408 | tidiness. |
f1dedc31 MM |
3409 | |
3410 | When copying from array to another, when the array elements have | |
3411 | only trivial copy constructors, we should use __builtin_memcpy | |
3412 | rather than generating a loop. That way, we could take advantage | |
3b426391 | 3413 | of whatever cleverness the back end has for dealing with copies |
f1dedc31 MM |
3414 | of blocks of memory. */ |
3415 | ||
2a3398e1 | 3416 | is_global = begin_init_stmts (&stmt_expr, &compound_stmt); |
f2c5f623 | 3417 | destroy_temps = stmts_are_full_exprs_p (); |
ae499cce | 3418 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
f30efcb7 | 3419 | rval = get_temp_regvar (ptype, base); |
f1dedc31 | 3420 | base = get_temp_regvar (ptype, rval); |
8a72a046 | 3421 | iterator = get_temp_regvar (ptrdiff_type_node, maxindex); |
8d08fdba | 3422 | |
5a4d8044 JM |
3423 | /* If initializing one array from another, initialize element by |
3424 | element. We rely upon the below calls to do the argument | |
3425 | checking. Evaluate the initializer before entering the try block. */ | |
3426 | if (from_array && init && TREE_CODE (init) != CONSTRUCTOR) | |
3427 | { | |
f91352dc JM |
3428 | if (lvalue_kind (init) & clk_rvalueref) |
3429 | xvalue = true; | |
89fcabaf PC |
3430 | base2 = decay_conversion (init, complain); |
3431 | if (base2 == error_mark_node) | |
3432 | return error_mark_node; | |
5a4d8044 JM |
3433 | itype = TREE_TYPE (base2); |
3434 | base2 = get_temp_regvar (itype, base2); | |
3435 | itype = TREE_TYPE (itype); | |
3436 | } | |
3437 | ||
8a72a046 | 3438 | /* Protect the entire array initialization so that we can destroy |
f30efcb7 JM |
3439 | the partially constructed array if an exception is thrown. |
3440 | But don't do this if we're assigning. */ | |
3441 | if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
3442 | && from_array != 2) | |
ed5511d9 MM |
3443 | { |
3444 | try_block = begin_try_block (); | |
ed5511d9 | 3445 | } |
8a72a046 | 3446 | |
1f65a8c8 JM |
3447 | /* If the initializer is {}, then all elements are initialized from {}. |
3448 | But for non-classes, that's the same as value-initialization. */ | |
3449 | if (init && BRACE_ENCLOSED_INITIALIZER_P (init) | |
3450 | && CONSTRUCTOR_NELTS (init) == 0) | |
3451 | { | |
3452 | if (CLASS_TYPE_P (type)) | |
3453 | /* Leave init alone. */; | |
3454 | else | |
3455 | { | |
3456 | init = NULL_TREE; | |
3457 | explicit_value_init_p = true; | |
3458 | } | |
3459 | } | |
3460 | ||
fa2200cb JM |
3461 | /* Maybe pull out constant value when from_array? */ |
3462 | ||
1f65a8c8 | 3463 | else if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR) |
8d08fdba | 3464 | { |
c32097d8 | 3465 | /* Do non-default initialization of non-trivial arrays resulting from |
f30efcb7 | 3466 | brace-enclosed initializers. */ |
4038c495 | 3467 | unsigned HOST_WIDE_INT idx; |
fa2200cb JM |
3468 | tree field, elt; |
3469 | /* Should we try to create a constant initializer? */ | |
fe7eb484 JM |
3470 | bool try_const = (TREE_CODE (atype) == ARRAY_TYPE |
3471 | && (literal_type_p (inner_elt_type) | |
3472 | || TYPE_HAS_CONSTEXPR_CTOR (inner_elt_type))); | |
b25dd954 JM |
3473 | /* If the constructor already has the array type, it's been through |
3474 | digest_init, so we shouldn't try to do anything more. */ | |
3475 | bool digested = same_type_p (atype, TREE_TYPE (init)); | |
fa2200cb JM |
3476 | bool saw_non_const = false; |
3477 | bool saw_const = false; | |
3478 | /* If we're initializing a static array, we want to do static | |
3479 | initialization of any elements with constant initializers even if | |
3480 | some are non-constant. */ | |
3481 | bool do_static_init = (DECL_P (obase) && TREE_STATIC (obase)); | |
9771b263 | 3482 | vec<constructor_elt, va_gc> *new_vec; |
094fe153 JM |
3483 | from_array = 0; |
3484 | ||
7d5e76c8 JM |
3485 | if (length_check) |
3486 | { | |
3487 | tree throw_call; | |
0138d6b2 JM |
3488 | if (array_of_runtime_bound_p (atype)) |
3489 | throw_call = throw_bad_array_length (); | |
3490 | else | |
7d5e76c8 JM |
3491 | throw_call = throw_bad_array_new_length (); |
3492 | length_check = build3 (COND_EXPR, void_type_node, length_check, | |
3493 | throw_call, void_zero_node); | |
3494 | finish_expr_stmt (length_check); | |
3495 | } | |
3496 | ||
fa2200cb | 3497 | if (try_const) |
9771b263 | 3498 | vec_alloc (new_vec, CONSTRUCTOR_NELTS (init)); |
fa2200cb JM |
3499 | else |
3500 | new_vec = NULL; | |
3501 | ||
3502 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx, field, elt) | |
8d08fdba | 3503 | { |
f1dedc31 | 3504 | tree baseref = build1 (INDIRECT_REF, type, base); |
fa2200cb | 3505 | tree one_init; |
8d08fdba | 3506 | |
8a72a046 | 3507 | num_initialized_elts++; |
8d08fdba | 3508 | |
67c03833 | 3509 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
b25dd954 JM |
3510 | if (digested) |
3511 | one_init = build2 (INIT_EXPR, type, baseref, elt); | |
3512 | else if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE) | |
fa2200cb | 3513 | one_init = build_aggr_init (baseref, elt, 0, complain); |
8a72a046 | 3514 | else |
fa2200cb JM |
3515 | one_init = cp_build_modify_expr (baseref, NOP_EXPR, |
3516 | elt, complain); | |
574cfaa4 JM |
3517 | if (one_init == error_mark_node) |
3518 | errors = true; | |
fa2200cb JM |
3519 | if (try_const) |
3520 | { | |
3521 | tree e = one_init; | |
3522 | if (TREE_CODE (e) == EXPR_STMT) | |
3523 | e = TREE_OPERAND (e, 0); | |
3524 | if (TREE_CODE (e) == CONVERT_EXPR | |
3525 | && VOID_TYPE_P (TREE_TYPE (e))) | |
3526 | e = TREE_OPERAND (e, 0); | |
3527 | e = maybe_constant_init (e); | |
3528 | if (reduced_constant_expression_p (e)) | |
3529 | { | |
3530 | CONSTRUCTOR_APPEND_ELT (new_vec, field, e); | |
3531 | if (do_static_init) | |
3532 | one_init = NULL_TREE; | |
3533 | else | |
3534 | one_init = build2 (INIT_EXPR, type, baseref, e); | |
3535 | saw_const = true; | |
3536 | } | |
3537 | else | |
3538 | { | |
3539 | if (do_static_init) | |
f11c7048 JJ |
3540 | { |
3541 | tree value = build_zero_init (TREE_TYPE (e), NULL_TREE, | |
3542 | true); | |
3543 | if (value) | |
3544 | CONSTRUCTOR_APPEND_ELT (new_vec, field, value); | |
3545 | } | |
fa2200cb JM |
3546 | saw_non_const = true; |
3547 | } | |
3548 | } | |
3549 | ||
3550 | if (one_init) | |
3551 | finish_expr_stmt (one_init); | |
67c03833 | 3552 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; |
8a72a046 | 3553 | |
574cfaa4 JM |
3554 | one_init = cp_build_unary_op (PREINCREMENT_EXPR, base, 0, complain); |
3555 | if (one_init == error_mark_node) | |
3556 | errors = true; | |
3557 | else | |
3558 | finish_expr_stmt (one_init); | |
3559 | ||
3560 | one_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, | |
3561 | complain); | |
3562 | if (one_init == error_mark_node) | |
3563 | errors = true; | |
3564 | else | |
3565 | finish_expr_stmt (one_init); | |
8d08fdba | 3566 | } |
8d08fdba | 3567 | |
fa2200cb JM |
3568 | if (try_const) |
3569 | { | |
3570 | if (!saw_non_const) | |
3571 | const_init = build_constructor (atype, new_vec); | |
3572 | else if (do_static_init && saw_const) | |
3573 | DECL_INITIAL (obase) = build_constructor (atype, new_vec); | |
3574 | else | |
9771b263 | 3575 | vec_free (new_vec); |
fa2200cb JM |
3576 | } |
3577 | ||
8a72a046 MM |
3578 | /* Clear out INIT so that we don't get confused below. */ |
3579 | init = NULL_TREE; | |
8d08fdba | 3580 | } |
8a72a046 | 3581 | else if (from_array) |
8d08fdba | 3582 | { |
8a72a046 | 3583 | if (init) |
5a4d8044 | 3584 | /* OK, we set base2 above. */; |
95552437 | 3585 | else if (CLASS_TYPE_P (type) |
8a72a046 MM |
3586 | && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type)) |
3587 | { | |
5ade1ed2 DG |
3588 | if (complain & tf_error) |
3589 | error ("initializer ends prematurely"); | |
574cfaa4 | 3590 | errors = true; |
8a72a046 MM |
3591 | } |
3592 | } | |
8d08fdba | 3593 | |
8a72a046 MM |
3594 | /* Now, default-initialize any remaining elements. We don't need to |
3595 | do that if a) the type does not need constructing, or b) we've | |
094fe153 JM |
3596 | already initialized all the elements. |
3597 | ||
3598 | We do need to keep going if we're copying an array. */ | |
3599 | ||
3600 | if (from_array | |
1f65a8c8 | 3601 | || ((type_build_ctor_call (type) || init || explicit_value_init_p) |
665f2503 | 3602 | && ! (host_integerp (maxindex, 0) |
05bccae2 | 3603 | && (num_initialized_elts |
665f2503 | 3604 | == tree_low_cst (maxindex, 0) + 1)))) |
8a72a046 | 3605 | { |
37e05cd5 | 3606 | /* If the ITERATOR is equal to -1, then we don't have to loop; |
8a72a046 | 3607 | we've already initialized all the elements. */ |
4977bab6 | 3608 | tree for_stmt; |
f1dedc31 | 3609 | tree elt_init; |
b84f4651 | 3610 | tree to; |
f1dedc31 | 3611 | |
3f43ac31 | 3612 | for_stmt = begin_for_stmt (NULL_TREE, NULL_TREE); |
4977bab6 | 3613 | finish_for_init_stmt (for_stmt); |
aab384ae RG |
3614 | finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator, |
3615 | build_int_cst (TREE_TYPE (iterator), -1)), | |
4977bab6 | 3616 | for_stmt); |
574cfaa4 JM |
3617 | elt_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, |
3618 | complain); | |
3619 | if (elt_init == error_mark_node) | |
3620 | errors = true; | |
3621 | finish_for_expr (elt_init, for_stmt); | |
8d08fdba | 3622 | |
b84f4651 MM |
3623 | to = build1 (INDIRECT_REF, type, base); |
3624 | ||
8d08fdba MS |
3625 | if (from_array) |
3626 | { | |
8d08fdba MS |
3627 | tree from; |
3628 | ||
3629 | if (base2) | |
f91352dc JM |
3630 | { |
3631 | from = build1 (INDIRECT_REF, itype, base2); | |
3632 | if (xvalue) | |
3633 | from = move (from); | |
3634 | } | |
8d08fdba MS |
3635 | else |
3636 | from = NULL_TREE; | |
3637 | ||
3638 | if (from_array == 2) | |
5ade1ed2 DG |
3639 | elt_init = cp_build_modify_expr (to, NOP_EXPR, from, |
3640 | complain); | |
95552437 | 3641 | else if (type_build_ctor_call (type)) |
5ade1ed2 | 3642 | elt_init = build_aggr_init (to, from, 0, complain); |
8d08fdba | 3643 | else if (from) |
5ade1ed2 DG |
3644 | elt_init = cp_build_modify_expr (to, NOP_EXPR, from, |
3645 | complain); | |
8d08fdba | 3646 | else |
8dc2b103 | 3647 | gcc_unreachable (); |
8d08fdba MS |
3648 | } |
3649 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
3650 | { | |
3651 | if (init != 0) | |
f30efcb7 JM |
3652 | sorry |
3653 | ("cannot initialize multi-dimensional array with initializer"); | |
3654 | elt_init = build_vec_init (build1 (INDIRECT_REF, type, base), | |
3db45ab5 | 3655 | 0, 0, |
844ae01d | 3656 | explicit_value_init_p, |
5ade1ed2 | 3657 | 0, complain); |
f1dedc31 | 3658 | } |
844ae01d | 3659 | else if (explicit_value_init_p) |
309714d4 JM |
3660 | { |
3661 | elt_init = build_value_init (type, complain); | |
574cfaa4 | 3662 | if (elt_init != error_mark_node) |
309714d4 JM |
3663 | elt_init = build2 (INIT_EXPR, type, to, elt_init); |
3664 | } | |
f1dedc31 | 3665 | else |
844ae01d | 3666 | { |
1f65a8c8 JM |
3667 | gcc_assert (type_build_ctor_call (type) || init); |
3668 | if (CLASS_TYPE_P (type)) | |
3669 | elt_init = build_aggr_init (to, init, 0, complain); | |
3670 | else | |
3671 | { | |
3672 | if (TREE_CODE (init) == TREE_LIST) | |
3673 | init = build_x_compound_expr_from_list (init, ELK_INIT, | |
3674 | complain); | |
3675 | elt_init = build2 (INIT_EXPR, type, to, init); | |
3676 | } | |
844ae01d | 3677 | } |
c8094d83 | 3678 | |
574cfaa4 JM |
3679 | if (elt_init == error_mark_node) |
3680 | errors = true; | |
3681 | ||
2a3398e1 NS |
3682 | current_stmt_tree ()->stmts_are_full_exprs_p = 1; |
3683 | finish_expr_stmt (elt_init); | |
3684 | current_stmt_tree ()->stmts_are_full_exprs_p = 0; | |
8d08fdba | 3685 | |
5ade1ed2 DG |
3686 | finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0, |
3687 | complain)); | |
8d08fdba | 3688 | if (base2) |
5ade1ed2 DG |
3689 | finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0, |
3690 | complain)); | |
0fac6b0b | 3691 | |
4977bab6 | 3692 | finish_for_stmt (for_stmt); |
8d08fdba | 3693 | } |
8a72a046 MM |
3694 | |
3695 | /* Make sure to cleanup any partially constructed elements. */ | |
f30efcb7 JM |
3696 | if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) |
3697 | && from_array != 2) | |
f1dedc31 MM |
3698 | { |
3699 | tree e; | |
ba47d38d AH |
3700 | tree m = cp_build_binary_op (input_location, |
3701 | MINUS_EXPR, maxindex, iterator, | |
5ade1ed2 | 3702 | complain); |
b2153b98 KL |
3703 | |
3704 | /* Flatten multi-dimensional array since build_vec_delete only | |
3705 | expects one-dimensional array. */ | |
3706 | if (TREE_CODE (type) == ARRAY_TYPE) | |
ba47d38d AH |
3707 | m = cp_build_binary_op (input_location, |
3708 | MULT_EXPR, m, | |
99c4346a JM |
3709 | /* Avoid mixing signed and unsigned. */ |
3710 | convert (TREE_TYPE (m), | |
3711 | array_type_nelts_total (type)), | |
5ade1ed2 | 3712 | complain); |
8d08fdba | 3713 | |
ed5511d9 | 3714 | finish_cleanup_try_block (try_block); |
c8094d83 | 3715 | e = build_vec_delete_1 (rval, m, |
e79a6b40 | 3716 | inner_elt_type, sfk_complete_destructor, |
574cfaa4 JM |
3717 | /*use_global_delete=*/0, complain); |
3718 | if (e == error_mark_node) | |
3719 | errors = true; | |
f1dedc31 MM |
3720 | finish_cleanup (e, try_block); |
3721 | } | |
3722 | ||
303b7406 NS |
3723 | /* The value of the array initialization is the array itself, RVAL |
3724 | is a pointer to the first element. */ | |
325c3691 | 3725 | finish_stmt_expr_expr (rval, stmt_expr); |
f1dedc31 | 3726 | |
2a3398e1 | 3727 | stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); |
303b7406 | 3728 | |
9207099b JM |
3729 | /* Now make the result have the correct type. */ |
3730 | if (TREE_CODE (atype) == ARRAY_TYPE) | |
3731 | { | |
3732 | atype = build_pointer_type (atype); | |
3733 | stmt_expr = build1 (NOP_EXPR, atype, stmt_expr); | |
dd865ef6 | 3734 | stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain); |
311fa510 | 3735 | TREE_NO_WARNING (stmt_expr) = 1; |
9207099b | 3736 | } |
c8094d83 | 3737 | |
ae499cce | 3738 | current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; |
fa2200cb JM |
3739 | |
3740 | if (const_init) | |
3741 | return build2 (INIT_EXPR, atype, obase, const_init); | |
574cfaa4 JM |
3742 | if (errors) |
3743 | return error_mark_node; | |
f1dedc31 | 3744 | return stmt_expr; |
8d08fdba MS |
3745 | } |
3746 | ||
86f45d2c MM |
3747 | /* Call the DTOR_KIND destructor for EXP. FLAGS are as for |
3748 | build_delete. */ | |
298d6f60 MM |
3749 | |
3750 | static tree | |
574cfaa4 JM |
3751 | build_dtor_call (tree exp, special_function_kind dtor_kind, int flags, |
3752 | tsubst_flags_t complain) | |
298d6f60 | 3753 | { |
86f45d2c | 3754 | tree name; |
ee76b931 | 3755 | tree fn; |
86f45d2c MM |
3756 | switch (dtor_kind) |
3757 | { | |
3758 | case sfk_complete_destructor: | |
3759 | name = complete_dtor_identifier; | |
3760 | break; | |
3761 | ||
3762 | case sfk_base_destructor: | |
3763 | name = base_dtor_identifier; | |
3764 | break; | |
3765 | ||
3766 | case sfk_deleting_destructor: | |
3767 | name = deleting_dtor_identifier; | |
3768 | break; | |
3769 | ||
3770 | default: | |
8dc2b103 | 3771 | gcc_unreachable (); |
86f45d2c | 3772 | } |
ee76b931 | 3773 | fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2); |
c8094d83 | 3774 | return build_new_method_call (exp, fn, |
c166b898 | 3775 | /*args=*/NULL, |
ee76b931 | 3776 | /*conversion_path=*/NULL_TREE, |
63c9a190 | 3777 | flags, |
5ade1ed2 | 3778 | /*fn_p=*/NULL, |
574cfaa4 | 3779 | complain); |
298d6f60 MM |
3780 | } |
3781 | ||
8d08fdba MS |
3782 | /* Generate a call to a destructor. TYPE is the type to cast ADDR to. |
3783 | ADDR is an expression which yields the store to be destroyed. | |
86f45d2c MM |
3784 | AUTO_DELETE is the name of the destructor to call, i.e., either |
3785 | sfk_complete_destructor, sfk_base_destructor, or | |
3786 | sfk_deleting_destructor. | |
8d08fdba MS |
3787 | |
3788 | FLAGS is the logical disjunction of zero or more LOOKUP_ | |
ade3dc07 | 3789 | flags. See cp-tree.h for more info. */ |
e92cc029 | 3790 | |
8d08fdba | 3791 | tree |
362efdc1 | 3792 | build_delete (tree type, tree addr, special_function_kind auto_delete, |
574cfaa4 | 3793 | int flags, int use_global_delete, tsubst_flags_t complain) |
8d08fdba | 3794 | { |
8d08fdba | 3795 | tree expr; |
8d08fdba MS |
3796 | |
3797 | if (addr == error_mark_node) | |
3798 | return error_mark_node; | |
3799 | ||
3800 | /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type | |
3801 | set to `error_mark_node' before it gets properly cleaned up. */ | |
3802 | if (type == error_mark_node) | |
3803 | return error_mark_node; | |
3804 | ||
3805 | type = TYPE_MAIN_VARIANT (type); | |
3806 | ||
03a904b5 JJ |
3807 | addr = mark_rvalue_use (addr); |
3808 | ||
50e10fa8 | 3809 | if (TYPE_PTR_P (type)) |
8d08fdba | 3810 | { |
b1e5b86c GB |
3811 | bool complete_p = true; |
3812 | ||
2986ae00 | 3813 | type = TYPE_MAIN_VARIANT (TREE_TYPE (type)); |
8d08fdba MS |
3814 | if (TREE_CODE (type) == ARRAY_TYPE) |
3815 | goto handle_array; | |
23b4deba | 3816 | |
b1e5b86c GB |
3817 | /* We don't want to warn about delete of void*, only other |
3818 | incomplete types. Deleting other incomplete types | |
3819 | invokes undefined behavior, but it is not ill-formed, so | |
3820 | compile to something that would even do The Right Thing | |
3821 | (TM) should the type have a trivial dtor and no delete | |
3822 | operator. */ | |
3823 | if (!VOID_TYPE_P (type)) | |
8d08fdba | 3824 | { |
b1e5b86c GB |
3825 | complete_type (type); |
3826 | if (!COMPLETE_TYPE_P (type)) | |
3827 | { | |
574cfaa4 JM |
3828 | if ((complain & tf_warning) |
3829 | && warning (0, "possible problem detected in invocation of " | |
3830 | "delete operator:")) | |
71205d17 MLI |
3831 | { |
3832 | cxx_incomplete_type_diagnostic (addr, type, DK_WARNING); | |
1f5b3869 | 3833 | inform (input_location, "neither the destructor nor the class-specific " |
71205d17 | 3834 | "operator delete will be called, even if they are " |
d8a07487 | 3835 | "declared when the class is defined"); |
71205d17 | 3836 | } |
b1e5b86c GB |
3837 | complete_p = false; |
3838 | } | |
e2ab8a0f JW |
3839 | else if (auto_delete == sfk_deleting_destructor && warn_delnonvdtor |
3840 | && MAYBE_CLASS_TYPE_P (type) && !CLASSTYPE_FINAL (type) | |
3841 | && TYPE_POLYMORPHIC_P (type)) | |
014ab419 JW |
3842 | { |
3843 | tree dtor; | |
3844 | dtor = CLASSTYPE_DESTRUCTORS (type); | |
3845 | if (!dtor || !DECL_VINDEX (dtor)) | |
3846 | { | |
3847 | if (CLASSTYPE_PURE_VIRTUALS (type)) | |
3848 | warning (OPT_Wdelete_non_virtual_dtor, | |
3849 | "deleting object of abstract class type %qT" | |
3850 | " which has non-virtual destructor" | |
3851 | " will cause undefined behaviour", type); | |
3852 | else | |
3853 | warning (OPT_Wdelete_non_virtual_dtor, | |
3854 | "deleting object of polymorphic class type %qT" | |
3855 | " which has non-virtual destructor" | |
3856 | " might cause undefined behaviour", type); | |
3857 | } | |
3858 | } | |
8d08fdba | 3859 | } |
9e1e64ec | 3860 | if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type)) |
b1e5b86c GB |
3861 | /* Call the builtin operator delete. */ |
3862 | return build_builtin_delete_call (addr); | |
8d08fdba MS |
3863 | if (TREE_SIDE_EFFECTS (addr)) |
3864 | addr = save_expr (addr); | |
2986ae00 | 3865 | |
f4f206f4 | 3866 | /* Throw away const and volatile on target type of addr. */ |
4b978f96 | 3867 | addr = convert_force (build_pointer_type (type), addr, 0, complain); |
8d08fdba MS |
3868 | } |
3869 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
3870 | { | |
3871 | handle_array: | |
c8094d83 | 3872 | |
c407792d RK |
3873 | if (TYPE_DOMAIN (type) == NULL_TREE) |
3874 | { | |
574cfaa4 JM |
3875 | if (complain & tf_error) |
3876 | error ("unknown array size in delete"); | |
c407792d RK |
3877 | return error_mark_node; |
3878 | } | |
8d08fdba | 3879 | return build_vec_delete (addr, array_type_nelts (type), |
574cfaa4 | 3880 | auto_delete, use_global_delete, complain); |
8d08fdba MS |
3881 | } |
3882 | else | |
3883 | { | |
3884 | /* Don't check PROTECT here; leave that decision to the | |
3885 | destructor. If the destructor is accessible, call it, | |
3886 | else report error. */ | |
574cfaa4 JM |
3887 | addr = cp_build_addr_expr (addr, complain); |
3888 | if (addr == error_mark_node) | |
3889 | return error_mark_node; | |
8d08fdba MS |
3890 | if (TREE_SIDE_EFFECTS (addr)) |
3891 | addr = save_expr (addr); | |
3892 | ||
4b978f96 | 3893 | addr = convert_force (build_pointer_type (type), addr, 0, complain); |
8d08fdba MS |
3894 | } |
3895 | ||
9e1e64ec | 3896 | gcc_assert (MAYBE_CLASS_TYPE_P (type)); |
8d08fdba | 3897 | |
834c6dff | 3898 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) |
8d08fdba | 3899 | { |
60696c53 | 3900 | if (auto_delete != sfk_deleting_destructor) |
8d08fdba MS |
3901 | return void_zero_node; |
3902 | ||
3db45ab5 MS |
3903 | return build_op_delete_call (DELETE_EXPR, addr, |
3904 | cxx_sizeof_nowarn (type), | |
63c9a190 MM |
3905 | use_global_delete, |
3906 | /*placement=*/NULL_TREE, | |
4b978f96 PC |
3907 | /*alloc_fn=*/NULL_TREE, |
3908 | complain); | |
8d08fdba | 3909 | } |
ade3dc07 | 3910 | else |
8d08fdba | 3911 | { |
6f06d231 | 3912 | tree head = NULL_TREE; |
700f8a87 | 3913 | tree do_delete = NULL_TREE; |
bd6dd845 | 3914 | tree ifexp; |
700f8a87 | 3915 | |
9f4faeae MM |
3916 | if (CLASSTYPE_LAZY_DESTRUCTOR (type)) |
3917 | lazily_declare_fn (sfk_destructor, type); | |
ade3dc07 | 3918 | |
52682a1b MM |
3919 | /* For `::delete x', we must not use the deleting destructor |
3920 | since then we would not be sure to get the global `operator | |
3921 | delete'. */ | |
86f45d2c | 3922 | if (use_global_delete && auto_delete == sfk_deleting_destructor) |
700f8a87 | 3923 | { |
1b4a93f7 MM |
3924 | /* We will use ADDR multiple times so we must save it. */ |
3925 | addr = save_expr (addr); | |
6f06d231 | 3926 | head = get_target_expr (build_headof (addr)); |
c6002625 | 3927 | /* Delete the object. */ |
6f06d231 | 3928 | do_delete = build_builtin_delete_call (head); |
86f45d2c MM |
3929 | /* Otherwise, treat this like a complete object destructor |
3930 | call. */ | |
3931 | auto_delete = sfk_complete_destructor; | |
700f8a87 | 3932 | } |
52682a1b MM |
3933 | /* If the destructor is non-virtual, there is no deleting |
3934 | variant. Instead, we must explicitly call the appropriate | |
3935 | `operator delete' here. */ | |
3936 | else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type)) | |
3937 | && auto_delete == sfk_deleting_destructor) | |
3938 | { | |
1b4a93f7 MM |
3939 | /* We will use ADDR multiple times so we must save it. */ |
3940 | addr = save_expr (addr); | |
3941 | /* Build the call. */ | |
52682a1b MM |
3942 | do_delete = build_op_delete_call (DELETE_EXPR, |
3943 | addr, | |
ea793912 | 3944 | cxx_sizeof_nowarn (type), |
5bd61841 | 3945 | /*global_p=*/false, |
63c9a190 | 3946 | /*placement=*/NULL_TREE, |
4b978f96 PC |
3947 | /*alloc_fn=*/NULL_TREE, |
3948 | complain); | |
52682a1b MM |
3949 | /* Call the complete object destructor. */ |
3950 | auto_delete = sfk_complete_destructor; | |
3951 | } | |
e3fe84e5 JM |
3952 | else if (auto_delete == sfk_deleting_destructor |
3953 | && TYPE_GETS_REG_DELETE (type)) | |
3954 | { | |
3955 | /* Make sure we have access to the member op delete, even though | |
3956 | we'll actually be calling it from the destructor. */ | |
ea793912 | 3957 | build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), |
3db45ab5 | 3958 | /*global_p=*/false, |
63c9a190 | 3959 | /*placement=*/NULL_TREE, |
4b978f96 PC |
3960 | /*alloc_fn=*/NULL_TREE, |
3961 | complain); | |
e3fe84e5 | 3962 | } |
8d08fdba | 3963 | |
574cfaa4 JM |
3964 | expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL, complain), |
3965 | auto_delete, flags, complain); | |
3966 | if (expr == error_mark_node) | |
3967 | return error_mark_node; | |
bd6dd845 | 3968 | if (do_delete) |
f293ce4b | 3969 | expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete); |
9e9ff709 | 3970 | |
6f06d231 JM |
3971 | /* We need to calculate this before the dtor changes the vptr. */ |
3972 | if (head) | |
3973 | expr = build2 (COMPOUND_EXPR, void_type_node, head, expr); | |
3974 | ||
bd6dd845 MS |
3975 | if (flags & LOOKUP_DESTRUCTOR) |
3976 | /* Explicit destructor call; don't check for null pointer. */ | |
3977 | ifexp = integer_one_node; | |
8d08fdba | 3978 | else |
574cfaa4 JM |
3979 | { |
3980 | /* Handle deleting a null pointer. */ | |
3981 | ifexp = fold (cp_build_binary_op (input_location, | |
6d96d7ff | 3982 | NE_EXPR, addr, nullptr_node, |
574cfaa4 JM |
3983 | complain)); |
3984 | if (ifexp == error_mark_node) | |
3985 | return error_mark_node; | |
3986 | } | |
8d08fdba | 3987 | |
bd6dd845 | 3988 | if (ifexp != integer_one_node) |
f293ce4b RS |
3989 | expr = build3 (COND_EXPR, void_type_node, |
3990 | ifexp, expr, void_zero_node); | |
8d08fdba | 3991 | |
8d08fdba MS |
3992 | return expr; |
3993 | } | |
ade3dc07 | 3994 | } |
8d08fdba | 3995 | |
ade3dc07 JM |
3996 | /* At the beginning of a destructor, push cleanups that will call the |
3997 | destructors for our base classes and members. | |
2a2480e1 | 3998 | |
a29e1034 | 3999 | Called from begin_destructor_body. */ |
8d08fdba | 4000 | |
ade3dc07 | 4001 | void |
edaf3e03 | 4002 | push_base_cleanups (void) |
ade3dc07 | 4003 | { |
fa743e8c NS |
4004 | tree binfo, base_binfo; |
4005 | int i; | |
ade3dc07 JM |
4006 | tree member; |
4007 | tree expr; | |
9771b263 | 4008 | vec<tree, va_gc> *vbases; |
8d08fdba | 4009 | |
ade3dc07 | 4010 | /* Run destructors for all virtual baseclasses. */ |
5775a06a | 4011 | if (CLASSTYPE_VBASECLASSES (current_class_type)) |
ade3dc07 | 4012 | { |
ade3dc07 | 4013 | tree cond = (condition_conversion |
f293ce4b RS |
4014 | (build2 (BIT_AND_EXPR, integer_type_node, |
4015 | current_in_charge_parm, | |
4016 | integer_two_node))); | |
8d08fdba | 4017 | |
58c42dc2 | 4018 | /* The CLASSTYPE_VBASECLASSES vector is in initialization |
ade3dc07 | 4019 | order, which is also the right order for pushing cleanups. */ |
9ba5ff0f | 4020 | for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0; |
9771b263 | 4021 | vec_safe_iterate (vbases, i, &base_binfo); i++) |
8d08fdba | 4022 | { |
9ba5ff0f | 4023 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))) |
8d08fdba | 4024 | { |
c8094d83 | 4025 | expr = build_special_member_call (current_class_ref, |
4ba126e4 | 4026 | base_dtor_identifier, |
c166b898 | 4027 | NULL, |
9ba5ff0f | 4028 | base_binfo, |
c8094d83 | 4029 | (LOOKUP_NORMAL |
5ade1ed2 DG |
4030 | | LOOKUP_NONVIRTUAL), |
4031 | tf_warning_or_error); | |
f293ce4b RS |
4032 | expr = build3 (COND_EXPR, void_type_node, cond, |
4033 | expr, void_zero_node); | |
ade3dc07 | 4034 | finish_decl_cleanup (NULL_TREE, expr); |
8d08fdba MS |
4035 | } |
4036 | } | |
ade3dc07 JM |
4037 | } |
4038 | ||
ade3dc07 | 4039 | /* Take care of the remaining baseclasses. */ |
fa743e8c NS |
4040 | for (binfo = TYPE_BINFO (current_class_type), i = 0; |
4041 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
ade3dc07 | 4042 | { |
ade3dc07 | 4043 | if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)) |
809e3e7f | 4044 | || BINFO_VIRTUAL_P (base_binfo)) |
ade3dc07 JM |
4045 | continue; |
4046 | ||
c8094d83 | 4047 | expr = build_special_member_call (current_class_ref, |
4ba126e4 | 4048 | base_dtor_identifier, |
c166b898 | 4049 | NULL, base_binfo, |
5ade1ed2 DG |
4050 | LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, |
4051 | tf_warning_or_error); | |
ade3dc07 JM |
4052 | finish_decl_cleanup (NULL_TREE, expr); |
4053 | } | |
4054 | ||
57ece258 JM |
4055 | /* Don't automatically destroy union members. */ |
4056 | if (TREE_CODE (current_class_type) == UNION_TYPE) | |
4057 | return; | |
4058 | ||
ade3dc07 | 4059 | for (member = TYPE_FIELDS (current_class_type); member; |
910ad8de | 4060 | member = DECL_CHAIN (member)) |
ade3dc07 | 4061 | { |
57ece258 JM |
4062 | tree this_type = TREE_TYPE (member); |
4063 | if (this_type == error_mark_node | |
2e5d2970 VR |
4064 | || TREE_CODE (member) != FIELD_DECL |
4065 | || DECL_ARTIFICIAL (member)) | |
ade3dc07 | 4066 | continue; |
57ece258 JM |
4067 | if (ANON_UNION_TYPE_P (this_type)) |
4068 | continue; | |
4069 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type)) | |
ade3dc07 | 4070 | { |
c8094d83 MS |
4071 | tree this_member = (build_class_member_access_expr |
4072 | (current_class_ref, member, | |
50ad9642 | 4073 | /*access_path=*/NULL_TREE, |
5ade1ed2 DG |
4074 | /*preserve_reference=*/false, |
4075 | tf_warning_or_error)); | |
ade3dc07 JM |
4076 | expr = build_delete (this_type, this_member, |
4077 | sfk_complete_destructor, | |
4078 | LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, | |
574cfaa4 | 4079 | 0, tf_warning_or_error); |
ade3dc07 JM |
4080 | finish_decl_cleanup (NULL_TREE, expr); |
4081 | } | |
8d08fdba MS |
4082 | } |
4083 | } | |
4084 | ||
8d08fdba MS |
4085 | /* Build a C++ vector delete expression. |
4086 | MAXINDEX is the number of elements to be deleted. | |
4087 | ELT_SIZE is the nominal size of each element in the vector. | |
4088 | BASE is the expression that should yield the store to be deleted. | |
8d08fdba MS |
4089 | This function expands (or synthesizes) these calls itself. |
4090 | AUTO_DELETE_VEC says whether the container (vector) should be deallocated. | |
8d08fdba MS |
4091 | |
4092 | This also calls delete for virtual baseclasses of elements of the vector. | |
4093 | ||
4094 | Update: MAXINDEX is no longer needed. The size can be extracted from the | |
4095 | start of the vector for pointers, and from the type for arrays. We still | |
4096 | use MAXINDEX for arrays because it happens to already have one of the | |
4097 | values we'd have to extract. (We could use MAXINDEX with pointers to | |
4098 | confirm the size, and trap if the numbers differ; not clear that it'd | |
4099 | be worth bothering.) */ | |
e92cc029 | 4100 | |
8d08fdba | 4101 | tree |
362efdc1 | 4102 | build_vec_delete (tree base, tree maxindex, |
574cfaa4 JM |
4103 | special_function_kind auto_delete_vec, |
4104 | int use_global_delete, tsubst_flags_t complain) | |
8d08fdba | 4105 | { |
f30432d7 | 4106 | tree type; |
49b7aacb JM |
4107 | tree rval; |
4108 | tree base_init = NULL_TREE; | |
8d08fdba | 4109 | |
f30432d7 | 4110 | type = TREE_TYPE (base); |
c407792d | 4111 | |
50e10fa8 | 4112 | if (TYPE_PTR_P (type)) |
8d08fdba MS |
4113 | { |
4114 | /* Step back one from start of vector, and read dimension. */ | |
834c6dff | 4115 | tree cookie_addr; |
726a989a | 4116 | tree size_ptr_type = build_pointer_type (sizetype); |
834c6dff | 4117 | |
6742d92b | 4118 | if (TREE_SIDE_EFFECTS (base)) |
49b7aacb JM |
4119 | { |
4120 | base_init = get_target_expr (base); | |
4121 | base = TARGET_EXPR_SLOT (base_init); | |
4122 | } | |
708cae97 | 4123 | type = strip_array_types (TREE_TYPE (type)); |
db3927fb AH |
4124 | cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR, |
4125 | sizetype, TYPE_SIZE_UNIT (sizetype)); | |
5d49b6a7 RG |
4126 | cookie_addr = fold_build_pointer_plus (fold_convert (size_ptr_type, base), |
4127 | cookie_addr); | |
574cfaa4 | 4128 | maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, complain); |
8d08fdba | 4129 | } |
f30432d7 | 4130 | else if (TREE_CODE (type) == ARRAY_TYPE) |
8d08fdba | 4131 | { |
f4f206f4 KH |
4132 | /* Get the total number of things in the array, maxindex is a |
4133 | bad name. */ | |
f30432d7 | 4134 | maxindex = array_type_nelts_total (type); |
834c6dff | 4135 | type = strip_array_types (type); |
574cfaa4 JM |
4136 | base = cp_build_addr_expr (base, complain); |
4137 | if (base == error_mark_node) | |
4138 | return error_mark_node; | |
6742d92b | 4139 | if (TREE_SIDE_EFFECTS (base)) |
49b7aacb JM |
4140 | { |
4141 | base_init = get_target_expr (base); | |
4142 | base = TARGET_EXPR_SLOT (base_init); | |
4143 | } | |
8d08fdba MS |
4144 | } |
4145 | else | |
4146 | { | |
574cfaa4 | 4147 | if (base != error_mark_node && !(complain & tf_error)) |
8251199e | 4148 | error ("type to vector delete is neither pointer or array type"); |
8d08fdba MS |
4149 | return error_mark_node; |
4150 | } | |
8d08fdba | 4151 | |
49b7aacb | 4152 | rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec, |
574cfaa4 JM |
4153 | use_global_delete, complain); |
4154 | if (base_init && rval != error_mark_node) | |
f293ce4b | 4155 | rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval); |
49b7aacb JM |
4156 | |
4157 | return rval; | |
8d08fdba | 4158 | } |