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