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