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