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