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