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