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