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, 2007
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
22 Boston, MA 02110-1301, USA. */
25 /* High-level class interface. */
29 #include "coretypes.h"
40 #include "tree-dump.h"
42 /* The number of nested classes being processed. If we are not in the
43 scope of any class, this is zero. */
45 int current_class_depth;
47 /* In order to deal with nested classes, we keep a stack of classes.
48 The topmost entry is the innermost class, and is the entry at index
49 CURRENT_CLASS_DEPTH */
51 typedef struct class_stack_node {
52 /* The name of the class. */
55 /* The _TYPE node for the class. */
58 /* The access specifier pending for new declarations in the scope of
62 /* If were defining TYPE, the names used in this class. */
63 splay_tree names_used;
65 /* Nonzero if this class is no longer open, because of a call to
68 }* class_stack_node_t;
70 typedef struct vtbl_init_data_s
72 /* The base for which we're building initializers. */
74 /* The type of the most-derived type. */
76 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
77 unless ctor_vtbl_p is true. */
79 /* The negative-index vtable initializers built up so far. These
80 are in order from least negative index to most negative index. */
82 /* The last (i.e., most negative) entry in INITS. */
84 /* The binfo for the virtual base for which we're building
85 vcall offset initializers. */
87 /* The functions in vbase for which we have already provided vcall
90 /* The vtable index of the next vcall or vbase offset. */
92 /* Nonzero if we are building the initializer for the primary
95 /* Nonzero if we are building the initializer for a construction
98 /* True when adding vcall offset entries to the vtable. False when
99 merely computing the indices. */
100 bool generate_vcall_entries;
103 /* The type of a function passed to walk_subobject_offsets. */
104 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
106 /* The stack itself. This is a dynamically resized array. The
107 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
108 static int current_class_stack_size;
109 static class_stack_node_t current_class_stack;
111 /* The size of the largest empty class seen in this translation unit. */
112 static GTY (()) tree sizeof_biggest_empty_class;
114 /* An array of all local classes present in this translation unit, in
115 declaration order. */
116 VEC(tree,gc) *local_classes;
118 static tree get_vfield_name (tree);
119 static void finish_struct_anon (tree);
120 static tree get_vtable_name (tree);
121 static tree get_basefndecls (tree, tree);
122 static int build_primary_vtable (tree, tree);
123 static int build_secondary_vtable (tree);
124 static void finish_vtbls (tree);
125 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
126 static void finish_struct_bits (tree);
127 static int alter_access (tree, tree, tree);
128 static void handle_using_decl (tree, tree);
129 static tree dfs_modify_vtables (tree, void *);
130 static tree modify_all_vtables (tree, tree);
131 static void determine_primary_bases (tree);
132 static void finish_struct_methods (tree);
133 static void maybe_warn_about_overly_private_class (tree);
134 static int method_name_cmp (const void *, const void *);
135 static int resort_method_name_cmp (const void *, const void *);
136 static void add_implicitly_declared_members (tree, int, int);
137 static tree fixed_type_or_null (tree, int *, int *);
138 static tree build_simple_base_path (tree expr, tree binfo);
139 static tree build_vtbl_ref_1 (tree, tree);
140 static tree build_vtbl_initializer (tree, tree, tree, tree, int *);
141 static int count_fields (tree);
142 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
143 static void check_bitfield_decl (tree);
144 static void check_field_decl (tree, tree, int *, int *, int *);
145 static void check_field_decls (tree, tree *, int *, int *);
146 static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
147 static void build_base_fields (record_layout_info, splay_tree, tree *);
148 static void check_methods (tree);
149 static void remove_zero_width_bit_fields (tree);
150 static void check_bases (tree, int *, int *);
151 static void check_bases_and_members (tree);
152 static tree create_vtable_ptr (tree, tree *);
153 static void include_empty_classes (record_layout_info);
154 static void layout_class_type (tree, tree *);
155 static void fixup_pending_inline (tree);
156 static void fixup_inline_methods (tree);
157 static void propagate_binfo_offsets (tree, tree);
158 static void layout_virtual_bases (record_layout_info, splay_tree);
159 static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *);
160 static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *);
161 static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *);
162 static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *);
163 static void add_vcall_offset (tree, tree, vtbl_init_data *);
164 static void layout_vtable_decl (tree, int);
165 static tree dfs_find_final_overrider_pre (tree, void *);
166 static tree dfs_find_final_overrider_post (tree, void *);
167 static tree find_final_overrider (tree, tree, tree);
168 static int make_new_vtable (tree, tree);
169 static tree get_primary_binfo (tree);
170 static int maybe_indent_hierarchy (FILE *, int, int);
171 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
172 static void dump_class_hierarchy (tree);
173 static void dump_class_hierarchy_1 (FILE *, int, tree);
174 static void dump_array (FILE *, tree);
175 static void dump_vtable (tree, tree, tree);
176 static void dump_vtt (tree, tree);
177 static void dump_thunk (FILE *, int, tree);
178 static tree build_vtable (tree, tree, tree);
179 static void initialize_vtable (tree, tree);
180 static void layout_nonempty_base_or_field (record_layout_info,
181 tree, tree, splay_tree);
182 static tree end_of_class (tree, int);
183 static bool layout_empty_base (tree, tree, splay_tree);
184 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree);
185 static tree dfs_accumulate_vtbl_inits (tree, tree, tree, tree,
187 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
188 static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *);
189 static void clone_constructors_and_destructors (tree);
190 static tree build_clone (tree, tree);
191 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
192 static void build_ctor_vtbl_group (tree, tree);
193 static void build_vtt (tree);
194 static tree binfo_ctor_vtable (tree);
195 static tree *build_vtt_inits (tree, tree, tree *, tree *);
196 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
197 static tree dfs_fixup_binfo_vtbls (tree, void *);
198 static int record_subobject_offset (tree, tree, splay_tree);
199 static int check_subobject_offset (tree, tree, splay_tree);
200 static int walk_subobject_offsets (tree, subobject_offset_fn,
201 tree, splay_tree, tree, int);
202 static void record_subobject_offsets (tree, tree, splay_tree, bool);
203 static int layout_conflict_p (tree, tree, splay_tree, int);
204 static int splay_tree_compare_integer_csts (splay_tree_key k1,
206 static void warn_about_ambiguous_bases (tree);
207 static bool type_requires_array_cookie (tree);
208 static bool contains_empty_class_p (tree);
209 static bool base_derived_from (tree, tree);
210 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
211 static tree end_of_base (tree);
212 static tree get_vcall_index (tree, tree);
214 /* Variables shared between class.c and call.c. */
216 #ifdef GATHER_STATISTICS
218 int n_vtable_entries = 0;
219 int n_vtable_searches = 0;
220 int n_vtable_elems = 0;
221 int n_convert_harshness = 0;
222 int n_compute_conversion_costs = 0;
223 int n_inner_fields_searched = 0;
226 /* Convert to or from a base subobject. EXPR is an expression of type
227 `A' or `A*', an expression of type `B' or `B*' is returned. To
228 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
229 the B base instance within A. To convert base A to derived B, CODE
230 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
231 In this latter case, A must not be a morally virtual base of B.
232 NONNULL is true if EXPR is known to be non-NULL (this is only
233 needed when EXPR is of pointer type). CV qualifiers are preserved
237 build_base_path (enum tree_code code,
242 tree v_binfo = NULL_TREE;
243 tree d_binfo = NULL_TREE;
247 tree null_test = NULL;
248 tree ptr_target_type;
250 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
251 bool has_empty = false;
254 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
255 return error_mark_node;
257 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
260 if (is_empty_class (BINFO_TYPE (probe)))
262 if (!v_binfo && BINFO_VIRTUAL_P (probe))
266 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
268 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
270 gcc_assert ((code == MINUS_EXPR
271 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe))
272 || (code == PLUS_EXPR
273 && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)));
275 if (binfo == d_binfo)
279 if (code == MINUS_EXPR && v_binfo)
281 error ("cannot convert from base %qT to derived type %qT via virtual base %qT",
282 BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo));
283 return error_mark_node;
287 /* This must happen before the call to save_expr. */
288 expr = build_unary_op (ADDR_EXPR, expr, 0);
290 offset = BINFO_OFFSET (binfo);
291 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
292 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
294 /* Do we need to look in the vtable for the real offset? */
295 virtual_access = (v_binfo && fixed_type_p <= 0);
297 /* Do we need to check for a null pointer? */
298 if (want_pointer && !nonnull)
300 /* If we know the conversion will not actually change the value
301 of EXPR, then we can avoid testing the expression for NULL.
302 We have to avoid generating a COMPONENT_REF for a base class
303 field, because other parts of the compiler know that such
304 expressions are always non-NULL. */
305 if (!virtual_access && integer_zerop (offset))
308 /* TARGET_TYPE has been extracted from BINFO, and, is
309 therefore always cv-unqualified. Extract the
310 cv-qualifiers from EXPR so that the expression returned
311 matches the input. */
312 class_type = TREE_TYPE (TREE_TYPE (expr));
314 = cp_build_qualified_type (target_type,
315 cp_type_quals (class_type));
316 return build_nop (build_pointer_type (target_type), expr);
318 null_test = error_mark_node;
321 /* Protect against multiple evaluation if necessary. */
322 if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access))
323 expr = save_expr (expr);
325 /* Now that we've saved expr, build the real null test. */
328 tree zero = cp_convert (TREE_TYPE (expr), integer_zero_node);
329 null_test = fold_build2 (NE_EXPR, boolean_type_node,
333 /* If this is a simple base reference, express it as a COMPONENT_REF. */
334 if (code == PLUS_EXPR && !virtual_access
335 /* We don't build base fields for empty bases, and they aren't very
336 interesting to the optimizers anyway. */
339 expr = build_indirect_ref (expr, NULL);
340 expr = build_simple_base_path (expr, binfo);
342 expr = build_address (expr);
343 target_type = TREE_TYPE (expr);
349 /* Going via virtual base V_BINFO. We need the static offset
350 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
351 V_BINFO. That offset is an entry in D_BINFO's vtable. */
354 if (fixed_type_p < 0 && in_base_initializer)
356 /* In a base member initializer, we cannot rely on the
357 vtable being set up. We have to indirect via the
361 t = TREE_TYPE (TYPE_VFIELD (current_class_type));
362 t = build_pointer_type (t);
363 v_offset = convert (t, current_vtt_parm);
364 v_offset = build_indirect_ref (v_offset, NULL);
367 v_offset = build_vfield_ref (build_indirect_ref (expr, NULL),
368 TREE_TYPE (TREE_TYPE (expr)));
370 v_offset = build2 (POINTER_PLUS_EXPR, TREE_TYPE (v_offset),
371 v_offset, fold_convert (sizetype, BINFO_VPTR_FIELD (v_binfo)));
372 v_offset = build1 (NOP_EXPR,
373 build_pointer_type (ptrdiff_type_node),
375 v_offset = build_indirect_ref (v_offset, NULL);
376 TREE_CONSTANT (v_offset) = 1;
377 TREE_INVARIANT (v_offset) = 1;
379 offset = convert_to_integer (ptrdiff_type_node,
381 BINFO_OFFSET (v_binfo)));
383 if (!integer_zerop (offset))
384 v_offset = build2 (code, ptrdiff_type_node, v_offset, offset);
386 if (fixed_type_p < 0)
387 /* Negative fixed_type_p means this is a constructor or destructor;
388 virtual base layout is fixed in in-charge [cd]tors, but not in
390 offset = build3 (COND_EXPR, ptrdiff_type_node,
391 build2 (EQ_EXPR, boolean_type_node,
392 current_in_charge_parm, integer_zero_node),
394 convert_to_integer (ptrdiff_type_node,
395 BINFO_OFFSET (binfo)));
400 target_type = cp_build_qualified_type
401 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
402 ptr_target_type = build_pointer_type (target_type);
404 target_type = ptr_target_type;
406 expr = build1 (NOP_EXPR, ptr_target_type, expr);
408 if (!integer_zerop (offset))
410 offset = fold_convert (sizetype, offset);
411 if (code == MINUS_EXPR)
412 offset = fold_build1 (NEGATE_EXPR, sizetype, offset);
413 expr = build2 (POINTER_PLUS_EXPR, ptr_target_type, expr, offset);
419 expr = build_indirect_ref (expr, NULL);
423 expr = fold_build3 (COND_EXPR, target_type, null_test, expr,
424 fold_build1 (NOP_EXPR, target_type,
430 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
431 Perform a derived-to-base conversion by recursively building up a
432 sequence of COMPONENT_REFs to the appropriate base fields. */
435 build_simple_base_path (tree expr, tree binfo)
437 tree type = BINFO_TYPE (binfo);
438 tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
441 if (d_binfo == NULL_TREE)
445 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type);
447 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
448 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
449 an lvalue in the front end; only _DECLs and _REFs are lvalues
451 temp = unary_complex_lvalue (ADDR_EXPR, expr);
453 expr = build_indirect_ref (temp, NULL);
459 expr = build_simple_base_path (expr, d_binfo);
461 for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo));
462 field; field = TREE_CHAIN (field))
463 /* Is this the base field created by build_base_field? */
464 if (TREE_CODE (field) == FIELD_DECL
465 && DECL_FIELD_IS_BASE (field)
466 && TREE_TYPE (field) == type)
468 /* We don't use build_class_member_access_expr here, as that
469 has unnecessary checks, and more importantly results in
470 recursive calls to dfs_walk_once. */
471 int type_quals = cp_type_quals (TREE_TYPE (expr));
473 expr = build3 (COMPONENT_REF,
474 cp_build_qualified_type (type, type_quals),
475 expr, field, NULL_TREE);
476 expr = fold_if_not_in_template (expr);
478 /* Mark the expression const or volatile, as appropriate.
479 Even though we've dealt with the type above, we still have
480 to mark the expression itself. */
481 if (type_quals & TYPE_QUAL_CONST)
482 TREE_READONLY (expr) = 1;
483 if (type_quals & TYPE_QUAL_VOLATILE)
484 TREE_THIS_VOLATILE (expr) = 1;
489 /* Didn't find the base field?!? */
493 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
494 type is a class type or a pointer to a class type. In the former
495 case, TYPE is also a class type; in the latter it is another
496 pointer type. If CHECK_ACCESS is true, an error message is emitted
497 if TYPE is inaccessible. If OBJECT has pointer type, the value is
498 assumed to be non-NULL. */
501 convert_to_base (tree object, tree type, bool check_access, bool nonnull)
506 if (TYPE_PTR_P (TREE_TYPE (object)))
508 object_type = TREE_TYPE (TREE_TYPE (object));
509 type = TREE_TYPE (type);
512 object_type = TREE_TYPE (object);
514 binfo = lookup_base (object_type, type,
515 check_access ? ba_check : ba_unique,
517 if (!binfo || binfo == error_mark_node)
518 return error_mark_node;
520 return build_base_path (PLUS_EXPR, object, binfo, nonnull);
523 /* EXPR is an expression with unqualified class type. BASE is a base
524 binfo of that class type. Returns EXPR, converted to the BASE
525 type. This function assumes that EXPR is the most derived class;
526 therefore virtual bases can be found at their static offsets. */
529 convert_to_base_statically (tree expr, tree base)
533 expr_type = TREE_TYPE (expr);
534 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type))
538 pointer_type = build_pointer_type (expr_type);
540 /* We use fold_build2 and fold_convert below to simplify the trees
541 provided to the optimizers. It is not safe to call these functions
542 when processing a template because they do not handle C++-specific
544 gcc_assert (!processing_template_decl);
545 expr = build_unary_op (ADDR_EXPR, expr, /*noconvert=*/1);
546 if (!integer_zerop (BINFO_OFFSET (base)))
547 expr = fold_build2 (POINTER_PLUS_EXPR, pointer_type, expr,
548 fold_convert (sizetype, BINFO_OFFSET (base)));
549 expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr);
550 expr = build_fold_indirect_ref (expr);
558 build_vfield_ref (tree datum, tree type)
560 tree vfield, vcontext;
562 if (datum == error_mark_node)
563 return error_mark_node;
565 /* First, convert to the requested type. */
566 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
567 datum = convert_to_base (datum, type, /*check_access=*/false,
570 /* Second, the requested type may not be the owner of its own vptr.
571 If not, convert to the base class that owns it. We cannot use
572 convert_to_base here, because VCONTEXT may appear more than once
573 in the inheritance hierarchy of TYPE, and thus direct conversion
574 between the types may be ambiguous. Following the path back up
575 one step at a time via primary bases avoids the problem. */
576 vfield = TYPE_VFIELD (type);
577 vcontext = DECL_CONTEXT (vfield);
578 while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type))
580 datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type));
581 type = TREE_TYPE (datum);
584 return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE);
587 /* Given an object INSTANCE, return an expression which yields the
588 vtable element corresponding to INDEX. There are many special
589 cases for INSTANCE which we take care of here, mainly to avoid
590 creating extra tree nodes when we don't have to. */
593 build_vtbl_ref_1 (tree instance, tree idx)
596 tree vtbl = NULL_TREE;
598 /* Try to figure out what a reference refers to, and
599 access its virtual function table directly. */
602 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
604 tree basetype = non_reference (TREE_TYPE (instance));
606 if (fixed_type && !cdtorp)
608 tree binfo = lookup_base (fixed_type, basetype,
609 ba_unique | ba_quiet, NULL);
611 vtbl = unshare_expr (BINFO_VTABLE (binfo));
615 vtbl = build_vfield_ref (instance, basetype);
617 assemble_external (vtbl);
619 aref = build_array_ref (vtbl, idx);
620 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
621 TREE_INVARIANT (aref) = TREE_CONSTANT (aref);
627 build_vtbl_ref (tree instance, tree idx)
629 tree aref = build_vtbl_ref_1 (instance, idx);
634 /* Given a stable object pointer INSTANCE_PTR, return an expression which
635 yields a function pointer corresponding to vtable element INDEX. */
638 build_vfn_ref (tree instance_ptr, tree idx)
642 aref = build_vtbl_ref_1 (build_indirect_ref (instance_ptr, 0), idx);
644 /* When using function descriptors, the address of the
645 vtable entry is treated as a function pointer. */
646 if (TARGET_VTABLE_USES_DESCRIPTORS)
647 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
648 build_unary_op (ADDR_EXPR, aref, /*noconvert=*/1));
650 /* Remember this as a method reference, for later devirtualization. */
651 aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx);
656 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
657 for the given TYPE. */
660 get_vtable_name (tree type)
662 return mangle_vtbl_for_type (type);
665 /* DECL is an entity associated with TYPE, like a virtual table or an
666 implicitly generated constructor. Determine whether or not DECL
667 should have external or internal linkage at the object file
668 level. This routine does not deal with COMDAT linkage and other
669 similar complexities; it simply sets TREE_PUBLIC if it possible for
670 entities in other translation units to contain copies of DECL, in
674 set_linkage_according_to_type (tree type, tree decl)
676 /* If TYPE involves a local class in a function with internal
677 linkage, then DECL should have internal linkage too. Other local
678 classes have no linkage -- but if their containing functions
679 have external linkage, it makes sense for DECL to have external
680 linkage too. That will allow template definitions to be merged,
682 if (no_linkage_check (type, /*relaxed_p=*/true))
684 TREE_PUBLIC (decl) = 0;
685 DECL_INTERFACE_KNOWN (decl) = 1;
688 TREE_PUBLIC (decl) = 1;
691 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
692 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
693 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
696 build_vtable (tree class_type, tree name, tree vtable_type)
700 decl = build_lang_decl (VAR_DECL, name, vtable_type);
701 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
702 now to avoid confusion in mangle_decl. */
703 SET_DECL_ASSEMBLER_NAME (decl, name);
704 DECL_CONTEXT (decl) = class_type;
705 DECL_ARTIFICIAL (decl) = 1;
706 TREE_STATIC (decl) = 1;
707 TREE_READONLY (decl) = 1;
708 DECL_VIRTUAL_P (decl) = 1;
709 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
710 DECL_VTABLE_OR_VTT_P (decl) = 1;
711 /* At one time the vtable info was grabbed 2 words at a time. This
712 fails on sparc unless you have 8-byte alignment. (tiemann) */
713 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
715 set_linkage_according_to_type (class_type, decl);
716 /* The vtable has not been defined -- yet. */
717 DECL_EXTERNAL (decl) = 1;
718 DECL_NOT_REALLY_EXTERN (decl) = 1;
720 /* Mark the VAR_DECL node representing the vtable itself as a
721 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
722 is rather important that such things be ignored because any
723 effort to actually generate DWARF for them will run into
724 trouble when/if we encounter code like:
727 struct S { virtual void member (); };
729 because the artificial declaration of the vtable itself (as
730 manufactured by the g++ front end) will say that the vtable is
731 a static member of `S' but only *after* the debug output for
732 the definition of `S' has already been output. This causes
733 grief because the DWARF entry for the definition of the vtable
734 will try to refer back to an earlier *declaration* of the
735 vtable as a static member of `S' and there won't be one. We
736 might be able to arrange to have the "vtable static member"
737 attached to the member list for `S' before the debug info for
738 `S' get written (which would solve the problem) but that would
739 require more intrusive changes to the g++ front end. */
740 DECL_IGNORED_P (decl) = 1;
745 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
746 or even complete. If this does not exist, create it. If COMPLETE is
747 nonzero, then complete the definition of it -- that will render it
748 impossible to actually build the vtable, but is useful to get at those
749 which are known to exist in the runtime. */
752 get_vtable_decl (tree type, int complete)
756 if (CLASSTYPE_VTABLES (type))
757 return CLASSTYPE_VTABLES (type);
759 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
760 CLASSTYPE_VTABLES (type) = decl;
764 DECL_EXTERNAL (decl) = 1;
765 finish_decl (decl, NULL_TREE, NULL_TREE);
771 /* Build the primary virtual function table for TYPE. If BINFO is
772 non-NULL, build the vtable starting with the initial approximation
773 that it is the same as the one which is the head of the association
774 list. Returns a nonzero value if a new vtable is actually
778 build_primary_vtable (tree binfo, tree type)
783 decl = get_vtable_decl (type, /*complete=*/0);
787 if (BINFO_NEW_VTABLE_MARKED (binfo))
788 /* We have already created a vtable for this base, so there's
789 no need to do it again. */
792 virtuals = copy_list (BINFO_VIRTUALS (binfo));
793 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
794 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
795 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
799 gcc_assert (TREE_TYPE (decl) == vtbl_type_node);
800 virtuals = NULL_TREE;
803 #ifdef GATHER_STATISTICS
805 n_vtable_elems += list_length (virtuals);
808 /* Initialize the association list for this type, based
809 on our first approximation. */
810 BINFO_VTABLE (TYPE_BINFO (type)) = decl;
811 BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals;
812 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
816 /* Give BINFO a new virtual function table which is initialized
817 with a skeleton-copy of its original initialization. The only
818 entry that changes is the `delta' entry, so we can really
819 share a lot of structure.
821 FOR_TYPE is the most derived type which caused this table to
824 Returns nonzero if we haven't met BINFO before.
826 The order in which vtables are built (by calling this function) for
827 an object must remain the same, otherwise a binary incompatibility
831 build_secondary_vtable (tree binfo)
833 if (BINFO_NEW_VTABLE_MARKED (binfo))
834 /* We already created a vtable for this base. There's no need to
838 /* Remember that we've created a vtable for this BINFO, so that we
839 don't try to do so again. */
840 SET_BINFO_NEW_VTABLE_MARKED (binfo);
842 /* Make fresh virtual list, so we can smash it later. */
843 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
845 /* Secondary vtables are laid out as part of the same structure as
846 the primary vtable. */
847 BINFO_VTABLE (binfo) = NULL_TREE;
851 /* Create a new vtable for BINFO which is the hierarchy dominated by
852 T. Return nonzero if we actually created a new vtable. */
855 make_new_vtable (tree t, tree binfo)
857 if (binfo == TYPE_BINFO (t))
858 /* In this case, it is *type*'s vtable we are modifying. We start
859 with the approximation that its vtable is that of the
860 immediate base class. */
861 return build_primary_vtable (binfo, t);
863 /* This is our very own copy of `basetype' to play with. Later,
864 we will fill in all the virtual functions that override the
865 virtual functions in these base classes which are not defined
866 by the current type. */
867 return build_secondary_vtable (binfo);
870 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
871 (which is in the hierarchy dominated by T) list FNDECL as its
872 BV_FN. DELTA is the required constant adjustment from the `this'
873 pointer where the vtable entry appears to the `this' required when
874 the function is actually called. */
877 modify_vtable_entry (tree t,
887 if (fndecl != BV_FN (v)
888 || !tree_int_cst_equal (delta, BV_DELTA (v)))
890 /* We need a new vtable for BINFO. */
891 if (make_new_vtable (t, binfo))
893 /* If we really did make a new vtable, we also made a copy
894 of the BINFO_VIRTUALS list. Now, we have to find the
895 corresponding entry in that list. */
896 *virtuals = BINFO_VIRTUALS (binfo);
897 while (BV_FN (*virtuals) != BV_FN (v))
898 *virtuals = TREE_CHAIN (*virtuals);
902 BV_DELTA (v) = delta;
903 BV_VCALL_INDEX (v) = NULL_TREE;
909 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
910 the USING_DECL naming METHOD. Returns true if the method could be
911 added to the method vec. */
914 add_method (tree type, tree method, tree using_decl)
918 bool template_conv_p = false;
920 VEC(tree,gc) *method_vec;
922 bool insert_p = false;
926 if (method == error_mark_node)
929 complete_p = COMPLETE_TYPE_P (type);
930 conv_p = DECL_CONV_FN_P (method);
932 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
933 && DECL_TEMPLATE_CONV_FN_P (method));
935 method_vec = CLASSTYPE_METHOD_VEC (type);
938 /* Make a new method vector. We start with 8 entries. We must
939 allocate at least two (for constructors and destructors), and
940 we're going to end up with an assignment operator at some
942 method_vec = VEC_alloc (tree, gc, 8);
943 /* Create slots for constructors and destructors. */
944 VEC_quick_push (tree, method_vec, NULL_TREE);
945 VEC_quick_push (tree, method_vec, NULL_TREE);
946 CLASSTYPE_METHOD_VEC (type) = method_vec;
949 /* Maintain TYPE_HAS_CONSTRUCTOR, etc. */
950 grok_special_member_properties (method);
952 /* Constructors and destructors go in special slots. */
953 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
954 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
955 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
957 slot = CLASSTYPE_DESTRUCTOR_SLOT;
959 if (TYPE_FOR_JAVA (type))
961 if (!DECL_ARTIFICIAL (method))
962 error ("Java class %qT cannot have a destructor", type);
963 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
964 error ("Java class %qT cannot have an implicit non-trivial "
974 /* See if we already have an entry with this name. */
975 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
976 VEC_iterate (tree, method_vec, slot, m);
982 if (TREE_CODE (m) == TEMPLATE_DECL
983 && DECL_TEMPLATE_CONV_FN_P (m))
987 if (conv_p && !DECL_CONV_FN_P (m))
989 if (DECL_NAME (m) == DECL_NAME (method))
995 && !DECL_CONV_FN_P (m)
996 && DECL_NAME (m) > DECL_NAME (method))
1000 current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot);
1002 /* Check to see if we've already got this method. */
1003 for (fns = current_fns; fns; fns = OVL_NEXT (fns))
1005 tree fn = OVL_CURRENT (fns);
1011 if (TREE_CODE (fn) != TREE_CODE (method))
1014 /* [over.load] Member function declarations with the
1015 same name and the same parameter types cannot be
1016 overloaded if any of them is a static member
1017 function declaration.
1019 [namespace.udecl] When a using-declaration brings names
1020 from a base class into a derived class scope, member
1021 functions in the derived class override and/or hide member
1022 functions with the same name and parameter types in a base
1023 class (rather than conflicting). */
1024 fn_type = TREE_TYPE (fn);
1025 method_type = TREE_TYPE (method);
1026 parms1 = TYPE_ARG_TYPES (fn_type);
1027 parms2 = TYPE_ARG_TYPES (method_type);
1029 /* Compare the quals on the 'this' parm. Don't compare
1030 the whole types, as used functions are treated as
1031 coming from the using class in overload resolution. */
1032 if (! DECL_STATIC_FUNCTION_P (fn)
1033 && ! DECL_STATIC_FUNCTION_P (method)
1034 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1)))
1035 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2)))))
1038 /* For templates, the return type and template parameters
1039 must be identical. */
1040 if (TREE_CODE (fn) == TEMPLATE_DECL
1041 && (!same_type_p (TREE_TYPE (fn_type),
1042 TREE_TYPE (method_type))
1043 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
1044 DECL_TEMPLATE_PARMS (method))))
1047 if (! DECL_STATIC_FUNCTION_P (fn))
1048 parms1 = TREE_CHAIN (parms1);
1049 if (! DECL_STATIC_FUNCTION_P (method))
1050 parms2 = TREE_CHAIN (parms2);
1052 if (compparms (parms1, parms2)
1053 && (!DECL_CONV_FN_P (fn)
1054 || same_type_p (TREE_TYPE (fn_type),
1055 TREE_TYPE (method_type))))
1059 if (DECL_CONTEXT (fn) == type)
1060 /* Defer to the local function. */
1062 if (DECL_CONTEXT (fn) == DECL_CONTEXT (method))
1063 error ("repeated using declaration %q+D", using_decl);
1065 error ("using declaration %q+D conflicts with a previous using declaration",
1070 error ("%q+#D cannot be overloaded", method);
1071 error ("with %q+#D", fn);
1074 /* We don't call duplicate_decls here to merge the
1075 declarations because that will confuse things if the
1076 methods have inline definitions. In particular, we
1077 will crash while processing the definitions. */
1082 /* A class should never have more than one destructor. */
1083 if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
1086 /* Add the new binding. */
1087 overload = build_overload (method, current_fns);
1090 TYPE_HAS_CONVERSION (type) = 1;
1091 else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p)
1092 push_class_level_binding (DECL_NAME (method), overload);
1098 /* We only expect to add few methods in the COMPLETE_P case, so
1099 just make room for one more method in that case. */
1101 reallocated = VEC_reserve_exact (tree, gc, method_vec, 1);
1103 reallocated = VEC_reserve (tree, gc, method_vec, 1);
1105 CLASSTYPE_METHOD_VEC (type) = method_vec;
1106 if (slot == VEC_length (tree, method_vec))
1107 VEC_quick_push (tree, method_vec, overload);
1109 VEC_quick_insert (tree, method_vec, slot, overload);
1112 /* Replace the current slot. */
1113 VEC_replace (tree, method_vec, slot, overload);
1117 /* Subroutines of finish_struct. */
1119 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1120 legit, otherwise return 0. */
1123 alter_access (tree t, tree fdecl, tree access)
1127 if (!DECL_LANG_SPECIFIC (fdecl))
1128 retrofit_lang_decl (fdecl);
1130 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl));
1132 elem = purpose_member (t, DECL_ACCESS (fdecl));
1135 if (TREE_VALUE (elem) != access)
1137 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1138 error ("conflicting access specifications for method"
1139 " %q+D, ignored", TREE_TYPE (fdecl));
1141 error ("conflicting access specifications for field %qE, ignored",
1146 /* They're changing the access to the same thing they changed
1147 it to before. That's OK. */
1153 perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl);
1154 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1160 /* Process the USING_DECL, which is a member of T. */
1163 handle_using_decl (tree using_decl, tree t)
1165 tree decl = USING_DECL_DECLS (using_decl);
1166 tree name = DECL_NAME (using_decl);
1168 = TREE_PRIVATE (using_decl) ? access_private_node
1169 : TREE_PROTECTED (using_decl) ? access_protected_node
1170 : access_public_node;
1171 tree flist = NULL_TREE;
1174 gcc_assert (!processing_template_decl && decl);
1176 old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false);
1179 if (is_overloaded_fn (old_value))
1180 old_value = OVL_CURRENT (old_value);
1182 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1185 old_value = NULL_TREE;
1188 cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl));
1190 if (is_overloaded_fn (decl))
1195 else if (is_overloaded_fn (old_value))
1198 /* It's OK to use functions from a base when there are functions with
1199 the same name already present in the current class. */;
1202 error ("%q+D invalid in %q#T", using_decl, t);
1203 error (" because of local method %q+#D with same name",
1204 OVL_CURRENT (old_value));
1208 else if (!DECL_ARTIFICIAL (old_value))
1210 error ("%q+D invalid in %q#T", using_decl, t);
1211 error (" because of local member %q+#D with same name", old_value);
1215 /* Make type T see field decl FDECL with access ACCESS. */
1217 for (; flist; flist = OVL_NEXT (flist))
1219 add_method (t, OVL_CURRENT (flist), using_decl);
1220 alter_access (t, OVL_CURRENT (flist), access);
1223 alter_access (t, decl, access);
1226 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1227 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1228 properties of the bases. */
1231 check_bases (tree t,
1232 int* cant_have_const_ctor_p,
1233 int* no_const_asn_ref_p)
1236 int seen_non_virtual_nearly_empty_base_p;
1240 seen_non_virtual_nearly_empty_base_p = 0;
1242 for (binfo = TYPE_BINFO (t), i = 0;
1243 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1245 tree basetype = TREE_TYPE (base_binfo);
1247 gcc_assert (COMPLETE_TYPE_P (basetype));
1249 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1250 here because the case of virtual functions but non-virtual
1251 dtor is handled in finish_struct_1. */
1252 if (!TYPE_POLYMORPHIC_P (basetype))
1253 warning (OPT_Weffc__,
1254 "base class %q#T has a non-virtual destructor", basetype);
1256 /* If the base class doesn't have copy constructors or
1257 assignment operators that take const references, then the
1258 derived class cannot have such a member automatically
1260 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1261 *cant_have_const_ctor_p = 1;
1262 if (TYPE_HAS_ASSIGN_REF (basetype)
1263 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1264 *no_const_asn_ref_p = 1;
1266 if (BINFO_VIRTUAL_P (base_binfo))
1267 /* A virtual base does not effect nearly emptiness. */
1269 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1271 if (seen_non_virtual_nearly_empty_base_p)
1272 /* And if there is more than one nearly empty base, then the
1273 derived class is not nearly empty either. */
1274 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1276 /* Remember we've seen one. */
1277 seen_non_virtual_nearly_empty_base_p = 1;
1279 else if (!is_empty_class (basetype))
1280 /* If the base class is not empty or nearly empty, then this
1281 class cannot be nearly empty. */
1282 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1284 /* A lot of properties from the bases also apply to the derived
1286 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1287 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1288 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1289 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1290 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1291 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1292 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1293 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1294 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1295 TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_HAS_COMPLEX_DFLT (basetype);
1299 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1300 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1301 that have had a nearly-empty virtual primary base stolen by some
1302 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1306 determine_primary_bases (tree t)
1309 tree primary = NULL_TREE;
1310 tree type_binfo = TYPE_BINFO (t);
1313 /* Determine the primary bases of our bases. */
1314 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1315 base_binfo = TREE_CHAIN (base_binfo))
1317 tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo));
1319 /* See if we're the non-virtual primary of our inheritance
1321 if (!BINFO_VIRTUAL_P (base_binfo))
1323 tree parent = BINFO_INHERITANCE_CHAIN (base_binfo);
1324 tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent));
1327 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
1328 BINFO_TYPE (parent_primary)))
1329 /* We are the primary binfo. */
1330 BINFO_PRIMARY_P (base_binfo) = 1;
1332 /* Determine if we have a virtual primary base, and mark it so.
1334 if (primary && BINFO_VIRTUAL_P (primary))
1336 tree this_primary = copied_binfo (primary, base_binfo);
1338 if (BINFO_PRIMARY_P (this_primary))
1339 /* Someone already claimed this base. */
1340 BINFO_LOST_PRIMARY_P (base_binfo) = 1;
1345 BINFO_PRIMARY_P (this_primary) = 1;
1346 BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo;
1348 /* A virtual binfo might have been copied from within
1349 another hierarchy. As we're about to use it as a
1350 primary base, make sure the offsets match. */
1351 delta = size_diffop (convert (ssizetype,
1352 BINFO_OFFSET (base_binfo)),
1354 BINFO_OFFSET (this_primary)));
1356 propagate_binfo_offsets (this_primary, delta);
1361 /* First look for a dynamic direct non-virtual base. */
1362 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++)
1364 tree basetype = BINFO_TYPE (base_binfo);
1366 if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo))
1368 primary = base_binfo;
1373 /* A "nearly-empty" virtual base class can be the primary base
1374 class, if no non-virtual polymorphic base can be found. Look for
1375 a nearly-empty virtual dynamic base that is not already a primary
1376 base of something in the hierarchy. If there is no such base,
1377 just pick the first nearly-empty virtual base. */
1379 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1380 base_binfo = TREE_CHAIN (base_binfo))
1381 if (BINFO_VIRTUAL_P (base_binfo)
1382 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo)))
1384 if (!BINFO_PRIMARY_P (base_binfo))
1386 /* Found one that is not primary. */
1387 primary = base_binfo;
1391 /* Remember the first candidate. */
1392 primary = base_binfo;
1396 /* If we've got a primary base, use it. */
1399 tree basetype = BINFO_TYPE (primary);
1401 CLASSTYPE_PRIMARY_BINFO (t) = primary;
1402 if (BINFO_PRIMARY_P (primary))
1403 /* We are stealing a primary base. */
1404 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1;
1405 BINFO_PRIMARY_P (primary) = 1;
1406 if (BINFO_VIRTUAL_P (primary))
1410 BINFO_INHERITANCE_CHAIN (primary) = type_binfo;
1411 /* A virtual binfo might have been copied from within
1412 another hierarchy. As we're about to use it as a primary
1413 base, make sure the offsets match. */
1414 delta = size_diffop (ssize_int (0),
1415 convert (ssizetype, BINFO_OFFSET (primary)));
1417 propagate_binfo_offsets (primary, delta);
1420 primary = TYPE_BINFO (basetype);
1422 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1423 BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary);
1424 BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary);
1428 /* Set memoizing fields and bits of T (and its variants) for later
1432 finish_struct_bits (tree t)
1436 /* Fix up variants (if any). */
1437 for (variants = TYPE_NEXT_VARIANT (t);
1439 variants = TYPE_NEXT_VARIANT (variants))
1441 /* These fields are in the _TYPE part of the node, not in
1442 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1443 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1444 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1445 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1446 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1448 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1450 TYPE_BINFO (variants) = TYPE_BINFO (t);
1452 /* Copy whatever these are holding today. */
1453 TYPE_VFIELD (variants) = TYPE_VFIELD (t);
1454 TYPE_METHODS (variants) = TYPE_METHODS (t);
1455 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1458 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t))
1459 /* For a class w/o baseclasses, 'finish_struct' has set
1460 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1461 Similarly for a class whose base classes do not have vtables.
1462 When neither of these is true, we might have removed abstract
1463 virtuals (by providing a definition), added some (by declaring
1464 new ones), or redeclared ones from a base class. We need to
1465 recalculate what's really an abstract virtual at this point (by
1466 looking in the vtables). */
1467 get_pure_virtuals (t);
1469 /* If this type has a copy constructor or a destructor, force its
1470 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1471 nonzero. This will cause it to be passed by invisible reference
1472 and prevent it from being returned in a register. */
1473 if (! TYPE_HAS_TRIVIAL_INIT_REF (t) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1476 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1477 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1479 TYPE_MODE (variants) = BLKmode;
1480 TREE_ADDRESSABLE (variants) = 1;
1485 /* Issue warnings about T having private constructors, but no friends,
1488 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1489 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1490 non-private static member functions. */
1493 maybe_warn_about_overly_private_class (tree t)
1495 int has_member_fn = 0;
1496 int has_nonprivate_method = 0;
1499 if (!warn_ctor_dtor_privacy
1500 /* If the class has friends, those entities might create and
1501 access instances, so we should not warn. */
1502 || (CLASSTYPE_FRIEND_CLASSES (t)
1503 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1504 /* We will have warned when the template was declared; there's
1505 no need to warn on every instantiation. */
1506 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1507 /* There's no reason to even consider warning about this
1511 /* We only issue one warning, if more than one applies, because
1512 otherwise, on code like:
1515 // Oops - forgot `public:'
1521 we warn several times about essentially the same problem. */
1523 /* Check to see if all (non-constructor, non-destructor) member
1524 functions are private. (Since there are no friends or
1525 non-private statics, we can't ever call any of the private member
1527 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1528 /* We're not interested in compiler-generated methods; they don't
1529 provide any way to call private members. */
1530 if (!DECL_ARTIFICIAL (fn))
1532 if (!TREE_PRIVATE (fn))
1534 if (DECL_STATIC_FUNCTION_P (fn))
1535 /* A non-private static member function is just like a
1536 friend; it can create and invoke private member
1537 functions, and be accessed without a class
1541 has_nonprivate_method = 1;
1542 /* Keep searching for a static member function. */
1544 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1548 if (!has_nonprivate_method && has_member_fn)
1550 /* There are no non-private methods, and there's at least one
1551 private member function that isn't a constructor or
1552 destructor. (If all the private members are
1553 constructors/destructors we want to use the code below that
1554 issues error messages specifically referring to
1555 constructors/destructors.) */
1557 tree binfo = TYPE_BINFO (t);
1559 for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++)
1560 if (BINFO_BASE_ACCESS (binfo, i) != access_private_node)
1562 has_nonprivate_method = 1;
1565 if (!has_nonprivate_method)
1567 warning (OPT_Wctor_dtor_privacy,
1568 "all member functions in class %qT are private", t);
1573 /* Even if some of the member functions are non-private, the class
1574 won't be useful for much if all the constructors or destructors
1575 are private: such an object can never be created or destroyed. */
1576 fn = CLASSTYPE_DESTRUCTORS (t);
1577 if (fn && TREE_PRIVATE (fn))
1579 warning (OPT_Wctor_dtor_privacy,
1580 "%q#T only defines a private destructor and has no friends",
1585 if (TYPE_HAS_CONSTRUCTOR (t)
1586 /* Implicitly generated constructors are always public. */
1587 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t)
1588 || !CLASSTYPE_LAZY_COPY_CTOR (t)))
1590 int nonprivate_ctor = 0;
1592 /* If a non-template class does not define a copy
1593 constructor, one is defined for it, enabling it to avoid
1594 this warning. For a template class, this does not
1595 happen, and so we would normally get a warning on:
1597 template <class T> class C { private: C(); };
1599 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1600 complete non-template or fully instantiated classes have this
1602 if (!TYPE_HAS_INIT_REF (t))
1603 nonprivate_ctor = 1;
1605 for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn))
1607 tree ctor = OVL_CURRENT (fn);
1608 /* Ideally, we wouldn't count copy constructors (or, in
1609 fact, any constructor that takes an argument of the
1610 class type as a parameter) because such things cannot
1611 be used to construct an instance of the class unless
1612 you already have one. But, for now at least, we're
1614 if (! TREE_PRIVATE (ctor))
1616 nonprivate_ctor = 1;
1621 if (nonprivate_ctor == 0)
1623 warning (OPT_Wctor_dtor_privacy,
1624 "%q#T only defines private constructors and has no friends",
1632 gt_pointer_operator new_value;
1636 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1639 method_name_cmp (const void* m1_p, const void* m2_p)
1641 const tree *const m1 = (const tree *) m1_p;
1642 const tree *const m2 = (const tree *) m2_p;
1644 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1646 if (*m1 == NULL_TREE)
1648 if (*m2 == NULL_TREE)
1650 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1655 /* This routine compares two fields like method_name_cmp but using the
1656 pointer operator in resort_field_decl_data. */
1659 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1661 const tree *const m1 = (const tree *) m1_p;
1662 const tree *const m2 = (const tree *) m2_p;
1663 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1665 if (*m1 == NULL_TREE)
1667 if (*m2 == NULL_TREE)
1670 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1671 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1672 resort_data.new_value (&d1, resort_data.cookie);
1673 resort_data.new_value (&d2, resort_data.cookie);
1680 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1683 resort_type_method_vec (void* obj,
1684 void* orig_obj ATTRIBUTE_UNUSED ,
1685 gt_pointer_operator new_value,
1688 VEC(tree,gc) *method_vec = (VEC(tree,gc) *) obj;
1689 int len = VEC_length (tree, method_vec);
1693 /* The type conversion ops have to live at the front of the vec, so we
1695 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1696 VEC_iterate (tree, method_vec, slot, fn);
1698 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1703 resort_data.new_value = new_value;
1704 resort_data.cookie = cookie;
1705 qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree),
1706 resort_method_name_cmp);
1710 /* Warn about duplicate methods in fn_fields.
1712 Sort methods that are not special (i.e., constructors, destructors,
1713 and type conversion operators) so that we can find them faster in
1717 finish_struct_methods (tree t)
1720 VEC(tree,gc) *method_vec;
1723 method_vec = CLASSTYPE_METHOD_VEC (t);
1727 len = VEC_length (tree, method_vec);
1729 /* Clear DECL_IN_AGGR_P for all functions. */
1730 for (fn_fields = TYPE_METHODS (t); fn_fields;
1731 fn_fields = TREE_CHAIN (fn_fields))
1732 DECL_IN_AGGR_P (fn_fields) = 0;
1734 /* Issue warnings about private constructors and such. If there are
1735 no methods, then some public defaults are generated. */
1736 maybe_warn_about_overly_private_class (t);
1738 /* The type conversion ops have to live at the front of the vec, so we
1740 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1741 VEC_iterate (tree, method_vec, slot, fn_fields);
1743 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields)))
1746 qsort (VEC_address (tree, method_vec) + slot,
1747 len-slot, sizeof (tree), method_name_cmp);
1750 /* Make BINFO's vtable have N entries, including RTTI entries,
1751 vbase and vcall offsets, etc. Set its type and call the back end
1755 layout_vtable_decl (tree binfo, int n)
1760 atype = build_cplus_array_type (vtable_entry_type,
1761 build_index_type (size_int (n - 1)));
1762 layout_type (atype);
1764 /* We may have to grow the vtable. */
1765 vtable = get_vtbl_decl_for_binfo (binfo);
1766 if (!same_type_p (TREE_TYPE (vtable), atype))
1768 TREE_TYPE (vtable) = atype;
1769 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
1770 layout_decl (vtable, 0);
1774 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1775 have the same signature. */
1778 same_signature_p (tree fndecl, tree base_fndecl)
1780 /* One destructor overrides another if they are the same kind of
1782 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
1783 && special_function_p (base_fndecl) == special_function_p (fndecl))
1785 /* But a non-destructor never overrides a destructor, nor vice
1786 versa, nor do different kinds of destructors override
1787 one-another. For example, a complete object destructor does not
1788 override a deleting destructor. */
1789 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
1792 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
1793 || (DECL_CONV_FN_P (fndecl)
1794 && DECL_CONV_FN_P (base_fndecl)
1795 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
1796 DECL_CONV_FN_TYPE (base_fndecl))))
1798 tree types, base_types;
1799 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1800 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
1801 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
1802 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
1803 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
1809 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1813 base_derived_from (tree derived, tree base)
1817 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1819 if (probe == derived)
1821 else if (BINFO_VIRTUAL_P (probe))
1822 /* If we meet a virtual base, we can't follow the inheritance
1823 any more. See if the complete type of DERIVED contains
1824 such a virtual base. */
1825 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived))
1831 typedef struct find_final_overrider_data_s {
1832 /* The function for which we are trying to find a final overrider. */
1834 /* The base class in which the function was declared. */
1835 tree declaring_base;
1836 /* The candidate overriders. */
1838 /* Path to most derived. */
1839 VEC(tree,heap) *path;
1840 } find_final_overrider_data;
1842 /* Add the overrider along the current path to FFOD->CANDIDATES.
1843 Returns true if an overrider was found; false otherwise. */
1846 dfs_find_final_overrider_1 (tree binfo,
1847 find_final_overrider_data *ffod,
1852 /* If BINFO is not the most derived type, try a more derived class.
1853 A definition there will overrider a definition here. */
1857 if (dfs_find_final_overrider_1
1858 (VEC_index (tree, ffod->path, depth), ffod, depth))
1862 method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn);
1865 tree *candidate = &ffod->candidates;
1867 /* Remove any candidates overridden by this new function. */
1870 /* If *CANDIDATE overrides METHOD, then METHOD
1871 cannot override anything else on the list. */
1872 if (base_derived_from (TREE_VALUE (*candidate), binfo))
1874 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1875 if (base_derived_from (binfo, TREE_VALUE (*candidate)))
1876 *candidate = TREE_CHAIN (*candidate);
1878 candidate = &TREE_CHAIN (*candidate);
1881 /* Add the new function. */
1882 ffod->candidates = tree_cons (method, binfo, ffod->candidates);
1889 /* Called from find_final_overrider via dfs_walk. */
1892 dfs_find_final_overrider_pre (tree binfo, void *data)
1894 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1896 if (binfo == ffod->declaring_base)
1897 dfs_find_final_overrider_1 (binfo, ffod, VEC_length (tree, ffod->path));
1898 VEC_safe_push (tree, heap, ffod->path, binfo);
1904 dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED, void *data)
1906 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1907 VEC_pop (tree, ffod->path);
1912 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1913 FN and whose TREE_VALUE is the binfo for the base where the
1914 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1915 DERIVED) is the base object in which FN is declared. */
1918 find_final_overrider (tree derived, tree binfo, tree fn)
1920 find_final_overrider_data ffod;
1922 /* Getting this right is a little tricky. This is valid:
1924 struct S { virtual void f (); };
1925 struct T { virtual void f (); };
1926 struct U : public S, public T { };
1928 even though calling `f' in `U' is ambiguous. But,
1930 struct R { virtual void f(); };
1931 struct S : virtual public R { virtual void f (); };
1932 struct T : virtual public R { virtual void f (); };
1933 struct U : public S, public T { };
1935 is not -- there's no way to decide whether to put `S::f' or
1936 `T::f' in the vtable for `R'.
1938 The solution is to look at all paths to BINFO. If we find
1939 different overriders along any two, then there is a problem. */
1940 if (DECL_THUNK_P (fn))
1941 fn = THUNK_TARGET (fn);
1943 /* Determine the depth of the hierarchy. */
1945 ffod.declaring_base = binfo;
1946 ffod.candidates = NULL_TREE;
1947 ffod.path = VEC_alloc (tree, heap, 30);
1949 dfs_walk_all (derived, dfs_find_final_overrider_pre,
1950 dfs_find_final_overrider_post, &ffod);
1952 VEC_free (tree, heap, ffod.path);
1954 /* If there was no winner, issue an error message. */
1955 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
1956 return error_mark_node;
1958 return ffod.candidates;
1961 /* Return the index of the vcall offset for FN when TYPE is used as a
1965 get_vcall_index (tree fn, tree type)
1967 VEC(tree_pair_s,gc) *indices = CLASSTYPE_VCALL_INDICES (type);
1971 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++)
1972 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose))
1973 || same_signature_p (fn, p->purpose))
1976 /* There should always be an appropriate index. */
1980 /* Update an entry in the vtable for BINFO, which is in the hierarchy
1981 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
1982 corresponding position in the BINFO_VIRTUALS list. */
1985 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
1993 tree overrider_fn, overrider_target;
1994 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
1995 tree over_return, base_return;
1998 /* Find the nearest primary base (possibly binfo itself) which defines
1999 this function; this is the class the caller will convert to when
2000 calling FN through BINFO. */
2001 for (b = binfo; ; b = get_primary_binfo (b))
2004 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
2007 /* The nearest definition is from a lost primary. */
2008 if (BINFO_LOST_PRIMARY_P (b))
2013 /* Find the final overrider. */
2014 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
2015 if (overrider == error_mark_node)
2017 error ("no unique final overrider for %qD in %qT", target_fn, t);
2020 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
2022 /* Check for adjusting covariant return types. */
2023 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
2024 base_return = TREE_TYPE (TREE_TYPE (target_fn));
2026 if (POINTER_TYPE_P (over_return)
2027 && TREE_CODE (over_return) == TREE_CODE (base_return)
2028 && CLASS_TYPE_P (TREE_TYPE (over_return))
2029 && CLASS_TYPE_P (TREE_TYPE (base_return))
2030 /* If the overrider is invalid, don't even try. */
2031 && !DECL_INVALID_OVERRIDER_P (overrider_target))
2033 /* If FN is a covariant thunk, we must figure out the adjustment
2034 to the final base FN was converting to. As OVERRIDER_TARGET might
2035 also be converting to the return type of FN, we have to
2036 combine the two conversions here. */
2037 tree fixed_offset, virtual_offset;
2039 over_return = TREE_TYPE (over_return);
2040 base_return = TREE_TYPE (base_return);
2042 if (DECL_THUNK_P (fn))
2044 gcc_assert (DECL_RESULT_THUNK_P (fn));
2045 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
2046 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2049 fixed_offset = virtual_offset = NULL_TREE;
2052 /* Find the equivalent binfo within the return type of the
2053 overriding function. We will want the vbase offset from
2055 virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset),
2057 else if (!same_type_ignoring_top_level_qualifiers_p
2058 (over_return, base_return))
2060 /* There was no existing virtual thunk (which takes
2061 precedence). So find the binfo of the base function's
2062 return type within the overriding function's return type.
2063 We cannot call lookup base here, because we're inside a
2064 dfs_walk, and will therefore clobber the BINFO_MARKED
2065 flags. Fortunately we know the covariancy is valid (it
2066 has already been checked), so we can just iterate along
2067 the binfos, which have been chained in inheritance graph
2068 order. Of course it is lame that we have to repeat the
2069 search here anyway -- we should really be caching pieces
2070 of the vtable and avoiding this repeated work. */
2071 tree thunk_binfo, base_binfo;
2073 /* Find the base binfo within the overriding function's
2074 return type. We will always find a thunk_binfo, except
2075 when the covariancy is invalid (which we will have
2076 already diagnosed). */
2077 for (base_binfo = TYPE_BINFO (base_return),
2078 thunk_binfo = TYPE_BINFO (over_return);
2080 thunk_binfo = TREE_CHAIN (thunk_binfo))
2081 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo),
2082 BINFO_TYPE (base_binfo)))
2085 /* See if virtual inheritance is involved. */
2086 for (virtual_offset = thunk_binfo;
2088 virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset))
2089 if (BINFO_VIRTUAL_P (virtual_offset))
2093 || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo)))
2095 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2099 /* We convert via virtual base. Adjust the fixed
2100 offset to be from there. */
2101 offset = size_diffop
2103 (ssizetype, BINFO_OFFSET (virtual_offset)));
2106 /* There was an existing fixed offset, this must be
2107 from the base just converted to, and the base the
2108 FN was thunking to. */
2109 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2111 fixed_offset = offset;
2115 if (fixed_offset || virtual_offset)
2116 /* Replace the overriding function with a covariant thunk. We
2117 will emit the overriding function in its own slot as
2119 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2120 fixed_offset, virtual_offset);
2123 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) ||
2124 !DECL_THUNK_P (fn));
2126 /* Assume that we will produce a thunk that convert all the way to
2127 the final overrider, and not to an intermediate virtual base. */
2128 virtual_base = NULL_TREE;
2130 /* See if we can convert to an intermediate virtual base first, and then
2131 use the vcall offset located there to finish the conversion. */
2132 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2134 /* If we find the final overrider, then we can stop
2136 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b),
2137 BINFO_TYPE (TREE_VALUE (overrider))))
2140 /* If we find a virtual base, and we haven't yet found the
2141 overrider, then there is a virtual base between the
2142 declaring base (first_defn) and the final overrider. */
2143 if (BINFO_VIRTUAL_P (b))
2150 if (overrider_fn != overrider_target && !virtual_base)
2152 /* The ABI specifies that a covariant thunk includes a mangling
2153 for a this pointer adjustment. This-adjusting thunks that
2154 override a function from a virtual base have a vcall
2155 adjustment. When the virtual base in question is a primary
2156 virtual base, we know the adjustments are zero, (and in the
2157 non-covariant case, we would not use the thunk).
2158 Unfortunately we didn't notice this could happen, when
2159 designing the ABI and so never mandated that such a covariant
2160 thunk should be emitted. Because we must use the ABI mandated
2161 name, we must continue searching from the binfo where we
2162 found the most recent definition of the function, towards the
2163 primary binfo which first introduced the function into the
2164 vtable. If that enters a virtual base, we must use a vcall
2165 this-adjusting thunk. Bleah! */
2166 tree probe = first_defn;
2168 while ((probe = get_primary_binfo (probe))
2169 && (unsigned) list_length (BINFO_VIRTUALS (probe)) > ix)
2170 if (BINFO_VIRTUAL_P (probe))
2171 virtual_base = probe;
2174 /* Even if we find a virtual base, the correct delta is
2175 between the overrider and the binfo we're building a vtable
2177 goto virtual_covariant;
2180 /* Compute the constant adjustment to the `this' pointer. The
2181 `this' pointer, when this function is called, will point at BINFO
2182 (or one of its primary bases, which are at the same offset). */
2184 /* The `this' pointer needs to be adjusted from the declaration to
2185 the nearest virtual base. */
2186 delta = size_diffop (convert (ssizetype, BINFO_OFFSET (virtual_base)),
2187 convert (ssizetype, BINFO_OFFSET (first_defn)));
2189 /* If the nearest definition is in a lost primary, we don't need an
2190 entry in our vtable. Except possibly in a constructor vtable,
2191 if we happen to get our primary back. In that case, the offset
2192 will be zero, as it will be a primary base. */
2193 delta = size_zero_node;
2195 /* The `this' pointer needs to be adjusted from pointing to
2196 BINFO to pointing at the base where the final overrider
2199 delta = size_diffop (convert (ssizetype,
2200 BINFO_OFFSET (TREE_VALUE (overrider))),
2201 convert (ssizetype, BINFO_OFFSET (binfo)));
2203 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2206 BV_VCALL_INDEX (*virtuals)
2207 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2209 BV_VCALL_INDEX (*virtuals) = NULL_TREE;
2212 /* Called from modify_all_vtables via dfs_walk. */
2215 dfs_modify_vtables (tree binfo, void* data)
2217 tree t = (tree) data;
2222 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2223 /* A base without a vtable needs no modification, and its bases
2224 are uninteresting. */
2225 return dfs_skip_bases;
2227 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)
2228 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
2229 /* Don't do the primary vtable, if it's new. */
2232 if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo))
2233 /* There's no need to modify the vtable for a non-virtual primary
2234 base; we're not going to use that vtable anyhow. We do still
2235 need to do this for virtual primary bases, as they could become
2236 non-primary in a construction vtable. */
2239 make_new_vtable (t, binfo);
2241 /* Now, go through each of the virtual functions in the virtual
2242 function table for BINFO. Find the final overrider, and update
2243 the BINFO_VIRTUALS list appropriately. */
2244 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2245 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2247 ix++, virtuals = TREE_CHAIN (virtuals),
2248 old_virtuals = TREE_CHAIN (old_virtuals))
2249 update_vtable_entry_for_fn (t,
2251 BV_FN (old_virtuals),
2257 /* Update all of the primary and secondary vtables for T. Create new
2258 vtables as required, and initialize their RTTI information. Each
2259 of the functions in VIRTUALS is declared in T and may override a
2260 virtual function from a base class; find and modify the appropriate
2261 entries to point to the overriding functions. Returns a list, in
2262 declaration order, of the virtual functions that are declared in T,
2263 but do not appear in the primary base class vtable, and which
2264 should therefore be appended to the end of the vtable for T. */
2267 modify_all_vtables (tree t, tree virtuals)
2269 tree binfo = TYPE_BINFO (t);
2272 /* Update all of the vtables. */
2273 dfs_walk_once (binfo, dfs_modify_vtables, NULL, t);
2275 /* Add virtual functions not already in our primary vtable. These
2276 will be both those introduced by this class, and those overridden
2277 from secondary bases. It does not include virtuals merely
2278 inherited from secondary bases. */
2279 for (fnsp = &virtuals; *fnsp; )
2281 tree fn = TREE_VALUE (*fnsp);
2283 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2284 || DECL_VINDEX (fn) == error_mark_node)
2286 /* We don't need to adjust the `this' pointer when
2287 calling this function. */
2288 BV_DELTA (*fnsp) = integer_zero_node;
2289 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2291 /* This is a function not already in our vtable. Keep it. */
2292 fnsp = &TREE_CHAIN (*fnsp);
2295 /* We've already got an entry for this function. Skip it. */
2296 *fnsp = TREE_CHAIN (*fnsp);
2302 /* Get the base virtual function declarations in T that have the
2306 get_basefndecls (tree name, tree t)
2309 tree base_fndecls = NULL_TREE;
2310 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
2313 /* Find virtual functions in T with the indicated NAME. */
2314 i = lookup_fnfields_1 (t, name);
2316 for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i);
2318 methods = OVL_NEXT (methods))
2320 tree method = OVL_CURRENT (methods);
2322 if (TREE_CODE (method) == FUNCTION_DECL
2323 && DECL_VINDEX (method))
2324 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2328 return base_fndecls;
2330 for (i = 0; i < n_baseclasses; i++)
2332 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i));
2333 base_fndecls = chainon (get_basefndecls (name, basetype),
2337 return base_fndecls;
2340 /* If this declaration supersedes the declaration of
2341 a method declared virtual in the base class, then
2342 mark this field as being virtual as well. */
2345 check_for_override (tree decl, tree ctype)
2347 if (TREE_CODE (decl) == TEMPLATE_DECL)
2348 /* In [temp.mem] we have:
2350 A specialization of a member function template does not
2351 override a virtual function from a base class. */
2353 if ((DECL_DESTRUCTOR_P (decl)
2354 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2355 || DECL_CONV_FN_P (decl))
2356 && look_for_overrides (ctype, decl)
2357 && !DECL_STATIC_FUNCTION_P (decl))
2358 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2359 the error_mark_node so that we know it is an overriding
2361 DECL_VINDEX (decl) = decl;
2363 if (DECL_VIRTUAL_P (decl))
2365 if (!DECL_VINDEX (decl))
2366 DECL_VINDEX (decl) = error_mark_node;
2367 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2371 /* Warn about hidden virtual functions that are not overridden in t.
2372 We know that constructors and destructors don't apply. */
2375 warn_hidden (tree t)
2377 VEC(tree,gc) *method_vec = CLASSTYPE_METHOD_VEC (t);
2381 /* We go through each separately named virtual function. */
2382 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2383 VEC_iterate (tree, method_vec, i, fns);
2394 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2395 have the same name. Figure out what name that is. */
2396 name = DECL_NAME (OVL_CURRENT (fns));
2397 /* There are no possibly hidden functions yet. */
2398 base_fndecls = NULL_TREE;
2399 /* Iterate through all of the base classes looking for possibly
2400 hidden functions. */
2401 for (binfo = TYPE_BINFO (t), j = 0;
2402 BINFO_BASE_ITERATE (binfo, j, base_binfo); j++)
2404 tree basetype = BINFO_TYPE (base_binfo);
2405 base_fndecls = chainon (get_basefndecls (name, basetype),
2409 /* If there are no functions to hide, continue. */
2413 /* Remove any overridden functions. */
2414 for (fn = fns; fn; fn = OVL_NEXT (fn))
2416 fndecl = OVL_CURRENT (fn);
2417 if (DECL_VINDEX (fndecl))
2419 tree *prev = &base_fndecls;
2422 /* If the method from the base class has the same
2423 signature as the method from the derived class, it
2424 has been overridden. */
2425 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2426 *prev = TREE_CHAIN (*prev);
2428 prev = &TREE_CHAIN (*prev);
2432 /* Now give a warning for all base functions without overriders,
2433 as they are hidden. */
2434 while (base_fndecls)
2436 /* Here we know it is a hider, and no overrider exists. */
2437 warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls));
2438 warning (OPT_Woverloaded_virtual, " by %q+D", fns);
2439 base_fndecls = TREE_CHAIN (base_fndecls);
2444 /* Check for things that are invalid. There are probably plenty of other
2445 things we should check for also. */
2448 finish_struct_anon (tree t)
2452 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2454 if (TREE_STATIC (field))
2456 if (TREE_CODE (field) != FIELD_DECL)
2459 if (DECL_NAME (field) == NULL_TREE
2460 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2462 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2463 for (; elt; elt = TREE_CHAIN (elt))
2465 /* We're generally only interested in entities the user
2466 declared, but we also find nested classes by noticing
2467 the TYPE_DECL that we create implicitly. You're
2468 allowed to put one anonymous union inside another,
2469 though, so we explicitly tolerate that. We use
2470 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2471 we also allow unnamed types used for defining fields. */
2472 if (DECL_ARTIFICIAL (elt)
2473 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2474 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2477 if (TREE_CODE (elt) != FIELD_DECL)
2479 pedwarn ("%q+#D invalid; an anonymous union can "
2480 "only have non-static data members", elt);
2484 if (TREE_PRIVATE (elt))
2485 pedwarn ("private member %q+#D in anonymous union", elt);
2486 else if (TREE_PROTECTED (elt))
2487 pedwarn ("protected member %q+#D in anonymous union", elt);
2489 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2490 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2496 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2497 will be used later during class template instantiation.
2498 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2499 a non-static member data (FIELD_DECL), a member function
2500 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2501 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2502 When FRIEND_P is nonzero, T is either a friend class
2503 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2504 (FUNCTION_DECL, TEMPLATE_DECL). */
2507 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2509 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2510 if (CLASSTYPE_TEMPLATE_INFO (type))
2511 CLASSTYPE_DECL_LIST (type)
2512 = tree_cons (friend_p ? NULL_TREE : type,
2513 t, CLASSTYPE_DECL_LIST (type));
2516 /* Create default constructors, assignment operators, and so forth for
2517 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2518 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2519 the class cannot have a default constructor, copy constructor
2520 taking a const reference argument, or an assignment operator taking
2521 a const reference, respectively. */
2524 add_implicitly_declared_members (tree t,
2525 int cant_have_const_cctor,
2526 int cant_have_const_assignment)
2529 if (!CLASSTYPE_DESTRUCTORS (t))
2531 /* In general, we create destructors lazily. */
2532 CLASSTYPE_LAZY_DESTRUCTOR (t) = 1;
2533 /* However, if the implicit destructor is non-trivial
2534 destructor, we sometimes have to create it at this point. */
2535 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
2539 if (TYPE_FOR_JAVA (t))
2540 /* If this a Java class, any non-trivial destructor is
2541 invalid, even if compiler-generated. Therefore, if the
2542 destructor is non-trivial we create it now. */
2550 /* If the implicit destructor will be virtual, then we must
2551 generate it now because (unfortunately) we do not
2552 generate virtual tables lazily. */
2553 binfo = TYPE_BINFO (t);
2554 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2559 base_type = BINFO_TYPE (base_binfo);
2560 dtor = CLASSTYPE_DESTRUCTORS (base_type);
2561 if (dtor && DECL_VIRTUAL_P (dtor))
2569 /* If we can't get away with being lazy, generate the destructor
2572 lazily_declare_fn (sfk_destructor, t);
2576 /* Default constructor. */
2577 if (! TYPE_HAS_CONSTRUCTOR (t))
2579 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1;
2580 CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1;
2583 /* Copy constructor. */
2584 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
2586 TYPE_HAS_INIT_REF (t) = 1;
2587 TYPE_HAS_CONST_INIT_REF (t) = !cant_have_const_cctor;
2588 CLASSTYPE_LAZY_COPY_CTOR (t) = 1;
2589 TYPE_HAS_CONSTRUCTOR (t) = 1;
2592 /* If there is no assignment operator, one will be created if and
2593 when it is needed. For now, just record whether or not the type
2594 of the parameter to the assignment operator will be a const or
2595 non-const reference. */
2596 if (!TYPE_HAS_ASSIGN_REF (t) && !TYPE_FOR_JAVA (t))
2598 TYPE_HAS_ASSIGN_REF (t) = 1;
2599 TYPE_HAS_CONST_ASSIGN_REF (t) = !cant_have_const_assignment;
2600 CLASSTYPE_LAZY_ASSIGNMENT_OP (t) = 1;
2604 /* Subroutine of finish_struct_1. Recursively count the number of fields
2605 in TYPE, including anonymous union members. */
2608 count_fields (tree fields)
2612 for (x = fields; x; x = TREE_CHAIN (x))
2614 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2615 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2622 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2623 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2626 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
2629 for (x = fields; x; x = TREE_CHAIN (x))
2631 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2632 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
2634 field_vec->elts[idx++] = x;
2639 /* FIELD is a bit-field. We are finishing the processing for its
2640 enclosing type. Issue any appropriate messages and set appropriate
2644 check_bitfield_decl (tree field)
2646 tree type = TREE_TYPE (field);
2649 /* Extract the declared width of the bitfield, which has been
2650 temporarily stashed in DECL_INITIAL. */
2651 w = DECL_INITIAL (field);
2652 gcc_assert (w != NULL_TREE);
2653 /* Remove the bit-field width indicator so that the rest of the
2654 compiler does not treat that value as an initializer. */
2655 DECL_INITIAL (field) = NULL_TREE;
2657 /* Detect invalid bit-field type. */
2658 if (!INTEGRAL_TYPE_P (type))
2660 error ("bit-field %q+#D with non-integral type", field);
2661 TREE_TYPE (field) = error_mark_node;
2662 w = error_mark_node;
2666 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2669 /* detect invalid field size. */
2670 w = integral_constant_value (w);
2672 if (TREE_CODE (w) != INTEGER_CST)
2674 error ("bit-field %q+D width not an integer constant", field);
2675 w = error_mark_node;
2677 else if (tree_int_cst_sgn (w) < 0)
2679 error ("negative width in bit-field %q+D", field);
2680 w = error_mark_node;
2682 else if (integer_zerop (w) && DECL_NAME (field) != 0)
2684 error ("zero width for bit-field %q+D", field);
2685 w = error_mark_node;
2687 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
2688 && TREE_CODE (type) != ENUMERAL_TYPE
2689 && TREE_CODE (type) != BOOLEAN_TYPE)
2690 warning (0, "width of %q+D exceeds its type", field);
2691 else if (TREE_CODE (type) == ENUMERAL_TYPE
2692 && (0 > compare_tree_int (w,
2693 min_precision (TYPE_MIN_VALUE (type),
2694 TYPE_UNSIGNED (type)))
2695 || 0 > compare_tree_int (w,
2697 (TYPE_MAX_VALUE (type),
2698 TYPE_UNSIGNED (type)))))
2699 warning (0, "%q+D is too small to hold all values of %q#T", field, type);
2702 if (w != error_mark_node)
2704 DECL_SIZE (field) = convert (bitsizetype, w);
2705 DECL_BIT_FIELD (field) = 1;
2709 /* Non-bit-fields are aligned for their type. */
2710 DECL_BIT_FIELD (field) = 0;
2711 CLEAR_DECL_C_BIT_FIELD (field);
2715 /* FIELD is a non bit-field. We are finishing the processing for its
2716 enclosing type T. Issue any appropriate messages and set appropriate
2720 check_field_decl (tree field,
2722 int* cant_have_const_ctor,
2723 int* no_const_asn_ref,
2724 int* any_default_members)
2726 tree type = strip_array_types (TREE_TYPE (field));
2728 /* An anonymous union cannot contain any fields which would change
2729 the settings of CANT_HAVE_CONST_CTOR and friends. */
2730 if (ANON_UNION_TYPE_P (type))
2732 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2733 structs. So, we recurse through their fields here. */
2734 else if (ANON_AGGR_TYPE_P (type))
2738 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2739 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
2740 check_field_decl (fields, t, cant_have_const_ctor,
2741 no_const_asn_ref, any_default_members);
2743 /* Check members with class type for constructors, destructors,
2745 else if (CLASS_TYPE_P (type))
2747 /* Never let anything with uninheritable virtuals
2748 make it through without complaint. */
2749 abstract_virtuals_error (field, type);
2751 if (TREE_CODE (t) == UNION_TYPE)
2753 if (TYPE_NEEDS_CONSTRUCTING (type))
2754 error ("member %q+#D with constructor not allowed in union",
2756 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
2757 error ("member %q+#D with destructor not allowed in union", field);
2758 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2759 error ("member %q+#D with copy assignment operator not allowed in union",
2764 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
2765 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2766 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
2767 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
2768 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
2769 TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_HAS_COMPLEX_DFLT (type);
2772 if (!TYPE_HAS_CONST_INIT_REF (type))
2773 *cant_have_const_ctor = 1;
2775 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
2776 *no_const_asn_ref = 1;
2778 if (DECL_INITIAL (field) != NULL_TREE)
2780 /* `build_class_init_list' does not recognize
2782 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
2783 error ("multiple fields in union %qT initialized", t);
2784 *any_default_members = 1;
2788 /* Check the data members (both static and non-static), class-scoped
2789 typedefs, etc., appearing in the declaration of T. Issue
2790 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2791 declaration order) of access declarations; each TREE_VALUE in this
2792 list is a USING_DECL.
2794 In addition, set the following flags:
2797 The class is empty, i.e., contains no non-static data members.
2799 CANT_HAVE_CONST_CTOR_P
2800 This class cannot have an implicitly generated copy constructor
2801 taking a const reference.
2803 CANT_HAVE_CONST_ASN_REF
2804 This class cannot have an implicitly generated assignment
2805 operator taking a const reference.
2807 All of these flags should be initialized before calling this
2810 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2811 fields can be added by adding to this chain. */
2814 check_field_decls (tree t, tree *access_decls,
2815 int *cant_have_const_ctor_p,
2816 int *no_const_asn_ref_p)
2821 int any_default_members;
2824 /* Assume there are no access declarations. */
2825 *access_decls = NULL_TREE;
2826 /* Assume this class has no pointer members. */
2827 has_pointers = false;
2828 /* Assume none of the members of this class have default
2830 any_default_members = 0;
2832 for (field = &TYPE_FIELDS (t); *field; field = next)
2835 tree type = TREE_TYPE (x);
2837 next = &TREE_CHAIN (x);
2839 if (TREE_CODE (x) == USING_DECL)
2841 /* Prune the access declaration from the list of fields. */
2842 *field = TREE_CHAIN (x);
2844 /* Save the access declarations for our caller. */
2845 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
2847 /* Since we've reset *FIELD there's no reason to skip to the
2853 if (TREE_CODE (x) == TYPE_DECL
2854 || TREE_CODE (x) == TEMPLATE_DECL)
2857 /* If we've gotten this far, it's a data member, possibly static,
2858 or an enumerator. */
2859 DECL_CONTEXT (x) = t;
2861 /* When this goes into scope, it will be a non-local reference. */
2862 DECL_NONLOCAL (x) = 1;
2864 if (TREE_CODE (t) == UNION_TYPE)
2868 If a union contains a static data member, or a member of
2869 reference type, the program is ill-formed. */
2870 if (TREE_CODE (x) == VAR_DECL)
2872 error ("%q+D may not be static because it is a member of a union", x);
2875 if (TREE_CODE (type) == REFERENCE_TYPE)
2877 error ("%q+D may not have reference type %qT because"
2878 " it is a member of a union",
2884 /* Perform error checking that did not get done in
2886 if (TREE_CODE (type) == FUNCTION_TYPE)
2888 error ("field %q+D invalidly declared function type", x);
2889 type = build_pointer_type (type);
2890 TREE_TYPE (x) = type;
2892 else if (TREE_CODE (type) == METHOD_TYPE)
2894 error ("field %q+D invalidly declared method type", x);
2895 type = build_pointer_type (type);
2896 TREE_TYPE (x) = type;
2899 if (type == error_mark_node)
2902 if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL)
2905 /* Now it can only be a FIELD_DECL. */
2907 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
2908 CLASSTYPE_NON_AGGREGATE (t) = 1;
2910 /* If this is of reference type, check if it needs an init.
2911 Also do a little ANSI jig if necessary. */
2912 if (TREE_CODE (type) == REFERENCE_TYPE)
2914 CLASSTYPE_NON_POD_P (t) = 1;
2915 if (DECL_INITIAL (x) == NULL_TREE)
2916 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2918 /* ARM $12.6.2: [A member initializer list] (or, for an
2919 aggregate, initialization by a brace-enclosed list) is the
2920 only way to initialize nonstatic const and reference
2922 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2924 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2926 warning (OPT_Wextra, "non-static reference %q+#D in class without a constructor", x);
2929 type = strip_array_types (type);
2931 if (TYPE_PACKED (t))
2933 if (!pod_type_p (type) && !TYPE_PACKED (type))
2937 "ignoring packed attribute because of unpacked non-POD field %q+#D",
2941 else if (TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT)
2942 DECL_PACKED (x) = 1;
2945 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
2946 /* We don't treat zero-width bitfields as making a class
2951 /* The class is non-empty. */
2952 CLASSTYPE_EMPTY_P (t) = 0;
2953 /* The class is not even nearly empty. */
2954 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
2955 /* If one of the data members contains an empty class,
2957 if (CLASS_TYPE_P (type)
2958 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
2959 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
2962 /* This is used by -Weffc++ (see below). Warn only for pointers
2963 to members which might hold dynamic memory. So do not warn
2964 for pointers to functions or pointers to members. */
2965 if (TYPE_PTR_P (type)
2966 && !TYPE_PTRFN_P (type)
2967 && !TYPE_PTR_TO_MEMBER_P (type))
2968 has_pointers = true;
2970 if (CLASS_TYPE_P (type))
2972 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type))
2973 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2974 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type))
2975 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2978 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
2979 CLASSTYPE_HAS_MUTABLE (t) = 1;
2981 if (! pod_type_p (type))
2982 /* DR 148 now allows pointers to members (which are POD themselves),
2983 to be allowed in POD structs. */
2984 CLASSTYPE_NON_POD_P (t) = 1;
2986 if (! zero_init_p (type))
2987 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
2989 /* If any field is const, the structure type is pseudo-const. */
2990 if (CP_TYPE_CONST_P (type))
2992 C_TYPE_FIELDS_READONLY (t) = 1;
2993 if (DECL_INITIAL (x) == NULL_TREE)
2994 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2996 /* ARM $12.6.2: [A member initializer list] (or, for an
2997 aggregate, initialization by a brace-enclosed list) is the
2998 only way to initialize nonstatic const and reference
3000 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3002 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
3004 warning (OPT_Wextra, "non-static const member %q+#D in class without a constructor", x);
3006 /* A field that is pseudo-const makes the structure likewise. */
3007 else if (CLASS_TYPE_P (type))
3009 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3010 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
3011 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3012 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
3015 /* Core issue 80: A nonstatic data member is required to have a
3016 different name from the class iff the class has a
3017 user-defined constructor. */
3018 if (constructor_name_p (DECL_NAME (x), t) && TYPE_HAS_CONSTRUCTOR (t))
3019 pedwarn ("field %q+#D with same name as class", x);
3021 /* We set DECL_C_BIT_FIELD in grokbitfield.
3022 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3023 if (DECL_C_BIT_FIELD (x))
3024 check_bitfield_decl (x);
3026 check_field_decl (x, t,
3027 cant_have_const_ctor_p,
3029 &any_default_members);
3032 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3033 it should also define a copy constructor and an assignment operator to
3034 implement the correct copy semantic (deep vs shallow, etc.). As it is
3035 not feasible to check whether the constructors do allocate dynamic memory
3036 and store it within members, we approximate the warning like this:
3038 -- Warn only if there are members which are pointers
3039 -- Warn only if there is a non-trivial constructor (otherwise,
3040 there cannot be memory allocated).
3041 -- Warn only if there is a non-trivial destructor. We assume that the
3042 user at least implemented the cleanup correctly, and a destructor
3043 is needed to free dynamic memory.
3045 This seems enough for practical purposes. */
3048 && TYPE_HAS_CONSTRUCTOR (t)
3049 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3050 && !(TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3052 warning (OPT_Weffc__, "%q#T has pointer data members", t);
3054 if (! TYPE_HAS_INIT_REF (t))
3056 warning (OPT_Weffc__,
3057 " but does not override %<%T(const %T&)%>", t, t);
3058 if (!TYPE_HAS_ASSIGN_REF (t))
3059 warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t);
3061 else if (! TYPE_HAS_ASSIGN_REF (t))
3062 warning (OPT_Weffc__,
3063 " but does not override %<operator=(const %T&)%>", t);
3066 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3068 TYPE_PACKED (t) = 0;
3070 /* Check anonymous struct/anonymous union fields. */
3071 finish_struct_anon (t);
3073 /* We've built up the list of access declarations in reverse order.
3075 *access_decls = nreverse (*access_decls);
3078 /* If TYPE is an empty class type, records its OFFSET in the table of
3082 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3086 if (!is_empty_class (type))
3089 /* Record the location of this empty object in OFFSETS. */
3090 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3092 n = splay_tree_insert (offsets,
3093 (splay_tree_key) offset,
3094 (splay_tree_value) NULL_TREE);
3095 n->value = ((splay_tree_value)
3096 tree_cons (NULL_TREE,
3103 /* Returns nonzero if TYPE is an empty class type and there is
3104 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3107 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3112 if (!is_empty_class (type))
3115 /* Record the location of this empty object in OFFSETS. */
3116 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3120 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3121 if (same_type_p (TREE_VALUE (t), type))
3127 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3128 F for every subobject, passing it the type, offset, and table of
3129 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3132 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3133 than MAX_OFFSET will not be walked.
3135 If F returns a nonzero value, the traversal ceases, and that value
3136 is returned. Otherwise, returns zero. */
3139 walk_subobject_offsets (tree type,
3140 subobject_offset_fn f,
3147 tree type_binfo = NULL_TREE;
3149 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3151 if (max_offset && INT_CST_LT (max_offset, offset))
3154 if (type == error_mark_node)
3159 if (abi_version_at_least (2))
3161 type = BINFO_TYPE (type);
3164 if (CLASS_TYPE_P (type))
3170 /* Avoid recursing into objects that are not interesting. */
3171 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3174 /* Record the location of TYPE. */
3175 r = (*f) (type, offset, offsets);
3179 /* Iterate through the direct base classes of TYPE. */
3181 type_binfo = TYPE_BINFO (type);
3182 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++)
3186 if (abi_version_at_least (2)
3187 && BINFO_VIRTUAL_P (binfo))
3191 && BINFO_VIRTUAL_P (binfo)
3192 && !BINFO_PRIMARY_P (binfo))
3195 if (!abi_version_at_least (2))
3196 binfo_offset = size_binop (PLUS_EXPR,
3198 BINFO_OFFSET (binfo));
3202 /* We cannot rely on BINFO_OFFSET being set for the base
3203 class yet, but the offsets for direct non-virtual
3204 bases can be calculated by going back to the TYPE. */
3205 orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i);
3206 binfo_offset = size_binop (PLUS_EXPR,
3208 BINFO_OFFSET (orig_binfo));
3211 r = walk_subobject_offsets (binfo,
3216 (abi_version_at_least (2)
3217 ? /*vbases_p=*/0 : vbases_p));
3222 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type))
3225 VEC(tree,gc) *vbases;
3227 /* Iterate through the virtual base classes of TYPE. In G++
3228 3.2, we included virtual bases in the direct base class
3229 loop above, which results in incorrect results; the
3230 correct offsets for virtual bases are only known when
3231 working with the most derived type. */
3233 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
3234 VEC_iterate (tree, vbases, ix, binfo); ix++)
3236 r = walk_subobject_offsets (binfo,
3238 size_binop (PLUS_EXPR,
3240 BINFO_OFFSET (binfo)),
3249 /* We still have to walk the primary base, if it is
3250 virtual. (If it is non-virtual, then it was walked
3252 tree vbase = get_primary_binfo (type_binfo);
3254 if (vbase && BINFO_VIRTUAL_P (vbase)
3255 && BINFO_PRIMARY_P (vbase)
3256 && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo)
3258 r = (walk_subobject_offsets
3260 offsets, max_offset, /*vbases_p=*/0));
3267 /* Iterate through the fields of TYPE. */
3268 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3269 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3273 if (abi_version_at_least (2))
3274 field_offset = byte_position (field);
3276 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3277 field_offset = DECL_FIELD_OFFSET (field);
3279 r = walk_subobject_offsets (TREE_TYPE (field),
3281 size_binop (PLUS_EXPR,
3291 else if (TREE_CODE (type) == ARRAY_TYPE)
3293 tree element_type = strip_array_types (type);
3294 tree domain = TYPE_DOMAIN (type);
3297 /* Avoid recursing into objects that are not interesting. */
3298 if (!CLASS_TYPE_P (element_type)
3299 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3302 /* Step through each of the elements in the array. */
3303 for (index = size_zero_node;
3304 /* G++ 3.2 had an off-by-one error here. */
3305 (abi_version_at_least (2)
3306 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3307 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3308 index = size_binop (PLUS_EXPR, index, size_one_node))
3310 r = walk_subobject_offsets (TREE_TYPE (type),
3318 offset = size_binop (PLUS_EXPR, offset,
3319 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3320 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3321 there's no point in iterating through the remaining
3322 elements of the array. */
3323 if (max_offset && INT_CST_LT (max_offset, offset))
3331 /* Record all of the empty subobjects of TYPE (either a type or a
3332 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3333 is being placed at OFFSET; otherwise, it is a base class that is
3334 being placed at OFFSET. */
3337 record_subobject_offsets (tree type,
3340 bool is_data_member)
3343 /* If recording subobjects for a non-static data member or a
3344 non-empty base class , we do not need to record offsets beyond
3345 the size of the biggest empty class. Additional data members
3346 will go at the end of the class. Additional base classes will go
3347 either at offset zero (if empty, in which case they cannot
3348 overlap with offsets past the size of the biggest empty class) or
3349 at the end of the class.
3351 However, if we are placing an empty base class, then we must record
3352 all offsets, as either the empty class is at offset zero (where
3353 other empty classes might later be placed) or at the end of the
3354 class (where other objects might then be placed, so other empty
3355 subobjects might later overlap). */
3357 || !is_empty_class (BINFO_TYPE (type)))
3358 max_offset = sizeof_biggest_empty_class;
3360 max_offset = NULL_TREE;
3361 walk_subobject_offsets (type, record_subobject_offset, offset,
3362 offsets, max_offset, is_data_member);
3365 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3366 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3367 virtual bases of TYPE are examined. */
3370 layout_conflict_p (tree type,
3375 splay_tree_node max_node;
3377 /* Get the node in OFFSETS that indicates the maximum offset where
3378 an empty subobject is located. */
3379 max_node = splay_tree_max (offsets);
3380 /* If there aren't any empty subobjects, then there's no point in
3381 performing this check. */
3385 return walk_subobject_offsets (type, check_subobject_offset, offset,
3386 offsets, (tree) (max_node->key),
3390 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3391 non-static data member of the type indicated by RLI. BINFO is the
3392 binfo corresponding to the base subobject, OFFSETS maps offsets to
3393 types already located at those offsets. This function determines
3394 the position of the DECL. */
3397 layout_nonempty_base_or_field (record_layout_info rli,
3402 tree offset = NULL_TREE;
3408 /* For the purposes of determining layout conflicts, we want to
3409 use the class type of BINFO; TREE_TYPE (DECL) will be the
3410 CLASSTYPE_AS_BASE version, which does not contain entries for
3411 zero-sized bases. */
3412 type = TREE_TYPE (binfo);
3417 type = TREE_TYPE (decl);
3421 /* Try to place the field. It may take more than one try if we have
3422 a hard time placing the field without putting two objects of the
3423 same type at the same address. */
3426 struct record_layout_info_s old_rli = *rli;
3428 /* Place this field. */
3429 place_field (rli, decl);
3430 offset = byte_position (decl);
3432 /* We have to check to see whether or not there is already
3433 something of the same type at the offset we're about to use.
3434 For example, consider:
3437 struct T : public S { int i; };
3438 struct U : public S, public T {};
3440 Here, we put S at offset zero in U. Then, we can't put T at
3441 offset zero -- its S component would be at the same address
3442 as the S we already allocated. So, we have to skip ahead.
3443 Since all data members, including those whose type is an
3444 empty class, have nonzero size, any overlap can happen only
3445 with a direct or indirect base-class -- it can't happen with
3447 /* In a union, overlap is permitted; all members are placed at
3449 if (TREE_CODE (rli->t) == UNION_TYPE)
3451 /* G++ 3.2 did not check for overlaps when placing a non-empty
3453 if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo))
3455 if (layout_conflict_p (field_p ? type : binfo, offset,
3458 /* Strip off the size allocated to this field. That puts us
3459 at the first place we could have put the field with
3460 proper alignment. */
3463 /* Bump up by the alignment required for the type. */
3465 = size_binop (PLUS_EXPR, rli->bitpos,
3467 ? CLASSTYPE_ALIGN (type)
3468 : TYPE_ALIGN (type)));
3469 normalize_rli (rli);
3472 /* There was no conflict. We're done laying out this field. */
3476 /* Now that we know where it will be placed, update its
3478 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3479 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3480 this point because their BINFO_OFFSET is copied from another
3481 hierarchy. Therefore, we may not need to add the entire
3483 propagate_binfo_offsets (binfo,
3484 size_diffop (convert (ssizetype, offset),
3486 BINFO_OFFSET (binfo))));
3489 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3492 empty_base_at_nonzero_offset_p (tree type,
3494 splay_tree offsets ATTRIBUTE_UNUSED)
3496 return is_empty_class (type) && !integer_zerop (offset);
3499 /* Layout the empty base BINFO. EOC indicates the byte currently just
3500 past the end of the class, and should be correctly aligned for a
3501 class of the type indicated by BINFO; OFFSETS gives the offsets of
3502 the empty bases allocated so far. T is the most derived
3503 type. Return nonzero iff we added it at the end. */
3506 layout_empty_base (tree binfo, tree eoc, splay_tree offsets)
3509 tree basetype = BINFO_TYPE (binfo);
3512 /* This routine should only be used for empty classes. */
3513 gcc_assert (is_empty_class (basetype));
3514 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3516 if (!integer_zerop (BINFO_OFFSET (binfo)))
3518 if (abi_version_at_least (2))
3519 propagate_binfo_offsets
3520 (binfo, size_diffop (size_zero_node, BINFO_OFFSET (binfo)));
3523 "offset of empty base %qT may not be ABI-compliant and may"
3524 "change in a future version of GCC",
3525 BINFO_TYPE (binfo));
3528 /* This is an empty base class. We first try to put it at offset
3530 if (layout_conflict_p (binfo,
3531 BINFO_OFFSET (binfo),
3535 /* That didn't work. Now, we move forward from the next
3536 available spot in the class. */
3538 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3541 if (!layout_conflict_p (binfo,
3542 BINFO_OFFSET (binfo),
3545 /* We finally found a spot where there's no overlap. */
3548 /* There's overlap here, too. Bump along to the next spot. */
3549 propagate_binfo_offsets (binfo, alignment);
3555 /* Layout the base given by BINFO in the class indicated by RLI.
3556 *BASE_ALIGN is a running maximum of the alignments of
3557 any base class. OFFSETS gives the location of empty base
3558 subobjects. T is the most derived type. Return nonzero if the new
3559 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3560 *NEXT_FIELD, unless BINFO is for an empty base class.
3562 Returns the location at which the next field should be inserted. */
3565 build_base_field (record_layout_info rli, tree binfo,
3566 splay_tree offsets, tree *next_field)
3569 tree basetype = BINFO_TYPE (binfo);
3571 if (!COMPLETE_TYPE_P (basetype))
3572 /* This error is now reported in xref_tag, thus giving better
3573 location information. */
3576 /* Place the base class. */
3577 if (!is_empty_class (basetype))
3581 /* The containing class is non-empty because it has a non-empty
3583 CLASSTYPE_EMPTY_P (t) = 0;
3585 /* Create the FIELD_DECL. */
3586 decl = build_decl (FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
3587 DECL_ARTIFICIAL (decl) = 1;
3588 DECL_IGNORED_P (decl) = 1;
3589 DECL_FIELD_CONTEXT (decl) = t;
3590 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3591 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3592 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3593 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3594 DECL_MODE (decl) = TYPE_MODE (basetype);
3595 DECL_FIELD_IS_BASE (decl) = 1;
3597 /* Try to place the field. It may take more than one try if we
3598 have a hard time placing the field without putting two
3599 objects of the same type at the same address. */
3600 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
3601 /* Add the new FIELD_DECL to the list of fields for T. */
3602 TREE_CHAIN (decl) = *next_field;
3604 next_field = &TREE_CHAIN (decl);
3611 /* On some platforms (ARM), even empty classes will not be
3613 eoc = round_up (rli_size_unit_so_far (rli),
3614 CLASSTYPE_ALIGN_UNIT (basetype));
3615 atend = layout_empty_base (binfo, eoc, offsets);
3616 /* A nearly-empty class "has no proper base class that is empty,
3617 not morally virtual, and at an offset other than zero." */
3618 if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
3621 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3622 /* The check above (used in G++ 3.2) is insufficient because
3623 an empty class placed at offset zero might itself have an
3624 empty base at a nonzero offset. */
3625 else if (walk_subobject_offsets (basetype,
3626 empty_base_at_nonzero_offset_p,
3629 /*max_offset=*/NULL_TREE,
3632 if (abi_version_at_least (2))
3633 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3636 "class %qT will be considered nearly empty in a "
3637 "future version of GCC", t);
3641 /* We do not create a FIELD_DECL for empty base classes because
3642 it might overlap some other field. We want to be able to
3643 create CONSTRUCTORs for the class by iterating over the
3644 FIELD_DECLs, and the back end does not handle overlapping
3647 /* An empty virtual base causes a class to be non-empty
3648 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3649 here because that was already done when the virtual table
3650 pointer was created. */
3653 /* Record the offsets of BINFO and its base subobjects. */
3654 record_subobject_offsets (binfo,
3655 BINFO_OFFSET (binfo),
3657 /*is_data_member=*/false);
3662 /* Layout all of the non-virtual base classes. Record empty
3663 subobjects in OFFSETS. T is the most derived type. Return nonzero
3664 if the type cannot be nearly empty. The fields created
3665 corresponding to the base classes will be inserted at
3669 build_base_fields (record_layout_info rli,
3670 splay_tree offsets, tree *next_field)
3672 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3675 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
3678 /* The primary base class is always allocated first. */
3679 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
3680 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
3681 offsets, next_field);
3683 /* Now allocate the rest of the bases. */
3684 for (i = 0; i < n_baseclasses; ++i)
3688 base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
3690 /* The primary base was already allocated above, so we don't
3691 need to allocate it again here. */
3692 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
3695 /* Virtual bases are added at the end (a primary virtual base
3696 will have already been added). */
3697 if (BINFO_VIRTUAL_P (base_binfo))
3700 next_field = build_base_field (rli, base_binfo,
3701 offsets, next_field);
3705 /* Go through the TYPE_METHODS of T issuing any appropriate
3706 diagnostics, figuring out which methods override which other
3707 methods, and so forth. */
3710 check_methods (tree t)
3714 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3716 check_for_override (x, t);
3717 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3718 error ("initializer specified for non-virtual method %q+D", x);
3719 /* The name of the field is the original field name
3720 Save this in auxiliary field for later overloading. */
3721 if (DECL_VINDEX (x))
3723 TYPE_POLYMORPHIC_P (t) = 1;
3724 if (DECL_PURE_VIRTUAL_P (x))
3725 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
3727 /* All user-declared destructors are non-trivial. */
3728 if (DECL_DESTRUCTOR_P (x))
3729 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1;
3733 /* FN is a constructor or destructor. Clone the declaration to create
3734 a specialized in-charge or not-in-charge version, as indicated by
3738 build_clone (tree fn, tree name)
3743 /* Copy the function. */
3744 clone = copy_decl (fn);
3745 /* Remember where this function came from. */
3746 DECL_CLONED_FUNCTION (clone) = fn;
3747 DECL_ABSTRACT_ORIGIN (clone) = fn;
3748 /* Reset the function name. */
3749 DECL_NAME (clone) = name;
3750 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
3751 /* There's no pending inline data for this function. */
3752 DECL_PENDING_INLINE_INFO (clone) = NULL;
3753 DECL_PENDING_INLINE_P (clone) = 0;
3754 /* And it hasn't yet been deferred. */
3755 DECL_DEFERRED_FN (clone) = 0;
3757 /* The base-class destructor is not virtual. */
3758 if (name == base_dtor_identifier)
3760 DECL_VIRTUAL_P (clone) = 0;
3761 if (TREE_CODE (clone) != TEMPLATE_DECL)
3762 DECL_VINDEX (clone) = NULL_TREE;
3765 /* If there was an in-charge parameter, drop it from the function
3767 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3773 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3774 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3775 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
3776 /* Skip the `this' parameter. */
3777 parmtypes = TREE_CHAIN (parmtypes);
3778 /* Skip the in-charge parameter. */
3779 parmtypes = TREE_CHAIN (parmtypes);
3780 /* And the VTT parm, in a complete [cd]tor. */
3781 if (DECL_HAS_VTT_PARM_P (fn)
3782 && ! DECL_NEEDS_VTT_PARM_P (clone))
3783 parmtypes = TREE_CHAIN (parmtypes);
3784 /* If this is subobject constructor or destructor, add the vtt
3787 = build_method_type_directly (basetype,
3788 TREE_TYPE (TREE_TYPE (clone)),
3791 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
3794 = cp_build_type_attribute_variant (TREE_TYPE (clone),
3795 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
3798 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3799 aren't function parameters; those are the template parameters. */
3800 if (TREE_CODE (clone) != TEMPLATE_DECL)
3802 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
3803 /* Remove the in-charge parameter. */
3804 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3806 TREE_CHAIN (DECL_ARGUMENTS (clone))
3807 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3808 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
3810 /* And the VTT parm, in a complete [cd]tor. */
3811 if (DECL_HAS_VTT_PARM_P (fn))
3813 if (DECL_NEEDS_VTT_PARM_P (clone))
3814 DECL_HAS_VTT_PARM_P (clone) = 1;
3817 TREE_CHAIN (DECL_ARGUMENTS (clone))
3818 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3819 DECL_HAS_VTT_PARM_P (clone) = 0;
3823 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
3825 DECL_CONTEXT (parms) = clone;
3826 cxx_dup_lang_specific_decl (parms);
3830 /* Create the RTL for this function. */
3831 SET_DECL_RTL (clone, NULL_RTX);
3832 rest_of_decl_compilation (clone, /*top_level=*/1, at_eof);
3834 /* Make it easy to find the CLONE given the FN. */
3835 TREE_CHAIN (clone) = TREE_CHAIN (fn);
3836 TREE_CHAIN (fn) = clone;
3838 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3839 if (TREE_CODE (clone) == TEMPLATE_DECL)
3843 DECL_TEMPLATE_RESULT (clone)
3844 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
3845 result = DECL_TEMPLATE_RESULT (clone);
3846 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
3847 DECL_TI_TEMPLATE (result) = clone;
3850 note_decl_for_pch (clone);
3855 /* Produce declarations for all appropriate clones of FN. If
3856 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3857 CLASTYPE_METHOD_VEC as well. */
3860 clone_function_decl (tree fn, int update_method_vec_p)
3864 /* Avoid inappropriate cloning. */
3866 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn)))
3869 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
3871 /* For each constructor, we need two variants: an in-charge version
3872 and a not-in-charge version. */
3873 clone = build_clone (fn, complete_ctor_identifier);
3874 if (update_method_vec_p)
3875 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3876 clone = build_clone (fn, base_ctor_identifier);
3877 if (update_method_vec_p)
3878 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3882 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn));
3884 /* For each destructor, we need three variants: an in-charge
3885 version, a not-in-charge version, and an in-charge deleting
3886 version. We clone the deleting version first because that
3887 means it will go second on the TYPE_METHODS list -- and that
3888 corresponds to the correct layout order in the virtual
3891 For a non-virtual destructor, we do not build a deleting
3893 if (DECL_VIRTUAL_P (fn))
3895 clone = build_clone (fn, deleting_dtor_identifier);
3896 if (update_method_vec_p)
3897 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3899 clone = build_clone (fn, complete_dtor_identifier);
3900 if (update_method_vec_p)
3901 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3902 clone = build_clone (fn, base_dtor_identifier);
3903 if (update_method_vec_p)
3904 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3907 /* Note that this is an abstract function that is never emitted. */
3908 DECL_ABSTRACT (fn) = 1;
3911 /* DECL is an in charge constructor, which is being defined. This will
3912 have had an in class declaration, from whence clones were
3913 declared. An out-of-class definition can specify additional default
3914 arguments. As it is the clones that are involved in overload
3915 resolution, we must propagate the information from the DECL to its
3919 adjust_clone_args (tree decl)
3923 for (clone = TREE_CHAIN (decl); clone && DECL_CLONED_FUNCTION (clone);
3924 clone = TREE_CHAIN (clone))
3926 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
3927 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
3928 tree decl_parms, clone_parms;
3930 clone_parms = orig_clone_parms;
3932 /* Skip the 'this' parameter. */
3933 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
3934 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3936 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
3937 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3938 if (DECL_HAS_VTT_PARM_P (decl))
3939 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3941 clone_parms = orig_clone_parms;
3942 if (DECL_HAS_VTT_PARM_P (clone))
3943 clone_parms = TREE_CHAIN (clone_parms);
3945 for (decl_parms = orig_decl_parms; decl_parms;
3946 decl_parms = TREE_CHAIN (decl_parms),
3947 clone_parms = TREE_CHAIN (clone_parms))
3949 gcc_assert (same_type_p (TREE_TYPE (decl_parms),
3950 TREE_TYPE (clone_parms)));
3952 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
3954 /* A default parameter has been added. Adjust the
3955 clone's parameters. */
3956 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3957 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3960 clone_parms = orig_decl_parms;
3962 if (DECL_HAS_VTT_PARM_P (clone))
3964 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
3965 TREE_VALUE (orig_clone_parms),
3967 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
3969 type = build_method_type_directly (basetype,
3970 TREE_TYPE (TREE_TYPE (clone)),
3973 type = build_exception_variant (type, exceptions);
3974 TREE_TYPE (clone) = type;
3976 clone_parms = NULL_TREE;
3980 gcc_assert (!clone_parms);
3984 /* For each of the constructors and destructors in T, create an
3985 in-charge and not-in-charge variant. */
3988 clone_constructors_and_destructors (tree t)
3992 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
3994 if (!CLASSTYPE_METHOD_VEC (t))
3997 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
3998 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
3999 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4000 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4003 /* Remove all zero-width bit-fields from T. */
4006 remove_zero_width_bit_fields (tree t)
4010 fieldsp = &TYPE_FIELDS (t);
4013 if (TREE_CODE (*fieldsp) == FIELD_DECL
4014 && DECL_C_BIT_FIELD (*fieldsp)
4015 && DECL_INITIAL (*fieldsp))
4016 *fieldsp = TREE_CHAIN (*fieldsp);
4018 fieldsp = &TREE_CHAIN (*fieldsp);
4022 /* Returns TRUE iff we need a cookie when dynamically allocating an
4023 array whose elements have the indicated class TYPE. */
4026 type_requires_array_cookie (tree type)
4029 bool has_two_argument_delete_p = false;
4031 gcc_assert (CLASS_TYPE_P (type));
4033 /* If there's a non-trivial destructor, we need a cookie. In order
4034 to iterate through the array calling the destructor for each
4035 element, we'll have to know how many elements there are. */
4036 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4039 /* If the usual deallocation function is a two-argument whose second
4040 argument is of type `size_t', then we have to pass the size of
4041 the array to the deallocation function, so we will need to store
4043 fns = lookup_fnfields (TYPE_BINFO (type),
4044 ansi_opname (VEC_DELETE_EXPR),
4046 /* If there are no `operator []' members, or the lookup is
4047 ambiguous, then we don't need a cookie. */
4048 if (!fns || fns == error_mark_node)
4050 /* Loop through all of the functions. */
4051 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
4056 /* Select the current function. */
4057 fn = OVL_CURRENT (fns);
4058 /* See if this function is a one-argument delete function. If
4059 it is, then it will be the usual deallocation function. */
4060 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
4061 if (second_parm == void_list_node)
4063 /* Otherwise, if we have a two-argument function and the second
4064 argument is `size_t', it will be the usual deallocation
4065 function -- unless there is one-argument function, too. */
4066 if (TREE_CHAIN (second_parm) == void_list_node
4067 && same_type_p (TREE_VALUE (second_parm), size_type_node))
4068 has_two_argument_delete_p = true;
4071 return has_two_argument_delete_p;
4074 /* Check the validity of the bases and members declared in T. Add any
4075 implicitly-generated functions (like copy-constructors and
4076 assignment operators). Compute various flag bits (like
4077 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4078 level: i.e., independently of the ABI in use. */
4081 check_bases_and_members (tree t)
4083 /* Nonzero if the implicitly generated copy constructor should take
4084 a non-const reference argument. */
4085 int cant_have_const_ctor;
4086 /* Nonzero if the implicitly generated assignment operator
4087 should take a non-const reference argument. */
4088 int no_const_asn_ref;
4091 /* By default, we use const reference arguments and generate default
4093 cant_have_const_ctor = 0;
4094 no_const_asn_ref = 0;
4096 /* Check all the base-classes. */
4097 check_bases (t, &cant_have_const_ctor,
4100 /* Check all the method declarations. */
4103 /* Check all the data member declarations. We cannot call
4104 check_field_decls until we have called check_bases check_methods,
4105 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4106 being set appropriately. */
4107 check_field_decls (t, &access_decls,
4108 &cant_have_const_ctor,
4111 /* A nearly-empty class has to be vptr-containing; a nearly empty
4112 class contains just a vptr. */
4113 if (!TYPE_CONTAINS_VPTR_P (t))
4114 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4116 /* Do some bookkeeping that will guide the generation of implicitly
4117 declared member functions. */
4118 TYPE_HAS_COMPLEX_INIT_REF (t)
4119 |= (TYPE_HAS_INIT_REF (t) || TYPE_CONTAINS_VPTR_P (t));
4120 TYPE_NEEDS_CONSTRUCTING (t)
4121 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4122 CLASSTYPE_NON_AGGREGATE (t)
4123 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_POLYMORPHIC_P (t));
4124 CLASSTYPE_NON_POD_P (t)
4125 |= (CLASSTYPE_NON_AGGREGATE (t)
4126 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
4127 || TYPE_HAS_ASSIGN_REF (t));
4128 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4129 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_CONTAINS_VPTR_P (t);
4130 TYPE_HAS_COMPLEX_DFLT (t)
4131 |= (TYPE_HAS_DEFAULT_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4133 /* Synthesize any needed methods. */
4134 add_implicitly_declared_members (t,
4135 cant_have_const_ctor,
4138 /* Create the in-charge and not-in-charge variants of constructors
4140 clone_constructors_and_destructors (t);
4142 /* Process the using-declarations. */
4143 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4144 handle_using_decl (TREE_VALUE (access_decls), t);
4146 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4147 finish_struct_methods (t);
4149 /* Figure out whether or not we will need a cookie when dynamically
4150 allocating an array of this type. */
4151 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
4152 = type_requires_array_cookie (t);
4155 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4156 accordingly. If a new vfield was created (because T doesn't have a
4157 primary base class), then the newly created field is returned. It
4158 is not added to the TYPE_FIELDS list; it is the caller's
4159 responsibility to do that. Accumulate declared virtual functions
4163 create_vtable_ptr (tree t, tree* virtuals_p)
4167 /* Collect the virtual functions declared in T. */
4168 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4169 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
4170 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
4172 tree new_virtual = make_node (TREE_LIST);
4174 BV_FN (new_virtual) = fn;
4175 BV_DELTA (new_virtual) = integer_zero_node;
4176 BV_VCALL_INDEX (new_virtual) = NULL_TREE;
4178 TREE_CHAIN (new_virtual) = *virtuals_p;
4179 *virtuals_p = new_virtual;
4182 /* If we couldn't find an appropriate base class, create a new field
4183 here. Even if there weren't any new virtual functions, we might need a
4184 new virtual function table if we're supposed to include vptrs in
4185 all classes that need them. */
4186 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
4188 /* We build this decl with vtbl_ptr_type_node, which is a
4189 `vtable_entry_type*'. It might seem more precise to use
4190 `vtable_entry_type (*)[N]' where N is the number of virtual
4191 functions. However, that would require the vtable pointer in
4192 base classes to have a different type than the vtable pointer
4193 in derived classes. We could make that happen, but that
4194 still wouldn't solve all the problems. In particular, the
4195 type-based alias analysis code would decide that assignments
4196 to the base class vtable pointer can't alias assignments to
4197 the derived class vtable pointer, since they have different
4198 types. Thus, in a derived class destructor, where the base
4199 class constructor was inlined, we could generate bad code for
4200 setting up the vtable pointer.
4202 Therefore, we use one type for all vtable pointers. We still
4203 use a type-correct type; it's just doesn't indicate the array
4204 bounds. That's better than using `void*' or some such; it's
4205 cleaner, and it let's the alias analysis code know that these
4206 stores cannot alias stores to void*! */
4209 field = build_decl (FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
4210 DECL_VIRTUAL_P (field) = 1;
4211 DECL_ARTIFICIAL (field) = 1;
4212 DECL_FIELD_CONTEXT (field) = t;
4213 DECL_FCONTEXT (field) = t;
4215 TYPE_VFIELD (t) = field;
4217 /* This class is non-empty. */
4218 CLASSTYPE_EMPTY_P (t) = 0;
4226 /* Fixup the inline function given by INFO now that the class is
4230 fixup_pending_inline (tree fn)
4232 if (DECL_PENDING_INLINE_INFO (fn))
4234 tree args = DECL_ARGUMENTS (fn);
4237 DECL_CONTEXT (args) = fn;
4238 args = TREE_CHAIN (args);
4243 /* Fixup the inline methods and friends in TYPE now that TYPE is
4247 fixup_inline_methods (tree type)
4249 tree method = TYPE_METHODS (type);
4250 VEC(tree,gc) *friends;
4253 if (method && TREE_CODE (method) == TREE_VEC)
4255 if (TREE_VEC_ELT (method, 1))
4256 method = TREE_VEC_ELT (method, 1);
4257 else if (TREE_VEC_ELT (method, 0))
4258 method = TREE_VEC_ELT (method, 0);
4260 method = TREE_VEC_ELT (method, 2);
4263 /* Do inline member functions. */
4264 for (; method; method = TREE_CHAIN (method))
4265 fixup_pending_inline (method);
4268 for (friends = CLASSTYPE_INLINE_FRIENDS (type), ix = 0;
4269 VEC_iterate (tree, friends, ix, method); ix++)
4270 fixup_pending_inline (method);
4271 CLASSTYPE_INLINE_FRIENDS (type) = NULL;
4274 /* Add OFFSET to all base types of BINFO which is a base in the
4275 hierarchy dominated by T.
4277 OFFSET, which is a type offset, is number of bytes. */
4280 propagate_binfo_offsets (tree binfo, tree offset)
4286 /* Update BINFO's offset. */
4287 BINFO_OFFSET (binfo)
4288 = convert (sizetype,
4289 size_binop (PLUS_EXPR,
4290 convert (ssizetype, BINFO_OFFSET (binfo)),
4293 /* Find the primary base class. */
4294 primary_binfo = get_primary_binfo (binfo);
4296 if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo)
4297 propagate_binfo_offsets (primary_binfo, offset);
4299 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4301 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4303 /* Don't do the primary base twice. */
4304 if (base_binfo == primary_binfo)
4307 if (BINFO_VIRTUAL_P (base_binfo))
4310 propagate_binfo_offsets (base_binfo, offset);
4314 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4315 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4316 empty subobjects of T. */
4319 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
4323 bool first_vbase = true;
4326 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0)
4329 if (!abi_version_at_least(2))
4331 /* In G++ 3.2, we incorrectly rounded the size before laying out
4332 the virtual bases. */
4333 finish_record_layout (rli, /*free_p=*/false);
4334 #ifdef STRUCTURE_SIZE_BOUNDARY
4335 /* Packed structures don't need to have minimum size. */
4336 if (! TYPE_PACKED (t))
4337 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
4339 rli->offset = TYPE_SIZE_UNIT (t);
4340 rli->bitpos = bitsize_zero_node;
4341 rli->record_align = TYPE_ALIGN (t);
4344 /* Find the last field. The artificial fields created for virtual
4345 bases will go after the last extant field to date. */
4346 next_field = &TYPE_FIELDS (t);
4348 next_field = &TREE_CHAIN (*next_field);
4350 /* Go through the virtual bases, allocating space for each virtual
4351 base that is not already a primary base class. These are
4352 allocated in inheritance graph order. */
4353 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
4355 if (!BINFO_VIRTUAL_P (vbase))
4358 if (!BINFO_PRIMARY_P (vbase))
4360 tree basetype = TREE_TYPE (vbase);
4362 /* This virtual base is not a primary base of any class in the
4363 hierarchy, so we have to add space for it. */
4364 next_field = build_base_field (rli, vbase,
4365 offsets, next_field);
4367 /* If the first virtual base might have been placed at a
4368 lower address, had we started from CLASSTYPE_SIZE, rather
4369 than TYPE_SIZE, issue a warning. There can be both false
4370 positives and false negatives from this warning in rare
4371 cases; to deal with all the possibilities would probably
4372 require performing both layout algorithms and comparing
4373 the results which is not particularly tractable. */
4377 (size_binop (CEIL_DIV_EXPR,
4378 round_up (CLASSTYPE_SIZE (t),
4379 CLASSTYPE_ALIGN (basetype)),
4381 BINFO_OFFSET (vbase))))
4383 "offset of virtual base %qT is not ABI-compliant and "
4384 "may change in a future version of GCC",
4387 first_vbase = false;
4392 /* Returns the offset of the byte just past the end of the base class
4396 end_of_base (tree binfo)
4400 if (is_empty_class (BINFO_TYPE (binfo)))
4401 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4402 allocate some space for it. It cannot have virtual bases, so
4403 TYPE_SIZE_UNIT is fine. */
4404 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4406 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4408 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
4411 /* Returns the offset of the byte just past the end of the base class
4412 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4413 only non-virtual bases are included. */
4416 end_of_class (tree t, int include_virtuals_p)
4418 tree result = size_zero_node;
4419 VEC(tree,gc) *vbases;
4425 for (binfo = TYPE_BINFO (t), i = 0;
4426 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4428 if (!include_virtuals_p
4429 && BINFO_VIRTUAL_P (base_binfo)
4430 && (!BINFO_PRIMARY_P (base_binfo)
4431 || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t)))
4434 offset = end_of_base (base_binfo);
4435 if (INT_CST_LT_UNSIGNED (result, offset))
4439 /* G++ 3.2 did not check indirect virtual bases. */
4440 if (abi_version_at_least (2) && include_virtuals_p)
4441 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4442 VEC_iterate (tree, vbases, i, base_binfo); i++)
4444 offset = end_of_base (base_binfo);
4445 if (INT_CST_LT_UNSIGNED (result, offset))
4452 /* Warn about bases of T that are inaccessible because they are
4453 ambiguous. For example:
4456 struct T : public S {};
4457 struct U : public S, public T {};
4459 Here, `(S*) new U' is not allowed because there are two `S'
4463 warn_about_ambiguous_bases (tree t)
4466 VEC(tree,gc) *vbases;
4471 /* If there are no repeated bases, nothing can be ambiguous. */
4472 if (!CLASSTYPE_REPEATED_BASE_P (t))
4475 /* Check direct bases. */
4476 for (binfo = TYPE_BINFO (t), i = 0;
4477 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4479 basetype = BINFO_TYPE (base_binfo);
4481 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4482 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
4486 /* Check for ambiguous virtual bases. */
4488 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4489 VEC_iterate (tree, vbases, i, binfo); i++)
4491 basetype = BINFO_TYPE (binfo);
4493 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4494 warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due to ambiguity",
4499 /* Compare two INTEGER_CSTs K1 and K2. */
4502 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
4504 return tree_int_cst_compare ((tree) k1, (tree) k2);
4507 /* Increase the size indicated in RLI to account for empty classes
4508 that are "off the end" of the class. */
4511 include_empty_classes (record_layout_info rli)
4516 /* It might be the case that we grew the class to allocate a
4517 zero-sized base class. That won't be reflected in RLI, yet,
4518 because we are willing to overlay multiple bases at the same
4519 offset. However, now we need to make sure that RLI is big enough
4520 to reflect the entire class. */
4521 eoc = end_of_class (rli->t,
4522 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
4523 rli_size = rli_size_unit_so_far (rli);
4524 if (TREE_CODE (rli_size) == INTEGER_CST
4525 && INT_CST_LT_UNSIGNED (rli_size, eoc))
4527 if (!abi_version_at_least (2))
4528 /* In version 1 of the ABI, the size of a class that ends with
4529 a bitfield was not rounded up to a whole multiple of a
4530 byte. Because rli_size_unit_so_far returns only the number
4531 of fully allocated bytes, any extra bits were not included
4533 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
4535 /* The size should have been rounded to a whole byte. */
4536 gcc_assert (tree_int_cst_equal
4537 (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT)));
4539 = size_binop (PLUS_EXPR,
4541 size_binop (MULT_EXPR,
4542 convert (bitsizetype,
4543 size_binop (MINUS_EXPR,
4545 bitsize_int (BITS_PER_UNIT)));
4546 normalize_rli (rli);
4550 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4551 BINFO_OFFSETs for all of the base-classes. Position the vtable
4552 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4555 layout_class_type (tree t, tree *virtuals_p)
4557 tree non_static_data_members;
4560 record_layout_info rli;
4561 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4562 types that appear at that offset. */
4563 splay_tree empty_base_offsets;
4564 /* True if the last field layed out was a bit-field. */
4565 bool last_field_was_bitfield = false;
4566 /* The location at which the next field should be inserted. */
4568 /* T, as a base class. */
4571 /* Keep track of the first non-static data member. */
4572 non_static_data_members = TYPE_FIELDS (t);
4574 /* Start laying out the record. */
4575 rli = start_record_layout (t);
4577 /* Mark all the primary bases in the hierarchy. */
4578 determine_primary_bases (t);
4580 /* Create a pointer to our virtual function table. */
4581 vptr = create_vtable_ptr (t, virtuals_p);
4583 /* The vptr is always the first thing in the class. */
4586 TREE_CHAIN (vptr) = TYPE_FIELDS (t);
4587 TYPE_FIELDS (t) = vptr;
4588 next_field = &TREE_CHAIN (vptr);
4589 place_field (rli, vptr);
4592 next_field = &TYPE_FIELDS (t);
4594 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4595 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
4597 build_base_fields (rli, empty_base_offsets, next_field);
4599 /* Layout the non-static data members. */
4600 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4605 /* We still pass things that aren't non-static data members to
4606 the back end, in case it wants to do something with them. */
4607 if (TREE_CODE (field) != FIELD_DECL)
4609 place_field (rli, field);
4610 /* If the static data member has incomplete type, keep track
4611 of it so that it can be completed later. (The handling
4612 of pending statics in finish_record_layout is
4613 insufficient; consider:
4616 struct S2 { static S1 s1; };
4618 At this point, finish_record_layout will be called, but
4619 S1 is still incomplete.) */
4620 if (TREE_CODE (field) == VAR_DECL)
4622 maybe_register_incomplete_var (field);
4623 /* The visibility of static data members is determined
4624 at their point of declaration, not their point of
4626 determine_visibility (field);
4631 type = TREE_TYPE (field);
4632 if (type == error_mark_node)
4635 padding = NULL_TREE;
4637 /* If this field is a bit-field whose width is greater than its
4638 type, then there are some special rules for allocating
4640 if (DECL_C_BIT_FIELD (field)
4641 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4643 integer_type_kind itk;
4645 bool was_unnamed_p = false;
4646 /* We must allocate the bits as if suitably aligned for the
4647 longest integer type that fits in this many bits. type
4648 of the field. Then, we are supposed to use the left over
4649 bits as additional padding. */
4650 for (itk = itk_char; itk != itk_none; ++itk)
4651 if (INT_CST_LT (DECL_SIZE (field),
4652 TYPE_SIZE (integer_types[itk])))
4655 /* ITK now indicates a type that is too large for the
4656 field. We have to back up by one to find the largest
4658 integer_type = integer_types[itk - 1];
4660 /* Figure out how much additional padding is required. GCC
4661 3.2 always created a padding field, even if it had zero
4663 if (!abi_version_at_least (2)
4664 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
4666 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
4667 /* In a union, the padding field must have the full width
4668 of the bit-field; all fields start at offset zero. */
4669 padding = DECL_SIZE (field);
4672 if (TREE_CODE (t) == UNION_TYPE)
4673 warning (OPT_Wabi, "size assigned to %qT may not be "
4674 "ABI-compliant and may change in a future "
4677 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4678 TYPE_SIZE (integer_type));
4681 #ifdef PCC_BITFIELD_TYPE_MATTERS
4682 /* An unnamed bitfield does not normally affect the
4683 alignment of the containing class on a target where
4684 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4685 make any exceptions for unnamed bitfields when the
4686 bitfields are longer than their types. Therefore, we
4687 temporarily give the field a name. */
4688 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
4690 was_unnamed_p = true;
4691 DECL_NAME (field) = make_anon_name ();
4694 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4695 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4696 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4697 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4698 empty_base_offsets);
4700 DECL_NAME (field) = NULL_TREE;
4701 /* Now that layout has been performed, set the size of the
4702 field to the size of its declared type; the rest of the
4703 field is effectively invisible. */
4704 DECL_SIZE (field) = TYPE_SIZE (type);
4705 /* We must also reset the DECL_MODE of the field. */
4706 if (abi_version_at_least (2))
4707 DECL_MODE (field) = TYPE_MODE (type);
4709 && DECL_MODE (field) != TYPE_MODE (type))
4710 /* Versions of G++ before G++ 3.4 did not reset the
4713 "the offset of %qD may not be ABI-compliant and may "
4714 "change in a future version of GCC", field);
4717 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4718 empty_base_offsets);
4720 /* Remember the location of any empty classes in FIELD. */
4721 if (abi_version_at_least (2))
4722 record_subobject_offsets (TREE_TYPE (field),
4723 byte_position(field),
4725 /*is_data_member=*/true);
4727 /* If a bit-field does not immediately follow another bit-field,
4728 and yet it starts in the middle of a byte, we have failed to
4729 comply with the ABI. */
4731 && DECL_C_BIT_FIELD (field)
4732 /* The TREE_NO_WARNING flag gets set by Objective-C when
4733 laying out an Objective-C class. The ObjC ABI differs
4734 from the C++ ABI, and so we do not want a warning
4736 && !TREE_NO_WARNING (field)
4737 && !last_field_was_bitfield
4738 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
4739 DECL_FIELD_BIT_OFFSET (field),
4740 bitsize_unit_node)))
4741 warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may "
4742 "change in a future version of GCC", field);
4744 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4745 offset of the field. */
4747 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
4748 byte_position (field))
4749 && contains_empty_class_p (TREE_TYPE (field)))
4750 warning (OPT_Wabi, "%q+D contains empty classes which may cause base "
4751 "classes to be placed at different locations in a "
4752 "future version of GCC", field);
4754 /* The middle end uses the type of expressions to determine the
4755 possible range of expression values. In order to optimize
4756 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
4757 must be made aware of the width of "i", via its type.
4759 Because C++ does not have integer types of arbitrary width,
4760 we must (for the purposes of the front end) convert from the
4761 type assigned here to the declared type of the bitfield
4762 whenever a bitfield expression is used as an rvalue.
4763 Similarly, when assigning a value to a bitfield, the value
4764 must be converted to the type given the bitfield here. */
4765 if (DECL_C_BIT_FIELD (field))
4768 unsigned HOST_WIDE_INT width;
4769 ftype = TREE_TYPE (field);
4770 width = tree_low_cst (DECL_SIZE (field), /*unsignedp=*/1);
4771 if (width != TYPE_PRECISION (ftype))
4773 = c_build_bitfield_integer_type (width,
4774 TYPE_UNSIGNED (ftype));
4777 /* If we needed additional padding after this field, add it
4783 padding_field = build_decl (FIELD_DECL,
4786 DECL_BIT_FIELD (padding_field) = 1;
4787 DECL_SIZE (padding_field) = padding;
4788 DECL_CONTEXT (padding_field) = t;
4789 DECL_ARTIFICIAL (padding_field) = 1;
4790 DECL_IGNORED_P (padding_field) = 1;
4791 layout_nonempty_base_or_field (rli, padding_field,
4793 empty_base_offsets);
4796 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
4799 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
4801 /* Make sure that we are on a byte boundary so that the size of
4802 the class without virtual bases will always be a round number
4804 rli->bitpos = round_up (rli->bitpos, BITS_PER_UNIT);
4805 normalize_rli (rli);
4808 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4810 if (!abi_version_at_least (2))
4811 include_empty_classes(rli);
4813 /* Delete all zero-width bit-fields from the list of fields. Now
4814 that the type is laid out they are no longer important. */
4815 remove_zero_width_bit_fields (t);
4817 /* Create the version of T used for virtual bases. We do not use
4818 make_aggr_type for this version; this is an artificial type. For
4819 a POD type, we just reuse T. */
4820 if (CLASSTYPE_NON_POD_P (t) || CLASSTYPE_EMPTY_P (t))
4822 base_t = make_node (TREE_CODE (t));
4824 /* Set the size and alignment for the new type. In G++ 3.2, all
4825 empty classes were considered to have size zero when used as
4827 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
4829 TYPE_SIZE (base_t) = bitsize_zero_node;
4830 TYPE_SIZE_UNIT (base_t) = size_zero_node;
4831 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
4833 "layout of classes derived from empty class %qT "
4834 "may change in a future version of GCC",
4841 /* If the ABI version is not at least two, and the last
4842 field was a bit-field, RLI may not be on a byte
4843 boundary. In particular, rli_size_unit_so_far might
4844 indicate the last complete byte, while rli_size_so_far
4845 indicates the total number of bits used. Therefore,
4846 rli_size_so_far, rather than rli_size_unit_so_far, is
4847 used to compute TYPE_SIZE_UNIT. */
4848 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4849 TYPE_SIZE_UNIT (base_t)
4850 = size_binop (MAX_EXPR,
4852 size_binop (CEIL_DIV_EXPR,
4853 rli_size_so_far (rli),
4854 bitsize_int (BITS_PER_UNIT))),
4857 = size_binop (MAX_EXPR,
4858 rli_size_so_far (rli),
4859 size_binop (MULT_EXPR,
4860 convert (bitsizetype, eoc),
4861 bitsize_int (BITS_PER_UNIT)));
4863 TYPE_ALIGN (base_t) = rli->record_align;
4864 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
4866 /* Copy the fields from T. */
4867 next_field = &TYPE_FIELDS (base_t);
4868 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4869 if (TREE_CODE (field) == FIELD_DECL)
4871 *next_field = build_decl (FIELD_DECL,
4874 DECL_CONTEXT (*next_field) = base_t;
4875 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
4876 DECL_FIELD_BIT_OFFSET (*next_field)
4877 = DECL_FIELD_BIT_OFFSET (field);
4878 DECL_SIZE (*next_field) = DECL_SIZE (field);
4879 DECL_MODE (*next_field) = DECL_MODE (field);
4880 next_field = &TREE_CHAIN (*next_field);
4883 /* Record the base version of the type. */
4884 CLASSTYPE_AS_BASE (t) = base_t;
4885 TYPE_CONTEXT (base_t) = t;
4888 CLASSTYPE_AS_BASE (t) = t;
4890 /* Every empty class contains an empty class. */
4891 if (CLASSTYPE_EMPTY_P (t))
4892 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
4894 /* Set the TYPE_DECL for this type to contain the right
4895 value for DECL_OFFSET, so that we can use it as part
4896 of a COMPONENT_REF for multiple inheritance. */
4897 layout_decl (TYPE_MAIN_DECL (t), 0);
4899 /* Now fix up any virtual base class types that we left lying
4900 around. We must get these done before we try to lay out the
4901 virtual function table. As a side-effect, this will remove the
4902 base subobject fields. */
4903 layout_virtual_bases (rli, empty_base_offsets);
4905 /* Make sure that empty classes are reflected in RLI at this
4907 include_empty_classes(rli);
4909 /* Make sure not to create any structures with zero size. */
4910 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
4912 build_decl (FIELD_DECL, NULL_TREE, char_type_node));
4914 /* Let the back end lay out the type. */
4915 finish_record_layout (rli, /*free_p=*/true);
4917 /* Warn about bases that can't be talked about due to ambiguity. */
4918 warn_about_ambiguous_bases (t);
4920 /* Now that we're done with layout, give the base fields the real types. */
4921 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4922 if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field)))
4923 TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field));
4926 splay_tree_delete (empty_base_offsets);
4928 if (CLASSTYPE_EMPTY_P (t)
4929 && tree_int_cst_lt (sizeof_biggest_empty_class,
4930 TYPE_SIZE_UNIT (t)))
4931 sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t);
4934 /* Determine the "key method" for the class type indicated by TYPE,
4935 and set CLASSTYPE_KEY_METHOD accordingly. */
4938 determine_key_method (tree type)
4942 if (TYPE_FOR_JAVA (type)
4943 || processing_template_decl
4944 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
4945 || CLASSTYPE_INTERFACE_KNOWN (type))
4948 /* The key method is the first non-pure virtual function that is not
4949 inline at the point of class definition. On some targets the
4950 key function may not be inline; those targets should not call
4951 this function until the end of the translation unit. */
4952 for (method = TYPE_METHODS (type); method != NULL_TREE;
4953 method = TREE_CHAIN (method))
4954 if (DECL_VINDEX (method) != NULL_TREE
4955 && ! DECL_DECLARED_INLINE_P (method)
4956 && ! DECL_PURE_VIRTUAL_P (method))
4958 CLASSTYPE_KEY_METHOD (type) = method;
4965 /* Perform processing required when the definition of T (a class type)
4969 finish_struct_1 (tree t)
4972 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
4973 tree virtuals = NULL_TREE;
4976 if (COMPLETE_TYPE_P (t))
4978 gcc_assert (IS_AGGR_TYPE (t));
4979 error ("redefinition of %q#T", t);
4984 /* If this type was previously laid out as a forward reference,
4985 make sure we lay it out again. */
4986 TYPE_SIZE (t) = NULL_TREE;
4987 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
4989 fixup_inline_methods (t);
4991 /* Make assumptions about the class; we'll reset the flags if
4993 CLASSTYPE_EMPTY_P (t) = 1;
4994 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
4995 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
4997 /* Do end-of-class semantic processing: checking the validity of the
4998 bases and members and add implicitly generated methods. */
4999 check_bases_and_members (t);
5001 /* Find the key method. */
5002 if (TYPE_CONTAINS_VPTR_P (t))
5004 /* The Itanium C++ ABI permits the key method to be chosen when
5005 the class is defined -- even though the key method so
5006 selected may later turn out to be an inline function. On
5007 some systems (such as ARM Symbian OS) the key method cannot
5008 be determined until the end of the translation unit. On such
5009 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5010 will cause the class to be added to KEYED_CLASSES. Then, in
5011 finish_file we will determine the key method. */
5012 if (targetm.cxx.key_method_may_be_inline ())
5013 determine_key_method (t);
5015 /* If a polymorphic class has no key method, we may emit the vtable
5016 in every translation unit where the class definition appears. */
5017 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
5018 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
5021 /* Layout the class itself. */
5022 layout_class_type (t, &virtuals);
5023 if (CLASSTYPE_AS_BASE (t) != t)
5024 /* We use the base type for trivial assignments, and hence it
5026 compute_record_mode (CLASSTYPE_AS_BASE (t));
5028 virtuals = modify_all_vtables (t, nreverse (virtuals));
5030 /* If necessary, create the primary vtable for this class. */
5031 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
5033 /* We must enter these virtuals into the table. */
5034 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5035 build_primary_vtable (NULL_TREE, t);
5036 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
5037 /* Here we know enough to change the type of our virtual
5038 function table, but we will wait until later this function. */
5039 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
5042 if (TYPE_CONTAINS_VPTR_P (t))
5047 if (BINFO_VTABLE (TYPE_BINFO (t)))
5048 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t))));
5049 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5050 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE);
5052 /* Add entries for virtual functions introduced by this class. */
5053 BINFO_VIRTUALS (TYPE_BINFO (t))
5054 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals);
5056 /* Set DECL_VINDEX for all functions declared in this class. */
5057 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
5059 fn = TREE_CHAIN (fn),
5060 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5061 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
5063 tree fndecl = BV_FN (fn);
5065 if (DECL_THUNK_P (fndecl))
5066 /* A thunk. We should never be calling this entry directly
5067 from this vtable -- we'd use the entry for the non
5068 thunk base function. */
5069 DECL_VINDEX (fndecl) = NULL_TREE;
5070 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
5071 DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex);
5075 finish_struct_bits (t);
5077 /* Complete the rtl for any static member objects of the type we're
5079 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
5080 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
5081 && TREE_TYPE (x) != error_mark_node
5082 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
5083 DECL_MODE (x) = TYPE_MODE (t);
5085 /* Done with FIELDS...now decide whether to sort these for
5086 faster lookups later.
5088 We use a small number because most searches fail (succeeding
5089 ultimately as the search bores through the inheritance
5090 hierarchy), and we want this failure to occur quickly. */
5092 n_fields = count_fields (TYPE_FIELDS (t));
5095 struct sorted_fields_type *field_vec = GGC_NEWVAR
5096 (struct sorted_fields_type,
5097 sizeof (struct sorted_fields_type) + n_fields * sizeof (tree));
5098 field_vec->len = n_fields;
5099 add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0);
5100 qsort (field_vec->elts, n_fields, sizeof (tree),
5102 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
5103 retrofit_lang_decl (TYPE_MAIN_DECL (t));
5104 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5107 /* Complain if one of the field types requires lower visibility. */
5108 constrain_class_visibility (t);
5110 /* Make the rtl for any new vtables we have created, and unmark
5111 the base types we marked. */
5114 /* Build the VTT for T. */
5117 /* This warning does not make sense for Java classes, since they
5118 cannot have destructors. */
5119 if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t))
5123 dtor = CLASSTYPE_DESTRUCTORS (t);
5124 /* Warn only if the dtor is non-private or the class has
5126 if (/* An implicitly declared destructor is always public. And,
5127 if it were virtual, we would have created it by now. */
5129 || (!DECL_VINDEX (dtor)
5130 && (!TREE_PRIVATE (dtor)
5131 || CLASSTYPE_FRIEND_CLASSES (t)
5132 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))))
5133 warning (0, "%q#T has virtual functions but non-virtual destructor",
5139 if (warn_overloaded_virtual)
5142 /* Class layout, assignment of virtual table slots, etc., is now
5143 complete. Give the back end a chance to tweak the visibility of
5144 the class or perform any other required target modifications. */
5145 targetm.cxx.adjust_class_at_definition (t);
5147 maybe_suppress_debug_info (t);
5149 dump_class_hierarchy (t);
5151 /* Finish debugging output for this type. */
5152 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5155 /* When T was built up, the member declarations were added in reverse
5156 order. Rearrange them to declaration order. */
5159 unreverse_member_declarations (tree t)
5165 /* The following lists are all in reverse order. Put them in
5166 declaration order now. */
5167 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5168 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
5170 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5171 reverse order, so we can't just use nreverse. */
5173 for (x = TYPE_FIELDS (t);
5174 x && TREE_CODE (x) != TYPE_DECL;
5177 next = TREE_CHAIN (x);
5178 TREE_CHAIN (x) = prev;
5183 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5185 TYPE_FIELDS (t) = prev;
5190 finish_struct (tree t, tree attributes)
5192 location_t saved_loc = input_location;
5194 /* Now that we've got all the field declarations, reverse everything
5196 unreverse_member_declarations (t);
5198 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
5200 /* Nadger the current location so that diagnostics point to the start of
5201 the struct, not the end. */
5202 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
5204 if (processing_template_decl)
5208 finish_struct_methods (t);
5209 TYPE_SIZE (t) = bitsize_zero_node;
5210 TYPE_SIZE_UNIT (t) = size_zero_node;
5212 /* We need to emit an error message if this type was used as a parameter
5213 and it is an abstract type, even if it is a template. We construct
5214 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5215 account and we call complete_vars with this type, which will check
5216 the PARM_DECLS. Note that while the type is being defined,
5217 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5218 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5219 CLASSTYPE_PURE_VIRTUALS (t) = NULL;
5220 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
5221 if (DECL_PURE_VIRTUAL_P (x))
5222 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
5226 finish_struct_1 (t);
5228 input_location = saved_loc;
5230 TYPE_BEING_DEFINED (t) = 0;
5232 if (current_class_type)
5235 error ("trying to finish struct, but kicked out due to previous parse errors");
5237 if (processing_template_decl && at_function_scope_p ())
5238 add_stmt (build_min (TAG_DEFN, t));
5243 /* Return the dynamic type of INSTANCE, if known.
5244 Used to determine whether the virtual function table is needed
5247 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5248 of our knowledge of its type. *NONNULL should be initialized
5249 before this function is called. */
5252 fixed_type_or_null (tree instance, int *nonnull, int *cdtorp)
5254 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5256 switch (TREE_CODE (instance))
5259 if (POINTER_TYPE_P (TREE_TYPE (instance)))
5262 return RECUR (TREE_OPERAND (instance, 0));
5265 /* This is a call to a constructor, hence it's never zero. */
5266 if (TREE_HAS_CONSTRUCTOR (instance))
5270 return TREE_TYPE (instance);
5275 /* This is a call to a constructor, hence it's never zero. */
5276 if (TREE_HAS_CONSTRUCTOR (instance))
5280 return TREE_TYPE (instance);
5282 return RECUR (TREE_OPERAND (instance, 0));
5284 case POINTER_PLUS_EXPR:
5287 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5288 return RECUR (TREE_OPERAND (instance, 0));
5289 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5290 /* Propagate nonnull. */
5291 return RECUR (TREE_OPERAND (instance, 0));
5297 return RECUR (TREE_OPERAND (instance, 0));
5300 instance = TREE_OPERAND (instance, 0);
5303 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5304 with a real object -- given &p->f, p can still be null. */
5305 tree t = get_base_address (instance);
5306 /* ??? Probably should check DECL_WEAK here. */
5307 if (t && DECL_P (t))
5310 return RECUR (instance);
5313 /* If this component is really a base class reference, then the field
5314 itself isn't definitive. */
5315 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1)))
5316 return RECUR (TREE_OPERAND (instance, 0));
5317 return RECUR (TREE_OPERAND (instance, 1));
5321 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5322 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5326 return TREE_TYPE (TREE_TYPE (instance));
5328 /* fall through... */
5332 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5336 return TREE_TYPE (instance);
5338 else if (instance == current_class_ptr)
5343 /* if we're in a ctor or dtor, we know our type. */
5344 if (DECL_LANG_SPECIFIC (current_function_decl)
5345 && (DECL_CONSTRUCTOR_P (current_function_decl)
5346 || DECL_DESTRUCTOR_P (current_function_decl)))
5350 return TREE_TYPE (TREE_TYPE (instance));
5353 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5355 /* We only need one hash table because it is always left empty. */
5358 ht = htab_create (37,
5363 /* Reference variables should be references to objects. */
5367 /* Enter the INSTANCE in a table to prevent recursion; a
5368 variable's initializer may refer to the variable
5370 if (TREE_CODE (instance) == VAR_DECL
5371 && DECL_INITIAL (instance)
5372 && !htab_find (ht, instance))
5377 slot = htab_find_slot (ht, instance, INSERT);
5379 type = RECUR (DECL_INITIAL (instance));
5380 htab_clear_slot (ht, slot);
5393 /* Return nonzero if the dynamic type of INSTANCE is known, and
5394 equivalent to the static type. We also handle the case where
5395 INSTANCE is really a pointer. Return negative if this is a
5396 ctor/dtor. There the dynamic type is known, but this might not be
5397 the most derived base of the original object, and hence virtual
5398 bases may not be layed out according to this type.
5400 Used to determine whether the virtual function table is needed
5403 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5404 of our knowledge of its type. *NONNULL should be initialized
5405 before this function is called. */
5408 resolves_to_fixed_type_p (tree instance, int* nonnull)
5410 tree t = TREE_TYPE (instance);
5412 tree fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
5413 if (fixed == NULL_TREE)
5415 if (POINTER_TYPE_P (t))
5417 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
5419 return cdtorp ? -1 : 1;
5424 init_class_processing (void)
5426 current_class_depth = 0;
5427 current_class_stack_size = 10;
5429 = XNEWVEC (struct class_stack_node, current_class_stack_size);
5430 local_classes = VEC_alloc (tree, gc, 8);
5431 sizeof_biggest_empty_class = size_zero_node;
5433 ridpointers[(int) RID_PUBLIC] = access_public_node;
5434 ridpointers[(int) RID_PRIVATE] = access_private_node;
5435 ridpointers[(int) RID_PROTECTED] = access_protected_node;
5438 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5441 restore_class_cache (void)
5445 /* We are re-entering the same class we just left, so we don't
5446 have to search the whole inheritance matrix to find all the
5447 decls to bind again. Instead, we install the cached
5448 class_shadowed list and walk through it binding names. */
5449 push_binding_level (previous_class_level);
5450 class_binding_level = previous_class_level;
5451 /* Restore IDENTIFIER_TYPE_VALUE. */
5452 for (type = class_binding_level->type_shadowed;
5454 type = TREE_CHAIN (type))
5455 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type));
5458 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5459 appropriate for TYPE.
5461 So that we may avoid calls to lookup_name, we cache the _TYPE
5462 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5464 For multiple inheritance, we perform a two-pass depth-first search
5465 of the type lattice. */
5468 pushclass (tree type)
5470 class_stack_node_t csn;
5472 type = TYPE_MAIN_VARIANT (type);
5474 /* Make sure there is enough room for the new entry on the stack. */
5475 if (current_class_depth + 1 >= current_class_stack_size)
5477 current_class_stack_size *= 2;
5479 = XRESIZEVEC (struct class_stack_node, current_class_stack,
5480 current_class_stack_size);
5483 /* Insert a new entry on the class stack. */
5484 csn = current_class_stack + current_class_depth;
5485 csn->name = current_class_name;
5486 csn->type = current_class_type;
5487 csn->access = current_access_specifier;
5488 csn->names_used = 0;
5490 current_class_depth++;
5492 /* Now set up the new type. */
5493 current_class_name = TYPE_NAME (type);
5494 if (TREE_CODE (current_class_name) == TYPE_DECL)
5495 current_class_name = DECL_NAME (current_class_name);
5496 current_class_type = type;
5498 /* By default, things in classes are private, while things in
5499 structures or unions are public. */
5500 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5501 ? access_private_node
5502 : access_public_node);
5504 if (previous_class_level
5505 && type != previous_class_level->this_entity
5506 && current_class_depth == 1)
5508 /* Forcibly remove any old class remnants. */
5509 invalidate_class_lookup_cache ();
5512 if (!previous_class_level
5513 || type != previous_class_level->this_entity
5514 || current_class_depth > 1)
5517 restore_class_cache ();
5520 /* When we exit a toplevel class scope, we save its binding level so
5521 that we can restore it quickly. Here, we've entered some other
5522 class, so we must invalidate our cache. */
5525 invalidate_class_lookup_cache (void)
5527 previous_class_level = NULL;
5530 /* Get out of the current class scope. If we were in a class scope
5531 previously, that is the one popped to. */
5538 current_class_depth--;
5539 current_class_name = current_class_stack[current_class_depth].name;
5540 current_class_type = current_class_stack[current_class_depth].type;
5541 current_access_specifier = current_class_stack[current_class_depth].access;
5542 if (current_class_stack[current_class_depth].names_used)
5543 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5546 /* Mark the top of the class stack as hidden. */
5549 push_class_stack (void)
5551 if (current_class_depth)
5552 ++current_class_stack[current_class_depth - 1].hidden;
5555 /* Mark the top of the class stack as un-hidden. */
5558 pop_class_stack (void)
5560 if (current_class_depth)
5561 --current_class_stack[current_class_depth - 1].hidden;
5564 /* Returns 1 if the class type currently being defined is either T or
5565 a nested type of T. */
5568 currently_open_class (tree t)
5572 /* We start looking from 1 because entry 0 is from global scope,
5574 for (i = current_class_depth; i > 0; --i)
5577 if (i == current_class_depth)
5578 c = current_class_type;
5581 if (current_class_stack[i].hidden)
5583 c = current_class_stack[i].type;
5587 if (same_type_p (c, t))
5593 /* If either current_class_type or one of its enclosing classes are derived
5594 from T, return the appropriate type. Used to determine how we found
5595 something via unqualified lookup. */
5598 currently_open_derived_class (tree t)
5602 /* The bases of a dependent type are unknown. */
5603 if (dependent_type_p (t))
5606 if (!current_class_type)
5609 if (DERIVED_FROM_P (t, current_class_type))
5610 return current_class_type;
5612 for (i = current_class_depth - 1; i > 0; --i)
5614 if (current_class_stack[i].hidden)
5616 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5617 return current_class_stack[i].type;
5623 /* When entering a class scope, all enclosing class scopes' names with
5624 static meaning (static variables, static functions, types and
5625 enumerators) have to be visible. This recursive function calls
5626 pushclass for all enclosing class contexts until global or a local
5627 scope is reached. TYPE is the enclosed class. */
5630 push_nested_class (tree type)
5634 /* A namespace might be passed in error cases, like A::B:C. */
5635 if (type == NULL_TREE
5636 || type == error_mark_node
5637 || TREE_CODE (type) == NAMESPACE_DECL
5638 || ! IS_AGGR_TYPE (type)
5639 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5640 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
5643 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
5645 if (context && CLASS_TYPE_P (context))
5646 push_nested_class (context);
5650 /* Undoes a push_nested_class call. */
5653 pop_nested_class (void)
5655 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5658 if (context && CLASS_TYPE_P (context))
5659 pop_nested_class ();
5662 /* Returns the number of extern "LANG" blocks we are nested within. */
5665 current_lang_depth (void)
5667 return VEC_length (tree, current_lang_base);
5670 /* Set global variables CURRENT_LANG_NAME to appropriate value
5671 so that behavior of name-mangling machinery is correct. */
5674 push_lang_context (tree name)
5676 VEC_safe_push (tree, gc, current_lang_base, current_lang_name);
5678 if (name == lang_name_cplusplus)
5680 current_lang_name = name;
5682 else if (name == lang_name_java)
5684 current_lang_name = name;
5685 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5686 (See record_builtin_java_type in decl.c.) However, that causes
5687 incorrect debug entries if these types are actually used.
5688 So we re-enable debug output after extern "Java". */
5689 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5690 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5691 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5692 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5693 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5694 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5695 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5696 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5698 else if (name == lang_name_c)
5700 current_lang_name = name;
5703 error ("language string %<\"%E\"%> not recognized", name);
5706 /* Get out of the current language scope. */
5709 pop_lang_context (void)
5711 current_lang_name = VEC_pop (tree, current_lang_base);
5714 /* Type instantiation routines. */
5716 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5717 matches the TARGET_TYPE. If there is no satisfactory match, return
5718 error_mark_node, and issue an error & warning messages under
5719 control of FLAGS. Permit pointers to member function if FLAGS
5720 permits. If TEMPLATE_ONLY, the name of the overloaded function was
5721 a template-id, and EXPLICIT_TARGS are the explicitly provided
5722 template arguments. If OVERLOAD is for one or more member
5723 functions, then ACCESS_PATH is the base path used to reference
5724 those member functions. */
5727 resolve_address_of_overloaded_function (tree target_type,
5729 tsubst_flags_t flags,
5731 tree explicit_targs,
5734 /* Here's what the standard says:
5738 If the name is a function template, template argument deduction
5739 is done, and if the argument deduction succeeds, the deduced
5740 arguments are used to generate a single template function, which
5741 is added to the set of overloaded functions considered.
5743 Non-member functions and static member functions match targets of
5744 type "pointer-to-function" or "reference-to-function." Nonstatic
5745 member functions match targets of type "pointer-to-member
5746 function;" the function type of the pointer to member is used to
5747 select the member function from the set of overloaded member
5748 functions. If a nonstatic member function is selected, the
5749 reference to the overloaded function name is required to have the
5750 form of a pointer to member as described in 5.3.1.
5752 If more than one function is selected, any template functions in
5753 the set are eliminated if the set also contains a non-template
5754 function, and any given template function is eliminated if the
5755 set contains a second template function that is more specialized
5756 than the first according to the partial ordering rules 14.5.5.2.
5757 After such eliminations, if any, there shall remain exactly one
5758 selected function. */
5761 int is_reference = 0;
5762 /* We store the matches in a TREE_LIST rooted here. The functions
5763 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5764 interoperability with most_specialized_instantiation. */
5765 tree matches = NULL_TREE;
5768 /* By the time we get here, we should be seeing only real
5769 pointer-to-member types, not the internal POINTER_TYPE to
5770 METHOD_TYPE representation. */
5771 gcc_assert (TREE_CODE (target_type) != POINTER_TYPE
5772 || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE);
5774 gcc_assert (is_overloaded_fn (overload));
5776 /* Check that the TARGET_TYPE is reasonable. */
5777 if (TYPE_PTRFN_P (target_type))
5779 else if (TYPE_PTRMEMFUNC_P (target_type))
5780 /* This is OK, too. */
5782 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5784 /* This is OK, too. This comes from a conversion to reference
5786 target_type = build_reference_type (target_type);
5791 if (flags & tf_error)
5792 error ("cannot resolve overloaded function %qD based on"
5793 " conversion to type %qT",
5794 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5795 return error_mark_node;
5798 /* If we can find a non-template function that matches, we can just
5799 use it. There's no point in generating template instantiations
5800 if we're just going to throw them out anyhow. But, of course, we
5801 can only do this when we don't *need* a template function. */
5806 for (fns = overload; fns; fns = OVL_NEXT (fns))
5808 tree fn = OVL_CURRENT (fns);
5811 if (TREE_CODE (fn) == TEMPLATE_DECL)
5812 /* We're not looking for templates just yet. */
5815 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5817 /* We're looking for a non-static member, and this isn't
5818 one, or vice versa. */
5821 /* Ignore functions which haven't been explicitly
5823 if (DECL_ANTICIPATED (fn))
5826 /* See if there's a match. */
5827 fntype = TREE_TYPE (fn);
5829 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5830 else if (!is_reference)
5831 fntype = build_pointer_type (fntype);
5833 if (can_convert_arg (target_type, fntype, fn, LOOKUP_NORMAL))
5834 matches = tree_cons (fn, NULL_TREE, matches);
5838 /* Now, if we've already got a match (or matches), there's no need
5839 to proceed to the template functions. But, if we don't have a
5840 match we need to look at them, too. */
5843 tree target_fn_type;
5844 tree target_arg_types;
5845 tree target_ret_type;
5850 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5852 target_fn_type = TREE_TYPE (target_type);
5853 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5854 target_ret_type = TREE_TYPE (target_fn_type);
5856 /* Never do unification on the 'this' parameter. */
5857 if (TREE_CODE (target_fn_type) == METHOD_TYPE)
5858 target_arg_types = TREE_CHAIN (target_arg_types);
5860 for (fns = overload; fns; fns = OVL_NEXT (fns))
5862 tree fn = OVL_CURRENT (fns);
5864 tree instantiation_type;
5867 if (TREE_CODE (fn) != TEMPLATE_DECL)
5868 /* We're only looking for templates. */
5871 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5873 /* We're not looking for a non-static member, and this is
5874 one, or vice versa. */
5877 /* Try to do argument deduction. */
5878 targs = make_tree_vec (DECL_NTPARMS (fn));
5879 if (fn_type_unification (fn, explicit_targs, targs,
5880 target_arg_types, target_ret_type,
5881 DEDUCE_EXACT, LOOKUP_NORMAL))
5882 /* Argument deduction failed. */
5885 /* Instantiate the template. */
5886 instantiation = instantiate_template (fn, targs, flags);
5887 if (instantiation == error_mark_node)
5888 /* Instantiation failed. */
5891 /* See if there's a match. */
5892 instantiation_type = TREE_TYPE (instantiation);
5894 instantiation_type =
5895 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5896 else if (!is_reference)
5897 instantiation_type = build_pointer_type (instantiation_type);
5898 if (can_convert_arg (target_type, instantiation_type, instantiation,
5900 matches = tree_cons (instantiation, fn, matches);
5903 /* Now, remove all but the most specialized of the matches. */
5906 tree match = most_specialized_instantiation (matches);
5908 if (match != error_mark_node)
5909 matches = tree_cons (TREE_PURPOSE (match),
5915 /* Now we should have exactly one function in MATCHES. */
5916 if (matches == NULL_TREE)
5918 /* There were *no* matches. */
5919 if (flags & tf_error)
5921 error ("no matches converting function %qD to type %q#T",
5922 DECL_NAME (OVL_FUNCTION (overload)),
5925 /* print_candidates expects a chain with the functions in
5926 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5927 so why be clever?). */
5928 for (; overload; overload = OVL_NEXT (overload))
5929 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5932 print_candidates (matches);
5934 return error_mark_node;
5936 else if (TREE_CHAIN (matches))
5938 /* There were too many matches. */
5940 if (flags & tf_error)
5944 error ("converting overloaded function %qD to type %q#T is ambiguous",
5945 DECL_NAME (OVL_FUNCTION (overload)),
5948 /* Since print_candidates expects the functions in the
5949 TREE_VALUE slot, we flip them here. */
5950 for (match = matches; match; match = TREE_CHAIN (match))
5951 TREE_VALUE (match) = TREE_PURPOSE (match);
5953 print_candidates (matches);
5956 return error_mark_node;
5959 /* Good, exactly one match. Now, convert it to the correct type. */
5960 fn = TREE_PURPOSE (matches);
5962 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5963 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
5965 static int explained;
5967 if (!(flags & tf_error))
5968 return error_mark_node;
5970 pedwarn ("assuming pointer to member %qD", fn);
5973 pedwarn ("(a pointer to member can only be formed with %<&%E%>)", fn);
5978 /* If we're doing overload resolution purely for the purpose of
5979 determining conversion sequences, we should not consider the
5980 function used. If this conversion sequence is selected, the
5981 function will be marked as used at this point. */
5982 if (!(flags & tf_conv))
5985 /* We could not check access when this expression was originally
5986 created since we did not know at that time to which function
5987 the expression referred. */
5988 if (DECL_FUNCTION_MEMBER_P (fn))
5990 gcc_assert (access_path);
5991 perform_or_defer_access_check (access_path, fn, fn);
5995 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5996 return build_unary_op (ADDR_EXPR, fn, 0);
5999 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
6000 will mark the function as addressed, but here we must do it
6002 cxx_mark_addressable (fn);
6008 /* This function will instantiate the type of the expression given in
6009 RHS to match the type of LHSTYPE. If errors exist, then return
6010 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6011 we complain on errors. If we are not complaining, never modify rhs,
6012 as overload resolution wants to try many possible instantiations, in
6013 the hope that at least one will work.
6015 For non-recursive calls, LHSTYPE should be a function, pointer to
6016 function, or a pointer to member function. */
6019 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
6021 tsubst_flags_t flags_in = flags;
6022 tree access_path = NULL_TREE;
6024 flags &= ~tf_ptrmem_ok;
6026 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
6028 if (flags & tf_error)
6029 error ("not enough type information");
6030 return error_mark_node;
6033 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
6035 if (same_type_p (lhstype, TREE_TYPE (rhs)))
6037 if (flag_ms_extensions
6038 && TYPE_PTRMEMFUNC_P (lhstype)
6039 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
6040 /* Microsoft allows `A::f' to be resolved to a
6041 pointer-to-member. */
6045 if (flags & tf_error)
6046 error ("argument of type %qT does not match %qT",
6047 TREE_TYPE (rhs), lhstype);
6048 return error_mark_node;
6052 if (TREE_CODE (rhs) == BASELINK)
6054 access_path = BASELINK_ACCESS_BINFO (rhs);
6055 rhs = BASELINK_FUNCTIONS (rhs);
6058 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6059 deduce any type information. */
6060 if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR)
6062 if (flags & tf_error)
6063 error ("not enough type information");
6064 return error_mark_node;
6067 /* There only a few kinds of expressions that may have a type
6068 dependent on overload resolution. */
6069 gcc_assert (TREE_CODE (rhs) == ADDR_EXPR
6070 || TREE_CODE (rhs) == COMPONENT_REF
6071 || TREE_CODE (rhs) == COMPOUND_EXPR
6072 || really_overloaded_fn (rhs));
6074 /* We don't overwrite rhs if it is an overloaded function.
6075 Copying it would destroy the tree link. */
6076 if (TREE_CODE (rhs) != OVERLOAD)
6077 rhs = copy_node (rhs);
6079 /* This should really only be used when attempting to distinguish
6080 what sort of a pointer to function we have. For now, any
6081 arithmetic operation which is not supported on pointers
6082 is rejected as an error. */
6084 switch (TREE_CODE (rhs))
6088 tree member = TREE_OPERAND (rhs, 1);
6090 member = instantiate_type (lhstype, member, flags);
6091 if (member != error_mark_node
6092 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
6093 /* Do not lose object's side effects. */
6094 return build2 (COMPOUND_EXPR, TREE_TYPE (member),
6095 TREE_OPERAND (rhs, 0), member);
6100 rhs = TREE_OPERAND (rhs, 1);
6101 if (BASELINK_P (rhs))
6102 return instantiate_type (lhstype, rhs, flags_in);
6104 /* This can happen if we are forming a pointer-to-member for a
6106 gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR);
6110 case TEMPLATE_ID_EXPR:
6112 tree fns = TREE_OPERAND (rhs, 0);
6113 tree args = TREE_OPERAND (rhs, 1);
6116 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
6117 /*template_only=*/true,
6124 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
6125 /*template_only=*/false,
6126 /*explicit_targs=*/NULL_TREE,
6130 TREE_OPERAND (rhs, 0)
6131 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6132 if (TREE_OPERAND (rhs, 0) == error_mark_node)
6133 return error_mark_node;
6134 TREE_OPERAND (rhs, 1)
6135 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6136 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6137 return error_mark_node;
6139 TREE_TYPE (rhs) = lhstype;
6144 if (PTRMEM_OK_P (rhs))
6145 flags |= tf_ptrmem_ok;
6147 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6151 return error_mark_node;
6156 return error_mark_node;
6159 /* Return the name of the virtual function pointer field
6160 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6161 this may have to look back through base types to find the
6162 ultimate field name. (For single inheritance, these could
6163 all be the same name. Who knows for multiple inheritance). */
6166 get_vfield_name (tree type)
6168 tree binfo, base_binfo;
6171 for (binfo = TYPE_BINFO (type);
6172 BINFO_N_BASE_BINFOS (binfo);
6175 base_binfo = BINFO_BASE_BINFO (binfo, 0);
6177 if (BINFO_VIRTUAL_P (base_binfo)
6178 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo)))
6182 type = BINFO_TYPE (binfo);
6183 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
6184 + TYPE_NAME_LENGTH (type) + 2);
6185 sprintf (buf, VFIELD_NAME_FORMAT,
6186 IDENTIFIER_POINTER (constructor_name (type)));
6187 return get_identifier (buf);
6191 print_class_statistics (void)
6193 #ifdef GATHER_STATISTICS
6194 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6195 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6198 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6199 n_vtables, n_vtable_searches);
6200 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6201 n_vtable_entries, n_vtable_elems);
6206 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6207 according to [class]:
6208 The class-name is also inserted
6209 into the scope of the class itself. For purposes of access checking,
6210 the inserted class name is treated as if it were a public member name. */
6213 build_self_reference (void)
6215 tree name = constructor_name (current_class_type);
6216 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6219 DECL_NONLOCAL (value) = 1;
6220 DECL_CONTEXT (value) = current_class_type;
6221 DECL_ARTIFICIAL (value) = 1;
6222 SET_DECL_SELF_REFERENCE_P (value);
6224 if (processing_template_decl)
6225 value = push_template_decl (value);
6227 saved_cas = current_access_specifier;
6228 current_access_specifier = access_public_node;
6229 finish_member_declaration (value);
6230 current_access_specifier = saved_cas;
6233 /* Returns 1 if TYPE contains only padding bytes. */
6236 is_empty_class (tree type)
6238 if (type == error_mark_node)
6241 if (! IS_AGGR_TYPE (type))
6244 /* In G++ 3.2, whether or not a class was empty was determined by
6245 looking at its size. */
6246 if (abi_version_at_least (2))
6247 return CLASSTYPE_EMPTY_P (type);
6249 return integer_zerop (CLASSTYPE_SIZE (type));
6252 /* Returns true if TYPE contains an empty class. */
6255 contains_empty_class_p (tree type)
6257 if (is_empty_class (type))
6259 if (CLASS_TYPE_P (type))
6266 for (binfo = TYPE_BINFO (type), i = 0;
6267 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6268 if (contains_empty_class_p (BINFO_TYPE (base_binfo)))
6270 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6271 if (TREE_CODE (field) == FIELD_DECL
6272 && !DECL_ARTIFICIAL (field)
6273 && is_empty_class (TREE_TYPE (field)))
6276 else if (TREE_CODE (type) == ARRAY_TYPE)
6277 return contains_empty_class_p (TREE_TYPE (type));
6281 /* Note that NAME was looked up while the current class was being
6282 defined and that the result of that lookup was DECL. */
6285 maybe_note_name_used_in_class (tree name, tree decl)
6287 splay_tree names_used;
6289 /* If we're not defining a class, there's nothing to do. */
6290 if (!(innermost_scope_kind() == sk_class
6291 && TYPE_BEING_DEFINED (current_class_type)))
6294 /* If there's already a binding for this NAME, then we don't have
6295 anything to worry about. */
6296 if (lookup_member (current_class_type, name,
6297 /*protect=*/0, /*want_type=*/false))
6300 if (!current_class_stack[current_class_depth - 1].names_used)
6301 current_class_stack[current_class_depth - 1].names_used
6302 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6303 names_used = current_class_stack[current_class_depth - 1].names_used;
6305 splay_tree_insert (names_used,
6306 (splay_tree_key) name,
6307 (splay_tree_value) decl);
6310 /* Note that NAME was declared (as DECL) in the current class. Check
6311 to see that the declaration is valid. */
6314 note_name_declared_in_class (tree name, tree decl)
6316 splay_tree names_used;
6319 /* Look to see if we ever used this name. */
6321 = current_class_stack[current_class_depth - 1].names_used;
6325 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6328 /* [basic.scope.class]
6330 A name N used in a class S shall refer to the same declaration
6331 in its context and when re-evaluated in the completed scope of
6333 pedwarn ("declaration of %q#D", decl);
6334 pedwarn ("changes meaning of %qD from %q+#D",
6335 DECL_NAME (OVL_CURRENT (decl)), (tree) n->value);
6339 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6340 Secondary vtables are merged with primary vtables; this function
6341 will return the VAR_DECL for the primary vtable. */
6344 get_vtbl_decl_for_binfo (tree binfo)
6348 decl = BINFO_VTABLE (binfo);
6349 if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR)
6351 gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR);
6352 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6355 gcc_assert (TREE_CODE (decl) == VAR_DECL);
6360 /* Returns the binfo for the primary base of BINFO. If the resulting
6361 BINFO is a virtual base, and it is inherited elsewhere in the
6362 hierarchy, then the returned binfo might not be the primary base of
6363 BINFO in the complete object. Check BINFO_PRIMARY_P or
6364 BINFO_LOST_PRIMARY_P to be sure. */
6367 get_primary_binfo (tree binfo)
6371 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6375 return copied_binfo (primary_base, binfo);
6378 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6381 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
6384 fprintf (stream, "%*s", indent, "");
6388 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6389 INDENT should be zero when called from the top level; it is
6390 incremented recursively. IGO indicates the next expected BINFO in
6391 inheritance graph ordering. */
6394 dump_class_hierarchy_r (FILE *stream,
6404 indented = maybe_indent_hierarchy (stream, indent, 0);
6405 fprintf (stream, "%s (0x%lx) ",
6406 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER),
6407 (unsigned long) binfo);
6410 fprintf (stream, "alternative-path\n");
6413 igo = TREE_CHAIN (binfo);
6415 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
6416 tree_low_cst (BINFO_OFFSET (binfo), 0));
6417 if (is_empty_class (BINFO_TYPE (binfo)))
6418 fprintf (stream, " empty");
6419 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
6420 fprintf (stream, " nearly-empty");
6421 if (BINFO_VIRTUAL_P (binfo))
6422 fprintf (stream, " virtual");
6423 fprintf (stream, "\n");
6426 if (BINFO_PRIMARY_P (binfo))
6428 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6429 fprintf (stream, " primary-for %s (0x%lx)",
6430 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
6431 TFF_PLAIN_IDENTIFIER),
6432 (unsigned long)BINFO_INHERITANCE_CHAIN (binfo));
6434 if (BINFO_LOST_PRIMARY_P (binfo))
6436 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6437 fprintf (stream, " lost-primary");
6440 fprintf (stream, "\n");
6442 if (!(flags & TDF_SLIM))
6446 if (BINFO_SUBVTT_INDEX (binfo))
6448 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6449 fprintf (stream, " subvttidx=%s",
6450 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
6451 TFF_PLAIN_IDENTIFIER));
6453 if (BINFO_VPTR_INDEX (binfo))
6455 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6456 fprintf (stream, " vptridx=%s",
6457 expr_as_string (BINFO_VPTR_INDEX (binfo),
6458 TFF_PLAIN_IDENTIFIER));
6460 if (BINFO_VPTR_FIELD (binfo))
6462 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6463 fprintf (stream, " vbaseoffset=%s",
6464 expr_as_string (BINFO_VPTR_FIELD (binfo),
6465 TFF_PLAIN_IDENTIFIER));
6467 if (BINFO_VTABLE (binfo))
6469 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6470 fprintf (stream, " vptr=%s",
6471 expr_as_string (BINFO_VTABLE (binfo),
6472 TFF_PLAIN_IDENTIFIER));
6476 fprintf (stream, "\n");
6479 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
6480 igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2);
6485 /* Dump the BINFO hierarchy for T. */
6488 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
6490 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6491 fprintf (stream, " size=%lu align=%lu\n",
6492 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
6493 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
6494 fprintf (stream, " base size=%lu base align=%lu\n",
6495 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
6497 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
6499 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
6500 fprintf (stream, "\n");
6503 /* Debug interface to hierarchy dumping. */
6506 debug_class (tree t)
6508 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
6512 dump_class_hierarchy (tree t)
6515 FILE *stream = dump_begin (TDI_class, &flags);
6519 dump_class_hierarchy_1 (stream, flags, t);
6520 dump_end (TDI_class, stream);
6525 dump_array (FILE * stream, tree decl)
6528 unsigned HOST_WIDE_INT ix;
6530 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
6532 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
6534 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
6535 fprintf (stream, " %s entries",
6536 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
6537 TFF_PLAIN_IDENTIFIER));
6538 fprintf (stream, "\n");
6540 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
6542 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
6543 expr_as_string (value, TFF_PLAIN_IDENTIFIER));
6547 dump_vtable (tree t, tree binfo, tree vtable)
6550 FILE *stream = dump_begin (TDI_class, &flags);
6555 if (!(flags & TDF_SLIM))
6557 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
6559 fprintf (stream, "%s for %s",
6560 ctor_vtbl_p ? "Construction vtable" : "Vtable",
6561 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER));
6564 if (!BINFO_VIRTUAL_P (binfo))
6565 fprintf (stream, " (0x%lx instance)", (unsigned long)binfo);
6566 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6568 fprintf (stream, "\n");
6569 dump_array (stream, vtable);
6570 fprintf (stream, "\n");
6573 dump_end (TDI_class, stream);
6577 dump_vtt (tree t, tree vtt)
6580 FILE *stream = dump_begin (TDI_class, &flags);
6585 if (!(flags & TDF_SLIM))
6587 fprintf (stream, "VTT for %s\n",
6588 type_as_string (t, TFF_PLAIN_IDENTIFIER));
6589 dump_array (stream, vtt);
6590 fprintf (stream, "\n");
6593 dump_end (TDI_class, stream);
6596 /* Dump a function or thunk and its thunkees. */
6599 dump_thunk (FILE *stream, int indent, tree thunk)
6601 static const char spaces[] = " ";
6602 tree name = DECL_NAME (thunk);
6605 fprintf (stream, "%.*s%p %s %s", indent, spaces,
6607 !DECL_THUNK_P (thunk) ? "function"
6608 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
6609 name ? IDENTIFIER_POINTER (name) : "<unset>");
6610 if (DECL_THUNK_P (thunk))
6612 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
6613 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
6615 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
6616 if (!virtual_adjust)
6618 else if (DECL_THIS_THUNK_P (thunk))
6619 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
6620 tree_low_cst (virtual_adjust, 0));
6622 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
6623 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
6624 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
6625 if (THUNK_ALIAS (thunk))
6626 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
6628 fprintf (stream, "\n");
6629 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
6630 dump_thunk (stream, indent + 2, thunks);
6633 /* Dump the thunks for FN. */
6636 debug_thunks (tree fn)
6638 dump_thunk (stderr, 0, fn);
6641 /* Virtual function table initialization. */
6643 /* Create all the necessary vtables for T and its base classes. */
6646 finish_vtbls (tree t)
6651 /* We lay out the primary and secondary vtables in one contiguous
6652 vtable. The primary vtable is first, followed by the non-virtual
6653 secondary vtables in inheritance graph order. */
6654 list = build_tree_list (BINFO_VTABLE (TYPE_BINFO (t)), NULL_TREE);
6655 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6656 TYPE_BINFO (t), t, list);
6658 /* Then come the virtual bases, also in inheritance graph order. */
6659 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6661 if (!BINFO_VIRTUAL_P (vbase))
6663 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6666 if (BINFO_VTABLE (TYPE_BINFO (t)))
6667 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6670 /* Initialize the vtable for BINFO with the INITS. */
6673 initialize_vtable (tree binfo, tree inits)
6677 layout_vtable_decl (binfo, list_length (inits));
6678 decl = get_vtbl_decl_for_binfo (binfo);
6679 initialize_artificial_var (decl, inits);
6680 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
6683 /* Build the VTT (virtual table table) for T.
6684 A class requires a VTT if it has virtual bases.
6687 1 - primary virtual pointer for complete object T
6688 2 - secondary VTTs for each direct non-virtual base of T which requires a
6690 3 - secondary virtual pointers for each direct or indirect base of T which
6691 has virtual bases or is reachable via a virtual path from T.
6692 4 - secondary VTTs for each direct or indirect virtual base of T.
6694 Secondary VTTs look like complete object VTTs without part 4. */
6704 /* Build up the initializers for the VTT. */
6706 index = size_zero_node;
6707 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
6709 /* If we didn't need a VTT, we're done. */
6713 /* Figure out the type of the VTT. */
6714 type = build_index_type (size_int (list_length (inits) - 1));
6715 type = build_cplus_array_type (const_ptr_type_node, type);
6717 /* Now, build the VTT object itself. */
6718 vtt = build_vtable (t, mangle_vtt_for_type (t), type);
6719 initialize_artificial_var (vtt, inits);
6720 /* Add the VTT to the vtables list. */
6721 TREE_CHAIN (vtt) = TREE_CHAIN (CLASSTYPE_VTABLES (t));
6722 TREE_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
6727 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6728 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6729 and CHAIN the vtable pointer for this binfo after construction is
6730 complete. VALUE can also be another BINFO, in which case we recurse. */
6733 binfo_ctor_vtable (tree binfo)
6739 vt = BINFO_VTABLE (binfo);
6740 if (TREE_CODE (vt) == TREE_LIST)
6741 vt = TREE_VALUE (vt);
6742 if (TREE_CODE (vt) == TREE_BINFO)
6751 /* Data for secondary VTT initialization. */
6752 typedef struct secondary_vptr_vtt_init_data_s
6754 /* Is this the primary VTT? */
6757 /* Current index into the VTT. */
6760 /* TREE_LIST of initializers built up. */
6763 /* The type being constructed by this secondary VTT. */
6764 tree type_being_constructed;
6765 } secondary_vptr_vtt_init_data;
6767 /* Recursively build the VTT-initializer for BINFO (which is in the
6768 hierarchy dominated by T). INITS points to the end of the initializer
6769 list to date. INDEX is the VTT index where the next element will be
6770 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6771 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6772 for virtual bases of T. When it is not so, we build the constructor
6773 vtables for the BINFO-in-T variant. */
6776 build_vtt_inits (tree binfo, tree t, tree *inits, tree *index)
6781 tree secondary_vptrs;
6782 secondary_vptr_vtt_init_data data;
6783 int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
6785 /* We only need VTTs for subobjects with virtual bases. */
6786 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
6789 /* We need to use a construction vtable if this is not the primary
6793 build_ctor_vtbl_group (binfo, t);
6795 /* Record the offset in the VTT where this sub-VTT can be found. */
6796 BINFO_SUBVTT_INDEX (binfo) = *index;
6799 /* Add the address of the primary vtable for the complete object. */
6800 init = binfo_ctor_vtable (binfo);
6801 *inits = build_tree_list (NULL_TREE, init);
6802 inits = &TREE_CHAIN (*inits);
6805 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6806 BINFO_VPTR_INDEX (binfo) = *index;
6808 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6810 /* Recursively add the secondary VTTs for non-virtual bases. */
6811 for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i)
6812 if (!BINFO_VIRTUAL_P (b))
6813 inits = build_vtt_inits (b, t, inits, index);
6815 /* Add secondary virtual pointers for all subobjects of BINFO with
6816 either virtual bases or reachable along a virtual path, except
6817 subobjects that are non-virtual primary bases. */
6818 data.top_level_p = top_level_p;
6819 data.index = *index;
6821 data.type_being_constructed = BINFO_TYPE (binfo);
6823 dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data);
6825 *index = data.index;
6827 /* The secondary vptrs come back in reverse order. After we reverse
6828 them, and add the INITS, the last init will be the first element
6830 secondary_vptrs = data.inits;
6831 if (secondary_vptrs)
6833 *inits = nreverse (secondary_vptrs);
6834 inits = &TREE_CHAIN (secondary_vptrs);
6835 gcc_assert (*inits == NULL_TREE);
6839 /* Add the secondary VTTs for virtual bases in inheritance graph
6841 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6843 if (!BINFO_VIRTUAL_P (b))
6846 inits = build_vtt_inits (b, t, inits, index);
6849 /* Remove the ctor vtables we created. */
6850 dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo);
6855 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
6856 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
6859 dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_)
6861 secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_;
6863 /* We don't care about bases that don't have vtables. */
6864 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6865 return dfs_skip_bases;
6867 /* We're only interested in proper subobjects of the type being
6869 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed))
6872 /* We're only interested in bases with virtual bases or reachable
6873 via a virtual path from the type being constructed. */
6874 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6875 || binfo_via_virtual (binfo, data->type_being_constructed)))
6876 return dfs_skip_bases;
6878 /* We're not interested in non-virtual primary bases. */
6879 if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo))
6882 /* Record the index where this secondary vptr can be found. */
6883 if (data->top_level_p)
6885 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6886 BINFO_VPTR_INDEX (binfo) = data->index;
6888 if (BINFO_VIRTUAL_P (binfo))
6890 /* It's a primary virtual base, and this is not a
6891 construction vtable. Find the base this is primary of in
6892 the inheritance graph, and use that base's vtable
6894 while (BINFO_PRIMARY_P (binfo))
6895 binfo = BINFO_INHERITANCE_CHAIN (binfo);
6899 /* Add the initializer for the secondary vptr itself. */
6900 data->inits = tree_cons (NULL_TREE, binfo_ctor_vtable (binfo), data->inits);
6902 /* Advance the vtt index. */
6903 data->index = size_binop (PLUS_EXPR, data->index,
6904 TYPE_SIZE_UNIT (ptr_type_node));
6909 /* Called from build_vtt_inits via dfs_walk. After building
6910 constructor vtables and generating the sub-vtt from them, we need
6911 to restore the BINFO_VTABLES that were scribbled on. DATA is the
6912 binfo of the base whose sub vtt was generated. */
6915 dfs_fixup_binfo_vtbls (tree binfo, void* data)
6917 tree vtable = BINFO_VTABLE (binfo);
6919 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6920 /* If this class has no vtable, none of its bases do. */
6921 return dfs_skip_bases;
6924 /* This might be a primary base, so have no vtable in this
6928 /* If we scribbled the construction vtable vptr into BINFO, clear it
6930 if (TREE_CODE (vtable) == TREE_LIST
6931 && (TREE_PURPOSE (vtable) == (tree) data))
6932 BINFO_VTABLE (binfo) = TREE_CHAIN (vtable);
6937 /* Build the construction vtable group for BINFO which is in the
6938 hierarchy dominated by T. */
6941 build_ctor_vtbl_group (tree binfo, tree t)
6950 /* See if we've already created this construction vtable group. */
6951 id = mangle_ctor_vtbl_for_type (t, binfo);
6952 if (IDENTIFIER_GLOBAL_VALUE (id))
6955 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t));
6956 /* Build a version of VTBL (with the wrong type) for use in
6957 constructing the addresses of secondary vtables in the
6958 construction vtable group. */
6959 vtbl = build_vtable (t, id, ptr_type_node);
6960 DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1;
6961 list = build_tree_list (vtbl, NULL_TREE);
6962 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
6965 /* Add the vtables for each of our virtual bases using the vbase in T
6967 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
6969 vbase = TREE_CHAIN (vbase))
6973 if (!BINFO_VIRTUAL_P (vbase))
6975 b = copied_binfo (vbase, binfo);
6977 accumulate_vtbl_inits (b, vbase, binfo, t, list);
6979 inits = TREE_VALUE (list);
6981 /* Figure out the type of the construction vtable. */
6982 type = build_index_type (size_int (list_length (inits) - 1));
6983 type = build_cplus_array_type (vtable_entry_type, type);
6984 TREE_TYPE (vtbl) = type;
6986 /* Initialize the construction vtable. */
6987 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
6988 initialize_artificial_var (vtbl, inits);
6989 dump_vtable (t, binfo, vtbl);
6992 /* Add the vtbl initializers for BINFO (and its bases other than
6993 non-virtual primaries) to the list of INITS. BINFO is in the
6994 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
6995 the constructor the vtbl inits should be accumulated for. (If this
6996 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
6997 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
6998 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
6999 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7000 but are not necessarily the same in terms of layout. */
7003 accumulate_vtbl_inits (tree binfo,
7011 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7013 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo)));
7015 /* If it doesn't have a vptr, we don't do anything. */
7016 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
7019 /* If we're building a construction vtable, we're not interested in
7020 subobjects that don't require construction vtables. */
7022 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
7023 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
7026 /* Build the initializers for the BINFO-in-T vtable. */
7028 = chainon (TREE_VALUE (inits),
7029 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
7030 rtti_binfo, t, inits));
7032 /* Walk the BINFO and its bases. We walk in preorder so that as we
7033 initialize each vtable we can figure out at what offset the
7034 secondary vtable lies from the primary vtable. We can't use
7035 dfs_walk here because we need to iterate through bases of BINFO
7036 and RTTI_BINFO simultaneously. */
7037 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7039 /* Skip virtual bases. */
7040 if (BINFO_VIRTUAL_P (base_binfo))
7042 accumulate_vtbl_inits (base_binfo,
7043 BINFO_BASE_BINFO (orig_binfo, i),
7049 /* Called from accumulate_vtbl_inits. Returns the initializers for
7050 the BINFO vtable. */
7053 dfs_accumulate_vtbl_inits (tree binfo,
7059 tree inits = NULL_TREE;
7060 tree vtbl = NULL_TREE;
7061 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7064 && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
7066 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7067 primary virtual base. If it is not the same primary in
7068 the hierarchy of T, we'll need to generate a ctor vtable
7069 for it, to place at its location in T. If it is the same
7070 primary, we still need a VTT entry for the vtable, but it
7071 should point to the ctor vtable for the base it is a
7072 primary for within the sub-hierarchy of RTTI_BINFO.
7074 There are three possible cases:
7076 1) We are in the same place.
7077 2) We are a primary base within a lost primary virtual base of
7079 3) We are primary to something not a base of RTTI_BINFO. */
7082 tree last = NULL_TREE;
7084 /* First, look through the bases we are primary to for RTTI_BINFO
7085 or a virtual base. */
7087 while (BINFO_PRIMARY_P (b))
7089 b = BINFO_INHERITANCE_CHAIN (b);
7091 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7094 /* If we run out of primary links, keep looking down our
7095 inheritance chain; we might be an indirect primary. */
7096 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
7097 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7101 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7102 base B and it is a base of RTTI_BINFO, this is case 2. In
7103 either case, we share our vtable with LAST, i.e. the
7104 derived-most base within B of which we are a primary. */
7106 || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo))))
7107 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7108 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7109 binfo_ctor_vtable after everything's been set up. */
7112 /* Otherwise, this is case 3 and we get our own. */
7114 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
7122 /* Compute the initializer for this vtable. */
7123 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7126 /* Figure out the position to which the VPTR should point. */
7127 vtbl = TREE_PURPOSE (l);
7128 vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, vtbl);
7129 index = size_binop (PLUS_EXPR,
7130 size_int (non_fn_entries),
7131 size_int (list_length (TREE_VALUE (l))));
7132 index = size_binop (MULT_EXPR,
7133 TYPE_SIZE_UNIT (vtable_entry_type),
7135 vtbl = build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7139 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7140 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7141 straighten this out. */
7142 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7143 else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo))
7146 /* For an ordinary vtable, set BINFO_VTABLE. */
7147 BINFO_VTABLE (binfo) = vtbl;
7152 static GTY(()) tree abort_fndecl_addr;
7154 /* Construct the initializer for BINFO's virtual function table. BINFO
7155 is part of the hierarchy dominated by T. If we're building a
7156 construction vtable, the ORIG_BINFO is the binfo we should use to
7157 find the actual function pointers to put in the vtable - but they
7158 can be overridden on the path to most-derived in the graph that
7159 ORIG_BINFO belongs. Otherwise,
7160 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7161 BINFO that should be indicated by the RTTI information in the
7162 vtable; it will be a base class of T, rather than T itself, if we
7163 are building a construction vtable.
7165 The value returned is a TREE_LIST suitable for wrapping in a
7166 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7167 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7168 number of non-function entries in the vtable.
7170 It might seem that this function should never be called with a
7171 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7172 base is always subsumed by a derived class vtable. However, when
7173 we are building construction vtables, we do build vtables for
7174 primary bases; we need these while the primary base is being
7178 build_vtbl_initializer (tree binfo,
7182 int* non_fn_entries_p)
7189 VEC(tree,gc) *vbases;
7191 /* Initialize VID. */
7192 memset (&vid, 0, sizeof (vid));
7195 vid.rtti_binfo = rtti_binfo;
7196 vid.last_init = &vid.inits;
7197 vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
7198 vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7199 vid.generate_vcall_entries = true;
7200 /* The first vbase or vcall offset is at index -3 in the vtable. */
7201 vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
7203 /* Add entries to the vtable for RTTI. */
7204 build_rtti_vtbl_entries (binfo, &vid);
7206 /* Create an array for keeping track of the functions we've
7207 processed. When we see multiple functions with the same
7208 signature, we share the vcall offsets. */
7209 vid.fns = VEC_alloc (tree, gc, 32);
7210 /* Add the vcall and vbase offset entries. */
7211 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7213 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7214 build_vbase_offset_vtbl_entries. */
7215 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
7216 VEC_iterate (tree, vbases, ix, vbinfo); ix++)
7217 BINFO_VTABLE_PATH_MARKED (vbinfo) = 0;
7219 /* If the target requires padding between data entries, add that now. */
7220 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
7224 for (prev = &vid.inits; (cur = *prev); prev = &TREE_CHAIN (cur))
7229 for (i = 1; i < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++i)
7230 add = tree_cons (NULL_TREE,
7231 build1 (NOP_EXPR, vtable_entry_type,
7238 if (non_fn_entries_p)
7239 *non_fn_entries_p = list_length (vid.inits);
7241 /* Go through all the ordinary virtual functions, building up
7243 vfun_inits = NULL_TREE;
7244 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7248 tree fn, fn_original;
7249 tree init = NULL_TREE;
7253 if (DECL_THUNK_P (fn))
7255 if (!DECL_NAME (fn))
7257 if (THUNK_ALIAS (fn))
7259 fn = THUNK_ALIAS (fn);
7262 fn_original = THUNK_TARGET (fn);
7265 /* If the only definition of this function signature along our
7266 primary base chain is from a lost primary, this vtable slot will
7267 never be used, so just zero it out. This is important to avoid
7268 requiring extra thunks which cannot be generated with the function.
7270 We first check this in update_vtable_entry_for_fn, so we handle
7271 restored primary bases properly; we also need to do it here so we
7272 zero out unused slots in ctor vtables, rather than filling themff
7273 with erroneous values (though harmless, apart from relocation
7275 for (b = binfo; ; b = get_primary_binfo (b))
7277 /* We found a defn before a lost primary; go ahead as normal. */
7278 if (look_for_overrides_here (BINFO_TYPE (b), fn_original))
7281 /* The nearest definition is from a lost primary; clear the
7283 if (BINFO_LOST_PRIMARY_P (b))
7285 init = size_zero_node;
7292 /* Pull the offset for `this', and the function to call, out of
7294 delta = BV_DELTA (v);
7295 vcall_index = BV_VCALL_INDEX (v);
7297 gcc_assert (TREE_CODE (delta) == INTEGER_CST);
7298 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7300 /* You can't call an abstract virtual function; it's abstract.
7301 So, we replace these functions with __pure_virtual. */
7302 if (DECL_PURE_VIRTUAL_P (fn_original))
7305 if (abort_fndecl_addr == NULL)
7306 abort_fndecl_addr = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7307 init = abort_fndecl_addr;
7311 if (!integer_zerop (delta) || vcall_index)
7313 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
7314 if (!DECL_NAME (fn))
7317 /* Take the address of the function, considering it to be of an
7318 appropriate generic type. */
7319 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7323 /* And add it to the chain of initializers. */
7324 if (TARGET_VTABLE_USES_DESCRIPTORS)
7327 if (init == size_zero_node)
7328 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7329 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7331 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7333 tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node,
7334 TREE_OPERAND (init, 0),
7335 build_int_cst (NULL_TREE, i));
7336 TREE_CONSTANT (fdesc) = 1;
7337 TREE_INVARIANT (fdesc) = 1;
7339 vfun_inits = tree_cons (NULL_TREE, fdesc, vfun_inits);
7343 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7346 /* The initializers for virtual functions were built up in reverse
7347 order; straighten them out now. */
7348 vfun_inits = nreverse (vfun_inits);
7350 /* The negative offset initializers are also in reverse order. */
7351 vid.inits = nreverse (vid.inits);
7353 /* Chain the two together. */
7354 return chainon (vid.inits, vfun_inits);
7357 /* Adds to vid->inits the initializers for the vbase and vcall
7358 offsets in BINFO, which is in the hierarchy dominated by T. */
7361 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
7365 /* If this is a derived class, we must first create entries
7366 corresponding to the primary base class. */
7367 b = get_primary_binfo (binfo);
7369 build_vcall_and_vbase_vtbl_entries (b, vid);
7371 /* Add the vbase entries for this base. */
7372 build_vbase_offset_vtbl_entries (binfo, vid);
7373 /* Add the vcall entries for this base. */
7374 build_vcall_offset_vtbl_entries (binfo, vid);
7377 /* Returns the initializers for the vbase offset entries in the vtable
7378 for BINFO (which is part of the class hierarchy dominated by T), in
7379 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7380 where the next vbase offset will go. */
7383 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7387 tree non_primary_binfo;
7389 /* If there are no virtual baseclasses, then there is nothing to
7391 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
7396 /* We might be a primary base class. Go up the inheritance hierarchy
7397 until we find the most derived class of which we are a primary base:
7398 it is the offset of that which we need to use. */
7399 non_primary_binfo = binfo;
7400 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7404 /* If we have reached a virtual base, then it must be a primary
7405 base (possibly multi-level) of vid->binfo, or we wouldn't
7406 have called build_vcall_and_vbase_vtbl_entries for it. But it
7407 might be a lost primary, so just skip down to vid->binfo. */
7408 if (BINFO_VIRTUAL_P (non_primary_binfo))
7410 non_primary_binfo = vid->binfo;
7414 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7415 if (get_primary_binfo (b) != non_primary_binfo)
7417 non_primary_binfo = b;
7420 /* Go through the virtual bases, adding the offsets. */
7421 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7423 vbase = TREE_CHAIN (vbase))
7428 if (!BINFO_VIRTUAL_P (vbase))
7431 /* Find the instance of this virtual base in the complete
7433 b = copied_binfo (vbase, binfo);
7435 /* If we've already got an offset for this virtual base, we
7436 don't need another one. */
7437 if (BINFO_VTABLE_PATH_MARKED (b))
7439 BINFO_VTABLE_PATH_MARKED (b) = 1;
7441 /* Figure out where we can find this vbase offset. */
7442 delta = size_binop (MULT_EXPR,
7445 TYPE_SIZE_UNIT (vtable_entry_type)));
7446 if (vid->primary_vtbl_p)
7447 BINFO_VPTR_FIELD (b) = delta;
7449 if (binfo != TYPE_BINFO (t))
7450 /* The vbase offset had better be the same. */
7451 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase)));
7453 /* The next vbase will come at a more negative offset. */
7454 vid->index = size_binop (MINUS_EXPR, vid->index,
7455 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7457 /* The initializer is the delta from BINFO to this virtual base.
7458 The vbase offsets go in reverse inheritance-graph order, and
7459 we are walking in inheritance graph order so these end up in
7461 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
7464 = build_tree_list (NULL_TREE,
7465 fold_build1 (NOP_EXPR,
7468 vid->last_init = &TREE_CHAIN (*vid->last_init);
7472 /* Adds the initializers for the vcall offset entries in the vtable
7473 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7477 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7479 /* We only need these entries if this base is a virtual base. We
7480 compute the indices -- but do not add to the vtable -- when
7481 building the main vtable for a class. */
7482 if (binfo == TYPE_BINFO (vid->derived)
7483 || (BINFO_VIRTUAL_P (binfo)
7484 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7485 correspond to VID->DERIVED), we are building a primary
7486 construction virtual table. Since this is a primary
7487 virtual table, we do not need the vcall offsets for
7489 && binfo != vid->rtti_binfo))
7491 /* We need a vcall offset for each of the virtual functions in this
7492 vtable. For example:
7494 class A { virtual void f (); };
7495 class B1 : virtual public A { virtual void f (); };
7496 class B2 : virtual public A { virtual void f (); };
7497 class C: public B1, public B2 { virtual void f (); };
7499 A C object has a primary base of B1, which has a primary base of A. A
7500 C also has a secondary base of B2, which no longer has a primary base
7501 of A. So the B2-in-C construction vtable needs a secondary vtable for
7502 A, which will adjust the A* to a B2* to call f. We have no way of
7503 knowing what (or even whether) this offset will be when we define B2,
7504 so we store this "vcall offset" in the A sub-vtable and look it up in
7505 a "virtual thunk" for B2::f.
7507 We need entries for all the functions in our primary vtable and
7508 in our non-virtual bases' secondary vtables. */
7510 /* If we are just computing the vcall indices -- but do not need
7511 the actual entries -- not that. */
7512 if (!BINFO_VIRTUAL_P (binfo))
7513 vid->generate_vcall_entries = false;
7514 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7515 add_vcall_offset_vtbl_entries_r (binfo, vid);
7519 /* Build vcall offsets, starting with those for BINFO. */
7522 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
7528 /* Don't walk into virtual bases -- except, of course, for the
7529 virtual base for which we are building vcall offsets. Any
7530 primary virtual base will have already had its offsets generated
7531 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7532 if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo)
7535 /* If BINFO has a primary base, process it first. */
7536 primary_binfo = get_primary_binfo (binfo);
7538 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7540 /* Add BINFO itself to the list. */
7541 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7543 /* Scan the non-primary bases of BINFO. */
7544 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7545 if (base_binfo != primary_binfo)
7546 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7549 /* Called from build_vcall_offset_vtbl_entries_r. */
7552 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
7554 /* Make entries for the rest of the virtuals. */
7555 if (abi_version_at_least (2))
7559 /* The ABI requires that the methods be processed in declaration
7560 order. G++ 3.2 used the order in the vtable. */
7561 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
7563 orig_fn = TREE_CHAIN (orig_fn))
7564 if (DECL_VINDEX (orig_fn))
7565 add_vcall_offset (orig_fn, binfo, vid);
7569 tree derived_virtuals;
7572 /* If BINFO is a primary base, the most derived class which has
7573 BINFO as a primary base; otherwise, just BINFO. */
7574 tree non_primary_binfo;
7576 /* We might be a primary base class. Go up the inheritance hierarchy
7577 until we find the most derived class of which we are a primary base:
7578 it is the BINFO_VIRTUALS there that we need to consider. */
7579 non_primary_binfo = binfo;
7580 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7584 /* If we have reached a virtual base, then it must be vid->vbase,
7585 because we ignore other virtual bases in
7586 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7587 base (possibly multi-level) of vid->binfo, or we wouldn't
7588 have called build_vcall_and_vbase_vtbl_entries for it. But it
7589 might be a lost primary, so just skip down to vid->binfo. */
7590 if (BINFO_VIRTUAL_P (non_primary_binfo))
7592 gcc_assert (non_primary_binfo == vid->vbase);
7593 non_primary_binfo = vid->binfo;
7597 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7598 if (get_primary_binfo (b) != non_primary_binfo)
7600 non_primary_binfo = b;
7603 if (vid->ctor_vtbl_p)
7604 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7605 where rtti_binfo is the most derived type. */
7607 = original_binfo (non_primary_binfo, vid->rtti_binfo);
7609 for (base_virtuals = BINFO_VIRTUALS (binfo),
7610 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7611 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7613 base_virtuals = TREE_CHAIN (base_virtuals),
7614 derived_virtuals = TREE_CHAIN (derived_virtuals),
7615 orig_virtuals = TREE_CHAIN (orig_virtuals))
7619 /* Find the declaration that originally caused this function to
7620 be present in BINFO_TYPE (binfo). */
7621 orig_fn = BV_FN (orig_virtuals);
7623 /* When processing BINFO, we only want to generate vcall slots for
7624 function slots introduced in BINFO. So don't try to generate
7625 one if the function isn't even defined in BINFO. */
7626 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn)))
7629 add_vcall_offset (orig_fn, binfo, vid);
7634 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7637 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
7643 /* If there is already an entry for a function with the same
7644 signature as FN, then we do not need a second vcall offset.
7645 Check the list of functions already present in the derived
7647 for (i = 0; VEC_iterate (tree, vid->fns, i, derived_entry); ++i)
7649 if (same_signature_p (derived_entry, orig_fn)
7650 /* We only use one vcall offset for virtual destructors,
7651 even though there are two virtual table entries. */
7652 || (DECL_DESTRUCTOR_P (derived_entry)
7653 && DECL_DESTRUCTOR_P (orig_fn)))
7657 /* If we are building these vcall offsets as part of building
7658 the vtable for the most derived class, remember the vcall
7660 if (vid->binfo == TYPE_BINFO (vid->derived))
7662 tree_pair_p elt = VEC_safe_push (tree_pair_s, gc,
7663 CLASSTYPE_VCALL_INDICES (vid->derived),
7665 elt->purpose = orig_fn;
7666 elt->value = vid->index;
7669 /* The next vcall offset will be found at a more negative
7671 vid->index = size_binop (MINUS_EXPR, vid->index,
7672 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7674 /* Keep track of this function. */
7675 VEC_safe_push (tree, gc, vid->fns, orig_fn);
7677 if (vid->generate_vcall_entries)
7682 /* Find the overriding function. */
7683 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
7684 if (fn == error_mark_node)
7685 vcall_offset = build1 (NOP_EXPR, vtable_entry_type,
7689 base = TREE_VALUE (fn);
7691 /* The vbase we're working on is a primary base of
7692 vid->binfo. But it might be a lost primary, so its
7693 BINFO_OFFSET might be wrong, so we just use the
7694 BINFO_OFFSET from vid->binfo. */
7695 vcall_offset = size_diffop (BINFO_OFFSET (base),
7696 BINFO_OFFSET (vid->binfo));
7697 vcall_offset = fold_build1 (NOP_EXPR, vtable_entry_type,
7700 /* Add the initializer to the vtable. */
7701 *vid->last_init = build_tree_list (NULL_TREE, vcall_offset);
7702 vid->last_init = &TREE_CHAIN (*vid->last_init);
7706 /* Return vtbl initializers for the RTTI entries corresponding to the
7707 BINFO's vtable. The RTTI entries should indicate the object given
7708 by VID->rtti_binfo. */
7711 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
7720 basetype = BINFO_TYPE (binfo);
7721 t = BINFO_TYPE (vid->rtti_binfo);
7723 /* To find the complete object, we will first convert to our most
7724 primary base, and then add the offset in the vtbl to that value. */
7726 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
7727 && !BINFO_LOST_PRIMARY_P (b))
7731 primary_base = get_primary_binfo (b);
7732 gcc_assert (BINFO_PRIMARY_P (primary_base)
7733 && BINFO_INHERITANCE_CHAIN (primary_base) == b);
7736 offset = size_diffop (BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
7738 /* The second entry is the address of the typeinfo object. */
7740 decl = build_address (get_tinfo_decl (t));
7742 decl = integer_zero_node;
7744 /* Convert the declaration to a type that can be stored in the
7746 init = build_nop (vfunc_ptr_type_node, decl);
7747 *vid->last_init = build_tree_list (NULL_TREE, init);
7748 vid->last_init = &TREE_CHAIN (*vid->last_init);
7750 /* Add the offset-to-top entry. It comes earlier in the vtable than
7751 the typeinfo entry. Convert the offset to look like a
7752 function pointer, so that we can put it in the vtable. */
7753 init = build_nop (vfunc_ptr_type_node, offset);
7754 *vid->last_init = build_tree_list (NULL_TREE, init);
7755 vid->last_init = &TREE_CHAIN (*vid->last_init);
7758 /* Fold a OBJ_TYPE_REF expression to the address of a function.
7759 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
7762 cp_fold_obj_type_ref (tree ref, tree known_type)
7764 HOST_WIDE_INT index = tree_low_cst (OBJ_TYPE_REF_TOKEN (ref), 1);
7765 HOST_WIDE_INT i = 0;
7766 tree v = BINFO_VIRTUALS (TYPE_BINFO (known_type));
7771 i += (TARGET_VTABLE_USES_DESCRIPTORS
7772 ? TARGET_VTABLE_USES_DESCRIPTORS : 1);
7778 #ifdef ENABLE_CHECKING
7779 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref),
7780 DECL_VINDEX (fndecl)));
7783 cgraph_node (fndecl)->local.vtable_method = true;
7785 return build_address (fndecl);
7788 #include "gt-cp-class.h"