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