1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
24 /* High-level class interface. */
28 #include "coretypes.h"
39 #include "tree-dump.h"
41 /* The number of nested classes being processed. If we are not in the
42 scope of any class, this is zero. */
44 int current_class_depth;
46 /* In order to deal with nested classes, we keep a stack of classes.
47 The topmost entry is the innermost class, and is the entry at index
48 CURRENT_CLASS_DEPTH */
50 typedef struct class_stack_node {
51 /* The name of the class. */
54 /* The _TYPE node for the class. */
57 /* The access specifier pending for new declarations in the scope of
61 /* If were defining TYPE, the names used in this class. */
62 splay_tree names_used;
63 }* class_stack_node_t;
65 typedef struct vtbl_init_data_s
67 /* The base for which we're building initializers. */
69 /* The type of the most-derived type. */
71 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
72 unless ctor_vtbl_p is true. */
74 /* The negative-index vtable initializers built up so far. These
75 are in order from least negative index to most negative index. */
77 /* The last (i.e., most negative) entry in INITS. */
79 /* The binfo for the virtual base for which we're building
80 vcall offset initializers. */
82 /* The functions in vbase for which we have already provided vcall
85 /* The vtable index of the next vcall or vbase offset. */
87 /* Nonzero if we are building the initializer for the primary
90 /* Nonzero if we are building the initializer for a construction
93 /* True when adding vcall offset entries to the vtable. False when
94 merely computing the indices. */
95 bool generate_vcall_entries;
98 /* The type of a function passed to walk_subobject_offsets. */
99 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
101 /* The stack itself. This is a dynamically resized array. The
102 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
103 static int current_class_stack_size;
104 static class_stack_node_t current_class_stack;
106 /* An array of all local classes present in this translation unit, in
107 declaration order. */
108 VEC(tree,gc) *local_classes;
110 static tree get_vfield_name (tree);
111 static void finish_struct_anon (tree);
112 static tree get_vtable_name (tree);
113 static tree get_basefndecls (tree, tree);
114 static int build_primary_vtable (tree, tree);
115 static int build_secondary_vtable (tree);
116 static void finish_vtbls (tree);
117 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
118 static void finish_struct_bits (tree);
119 static int alter_access (tree, tree, tree);
120 static void handle_using_decl (tree, tree);
121 static tree dfs_modify_vtables (tree, void *);
122 static tree modify_all_vtables (tree, tree);
123 static void determine_primary_bases (tree);
124 static void finish_struct_methods (tree);
125 static void maybe_warn_about_overly_private_class (tree);
126 static int method_name_cmp (const void *, const void *);
127 static int resort_method_name_cmp (const void *, const void *);
128 static void add_implicitly_declared_members (tree, int, int);
129 static tree fixed_type_or_null (tree, int *, int *);
130 static tree resolve_address_of_overloaded_function (tree, tree, tsubst_flags_t,
132 static tree build_simple_base_path (tree expr, tree binfo);
133 static tree build_vtbl_ref_1 (tree, tree);
134 static tree build_vtbl_initializer (tree, tree, tree, tree, int *);
135 static int count_fields (tree);
136 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
137 static void check_bitfield_decl (tree);
138 static void check_field_decl (tree, tree, int *, int *, int *);
139 static void check_field_decls (tree, tree *, int *, int *);
140 static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
141 static void build_base_fields (record_layout_info, splay_tree, tree *);
142 static void check_methods (tree);
143 static void remove_zero_width_bit_fields (tree);
144 static void check_bases (tree, int *, int *);
145 static void check_bases_and_members (tree);
146 static tree create_vtable_ptr (tree, tree *);
147 static void include_empty_classes (record_layout_info);
148 static void layout_class_type (tree, tree *);
149 static void fixup_pending_inline (tree);
150 static void fixup_inline_methods (tree);
151 static void propagate_binfo_offsets (tree, tree);
152 static void layout_virtual_bases (record_layout_info, splay_tree);
153 static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *);
154 static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *);
155 static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *);
156 static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *);
157 static void add_vcall_offset (tree, tree, vtbl_init_data *);
158 static void layout_vtable_decl (tree, int);
159 static tree dfs_find_final_overrider_pre (tree, void *);
160 static tree dfs_find_final_overrider_post (tree, void *);
161 static tree find_final_overrider (tree, tree, tree);
162 static int make_new_vtable (tree, tree);
163 static int maybe_indent_hierarchy (FILE *, int, int);
164 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
165 static void dump_class_hierarchy (tree);
166 static void dump_class_hierarchy_1 (FILE *, int, tree);
167 static void dump_array (FILE *, tree);
168 static void dump_vtable (tree, tree, tree);
169 static void dump_vtt (tree, tree);
170 static void dump_thunk (FILE *, int, tree);
171 static tree build_vtable (tree, tree, tree);
172 static void initialize_vtable (tree, tree);
173 static void layout_nonempty_base_or_field (record_layout_info,
174 tree, tree, splay_tree);
175 static tree end_of_class (tree, int);
176 static bool layout_empty_base (tree, tree, splay_tree);
177 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree);
178 static tree dfs_accumulate_vtbl_inits (tree, tree, tree, tree,
180 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
181 static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *);
182 static void clone_constructors_and_destructors (tree);
183 static tree build_clone (tree, tree);
184 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
185 static void build_ctor_vtbl_group (tree, tree);
186 static void build_vtt (tree);
187 static tree binfo_ctor_vtable (tree);
188 static tree *build_vtt_inits (tree, tree, tree *, tree *);
189 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
190 static tree dfs_fixup_binfo_vtbls (tree, void *);
191 static int record_subobject_offset (tree, tree, splay_tree);
192 static int check_subobject_offset (tree, tree, splay_tree);
193 static int walk_subobject_offsets (tree, subobject_offset_fn,
194 tree, splay_tree, tree, int);
195 static void record_subobject_offsets (tree, tree, splay_tree, int);
196 static int layout_conflict_p (tree, tree, splay_tree, int);
197 static int splay_tree_compare_integer_csts (splay_tree_key k1,
199 static void warn_about_ambiguous_bases (tree);
200 static bool type_requires_array_cookie (tree);
201 static bool contains_empty_class_p (tree);
202 static bool base_derived_from (tree, tree);
203 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
204 static tree end_of_base (tree);
205 static tree get_vcall_index (tree, tree);
207 /* Variables shared between class.c and call.c. */
209 #ifdef GATHER_STATISTICS
211 int n_vtable_entries = 0;
212 int n_vtable_searches = 0;
213 int n_vtable_elems = 0;
214 int n_convert_harshness = 0;
215 int n_compute_conversion_costs = 0;
216 int n_inner_fields_searched = 0;
219 /* Convert to or from a base subobject. EXPR is an expression of type
220 `A' or `A*', an expression of type `B' or `B*' is returned. To
221 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
222 the B base instance within A. To convert base A to derived B, CODE
223 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
224 In this latter case, A must not be a morally virtual base of B.
225 NONNULL is true if EXPR is known to be non-NULL (this is only
226 needed when EXPR is of pointer type). CV qualifiers are preserved
230 build_base_path (enum tree_code code,
235 tree v_binfo = NULL_TREE;
236 tree d_binfo = NULL_TREE;
240 tree null_test = NULL;
241 tree ptr_target_type;
243 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
244 bool has_empty = false;
247 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
248 return error_mark_node;
250 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
253 if (is_empty_class (BINFO_TYPE (probe)))
255 if (!v_binfo && BINFO_VIRTUAL_P (probe))
259 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
261 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
263 gcc_assert ((code == MINUS_EXPR
264 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe))
265 || (code == PLUS_EXPR
266 && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)));
268 if (binfo == d_binfo)
272 if (code == MINUS_EXPR && v_binfo)
274 error ("cannot convert from base %qT to derived type %qT via virtual base %qT",
275 BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo));
276 return error_mark_node;
280 /* This must happen before the call to save_expr. */
281 expr = build_unary_op (ADDR_EXPR, expr, 0);
283 offset = BINFO_OFFSET (binfo);
284 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
286 /* Do we need to look in the vtable for the real offset? */
287 virtual_access = (v_binfo && fixed_type_p <= 0);
289 /* Do we need to check for a null pointer? */
290 if (want_pointer && !nonnull && (virtual_access || !integer_zerop (offset)))
291 null_test = error_mark_node;
293 /* Protect against multiple evaluation if necessary. */
294 if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access))
295 expr = save_expr (expr);
297 /* Now that we've saved expr, build the real null test. */
300 tree zero = cp_convert (TREE_TYPE (expr), integer_zero_node);
301 null_test = fold_build2 (NE_EXPR, boolean_type_node,
305 /* If this is a simple base reference, express it as a COMPONENT_REF. */
306 if (code == PLUS_EXPR && !virtual_access
307 /* We don't build base fields for empty bases, and they aren't very
308 interesting to the optimizers anyway. */
311 expr = build_indirect_ref (expr, NULL);
312 expr = build_simple_base_path (expr, binfo);
314 expr = build_address (expr);
315 target_type = TREE_TYPE (expr);
321 /* Going via virtual base V_BINFO. We need the static offset
322 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
323 V_BINFO. That offset is an entry in D_BINFO's vtable. */
326 if (fixed_type_p < 0 && in_base_initializer)
328 /* In a base member initializer, we cannot rely on the
329 vtable being set up. We have to indirect via the
333 t = TREE_TYPE (TYPE_VFIELD (current_class_type));
334 t = build_pointer_type (t);
335 v_offset = convert (t, current_vtt_parm);
336 v_offset = build_indirect_ref (v_offset, NULL);
339 v_offset = build_vfield_ref (build_indirect_ref (expr, NULL),
340 TREE_TYPE (TREE_TYPE (expr)));
342 v_offset = build2 (PLUS_EXPR, TREE_TYPE (v_offset),
343 v_offset, BINFO_VPTR_FIELD (v_binfo));
344 v_offset = build1 (NOP_EXPR,
345 build_pointer_type (ptrdiff_type_node),
347 v_offset = build_indirect_ref (v_offset, NULL);
348 TREE_CONSTANT (v_offset) = 1;
349 TREE_INVARIANT (v_offset) = 1;
351 offset = convert_to_integer (ptrdiff_type_node,
353 BINFO_OFFSET (v_binfo)));
355 if (!integer_zerop (offset))
356 v_offset = build2 (code, ptrdiff_type_node, v_offset, offset);
358 if (fixed_type_p < 0)
359 /* Negative fixed_type_p means this is a constructor or destructor;
360 virtual base layout is fixed in in-charge [cd]tors, but not in
362 offset = build3 (COND_EXPR, ptrdiff_type_node,
363 build2 (EQ_EXPR, boolean_type_node,
364 current_in_charge_parm, integer_zero_node),
366 convert_to_integer (ptrdiff_type_node,
367 BINFO_OFFSET (binfo)));
372 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
374 target_type = cp_build_qualified_type
375 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
376 ptr_target_type = build_pointer_type (target_type);
378 target_type = ptr_target_type;
380 expr = build1 (NOP_EXPR, ptr_target_type, expr);
382 if (!integer_zerop (offset))
383 expr = build2 (code, ptr_target_type, expr, offset);
388 expr = build_indirect_ref (expr, NULL);
392 expr = fold_build3 (COND_EXPR, target_type, null_test, expr,
393 fold_build1 (NOP_EXPR, target_type,
399 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
400 Perform a derived-to-base conversion by recursively building up a
401 sequence of COMPONENT_REFs to the appropriate base fields. */
404 build_simple_base_path (tree expr, tree binfo)
406 tree type = BINFO_TYPE (binfo);
407 tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
410 if (d_binfo == NULL_TREE)
414 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type);
416 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
417 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
418 an lvalue in the frontend; only _DECLs and _REFs are lvalues
420 temp = unary_complex_lvalue (ADDR_EXPR, expr);
422 expr = build_indirect_ref (temp, NULL);
428 expr = build_simple_base_path (expr, d_binfo);
430 for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo));
431 field; field = TREE_CHAIN (field))
432 /* Is this the base field created by build_base_field? */
433 if (TREE_CODE (field) == FIELD_DECL
434 && DECL_FIELD_IS_BASE (field)
435 && TREE_TYPE (field) == type)
437 /* We don't use build_class_member_access_expr here, as that
438 has unnecessary checks, and more importantly results in
439 recursive calls to dfs_walk_once. */
440 int type_quals = cp_type_quals (TREE_TYPE (expr));
442 expr = build3 (COMPONENT_REF,
443 cp_build_qualified_type (type, type_quals),
444 expr, field, NULL_TREE);
445 expr = fold_if_not_in_template (expr);
447 /* Mark the expression const or volatile, as appropriate.
448 Even though we've dealt with the type above, we still have
449 to mark the expression itself. */
450 if (type_quals & TYPE_QUAL_CONST)
451 TREE_READONLY (expr) = 1;
452 if (type_quals & TYPE_QUAL_VOLATILE)
453 TREE_THIS_VOLATILE (expr) = 1;
458 /* Didn't find the base field?!? */
462 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
463 type is a class type or a pointer to a class type. In the former
464 case, TYPE is also a class type; in the latter it is another
465 pointer type. If CHECK_ACCESS is true, an error message is emitted
466 if TYPE is inaccessible. If OBJECT has pointer type, the value is
467 assumed to be non-NULL. */
470 convert_to_base (tree object, tree type, bool check_access, bool nonnull)
475 if (TYPE_PTR_P (TREE_TYPE (object)))
477 object_type = TREE_TYPE (TREE_TYPE (object));
478 type = TREE_TYPE (type);
481 object_type = TREE_TYPE (object);
483 binfo = lookup_base (object_type, type,
484 check_access ? ba_check : ba_unique,
486 if (!binfo || binfo == error_mark_node)
487 return error_mark_node;
489 return build_base_path (PLUS_EXPR, object, binfo, nonnull);
492 /* EXPR is an expression with unqualified class type. BASE is a base
493 binfo of that class type. Returns EXPR, converted to the BASE
494 type. This function assumes that EXPR is the most derived class;
495 therefore virtual bases can be found at their static offsets. */
498 convert_to_base_statically (tree expr, tree base)
502 expr_type = TREE_TYPE (expr);
503 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type))
507 pointer_type = build_pointer_type (expr_type);
508 expr = build_unary_op (ADDR_EXPR, expr, /*noconvert=*/1);
509 if (!integer_zerop (BINFO_OFFSET (base)))
510 expr = build2 (PLUS_EXPR, pointer_type, expr,
511 build_nop (pointer_type, BINFO_OFFSET (base)));
512 expr = build_nop (build_pointer_type (BINFO_TYPE (base)), expr);
513 expr = build1 (INDIRECT_REF, BINFO_TYPE (base), expr);
521 build_vfield_ref (tree datum, tree type)
523 tree vfield, vcontext;
525 if (datum == error_mark_node)
526 return error_mark_node;
528 /* First, convert to the requested type. */
529 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
530 datum = convert_to_base (datum, type, /*check_access=*/false,
533 /* Second, the requested type may not be the owner of its own vptr.
534 If not, convert to the base class that owns it. We cannot use
535 convert_to_base here, because VCONTEXT may appear more than once
536 in the inheritance hierarchy of TYPE, and thus direct conversion
537 between the types may be ambiguous. Following the path back up
538 one step at a time via primary bases avoids the problem. */
539 vfield = TYPE_VFIELD (type);
540 vcontext = DECL_CONTEXT (vfield);
541 while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type))
543 datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type));
544 type = TREE_TYPE (datum);
547 return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE);
550 /* Given an object INSTANCE, return an expression which yields the
551 vtable element corresponding to INDEX. There are many special
552 cases for INSTANCE which we take care of here, mainly to avoid
553 creating extra tree nodes when we don't have to. */
556 build_vtbl_ref_1 (tree instance, tree idx)
559 tree vtbl = NULL_TREE;
561 /* Try to figure out what a reference refers to, and
562 access its virtual function table directly. */
565 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
567 tree basetype = non_reference (TREE_TYPE (instance));
569 if (fixed_type && !cdtorp)
571 tree binfo = lookup_base (fixed_type, basetype,
572 ba_unique | ba_quiet, NULL);
574 vtbl = unshare_expr (BINFO_VTABLE (binfo));
578 vtbl = build_vfield_ref (instance, basetype);
580 assemble_external (vtbl);
582 aref = build_array_ref (vtbl, idx);
583 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
584 TREE_INVARIANT (aref) = TREE_CONSTANT (aref);
590 build_vtbl_ref (tree instance, tree idx)
592 tree aref = build_vtbl_ref_1 (instance, idx);
597 /* Given a stable object pointer INSTANCE_PTR, return an expression which
598 yields a function pointer corresponding to vtable element INDEX. */
601 build_vfn_ref (tree instance_ptr, tree idx)
605 aref = build_vtbl_ref_1 (build_indirect_ref (instance_ptr, 0), idx);
607 /* When using function descriptors, the address of the
608 vtable entry is treated as a function pointer. */
609 if (TARGET_VTABLE_USES_DESCRIPTORS)
610 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
611 build_unary_op (ADDR_EXPR, aref, /*noconvert=*/1));
613 /* Remember this as a method reference, for later devirtualization. */
614 aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx);
619 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
620 for the given TYPE. */
623 get_vtable_name (tree type)
625 return mangle_vtbl_for_type (type);
628 /* Return an IDENTIFIER_NODE for the name of the virtual table table
632 get_vtt_name (tree type)
634 return mangle_vtt_for_type (type);
637 /* DECL is an entity associated with TYPE, like a virtual table or an
638 implicitly generated constructor. Determine whether or not DECL
639 should have external or internal linkage at the object file
640 level. This routine does not deal with COMDAT linkage and other
641 similar complexities; it simply sets TREE_PUBLIC if it possible for
642 entities in other translation units to contain copies of DECL, in
646 set_linkage_according_to_type (tree type, tree decl)
648 /* If TYPE involves a local class in a function with internal
649 linkage, then DECL should have internal linkage too. Other local
650 classes have no linkage -- but if their containing functions
651 have external linkage, it makes sense for DECL to have external
652 linkage too. That will allow template definitions to be merged,
654 if (no_linkage_check (type, /*relaxed_p=*/true))
656 TREE_PUBLIC (decl) = 0;
657 DECL_INTERFACE_KNOWN (decl) = 1;
660 TREE_PUBLIC (decl) = 1;
663 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
664 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
665 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
668 build_vtable (tree class_type, tree name, tree vtable_type)
672 decl = build_lang_decl (VAR_DECL, name, vtable_type);
673 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
674 now to avoid confusion in mangle_decl. */
675 SET_DECL_ASSEMBLER_NAME (decl, name);
676 DECL_CONTEXT (decl) = class_type;
677 DECL_ARTIFICIAL (decl) = 1;
678 TREE_STATIC (decl) = 1;
679 TREE_READONLY (decl) = 1;
680 DECL_VIRTUAL_P (decl) = 1;
681 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
682 DECL_VTABLE_OR_VTT_P (decl) = 1;
683 /* At one time the vtable info was grabbed 2 words at a time. This
684 fails on sparc unless you have 8-byte alignment. (tiemann) */
685 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
687 set_linkage_according_to_type (class_type, decl);
688 /* The vtable has not been defined -- yet. */
689 DECL_EXTERNAL (decl) = 1;
690 DECL_NOT_REALLY_EXTERN (decl) = 1;
692 /* Mark the VAR_DECL node representing the vtable itself as a
693 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
694 is rather important that such things be ignored because any
695 effort to actually generate DWARF for them will run into
696 trouble when/if we encounter code like:
699 struct S { virtual void member (); };
701 because the artificial declaration of the vtable itself (as
702 manufactured by the g++ front end) will say that the vtable is
703 a static member of `S' but only *after* the debug output for
704 the definition of `S' has already been output. This causes
705 grief because the DWARF entry for the definition of the vtable
706 will try to refer back to an earlier *declaration* of the
707 vtable as a static member of `S' and there won't be one. We
708 might be able to arrange to have the "vtable static member"
709 attached to the member list for `S' before the debug info for
710 `S' get written (which would solve the problem) but that would
711 require more intrusive changes to the g++ front end. */
712 DECL_IGNORED_P (decl) = 1;
717 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
718 or even complete. If this does not exist, create it. If COMPLETE is
719 nonzero, then complete the definition of it -- that will render it
720 impossible to actually build the vtable, but is useful to get at those
721 which are known to exist in the runtime. */
724 get_vtable_decl (tree type, int complete)
728 if (CLASSTYPE_VTABLES (type))
729 return CLASSTYPE_VTABLES (type);
731 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
732 CLASSTYPE_VTABLES (type) = decl;
736 DECL_EXTERNAL (decl) = 1;
737 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
743 /* Build the primary virtual function table for TYPE. If BINFO is
744 non-NULL, build the vtable starting with the initial approximation
745 that it is the same as the one which is the head of the association
746 list. Returns a nonzero value if a new vtable is actually
750 build_primary_vtable (tree binfo, tree type)
755 decl = get_vtable_decl (type, /*complete=*/0);
759 if (BINFO_NEW_VTABLE_MARKED (binfo))
760 /* We have already created a vtable for this base, so there's
761 no need to do it again. */
764 virtuals = copy_list (BINFO_VIRTUALS (binfo));
765 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
766 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
767 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
771 gcc_assert (TREE_TYPE (decl) == vtbl_type_node);
772 virtuals = NULL_TREE;
775 #ifdef GATHER_STATISTICS
777 n_vtable_elems += list_length (virtuals);
780 /* Initialize the association list for this type, based
781 on our first approximation. */
782 BINFO_VTABLE (TYPE_BINFO (type)) = decl;
783 BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals;
784 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
788 /* Give BINFO a new virtual function table which is initialized
789 with a skeleton-copy of its original initialization. The only
790 entry that changes is the `delta' entry, so we can really
791 share a lot of structure.
793 FOR_TYPE is the most derived type which caused this table to
796 Returns nonzero if we haven't met BINFO before.
798 The order in which vtables are built (by calling this function) for
799 an object must remain the same, otherwise a binary incompatibility
803 build_secondary_vtable (tree binfo)
805 if (BINFO_NEW_VTABLE_MARKED (binfo))
806 /* We already created a vtable for this base. There's no need to
810 /* Remember that we've created a vtable for this BINFO, so that we
811 don't try to do so again. */
812 SET_BINFO_NEW_VTABLE_MARKED (binfo);
814 /* Make fresh virtual list, so we can smash it later. */
815 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
817 /* Secondary vtables are laid out as part of the same structure as
818 the primary vtable. */
819 BINFO_VTABLE (binfo) = NULL_TREE;
823 /* Create a new vtable for BINFO which is the hierarchy dominated by
824 T. Return nonzero if we actually created a new vtable. */
827 make_new_vtable (tree t, tree binfo)
829 if (binfo == TYPE_BINFO (t))
830 /* In this case, it is *type*'s vtable we are modifying. We start
831 with the approximation that its vtable is that of the
832 immediate base class. */
833 return build_primary_vtable (binfo, t);
835 /* This is our very own copy of `basetype' to play with. Later,
836 we will fill in all the virtual functions that override the
837 virtual functions in these base classes which are not defined
838 by the current type. */
839 return build_secondary_vtable (binfo);
842 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
843 (which is in the hierarchy dominated by T) list FNDECL as its
844 BV_FN. DELTA is the required constant adjustment from the `this'
845 pointer where the vtable entry appears to the `this' required when
846 the function is actually called. */
849 modify_vtable_entry (tree t,
859 if (fndecl != BV_FN (v)
860 || !tree_int_cst_equal (delta, BV_DELTA (v)))
862 /* We need a new vtable for BINFO. */
863 if (make_new_vtable (t, binfo))
865 /* If we really did make a new vtable, we also made a copy
866 of the BINFO_VIRTUALS list. Now, we have to find the
867 corresponding entry in that list. */
868 *virtuals = BINFO_VIRTUALS (binfo);
869 while (BV_FN (*virtuals) != BV_FN (v))
870 *virtuals = TREE_CHAIN (*virtuals);
874 BV_DELTA (v) = delta;
875 BV_VCALL_INDEX (v) = NULL_TREE;
881 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
882 the USING_DECL naming METHOD. */
885 add_method (tree type, tree method, tree using_decl)
889 bool template_conv_p = false;
891 VEC(tree,gc) *method_vec;
893 bool insert_p = false;
896 if (method == error_mark_node)
899 complete_p = COMPLETE_TYPE_P (type);
900 conv_p = DECL_CONV_FN_P (method);
902 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
903 && DECL_TEMPLATE_CONV_FN_P (method));
905 method_vec = CLASSTYPE_METHOD_VEC (type);
908 /* Make a new method vector. We start with 8 entries. We must
909 allocate at least two (for constructors and destructors), and
910 we're going to end up with an assignment operator at some
912 method_vec = VEC_alloc (tree, gc, 8);
913 /* Create slots for constructors and destructors. */
914 VEC_quick_push (tree, method_vec, NULL_TREE);
915 VEC_quick_push (tree, method_vec, NULL_TREE);
916 CLASSTYPE_METHOD_VEC (type) = method_vec;
919 /* Constructors and destructors go in special slots. */
920 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
921 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
922 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
924 slot = CLASSTYPE_DESTRUCTOR_SLOT;
926 if (TYPE_FOR_JAVA (type))
928 if (!DECL_ARTIFICIAL (method))
929 error ("Java class %qT cannot have a destructor", type);
930 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
931 error ("Java class %qT cannot have an implicit non-trivial "
941 /* See if we already have an entry with this name. */
942 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
943 VEC_iterate (tree, method_vec, slot, m);
949 if (TREE_CODE (m) == TEMPLATE_DECL
950 && DECL_TEMPLATE_CONV_FN_P (m))
954 if (conv_p && !DECL_CONV_FN_P (m))
956 if (DECL_NAME (m) == DECL_NAME (method))
962 && !DECL_CONV_FN_P (m)
963 && DECL_NAME (m) > DECL_NAME (method))
967 current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot);
969 if (processing_template_decl)
970 /* TYPE is a template class. Don't issue any errors now; wait
971 until instantiation time to complain. */
977 /* Check to see if we've already got this method. */
978 for (fns = current_fns; fns; fns = OVL_NEXT (fns))
980 tree fn = OVL_CURRENT (fns);
985 if (TREE_CODE (fn) != TREE_CODE (method))
988 /* [over.load] Member function declarations with the
989 same name and the same parameter types cannot be
990 overloaded if any of them is a static member
991 function declaration.
993 [namespace.udecl] When a using-declaration brings names
994 from a base class into a derived class scope, member
995 functions in the derived class override and/or hide member
996 functions with the same name and parameter types in a base
997 class (rather than conflicting). */
998 parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn));
999 parms2 = TYPE_ARG_TYPES (TREE_TYPE (method));
1001 /* Compare the quals on the 'this' parm. Don't compare
1002 the whole types, as used functions are treated as
1003 coming from the using class in overload resolution. */
1004 if (! DECL_STATIC_FUNCTION_P (fn)
1005 && ! DECL_STATIC_FUNCTION_P (method)
1006 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1)))
1007 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2)))))
1010 /* For templates, the template parms must be identical. */
1011 if (TREE_CODE (fn) == TEMPLATE_DECL
1012 && !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
1013 DECL_TEMPLATE_PARMS (method)))
1016 if (! DECL_STATIC_FUNCTION_P (fn))
1017 parms1 = TREE_CHAIN (parms1);
1018 if (! DECL_STATIC_FUNCTION_P (method))
1019 parms2 = TREE_CHAIN (parms2);
1021 if (same && compparms (parms1, parms2)
1022 && (!DECL_CONV_FN_P (fn)
1023 || same_type_p (TREE_TYPE (TREE_TYPE (fn)),
1024 TREE_TYPE (TREE_TYPE (method)))))
1028 if (DECL_CONTEXT (fn) == type)
1029 /* Defer to the local function. */
1031 if (DECL_CONTEXT (fn) == DECL_CONTEXT (method))
1032 error ("repeated using declaration %q+D", using_decl);
1034 error ("using declaration %q+D conflicts with a previous using declaration",
1039 error ("%q+#D cannot be overloaded", method);
1040 error ("with %q+#D", fn);
1043 /* We don't call duplicate_decls here to merge the
1044 declarations because that will confuse things if the
1045 methods have inline definitions. In particular, we
1046 will crash while processing the definitions. */
1052 /* Add the new binding. */
1053 overload = build_overload (method, current_fns);
1055 if (!conv_p && slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p)
1056 push_class_level_binding (DECL_NAME (method), overload);
1060 /* We only expect to add few methods in the COMPLETE_P case, so
1061 just make room for one more method in that case. */
1062 if (VEC_reserve (tree, gc, method_vec, complete_p ? -1 : 1))
1063 CLASSTYPE_METHOD_VEC (type) = method_vec;
1064 if (slot == VEC_length (tree, method_vec))
1065 VEC_quick_push (tree, method_vec, overload);
1067 VEC_quick_insert (tree, method_vec, slot, overload);
1070 /* Replace the current slot. */
1071 VEC_replace (tree, method_vec, slot, overload);
1074 /* Subroutines of finish_struct. */
1076 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1077 legit, otherwise return 0. */
1080 alter_access (tree t, tree fdecl, tree access)
1084 if (!DECL_LANG_SPECIFIC (fdecl))
1085 retrofit_lang_decl (fdecl);
1087 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl));
1089 elem = purpose_member (t, DECL_ACCESS (fdecl));
1092 if (TREE_VALUE (elem) != access)
1094 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1095 error ("conflicting access specifications for method"
1096 " %q+D, ignored", TREE_TYPE (fdecl));
1098 error ("conflicting access specifications for field %qE, ignored",
1103 /* They're changing the access to the same thing they changed
1104 it to before. That's OK. */
1110 perform_or_defer_access_check (TYPE_BINFO (t), fdecl);
1111 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1117 /* Process the USING_DECL, which is a member of T. */
1120 handle_using_decl (tree using_decl, tree t)
1122 tree decl = USING_DECL_DECLS (using_decl);
1123 tree name = DECL_NAME (using_decl);
1125 = TREE_PRIVATE (using_decl) ? access_private_node
1126 : TREE_PROTECTED (using_decl) ? access_protected_node
1127 : access_public_node;
1128 tree flist = NULL_TREE;
1131 gcc_assert (!processing_template_decl && decl);
1133 old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false);
1136 if (is_overloaded_fn (old_value))
1137 old_value = OVL_CURRENT (old_value);
1139 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1142 old_value = NULL_TREE;
1145 cp_emit_debug_info_for_using (decl, current_class_type);
1147 if (is_overloaded_fn (decl))
1152 else if (is_overloaded_fn (old_value))
1155 /* It's OK to use functions from a base when there are functions with
1156 the same name already present in the current class. */;
1159 error ("%q+D invalid in %q#T", using_decl, t);
1160 error (" because of local method %q+#D with same name",
1161 OVL_CURRENT (old_value));
1165 else if (!DECL_ARTIFICIAL (old_value))
1167 error ("%q+D invalid in %q#T", using_decl, t);
1168 error (" because of local member %q+#D with same name", old_value);
1172 /* Make type T see field decl FDECL with access ACCESS. */
1174 for (; flist; flist = OVL_NEXT (flist))
1176 add_method (t, OVL_CURRENT (flist), using_decl);
1177 alter_access (t, OVL_CURRENT (flist), access);
1180 alter_access (t, decl, access);
1183 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1184 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1185 properties of the bases. */
1188 check_bases (tree t,
1189 int* cant_have_const_ctor_p,
1190 int* no_const_asn_ref_p)
1193 int seen_non_virtual_nearly_empty_base_p;
1197 seen_non_virtual_nearly_empty_base_p = 0;
1199 for (binfo = TYPE_BINFO (t), i = 0;
1200 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1202 tree basetype = TREE_TYPE (base_binfo);
1204 gcc_assert (COMPLETE_TYPE_P (basetype));
1206 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1207 here because the case of virtual functions but non-virtual
1208 dtor is handled in finish_struct_1. */
1209 if (warn_ecpp && ! TYPE_POLYMORPHIC_P (basetype))
1210 warning (0, "base class %q#T has a non-virtual destructor", basetype);
1212 /* If the base class doesn't have copy constructors or
1213 assignment operators that take const references, then the
1214 derived class cannot have such a member automatically
1216 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1217 *cant_have_const_ctor_p = 1;
1218 if (TYPE_HAS_ASSIGN_REF (basetype)
1219 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1220 *no_const_asn_ref_p = 1;
1222 if (BINFO_VIRTUAL_P (base_binfo))
1223 /* A virtual base does not effect nearly emptiness. */
1225 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1227 if (seen_non_virtual_nearly_empty_base_p)
1228 /* And if there is more than one nearly empty base, then the
1229 derived class is not nearly empty either. */
1230 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1232 /* Remember we've seen one. */
1233 seen_non_virtual_nearly_empty_base_p = 1;
1235 else if (!is_empty_class (basetype))
1236 /* If the base class is not empty or nearly empty, then this
1237 class cannot be nearly empty. */
1238 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1240 /* A lot of properties from the bases also apply to the derived
1242 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1243 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1244 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1245 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1246 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1247 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1248 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1249 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1250 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1254 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1255 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1256 that have had a nearly-empty virtual primary base stolen by some
1257 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1261 determine_primary_bases (tree t)
1264 tree primary = NULL_TREE;
1265 tree type_binfo = TYPE_BINFO (t);
1268 /* Determine the primary bases of our bases. */
1269 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1270 base_binfo = TREE_CHAIN (base_binfo))
1272 tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo));
1274 /* See if we're the non-virtual primary of our inheritance
1276 if (!BINFO_VIRTUAL_P (base_binfo))
1278 tree parent = BINFO_INHERITANCE_CHAIN (base_binfo);
1279 tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent));
1282 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
1283 BINFO_TYPE (parent_primary)))
1284 /* We are the primary binfo. */
1285 BINFO_PRIMARY_P (base_binfo) = 1;
1287 /* Determine if we have a virtual primary base, and mark it so.
1289 if (primary && BINFO_VIRTUAL_P (primary))
1291 tree this_primary = copied_binfo (primary, base_binfo);
1293 if (BINFO_PRIMARY_P (this_primary))
1294 /* Someone already claimed this base. */
1295 BINFO_LOST_PRIMARY_P (base_binfo) = 1;
1300 BINFO_PRIMARY_P (this_primary) = 1;
1301 BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo;
1303 /* A virtual binfo might have been copied from within
1304 another hierarchy. As we're about to use it as a
1305 primary base, make sure the offsets match. */
1306 delta = size_diffop (convert (ssizetype,
1307 BINFO_OFFSET (base_binfo)),
1309 BINFO_OFFSET (this_primary)));
1311 propagate_binfo_offsets (this_primary, delta);
1316 /* First look for a dynamic direct non-virtual base. */
1317 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++)
1319 tree basetype = BINFO_TYPE (base_binfo);
1321 if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo))
1323 primary = base_binfo;
1328 /* A "nearly-empty" virtual base class can be the primary base
1329 class, if no non-virtual polymorphic base can be found. Look for
1330 a nearly-empty virtual dynamic base that is not already a primary
1331 base of something in the hierarchy. If there is no such base,
1332 just pick the first nearly-empty virtual base. */
1334 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1335 base_binfo = TREE_CHAIN (base_binfo))
1336 if (BINFO_VIRTUAL_P (base_binfo)
1337 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo)))
1339 if (!BINFO_PRIMARY_P (base_binfo))
1341 /* Found one that is not primary. */
1342 primary = base_binfo;
1346 /* Remember the first candidate. */
1347 primary = base_binfo;
1351 /* If we've got a primary base, use it. */
1354 tree basetype = BINFO_TYPE (primary);
1356 CLASSTYPE_PRIMARY_BINFO (t) = primary;
1357 if (BINFO_PRIMARY_P (primary))
1358 /* We are stealing a primary base. */
1359 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1;
1360 BINFO_PRIMARY_P (primary) = 1;
1361 if (BINFO_VIRTUAL_P (primary))
1365 BINFO_INHERITANCE_CHAIN (primary) = type_binfo;
1366 /* A virtual binfo might have been copied from within
1367 another hierarchy. As we're about to use it as a primary
1368 base, make sure the offsets match. */
1369 delta = size_diffop (ssize_int (0),
1370 convert (ssizetype, BINFO_OFFSET (primary)));
1372 propagate_binfo_offsets (primary, delta);
1375 primary = TYPE_BINFO (basetype);
1377 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1378 BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary);
1379 BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary);
1383 /* Set memoizing fields and bits of T (and its variants) for later
1387 finish_struct_bits (tree t)
1391 /* Fix up variants (if any). */
1392 for (variants = TYPE_NEXT_VARIANT (t);
1394 variants = TYPE_NEXT_VARIANT (variants))
1396 /* These fields are in the _TYPE part of the node, not in
1397 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1398 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1399 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1400 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1401 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1403 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1405 TYPE_BINFO (variants) = TYPE_BINFO (t);
1407 /* Copy whatever these are holding today. */
1408 TYPE_VFIELD (variants) = TYPE_VFIELD (t);
1409 TYPE_METHODS (variants) = TYPE_METHODS (t);
1410 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1411 TYPE_SIZE (variants) = TYPE_SIZE (t);
1412 TYPE_SIZE_UNIT (variants) = TYPE_SIZE_UNIT (t);
1415 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t))
1416 /* For a class w/o baseclasses, 'finish_struct' has set
1417 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1418 Similarly for a class whose base classes do not have vtables.
1419 When neither of these is true, we might have removed abstract
1420 virtuals (by providing a definition), added some (by declaring
1421 new ones), or redeclared ones from a base class. We need to
1422 recalculate what's really an abstract virtual at this point (by
1423 looking in the vtables). */
1424 get_pure_virtuals (t);
1426 /* If this type has a copy constructor or a destructor, force its
1427 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1428 nonzero. This will cause it to be passed by invisible reference
1429 and prevent it from being returned in a register. */
1430 if (! TYPE_HAS_TRIVIAL_INIT_REF (t) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1433 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1434 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1436 TYPE_MODE (variants) = BLKmode;
1437 TREE_ADDRESSABLE (variants) = 1;
1442 /* Issue warnings about T having private constructors, but no friends,
1445 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1446 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1447 non-private static member functions. */
1450 maybe_warn_about_overly_private_class (tree t)
1452 int has_member_fn = 0;
1453 int has_nonprivate_method = 0;
1456 if (!warn_ctor_dtor_privacy
1457 /* If the class has friends, those entities might create and
1458 access instances, so we should not warn. */
1459 || (CLASSTYPE_FRIEND_CLASSES (t)
1460 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1461 /* We will have warned when the template was declared; there's
1462 no need to warn on every instantiation. */
1463 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1464 /* There's no reason to even consider warning about this
1468 /* We only issue one warning, if more than one applies, because
1469 otherwise, on code like:
1472 // Oops - forgot `public:'
1478 we warn several times about essentially the same problem. */
1480 /* Check to see if all (non-constructor, non-destructor) member
1481 functions are private. (Since there are no friends or
1482 non-private statics, we can't ever call any of the private member
1484 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1485 /* We're not interested in compiler-generated methods; they don't
1486 provide any way to call private members. */
1487 if (!DECL_ARTIFICIAL (fn))
1489 if (!TREE_PRIVATE (fn))
1491 if (DECL_STATIC_FUNCTION_P (fn))
1492 /* A non-private static member function is just like a
1493 friend; it can create and invoke private member
1494 functions, and be accessed without a class
1498 has_nonprivate_method = 1;
1499 /* Keep searching for a static member function. */
1501 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1505 if (!has_nonprivate_method && has_member_fn)
1507 /* There are no non-private methods, and there's at least one
1508 private member function that isn't a constructor or
1509 destructor. (If all the private members are
1510 constructors/destructors we want to use the code below that
1511 issues error messages specifically referring to
1512 constructors/destructors.) */
1514 tree binfo = TYPE_BINFO (t);
1516 for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++)
1517 if (BINFO_BASE_ACCESS (binfo, i) != access_private_node)
1519 has_nonprivate_method = 1;
1522 if (!has_nonprivate_method)
1524 warning (0, "all member functions in class %qT are private", t);
1529 /* Even if some of the member functions are non-private, the class
1530 won't be useful for much if all the constructors or destructors
1531 are private: such an object can never be created or destroyed. */
1532 fn = CLASSTYPE_DESTRUCTORS (t);
1533 if (fn && TREE_PRIVATE (fn))
1535 warning (0, "%q#T only defines a private destructor and has no friends",
1540 if (TYPE_HAS_CONSTRUCTOR (t)
1541 /* Implicitly generated constructors are always public. */
1542 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t)
1543 || !CLASSTYPE_LAZY_COPY_CTOR (t)))
1545 int nonprivate_ctor = 0;
1547 /* If a non-template class does not define a copy
1548 constructor, one is defined for it, enabling it to avoid
1549 this warning. For a template class, this does not
1550 happen, and so we would normally get a warning on:
1552 template <class T> class C { private: C(); };
1554 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1555 complete non-template or fully instantiated classes have this
1557 if (!TYPE_HAS_INIT_REF (t))
1558 nonprivate_ctor = 1;
1560 for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn))
1562 tree ctor = OVL_CURRENT (fn);
1563 /* Ideally, we wouldn't count copy constructors (or, in
1564 fact, any constructor that takes an argument of the
1565 class type as a parameter) because such things cannot
1566 be used to construct an instance of the class unless
1567 you already have one. But, for now at least, we're
1569 if (! TREE_PRIVATE (ctor))
1571 nonprivate_ctor = 1;
1576 if (nonprivate_ctor == 0)
1578 warning (0, "%q#T only defines private constructors and has no friends",
1586 gt_pointer_operator new_value;
1590 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1593 method_name_cmp (const void* m1_p, const void* m2_p)
1595 const tree *const m1 = m1_p;
1596 const tree *const m2 = m2_p;
1598 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1600 if (*m1 == NULL_TREE)
1602 if (*m2 == NULL_TREE)
1604 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1609 /* This routine compares two fields like method_name_cmp but using the
1610 pointer operator in resort_field_decl_data. */
1613 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1615 const tree *const m1 = m1_p;
1616 const tree *const m2 = m2_p;
1617 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1619 if (*m1 == NULL_TREE)
1621 if (*m2 == NULL_TREE)
1624 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1625 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1626 resort_data.new_value (&d1, resort_data.cookie);
1627 resort_data.new_value (&d2, resort_data.cookie);
1634 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1637 resort_type_method_vec (void* obj,
1638 void* orig_obj ATTRIBUTE_UNUSED ,
1639 gt_pointer_operator new_value,
1642 VEC(tree,gc) *method_vec = (VEC(tree,gc) *) obj;
1643 int len = VEC_length (tree, method_vec);
1647 /* The type conversion ops have to live at the front of the vec, so we
1649 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1650 VEC_iterate (tree, method_vec, slot, fn);
1652 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1657 resort_data.new_value = new_value;
1658 resort_data.cookie = cookie;
1659 qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree),
1660 resort_method_name_cmp);
1664 /* Warn about duplicate methods in fn_fields.
1666 Sort methods that are not special (i.e., constructors, destructors,
1667 and type conversion operators) so that we can find them faster in
1671 finish_struct_methods (tree t)
1674 VEC(tree,gc) *method_vec;
1677 method_vec = CLASSTYPE_METHOD_VEC (t);
1681 len = VEC_length (tree, method_vec);
1683 /* Clear DECL_IN_AGGR_P for all functions. */
1684 for (fn_fields = TYPE_METHODS (t); fn_fields;
1685 fn_fields = TREE_CHAIN (fn_fields))
1686 DECL_IN_AGGR_P (fn_fields) = 0;
1688 /* Issue warnings about private constructors and such. If there are
1689 no methods, then some public defaults are generated. */
1690 maybe_warn_about_overly_private_class (t);
1692 /* The type conversion ops have to live at the front of the vec, so we
1694 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1695 VEC_iterate (tree, method_vec, slot, fn_fields);
1697 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields)))
1700 qsort (VEC_address (tree, method_vec) + slot,
1701 len-slot, sizeof (tree), method_name_cmp);
1704 /* Make BINFO's vtable have N entries, including RTTI entries,
1705 vbase and vcall offsets, etc. Set its type and call the backend
1709 layout_vtable_decl (tree binfo, int n)
1714 atype = build_cplus_array_type (vtable_entry_type,
1715 build_index_type (size_int (n - 1)));
1716 layout_type (atype);
1718 /* We may have to grow the vtable. */
1719 vtable = get_vtbl_decl_for_binfo (binfo);
1720 if (!same_type_p (TREE_TYPE (vtable), atype))
1722 TREE_TYPE (vtable) = atype;
1723 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
1724 layout_decl (vtable, 0);
1728 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1729 have the same signature. */
1732 same_signature_p (tree fndecl, tree base_fndecl)
1734 /* One destructor overrides another if they are the same kind of
1736 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
1737 && special_function_p (base_fndecl) == special_function_p (fndecl))
1739 /* But a non-destructor never overrides a destructor, nor vice
1740 versa, nor do different kinds of destructors override
1741 one-another. For example, a complete object destructor does not
1742 override a deleting destructor. */
1743 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
1746 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
1747 || (DECL_CONV_FN_P (fndecl)
1748 && DECL_CONV_FN_P (base_fndecl)
1749 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
1750 DECL_CONV_FN_TYPE (base_fndecl))))
1752 tree types, base_types;
1753 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1754 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
1755 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
1756 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
1757 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
1763 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1767 base_derived_from (tree derived, tree base)
1771 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1773 if (probe == derived)
1775 else if (BINFO_VIRTUAL_P (probe))
1776 /* If we meet a virtual base, we can't follow the inheritance
1777 any more. See if the complete type of DERIVED contains
1778 such a virtual base. */
1779 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived))
1785 typedef struct find_final_overrider_data_s {
1786 /* The function for which we are trying to find a final overrider. */
1788 /* The base class in which the function was declared. */
1789 tree declaring_base;
1790 /* The candidate overriders. */
1792 /* Path to most derived. */
1793 VEC(tree,heap) *path;
1794 } find_final_overrider_data;
1796 /* Add the overrider along the current path to FFOD->CANDIDATES.
1797 Returns true if an overrider was found; false otherwise. */
1800 dfs_find_final_overrider_1 (tree binfo,
1801 find_final_overrider_data *ffod,
1806 /* If BINFO is not the most derived type, try a more derived class.
1807 A definition there will overrider a definition here. */
1811 if (dfs_find_final_overrider_1
1812 (VEC_index (tree, ffod->path, depth), ffod, depth))
1816 method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn);
1819 tree *candidate = &ffod->candidates;
1821 /* Remove any candidates overridden by this new function. */
1824 /* If *CANDIDATE overrides METHOD, then METHOD
1825 cannot override anything else on the list. */
1826 if (base_derived_from (TREE_VALUE (*candidate), binfo))
1828 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1829 if (base_derived_from (binfo, TREE_VALUE (*candidate)))
1830 *candidate = TREE_CHAIN (*candidate);
1832 candidate = &TREE_CHAIN (*candidate);
1835 /* Add the new function. */
1836 ffod->candidates = tree_cons (method, binfo, ffod->candidates);
1843 /* Called from find_final_overrider via dfs_walk. */
1846 dfs_find_final_overrider_pre (tree binfo, void *data)
1848 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1850 if (binfo == ffod->declaring_base)
1851 dfs_find_final_overrider_1 (binfo, ffod, VEC_length (tree, ffod->path));
1852 VEC_safe_push (tree, heap, ffod->path, binfo);
1858 dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED, void *data)
1860 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1861 VEC_pop (tree, ffod->path);
1866 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1867 FN and whose TREE_VALUE is the binfo for the base where the
1868 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1869 DERIVED) is the base object in which FN is declared. */
1872 find_final_overrider (tree derived, tree binfo, tree fn)
1874 find_final_overrider_data ffod;
1876 /* Getting this right is a little tricky. This is valid:
1878 struct S { virtual void f (); };
1879 struct T { virtual void f (); };
1880 struct U : public S, public T { };
1882 even though calling `f' in `U' is ambiguous. But,
1884 struct R { virtual void f(); };
1885 struct S : virtual public R { virtual void f (); };
1886 struct T : virtual public R { virtual void f (); };
1887 struct U : public S, public T { };
1889 is not -- there's no way to decide whether to put `S::f' or
1890 `T::f' in the vtable for `R'.
1892 The solution is to look at all paths to BINFO. If we find
1893 different overriders along any two, then there is a problem. */
1894 if (DECL_THUNK_P (fn))
1895 fn = THUNK_TARGET (fn);
1897 /* Determine the depth of the hierarchy. */
1899 ffod.declaring_base = binfo;
1900 ffod.candidates = NULL_TREE;
1901 ffod.path = VEC_alloc (tree, heap, 30);
1903 dfs_walk_all (derived, dfs_find_final_overrider_pre,
1904 dfs_find_final_overrider_post, &ffod);
1906 VEC_free (tree, heap, ffod.path);
1908 /* If there was no winner, issue an error message. */
1909 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
1910 return error_mark_node;
1912 return ffod.candidates;
1915 /* Return the index of the vcall offset for FN when TYPE is used as a
1919 get_vcall_index (tree fn, tree type)
1921 VEC(tree_pair_s,gc) *indices = CLASSTYPE_VCALL_INDICES (type);
1925 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++)
1926 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose))
1927 || same_signature_p (fn, p->purpose))
1930 /* There should always be an appropriate index. */
1934 /* Update an entry in the vtable for BINFO, which is in the hierarchy
1935 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
1936 corresponding position in the BINFO_VIRTUALS list. */
1939 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
1947 tree overrider_fn, overrider_target;
1948 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
1949 tree over_return, base_return;
1952 /* Find the nearest primary base (possibly binfo itself) which defines
1953 this function; this is the class the caller will convert to when
1954 calling FN through BINFO. */
1955 for (b = binfo; ; b = get_primary_binfo (b))
1958 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
1961 /* The nearest definition is from a lost primary. */
1962 if (BINFO_LOST_PRIMARY_P (b))
1967 /* Find the final overrider. */
1968 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
1969 if (overrider == error_mark_node)
1971 error ("no unique final overrider for %qD in %qT", target_fn, t);
1974 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
1976 /* Check for adjusting covariant return types. */
1977 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
1978 base_return = TREE_TYPE (TREE_TYPE (target_fn));
1980 if (POINTER_TYPE_P (over_return)
1981 && TREE_CODE (over_return) == TREE_CODE (base_return)
1982 && CLASS_TYPE_P (TREE_TYPE (over_return))
1983 && CLASS_TYPE_P (TREE_TYPE (base_return)))
1985 /* If FN is a covariant thunk, we must figure out the adjustment
1986 to the final base FN was converting to. As OVERRIDER_TARGET might
1987 also be converting to the return type of FN, we have to
1988 combine the two conversions here. */
1989 tree fixed_offset, virtual_offset;
1991 over_return = TREE_TYPE (over_return);
1992 base_return = TREE_TYPE (base_return);
1994 if (DECL_THUNK_P (fn))
1996 gcc_assert (DECL_RESULT_THUNK_P (fn));
1997 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
1998 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2001 fixed_offset = virtual_offset = NULL_TREE;
2004 /* Find the equivalent binfo within the return type of the
2005 overriding function. We will want the vbase offset from
2007 virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset),
2009 else if (!same_type_ignoring_top_level_qualifiers_p
2010 (over_return, base_return))
2012 /* There was no existing virtual thunk (which takes
2013 precedence). So find the binfo of the base function's
2014 return type within the overriding function's return type.
2015 We cannot call lookup base here, because we're inside a
2016 dfs_walk, and will therefore clobber the BINFO_MARKED
2017 flags. Fortunately we know the covariancy is valid (it
2018 has already been checked), so we can just iterate along
2019 the binfos, which have been chained in inheritance graph
2020 order. Of course it is lame that we have to repeat the
2021 search here anyway -- we should really be caching pieces
2022 of the vtable and avoiding this repeated work. */
2023 tree thunk_binfo, base_binfo;
2025 /* Find the base binfo within the overriding function's
2026 return type. We will always find a thunk_binfo, except
2027 when the covariancy is invalid (which we will have
2028 already diagnosed). */
2029 for (base_binfo = TYPE_BINFO (base_return),
2030 thunk_binfo = TYPE_BINFO (over_return);
2032 thunk_binfo = TREE_CHAIN (thunk_binfo))
2033 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo),
2034 BINFO_TYPE (base_binfo)))
2037 /* See if virtual inheritance is involved. */
2038 for (virtual_offset = thunk_binfo;
2040 virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset))
2041 if (BINFO_VIRTUAL_P (virtual_offset))
2045 || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo)))
2047 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2051 /* We convert via virtual base. Adjust the fixed
2052 offset to be from there. */
2053 offset = size_diffop
2055 (ssizetype, BINFO_OFFSET (virtual_offset)));
2058 /* There was an existing fixed offset, this must be
2059 from the base just converted to, and the base the
2060 FN was thunking to. */
2061 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2063 fixed_offset = offset;
2067 if (fixed_offset || virtual_offset)
2068 /* Replace the overriding function with a covariant thunk. We
2069 will emit the overriding function in its own slot as
2071 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2072 fixed_offset, virtual_offset);
2075 gcc_assert (!DECL_THUNK_P (fn));
2077 /* Assume that we will produce a thunk that convert all the way to
2078 the final overrider, and not to an intermediate virtual base. */
2079 virtual_base = NULL_TREE;
2081 /* See if we can convert to an intermediate virtual base first, and then
2082 use the vcall offset located there to finish the conversion. */
2083 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2085 /* If we find the final overrider, then we can stop
2087 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b),
2088 BINFO_TYPE (TREE_VALUE (overrider))))
2091 /* If we find a virtual base, and we haven't yet found the
2092 overrider, then there is a virtual base between the
2093 declaring base (first_defn) and the final overrider. */
2094 if (BINFO_VIRTUAL_P (b))
2101 if (overrider_fn != overrider_target && !virtual_base)
2103 /* The ABI specifies that a covariant thunk includes a mangling
2104 for a this pointer adjustment. This-adjusting thunks that
2105 override a function from a virtual base have a vcall
2106 adjustment. When the virtual base in question is a primary
2107 virtual base, we know the adjustments are zero, (and in the
2108 non-covariant case, we would not use the thunk).
2109 Unfortunately we didn't notice this could happen, when
2110 designing the ABI and so never mandated that such a covariant
2111 thunk should be emitted. Because we must use the ABI mandated
2112 name, we must continue searching from the binfo where we
2113 found the most recent definition of the function, towards the
2114 primary binfo which first introduced the function into the
2115 vtable. If that enters a virtual base, we must use a vcall
2116 this-adjusting thunk. Bleah! */
2117 tree probe = first_defn;
2119 while ((probe = get_primary_binfo (probe))
2120 && (unsigned) list_length (BINFO_VIRTUALS (probe)) > ix)
2121 if (BINFO_VIRTUAL_P (probe))
2122 virtual_base = probe;
2125 /* Even if we find a virtual base, the correct delta is
2126 between the overrider and the binfo we're building a vtable
2128 goto virtual_covariant;
2131 /* Compute the constant adjustment to the `this' pointer. The
2132 `this' pointer, when this function is called, will point at BINFO
2133 (or one of its primary bases, which are at the same offset). */
2135 /* The `this' pointer needs to be adjusted from the declaration to
2136 the nearest virtual base. */
2137 delta = size_diffop (convert (ssizetype, BINFO_OFFSET (virtual_base)),
2138 convert (ssizetype, BINFO_OFFSET (first_defn)));
2140 /* If the nearest definition is in a lost primary, we don't need an
2141 entry in our vtable. Except possibly in a constructor vtable,
2142 if we happen to get our primary back. In that case, the offset
2143 will be zero, as it will be a primary base. */
2144 delta = size_zero_node;
2146 /* The `this' pointer needs to be adjusted from pointing to
2147 BINFO to pointing at the base where the final overrider
2150 delta = size_diffop (convert (ssizetype,
2151 BINFO_OFFSET (TREE_VALUE (overrider))),
2152 convert (ssizetype, BINFO_OFFSET (binfo)));
2154 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2157 BV_VCALL_INDEX (*virtuals)
2158 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2160 BV_VCALL_INDEX (*virtuals) = NULL_TREE;
2163 /* Called from modify_all_vtables via dfs_walk. */
2166 dfs_modify_vtables (tree binfo, void* data)
2168 tree t = (tree) data;
2173 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2174 /* A base without a vtable needs no modification, and its bases
2175 are uninteresting. */
2176 return dfs_skip_bases;
2178 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)
2179 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
2180 /* Don't do the primary vtable, if it's new. */
2183 if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo))
2184 /* There's no need to modify the vtable for a non-virtual primary
2185 base; we're not going to use that vtable anyhow. We do still
2186 need to do this for virtual primary bases, as they could become
2187 non-primary in a construction vtable. */
2190 make_new_vtable (t, binfo);
2192 /* Now, go through each of the virtual functions in the virtual
2193 function table for BINFO. Find the final overrider, and update
2194 the BINFO_VIRTUALS list appropriately. */
2195 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2196 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2198 ix++, virtuals = TREE_CHAIN (virtuals),
2199 old_virtuals = TREE_CHAIN (old_virtuals))
2200 update_vtable_entry_for_fn (t,
2202 BV_FN (old_virtuals),
2208 /* Update all of the primary and secondary vtables for T. Create new
2209 vtables as required, and initialize their RTTI information. Each
2210 of the functions in VIRTUALS is declared in T and may override a
2211 virtual function from a base class; find and modify the appropriate
2212 entries to point to the overriding functions. Returns a list, in
2213 declaration order, of the virtual functions that are declared in T,
2214 but do not appear in the primary base class vtable, and which
2215 should therefore be appended to the end of the vtable for T. */
2218 modify_all_vtables (tree t, tree virtuals)
2220 tree binfo = TYPE_BINFO (t);
2223 /* Update all of the vtables. */
2224 dfs_walk_once (binfo, dfs_modify_vtables, NULL, t);
2226 /* Add virtual functions not already in our primary vtable. These
2227 will be both those introduced by this class, and those overridden
2228 from secondary bases. It does not include virtuals merely
2229 inherited from secondary bases. */
2230 for (fnsp = &virtuals; *fnsp; )
2232 tree fn = TREE_VALUE (*fnsp);
2234 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2235 || DECL_VINDEX (fn) == error_mark_node)
2237 /* We don't need to adjust the `this' pointer when
2238 calling this function. */
2239 BV_DELTA (*fnsp) = integer_zero_node;
2240 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2242 /* This is a function not already in our vtable. Keep it. */
2243 fnsp = &TREE_CHAIN (*fnsp);
2246 /* We've already got an entry for this function. Skip it. */
2247 *fnsp = TREE_CHAIN (*fnsp);
2253 /* Get the base virtual function declarations in T that have the
2257 get_basefndecls (tree name, tree t)
2260 tree base_fndecls = NULL_TREE;
2261 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
2264 /* Find virtual functions in T with the indicated NAME. */
2265 i = lookup_fnfields_1 (t, name);
2267 for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i);
2269 methods = OVL_NEXT (methods))
2271 tree method = OVL_CURRENT (methods);
2273 if (TREE_CODE (method) == FUNCTION_DECL
2274 && DECL_VINDEX (method))
2275 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2279 return base_fndecls;
2281 for (i = 0; i < n_baseclasses; i++)
2283 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i));
2284 base_fndecls = chainon (get_basefndecls (name, basetype),
2288 return base_fndecls;
2291 /* If this declaration supersedes the declaration of
2292 a method declared virtual in the base class, then
2293 mark this field as being virtual as well. */
2296 check_for_override (tree decl, tree ctype)
2298 if (TREE_CODE (decl) == TEMPLATE_DECL)
2299 /* In [temp.mem] we have:
2301 A specialization of a member function template does not
2302 override a virtual function from a base class. */
2304 if ((DECL_DESTRUCTOR_P (decl)
2305 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2306 || DECL_CONV_FN_P (decl))
2307 && look_for_overrides (ctype, decl)
2308 && !DECL_STATIC_FUNCTION_P (decl))
2309 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2310 the error_mark_node so that we know it is an overriding
2312 DECL_VINDEX (decl) = decl;
2314 if (DECL_VIRTUAL_P (decl))
2316 if (!DECL_VINDEX (decl))
2317 DECL_VINDEX (decl) = error_mark_node;
2318 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2322 /* Warn about hidden virtual functions that are not overridden in t.
2323 We know that constructors and destructors don't apply. */
2326 warn_hidden (tree t)
2328 VEC(tree,gc) *method_vec = CLASSTYPE_METHOD_VEC (t);
2332 /* We go through each separately named virtual function. */
2333 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2334 VEC_iterate (tree, method_vec, i, fns);
2345 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2346 have the same name. Figure out what name that is. */
2347 name = DECL_NAME (OVL_CURRENT (fns));
2348 /* There are no possibly hidden functions yet. */
2349 base_fndecls = NULL_TREE;
2350 /* Iterate through all of the base classes looking for possibly
2351 hidden functions. */
2352 for (binfo = TYPE_BINFO (t), j = 0;
2353 BINFO_BASE_ITERATE (binfo, j, base_binfo); j++)
2355 tree basetype = BINFO_TYPE (base_binfo);
2356 base_fndecls = chainon (get_basefndecls (name, basetype),
2360 /* If there are no functions to hide, continue. */
2364 /* Remove any overridden functions. */
2365 for (fn = fns; fn; fn = OVL_NEXT (fn))
2367 fndecl = OVL_CURRENT (fn);
2368 if (DECL_VINDEX (fndecl))
2370 tree *prev = &base_fndecls;
2373 /* If the method from the base class has the same
2374 signature as the method from the derived class, it
2375 has been overridden. */
2376 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2377 *prev = TREE_CHAIN (*prev);
2379 prev = &TREE_CHAIN (*prev);
2383 /* Now give a warning for all base functions without overriders,
2384 as they are hidden. */
2385 while (base_fndecls)
2387 /* Here we know it is a hider, and no overrider exists. */
2388 warning (0, "%q+D was hidden", TREE_VALUE (base_fndecls));
2389 warning (0, " by %q+D", fns);
2390 base_fndecls = TREE_CHAIN (base_fndecls);
2395 /* Check for things that are invalid. There are probably plenty of other
2396 things we should check for also. */
2399 finish_struct_anon (tree t)
2403 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2405 if (TREE_STATIC (field))
2407 if (TREE_CODE (field) != FIELD_DECL)
2410 if (DECL_NAME (field) == NULL_TREE
2411 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2413 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2414 for (; elt; elt = TREE_CHAIN (elt))
2416 /* We're generally only interested in entities the user
2417 declared, but we also find nested classes by noticing
2418 the TYPE_DECL that we create implicitly. You're
2419 allowed to put one anonymous union inside another,
2420 though, so we explicitly tolerate that. We use
2421 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2422 we also allow unnamed types used for defining fields. */
2423 if (DECL_ARTIFICIAL (elt)
2424 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2425 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2428 if (TREE_CODE (elt) != FIELD_DECL)
2430 pedwarn ("%q+#D invalid; an anonymous union can "
2431 "only have non-static data members", elt);
2435 if (TREE_PRIVATE (elt))
2436 pedwarn ("private member %q+#D in anonymous union", elt);
2437 else if (TREE_PROTECTED (elt))
2438 pedwarn ("protected member %q+#D in anonymous union", elt);
2440 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2441 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2447 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2448 will be used later during class template instantiation.
2449 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2450 a non-static member data (FIELD_DECL), a member function
2451 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2452 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2453 When FRIEND_P is nonzero, T is either a friend class
2454 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2455 (FUNCTION_DECL, TEMPLATE_DECL). */
2458 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2460 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2461 if (CLASSTYPE_TEMPLATE_INFO (type))
2462 CLASSTYPE_DECL_LIST (type)
2463 = tree_cons (friend_p ? NULL_TREE : type,
2464 t, CLASSTYPE_DECL_LIST (type));
2467 /* Create default constructors, assignment operators, and so forth for
2468 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2469 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2470 the class cannot have a default constructor, copy constructor
2471 taking a const reference argument, or an assignment operator taking
2472 a const reference, respectively. */
2475 add_implicitly_declared_members (tree t,
2476 int cant_have_const_cctor,
2477 int cant_have_const_assignment)
2480 if (!CLASSTYPE_DESTRUCTORS (t))
2482 /* In general, we create destructors lazily. */
2483 CLASSTYPE_LAZY_DESTRUCTOR (t) = 1;
2484 /* However, if the implicit destructor is non-trivial
2485 destructor, we sometimes have to create it at this point. */
2486 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
2490 if (TYPE_FOR_JAVA (t))
2491 /* If this a Java class, any non-trivial destructor is
2492 invalid, even if compiler-generated. Therefore, if the
2493 destructor is non-trivial we create it now. */
2501 /* If the implicit destructor will be virtual, then we must
2502 generate it now because (unfortunately) we do not
2503 generate virtual tables lazily. */
2504 binfo = TYPE_BINFO (t);
2505 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2510 base_type = BINFO_TYPE (base_binfo);
2511 dtor = CLASSTYPE_DESTRUCTORS (base_type);
2512 if (dtor && DECL_VIRTUAL_P (dtor))
2520 /* If we can't get away with being lazy, generate the destructor
2523 lazily_declare_fn (sfk_destructor, t);
2527 /* Default constructor. */
2528 if (! TYPE_HAS_CONSTRUCTOR (t))
2530 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1;
2531 CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1;
2534 /* Copy constructor. */
2535 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
2537 TYPE_HAS_INIT_REF (t) = 1;
2538 TYPE_HAS_CONST_INIT_REF (t) = !cant_have_const_cctor;
2539 CLASSTYPE_LAZY_COPY_CTOR (t) = 1;
2540 TYPE_HAS_CONSTRUCTOR (t) = 1;
2543 /* If there is no assignment operator, one will be created if and
2544 when it is needed. For now, just record whether or not the type
2545 of the parameter to the assignment operator will be a const or
2546 non-const reference. */
2547 if (!TYPE_HAS_ASSIGN_REF (t) && !TYPE_FOR_JAVA (t))
2549 TYPE_HAS_ASSIGN_REF (t) = 1;
2550 TYPE_HAS_CONST_ASSIGN_REF (t) = !cant_have_const_assignment;
2551 CLASSTYPE_LAZY_ASSIGNMENT_OP (t) = 1;
2555 /* Subroutine of finish_struct_1. Recursively count the number of fields
2556 in TYPE, including anonymous union members. */
2559 count_fields (tree fields)
2563 for (x = fields; x; x = TREE_CHAIN (x))
2565 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2566 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2573 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2574 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2577 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
2580 for (x = fields; x; x = TREE_CHAIN (x))
2582 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2583 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
2585 field_vec->elts[idx++] = x;
2590 /* FIELD is a bit-field. We are finishing the processing for its
2591 enclosing type. Issue any appropriate messages and set appropriate
2595 check_bitfield_decl (tree field)
2597 tree type = TREE_TYPE (field);
2600 /* Detect invalid bit-field type. */
2601 if (DECL_INITIAL (field)
2602 && ! INTEGRAL_TYPE_P (TREE_TYPE (field)))
2604 error ("bit-field %q+#D with non-integral type", field);
2605 w = error_mark_node;
2608 /* Detect and ignore out of range field width. */
2609 if (DECL_INITIAL (field))
2611 w = DECL_INITIAL (field);
2613 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2616 /* detect invalid field size. */
2617 w = integral_constant_value (w);
2619 if (TREE_CODE (w) != INTEGER_CST)
2621 error ("bit-field %q+D width not an integer constant", field);
2622 w = error_mark_node;
2624 else if (tree_int_cst_sgn (w) < 0)
2626 error ("negative width in bit-field %q+D", field);
2627 w = error_mark_node;
2629 else if (integer_zerop (w) && DECL_NAME (field) != 0)
2631 error ("zero width for bit-field %q+D", field);
2632 w = error_mark_node;
2634 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
2635 && TREE_CODE (type) != ENUMERAL_TYPE
2636 && TREE_CODE (type) != BOOLEAN_TYPE)
2637 warning (0, "width of %q+D exceeds its type", field);
2638 else if (TREE_CODE (type) == ENUMERAL_TYPE
2639 && (0 > compare_tree_int (w,
2640 min_precision (TYPE_MIN_VALUE (type),
2641 TYPE_UNSIGNED (type)))
2642 || 0 > compare_tree_int (w,
2644 (TYPE_MAX_VALUE (type),
2645 TYPE_UNSIGNED (type)))))
2646 warning (0, "%q+D is too small to hold all values of %q#T", field, type);
2649 /* Remove the bit-field width indicator so that the rest of the
2650 compiler does not treat that value as an initializer. */
2651 DECL_INITIAL (field) = NULL_TREE;
2653 if (w != error_mark_node)
2655 DECL_SIZE (field) = convert (bitsizetype, w);
2656 DECL_BIT_FIELD (field) = 1;
2660 /* Non-bit-fields are aligned for their type. */
2661 DECL_BIT_FIELD (field) = 0;
2662 CLEAR_DECL_C_BIT_FIELD (field);
2666 /* FIELD is a non bit-field. We are finishing the processing for its
2667 enclosing type T. Issue any appropriate messages and set appropriate
2671 check_field_decl (tree field,
2673 int* cant_have_const_ctor,
2674 int* no_const_asn_ref,
2675 int* any_default_members)
2677 tree type = strip_array_types (TREE_TYPE (field));
2679 /* An anonymous union cannot contain any fields which would change
2680 the settings of CANT_HAVE_CONST_CTOR and friends. */
2681 if (ANON_UNION_TYPE_P (type))
2683 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2684 structs. So, we recurse through their fields here. */
2685 else if (ANON_AGGR_TYPE_P (type))
2689 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2690 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
2691 check_field_decl (fields, t, cant_have_const_ctor,
2692 no_const_asn_ref, any_default_members);
2694 /* Check members with class type for constructors, destructors,
2696 else if (CLASS_TYPE_P (type))
2698 /* Never let anything with uninheritable virtuals
2699 make it through without complaint. */
2700 abstract_virtuals_error (field, type);
2702 if (TREE_CODE (t) == UNION_TYPE)
2704 if (TYPE_NEEDS_CONSTRUCTING (type))
2705 error ("member %q+#D with constructor not allowed in union",
2707 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
2708 error ("member %q+#D with destructor not allowed in union", field);
2709 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2710 error ("member %q+#D with copy assignment operator not allowed in union",
2715 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
2716 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2717 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
2718 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
2719 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
2722 if (!TYPE_HAS_CONST_INIT_REF (type))
2723 *cant_have_const_ctor = 1;
2725 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
2726 *no_const_asn_ref = 1;
2728 if (DECL_INITIAL (field) != NULL_TREE)
2730 /* `build_class_init_list' does not recognize
2732 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
2733 error ("multiple fields in union %qT initialized", t);
2734 *any_default_members = 1;
2738 /* Check the data members (both static and non-static), class-scoped
2739 typedefs, etc., appearing in the declaration of T. Issue
2740 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2741 declaration order) of access declarations; each TREE_VALUE in this
2742 list is a USING_DECL.
2744 In addition, set the following flags:
2747 The class is empty, i.e., contains no non-static data members.
2749 CANT_HAVE_CONST_CTOR_P
2750 This class cannot have an implicitly generated copy constructor
2751 taking a const reference.
2753 CANT_HAVE_CONST_ASN_REF
2754 This class cannot have an implicitly generated assignment
2755 operator taking a const reference.
2757 All of these flags should be initialized before calling this
2760 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2761 fields can be added by adding to this chain. */
2764 check_field_decls (tree t, tree *access_decls,
2765 int *cant_have_const_ctor_p,
2766 int *no_const_asn_ref_p)
2771 int any_default_members;
2773 /* Assume there are no access declarations. */
2774 *access_decls = NULL_TREE;
2775 /* Assume this class has no pointer members. */
2776 has_pointers = false;
2777 /* Assume none of the members of this class have default
2779 any_default_members = 0;
2781 for (field = &TYPE_FIELDS (t); *field; field = next)
2784 tree type = TREE_TYPE (x);
2786 next = &TREE_CHAIN (x);
2788 if (TREE_CODE (x) == FIELD_DECL)
2790 if (TYPE_PACKED (t))
2792 if (!pod_type_p (TREE_TYPE (x)) && !TYPE_PACKED (TREE_TYPE (x)))
2795 "ignoring packed attribute on unpacked non-POD field %q+#D",
2798 DECL_PACKED (x) = 1;
2801 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
2802 /* We don't treat zero-width bitfields as making a class
2809 /* The class is non-empty. */
2810 CLASSTYPE_EMPTY_P (t) = 0;
2811 /* The class is not even nearly empty. */
2812 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
2813 /* If one of the data members contains an empty class,
2815 element_type = strip_array_types (type);
2816 if (CLASS_TYPE_P (element_type)
2817 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
2818 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
2822 if (TREE_CODE (x) == USING_DECL)
2824 /* Prune the access declaration from the list of fields. */
2825 *field = TREE_CHAIN (x);
2827 /* Save the access declarations for our caller. */
2828 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
2830 /* Since we've reset *FIELD there's no reason to skip to the
2836 if (TREE_CODE (x) == TYPE_DECL
2837 || TREE_CODE (x) == TEMPLATE_DECL)
2840 /* If we've gotten this far, it's a data member, possibly static,
2841 or an enumerator. */
2842 DECL_CONTEXT (x) = t;
2844 /* When this goes into scope, it will be a non-local reference. */
2845 DECL_NONLOCAL (x) = 1;
2847 if (TREE_CODE (t) == UNION_TYPE)
2851 If a union contains a static data member, or a member of
2852 reference type, the program is ill-formed. */
2853 if (TREE_CODE (x) == VAR_DECL)
2855 error ("%q+D may not be static because it is a member of a union", x);
2858 if (TREE_CODE (type) == REFERENCE_TYPE)
2860 error ("%q+D may not have reference type %qT because"
2861 " it is a member of a union",
2867 /* ``A local class cannot have static data members.'' ARM 9.4 */
2868 if (current_function_decl && TREE_STATIC (x))
2869 error ("field %q+D in local class cannot be static", x);
2871 /* Perform error checking that did not get done in
2873 if (TREE_CODE (type) == FUNCTION_TYPE)
2875 error ("field %q+D invalidly declared function type", x);
2876 type = build_pointer_type (type);
2877 TREE_TYPE (x) = type;
2879 else if (TREE_CODE (type) == METHOD_TYPE)
2881 error ("field %q+D invalidly declared method type", x);
2882 type = build_pointer_type (type);
2883 TREE_TYPE (x) = type;
2886 if (type == error_mark_node)
2889 if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL)
2892 /* Now it can only be a FIELD_DECL. */
2894 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
2895 CLASSTYPE_NON_AGGREGATE (t) = 1;
2897 /* If this is of reference type, check if it needs an init.
2898 Also do a little ANSI jig if necessary. */
2899 if (TREE_CODE (type) == REFERENCE_TYPE)
2901 CLASSTYPE_NON_POD_P (t) = 1;
2902 if (DECL_INITIAL (x) == NULL_TREE)
2903 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2905 /* ARM $12.6.2: [A member initializer list] (or, for an
2906 aggregate, initialization by a brace-enclosed list) is the
2907 only way to initialize nonstatic const and reference
2909 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2911 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2913 warning (0, "non-static reference %q+#D in class without a constructor", x);
2916 type = strip_array_types (type);
2918 /* This is used by -Weffc++ (see below). Warn only for pointers
2919 to members which might hold dynamic memory. So do not warn
2920 for pointers to functions or pointers to members. */
2921 if (TYPE_PTR_P (type)
2922 && !TYPE_PTRFN_P (type)
2923 && !TYPE_PTR_TO_MEMBER_P (type))
2924 has_pointers = true;
2926 if (CLASS_TYPE_P (type))
2928 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type))
2929 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2930 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type))
2931 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2934 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
2935 CLASSTYPE_HAS_MUTABLE (t) = 1;
2937 if (! pod_type_p (type))
2938 /* DR 148 now allows pointers to members (which are POD themselves),
2939 to be allowed in POD structs. */
2940 CLASSTYPE_NON_POD_P (t) = 1;
2942 if (! zero_init_p (type))
2943 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
2945 /* If any field is const, the structure type is pseudo-const. */
2946 if (CP_TYPE_CONST_P (type))
2948 C_TYPE_FIELDS_READONLY (t) = 1;
2949 if (DECL_INITIAL (x) == NULL_TREE)
2950 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2952 /* ARM $12.6.2: [A member initializer list] (or, for an
2953 aggregate, initialization by a brace-enclosed list) is the
2954 only way to initialize nonstatic const and reference
2956 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2958 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2960 warning (0, "non-static const member %q+#D in class without a constructor", x);
2962 /* A field that is pseudo-const makes the structure likewise. */
2963 else if (CLASS_TYPE_P (type))
2965 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
2966 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
2967 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
2968 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
2971 /* Core issue 80: A nonstatic data member is required to have a
2972 different name from the class iff the class has a
2973 user-defined constructor. */
2974 if (constructor_name_p (DECL_NAME (x), t) && TYPE_HAS_CONSTRUCTOR (t))
2975 pedwarn ("field %q+#D with same name as class", x);
2977 /* We set DECL_C_BIT_FIELD in grokbitfield.
2978 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
2979 if (DECL_C_BIT_FIELD (x))
2980 check_bitfield_decl (x);
2982 check_field_decl (x, t,
2983 cant_have_const_ctor_p,
2985 &any_default_members);
2988 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
2989 it should also define a copy constructor and an assignment operator to
2990 implement the correct copy semantic (deep vs shallow, etc.). As it is
2991 not feasible to check whether the constructors do allocate dynamic memory
2992 and store it within members, we approximate the warning like this:
2994 -- Warn only if there are members which are pointers
2995 -- Warn only if there is a non-trivial constructor (otherwise,
2996 there cannot be memory allocated).
2997 -- Warn only if there is a non-trivial destructor. We assume that the
2998 user at least implemented the cleanup correctly, and a destructor
2999 is needed to free dynamic memory.
3001 This seems enough for practical purposes. */
3004 && TYPE_HAS_CONSTRUCTOR (t)
3005 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3006 && !(TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3008 warning (0, "%q#T has pointer data members", t);
3010 if (! TYPE_HAS_INIT_REF (t))
3012 warning (0, " but does not override %<%T(const %T&)%>", t, t);
3013 if (! TYPE_HAS_ASSIGN_REF (t))
3014 warning (0, " or %<operator=(const %T&)%>", t);
3016 else if (! TYPE_HAS_ASSIGN_REF (t))
3017 warning (0, " but does not override %<operator=(const %T&)%>", t);
3021 /* Check anonymous struct/anonymous union fields. */
3022 finish_struct_anon (t);
3024 /* We've built up the list of access declarations in reverse order.
3026 *access_decls = nreverse (*access_decls);
3029 /* If TYPE is an empty class type, records its OFFSET in the table of
3033 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3037 if (!is_empty_class (type))
3040 /* Record the location of this empty object in OFFSETS. */
3041 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3043 n = splay_tree_insert (offsets,
3044 (splay_tree_key) offset,
3045 (splay_tree_value) NULL_TREE);
3046 n->value = ((splay_tree_value)
3047 tree_cons (NULL_TREE,
3054 /* Returns nonzero if TYPE is an empty class type and there is
3055 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3058 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3063 if (!is_empty_class (type))
3066 /* Record the location of this empty object in OFFSETS. */
3067 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3071 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3072 if (same_type_p (TREE_VALUE (t), type))
3078 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3079 F for every subobject, passing it the type, offset, and table of
3080 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3083 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3084 than MAX_OFFSET will not be walked.
3086 If F returns a nonzero value, the traversal ceases, and that value
3087 is returned. Otherwise, returns zero. */
3090 walk_subobject_offsets (tree type,
3091 subobject_offset_fn f,
3098 tree type_binfo = NULL_TREE;
3100 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3102 if (max_offset && INT_CST_LT (max_offset, offset))
3105 if (type == error_mark_node)
3110 if (abi_version_at_least (2))
3112 type = BINFO_TYPE (type);
3115 if (CLASS_TYPE_P (type))
3121 /* Avoid recursing into objects that are not interesting. */
3122 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3125 /* Record the location of TYPE. */
3126 r = (*f) (type, offset, offsets);
3130 /* Iterate through the direct base classes of TYPE. */
3132 type_binfo = TYPE_BINFO (type);
3133 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++)
3137 if (abi_version_at_least (2)
3138 && BINFO_VIRTUAL_P (binfo))
3142 && BINFO_VIRTUAL_P (binfo)
3143 && !BINFO_PRIMARY_P (binfo))
3146 if (!abi_version_at_least (2))
3147 binfo_offset = size_binop (PLUS_EXPR,
3149 BINFO_OFFSET (binfo));
3153 /* We cannot rely on BINFO_OFFSET being set for the base
3154 class yet, but the offsets for direct non-virtual
3155 bases can be calculated by going back to the TYPE. */
3156 orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i);
3157 binfo_offset = size_binop (PLUS_EXPR,
3159 BINFO_OFFSET (orig_binfo));
3162 r = walk_subobject_offsets (binfo,
3167 (abi_version_at_least (2)
3168 ? /*vbases_p=*/0 : vbases_p));
3173 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type))
3176 VEC(tree,gc) *vbases;
3178 /* Iterate through the virtual base classes of TYPE. In G++
3179 3.2, we included virtual bases in the direct base class
3180 loop above, which results in incorrect results; the
3181 correct offsets for virtual bases are only known when
3182 working with the most derived type. */
3184 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
3185 VEC_iterate (tree, vbases, ix, binfo); ix++)
3187 r = walk_subobject_offsets (binfo,
3189 size_binop (PLUS_EXPR,
3191 BINFO_OFFSET (binfo)),
3200 /* We still have to walk the primary base, if it is
3201 virtual. (If it is non-virtual, then it was walked
3203 tree vbase = get_primary_binfo (type_binfo);
3205 if (vbase && BINFO_VIRTUAL_P (vbase)
3206 && BINFO_PRIMARY_P (vbase)
3207 && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo)
3209 r = (walk_subobject_offsets
3211 offsets, max_offset, /*vbases_p=*/0));
3218 /* Iterate through the fields of TYPE. */
3219 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3220 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3224 if (abi_version_at_least (2))
3225 field_offset = byte_position (field);
3227 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3228 field_offset = DECL_FIELD_OFFSET (field);
3230 r = walk_subobject_offsets (TREE_TYPE (field),
3232 size_binop (PLUS_EXPR,
3242 else if (TREE_CODE (type) == ARRAY_TYPE)
3244 tree element_type = strip_array_types (type);
3245 tree domain = TYPE_DOMAIN (type);
3248 /* Avoid recursing into objects that are not interesting. */
3249 if (!CLASS_TYPE_P (element_type)
3250 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3253 /* Step through each of the elements in the array. */
3254 for (index = size_zero_node;
3255 /* G++ 3.2 had an off-by-one error here. */
3256 (abi_version_at_least (2)
3257 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3258 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3259 index = size_binop (PLUS_EXPR, index, size_one_node))
3261 r = walk_subobject_offsets (TREE_TYPE (type),
3269 offset = size_binop (PLUS_EXPR, offset,
3270 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3271 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3272 there's no point in iterating through the remaining
3273 elements of the array. */
3274 if (max_offset && INT_CST_LT (max_offset, offset))
3282 /* Record all of the empty subobjects of TYPE (located at OFFSET) in
3283 OFFSETS. If VBASES_P is nonzero, virtual bases of TYPE are
3287 record_subobject_offsets (tree type,
3292 walk_subobject_offsets (type, record_subobject_offset, offset,
3293 offsets, /*max_offset=*/NULL_TREE, vbases_p);
3296 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3297 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3298 virtual bases of TYPE are examined. */
3301 layout_conflict_p (tree type,
3306 splay_tree_node max_node;
3308 /* Get the node in OFFSETS that indicates the maximum offset where
3309 an empty subobject is located. */
3310 max_node = splay_tree_max (offsets);
3311 /* If there aren't any empty subobjects, then there's no point in
3312 performing this check. */
3316 return walk_subobject_offsets (type, check_subobject_offset, offset,
3317 offsets, (tree) (max_node->key),
3321 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3322 non-static data member of the type indicated by RLI. BINFO is the
3323 binfo corresponding to the base subobject, OFFSETS maps offsets to
3324 types already located at those offsets. This function determines
3325 the position of the DECL. */
3328 layout_nonempty_base_or_field (record_layout_info rli,
3333 tree offset = NULL_TREE;
3339 /* For the purposes of determining layout conflicts, we want to
3340 use the class type of BINFO; TREE_TYPE (DECL) will be the
3341 CLASSTYPE_AS_BASE version, which does not contain entries for
3342 zero-sized bases. */
3343 type = TREE_TYPE (binfo);
3348 type = TREE_TYPE (decl);
3352 /* Try to place the field. It may take more than one try if we have
3353 a hard time placing the field without putting two objects of the
3354 same type at the same address. */
3357 struct record_layout_info_s old_rli = *rli;
3359 /* Place this field. */
3360 place_field (rli, decl);
3361 offset = byte_position (decl);
3363 /* We have to check to see whether or not there is already
3364 something of the same type at the offset we're about to use.
3365 For example, consider:
3368 struct T : public S { int i; };
3369 struct U : public S, public T {};
3371 Here, we put S at offset zero in U. Then, we can't put T at
3372 offset zero -- its S component would be at the same address
3373 as the S we already allocated. So, we have to skip ahead.
3374 Since all data members, including those whose type is an
3375 empty class, have nonzero size, any overlap can happen only
3376 with a direct or indirect base-class -- it can't happen with
3378 /* In a union, overlap is permitted; all members are placed at
3380 if (TREE_CODE (rli->t) == UNION_TYPE)
3382 /* G++ 3.2 did not check for overlaps when placing a non-empty
3384 if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo))
3386 if (layout_conflict_p (field_p ? type : binfo, offset,
3389 /* Strip off the size allocated to this field. That puts us
3390 at the first place we could have put the field with
3391 proper alignment. */
3394 /* Bump up by the alignment required for the type. */
3396 = size_binop (PLUS_EXPR, rli->bitpos,
3398 ? CLASSTYPE_ALIGN (type)
3399 : TYPE_ALIGN (type)));
3400 normalize_rli (rli);
3403 /* There was no conflict. We're done laying out this field. */
3407 /* Now that we know where it will be placed, update its
3409 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3410 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3411 this point because their BINFO_OFFSET is copied from another
3412 hierarchy. Therefore, we may not need to add the entire
3414 propagate_binfo_offsets (binfo,
3415 size_diffop (convert (ssizetype, offset),
3417 BINFO_OFFSET (binfo))));
3420 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3423 empty_base_at_nonzero_offset_p (tree type,
3425 splay_tree offsets ATTRIBUTE_UNUSED)
3427 return is_empty_class (type) && !integer_zerop (offset);
3430 /* Layout the empty base BINFO. EOC indicates the byte currently just
3431 past the end of the class, and should be correctly aligned for a
3432 class of the type indicated by BINFO; OFFSETS gives the offsets of
3433 the empty bases allocated so far. T is the most derived
3434 type. Return nonzero iff we added it at the end. */
3437 layout_empty_base (tree binfo, tree eoc, splay_tree offsets)
3440 tree basetype = BINFO_TYPE (binfo);
3443 /* This routine should only be used for empty classes. */
3444 gcc_assert (is_empty_class (basetype));
3445 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3447 if (!integer_zerop (BINFO_OFFSET (binfo)))
3449 if (abi_version_at_least (2))
3450 propagate_binfo_offsets
3451 (binfo, size_diffop (size_zero_node, BINFO_OFFSET (binfo)));
3453 warning (0, "offset of empty base %qT may not be ABI-compliant and may"
3454 "change in a future version of GCC",
3455 BINFO_TYPE (binfo));
3458 /* This is an empty base class. We first try to put it at offset
3460 if (layout_conflict_p (binfo,
3461 BINFO_OFFSET (binfo),
3465 /* That didn't work. Now, we move forward from the next
3466 available spot in the class. */
3468 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3471 if (!layout_conflict_p (binfo,
3472 BINFO_OFFSET (binfo),
3475 /* We finally found a spot where there's no overlap. */
3478 /* There's overlap here, too. Bump along to the next spot. */
3479 propagate_binfo_offsets (binfo, alignment);
3485 /* Layout the base given by BINFO in the class indicated by RLI.
3486 *BASE_ALIGN is a running maximum of the alignments of
3487 any base class. OFFSETS gives the location of empty base
3488 subobjects. T is the most derived type. Return nonzero if the new
3489 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3490 *NEXT_FIELD, unless BINFO is for an empty base class.
3492 Returns the location at which the next field should be inserted. */
3495 build_base_field (record_layout_info rli, tree binfo,
3496 splay_tree offsets, tree *next_field)
3499 tree basetype = BINFO_TYPE (binfo);
3501 if (!COMPLETE_TYPE_P (basetype))
3502 /* This error is now reported in xref_tag, thus giving better
3503 location information. */
3506 /* Place the base class. */
3507 if (!is_empty_class (basetype))
3511 /* The containing class is non-empty because it has a non-empty
3513 CLASSTYPE_EMPTY_P (t) = 0;
3515 /* Create the FIELD_DECL. */
3516 decl = build_decl (FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
3517 DECL_ARTIFICIAL (decl) = 1;
3518 DECL_IGNORED_P (decl) = 1;
3519 DECL_FIELD_CONTEXT (decl) = t;
3520 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3521 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3522 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3523 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3524 DECL_MODE (decl) = TYPE_MODE (basetype);
3525 DECL_FIELD_IS_BASE (decl) = 1;
3527 /* Try to place the field. It may take more than one try if we
3528 have a hard time placing the field without putting two
3529 objects of the same type at the same address. */
3530 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
3531 /* Add the new FIELD_DECL to the list of fields for T. */
3532 TREE_CHAIN (decl) = *next_field;
3534 next_field = &TREE_CHAIN (decl);
3541 /* On some platforms (ARM), even empty classes will not be
3543 eoc = round_up (rli_size_unit_so_far (rli),
3544 CLASSTYPE_ALIGN_UNIT (basetype));
3545 atend = layout_empty_base (binfo, eoc, offsets);
3546 /* A nearly-empty class "has no proper base class that is empty,
3547 not morally virtual, and at an offset other than zero." */
3548 if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
3551 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3552 /* The check above (used in G++ 3.2) is insufficient because
3553 an empty class placed at offset zero might itself have an
3554 empty base at a nonzero offset. */
3555 else if (walk_subobject_offsets (basetype,
3556 empty_base_at_nonzero_offset_p,
3559 /*max_offset=*/NULL_TREE,
3562 if (abi_version_at_least (2))
3563 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3565 warning (0, "class %qT will be considered nearly empty in a "
3566 "future version of GCC", t);
3570 /* We do not create a FIELD_DECL for empty base classes because
3571 it might overlap some other field. We want to be able to
3572 create CONSTRUCTORs for the class by iterating over the
3573 FIELD_DECLs, and the back end does not handle overlapping
3576 /* An empty virtual base causes a class to be non-empty
3577 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3578 here because that was already done when the virtual table
3579 pointer was created. */
3582 /* Record the offsets of BINFO and its base subobjects. */
3583 record_subobject_offsets (binfo,
3584 BINFO_OFFSET (binfo),
3591 /* Layout all of the non-virtual base classes. Record empty
3592 subobjects in OFFSETS. T is the most derived type. Return nonzero
3593 if the type cannot be nearly empty. The fields created
3594 corresponding to the base classes will be inserted at
3598 build_base_fields (record_layout_info rli,
3599 splay_tree offsets, tree *next_field)
3601 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3604 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
3607 /* The primary base class is always allocated first. */
3608 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
3609 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
3610 offsets, next_field);
3612 /* Now allocate the rest of the bases. */
3613 for (i = 0; i < n_baseclasses; ++i)
3617 base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
3619 /* The primary base was already allocated above, so we don't
3620 need to allocate it again here. */
3621 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
3624 /* Virtual bases are added at the end (a primary virtual base
3625 will have already been added). */
3626 if (BINFO_VIRTUAL_P (base_binfo))
3629 next_field = build_base_field (rli, base_binfo,
3630 offsets, next_field);
3634 /* Go through the TYPE_METHODS of T issuing any appropriate
3635 diagnostics, figuring out which methods override which other
3636 methods, and so forth. */
3639 check_methods (tree t)
3643 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3645 check_for_override (x, t);
3646 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3647 error ("initializer specified for non-virtual method %q+D", x);
3648 /* The name of the field is the original field name
3649 Save this in auxiliary field for later overloading. */
3650 if (DECL_VINDEX (x))
3652 TYPE_POLYMORPHIC_P (t) = 1;
3653 if (DECL_PURE_VIRTUAL_P (x))
3654 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
3656 /* All user-declared destructors are non-trivial. */
3657 if (DECL_DESTRUCTOR_P (x))
3658 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1;
3662 /* FN is a constructor or destructor. Clone the declaration to create
3663 a specialized in-charge or not-in-charge version, as indicated by
3667 build_clone (tree fn, tree name)
3672 /* Copy the function. */
3673 clone = copy_decl (fn);
3674 /* Remember where this function came from. */
3675 DECL_CLONED_FUNCTION (clone) = fn;
3676 DECL_ABSTRACT_ORIGIN (clone) = fn;
3677 /* Reset the function name. */
3678 DECL_NAME (clone) = name;
3679 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
3680 /* There's no pending inline data for this function. */
3681 DECL_PENDING_INLINE_INFO (clone) = NULL;
3682 DECL_PENDING_INLINE_P (clone) = 0;
3683 /* And it hasn't yet been deferred. */
3684 DECL_DEFERRED_FN (clone) = 0;
3686 /* The base-class destructor is not virtual. */
3687 if (name == base_dtor_identifier)
3689 DECL_VIRTUAL_P (clone) = 0;
3690 if (TREE_CODE (clone) != TEMPLATE_DECL)
3691 DECL_VINDEX (clone) = NULL_TREE;
3694 /* If there was an in-charge parameter, drop it from the function
3696 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3702 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3703 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3704 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
3705 /* Skip the `this' parameter. */
3706 parmtypes = TREE_CHAIN (parmtypes);
3707 /* Skip the in-charge parameter. */
3708 parmtypes = TREE_CHAIN (parmtypes);
3709 /* And the VTT parm, in a complete [cd]tor. */
3710 if (DECL_HAS_VTT_PARM_P (fn)
3711 && ! DECL_NEEDS_VTT_PARM_P (clone))
3712 parmtypes = TREE_CHAIN (parmtypes);
3713 /* If this is subobject constructor or destructor, add the vtt
3716 = build_method_type_directly (basetype,
3717 TREE_TYPE (TREE_TYPE (clone)),
3720 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
3723 = cp_build_type_attribute_variant (TREE_TYPE (clone),
3724 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
3727 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3728 aren't function parameters; those are the template parameters. */
3729 if (TREE_CODE (clone) != TEMPLATE_DECL)
3731 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
3732 /* Remove the in-charge parameter. */
3733 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3735 TREE_CHAIN (DECL_ARGUMENTS (clone))
3736 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3737 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
3739 /* And the VTT parm, in a complete [cd]tor. */
3740 if (DECL_HAS_VTT_PARM_P (fn))
3742 if (DECL_NEEDS_VTT_PARM_P (clone))
3743 DECL_HAS_VTT_PARM_P (clone) = 1;
3746 TREE_CHAIN (DECL_ARGUMENTS (clone))
3747 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3748 DECL_HAS_VTT_PARM_P (clone) = 0;
3752 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
3754 DECL_CONTEXT (parms) = clone;
3755 cxx_dup_lang_specific_decl (parms);
3759 /* Create the RTL for this function. */
3760 SET_DECL_RTL (clone, NULL_RTX);
3761 rest_of_decl_compilation (clone, /*top_level=*/1, at_eof);
3763 /* Make it easy to find the CLONE given the FN. */
3764 TREE_CHAIN (clone) = TREE_CHAIN (fn);
3765 TREE_CHAIN (fn) = clone;
3767 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3768 if (TREE_CODE (clone) == TEMPLATE_DECL)
3772 DECL_TEMPLATE_RESULT (clone)
3773 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
3774 result = DECL_TEMPLATE_RESULT (clone);
3775 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
3776 DECL_TI_TEMPLATE (result) = clone;
3779 note_decl_for_pch (clone);
3784 /* Produce declarations for all appropriate clones of FN. If
3785 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3786 CLASTYPE_METHOD_VEC as well. */
3789 clone_function_decl (tree fn, int update_method_vec_p)
3793 /* Avoid inappropriate cloning. */
3795 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn)))
3798 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
3800 /* For each constructor, we need two variants: an in-charge version
3801 and a not-in-charge version. */
3802 clone = build_clone (fn, complete_ctor_identifier);
3803 if (update_method_vec_p)
3804 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3805 clone = build_clone (fn, base_ctor_identifier);
3806 if (update_method_vec_p)
3807 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3811 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn));
3813 /* For each destructor, we need three variants: an in-charge
3814 version, a not-in-charge version, and an in-charge deleting
3815 version. We clone the deleting version first because that
3816 means it will go second on the TYPE_METHODS list -- and that
3817 corresponds to the correct layout order in the virtual
3820 For a non-virtual destructor, we do not build a deleting
3822 if (DECL_VIRTUAL_P (fn))
3824 clone = build_clone (fn, deleting_dtor_identifier);
3825 if (update_method_vec_p)
3826 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3828 clone = build_clone (fn, complete_dtor_identifier);
3829 if (update_method_vec_p)
3830 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3831 clone = build_clone (fn, base_dtor_identifier);
3832 if (update_method_vec_p)
3833 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3836 /* Note that this is an abstract function that is never emitted. */
3837 DECL_ABSTRACT (fn) = 1;
3840 /* DECL is an in charge constructor, which is being defined. This will
3841 have had an in class declaration, from whence clones were
3842 declared. An out-of-class definition can specify additional default
3843 arguments. As it is the clones that are involved in overload
3844 resolution, we must propagate the information from the DECL to its
3848 adjust_clone_args (tree decl)
3852 for (clone = TREE_CHAIN (decl); clone && DECL_CLONED_FUNCTION (clone);
3853 clone = TREE_CHAIN (clone))
3855 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
3856 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
3857 tree decl_parms, clone_parms;
3859 clone_parms = orig_clone_parms;
3861 /* Skip the 'this' parameter. */
3862 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
3863 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3865 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
3866 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3867 if (DECL_HAS_VTT_PARM_P (decl))
3868 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3870 clone_parms = orig_clone_parms;
3871 if (DECL_HAS_VTT_PARM_P (clone))
3872 clone_parms = TREE_CHAIN (clone_parms);
3874 for (decl_parms = orig_decl_parms; decl_parms;
3875 decl_parms = TREE_CHAIN (decl_parms),
3876 clone_parms = TREE_CHAIN (clone_parms))
3878 gcc_assert (same_type_p (TREE_TYPE (decl_parms),
3879 TREE_TYPE (clone_parms)));
3881 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
3883 /* A default parameter has been added. Adjust the
3884 clone's parameters. */
3885 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3886 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3889 clone_parms = orig_decl_parms;
3891 if (DECL_HAS_VTT_PARM_P (clone))
3893 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
3894 TREE_VALUE (orig_clone_parms),
3896 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
3898 type = build_method_type_directly (basetype,
3899 TREE_TYPE (TREE_TYPE (clone)),
3902 type = build_exception_variant (type, exceptions);
3903 TREE_TYPE (clone) = type;
3905 clone_parms = NULL_TREE;
3909 gcc_assert (!clone_parms);
3913 /* For each of the constructors and destructors in T, create an
3914 in-charge and not-in-charge variant. */
3917 clone_constructors_and_destructors (tree t)
3921 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
3923 if (!CLASSTYPE_METHOD_VEC (t))
3926 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
3927 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
3928 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
3929 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
3932 /* Remove all zero-width bit-fields from T. */
3935 remove_zero_width_bit_fields (tree t)
3939 fieldsp = &TYPE_FIELDS (t);
3942 if (TREE_CODE (*fieldsp) == FIELD_DECL
3943 && DECL_C_BIT_FIELD (*fieldsp)
3944 && DECL_INITIAL (*fieldsp))
3945 *fieldsp = TREE_CHAIN (*fieldsp);
3947 fieldsp = &TREE_CHAIN (*fieldsp);
3951 /* Returns TRUE iff we need a cookie when dynamically allocating an
3952 array whose elements have the indicated class TYPE. */
3955 type_requires_array_cookie (tree type)
3958 bool has_two_argument_delete_p = false;
3960 gcc_assert (CLASS_TYPE_P (type));
3962 /* If there's a non-trivial destructor, we need a cookie. In order
3963 to iterate through the array calling the destructor for each
3964 element, we'll have to know how many elements there are. */
3965 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3968 /* If the usual deallocation function is a two-argument whose second
3969 argument is of type `size_t', then we have to pass the size of
3970 the array to the deallocation function, so we will need to store
3972 fns = lookup_fnfields (TYPE_BINFO (type),
3973 ansi_opname (VEC_DELETE_EXPR),
3975 /* If there are no `operator []' members, or the lookup is
3976 ambiguous, then we don't need a cookie. */
3977 if (!fns || fns == error_mark_node)
3979 /* Loop through all of the functions. */
3980 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
3985 /* Select the current function. */
3986 fn = OVL_CURRENT (fns);
3987 /* See if this function is a one-argument delete function. If
3988 it is, then it will be the usual deallocation function. */
3989 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
3990 if (second_parm == void_list_node)
3992 /* Otherwise, if we have a two-argument function and the second
3993 argument is `size_t', it will be the usual deallocation
3994 function -- unless there is one-argument function, too. */
3995 if (TREE_CHAIN (second_parm) == void_list_node
3996 && same_type_p (TREE_VALUE (second_parm), sizetype))
3997 has_two_argument_delete_p = true;
4000 return has_two_argument_delete_p;
4003 /* Check the validity of the bases and members declared in T. Add any
4004 implicitly-generated functions (like copy-constructors and
4005 assignment operators). Compute various flag bits (like
4006 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4007 level: i.e., independently of the ABI in use. */
4010 check_bases_and_members (tree t)
4012 /* Nonzero if the implicitly generated copy constructor should take
4013 a non-const reference argument. */
4014 int cant_have_const_ctor;
4015 /* Nonzero if the implicitly generated assignment operator
4016 should take a non-const reference argument. */
4017 int no_const_asn_ref;
4020 /* By default, we use const reference arguments and generate default
4022 cant_have_const_ctor = 0;
4023 no_const_asn_ref = 0;
4025 /* Check all the base-classes. */
4026 check_bases (t, &cant_have_const_ctor,
4029 /* Check all the method declarations. */
4032 /* Check all the data member declarations. We cannot call
4033 check_field_decls until we have called check_bases check_methods,
4034 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4035 being set appropriately. */
4036 check_field_decls (t, &access_decls,
4037 &cant_have_const_ctor,
4040 /* A nearly-empty class has to be vptr-containing; a nearly empty
4041 class contains just a vptr. */
4042 if (!TYPE_CONTAINS_VPTR_P (t))
4043 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4045 /* Do some bookkeeping that will guide the generation of implicitly
4046 declared member functions. */
4047 TYPE_HAS_COMPLEX_INIT_REF (t)
4048 |= (TYPE_HAS_INIT_REF (t) || TYPE_CONTAINS_VPTR_P (t));
4049 TYPE_NEEDS_CONSTRUCTING (t)
4050 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4051 CLASSTYPE_NON_AGGREGATE (t)
4052 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_POLYMORPHIC_P (t));
4053 CLASSTYPE_NON_POD_P (t)
4054 |= (CLASSTYPE_NON_AGGREGATE (t)
4055 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
4056 || TYPE_HAS_ASSIGN_REF (t));
4057 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4058 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_CONTAINS_VPTR_P (t);
4060 /* Synthesize any needed methods. */
4061 add_implicitly_declared_members (t,
4062 cant_have_const_ctor,
4065 /* Create the in-charge and not-in-charge variants of constructors
4067 clone_constructors_and_destructors (t);
4069 /* Process the using-declarations. */
4070 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4071 handle_using_decl (TREE_VALUE (access_decls), t);
4073 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4074 finish_struct_methods (t);
4076 /* Figure out whether or not we will need a cookie when dynamically
4077 allocating an array of this type. */
4078 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
4079 = type_requires_array_cookie (t);
4082 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4083 accordingly. If a new vfield was created (because T doesn't have a
4084 primary base class), then the newly created field is returned. It
4085 is not added to the TYPE_FIELDS list; it is the caller's
4086 responsibility to do that. Accumulate declared virtual functions
4090 create_vtable_ptr (tree t, tree* virtuals_p)
4094 /* Collect the virtual functions declared in T. */
4095 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4096 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
4097 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
4099 tree new_virtual = make_node (TREE_LIST);
4101 BV_FN (new_virtual) = fn;
4102 BV_DELTA (new_virtual) = integer_zero_node;
4103 BV_VCALL_INDEX (new_virtual) = NULL_TREE;
4105 TREE_CHAIN (new_virtual) = *virtuals_p;
4106 *virtuals_p = new_virtual;
4109 /* If we couldn't find an appropriate base class, create a new field
4110 here. Even if there weren't any new virtual functions, we might need a
4111 new virtual function table if we're supposed to include vptrs in
4112 all classes that need them. */
4113 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
4115 /* We build this decl with vtbl_ptr_type_node, which is a
4116 `vtable_entry_type*'. It might seem more precise to use
4117 `vtable_entry_type (*)[N]' where N is the number of virtual
4118 functions. However, that would require the vtable pointer in
4119 base classes to have a different type than the vtable pointer
4120 in derived classes. We could make that happen, but that
4121 still wouldn't solve all the problems. In particular, the
4122 type-based alias analysis code would decide that assignments
4123 to the base class vtable pointer can't alias assignments to
4124 the derived class vtable pointer, since they have different
4125 types. Thus, in a derived class destructor, where the base
4126 class constructor was inlined, we could generate bad code for
4127 setting up the vtable pointer.
4129 Therefore, we use one type for all vtable pointers. We still
4130 use a type-correct type; it's just doesn't indicate the array
4131 bounds. That's better than using `void*' or some such; it's
4132 cleaner, and it let's the alias analysis code know that these
4133 stores cannot alias stores to void*! */
4136 field = build_decl (FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
4137 DECL_VIRTUAL_P (field) = 1;
4138 DECL_ARTIFICIAL (field) = 1;
4139 DECL_FIELD_CONTEXT (field) = t;
4140 DECL_FCONTEXT (field) = t;
4142 TYPE_VFIELD (t) = field;
4144 /* This class is non-empty. */
4145 CLASSTYPE_EMPTY_P (t) = 0;
4153 /* Fixup the inline function given by INFO now that the class is
4157 fixup_pending_inline (tree fn)
4159 if (DECL_PENDING_INLINE_INFO (fn))
4161 tree args = DECL_ARGUMENTS (fn);
4164 DECL_CONTEXT (args) = fn;
4165 args = TREE_CHAIN (args);
4170 /* Fixup the inline methods and friends in TYPE now that TYPE is
4174 fixup_inline_methods (tree type)
4176 tree method = TYPE_METHODS (type);
4177 VEC(tree,gc) *friends;
4180 if (method && TREE_CODE (method) == TREE_VEC)
4182 if (TREE_VEC_ELT (method, 1))
4183 method = TREE_VEC_ELT (method, 1);
4184 else if (TREE_VEC_ELT (method, 0))
4185 method = TREE_VEC_ELT (method, 0);
4187 method = TREE_VEC_ELT (method, 2);
4190 /* Do inline member functions. */
4191 for (; method; method = TREE_CHAIN (method))
4192 fixup_pending_inline (method);
4195 for (friends = CLASSTYPE_INLINE_FRIENDS (type), ix = 0;
4196 VEC_iterate (tree, friends, ix, method); ix++)
4197 fixup_pending_inline (method);
4198 CLASSTYPE_INLINE_FRIENDS (type) = NULL;
4201 /* Add OFFSET to all base types of BINFO which is a base in the
4202 hierarchy dominated by T.
4204 OFFSET, which is a type offset, is number of bytes. */
4207 propagate_binfo_offsets (tree binfo, tree offset)
4213 /* Update BINFO's offset. */
4214 BINFO_OFFSET (binfo)
4215 = convert (sizetype,
4216 size_binop (PLUS_EXPR,
4217 convert (ssizetype, BINFO_OFFSET (binfo)),
4220 /* Find the primary base class. */
4221 primary_binfo = get_primary_binfo (binfo);
4223 if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo)
4224 propagate_binfo_offsets (primary_binfo, offset);
4226 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4228 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4230 /* Don't do the primary base twice. */
4231 if (base_binfo == primary_binfo)
4234 if (BINFO_VIRTUAL_P (base_binfo))
4237 propagate_binfo_offsets (base_binfo, offset);
4241 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4242 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4243 empty subobjects of T. */
4246 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
4250 bool first_vbase = true;
4253 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0)
4256 if (!abi_version_at_least(2))
4258 /* In G++ 3.2, we incorrectly rounded the size before laying out
4259 the virtual bases. */
4260 finish_record_layout (rli, /*free_p=*/false);
4261 #ifdef STRUCTURE_SIZE_BOUNDARY
4262 /* Packed structures don't need to have minimum size. */
4263 if (! TYPE_PACKED (t))
4264 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
4266 rli->offset = TYPE_SIZE_UNIT (t);
4267 rli->bitpos = bitsize_zero_node;
4268 rli->record_align = TYPE_ALIGN (t);
4271 /* Find the last field. The artificial fields created for virtual
4272 bases will go after the last extant field to date. */
4273 next_field = &TYPE_FIELDS (t);
4275 next_field = &TREE_CHAIN (*next_field);
4277 /* Go through the virtual bases, allocating space for each virtual
4278 base that is not already a primary base class. These are
4279 allocated in inheritance graph order. */
4280 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
4282 if (!BINFO_VIRTUAL_P (vbase))
4285 if (!BINFO_PRIMARY_P (vbase))
4287 tree basetype = TREE_TYPE (vbase);
4289 /* This virtual base is not a primary base of any class in the
4290 hierarchy, so we have to add space for it. */
4291 next_field = build_base_field (rli, vbase,
4292 offsets, next_field);
4294 /* If the first virtual base might have been placed at a
4295 lower address, had we started from CLASSTYPE_SIZE, rather
4296 than TYPE_SIZE, issue a warning. There can be both false
4297 positives and false negatives from this warning in rare
4298 cases; to deal with all the possibilities would probably
4299 require performing both layout algorithms and comparing
4300 the results which is not particularly tractable. */
4304 (size_binop (CEIL_DIV_EXPR,
4305 round_up (CLASSTYPE_SIZE (t),
4306 CLASSTYPE_ALIGN (basetype)),
4308 BINFO_OFFSET (vbase))))
4309 warning (0, "offset of virtual base %qT is not ABI-compliant and "
4310 "may change in a future version of GCC",
4313 first_vbase = false;
4318 /* Returns the offset of the byte just past the end of the base class
4322 end_of_base (tree binfo)
4326 if (is_empty_class (BINFO_TYPE (binfo)))
4327 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4328 allocate some space for it. It cannot have virtual bases, so
4329 TYPE_SIZE_UNIT is fine. */
4330 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4332 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4334 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
4337 /* Returns the offset of the byte just past the end of the base class
4338 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4339 only non-virtual bases are included. */
4342 end_of_class (tree t, int include_virtuals_p)
4344 tree result = size_zero_node;
4345 VEC(tree,gc) *vbases;
4351 for (binfo = TYPE_BINFO (t), i = 0;
4352 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4354 if (!include_virtuals_p
4355 && BINFO_VIRTUAL_P (base_binfo)
4356 && (!BINFO_PRIMARY_P (base_binfo)
4357 || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t)))
4360 offset = end_of_base (base_binfo);
4361 if (INT_CST_LT_UNSIGNED (result, offset))
4365 /* G++ 3.2 did not check indirect virtual bases. */
4366 if (abi_version_at_least (2) && include_virtuals_p)
4367 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4368 VEC_iterate (tree, vbases, i, base_binfo); i++)
4370 offset = end_of_base (base_binfo);
4371 if (INT_CST_LT_UNSIGNED (result, offset))
4378 /* Warn about bases of T that are inaccessible because they are
4379 ambiguous. For example:
4382 struct T : public S {};
4383 struct U : public S, public T {};
4385 Here, `(S*) new U' is not allowed because there are two `S'
4389 warn_about_ambiguous_bases (tree t)
4392 VEC(tree,gc) *vbases;
4397 /* If there are no repeated bases, nothing can be ambiguous. */
4398 if (!CLASSTYPE_REPEATED_BASE_P (t))
4401 /* Check direct bases. */
4402 for (binfo = TYPE_BINFO (t), i = 0;
4403 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4405 basetype = BINFO_TYPE (base_binfo);
4407 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4408 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
4412 /* Check for ambiguous virtual bases. */
4414 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4415 VEC_iterate (tree, vbases, i, binfo); i++)
4417 basetype = BINFO_TYPE (binfo);
4419 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4420 warning (0, "virtual base %qT inaccessible in %qT due to ambiguity",
4425 /* Compare two INTEGER_CSTs K1 and K2. */
4428 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
4430 return tree_int_cst_compare ((tree) k1, (tree) k2);
4433 /* Increase the size indicated in RLI to account for empty classes
4434 that are "off the end" of the class. */
4437 include_empty_classes (record_layout_info rli)
4442 /* It might be the case that we grew the class to allocate a
4443 zero-sized base class. That won't be reflected in RLI, yet,
4444 because we are willing to overlay multiple bases at the same
4445 offset. However, now we need to make sure that RLI is big enough
4446 to reflect the entire class. */
4447 eoc = end_of_class (rli->t,
4448 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
4449 rli_size = rli_size_unit_so_far (rli);
4450 if (TREE_CODE (rli_size) == INTEGER_CST
4451 && INT_CST_LT_UNSIGNED (rli_size, eoc))
4453 if (!abi_version_at_least (2))
4454 /* In version 1 of the ABI, the size of a class that ends with
4455 a bitfield was not rounded up to a whole multiple of a
4456 byte. Because rli_size_unit_so_far returns only the number
4457 of fully allocated bytes, any extra bits were not included
4459 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
4461 /* The size should have been rounded to a whole byte. */
4462 gcc_assert (tree_int_cst_equal
4463 (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT)));
4465 = size_binop (PLUS_EXPR,
4467 size_binop (MULT_EXPR,
4468 convert (bitsizetype,
4469 size_binop (MINUS_EXPR,
4471 bitsize_int (BITS_PER_UNIT)));
4472 normalize_rli (rli);
4476 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4477 BINFO_OFFSETs for all of the base-classes. Position the vtable
4478 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4481 layout_class_type (tree t, tree *virtuals_p)
4483 tree non_static_data_members;
4486 record_layout_info rli;
4487 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4488 types that appear at that offset. */
4489 splay_tree empty_base_offsets;
4490 /* True if the last field layed out was a bit-field. */
4491 bool last_field_was_bitfield = false;
4492 /* The location at which the next field should be inserted. */
4494 /* T, as a base class. */
4497 /* Keep track of the first non-static data member. */
4498 non_static_data_members = TYPE_FIELDS (t);
4500 /* Start laying out the record. */
4501 rli = start_record_layout (t);
4503 /* Mark all the primary bases in the hierarchy. */
4504 determine_primary_bases (t);
4506 /* Create a pointer to our virtual function table. */
4507 vptr = create_vtable_ptr (t, virtuals_p);
4509 /* The vptr is always the first thing in the class. */
4512 TREE_CHAIN (vptr) = TYPE_FIELDS (t);
4513 TYPE_FIELDS (t) = vptr;
4514 next_field = &TREE_CHAIN (vptr);
4515 place_field (rli, vptr);
4518 next_field = &TYPE_FIELDS (t);
4520 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4521 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
4523 build_base_fields (rli, empty_base_offsets, next_field);
4525 /* Layout the non-static data members. */
4526 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4531 /* We still pass things that aren't non-static data members to
4532 the back-end, in case it wants to do something with them. */
4533 if (TREE_CODE (field) != FIELD_DECL)
4535 place_field (rli, field);
4536 /* If the static data member has incomplete type, keep track
4537 of it so that it can be completed later. (The handling
4538 of pending statics in finish_record_layout is
4539 insufficient; consider:
4542 struct S2 { static S1 s1; };
4544 At this point, finish_record_layout will be called, but
4545 S1 is still incomplete.) */
4546 if (TREE_CODE (field) == VAR_DECL)
4548 maybe_register_incomplete_var (field);
4549 /* The visibility of static data members is determined
4550 at their point of declaration, not their point of
4552 determine_visibility (field);
4557 type = TREE_TYPE (field);
4559 padding = NULL_TREE;
4561 /* If this field is a bit-field whose width is greater than its
4562 type, then there are some special rules for allocating
4564 if (DECL_C_BIT_FIELD (field)
4565 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4567 integer_type_kind itk;
4569 bool was_unnamed_p = false;
4570 /* We must allocate the bits as if suitably aligned for the
4571 longest integer type that fits in this many bits. type
4572 of the field. Then, we are supposed to use the left over
4573 bits as additional padding. */
4574 for (itk = itk_char; itk != itk_none; ++itk)
4575 if (INT_CST_LT (DECL_SIZE (field),
4576 TYPE_SIZE (integer_types[itk])))
4579 /* ITK now indicates a type that is too large for the
4580 field. We have to back up by one to find the largest
4582 integer_type = integer_types[itk - 1];
4584 /* Figure out how much additional padding is required. GCC
4585 3.2 always created a padding field, even if it had zero
4587 if (!abi_version_at_least (2)
4588 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
4590 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
4591 /* In a union, the padding field must have the full width
4592 of the bit-field; all fields start at offset zero. */
4593 padding = DECL_SIZE (field);
4596 if (warn_abi && TREE_CODE (t) == UNION_TYPE)
4597 warning (0, "size assigned to %qT may not be "
4598 "ABI-compliant and may change in a future "
4601 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4602 TYPE_SIZE (integer_type));
4605 #ifdef PCC_BITFIELD_TYPE_MATTERS
4606 /* An unnamed bitfield does not normally affect the
4607 alignment of the containing class on a target where
4608 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4609 make any exceptions for unnamed bitfields when the
4610 bitfields are longer than their types. Therefore, we
4611 temporarily give the field a name. */
4612 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
4614 was_unnamed_p = true;
4615 DECL_NAME (field) = make_anon_name ();
4618 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4619 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4620 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4621 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4622 empty_base_offsets);
4624 DECL_NAME (field) = NULL_TREE;
4625 /* Now that layout has been performed, set the size of the
4626 field to the size of its declared type; the rest of the
4627 field is effectively invisible. */
4628 DECL_SIZE (field) = TYPE_SIZE (type);
4629 /* We must also reset the DECL_MODE of the field. */
4630 if (abi_version_at_least (2))
4631 DECL_MODE (field) = TYPE_MODE (type);
4633 && DECL_MODE (field) != TYPE_MODE (type))
4634 /* Versions of G++ before G++ 3.4 did not reset the
4636 warning (0, "the offset of %qD may not be ABI-compliant and may "
4637 "change in a future version of GCC", field);
4640 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4641 empty_base_offsets);
4643 /* Remember the location of any empty classes in FIELD. */
4644 if (abi_version_at_least (2))
4645 record_subobject_offsets (TREE_TYPE (field),
4646 byte_position(field),
4650 /* If a bit-field does not immediately follow another bit-field,
4651 and yet it starts in the middle of a byte, we have failed to
4652 comply with the ABI. */
4654 && DECL_C_BIT_FIELD (field)
4655 /* The TREE_NO_WARNING flag gets set by Objective-C when
4656 laying out an Objective-C class. The ObjC ABI differs
4657 from the C++ ABI, and so we do not want a warning
4659 && !TREE_NO_WARNING (field)
4660 && !last_field_was_bitfield
4661 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
4662 DECL_FIELD_BIT_OFFSET (field),
4663 bitsize_unit_node)))
4664 warning (0, "offset of %q+D is not ABI-compliant and may "
4665 "change in a future version of GCC", field);
4667 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4668 offset of the field. */
4670 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
4671 byte_position (field))
4672 && contains_empty_class_p (TREE_TYPE (field)))
4673 warning (0, "%q+D contains empty classes which may cause base "
4674 "classes to be placed at different locations in a "
4675 "future version of GCC", field);
4677 /* If we needed additional padding after this field, add it
4683 padding_field = build_decl (FIELD_DECL,
4686 DECL_BIT_FIELD (padding_field) = 1;
4687 DECL_SIZE (padding_field) = padding;
4688 DECL_CONTEXT (padding_field) = t;
4689 DECL_ARTIFICIAL (padding_field) = 1;
4690 DECL_IGNORED_P (padding_field) = 1;
4691 layout_nonempty_base_or_field (rli, padding_field,
4693 empty_base_offsets);
4696 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
4699 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
4701 /* Make sure that we are on a byte boundary so that the size of
4702 the class without virtual bases will always be a round number
4704 rli->bitpos = round_up (rli->bitpos, BITS_PER_UNIT);
4705 normalize_rli (rli);
4708 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4710 if (!abi_version_at_least (2))
4711 include_empty_classes(rli);
4713 /* Delete all zero-width bit-fields from the list of fields. Now
4714 that the type is laid out they are no longer important. */
4715 remove_zero_width_bit_fields (t);
4717 /* Create the version of T used for virtual bases. We do not use
4718 make_aggr_type for this version; this is an artificial type. For
4719 a POD type, we just reuse T. */
4720 if (CLASSTYPE_NON_POD_P (t) || CLASSTYPE_EMPTY_P (t))
4722 base_t = make_node (TREE_CODE (t));
4724 /* Set the size and alignment for the new type. In G++ 3.2, all
4725 empty classes were considered to have size zero when used as
4727 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
4729 TYPE_SIZE (base_t) = bitsize_zero_node;
4730 TYPE_SIZE_UNIT (base_t) = size_zero_node;
4731 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
4732 warning (0, "layout of classes derived from empty class %qT "
4733 "may change in a future version of GCC",
4740 /* If the ABI version is not at least two, and the last
4741 field was a bit-field, RLI may not be on a byte
4742 boundary. In particular, rli_size_unit_so_far might
4743 indicate the last complete byte, while rli_size_so_far
4744 indicates the total number of bits used. Therefore,
4745 rli_size_so_far, rather than rli_size_unit_so_far, is
4746 used to compute TYPE_SIZE_UNIT. */
4747 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4748 TYPE_SIZE_UNIT (base_t)
4749 = size_binop (MAX_EXPR,
4751 size_binop (CEIL_DIV_EXPR,
4752 rli_size_so_far (rli),
4753 bitsize_int (BITS_PER_UNIT))),
4756 = size_binop (MAX_EXPR,
4757 rli_size_so_far (rli),
4758 size_binop (MULT_EXPR,
4759 convert (bitsizetype, eoc),
4760 bitsize_int (BITS_PER_UNIT)));
4762 TYPE_ALIGN (base_t) = rli->record_align;
4763 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
4765 /* Copy the fields from T. */
4766 next_field = &TYPE_FIELDS (base_t);
4767 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4768 if (TREE_CODE (field) == FIELD_DECL)
4770 *next_field = build_decl (FIELD_DECL,
4773 DECL_CONTEXT (*next_field) = base_t;
4774 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
4775 DECL_FIELD_BIT_OFFSET (*next_field)
4776 = DECL_FIELD_BIT_OFFSET (field);
4777 DECL_SIZE (*next_field) = DECL_SIZE (field);
4778 DECL_MODE (*next_field) = DECL_MODE (field);
4779 next_field = &TREE_CHAIN (*next_field);
4782 /* Record the base version of the type. */
4783 CLASSTYPE_AS_BASE (t) = base_t;
4784 TYPE_CONTEXT (base_t) = t;
4787 CLASSTYPE_AS_BASE (t) = t;
4789 /* Every empty class contains an empty class. */
4790 if (CLASSTYPE_EMPTY_P (t))
4791 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
4793 /* Set the TYPE_DECL for this type to contain the right
4794 value for DECL_OFFSET, so that we can use it as part
4795 of a COMPONENT_REF for multiple inheritance. */
4796 layout_decl (TYPE_MAIN_DECL (t), 0);
4798 /* Now fix up any virtual base class types that we left lying
4799 around. We must get these done before we try to lay out the
4800 virtual function table. As a side-effect, this will remove the
4801 base subobject fields. */
4802 layout_virtual_bases (rli, empty_base_offsets);
4804 /* Make sure that empty classes are reflected in RLI at this
4806 include_empty_classes(rli);
4808 /* Make sure not to create any structures with zero size. */
4809 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
4811 build_decl (FIELD_DECL, NULL_TREE, char_type_node));
4813 /* Let the back-end lay out the type. */
4814 finish_record_layout (rli, /*free_p=*/true);
4816 /* Warn about bases that can't be talked about due to ambiguity. */
4817 warn_about_ambiguous_bases (t);
4819 /* Now that we're done with layout, give the base fields the real types. */
4820 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4821 if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field)))
4822 TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field));
4825 splay_tree_delete (empty_base_offsets);
4828 /* Determine the "key method" for the class type indicated by TYPE,
4829 and set CLASSTYPE_KEY_METHOD accordingly. */
4832 determine_key_method (tree type)
4836 if (TYPE_FOR_JAVA (type)
4837 || processing_template_decl
4838 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
4839 || CLASSTYPE_INTERFACE_KNOWN (type))
4842 /* The key method is the first non-pure virtual function that is not
4843 inline at the point of class definition. On some targets the
4844 key function may not be inline; those targets should not call
4845 this function until the end of the translation unit. */
4846 for (method = TYPE_METHODS (type); method != NULL_TREE;
4847 method = TREE_CHAIN (method))
4848 if (DECL_VINDEX (method) != NULL_TREE
4849 && ! DECL_DECLARED_INLINE_P (method)
4850 && ! DECL_PURE_VIRTUAL_P (method))
4852 CLASSTYPE_KEY_METHOD (type) = method;
4859 /* Perform processing required when the definition of T (a class type)
4863 finish_struct_1 (tree t)
4866 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
4867 tree virtuals = NULL_TREE;
4870 if (COMPLETE_TYPE_P (t))
4872 gcc_assert (IS_AGGR_TYPE (t));
4873 error ("redefinition of %q#T", t);
4878 /* If this type was previously laid out as a forward reference,
4879 make sure we lay it out again. */
4880 TYPE_SIZE (t) = NULL_TREE;
4881 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
4883 fixup_inline_methods (t);
4885 /* Make assumptions about the class; we'll reset the flags if
4887 CLASSTYPE_EMPTY_P (t) = 1;
4888 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
4889 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
4891 /* Do end-of-class semantic processing: checking the validity of the
4892 bases and members and add implicitly generated methods. */
4893 check_bases_and_members (t);
4895 /* Find the key method. */
4896 if (TYPE_CONTAINS_VPTR_P (t))
4898 /* The Itanium C++ ABI permits the key method to be chosen when
4899 the class is defined -- even though the key method so
4900 selected may later turn out to be an inline function. On
4901 some systems (such as ARM Symbian OS) the key method cannot
4902 be determined until the end of the translation unit. On such
4903 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
4904 will cause the class to be added to KEYED_CLASSES. Then, in
4905 finish_file we will determine the key method. */
4906 if (targetm.cxx.key_method_may_be_inline ())
4907 determine_key_method (t);
4909 /* If a polymorphic class has no key method, we may emit the vtable
4910 in every translation unit where the class definition appears. */
4911 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
4912 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
4915 /* Layout the class itself. */
4916 layout_class_type (t, &virtuals);
4917 if (CLASSTYPE_AS_BASE (t) != t)
4918 /* We use the base type for trivial assignments, and hence it
4920 compute_record_mode (CLASSTYPE_AS_BASE (t));
4922 virtuals = modify_all_vtables (t, nreverse (virtuals));
4924 /* If necessary, create the primary vtable for this class. */
4925 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
4927 /* We must enter these virtuals into the table. */
4928 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4929 build_primary_vtable (NULL_TREE, t);
4930 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
4931 /* Here we know enough to change the type of our virtual
4932 function table, but we will wait until later this function. */
4933 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
4936 if (TYPE_CONTAINS_VPTR_P (t))
4941 if (BINFO_VTABLE (TYPE_BINFO (t)))
4942 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t))));
4943 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4944 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE);
4946 /* Add entries for virtual functions introduced by this class. */
4947 BINFO_VIRTUALS (TYPE_BINFO (t))
4948 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals);
4950 /* Set DECL_VINDEX for all functions declared in this class. */
4951 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
4953 fn = TREE_CHAIN (fn),
4954 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
4955 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
4957 tree fndecl = BV_FN (fn);
4959 if (DECL_THUNK_P (fndecl))
4960 /* A thunk. We should never be calling this entry directly
4961 from this vtable -- we'd use the entry for the non
4962 thunk base function. */
4963 DECL_VINDEX (fndecl) = NULL_TREE;
4964 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
4965 DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex);
4969 finish_struct_bits (t);
4971 /* Complete the rtl for any static member objects of the type we're
4973 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
4974 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
4975 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
4976 DECL_MODE (x) = TYPE_MODE (t);
4978 /* Done with FIELDS...now decide whether to sort these for
4979 faster lookups later.
4981 We use a small number because most searches fail (succeeding
4982 ultimately as the search bores through the inheritance
4983 hierarchy), and we want this failure to occur quickly. */
4985 n_fields = count_fields (TYPE_FIELDS (t));
4988 struct sorted_fields_type *field_vec = GGC_NEWVAR
4989 (struct sorted_fields_type,
4990 sizeof (struct sorted_fields_type) + n_fields * sizeof (tree));
4991 field_vec->len = n_fields;
4992 add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0);
4993 qsort (field_vec->elts, n_fields, sizeof (tree),
4995 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
4996 retrofit_lang_decl (TYPE_MAIN_DECL (t));
4997 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5000 /* Make the rtl for any new vtables we have created, and unmark
5001 the base types we marked. */
5004 /* Build the VTT for T. */
5007 /* This warning does not make sense for Java classes, since they
5008 cannot have destructors. */
5009 if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t))
5013 dtor = CLASSTYPE_DESTRUCTORS (t);
5014 /* Warn only if the dtor is non-private or the class has
5016 if (/* An implicitly declared destructor is always public. And,
5017 if it were virtual, we would have created it by now. */
5019 || (!DECL_VINDEX (dtor)
5020 && (!TREE_PRIVATE (dtor)
5021 || CLASSTYPE_FRIEND_CLASSES (t)
5022 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))))
5023 warning (0, "%q#T has virtual functions but non-virtual destructor",
5029 if (warn_overloaded_virtual)
5032 /* Class layout, assignment of virtual table slots, etc., is now
5033 complete. Give the back end a chance to tweak the visibility of
5034 the class or perform any other required target modifications. */
5035 targetm.cxx.adjust_class_at_definition (t);
5037 maybe_suppress_debug_info (t);
5039 dump_class_hierarchy (t);
5041 /* Finish debugging output for this type. */
5042 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5045 /* When T was built up, the member declarations were added in reverse
5046 order. Rearrange them to declaration order. */
5049 unreverse_member_declarations (tree t)
5055 /* The following lists are all in reverse order. Put them in
5056 declaration order now. */
5057 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5058 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
5060 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5061 reverse order, so we can't just use nreverse. */
5063 for (x = TYPE_FIELDS (t);
5064 x && TREE_CODE (x) != TYPE_DECL;
5067 next = TREE_CHAIN (x);
5068 TREE_CHAIN (x) = prev;
5073 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5075 TYPE_FIELDS (t) = prev;
5080 finish_struct (tree t, tree attributes)
5082 location_t saved_loc = input_location;
5084 /* Now that we've got all the field declarations, reverse everything
5086 unreverse_member_declarations (t);
5088 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
5090 /* Nadger the current location so that diagnostics point to the start of
5091 the struct, not the end. */
5092 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
5094 if (processing_template_decl)
5098 finish_struct_methods (t);
5099 TYPE_SIZE (t) = bitsize_zero_node;
5100 TYPE_SIZE_UNIT (t) = size_zero_node;
5102 /* We need to emit an error message if this type was used as a parameter
5103 and it is an abstract type, even if it is a template. We construct
5104 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5105 account and we call complete_vars with this type, which will check
5106 the PARM_DECLS. Note that while the type is being defined,
5107 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5108 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5109 CLASSTYPE_PURE_VIRTUALS (t) = NULL;
5110 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
5111 if (DECL_PURE_VIRTUAL_P (x))
5112 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
5116 finish_struct_1 (t);
5118 input_location = saved_loc;
5120 TYPE_BEING_DEFINED (t) = 0;
5122 if (current_class_type)
5125 error ("trying to finish struct, but kicked out due to previous parse errors");
5127 if (processing_template_decl && at_function_scope_p ())
5128 add_stmt (build_min (TAG_DEFN, t));
5133 /* Return the dynamic type of INSTANCE, if known.
5134 Used to determine whether the virtual function table is needed
5137 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5138 of our knowledge of its type. *NONNULL should be initialized
5139 before this function is called. */
5142 fixed_type_or_null (tree instance, int* nonnull, int* cdtorp)
5144 switch (TREE_CODE (instance))
5147 if (POINTER_TYPE_P (TREE_TYPE (instance)))
5150 return fixed_type_or_null (TREE_OPERAND (instance, 0),
5154 /* This is a call to a constructor, hence it's never zero. */
5155 if (TREE_HAS_CONSTRUCTOR (instance))
5159 return TREE_TYPE (instance);
5164 /* This is a call to a constructor, hence it's never zero. */
5165 if (TREE_HAS_CONSTRUCTOR (instance))
5169 return TREE_TYPE (instance);
5171 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5175 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5176 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5177 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5178 /* Propagate nonnull. */
5179 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5184 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5187 instance = TREE_OPERAND (instance, 0);
5190 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5191 with a real object -- given &p->f, p can still be null. */
5192 tree t = get_base_address (instance);
5193 /* ??? Probably should check DECL_WEAK here. */
5194 if (t && DECL_P (t))
5197 return fixed_type_or_null (instance, nonnull, cdtorp);
5200 /* If this component is really a base class reference, then the field
5201 itself isn't definitive. */
5202 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1)))
5203 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5204 return fixed_type_or_null (TREE_OPERAND (instance, 1), nonnull, cdtorp);
5208 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5209 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5213 return TREE_TYPE (TREE_TYPE (instance));
5215 /* fall through... */
5219 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5223 return TREE_TYPE (instance);
5225 else if (instance == current_class_ptr)
5230 /* if we're in a ctor or dtor, we know our type. */
5231 if (DECL_LANG_SPECIFIC (current_function_decl)
5232 && (DECL_CONSTRUCTOR_P (current_function_decl)
5233 || DECL_DESTRUCTOR_P (current_function_decl)))
5237 return TREE_TYPE (TREE_TYPE (instance));
5240 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5242 /* Reference variables should be references to objects. */
5246 /* DECL_VAR_MARKED_P is used to prevent recursion; a
5247 variable's initializer may refer to the variable
5249 if (TREE_CODE (instance) == VAR_DECL
5250 && DECL_INITIAL (instance)
5251 && !DECL_VAR_MARKED_P (instance))
5254 DECL_VAR_MARKED_P (instance) = 1;
5255 type = fixed_type_or_null (DECL_INITIAL (instance),
5257 DECL_VAR_MARKED_P (instance) = 0;
5268 /* Return nonzero if the dynamic type of INSTANCE is known, and
5269 equivalent to the static type. We also handle the case where
5270 INSTANCE is really a pointer. Return negative if this is a
5271 ctor/dtor. There the dynamic type is known, but this might not be
5272 the most derived base of the original object, and hence virtual
5273 bases may not be layed out according to this type.
5275 Used to determine whether the virtual function table is needed
5278 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5279 of our knowledge of its type. *NONNULL should be initialized
5280 before this function is called. */
5283 resolves_to_fixed_type_p (tree instance, int* nonnull)
5285 tree t = TREE_TYPE (instance);
5288 tree fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
5289 if (fixed == NULL_TREE)
5291 if (POINTER_TYPE_P (t))
5293 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
5295 return cdtorp ? -1 : 1;
5300 init_class_processing (void)
5302 current_class_depth = 0;
5303 current_class_stack_size = 10;
5305 = xmalloc (current_class_stack_size * sizeof (struct class_stack_node));
5306 local_classes = VEC_alloc (tree, gc, 8);
5308 ridpointers[(int) RID_PUBLIC] = access_public_node;
5309 ridpointers[(int) RID_PRIVATE] = access_private_node;
5310 ridpointers[(int) RID_PROTECTED] = access_protected_node;
5313 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5316 restore_class_cache (void)
5320 /* We are re-entering the same class we just left, so we don't
5321 have to search the whole inheritance matrix to find all the
5322 decls to bind again. Instead, we install the cached
5323 class_shadowed list and walk through it binding names. */
5324 push_binding_level (previous_class_level);
5325 class_binding_level = previous_class_level;
5326 /* Restore IDENTIFIER_TYPE_VALUE. */
5327 for (type = class_binding_level->type_shadowed;
5329 type = TREE_CHAIN (type))
5330 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type));
5333 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5334 appropriate for TYPE.
5336 So that we may avoid calls to lookup_name, we cache the _TYPE
5337 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5339 For multiple inheritance, we perform a two-pass depth-first search
5340 of the type lattice. */
5343 pushclass (tree type)
5345 type = TYPE_MAIN_VARIANT (type);
5347 /* Make sure there is enough room for the new entry on the stack. */
5348 if (current_class_depth + 1 >= current_class_stack_size)
5350 current_class_stack_size *= 2;
5352 = xrealloc (current_class_stack,
5353 current_class_stack_size
5354 * sizeof (struct class_stack_node));
5357 /* Insert a new entry on the class stack. */
5358 current_class_stack[current_class_depth].name = current_class_name;
5359 current_class_stack[current_class_depth].type = current_class_type;
5360 current_class_stack[current_class_depth].access = current_access_specifier;
5361 current_class_stack[current_class_depth].names_used = 0;
5362 current_class_depth++;
5364 /* Now set up the new type. */
5365 current_class_name = TYPE_NAME (type);
5366 if (TREE_CODE (current_class_name) == TYPE_DECL)
5367 current_class_name = DECL_NAME (current_class_name);
5368 current_class_type = type;
5370 /* By default, things in classes are private, while things in
5371 structures or unions are public. */
5372 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5373 ? access_private_node
5374 : access_public_node);
5376 if (previous_class_level
5377 && type != previous_class_level->this_entity
5378 && current_class_depth == 1)
5380 /* Forcibly remove any old class remnants. */
5381 invalidate_class_lookup_cache ();
5384 if (!previous_class_level
5385 || type != previous_class_level->this_entity
5386 || current_class_depth > 1)
5389 restore_class_cache ();
5392 /* When we exit a toplevel class scope, we save its binding level so
5393 that we can restore it quickly. Here, we've entered some other
5394 class, so we must invalidate our cache. */
5397 invalidate_class_lookup_cache (void)
5399 previous_class_level = NULL;
5402 /* Get out of the current class scope. If we were in a class scope
5403 previously, that is the one popped to. */
5410 current_class_depth--;
5411 current_class_name = current_class_stack[current_class_depth].name;
5412 current_class_type = current_class_stack[current_class_depth].type;
5413 current_access_specifier = current_class_stack[current_class_depth].access;
5414 if (current_class_stack[current_class_depth].names_used)
5415 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5418 /* Returns 1 if current_class_type is either T or a nested type of T.
5419 We start looking from 1 because entry 0 is from global scope, and has
5423 currently_open_class (tree t)
5426 if (current_class_type && same_type_p (t, current_class_type))
5428 for (i = 1; i < current_class_depth; ++i)
5429 if (current_class_stack[i].type
5430 && same_type_p (current_class_stack [i].type, t))
5435 /* If either current_class_type or one of its enclosing classes are derived
5436 from T, return the appropriate type. Used to determine how we found
5437 something via unqualified lookup. */
5440 currently_open_derived_class (tree t)
5444 /* The bases of a dependent type are unknown. */
5445 if (dependent_type_p (t))
5448 if (!current_class_type)
5451 if (DERIVED_FROM_P (t, current_class_type))
5452 return current_class_type;
5454 for (i = current_class_depth - 1; i > 0; --i)
5455 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5456 return current_class_stack[i].type;
5461 /* When entering a class scope, all enclosing class scopes' names with
5462 static meaning (static variables, static functions, types and
5463 enumerators) have to be visible. This recursive function calls
5464 pushclass for all enclosing class contexts until global or a local
5465 scope is reached. TYPE is the enclosed class. */
5468 push_nested_class (tree type)
5472 /* A namespace might be passed in error cases, like A::B:C. */
5473 if (type == NULL_TREE
5474 || type == error_mark_node
5475 || TREE_CODE (type) == NAMESPACE_DECL
5476 || ! IS_AGGR_TYPE (type)
5477 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5478 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
5481 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
5483 if (context && CLASS_TYPE_P (context))
5484 push_nested_class (context);
5488 /* Undoes a push_nested_class call. */
5491 pop_nested_class (void)
5493 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5496 if (context && CLASS_TYPE_P (context))
5497 pop_nested_class ();
5500 /* Returns the number of extern "LANG" blocks we are nested within. */
5503 current_lang_depth (void)
5505 return VEC_length (tree, current_lang_base);
5508 /* Set global variables CURRENT_LANG_NAME to appropriate value
5509 so that behavior of name-mangling machinery is correct. */
5512 push_lang_context (tree name)
5514 VEC_safe_push (tree, gc, current_lang_base, current_lang_name);
5516 if (name == lang_name_cplusplus)
5518 current_lang_name = name;
5520 else if (name == lang_name_java)
5522 current_lang_name = name;
5523 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5524 (See record_builtin_java_type in decl.c.) However, that causes
5525 incorrect debug entries if these types are actually used.
5526 So we re-enable debug output after extern "Java". */
5527 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5528 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5529 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5530 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5531 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5532 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5533 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5534 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5536 else if (name == lang_name_c)
5538 current_lang_name = name;
5541 error ("language string %<\"%E\"%> not recognized", name);
5544 /* Get out of the current language scope. */
5547 pop_lang_context (void)
5549 current_lang_name = VEC_pop (tree, current_lang_base);
5552 /* Type instantiation routines. */
5554 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5555 matches the TARGET_TYPE. If there is no satisfactory match, return
5556 error_mark_node, and issue an error & warning messages under control
5557 of FLAGS. Permit pointers to member function if FLAGS permits. If
5558 TEMPLATE_ONLY, the name of the overloaded function was a
5559 template-id, and EXPLICIT_TARGS are the explicitly provided
5560 template arguments. */
5563 resolve_address_of_overloaded_function (tree target_type,
5565 tsubst_flags_t flags,
5567 tree explicit_targs)
5569 /* Here's what the standard says:
5573 If the name is a function template, template argument deduction
5574 is done, and if the argument deduction succeeds, the deduced
5575 arguments are used to generate a single template function, which
5576 is added to the set of overloaded functions considered.
5578 Non-member functions and static member functions match targets of
5579 type "pointer-to-function" or "reference-to-function." Nonstatic
5580 member functions match targets of type "pointer-to-member
5581 function;" the function type of the pointer to member is used to
5582 select the member function from the set of overloaded member
5583 functions. If a nonstatic member function is selected, the
5584 reference to the overloaded function name is required to have the
5585 form of a pointer to member as described in 5.3.1.
5587 If more than one function is selected, any template functions in
5588 the set are eliminated if the set also contains a non-template
5589 function, and any given template function is eliminated if the
5590 set contains a second template function that is more specialized
5591 than the first according to the partial ordering rules 14.5.5.2.
5592 After such eliminations, if any, there shall remain exactly one
5593 selected function. */
5596 int is_reference = 0;
5597 /* We store the matches in a TREE_LIST rooted here. The functions
5598 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5599 interoperability with most_specialized_instantiation. */
5600 tree matches = NULL_TREE;
5603 /* By the time we get here, we should be seeing only real
5604 pointer-to-member types, not the internal POINTER_TYPE to
5605 METHOD_TYPE representation. */
5606 gcc_assert (TREE_CODE (target_type) != POINTER_TYPE
5607 || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE);
5609 gcc_assert (is_overloaded_fn (overload));
5611 /* Check that the TARGET_TYPE is reasonable. */
5612 if (TYPE_PTRFN_P (target_type))
5614 else if (TYPE_PTRMEMFUNC_P (target_type))
5615 /* This is OK, too. */
5617 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5619 /* This is OK, too. This comes from a conversion to reference
5621 target_type = build_reference_type (target_type);
5626 if (flags & tf_error)
5627 error ("cannot resolve overloaded function %qD based on"
5628 " conversion to type %qT",
5629 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5630 return error_mark_node;
5633 /* If we can find a non-template function that matches, we can just
5634 use it. There's no point in generating template instantiations
5635 if we're just going to throw them out anyhow. But, of course, we
5636 can only do this when we don't *need* a template function. */
5641 for (fns = overload; fns; fns = OVL_NEXT (fns))
5643 tree fn = OVL_CURRENT (fns);
5646 if (TREE_CODE (fn) == TEMPLATE_DECL)
5647 /* We're not looking for templates just yet. */
5650 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5652 /* We're looking for a non-static member, and this isn't
5653 one, or vice versa. */
5656 /* Ignore functions which haven't been explicitly
5658 if (DECL_ANTICIPATED (fn))
5661 /* See if there's a match. */
5662 fntype = TREE_TYPE (fn);
5664 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5665 else if (!is_reference)
5666 fntype = build_pointer_type (fntype);
5668 if (can_convert_arg (target_type, fntype, fn, LOOKUP_NORMAL))
5669 matches = tree_cons (fn, NULL_TREE, matches);
5673 /* Now, if we've already got a match (or matches), there's no need
5674 to proceed to the template functions. But, if we don't have a
5675 match we need to look at them, too. */
5678 tree target_fn_type;
5679 tree target_arg_types;
5680 tree target_ret_type;
5685 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5687 target_fn_type = TREE_TYPE (target_type);
5688 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5689 target_ret_type = TREE_TYPE (target_fn_type);
5691 /* Never do unification on the 'this' parameter. */
5692 if (TREE_CODE (target_fn_type) == METHOD_TYPE)
5693 target_arg_types = TREE_CHAIN (target_arg_types);
5695 for (fns = overload; fns; fns = OVL_NEXT (fns))
5697 tree fn = OVL_CURRENT (fns);
5699 tree instantiation_type;
5702 if (TREE_CODE (fn) != TEMPLATE_DECL)
5703 /* We're only looking for templates. */
5706 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5708 /* We're not looking for a non-static member, and this is
5709 one, or vice versa. */
5712 /* Try to do argument deduction. */
5713 targs = make_tree_vec (DECL_NTPARMS (fn));
5714 if (fn_type_unification (fn, explicit_targs, targs,
5715 target_arg_types, target_ret_type,
5716 DEDUCE_EXACT, LOOKUP_NORMAL))
5717 /* Argument deduction failed. */
5720 /* Instantiate the template. */
5721 instantiation = instantiate_template (fn, targs, flags);
5722 if (instantiation == error_mark_node)
5723 /* Instantiation failed. */
5726 /* See if there's a match. */
5727 instantiation_type = TREE_TYPE (instantiation);
5729 instantiation_type =
5730 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5731 else if (!is_reference)
5732 instantiation_type = build_pointer_type (instantiation_type);
5733 if (can_convert_arg (target_type, instantiation_type, instantiation,
5735 matches = tree_cons (instantiation, fn, matches);
5738 /* Now, remove all but the most specialized of the matches. */
5741 tree match = most_specialized_instantiation (matches);
5743 if (match != error_mark_node)
5744 matches = tree_cons (match, NULL_TREE, NULL_TREE);
5748 /* Now we should have exactly one function in MATCHES. */
5749 if (matches == NULL_TREE)
5751 /* There were *no* matches. */
5752 if (flags & tf_error)
5754 error ("no matches converting function %qD to type %q#T",
5755 DECL_NAME (OVL_FUNCTION (overload)),
5758 /* print_candidates expects a chain with the functions in
5759 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5760 so why be clever?). */
5761 for (; overload; overload = OVL_NEXT (overload))
5762 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5765 print_candidates (matches);
5767 return error_mark_node;
5769 else if (TREE_CHAIN (matches))
5771 /* There were too many matches. */
5773 if (flags & tf_error)
5777 error ("converting overloaded function %qD to type %q#T is ambiguous",
5778 DECL_NAME (OVL_FUNCTION (overload)),
5781 /* Since print_candidates expects the functions in the
5782 TREE_VALUE slot, we flip them here. */
5783 for (match = matches; match; match = TREE_CHAIN (match))
5784 TREE_VALUE (match) = TREE_PURPOSE (match);
5786 print_candidates (matches);
5789 return error_mark_node;
5792 /* Good, exactly one match. Now, convert it to the correct type. */
5793 fn = TREE_PURPOSE (matches);
5795 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5796 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
5798 static int explained;
5800 if (!(flags & tf_error))
5801 return error_mark_node;
5803 pedwarn ("assuming pointer to member %qD", fn);
5806 pedwarn ("(a pointer to member can only be formed with %<&%E%>)", fn);
5811 /* If we're doing overload resolution purely for the purpose of
5812 determining conversion sequences, we should not consider the
5813 function used. If this conversion sequence is selected, the
5814 function will be marked as used at this point. */
5815 if (!(flags & tf_conv))
5818 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5819 return build_unary_op (ADDR_EXPR, fn, 0);
5822 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5823 will mark the function as addressed, but here we must do it
5825 cxx_mark_addressable (fn);
5831 /* This function will instantiate the type of the expression given in
5832 RHS to match the type of LHSTYPE. If errors exist, then return
5833 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
5834 we complain on errors. If we are not complaining, never modify rhs,
5835 as overload resolution wants to try many possible instantiations, in
5836 the hope that at least one will work.
5838 For non-recursive calls, LHSTYPE should be a function, pointer to
5839 function, or a pointer to member function. */
5842 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
5844 tsubst_flags_t flags_in = flags;
5846 flags &= ~tf_ptrmem_ok;
5848 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
5850 if (flags & tf_error)
5851 error ("not enough type information");
5852 return error_mark_node;
5855 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
5857 if (same_type_p (lhstype, TREE_TYPE (rhs)))
5859 if (flag_ms_extensions
5860 && TYPE_PTRMEMFUNC_P (lhstype)
5861 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
5862 /* Microsoft allows `A::f' to be resolved to a
5863 pointer-to-member. */
5867 if (flags & tf_error)
5868 error ("argument of type %qT does not match %qT",
5869 TREE_TYPE (rhs), lhstype);
5870 return error_mark_node;
5874 if (TREE_CODE (rhs) == BASELINK)
5875 rhs = BASELINK_FUNCTIONS (rhs);
5877 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
5878 deduce any type information. */
5879 if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR)
5881 if (flags & tf_error)
5882 error ("not enough type information");
5883 return error_mark_node;
5886 /* We don't overwrite rhs if it is an overloaded function.
5887 Copying it would destroy the tree link. */
5888 if (TREE_CODE (rhs) != OVERLOAD)
5889 rhs = copy_node (rhs);
5891 /* This should really only be used when attempting to distinguish
5892 what sort of a pointer to function we have. For now, any
5893 arithmetic operation which is not supported on pointers
5894 is rejected as an error. */
5896 switch (TREE_CODE (rhs))
5909 new_rhs = instantiate_type (build_pointer_type (lhstype),
5910 TREE_OPERAND (rhs, 0), flags);
5911 if (new_rhs == error_mark_node)
5912 return error_mark_node;
5914 TREE_TYPE (rhs) = lhstype;
5915 TREE_OPERAND (rhs, 0) = new_rhs;
5920 rhs = copy_node (TREE_OPERAND (rhs, 0));
5921 TREE_TYPE (rhs) = unknown_type_node;
5922 return instantiate_type (lhstype, rhs, flags);
5926 tree member = TREE_OPERAND (rhs, 1);
5928 member = instantiate_type (lhstype, member, flags);
5929 if (member != error_mark_node
5930 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
5931 /* Do not lose object's side effects. */
5932 return build2 (COMPOUND_EXPR, TREE_TYPE (member),
5933 TREE_OPERAND (rhs, 0), member);
5938 rhs = TREE_OPERAND (rhs, 1);
5939 if (BASELINK_P (rhs))
5940 return instantiate_type (lhstype, BASELINK_FUNCTIONS (rhs), flags_in);
5942 /* This can happen if we are forming a pointer-to-member for a
5944 gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR);
5948 case TEMPLATE_ID_EXPR:
5950 tree fns = TREE_OPERAND (rhs, 0);
5951 tree args = TREE_OPERAND (rhs, 1);
5954 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
5955 /*template_only=*/true,
5962 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
5963 /*template_only=*/false,
5964 /*explicit_targs=*/NULL_TREE);
5967 /* This is too hard for now. */
5973 TREE_OPERAND (rhs, 0)
5974 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
5975 if (TREE_OPERAND (rhs, 0) == error_mark_node)
5976 return error_mark_node;
5977 TREE_OPERAND (rhs, 1)
5978 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5979 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5980 return error_mark_node;
5982 TREE_TYPE (rhs) = lhstype;
5986 case TRUNC_DIV_EXPR:
5987 case FLOOR_DIV_EXPR:
5989 case ROUND_DIV_EXPR:
5991 case TRUNC_MOD_EXPR:
5992 case FLOOR_MOD_EXPR:
5994 case ROUND_MOD_EXPR:
5995 case FIX_ROUND_EXPR:
5996 case FIX_FLOOR_EXPR:
5998 case FIX_TRUNC_EXPR:
6013 case PREINCREMENT_EXPR:
6014 case PREDECREMENT_EXPR:
6015 case POSTINCREMENT_EXPR:
6016 case POSTDECREMENT_EXPR:
6017 if (flags & tf_error)
6018 error ("invalid operation on uninstantiated type");
6019 return error_mark_node;
6021 case TRUTH_AND_EXPR:
6023 case TRUTH_XOR_EXPR:
6030 case TRUTH_ANDIF_EXPR:
6031 case TRUTH_ORIF_EXPR:
6032 case TRUTH_NOT_EXPR:
6033 if (flags & tf_error)
6034 error ("not enough type information");
6035 return error_mark_node;
6038 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
6040 if (flags & tf_error)
6041 error ("not enough type information");
6042 return error_mark_node;
6044 TREE_OPERAND (rhs, 1)
6045 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6046 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6047 return error_mark_node;
6048 TREE_OPERAND (rhs, 2)
6049 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), flags);
6050 if (TREE_OPERAND (rhs, 2) == error_mark_node)
6051 return error_mark_node;
6053 TREE_TYPE (rhs) = lhstype;
6057 TREE_OPERAND (rhs, 1)
6058 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6059 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6060 return error_mark_node;
6062 TREE_TYPE (rhs) = lhstype;
6067 if (PTRMEM_OK_P (rhs))
6068 flags |= tf_ptrmem_ok;
6070 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6074 return error_mark_node;
6079 return error_mark_node;
6082 /* Return the name of the virtual function pointer field
6083 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6084 this may have to look back through base types to find the
6085 ultimate field name. (For single inheritance, these could
6086 all be the same name. Who knows for multiple inheritance). */
6089 get_vfield_name (tree type)
6091 tree binfo, base_binfo;
6094 for (binfo = TYPE_BINFO (type);
6095 BINFO_N_BASE_BINFOS (binfo);
6098 base_binfo = BINFO_BASE_BINFO (binfo, 0);
6100 if (BINFO_VIRTUAL_P (base_binfo)
6101 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo)))
6105 type = BINFO_TYPE (binfo);
6106 buf = alloca (sizeof (VFIELD_NAME_FORMAT) + TYPE_NAME_LENGTH (type) + 2);
6107 sprintf (buf, VFIELD_NAME_FORMAT,
6108 IDENTIFIER_POINTER (constructor_name (type)));
6109 return get_identifier (buf);
6113 print_class_statistics (void)
6115 #ifdef GATHER_STATISTICS
6116 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6117 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6120 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6121 n_vtables, n_vtable_searches);
6122 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6123 n_vtable_entries, n_vtable_elems);
6128 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6129 according to [class]:
6130 The class-name is also inserted
6131 into the scope of the class itself. For purposes of access checking,
6132 the inserted class name is treated as if it were a public member name. */
6135 build_self_reference (void)
6137 tree name = constructor_name (current_class_type);
6138 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6141 DECL_NONLOCAL (value) = 1;
6142 DECL_CONTEXT (value) = current_class_type;
6143 DECL_ARTIFICIAL (value) = 1;
6144 SET_DECL_SELF_REFERENCE_P (value);
6146 if (processing_template_decl)
6147 value = push_template_decl (value);
6149 saved_cas = current_access_specifier;
6150 current_access_specifier = access_public_node;
6151 finish_member_declaration (value);
6152 current_access_specifier = saved_cas;
6155 /* Returns 1 if TYPE contains only padding bytes. */
6158 is_empty_class (tree type)
6160 if (type == error_mark_node)
6163 if (! IS_AGGR_TYPE (type))
6166 /* In G++ 3.2, whether or not a class was empty was determined by
6167 looking at its size. */
6168 if (abi_version_at_least (2))
6169 return CLASSTYPE_EMPTY_P (type);
6171 return integer_zerop (CLASSTYPE_SIZE (type));
6174 /* Returns true if TYPE contains an empty class. */
6177 contains_empty_class_p (tree type)
6179 if (is_empty_class (type))
6181 if (CLASS_TYPE_P (type))
6188 for (binfo = TYPE_BINFO (type), i = 0;
6189 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6190 if (contains_empty_class_p (BINFO_TYPE (base_binfo)))
6192 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6193 if (TREE_CODE (field) == FIELD_DECL
6194 && !DECL_ARTIFICIAL (field)
6195 && is_empty_class (TREE_TYPE (field)))
6198 else if (TREE_CODE (type) == ARRAY_TYPE)
6199 return contains_empty_class_p (TREE_TYPE (type));
6203 /* Note that NAME was looked up while the current class was being
6204 defined and that the result of that lookup was DECL. */
6207 maybe_note_name_used_in_class (tree name, tree decl)
6209 splay_tree names_used;
6211 /* If we're not defining a class, there's nothing to do. */
6212 if (!(innermost_scope_kind() == sk_class
6213 && TYPE_BEING_DEFINED (current_class_type)))
6216 /* If there's already a binding for this NAME, then we don't have
6217 anything to worry about. */
6218 if (lookup_member (current_class_type, name,
6219 /*protect=*/0, /*want_type=*/false))
6222 if (!current_class_stack[current_class_depth - 1].names_used)
6223 current_class_stack[current_class_depth - 1].names_used
6224 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6225 names_used = current_class_stack[current_class_depth - 1].names_used;
6227 splay_tree_insert (names_used,
6228 (splay_tree_key) name,
6229 (splay_tree_value) decl);
6232 /* Note that NAME was declared (as DECL) in the current class. Check
6233 to see that the declaration is valid. */
6236 note_name_declared_in_class (tree name, tree decl)
6238 splay_tree names_used;
6241 /* Look to see if we ever used this name. */
6243 = current_class_stack[current_class_depth - 1].names_used;
6247 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6250 /* [basic.scope.class]
6252 A name N used in a class S shall refer to the same declaration
6253 in its context and when re-evaluated in the completed scope of
6255 error ("declaration of %q#D", decl);
6256 error ("changes meaning of %qD from %q+#D",
6257 DECL_NAME (OVL_CURRENT (decl)), (tree) n->value);
6261 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6262 Secondary vtables are merged with primary vtables; this function
6263 will return the VAR_DECL for the primary vtable. */
6266 get_vtbl_decl_for_binfo (tree binfo)
6270 decl = BINFO_VTABLE (binfo);
6271 if (decl && TREE_CODE (decl) == PLUS_EXPR)
6273 gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR);
6274 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6277 gcc_assert (TREE_CODE (decl) == VAR_DECL);
6282 /* Returns the binfo for the primary base of BINFO. If the resulting
6283 BINFO is a virtual base, and it is inherited elsewhere in the
6284 hierarchy, then the returned binfo might not be the primary base of
6285 BINFO in the complete object. Check BINFO_PRIMARY_P or
6286 BINFO_LOST_PRIMARY_P to be sure. */
6289 get_primary_binfo (tree binfo)
6294 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6298 result = copied_binfo (primary_base, binfo);
6302 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6305 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
6308 fprintf (stream, "%*s", indent, "");
6312 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6313 INDENT should be zero when called from the top level; it is
6314 incremented recursively. IGO indicates the next expected BINFO in
6315 inheritance graph ordering. */
6318 dump_class_hierarchy_r (FILE *stream,
6328 indented = maybe_indent_hierarchy (stream, indent, 0);
6329 fprintf (stream, "%s (0x%lx) ",
6330 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER),
6331 (unsigned long) binfo);
6334 fprintf (stream, "alternative-path\n");
6337 igo = TREE_CHAIN (binfo);
6339 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
6340 tree_low_cst (BINFO_OFFSET (binfo), 0));
6341 if (is_empty_class (BINFO_TYPE (binfo)))
6342 fprintf (stream, " empty");
6343 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
6344 fprintf (stream, " nearly-empty");
6345 if (BINFO_VIRTUAL_P (binfo))
6346 fprintf (stream, " virtual");
6347 fprintf (stream, "\n");
6350 if (BINFO_PRIMARY_P (binfo))
6352 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6353 fprintf (stream, " primary-for %s (0x%lx)",
6354 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
6355 TFF_PLAIN_IDENTIFIER),
6356 (unsigned long)BINFO_INHERITANCE_CHAIN (binfo));
6358 if (BINFO_LOST_PRIMARY_P (binfo))
6360 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6361 fprintf (stream, " lost-primary");
6364 fprintf (stream, "\n");
6366 if (!(flags & TDF_SLIM))
6370 if (BINFO_SUBVTT_INDEX (binfo))
6372 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6373 fprintf (stream, " subvttidx=%s",
6374 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
6375 TFF_PLAIN_IDENTIFIER));
6377 if (BINFO_VPTR_INDEX (binfo))
6379 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6380 fprintf (stream, " vptridx=%s",
6381 expr_as_string (BINFO_VPTR_INDEX (binfo),
6382 TFF_PLAIN_IDENTIFIER));
6384 if (BINFO_VPTR_FIELD (binfo))
6386 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6387 fprintf (stream, " vbaseoffset=%s",
6388 expr_as_string (BINFO_VPTR_FIELD (binfo),
6389 TFF_PLAIN_IDENTIFIER));
6391 if (BINFO_VTABLE (binfo))
6393 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6394 fprintf (stream, " vptr=%s",
6395 expr_as_string (BINFO_VTABLE (binfo),
6396 TFF_PLAIN_IDENTIFIER));
6400 fprintf (stream, "\n");
6403 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
6404 igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2);
6409 /* Dump the BINFO hierarchy for T. */
6412 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
6414 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6415 fprintf (stream, " size=%lu align=%lu\n",
6416 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
6417 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
6418 fprintf (stream, " base size=%lu base align=%lu\n",
6419 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
6421 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
6423 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
6424 fprintf (stream, "\n");
6427 /* Debug interface to hierarchy dumping. */
6430 debug_class (tree t)
6432 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
6436 dump_class_hierarchy (tree t)
6439 FILE *stream = dump_begin (TDI_class, &flags);
6443 dump_class_hierarchy_1 (stream, flags, t);
6444 dump_end (TDI_class, stream);
6449 dump_array (FILE * stream, tree decl)
6452 unsigned HOST_WIDE_INT ix;
6454 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
6456 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
6458 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
6459 fprintf (stream, " %s entries",
6460 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
6461 TFF_PLAIN_IDENTIFIER));
6462 fprintf (stream, "\n");
6464 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
6466 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
6467 expr_as_string (value, TFF_PLAIN_IDENTIFIER));
6471 dump_vtable (tree t, tree binfo, tree vtable)
6474 FILE *stream = dump_begin (TDI_class, &flags);
6479 if (!(flags & TDF_SLIM))
6481 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
6483 fprintf (stream, "%s for %s",
6484 ctor_vtbl_p ? "Construction vtable" : "Vtable",
6485 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER));
6488 if (!BINFO_VIRTUAL_P (binfo))
6489 fprintf (stream, " (0x%lx instance)", (unsigned long)binfo);
6490 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6492 fprintf (stream, "\n");
6493 dump_array (stream, vtable);
6494 fprintf (stream, "\n");
6497 dump_end (TDI_class, stream);
6501 dump_vtt (tree t, tree vtt)
6504 FILE *stream = dump_begin (TDI_class, &flags);
6509 if (!(flags & TDF_SLIM))
6511 fprintf (stream, "VTT for %s\n",
6512 type_as_string (t, TFF_PLAIN_IDENTIFIER));
6513 dump_array (stream, vtt);
6514 fprintf (stream, "\n");
6517 dump_end (TDI_class, stream);
6520 /* Dump a function or thunk and its thunkees. */
6523 dump_thunk (FILE *stream, int indent, tree thunk)
6525 static const char spaces[] = " ";
6526 tree name = DECL_NAME (thunk);
6529 fprintf (stream, "%.*s%p %s %s", indent, spaces,
6531 !DECL_THUNK_P (thunk) ? "function"
6532 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
6533 name ? IDENTIFIER_POINTER (name) : "<unset>");
6534 if (DECL_THUNK_P (thunk))
6536 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
6537 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
6539 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
6540 if (!virtual_adjust)
6542 else if (DECL_THIS_THUNK_P (thunk))
6543 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
6544 tree_low_cst (virtual_adjust, 0));
6546 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
6547 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
6548 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
6549 if (THUNK_ALIAS (thunk))
6550 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
6552 fprintf (stream, "\n");
6553 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
6554 dump_thunk (stream, indent + 2, thunks);
6557 /* Dump the thunks for FN. */
6560 debug_thunks (tree fn)
6562 dump_thunk (stderr, 0, fn);
6565 /* Virtual function table initialization. */
6567 /* Create all the necessary vtables for T and its base classes. */
6570 finish_vtbls (tree t)
6575 /* We lay out the primary and secondary vtables in one contiguous
6576 vtable. The primary vtable is first, followed by the non-virtual
6577 secondary vtables in inheritance graph order. */
6578 list = build_tree_list (BINFO_VTABLE (TYPE_BINFO (t)), NULL_TREE);
6579 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6580 TYPE_BINFO (t), t, list);
6582 /* Then come the virtual bases, also in inheritance graph order. */
6583 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6585 if (!BINFO_VIRTUAL_P (vbase))
6587 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6590 if (BINFO_VTABLE (TYPE_BINFO (t)))
6591 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6594 /* Initialize the vtable for BINFO with the INITS. */
6597 initialize_vtable (tree binfo, tree inits)
6601 layout_vtable_decl (binfo, list_length (inits));
6602 decl = get_vtbl_decl_for_binfo (binfo);
6603 initialize_artificial_var (decl, inits);
6604 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
6607 /* Build the VTT (virtual table table) for T.
6608 A class requires a VTT if it has virtual bases.
6611 1 - primary virtual pointer for complete object T
6612 2 - secondary VTTs for each direct non-virtual base of T which requires a
6614 3 - secondary virtual pointers for each direct or indirect base of T which
6615 has virtual bases or is reachable via a virtual path from T.
6616 4 - secondary VTTs for each direct or indirect virtual base of T.
6618 Secondary VTTs look like complete object VTTs without part 4. */
6628 /* Build up the initializers for the VTT. */
6630 index = size_zero_node;
6631 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
6633 /* If we didn't need a VTT, we're done. */
6637 /* Figure out the type of the VTT. */
6638 type = build_index_type (size_int (list_length (inits) - 1));
6639 type = build_cplus_array_type (const_ptr_type_node, type);
6641 /* Now, build the VTT object itself. */
6642 vtt = build_vtable (t, get_vtt_name (t), type);
6643 initialize_artificial_var (vtt, inits);
6644 /* Add the VTT to the vtables list. */
6645 TREE_CHAIN (vtt) = TREE_CHAIN (CLASSTYPE_VTABLES (t));
6646 TREE_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
6651 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6652 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6653 and CHAIN the vtable pointer for this binfo after construction is
6654 complete. VALUE can also be another BINFO, in which case we recurse. */
6657 binfo_ctor_vtable (tree binfo)
6663 vt = BINFO_VTABLE (binfo);
6664 if (TREE_CODE (vt) == TREE_LIST)
6665 vt = TREE_VALUE (vt);
6666 if (TREE_CODE (vt) == TREE_BINFO)
6675 /* Data for secondary VTT initialization. */
6676 typedef struct secondary_vptr_vtt_init_data_s
6678 /* Is this the primary VTT? */
6681 /* Current index into the VTT. */
6684 /* TREE_LIST of initializers built up. */
6687 /* The type being constructed by this secondary VTT. */
6688 tree type_being_constructed;
6689 } secondary_vptr_vtt_init_data;
6691 /* Recursively build the VTT-initializer for BINFO (which is in the
6692 hierarchy dominated by T). INITS points to the end of the initializer
6693 list to date. INDEX is the VTT index where the next element will be
6694 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6695 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6696 for virtual bases of T. When it is not so, we build the constructor
6697 vtables for the BINFO-in-T variant. */
6700 build_vtt_inits (tree binfo, tree t, tree *inits, tree *index)
6705 tree secondary_vptrs;
6706 secondary_vptr_vtt_init_data data;
6707 int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
6709 /* We only need VTTs for subobjects with virtual bases. */
6710 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
6713 /* We need to use a construction vtable if this is not the primary
6717 build_ctor_vtbl_group (binfo, t);
6719 /* Record the offset in the VTT where this sub-VTT can be found. */
6720 BINFO_SUBVTT_INDEX (binfo) = *index;
6723 /* Add the address of the primary vtable for the complete object. */
6724 init = binfo_ctor_vtable (binfo);
6725 *inits = build_tree_list (NULL_TREE, init);
6726 inits = &TREE_CHAIN (*inits);
6729 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6730 BINFO_VPTR_INDEX (binfo) = *index;
6732 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6734 /* Recursively add the secondary VTTs for non-virtual bases. */
6735 for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i)
6736 if (!BINFO_VIRTUAL_P (b))
6737 inits = build_vtt_inits (b, t, inits, index);
6739 /* Add secondary virtual pointers for all subobjects of BINFO with
6740 either virtual bases or reachable along a virtual path, except
6741 subobjects that are non-virtual primary bases. */
6742 data.top_level_p = top_level_p;
6743 data.index = *index;
6745 data.type_being_constructed = BINFO_TYPE (binfo);
6747 dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data);
6749 *index = data.index;
6751 /* The secondary vptrs come back in reverse order. After we reverse
6752 them, and add the INITS, the last init will be the first element
6754 secondary_vptrs = data.inits;
6755 if (secondary_vptrs)
6757 *inits = nreverse (secondary_vptrs);
6758 inits = &TREE_CHAIN (secondary_vptrs);
6759 gcc_assert (*inits == NULL_TREE);
6763 /* Add the secondary VTTs for virtual bases in inheritance graph
6765 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6767 if (!BINFO_VIRTUAL_P (b))
6770 inits = build_vtt_inits (b, t, inits, index);
6773 /* Remove the ctor vtables we created. */
6774 dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo);
6779 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
6780 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
6783 dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_)
6785 secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_;
6787 /* We don't care about bases that don't have vtables. */
6788 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6789 return dfs_skip_bases;
6791 /* We're only interested in proper subobjects of the type being
6793 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed))
6796 /* We're only interested in bases with virtual bases or reachable
6797 via a virtual path from the type being constructed. */
6798 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6799 || binfo_via_virtual (binfo, data->type_being_constructed)))
6800 return dfs_skip_bases;
6802 /* We're not interested in non-virtual primary bases. */
6803 if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo))
6806 /* Record the index where this secondary vptr can be found. */
6807 if (data->top_level_p)
6809 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6810 BINFO_VPTR_INDEX (binfo) = data->index;
6812 if (BINFO_VIRTUAL_P (binfo))
6814 /* It's a primary virtual base, and this is not a
6815 construction vtable. Find the base this is primary of in
6816 the inheritance graph, and use that base's vtable
6818 while (BINFO_PRIMARY_P (binfo))
6819 binfo = BINFO_INHERITANCE_CHAIN (binfo);
6823 /* Add the initializer for the secondary vptr itself. */
6824 data->inits = tree_cons (NULL_TREE, binfo_ctor_vtable (binfo), data->inits);
6826 /* Advance the vtt index. */
6827 data->index = size_binop (PLUS_EXPR, data->index,
6828 TYPE_SIZE_UNIT (ptr_type_node));
6833 /* Called from build_vtt_inits via dfs_walk. After building
6834 constructor vtables and generating the sub-vtt from them, we need
6835 to restore the BINFO_VTABLES that were scribbled on. DATA is the
6836 binfo of the base whose sub vtt was generated. */
6839 dfs_fixup_binfo_vtbls (tree binfo, void* data)
6841 tree vtable = BINFO_VTABLE (binfo);
6843 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6844 /* If this class has no vtable, none of its bases do. */
6845 return dfs_skip_bases;
6848 /* This might be a primary base, so have no vtable in this
6852 /* If we scribbled the construction vtable vptr into BINFO, clear it
6854 if (TREE_CODE (vtable) == TREE_LIST
6855 && (TREE_PURPOSE (vtable) == (tree) data))
6856 BINFO_VTABLE (binfo) = TREE_CHAIN (vtable);
6861 /* Build the construction vtable group for BINFO which is in the
6862 hierarchy dominated by T. */
6865 build_ctor_vtbl_group (tree binfo, tree t)
6874 /* See if we've already created this construction vtable group. */
6875 id = mangle_ctor_vtbl_for_type (t, binfo);
6876 if (IDENTIFIER_GLOBAL_VALUE (id))
6879 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t));
6880 /* Build a version of VTBL (with the wrong type) for use in
6881 constructing the addresses of secondary vtables in the
6882 construction vtable group. */
6883 vtbl = build_vtable (t, id, ptr_type_node);
6884 DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1;
6885 list = build_tree_list (vtbl, NULL_TREE);
6886 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
6889 /* Add the vtables for each of our virtual bases using the vbase in T
6891 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
6893 vbase = TREE_CHAIN (vbase))
6897 if (!BINFO_VIRTUAL_P (vbase))
6899 b = copied_binfo (vbase, binfo);
6901 accumulate_vtbl_inits (b, vbase, binfo, t, list);
6903 inits = TREE_VALUE (list);
6905 /* Figure out the type of the construction vtable. */
6906 type = build_index_type (size_int (list_length (inits) - 1));
6907 type = build_cplus_array_type (vtable_entry_type, type);
6908 TREE_TYPE (vtbl) = type;
6910 /* Initialize the construction vtable. */
6911 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
6912 initialize_artificial_var (vtbl, inits);
6913 dump_vtable (t, binfo, vtbl);
6916 /* Add the vtbl initializers for BINFO (and its bases other than
6917 non-virtual primaries) to the list of INITS. BINFO is in the
6918 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
6919 the constructor the vtbl inits should be accumulated for. (If this
6920 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
6921 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
6922 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
6923 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
6924 but are not necessarily the same in terms of layout. */
6927 accumulate_vtbl_inits (tree binfo,
6935 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
6937 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo)));
6939 /* If it doesn't have a vptr, we don't do anything. */
6940 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6943 /* If we're building a construction vtable, we're not interested in
6944 subobjects that don't require construction vtables. */
6946 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6947 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
6950 /* Build the initializers for the BINFO-in-T vtable. */
6952 = chainon (TREE_VALUE (inits),
6953 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
6954 rtti_binfo, t, inits));
6956 /* Walk the BINFO and its bases. We walk in preorder so that as we
6957 initialize each vtable we can figure out at what offset the
6958 secondary vtable lies from the primary vtable. We can't use
6959 dfs_walk here because we need to iterate through bases of BINFO
6960 and RTTI_BINFO simultaneously. */
6961 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6963 /* Skip virtual bases. */
6964 if (BINFO_VIRTUAL_P (base_binfo))
6966 accumulate_vtbl_inits (base_binfo,
6967 BINFO_BASE_BINFO (orig_binfo, i),
6973 /* Called from accumulate_vtbl_inits. Returns the initializers for
6974 the BINFO vtable. */
6977 dfs_accumulate_vtbl_inits (tree binfo,
6983 tree inits = NULL_TREE;
6984 tree vtbl = NULL_TREE;
6985 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
6988 && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
6990 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
6991 primary virtual base. If it is not the same primary in
6992 the hierarchy of T, we'll need to generate a ctor vtable
6993 for it, to place at its location in T. If it is the same
6994 primary, we still need a VTT entry for the vtable, but it
6995 should point to the ctor vtable for the base it is a
6996 primary for within the sub-hierarchy of RTTI_BINFO.
6998 There are three possible cases:
7000 1) We are in the same place.
7001 2) We are a primary base within a lost primary virtual base of
7003 3) We are primary to something not a base of RTTI_BINFO. */
7006 tree last = NULL_TREE;
7008 /* First, look through the bases we are primary to for RTTI_BINFO
7009 or a virtual base. */
7011 while (BINFO_PRIMARY_P (b))
7013 b = BINFO_INHERITANCE_CHAIN (b);
7015 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7018 /* If we run out of primary links, keep looking down our
7019 inheritance chain; we might be an indirect primary. */
7020 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
7021 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7025 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7026 base B and it is a base of RTTI_BINFO, this is case 2. In
7027 either case, we share our vtable with LAST, i.e. the
7028 derived-most base within B of which we are a primary. */
7030 || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo))))
7031 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7032 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7033 binfo_ctor_vtable after everything's been set up. */
7036 /* Otherwise, this is case 3 and we get our own. */
7038 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
7046 /* Compute the initializer for this vtable. */
7047 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7050 /* Figure out the position to which the VPTR should point. */
7051 vtbl = TREE_PURPOSE (l);
7052 vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, vtbl);
7053 index = size_binop (PLUS_EXPR,
7054 size_int (non_fn_entries),
7055 size_int (list_length (TREE_VALUE (l))));
7056 index = size_binop (MULT_EXPR,
7057 TYPE_SIZE_UNIT (vtable_entry_type),
7059 vtbl = build2 (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7063 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7064 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7065 straighten this out. */
7066 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7067 else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo))
7070 /* For an ordinary vtable, set BINFO_VTABLE. */
7071 BINFO_VTABLE (binfo) = vtbl;
7076 static GTY(()) tree abort_fndecl_addr;
7078 /* Construct the initializer for BINFO's virtual function table. BINFO
7079 is part of the hierarchy dominated by T. If we're building a
7080 construction vtable, the ORIG_BINFO is the binfo we should use to
7081 find the actual function pointers to put in the vtable - but they
7082 can be overridden on the path to most-derived in the graph that
7083 ORIG_BINFO belongs. Otherwise,
7084 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7085 BINFO that should be indicated by the RTTI information in the
7086 vtable; it will be a base class of T, rather than T itself, if we
7087 are building a construction vtable.
7089 The value returned is a TREE_LIST suitable for wrapping in a
7090 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7091 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7092 number of non-function entries in the vtable.
7094 It might seem that this function should never be called with a
7095 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7096 base is always subsumed by a derived class vtable. However, when
7097 we are building construction vtables, we do build vtables for
7098 primary bases; we need these while the primary base is being
7102 build_vtbl_initializer (tree binfo,
7106 int* non_fn_entries_p)
7113 VEC(tree,gc) *vbases;
7115 /* Initialize VID. */
7116 memset (&vid, 0, sizeof (vid));
7119 vid.rtti_binfo = rtti_binfo;
7120 vid.last_init = &vid.inits;
7121 vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
7122 vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7123 vid.generate_vcall_entries = true;
7124 /* The first vbase or vcall offset is at index -3 in the vtable. */
7125 vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
7127 /* Add entries to the vtable for RTTI. */
7128 build_rtti_vtbl_entries (binfo, &vid);
7130 /* Create an array for keeping track of the functions we've
7131 processed. When we see multiple functions with the same
7132 signature, we share the vcall offsets. */
7133 vid.fns = VEC_alloc (tree, gc, 32);
7134 /* Add the vcall and vbase offset entries. */
7135 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7137 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7138 build_vbase_offset_vtbl_entries. */
7139 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
7140 VEC_iterate (tree, vbases, ix, vbinfo); ix++)
7141 BINFO_VTABLE_PATH_MARKED (vbinfo) = 0;
7143 /* If the target requires padding between data entries, add that now. */
7144 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
7148 for (prev = &vid.inits; (cur = *prev); prev = &TREE_CHAIN (cur))
7153 for (i = 1; i < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++i)
7154 add = tree_cons (NULL_TREE,
7155 build1 (NOP_EXPR, vtable_entry_type,
7162 if (non_fn_entries_p)
7163 *non_fn_entries_p = list_length (vid.inits);
7165 /* Go through all the ordinary virtual functions, building up
7167 vfun_inits = NULL_TREE;
7168 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7172 tree fn, fn_original;
7173 tree init = NULL_TREE;
7177 if (DECL_THUNK_P (fn))
7179 if (!DECL_NAME (fn))
7181 if (THUNK_ALIAS (fn))
7183 fn = THUNK_ALIAS (fn);
7186 fn_original = THUNK_TARGET (fn);
7189 /* If the only definition of this function signature along our
7190 primary base chain is from a lost primary, this vtable slot will
7191 never be used, so just zero it out. This is important to avoid
7192 requiring extra thunks which cannot be generated with the function.
7194 We first check this in update_vtable_entry_for_fn, so we handle
7195 restored primary bases properly; we also need to do it here so we
7196 zero out unused slots in ctor vtables, rather than filling themff
7197 with erroneous values (though harmless, apart from relocation
7199 for (b = binfo; ; b = get_primary_binfo (b))
7201 /* We found a defn before a lost primary; go ahead as normal. */
7202 if (look_for_overrides_here (BINFO_TYPE (b), fn_original))
7205 /* The nearest definition is from a lost primary; clear the
7207 if (BINFO_LOST_PRIMARY_P (b))
7209 init = size_zero_node;
7216 /* Pull the offset for `this', and the function to call, out of
7218 delta = BV_DELTA (v);
7219 vcall_index = BV_VCALL_INDEX (v);
7221 gcc_assert (TREE_CODE (delta) == INTEGER_CST);
7222 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7224 /* You can't call an abstract virtual function; it's abstract.
7225 So, we replace these functions with __pure_virtual. */
7226 if (DECL_PURE_VIRTUAL_P (fn_original))
7229 if (abort_fndecl_addr == NULL)
7230 abort_fndecl_addr = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7231 init = abort_fndecl_addr;
7235 if (!integer_zerop (delta) || vcall_index)
7237 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
7238 if (!DECL_NAME (fn))
7241 /* Take the address of the function, considering it to be of an
7242 appropriate generic type. */
7243 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7247 /* And add it to the chain of initializers. */
7248 if (TARGET_VTABLE_USES_DESCRIPTORS)
7251 if (init == size_zero_node)
7252 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7253 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7255 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7257 tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node,
7258 TREE_OPERAND (init, 0),
7259 build_int_cst (NULL_TREE, i));
7260 TREE_CONSTANT (fdesc) = 1;
7261 TREE_INVARIANT (fdesc) = 1;
7263 vfun_inits = tree_cons (NULL_TREE, fdesc, vfun_inits);
7267 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7270 /* The initializers for virtual functions were built up in reverse
7271 order; straighten them out now. */
7272 vfun_inits = nreverse (vfun_inits);
7274 /* The negative offset initializers are also in reverse order. */
7275 vid.inits = nreverse (vid.inits);
7277 /* Chain the two together. */
7278 return chainon (vid.inits, vfun_inits);
7281 /* Adds to vid->inits the initializers for the vbase and vcall
7282 offsets in BINFO, which is in the hierarchy dominated by T. */
7285 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
7289 /* If this is a derived class, we must first create entries
7290 corresponding to the primary base class. */
7291 b = get_primary_binfo (binfo);
7293 build_vcall_and_vbase_vtbl_entries (b, vid);
7295 /* Add the vbase entries for this base. */
7296 build_vbase_offset_vtbl_entries (binfo, vid);
7297 /* Add the vcall entries for this base. */
7298 build_vcall_offset_vtbl_entries (binfo, vid);
7301 /* Returns the initializers for the vbase offset entries in the vtable
7302 for BINFO (which is part of the class hierarchy dominated by T), in
7303 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7304 where the next vbase offset will go. */
7307 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7311 tree non_primary_binfo;
7313 /* If there are no virtual baseclasses, then there is nothing to
7315 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
7320 /* We might be a primary base class. Go up the inheritance hierarchy
7321 until we find the most derived class of which we are a primary base:
7322 it is the offset of that which we need to use. */
7323 non_primary_binfo = binfo;
7324 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7328 /* If we have reached a virtual base, then it must be a primary
7329 base (possibly multi-level) of vid->binfo, or we wouldn't
7330 have called build_vcall_and_vbase_vtbl_entries for it. But it
7331 might be a lost primary, so just skip down to vid->binfo. */
7332 if (BINFO_VIRTUAL_P (non_primary_binfo))
7334 non_primary_binfo = vid->binfo;
7338 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7339 if (get_primary_binfo (b) != non_primary_binfo)
7341 non_primary_binfo = b;
7344 /* Go through the virtual bases, adding the offsets. */
7345 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7347 vbase = TREE_CHAIN (vbase))
7352 if (!BINFO_VIRTUAL_P (vbase))
7355 /* Find the instance of this virtual base in the complete
7357 b = copied_binfo (vbase, binfo);
7359 /* If we've already got an offset for this virtual base, we
7360 don't need another one. */
7361 if (BINFO_VTABLE_PATH_MARKED (b))
7363 BINFO_VTABLE_PATH_MARKED (b) = 1;
7365 /* Figure out where we can find this vbase offset. */
7366 delta = size_binop (MULT_EXPR,
7369 TYPE_SIZE_UNIT (vtable_entry_type)));
7370 if (vid->primary_vtbl_p)
7371 BINFO_VPTR_FIELD (b) = delta;
7373 if (binfo != TYPE_BINFO (t))
7374 /* The vbase offset had better be the same. */
7375 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase)));
7377 /* The next vbase will come at a more negative offset. */
7378 vid->index = size_binop (MINUS_EXPR, vid->index,
7379 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7381 /* The initializer is the delta from BINFO to this virtual base.
7382 The vbase offsets go in reverse inheritance-graph order, and
7383 we are walking in inheritance graph order so these end up in
7385 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
7388 = build_tree_list (NULL_TREE,
7389 fold_build1 (NOP_EXPR,
7392 vid->last_init = &TREE_CHAIN (*vid->last_init);
7396 /* Adds the initializers for the vcall offset entries in the vtable
7397 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7401 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7403 /* We only need these entries if this base is a virtual base. We
7404 compute the indices -- but do not add to the vtable -- when
7405 building the main vtable for a class. */
7406 if (BINFO_VIRTUAL_P (binfo) || binfo == TYPE_BINFO (vid->derived))
7408 /* We need a vcall offset for each of the virtual functions in this
7409 vtable. For example:
7411 class A { virtual void f (); };
7412 class B1 : virtual public A { virtual void f (); };
7413 class B2 : virtual public A { virtual void f (); };
7414 class C: public B1, public B2 { virtual void f (); };
7416 A C object has a primary base of B1, which has a primary base of A. A
7417 C also has a secondary base of B2, which no longer has a primary base
7418 of A. So the B2-in-C construction vtable needs a secondary vtable for
7419 A, which will adjust the A* to a B2* to call f. We have no way of
7420 knowing what (or even whether) this offset will be when we define B2,
7421 so we store this "vcall offset" in the A sub-vtable and look it up in
7422 a "virtual thunk" for B2::f.
7424 We need entries for all the functions in our primary vtable and
7425 in our non-virtual bases' secondary vtables. */
7427 /* If we are just computing the vcall indices -- but do not need
7428 the actual entries -- not that. */
7429 if (!BINFO_VIRTUAL_P (binfo))
7430 vid->generate_vcall_entries = false;
7431 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7432 add_vcall_offset_vtbl_entries_r (binfo, vid);
7436 /* Build vcall offsets, starting with those for BINFO. */
7439 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
7445 /* Don't walk into virtual bases -- except, of course, for the
7446 virtual base for which we are building vcall offsets. Any
7447 primary virtual base will have already had its offsets generated
7448 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7449 if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo)
7452 /* If BINFO has a primary base, process it first. */
7453 primary_binfo = get_primary_binfo (binfo);
7455 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7457 /* Add BINFO itself to the list. */
7458 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7460 /* Scan the non-primary bases of BINFO. */
7461 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7462 if (base_binfo != primary_binfo)
7463 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7466 /* Called from build_vcall_offset_vtbl_entries_r. */
7469 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
7471 /* Make entries for the rest of the virtuals. */
7472 if (abi_version_at_least (2))
7476 /* The ABI requires that the methods be processed in declaration
7477 order. G++ 3.2 used the order in the vtable. */
7478 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
7480 orig_fn = TREE_CHAIN (orig_fn))
7481 if (DECL_VINDEX (orig_fn))
7482 add_vcall_offset (orig_fn, binfo, vid);
7486 tree derived_virtuals;
7489 /* If BINFO is a primary base, the most derived class which has
7490 BINFO as a primary base; otherwise, just BINFO. */
7491 tree non_primary_binfo;
7493 /* We might be a primary base class. Go up the inheritance hierarchy
7494 until we find the most derived class of which we are a primary base:
7495 it is the BINFO_VIRTUALS there that we need to consider. */
7496 non_primary_binfo = binfo;
7497 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7501 /* If we have reached a virtual base, then it must be vid->vbase,
7502 because we ignore other virtual bases in
7503 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7504 base (possibly multi-level) of vid->binfo, or we wouldn't
7505 have called build_vcall_and_vbase_vtbl_entries for it. But it
7506 might be a lost primary, so just skip down to vid->binfo. */
7507 if (BINFO_VIRTUAL_P (non_primary_binfo))
7509 gcc_assert (non_primary_binfo == vid->vbase);
7510 non_primary_binfo = vid->binfo;
7514 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7515 if (get_primary_binfo (b) != non_primary_binfo)
7517 non_primary_binfo = b;
7520 if (vid->ctor_vtbl_p)
7521 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7522 where rtti_binfo is the most derived type. */
7524 = original_binfo (non_primary_binfo, vid->rtti_binfo);
7526 for (base_virtuals = BINFO_VIRTUALS (binfo),
7527 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7528 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7530 base_virtuals = TREE_CHAIN (base_virtuals),
7531 derived_virtuals = TREE_CHAIN (derived_virtuals),
7532 orig_virtuals = TREE_CHAIN (orig_virtuals))
7536 /* Find the declaration that originally caused this function to
7537 be present in BINFO_TYPE (binfo). */
7538 orig_fn = BV_FN (orig_virtuals);
7540 /* When processing BINFO, we only want to generate vcall slots for
7541 function slots introduced in BINFO. So don't try to generate
7542 one if the function isn't even defined in BINFO. */
7543 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn)))
7546 add_vcall_offset (orig_fn, binfo, vid);
7551 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7554 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
7560 /* If there is already an entry for a function with the same
7561 signature as FN, then we do not need a second vcall offset.
7562 Check the list of functions already present in the derived
7564 for (i = 0; VEC_iterate (tree, vid->fns, i, derived_entry); ++i)
7566 if (same_signature_p (derived_entry, orig_fn)
7567 /* We only use one vcall offset for virtual destructors,
7568 even though there are two virtual table entries. */
7569 || (DECL_DESTRUCTOR_P (derived_entry)
7570 && DECL_DESTRUCTOR_P (orig_fn)))
7574 /* If we are building these vcall offsets as part of building
7575 the vtable for the most derived class, remember the vcall
7577 if (vid->binfo == TYPE_BINFO (vid->derived))
7579 tree_pair_p elt = VEC_safe_push (tree_pair_s, gc,
7580 CLASSTYPE_VCALL_INDICES (vid->derived),
7582 elt->purpose = orig_fn;
7583 elt->value = vid->index;
7586 /* The next vcall offset will be found at a more negative
7588 vid->index = size_binop (MINUS_EXPR, vid->index,
7589 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7591 /* Keep track of this function. */
7592 VEC_safe_push (tree, gc, vid->fns, orig_fn);
7594 if (vid->generate_vcall_entries)
7599 /* Find the overriding function. */
7600 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
7601 if (fn == error_mark_node)
7602 vcall_offset = build1 (NOP_EXPR, vtable_entry_type,
7606 base = TREE_VALUE (fn);
7608 /* The vbase we're working on is a primary base of
7609 vid->binfo. But it might be a lost primary, so its
7610 BINFO_OFFSET might be wrong, so we just use the
7611 BINFO_OFFSET from vid->binfo. */
7612 vcall_offset = size_diffop (BINFO_OFFSET (base),
7613 BINFO_OFFSET (vid->binfo));
7614 vcall_offset = fold_build1 (NOP_EXPR, vtable_entry_type,
7617 /* Add the initializer to the vtable. */
7618 *vid->last_init = build_tree_list (NULL_TREE, vcall_offset);
7619 vid->last_init = &TREE_CHAIN (*vid->last_init);
7623 /* Return vtbl initializers for the RTTI entries corresponding to the
7624 BINFO's vtable. The RTTI entries should indicate the object given
7625 by VID->rtti_binfo. */
7628 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
7637 basetype = BINFO_TYPE (binfo);
7638 t = BINFO_TYPE (vid->rtti_binfo);
7640 /* To find the complete object, we will first convert to our most
7641 primary base, and then add the offset in the vtbl to that value. */
7643 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
7644 && !BINFO_LOST_PRIMARY_P (b))
7648 primary_base = get_primary_binfo (b);
7649 gcc_assert (BINFO_PRIMARY_P (primary_base)
7650 && BINFO_INHERITANCE_CHAIN (primary_base) == b);
7653 offset = size_diffop (BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
7655 /* The second entry is the address of the typeinfo object. */
7657 decl = build_address (get_tinfo_decl (t));
7659 decl = integer_zero_node;
7661 /* Convert the declaration to a type that can be stored in the
7663 init = build_nop (vfunc_ptr_type_node, decl);
7664 *vid->last_init = build_tree_list (NULL_TREE, init);
7665 vid->last_init = &TREE_CHAIN (*vid->last_init);
7667 /* Add the offset-to-top entry. It comes earlier in the vtable than
7668 the typeinfo entry. Convert the offset to look like a
7669 function pointer, so that we can put it in the vtable. */
7670 init = build_nop (vfunc_ptr_type_node, offset);
7671 *vid->last_init = build_tree_list (NULL_TREE, init);
7672 vid->last_init = &TREE_CHAIN (*vid->last_init);
7675 /* Fold a OBJ_TYPE_REF expression to the address of a function.
7676 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
7679 cp_fold_obj_type_ref (tree ref, tree known_type)
7681 HOST_WIDE_INT index = tree_low_cst (OBJ_TYPE_REF_TOKEN (ref), 1);
7682 HOST_WIDE_INT i = 0;
7683 tree v = BINFO_VIRTUALS (TYPE_BINFO (known_type));
7688 i += (TARGET_VTABLE_USES_DESCRIPTORS
7689 ? TARGET_VTABLE_USES_DESCRIPTORS : 1);
7695 #ifdef ENABLE_CHECKING
7696 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref),
7697 DECL_VINDEX (fndecl)));
7700 cgraph_node (fndecl)->local.vtable_method = true;
7702 return build_address (fndecl);
7705 #include "gt-cp-class.h"