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