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