1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
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)
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.
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
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
22 /* High-level class interface. */
33 /* In C++, structures with well-defined constructors are initialized by
34 those constructors, unasked. CURRENT_BASE_INIT_LIST
35 holds a list of stmts for a BASE_INIT term in the grammar.
36 This list has one element for each base class which must be
37 initialized. The list elements are [basename, init], with
38 type basetype. This allows the possibly anachronistic form
39 (assuming d : a, b, c) "d (int a) : c(a+5), b (a-4), a (a+3)"
40 where each successive term can be handed down the constructor
41 line. Perhaps this was not intended. */
42 tree current_base_init_list, current_member_init_list;
44 void emit_base_init ();
45 void check_base_init ();
46 static void expand_aggr_vbase_init ();
47 void expand_member_init ();
48 void expand_aggr_init ();
50 static void expand_aggr_init_1 ();
51 static void expand_recursive_init_1 ();
52 static void expand_recursive_init ();
53 static void expand_virtual_init PROTO((tree, tree));
54 tree expand_vec_init ();
56 static void add_friend (), add_friends ();
58 /* Cache _builtin_new and _builtin_delete exprs. */
59 static tree BIN, BID, BIVN, BIVD;
61 /* Cache the identifier nodes for the two magic field of a new cookie. */
62 static tree nc_nelts_field_id;
64 static tree nc_ptr_2comp_field_id;
67 static tree minus_one;
69 /* Set up local variable for this file. MUST BE CALLED AFTER
70 INIT_DECL_PROCESSING. */
72 tree BI_header_type, BI_header_size;
74 void init_init_processing ()
78 /* Define implicit `operator new' and `operator delete' functions. */
79 BIN = default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname[(int) NEW_EXPR])));
80 TREE_USED (TREE_OPERAND (BIN, 0)) = 0;
81 BID = default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname[(int) DELETE_EXPR])));
82 TREE_USED (TREE_OPERAND (BID, 0)) = 0;
83 BIVN = default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname[(int) VEC_NEW_EXPR])));
84 TREE_USED (TREE_OPERAND (BIVN, 0)) = 0;
85 BIVD = default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname[(int) VEC_DELETE_EXPR])));
86 TREE_USED (TREE_OPERAND (BIVD, 0)) = 0;
87 minus_one = build_int_2 (-1, -1);
89 /* Define the structure that holds header information for
90 arrays allocated via operator new. */
91 BI_header_type = make_lang_type (RECORD_TYPE);
92 nc_nelts_field_id = get_identifier ("nelts");
93 fields[0] = build_lang_field_decl (FIELD_DECL, nc_nelts_field_id, sizetype);
94 finish_builtin_type (BI_header_type, "__new_cookie", fields,
96 BI_header_size = size_in_bytes (BI_header_type);
99 /* Subroutine of emit_base_init. For BINFO, initialize all the
100 virtual function table pointers, except those that come from
101 virtual base classes. Initialize binfo's vtable pointer, if
102 INIT_SELF is true. CAN_ELIDE is true when we know that all virtual
103 function table pointers in all bases have been initialized already,
104 probably because their constructors have just be run. ADDR is the
105 pointer to the object whos vtables we are going to initialize.
107 REAL_BINFO is usually the same as BINFO, except when addr is not of
108 pointer to the type of the real derived type that we want to
109 initialize for. This is the case when addr is a pointer to a sub
110 object of a complete object, and we only want to do part of the
111 complete object's initiailzation of vtable pointers. This is done
112 for all virtual table pointers in virtual base classes. REAL_BINFO
113 is used to find the BINFO_VTABLE that we initialize with. BINFO is
114 used for conversions of addr to subobjects.
116 BINFO_TYPE (real_binfo) must be BINFO_TYPE (binfo).
118 Relies upon binfo being inside TYPE_BINFO (TREE_TYPE (TREE_TYPE
121 expand_direct_vtbls_init (real_binfo, binfo, init_self, can_elide, addr)
122 tree real_binfo, binfo, addr;
123 int init_self, can_elide;
125 tree real_binfos = BINFO_BASETYPES (real_binfo);
126 tree binfos = BINFO_BASETYPES (binfo);
127 int i, n_baselinks = real_binfos ? TREE_VEC_LENGTH (real_binfos) : 0;
129 for (i = 0; i < n_baselinks; i++)
131 tree real_base_binfo = TREE_VEC_ELT (real_binfos, i);
132 tree base_binfo = TREE_VEC_ELT (binfos, i);
133 int is_not_base_vtable =
134 i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (real_binfo));
135 if (! TREE_VIA_VIRTUAL (real_base_binfo))
136 expand_direct_vtbls_init (real_base_binfo, base_binfo,
137 is_not_base_vtable, can_elide, addr);
140 /* Before turning this on, make sure it is correct. */
141 if (can_elide && ! BINFO_MODIFIED (binfo))
144 /* Should we use something besides CLASSTYPE_VFIELDS? */
145 if (init_self && CLASSTYPE_VFIELDS (BINFO_TYPE (real_binfo)))
147 tree base_ptr = convert_pointer_to_real (binfo, addr);
148 expand_virtual_init (real_binfo, base_ptr);
153 /* Subroutine of emit_base_init. */
155 perform_member_init (member, name, init, explicit)
156 tree member, name, init;
160 tree type = TREE_TYPE (member);
162 if (TYPE_NEEDS_CONSTRUCTING (type)
163 || (init && TYPE_HAS_CONSTRUCTOR (type)))
165 /* Since `init' is already a TREE_LIST on the current_member_init_list,
166 only build it into one if we aren't already a list. */
167 if (init != NULL_TREE && TREE_CODE (init) != TREE_LIST)
168 init = build_tree_list (NULL_TREE, init);
170 decl = build_component_ref (C_C_D, name, 0, explicit);
173 && TREE_CODE (type) == ARRAY_TYPE
175 && TREE_CHAIN (init) == NULL_TREE
176 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
178 /* Initialization of one array from another. */
179 expand_vec_init (TREE_OPERAND (decl, 1), decl,
180 array_type_nelts (type), TREE_VALUE (init), 1);
183 expand_aggr_init (decl, init, 0);
187 if (init == NULL_TREE)
191 cp_error ("incomplete initializer for member `%D' of class `%T' which has no constructor",
192 member, current_class_type);
193 init = error_mark_node;
195 /* member traversal: note it leaves init NULL */
196 else if (TREE_CODE (TREE_TYPE (member)) == REFERENCE_TYPE)
197 cp_pedwarn ("uninitialized reference member `%D'", member);
199 else if (TREE_CODE (init) == TREE_LIST)
201 /* There was an explicit member initialization. Do some
202 work in that case. */
203 if (TREE_CHAIN (init))
205 warning ("initializer list treated as compound expression");
206 init = build_compound_expr (init);
209 init = TREE_VALUE (init);
212 /* We only build this with a null init if we got it from the
213 current_member_init_list. */
214 if (init || explicit)
216 decl = build_component_ref (C_C_D, name, 0, explicit);
217 expand_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
220 if (flag_handle_exceptions && TYPE_NEEDS_DESTRUCTOR (type))
221 cp_warning ("caution, member `%D' may not be destroyed in the presense of an exception during construction", member);
224 /* Subroutine of emit_member_init. */
229 tree x, member, name, field, init;
230 tree init_list = NULL_TREE;
231 tree fields_to_unmark = NULL_TREE;
234 for (member = TYPE_FIELDS (t); member ; member = TREE_CHAIN (member))
237 for (x = current_member_init_list ; x ; x = TREE_CHAIN (x))
239 /* If we cleared this out, then pay no attention to it. */
240 if (TREE_PURPOSE (x) == NULL_TREE)
242 name = TREE_PURPOSE (x);
245 field = (TREE_CODE (name) == COMPONENT_REF
246 ? TREE_OPERAND (name, 1) : IDENTIFIER_CLASS_VALUE (name));
248 /* Let's find out when this happens. */
249 my_friendly_assert (TREE_CODE (name) != COMPONENT_REF, 348);
250 field = IDENTIFIER_CLASS_VALUE (name);
253 /* If one member shadows another, get the outermost one. */
254 if (TREE_CODE (field) == TREE_LIST)
255 field = TREE_VALUE (field);
259 /* See if we already found an initializer for this field. */
262 if (DECL_NAME (field))
263 cp_error ("multiple initializations given for member `%D'",
268 init_list = chainon (init_list,
269 build_tree_list (name, TREE_VALUE (x)));
270 /* Make sure we won't try to work on this init again. */
271 TREE_PURPOSE (x) = NULL_TREE;
277 /* If we didn't find MEMBER in the list, create a dummy entry
278 so the two lists (INIT_LIST and the list of members) will be
281 init_list = chainon (init_list, build_tree_list (NULL_TREE, NULL_TREE));
284 for (x = current_member_init_list ; x ; x = TREE_CHAIN (x))
286 if (TREE_PURPOSE (x))
288 name = TREE_PURPOSE (x);
289 init = TREE_VALUE (x);
290 /* XXX: this may need the COMPONENT_REF operand 0 check if
291 it turns out we actually get them. */
292 field = IDENTIFIER_CLASS_VALUE (name);
294 /* If one member shadows another, get the outermost one. */
295 if (TREE_CODE (field) == TREE_LIST)
297 field = TREE_VALUE (field);
298 if (decl_type_context (field) != current_class_type)
299 cp_error ("field `%D' not in immediate context", field);
303 /* It turns out if you have an anonymous union in the
304 class, a member from it can end up not being on the
305 list of fields (rather, the type is), and therefore
306 won't be seen by the for loop above. */
308 /* The code in this for loop is derived from a general loop
309 which had this check in it. Theoretically, we've hit
310 every initialization for the list of members in T, so
311 we shouldn't have anything but these left in this list. */
312 my_friendly_assert (DECL_FIELD_CONTEXT (field) != t, 351);
315 if (TREE_HAS_CONSTRUCTOR (field))
317 if (DECL_NAME (field))
318 error ("multiple initializations given for member `%s'",
319 IDENTIFIER_POINTER (DECL_NAME (field)));
323 TREE_HAS_CONSTRUCTOR (field) = 1;
324 fields_to_unmark = tree_cons (NULL_TREE, field, fields_to_unmark);
326 perform_member_init (field, name, init, 1);
327 TREE_PURPOSE (x) = NULL_TREE;
331 /* Unmark fields which are initialized for the base class. */
332 while (fields_to_unmark)
334 TREE_HAS_CONSTRUCTOR (TREE_VALUE (fields_to_unmark)) = 0;
335 /* XXX is this a memory leak? */
336 fields_to_unmark = TREE_CHAIN (fields_to_unmark);
342 /* Perform whatever initializations have yet to be done on the base
343 class of the class variable. These actions are in the global
344 variable CURRENT_BASE_INIT_LIST. Such an action could be
345 NULL_TREE, meaning that the user has explicitly called the base
346 class constructor with no arguments.
348 If there is a need for a call to a constructor, we must surround
349 that call with a pushlevel/poplevel pair, since we are technically
350 at the PARM level of scope.
352 Argument IMMEDIATELY, if zero, forces a new sequence to be
353 generated to contain these new insns, so it can be emitted later.
354 This sequence is saved in the global variable BASE_INIT_INSNS.
355 Otherwise, the insns are emitted into the current sequence.
357 Note that emit_base_init does *not* initialize virtual base
358 classes. That is done specially, elsewhere. */
361 emit_base_init (t, immediately)
365 extern tree in_charge_identifier;
370 tree t_binfo = TYPE_BINFO (t);
371 tree binfos = BINFO_BASETYPES (t_binfo);
372 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
373 int have_init_list = 0, from_init_list;
377 do_pending_stack_adjust ();
381 if (write_symbols == NO_DEBUG)
382 /* As a matter of principle, `start_sequence' should do this. */
385 /* Always emit a line number note so we can step into constructors. */
386 emit_line_note_force (DECL_SOURCE_FILE (current_function_decl),
387 DECL_SOURCE_LINE (current_function_decl));
389 start = ! TYPE_USES_VIRTUAL_BASECLASSES (t);
390 for (pass = start; pass < 2; pass++)
392 tree vbase_init_list = NULL_TREE;
394 for (init_list = current_base_init_list; init_list;
395 init_list = TREE_CHAIN (init_list))
397 tree basename = TREE_PURPOSE (init_list);
399 tree init = TREE_VALUE (init_list);
401 if (basename == NULL_TREE)
403 /* Initializer for single base class. Must not
404 use multiple inheritance or this is ambiguous. */
405 switch (n_baseclasses)
408 error ("type `%s' does not have a base class to initialize",
409 IDENTIFIER_POINTER (current_class_name));
414 error ("unnamed initializer ambiguous for type `%s' which uses multiple inheritance", IDENTIFIER_POINTER (current_class_name));
417 binfo = TREE_VEC_ELT (binfos, 0);
419 else if (is_aggr_typedef (basename, 1))
421 binfo = binfo_or_else (IDENTIFIER_TYPE_VALUE (basename), t);
422 if (binfo == NULL_TREE)
425 /* Virtual base classes are special cases. Their initializers
426 are recorded with this constructor, and they are used when
427 this constructor is the top-level constructor called. */
428 if (! TREE_VIA_VIRTUAL (binfo))
430 /* Otherwise, if it is not an immediate base class, complain. */
431 for (i = n_baseclasses-1; i >= 0; i--)
432 if (BINFO_TYPE (binfo) == BINFO_TYPE (TREE_VEC_ELT (binfos, i)))
436 error ("type `%s' is not an immediate base class of type `%s'",
437 IDENTIFIER_POINTER (basename),
438 IDENTIFIER_POINTER (current_class_name));
446 /* The base initialization list goes up to the first
447 base class which can actually use it. */
451 char *msgp = (! TYPE_HAS_CONSTRUCTOR (BINFO_TYPE (binfo)))
452 ? "cannot pass initialization up to class `%s'" : 0;
454 while (! TYPE_HAS_CONSTRUCTOR (BINFO_TYPE (binfo))
455 && BINFO_BASETYPES (binfo) != NULL_TREE
456 && TREE_VEC_LENGTH (BINFO_BASETYPES (binfo)) == 1)
458 /* ?? This should be fixed in RENO by forcing
459 default constructors to exist. */
460 SET_BINFO_BASEINIT_MARKED (binfo);
461 binfo = BINFO_BASETYPE (binfo, 0);
464 /* We used to give an error if this wasn't true, saying that
465 there's no constructor for the initialization of basename.
466 This turned out to be incorrect---it should use the
467 default constructor, since a user could try to initialize
468 the class in a derived class's base initializer list. */
469 if (TYPE_HAS_CONSTRUCTOR (BINFO_TYPE (binfo)))
474 error_with_aggr_type (binfo, msgp);
480 if (BINFO_BASEINIT_MARKED (binfo))
482 msgp = "class `%s' initializer already specified";
483 error (msgp, IDENTIFIER_POINTER (basename));
489 SET_BINFO_BASEINIT_MARKED (binfo);
490 if (TREE_VIA_VIRTUAL (binfo))
492 vbase_init_list = tree_cons (init, BINFO_TYPE (binfo),
499 else if (TREE_VIA_VIRTUAL (binfo))
502 member = convert_pointer_to (binfo, current_class_decl);
503 expand_aggr_init_1 (t_binfo, 0,
504 build_indirect_ref (member, NULL_PTR), init,
505 BINFO_OFFSET_ZEROP (binfo), LOOKUP_COMPLAIN);
510 tree first_arg = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
513 if (DECL_NAME (current_function_decl) == NULL_TREE
514 && TREE_CHAIN (first_arg) != NULL_TREE)
516 /* If there are virtual baseclasses without initialization
517 specified, and this is a default X(X&) constructor,
518 build the initialization list so that each virtual baseclass
519 of the new object is initialized from the virtual baseclass
520 of the incoming arg. */
521 tree init_arg = build_unary_op (ADDR_EXPR, TREE_CHAIN (first_arg), 0);
522 for (vbases = CLASSTYPE_VBASECLASSES (t);
523 vbases; vbases = TREE_CHAIN (vbases))
525 if (BINFO_BASEINIT_MARKED (vbases) == 0)
527 member = convert_pointer_to (vbases, init_arg);
528 if (member == init_arg)
529 member = TREE_CHAIN (first_arg);
531 TREE_TYPE (member) = build_reference_type (BINFO_TYPE (vbases));
532 vbase_init_list = tree_cons (convert_from_reference (member),
533 vbases, vbase_init_list);
534 SET_BINFO_BASEINIT_MARKED (vbases);
538 expand_start_cond (first_arg, 0);
539 expand_aggr_vbase_init (t_binfo, C_C_D, current_class_decl,
544 current_base_init_list = NULL_TREE;
546 /* Now, perform default initialization of all base classes which
547 have not yet been initialized, and unmark baseclasses which
548 have been initialized. */
549 for (i = 0; i < n_baseclasses; i++)
551 tree base = current_class_decl;
552 tree base_binfo = TREE_VEC_ELT (binfos, i);
554 if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo)))
556 if (! TREE_VIA_VIRTUAL (base_binfo)
557 && ! BINFO_BASEINIT_MARKED (base_binfo))
561 if (BINFO_OFFSET_ZEROP (base_binfo))
562 base = build1 (NOP_EXPR,
563 TYPE_POINTER_TO (BINFO_TYPE (base_binfo)),
566 base = build (PLUS_EXPR,
567 TYPE_POINTER_TO (BINFO_TYPE (base_binfo)),
568 current_class_decl, BINFO_OFFSET (base_binfo));
570 ref = build_indirect_ref (base, NULL_PTR);
571 expand_aggr_init_1 (t_binfo, 0, ref, NULL_TREE,
572 BINFO_OFFSET_ZEROP (base_binfo),
576 CLEAR_BINFO_BASEINIT_MARKED (base_binfo);
578 if (! TYPE_USES_VIRTUAL_BASECLASSES (t))
580 while (! TYPE_HAS_CONSTRUCTOR (BINFO_TYPE (base_binfo))
581 && BINFO_BASETYPES (base_binfo) != NULL_TREE
582 && TREE_VEC_LENGTH (BINFO_BASETYPES (base_binfo)) == 1)
584 /* ?? This should be fixed in RENO by forcing
585 default constructors to exist. It is needed for symmetry
587 base_binfo = BINFO_BASETYPE (base_binfo, 0);
588 CLEAR_BINFO_BASEINIT_MARKED (base_binfo);
593 /* Initialize all the virtual function table fields that
594 do come from virtual base classes. */
595 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
596 expand_indirect_vtbls_init (t_binfo, C_C_D, current_class_decl, 0);
597 for (vbases = CLASSTYPE_VBASECLASSES (t); vbases; vbases = TREE_CHAIN (vbases))
598 CLEAR_BINFO_BASEINIT_MARKED (vbases);
600 /* Initialize all the virtual function table fields that
601 do not come from virtual base classes. */
602 expand_direct_vtbls_init (t_binfo, t_binfo, 1, 1, current_class_decl);
604 if (current_member_init_list)
606 init_list = sort_member_init (t);
610 for (member = TYPE_FIELDS (t); member; member = TREE_CHAIN (member))
615 /* See if we had a user-specified member initialization. */
618 if (TREE_PURPOSE (init_list))
620 name = TREE_PURPOSE (init_list);
621 init = TREE_VALUE (init_list);
624 if (TREE_STATIC (member))
626 error_with_aggr_type (DECL_FIELD_CONTEXT (member),
627 "field `%s::%s' is static; only point of initialization is its declaration",
628 IDENTIFIER_POINTER (TREE_PURPOSE (init_list)));
632 /* Also see if it's ever a COMPONENT_REF here. If it is, we
633 need to do `expand_assignment (name, init, 0, 0);' and
635 my_friendly_assert (TREE_CODE (name) != COMPONENT_REF, 349);
638 init_list = TREE_CHAIN (init_list);
641 if (! from_init_list)
643 /* member could be, for example, a CONST_DECL for an enumerated
644 tag; we don't want to try to initialize that, since it already
646 if (TREE_CODE (member) != FIELD_DECL || !DECL_NAME (member))
649 name = DECL_NAME (member);
650 init = DECL_INITIAL (member);
653 perform_member_init (member, name, init, from_init_list);
656 current_member_init_list = NULL_TREE;
658 /* It is possible for the initializers to need cleanups.
659 Expand those cleanups now that all the initialization
661 expand_cleanups_to (NULL_TREE);
665 extern rtx base_init_insns;
667 do_pending_stack_adjust ();
668 my_friendly_assert (base_init_insns == 0, 207);
669 base_init_insns = get_insns ();
673 /* All the implicit try blocks we built up will be zapped
674 when we come to a real binding contour boundary. */
677 /* Check that all fields are properly initialized after
678 an assignment to `this'. */
684 for (member = TYPE_FIELDS (t); member; member = TREE_CHAIN (member))
685 if (DECL_NAME (member) && TREE_USED (member))
686 cp_error ("field `%D' used before initialized (after assignment to `this')",
690 /* This code sets up the virtual function tables appropriate for
691 the pointer DECL. It is a one-ply initialization.
693 BINFO is the exact type that DECL is supposed to be. In
694 multiple inheritance, this might mean "C's A" if C : A, B. */
696 expand_virtual_init (binfo, decl)
699 tree type = BINFO_TYPE (binfo);
701 tree vtype, vtype_binfo;
703 /* This code is crusty. Should be simple, like:
704 vtbl = BINFO_VTABLE (binfo);
706 vtype = DECL_CONTEXT (CLASSTYPE_VFIELD (type));
707 vtype_binfo = get_binfo (vtype, TREE_TYPE (TREE_TYPE (decl)), 0);
708 vtbl = BINFO_VTABLE (binfo_value (DECL_FIELD_CONTEXT (CLASSTYPE_VFIELD (type)), binfo));
709 if (!flag_vtable_thunks)
710 assemble_external (vtbl);
711 TREE_USED (vtbl) = 1;
712 vtbl = build1 (ADDR_EXPR, TYPE_POINTER_TO (TREE_TYPE (vtbl)), vtbl);
713 decl = convert_pointer_to_real (vtype_binfo, decl);
714 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL_PTR), vtype);
715 if (vtbl_ptr == error_mark_node)
718 /* Have to convert VTBL since array sizes may be different. */
719 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl);
720 expand_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
723 /* Subroutine of `expand_aggr_vbase_init'.
724 BINFO is the binfo of the type that is being initialized.
725 INIT_LIST is the list of initializers for the virtual baseclass. */
727 expand_aggr_vbase_init_1 (binfo, exp, addr, init_list)
728 tree binfo, exp, addr, init_list;
730 tree init = value_member (BINFO_TYPE (binfo), init_list);
731 tree ref = build_indirect_ref (addr, NULL_PTR);
733 init = TREE_PURPOSE (init);
734 /* Call constructors, but don't set up vtables. */
735 expand_aggr_init_1 (binfo, exp, ref, init, 0,
736 LOOKUP_COMPLAIN|LOOKUP_SPECULATIVELY);
737 CLEAR_BINFO_VBASE_INIT_MARKED (binfo);
740 /* Initialize this object's virtual base class pointers. This must be
741 done only at the top-level of the object being constructed.
743 INIT_LIST is list of initialization for constructor to perform. */
745 expand_aggr_vbase_init (binfo, exp, addr, init_list)
751 tree type = BINFO_TYPE (binfo);
753 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
755 tree result = init_vbase_pointers (type, addr);
759 expand_expr_stmt (build_compound_expr (result));
761 /* Mark everything as having an initializer
762 (either explicit or default). */
763 for (vbases = CLASSTYPE_VBASECLASSES (type);
764 vbases; vbases = TREE_CHAIN (vbases))
765 SET_BINFO_VBASE_INIT_MARKED (vbases);
767 /* First, initialize baseclasses which could be baseclasses
768 for other virtual baseclasses. */
769 for (vbases = CLASSTYPE_VBASECLASSES (type);
770 vbases; vbases = TREE_CHAIN (vbases))
771 /* Don't initialize twice. */
772 if (BINFO_VBASE_INIT_MARKED (vbases))
776 while (BINFO_TYPE (vbases) != BINFO_TYPE (TREE_PURPOSE (tmp)))
777 tmp = TREE_CHAIN (tmp);
778 expand_aggr_vbase_init_1 (vbases, exp,
779 TREE_OPERAND (TREE_VALUE (tmp), 0),
783 /* Now initialize the baseclasses which don't have virtual baseclasses. */
784 for (; result; result = TREE_CHAIN (result))
785 /* Don't initialize twice. */
786 if (BINFO_VBASE_INIT_MARKED (TREE_PURPOSE (result)))
788 my_friendly_abort (47);
789 expand_aggr_vbase_init_1 (TREE_PURPOSE (result), exp,
790 TREE_OPERAND (TREE_VALUE (result), 0),
796 /* Subroutine to perform parser actions for member initialization.
797 S_ID is the scoped identifier.
798 NAME is the name of the member.
799 INIT is the initializer, or `void_type_node' if none. */
801 do_member_init (s_id, name, init)
802 tree s_id, name, init;
806 if (current_class_type == NULL_TREE
807 || ! is_aggr_typedef (s_id, 1))
809 binfo = get_binfo (IDENTIFIER_TYPE_VALUE (s_id),
810 current_class_type, 1);
811 if (binfo == error_mark_node)
815 error_not_base_type (IDENTIFIER_TYPE_VALUE (s_id), current_class_type);
819 base = convert_pointer_to (binfo, current_class_decl);
820 expand_member_init (build_indirect_ref (base, NULL_PTR), name, init);
823 /* Function to give error message if member initialization specification
824 is erroneous. FIELD is the member we decided to initialize.
825 TYPE is the type for which the initialization is being performed.
826 FIELD must be a member of TYPE, or the base type from which FIELD
827 comes must not need a constructor.
829 MEMBER_NAME is the name of the member. */
832 member_init_ok_or_else (field, type, member_name)
837 if (field == error_mark_node)
839 if (field == NULL_TREE)
841 cp_error ("class `%T' does not have any field named `%s'", type,
845 if (DECL_CONTEXT (field) != type
846 && TYPE_NEEDS_CONSTRUCTING (DECL_CONTEXT (field)))
848 cp_error ("member `%D' comes from base class needing constructor",
855 /* If NAME is a viable field name for the aggregate DECL,
856 and PARMS is a viable parameter list, then expand an _EXPR
857 which describes this initialization.
859 Note that we do not need to chase through the class's base classes
860 to look for NAME, because if it's in that list, it will be handled
861 by the constructor for that base class.
863 We do not yet have a fixed-point finder to instantiate types
864 being fed to overloaded constructors. If there is a unique
865 constructor, then argument types can be got from that one.
867 If INIT is non-NULL, then it the initialization should
868 be placed in `current_base_init_list', where it will be processed
869 by `emit_base_init'. */
871 expand_member_init (exp, name, init)
872 tree exp, name, init;
874 extern tree ptr_type_node; /* should be in tree.h */
876 tree basetype = NULL_TREE, field;
881 if (exp == NULL_TREE)
882 return; /* complain about this later */
884 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
886 if (name == NULL_TREE && IS_AGGR_TYPE (type))
887 switch (CLASSTYPE_N_BASECLASSES (type))
890 error ("base class initializer specified, but no base class to initialize");
893 basetype = TYPE_BINFO_BASETYPE (type, 0);
896 error ("initializer for unnamed base class ambiguous");
897 cp_error ("(type `%T' uses multiple inheritance)", type);
903 /* The grammar should not allow fields which have names
904 that are TYPENAMEs. Therefore, if the field has
905 a non-NULL TREE_TYPE, we may assume that this is an
906 attempt to initialize a base class member of the current
907 type. Otherwise, it is an attempt to initialize a
910 if (init == void_type_node)
913 if (name == NULL_TREE || IDENTIFIER_HAS_TYPE_VALUE (name))
917 if (name == NULL_TREE)
921 name = TYPE_IDENTIFIER (basetype);
924 error ("no base class to initialize");
931 basetype = IDENTIFIER_TYPE_VALUE (name);
933 && ! binfo_member (basetype, TYPE_BINFO (type))
934 && ! binfo_member (basetype, CLASSTYPE_VBASECLASSES (type)))
936 if (IDENTIFIER_CLASS_VALUE (name))
938 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
939 error ("type `%s' is not an immediate or virtual basetype for `%s'",
940 IDENTIFIER_POINTER (name),
941 TYPE_NAME_STRING (type));
943 error ("type `%s' is not an immediate basetype for `%s'",
944 IDENTIFIER_POINTER (name),
945 TYPE_NAME_STRING (type));
950 if (purpose_member (name, current_base_init_list))
952 error ("base class `%s' already initialized",
953 IDENTIFIER_POINTER (name));
957 base_init = build_tree_list (name, init);
958 TREE_TYPE (base_init) = basetype;
959 current_base_init_list = chainon (current_base_init_list, base_init);
966 field = lookup_field (type, name, 1, 0);
968 if (! member_init_ok_or_else (field, type, IDENTIFIER_POINTER (name)))
971 if (purpose_member (name, current_member_init_list))
973 error ("field `%s' already initialized", IDENTIFIER_POINTER (name));
977 member_init = build_tree_list (name, init);
978 TREE_TYPE (member_init) = TREE_TYPE (field);
979 current_member_init_list = chainon (current_member_init_list, member_init);
983 else if (name == NULL_TREE)
985 compiler_error ("expand_member_init: name == NULL_TREE");
990 field = lookup_field (basetype, name, 0, 0);
992 if (! member_init_ok_or_else (field, basetype, IDENTIFIER_POINTER (name)))
995 /* now see if there is a constructor for this type
996 which will take these args. */
998 if (TYPE_HAS_CONSTRUCTOR (TREE_TYPE (field)))
1000 tree parmtypes, fndecl;
1002 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1004 /* just know that we've seen something for this node */
1005 DECL_INITIAL (exp) = error_mark_node;
1006 TREE_USED (exp) = 1;
1008 type = TYPE_MAIN_VARIANT (TREE_TYPE (field));
1009 actual_name = TYPE_IDENTIFIER (type);
1010 parm = build_component_ref (exp, name, 0, 0);
1012 /* Now get to the constructor. */
1013 fndecl = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), 0);
1014 /* Get past destructor, if any. */
1015 if (TYPE_HAS_DESTRUCTOR (type))
1016 fndecl = DECL_CHAIN (fndecl);
1019 my_friendly_assert (TREE_CODE (fndecl) == FUNCTION_DECL, 209);
1021 /* If the field is unique, we can use the parameter
1022 types to guide possible type instantiation. */
1023 if (DECL_CHAIN (fndecl) == NULL_TREE)
1025 /* There was a confusion here between
1026 FIELD and FNDECL. The following code
1027 should be correct, but abort is here
1029 my_friendly_abort (48);
1030 parmtypes = FUNCTION_ARG_CHAIN (fndecl);
1034 parmtypes = NULL_TREE;
1038 init = convert_arguments (parm, parmtypes, NULL_TREE, fndecl, LOOKUP_NORMAL);
1039 if (init == NULL_TREE || TREE_TYPE (init) != error_mark_node)
1040 rval = build_method_call (NULL_TREE, actual_name, init, NULL_TREE, LOOKUP_NORMAL);
1044 if (rval != error_mark_node)
1046 /* Now, fill in the first parm with our guy */
1047 TREE_VALUE (TREE_OPERAND (rval, 1))
1048 = build_unary_op (ADDR_EXPR, parm, 0);
1049 TREE_TYPE (rval) = ptr_type_node;
1050 TREE_SIDE_EFFECTS (rval) = 1;
1053 else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field)))
1055 parm = build_component_ref (exp, name, 0, 0);
1056 expand_aggr_init (parm, NULL_TREE, 0);
1057 rval = error_mark_node;
1060 /* Now initialize the member. It does not have to
1061 be of aggregate type to receive initialization. */
1062 if (rval != error_mark_node)
1063 expand_expr_stmt (rval);
1066 /* This is like `expand_member_init', only it stores one aggregate
1069 INIT comes in two flavors: it is either a value which
1070 is to be stored in EXP, or it is a parameter list
1071 to go to a constructor, which will operate on EXP.
1072 If `init' is a CONSTRUCTOR, then we emit a warning message,
1073 explaining that such initializations are illegal.
1075 ALIAS_THIS is nonzero iff we are initializing something which is
1076 essentially an alias for C_C_D. In this case, the base constructor
1077 may move it on us, and we must keep track of such deviations.
1079 If INIT resolves to a CALL_EXPR which happens to return
1080 something of the type we are looking for, then we know
1081 that we can safely use that call to perform the
1084 The virtual function table pointer cannot be set up here, because
1085 we do not really know its type.
1087 Virtual baseclass pointers are also set up here.
1089 This never calls operator=().
1091 When initializing, nothing is CONST.
1093 A default copy constructor may have to be used to perform the
1096 A constructor or a conversion operator may have to be used to
1097 perform the initialization, but not both, as it would be ambiguous.
1101 expand_aggr_init (exp, init, alias_this)
1105 tree type = TREE_TYPE (exp);
1106 int was_const = TREE_READONLY (exp);
1108 if (init == error_mark_node)
1111 TREE_READONLY (exp) = 0;
1113 if (TREE_CODE (type) == ARRAY_TYPE)
1115 /* Must arrange to initialize each element of EXP
1116 from elements of INIT. */
1117 int was_const_elts = TYPE_READONLY (TREE_TYPE (type));
1118 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1121 tree atype = build_cplus_array_type (TYPE_MAIN_VARIANT (TREE_TYPE (type)),
1122 TYPE_DOMAIN (type));
1123 if (init && (TREE_TYPE (exp) == TREE_TYPE (init)))
1124 TREE_TYPE (init) = atype;
1125 TREE_TYPE (exp) = atype;
1127 if (init && TREE_TYPE (init) == NULL_TREE)
1129 /* Handle bad initializers like:
1133 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1137 int main(int argc, char **argv) {
1138 COMPLEX zees(1.0, 0.0)[10];
1141 error ("bad array initializer");
1144 expand_vec_init (exp, exp, array_type_nelts (type), init,
1145 init && comptypes (TREE_TYPE (init), TREE_TYPE (exp), 1));
1146 TREE_READONLY (exp) = was_const;
1147 TREE_TYPE (exp) = type;
1148 if (init) TREE_TYPE (init) = itype;
1152 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1153 /* just know that we've seen something for this node */
1154 TREE_USED (exp) = 1;
1157 /* If initializing from a GNU C CONSTRUCTOR, consider the elts in the
1158 constructor as parameters to an implicit GNU C++ constructor. */
1159 if (init && TREE_CODE (init) == CONSTRUCTOR
1160 && TYPE_HAS_CONSTRUCTOR (type)
1161 && TREE_TYPE (init) == type)
1162 init = CONSTRUCTOR_ELTS (init);
1164 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1165 init, alias_this, LOOKUP_NORMAL);
1166 TREE_READONLY (exp) = was_const;
1170 expand_default_init (binfo, true_exp, exp, type, init, alias_this, flags)
1178 /* It fails because there may not be a constructor which takes
1179 its own type as the first (or only parameter), but which does
1180 take other types via a conversion. So, if the thing initializing
1181 the expression is a unit element of type X, first try X(X&),
1182 followed by initialization by X. If neither of these work
1183 out, then look hard. */
1186 int xxref_init_possible;
1188 if (init == NULL_TREE || TREE_CODE (init) == TREE_LIST)
1191 if (parms) init = TREE_VALUE (parms);
1193 else if (TREE_CODE (init) == INDIRECT_REF && TREE_HAS_CONSTRUCTOR (init))
1195 rval = convert_for_initialization (exp, type, init, 0, 0, 0, 0);
1196 expand_expr_stmt (rval);
1200 parms = build_tree_list (NULL_TREE, init);
1202 if (TYPE_HAS_INIT_REF (type)
1203 || init == NULL_TREE
1204 || TREE_CHAIN (parms) != NULL_TREE)
1205 xxref_init_possible = 0;
1208 xxref_init_possible = LOOKUP_SPECULATIVELY;
1209 flags &= ~LOOKUP_COMPLAIN;
1212 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
1214 if (true_exp == exp)
1215 parms = tree_cons (NULL_TREE, integer_one_node, parms);
1217 parms = tree_cons (NULL_TREE, integer_zero_node, parms);
1218 flags |= LOOKUP_HAS_IN_CHARGE;
1221 rval = build_method_call (exp, constructor_name_full (type),
1222 parms, binfo, flags|xxref_init_possible);
1223 if (rval == NULL_TREE && xxref_init_possible)
1225 /* It is an error to implement a default copy constructor if
1226 (see ARM 12.8 for details) ... one case being if another
1227 copy constructor already exists. */
1228 tree init_type = TREE_TYPE (init);
1229 if (TREE_CODE (init_type) == REFERENCE_TYPE)
1230 init_type = TREE_TYPE (init_type);
1231 if (TYPE_MAIN_VARIANT (init_type) == TYPE_MAIN_VARIANT (type)
1232 || (IS_AGGR_TYPE (init_type)
1233 && UNIQUELY_DERIVED_FROM_P (type, init_type)))
1235 if (type == BINFO_TYPE (binfo)
1236 && TYPE_USES_VIRTUAL_BASECLASSES (type))
1238 tree addr = build_unary_op (ADDR_EXPR, exp, 0);
1239 expand_aggr_vbase_init (binfo, exp, addr, NULL_TREE);
1241 expand_indirect_vtbls_init (binfo, exp, addr, 1);
1243 expand_expr_stmt (build_modify_expr (exp, INIT_EXPR, init));
1247 rval = build_method_call (exp, constructor_name_full (type), parms,
1251 /* Private, protected, or otherwise unavailable. */
1252 if (rval == error_mark_node && (flags&LOOKUP_COMPLAIN))
1253 cp_error ("in base initialization for class `%T'", binfo);
1254 /* A valid initialization using constructor. */
1255 else if (rval != error_mark_node && rval != NULL_TREE)
1257 /* p. 222: if the base class assigns to `this', then that
1258 value is used in the derived class. */
1259 if ((flag_this_is_variable & 1) && alias_this)
1261 TREE_TYPE (rval) = TREE_TYPE (current_class_decl);
1262 expand_assignment (current_class_decl, rval, 0, 0);
1265 expand_expr_stmt (rval);
1267 else if (parms && TREE_CHAIN (parms) == NULL_TREE)
1269 /* If we are initializing one aggregate value
1270 from another, and though there are constructors,
1271 and none accept the initializer, just do a bitwise
1274 The above sounds wrong, ``If a class has any copy
1275 constructor defined, the default copy constructor will
1276 not be generated.'' 12.8 Copying Class Objects (mrs)
1278 @@ This should reject initializer which a constructor
1279 @@ rejected on access gounds, but there is
1280 @@ no way right now to recognize that case with
1281 @@ just `error_mark_node'. */
1283 init = TREE_VALUE (parms);
1284 itype = TREE_TYPE (init);
1285 if (TREE_CODE (itype) == REFERENCE_TYPE)
1287 init = convert_from_reference (init);
1288 itype = TREE_TYPE (init);
1290 itype = TYPE_MAIN_VARIANT (itype);
1292 /* This is currently how the default X(X&) constructor
1294 if (comptypes (TYPE_MAIN_VARIANT (type), itype, 0))
1297 warning ("bitwise copy in initialization of type `%s'",
1298 TYPE_NAME_STRING (type));
1300 rval = build (INIT_EXPR, type, exp, init);
1301 expand_expr_stmt (rval);
1305 cp_error ("in base initialization for class `%T',", binfo);
1306 cp_error ("invalid initializer to constructor for type `%T'", type);
1312 if (init == NULL_TREE)
1313 my_friendly_assert (parms == NULL_TREE, 210);
1314 if (parms == NULL_TREE && TREE_VIA_VIRTUAL (binfo))
1315 cp_error ("virtual baseclass `%T' does not have default initializer", binfo);
1318 cp_error ("in base initialization for class `%T',", binfo);
1319 /* This will make an error message for us. */
1320 build_method_call (exp, constructor_name_full (type), parms, binfo,
1321 (TYPE_USES_VIRTUAL_BASECLASSES (type)
1322 ? LOOKUP_NORMAL|LOOKUP_HAS_IN_CHARGE
1327 /* Constructor has been called, but vtables may be for TYPE
1328 rather than for FOR_TYPE. */
1331 /* This function is responsible for initializing EXP with INIT
1334 BINFO is the binfo of the type for who we are performing the
1335 initialization. For example, if W is a virtual base class of A and B,
1337 If we are initializing B, then W must contain B's W vtable, whereas
1338 were we initializing C, W must contain C's W vtable.
1340 TRUE_EXP is nonzero if it is the true expression being initialized.
1341 In this case, it may be EXP, or may just contain EXP. The reason we
1342 need this is because if EXP is a base element of TRUE_EXP, we
1343 don't necessarily know by looking at EXP where its virtual
1344 baseclass fields should really be pointing. But we do know
1345 from TRUE_EXP. In constructors, we don't know anything about
1346 the value being initialized.
1348 ALIAS_THIS serves the same purpose it serves for expand_aggr_init.
1350 FLAGS is just passes to `build_method_call'. See that function for
1354 expand_aggr_init_1 (binfo, true_exp, exp, init, alias_this, flags)
1361 tree type = TREE_TYPE (exp);
1362 tree init_type = NULL_TREE;
1364 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1366 /* Use a function returning the desired type to initialize EXP for us.
1367 If the function is a constructor, and its first argument is
1368 NULL_TREE, know that it was meant for us--just slide exp on
1369 in and expand the constructor. Constructors now come
1373 tree init_list = NULL_TREE;
1375 if (TREE_CODE (init) == TREE_LIST)
1378 if (TREE_CHAIN (init) == NULL_TREE)
1379 init = TREE_VALUE (init);
1382 init_type = TREE_TYPE (init);
1384 if (TREE_CODE (init) != TREE_LIST)
1386 if (TREE_CODE (init_type) == ERROR_MARK)
1390 /* These lines are found troublesome 5/11/89. */
1391 if (TREE_CODE (init_type) == REFERENCE_TYPE)
1392 init_type = TREE_TYPE (init_type);
1395 /* This happens when we use C++'s functional cast notation.
1396 If the types match, then just use the TARGET_EXPR
1397 directly. Otherwise, we need to create the initializer
1398 separately from the object being initialized. */
1399 if (TREE_CODE (init) == TARGET_EXPR)
1401 if (init_type == type)
1403 if (TREE_CODE (exp) == VAR_DECL
1404 || TREE_CODE (exp) == RESULT_DECL)
1405 /* Unify the initialization targets. */
1406 DECL_RTL (TREE_OPERAND (init, 0)) = DECL_RTL (exp);
1408 DECL_RTL (TREE_OPERAND (init, 0)) = expand_expr (exp, NULL_RTX, 0, 0);
1410 expand_expr_stmt (init);
1415 init = TREE_OPERAND (init, 1);
1416 init = build (CALL_EXPR, init_type,
1417 TREE_OPERAND (init, 0), TREE_OPERAND (init, 1), 0);
1418 TREE_SIDE_EFFECTS (init) = 1;
1420 TREE_RAISES (init) = ??
1423 TREE_VALUE (init_list) = init;
1427 if (init_type == type && TREE_CODE (init) == CALL_EXPR
1429 /* It is legal to directly initialize from a CALL_EXPR
1430 without going through X(X&), apparently. */
1431 && ! TYPE_GETS_INIT_REF (type)
1435 /* A CALL_EXPR is a legitimate form of initialization, so
1436 we should not print this warning message. */
1438 /* Should have gone away due to 5/11/89 change. */
1439 if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
1440 init = convert_from_reference (init);
1442 expand_assignment (exp, init, 0, 0);
1443 if (exp == DECL_RESULT (current_function_decl))
1445 /* Failing this assertion means that the return value
1446 from receives multiple initializations. */
1447 my_friendly_assert (DECL_INITIAL (exp) == NULL_TREE
1448 || DECL_INITIAL (exp) == error_mark_node,
1450 DECL_INITIAL (exp) = init;
1454 else if (init_type == type
1455 && TREE_CODE (init) == COND_EXPR)
1457 /* Push value to be initialized into the cond, where possible.
1458 Avoid spurious warning messages when initializing the
1459 result of this function. */
1460 TREE_OPERAND (init, 1)
1461 = build_modify_expr (exp, INIT_EXPR, TREE_OPERAND (init, 1));
1462 if (exp == DECL_RESULT (current_function_decl))
1463 DECL_INITIAL (exp) = NULL_TREE;
1464 TREE_OPERAND (init, 2)
1465 = build_modify_expr (exp, INIT_EXPR, TREE_OPERAND (init, 2));
1466 if (exp == DECL_RESULT (current_function_decl))
1467 DECL_INITIAL (exp) = init;
1468 TREE_SIDE_EFFECTS (init) = 1;
1469 expand_expr (init, const0_rtx, VOIDmode, 0);
1475 /* We did not know what we were initializing before. Now we do. */
1476 if (TREE_CODE (init) == TARGET_EXPR)
1478 tree tmp = TREE_OPERAND (TREE_OPERAND (init, 1), 1);
1480 if (TREE_CODE (TREE_VALUE (tmp)) == NOP_EXPR
1481 && TREE_OPERAND (TREE_VALUE (tmp), 0) == integer_zero_node)
1483 /* In order for this to work for RESULT_DECLs, if their
1484 type has a constructor, then they must be BLKmode
1485 so that they will be meaningfully addressable. */
1486 tree arg = build_unary_op (ADDR_EXPR, exp, 0);
1487 init = TREE_OPERAND (init, 1);
1488 init = build (CALL_EXPR, build_pointer_type (TREE_TYPE (init)),
1489 TREE_OPERAND (init, 0), TREE_OPERAND (init, 1), 0);
1490 TREE_SIDE_EFFECTS (init) = 1;
1492 TREE_RAISES (init) = ??
1494 TREE_VALUE (TREE_OPERAND (init, 1))
1495 = convert_pointer_to (TREE_TYPE (TREE_TYPE (TREE_VALUE (tmp))), arg);
1499 expand_assignment (current_function_decl, init, 0, 0);
1502 if (exp == DECL_RESULT (current_function_decl))
1504 if (DECL_INITIAL (DECL_RESULT (current_function_decl)))
1505 fatal ("return value from function receives multiple initializations");
1506 DECL_INITIAL (exp) = init;
1508 expand_expr_stmt (init);
1513 if (TREE_CODE (exp) == VAR_DECL
1514 && TREE_CODE (init) == CONSTRUCTOR
1515 && TREE_HAS_CONSTRUCTOR (init))
1517 tree t = store_init_value (exp, init);
1520 expand_decl_init (exp);
1523 t = build (INIT_EXPR, type, exp, init);
1524 TREE_SIDE_EFFECTS (t) = 1;
1525 expand_expr_stmt (t);
1529 /* Handle this case: when calling a constructor: xyzzy foo(bar);
1530 which really means: xyzzy foo = bar; Ugh!
1532 More useful for this case: xyzzy *foo = new xyzzy (bar); */
1534 if (! TYPE_NEEDS_CONSTRUCTING (type) && ! IS_AGGR_TYPE (type))
1536 if (init_list && TREE_CHAIN (init_list))
1538 warning ("initializer list being treated as compound expression");
1539 init = convert (type, build_compound_expr (init_list));
1540 if (init == error_mark_node)
1544 expand_assignment (exp, init, 0, 0);
1548 /* See whether we can go through a type conversion operator.
1549 This wins over going through a non-existent constructor. If
1550 there is a constructor, it is ambiguous. */
1551 if (TREE_CODE (init) != TREE_LIST)
1553 tree ttype = TREE_CODE (init_type) == REFERENCE_TYPE
1554 ? TREE_TYPE (init_type) : init_type;
1556 if (ttype != type && IS_AGGR_TYPE (ttype))
1558 tree rval = build_type_conversion (CONVERT_EXPR, type, init, 0);
1562 /* See if there is a constructor for``type'' that takes a
1563 ``ttype''-typed object. */
1564 tree parms = build_tree_list (NULL_TREE, init);
1565 tree as_cons = NULL_TREE;
1566 if (TYPE_HAS_CONSTRUCTOR (type))
1567 as_cons = build_method_call (exp, constructor_name_full (type),
1569 LOOKUP_SPECULATIVELY|LOOKUP_NO_CONVERSION);
1570 if (as_cons != NULL_TREE && as_cons != error_mark_node)
1571 /* ANSI C++ June 5 1992 WP 12.3.2.6.1 */
1572 cp_error ("ambiguity between conversion to `%T' and constructor",
1575 expand_assignment (exp, rval, 0, 0);
1582 /* Handle default copy constructors here, does not matter if there is
1583 a constructor or not. */
1584 if (type == init_type && IS_AGGR_TYPE (type)
1585 && init && TREE_CODE (init) != TREE_LIST)
1586 expand_default_init (binfo, true_exp, exp, type, init, alias_this, flags);
1587 /* Not sure why this is here... */
1588 else if (TYPE_HAS_CONSTRUCTOR (type))
1589 expand_default_init (binfo, true_exp, exp, type, init, alias_this, flags);
1590 else if (TREE_CODE (type) == ARRAY_TYPE)
1592 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (type)))
1593 expand_vec_init (exp, exp, array_type_nelts (type), init, 0);
1594 else if (TYPE_VIRTUAL_P (TREE_TYPE (type)))
1595 sorry ("arrays of objects with virtual functions but no constructors");
1598 expand_recursive_init (binfo, true_exp, exp, init,
1599 CLASSTYPE_BASE_INIT_LIST (type), alias_this);
1602 /* A pointer which holds the initializer. First call to
1603 expand_aggr_init gets this value pointed to, and sets it to init_null. */
1604 static tree *init_ptr, init_null;
1606 /* Subroutine of expand_recursive_init:
1608 ADDR is the address of the expression being initialized.
1609 INIT_LIST is the cons-list of initializations to be performed.
1610 ALIAS_THIS is its same, lovable self. */
1612 expand_recursive_init_1 (binfo, true_exp, addr, init_list, alias_this)
1613 tree binfo, true_exp, addr;
1619 if (TREE_PURPOSE (init_list))
1621 if (TREE_CODE (TREE_PURPOSE (init_list)) == FIELD_DECL)
1623 tree member = TREE_PURPOSE (init_list);
1624 tree subexp = build_indirect_ref (convert_pointer_to (TREE_VALUE (init_list), addr), NULL_PTR);
1625 tree member_base = build (COMPONENT_REF, TREE_TYPE (member), subexp, member);
1626 if (IS_AGGR_TYPE (TREE_TYPE (member)))
1627 expand_aggr_init (member_base, DECL_INITIAL (member), 0);
1628 else if (TREE_CODE (TREE_TYPE (member)) == ARRAY_TYPE
1629 && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (member)))
1631 member_base = save_expr (default_conversion (member_base));
1632 expand_vec_init (member, member_base,
1633 array_type_nelts (TREE_TYPE (member)),
1634 DECL_INITIAL (member), 0);
1637 expand_expr_stmt (build_modify_expr (member_base, INIT_EXPR, DECL_INITIAL (member)));
1639 else if (TREE_CODE (TREE_PURPOSE (init_list)) == TREE_LIST)
1641 expand_recursive_init_1 (binfo, true_exp, addr, TREE_PURPOSE (init_list), alias_this);
1642 expand_recursive_init_1 (binfo, true_exp, addr, TREE_VALUE (init_list), alias_this);
1644 else if (TREE_CODE (TREE_PURPOSE (init_list)) == ERROR_MARK)
1646 /* Only initialize the virtual function tables if we
1647 are initializing the ultimate users of those vtables. */
1648 if (TREE_VALUE (init_list))
1650 /* We have to ensure that the first argment to
1651 expand_virtual_init is in binfo's hierarchy. */
1652 /* Is it the case that this is exactly the right binfo? */
1653 /* If it is ok, then fixup expand_virtual_init, to make
1655 expand_virtual_init (get_binfo (TREE_VALUE (init_list), binfo, 0),
1657 if (TREE_VALUE (init_list) == binfo
1658 && TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
1659 expand_indirect_vtbls_init (binfo, true_exp, addr, 1);
1663 my_friendly_abort (49);
1665 else if (TREE_VALUE (init_list)
1666 && TREE_CODE (TREE_VALUE (init_list)) == TREE_VEC)
1668 tree subexp = build_indirect_ref (convert_pointer_to (TREE_VALUE (init_list), addr), NULL_PTR);
1669 expand_aggr_init_1 (binfo, true_exp, subexp, *init_ptr,
1670 alias_this && BINFO_OFFSET_ZEROP (TREE_VALUE (init_list)),
1673 /* INIT_PTR is used up. */
1674 init_ptr = &init_null;
1677 my_friendly_abort (50);
1678 init_list = TREE_CHAIN (init_list);
1682 /* Initialize EXP with INIT. Type EXP does not have a constructor,
1683 but it has a baseclass with a constructor or a virtual function
1684 table which needs initializing.
1686 INIT_LIST is a cons-list describing what parts of EXP actually
1687 need to be initialized. INIT is given to the *unique*, first
1688 constructor within INIT_LIST. If there are multiple first
1689 constructors, such as with multiple inheritance, INIT must
1690 be zero or an ambiguity error is reported.
1692 ALIAS_THIS is passed from `expand_aggr_init'. See comments
1696 expand_recursive_init (binfo, true_exp, exp, init, init_list, alias_this)
1697 tree binfo, true_exp, exp, init;
1701 tree *old_init_ptr = init_ptr;
1702 tree addr = build_unary_op (ADDR_EXPR, exp, 0);
1705 if (true_exp == exp && TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
1707 expand_aggr_vbase_init (binfo, exp, addr, init_list);
1708 expand_indirect_vtbls_init (binfo, true_exp, addr, 1);
1710 expand_recursive_init_1 (binfo, true_exp, addr, init_list, alias_this);
1714 tree type = TREE_TYPE (exp);
1716 if (TREE_CODE (type) == REFERENCE_TYPE)
1717 type = TREE_TYPE (type);
1718 if (IS_AGGR_TYPE (type))
1719 cp_error ("unexpected argument to constructor `%T'", type);
1721 error ("unexpected argument to constructor");
1723 init_ptr = old_init_ptr;
1726 /* Report an error if NAME is not the name of a user-defined,
1727 aggregate type. If OR_ELSE is nonzero, give an error message. */
1729 is_aggr_typedef (name, or_else)
1735 if (name == error_mark_node)
1738 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1739 type = IDENTIFIER_TYPE_VALUE (name);
1743 cp_error ("`%T' is not an aggregate typedef", name);
1747 if (! IS_AGGR_TYPE (type)
1748 && TREE_CODE (type) != TEMPLATE_TYPE_PARM)
1751 cp_error ("`%T' is not an aggregate type", type);
1757 /* Like is_aggr_typedef, but returns typedef if successful. */
1759 get_aggr_from_typedef (name, or_else)
1765 if (name == error_mark_node)
1768 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1769 type = IDENTIFIER_TYPE_VALUE (name);
1773 cp_error ("`%T' fails to be an aggregate typedef", name);
1777 if (! IS_AGGR_TYPE (type)
1778 && TREE_CODE (type) != TEMPLATE_TYPE_PARM)
1781 cp_error ("type `%T' is of non-aggregate type", type);
1788 get_type_value (name)
1791 if (name == error_mark_node)
1794 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1795 return IDENTIFIER_TYPE_VALUE (name);
1801 /* This code could just as well go in `class.c', but is placed here for
1804 /* For an expression of the form CNAME :: NAME (PARMLIST), build
1805 the appropriate function call. */
1807 build_member_call (cname, name, parmlist)
1808 tree cname, name, parmlist;
1811 tree method_name = name;
1813 int dont_use_this = 0;
1814 tree basetype_path, decl;
1816 if (TREE_CODE (method_name) == BIT_NOT_EXPR)
1818 method_name = TREE_OPERAND (method_name, 0);
1822 if (TREE_CODE (cname) == SCOPE_REF)
1823 cname = resolve_scope_to_name (NULL_TREE, cname);
1825 if (cname == NULL_TREE || ! (type = get_aggr_from_typedef (cname, 1)))
1826 return error_mark_node;
1828 /* An operator we did not like. */
1829 if (name == NULL_TREE)
1830 return error_mark_node;
1835 /* Everything can explicitly call a destructor; see 12.4 */
1836 if (! TYPE_HAS_DESTRUCTOR (type))
1837 cp_error ("type `%#T' does not have a destructor", type);
1840 cp_error ("cannot call destructor `%T::~%T' without object", type,
1842 return error_mark_node;
1845 /* No object? Then just fake one up, and let build_method_call
1846 figure out what to do. */
1847 if (current_class_type == 0
1848 || get_base_distance (type, current_class_type, 0, &basetype_path) == -1)
1853 basetype_path = TYPE_BINFO (type);
1854 decl = build1 (NOP_EXPR, TYPE_POINTER_TO (type), error_mark_node);
1856 else if (current_class_decl == 0)
1859 decl = build1 (NOP_EXPR, TYPE_POINTER_TO (type), error_mark_node);
1863 tree olddecl = current_class_decl;
1864 tree oldtype = TREE_TYPE (TREE_TYPE (olddecl));
1865 if (oldtype != type)
1867 tree newtype = build_type_variant (type, TYPE_READONLY (oldtype),
1868 TYPE_VOLATILE (oldtype));
1869 decl = convert_force (TYPE_POINTER_TO (newtype), olddecl);
1875 decl = build_indirect_ref (decl, NULL_PTR);
1877 if (t = lookup_fnfields (basetype_path, method_name, 0))
1878 return build_method_call (decl, method_name, parmlist, basetype_path,
1879 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL);
1880 if (TREE_CODE (name) == IDENTIFIER_NODE
1881 && ((t = lookup_field (TYPE_BINFO (type), name, 1, 0))))
1883 if (t == error_mark_node)
1884 return error_mark_node;
1885 if (TREE_CODE (t) == FIELD_DECL)
1889 cp_error ("invalid use of non-static field `%D'", t);
1890 return error_mark_node;
1892 decl = build (COMPONENT_REF, TREE_TYPE (t), decl, t);
1894 else if (TREE_CODE (t) == VAR_DECL)
1898 cp_error ("invalid use of member `%D'", t);
1899 return error_mark_node;
1901 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl))
1902 && TYPE_OVERLOADS_CALL_EXPR (TREE_TYPE (decl)))
1903 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, decl, parmlist, NULL_TREE);
1904 return build_function_call (decl, parmlist);
1908 cp_error ("no method `%T::%D'", type, name);
1909 return error_mark_node;
1913 /* Build a reference to a member of an aggregate. This is not a
1914 C++ `&', but really something which can have its address taken,
1915 and then act as a pointer to member, for example CNAME :: FIELD
1916 can have its address taken by saying & CNAME :: FIELD.
1918 @@ Prints out lousy diagnostics for operator <typename>
1921 @@ This function should be rewritten and placed in search.c. */
1923 build_offset_ref (cname, name)
1926 tree decl, type, fnfields, fields, t = error_mark_node;
1927 tree basetypes = NULL_TREE;
1930 if (TREE_CODE (cname) == SCOPE_REF)
1931 cname = resolve_scope_to_name (NULL_TREE, cname);
1933 if (cname == NULL_TREE || ! is_aggr_typedef (cname, 1))
1934 return error_mark_node;
1936 type = IDENTIFIER_TYPE_VALUE (cname);
1938 if (TREE_CODE (name) == BIT_NOT_EXPR)
1941 name = TREE_OPERAND (name, 0);
1944 if (TYPE_SIZE (type) == 0)
1946 t = IDENTIFIER_CLASS_VALUE (name);
1949 cp_error ("incomplete type `%T' does not have member `%D'", type,
1951 return error_mark_node;
1953 if (TREE_CODE (t) == TYPE_DECL || TREE_CODE (t) == VAR_DECL
1954 || TREE_CODE (t) == CONST_DECL)
1959 if (TREE_CODE (t) == FIELD_DECL)
1960 sorry ("use of member in incomplete aggregate type");
1961 else if (TREE_CODE (t) == FUNCTION_DECL)
1962 sorry ("use of member function in incomplete aggregate type");
1964 my_friendly_abort (52);
1965 return error_mark_node;
1969 if (TREE_CODE (name) == TYPE_EXPR)
1970 /* Pass a TYPE_DECL to build_component_type_expr. */
1971 return build_component_type_expr (TYPE_NAME (TREE_TYPE (cname)),
1972 name, NULL_TREE, 1);
1975 fnfields = lookup_fnfields (TYPE_BINFO (type), name, 1);
1976 fields = lookup_field (type, name, 0, 0);
1978 if (fields == error_mark_node || fnfields == error_mark_node)
1979 return error_mark_node;
1981 if (current_class_type == 0
1982 || get_base_distance (type, current_class_type, 0, &basetypes) == -1)
1984 basetypes = TYPE_BINFO (type);
1985 decl = build1 (NOP_EXPR,
1986 IDENTIFIER_TYPE_VALUE (cname),
1989 else if (current_class_decl == 0)
1990 decl = build1 (NOP_EXPR, IDENTIFIER_TYPE_VALUE (cname),
1995 /* A lot of this logic is now handled in lookup_field and
1999 basetypes = TREE_PURPOSE (fnfields);
2001 /* Go from the TREE_BASELINK to the member function info. */
2002 t = TREE_VALUE (fnfields);
2006 if (DECL_FIELD_CONTEXT (fields) == DECL_FIELD_CONTEXT (t))
2008 error ("ambiguous member reference: member `%s' defined as both field and function",
2009 IDENTIFIER_POINTER (name));
2010 return error_mark_node;
2012 if (UNIQUELY_DERIVED_FROM_P (DECL_FIELD_CONTEXT (fields), DECL_FIELD_CONTEXT (t)))
2014 else if (UNIQUELY_DERIVED_FROM_P (DECL_FIELD_CONTEXT (t), DECL_FIELD_CONTEXT (fields)))
2018 error ("ambiguous member reference: member `%s' derives from distinct classes in multiple inheritance lattice");
2019 return error_mark_node;
2023 if (t == TREE_VALUE (fnfields))
2025 extern int flag_save_memoized_contexts;
2027 /* This does not handle access checking yet. */
2028 if (DECL_CHAIN (t) == NULL_TREE || dtor)
2030 enum access_type access;
2032 /* unique functions are handled easily. */
2034 access = compute_access (basetypes, t);
2035 if (access == access_protected)
2037 cp_error_at ("member function `%#D' is protected", t);
2038 error ("in this context");
2039 return error_mark_node;
2041 if (access == access_private)
2043 cp_error_at ("member function `%#D' is private", t);
2044 error ("in this context");
2045 return error_mark_node;
2047 assemble_external (t);
2048 return build (OFFSET_REF, TREE_TYPE (t), decl, t);
2051 /* overloaded functions may need more work. */
2054 if (TYPE_HAS_DESTRUCTOR (type)
2055 && DECL_CHAIN (DECL_CHAIN (t)) == NULL_TREE)
2061 /* FNFIELDS is most likely allocated on the search_obstack,
2062 which will go away after this class scope. If we need
2063 to save this value for later (either for memoization
2064 or for use as an initializer for a static variable), then
2067 ??? The smart thing to do for the case of saving initializers
2068 is to resolve them before we're done with this scope. */
2069 if (!TREE_PERMANENT (fnfields)
2070 && ((flag_save_memoized_contexts && global_bindings_p ())
2071 || ! allocation_temporary_p ()))
2072 fnfields = copy_list (fnfields);
2073 t = build_tree_list (error_mark_node, fnfields);
2074 TREE_TYPE (t) = build_offset_type (type, unknown_type_node);
2079 /* Now that we know we are looking for a field, see if we
2080 have access to that field. Lookup_field will give us the
2083 t = lookup_field (basetypes, name, 1, 0);
2085 if (t == error_mark_node)
2086 return error_mark_node;
2090 cp_error ("`%D' is not a member of type `%T'", name, type);
2091 return error_mark_node;
2094 if (TREE_CODE (t) == TYPE_DECL)
2099 /* static class members and class-specific enum
2100 values can be returned without further ado. */
2101 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == CONST_DECL)
2103 assemble_external (t);
2108 /* static class functions too. */
2109 if (TREE_CODE (t) == FUNCTION_DECL && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
2110 my_friendly_abort (53);
2112 /* In member functions, the form `cname::name' is no longer
2113 equivalent to `this->cname::name'. */
2114 return build (OFFSET_REF, build_offset_type (type, TREE_TYPE (t)), decl, t);
2117 /* Given an object EXP and a member function reference MEMBER,
2118 return the address of the actual member function. */
2120 get_member_function (exp_addr_ptr, exp, member)
2124 tree ctype = TREE_TYPE (exp);
2125 tree function = save_expr (build_unary_op (ADDR_EXPR, member, 0));
2127 if (TYPE_VIRTUAL_P (ctype)
2128 || (flag_all_virtual == 1 && TYPE_OVERLOADS_METHOD_CALL_EXPR (ctype)))
2133 /* Save away the unadulterated `this' pointer. */
2134 exp_addr = save_expr (*exp_addr_ptr);
2136 /* Cast function to signed integer. */
2137 e0 = build1 (NOP_EXPR, integer_type_node, function);
2139 /* There is a hack here that takes advantage of
2140 twos complement arithmetic, and the fact that
2141 there are more than one UNITS to the WORD.
2142 If the high bit is set for the `function',
2143 then we pretend it is a virtual function,
2144 and the array indexing will knock this bit
2145 out the top, leaving a valid index. */
2146 if (UNITS_PER_WORD <= 1)
2147 my_friendly_abort (54);
2149 e1 = build (GT_EXPR, integer_type_node, e0, integer_zero_node);
2150 e1 = build_compound_expr (tree_cons (NULL_TREE, exp_addr,
2151 build_tree_list (NULL_TREE, e1)));
2152 e1 = save_expr (e1);
2154 if (TREE_SIDE_EFFECTS (*exp_addr_ptr))
2156 exp = build_indirect_ref (exp_addr, NULL_PTR);
2157 *exp_addr_ptr = exp_addr;
2160 /* This is really hairy: if the function pointer is a pointer
2161 to a non-virtual member function, then we can't go mucking
2162 with the `this' pointer (any more than we already have to
2163 this point). If it is a pointer to a virtual member function,
2164 then we have to adjust the `this' pointer according to
2165 what the virtual function table tells us. */
2167 e3 = build_vfn_ref (exp_addr_ptr, exp, e0);
2168 my_friendly_assert (e3 != error_mark_node, 213);
2170 /* Change this pointer type from `void *' to the
2171 type it is really supposed to be. */
2172 TREE_TYPE (e3) = TREE_TYPE (function);
2174 /* If non-virtual, use what we had originally. Otherwise,
2175 use the value we get from the virtual function table. */
2176 *exp_addr_ptr = build_conditional_expr (e1, exp_addr, *exp_addr_ptr);
2178 function = build_conditional_expr (e1, function, e3);
2180 return build_indirect_ref (function, NULL_PTR);
2183 /* If a OFFSET_REF made it through to here, then it did
2184 not have its address taken. */
2187 resolve_offset_ref (exp)
2190 tree type = TREE_TYPE (exp);
2191 tree base = NULL_TREE;
2193 tree basetype, addr;
2195 if (TREE_CODE (exp) == TREE_LIST)
2196 return build_unary_op (ADDR_EXPR, exp, 0);
2198 if (TREE_CODE (exp) != OFFSET_REF)
2200 my_friendly_assert (TREE_CODE (type) == OFFSET_TYPE, 214);
2201 if (TYPE_OFFSET_BASETYPE (type) != current_class_type)
2203 error ("object missing in use of pointer-to-member construct");
2204 return error_mark_node;
2207 type = TREE_TYPE (type);
2212 member = TREE_OPERAND (exp, 1);
2213 base = TREE_OPERAND (exp, 0);
2216 if ((TREE_CODE (member) == VAR_DECL
2217 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
2218 || TREE_CODE (TREE_TYPE (member)) == FUNCTION_TYPE)
2220 /* These were static members. */
2221 if (mark_addressable (member) == 0)
2222 return error_mark_node;
2226 /* Syntax error can cause a member which should
2227 have been seen as static to be grok'd as non-static. */
2228 if (TREE_CODE (member) == FIELD_DECL && C_C_D == NULL_TREE)
2230 if (TREE_ADDRESSABLE (member) == 0)
2232 cp_error_at ("member `%D' is non-static in static member function context", member);
2233 error ("at this point in file");
2234 TREE_ADDRESSABLE (member) = 1;
2236 return error_mark_node;
2239 /* The first case is really just a reference to a member of `this'. */
2240 if (TREE_CODE (member) == FIELD_DECL
2242 || (TREE_CODE (base) == NOP_EXPR
2243 && TREE_OPERAND (base, 0) == error_mark_node)))
2246 enum access_type access;
2248 if (TREE_CODE (exp) == OFFSET_REF && TREE_CODE (type) == OFFSET_TYPE)
2249 basetype = TYPE_OFFSET_BASETYPE (type);
2251 basetype = DECL_CONTEXT (member);
2253 base = current_class_decl;
2255 if (get_base_distance (basetype, TREE_TYPE (TREE_TYPE (base)), 0, &basetype_path) < 0)
2257 error_not_base_type (basetype, TREE_TYPE (TREE_TYPE (base)));
2258 return error_mark_node;
2260 addr = convert_pointer_to (basetype, base);
2261 access = compute_access (basetype_path, member);
2262 if (access == access_public)
2263 return build (COMPONENT_REF, TREE_TYPE (member),
2264 build_indirect_ref (addr, NULL_PTR), member);
2265 if (access == access_protected)
2267 cp_error_at ("member `%D' is protected", member);
2268 error ("in this context");
2269 return error_mark_node;
2271 if (access == access_private)
2273 cp_error_at ("member `%D' is private", member);
2274 error ("in this context");
2275 return error_mark_node;
2277 my_friendly_abort (55);
2280 /* If this is a reference to a member function, then return
2281 the address of the member function (which may involve going
2282 through the object's vtable), otherwise, return an expression
2283 for the dereferenced pointer-to-member construct. */
2284 addr = build_unary_op (ADDR_EXPR, base, 0);
2286 if (TREE_CODE (TREE_TYPE (member)) == METHOD_TYPE)
2288 basetype = DECL_CLASS_CONTEXT (member);
2289 addr = convert_pointer_to (basetype, addr);
2290 return build_unary_op (ADDR_EXPR, get_member_function (&addr, build_indirect_ref (addr, NULL_PTR), member), 0);
2292 else if (TREE_CODE (TREE_TYPE (member)) == OFFSET_TYPE)
2294 basetype = TYPE_OFFSET_BASETYPE (TREE_TYPE (member));
2295 addr = convert_pointer_to (basetype, addr);
2296 member = convert (ptr_type_node, build_unary_op (ADDR_EXPR, member, 0));
2297 return build1 (INDIRECT_REF, type,
2298 build (PLUS_EXPR, ptr_type_node, addr, member));
2300 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
2302 return get_member_function_from_ptrfunc (&addr, base, member);
2304 my_friendly_abort (56);
2309 /* Return either DECL or its known constant value (if it has one). */
2312 decl_constant_value (decl)
2315 if (! TREE_THIS_VOLATILE (decl)
2317 /* These may be necessary for C, but they break C++. */
2318 ! TREE_PUBLIC (decl)
2319 /* Don't change a variable array bound or initial value to a constant
2320 in a place where a variable is invalid. */
2323 && DECL_INITIAL (decl) != 0
2324 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
2325 /* This is invalid if initial value is not constant.
2326 If it has either a function call, a memory reference,
2327 or a variable, then re-evaluating it could give different results. */
2328 && TREE_CONSTANT (DECL_INITIAL (decl))
2329 /* Check for cases where this is sub-optimal, even though valid. */
2330 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR
2332 /* We must allow this to work outside of functions so that
2333 static constants can be used for array sizes. */
2334 && current_function_decl != 0
2335 && DECL_MODE (decl) != BLKmode
2338 return DECL_INITIAL (decl);
2342 /* Friend handling routines. */
2343 /* Friend data structures:
2345 Lists of friend functions come from TYPE_DECL nodes. Since all
2346 aggregate types are automatically typedef'd, these nodes are guaranteed
2349 The TREE_PURPOSE of a friend list is the name of the friend,
2350 and its TREE_VALUE is another list.
2352 For each element of that list, either the TREE_VALUE or the TREE_PURPOSE
2353 will be filled in, but not both. The TREE_VALUE of that list is an
2354 individual function which is a friend. The TREE_PURPOSE of that list
2355 indicates a type in which all functions by that name are friends.
2357 Lists of friend classes come from _TYPE nodes. Love that consistency
2361 is_friend_type (type1, type2)
2364 return is_friend (type1, type2);
2368 is_friend (type, supplicant)
2369 tree type, supplicant;
2374 if (supplicant == NULL_TREE || type == NULL_TREE)
2377 declp = (TREE_CODE_CLASS (TREE_CODE (supplicant)) == 'd');
2380 /* It's a function decl. */
2382 tree list = DECL_FRIENDLIST (TYPE_NAME (type));
2383 tree name = DECL_NAME (supplicant);
2384 tree ctype = DECL_CLASS_CONTEXT (supplicant);
2385 for (; list ; list = TREE_CHAIN (list))
2387 if (name == TREE_PURPOSE (list))
2389 tree friends = TREE_VALUE (list);
2390 name = DECL_ASSEMBLER_NAME (supplicant);
2391 for (; friends ; friends = TREE_CHAIN (friends))
2393 if (ctype == TREE_PURPOSE (friends))
2395 if (name == DECL_ASSEMBLER_NAME (TREE_VALUE (friends)))
2405 if (type == supplicant)
2408 list = CLASSTYPE_FRIEND_CLASSES (TREE_TYPE (TYPE_NAME (type)));
2409 for (; list ; list = TREE_CHAIN (list))
2410 if (supplicant == TREE_VALUE (list))
2415 tree context = declp ? DECL_CLASS_CONTEXT (supplicant)
2416 : DECL_CONTEXT (TYPE_NAME (supplicant));
2419 return is_friend (type, context);
2425 /* Add a new friend to the friends of the aggregate type TYPE.
2426 DECL is the FUNCTION_DECL of the friend being added. */
2428 add_friend (type, decl)
2431 tree typedecl = TYPE_NAME (type);
2432 tree list = DECL_FRIENDLIST (typedecl);
2433 tree name = DECL_NAME (decl);
2437 if (name == TREE_PURPOSE (list))
2439 tree friends = TREE_VALUE (list);
2440 for (; friends ; friends = TREE_CHAIN (friends))
2442 if (decl == TREE_VALUE (friends))
2444 cp_pedwarn ("`%D' is already a friend of class `%T'",
2446 cp_pedwarn_at ("previous friend declaration of `%D'",
2447 TREE_VALUE (friends));
2451 TREE_VALUE (list) = tree_cons (error_mark_node, decl,
2455 list = TREE_CHAIN (list);
2457 DECL_FRIENDLIST (typedecl)
2458 = tree_cons (DECL_NAME (decl), build_tree_list (error_mark_node, decl),
2459 DECL_FRIENDLIST (typedecl));
2460 if (DECL_NAME (decl) == ansi_opname[(int) MODIFY_EXPR])
2462 tree parmtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
2463 TYPE_HAS_ASSIGNMENT (TREE_TYPE (typedecl)) = 1;
2464 if (parmtypes && TREE_CHAIN (parmtypes))
2466 tree parmtype = TREE_VALUE (TREE_CHAIN (parmtypes));
2467 if (TREE_CODE (parmtype) == REFERENCE_TYPE
2468 && TREE_TYPE (parmtypes) == TREE_TYPE (typedecl))
2469 TYPE_HAS_ASSIGN_REF (TREE_TYPE (typedecl)) = 1;
2474 /* Declare that every member function NAME in FRIEND_TYPE
2475 (which may be NULL_TREE) is a friend of type TYPE. */
2477 add_friends (type, name, friend_type)
2478 tree type, name, friend_type;
2480 tree typedecl = TYPE_NAME (type);
2481 tree list = DECL_FRIENDLIST (typedecl);
2485 if (name == TREE_PURPOSE (list))
2487 tree friends = TREE_VALUE (list);
2488 while (friends && TREE_PURPOSE (friends) != friend_type)
2489 friends = TREE_CHAIN (friends);
2492 warning ("method `%s::%s' is already a friend of class",
2493 TYPE_NAME_STRING (friend_type),
2494 IDENTIFIER_POINTER (name));
2496 warning ("function `%s' is already a friend of class `%s'",
2497 IDENTIFIER_POINTER (name),
2498 IDENTIFIER_POINTER (DECL_NAME (typedecl)));
2500 TREE_VALUE (list) = tree_cons (friend_type, NULL_TREE,
2504 list = TREE_CHAIN (list);
2506 DECL_FRIENDLIST (typedecl) =
2508 build_tree_list (friend_type, NULL_TREE),
2509 DECL_FRIENDLIST (typedecl));
2510 if (! strncmp (IDENTIFIER_POINTER (name),
2511 IDENTIFIER_POINTER (ansi_opname[(int) MODIFY_EXPR]),
2512 strlen (IDENTIFIER_POINTER (ansi_opname[(int) MODIFY_EXPR]))))
2514 TYPE_HAS_ASSIGNMENT (TREE_TYPE (typedecl)) = 1;
2515 sorry ("declaring \"friend operator =\" will not find \"operator = (X&)\" if it exists");
2519 /* Set up a cross reference so that type TYPE will make member function
2520 CTYPE::DECL a friend when CTYPE is finally defined. For more than
2521 one, set up a cross reference so that functions with the name DECL
2522 and type CTYPE know that they are friends of TYPE. */
2524 xref_friend (type, decl, ctype)
2525 tree type, decl, ctype;
2527 tree friend_decl = TYPE_NAME (ctype);
2529 tree typedecl = TYPE_NAME (type);
2530 tree t = tree_cons (NULL_TREE, ctype, DECL_UNDEFINED_FRIENDS (typedecl));
2532 DECL_UNDEFINED_FRIENDS (typedecl) = t;
2536 SET_DECL_WAITING_FRIENDS (friend_decl,
2538 DECL_WAITING_FRIENDS (friend_decl)));
2539 TREE_TYPE (DECL_WAITING_FRIENDS (friend_decl)) = decl;
2542 /* Make FRIEND_TYPE a friend class to TYPE. If FRIEND_TYPE has already
2543 been defined, we make all of its member functions friends of
2544 TYPE. If not, we make it a pending friend, which can later be added
2545 when its definition is seen. If a type is defined, then its TYPE_DECL's
2546 DECL_UNDEFINED_FRIENDS contains a (possibly empty) list of friend
2547 classes that are not defined. If a type has not yet been defined,
2548 then the DECL_WAITING_FRIENDS contains a list of types
2549 waiting to make it their friend. Note that these two can both
2550 be in use at the same time! */
2552 make_friend_class (type, friend_type)
2553 tree type, friend_type;
2557 if (IS_SIGNATURE (type))
2559 error ("`friend' declaration in signature definition");
2562 if (IS_SIGNATURE (friend_type))
2564 error ("signature type `%s' declared `friend'",
2565 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (friend_type))));
2568 if (type == friend_type)
2570 warning ("class `%s' is implicitly friends with itself",
2571 TYPE_NAME_STRING (type));
2575 GNU_xref_hier (TYPE_NAME_STRING (type),
2576 TYPE_NAME_STRING (friend_type), 0, 0, 1);
2578 classes = CLASSTYPE_FRIEND_CLASSES (type);
2579 while (classes && TREE_VALUE (classes) != friend_type)
2580 classes = TREE_CHAIN (classes);
2582 warning ("class `%s' is already friends with class `%s'",
2583 TYPE_NAME_STRING (TREE_VALUE (classes)), TYPE_NAME_STRING (type));
2586 CLASSTYPE_FRIEND_CLASSES (type)
2587 = tree_cons (NULL_TREE, friend_type, CLASSTYPE_FRIEND_CLASSES (type));
2591 /* Main friend processor. This is large, and for modularity purposes,
2592 has been removed from grokdeclarator. It returns `void_type_node'
2593 to indicate that something happened, though a FIELD_DECL is
2596 CTYPE is the class this friend belongs to.
2598 DECLARATOR is the name of the friend.
2600 DECL is the FUNCTION_DECL that the friend is.
2602 In case we are parsing a friend which is part of an inline
2603 definition, we will need to store PARM_DECL chain that comes
2604 with it into the DECL_ARGUMENTS slot of the FUNCTION_DECL.
2606 FLAGS is just used for `grokclassfn'.
2608 QUALS say what special qualifies should apply to the object
2609 pointed to by `this'. */
2611 do_friend (ctype, declarator, decl, parmdecls, flags, quals)
2612 tree ctype, declarator, decl, parmdecls;
2613 enum overload_flags flags;
2616 /* first, lets find out if what we are making a friend needs overloading */
2618 int was_c_linkage = 0;
2620 /* Every decl that gets here is a friend of something. */
2621 DECL_FRIEND_P (decl) = 1;
2623 /* If we find something in scope, let see if it has extern "C" linkage. */
2624 /* This code is pretty general and should be ripped out and reused
2625 as a separate function. */
2626 if (DECL_NAME (decl))
2628 previous_decl = lookup_name (DECL_NAME (decl), 0);
2629 if (previous_decl && TREE_CODE (previous_decl) == TREE_LIST)
2633 if (TREE_TYPE (TREE_VALUE (previous_decl)) == TREE_TYPE (decl))
2635 previous_decl = TREE_VALUE (previous_decl);
2638 previous_decl = TREE_CHAIN (previous_decl);
2640 while (previous_decl);
2643 /* It had extern "C" linkage, so don't overload this. */
2644 if (previous_decl && TREE_CODE (previous_decl) == FUNCTION_DECL
2645 && TREE_TYPE (decl) == TREE_TYPE (previous_decl)
2646 && DECL_LANGUAGE (previous_decl) == lang_c)
2652 tree cname = TYPE_NAME (ctype);
2653 if (TREE_CODE (cname) == TYPE_DECL)
2654 cname = DECL_NAME (cname);
2656 /* A method friend. */
2657 if (TREE_CODE (decl) == FUNCTION_DECL)
2659 if (flags == NO_SPECIAL && ctype && declarator == cname)
2660 DECL_CONSTRUCTOR_P (decl) = 1;
2662 /* This will set up DECL_ARGUMENTS for us. */
2663 grokclassfn (ctype, cname, decl, flags, quals);
2664 if (TYPE_SIZE (ctype) != 0)
2665 check_classfn (ctype, cname, decl);
2667 if (TREE_TYPE (decl) != error_mark_node)
2669 if (TYPE_SIZE (ctype))
2671 /* We don't call pushdecl here yet, or ever on this
2672 actual FUNCTION_DECL. We must preserve its TREE_CHAIN
2674 make_decl_rtl (decl, NULL_PTR, 1);
2675 add_friend (current_class_type, decl);
2679 register char *classname
2680 = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (ctype)));
2682 error ("member declared as friend before type `%s' defined",
2689 /* Possibly a bunch of method friends. */
2691 /* Get the class they belong to. */
2692 tree ctype = IDENTIFIER_TYPE_VALUE (cname);
2694 /* This class is defined, use its methods now. */
2695 if (TYPE_SIZE (ctype))
2697 tree fields = lookup_fnfields (TYPE_BINFO (ctype), declarator, 0);
2699 add_friends (current_class_type, declarator, ctype);
2701 error ("method `%s' is not a member of class `%s'",
2702 IDENTIFIER_POINTER (declarator),
2703 IDENTIFIER_POINTER (cname));
2706 /* Note: DECLARATOR actually has more than one; in this
2707 case, we're making sure that fns with the name DECLARATOR
2708 and type CTYPE know they are friends of the current
2710 xref_friend (current_class_type, declarator, ctype);
2711 decl = void_type_node;
2714 /* never overload C functions */
2715 else if (TREE_CODE (decl) == FUNCTION_DECL
2716 && ((IDENTIFIER_LENGTH (declarator) == 4
2717 && IDENTIFIER_POINTER (declarator)[0] == 'm'
2718 && ! strcmp (IDENTIFIER_POINTER (declarator), "main"))
2719 || (IDENTIFIER_LENGTH (declarator) > 10
2720 && IDENTIFIER_POINTER (declarator)[0] == '_'
2721 && IDENTIFIER_POINTER (declarator)[1] == '_'
2722 && strncmp (IDENTIFIER_POINTER (declarator)+2,
2723 "builtin_", 8) == 0)
2726 /* raw "main", and builtin functions never gets overloaded,
2727 but they can become friends. */
2728 TREE_PUBLIC (decl) = 1;
2729 add_friend (current_class_type, decl);
2730 DECL_FRIEND_P (decl) = 1;
2731 decl = void_type_node;
2734 @@ or possibly a friend from a base class ?!? */
2735 else if (TREE_CODE (decl) == FUNCTION_DECL)
2737 /* Friends must all go through the overload machinery,
2738 even though they may not technically be overloaded.
2740 Note that because classes all wind up being top-level
2741 in their scope, their friend wind up in top-level scope as well. */
2742 DECL_ASSEMBLER_NAME (decl)
2743 = build_decl_overload (declarator, TYPE_ARG_TYPES (TREE_TYPE (decl)),
2744 TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
2745 DECL_ARGUMENTS (decl) = parmdecls;
2746 DECL_CLASS_CONTEXT (decl) = current_class_type;
2748 /* We can call pushdecl here, because the TREE_CHAIN of this
2749 FUNCTION_DECL is not needed for other purposes. */
2750 decl = pushdecl (decl);
2752 make_decl_rtl (decl, NULL_PTR, 1);
2753 add_friend (current_class_type, decl);
2755 DECL_FRIEND_P (decl) = 1;
2757 TREE_OVERLOADED (declarator) = 1;
2762 /* @@ Should be able to ingest later definitions of this function
2764 tree decl = lookup_name_nonclass (declarator);
2765 if (decl == NULL_TREE)
2767 warning ("implicitly declaring `%s' as struct",
2768 IDENTIFIER_POINTER (declarator));
2769 decl = xref_tag (record_type_node, declarator, NULL_TREE, 1);
2770 decl = TYPE_NAME (decl);
2773 /* Allow abbreviated declarations of overloaded functions,
2774 but not if those functions are really class names. */
2775 if (TREE_CODE (decl) == TREE_LIST && TREE_TYPE (TREE_PURPOSE (decl)))
2777 warning ("`friend %s' archaic, use `friend class %s' instead",
2778 IDENTIFIER_POINTER (declarator),
2779 IDENTIFIER_POINTER (declarator));
2780 decl = TREE_TYPE (TREE_PURPOSE (decl));
2783 if (TREE_CODE (decl) == TREE_LIST)
2784 add_friends (current_class_type, TREE_PURPOSE (decl), NULL_TREE);
2786 make_friend_class (current_class_type, TREE_TYPE (decl));
2787 decl = void_type_node;
2792 /* TYPE has now been defined. It may, however, have a number of things
2793 waiting make make it their friend. We resolve these references
2796 embrace_waiting_friends (type)
2799 tree decl = TYPE_NAME (type);
2802 if (TREE_CODE (decl) != TYPE_DECL)
2805 for (waiters = DECL_WAITING_FRIENDS (decl); waiters;
2806 waiters = TREE_CHAIN (waiters))
2808 tree waiter = TREE_PURPOSE (waiters);
2810 tree waiter_prev = TREE_VALUE (waiters);
2812 tree decl = TREE_TYPE (waiters);
2813 tree name = decl ? (TREE_CODE (decl) == IDENTIFIER_NODE
2814 ? decl : DECL_NAME (decl)) : NULL_TREE;
2817 /* @@ There may be work to be done since we have not verified
2818 @@ consistency between original and friend declarations
2819 @@ of the functions waiting to become friends. */
2820 tree field = lookup_fnfields (TYPE_BINFO (type), name, 0);
2823 add_friends (waiter, name, type);
2825 add_friend (waiter, decl);
2827 error_with_file_and_line (DECL_SOURCE_FILE (TYPE_NAME (waiter)),
2828 DECL_SOURCE_LINE (TYPE_NAME (waiter)),
2829 "no method `%s' defined in class `%s' to be friend",
2830 IDENTIFIER_POINTER (DECL_NAME (TREE_TYPE (waiters))),
2831 TYPE_NAME_STRING (type));
2834 make_friend_class (type, waiter);
2837 if (TREE_CHAIN (waiter_prev))
2838 TREE_CHAIN (waiter_prev) = TREE_CHAIN (TREE_CHAIN (waiter_prev));
2840 DECL_UNDEFINED_FRIENDS (TYPE_NAME (waiter)) = NULL_TREE;
2845 /* Common subroutines of build_new and build_vec_delete. */
2847 /* Common interface for calling "builtin" functions that are not
2851 build_builtin_call (type, node, arglist)
2856 tree rval = build (CALL_EXPR, type, node, arglist, 0);
2857 TREE_SIDE_EFFECTS (rval) = 1;
2858 assemble_external (TREE_OPERAND (node, 0));
2859 TREE_USED (TREE_OPERAND (node, 0)) = 1;
2863 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
2864 (which needs to go through some sort of groktypename) or it
2865 is the name of the class we are newing. INIT is an initialization value.
2866 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
2867 If INIT is void_type_node, it means do *not* call a constructor
2870 For types with constructors, the data returned is initialized
2871 by the appropriate constructor.
2873 Whether the type has a constructor or not, if it has a pointer
2874 to a virtual function table, then that pointer is set up
2877 Unless I am mistaken, a call to new () will return initialized
2878 data regardless of whether the constructor itself is private or
2879 not. NOPE; new fails if the constructor is private (jcm).
2881 Note that build_new does nothing to assure that any special
2882 alignment requirements of the type are met. Rather, it leaves
2883 it up to malloc to do the right thing. Otherwise, folding to
2884 the right alignment cal cause problems if the user tries to later
2885 free the memory returned by `new'.
2887 PLACEMENT is the `placement' list for user-defined operator new (). */
2890 build_new (placement, decl, init, use_global_new)
2895 tree type, true_type, size, rval;
2898 enum tree_code code = NEW_EXPR;
2900 tree pending_sizes = NULL_TREE;
2902 if (decl == error_mark_node)
2903 return error_mark_node;
2905 if (TREE_CODE (decl) == TREE_LIST)
2907 tree absdcl = TREE_VALUE (decl);
2908 tree last_absdcl = NULL_TREE;
2909 int old_immediate_size_expand;
2911 if (current_function_decl
2912 && DECL_CONSTRUCTOR_P (current_function_decl))
2914 old_immediate_size_expand = immediate_size_expand;
2915 immediate_size_expand = 0;
2918 nelts = integer_one_node;
2920 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
2921 my_friendly_abort (215);
2922 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
2924 last_absdcl = absdcl;
2925 absdcl = TREE_OPERAND (absdcl, 0);
2928 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
2930 /* probably meant to be a vec new */
2933 while (TREE_OPERAND (absdcl, 0)
2934 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
2936 last_absdcl = absdcl;
2937 absdcl = TREE_OPERAND (absdcl, 0);
2941 this_nelts = TREE_OPERAND (absdcl, 1);
2942 if (this_nelts != error_mark_node)
2944 if (this_nelts == NULL_TREE)
2945 error ("new of array type fails to specify size");
2948 this_nelts = save_expr (convert (sizetype, this_nelts));
2949 absdcl = TREE_OPERAND (absdcl, 0);
2950 if (this_nelts == integer_zero_node)
2952 warning ("zero size array reserves no space");
2953 nelts = integer_zero_node;
2956 nelts = build_binary_op (MULT_EXPR, nelts, this_nelts, 1);
2960 nelts = integer_zero_node;
2964 TREE_OPERAND (last_absdcl, 0) = absdcl;
2966 TREE_VALUE (decl) = absdcl;
2968 type = true_type = groktypename (decl);
2969 if (! type || type == error_mark_node)
2971 immediate_size_expand = old_immediate_size_expand;
2972 return error_mark_node;
2975 if (current_function_decl
2976 && DECL_CONSTRUCTOR_P (current_function_decl))
2978 pending_sizes = get_pending_sizes ();
2979 immediate_size_expand = old_immediate_size_expand;
2982 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
2984 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
2986 /* An aggregate type. */
2987 type = IDENTIFIER_TYPE_VALUE (decl);
2988 decl = TYPE_NAME (type);
2992 /* A builtin type. */
2993 decl = lookup_name (decl, 1);
2994 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
2995 type = TREE_TYPE (decl);
2999 else if (TREE_CODE (decl) == TYPE_DECL)
3001 type = TREE_TYPE (decl);
3008 decl = TYPE_NAME (type);
3011 /* ``A reference cannot be created by the new operator. A reference
3012 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3013 returned by new.'' ARM 5.3.3 */
3014 if (TREE_CODE (type) == REFERENCE_TYPE)
3016 error ("new cannot be applied to a reference type");
3017 type = true_type = TREE_TYPE (type);
3020 /* When the object being created is an array, the new-expression yields a
3021 pointer to the initial element (if any) of the array. For example,
3022 both new int and new int[10] return an int*. 5.3.4. */
3023 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
3025 nelts = array_type_nelts_top (type);
3027 type = true_type = TREE_TYPE (type);
3030 if (TYPE_READONLY (type) || TYPE_VOLATILE (type))
3032 pedwarn ("const and volatile types cannot be created with operator new");
3033 type = true_type = TYPE_MAIN_VARIANT (type);
3036 /* If our base type is an array, then make sure we know how many elements
3038 while (TREE_CODE (true_type) == ARRAY_TYPE)
3040 tree this_nelts = array_type_nelts_top (true_type);
3041 nelts = build_binary_op (MULT_EXPR, nelts, this_nelts, 1);
3042 true_type = TREE_TYPE (true_type);
3045 size = fold (build_binary_op (MULT_EXPR, size_in_bytes (true_type),
3048 size = size_in_bytes (type);
3050 if (TYPE_SIZE (true_type) == 0)
3052 if (true_type == void_type_node)
3053 error ("invalid type for new: `void'");
3055 incomplete_type_error (0, true_type);
3056 return error_mark_node;
3059 if (TYPE_LANG_SPECIFIC (true_type)
3060 && CLASSTYPE_ABSTRACT_VIRTUALS (true_type))
3062 abstract_virtuals_error (NULL_TREE, true_type);
3063 return error_mark_node;
3066 if (TYPE_LANG_SPECIFIC (true_type) && IS_SIGNATURE (true_type))
3068 signature_error (NULL_TREE, true_type);
3069 return error_mark_node;
3072 /* Get a little extra space to store a couple of things before the new'ed
3074 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
3076 tree extra = BI_header_size;
3078 size = size_binop (PLUS_EXPR, size, extra);
3082 code = VEC_NEW_EXPR;
3084 /* Allocate the object. */
3085 if (! use_global_new && TYPE_LANG_SPECIFIC (true_type)
3086 && (TYPE_GETS_NEW (true_type) & (1 << has_array)))
3087 rval = build_opfncall (code, LOOKUP_NORMAL,
3088 TYPE_POINTER_TO (true_type), size, placement);
3091 rval = build_opfncall (code, LOOKUP_GLOBAL|LOOKUP_COMPLAIN,
3092 ptr_type_node, size, placement);
3093 rval = convert (TYPE_POINTER_TO (true_type), rval);
3095 else if (! has_array && flag_this_is_variable > 0
3096 && TYPE_HAS_CONSTRUCTOR (true_type) && init != void_type_node)
3098 if (init == NULL_TREE || TREE_CODE (init) == TREE_LIST)
3102 error ("constructors take parameter lists");
3103 return error_mark_node;
3108 rval = build_builtin_call (build_pointer_type (true_type),
3109 has_array ? BIVN : BIN,
3110 build_tree_list (NULL_TREE, size));
3112 /* See comment above as to why this is disabled. */
3115 rval = build (PLUS_EXPR, TYPE_POINTER_TO (true_type), rval,
3117 rval = build (BIT_AND_EXPR, TYPE_POINTER_TO (true_type),
3118 rval, build1 (BIT_NOT_EXPR, integer_type_node,
3122 TREE_CALLS_NEW (rval) = 1;
3125 /* if rval is NULL_TREE I don't have to allocate it, but are we totally
3126 sure we have some extra bytes in that case for the BI_header_size
3127 cookies? And how does that interact with the code below? (mrs) */
3128 /* Finish up some magic for new'ed arrays */
3129 if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type) && rval != NULL_TREE)
3131 tree extra = BI_header_size;
3133 rval = convert (ptr_type_node, rval); /* convert to void * first */
3134 rval = convert (string_type_node, rval); /* lets not add void* and ints */
3135 rval = save_expr (build_binary_op (PLUS_EXPR, rval, extra, 1));
3136 /* Store header info. */
3137 cookie = build_indirect_ref (build (MINUS_EXPR, TYPE_POINTER_TO (BI_header_type),
3138 rval, extra), NULL_PTR);
3139 exp1 = build (MODIFY_EXPR, void_type_node,
3140 build_component_ref (cookie, nc_nelts_field_id, 0, 0),
3142 TREE_SIDE_EFFECTS (exp1) = 1;
3143 rval = convert (build_pointer_type (true_type), rval);
3144 TREE_CALLS_NEW (rval) = 1;
3145 TREE_SIDE_EFFECTS (rval) = 1;
3146 rval = build_compound_expr (tree_cons (NULL_TREE, exp1,
3147 build_tree_list (NULL_TREE, rval)));
3150 /* We've figured out where the allocation is to go.
3151 If we're not eliding constructors, then if a constructor
3152 is defined, we must go through it. */
3153 if (!has_array && (rval == NULL_TREE || !flag_elide_constructors)
3154 && TYPE_HAS_CONSTRUCTOR (true_type) && init != void_type_node)
3157 /* Constructors are never virtual. If it has an initialization, we
3158 need to complain if we aren't allowed to use the ctor that took
3160 int flags = LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_COMPLAIN;
3162 /* If a copy constructor might work, set things up so that we can
3163 try that after this. We deliberately don't clear LOOKUP_COMPLAIN
3164 any more, since that would make it impossible to rationally use
3165 the access of a constructor that matches perfectly. */
3167 if (rval != NULL_TREE)
3168 flags |= LOOKUP_SPECULATIVELY;
3171 if (rval && TYPE_USES_VIRTUAL_BASECLASSES (true_type))
3173 init = tree_cons (NULL_TREE, integer_one_node, init);
3174 flags |= LOOKUP_HAS_IN_CHARGE;
3180 if (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE)
3181 tmp = build_indirect_ref (tmp, NULL_PTR);
3183 newrval = build_method_call (tmp, constructor_name_full (true_type),
3184 init, NULL_TREE, flags);
3190 TREE_HAS_CONSTRUCTOR (rval) = 1;
3193 rval = error_mark_node;
3197 if (rval == error_mark_node)
3198 return error_mark_node;
3199 rval = save_expr (rval);
3200 TREE_HAS_CONSTRUCTOR (rval) = 1;
3202 /* Don't call any constructors or do any initialization. */
3203 if (init == void_type_node)
3206 if (TYPE_NEEDS_CONSTRUCTING (type) || init)
3208 if (! TYPE_NEEDS_CONSTRUCTING (type) && ! IS_AGGR_TYPE (type))
3210 /* New 2.0 interpretation: `new int (10)' means
3211 allocate an int, and initialize it with 10. */
3213 init = build_c_cast (type, init);
3214 rval = build (COMPOUND_EXPR, TREE_TYPE (rval),
3215 build_modify_expr (build_indirect_ref (rval, NULL_PTR),
3218 TREE_SIDE_EFFECTS (rval) = 1;
3219 TREE_CALLS_NEW (rval) = 1;
3221 else if (current_function_decl == NULL_TREE)
3223 extern tree static_aggregates;
3225 /* In case of static initialization, SAVE_EXPR is good enough. */
3226 init = copy_to_permanent (init);
3227 rval = copy_to_permanent (rval);
3228 static_aggregates = perm_tree_cons (init, rval, static_aggregates);
3232 /* Have to wrap this in RTL_EXPR for two cases:
3233 in base or member initialization and if we
3234 are a branch of a ?: operator. Since we
3235 can't easily know the latter, just do it always. */
3236 tree xval = make_node (RTL_EXPR);
3238 TREE_TYPE (xval) = TREE_TYPE (rval);
3239 do_pending_stack_adjust ();
3240 start_sequence_for_rtl_expr (xval);
3242 /* As a matter of principle, `start_sequence' should do this. */
3246 rval = expand_vec_init (decl, rval,
3247 build_binary_op (MINUS_EXPR, nelts, integer_one_node, 1),
3250 expand_aggr_init (build_indirect_ref (rval, NULL_PTR), init, 0);
3252 do_pending_stack_adjust ();
3254 TREE_SIDE_EFFECTS (xval) = 1;
3255 TREE_CALLS_NEW (xval) = 1;
3256 RTL_EXPR_SEQUENCE (xval) = get_insns ();
3259 if (TREE_CODE (rval) == SAVE_EXPR)
3261 /* Errors may cause this to not get evaluated. */
3262 if (SAVE_EXPR_RTL (rval) == 0)
3263 SAVE_EXPR_RTL (rval) = const0_rtx;
3264 RTL_EXPR_RTL (xval) = SAVE_EXPR_RTL (rval);
3268 my_friendly_assert (TREE_CODE (rval) == VAR_DECL, 217);
3269 RTL_EXPR_RTL (xval) = DECL_RTL (rval);
3275 if (rval && TREE_TYPE (rval) != build_pointer_type (type))
3277 /* The type of new int [3][3] is not int *, but int [3] * */
3278 rval = build_c_cast (build_pointer_type (type), rval);
3282 rval = build_compound_expr (chainon (pending_sizes,
3283 build_tree_list (NULL_TREE, rval)));
3287 extern tree gc_visible;
3291 rval = save_expr (rval);
3292 /* We don't need a `headof' operation to do this because
3293 we know where the object starts. */
3294 objbits = build1 (INDIRECT_REF, unsigned_type_node,
3295 build (MINUS_EXPR, ptr_type_node,
3296 rval, c_sizeof_nowarn (unsigned_type_node)));
3297 update_expr = build_modify_expr (objbits, BIT_IOR_EXPR, gc_visible);
3298 rval = build_compound_expr (tree_cons (NULL_TREE, rval,
3299 tree_cons (NULL_TREE, update_expr,
3300 build_tree_list (NULL_TREE, rval))));
3303 return save_expr (rval);
3306 /* `expand_vec_init' performs initialization of a vector of aggregate
3309 DECL is passed only for error reporting, and provides line number
3310 and source file name information.
3311 BASE is the space where the vector will be.
3312 MAXINDEX is the maximum index of the array (one less than the
3313 number of elements).
3314 INIT is the (possibly NULL) initializer.
3316 FROM_ARRAY is 0 if we should init everything with INIT
3317 (i.e., every element initialized from INIT).
3318 FROM_ARRAY is 1 if we should index into INIT in parallel
3319 with initialization of DECL.
3320 FROM_ARRAY is 2 if we should index into INIT in parallel,
3321 but use assignment instead of initialization. */
3324 expand_vec_init (decl, base, maxindex, init, from_array)
3325 tree decl, base, maxindex, init;
3329 tree iterator, base2 = NULL_TREE;
3330 tree type = TREE_TYPE (TREE_TYPE (base));
3333 maxindex = convert (integer_type_node, maxindex);
3334 if (maxindex == error_mark_node)
3335 return error_mark_node;
3337 if (current_function_decl == NULL_TREE)
3339 rval = make_tree_vec (3);
3340 TREE_VEC_ELT (rval, 0) = base;
3341 TREE_VEC_ELT (rval, 1) = maxindex;
3342 TREE_VEC_ELT (rval, 2) = init;
3346 size = size_in_bytes (type);
3348 /* Set to zero in case size is <= 0. Optimizer will delete this if
3349 it is not needed. */
3350 rval = get_temp_regvar (TYPE_POINTER_TO (type),
3351 convert (TYPE_POINTER_TO (type), null_pointer_node));
3352 base = default_conversion (base);
3353 base = convert (TYPE_POINTER_TO (type), base);
3354 expand_assignment (rval, base, 0, 0);
3355 base = get_temp_regvar (TYPE_POINTER_TO (type), base);
3357 if (init != NULL_TREE
3358 && TREE_CODE (init) == CONSTRUCTOR
3359 && TREE_TYPE (init) == TREE_TYPE (decl))
3361 /* Initialization of array from {...}. */
3362 tree elts = CONSTRUCTOR_ELTS (init);
3363 tree baseref = build1 (INDIRECT_REF, type, base);
3364 tree baseinc = build (PLUS_EXPR, TYPE_POINTER_TO (type), base, size);
3365 int host_i = TREE_INT_CST_LOW (maxindex);
3367 if (IS_AGGR_TYPE (type))
3372 expand_aggr_init (baseref, TREE_VALUE (elts), 0);
3374 expand_assignment (base, baseinc, 0, 0);
3375 elts = TREE_CHAIN (elts);
3377 /* Initialize any elements by default if possible. */
3380 if (TYPE_NEEDS_CONSTRUCTING (type) == 0)
3383 use_variable (DECL_RTL (base));
3387 iterator = get_temp_regvar (integer_type_node,
3388 build_int_2 (host_i, 0));
3390 goto init_by_default;
3396 expand_assignment (baseref, TREE_VALUE (elts), 0, 0);
3398 expand_assignment (base, baseinc, 0, 0);
3399 elts = TREE_CHAIN (elts);
3403 use_variable (DECL_RTL (base));
3409 iterator = get_temp_regvar (integer_type_node, maxindex);
3413 /* If initializing one array from another,
3414 initialize element by element. */
3417 /* We rely upon the below calls the do argument checking */
3418 if (decl == NULL_TREE)
3420 sorry ("initialization of array from dissimilar array type");
3421 return error_mark_node;
3425 base2 = default_conversion (init);
3426 itype = TREE_TYPE (base2);
3427 base2 = get_temp_regvar (itype, base2);
3428 itype = TREE_TYPE (itype);
3430 else if (TYPE_LANG_SPECIFIC (type)
3431 && TYPE_NEEDS_CONSTRUCTING (type)
3432 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3434 error ("initializer ends prematurely");
3435 return error_mark_node;
3439 expand_start_cond (build (GE_EXPR, integer_type_node,
3440 iterator, integer_zero_node), 0);
3441 expand_start_loop_continue_elsewhere (1);
3445 tree to = build1 (INDIRECT_REF, type, base);
3449 from = build1 (INDIRECT_REF, itype, base2);
3453 if (from_array == 2)
3454 expand_expr_stmt (build_modify_expr (to, NOP_EXPR, from));
3455 else if (TYPE_NEEDS_CONSTRUCTING (type))
3456 expand_aggr_init (to, from, 0);
3458 expand_assignment (to, from, 0, 0);
3460 my_friendly_abort (57);
3462 else if (TREE_CODE (type) == ARRAY_TYPE)
3465 sorry ("cannot initialize multi-dimensional array with initializer");
3466 expand_vec_init (decl, build1 (NOP_EXPR, TYPE_POINTER_TO (TREE_TYPE (type)), base),
3467 array_type_nelts (type), 0, 0);
3470 expand_aggr_init (build1 (INDIRECT_REF, type, base), init, 0);
3472 expand_assignment (base,
3473 build (PLUS_EXPR, TYPE_POINTER_TO (type), base, size),
3476 expand_assignment (base2,
3477 build (PLUS_EXPR, TYPE_POINTER_TO (type), base2, size), 0, 0);
3478 expand_loop_continue_here ();
3479 expand_exit_loop_if_false (0, build (NE_EXPR, integer_type_node,
3480 build (PREDECREMENT_EXPR, integer_type_node, iterator, integer_one_node), minus_one));
3484 use_variable (DECL_RTL (base));
3486 use_variable (DECL_RTL (base2));
3491 use_variable (DECL_RTL (iterator));
3496 use_variable (DECL_RTL (rval));
3500 /* Free up storage of type TYPE, at address ADDR.
3502 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
3505 VIRTUAL_SIZE is the amount of storage that was allocated, and is
3506 used as the second argument to operator delete. It can include
3507 things like padding and magic size cookies. It has virtual in it,
3508 because if you have a base pointer and you delete through a virtual
3509 destructor, it should be the size of the dynamic object, not the
3510 static object, see Free Store 12.5 ANSI C++ WP.
3512 This does not call any destructors. */
3514 build_x_delete (type, addr, which_delete, virtual_size)
3519 int use_global_delete = which_delete & 1;
3520 int use_vec_delete = !!(which_delete & 2);
3522 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
3524 if (! use_global_delete && TYPE_LANG_SPECIFIC (TREE_TYPE (type))
3525 && (TYPE_GETS_DELETE (TREE_TYPE (type)) & (1 << use_vec_delete)))
3526 rval = build_opfncall (code, LOOKUP_NORMAL, addr, virtual_size, NULL_TREE);
3528 rval = build_builtin_call (void_type_node, use_vec_delete ? BIVD : BID,
3529 build_tree_list (NULL_TREE, addr));
3533 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3534 ADDR is an expression which yields the store to be destroyed.
3535 AUTO_DELETE is nonzero if a call to DELETE should be made or not.
3536 If in the program, (AUTO_DELETE & 2) is non-zero, we tear down the
3537 virtual baseclasses.
3538 If in the program, (AUTO_DELETE & 1) is non-zero, then we deallocate.
3540 FLAGS is the logical disjunction of zero or more LOOKUP_
3541 flags. See cp-tree.h for more info.
3543 This function does not delete an object's virtual base classes. */
3545 build_delete (type, addr, auto_delete, flags, use_global_delete)
3549 int use_global_delete;
3551 tree function, parms;
3557 if (addr == error_mark_node)
3558 return error_mark_node;
3560 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3561 set to `error_mark_node' before it gets properly cleaned up. */
3562 if (type == error_mark_node)
3563 return error_mark_node;
3565 type = TYPE_MAIN_VARIANT (type);
3567 if (TREE_CODE (type) == POINTER_TYPE)
3569 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3570 if (TYPE_SIZE (type) == 0)
3572 incomplete_type_error (0, type);
3573 return error_mark_node;
3575 if (TREE_CODE (type) == ARRAY_TYPE)
3577 if (! IS_AGGR_TYPE (type))
3579 /* Call the builtin operator delete. */
3580 return build_builtin_call (void_type_node, BID,
3581 build_tree_list (NULL_TREE, addr));
3583 if (TREE_SIDE_EFFECTS (addr))
3584 addr = save_expr (addr);
3586 /* throw away const and volatile on target type of addr */
3587 addr = convert_force (build_pointer_type (type), addr);
3588 ref = build_indirect_ref (addr, NULL_PTR);
3591 else if (TREE_CODE (type) == ARRAY_TYPE)
3594 if (TREE_SIDE_EFFECTS (addr))
3595 addr = save_expr (addr);
3596 return build_vec_delete (addr, array_type_nelts (type),
3597 c_sizeof_nowarn (TREE_TYPE (type)),
3598 auto_delete, integer_two_node,
3603 /* Don't check PROTECT here; leave that decision to the
3604 destructor. If the destructor is accessible, call it,
3605 else report error. */
3606 addr = build_unary_op (ADDR_EXPR, addr, 0);
3607 if (TREE_SIDE_EFFECTS (addr))
3608 addr = save_expr (addr);
3610 if (TREE_CONSTANT (addr))
3611 addr = convert_pointer_to (type, addr);
3613 addr = convert_force (build_pointer_type (type), addr);
3615 if (TREE_CODE (addr) == NOP_EXPR
3616 && TREE_OPERAND (addr, 0) == current_class_decl)
3619 ref = build_indirect_ref (addr, NULL_PTR);
3623 my_friendly_assert (IS_AGGR_TYPE (type), 220);
3625 if (! TYPE_NEEDS_DESTRUCTOR (type))
3627 if (auto_delete == integer_zero_node)
3628 return void_zero_node;
3630 /* Pass the size of the object down to the operator delete() in
3631 addition to the ADDR. */
3632 if (TYPE_GETS_REG_DELETE (type) && !use_global_delete)
3634 tree virtual_size = c_sizeof_nowarn (type);
3635 return build_opfncall (DELETE_EXPR, LOOKUP_NORMAL, addr,
3636 virtual_size, NULL_TREE);
3639 /* Call the builtin operator delete. */
3640 return build_builtin_call (void_type_node, BID,
3641 build_tree_list (NULL_TREE, addr));
3643 parms = build_tree_list (NULL_TREE, addr);
3645 /* Below, we will reverse the order in which these calls are made.
3646 If we have a destructor, then that destructor will take care
3647 of the base classes; otherwise, we must do that here. */
3648 if (TYPE_HAS_DESTRUCTOR (type))
3650 tree dtor = DECL_MAIN_VARIANT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), 0));
3651 tree basetypes = TYPE_BINFO (type);
3652 tree passed_auto_delete;
3653 tree do_delete = NULL_TREE;
3655 if (use_global_delete)
3657 tree cond = fold (build (BIT_AND_EXPR, integer_type_node,
3658 auto_delete, integer_one_node));
3659 tree call = build_builtin_call
3660 (void_type_node, BID, build_tree_list (NULL_TREE, addr));
3662 cond = fold (build (COND_EXPR, void_type_node, cond,
3663 call, void_zero_node));
3664 if (cond != void_zero_node)
3667 passed_auto_delete = fold (build (BIT_AND_EXPR, integer_type_node,
3668 auto_delete, integer_two_node));
3671 passed_auto_delete = auto_delete;
3673 if (flags & LOOKUP_PROTECT)
3675 enum access_type access = compute_access (basetypes, dtor);
3677 if (access == access_private)
3679 if (flags & LOOKUP_COMPLAIN)
3680 cp_error ("destructor for type `%T' is private in this scope", type);
3681 return error_mark_node;
3683 else if (access == access_protected)
3685 if (flags & LOOKUP_COMPLAIN)
3686 cp_error ("destructor for type `%T' is protected in this scope", type);
3687 return error_mark_node;
3691 /* Once we are in a destructor, try not going through
3692 the virtual function table to find the next destructor. */
3693 if (DECL_VINDEX (dtor)
3694 && ! (flags & LOOKUP_NONVIRTUAL)
3695 && TREE_CODE (auto_delete) != PARM_DECL
3696 && (ptr == 1 || ! resolves_to_fixed_type_p (ref, 0)))
3698 tree binfo, basetype;
3699 /* The code below is probably all broken. See call.c for the
3700 complete right way to do this. this offsets may not be right
3701 in the below. (mrs) */
3702 /* This destructor must be called via virtual function table. */
3703 dtor = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (DECL_CONTEXT (dtor)), 0);
3704 basetype = DECL_CLASS_CONTEXT (dtor);
3705 binfo = get_binfo (basetype,
3706 TREE_TYPE (TREE_TYPE (TREE_VALUE (parms))),
3708 expr = convert_pointer_to_real (binfo, TREE_VALUE (parms));
3709 if (expr != TREE_VALUE (parms))
3712 ref = build_indirect_ref (expr, NULL_PTR);
3713 TREE_VALUE (parms) = expr;
3715 function = build_vfn_ref (&TREE_VALUE (parms), ref, DECL_VINDEX (dtor));
3716 if (function == error_mark_node)
3717 return error_mark_node;
3718 TREE_TYPE (function) = build_pointer_type (TREE_TYPE (dtor));
3719 TREE_CHAIN (parms) = build_tree_list (NULL_TREE, passed_auto_delete);
3720 expr = build_function_call (function, parms);
3722 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3723 if (ptr && (flags & LOOKUP_DESTRUCTOR) == 0)
3725 /* Handle the case where a virtual destructor is
3726 being called on an item that is 0.
3728 @@ Does this really need to be done? */
3729 tree ifexp = build_binary_op(NE_EXPR, addr, integer_zero_node,1);
3731 if (TREE_CODE (ref) == VAR_DECL
3732 || TREE_CODE (ref) == COMPONENT_REF)
3733 warning ("losing in build_delete");
3735 expr = build (COND_EXPR, void_type_node,
3736 ifexp, expr, void_zero_node);
3743 if ((flags & LOOKUP_DESTRUCTOR)
3744 || TREE_CODE (ref) == VAR_DECL
3745 || TREE_CODE (ref) == PARM_DECL
3746 || TREE_CODE (ref) == COMPONENT_REF
3747 || TREE_CODE (ref) == ARRAY_REF)
3748 /* These can't be 0. */
3749 ifexp = integer_one_node;
3751 /* Handle the case where a non-virtual destructor is
3752 being called on an item that is 0. */
3753 ifexp = build_binary_op (NE_EXPR, addr, integer_zero_node, 1);
3755 /* Used to mean that this destructor was known to be empty,
3756 but that's now obsolete. */
3757 my_friendly_assert (DECL_INITIAL (dtor) != void_type_node, 221);
3759 TREE_CHAIN (parms) = build_tree_list (NULL_TREE, passed_auto_delete);
3760 expr = build_function_call (dtor, parms);
3762 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3764 if (ifexp != integer_one_node)
3765 expr = build (COND_EXPR, void_type_node,
3766 ifexp, expr, void_zero_node);
3772 /* This can get visibilities wrong. */
3773 tree binfos = BINFO_BASETYPES (TYPE_BINFO (type));
3774 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
3775 tree base_binfo = n_baseclasses > 0 ? TREE_VEC_ELT (binfos, 0) : NULL_TREE;
3776 tree exprstmt = NULL_TREE;
3777 tree parent_auto_delete = auto_delete;
3780 /* If this type does not have a destructor, but does have
3781 operator delete, call the parent parent destructor (if any),
3782 but let this node do the deleting. Otherwise, it is ok
3783 to let the parent destructor do the deleting. */
3784 if (TYPE_GETS_REG_DELETE (type) && !use_global_delete)
3786 parent_auto_delete = integer_zero_node;
3787 if (auto_delete == integer_zero_node)
3793 /* This is probably wrong. It should be the size of the
3794 virtual object being deleted. */
3795 virtual_size = c_sizeof_nowarn (type);
3797 expr = build_opfncall (DELETE_EXPR, LOOKUP_NORMAL, addr,
3798 virtual_size, NULL_TREE);
3799 if (expr == error_mark_node)
3800 return error_mark_node;
3801 if (auto_delete != integer_one_node)
3802 cond = build (COND_EXPR, void_type_node,
3803 build (BIT_AND_EXPR, integer_type_node,
3804 auto_delete, integer_one_node),
3805 expr, void_zero_node);
3810 else if (base_binfo == NULL_TREE
3811 || (TREE_VIA_VIRTUAL (base_binfo) == 0
3812 && ! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo))))
3816 /* This is probably wrong. It should be the size of the virtual
3817 object being deleted. */
3818 virtual_size = c_sizeof_nowarn (type);
3820 cond = build (COND_EXPR, void_type_node,
3821 build (BIT_AND_EXPR, integer_type_node, auto_delete, integer_one_node),
3822 build_builtin_call (void_type_node, BID,
3823 build_tree_list (NULL_TREE, addr)),
3830 exprstmt = build_tree_list (NULL_TREE, cond);
3833 && ! TREE_VIA_VIRTUAL (base_binfo)
3834 && TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3836 tree this_auto_delete;
3838 if (BINFO_OFFSET_ZEROP (base_binfo))
3839 this_auto_delete = parent_auto_delete;
3841 this_auto_delete = integer_zero_node;
3843 expr = build_delete (TYPE_POINTER_TO (BINFO_TYPE (base_binfo)), addr,
3844 this_auto_delete, flags, 0);
3845 exprstmt = tree_cons (NULL_TREE, expr, exprstmt);
3848 /* Take care of the remaining baseclasses. */
3849 for (i = 1; i < n_baseclasses; i++)
3851 base_binfo = TREE_VEC_ELT (binfos, i);
3852 if (! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo))
3853 || TREE_VIA_VIRTUAL (base_binfo))
3856 /* May be zero offset if other baseclasses are virtual. */
3857 expr = fold (build (PLUS_EXPR, TYPE_POINTER_TO (BINFO_TYPE (base_binfo)),
3858 addr, BINFO_OFFSET (base_binfo)));
3860 expr = build_delete (TYPE_POINTER_TO (BINFO_TYPE (base_binfo)), expr,
3864 exprstmt = tree_cons (NULL_TREE, expr, exprstmt);
3867 for (member = TYPE_FIELDS (type); member; member = TREE_CHAIN (member))
3869 if (TREE_CODE (member) != FIELD_DECL)
3871 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (member)))
3873 tree this_member = build_component_ref (ref, DECL_NAME (member), 0, 0);
3874 tree this_type = TREE_TYPE (member);
3875 expr = build_delete (this_type, this_member, integer_two_node, flags, 0);
3876 exprstmt = tree_cons (NULL_TREE, expr, exprstmt);
3881 return build_compound_expr (exprstmt);
3882 /* Virtual base classes make this function do nothing. */
3883 return void_zero_node;
3887 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3890 build_vbase_delete (type, decl)
3893 tree vbases = CLASSTYPE_VBASECLASSES (type);
3894 tree result = NULL_TREE;
3895 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3897 my_friendly_assert (addr != error_mark_node, 222);
3901 tree this_addr = convert_force (TYPE_POINTER_TO (BINFO_TYPE (vbases)),
3903 result = tree_cons (NULL_TREE,
3904 build_delete (TREE_TYPE (this_addr), this_addr,
3906 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0),
3908 vbases = TREE_CHAIN (vbases);
3910 return build_compound_expr (nreverse (result));
3913 /* Build a C++ vector delete expression.
3914 MAXINDEX is the number of elements to be deleted.
3915 ELT_SIZE is the nominal size of each element in the vector.
3916 BASE is the expression that should yield the store to be deleted.
3917 This function expands (or synthesizes) these calls itself.
3918 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3919 AUTO_DELETE say whether each item in the container should be deallocated.
3921 This also calls delete for virtual baseclasses of elements of the vector.
3923 Update: MAXINDEX is no longer needed. The size can be extracted from the
3924 start of the vector for pointers, and from the type for arrays. We still
3925 use MAXINDEX for arrays because it happens to already have one of the
3926 values we'd have to extract. (We could use MAXINDEX with pointers to
3927 confirm the size, and trap if the numbers differ; not clear that it'd
3928 be worth bothering.) */
3930 build_vec_delete (base, maxindex, elt_size, auto_delete_vec, auto_delete,
3932 tree base, maxindex, elt_size;
3933 tree auto_delete_vec, auto_delete;
3934 int use_global_delete;
3936 tree ptype = TREE_TYPE (base);
3939 /* Temporary variables used by the loop. */
3940 tree tbase, size_exp, tbase_init;
3942 /* This is the body of the loop that implements the deletion of a
3943 single element, and moves temp variables to next elements. */
3946 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3949 /* This is the thing that governs what to do after the loop has run. */
3950 tree deallocate_expr = 0;
3952 /* This is the BIND_EXPR which holds the outermost iterator of the
3953 loop. It is convenient to set this variable up and test it before
3954 executing any other code in the loop.
3955 This is also the containing expression returned by this function. */
3956 tree controller = NULL_TREE;
3958 /* This is the BLOCK to record the symbol binding for debugging. */
3961 base = stabilize_reference (base);
3963 /* Since we can use base many times, save_expr it. */
3964 if (TREE_SIDE_EFFECTS (base))
3965 base = save_expr (base);
3967 if (TREE_CODE (ptype) == POINTER_TYPE)
3969 /* Step back one from start of vector, and read dimension. */
3970 tree cookie_addr = build (MINUS_EXPR, TYPE_POINTER_TO (BI_header_type),
3971 base, BI_header_size);
3972 tree cookie = build_indirect_ref (cookie_addr, NULL_PTR);
3973 maxindex = build_component_ref (cookie, nc_nelts_field_id, 0, 0);
3975 ptype = TREE_TYPE (ptype);
3976 while (TREE_CODE (ptype) == ARRAY_TYPE);
3978 else if (TREE_CODE (ptype) == ARRAY_TYPE)
3980 /* get the total number of things in the array, maxindex is a bad name */
3981 maxindex = array_type_nelts_total (ptype);
3982 while (TREE_CODE (ptype) == ARRAY_TYPE)
3983 ptype = TREE_TYPE (ptype);
3984 base = build_unary_op (ADDR_EXPR, base, 1);
3988 error ("type to vector delete is neither pointer or array type");
3989 return error_mark_node;
3992 ptype = TYPE_POINTER_TO (type);
3994 size_exp = size_in_bytes (type);
3996 if (! IS_AGGR_TYPE (type) || ! TYPE_NEEDS_DESTRUCTOR (type))
3998 loop = integer_zero_node;
4002 /* The below is short by BI_header_size */
4003 virtual_size = fold (size_binop (MULT_EXPR, size_exp, maxindex));
4005 tbase = build_decl (VAR_DECL, NULL_TREE, ptype);
4006 tbase_init = build_modify_expr (tbase, NOP_EXPR,
4007 fold (build (PLUS_EXPR, ptype,
4010 DECL_REGISTER (tbase) = 1;
4011 controller = build (BIND_EXPR, void_type_node, tbase, 0, 0);
4012 TREE_SIDE_EFFECTS (controller) = 1;
4013 block = build_block (tbase, 0, 0, 0, 0);
4014 add_block_current_level (block);
4016 if (auto_delete != integer_zero_node
4017 && auto_delete != integer_two_node)
4019 tree base_tbd = convert (ptype,
4020 build_binary_op (MINUS_EXPR,
4021 convert (ptr_type_node, base),
4024 /* This is the real size */
4025 virtual_size = size_binop (PLUS_EXPR, virtual_size, BI_header_size);
4026 body = build_tree_list (NULL_TREE,
4027 build_x_delete (ptype, base_tbd,
4028 2 | use_global_delete,
4030 body = build (COND_EXPR, void_type_node,
4031 build (BIT_AND_EXPR, integer_type_node,
4032 auto_delete, integer_one_node),
4033 body, integer_zero_node);
4038 body = tree_cons (NULL_TREE,
4039 build_delete (ptype, tbase, auto_delete,
4040 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1),
4043 body = tree_cons (NULL_TREE,
4044 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
4047 body = tree_cons (NULL_TREE,
4048 build (EXIT_EXPR, void_type_node,
4049 build (EQ_EXPR, integer_type_node, base, tbase)),
4052 loop = build (LOOP_EXPR, void_type_node, build_compound_expr (body));
4054 loop = tree_cons (NULL_TREE, tbase_init,
4055 tree_cons (NULL_TREE, loop, NULL_TREE));
4056 loop = build_compound_expr (loop);
4059 /* If the delete flag is one, or anything else with the low bit set,
4060 delete the storage. */
4061 if (auto_delete_vec == integer_zero_node
4062 || auto_delete_vec == integer_two_node)
4063 deallocate_expr = integer_zero_node;
4068 /* The below is short by BI_header_size */
4069 virtual_size = fold (size_binop (MULT_EXPR, size_exp, maxindex));
4071 if (! TYPE_VEC_NEW_USES_COOKIE (type))
4076 base_tbd = convert (ptype,
4077 build_binary_op (MINUS_EXPR,
4078 convert (string_type_node, base),
4081 /* True size with header. */
4082 virtual_size = size_binop (PLUS_EXPR, virtual_size, BI_header_size);
4084 deallocate_expr = build_x_delete (ptype, base_tbd,
4085 2 | use_global_delete,
4087 if (auto_delete_vec != integer_one_node)
4088 deallocate_expr = build (COND_EXPR, void_type_node,
4089 build (BIT_AND_EXPR, integer_type_node,
4090 auto_delete_vec, integer_one_node),
4091 deallocate_expr, integer_zero_node);
4094 if (loop && deallocate_expr != integer_zero_node)
4096 body = tree_cons (NULL_TREE, loop,
4097 tree_cons (NULL_TREE, deallocate_expr, NULL_TREE));
4098 body = build_compound_expr (body);
4103 /* Outermost wrapper: If pointer is null, punt. */
4104 body = build (COND_EXPR, void_type_node,
4105 build (NE_EXPR, integer_type_node, base, integer_zero_node),
4106 body, integer_zero_node);
4107 body = build1 (NOP_EXPR, void_type_node, body);
4111 TREE_OPERAND (controller, 1) = body;
4115 return convert (void_type_node, body);