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