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