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