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