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