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