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