1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 89, 92-98, 1999 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, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* High-level class interface. */
35 /* In C++, structures with well-defined constructors are initialized by
36 those constructors, unasked. CURRENT_BASE_INIT_LIST
37 holds a list of stmts for a BASE_INIT term in the grammar.
38 This list has one element for each base class which must be
39 initialized. The list elements are [basename, init], with
40 type basetype. This allows the possibly anachronistic form
41 (assuming d : a, b, c) "d (int a) : c(a+5), b (a-4), a (a+3)"
42 where each successive term can be handed down the constructor
43 line. Perhaps this was not intended. */
44 tree current_base_init_list, current_member_init_list;
46 static void expand_aggr_vbase_init_1 PROTO((tree, tree, tree, tree));
47 static void construct_virtual_bases PROTO((tree, tree, tree, tree, tree));
48 static void expand_aggr_init_1 PROTO((tree, tree, tree, tree, int));
49 static void expand_default_init PROTO((tree, tree, tree, tree, int));
50 static tree build_vec_delete_1 PROTO((tree, tree, tree, tree, tree,
52 static void perform_member_init PROTO((tree, tree, tree, int));
53 static void sort_base_init PROTO((tree, tree *, tree *));
54 static tree build_builtin_delete_call PROTO((tree));
55 static int member_init_ok_or_else PROTO((tree, tree, const char *));
56 static void expand_virtual_init PROTO((tree, tree));
57 static tree sort_member_init PROTO((tree));
58 static tree initializing_context PROTO((tree));
59 static void expand_vec_init_try_block PROTO((tree));
60 static void expand_vec_init_catch_clause PROTO((tree, tree, tree, tree));
61 static tree build_java_class_ref PROTO((tree));
62 static void expand_cleanup_for_base PROTO((tree, tree));
64 /* Cache the identifier nodes for the magic field of a new cookie. */
65 static tree nc_nelts_field_id;
67 static tree minus_one;
69 /* Set up local variable for this file. MUST BE CALLED AFTER
70 INIT_DECL_PROCESSING. */
72 static tree BI_header_type, BI_header_size;
74 void init_init_processing ()
78 minus_one = build_int_2 (-1, -1);
80 /* Define the structure that holds header information for
81 arrays allocated via operator new. */
82 BI_header_type = make_lang_type (RECORD_TYPE);
83 nc_nelts_field_id = get_identifier ("nelts");
84 fields[0] = build_lang_field_decl (FIELD_DECL, nc_nelts_field_id, sizetype);
85 finish_builtin_type (BI_header_type, "__new_cookie", fields,
87 BI_header_size = size_in_bytes (BI_header_type);
90 /* Subroutine of emit_base_init. For BINFO, initialize all the
91 virtual function table pointers, except those that come from
92 virtual base classes. Initialize binfo's vtable pointer, if
93 INIT_SELF is true. CAN_ELIDE is true when we know that all virtual
94 function table pointers in all bases have been initialized already,
95 probably because their constructors have just be run. ADDR is the
96 pointer to the object whos vtables we are going to initialize.
98 REAL_BINFO is usually the same as BINFO, except when addr is not of
99 pointer to the type of the real derived type that we want to
100 initialize for. This is the case when addr is a pointer to a sub
101 object of a complete object, and we only want to do part of the
102 complete object's initialization of vtable pointers. This is done
103 for all virtual table pointers in virtual base classes. REAL_BINFO
104 is used to find the BINFO_VTABLE that we initialize with. BINFO is
105 used for conversions of addr to subobjects.
107 BINFO_TYPE (real_binfo) must be BINFO_TYPE (binfo).
109 Relies upon binfo being inside TYPE_BINFO (TREE_TYPE (TREE_TYPE
113 expand_direct_vtbls_init (real_binfo, binfo, init_self, can_elide, addr)
114 tree real_binfo, binfo, addr;
115 int init_self, can_elide;
117 tree real_binfos = BINFO_BASETYPES (real_binfo);
118 tree binfos = BINFO_BASETYPES (binfo);
119 int i, n_baselinks = real_binfos ? TREE_VEC_LENGTH (real_binfos) : 0;
121 for (i = 0; i < n_baselinks; i++)
123 tree real_base_binfo = TREE_VEC_ELT (real_binfos, i);
124 tree base_binfo = TREE_VEC_ELT (binfos, i);
125 int is_not_base_vtable
126 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (real_binfo));
127 if (! TREE_VIA_VIRTUAL (real_base_binfo))
128 expand_direct_vtbls_init (real_base_binfo, base_binfo,
129 is_not_base_vtable, can_elide, addr);
132 /* Before turning this on, make sure it is correct. */
133 if (can_elide && ! BINFO_MODIFIED (binfo))
136 /* Should we use something besides CLASSTYPE_VFIELDS? */
137 if (init_self && CLASSTYPE_VFIELDS (BINFO_TYPE (real_binfo)))
139 tree base_ptr = convert_pointer_to_real (binfo, addr);
140 expand_virtual_init (real_binfo, base_ptr);
145 /* Subroutine of emit_base_init. */
148 perform_member_init (member, name, init, explicit)
149 tree member, name, init;
153 tree type = TREE_TYPE (member);
155 expand_start_target_temps ();
157 decl = build_component_ref (current_class_ref, name, NULL_TREE, explicit);
159 /* Deal with this here, as we will get confused if we try to call the
160 assignment op for an anonymous union. This can happen in a
161 synthesized copy constructor. */
162 if (ANON_AGGR_TYPE_P (type))
164 init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
165 TREE_SIDE_EFFECTS (init) = 1;
166 expand_expr_stmt (init);
168 else if (TYPE_NEEDS_CONSTRUCTING (type)
169 || (init && TYPE_HAS_CONSTRUCTOR (type)))
171 /* Since `init' is already a TREE_LIST on the current_member_init_list,
172 only build it into one if we aren't already a list. */
173 if (init != NULL_TREE && TREE_CODE (init) != TREE_LIST)
174 init = build_expr_list (NULL_TREE, init);
177 && TREE_CODE (type) == ARRAY_TYPE
179 && TREE_CHAIN (init) == NULL_TREE
180 && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
182 /* Initialization of one array from another. */
183 expand_vec_init (TREE_OPERAND (decl, 1), decl,
184 array_type_nelts (type), TREE_VALUE (init), 1);
187 expand_aggr_init (decl, init, 0);
191 if (init == NULL_TREE)
195 /* default-initialization. */
196 if (AGGREGATE_TYPE_P (type))
197 init = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
198 else if (TREE_CODE (type) == REFERENCE_TYPE)
200 cp_error ("default-initialization of `%#D', which has reference type",
202 init = error_mark_node;
205 init = integer_zero_node;
207 /* member traversal: note it leaves init NULL */
208 else if (TREE_CODE (TREE_TYPE (member)) == REFERENCE_TYPE)
209 cp_pedwarn ("uninitialized reference member `%D'", member);
211 else if (TREE_CODE (init) == TREE_LIST)
213 /* There was an explicit member initialization. Do some
214 work in that case. */
215 if (TREE_CHAIN (init))
217 warning ("initializer list treated as compound expression");
218 init = build_compound_expr (init);
221 init = TREE_VALUE (init);
224 /* We only build this with a null init if we got it from the
225 current_member_init_list. */
226 if (init || explicit)
228 expand_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
232 expand_end_target_temps ();
235 if (TYPE_NEEDS_DESTRUCTOR (type))
239 /* All cleanups must be on the function_obstack. */
240 push_obstacks_nochange ();
241 resume_temporary_allocation ();
243 expr = build_component_ref (current_class_ref, name, NULL_TREE,
245 expr = build_delete (type, expr, integer_zero_node,
246 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
248 if (expr != error_mark_node)
249 add_partial_entry (expr);
255 extern int warn_reorder;
257 /* Subroutine of emit_member_init. */
263 tree x, member, name, field;
264 tree init_list = NULL_TREE;
266 tree last_field = NULL_TREE;
268 for (member = TYPE_FIELDS (t); member ; member = TREE_CHAIN (member))
272 /* member could be, for example, a CONST_DECL for an enumerated
273 tag; we don't want to try to initialize that, since it already
275 if (TREE_CODE (member) != FIELD_DECL || !DECL_NAME (member))
278 for (x = current_member_init_list, pos = 0; x; x = TREE_CHAIN (x), ++pos)
280 /* If we cleared this out, then pay no attention to it. */
281 if (TREE_PURPOSE (x) == NULL_TREE)
283 name = TREE_PURPOSE (x);
285 if (TREE_CODE (name) == IDENTIFIER_NODE)
286 field = IDENTIFIER_CLASS_VALUE (name);
289 my_friendly_assert (TREE_CODE (name) == FIELD_DECL, 348);
293 /* If one member shadows another, get the outermost one. */
294 if (TREE_CODE (field) == TREE_LIST)
295 field = TREE_VALUE (field);
303 cp_warning_at ("member initializers for `%#D'", last_field);
304 cp_warning_at (" and `%#D'", field);
305 warning (" will be re-ordered to match declaration order");
311 /* Make sure we won't try to work on this init again. */
312 TREE_PURPOSE (x) = NULL_TREE;
313 x = build_tree_list (name, TREE_VALUE (x));
318 /* If we didn't find MEMBER in the list, create a dummy entry
319 so the two lists (INIT_LIST and the list of members) will be
321 x = build_tree_list (NULL_TREE, NULL_TREE);
323 init_list = chainon (init_list, x);
326 /* Initializers for base members go at the end. */
327 for (x = current_member_init_list ; x ; x = TREE_CHAIN (x))
329 name = TREE_PURPOSE (x);
332 if (purpose_member (name, init_list))
334 cp_error ("multiple initializations given for member `%D'",
335 IDENTIFIER_CLASS_VALUE (name));
339 init_list = chainon (init_list,
340 build_tree_list (name, TREE_VALUE (x)));
341 TREE_PURPOSE (x) = NULL_TREE;
349 sort_base_init (t, rbase_ptr, vbase_ptr)
350 tree t, *rbase_ptr, *vbase_ptr;
352 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
353 int n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
359 /* For warn_reorder. */
361 tree last_base = NULL_TREE;
363 tree rbases = NULL_TREE;
364 tree vbases = NULL_TREE;
366 /* First walk through and splice out vbase and invalid initializers.
367 Also replace names with binfos. */
369 last = tree_cons (NULL_TREE, NULL_TREE, current_base_init_list);
370 for (x = TREE_CHAIN (last); x; x = TREE_CHAIN (x))
372 tree basetype = TREE_PURPOSE (x);
373 tree binfo = NULL_TREE;
375 if (basetype == NULL_TREE)
377 /* Initializer for single base class. Must not
378 use multiple inheritance or this is ambiguous. */
379 switch (n_baseclasses)
382 cp_error ("`%T' does not have a base class to initialize",
388 cp_error ("unnamed initializer ambiguous for `%T' which uses multiple inheritance",
392 binfo = TREE_VEC_ELT (binfos, 0);
394 else if (is_aggr_type (basetype, 1))
396 binfo = binfo_or_else (basetype, t);
397 if (binfo == NULL_TREE)
400 /* Virtual base classes are special cases. Their initializers
401 are recorded with this constructor, and they are used when
402 this constructor is the top-level constructor called. */
403 if (TREE_VIA_VIRTUAL (binfo))
405 tree v = CLASSTYPE_VBASECLASSES (t);
406 while (BINFO_TYPE (v) != BINFO_TYPE (binfo))
409 vbases = tree_cons (v, TREE_VALUE (x), vbases);
414 /* Otherwise, if it is not an immediate base class, complain. */
415 for (i = n_baseclasses-1; i >= 0; i--)
416 if (BINFO_TYPE (binfo) == BINFO_TYPE (TREE_VEC_ELT (binfos, i)))
420 cp_error ("`%T' is not an immediate base class of `%T'",
421 basetype, current_class_type);
427 my_friendly_abort (365);
429 TREE_PURPOSE (x) = binfo;
430 TREE_CHAIN (last) = x;
433 TREE_CHAIN (last) = NULL_TREE;
435 /* Now walk through our regular bases and make sure they're initialized. */
437 for (i = 0; i < n_baseclasses; ++i)
439 tree base_binfo = TREE_VEC_ELT (binfos, i);
442 if (TREE_VIA_VIRTUAL (base_binfo))
445 for (x = current_base_init_list, pos = 0; x; x = TREE_CHAIN (x), ++pos)
447 tree binfo = TREE_PURPOSE (x);
449 if (binfo == NULL_TREE)
452 if (binfo == base_binfo)
458 cp_warning_at ("base initializers for `%#T'", last_base);
459 cp_warning_at (" and `%#T'", BINFO_TYPE (binfo));
460 warning (" will be re-ordered to match inheritance order");
463 last_base = BINFO_TYPE (binfo);
466 /* Make sure we won't try to work on this init again. */
467 TREE_PURPOSE (x) = NULL_TREE;
468 x = build_tree_list (binfo, TREE_VALUE (x));
473 /* If we didn't find BASE_BINFO in the list, create a dummy entry
474 so the two lists (RBASES and the list of bases) will be
476 x = build_tree_list (NULL_TREE, NULL_TREE);
478 rbases = chainon (rbases, x);
485 /* Perform whatever initializations have yet to be done on the base
486 class of the class variable. These actions are in the global
487 variable CURRENT_BASE_INIT_LIST. Such an action could be
488 NULL_TREE, meaning that the user has explicitly called the base
489 class constructor with no arguments.
491 If there is a need for a call to a constructor, we must surround
492 that call with a pushlevel/poplevel pair, since we are technically
493 at the PARM level of scope.
495 Argument IMMEDIATELY, if zero, forces a new sequence to be
496 generated to contain these new insns, so it can be emitted later.
497 This sequence is saved in the global variable BASE_INIT_EXPR.
498 Otherwise, the insns are emitted into the current sequence.
500 Note that emit_base_init does *not* initialize virtual base
501 classes. That is done specially, elsewhere. */
503 extern tree base_init_expr, rtl_expr_chain;
506 emit_base_init (t, immediately)
512 tree rbase_init_list, vbase_init_list;
513 tree t_binfo = TYPE_BINFO (t);
514 tree binfos = BINFO_BASETYPES (t_binfo);
515 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
516 tree expr = NULL_TREE;
521 do_pending_stack_adjust ();
522 /* Make the RTL_EXPR node temporary, not momentary,
523 so that rtl_expr_chain doesn't become garbage. */
524 momentary = suspend_momentary ();
525 expr = make_node (RTL_EXPR);
526 resume_momentary (momentary);
527 start_sequence_for_rtl_expr (expr);
530 if (write_symbols == NO_DEBUG)
531 /* As a matter of principle, `start_sequence' should do this. */
534 /* Always emit a line number note so we can step into constructors. */
535 emit_line_note_force (DECL_SOURCE_FILE (current_function_decl),
536 DECL_SOURCE_LINE (current_function_decl));
538 mem_init_list = sort_member_init (t);
539 current_member_init_list = NULL_TREE;
541 sort_base_init (t, &rbase_init_list, &vbase_init_list);
542 current_base_init_list = NULL_TREE;
544 /* First, initialize the virtual base classes, if we are
545 constructing the most-derived object. */
546 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
548 tree first_arg = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
549 construct_virtual_bases (t, current_class_ref, current_class_ptr,
550 vbase_init_list, first_arg);
553 /* Now, perform initialization of non-virtual base classes. */
554 for (i = 0; i < n_baseclasses; i++)
556 tree base_binfo = TREE_VEC_ELT (binfos, i);
557 tree init = void_list_node;
559 if (TREE_VIA_VIRTUAL (base_binfo))
562 my_friendly_assert (BINFO_INHERITANCE_CHAIN (base_binfo) == t_binfo,
565 if (TREE_PURPOSE (rbase_init_list))
566 init = TREE_VALUE (rbase_init_list);
567 else if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo)))
570 if (extra_warnings && copy_args_p (current_function_decl))
571 cp_warning ("base class `%#T' should be explicitly initialized in the copy constructor",
572 BINFO_TYPE (base_binfo));
575 if (init != void_list_node)
577 expand_start_target_temps ();
579 member = convert_pointer_to_real (base_binfo, current_class_ptr);
580 expand_aggr_init_1 (base_binfo, NULL_TREE,
581 build_indirect_ref (member, NULL_PTR), init,
584 expand_end_target_temps ();
588 expand_cleanup_for_base (base_binfo, NULL_TREE);
589 rbase_init_list = TREE_CHAIN (rbase_init_list);
592 /* Initialize all the virtual function table fields that
593 do come from virtual base classes. */
594 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
595 expand_indirect_vtbls_init (t_binfo, current_class_ref, current_class_ptr);
597 /* Initialize all the virtual function table fields that
598 do not come from virtual base classes. */
599 expand_direct_vtbls_init (t_binfo, t_binfo, 1, 1, current_class_ptr);
601 for (member = TYPE_FIELDS (t); member; member = TREE_CHAIN (member))
606 /* member could be, for example, a CONST_DECL for an enumerated
607 tag; we don't want to try to initialize that, since it already
609 if (TREE_CODE (member) != FIELD_DECL || !DECL_NAME (member))
612 /* See if we had a user-specified member initialization. */
613 if (TREE_PURPOSE (mem_init_list))
615 name = TREE_PURPOSE (mem_init_list);
616 init = TREE_VALUE (mem_init_list);
619 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE
620 || TREE_CODE (name) == FIELD_DECL, 349);
624 name = DECL_NAME (member);
625 init = DECL_INITIAL (member);
629 /* Effective C++ rule 12. */
630 if (warn_ecpp && init == NULL_TREE
631 && !DECL_ARTIFICIAL (member)
632 && TREE_CODE (TREE_TYPE (member)) != ARRAY_TYPE)
633 cp_warning ("`%D' should be initialized in the member initialization list", member);
636 perform_member_init (member, name, init, from_init_list);
637 mem_init_list = TREE_CHAIN (mem_init_list);
640 /* Now initialize any members from our bases. */
641 while (mem_init_list)
643 tree name, init, field;
645 if (TREE_PURPOSE (mem_init_list))
647 name = TREE_PURPOSE (mem_init_list);
648 init = TREE_VALUE (mem_init_list);
650 if (TREE_CODE (name) == IDENTIFIER_NODE)
651 field = IDENTIFIER_CLASS_VALUE (name);
655 /* If one member shadows another, get the outermost one. */
656 if (TREE_CODE (field) == TREE_LIST)
658 field = TREE_VALUE (field);
659 if (decl_type_context (field) != current_class_type)
660 cp_error ("field `%D' not in immediate context", field);
664 /* It turns out if you have an anonymous union in the
665 class, a member from it can end up not being on the
666 list of fields (rather, the type is), and therefore
667 won't be seen by the for loop above. */
669 /* The code in this for loop is derived from a general loop
670 which had this check in it. Theoretically, we've hit
671 every initialization for the list of members in T, so
672 we shouldn't have anything but these left in this list. */
673 my_friendly_assert (DECL_FIELD_CONTEXT (field) != t, 351);
676 perform_member_init (field, name, init, 1);
678 mem_init_list = TREE_CHAIN (mem_init_list);
683 do_pending_stack_adjust ();
684 my_friendly_assert (base_init_expr == 0, 207);
685 base_init_expr = expr;
686 TREE_TYPE (expr) = void_type_node;
687 RTL_EXPR_RTL (expr) = const0_rtx;
688 RTL_EXPR_SEQUENCE (expr) = get_insns ();
689 rtl_expr_chain = tree_cons (NULL_TREE, expr, rtl_expr_chain);
691 TREE_SIDE_EFFECTS (expr) = 1;
694 /* All the implicit try blocks we built up will be zapped
695 when we come to a real binding contour boundary. */
698 /* Check that all fields are properly initialized after
699 an assignment to `this'. */
706 for (member = TYPE_FIELDS (t); member; member = TREE_CHAIN (member))
707 if (DECL_NAME (member) && TREE_USED (member))
708 cp_error ("field `%D' used before initialized (after assignment to `this')",
712 /* This code sets up the virtual function tables appropriate for
713 the pointer DECL. It is a one-ply initialization.
715 BINFO is the exact type that DECL is supposed to be. In
716 multiple inheritance, this might mean "C's A" if C : A, B. */
719 expand_virtual_init (binfo, decl)
722 tree type = BINFO_TYPE (binfo);
724 tree vtype, vtype_binfo;
726 /* This code is crusty. Should be simple, like:
727 vtbl = BINFO_VTABLE (binfo);
729 vtype = DECL_CONTEXT (CLASSTYPE_VFIELD (type));
730 vtype_binfo = get_binfo (vtype, TREE_TYPE (TREE_TYPE (decl)), 0);
731 vtbl = BINFO_VTABLE (binfo_value (DECL_FIELD_CONTEXT (CLASSTYPE_VFIELD (type)), binfo));
732 assemble_external (vtbl);
733 TREE_USED (vtbl) = 1;
734 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
735 decl = convert_pointer_to_real (vtype_binfo, decl);
736 vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL_PTR), vtype);
737 if (vtbl_ptr == error_mark_node)
740 /* Have to convert VTBL since array sizes may be different. */
741 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
742 expand_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
745 /* If an exception is thrown in a constructor, those base classes already
746 constructed must be destroyed. This function creates the cleanup
747 for BINFO, which has just been constructed. If FLAG is non-NULL,
748 it is a DECL which is non-zero when this base needs to be
752 expand_cleanup_for_base (binfo, flag)
758 if (!TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (binfo)))
761 /* All cleanups must be on the function_obstack. */
762 push_obstacks_nochange ();
763 resume_temporary_allocation ();
765 /* Call the destructor. */
766 expr = (build_scoped_method_call
767 (current_class_ref, binfo, dtor_identifier,
768 build_expr_list (NULL_TREE, integer_zero_node)));
770 expr = fold (build (COND_EXPR, void_type_node,
771 truthvalue_conversion (flag),
772 expr, integer_zero_node));
775 add_partial_entry (expr);
778 /* Subroutine of `expand_aggr_vbase_init'.
779 BINFO is the binfo of the type that is being initialized.
780 INIT_LIST is the list of initializers for the virtual baseclass. */
783 expand_aggr_vbase_init_1 (binfo, exp, addr, init_list)
784 tree binfo, exp, addr, init_list;
786 tree init = purpose_member (binfo, init_list);
787 tree ref = build_indirect_ref (addr, NULL_PTR);
789 expand_start_target_temps ();
792 init = TREE_VALUE (init);
793 /* Call constructors, but don't set up vtables. */
794 expand_aggr_init_1 (binfo, exp, ref, init, LOOKUP_COMPLAIN);
796 expand_end_target_temps ();
800 /* Construct the virtual base-classes of THIS_REF (whose address is
801 THIS_PTR). The object has the indicated TYPE. The construction
802 actually takes place only if FLAG is non-zero. INIT_LIST is list
803 of initialization for constructor to perform. */
806 construct_virtual_bases (type, this_ref, this_ptr, init_list, flag)
816 /* If there are no virtual baseclasses, we shouldn't even be here. */
817 my_friendly_assert (TYPE_USES_VIRTUAL_BASECLASSES (type), 19990621);
819 /* First set the pointers in our object that tell us where to find
820 our virtual baseclasses. */
821 expand_start_cond (flag, 0);
822 result = init_vbase_pointers (type, this_ptr);
824 expand_expr_stmt (build_compound_expr (result));
827 /* Now, run through the baseclasses, initializing each. */
828 for (vbases = CLASSTYPE_VBASECLASSES (type); vbases;
829 vbases = TREE_CHAIN (vbases))
831 tree tmp = purpose_member (vbases, result);
833 /* If there are virtual base classes with destructors, we need to
834 emit cleanups to destroy them if an exception is thrown during
835 the construction process. These exception regions (i.e., the
836 period during which the cleanups must occur) begin from the time
837 the construction is complete to the end of the function. If we
838 create a conditional block in which to initialize the
839 base-classes, then the cleanup region for the virtual base begins
840 inside a block, and ends outside of that block. This situation
841 confuses the sjlj exception-handling code. Therefore, we do not
842 create a single conditional block, but one for each
843 initialization. (That way the cleanup regions always begin
844 in the outer block.) We trust the back-end to figure out
845 that the FLAG will not change across initializations, and
846 avoid doing multiple tests. */
847 expand_start_cond (flag, 0);
848 expand_aggr_vbase_init_1 (vbases, this_ref,
849 TREE_OPERAND (TREE_VALUE (tmp), 0),
853 expand_cleanup_for_base (vbases, flag);
857 /* Find the context in which this FIELD can be initialized. */
860 initializing_context (field)
863 tree t = DECL_CONTEXT (field);
865 /* Anonymous union members can be initialized in the first enclosing
866 non-anonymous union context. */
867 while (t && ANON_AGGR_TYPE_P (t))
868 t = TYPE_CONTEXT (t);
872 /* Function to give error message if member initialization specification
873 is erroneous. FIELD is the member we decided to initialize.
874 TYPE is the type for which the initialization is being performed.
875 FIELD must be a member of TYPE.
877 MEMBER_NAME is the name of the member. */
880 member_init_ok_or_else (field, type, member_name)
883 const char *member_name;
885 if (field == error_mark_node)
887 if (field == NULL_TREE || initializing_context (field) != type)
889 cp_error ("class `%T' does not have any field named `%s'", type,
893 if (TREE_STATIC (field))
895 cp_error ("field `%#D' is static; only point of initialization is its declaration",
903 /* If NAME is a viable field name for the aggregate DECL,
904 and PARMS is a viable parameter list, then expand an _EXPR
905 which describes this initialization.
907 Note that we do not need to chase through the class's base classes
908 to look for NAME, because if it's in that list, it will be handled
909 by the constructor for that base class.
911 We do not yet have a fixed-point finder to instantiate types
912 being fed to overloaded constructors. If there is a unique
913 constructor, then argument types can be got from that one.
915 If INIT is non-NULL, then it the initialization should
916 be placed in `current_base_init_list', where it will be processed
917 by `emit_base_init'. */
920 expand_member_init (exp, name, init)
921 tree exp, name, init;
923 tree basetype = NULL_TREE, field;
926 if (exp == NULL_TREE)
927 return; /* complain about this later */
929 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
931 if (name && TREE_CODE (name) == TYPE_DECL)
933 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
934 name = DECL_NAME (name);
937 if (name == NULL_TREE && IS_AGGR_TYPE (type))
938 switch (CLASSTYPE_N_BASECLASSES (type))
941 error ("base class initializer specified, but no base class to initialize");
944 basetype = TYPE_BINFO_BASETYPE (type, 0);
947 error ("initializer for unnamed base class ambiguous");
948 cp_error ("(type `%T' uses multiple inheritance)", type);
952 my_friendly_assert (init != NULL_TREE, 0);
954 /* The grammar should not allow fields which have names that are
955 TYPENAMEs. Therefore, if the field has a non-NULL TREE_TYPE, we
956 may assume that this is an attempt to initialize a base class
957 member of the current type. Otherwise, it is an attempt to
958 initialize a member field. */
960 if (init == void_type_node)
963 if (name == NULL_TREE || basetype)
967 if (name == NULL_TREE)
971 name = TYPE_IDENTIFIER (basetype);
974 error ("no base class to initialize");
979 else if (basetype != type
980 && ! current_template_parms
981 && ! vec_binfo_member (basetype,
982 TYPE_BINFO_BASETYPES (type))
983 && ! binfo_member (basetype, CLASSTYPE_VBASECLASSES (type)))
985 if (IDENTIFIER_CLASS_VALUE (name))
987 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
988 cp_error ("type `%T' is not an immediate or virtual basetype for `%T'",
991 cp_error ("type `%T' is not an immediate basetype for `%T'",
996 if (purpose_member (basetype, current_base_init_list))
998 cp_error ("base class `%T' already initialized", basetype);
1002 if (warn_reorder && current_member_init_list)
1004 cp_warning ("base initializer for `%T'", basetype);
1005 warning (" will be re-ordered to precede member initializations");
1008 base_init = build_tree_list (basetype, init);
1009 current_base_init_list = chainon (current_base_init_list, base_init);
1016 field = lookup_field (type, name, 1, 0);
1018 if (! member_init_ok_or_else (field, type, IDENTIFIER_POINTER (name)))
1021 if (purpose_member (name, current_member_init_list))
1023 cp_error ("field `%D' already initialized", field);
1027 member_init = build_tree_list (name, init);
1028 current_member_init_list = chainon (current_member_init_list, member_init);
1032 /* This is like `expand_member_init', only it stores one aggregate
1035 INIT comes in two flavors: it is either a value which
1036 is to be stored in EXP, or it is a parameter list
1037 to go to a constructor, which will operate on EXP.
1038 If INIT is not a parameter list for a constructor, then set
1039 LOOKUP_ONLYCONVERTING.
1040 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1041 the initializer, if FLAGS is 0, then it is the (init) form.
1042 If `init' is a CONSTRUCTOR, then we emit a warning message,
1043 explaining that such initializations are invalid.
1045 ALIAS_THIS is nonzero iff we are initializing something which is
1046 essentially an alias for current_class_ref. In this case, the base
1047 constructor may move it on us, and we must keep track of such
1050 If INIT resolves to a CALL_EXPR which happens to return
1051 something of the type we are looking for, then we know
1052 that we can safely use that call to perform the
1055 The virtual function table pointer cannot be set up here, because
1056 we do not really know its type.
1058 Virtual baseclass pointers are also set up here.
1060 This never calls operator=().
1062 When initializing, nothing is CONST.
1064 A default copy constructor may have to be used to perform the
1067 A constructor or a conversion operator may have to be used to
1068 perform the initialization, but not both, as it would be ambiguous. */
1071 expand_aggr_init (exp, init, flags)
1075 tree type = TREE_TYPE (exp);
1076 int was_const = TREE_READONLY (exp);
1077 int was_volatile = TREE_THIS_VOLATILE (exp);
1079 if (init == error_mark_node)
1082 TREE_READONLY (exp) = 0;
1083 TREE_THIS_VOLATILE (exp) = 0;
1085 if (init && TREE_CODE (init) != TREE_LIST)
1086 flags |= LOOKUP_ONLYCONVERTING;
1088 if (TREE_CODE (type) == ARRAY_TYPE)
1090 /* Must arrange to initialize each element of EXP
1091 from elements of INIT. */
1092 tree itype = init ? TREE_TYPE (init) : NULL_TREE;
1093 if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
1095 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1097 TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1099 if (init && TREE_TYPE (init) == NULL_TREE)
1101 /* Handle bad initializers like:
1105 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1109 int main(int argc, char **argv) {
1110 COMPLEX zees(1.0, 0.0)[10];
1113 error ("bad array initializer");
1116 expand_vec_init (exp, exp, array_type_nelts (type), init,
1117 init && same_type_p (TREE_TYPE (init),
1119 TREE_READONLY (exp) = was_const;
1120 TREE_THIS_VOLATILE (exp) = was_volatile;
1121 TREE_TYPE (exp) = type;
1123 TREE_TYPE (init) = itype;
1127 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1128 /* just know that we've seen something for this node */
1129 TREE_USED (exp) = 1;
1132 /* If initializing from a GNU C CONSTRUCTOR, consider the elts in the
1133 constructor as parameters to an implicit GNU C++ constructor. */
1134 if (init && TREE_CODE (init) == CONSTRUCTOR
1135 && TYPE_HAS_CONSTRUCTOR (type)
1136 && TREE_TYPE (init) == type)
1137 init = CONSTRUCTOR_ELTS (init);
1140 TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1141 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1142 init, LOOKUP_NORMAL|flags);
1143 TREE_TYPE (exp) = type;
1144 TREE_READONLY (exp) = was_const;
1145 TREE_THIS_VOLATILE (exp) = was_volatile;
1149 expand_default_init (binfo, true_exp, exp, init, flags)
1155 tree type = TREE_TYPE (exp);
1157 /* It fails because there may not be a constructor which takes
1158 its own type as the first (or only parameter), but which does
1159 take other types via a conversion. So, if the thing initializing
1160 the expression is a unit element of type X, first try X(X&),
1161 followed by initialization by X. If neither of these work
1162 out, then look hard. */
1166 if (init && TREE_CODE (init) != TREE_LIST
1167 && (flags & LOOKUP_ONLYCONVERTING))
1169 /* Base subobjects should only get direct-initialization. */
1170 if (true_exp != exp)
1173 if (flags & DIRECT_BIND)
1174 /* Do nothing. We hit this in two cases: Reference initialization,
1175 where we aren't initializing a real variable, so we don't want
1176 to run a new constructor; and catching an exception, where we
1177 have already built up the constructor call so we could wrap it
1178 in an exception region. */;
1180 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1182 if (TREE_CODE (init) == TRY_CATCH_EXPR)
1183 /* We need to protect the initialization of a catch parm
1184 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1185 around the TARGET_EXPR for the copy constructor. See
1186 expand_start_catch_block. */
1187 TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1188 TREE_OPERAND (init, 0));
1190 init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1191 TREE_SIDE_EFFECTS (init) = 1;
1192 expand_expr_stmt (init);
1196 if (init == NULL_TREE
1197 || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1201 init = TREE_VALUE (parms);
1204 parms = build_expr_list (NULL_TREE, init);
1206 if (TYPE_USES_VIRTUAL_BASECLASSES (type))
1208 if (true_exp == exp)
1209 parms = expr_tree_cons (NULL_TREE, integer_one_node, parms);
1211 parms = expr_tree_cons (NULL_TREE, integer_zero_node, parms);
1212 flags |= LOOKUP_HAS_IN_CHARGE;
1215 rval = build_method_call (exp, ctor_identifier,
1216 parms, binfo, flags);
1217 if (TREE_SIDE_EFFECTS (rval))
1218 expand_expr_stmt (rval);
1221 /* This function is responsible for initializing EXP with INIT
1224 BINFO is the binfo of the type for who we are performing the
1225 initialization. For example, if W is a virtual base class of A and B,
1227 If we are initializing B, then W must contain B's W vtable, whereas
1228 were we initializing C, W must contain C's W vtable.
1230 TRUE_EXP is nonzero if it is the true expression being initialized.
1231 In this case, it may be EXP, or may just contain EXP. The reason we
1232 need this is because if EXP is a base element of TRUE_EXP, we
1233 don't necessarily know by looking at EXP where its virtual
1234 baseclass fields should really be pointing. But we do know
1235 from TRUE_EXP. In constructors, we don't know anything about
1236 the value being initialized.
1238 ALIAS_THIS serves the same purpose it serves for expand_aggr_init.
1240 FLAGS is just passes to `build_method_call'. See that function for
1244 expand_aggr_init_1 (binfo, true_exp, exp, init, flags)
1250 tree type = TREE_TYPE (exp);
1252 my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1254 /* Use a function returning the desired type to initialize EXP for us.
1255 If the function is a constructor, and its first argument is
1256 NULL_TREE, know that it was meant for us--just slide exp on
1257 in and expand the constructor. Constructors now come
1260 if (init && TREE_CODE (exp) == VAR_DECL
1261 && TREE_CODE (init) == CONSTRUCTOR
1262 && TREE_HAS_CONSTRUCTOR (init))
1264 tree t = store_init_value (exp, init);
1267 expand_decl_init (exp);
1270 t = build (INIT_EXPR, type, exp, init);
1271 TREE_SIDE_EFFECTS (t) = 1;
1272 expand_expr_stmt (t);
1276 /* We know that expand_default_init can handle everything we want
1278 expand_default_init (binfo, true_exp, exp, init, flags);
1281 /* Report an error if NAME is not the name of a user-defined,
1282 aggregate type. If OR_ELSE is nonzero, give an error message. */
1285 is_aggr_typedef (name, or_else)
1291 if (name == error_mark_node)
1294 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1295 type = IDENTIFIER_TYPE_VALUE (name);
1299 cp_error ("`%T' is not an aggregate typedef", name);
1303 if (! IS_AGGR_TYPE (type)
1304 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1305 && TREE_CODE (type) != TEMPLATE_TEMPLATE_PARM)
1308 cp_error ("`%T' is not an aggregate type", type);
1314 /* Report an error if TYPE is not a user-defined, aggregate type. If
1315 OR_ELSE is nonzero, give an error message. */
1318 is_aggr_type (type, or_else)
1322 if (type == error_mark_node)
1325 if (! IS_AGGR_TYPE (type)
1326 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1327 && TREE_CODE (type) != TEMPLATE_TEMPLATE_PARM)
1330 cp_error ("`%T' is not an aggregate type", type);
1336 /* Like is_aggr_typedef, but returns typedef if successful. */
1339 get_aggr_from_typedef (name, or_else)
1345 if (name == error_mark_node)
1348 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1349 type = IDENTIFIER_TYPE_VALUE (name);
1353 cp_error ("`%T' fails to be an aggregate typedef", name);
1357 if (! IS_AGGR_TYPE (type)
1358 && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1359 && TREE_CODE (type) != TEMPLATE_TEMPLATE_PARM)
1362 cp_error ("type `%T' is of non-aggregate type", type);
1369 get_type_value (name)
1372 if (name == error_mark_node)
1375 if (IDENTIFIER_HAS_TYPE_VALUE (name))
1376 return IDENTIFIER_TYPE_VALUE (name);
1382 /* This code could just as well go in `class.c', but is placed here for
1385 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1386 the appropriate function call. */
1389 build_member_call (type, name, parmlist)
1390 tree type, name, parmlist;
1395 tree basetype_path, decl;
1397 if (TREE_CODE (name) == TEMPLATE_ID_EXPR
1398 && TREE_CODE (type) == NAMESPACE_DECL)
1400 /* 'name' already refers to the decls from the namespace, since we
1401 hit do_identifier for template_ids. */
1402 method_name = TREE_OPERAND (name, 0);
1403 /* FIXME: Since we don't do independent names right yet, the
1404 name might also be a LOOKUP_EXPR. Once we resolve this to a
1405 real decl earlier, this can go. This may happen during
1407 if (TREE_CODE (method_name) == LOOKUP_EXPR)
1409 method_name = lookup_namespace_name
1410 (type, TREE_OPERAND (method_name, 0));
1411 TREE_OPERAND (name, 0) = method_name;
1413 my_friendly_assert (is_overloaded_fn (method_name), 980519);
1414 return build_x_function_call (name, parmlist, current_class_ref);
1417 if (type == std_node)
1418 return build_x_function_call (do_scoped_id (name, 0), parmlist,
1420 if (TREE_CODE (type) == NAMESPACE_DECL)
1421 return build_x_function_call (lookup_namespace_name (type, name),
1422 parmlist, current_class_ref);
1424 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1426 method_name = TREE_OPERAND (name, 0);
1427 if (TREE_CODE (method_name) == COMPONENT_REF)
1428 method_name = TREE_OPERAND (method_name, 1);
1429 if (is_overloaded_fn (method_name))
1430 method_name = DECL_NAME (OVL_CURRENT (method_name));
1431 TREE_OPERAND (name, 0) = method_name;
1436 if (TREE_CODE (method_name) == BIT_NOT_EXPR)
1438 method_name = TREE_OPERAND (method_name, 0);
1442 /* This shouldn't be here, and build_member_call shouldn't appear in
1444 if (type && TREE_CODE (type) == IDENTIFIER_NODE
1445 && get_aggr_from_typedef (type, 0) == 0)
1447 tree ns = lookup_name (type, 0);
1448 if (ns && TREE_CODE (ns) == NAMESPACE_DECL)
1450 return build_x_function_call (build_offset_ref (type, name), parmlist, current_class_ref);
1454 if (type == NULL_TREE || ! is_aggr_type (type, 1))
1455 return error_mark_node;
1457 /* An operator we did not like. */
1458 if (name == NULL_TREE)
1459 return error_mark_node;
1463 cp_error ("cannot call destructor `%T::~%T' without object", type,
1465 return error_mark_node;
1468 decl = maybe_dummy_object (type, &basetype_path);
1470 /* Convert 'this' to the specified type to disambiguate conversion
1471 to the function's context. Apparently Standard C++ says that we
1472 shouldn't do this. */
1473 if (decl == current_class_ref
1475 && ACCESSIBLY_UNIQUELY_DERIVED_P (type, current_class_type))
1477 tree olddecl = current_class_ptr;
1478 tree oldtype = TREE_TYPE (TREE_TYPE (olddecl));
1479 if (oldtype != type)
1481 tree newtype = build_qualified_type (type, TYPE_QUALS (oldtype));
1482 decl = convert_force (build_pointer_type (newtype), olddecl, 0);
1483 decl = build_indirect_ref (decl, NULL_PTR);
1487 if (method_name == constructor_name (type)
1488 || method_name == constructor_name_full (type))
1489 return build_functional_cast (type, parmlist);
1490 if (lookup_fnfields (basetype_path, method_name, 0))
1491 return build_method_call (decl,
1492 TREE_CODE (name) == TEMPLATE_ID_EXPR
1493 ? name : method_name,
1494 parmlist, basetype_path,
1495 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL);
1496 if (TREE_CODE (name) == IDENTIFIER_NODE
1497 && ((t = lookup_field (TYPE_BINFO (type), name, 1, 0))))
1499 if (t == error_mark_node)
1500 return error_mark_node;
1501 if (TREE_CODE (t) == FIELD_DECL)
1503 if (is_dummy_object (decl))
1505 cp_error ("invalid use of non-static field `%D'", t);
1506 return error_mark_node;
1508 decl = build (COMPONENT_REF, TREE_TYPE (t), decl, t);
1510 else if (TREE_CODE (t) == VAR_DECL)
1514 cp_error ("invalid use of member `%D'", t);
1515 return error_mark_node;
1517 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl)))
1518 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, decl,
1519 parmlist, NULL_TREE);
1520 return build_function_call (decl, parmlist);
1524 cp_error ("no method `%T::%D'", type, name);
1525 return error_mark_node;
1529 /* Build a reference to a member of an aggregate. This is not a
1530 C++ `&', but really something which can have its address taken,
1531 and then act as a pointer to member, for example TYPE :: FIELD
1532 can have its address taken by saying & TYPE :: FIELD.
1534 @@ Prints out lousy diagnostics for operator <typename>
1537 @@ This function should be rewritten and placed in search.c. */
1540 build_offset_ref (type, name)
1543 tree decl, t = error_mark_node;
1545 tree basebinfo = NULL_TREE;
1546 tree orig_name = name;
1548 /* class templates can come in as TEMPLATE_DECLs here. */
1549 if (TREE_CODE (name) == TEMPLATE_DECL)
1552 if (type == std_node)
1553 return do_scoped_id (name, 0);
1555 if (processing_template_decl || uses_template_parms (type))
1556 return build_min_nt (SCOPE_REF, type, name);
1558 /* Handle namespace names fully here. */
1559 if (TREE_CODE (type) == NAMESPACE_DECL)
1561 t = lookup_namespace_name (type, name);
1562 if (t != error_mark_node && ! type_unknown_p (t))
1565 t = convert_from_reference (t);
1570 if (type == NULL_TREE || ! is_aggr_type (type, 1))
1571 return error_mark_node;
1573 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1575 /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1576 something like `a.template f<int>' or the like. For the most
1577 part, we treat this just like a.f. We do remember, however,
1578 the template-id that was used. */
1579 name = TREE_OPERAND (orig_name, 0);
1581 if (TREE_CODE (name) == LOOKUP_EXPR)
1582 /* This can happen during tsubst'ing. */
1583 name = TREE_OPERAND (name, 0);
1585 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1588 if (TREE_CODE (name) == BIT_NOT_EXPR)
1590 if (! check_dtor_name (type, name))
1591 cp_error ("qualified type `%T' does not match destructor name `~%T'",
1592 type, TREE_OPERAND (name, 0));
1593 name = dtor_identifier;
1596 /* I think this is wrong, but the draft is unclear. --jason 6/15/98 */
1597 else if (name == constructor_name_full (type)
1598 || name == constructor_name (type))
1599 name = ctor_identifier;
1602 if (TYPE_SIZE (complete_type (type)) == 0
1603 && !TYPE_BEING_DEFINED (type))
1605 cp_error ("incomplete type `%T' does not have member `%D'", type,
1607 return error_mark_node;
1610 decl = maybe_dummy_object (type, &basebinfo);
1612 member = lookup_member (basebinfo, name, 1, 0);
1614 if (member == error_mark_node)
1615 return error_mark_node;
1617 /* A lot of this logic is now handled in lookup_field and
1619 if (member && BASELINK_P (member))
1621 /* Go from the TREE_BASELINK to the member function info. */
1622 tree fnfields = member;
1623 t = TREE_VALUE (fnfields);
1625 if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1627 /* The FNFIELDS are going to contain functions that aren't
1628 necessarily templates, and templates that don't
1629 necessarily match the explicit template parameters. We
1630 save all the functions, and the explicit parameters, and
1631 then figure out exactly what to instantiate with what
1632 arguments in instantiate_type. */
1634 if (TREE_CODE (t) != OVERLOAD)
1635 /* The code in instantiate_type which will process this
1636 expects to encounter OVERLOADs, not raw functions. */
1637 t = ovl_cons (t, NULL_TREE);
1639 return build (OFFSET_REF,
1642 build (TEMPLATE_ID_EXPR,
1645 TREE_OPERAND (orig_name, 1)));
1648 if (!really_overloaded_fn (t))
1650 /* Get rid of a potential OVERLOAD around it */
1651 t = OVL_CURRENT (t);
1653 /* unique functions are handled easily. */
1654 basebinfo = TREE_PURPOSE (fnfields);
1655 if (!enforce_access (basebinfo, t))
1656 return error_mark_node;
1658 if (DECL_STATIC_FUNCTION_P (t))
1660 return build (OFFSET_REF, TREE_TYPE (t), decl, t);
1663 /* FNFIELDS is most likely allocated on the search_obstack,
1664 which will go away after this class scope. If we need
1665 to save this value for later (i.e. for use as an initializer
1666 for a static variable), then do so here.
1668 ??? The smart thing to do for the case of saving initializers
1669 is to resolve them before we're done with this scope. */
1670 if (!TREE_PERMANENT (fnfields)
1671 && ! allocation_temporary_p ())
1672 fnfields = copy_list (fnfields);
1674 TREE_TYPE (fnfields) = unknown_type_node;
1675 return build (OFFSET_REF, unknown_type_node, decl, fnfields);
1682 cp_error ("`%D' is not a member of type `%T'", name, type);
1683 return error_mark_node;
1686 if (TREE_CODE (t) == TYPE_DECL)
1691 /* static class members and class-specific enum
1692 values can be returned without further ado. */
1693 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == CONST_DECL)
1696 return convert_from_reference (t);
1699 if (TREE_CODE (t) == FIELD_DECL && DECL_C_BIT_FIELD (t))
1701 cp_error ("illegal pointer to bit field `%D'", t);
1702 return error_mark_node;
1705 /* static class functions too. */
1706 if (TREE_CODE (t) == FUNCTION_DECL
1707 && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
1708 my_friendly_abort (53);
1710 /* In member functions, the form `type::name' is no longer
1711 equivalent to `this->type::name', at least not until
1712 resolve_offset_ref. */
1713 return build (OFFSET_REF, build_offset_type (type, TREE_TYPE (t)), decl, t);
1716 /* If a OFFSET_REF made it through to here, then it did
1717 not have its address taken. */
1720 resolve_offset_ref (exp)
1723 tree type = TREE_TYPE (exp);
1724 tree base = NULL_TREE;
1726 tree basetype, addr;
1728 if (TREE_CODE (exp) == OFFSET_REF)
1730 member = TREE_OPERAND (exp, 1);
1731 base = TREE_OPERAND (exp, 0);
1735 my_friendly_assert (TREE_CODE (type) == OFFSET_TYPE, 214);
1736 if (TYPE_OFFSET_BASETYPE (type) != current_class_type)
1738 error ("object missing in use of pointer-to-member construct");
1739 return error_mark_node;
1742 type = TREE_TYPE (type);
1743 base = current_class_ref;
1746 if (BASELINK_P (member))
1748 cp_pedwarn ("assuming & on overloaded member function");
1749 return build_unary_op (ADDR_EXPR, exp, 0);
1752 if (TREE_CODE (TREE_TYPE (member)) == METHOD_TYPE)
1754 cp_pedwarn ("assuming & on `%E'", member);
1755 return build_unary_op (ADDR_EXPR, exp, 0);
1758 if ((TREE_CODE (member) == VAR_DECL
1759 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member))
1760 && ! TYPE_PTRMEM_P (TREE_TYPE (member)))
1761 || TREE_CODE (TREE_TYPE (member)) == FUNCTION_TYPE)
1763 /* These were static members. */
1764 if (mark_addressable (member) == 0)
1765 return error_mark_node;
1769 if (TREE_CODE (TREE_TYPE (member)) == POINTER_TYPE
1770 && TREE_CODE (TREE_TYPE (TREE_TYPE (member))) == METHOD_TYPE)
1773 /* Syntax error can cause a member which should
1774 have been seen as static to be grok'd as non-static. */
1775 if (TREE_CODE (member) == FIELD_DECL && current_class_ref == NULL_TREE)
1777 if (TREE_ADDRESSABLE (member) == 0)
1779 cp_error_at ("member `%D' is non-static but referenced as a static member",
1781 error ("at this point in file");
1782 TREE_ADDRESSABLE (member) = 1;
1784 return error_mark_node;
1787 /* The first case is really just a reference to a member of `this'. */
1788 if (TREE_CODE (member) == FIELD_DECL
1789 && (base == current_class_ref || is_dummy_object (base)))
1794 if (TREE_CODE (exp) == OFFSET_REF && TREE_CODE (type) == OFFSET_TYPE)
1795 basetype = TYPE_OFFSET_BASETYPE (type);
1797 basetype = DECL_CONTEXT (member);
1799 base = current_class_ptr;
1801 if (get_base_distance (basetype, TREE_TYPE (TREE_TYPE (base)), 0, &basetype_path) < 0)
1803 error_not_base_type (basetype, TREE_TYPE (TREE_TYPE (base)));
1804 return error_mark_node;
1806 /* Kludge: we need to use basetype_path now, because
1807 convert_pointer_to will bash it. */
1808 enforce_access (basetype_path, member);
1809 addr = convert_pointer_to (basetype, base);
1811 /* Even in the case of illegal access, we form the
1812 COMPONENT_REF; that will allow better error recovery than
1813 just feeding back error_mark_node. */
1814 expr = build (COMPONENT_REF, TREE_TYPE (member),
1815 build_indirect_ref (addr, NULL_PTR), member);
1816 return convert_from_reference (expr);
1819 /* Ensure that we have an object. */
1820 if (is_dummy_object (base))
1821 addr = error_mark_node;
1823 /* If this is a reference to a member function, then return the
1824 address of the member function (which may involve going
1825 through the object's vtable), otherwise, return an expression
1826 for the dereferenced pointer-to-member construct. */
1827 addr = build_unary_op (ADDR_EXPR, base, 0);
1829 if (TYPE_PTRMEM_P (TREE_TYPE (member)))
1831 if (addr == error_mark_node)
1833 cp_error ("object missing in `%E'", exp);
1834 return error_mark_node;
1837 basetype = TYPE_OFFSET_BASETYPE (TREE_TYPE (TREE_TYPE (member)));
1838 addr = convert_pointer_to (basetype, addr);
1839 member = cp_convert (ptrdiff_type_node, member);
1841 /* Pointer to data members are offset by one, so that a null
1842 pointer with a real value of 0 is distinguishable from an
1843 offset of the first member of a structure. */
1844 member = build_binary_op (MINUS_EXPR, member,
1845 cp_convert (ptrdiff_type_node, integer_one_node));
1847 return build1 (INDIRECT_REF, type,
1848 build (PLUS_EXPR, build_pointer_type (type),
1851 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member)))
1853 return get_member_function_from_ptrfunc (&addr, member);
1855 my_friendly_abort (56);
1860 /* Return either DECL or its known constant value (if it has one). */
1863 decl_constant_value (decl)
1866 if (! TREE_THIS_VOLATILE (decl)
1867 && DECL_INITIAL (decl)
1868 && DECL_INITIAL (decl) != error_mark_node
1869 /* This is invalid if initial value is not constant.
1870 If it has either a function call, a memory reference,
1871 or a variable, then re-evaluating it could give different results. */
1872 && TREE_CONSTANT (DECL_INITIAL (decl))
1873 /* Check for cases where this is sub-optimal, even though valid. */
1874 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1875 return DECL_INITIAL (decl);
1879 /* Common subroutines of build_new and build_vec_delete. */
1881 /* Call the global __builtin_delete to delete ADDR. */
1884 build_builtin_delete_call (addr)
1887 mark_used (global_delete_fndecl);
1888 return build_call (global_delete_fndecl,
1889 void_type_node, build_expr_list (NULL_TREE, addr));
1892 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1893 (which needs to go through some sort of groktypename) or it
1894 is the name of the class we are newing. INIT is an initialization value.
1895 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1896 If INIT is void_type_node, it means do *not* call a constructor
1899 For types with constructors, the data returned is initialized
1900 by the appropriate constructor.
1902 Whether the type has a constructor or not, if it has a pointer
1903 to a virtual function table, then that pointer is set up
1906 Unless I am mistaken, a call to new () will return initialized
1907 data regardless of whether the constructor itself is private or
1908 not. NOPE; new fails if the constructor is private (jcm).
1910 Note that build_new does nothing to assure that any special
1911 alignment requirements of the type are met. Rather, it leaves
1912 it up to malloc to do the right thing. Otherwise, folding to
1913 the right alignment cal cause problems if the user tries to later
1914 free the memory returned by `new'.
1916 PLACEMENT is the `placement' list for user-defined operator new (). */
1918 extern int flag_check_new;
1921 build_new (placement, decl, init, use_global_new)
1927 tree nelts = NULL_TREE, t;
1930 tree pending_sizes = NULL_TREE;
1932 if (decl == error_mark_node)
1933 return error_mark_node;
1935 if (TREE_CODE (decl) == TREE_LIST)
1937 tree absdcl = TREE_VALUE (decl);
1938 tree last_absdcl = NULL_TREE;
1939 int old_immediate_size_expand = 0;
1941 if (current_function_decl
1942 && DECL_CONSTRUCTOR_P (current_function_decl))
1944 old_immediate_size_expand = immediate_size_expand;
1945 immediate_size_expand = 0;
1948 nelts = integer_one_node;
1950 if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1951 my_friendly_abort (215);
1952 while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1954 last_absdcl = absdcl;
1955 absdcl = TREE_OPERAND (absdcl, 0);
1958 if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1960 /* probably meant to be a vec new */
1963 while (TREE_OPERAND (absdcl, 0)
1964 && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1966 last_absdcl = absdcl;
1967 absdcl = TREE_OPERAND (absdcl, 0);
1971 this_nelts = TREE_OPERAND (absdcl, 1);
1972 if (this_nelts != error_mark_node)
1974 if (this_nelts == NULL_TREE)
1975 error ("new of array type fails to specify size");
1976 else if (processing_template_decl)
1979 absdcl = TREE_OPERAND (absdcl, 0);
1983 int flags = pedantic ? WANT_INT : (WANT_INT | WANT_ENUM);
1984 if (build_expr_type_conversion (flags, this_nelts, 0)
1986 pedwarn ("size in array new must have integral type");
1988 this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1989 absdcl = TREE_OPERAND (absdcl, 0);
1990 if (this_nelts == integer_zero_node)
1992 warning ("zero size array reserves no space");
1993 nelts = integer_zero_node;
1996 nelts = build_binary_op (MULT_EXPR, nelts, this_nelts);
2000 nelts = integer_zero_node;
2004 TREE_OPERAND (last_absdcl, 0) = absdcl;
2006 TREE_VALUE (decl) = absdcl;
2008 type = groktypename (decl);
2009 if (! type || type == error_mark_node)
2011 immediate_size_expand = old_immediate_size_expand;
2012 return error_mark_node;
2015 if (current_function_decl
2016 && DECL_CONSTRUCTOR_P (current_function_decl))
2018 pending_sizes = get_pending_sizes ();
2019 immediate_size_expand = old_immediate_size_expand;
2022 else if (TREE_CODE (decl) == IDENTIFIER_NODE)
2024 if (IDENTIFIER_HAS_TYPE_VALUE (decl))
2026 /* An aggregate type. */
2027 type = IDENTIFIER_TYPE_VALUE (decl);
2028 decl = TYPE_MAIN_DECL (type);
2032 /* A builtin type. */
2033 decl = lookup_name (decl, 1);
2034 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
2035 type = TREE_TYPE (decl);
2038 else if (TREE_CODE (decl) == TYPE_DECL)
2040 type = TREE_TYPE (decl);
2045 decl = TYPE_MAIN_DECL (type);
2048 if (processing_template_decl)
2051 t = min_tree_cons (min_tree_cons (NULL_TREE, type, NULL_TREE),
2052 build_min_nt (ARRAY_REF, NULL_TREE, nelts),
2057 rval = build_min_nt (NEW_EXPR, placement, t, init);
2058 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2062 /* ``A reference cannot be created by the new operator. A reference
2063 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2064 returned by new.'' ARM 5.3.3 */
2065 if (TREE_CODE (type) == REFERENCE_TYPE)
2067 error ("new cannot be applied to a reference type");
2068 type = TREE_TYPE (type);
2071 if (TREE_CODE (type) == FUNCTION_TYPE)
2073 error ("new cannot be applied to a function type");
2074 return error_mark_node;
2077 /* When the object being created is an array, the new-expression yields a
2078 pointer to the initial element (if any) of the array. For example,
2079 both new int and new int[10] return an int*. 5.3.4. */
2080 if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
2082 nelts = array_type_nelts_top (type);
2084 type = TREE_TYPE (type);
2088 t = build_nt (ARRAY_REF, type, nelts);
2092 rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
2093 NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
2094 TREE_SIDE_EFFECTS (rval) = 1;
2096 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2097 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
2098 TREE_NO_UNUSED_WARNING (rval) = 1;
2101 rval = build_compound_expr (chainon (pending_sizes,
2102 build_expr_list (NULL_TREE, rval)));
2107 /* If non-NULL, a POINTER_TYPE equivalent to (java::lang::Class*). */
2109 static tree jclass_node = NULL_TREE;
2111 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2114 build_java_class_ref (type)
2117 tree name, class_decl;
2118 static tree CL_prefix = NULL_TREE;
2119 if (CL_prefix == NULL_TREE)
2120 CL_prefix = get_identifier("_CL_");
2121 if (jclass_node == NULL_TREE)
2123 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier("jclass"));
2124 if (jclass_node == NULL_TREE)
2125 fatal("call to Java constructor, while `jclass' undefined");
2126 jclass_node = TREE_TYPE (jclass_node);
2128 name = build_overload_with_type (CL_prefix, type);
2129 class_decl = IDENTIFIER_GLOBAL_VALUE (name);
2130 if (class_decl == NULL_TREE)
2132 push_obstacks_nochange ();
2133 end_temporary_allocation ();
2134 class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
2135 TREE_STATIC (class_decl) = 1;
2136 DECL_EXTERNAL (class_decl) = 1;
2137 TREE_PUBLIC (class_decl) = 1;
2138 DECL_ARTIFICIAL (class_decl) = 1;
2139 DECL_IGNORED_P (class_decl) = 1;
2140 pushdecl_top_level (class_decl);
2141 make_decl_rtl (class_decl, NULL_PTR, 1);
2147 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2148 value is immediately handed to expand_expr. */
2154 tree placement, init;
2155 tree type, true_type, size, rval;
2156 tree nelts = NULL_TREE;
2157 tree alloc_expr, alloc_node = NULL_TREE;
2159 enum tree_code code = NEW_EXPR;
2160 int use_cookie, nothrow, check_new;
2162 int use_java_new = 0;
2164 placement = TREE_OPERAND (exp, 0);
2165 type = TREE_OPERAND (exp, 1);
2166 init = TREE_OPERAND (exp, 2);
2167 use_global_new = NEW_EXPR_USE_GLOBAL (exp);
2169 if (TREE_CODE (type) == ARRAY_REF)
2172 nelts = TREE_OPERAND (type, 1);
2173 type = TREE_OPERAND (type, 0);
2177 if (CP_TYPE_QUALS (type))
2178 type = TYPE_MAIN_VARIANT (type);
2180 /* If our base type is an array, then make sure we know how many elements
2182 while (TREE_CODE (true_type) == ARRAY_TYPE)
2184 tree this_nelts = array_type_nelts_top (true_type);
2185 nelts = build_binary_op (MULT_EXPR, nelts, this_nelts);
2186 true_type = TREE_TYPE (true_type);
2189 if (!complete_type_or_else (true_type, exp))
2190 return error_mark_node;
2193 size = fold (build_binary_op (MULT_EXPR, size_in_bytes (true_type),
2196 size = size_in_bytes (type);
2198 if (TREE_CODE (true_type) == VOID_TYPE)
2200 error ("invalid type `void' for new");
2201 return error_mark_node;
2204 if (TYPE_LANG_SPECIFIC (true_type)
2205 && CLASSTYPE_ABSTRACT_VIRTUALS (true_type))
2207 abstract_virtuals_error (NULL_TREE, true_type);
2208 return error_mark_node;
2211 if (TYPE_LANG_SPECIFIC (true_type) && IS_SIGNATURE (true_type))
2213 signature_error (NULL_TREE, true_type);
2214 return error_mark_node;
2217 /* When we allocate an array, and the corresponding deallocation
2218 function takes a second argument of type size_t, and that's the
2219 "usual deallocation function", we allocate some extra space at
2220 the beginning of the array to store the size of the array.
2222 Well, that's what we should do. For backwards compatibility, we
2223 have to do this whenever there's a two-argument array-delete
2226 FIXME: For -fnew-abi, we don't have to maintain backwards
2227 compatibility and we should fix this. */
2228 use_cookie = (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type)
2229 && ! (placement && ! TREE_CHAIN (placement)
2230 && TREE_TYPE (TREE_VALUE (placement)) == ptr_type_node));
2234 tree extra = BI_header_size;
2236 size = size_binop (PLUS_EXPR, size, extra);
2241 code = VEC_NEW_EXPR;
2243 if (init && pedantic)
2244 cp_pedwarn ("initialization in array new");
2247 /* Allocate the object. */
2249 if (! has_array && ! placement && flag_this_is_variable > 0
2250 && TYPE_NEEDS_CONSTRUCTING (true_type) && init != void_type_node)
2252 if (init == NULL_TREE || TREE_CODE (init) == TREE_LIST)
2256 error ("constructors take parameter lists");
2257 return error_mark_node;
2260 else if (! placement && TYPE_FOR_JAVA (true_type))
2262 tree class_addr, alloc_decl;
2263 tree class_decl = build_java_class_ref (true_type);
2264 tree class_size = size_in_bytes (true_type);
2265 static char alloc_name[] = "_Jv_AllocObject";
2267 alloc_decl = IDENTIFIER_GLOBAL_VALUE (get_identifier (alloc_name));
2268 if (alloc_decl == NULL_TREE)
2269 fatal("call to Java constructor, while `%s' undefined", alloc_name);
2270 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2271 rval = build_function_call (alloc_decl,
2272 tree_cons (NULL_TREE, class_addr,
2273 build_tree_list (NULL_TREE,
2275 rval = cp_convert (build_pointer_type (true_type), rval);
2281 if (flag_exceptions)
2282 /* We will use RVAL when generating an exception handler for
2283 this new-expression, so we must save it. */
2284 susp = suspend_momentary ();
2286 rval = build_op_new_call
2287 (code, true_type, expr_tree_cons (NULL_TREE, size, placement),
2288 LOOKUP_NORMAL | (use_global_new * LOOKUP_GLOBAL));
2289 rval = cp_convert (build_pointer_type (true_type), rval);
2291 if (flag_exceptions)
2292 resume_momentary (susp);
2295 /* unless an allocation function is declared with an empty excep-
2296 tion-specification (_except.spec_), throw(), it indicates failure to
2297 allocate storage by throwing a bad_alloc exception (clause _except_,
2298 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2299 cation function is declared with an empty exception-specification,
2300 throw(), it returns null to indicate failure to allocate storage and a
2301 non-null pointer otherwise.
2303 So check for a null exception spec on the op new we just called. */
2308 /* The CALL_EXPR. */
2309 tree t = TREE_OPERAND (rval, 0);
2311 t = TREE_OPERAND (TREE_OPERAND (t, 0), 0);
2312 nothrow = TYPE_NOTHROW_P (TREE_TYPE (t));
2314 check_new = (flag_check_new || nothrow) && ! use_java_new;
2316 if ((check_new || flag_exceptions) && rval)
2318 alloc_expr = get_target_expr (rval);
2319 alloc_node = rval = TREE_OPERAND (alloc_expr, 0);
2322 alloc_expr = NULL_TREE;
2324 /* if rval is NULL_TREE I don't have to allocate it, but are we totally
2325 sure we have some extra bytes in that case for the BI_header_size
2326 cookies? And how does that interact with the code below? (mrs) */
2327 /* Finish up some magic for new'ed arrays */
2328 if (use_cookie && rval != NULL_TREE)
2330 tree extra = BI_header_size;
2332 rval = convert (string_type_node, rval); /* for ptr arithmetic */
2333 rval = save_expr (build_binary_op (PLUS_EXPR, rval, extra));
2334 /* Store header info. */
2335 cookie = build_indirect_ref (build (MINUS_EXPR,
2336 build_pointer_type (BI_header_type),
2337 rval, extra), NULL_PTR);
2338 exp1 = build (MODIFY_EXPR, void_type_node,
2339 build_component_ref (cookie, nc_nelts_field_id,
2342 TREE_SIDE_EFFECTS (exp1) = 1;
2343 rval = cp_convert (build_pointer_type (true_type), rval);
2344 rval = build_compound_expr
2345 (expr_tree_cons (NULL_TREE, exp1,
2346 build_expr_list (NULL_TREE, rval)));
2349 if (rval == error_mark_node)
2350 return error_mark_node;
2352 /* Don't call any constructors or do any initialization. */
2353 if (init == void_type_node)
2356 if (TYPE_NEEDS_CONSTRUCTING (type) || init)
2358 if (! TYPE_NEEDS_CONSTRUCTING (type)
2359 && ! IS_AGGR_TYPE (type) && ! has_array)
2361 /* We are processing something like `new int (10)', which
2362 means allocate an int, and initialize it with 10. */
2366 /* At present RVAL is a temporary variable, created to hold
2367 the value from the call to `operator new'. We transform
2368 it to (*RVAL = INIT, RVAL). */
2369 rval = save_expr (rval);
2370 deref = build_indirect_ref (rval, NULL_PTR);
2372 /* Even for something like `new const int (10)' we must
2373 allow the expression to be non-const while we do the
2375 deref_type = TREE_TYPE (deref);
2376 if (CP_TYPE_CONST_P (deref_type))
2378 = cp_build_qualified_type (deref_type,
2379 CP_TYPE_QUALS (deref_type)
2380 & ~TYPE_QUAL_CONST);
2381 TREE_READONLY (deref) = 0;
2383 if (TREE_CHAIN (init) != NULL_TREE)
2384 pedwarn ("initializer list being treated as compound expression");
2385 else if (TREE_CODE (init) == CONSTRUCTOR)
2387 pedwarn ("initializer list appears where operand should be used");
2388 init = TREE_OPERAND (init, 1);
2390 init = build_compound_expr (init);
2392 init = convert_for_initialization (deref, type, init, LOOKUP_NORMAL,
2393 "new", NULL_TREE, 0);
2394 rval = build (COMPOUND_EXPR, TREE_TYPE (rval),
2395 build_modify_expr (deref, NOP_EXPR, init),
2397 TREE_NO_UNUSED_WARNING (rval) = 1;
2398 TREE_SIDE_EFFECTS (rval) = 1;
2400 else if (! has_array)
2403 /* Constructors are never virtual. If it has an initialization, we
2404 need to complain if we aren't allowed to use the ctor that took
2406 int flags = LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_COMPLAIN;
2408 if (rval && TYPE_USES_VIRTUAL_BASECLASSES (true_type))
2410 init = expr_tree_cons (NULL_TREE, integer_one_node, init);
2411 flags |= LOOKUP_HAS_IN_CHARGE;
2415 rval = save_expr (rval);
2418 if (newrval && TREE_CODE (TREE_TYPE (newrval)) == POINTER_TYPE)
2419 newrval = build_indirect_ref (newrval, NULL_PTR);
2421 newrval = build_method_call (newrval, ctor_identifier,
2422 init, TYPE_BINFO (true_type), flags);
2424 if (newrval == NULL_TREE || newrval == error_mark_node)
2425 return error_mark_node;
2427 /* Java constructors compiled by jc1 do not return this. */
2429 newrval = build (COMPOUND_EXPR, TREE_TYPE (newrval),
2432 TREE_HAS_CONSTRUCTOR (rval) = 1;
2435 rval = build (VEC_INIT_EXPR, TREE_TYPE (rval),
2436 save_expr (rval), init, nelts);
2438 /* If any part of the object initialization terminates by throwing an
2439 exception and a suitable deallocation function can be found, the
2440 deallocation function is called to free the memory in which the
2441 object was being constructed, after which the exception continues
2442 to propagate in the context of the new-expression. If no
2443 unambiguous matching deallocation function can be found,
2444 propagating the exception does not cause the object's memory to be
2446 if (flag_exceptions && alloc_expr && ! use_java_new)
2448 enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2449 tree cleanup, fn = NULL_TREE;
2450 int flags = LOOKUP_NORMAL | (use_global_new * LOOKUP_GLOBAL);
2452 /* All cleanups must last longer than normal. */
2453 int yes = suspend_momentary ();
2455 /* The Standard is unclear here, but the right thing to do
2456 is to use the same method for finding deallocation
2457 functions that we use for finding allocation functions. */
2458 flags |= LOOKUP_SPECULATIVELY;
2460 /* We expect alloc_expr to look like a TARGET_EXPR around
2461 a NOP_EXPR around the CALL_EXPR we want. */
2462 fn = TREE_OPERAND (alloc_expr, 1);
2463 fn = TREE_OPERAND (fn, 0);
2465 /* Copy size to the saveable obstack. */
2466 size = mapcar (size, permanent_p);
2468 cleanup = build_op_delete_call (dcode, alloc_node, size, flags, fn);
2470 resume_momentary (yes);
2472 /* Ack! First we allocate the memory. Then we set our sentry
2473 variable to true, and expand a cleanup that deletes the memory
2474 if sentry is true. Then we run the constructor and store the
2475 returned pointer in buf. Then we clear sentry and return buf. */
2479 tree end, sentry, begin, buf, t = TREE_TYPE (rval);
2481 begin = get_target_expr (boolean_true_node);
2482 sentry = TREE_OPERAND (begin, 0);
2484 yes = suspend_momentary ();
2485 TREE_OPERAND (begin, 2)
2486 = build (COND_EXPR, void_type_node, sentry,
2487 cleanup, void_zero_node);
2488 resume_momentary (yes);
2490 rval = get_target_expr (rval);
2492 end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2493 sentry, boolean_false_node);
2494 TREE_SIDE_EFFECTS (end) = 1;
2496 buf = TREE_OPERAND (rval, 0);
2498 rval = build (COMPOUND_EXPR, t, begin,
2499 build (COMPOUND_EXPR, t, rval,
2500 build (COMPOUND_EXPR, t, end, buf)));
2504 else if (CP_TYPE_CONST_P (true_type))
2505 cp_error ("uninitialized const in `new' of `%#T'", true_type);
2509 if (alloc_expr && rval == alloc_node)
2511 rval = TREE_OPERAND (alloc_expr, 1);
2512 alloc_expr = NULL_TREE;
2515 if (check_new && alloc_expr)
2517 /* Did we modify the storage? */
2518 tree ifexp = build_binary_op (NE_EXPR, alloc_node,
2520 rval = build_conditional_expr (ifexp, rval, alloc_node);
2524 rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2526 if (rval && TREE_TYPE (rval) != build_pointer_type (type))
2528 /* The type of new int [3][3] is not int *, but int [3] * */
2529 rval = build_c_cast (build_pointer_type (type), rval);
2536 build_vec_delete_1 (base, maxindex, type, auto_delete_vec, auto_delete,
2538 tree base, maxindex, type;
2539 tree auto_delete_vec, auto_delete;
2540 int use_global_delete;
2543 tree ptype = build_pointer_type (type = complete_type (type));
2544 tree size_exp = size_in_bytes (type);
2546 /* Temporary variables used by the loop. */
2547 tree tbase, tbase_init;
2549 /* This is the body of the loop that implements the deletion of a
2550 single element, and moves temp variables to next elements. */
2553 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2556 /* This is the thing that governs what to do after the loop has run. */
2557 tree deallocate_expr = 0;
2559 /* This is the BIND_EXPR which holds the outermost iterator of the
2560 loop. It is convenient to set this variable up and test it before
2561 executing any other code in the loop.
2562 This is also the containing expression returned by this function. */
2563 tree controller = NULL_TREE;
2565 if (! IS_AGGR_TYPE (type) || ! TYPE_NEEDS_DESTRUCTOR (type))
2567 loop = integer_zero_node;
2571 /* The below is short by BI_header_size */
2572 virtual_size = fold (size_binop (MULT_EXPR, size_exp, maxindex));
2574 tbase = build_decl (VAR_DECL, NULL_TREE, ptype);
2575 tbase_init = build_modify_expr (tbase, NOP_EXPR,
2576 fold (build (PLUS_EXPR, ptype,
2579 DECL_REGISTER (tbase) = 1;
2580 controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2581 TREE_SIDE_EFFECTS (controller) = 1;
2583 if (auto_delete != integer_zero_node
2584 && auto_delete != integer_two_node)
2586 tree base_tbd = cp_convert (ptype,
2587 build_binary_op (MINUS_EXPR,
2588 cp_convert (ptr_type_node, base),
2590 /* This is the real size */
2591 virtual_size = size_binop (PLUS_EXPR, virtual_size, BI_header_size);
2592 body = build_expr_list (NULL_TREE,
2593 build_x_delete (base_tbd,
2594 2 | use_global_delete,
2596 body = build (COND_EXPR, void_type_node,
2597 build (BIT_AND_EXPR, integer_type_node,
2598 auto_delete, integer_one_node),
2599 body, integer_zero_node);
2604 body = expr_tree_cons (NULL_TREE,
2605 build_delete (ptype, tbase, auto_delete,
2606 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1),
2609 body = expr_tree_cons (NULL_TREE,
2610 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
2613 body = expr_tree_cons (NULL_TREE,
2614 build (EXIT_EXPR, void_type_node,
2615 build (EQ_EXPR, boolean_type_node, base, tbase)),
2618 loop = build (LOOP_EXPR, void_type_node, build_compound_expr (body));
2620 loop = expr_tree_cons (NULL_TREE, tbase_init,
2621 expr_tree_cons (NULL_TREE, loop, NULL_TREE));
2622 loop = build_compound_expr (loop);
2625 /* If the delete flag is one, or anything else with the low bit set,
2626 delete the storage. */
2627 if (auto_delete_vec == integer_zero_node)
2628 deallocate_expr = integer_zero_node;
2633 /* The below is short by BI_header_size */
2634 virtual_size = fold (size_binop (MULT_EXPR, size_exp, maxindex));
2636 if (! TYPE_VEC_NEW_USES_COOKIE (type))
2641 base_tbd = cp_convert (ptype,
2642 build_binary_op (MINUS_EXPR,
2643 cp_convert (string_type_node, base),
2645 /* True size with header. */
2646 virtual_size = size_binop (PLUS_EXPR, virtual_size, BI_header_size);
2648 deallocate_expr = build_x_delete (base_tbd,
2649 2 | use_global_delete,
2651 if (auto_delete_vec != integer_one_node)
2652 deallocate_expr = build (COND_EXPR, void_type_node,
2653 build (BIT_AND_EXPR, integer_type_node,
2654 auto_delete_vec, integer_one_node),
2655 deallocate_expr, integer_zero_node);
2658 if (loop && deallocate_expr != integer_zero_node)
2660 body = expr_tree_cons (NULL_TREE, loop,
2661 expr_tree_cons (NULL_TREE, deallocate_expr, NULL_TREE));
2662 body = build_compound_expr (body);
2667 /* Outermost wrapper: If pointer is null, punt. */
2668 body = build (COND_EXPR, void_type_node,
2669 build (NE_EXPR, boolean_type_node, base, integer_zero_node),
2670 body, integer_zero_node);
2671 body = build1 (NOP_EXPR, void_type_node, body);
2675 TREE_OPERAND (controller, 1) = body;
2679 return cp_convert (void_type_node, body);
2682 /* Protect the vector initialization with a try-block so that we can
2683 destroy the first few elements if constructing a later element
2684 causes an exception to be thrown. TYPE is the type of the array
2688 expand_vec_init_try_block (type)
2691 if (!TYPE_NEEDS_DESTRUCTOR (type) || !flag_exceptions)
2694 /* The code we generate looks like:
2697 // Initialize the vector.
2699 // Destory the elements that need destroying.
2703 Here we're just beginning the `try'. */
2705 expand_eh_region_start ();
2708 /* Add code to destroy the array elements constructed so far if the
2709 construction of some element in the array causes an exception to be
2710 thrown. RVAL is the address of the last element in the array.
2711 TYPE is the type of the array elements. MAXINDEX is the maximum
2712 allowable index into the array. ITERATOR is an integer variable
2713 indicating how many elements remain to be constructed. */
2716 expand_vec_init_catch_clause (rval, type, maxindex, iterator)
2725 if (!TYPE_NEEDS_DESTRUCTOR (type) || !flag_exceptions)
2728 /* We have to ensure that this can live to the cleanup expansion
2729 time, since we know it is only ever needed once, generate code
2731 push_obstacks_nochange ();
2732 resume_temporary_allocation ();
2734 cleanup = make_node (RTL_EXPR);
2735 TREE_TYPE (cleanup) = void_type_node;
2736 RTL_EXPR_RTL (cleanup) = const0_rtx;
2737 TREE_SIDE_EFFECTS (cleanup) = 1;
2738 do_pending_stack_adjust ();
2739 start_sequence_for_rtl_expr (cleanup);
2741 e = build_vec_delete_1 (rval,
2742 build_binary_op (MINUS_EXPR, maxindex,
2745 /*auto_delete_vec=*/integer_zero_node,
2746 /*auto_delete=*/integer_zero_node,
2747 /*use_global_delete=*/0);
2748 expand_expr (e, const0_rtx, VOIDmode, EXPAND_NORMAL);
2750 do_pending_stack_adjust ();
2751 RTL_EXPR_SEQUENCE (cleanup) = get_insns ();
2753 cleanup = protect_with_terminate (cleanup);
2754 expand_eh_region_end (cleanup);
2758 /* `expand_vec_init' performs initialization of a vector of aggregate
2761 DECL is passed only for error reporting, and provides line number
2762 and source file name information.
2763 BASE is the space where the vector will be.
2764 MAXINDEX is the maximum index of the array (one less than the
2765 number of elements).
2766 INIT is the (possibly NULL) initializer.
2768 FROM_ARRAY is 0 if we should init everything with INIT
2769 (i.e., every element initialized from INIT).
2770 FROM_ARRAY is 1 if we should index into INIT in parallel
2771 with initialization of DECL.
2772 FROM_ARRAY is 2 if we should index into INIT in parallel,
2773 but use assignment instead of initialization. */
2776 expand_vec_init (decl, base, maxindex, init, from_array)
2777 tree decl, base, maxindex, init;
2781 tree base2 = NULL_TREE;
2782 tree type = TREE_TYPE (TREE_TYPE (base));
2784 tree itype = NULL_TREE;
2786 int num_initialized_elts = 0;
2788 maxindex = cp_convert (ptrdiff_type_node, maxindex);
2789 if (maxindex == error_mark_node)
2790 return error_mark_node;
2792 if (current_function_decl == NULL_TREE)
2794 rval = make_tree_vec (3);
2795 TREE_VEC_ELT (rval, 0) = base;
2796 TREE_VEC_ELT (rval, 1) = maxindex;
2797 TREE_VEC_ELT (rval, 2) = init;
2801 size = size_in_bytes (type);
2803 base = default_conversion (base);
2804 base = cp_convert (build_pointer_type (type), base);
2805 rval = get_temp_regvar (build_pointer_type (type), base);
2806 base = get_temp_regvar (build_pointer_type (type), base);
2807 iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2809 /* Protect the entire array initialization so that we can destroy
2810 the partially constructed array if an exception is thrown. */
2811 expand_vec_init_try_block (type);
2813 if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR
2814 && (!decl || same_type_p (TREE_TYPE (init), TREE_TYPE (decl))))
2816 /* Do non-default initialization resulting from brace-enclosed
2820 tree baseref = build1 (INDIRECT_REF, type, base);
2824 for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2826 tree elt = TREE_VALUE (elts);
2828 num_initialized_elts++;
2830 if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2831 expand_aggr_init (baseref, elt, 0);
2833 expand_assignment (baseref, elt, 0, 0);
2835 expand_assignment (base,
2836 build (PLUS_EXPR, build_pointer_type (type),
2839 expand_assignment (iterator,
2840 build (MINUS_EXPR, ptrdiff_type_node,
2841 iterator, integer_one_node),
2845 /* Clear out INIT so that we don't get confused below. */
2849 use_variable (DECL_RTL (base));
2851 else if (from_array)
2853 /* If initializing one array from another, initialize element by
2854 element. We rely upon the below calls the do argument
2856 if (decl == NULL_TREE)
2858 sorry ("initialization of array from dissimilar array type");
2859 return error_mark_node;
2863 base2 = default_conversion (init);
2864 itype = TREE_TYPE (base2);
2865 base2 = get_temp_regvar (itype, base2);
2866 itype = TREE_TYPE (itype);
2868 else if (TYPE_LANG_SPECIFIC (type)
2869 && TYPE_NEEDS_CONSTRUCTING (type)
2870 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2872 error ("initializer ends prematurely");
2873 return error_mark_node;
2877 /* Now, default-initialize any remaining elements. We don't need to
2878 do that if a) the type does not need constructing, or b) we've
2879 already initialized all the elements.
2881 We do need to keep going if we're copying an array. */
2884 || (TYPE_NEEDS_CONSTRUCTING (type)
2885 && !(TREE_CODE (maxindex) == INTEGER_CST
2886 && num_initialized_elts == TREE_INT_CST_LOW (maxindex) + 1)))
2888 /* If the ITERATOR is equal to -1, then we don't have to loop;
2889 we've already initialized all the elements. */
2890 expand_start_cond (build (NE_EXPR, boolean_type_node,
2891 iterator, minus_one),
2894 /* Otherwise, loop through the elements. */
2895 expand_start_loop_continue_elsewhere (1);
2897 /* The initialization of each array element is a full-expression. */
2898 expand_start_target_temps ();
2902 tree to = build1 (INDIRECT_REF, type, base);
2906 from = build1 (INDIRECT_REF, itype, base2);
2910 if (from_array == 2)
2911 expand_expr_stmt (build_modify_expr (to, NOP_EXPR, from));
2912 else if (TYPE_NEEDS_CONSTRUCTING (type))
2913 expand_aggr_init (to, from, 0);
2915 expand_assignment (to, from, 0, 0);
2917 my_friendly_abort (57);
2919 else if (TREE_CODE (type) == ARRAY_TYPE)
2922 sorry ("cannot initialize multi-dimensional array with initializer");
2923 expand_vec_init (decl,
2925 build_pointer_type (TREE_TYPE
2928 array_type_nelts (type), 0, 0);
2931 expand_aggr_init (build1 (INDIRECT_REF, type, base), init, 0);
2933 expand_assignment (base,
2934 build (PLUS_EXPR, build_pointer_type (type),
2937 expand_assignment (base2,
2938 build (PLUS_EXPR, build_pointer_type (type),
2939 base2, size), 0, 0);
2941 /* Cleanup any temporaries needed for the initial value. */
2942 expand_end_target_temps ();
2944 expand_loop_continue_here ();
2945 expand_exit_loop_if_false (0, build (NE_EXPR, boolean_type_node,
2946 build (PREDECREMENT_EXPR,
2954 use_variable (DECL_RTL (base));
2956 use_variable (DECL_RTL (base2));
2963 /* Make sure to cleanup any partially constructed elements. */
2964 expand_vec_init_catch_clause (rval, type, maxindex, iterator);
2968 use_variable (DECL_RTL (iterator));
2969 use_variable (DECL_RTL (rval));
2975 /* Free up storage of type TYPE, at address ADDR.
2977 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2980 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2981 used as the second argument to operator delete. It can include
2982 things like padding and magic size cookies. It has virtual in it,
2983 because if you have a base pointer and you delete through a virtual
2984 destructor, it should be the size of the dynamic object, not the
2985 static object, see Free Store 12.5 ANSI C++ WP.
2987 This does not call any destructors. */
2990 build_x_delete (addr, which_delete, virtual_size)
2995 int use_global_delete = which_delete & 1;
2996 int use_vec_delete = !!(which_delete & 2);
2997 enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2998 int flags = LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL);
3000 return build_op_delete_call (code, addr, virtual_size, flags, NULL_TREE);
3003 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3004 ADDR is an expression which yields the store to be destroyed.
3005 AUTO_DELETE is nonzero if a call to DELETE should be made or not.
3006 If in the program, (AUTO_DELETE & 2) is non-zero, we tear down the
3007 virtual baseclasses.
3008 If in the program, (AUTO_DELETE & 1) is non-zero, then we deallocate.
3010 FLAGS is the logical disjunction of zero or more LOOKUP_
3011 flags. See cp-tree.h for more info.
3013 This function does not delete an object's virtual base classes. */
3016 build_delete (type, addr, auto_delete, flags, use_global_delete)
3020 int use_global_delete;
3026 if (addr == error_mark_node)
3027 return error_mark_node;
3029 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3030 set to `error_mark_node' before it gets properly cleaned up. */
3031 if (type == error_mark_node)
3032 return error_mark_node;
3034 type = TYPE_MAIN_VARIANT (type);
3036 if (TREE_CODE (type) == POINTER_TYPE)
3038 type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3039 if (type != void_type_node && !complete_type_or_else (type, addr))
3040 return error_mark_node;
3041 if (TREE_CODE (type) == ARRAY_TYPE)
3043 if (! IS_AGGR_TYPE (type))
3045 /* Call the builtin operator delete. */
3046 return build_builtin_delete_call (addr);
3048 if (TREE_SIDE_EFFECTS (addr))
3049 addr = save_expr (addr);
3051 /* throw away const and volatile on target type of addr */
3052 addr = convert_force (build_pointer_type (type), addr, 0);
3053 ref = build_indirect_ref (addr, NULL_PTR);
3055 else if (TREE_CODE (type) == ARRAY_TYPE)
3058 if (TREE_SIDE_EFFECTS (addr))
3059 addr = save_expr (addr);
3060 if (TYPE_DOMAIN (type) == NULL_TREE)
3062 error ("unknown array size in delete");
3063 return error_mark_node;
3065 return build_vec_delete (addr, array_type_nelts (type),
3066 auto_delete, integer_zero_node,
3071 /* Don't check PROTECT here; leave that decision to the
3072 destructor. If the destructor is accessible, call it,
3073 else report error. */
3074 addr = build_unary_op (ADDR_EXPR, addr, 0);
3075 if (TREE_SIDE_EFFECTS (addr))
3076 addr = save_expr (addr);
3078 if (TREE_CONSTANT (addr))
3079 addr = convert_pointer_to (type, addr);
3081 addr = convert_force (build_pointer_type (type), addr, 0);
3083 ref = build_indirect_ref (addr, NULL_PTR);
3086 my_friendly_assert (IS_AGGR_TYPE (type), 220);
3088 if (! TYPE_NEEDS_DESTRUCTOR (type))
3090 if (auto_delete == integer_zero_node)
3091 return void_zero_node;
3093 return build_op_delete_call
3094 (DELETE_EXPR, addr, c_sizeof_nowarn (type),
3095 LOOKUP_NORMAL | (use_global_delete * LOOKUP_GLOBAL),
3099 /* Below, we will reverse the order in which these calls are made.
3100 If we have a destructor, then that destructor will take care
3101 of the base classes; otherwise, we must do that here. */
3102 if (TYPE_HAS_DESTRUCTOR (type))
3104 tree passed_auto_delete;
3105 tree do_delete = NULL_TREE;
3108 if (use_global_delete)
3110 tree cond = fold (build (BIT_AND_EXPR, integer_type_node,
3111 auto_delete, integer_one_node));
3112 tree call = build_builtin_delete_call (addr);
3114 cond = fold (build (COND_EXPR, void_type_node, cond,
3115 call, void_zero_node));
3116 if (cond != void_zero_node)
3119 passed_auto_delete = fold (build (BIT_AND_EXPR, integer_type_node,
3120 auto_delete, integer_two_node));
3123 passed_auto_delete = auto_delete;
3125 expr = build_method_call
3126 (ref, dtor_identifier, build_expr_list (NULL_TREE, passed_auto_delete),
3130 expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
3132 if (flags & LOOKUP_DESTRUCTOR)
3133 /* Explicit destructor call; don't check for null pointer. */
3134 ifexp = integer_one_node;
3136 /* Handle deleting a null pointer. */
3137 ifexp = fold (build_binary_op (NE_EXPR, addr, integer_zero_node));
3139 if (ifexp != integer_one_node)
3140 expr = build (COND_EXPR, void_type_node,
3141 ifexp, expr, void_zero_node);
3147 /* We only get here from finish_function for a destructor. */
3148 tree binfos = BINFO_BASETYPES (TYPE_BINFO (type));
3149 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
3150 tree base_binfo = n_baseclasses > 0 ? TREE_VEC_ELT (binfos, 0) : NULL_TREE;
3151 tree exprstmt = NULL_TREE;
3152 tree parent_auto_delete = auto_delete;
3155 /* Set this again before we call anything, as we might get called
3157 TYPE_HAS_DESTRUCTOR (type) = 1;
3159 /* If we have member delete or vbases, we call delete in
3161 if (auto_delete == integer_zero_node)
3163 else if (base_binfo == NULL_TREE
3164 || ! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3166 cond = build (COND_EXPR, void_type_node,
3167 build (BIT_AND_EXPR, integer_type_node, auto_delete, integer_one_node),
3168 build_builtin_delete_call (addr),
3175 exprstmt = build_expr_list (NULL_TREE, cond);
3178 && ! TREE_VIA_VIRTUAL (base_binfo)
3179 && TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo)))
3181 tree this_auto_delete;
3183 if (BINFO_OFFSET_ZEROP (base_binfo))
3184 this_auto_delete = parent_auto_delete;
3186 this_auto_delete = integer_zero_node;
3188 expr = build_scoped_method_call
3189 (ref, base_binfo, dtor_identifier,
3190 build_expr_list (NULL_TREE, this_auto_delete));
3191 exprstmt = expr_tree_cons (NULL_TREE, expr, exprstmt);
3194 /* Take care of the remaining baseclasses. */
3195 for (i = 1; i < n_baseclasses; i++)
3197 base_binfo = TREE_VEC_ELT (binfos, i);
3198 if (! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo))
3199 || TREE_VIA_VIRTUAL (base_binfo))
3202 expr = build_scoped_method_call
3203 (ref, base_binfo, dtor_identifier,
3204 build_expr_list (NULL_TREE, integer_zero_node));
3206 exprstmt = expr_tree_cons (NULL_TREE, expr, exprstmt);
3209 for (member = TYPE_FIELDS (type); member; member = TREE_CHAIN (member))
3211 if (TREE_CODE (member) != FIELD_DECL)
3213 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (member)))
3215 tree this_member = build_component_ref (ref, DECL_NAME (member), NULL_TREE, 0);
3216 tree this_type = TREE_TYPE (member);
3217 expr = build_delete (this_type, this_member, integer_two_node, flags, 0);
3218 exprstmt = expr_tree_cons (NULL_TREE, expr, exprstmt);
3223 return build_compound_expr (exprstmt);
3224 /* Virtual base classes make this function do nothing. */
3225 return void_zero_node;
3229 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3232 build_vbase_delete (type, decl)
3235 tree vbases = CLASSTYPE_VBASECLASSES (type);
3236 tree result = NULL_TREE;
3237 tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3239 my_friendly_assert (addr != error_mark_node, 222);
3243 tree this_addr = convert_force (build_pointer_type (BINFO_TYPE (vbases)),
3245 result = expr_tree_cons (NULL_TREE,
3246 build_delete (TREE_TYPE (this_addr), this_addr,
3248 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0),
3250 vbases = TREE_CHAIN (vbases);
3252 return build_compound_expr (nreverse (result));
3255 /* Build a C++ vector delete expression.
3256 MAXINDEX is the number of elements to be deleted.
3257 ELT_SIZE is the nominal size of each element in the vector.
3258 BASE is the expression that should yield the store to be deleted.
3259 This function expands (or synthesizes) these calls itself.
3260 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3261 AUTO_DELETE say whether each item in the container should be deallocated.
3263 This also calls delete for virtual baseclasses of elements of the vector.
3265 Update: MAXINDEX is no longer needed. The size can be extracted from the
3266 start of the vector for pointers, and from the type for arrays. We still
3267 use MAXINDEX for arrays because it happens to already have one of the
3268 values we'd have to extract. (We could use MAXINDEX with pointers to
3269 confirm the size, and trap if the numbers differ; not clear that it'd
3270 be worth bothering.) */
3273 build_vec_delete (base, maxindex, auto_delete_vec, auto_delete,
3275 tree base, maxindex;
3276 tree auto_delete_vec, auto_delete;
3277 int use_global_delete;
3281 if (TREE_CODE (base) == OFFSET_REF)
3282 base = resolve_offset_ref (base);
3284 type = TREE_TYPE (base);
3286 base = stabilize_reference (base);
3288 /* Since we can use base many times, save_expr it. */
3289 if (TREE_SIDE_EFFECTS (base))
3290 base = save_expr (base);
3292 if (TREE_CODE (type) == POINTER_TYPE)
3294 /* Step back one from start of vector, and read dimension. */
3295 tree cookie_addr = build (MINUS_EXPR, build_pointer_type (BI_header_type),
3296 base, BI_header_size);
3297 tree cookie = build_indirect_ref (cookie_addr, NULL_PTR);
3298 maxindex = build_component_ref (cookie, nc_nelts_field_id, NULL_TREE, 0);
3300 type = TREE_TYPE (type);
3301 while (TREE_CODE (type) == ARRAY_TYPE);
3303 else if (TREE_CODE (type) == ARRAY_TYPE)
3305 /* get the total number of things in the array, maxindex is a bad name */
3306 maxindex = array_type_nelts_total (type);
3307 while (TREE_CODE (type) == ARRAY_TYPE)
3308 type = TREE_TYPE (type);
3309 base = build_unary_op (ADDR_EXPR, base, 1);
3313 if (base != error_mark_node)
3314 error ("type to vector delete is neither pointer or array type");
3315 return error_mark_node;
3318 return build_vec_delete_1 (base, maxindex, type, auto_delete_vec, auto_delete,