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 3, 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 COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* High-level class interface. */
28 #include "coretypes.h"
39 #include "tree-dump.h"
41 /* The number of nested classes being processed. If we are not in the
42 scope of any class, this is zero. */
44 int current_class_depth;
46 /* In order to deal with nested classes, we keep a stack of classes.
47 The topmost entry is the innermost class, and is the entry at index
48 CURRENT_CLASS_DEPTH */
50 typedef struct class_stack_node {
51 /* The name of the class. */
54 /* The _TYPE node for the class. */
57 /* The access specifier pending for new declarations in the scope of
61 /* If were defining TYPE, the names used in this class. */
62 splay_tree names_used;
64 /* Nonzero if this class is no longer open, because of a call to
67 }* class_stack_node_t;
69 typedef struct vtbl_init_data_s
71 /* The base for which we're building initializers. */
73 /* The type of the most-derived type. */
75 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
76 unless ctor_vtbl_p is true. */
78 /* The negative-index vtable initializers built up so far. These
79 are in order from least negative index to most negative index. */
81 /* The last (i.e., most negative) entry in INITS. */
83 /* The binfo for the virtual base for which we're building
84 vcall offset initializers. */
86 /* The functions in vbase for which we have already provided vcall
89 /* The vtable index of the next vcall or vbase offset. */
91 /* Nonzero if we are building the initializer for the primary
94 /* Nonzero if we are building the initializer for a construction
97 /* True when adding vcall offset entries to the vtable. False when
98 merely computing the indices. */
99 bool generate_vcall_entries;
102 /* The type of a function passed to walk_subobject_offsets. */
103 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
105 /* The stack itself. This is a dynamically resized array. The
106 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
107 static int current_class_stack_size;
108 static class_stack_node_t current_class_stack;
110 /* The size of the largest empty class seen in this translation unit. */
111 static GTY (()) tree sizeof_biggest_empty_class;
113 /* An array of all local classes present in this translation unit, in
114 declaration order. */
115 VEC(tree,gc) *local_classes;
117 static tree get_vfield_name (tree);
118 static void finish_struct_anon (tree);
119 static tree get_vtable_name (tree);
120 static tree get_basefndecls (tree, tree);
121 static int build_primary_vtable (tree, tree);
122 static int build_secondary_vtable (tree);
123 static void finish_vtbls (tree);
124 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
125 static void finish_struct_bits (tree);
126 static int alter_access (tree, tree, tree);
127 static void handle_using_decl (tree, tree);
128 static tree dfs_modify_vtables (tree, void *);
129 static tree modify_all_vtables (tree, tree);
130 static void determine_primary_bases (tree);
131 static void finish_struct_methods (tree);
132 static void maybe_warn_about_overly_private_class (tree);
133 static int method_name_cmp (const void *, const void *);
134 static int resort_method_name_cmp (const void *, const void *);
135 static void add_implicitly_declared_members (tree, int, int);
136 static tree fixed_type_or_null (tree, int *, int *);
137 static tree build_simple_base_path (tree expr, tree binfo);
138 static tree build_vtbl_ref_1 (tree, tree);
139 static tree build_vtbl_initializer (tree, tree, tree, tree, int *);
140 static int count_fields (tree);
141 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
142 static bool check_bitfield_decl (tree);
143 static void check_field_decl (tree, tree, int *, int *, int *);
144 static void check_field_decls (tree, tree *, int *, int *);
145 static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
146 static void build_base_fields (record_layout_info, splay_tree, tree *);
147 static void check_methods (tree);
148 static void remove_zero_width_bit_fields (tree);
149 static void check_bases (tree, int *, int *);
150 static void check_bases_and_members (tree);
151 static tree create_vtable_ptr (tree, tree *);
152 static void include_empty_classes (record_layout_info);
153 static void layout_class_type (tree, tree *);
154 static void fixup_pending_inline (tree);
155 static void fixup_inline_methods (tree);
156 static void propagate_binfo_offsets (tree, tree);
157 static void layout_virtual_bases (record_layout_info, splay_tree);
158 static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *);
159 static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *);
160 static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *);
161 static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *);
162 static void add_vcall_offset (tree, tree, vtbl_init_data *);
163 static void layout_vtable_decl (tree, int);
164 static tree dfs_find_final_overrider_pre (tree, void *);
165 static tree dfs_find_final_overrider_post (tree, void *);
166 static tree find_final_overrider (tree, tree, tree);
167 static int make_new_vtable (tree, tree);
168 static tree get_primary_binfo (tree);
169 static int maybe_indent_hierarchy (FILE *, int, int);
170 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
171 static void dump_class_hierarchy (tree);
172 static void dump_class_hierarchy_1 (FILE *, int, tree);
173 static void dump_array (FILE *, tree);
174 static void dump_vtable (tree, tree, tree);
175 static void dump_vtt (tree, tree);
176 static void dump_thunk (FILE *, int, tree);
177 static tree build_vtable (tree, tree, tree);
178 static void initialize_vtable (tree, tree);
179 static void layout_nonempty_base_or_field (record_layout_info,
180 tree, tree, splay_tree);
181 static tree end_of_class (tree, int);
182 static bool layout_empty_base (record_layout_info, tree, tree, splay_tree);
183 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree);
184 static tree dfs_accumulate_vtbl_inits (tree, tree, tree, tree,
186 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
187 static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *);
188 static void clone_constructors_and_destructors (tree);
189 static tree build_clone (tree, tree);
190 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
191 static void build_ctor_vtbl_group (tree, tree);
192 static void build_vtt (tree);
193 static tree binfo_ctor_vtable (tree);
194 static tree *build_vtt_inits (tree, tree, tree *, tree *);
195 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
196 static tree dfs_fixup_binfo_vtbls (tree, void *);
197 static int record_subobject_offset (tree, tree, splay_tree);
198 static int check_subobject_offset (tree, tree, splay_tree);
199 static int walk_subobject_offsets (tree, subobject_offset_fn,
200 tree, splay_tree, tree, int);
201 static void record_subobject_offsets (tree, tree, splay_tree, bool);
202 static int layout_conflict_p (tree, tree, splay_tree, int);
203 static int splay_tree_compare_integer_csts (splay_tree_key k1,
205 static void warn_about_ambiguous_bases (tree);
206 static bool type_requires_array_cookie (tree);
207 static bool contains_empty_class_p (tree);
208 static bool base_derived_from (tree, tree);
209 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
210 static tree end_of_base (tree);
211 static tree get_vcall_index (tree, tree);
213 /* Variables shared between class.c and call.c. */
215 #ifdef GATHER_STATISTICS
217 int n_vtable_entries = 0;
218 int n_vtable_searches = 0;
219 int n_vtable_elems = 0;
220 int n_convert_harshness = 0;
221 int n_compute_conversion_costs = 0;
222 int n_inner_fields_searched = 0;
225 /* Convert to or from a base subobject. EXPR is an expression of type
226 `A' or `A*', an expression of type `B' or `B*' is returned. To
227 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
228 the B base instance within A. To convert base A to derived B, CODE
229 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
230 In this latter case, A must not be a morally virtual base of B.
231 NONNULL is true if EXPR is known to be non-NULL (this is only
232 needed when EXPR is of pointer type). CV qualifiers are preserved
236 build_base_path (enum tree_code code,
241 tree v_binfo = NULL_TREE;
242 tree d_binfo = NULL_TREE;
246 tree null_test = NULL;
247 tree ptr_target_type;
249 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
250 bool has_empty = false;
253 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
254 return error_mark_node;
256 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
259 if (is_empty_class (BINFO_TYPE (probe)))
261 if (!v_binfo && BINFO_VIRTUAL_P (probe))
265 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
267 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
269 gcc_assert ((code == MINUS_EXPR
270 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe))
271 || (code == PLUS_EXPR
272 && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)));
274 if (binfo == d_binfo)
278 if (code == MINUS_EXPR && v_binfo)
280 error ("cannot convert from base %qT to derived type %qT via virtual base %qT",
281 BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo));
282 return error_mark_node;
286 /* This must happen before the call to save_expr. */
287 expr = build_unary_op (ADDR_EXPR, expr, 0);
289 offset = BINFO_OFFSET (binfo);
290 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
291 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
293 /* Do we need to look in the vtable for the real offset? */
294 virtual_access = (v_binfo && fixed_type_p <= 0);
296 /* Do we need to check for a null pointer? */
297 if (want_pointer && !nonnull)
299 /* If we know the conversion will not actually change the value
300 of EXPR, then we can avoid testing the expression for NULL.
301 We have to avoid generating a COMPONENT_REF for a base class
302 field, because other parts of the compiler know that such
303 expressions are always non-NULL. */
304 if (!virtual_access && integer_zerop (offset))
307 /* TARGET_TYPE has been extracted from BINFO, and, is
308 therefore always cv-unqualified. Extract the
309 cv-qualifiers from EXPR so that the expression returned
310 matches the input. */
311 class_type = TREE_TYPE (TREE_TYPE (expr));
313 = cp_build_qualified_type (target_type,
314 cp_type_quals (class_type));
315 return build_nop (build_pointer_type (target_type), expr);
317 null_test = error_mark_node;
320 /* Protect against multiple evaluation if necessary. */
321 if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access))
322 expr = save_expr (expr);
324 /* Now that we've saved expr, build the real null test. */
327 tree zero = cp_convert (TREE_TYPE (expr), integer_zero_node);
328 null_test = fold_build2 (NE_EXPR, boolean_type_node,
332 /* If this is a simple base reference, express it as a COMPONENT_REF. */
333 if (code == PLUS_EXPR && !virtual_access
334 /* We don't build base fields for empty bases, and they aren't very
335 interesting to the optimizers anyway. */
338 expr = build_indirect_ref (expr, NULL);
339 expr = build_simple_base_path (expr, binfo);
341 expr = build_address (expr);
342 target_type = TREE_TYPE (expr);
348 /* Going via virtual base V_BINFO. We need the static offset
349 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
350 V_BINFO. That offset is an entry in D_BINFO's vtable. */
353 if (fixed_type_p < 0 && in_base_initializer)
355 /* In a base member initializer, we cannot rely on the
356 vtable being set up. We have to indirect via the
360 t = TREE_TYPE (TYPE_VFIELD (current_class_type));
361 t = build_pointer_type (t);
362 v_offset = convert (t, current_vtt_parm);
363 v_offset = build_indirect_ref (v_offset, NULL);
366 v_offset = build_vfield_ref (build_indirect_ref (expr, NULL),
367 TREE_TYPE (TREE_TYPE (expr)));
369 v_offset = build2 (POINTER_PLUS_EXPR, TREE_TYPE (v_offset),
370 v_offset, fold_convert (sizetype, BINFO_VPTR_FIELD (v_binfo)));
371 v_offset = build1 (NOP_EXPR,
372 build_pointer_type (ptrdiff_type_node),
374 v_offset = build_indirect_ref (v_offset, NULL);
375 TREE_CONSTANT (v_offset) = 1;
376 TREE_INVARIANT (v_offset) = 1;
378 offset = convert_to_integer (ptrdiff_type_node,
380 BINFO_OFFSET (v_binfo)));
382 if (!integer_zerop (offset))
383 v_offset = build2 (code, ptrdiff_type_node, v_offset, offset);
385 if (fixed_type_p < 0)
386 /* Negative fixed_type_p means this is a constructor or destructor;
387 virtual base layout is fixed in in-charge [cd]tors, but not in
389 offset = build3 (COND_EXPR, ptrdiff_type_node,
390 build2 (EQ_EXPR, boolean_type_node,
391 current_in_charge_parm, integer_zero_node),
393 convert_to_integer (ptrdiff_type_node,
394 BINFO_OFFSET (binfo)));
399 target_type = cp_build_qualified_type
400 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
401 ptr_target_type = build_pointer_type (target_type);
403 target_type = ptr_target_type;
405 expr = build1 (NOP_EXPR, ptr_target_type, expr);
407 if (!integer_zerop (offset))
409 offset = fold_convert (sizetype, offset);
410 if (code == MINUS_EXPR)
411 offset = fold_build1 (NEGATE_EXPR, sizetype, offset);
412 expr = build2 (POINTER_PLUS_EXPR, ptr_target_type, expr, offset);
418 expr = build_indirect_ref (expr, NULL);
422 expr = fold_build3 (COND_EXPR, target_type, null_test, expr,
423 fold_build1 (NOP_EXPR, target_type,
429 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
430 Perform a derived-to-base conversion by recursively building up a
431 sequence of COMPONENT_REFs to the appropriate base fields. */
434 build_simple_base_path (tree expr, tree binfo)
436 tree type = BINFO_TYPE (binfo);
437 tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
440 if (d_binfo == NULL_TREE)
444 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type);
446 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
447 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
448 an lvalue in the front end; only _DECLs and _REFs are lvalues
450 temp = unary_complex_lvalue (ADDR_EXPR, expr);
452 expr = build_indirect_ref (temp, NULL);
458 expr = build_simple_base_path (expr, d_binfo);
460 for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo));
461 field; field = TREE_CHAIN (field))
462 /* Is this the base field created by build_base_field? */
463 if (TREE_CODE (field) == FIELD_DECL
464 && DECL_FIELD_IS_BASE (field)
465 && TREE_TYPE (field) == type)
467 /* We don't use build_class_member_access_expr here, as that
468 has unnecessary checks, and more importantly results in
469 recursive calls to dfs_walk_once. */
470 int type_quals = cp_type_quals (TREE_TYPE (expr));
472 expr = build3 (COMPONENT_REF,
473 cp_build_qualified_type (type, type_quals),
474 expr, field, NULL_TREE);
475 expr = fold_if_not_in_template (expr);
477 /* Mark the expression const or volatile, as appropriate.
478 Even though we've dealt with the type above, we still have
479 to mark the expression itself. */
480 if (type_quals & TYPE_QUAL_CONST)
481 TREE_READONLY (expr) = 1;
482 if (type_quals & TYPE_QUAL_VOLATILE)
483 TREE_THIS_VOLATILE (expr) = 1;
488 /* Didn't find the base field?!? */
492 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
493 type is a class type or a pointer to a class type. In the former
494 case, TYPE is also a class type; in the latter it is another
495 pointer type. If CHECK_ACCESS is true, an error message is emitted
496 if TYPE is inaccessible. If OBJECT has pointer type, the value is
497 assumed to be non-NULL. */
500 convert_to_base (tree object, tree type, bool check_access, bool nonnull)
505 if (TYPE_PTR_P (TREE_TYPE (object)))
507 object_type = TREE_TYPE (TREE_TYPE (object));
508 type = TREE_TYPE (type);
511 object_type = TREE_TYPE (object);
513 binfo = lookup_base (object_type, type,
514 check_access ? ba_check : ba_unique,
516 if (!binfo || binfo == error_mark_node)
517 return error_mark_node;
519 return build_base_path (PLUS_EXPR, object, binfo, nonnull);
522 /* EXPR is an expression with unqualified class type. BASE is a base
523 binfo of that class type. Returns EXPR, converted to the BASE
524 type. This function assumes that EXPR is the most derived class;
525 therefore virtual bases can be found at their static offsets. */
528 convert_to_base_statically (tree expr, tree base)
532 expr_type = TREE_TYPE (expr);
533 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type))
537 pointer_type = build_pointer_type (expr_type);
539 /* We use fold_build2 and fold_convert below to simplify the trees
540 provided to the optimizers. It is not safe to call these functions
541 when processing a template because they do not handle C++-specific
543 gcc_assert (!processing_template_decl);
544 expr = build_unary_op (ADDR_EXPR, expr, /*noconvert=*/1);
545 if (!integer_zerop (BINFO_OFFSET (base)))
546 expr = fold_build2 (POINTER_PLUS_EXPR, pointer_type, expr,
547 fold_convert (sizetype, BINFO_OFFSET (base)));
548 expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr);
549 expr = build_fold_indirect_ref (expr);
557 build_vfield_ref (tree datum, tree type)
559 tree vfield, vcontext;
561 if (datum == error_mark_node)
562 return error_mark_node;
564 /* First, convert to the requested type. */
565 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
566 datum = convert_to_base (datum, type, /*check_access=*/false,
569 /* Second, the requested type may not be the owner of its own vptr.
570 If not, convert to the base class that owns it. We cannot use
571 convert_to_base here, because VCONTEXT may appear more than once
572 in the inheritance hierarchy of TYPE, and thus direct conversion
573 between the types may be ambiguous. Following the path back up
574 one step at a time via primary bases avoids the problem. */
575 vfield = TYPE_VFIELD (type);
576 vcontext = DECL_CONTEXT (vfield);
577 while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type))
579 datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type));
580 type = TREE_TYPE (datum);
583 return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE);
586 /* Given an object INSTANCE, return an expression which yields the
587 vtable element corresponding to INDEX. There are many special
588 cases for INSTANCE which we take care of here, mainly to avoid
589 creating extra tree nodes when we don't have to. */
592 build_vtbl_ref_1 (tree instance, tree idx)
595 tree vtbl = NULL_TREE;
597 /* Try to figure out what a reference refers to, and
598 access its virtual function table directly. */
601 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
603 tree basetype = non_reference (TREE_TYPE (instance));
605 if (fixed_type && !cdtorp)
607 tree binfo = lookup_base (fixed_type, basetype,
608 ba_unique | ba_quiet, NULL);
610 vtbl = unshare_expr (BINFO_VTABLE (binfo));
614 vtbl = build_vfield_ref (instance, basetype);
616 assemble_external (vtbl);
618 aref = build_array_ref (vtbl, idx);
619 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
620 TREE_INVARIANT (aref) = TREE_CONSTANT (aref);
626 build_vtbl_ref (tree instance, tree idx)
628 tree aref = build_vtbl_ref_1 (instance, idx);
633 /* Given a stable object pointer INSTANCE_PTR, return an expression which
634 yields a function pointer corresponding to vtable element INDEX. */
637 build_vfn_ref (tree instance_ptr, tree idx)
641 aref = build_vtbl_ref_1 (build_indirect_ref (instance_ptr, 0), idx);
643 /* When using function descriptors, the address of the
644 vtable entry is treated as a function pointer. */
645 if (TARGET_VTABLE_USES_DESCRIPTORS)
646 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
647 build_unary_op (ADDR_EXPR, aref, /*noconvert=*/1));
649 /* Remember this as a method reference, for later devirtualization. */
650 aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx);
655 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
656 for the given TYPE. */
659 get_vtable_name (tree type)
661 return mangle_vtbl_for_type (type);
664 /* DECL is an entity associated with TYPE, like a virtual table or an
665 implicitly generated constructor. Determine whether or not DECL
666 should have external or internal linkage at the object file
667 level. This routine does not deal with COMDAT linkage and other
668 similar complexities; it simply sets TREE_PUBLIC if it possible for
669 entities in other translation units to contain copies of DECL, in
673 set_linkage_according_to_type (tree type, tree decl)
675 /* If TYPE involves a local class in a function with internal
676 linkage, then DECL should have internal linkage too. Other local
677 classes have no linkage -- but if their containing functions
678 have external linkage, it makes sense for DECL to have external
679 linkage too. That will allow template definitions to be merged,
681 if (no_linkage_check (type, /*relaxed_p=*/true))
683 TREE_PUBLIC (decl) = 0;
684 DECL_INTERFACE_KNOWN (decl) = 1;
687 TREE_PUBLIC (decl) = 1;
690 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
691 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
692 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
695 build_vtable (tree class_type, tree name, tree vtable_type)
699 decl = build_lang_decl (VAR_DECL, name, vtable_type);
700 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
701 now to avoid confusion in mangle_decl. */
702 SET_DECL_ASSEMBLER_NAME (decl, name);
703 DECL_CONTEXT (decl) = class_type;
704 DECL_ARTIFICIAL (decl) = 1;
705 TREE_STATIC (decl) = 1;
706 TREE_READONLY (decl) = 1;
707 DECL_VIRTUAL_P (decl) = 1;
708 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
709 DECL_VTABLE_OR_VTT_P (decl) = 1;
710 /* At one time the vtable info was grabbed 2 words at a time. This
711 fails on sparc unless you have 8-byte alignment. (tiemann) */
712 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
714 set_linkage_according_to_type (class_type, decl);
715 /* The vtable has not been defined -- yet. */
716 DECL_EXTERNAL (decl) = 1;
717 DECL_NOT_REALLY_EXTERN (decl) = 1;
719 /* Mark the VAR_DECL node representing the vtable itself as a
720 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
721 is rather important that such things be ignored because any
722 effort to actually generate DWARF for them will run into
723 trouble when/if we encounter code like:
726 struct S { virtual void member (); };
728 because the artificial declaration of the vtable itself (as
729 manufactured by the g++ front end) will say that the vtable is
730 a static member of `S' but only *after* the debug output for
731 the definition of `S' has already been output. This causes
732 grief because the DWARF entry for the definition of the vtable
733 will try to refer back to an earlier *declaration* of the
734 vtable as a static member of `S' and there won't be one. We
735 might be able to arrange to have the "vtable static member"
736 attached to the member list for `S' before the debug info for
737 `S' get written (which would solve the problem) but that would
738 require more intrusive changes to the g++ front end. */
739 DECL_IGNORED_P (decl) = 1;
744 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
745 or even complete. If this does not exist, create it. If COMPLETE is
746 nonzero, then complete the definition of it -- that will render it
747 impossible to actually build the vtable, but is useful to get at those
748 which are known to exist in the runtime. */
751 get_vtable_decl (tree type, int complete)
755 if (CLASSTYPE_VTABLES (type))
756 return CLASSTYPE_VTABLES (type);
758 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
759 CLASSTYPE_VTABLES (type) = decl;
763 DECL_EXTERNAL (decl) = 1;
764 finish_decl (decl, NULL_TREE, NULL_TREE);
770 /* Build the primary virtual function table for TYPE. If BINFO is
771 non-NULL, build the vtable starting with the initial approximation
772 that it is the same as the one which is the head of the association
773 list. Returns a nonzero value if a new vtable is actually
777 build_primary_vtable (tree binfo, tree type)
782 decl = get_vtable_decl (type, /*complete=*/0);
786 if (BINFO_NEW_VTABLE_MARKED (binfo))
787 /* We have already created a vtable for this base, so there's
788 no need to do it again. */
791 virtuals = copy_list (BINFO_VIRTUALS (binfo));
792 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
793 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
794 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
798 gcc_assert (TREE_TYPE (decl) == vtbl_type_node);
799 virtuals = NULL_TREE;
802 #ifdef GATHER_STATISTICS
804 n_vtable_elems += list_length (virtuals);
807 /* Initialize the association list for this type, based
808 on our first approximation. */
809 BINFO_VTABLE (TYPE_BINFO (type)) = decl;
810 BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals;
811 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
815 /* Give BINFO a new virtual function table which is initialized
816 with a skeleton-copy of its original initialization. The only
817 entry that changes is the `delta' entry, so we can really
818 share a lot of structure.
820 FOR_TYPE is the most derived type which caused this table to
823 Returns nonzero if we haven't met BINFO before.
825 The order in which vtables are built (by calling this function) for
826 an object must remain the same, otherwise a binary incompatibility
830 build_secondary_vtable (tree binfo)
832 if (BINFO_NEW_VTABLE_MARKED (binfo))
833 /* We already created a vtable for this base. There's no need to
837 /* Remember that we've created a vtable for this BINFO, so that we
838 don't try to do so again. */
839 SET_BINFO_NEW_VTABLE_MARKED (binfo);
841 /* Make fresh virtual list, so we can smash it later. */
842 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
844 /* Secondary vtables are laid out as part of the same structure as
845 the primary vtable. */
846 BINFO_VTABLE (binfo) = NULL_TREE;
850 /* Create a new vtable for BINFO which is the hierarchy dominated by
851 T. Return nonzero if we actually created a new vtable. */
854 make_new_vtable (tree t, tree binfo)
856 if (binfo == TYPE_BINFO (t))
857 /* In this case, it is *type*'s vtable we are modifying. We start
858 with the approximation that its vtable is that of the
859 immediate base class. */
860 return build_primary_vtable (binfo, t);
862 /* This is our very own copy of `basetype' to play with. Later,
863 we will fill in all the virtual functions that override the
864 virtual functions in these base classes which are not defined
865 by the current type. */
866 return build_secondary_vtable (binfo);
869 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
870 (which is in the hierarchy dominated by T) list FNDECL as its
871 BV_FN. DELTA is the required constant adjustment from the `this'
872 pointer where the vtable entry appears to the `this' required when
873 the function is actually called. */
876 modify_vtable_entry (tree t,
886 if (fndecl != BV_FN (v)
887 || !tree_int_cst_equal (delta, BV_DELTA (v)))
889 /* We need a new vtable for BINFO. */
890 if (make_new_vtable (t, binfo))
892 /* If we really did make a new vtable, we also made a copy
893 of the BINFO_VIRTUALS list. Now, we have to find the
894 corresponding entry in that list. */
895 *virtuals = BINFO_VIRTUALS (binfo);
896 while (BV_FN (*virtuals) != BV_FN (v))
897 *virtuals = TREE_CHAIN (*virtuals);
901 BV_DELTA (v) = delta;
902 BV_VCALL_INDEX (v) = NULL_TREE;
908 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
909 the USING_DECL naming METHOD. Returns true if the method could be
910 added to the method vec. */
913 add_method (tree type, tree method, tree using_decl)
917 bool template_conv_p = false;
919 VEC(tree,gc) *method_vec;
921 bool insert_p = false;
925 if (method == error_mark_node)
928 complete_p = COMPLETE_TYPE_P (type);
929 conv_p = DECL_CONV_FN_P (method);
931 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
932 && DECL_TEMPLATE_CONV_FN_P (method));
934 method_vec = CLASSTYPE_METHOD_VEC (type);
937 /* Make a new method vector. We start with 8 entries. We must
938 allocate at least two (for constructors and destructors), and
939 we're going to end up with an assignment operator at some
941 method_vec = VEC_alloc (tree, gc, 8);
942 /* Create slots for constructors and destructors. */
943 VEC_quick_push (tree, method_vec, NULL_TREE);
944 VEC_quick_push (tree, method_vec, NULL_TREE);
945 CLASSTYPE_METHOD_VEC (type) = method_vec;
948 /* Maintain TYPE_HAS_CONSTRUCTOR, etc. */
949 grok_special_member_properties (method);
951 /* Constructors and destructors go in special slots. */
952 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
953 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
954 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
956 slot = CLASSTYPE_DESTRUCTOR_SLOT;
958 if (TYPE_FOR_JAVA (type))
960 if (!DECL_ARTIFICIAL (method))
961 error ("Java class %qT cannot have a destructor", type);
962 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
963 error ("Java class %qT cannot have an implicit non-trivial "
973 /* See if we already have an entry with this name. */
974 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
975 VEC_iterate (tree, method_vec, slot, m);
981 if (TREE_CODE (m) == TEMPLATE_DECL
982 && DECL_TEMPLATE_CONV_FN_P (m))
986 if (conv_p && !DECL_CONV_FN_P (m))
988 if (DECL_NAME (m) == DECL_NAME (method))
994 && !DECL_CONV_FN_P (m)
995 && DECL_NAME (m) > DECL_NAME (method))
999 current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot);
1001 /* Check to see if we've already got this method. */
1002 for (fns = current_fns; fns; fns = OVL_NEXT (fns))
1004 tree fn = OVL_CURRENT (fns);
1010 if (TREE_CODE (fn) != TREE_CODE (method))
1013 /* [over.load] Member function declarations with the
1014 same name and the same parameter types cannot be
1015 overloaded if any of them is a static member
1016 function declaration.
1018 [namespace.udecl] When a using-declaration brings names
1019 from a base class into a derived class scope, member
1020 functions in the derived class override and/or hide member
1021 functions with the same name and parameter types in a base
1022 class (rather than conflicting). */
1023 fn_type = TREE_TYPE (fn);
1024 method_type = TREE_TYPE (method);
1025 parms1 = TYPE_ARG_TYPES (fn_type);
1026 parms2 = TYPE_ARG_TYPES (method_type);
1028 /* Compare the quals on the 'this' parm. Don't compare
1029 the whole types, as used functions are treated as
1030 coming from the using class in overload resolution. */
1031 if (! DECL_STATIC_FUNCTION_P (fn)
1032 && ! DECL_STATIC_FUNCTION_P (method)
1033 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1)))
1034 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2)))))
1037 /* For templates, the return type and template parameters
1038 must be identical. */
1039 if (TREE_CODE (fn) == TEMPLATE_DECL
1040 && (!same_type_p (TREE_TYPE (fn_type),
1041 TREE_TYPE (method_type))
1042 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
1043 DECL_TEMPLATE_PARMS (method))))
1046 if (! DECL_STATIC_FUNCTION_P (fn))
1047 parms1 = TREE_CHAIN (parms1);
1048 if (! DECL_STATIC_FUNCTION_P (method))
1049 parms2 = TREE_CHAIN (parms2);
1051 if (compparms (parms1, parms2)
1052 && (!DECL_CONV_FN_P (fn)
1053 || same_type_p (TREE_TYPE (fn_type),
1054 TREE_TYPE (method_type))))
1058 if (DECL_CONTEXT (fn) == type)
1059 /* Defer to the local function. */
1061 if (DECL_CONTEXT (fn) == DECL_CONTEXT (method))
1062 error ("repeated using declaration %q+D", using_decl);
1064 error ("using declaration %q+D conflicts with a previous using declaration",
1069 error ("%q+#D cannot be overloaded", method);
1070 error ("with %q+#D", fn);
1073 /* We don't call duplicate_decls here to merge the
1074 declarations because that will confuse things if the
1075 methods have inline definitions. In particular, we
1076 will crash while processing the definitions. */
1081 /* A class should never have more than one destructor. */
1082 if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
1085 /* Add the new binding. */
1086 overload = build_overload (method, current_fns);
1089 TYPE_HAS_CONVERSION (type) = 1;
1090 else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p)
1091 push_class_level_binding (DECL_NAME (method), overload);
1097 /* We only expect to add few methods in the COMPLETE_P case, so
1098 just make room for one more method in that case. */
1100 reallocated = VEC_reserve_exact (tree, gc, method_vec, 1);
1102 reallocated = VEC_reserve (tree, gc, method_vec, 1);
1104 CLASSTYPE_METHOD_VEC (type) = method_vec;
1105 if (slot == VEC_length (tree, method_vec))
1106 VEC_quick_push (tree, method_vec, overload);
1108 VEC_quick_insert (tree, method_vec, slot, overload);
1111 /* Replace the current slot. */
1112 VEC_replace (tree, method_vec, slot, overload);
1116 /* Subroutines of finish_struct. */
1118 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1119 legit, otherwise return 0. */
1122 alter_access (tree t, tree fdecl, tree access)
1126 if (!DECL_LANG_SPECIFIC (fdecl))
1127 retrofit_lang_decl (fdecl);
1129 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl));
1131 elem = purpose_member (t, DECL_ACCESS (fdecl));
1134 if (TREE_VALUE (elem) != access)
1136 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1137 error ("conflicting access specifications for method"
1138 " %q+D, ignored", TREE_TYPE (fdecl));
1140 error ("conflicting access specifications for field %qE, ignored",
1145 /* They're changing the access to the same thing they changed
1146 it to before. That's OK. */
1152 perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl);
1153 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1159 /* Process the USING_DECL, which is a member of T. */
1162 handle_using_decl (tree using_decl, tree t)
1164 tree decl = USING_DECL_DECLS (using_decl);
1165 tree name = DECL_NAME (using_decl);
1167 = TREE_PRIVATE (using_decl) ? access_private_node
1168 : TREE_PROTECTED (using_decl) ? access_protected_node
1169 : access_public_node;
1170 tree flist = NULL_TREE;
1173 gcc_assert (!processing_template_decl && decl);
1175 old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false);
1178 if (is_overloaded_fn (old_value))
1179 old_value = OVL_CURRENT (old_value);
1181 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1184 old_value = NULL_TREE;
1187 cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl));
1189 if (is_overloaded_fn (decl))
1194 else if (is_overloaded_fn (old_value))
1197 /* It's OK to use functions from a base when there are functions with
1198 the same name already present in the current class. */;
1201 error ("%q+D invalid in %q#T", using_decl, t);
1202 error (" because of local method %q+#D with same name",
1203 OVL_CURRENT (old_value));
1207 else if (!DECL_ARTIFICIAL (old_value))
1209 error ("%q+D invalid in %q#T", using_decl, t);
1210 error (" because of local member %q+#D with same name", old_value);
1214 /* Make type T see field decl FDECL with access ACCESS. */
1216 for (; flist; flist = OVL_NEXT (flist))
1218 add_method (t, OVL_CURRENT (flist), using_decl);
1219 alter_access (t, OVL_CURRENT (flist), access);
1222 alter_access (t, decl, access);
1225 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1226 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1227 properties of the bases. */
1230 check_bases (tree t,
1231 int* cant_have_const_ctor_p,
1232 int* no_const_asn_ref_p)
1235 int seen_non_virtual_nearly_empty_base_p;
1239 seen_non_virtual_nearly_empty_base_p = 0;
1241 for (binfo = TYPE_BINFO (t), i = 0;
1242 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1244 tree basetype = TREE_TYPE (base_binfo);
1246 gcc_assert (COMPLETE_TYPE_P (basetype));
1248 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1249 here because the case of virtual functions but non-virtual
1250 dtor is handled in finish_struct_1. */
1251 if (!TYPE_POLYMORPHIC_P (basetype))
1252 warning (OPT_Weffc__,
1253 "base class %q#T has a non-virtual destructor", basetype);
1255 /* If the base class doesn't have copy constructors or
1256 assignment operators that take const references, then the
1257 derived class cannot have such a member automatically
1259 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1260 *cant_have_const_ctor_p = 1;
1261 if (TYPE_HAS_ASSIGN_REF (basetype)
1262 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1263 *no_const_asn_ref_p = 1;
1265 if (BINFO_VIRTUAL_P (base_binfo))
1266 /* A virtual base does not effect nearly emptiness. */
1268 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1270 if (seen_non_virtual_nearly_empty_base_p)
1271 /* And if there is more than one nearly empty base, then the
1272 derived class is not nearly empty either. */
1273 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1275 /* Remember we've seen one. */
1276 seen_non_virtual_nearly_empty_base_p = 1;
1278 else if (!is_empty_class (basetype))
1279 /* If the base class is not empty or nearly empty, then this
1280 class cannot be nearly empty. */
1281 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1283 /* A lot of properties from the bases also apply to the derived
1285 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1286 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1287 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1288 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1289 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1290 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1291 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1292 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1293 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1294 TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_HAS_COMPLEX_DFLT (basetype);
1298 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1299 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1300 that have had a nearly-empty virtual primary base stolen by some
1301 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1305 determine_primary_bases (tree t)
1308 tree primary = NULL_TREE;
1309 tree type_binfo = TYPE_BINFO (t);
1312 /* Determine the primary bases of our bases. */
1313 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1314 base_binfo = TREE_CHAIN (base_binfo))
1316 tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo));
1318 /* See if we're the non-virtual primary of our inheritance
1320 if (!BINFO_VIRTUAL_P (base_binfo))
1322 tree parent = BINFO_INHERITANCE_CHAIN (base_binfo);
1323 tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent));
1326 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
1327 BINFO_TYPE (parent_primary)))
1328 /* We are the primary binfo. */
1329 BINFO_PRIMARY_P (base_binfo) = 1;
1331 /* Determine if we have a virtual primary base, and mark it so.
1333 if (primary && BINFO_VIRTUAL_P (primary))
1335 tree this_primary = copied_binfo (primary, base_binfo);
1337 if (BINFO_PRIMARY_P (this_primary))
1338 /* Someone already claimed this base. */
1339 BINFO_LOST_PRIMARY_P (base_binfo) = 1;
1344 BINFO_PRIMARY_P (this_primary) = 1;
1345 BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo;
1347 /* A virtual binfo might have been copied from within
1348 another hierarchy. As we're about to use it as a
1349 primary base, make sure the offsets match. */
1350 delta = size_diffop (convert (ssizetype,
1351 BINFO_OFFSET (base_binfo)),
1353 BINFO_OFFSET (this_primary)));
1355 propagate_binfo_offsets (this_primary, delta);
1360 /* First look for a dynamic direct non-virtual base. */
1361 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++)
1363 tree basetype = BINFO_TYPE (base_binfo);
1365 if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo))
1367 primary = base_binfo;
1372 /* A "nearly-empty" virtual base class can be the primary base
1373 class, if no non-virtual polymorphic base can be found. Look for
1374 a nearly-empty virtual dynamic base that is not already a primary
1375 base of something in the hierarchy. If there is no such base,
1376 just pick the first nearly-empty virtual base. */
1378 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1379 base_binfo = TREE_CHAIN (base_binfo))
1380 if (BINFO_VIRTUAL_P (base_binfo)
1381 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo)))
1383 if (!BINFO_PRIMARY_P (base_binfo))
1385 /* Found one that is not primary. */
1386 primary = base_binfo;
1390 /* Remember the first candidate. */
1391 primary = base_binfo;
1395 /* If we've got a primary base, use it. */
1398 tree basetype = BINFO_TYPE (primary);
1400 CLASSTYPE_PRIMARY_BINFO (t) = primary;
1401 if (BINFO_PRIMARY_P (primary))
1402 /* We are stealing a primary base. */
1403 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1;
1404 BINFO_PRIMARY_P (primary) = 1;
1405 if (BINFO_VIRTUAL_P (primary))
1409 BINFO_INHERITANCE_CHAIN (primary) = type_binfo;
1410 /* A virtual binfo might have been copied from within
1411 another hierarchy. As we're about to use it as a primary
1412 base, make sure the offsets match. */
1413 delta = size_diffop (ssize_int (0),
1414 convert (ssizetype, BINFO_OFFSET (primary)));
1416 propagate_binfo_offsets (primary, delta);
1419 primary = TYPE_BINFO (basetype);
1421 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1422 BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary);
1423 BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary);
1427 /* Set memoizing fields and bits of T (and its variants) for later
1431 finish_struct_bits (tree t)
1435 /* Fix up variants (if any). */
1436 for (variants = TYPE_NEXT_VARIANT (t);
1438 variants = TYPE_NEXT_VARIANT (variants))
1440 /* These fields are in the _TYPE part of the node, not in
1441 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1442 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1443 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1444 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1445 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1447 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1449 TYPE_BINFO (variants) = TYPE_BINFO (t);
1451 /* Copy whatever these are holding today. */
1452 TYPE_VFIELD (variants) = TYPE_VFIELD (t);
1453 TYPE_METHODS (variants) = TYPE_METHODS (t);
1454 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1456 /* All variants of a class have the same attributes. */
1457 TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t);
1460 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t))
1461 /* For a class w/o baseclasses, 'finish_struct' has set
1462 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1463 Similarly for a class whose base classes do not have vtables.
1464 When neither of these is true, we might have removed abstract
1465 virtuals (by providing a definition), added some (by declaring
1466 new ones), or redeclared ones from a base class. We need to
1467 recalculate what's really an abstract virtual at this point (by
1468 looking in the vtables). */
1469 get_pure_virtuals (t);
1471 /* If this type has a copy constructor or a destructor, force its
1472 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1473 nonzero. This will cause it to be passed by invisible reference
1474 and prevent it from being returned in a register. */
1475 if (! TYPE_HAS_TRIVIAL_INIT_REF (t) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1478 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1479 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1481 TYPE_MODE (variants) = BLKmode;
1482 TREE_ADDRESSABLE (variants) = 1;
1487 /* Issue warnings about T having private constructors, but no friends,
1490 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1491 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1492 non-private static member functions. */
1495 maybe_warn_about_overly_private_class (tree t)
1497 int has_member_fn = 0;
1498 int has_nonprivate_method = 0;
1501 if (!warn_ctor_dtor_privacy
1502 /* If the class has friends, those entities might create and
1503 access instances, so we should not warn. */
1504 || (CLASSTYPE_FRIEND_CLASSES (t)
1505 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1506 /* We will have warned when the template was declared; there's
1507 no need to warn on every instantiation. */
1508 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1509 /* There's no reason to even consider warning about this
1513 /* We only issue one warning, if more than one applies, because
1514 otherwise, on code like:
1517 // Oops - forgot `public:'
1523 we warn several times about essentially the same problem. */
1525 /* Check to see if all (non-constructor, non-destructor) member
1526 functions are private. (Since there are no friends or
1527 non-private statics, we can't ever call any of the private member
1529 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1530 /* We're not interested in compiler-generated methods; they don't
1531 provide any way to call private members. */
1532 if (!DECL_ARTIFICIAL (fn))
1534 if (!TREE_PRIVATE (fn))
1536 if (DECL_STATIC_FUNCTION_P (fn))
1537 /* A non-private static member function is just like a
1538 friend; it can create and invoke private member
1539 functions, and be accessed without a class
1543 has_nonprivate_method = 1;
1544 /* Keep searching for a static member function. */
1546 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1550 if (!has_nonprivate_method && has_member_fn)
1552 /* There are no non-private methods, and there's at least one
1553 private member function that isn't a constructor or
1554 destructor. (If all the private members are
1555 constructors/destructors we want to use the code below that
1556 issues error messages specifically referring to
1557 constructors/destructors.) */
1559 tree binfo = TYPE_BINFO (t);
1561 for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++)
1562 if (BINFO_BASE_ACCESS (binfo, i) != access_private_node)
1564 has_nonprivate_method = 1;
1567 if (!has_nonprivate_method)
1569 warning (OPT_Wctor_dtor_privacy,
1570 "all member functions in class %qT are private", t);
1575 /* Even if some of the member functions are non-private, the class
1576 won't be useful for much if all the constructors or destructors
1577 are private: such an object can never be created or destroyed. */
1578 fn = CLASSTYPE_DESTRUCTORS (t);
1579 if (fn && TREE_PRIVATE (fn))
1581 warning (OPT_Wctor_dtor_privacy,
1582 "%q#T only defines a private destructor and has no friends",
1587 if (TYPE_HAS_CONSTRUCTOR (t)
1588 /* Implicitly generated constructors are always public. */
1589 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t)
1590 || !CLASSTYPE_LAZY_COPY_CTOR (t)))
1592 int nonprivate_ctor = 0;
1594 /* If a non-template class does not define a copy
1595 constructor, one is defined for it, enabling it to avoid
1596 this warning. For a template class, this does not
1597 happen, and so we would normally get a warning on:
1599 template <class T> class C { private: C(); };
1601 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1602 complete non-template or fully instantiated classes have this
1604 if (!TYPE_HAS_INIT_REF (t))
1605 nonprivate_ctor = 1;
1607 for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn))
1609 tree ctor = OVL_CURRENT (fn);
1610 /* Ideally, we wouldn't count copy constructors (or, in
1611 fact, any constructor that takes an argument of the
1612 class type as a parameter) because such things cannot
1613 be used to construct an instance of the class unless
1614 you already have one. But, for now at least, we're
1616 if (! TREE_PRIVATE (ctor))
1618 nonprivate_ctor = 1;
1623 if (nonprivate_ctor == 0)
1625 warning (OPT_Wctor_dtor_privacy,
1626 "%q#T only defines private constructors and has no friends",
1634 gt_pointer_operator new_value;
1638 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1641 method_name_cmp (const void* m1_p, const void* m2_p)
1643 const tree *const m1 = (const tree *) m1_p;
1644 const tree *const m2 = (const tree *) m2_p;
1646 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1648 if (*m1 == NULL_TREE)
1650 if (*m2 == NULL_TREE)
1652 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1657 /* This routine compares two fields like method_name_cmp but using the
1658 pointer operator in resort_field_decl_data. */
1661 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1663 const tree *const m1 = (const tree *) m1_p;
1664 const tree *const m2 = (const tree *) m2_p;
1665 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1667 if (*m1 == NULL_TREE)
1669 if (*m2 == NULL_TREE)
1672 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1673 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1674 resort_data.new_value (&d1, resort_data.cookie);
1675 resort_data.new_value (&d2, resort_data.cookie);
1682 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1685 resort_type_method_vec (void* obj,
1686 void* orig_obj ATTRIBUTE_UNUSED ,
1687 gt_pointer_operator new_value,
1690 VEC(tree,gc) *method_vec = (VEC(tree,gc) *) obj;
1691 int len = VEC_length (tree, method_vec);
1695 /* The type conversion ops have to live at the front of the vec, so we
1697 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1698 VEC_iterate (tree, method_vec, slot, fn);
1700 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1705 resort_data.new_value = new_value;
1706 resort_data.cookie = cookie;
1707 qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree),
1708 resort_method_name_cmp);
1712 /* Warn about duplicate methods in fn_fields.
1714 Sort methods that are not special (i.e., constructors, destructors,
1715 and type conversion operators) so that we can find them faster in
1719 finish_struct_methods (tree t)
1722 VEC(tree,gc) *method_vec;
1725 method_vec = CLASSTYPE_METHOD_VEC (t);
1729 len = VEC_length (tree, method_vec);
1731 /* Clear DECL_IN_AGGR_P for all functions. */
1732 for (fn_fields = TYPE_METHODS (t); fn_fields;
1733 fn_fields = TREE_CHAIN (fn_fields))
1734 DECL_IN_AGGR_P (fn_fields) = 0;
1736 /* Issue warnings about private constructors and such. If there are
1737 no methods, then some public defaults are generated. */
1738 maybe_warn_about_overly_private_class (t);
1740 /* The type conversion ops have to live at the front of the vec, so we
1742 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1743 VEC_iterate (tree, method_vec, slot, fn_fields);
1745 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields)))
1748 qsort (VEC_address (tree, method_vec) + slot,
1749 len-slot, sizeof (tree), method_name_cmp);
1752 /* Make BINFO's vtable have N entries, including RTTI entries,
1753 vbase and vcall offsets, etc. Set its type and call the back end
1757 layout_vtable_decl (tree binfo, int n)
1762 atype = build_cplus_array_type (vtable_entry_type,
1763 build_index_type (size_int (n - 1)));
1764 layout_type (atype);
1766 /* We may have to grow the vtable. */
1767 vtable = get_vtbl_decl_for_binfo (binfo);
1768 if (!same_type_p (TREE_TYPE (vtable), atype))
1770 TREE_TYPE (vtable) = atype;
1771 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
1772 layout_decl (vtable, 0);
1776 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1777 have the same signature. */
1780 same_signature_p (const_tree fndecl, const_tree base_fndecl)
1782 /* One destructor overrides another if they are the same kind of
1784 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
1785 && special_function_p (base_fndecl) == special_function_p (fndecl))
1787 /* But a non-destructor never overrides a destructor, nor vice
1788 versa, nor do different kinds of destructors override
1789 one-another. For example, a complete object destructor does not
1790 override a deleting destructor. */
1791 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
1794 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
1795 || (DECL_CONV_FN_P (fndecl)
1796 && DECL_CONV_FN_P (base_fndecl)
1797 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
1798 DECL_CONV_FN_TYPE (base_fndecl))))
1800 tree types, base_types;
1801 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1802 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
1803 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
1804 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
1805 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
1811 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1815 base_derived_from (tree derived, tree base)
1819 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1821 if (probe == derived)
1823 else if (BINFO_VIRTUAL_P (probe))
1824 /* If we meet a virtual base, we can't follow the inheritance
1825 any more. See if the complete type of DERIVED contains
1826 such a virtual base. */
1827 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived))
1833 typedef struct find_final_overrider_data_s {
1834 /* The function for which we are trying to find a final overrider. */
1836 /* The base class in which the function was declared. */
1837 tree declaring_base;
1838 /* The candidate overriders. */
1840 /* Path to most derived. */
1841 VEC(tree,heap) *path;
1842 } find_final_overrider_data;
1844 /* Add the overrider along the current path to FFOD->CANDIDATES.
1845 Returns true if an overrider was found; false otherwise. */
1848 dfs_find_final_overrider_1 (tree binfo,
1849 find_final_overrider_data *ffod,
1854 /* If BINFO is not the most derived type, try a more derived class.
1855 A definition there will overrider a definition here. */
1859 if (dfs_find_final_overrider_1
1860 (VEC_index (tree, ffod->path, depth), ffod, depth))
1864 method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn);
1867 tree *candidate = &ffod->candidates;
1869 /* Remove any candidates overridden by this new function. */
1872 /* If *CANDIDATE overrides METHOD, then METHOD
1873 cannot override anything else on the list. */
1874 if (base_derived_from (TREE_VALUE (*candidate), binfo))
1876 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1877 if (base_derived_from (binfo, TREE_VALUE (*candidate)))
1878 *candidate = TREE_CHAIN (*candidate);
1880 candidate = &TREE_CHAIN (*candidate);
1883 /* Add the new function. */
1884 ffod->candidates = tree_cons (method, binfo, ffod->candidates);
1891 /* Called from find_final_overrider via dfs_walk. */
1894 dfs_find_final_overrider_pre (tree binfo, void *data)
1896 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1898 if (binfo == ffod->declaring_base)
1899 dfs_find_final_overrider_1 (binfo, ffod, VEC_length (tree, ffod->path));
1900 VEC_safe_push (tree, heap, ffod->path, binfo);
1906 dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED, void *data)
1908 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1909 VEC_pop (tree, ffod->path);
1914 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1915 FN and whose TREE_VALUE is the binfo for the base where the
1916 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1917 DERIVED) is the base object in which FN is declared. */
1920 find_final_overrider (tree derived, tree binfo, tree fn)
1922 find_final_overrider_data ffod;
1924 /* Getting this right is a little tricky. This is valid:
1926 struct S { virtual void f (); };
1927 struct T { virtual void f (); };
1928 struct U : public S, public T { };
1930 even though calling `f' in `U' is ambiguous. But,
1932 struct R { virtual void f(); };
1933 struct S : virtual public R { virtual void f (); };
1934 struct T : virtual public R { virtual void f (); };
1935 struct U : public S, public T { };
1937 is not -- there's no way to decide whether to put `S::f' or
1938 `T::f' in the vtable for `R'.
1940 The solution is to look at all paths to BINFO. If we find
1941 different overriders along any two, then there is a problem. */
1942 if (DECL_THUNK_P (fn))
1943 fn = THUNK_TARGET (fn);
1945 /* Determine the depth of the hierarchy. */
1947 ffod.declaring_base = binfo;
1948 ffod.candidates = NULL_TREE;
1949 ffod.path = VEC_alloc (tree, heap, 30);
1951 dfs_walk_all (derived, dfs_find_final_overrider_pre,
1952 dfs_find_final_overrider_post, &ffod);
1954 VEC_free (tree, heap, ffod.path);
1956 /* If there was no winner, issue an error message. */
1957 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
1958 return error_mark_node;
1960 return ffod.candidates;
1963 /* Return the index of the vcall offset for FN when TYPE is used as a
1967 get_vcall_index (tree fn, tree type)
1969 VEC(tree_pair_s,gc) *indices = CLASSTYPE_VCALL_INDICES (type);
1973 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++)
1974 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose))
1975 || same_signature_p (fn, p->purpose))
1978 /* There should always be an appropriate index. */
1982 /* Update an entry in the vtable for BINFO, which is in the hierarchy
1983 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
1984 corresponding position in the BINFO_VIRTUALS list. */
1987 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
1995 tree overrider_fn, overrider_target;
1996 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
1997 tree over_return, base_return;
2000 /* Find the nearest primary base (possibly binfo itself) which defines
2001 this function; this is the class the caller will convert to when
2002 calling FN through BINFO. */
2003 for (b = binfo; ; b = get_primary_binfo (b))
2006 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
2009 /* The nearest definition is from a lost primary. */
2010 if (BINFO_LOST_PRIMARY_P (b))
2015 /* Find the final overrider. */
2016 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
2017 if (overrider == error_mark_node)
2019 error ("no unique final overrider for %qD in %qT", target_fn, t);
2022 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
2024 /* Check for adjusting covariant return types. */
2025 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
2026 base_return = TREE_TYPE (TREE_TYPE (target_fn));
2028 if (POINTER_TYPE_P (over_return)
2029 && TREE_CODE (over_return) == TREE_CODE (base_return)
2030 && CLASS_TYPE_P (TREE_TYPE (over_return))
2031 && CLASS_TYPE_P (TREE_TYPE (base_return))
2032 /* If the overrider is invalid, don't even try. */
2033 && !DECL_INVALID_OVERRIDER_P (overrider_target))
2035 /* If FN is a covariant thunk, we must figure out the adjustment
2036 to the final base FN was converting to. As OVERRIDER_TARGET might
2037 also be converting to the return type of FN, we have to
2038 combine the two conversions here. */
2039 tree fixed_offset, virtual_offset;
2041 over_return = TREE_TYPE (over_return);
2042 base_return = TREE_TYPE (base_return);
2044 if (DECL_THUNK_P (fn))
2046 gcc_assert (DECL_RESULT_THUNK_P (fn));
2047 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
2048 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2051 fixed_offset = virtual_offset = NULL_TREE;
2054 /* Find the equivalent binfo within the return type of the
2055 overriding function. We will want the vbase offset from
2057 virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset),
2059 else if (!same_type_ignoring_top_level_qualifiers_p
2060 (over_return, base_return))
2062 /* There was no existing virtual thunk (which takes
2063 precedence). So find the binfo of the base function's
2064 return type within the overriding function's return type.
2065 We cannot call lookup base here, because we're inside a
2066 dfs_walk, and will therefore clobber the BINFO_MARKED
2067 flags. Fortunately we know the covariancy is valid (it
2068 has already been checked), so we can just iterate along
2069 the binfos, which have been chained in inheritance graph
2070 order. Of course it is lame that we have to repeat the
2071 search here anyway -- we should really be caching pieces
2072 of the vtable and avoiding this repeated work. */
2073 tree thunk_binfo, base_binfo;
2075 /* Find the base binfo within the overriding function's
2076 return type. We will always find a thunk_binfo, except
2077 when the covariancy is invalid (which we will have
2078 already diagnosed). */
2079 for (base_binfo = TYPE_BINFO (base_return),
2080 thunk_binfo = TYPE_BINFO (over_return);
2082 thunk_binfo = TREE_CHAIN (thunk_binfo))
2083 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo),
2084 BINFO_TYPE (base_binfo)))
2087 /* See if virtual inheritance is involved. */
2088 for (virtual_offset = thunk_binfo;
2090 virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset))
2091 if (BINFO_VIRTUAL_P (virtual_offset))
2095 || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo)))
2097 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2101 /* We convert via virtual base. Adjust the fixed
2102 offset to be from there. */
2103 offset = size_diffop
2105 (ssizetype, BINFO_OFFSET (virtual_offset)));
2108 /* There was an existing fixed offset, this must be
2109 from the base just converted to, and the base the
2110 FN was thunking to. */
2111 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2113 fixed_offset = offset;
2117 if (fixed_offset || virtual_offset)
2118 /* Replace the overriding function with a covariant thunk. We
2119 will emit the overriding function in its own slot as
2121 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2122 fixed_offset, virtual_offset);
2125 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) ||
2126 !DECL_THUNK_P (fn));
2128 /* Assume that we will produce a thunk that convert all the way to
2129 the final overrider, and not to an intermediate virtual base. */
2130 virtual_base = NULL_TREE;
2132 /* See if we can convert to an intermediate virtual base first, and then
2133 use the vcall offset located there to finish the conversion. */
2134 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2136 /* If we find the final overrider, then we can stop
2138 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b),
2139 BINFO_TYPE (TREE_VALUE (overrider))))
2142 /* If we find a virtual base, and we haven't yet found the
2143 overrider, then there is a virtual base between the
2144 declaring base (first_defn) and the final overrider. */
2145 if (BINFO_VIRTUAL_P (b))
2152 if (overrider_fn != overrider_target && !virtual_base)
2154 /* The ABI specifies that a covariant thunk includes a mangling
2155 for a this pointer adjustment. This-adjusting thunks that
2156 override a function from a virtual base have a vcall
2157 adjustment. When the virtual base in question is a primary
2158 virtual base, we know the adjustments are zero, (and in the
2159 non-covariant case, we would not use the thunk).
2160 Unfortunately we didn't notice this could happen, when
2161 designing the ABI and so never mandated that such a covariant
2162 thunk should be emitted. Because we must use the ABI mandated
2163 name, we must continue searching from the binfo where we
2164 found the most recent definition of the function, towards the
2165 primary binfo which first introduced the function into the
2166 vtable. If that enters a virtual base, we must use a vcall
2167 this-adjusting thunk. Bleah! */
2168 tree probe = first_defn;
2170 while ((probe = get_primary_binfo (probe))
2171 && (unsigned) list_length (BINFO_VIRTUALS (probe)) > ix)
2172 if (BINFO_VIRTUAL_P (probe))
2173 virtual_base = probe;
2176 /* Even if we find a virtual base, the correct delta is
2177 between the overrider and the binfo we're building a vtable
2179 goto virtual_covariant;
2182 /* Compute the constant adjustment to the `this' pointer. The
2183 `this' pointer, when this function is called, will point at BINFO
2184 (or one of its primary bases, which are at the same offset). */
2186 /* The `this' pointer needs to be adjusted from the declaration to
2187 the nearest virtual base. */
2188 delta = size_diffop (convert (ssizetype, BINFO_OFFSET (virtual_base)),
2189 convert (ssizetype, BINFO_OFFSET (first_defn)));
2191 /* If the nearest definition is in a lost primary, we don't need an
2192 entry in our vtable. Except possibly in a constructor vtable,
2193 if we happen to get our primary back. In that case, the offset
2194 will be zero, as it will be a primary base. */
2195 delta = size_zero_node;
2197 /* The `this' pointer needs to be adjusted from pointing to
2198 BINFO to pointing at the base where the final overrider
2201 delta = size_diffop (convert (ssizetype,
2202 BINFO_OFFSET (TREE_VALUE (overrider))),
2203 convert (ssizetype, BINFO_OFFSET (binfo)));
2205 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2208 BV_VCALL_INDEX (*virtuals)
2209 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2211 BV_VCALL_INDEX (*virtuals) = NULL_TREE;
2214 /* Called from modify_all_vtables via dfs_walk. */
2217 dfs_modify_vtables (tree binfo, void* data)
2219 tree t = (tree) data;
2224 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2225 /* A base without a vtable needs no modification, and its bases
2226 are uninteresting. */
2227 return dfs_skip_bases;
2229 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)
2230 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
2231 /* Don't do the primary vtable, if it's new. */
2234 if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo))
2235 /* There's no need to modify the vtable for a non-virtual primary
2236 base; we're not going to use that vtable anyhow. We do still
2237 need to do this for virtual primary bases, as they could become
2238 non-primary in a construction vtable. */
2241 make_new_vtable (t, binfo);
2243 /* Now, go through each of the virtual functions in the virtual
2244 function table for BINFO. Find the final overrider, and update
2245 the BINFO_VIRTUALS list appropriately. */
2246 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2247 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2249 ix++, virtuals = TREE_CHAIN (virtuals),
2250 old_virtuals = TREE_CHAIN (old_virtuals))
2251 update_vtable_entry_for_fn (t,
2253 BV_FN (old_virtuals),
2259 /* Update all of the primary and secondary vtables for T. Create new
2260 vtables as required, and initialize their RTTI information. Each
2261 of the functions in VIRTUALS is declared in T and may override a
2262 virtual function from a base class; find and modify the appropriate
2263 entries to point to the overriding functions. Returns a list, in
2264 declaration order, of the virtual functions that are declared in T,
2265 but do not appear in the primary base class vtable, and which
2266 should therefore be appended to the end of the vtable for T. */
2269 modify_all_vtables (tree t, tree virtuals)
2271 tree binfo = TYPE_BINFO (t);
2274 /* Update all of the vtables. */
2275 dfs_walk_once (binfo, dfs_modify_vtables, NULL, t);
2277 /* Add virtual functions not already in our primary vtable. These
2278 will be both those introduced by this class, and those overridden
2279 from secondary bases. It does not include virtuals merely
2280 inherited from secondary bases. */
2281 for (fnsp = &virtuals; *fnsp; )
2283 tree fn = TREE_VALUE (*fnsp);
2285 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2286 || DECL_VINDEX (fn) == error_mark_node)
2288 /* We don't need to adjust the `this' pointer when
2289 calling this function. */
2290 BV_DELTA (*fnsp) = integer_zero_node;
2291 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2293 /* This is a function not already in our vtable. Keep it. */
2294 fnsp = &TREE_CHAIN (*fnsp);
2297 /* We've already got an entry for this function. Skip it. */
2298 *fnsp = TREE_CHAIN (*fnsp);
2304 /* Get the base virtual function declarations in T that have the
2308 get_basefndecls (tree name, tree t)
2311 tree base_fndecls = NULL_TREE;
2312 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
2315 /* Find virtual functions in T with the indicated NAME. */
2316 i = lookup_fnfields_1 (t, name);
2318 for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i);
2320 methods = OVL_NEXT (methods))
2322 tree method = OVL_CURRENT (methods);
2324 if (TREE_CODE (method) == FUNCTION_DECL
2325 && DECL_VINDEX (method))
2326 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2330 return base_fndecls;
2332 for (i = 0; i < n_baseclasses; i++)
2334 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i));
2335 base_fndecls = chainon (get_basefndecls (name, basetype),
2339 return base_fndecls;
2342 /* If this declaration supersedes the declaration of
2343 a method declared virtual in the base class, then
2344 mark this field as being virtual as well. */
2347 check_for_override (tree decl, tree ctype)
2349 if (TREE_CODE (decl) == TEMPLATE_DECL)
2350 /* In [temp.mem] we have:
2352 A specialization of a member function template does not
2353 override a virtual function from a base class. */
2355 if ((DECL_DESTRUCTOR_P (decl)
2356 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2357 || DECL_CONV_FN_P (decl))
2358 && look_for_overrides (ctype, decl)
2359 && !DECL_STATIC_FUNCTION_P (decl))
2360 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2361 the error_mark_node so that we know it is an overriding
2363 DECL_VINDEX (decl) = decl;
2365 if (DECL_VIRTUAL_P (decl))
2367 if (!DECL_VINDEX (decl))
2368 DECL_VINDEX (decl) = error_mark_node;
2369 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2373 /* Warn about hidden virtual functions that are not overridden in t.
2374 We know that constructors and destructors don't apply. */
2377 warn_hidden (tree t)
2379 VEC(tree,gc) *method_vec = CLASSTYPE_METHOD_VEC (t);
2383 /* We go through each separately named virtual function. */
2384 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2385 VEC_iterate (tree, method_vec, i, fns);
2396 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2397 have the same name. Figure out what name that is. */
2398 name = DECL_NAME (OVL_CURRENT (fns));
2399 /* There are no possibly hidden functions yet. */
2400 base_fndecls = NULL_TREE;
2401 /* Iterate through all of the base classes looking for possibly
2402 hidden functions. */
2403 for (binfo = TYPE_BINFO (t), j = 0;
2404 BINFO_BASE_ITERATE (binfo, j, base_binfo); j++)
2406 tree basetype = BINFO_TYPE (base_binfo);
2407 base_fndecls = chainon (get_basefndecls (name, basetype),
2411 /* If there are no functions to hide, continue. */
2415 /* Remove any overridden functions. */
2416 for (fn = fns; fn; fn = OVL_NEXT (fn))
2418 fndecl = OVL_CURRENT (fn);
2419 if (DECL_VINDEX (fndecl))
2421 tree *prev = &base_fndecls;
2424 /* If the method from the base class has the same
2425 signature as the method from the derived class, it
2426 has been overridden. */
2427 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2428 *prev = TREE_CHAIN (*prev);
2430 prev = &TREE_CHAIN (*prev);
2434 /* Now give a warning for all base functions without overriders,
2435 as they are hidden. */
2436 while (base_fndecls)
2438 /* Here we know it is a hider, and no overrider exists. */
2439 warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls));
2440 warning (OPT_Woverloaded_virtual, " by %q+D", fns);
2441 base_fndecls = TREE_CHAIN (base_fndecls);
2446 /* Check for things that are invalid. There are probably plenty of other
2447 things we should check for also. */
2450 finish_struct_anon (tree t)
2454 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2456 if (TREE_STATIC (field))
2458 if (TREE_CODE (field) != FIELD_DECL)
2461 if (DECL_NAME (field) == NULL_TREE
2462 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2464 bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE;
2465 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2466 for (; elt; elt = TREE_CHAIN (elt))
2468 /* We're generally only interested in entities the user
2469 declared, but we also find nested classes by noticing
2470 the TYPE_DECL that we create implicitly. You're
2471 allowed to put one anonymous union inside another,
2472 though, so we explicitly tolerate that. We use
2473 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2474 we also allow unnamed types used for defining fields. */
2475 if (DECL_ARTIFICIAL (elt)
2476 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2477 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2480 if (TREE_CODE (elt) != FIELD_DECL)
2483 pedwarn ("%q+#D invalid; an anonymous union can "
2484 "only have non-static data members", elt);
2486 pedwarn ("%q+#D invalid; an anonymous struct can "
2487 "only have non-static data members", elt);
2491 if (TREE_PRIVATE (elt))
2494 pedwarn ("private member %q+#D in anonymous union", elt);
2496 pedwarn ("private member %q+#D in anonymous struct", elt);
2498 else if (TREE_PROTECTED (elt))
2501 pedwarn ("protected member %q+#D in anonymous union", elt);
2503 pedwarn ("protected member %q+#D in anonymous struct", elt);
2506 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2507 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2513 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2514 will be used later during class template instantiation.
2515 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2516 a non-static member data (FIELD_DECL), a member function
2517 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2518 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2519 When FRIEND_P is nonzero, T is either a friend class
2520 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2521 (FUNCTION_DECL, TEMPLATE_DECL). */
2524 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2526 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2527 if (CLASSTYPE_TEMPLATE_INFO (type))
2528 CLASSTYPE_DECL_LIST (type)
2529 = tree_cons (friend_p ? NULL_TREE : type,
2530 t, CLASSTYPE_DECL_LIST (type));
2533 /* Create default constructors, assignment operators, and so forth for
2534 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2535 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2536 the class cannot have a default constructor, copy constructor
2537 taking a const reference argument, or an assignment operator taking
2538 a const reference, respectively. */
2541 add_implicitly_declared_members (tree t,
2542 int cant_have_const_cctor,
2543 int cant_have_const_assignment)
2546 if (!CLASSTYPE_DESTRUCTORS (t))
2548 /* In general, we create destructors lazily. */
2549 CLASSTYPE_LAZY_DESTRUCTOR (t) = 1;
2550 /* However, if the implicit destructor is non-trivial
2551 destructor, we sometimes have to create it at this point. */
2552 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
2556 if (TYPE_FOR_JAVA (t))
2557 /* If this a Java class, any non-trivial destructor is
2558 invalid, even if compiler-generated. Therefore, if the
2559 destructor is non-trivial we create it now. */
2567 /* If the implicit destructor will be virtual, then we must
2568 generate it now because (unfortunately) we do not
2569 generate virtual tables lazily. */
2570 binfo = TYPE_BINFO (t);
2571 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2576 base_type = BINFO_TYPE (base_binfo);
2577 dtor = CLASSTYPE_DESTRUCTORS (base_type);
2578 if (dtor && DECL_VIRTUAL_P (dtor))
2586 /* If we can't get away with being lazy, generate the destructor
2589 lazily_declare_fn (sfk_destructor, t);
2593 /* Default constructor. */
2594 if (! TYPE_HAS_CONSTRUCTOR (t))
2596 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1;
2597 CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1;
2600 /* Copy constructor. */
2601 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
2603 TYPE_HAS_INIT_REF (t) = 1;
2604 TYPE_HAS_CONST_INIT_REF (t) = !cant_have_const_cctor;
2605 CLASSTYPE_LAZY_COPY_CTOR (t) = 1;
2606 TYPE_HAS_CONSTRUCTOR (t) = 1;
2609 /* If there is no assignment operator, one will be created if and
2610 when it is needed. For now, just record whether or not the type
2611 of the parameter to the assignment operator will be a const or
2612 non-const reference. */
2613 if (!TYPE_HAS_ASSIGN_REF (t) && !TYPE_FOR_JAVA (t))
2615 TYPE_HAS_ASSIGN_REF (t) = 1;
2616 TYPE_HAS_CONST_ASSIGN_REF (t) = !cant_have_const_assignment;
2617 CLASSTYPE_LAZY_ASSIGNMENT_OP (t) = 1;
2621 /* Subroutine of finish_struct_1. Recursively count the number of fields
2622 in TYPE, including anonymous union members. */
2625 count_fields (tree fields)
2629 for (x = fields; x; x = TREE_CHAIN (x))
2631 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2632 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2639 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2640 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2643 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
2646 for (x = fields; x; x = TREE_CHAIN (x))
2648 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2649 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
2651 field_vec->elts[idx++] = x;
2656 /* FIELD is a bit-field. We are finishing the processing for its
2657 enclosing type. Issue any appropriate messages and set appropriate
2658 flags. Returns false if an error has been diagnosed. */
2661 check_bitfield_decl (tree field)
2663 tree type = TREE_TYPE (field);
2666 /* Extract the declared width of the bitfield, which has been
2667 temporarily stashed in DECL_INITIAL. */
2668 w = DECL_INITIAL (field);
2669 gcc_assert (w != NULL_TREE);
2670 /* Remove the bit-field width indicator so that the rest of the
2671 compiler does not treat that value as an initializer. */
2672 DECL_INITIAL (field) = NULL_TREE;
2674 /* Detect invalid bit-field type. */
2675 if (!INTEGRAL_TYPE_P (type))
2677 error ("bit-field %q+#D with non-integral type", field);
2678 w = error_mark_node;
2682 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2685 /* detect invalid field size. */
2686 w = integral_constant_value (w);
2688 if (TREE_CODE (w) != INTEGER_CST)
2690 error ("bit-field %q+D width not an integer constant", field);
2691 w = error_mark_node;
2693 else if (tree_int_cst_sgn (w) < 0)
2695 error ("negative width in bit-field %q+D", field);
2696 w = error_mark_node;
2698 else if (integer_zerop (w) && DECL_NAME (field) != 0)
2700 error ("zero width for bit-field %q+D", field);
2701 w = error_mark_node;
2703 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
2704 && TREE_CODE (type) != ENUMERAL_TYPE
2705 && TREE_CODE (type) != BOOLEAN_TYPE)
2706 warning (0, "width of %q+D exceeds its type", field);
2707 else if (TREE_CODE (type) == ENUMERAL_TYPE
2708 && (0 > compare_tree_int (w,
2709 min_precision (TYPE_MIN_VALUE (type),
2710 TYPE_UNSIGNED (type)))
2711 || 0 > compare_tree_int (w,
2713 (TYPE_MAX_VALUE (type),
2714 TYPE_UNSIGNED (type)))))
2715 warning (0, "%q+D is too small to hold all values of %q#T", field, type);
2718 if (w != error_mark_node)
2720 DECL_SIZE (field) = convert (bitsizetype, w);
2721 DECL_BIT_FIELD (field) = 1;
2726 /* Non-bit-fields are aligned for their type. */
2727 DECL_BIT_FIELD (field) = 0;
2728 CLEAR_DECL_C_BIT_FIELD (field);
2733 /* FIELD is a non bit-field. We are finishing the processing for its
2734 enclosing type T. Issue any appropriate messages and set appropriate
2738 check_field_decl (tree field,
2740 int* cant_have_const_ctor,
2741 int* no_const_asn_ref,
2742 int* any_default_members)
2744 tree type = strip_array_types (TREE_TYPE (field));
2746 /* An anonymous union cannot contain any fields which would change
2747 the settings of CANT_HAVE_CONST_CTOR and friends. */
2748 if (ANON_UNION_TYPE_P (type))
2750 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2751 structs. So, we recurse through their fields here. */
2752 else if (ANON_AGGR_TYPE_P (type))
2756 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2757 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
2758 check_field_decl (fields, t, cant_have_const_ctor,
2759 no_const_asn_ref, any_default_members);
2761 /* Check members with class type for constructors, destructors,
2763 else if (CLASS_TYPE_P (type))
2765 /* Never let anything with uninheritable virtuals
2766 make it through without complaint. */
2767 abstract_virtuals_error (field, type);
2769 if (TREE_CODE (t) == UNION_TYPE)
2771 if (TYPE_NEEDS_CONSTRUCTING (type))
2772 error ("member %q+#D with constructor not allowed in union",
2774 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
2775 error ("member %q+#D with destructor not allowed in union", field);
2776 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2777 error ("member %q+#D with copy assignment operator not allowed in union",
2782 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
2783 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2784 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
2785 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
2786 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
2787 TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_HAS_COMPLEX_DFLT (type);
2790 if (!TYPE_HAS_CONST_INIT_REF (type))
2791 *cant_have_const_ctor = 1;
2793 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
2794 *no_const_asn_ref = 1;
2796 if (DECL_INITIAL (field) != NULL_TREE)
2798 /* `build_class_init_list' does not recognize
2800 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
2801 error ("multiple fields in union %qT initialized", t);
2802 *any_default_members = 1;
2806 /* Check the data members (both static and non-static), class-scoped
2807 typedefs, etc., appearing in the declaration of T. Issue
2808 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2809 declaration order) of access declarations; each TREE_VALUE in this
2810 list is a USING_DECL.
2812 In addition, set the following flags:
2815 The class is empty, i.e., contains no non-static data members.
2817 CANT_HAVE_CONST_CTOR_P
2818 This class cannot have an implicitly generated copy constructor
2819 taking a const reference.
2821 CANT_HAVE_CONST_ASN_REF
2822 This class cannot have an implicitly generated assignment
2823 operator taking a const reference.
2825 All of these flags should be initialized before calling this
2828 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2829 fields can be added by adding to this chain. */
2832 check_field_decls (tree t, tree *access_decls,
2833 int *cant_have_const_ctor_p,
2834 int *no_const_asn_ref_p)
2839 int any_default_members;
2842 /* Assume there are no access declarations. */
2843 *access_decls = NULL_TREE;
2844 /* Assume this class has no pointer members. */
2845 has_pointers = false;
2846 /* Assume none of the members of this class have default
2848 any_default_members = 0;
2850 for (field = &TYPE_FIELDS (t); *field; field = next)
2853 tree type = TREE_TYPE (x);
2855 next = &TREE_CHAIN (x);
2857 if (TREE_CODE (x) == USING_DECL)
2859 /* Prune the access declaration from the list of fields. */
2860 *field = TREE_CHAIN (x);
2862 /* Save the access declarations for our caller. */
2863 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
2865 /* Since we've reset *FIELD there's no reason to skip to the
2871 if (TREE_CODE (x) == TYPE_DECL
2872 || TREE_CODE (x) == TEMPLATE_DECL)
2875 /* If we've gotten this far, it's a data member, possibly static,
2876 or an enumerator. */
2877 DECL_CONTEXT (x) = t;
2879 /* When this goes into scope, it will be a non-local reference. */
2880 DECL_NONLOCAL (x) = 1;
2882 if (TREE_CODE (t) == UNION_TYPE)
2886 If a union contains a static data member, or a member of
2887 reference type, the program is ill-formed. */
2888 if (TREE_CODE (x) == VAR_DECL)
2890 error ("%q+D may not be static because it is a member of a union", x);
2893 if (TREE_CODE (type) == REFERENCE_TYPE)
2895 error ("%q+D may not have reference type %qT because"
2896 " it is a member of a union",
2902 /* Perform error checking that did not get done in
2904 if (TREE_CODE (type) == FUNCTION_TYPE)
2906 error ("field %q+D invalidly declared function type", x);
2907 type = build_pointer_type (type);
2908 TREE_TYPE (x) = type;
2910 else if (TREE_CODE (type) == METHOD_TYPE)
2912 error ("field %q+D invalidly declared method type", x);
2913 type = build_pointer_type (type);
2914 TREE_TYPE (x) = type;
2917 if (type == error_mark_node)
2920 if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL)
2923 /* Now it can only be a FIELD_DECL. */
2925 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
2926 CLASSTYPE_NON_AGGREGATE (t) = 1;
2928 /* If this is of reference type, check if it needs an init.
2929 Also do a little ANSI jig if necessary. */
2930 if (TREE_CODE (type) == REFERENCE_TYPE)
2932 CLASSTYPE_NON_POD_P (t) = 1;
2933 if (DECL_INITIAL (x) == NULL_TREE)
2934 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2936 /* ARM $12.6.2: [A member initializer list] (or, for an
2937 aggregate, initialization by a brace-enclosed list) is the
2938 only way to initialize nonstatic const and reference
2940 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2942 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2944 warning (OPT_Wextra, "non-static reference %q+#D in class without a constructor", x);
2947 type = strip_array_types (type);
2949 if (TYPE_PACKED (t))
2951 if (!pod_type_p (type) && !TYPE_PACKED (type))
2955 "ignoring packed attribute because of unpacked non-POD field %q+#D",
2959 else if (TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT)
2960 DECL_PACKED (x) = 1;
2963 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
2964 /* We don't treat zero-width bitfields as making a class
2969 /* The class is non-empty. */
2970 CLASSTYPE_EMPTY_P (t) = 0;
2971 /* The class is not even nearly empty. */
2972 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
2973 /* If one of the data members contains an empty class,
2975 if (CLASS_TYPE_P (type)
2976 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
2977 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
2980 /* This is used by -Weffc++ (see below). Warn only for pointers
2981 to members which might hold dynamic memory. So do not warn
2982 for pointers to functions or pointers to members. */
2983 if (TYPE_PTR_P (type)
2984 && !TYPE_PTRFN_P (type)
2985 && !TYPE_PTR_TO_MEMBER_P (type))
2986 has_pointers = true;
2988 if (CLASS_TYPE_P (type))
2990 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type))
2991 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2992 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type))
2993 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2996 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
2997 CLASSTYPE_HAS_MUTABLE (t) = 1;
2999 if (! pod_type_p (type))
3000 /* DR 148 now allows pointers to members (which are POD themselves),
3001 to be allowed in POD structs. */
3002 CLASSTYPE_NON_POD_P (t) = 1;
3004 if (! zero_init_p (type))
3005 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
3007 /* If any field is const, the structure type is pseudo-const. */
3008 if (CP_TYPE_CONST_P (type))
3010 C_TYPE_FIELDS_READONLY (t) = 1;
3011 if (DECL_INITIAL (x) == NULL_TREE)
3012 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
3014 /* ARM $12.6.2: [A member initializer list] (or, for an
3015 aggregate, initialization by a brace-enclosed list) is the
3016 only way to initialize nonstatic const and reference
3018 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3020 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
3022 warning (OPT_Wextra, "non-static const member %q+#D in class without a constructor", x);
3024 /* A field that is pseudo-const makes the structure likewise. */
3025 else if (CLASS_TYPE_P (type))
3027 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3028 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
3029 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3030 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
3033 /* Core issue 80: A nonstatic data member is required to have a
3034 different name from the class iff the class has a
3035 user-defined constructor. */
3036 if (constructor_name_p (DECL_NAME (x), t) && TYPE_HAS_CONSTRUCTOR (t))
3037 pedwarn ("field %q+#D with same name as class", x);
3039 /* We set DECL_C_BIT_FIELD in grokbitfield.
3040 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3041 if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x))
3042 check_field_decl (x, t,
3043 cant_have_const_ctor_p,
3045 &any_default_members);
3048 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3049 it should also define a copy constructor and an assignment operator to
3050 implement the correct copy semantic (deep vs shallow, etc.). As it is
3051 not feasible to check whether the constructors do allocate dynamic memory
3052 and store it within members, we approximate the warning like this:
3054 -- Warn only if there are members which are pointers
3055 -- Warn only if there is a non-trivial constructor (otherwise,
3056 there cannot be memory allocated).
3057 -- Warn only if there is a non-trivial destructor. We assume that the
3058 user at least implemented the cleanup correctly, and a destructor
3059 is needed to free dynamic memory.
3061 This seems enough for practical purposes. */
3064 && TYPE_HAS_CONSTRUCTOR (t)
3065 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3066 && !(TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3068 warning (OPT_Weffc__, "%q#T has pointer data members", t);
3070 if (! TYPE_HAS_INIT_REF (t))
3072 warning (OPT_Weffc__,
3073 " but does not override %<%T(const %T&)%>", t, t);
3074 if (!TYPE_HAS_ASSIGN_REF (t))
3075 warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t);
3077 else if (! TYPE_HAS_ASSIGN_REF (t))
3078 warning (OPT_Weffc__,
3079 " but does not override %<operator=(const %T&)%>", t);
3082 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3084 TYPE_PACKED (t) = 0;
3086 /* Check anonymous struct/anonymous union fields. */
3087 finish_struct_anon (t);
3089 /* We've built up the list of access declarations in reverse order.
3091 *access_decls = nreverse (*access_decls);
3094 /* If TYPE is an empty class type, records its OFFSET in the table of
3098 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3102 if (!is_empty_class (type))
3105 /* Record the location of this empty object in OFFSETS. */
3106 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3108 n = splay_tree_insert (offsets,
3109 (splay_tree_key) offset,
3110 (splay_tree_value) NULL_TREE);
3111 n->value = ((splay_tree_value)
3112 tree_cons (NULL_TREE,
3119 /* Returns nonzero if TYPE is an empty class type and there is
3120 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3123 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3128 if (!is_empty_class (type))
3131 /* Record the location of this empty object in OFFSETS. */
3132 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3136 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3137 if (same_type_p (TREE_VALUE (t), type))
3143 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3144 F for every subobject, passing it the type, offset, and table of
3145 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3148 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3149 than MAX_OFFSET will not be walked.
3151 If F returns a nonzero value, the traversal ceases, and that value
3152 is returned. Otherwise, returns zero. */
3155 walk_subobject_offsets (tree type,
3156 subobject_offset_fn f,
3163 tree type_binfo = NULL_TREE;
3165 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3167 if (max_offset && INT_CST_LT (max_offset, offset))
3170 if (type == error_mark_node)
3175 if (abi_version_at_least (2))
3177 type = BINFO_TYPE (type);
3180 if (CLASS_TYPE_P (type))
3186 /* Avoid recursing into objects that are not interesting. */
3187 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3190 /* Record the location of TYPE. */
3191 r = (*f) (type, offset, offsets);
3195 /* Iterate through the direct base classes of TYPE. */
3197 type_binfo = TYPE_BINFO (type);
3198 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++)
3202 if (abi_version_at_least (2)
3203 && BINFO_VIRTUAL_P (binfo))
3207 && BINFO_VIRTUAL_P (binfo)
3208 && !BINFO_PRIMARY_P (binfo))
3211 if (!abi_version_at_least (2))
3212 binfo_offset = size_binop (PLUS_EXPR,
3214 BINFO_OFFSET (binfo));
3218 /* We cannot rely on BINFO_OFFSET being set for the base
3219 class yet, but the offsets for direct non-virtual
3220 bases can be calculated by going back to the TYPE. */
3221 orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i);
3222 binfo_offset = size_binop (PLUS_EXPR,
3224 BINFO_OFFSET (orig_binfo));
3227 r = walk_subobject_offsets (binfo,
3232 (abi_version_at_least (2)
3233 ? /*vbases_p=*/0 : vbases_p));
3238 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type))
3241 VEC(tree,gc) *vbases;
3243 /* Iterate through the virtual base classes of TYPE. In G++
3244 3.2, we included virtual bases in the direct base class
3245 loop above, which results in incorrect results; the
3246 correct offsets for virtual bases are only known when
3247 working with the most derived type. */
3249 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
3250 VEC_iterate (tree, vbases, ix, binfo); ix++)
3252 r = walk_subobject_offsets (binfo,
3254 size_binop (PLUS_EXPR,
3256 BINFO_OFFSET (binfo)),
3265 /* We still have to walk the primary base, if it is
3266 virtual. (If it is non-virtual, then it was walked
3268 tree vbase = get_primary_binfo (type_binfo);
3270 if (vbase && BINFO_VIRTUAL_P (vbase)
3271 && BINFO_PRIMARY_P (vbase)
3272 && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo)
3274 r = (walk_subobject_offsets
3276 offsets, max_offset, /*vbases_p=*/0));
3283 /* Iterate through the fields of TYPE. */
3284 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3285 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3289 if (abi_version_at_least (2))
3290 field_offset = byte_position (field);
3292 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3293 field_offset = DECL_FIELD_OFFSET (field);
3295 r = walk_subobject_offsets (TREE_TYPE (field),
3297 size_binop (PLUS_EXPR,
3307 else if (TREE_CODE (type) == ARRAY_TYPE)
3309 tree element_type = strip_array_types (type);
3310 tree domain = TYPE_DOMAIN (type);
3313 /* Avoid recursing into objects that are not interesting. */
3314 if (!CLASS_TYPE_P (element_type)
3315 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3318 /* Step through each of the elements in the array. */
3319 for (index = size_zero_node;
3320 /* G++ 3.2 had an off-by-one error here. */
3321 (abi_version_at_least (2)
3322 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3323 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3324 index = size_binop (PLUS_EXPR, index, size_one_node))
3326 r = walk_subobject_offsets (TREE_TYPE (type),
3334 offset = size_binop (PLUS_EXPR, offset,
3335 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3336 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3337 there's no point in iterating through the remaining
3338 elements of the array. */
3339 if (max_offset && INT_CST_LT (max_offset, offset))
3347 /* Record all of the empty subobjects of TYPE (either a type or a
3348 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3349 is being placed at OFFSET; otherwise, it is a base class that is
3350 being placed at OFFSET. */
3353 record_subobject_offsets (tree type,
3356 bool is_data_member)
3359 /* If recording subobjects for a non-static data member or a
3360 non-empty base class , we do not need to record offsets beyond
3361 the size of the biggest empty class. Additional data members
3362 will go at the end of the class. Additional base classes will go
3363 either at offset zero (if empty, in which case they cannot
3364 overlap with offsets past the size of the biggest empty class) or
3365 at the end of the class.
3367 However, if we are placing an empty base class, then we must record
3368 all offsets, as either the empty class is at offset zero (where
3369 other empty classes might later be placed) or at the end of the
3370 class (where other objects might then be placed, so other empty
3371 subobjects might later overlap). */
3373 || !is_empty_class (BINFO_TYPE (type)))
3374 max_offset = sizeof_biggest_empty_class;
3376 max_offset = NULL_TREE;
3377 walk_subobject_offsets (type, record_subobject_offset, offset,
3378 offsets, max_offset, is_data_member);
3381 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3382 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3383 virtual bases of TYPE are examined. */
3386 layout_conflict_p (tree type,
3391 splay_tree_node max_node;
3393 /* Get the node in OFFSETS that indicates the maximum offset where
3394 an empty subobject is located. */
3395 max_node = splay_tree_max (offsets);
3396 /* If there aren't any empty subobjects, then there's no point in
3397 performing this check. */
3401 return walk_subobject_offsets (type, check_subobject_offset, offset,
3402 offsets, (tree) (max_node->key),
3406 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3407 non-static data member of the type indicated by RLI. BINFO is the
3408 binfo corresponding to the base subobject, OFFSETS maps offsets to
3409 types already located at those offsets. This function determines
3410 the position of the DECL. */
3413 layout_nonempty_base_or_field (record_layout_info rli,
3418 tree offset = NULL_TREE;
3424 /* For the purposes of determining layout conflicts, we want to
3425 use the class type of BINFO; TREE_TYPE (DECL) will be the
3426 CLASSTYPE_AS_BASE version, which does not contain entries for
3427 zero-sized bases. */
3428 type = TREE_TYPE (binfo);
3433 type = TREE_TYPE (decl);
3437 /* Try to place the field. It may take more than one try if we have
3438 a hard time placing the field without putting two objects of the
3439 same type at the same address. */
3442 struct record_layout_info_s old_rli = *rli;
3444 /* Place this field. */
3445 place_field (rli, decl);
3446 offset = byte_position (decl);
3448 /* We have to check to see whether or not there is already
3449 something of the same type at the offset we're about to use.
3450 For example, consider:
3453 struct T : public S { int i; };
3454 struct U : public S, public T {};
3456 Here, we put S at offset zero in U. Then, we can't put T at
3457 offset zero -- its S component would be at the same address
3458 as the S we already allocated. So, we have to skip ahead.
3459 Since all data members, including those whose type is an
3460 empty class, have nonzero size, any overlap can happen only
3461 with a direct or indirect base-class -- it can't happen with
3463 /* In a union, overlap is permitted; all members are placed at
3465 if (TREE_CODE (rli->t) == UNION_TYPE)
3467 /* G++ 3.2 did not check for overlaps when placing a non-empty
3469 if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo))
3471 if (layout_conflict_p (field_p ? type : binfo, offset,
3474 /* Strip off the size allocated to this field. That puts us
3475 at the first place we could have put the field with
3476 proper alignment. */
3479 /* Bump up by the alignment required for the type. */
3481 = size_binop (PLUS_EXPR, rli->bitpos,
3483 ? CLASSTYPE_ALIGN (type)
3484 : TYPE_ALIGN (type)));
3485 normalize_rli (rli);
3488 /* There was no conflict. We're done laying out this field. */
3492 /* Now that we know where it will be placed, update its
3494 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3495 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3496 this point because their BINFO_OFFSET is copied from another
3497 hierarchy. Therefore, we may not need to add the entire
3499 propagate_binfo_offsets (binfo,
3500 size_diffop (convert (ssizetype, offset),
3502 BINFO_OFFSET (binfo))));
3505 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3508 empty_base_at_nonzero_offset_p (tree type,
3510 splay_tree offsets ATTRIBUTE_UNUSED)
3512 return is_empty_class (type) && !integer_zerop (offset);
3515 /* Layout the empty base BINFO. EOC indicates the byte currently just
3516 past the end of the class, and should be correctly aligned for a
3517 class of the type indicated by BINFO; OFFSETS gives the offsets of
3518 the empty bases allocated so far. T is the most derived
3519 type. Return nonzero iff we added it at the end. */
3522 layout_empty_base (record_layout_info rli, tree binfo,
3523 tree eoc, splay_tree offsets)
3526 tree basetype = BINFO_TYPE (binfo);
3529 /* This routine should only be used for empty classes. */
3530 gcc_assert (is_empty_class (basetype));
3531 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3533 if (!integer_zerop (BINFO_OFFSET (binfo)))
3535 if (abi_version_at_least (2))
3536 propagate_binfo_offsets
3537 (binfo, size_diffop (size_zero_node, BINFO_OFFSET (binfo)));
3540 "offset of empty base %qT may not be ABI-compliant and may"
3541 "change in a future version of GCC",
3542 BINFO_TYPE (binfo));
3545 /* This is an empty base class. We first try to put it at offset
3547 if (layout_conflict_p (binfo,
3548 BINFO_OFFSET (binfo),
3552 /* That didn't work. Now, we move forward from the next
3553 available spot in the class. */
3555 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3558 if (!layout_conflict_p (binfo,
3559 BINFO_OFFSET (binfo),
3562 /* We finally found a spot where there's no overlap. */
3565 /* There's overlap here, too. Bump along to the next spot. */
3566 propagate_binfo_offsets (binfo, alignment);
3570 if (CLASSTYPE_USER_ALIGN (basetype))
3572 rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype));
3574 rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype));
3575 TYPE_USER_ALIGN (rli->t) = 1;
3581 /* Layout the base given by BINFO in the class indicated by RLI.
3582 *BASE_ALIGN is a running maximum of the alignments of
3583 any base class. OFFSETS gives the location of empty base
3584 subobjects. T is the most derived type. Return nonzero if the new
3585 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3586 *NEXT_FIELD, unless BINFO is for an empty base class.
3588 Returns the location at which the next field should be inserted. */
3591 build_base_field (record_layout_info rli, tree binfo,
3592 splay_tree offsets, tree *next_field)
3595 tree basetype = BINFO_TYPE (binfo);
3597 if (!COMPLETE_TYPE_P (basetype))
3598 /* This error is now reported in xref_tag, thus giving better
3599 location information. */
3602 /* Place the base class. */
3603 if (!is_empty_class (basetype))
3607 /* The containing class is non-empty because it has a non-empty
3609 CLASSTYPE_EMPTY_P (t) = 0;
3611 /* Create the FIELD_DECL. */
3612 decl = build_decl (FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
3613 DECL_ARTIFICIAL (decl) = 1;
3614 DECL_IGNORED_P (decl) = 1;
3615 DECL_FIELD_CONTEXT (decl) = t;
3616 if (CLASSTYPE_AS_BASE (basetype))
3618 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3619 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3620 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3621 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3622 DECL_MODE (decl) = TYPE_MODE (basetype);
3623 DECL_FIELD_IS_BASE (decl) = 1;
3625 /* Try to place the field. It may take more than one try if we
3626 have a hard time placing the field without putting two
3627 objects of the same type at the same address. */
3628 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
3629 /* Add the new FIELD_DECL to the list of fields for T. */
3630 TREE_CHAIN (decl) = *next_field;
3632 next_field = &TREE_CHAIN (decl);
3640 /* On some platforms (ARM), even empty classes will not be
3642 eoc = round_up (rli_size_unit_so_far (rli),
3643 CLASSTYPE_ALIGN_UNIT (basetype));
3644 atend = layout_empty_base (rli, binfo, eoc, offsets);
3645 /* A nearly-empty class "has no proper base class that is empty,
3646 not morally virtual, and at an offset other than zero." */
3647 if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
3650 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3651 /* The check above (used in G++ 3.2) is insufficient because
3652 an empty class placed at offset zero might itself have an
3653 empty base at a nonzero offset. */
3654 else if (walk_subobject_offsets (basetype,
3655 empty_base_at_nonzero_offset_p,
3658 /*max_offset=*/NULL_TREE,
3661 if (abi_version_at_least (2))
3662 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3665 "class %qT will be considered nearly empty in a "
3666 "future version of GCC", t);
3670 /* We do not create a FIELD_DECL for empty base classes because
3671 it might overlap some other field. We want to be able to
3672 create CONSTRUCTORs for the class by iterating over the
3673 FIELD_DECLs, and the back end does not handle overlapping
3676 /* An empty virtual base causes a class to be non-empty
3677 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3678 here because that was already done when the virtual table
3679 pointer was created. */
3682 /* Record the offsets of BINFO and its base subobjects. */
3683 record_subobject_offsets (binfo,
3684 BINFO_OFFSET (binfo),
3686 /*is_data_member=*/false);
3691 /* Layout all of the non-virtual base classes. Record empty
3692 subobjects in OFFSETS. T is the most derived type. Return nonzero
3693 if the type cannot be nearly empty. The fields created
3694 corresponding to the base classes will be inserted at
3698 build_base_fields (record_layout_info rli,
3699 splay_tree offsets, tree *next_field)
3701 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3704 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
3707 /* The primary base class is always allocated first. */
3708 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
3709 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
3710 offsets, next_field);
3712 /* Now allocate the rest of the bases. */
3713 for (i = 0; i < n_baseclasses; ++i)
3717 base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
3719 /* The primary base was already allocated above, so we don't
3720 need to allocate it again here. */
3721 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
3724 /* Virtual bases are added at the end (a primary virtual base
3725 will have already been added). */
3726 if (BINFO_VIRTUAL_P (base_binfo))
3729 next_field = build_base_field (rli, base_binfo,
3730 offsets, next_field);
3734 /* Go through the TYPE_METHODS of T issuing any appropriate
3735 diagnostics, figuring out which methods override which other
3736 methods, and so forth. */
3739 check_methods (tree t)
3743 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3745 check_for_override (x, t);
3746 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3747 error ("initializer specified for non-virtual method %q+D", x);
3748 /* The name of the field is the original field name
3749 Save this in auxiliary field for later overloading. */
3750 if (DECL_VINDEX (x))
3752 TYPE_POLYMORPHIC_P (t) = 1;
3753 if (DECL_PURE_VIRTUAL_P (x))
3754 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
3756 /* All user-declared destructors are non-trivial. */
3757 if (DECL_DESTRUCTOR_P (x))
3758 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1;
3762 /* FN is a constructor or destructor. Clone the declaration to create
3763 a specialized in-charge or not-in-charge version, as indicated by
3767 build_clone (tree fn, tree name)
3772 /* Copy the function. */
3773 clone = copy_decl (fn);
3774 /* Remember where this function came from. */
3775 DECL_CLONED_FUNCTION (clone) = fn;
3776 DECL_ABSTRACT_ORIGIN (clone) = fn;
3777 /* Reset the function name. */
3778 DECL_NAME (clone) = name;
3779 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
3780 /* There's no pending inline data for this function. */
3781 DECL_PENDING_INLINE_INFO (clone) = NULL;
3782 DECL_PENDING_INLINE_P (clone) = 0;
3783 /* And it hasn't yet been deferred. */
3784 DECL_DEFERRED_FN (clone) = 0;
3786 /* The base-class destructor is not virtual. */
3787 if (name == base_dtor_identifier)
3789 DECL_VIRTUAL_P (clone) = 0;
3790 if (TREE_CODE (clone) != TEMPLATE_DECL)
3791 DECL_VINDEX (clone) = NULL_TREE;
3794 /* If there was an in-charge parameter, drop it from the function
3796 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3802 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3803 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3804 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
3805 /* Skip the `this' parameter. */
3806 parmtypes = TREE_CHAIN (parmtypes);
3807 /* Skip the in-charge parameter. */
3808 parmtypes = TREE_CHAIN (parmtypes);
3809 /* And the VTT parm, in a complete [cd]tor. */
3810 if (DECL_HAS_VTT_PARM_P (fn)
3811 && ! DECL_NEEDS_VTT_PARM_P (clone))
3812 parmtypes = TREE_CHAIN (parmtypes);
3813 /* If this is subobject constructor or destructor, add the vtt
3816 = build_method_type_directly (basetype,
3817 TREE_TYPE (TREE_TYPE (clone)),
3820 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
3823 = cp_build_type_attribute_variant (TREE_TYPE (clone),
3824 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
3827 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3828 aren't function parameters; those are the template parameters. */
3829 if (TREE_CODE (clone) != TEMPLATE_DECL)
3831 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
3832 /* Remove the in-charge parameter. */
3833 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3835 TREE_CHAIN (DECL_ARGUMENTS (clone))
3836 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3837 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
3839 /* And the VTT parm, in a complete [cd]tor. */
3840 if (DECL_HAS_VTT_PARM_P (fn))
3842 if (DECL_NEEDS_VTT_PARM_P (clone))
3843 DECL_HAS_VTT_PARM_P (clone) = 1;
3846 TREE_CHAIN (DECL_ARGUMENTS (clone))
3847 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3848 DECL_HAS_VTT_PARM_P (clone) = 0;
3852 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
3854 DECL_CONTEXT (parms) = clone;
3855 cxx_dup_lang_specific_decl (parms);
3859 /* Create the RTL for this function. */
3860 SET_DECL_RTL (clone, NULL_RTX);
3861 rest_of_decl_compilation (clone, /*top_level=*/1, at_eof);
3863 /* Make it easy to find the CLONE given the FN. */
3864 TREE_CHAIN (clone) = TREE_CHAIN (fn);
3865 TREE_CHAIN (fn) = clone;
3867 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3868 if (TREE_CODE (clone) == TEMPLATE_DECL)
3872 DECL_TEMPLATE_RESULT (clone)
3873 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
3874 result = DECL_TEMPLATE_RESULT (clone);
3875 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
3876 DECL_TI_TEMPLATE (result) = clone;
3879 note_decl_for_pch (clone);
3884 /* Produce declarations for all appropriate clones of FN. If
3885 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3886 CLASTYPE_METHOD_VEC as well. */
3889 clone_function_decl (tree fn, int update_method_vec_p)
3893 /* Avoid inappropriate cloning. */
3895 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn)))
3898 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
3900 /* For each constructor, we need two variants: an in-charge version
3901 and a not-in-charge version. */
3902 clone = build_clone (fn, complete_ctor_identifier);
3903 if (update_method_vec_p)
3904 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3905 clone = build_clone (fn, base_ctor_identifier);
3906 if (update_method_vec_p)
3907 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3911 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn));
3913 /* For each destructor, we need three variants: an in-charge
3914 version, a not-in-charge version, and an in-charge deleting
3915 version. We clone the deleting version first because that
3916 means it will go second on the TYPE_METHODS list -- and that
3917 corresponds to the correct layout order in the virtual
3920 For a non-virtual destructor, we do not build a deleting
3922 if (DECL_VIRTUAL_P (fn))
3924 clone = build_clone (fn, deleting_dtor_identifier);
3925 if (update_method_vec_p)
3926 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3928 clone = build_clone (fn, complete_dtor_identifier);
3929 if (update_method_vec_p)
3930 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3931 clone = build_clone (fn, base_dtor_identifier);
3932 if (update_method_vec_p)
3933 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
3936 /* Note that this is an abstract function that is never emitted. */
3937 DECL_ABSTRACT (fn) = 1;
3940 /* DECL is an in charge constructor, which is being defined. This will
3941 have had an in class declaration, from whence clones were
3942 declared. An out-of-class definition can specify additional default
3943 arguments. As it is the clones that are involved in overload
3944 resolution, we must propagate the information from the DECL to its
3948 adjust_clone_args (tree decl)
3952 for (clone = TREE_CHAIN (decl); clone && DECL_CLONED_FUNCTION (clone);
3953 clone = TREE_CHAIN (clone))
3955 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
3956 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
3957 tree decl_parms, clone_parms;
3959 clone_parms = orig_clone_parms;
3961 /* Skip the 'this' parameter. */
3962 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
3963 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3965 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
3966 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3967 if (DECL_HAS_VTT_PARM_P (decl))
3968 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3970 clone_parms = orig_clone_parms;
3971 if (DECL_HAS_VTT_PARM_P (clone))
3972 clone_parms = TREE_CHAIN (clone_parms);
3974 for (decl_parms = orig_decl_parms; decl_parms;
3975 decl_parms = TREE_CHAIN (decl_parms),
3976 clone_parms = TREE_CHAIN (clone_parms))
3978 gcc_assert (same_type_p (TREE_TYPE (decl_parms),
3979 TREE_TYPE (clone_parms)));
3981 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
3983 /* A default parameter has been added. Adjust the
3984 clone's parameters. */
3985 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3986 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3989 clone_parms = orig_decl_parms;
3991 if (DECL_HAS_VTT_PARM_P (clone))
3993 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
3994 TREE_VALUE (orig_clone_parms),
3996 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
3998 type = build_method_type_directly (basetype,
3999 TREE_TYPE (TREE_TYPE (clone)),
4002 type = build_exception_variant (type, exceptions);
4003 TREE_TYPE (clone) = type;
4005 clone_parms = NULL_TREE;
4009 gcc_assert (!clone_parms);
4013 /* For each of the constructors and destructors in T, create an
4014 in-charge and not-in-charge variant. */
4017 clone_constructors_and_destructors (tree t)
4021 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4023 if (!CLASSTYPE_METHOD_VEC (t))
4026 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4027 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4028 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4029 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4032 /* Remove all zero-width bit-fields from T. */
4035 remove_zero_width_bit_fields (tree t)
4039 fieldsp = &TYPE_FIELDS (t);
4042 if (TREE_CODE (*fieldsp) == FIELD_DECL
4043 && DECL_C_BIT_FIELD (*fieldsp)
4044 && DECL_INITIAL (*fieldsp))
4045 *fieldsp = TREE_CHAIN (*fieldsp);
4047 fieldsp = &TREE_CHAIN (*fieldsp);
4051 /* Returns TRUE iff we need a cookie when dynamically allocating an
4052 array whose elements have the indicated class TYPE. */
4055 type_requires_array_cookie (tree type)
4058 bool has_two_argument_delete_p = false;
4060 gcc_assert (CLASS_TYPE_P (type));
4062 /* If there's a non-trivial destructor, we need a cookie. In order
4063 to iterate through the array calling the destructor for each
4064 element, we'll have to know how many elements there are. */
4065 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4068 /* If the usual deallocation function is a two-argument whose second
4069 argument is of type `size_t', then we have to pass the size of
4070 the array to the deallocation function, so we will need to store
4072 fns = lookup_fnfields (TYPE_BINFO (type),
4073 ansi_opname (VEC_DELETE_EXPR),
4075 /* If there are no `operator []' members, or the lookup is
4076 ambiguous, then we don't need a cookie. */
4077 if (!fns || fns == error_mark_node)
4079 /* Loop through all of the functions. */
4080 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
4085 /* Select the current function. */
4086 fn = OVL_CURRENT (fns);
4087 /* See if this function is a one-argument delete function. If
4088 it is, then it will be the usual deallocation function. */
4089 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
4090 if (second_parm == void_list_node)
4092 /* Otherwise, if we have a two-argument function and the second
4093 argument is `size_t', it will be the usual deallocation
4094 function -- unless there is one-argument function, too. */
4095 if (TREE_CHAIN (second_parm) == void_list_node
4096 && same_type_p (TREE_VALUE (second_parm), size_type_node))
4097 has_two_argument_delete_p = true;
4100 return has_two_argument_delete_p;
4103 /* Check the validity of the bases and members declared in T. Add any
4104 implicitly-generated functions (like copy-constructors and
4105 assignment operators). Compute various flag bits (like
4106 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4107 level: i.e., independently of the ABI in use. */
4110 check_bases_and_members (tree t)
4112 /* Nonzero if the implicitly generated copy constructor should take
4113 a non-const reference argument. */
4114 int cant_have_const_ctor;
4115 /* Nonzero if the implicitly generated assignment operator
4116 should take a non-const reference argument. */
4117 int no_const_asn_ref;
4120 /* By default, we use const reference arguments and generate default
4122 cant_have_const_ctor = 0;
4123 no_const_asn_ref = 0;
4125 /* Check all the base-classes. */
4126 check_bases (t, &cant_have_const_ctor,
4129 /* Check all the method declarations. */
4132 /* Check all the data member declarations. We cannot call
4133 check_field_decls until we have called check_bases check_methods,
4134 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4135 being set appropriately. */
4136 check_field_decls (t, &access_decls,
4137 &cant_have_const_ctor,
4140 /* A nearly-empty class has to be vptr-containing; a nearly empty
4141 class contains just a vptr. */
4142 if (!TYPE_CONTAINS_VPTR_P (t))
4143 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4145 /* Do some bookkeeping that will guide the generation of implicitly
4146 declared member functions. */
4147 TYPE_HAS_COMPLEX_INIT_REF (t)
4148 |= (TYPE_HAS_INIT_REF (t) || TYPE_CONTAINS_VPTR_P (t));
4149 TYPE_NEEDS_CONSTRUCTING (t)
4150 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4151 CLASSTYPE_NON_AGGREGATE (t)
4152 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_POLYMORPHIC_P (t));
4153 CLASSTYPE_NON_POD_P (t)
4154 |= (CLASSTYPE_NON_AGGREGATE (t)
4155 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
4156 || TYPE_HAS_ASSIGN_REF (t));
4157 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4158 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_CONTAINS_VPTR_P (t);
4159 TYPE_HAS_COMPLEX_DFLT (t)
4160 |= (TYPE_HAS_DEFAULT_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4162 /* Synthesize any needed methods. */
4163 add_implicitly_declared_members (t,
4164 cant_have_const_ctor,
4167 /* Create the in-charge and not-in-charge variants of constructors
4169 clone_constructors_and_destructors (t);
4171 /* Process the using-declarations. */
4172 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4173 handle_using_decl (TREE_VALUE (access_decls), t);
4175 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4176 finish_struct_methods (t);
4178 /* Figure out whether or not we will need a cookie when dynamically
4179 allocating an array of this type. */
4180 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
4181 = type_requires_array_cookie (t);
4184 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4185 accordingly. If a new vfield was created (because T doesn't have a
4186 primary base class), then the newly created field is returned. It
4187 is not added to the TYPE_FIELDS list; it is the caller's
4188 responsibility to do that. Accumulate declared virtual functions
4192 create_vtable_ptr (tree t, tree* virtuals_p)
4196 /* Collect the virtual functions declared in T. */
4197 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4198 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
4199 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
4201 tree new_virtual = make_node (TREE_LIST);
4203 BV_FN (new_virtual) = fn;
4204 BV_DELTA (new_virtual) = integer_zero_node;
4205 BV_VCALL_INDEX (new_virtual) = NULL_TREE;
4207 TREE_CHAIN (new_virtual) = *virtuals_p;
4208 *virtuals_p = new_virtual;
4211 /* If we couldn't find an appropriate base class, create a new field
4212 here. Even if there weren't any new virtual functions, we might need a
4213 new virtual function table if we're supposed to include vptrs in
4214 all classes that need them. */
4215 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
4217 /* We build this decl with vtbl_ptr_type_node, which is a
4218 `vtable_entry_type*'. It might seem more precise to use
4219 `vtable_entry_type (*)[N]' where N is the number of virtual
4220 functions. However, that would require the vtable pointer in
4221 base classes to have a different type than the vtable pointer
4222 in derived classes. We could make that happen, but that
4223 still wouldn't solve all the problems. In particular, the
4224 type-based alias analysis code would decide that assignments
4225 to the base class vtable pointer can't alias assignments to
4226 the derived class vtable pointer, since they have different
4227 types. Thus, in a derived class destructor, where the base
4228 class constructor was inlined, we could generate bad code for
4229 setting up the vtable pointer.
4231 Therefore, we use one type for all vtable pointers. We still
4232 use a type-correct type; it's just doesn't indicate the array
4233 bounds. That's better than using `void*' or some such; it's
4234 cleaner, and it let's the alias analysis code know that these
4235 stores cannot alias stores to void*! */
4238 field = build_decl (FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
4239 DECL_VIRTUAL_P (field) = 1;
4240 DECL_ARTIFICIAL (field) = 1;
4241 DECL_FIELD_CONTEXT (field) = t;
4242 DECL_FCONTEXT (field) = t;
4244 TYPE_VFIELD (t) = field;
4246 /* This class is non-empty. */
4247 CLASSTYPE_EMPTY_P (t) = 0;
4255 /* Fixup the inline function given by INFO now that the class is
4259 fixup_pending_inline (tree fn)
4261 if (DECL_PENDING_INLINE_INFO (fn))
4263 tree args = DECL_ARGUMENTS (fn);
4266 DECL_CONTEXT (args) = fn;
4267 args = TREE_CHAIN (args);
4272 /* Fixup the inline methods and friends in TYPE now that TYPE is
4276 fixup_inline_methods (tree type)
4278 tree method = TYPE_METHODS (type);
4279 VEC(tree,gc) *friends;
4282 if (method && TREE_CODE (method) == TREE_VEC)
4284 if (TREE_VEC_ELT (method, 1))
4285 method = TREE_VEC_ELT (method, 1);
4286 else if (TREE_VEC_ELT (method, 0))
4287 method = TREE_VEC_ELT (method, 0);
4289 method = TREE_VEC_ELT (method, 2);
4292 /* Do inline member functions. */
4293 for (; method; method = TREE_CHAIN (method))
4294 fixup_pending_inline (method);
4297 for (friends = CLASSTYPE_INLINE_FRIENDS (type), ix = 0;
4298 VEC_iterate (tree, friends, ix, method); ix++)
4299 fixup_pending_inline (method);
4300 CLASSTYPE_INLINE_FRIENDS (type) = NULL;
4303 /* Add OFFSET to all base types of BINFO which is a base in the
4304 hierarchy dominated by T.
4306 OFFSET, which is a type offset, is number of bytes. */
4309 propagate_binfo_offsets (tree binfo, tree offset)
4315 /* Update BINFO's offset. */
4316 BINFO_OFFSET (binfo)
4317 = convert (sizetype,
4318 size_binop (PLUS_EXPR,
4319 convert (ssizetype, BINFO_OFFSET (binfo)),
4322 /* Find the primary base class. */
4323 primary_binfo = get_primary_binfo (binfo);
4325 if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo)
4326 propagate_binfo_offsets (primary_binfo, offset);
4328 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4330 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4332 /* Don't do the primary base twice. */
4333 if (base_binfo == primary_binfo)
4336 if (BINFO_VIRTUAL_P (base_binfo))
4339 propagate_binfo_offsets (base_binfo, offset);
4343 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4344 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4345 empty subobjects of T. */
4348 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
4352 bool first_vbase = true;
4355 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0)
4358 if (!abi_version_at_least(2))
4360 /* In G++ 3.2, we incorrectly rounded the size before laying out
4361 the virtual bases. */
4362 finish_record_layout (rli, /*free_p=*/false);
4363 #ifdef STRUCTURE_SIZE_BOUNDARY
4364 /* Packed structures don't need to have minimum size. */
4365 if (! TYPE_PACKED (t))
4366 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
4368 rli->offset = TYPE_SIZE_UNIT (t);
4369 rli->bitpos = bitsize_zero_node;
4370 rli->record_align = TYPE_ALIGN (t);
4373 /* Find the last field. The artificial fields created for virtual
4374 bases will go after the last extant field to date. */
4375 next_field = &TYPE_FIELDS (t);
4377 next_field = &TREE_CHAIN (*next_field);
4379 /* Go through the virtual bases, allocating space for each virtual
4380 base that is not already a primary base class. These are
4381 allocated in inheritance graph order. */
4382 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
4384 if (!BINFO_VIRTUAL_P (vbase))
4387 if (!BINFO_PRIMARY_P (vbase))
4389 tree basetype = TREE_TYPE (vbase);
4391 /* This virtual base is not a primary base of any class in the
4392 hierarchy, so we have to add space for it. */
4393 next_field = build_base_field (rli, vbase,
4394 offsets, next_field);
4396 /* If the first virtual base might have been placed at a
4397 lower address, had we started from CLASSTYPE_SIZE, rather
4398 than TYPE_SIZE, issue a warning. There can be both false
4399 positives and false negatives from this warning in rare
4400 cases; to deal with all the possibilities would probably
4401 require performing both layout algorithms and comparing
4402 the results which is not particularly tractable. */
4406 (size_binop (CEIL_DIV_EXPR,
4407 round_up (CLASSTYPE_SIZE (t),
4408 CLASSTYPE_ALIGN (basetype)),
4410 BINFO_OFFSET (vbase))))
4412 "offset of virtual base %qT is not ABI-compliant and "
4413 "may change in a future version of GCC",
4416 first_vbase = false;
4421 /* Returns the offset of the byte just past the end of the base class
4425 end_of_base (tree binfo)
4429 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo)))
4430 size = TYPE_SIZE_UNIT (char_type_node);
4431 else if (is_empty_class (BINFO_TYPE (binfo)))
4432 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4433 allocate some space for it. It cannot have virtual bases, so
4434 TYPE_SIZE_UNIT is fine. */
4435 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4437 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4439 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
4442 /* Returns the offset of the byte just past the end of the base class
4443 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4444 only non-virtual bases are included. */
4447 end_of_class (tree t, int include_virtuals_p)
4449 tree result = size_zero_node;
4450 VEC(tree,gc) *vbases;
4456 for (binfo = TYPE_BINFO (t), i = 0;
4457 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4459 if (!include_virtuals_p
4460 && BINFO_VIRTUAL_P (base_binfo)
4461 && (!BINFO_PRIMARY_P (base_binfo)
4462 || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t)))
4465 offset = end_of_base (base_binfo);
4466 if (INT_CST_LT_UNSIGNED (result, offset))
4470 /* G++ 3.2 did not check indirect virtual bases. */
4471 if (abi_version_at_least (2) && include_virtuals_p)
4472 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4473 VEC_iterate (tree, vbases, i, base_binfo); i++)
4475 offset = end_of_base (base_binfo);
4476 if (INT_CST_LT_UNSIGNED (result, offset))
4483 /* Warn about bases of T that are inaccessible because they are
4484 ambiguous. For example:
4487 struct T : public S {};
4488 struct U : public S, public T {};
4490 Here, `(S*) new U' is not allowed because there are two `S'
4494 warn_about_ambiguous_bases (tree t)
4497 VEC(tree,gc) *vbases;
4502 /* If there are no repeated bases, nothing can be ambiguous. */
4503 if (!CLASSTYPE_REPEATED_BASE_P (t))
4506 /* Check direct bases. */
4507 for (binfo = TYPE_BINFO (t), i = 0;
4508 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4510 basetype = BINFO_TYPE (base_binfo);
4512 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4513 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
4517 /* Check for ambiguous virtual bases. */
4519 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4520 VEC_iterate (tree, vbases, i, binfo); i++)
4522 basetype = BINFO_TYPE (binfo);
4524 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4525 warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due to ambiguity",
4530 /* Compare two INTEGER_CSTs K1 and K2. */
4533 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
4535 return tree_int_cst_compare ((tree) k1, (tree) k2);
4538 /* Increase the size indicated in RLI to account for empty classes
4539 that are "off the end" of the class. */
4542 include_empty_classes (record_layout_info rli)
4547 /* It might be the case that we grew the class to allocate a
4548 zero-sized base class. That won't be reflected in RLI, yet,
4549 because we are willing to overlay multiple bases at the same
4550 offset. However, now we need to make sure that RLI is big enough
4551 to reflect the entire class. */
4552 eoc = end_of_class (rli->t,
4553 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
4554 rli_size = rli_size_unit_so_far (rli);
4555 if (TREE_CODE (rli_size) == INTEGER_CST
4556 && INT_CST_LT_UNSIGNED (rli_size, eoc))
4558 if (!abi_version_at_least (2))
4559 /* In version 1 of the ABI, the size of a class that ends with
4560 a bitfield was not rounded up to a whole multiple of a
4561 byte. Because rli_size_unit_so_far returns only the number
4562 of fully allocated bytes, any extra bits were not included
4564 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
4566 /* The size should have been rounded to a whole byte. */
4567 gcc_assert (tree_int_cst_equal
4568 (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT)));
4570 = size_binop (PLUS_EXPR,
4572 size_binop (MULT_EXPR,
4573 convert (bitsizetype,
4574 size_binop (MINUS_EXPR,
4576 bitsize_int (BITS_PER_UNIT)));
4577 normalize_rli (rli);
4581 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4582 BINFO_OFFSETs for all of the base-classes. Position the vtable
4583 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4586 layout_class_type (tree t, tree *virtuals_p)
4588 tree non_static_data_members;
4591 record_layout_info rli;
4592 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4593 types that appear at that offset. */
4594 splay_tree empty_base_offsets;
4595 /* True if the last field layed out was a bit-field. */
4596 bool last_field_was_bitfield = false;
4597 /* The location at which the next field should be inserted. */
4599 /* T, as a base class. */
4602 /* Keep track of the first non-static data member. */
4603 non_static_data_members = TYPE_FIELDS (t);
4605 /* Start laying out the record. */
4606 rli = start_record_layout (t);
4608 /* Mark all the primary bases in the hierarchy. */
4609 determine_primary_bases (t);
4611 /* Create a pointer to our virtual function table. */
4612 vptr = create_vtable_ptr (t, virtuals_p);
4614 /* The vptr is always the first thing in the class. */
4617 TREE_CHAIN (vptr) = TYPE_FIELDS (t);
4618 TYPE_FIELDS (t) = vptr;
4619 next_field = &TREE_CHAIN (vptr);
4620 place_field (rli, vptr);
4623 next_field = &TYPE_FIELDS (t);
4625 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4626 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
4628 build_base_fields (rli, empty_base_offsets, next_field);
4630 /* Layout the non-static data members. */
4631 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4636 /* We still pass things that aren't non-static data members to
4637 the back end, in case it wants to do something with them. */
4638 if (TREE_CODE (field) != FIELD_DECL)
4640 place_field (rli, field);
4641 /* If the static data member has incomplete type, keep track
4642 of it so that it can be completed later. (The handling
4643 of pending statics in finish_record_layout is
4644 insufficient; consider:
4647 struct S2 { static S1 s1; };
4649 At this point, finish_record_layout will be called, but
4650 S1 is still incomplete.) */
4651 if (TREE_CODE (field) == VAR_DECL)
4653 maybe_register_incomplete_var (field);
4654 /* The visibility of static data members is determined
4655 at their point of declaration, not their point of
4657 determine_visibility (field);
4662 type = TREE_TYPE (field);
4663 if (type == error_mark_node)
4666 padding = NULL_TREE;
4668 /* If this field is a bit-field whose width is greater than its
4669 type, then there are some special rules for allocating
4671 if (DECL_C_BIT_FIELD (field)
4672 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4674 integer_type_kind itk;
4676 bool was_unnamed_p = false;
4677 /* We must allocate the bits as if suitably aligned for the
4678 longest integer type that fits in this many bits. type
4679 of the field. Then, we are supposed to use the left over
4680 bits as additional padding. */
4681 for (itk = itk_char; itk != itk_none; ++itk)
4682 if (INT_CST_LT (DECL_SIZE (field),
4683 TYPE_SIZE (integer_types[itk])))
4686 /* ITK now indicates a type that is too large for the
4687 field. We have to back up by one to find the largest
4689 integer_type = integer_types[itk - 1];
4691 /* Figure out how much additional padding is required. GCC
4692 3.2 always created a padding field, even if it had zero
4694 if (!abi_version_at_least (2)
4695 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
4697 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
4698 /* In a union, the padding field must have the full width
4699 of the bit-field; all fields start at offset zero. */
4700 padding = DECL_SIZE (field);
4703 if (TREE_CODE (t) == UNION_TYPE)
4704 warning (OPT_Wabi, "size assigned to %qT may not be "
4705 "ABI-compliant and may change in a future "
4708 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4709 TYPE_SIZE (integer_type));
4712 #ifdef PCC_BITFIELD_TYPE_MATTERS
4713 /* An unnamed bitfield does not normally affect the
4714 alignment of the containing class on a target where
4715 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4716 make any exceptions for unnamed bitfields when the
4717 bitfields are longer than their types. Therefore, we
4718 temporarily give the field a name. */
4719 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
4721 was_unnamed_p = true;
4722 DECL_NAME (field) = make_anon_name ();
4725 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4726 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4727 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4728 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4729 empty_base_offsets);
4731 DECL_NAME (field) = NULL_TREE;
4732 /* Now that layout has been performed, set the size of the
4733 field to the size of its declared type; the rest of the
4734 field is effectively invisible. */
4735 DECL_SIZE (field) = TYPE_SIZE (type);
4736 /* We must also reset the DECL_MODE of the field. */
4737 if (abi_version_at_least (2))
4738 DECL_MODE (field) = TYPE_MODE (type);
4740 && DECL_MODE (field) != TYPE_MODE (type))
4741 /* Versions of G++ before G++ 3.4 did not reset the
4744 "the offset of %qD may not be ABI-compliant and may "
4745 "change in a future version of GCC", field);
4748 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4749 empty_base_offsets);
4751 /* Remember the location of any empty classes in FIELD. */
4752 if (abi_version_at_least (2))
4753 record_subobject_offsets (TREE_TYPE (field),
4754 byte_position(field),
4756 /*is_data_member=*/true);
4758 /* If a bit-field does not immediately follow another bit-field,
4759 and yet it starts in the middle of a byte, we have failed to
4760 comply with the ABI. */
4762 && DECL_C_BIT_FIELD (field)
4763 /* The TREE_NO_WARNING flag gets set by Objective-C when
4764 laying out an Objective-C class. The ObjC ABI differs
4765 from the C++ ABI, and so we do not want a warning
4767 && !TREE_NO_WARNING (field)
4768 && !last_field_was_bitfield
4769 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
4770 DECL_FIELD_BIT_OFFSET (field),
4771 bitsize_unit_node)))
4772 warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may "
4773 "change in a future version of GCC", field);
4775 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4776 offset of the field. */
4778 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
4779 byte_position (field))
4780 && contains_empty_class_p (TREE_TYPE (field)))
4781 warning (OPT_Wabi, "%q+D contains empty classes which may cause base "
4782 "classes to be placed at different locations in a "
4783 "future version of GCC", field);
4785 /* The middle end uses the type of expressions to determine the
4786 possible range of expression values. In order to optimize
4787 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
4788 must be made aware of the width of "i", via its type.
4790 Because C++ does not have integer types of arbitrary width,
4791 we must (for the purposes of the front end) convert from the
4792 type assigned here to the declared type of the bitfield
4793 whenever a bitfield expression is used as an rvalue.
4794 Similarly, when assigning a value to a bitfield, the value
4795 must be converted to the type given the bitfield here. */
4796 if (DECL_C_BIT_FIELD (field))
4799 unsigned HOST_WIDE_INT width;
4800 ftype = TREE_TYPE (field);
4801 width = tree_low_cst (DECL_SIZE (field), /*unsignedp=*/1);
4802 if (width != TYPE_PRECISION (ftype))
4804 = c_build_bitfield_integer_type (width,
4805 TYPE_UNSIGNED (ftype));
4808 /* If we needed additional padding after this field, add it
4814 padding_field = build_decl (FIELD_DECL,
4817 DECL_BIT_FIELD (padding_field) = 1;
4818 DECL_SIZE (padding_field) = padding;
4819 DECL_CONTEXT (padding_field) = t;
4820 DECL_ARTIFICIAL (padding_field) = 1;
4821 DECL_IGNORED_P (padding_field) = 1;
4822 layout_nonempty_base_or_field (rli, padding_field,
4824 empty_base_offsets);
4827 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
4830 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
4832 /* Make sure that we are on a byte boundary so that the size of
4833 the class without virtual bases will always be a round number
4835 rli->bitpos = round_up (rli->bitpos, BITS_PER_UNIT);
4836 normalize_rli (rli);
4839 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4841 if (!abi_version_at_least (2))
4842 include_empty_classes(rli);
4844 /* Delete all zero-width bit-fields from the list of fields. Now
4845 that the type is laid out they are no longer important. */
4846 remove_zero_width_bit_fields (t);
4848 /* Create the version of T used for virtual bases. We do not use
4849 make_aggr_type for this version; this is an artificial type. For
4850 a POD type, we just reuse T. */
4851 if (CLASSTYPE_NON_POD_P (t) || CLASSTYPE_EMPTY_P (t))
4853 base_t = make_node (TREE_CODE (t));
4855 /* Set the size and alignment for the new type. In G++ 3.2, all
4856 empty classes were considered to have size zero when used as
4858 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
4860 TYPE_SIZE (base_t) = bitsize_zero_node;
4861 TYPE_SIZE_UNIT (base_t) = size_zero_node;
4862 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
4864 "layout of classes derived from empty class %qT "
4865 "may change in a future version of GCC",
4872 /* If the ABI version is not at least two, and the last
4873 field was a bit-field, RLI may not be on a byte
4874 boundary. In particular, rli_size_unit_so_far might
4875 indicate the last complete byte, while rli_size_so_far
4876 indicates the total number of bits used. Therefore,
4877 rli_size_so_far, rather than rli_size_unit_so_far, is
4878 used to compute TYPE_SIZE_UNIT. */
4879 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4880 TYPE_SIZE_UNIT (base_t)
4881 = size_binop (MAX_EXPR,
4883 size_binop (CEIL_DIV_EXPR,
4884 rli_size_so_far (rli),
4885 bitsize_int (BITS_PER_UNIT))),
4888 = size_binop (MAX_EXPR,
4889 rli_size_so_far (rli),
4890 size_binop (MULT_EXPR,
4891 convert (bitsizetype, eoc),
4892 bitsize_int (BITS_PER_UNIT)));
4894 TYPE_ALIGN (base_t) = rli->record_align;
4895 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
4897 /* Copy the fields from T. */
4898 next_field = &TYPE_FIELDS (base_t);
4899 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4900 if (TREE_CODE (field) == FIELD_DECL)
4902 *next_field = build_decl (FIELD_DECL,
4905 DECL_CONTEXT (*next_field) = base_t;
4906 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
4907 DECL_FIELD_BIT_OFFSET (*next_field)
4908 = DECL_FIELD_BIT_OFFSET (field);
4909 DECL_SIZE (*next_field) = DECL_SIZE (field);
4910 DECL_MODE (*next_field) = DECL_MODE (field);
4911 next_field = &TREE_CHAIN (*next_field);
4914 /* Record the base version of the type. */
4915 CLASSTYPE_AS_BASE (t) = base_t;
4916 TYPE_CONTEXT (base_t) = t;
4919 CLASSTYPE_AS_BASE (t) = t;
4921 /* Every empty class contains an empty class. */
4922 if (CLASSTYPE_EMPTY_P (t))
4923 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
4925 /* Set the TYPE_DECL for this type to contain the right
4926 value for DECL_OFFSET, so that we can use it as part
4927 of a COMPONENT_REF for multiple inheritance. */
4928 layout_decl (TYPE_MAIN_DECL (t), 0);
4930 /* Now fix up any virtual base class types that we left lying
4931 around. We must get these done before we try to lay out the
4932 virtual function table. As a side-effect, this will remove the
4933 base subobject fields. */
4934 layout_virtual_bases (rli, empty_base_offsets);
4936 /* Make sure that empty classes are reflected in RLI at this
4938 include_empty_classes(rli);
4940 /* Make sure not to create any structures with zero size. */
4941 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
4943 build_decl (FIELD_DECL, NULL_TREE, char_type_node));
4945 /* Let the back end lay out the type. */
4946 finish_record_layout (rli, /*free_p=*/true);
4948 /* Warn about bases that can't be talked about due to ambiguity. */
4949 warn_about_ambiguous_bases (t);
4951 /* Now that we're done with layout, give the base fields the real types. */
4952 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4953 if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field)))
4954 TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field));
4957 splay_tree_delete (empty_base_offsets);
4959 if (CLASSTYPE_EMPTY_P (t)
4960 && tree_int_cst_lt (sizeof_biggest_empty_class,
4961 TYPE_SIZE_UNIT (t)))
4962 sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t);
4965 /* Determine the "key method" for the class type indicated by TYPE,
4966 and set CLASSTYPE_KEY_METHOD accordingly. */
4969 determine_key_method (tree type)
4973 if (TYPE_FOR_JAVA (type)
4974 || processing_template_decl
4975 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
4976 || CLASSTYPE_INTERFACE_KNOWN (type))
4979 /* The key method is the first non-pure virtual function that is not
4980 inline at the point of class definition. On some targets the
4981 key function may not be inline; those targets should not call
4982 this function until the end of the translation unit. */
4983 for (method = TYPE_METHODS (type); method != NULL_TREE;
4984 method = TREE_CHAIN (method))
4985 if (DECL_VINDEX (method) != NULL_TREE
4986 && ! DECL_DECLARED_INLINE_P (method)
4987 && ! DECL_PURE_VIRTUAL_P (method))
4989 CLASSTYPE_KEY_METHOD (type) = method;
4996 /* Perform processing required when the definition of T (a class type)
5000 finish_struct_1 (tree t)
5003 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5004 tree virtuals = NULL_TREE;
5007 if (COMPLETE_TYPE_P (t))
5009 gcc_assert (IS_AGGR_TYPE (t));
5010 error ("redefinition of %q#T", t);
5015 /* If this type was previously laid out as a forward reference,
5016 make sure we lay it out again. */
5017 TYPE_SIZE (t) = NULL_TREE;
5018 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
5020 fixup_inline_methods (t);
5022 /* Make assumptions about the class; we'll reset the flags if
5024 CLASSTYPE_EMPTY_P (t) = 1;
5025 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
5026 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
5028 /* Do end-of-class semantic processing: checking the validity of the
5029 bases and members and add implicitly generated methods. */
5030 check_bases_and_members (t);
5032 /* Find the key method. */
5033 if (TYPE_CONTAINS_VPTR_P (t))
5035 /* The Itanium C++ ABI permits the key method to be chosen when
5036 the class is defined -- even though the key method so
5037 selected may later turn out to be an inline function. On
5038 some systems (such as ARM Symbian OS) the key method cannot
5039 be determined until the end of the translation unit. On such
5040 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5041 will cause the class to be added to KEYED_CLASSES. Then, in
5042 finish_file we will determine the key method. */
5043 if (targetm.cxx.key_method_may_be_inline ())
5044 determine_key_method (t);
5046 /* If a polymorphic class has no key method, we may emit the vtable
5047 in every translation unit where the class definition appears. */
5048 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
5049 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
5052 /* Layout the class itself. */
5053 layout_class_type (t, &virtuals);
5054 if (CLASSTYPE_AS_BASE (t) != t)
5055 /* We use the base type for trivial assignments, and hence it
5057 compute_record_mode (CLASSTYPE_AS_BASE (t));
5059 virtuals = modify_all_vtables (t, nreverse (virtuals));
5061 /* If necessary, create the primary vtable for this class. */
5062 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
5064 /* We must enter these virtuals into the table. */
5065 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5066 build_primary_vtable (NULL_TREE, t);
5067 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
5068 /* Here we know enough to change the type of our virtual
5069 function table, but we will wait until later this function. */
5070 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
5073 if (TYPE_CONTAINS_VPTR_P (t))
5078 if (BINFO_VTABLE (TYPE_BINFO (t)))
5079 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t))));
5080 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5081 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE);
5083 /* Add entries for virtual functions introduced by this class. */
5084 BINFO_VIRTUALS (TYPE_BINFO (t))
5085 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals);
5087 /* Set DECL_VINDEX for all functions declared in this class. */
5088 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
5090 fn = TREE_CHAIN (fn),
5091 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5092 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
5094 tree fndecl = BV_FN (fn);
5096 if (DECL_THUNK_P (fndecl))
5097 /* A thunk. We should never be calling this entry directly
5098 from this vtable -- we'd use the entry for the non
5099 thunk base function. */
5100 DECL_VINDEX (fndecl) = NULL_TREE;
5101 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
5102 DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex);
5106 finish_struct_bits (t);
5108 /* Complete the rtl for any static member objects of the type we're
5110 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
5111 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
5112 && TREE_TYPE (x) != error_mark_node
5113 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
5114 DECL_MODE (x) = TYPE_MODE (t);
5116 /* Done with FIELDS...now decide whether to sort these for
5117 faster lookups later.
5119 We use a small number because most searches fail (succeeding
5120 ultimately as the search bores through the inheritance
5121 hierarchy), and we want this failure to occur quickly. */
5123 n_fields = count_fields (TYPE_FIELDS (t));
5126 struct sorted_fields_type *field_vec = GGC_NEWVAR
5127 (struct sorted_fields_type,
5128 sizeof (struct sorted_fields_type) + n_fields * sizeof (tree));
5129 field_vec->len = n_fields;
5130 add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0);
5131 qsort (field_vec->elts, n_fields, sizeof (tree),
5133 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
5134 retrofit_lang_decl (TYPE_MAIN_DECL (t));
5135 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5138 /* Complain if one of the field types requires lower visibility. */
5139 constrain_class_visibility (t);
5141 /* Make the rtl for any new vtables we have created, and unmark
5142 the base types we marked. */
5145 /* Build the VTT for T. */
5148 /* This warning does not make sense for Java classes, since they
5149 cannot have destructors. */
5150 if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t))
5154 dtor = CLASSTYPE_DESTRUCTORS (t);
5155 if (/* An implicitly declared destructor is always public. And,
5156 if it were virtual, we would have created it by now. */
5158 || (!DECL_VINDEX (dtor)
5159 && (/* public non-virtual */
5160 (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor))
5161 || (/* non-public non-virtual with friends */
5162 (TREE_PRIVATE (dtor) || TREE_PROTECTED (dtor))
5163 && (CLASSTYPE_FRIEND_CLASSES (t)
5164 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))))))
5165 warning (OPT_Wnon_virtual_dtor,
5166 "%q#T has virtual functions and accessible"
5167 " non-virtual destructor", t);
5172 if (warn_overloaded_virtual)
5175 /* Class layout, assignment of virtual table slots, etc., is now
5176 complete. Give the back end a chance to tweak the visibility of
5177 the class or perform any other required target modifications. */
5178 targetm.cxx.adjust_class_at_definition (t);
5180 maybe_suppress_debug_info (t);
5182 dump_class_hierarchy (t);
5184 /* Finish debugging output for this type. */
5185 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5188 /* When T was built up, the member declarations were added in reverse
5189 order. Rearrange them to declaration order. */
5192 unreverse_member_declarations (tree t)
5198 /* The following lists are all in reverse order. Put them in
5199 declaration order now. */
5200 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5201 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
5203 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5204 reverse order, so we can't just use nreverse. */
5206 for (x = TYPE_FIELDS (t);
5207 x && TREE_CODE (x) != TYPE_DECL;
5210 next = TREE_CHAIN (x);
5211 TREE_CHAIN (x) = prev;
5216 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5218 TYPE_FIELDS (t) = prev;
5223 finish_struct (tree t, tree attributes)
5225 location_t saved_loc = input_location;
5227 /* Now that we've got all the field declarations, reverse everything
5229 unreverse_member_declarations (t);
5231 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
5233 /* Nadger the current location so that diagnostics point to the start of
5234 the struct, not the end. */
5235 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
5237 if (processing_template_decl)
5241 finish_struct_methods (t);
5242 TYPE_SIZE (t) = bitsize_zero_node;
5243 TYPE_SIZE_UNIT (t) = size_zero_node;
5245 /* We need to emit an error message if this type was used as a parameter
5246 and it is an abstract type, even if it is a template. We construct
5247 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5248 account and we call complete_vars with this type, which will check
5249 the PARM_DECLS. Note that while the type is being defined,
5250 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5251 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5252 CLASSTYPE_PURE_VIRTUALS (t) = NULL;
5253 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
5254 if (DECL_PURE_VIRTUAL_P (x))
5255 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x);
5259 finish_struct_1 (t);
5261 input_location = saved_loc;
5263 TYPE_BEING_DEFINED (t) = 0;
5265 if (current_class_type)
5268 error ("trying to finish struct, but kicked out due to previous parse errors");
5270 if (processing_template_decl && at_function_scope_p ())
5271 add_stmt (build_min (TAG_DEFN, t));
5276 /* Return the dynamic type of INSTANCE, if known.
5277 Used to determine whether the virtual function table is needed
5280 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5281 of our knowledge of its type. *NONNULL should be initialized
5282 before this function is called. */
5285 fixed_type_or_null (tree instance, int *nonnull, int *cdtorp)
5287 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5289 switch (TREE_CODE (instance))
5292 if (POINTER_TYPE_P (TREE_TYPE (instance)))
5295 return RECUR (TREE_OPERAND (instance, 0));
5298 /* This is a call to a constructor, hence it's never zero. */
5299 if (TREE_HAS_CONSTRUCTOR (instance))
5303 return TREE_TYPE (instance);
5308 /* This is a call to a constructor, hence it's never zero. */
5309 if (TREE_HAS_CONSTRUCTOR (instance))
5313 return TREE_TYPE (instance);
5315 return RECUR (TREE_OPERAND (instance, 0));
5317 case POINTER_PLUS_EXPR:
5320 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5321 return RECUR (TREE_OPERAND (instance, 0));
5322 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5323 /* Propagate nonnull. */
5324 return RECUR (TREE_OPERAND (instance, 0));
5330 return RECUR (TREE_OPERAND (instance, 0));
5333 instance = TREE_OPERAND (instance, 0);
5336 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5337 with a real object -- given &p->f, p can still be null. */
5338 tree t = get_base_address (instance);
5339 /* ??? Probably should check DECL_WEAK here. */
5340 if (t && DECL_P (t))
5343 return RECUR (instance);
5346 /* If this component is really a base class reference, then the field
5347 itself isn't definitive. */
5348 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1)))
5349 return RECUR (TREE_OPERAND (instance, 0));
5350 return RECUR (TREE_OPERAND (instance, 1));
5354 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5355 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5359 return TREE_TYPE (TREE_TYPE (instance));
5361 /* fall through... */
5365 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5369 return TREE_TYPE (instance);
5371 else if (instance == current_class_ptr)
5376 /* if we're in a ctor or dtor, we know our type. */
5377 if (DECL_LANG_SPECIFIC (current_function_decl)
5378 && (DECL_CONSTRUCTOR_P (current_function_decl)
5379 || DECL_DESTRUCTOR_P (current_function_decl)))
5383 return TREE_TYPE (TREE_TYPE (instance));
5386 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5388 /* We only need one hash table because it is always left empty. */
5391 ht = htab_create (37,
5396 /* Reference variables should be references to objects. */
5400 /* Enter the INSTANCE in a table to prevent recursion; a
5401 variable's initializer may refer to the variable
5403 if (TREE_CODE (instance) == VAR_DECL
5404 && DECL_INITIAL (instance)
5405 && !htab_find (ht, instance))
5410 slot = htab_find_slot (ht, instance, INSERT);
5412 type = RECUR (DECL_INITIAL (instance));
5413 htab_remove_elt (ht, instance);
5426 /* Return nonzero if the dynamic type of INSTANCE is known, and
5427 equivalent to the static type. We also handle the case where
5428 INSTANCE is really a pointer. Return negative if this is a
5429 ctor/dtor. There the dynamic type is known, but this might not be
5430 the most derived base of the original object, and hence virtual
5431 bases may not be layed out according to this type.
5433 Used to determine whether the virtual function table is needed
5436 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5437 of our knowledge of its type. *NONNULL should be initialized
5438 before this function is called. */
5441 resolves_to_fixed_type_p (tree instance, int* nonnull)
5443 tree t = TREE_TYPE (instance);
5445 tree fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
5446 if (fixed == NULL_TREE)
5448 if (POINTER_TYPE_P (t))
5450 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
5452 return cdtorp ? -1 : 1;
5457 init_class_processing (void)
5459 current_class_depth = 0;
5460 current_class_stack_size = 10;
5462 = XNEWVEC (struct class_stack_node, current_class_stack_size);
5463 local_classes = VEC_alloc (tree, gc, 8);
5464 sizeof_biggest_empty_class = size_zero_node;
5466 ridpointers[(int) RID_PUBLIC] = access_public_node;
5467 ridpointers[(int) RID_PRIVATE] = access_private_node;
5468 ridpointers[(int) RID_PROTECTED] = access_protected_node;
5471 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5474 restore_class_cache (void)
5478 /* We are re-entering the same class we just left, so we don't
5479 have to search the whole inheritance matrix to find all the
5480 decls to bind again. Instead, we install the cached
5481 class_shadowed list and walk through it binding names. */
5482 push_binding_level (previous_class_level);
5483 class_binding_level = previous_class_level;
5484 /* Restore IDENTIFIER_TYPE_VALUE. */
5485 for (type = class_binding_level->type_shadowed;
5487 type = TREE_CHAIN (type))
5488 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type));
5491 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5492 appropriate for TYPE.
5494 So that we may avoid calls to lookup_name, we cache the _TYPE
5495 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5497 For multiple inheritance, we perform a two-pass depth-first search
5498 of the type lattice. */
5501 pushclass (tree type)
5503 class_stack_node_t csn;
5505 type = TYPE_MAIN_VARIANT (type);
5507 /* Make sure there is enough room for the new entry on the stack. */
5508 if (current_class_depth + 1 >= current_class_stack_size)
5510 current_class_stack_size *= 2;
5512 = XRESIZEVEC (struct class_stack_node, current_class_stack,
5513 current_class_stack_size);
5516 /* Insert a new entry on the class stack. */
5517 csn = current_class_stack + current_class_depth;
5518 csn->name = current_class_name;
5519 csn->type = current_class_type;
5520 csn->access = current_access_specifier;
5521 csn->names_used = 0;
5523 current_class_depth++;
5525 /* Now set up the new type. */
5526 current_class_name = TYPE_NAME (type);
5527 if (TREE_CODE (current_class_name) == TYPE_DECL)
5528 current_class_name = DECL_NAME (current_class_name);
5529 current_class_type = type;
5531 /* By default, things in classes are private, while things in
5532 structures or unions are public. */
5533 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5534 ? access_private_node
5535 : access_public_node);
5537 if (previous_class_level
5538 && type != previous_class_level->this_entity
5539 && current_class_depth == 1)
5541 /* Forcibly remove any old class remnants. */
5542 invalidate_class_lookup_cache ();
5545 if (!previous_class_level
5546 || type != previous_class_level->this_entity
5547 || current_class_depth > 1)
5550 restore_class_cache ();
5553 /* When we exit a toplevel class scope, we save its binding level so
5554 that we can restore it quickly. Here, we've entered some other
5555 class, so we must invalidate our cache. */
5558 invalidate_class_lookup_cache (void)
5560 previous_class_level = NULL;
5563 /* Get out of the current class scope. If we were in a class scope
5564 previously, that is the one popped to. */
5571 current_class_depth--;
5572 current_class_name = current_class_stack[current_class_depth].name;
5573 current_class_type = current_class_stack[current_class_depth].type;
5574 current_access_specifier = current_class_stack[current_class_depth].access;
5575 if (current_class_stack[current_class_depth].names_used)
5576 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5579 /* Mark the top of the class stack as hidden. */
5582 push_class_stack (void)
5584 if (current_class_depth)
5585 ++current_class_stack[current_class_depth - 1].hidden;
5588 /* Mark the top of the class stack as un-hidden. */
5591 pop_class_stack (void)
5593 if (current_class_depth)
5594 --current_class_stack[current_class_depth - 1].hidden;
5597 /* Returns 1 if the class type currently being defined is either T or
5598 a nested type of T. */
5601 currently_open_class (tree t)
5605 /* We start looking from 1 because entry 0 is from global scope,
5607 for (i = current_class_depth; i > 0; --i)
5610 if (i == current_class_depth)
5611 c = current_class_type;
5614 if (current_class_stack[i].hidden)
5616 c = current_class_stack[i].type;
5620 if (same_type_p (c, t))
5626 /* If either current_class_type or one of its enclosing classes are derived
5627 from T, return the appropriate type. Used to determine how we found
5628 something via unqualified lookup. */
5631 currently_open_derived_class (tree t)
5635 /* The bases of a dependent type are unknown. */
5636 if (dependent_type_p (t))
5639 if (!current_class_type)
5642 if (DERIVED_FROM_P (t, current_class_type))
5643 return current_class_type;
5645 for (i = current_class_depth - 1; i > 0; --i)
5647 if (current_class_stack[i].hidden)
5649 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5650 return current_class_stack[i].type;
5656 /* When entering a class scope, all enclosing class scopes' names with
5657 static meaning (static variables, static functions, types and
5658 enumerators) have to be visible. This recursive function calls
5659 pushclass for all enclosing class contexts until global or a local
5660 scope is reached. TYPE is the enclosed class. */
5663 push_nested_class (tree type)
5665 /* A namespace might be passed in error cases, like A::B:C. */
5666 if (type == NULL_TREE
5667 || !CLASS_TYPE_P (type))
5670 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type)));
5675 /* Undoes a push_nested_class call. */
5678 pop_nested_class (void)
5680 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5683 if (context && CLASS_TYPE_P (context))
5684 pop_nested_class ();
5687 /* Returns the number of extern "LANG" blocks we are nested within. */
5690 current_lang_depth (void)
5692 return VEC_length (tree, current_lang_base);
5695 /* Set global variables CURRENT_LANG_NAME to appropriate value
5696 so that behavior of name-mangling machinery is correct. */
5699 push_lang_context (tree name)
5701 VEC_safe_push (tree, gc, current_lang_base, current_lang_name);
5703 if (name == lang_name_cplusplus)
5705 current_lang_name = name;
5707 else if (name == lang_name_java)
5709 current_lang_name = name;
5710 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5711 (See record_builtin_java_type in decl.c.) However, that causes
5712 incorrect debug entries if these types are actually used.
5713 So we re-enable debug output after extern "Java". */
5714 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5715 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5716 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5717 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5718 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5719 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5720 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5721 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5723 else if (name == lang_name_c)
5725 current_lang_name = name;
5728 error ("language string %<\"%E\"%> not recognized", name);
5731 /* Get out of the current language scope. */
5734 pop_lang_context (void)
5736 current_lang_name = VEC_pop (tree, current_lang_base);
5739 /* Type instantiation routines. */
5741 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5742 matches the TARGET_TYPE. If there is no satisfactory match, return
5743 error_mark_node, and issue an error & warning messages under
5744 control of FLAGS. Permit pointers to member function if FLAGS
5745 permits. If TEMPLATE_ONLY, the name of the overloaded function was
5746 a template-id, and EXPLICIT_TARGS are the explicitly provided
5747 template arguments. If OVERLOAD is for one or more member
5748 functions, then ACCESS_PATH is the base path used to reference
5749 those member functions. */
5752 resolve_address_of_overloaded_function (tree target_type,
5754 tsubst_flags_t flags,
5756 tree explicit_targs,
5759 /* Here's what the standard says:
5763 If the name is a function template, template argument deduction
5764 is done, and if the argument deduction succeeds, the deduced
5765 arguments are used to generate a single template function, which
5766 is added to the set of overloaded functions considered.
5768 Non-member functions and static member functions match targets of
5769 type "pointer-to-function" or "reference-to-function." Nonstatic
5770 member functions match targets of type "pointer-to-member
5771 function;" the function type of the pointer to member is used to
5772 select the member function from the set of overloaded member
5773 functions. If a nonstatic member function is selected, the
5774 reference to the overloaded function name is required to have the
5775 form of a pointer to member as described in 5.3.1.
5777 If more than one function is selected, any template functions in
5778 the set are eliminated if the set also contains a non-template
5779 function, and any given template function is eliminated if the
5780 set contains a second template function that is more specialized
5781 than the first according to the partial ordering rules 14.5.5.2.
5782 After such eliminations, if any, there shall remain exactly one
5783 selected function. */
5786 int is_reference = 0;
5787 /* We store the matches in a TREE_LIST rooted here. The functions
5788 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5789 interoperability with most_specialized_instantiation. */
5790 tree matches = NULL_TREE;
5793 /* By the time we get here, we should be seeing only real
5794 pointer-to-member types, not the internal POINTER_TYPE to
5795 METHOD_TYPE representation. */
5796 gcc_assert (TREE_CODE (target_type) != POINTER_TYPE
5797 || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE);
5799 gcc_assert (is_overloaded_fn (overload));
5801 /* Check that the TARGET_TYPE is reasonable. */
5802 if (TYPE_PTRFN_P (target_type))
5804 else if (TYPE_PTRMEMFUNC_P (target_type))
5805 /* This is OK, too. */
5807 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5809 /* This is OK, too. This comes from a conversion to reference
5811 target_type = build_reference_type (target_type);
5816 if (flags & tf_error)
5817 error ("cannot resolve overloaded function %qD based on"
5818 " conversion to type %qT",
5819 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5820 return error_mark_node;
5823 /* If we can find a non-template function that matches, we can just
5824 use it. There's no point in generating template instantiations
5825 if we're just going to throw them out anyhow. But, of course, we
5826 can only do this when we don't *need* a template function. */
5831 for (fns = overload; fns; fns = OVL_NEXT (fns))
5833 tree fn = OVL_CURRENT (fns);
5836 if (TREE_CODE (fn) == TEMPLATE_DECL)
5837 /* We're not looking for templates just yet. */
5840 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5842 /* We're looking for a non-static member, and this isn't
5843 one, or vice versa. */
5846 /* Ignore functions which haven't been explicitly
5848 if (DECL_ANTICIPATED (fn))
5851 /* See if there's a match. */
5852 fntype = TREE_TYPE (fn);
5854 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5855 else if (!is_reference)
5856 fntype = build_pointer_type (fntype);
5858 if (can_convert_arg (target_type, fntype, fn, LOOKUP_NORMAL))
5859 matches = tree_cons (fn, NULL_TREE, matches);
5863 /* Now, if we've already got a match (or matches), there's no need
5864 to proceed to the template functions. But, if we don't have a
5865 match we need to look at them, too. */
5868 tree target_fn_type;
5869 tree target_arg_types;
5870 tree target_ret_type;
5875 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5877 target_fn_type = TREE_TYPE (target_type);
5878 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5879 target_ret_type = TREE_TYPE (target_fn_type);
5881 /* Never do unification on the 'this' parameter. */
5882 if (TREE_CODE (target_fn_type) == METHOD_TYPE)
5883 target_arg_types = TREE_CHAIN (target_arg_types);
5885 for (fns = overload; fns; fns = OVL_NEXT (fns))
5887 tree fn = OVL_CURRENT (fns);
5889 tree instantiation_type;
5892 if (TREE_CODE (fn) != TEMPLATE_DECL)
5893 /* We're only looking for templates. */
5896 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5898 /* We're not looking for a non-static member, and this is
5899 one, or vice versa. */
5902 /* Try to do argument deduction. */
5903 targs = make_tree_vec (DECL_NTPARMS (fn));
5904 if (fn_type_unification (fn, explicit_targs, targs,
5905 target_arg_types, target_ret_type,
5906 DEDUCE_EXACT, LOOKUP_NORMAL))
5907 /* Argument deduction failed. */
5910 /* Instantiate the template. */
5911 instantiation = instantiate_template (fn, targs, flags);
5912 if (instantiation == error_mark_node)
5913 /* Instantiation failed. */
5916 /* See if there's a match. */
5917 instantiation_type = TREE_TYPE (instantiation);
5919 instantiation_type =
5920 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5921 else if (!is_reference)
5922 instantiation_type = build_pointer_type (instantiation_type);
5923 if (can_convert_arg (target_type, instantiation_type, instantiation,
5925 matches = tree_cons (instantiation, fn, matches);
5928 /* Now, remove all but the most specialized of the matches. */
5931 tree match = most_specialized_instantiation (matches);
5933 if (match != error_mark_node)
5934 matches = tree_cons (TREE_PURPOSE (match),
5940 /* Now we should have exactly one function in MATCHES. */
5941 if (matches == NULL_TREE)
5943 /* There were *no* matches. */
5944 if (flags & tf_error)
5946 error ("no matches converting function %qD to type %q#T",
5947 DECL_NAME (OVL_FUNCTION (overload)),
5950 /* print_candidates expects a chain with the functions in
5951 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5952 so why be clever?). */
5953 for (; overload; overload = OVL_NEXT (overload))
5954 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5957 print_candidates (matches);
5959 return error_mark_node;
5961 else if (TREE_CHAIN (matches))
5963 /* There were too many matches. */
5965 if (flags & tf_error)
5969 error ("converting overloaded function %qD to type %q#T is ambiguous",
5970 DECL_NAME (OVL_FUNCTION (overload)),
5973 /* Since print_candidates expects the functions in the
5974 TREE_VALUE slot, we flip them here. */
5975 for (match = matches; match; match = TREE_CHAIN (match))
5976 TREE_VALUE (match) = TREE_PURPOSE (match);
5978 print_candidates (matches);
5981 return error_mark_node;
5984 /* Good, exactly one match. Now, convert it to the correct type. */
5985 fn = TREE_PURPOSE (matches);
5987 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5988 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
5990 static int explained;
5992 if (!(flags & tf_error))
5993 return error_mark_node;
5995 pedwarn ("assuming pointer to member %qD", fn);
5998 pedwarn ("(a pointer to member can only be formed with %<&%E%>)", fn);
6003 /* If we're doing overload resolution purely for the purpose of
6004 determining conversion sequences, we should not consider the
6005 function used. If this conversion sequence is selected, the
6006 function will be marked as used at this point. */
6007 if (!(flags & tf_conv))
6010 /* We could not check access when this expression was originally
6011 created since we did not know at that time to which function
6012 the expression referred. */
6013 if (DECL_FUNCTION_MEMBER_P (fn))
6015 gcc_assert (access_path);
6016 perform_or_defer_access_check (access_path, fn, fn);
6020 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
6021 return build_unary_op (ADDR_EXPR, fn, 0);
6024 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
6025 will mark the function as addressed, but here we must do it
6027 cxx_mark_addressable (fn);
6033 /* This function will instantiate the type of the expression given in
6034 RHS to match the type of LHSTYPE. If errors exist, then return
6035 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6036 we complain on errors. If we are not complaining, never modify rhs,
6037 as overload resolution wants to try many possible instantiations, in
6038 the hope that at least one will work.
6040 For non-recursive calls, LHSTYPE should be a function, pointer to
6041 function, or a pointer to member function. */
6044 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
6046 tsubst_flags_t flags_in = flags;
6047 tree access_path = NULL_TREE;
6049 flags &= ~tf_ptrmem_ok;
6051 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
6053 if (flags & tf_error)
6054 error ("not enough type information");
6055 return error_mark_node;
6058 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
6060 if (same_type_p (lhstype, TREE_TYPE (rhs)))
6062 if (flag_ms_extensions
6063 && TYPE_PTRMEMFUNC_P (lhstype)
6064 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
6065 /* Microsoft allows `A::f' to be resolved to a
6066 pointer-to-member. */
6070 if (flags & tf_error)
6071 error ("argument of type %qT does not match %qT",
6072 TREE_TYPE (rhs), lhstype);
6073 return error_mark_node;
6077 if (TREE_CODE (rhs) == BASELINK)
6079 access_path = BASELINK_ACCESS_BINFO (rhs);
6080 rhs = BASELINK_FUNCTIONS (rhs);
6083 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6084 deduce any type information. */
6085 if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR)
6087 if (flags & tf_error)
6088 error ("not enough type information");
6089 return error_mark_node;
6092 /* There only a few kinds of expressions that may have a type
6093 dependent on overload resolution. */
6094 gcc_assert (TREE_CODE (rhs) == ADDR_EXPR
6095 || TREE_CODE (rhs) == COMPONENT_REF
6096 || TREE_CODE (rhs) == COMPOUND_EXPR
6097 || really_overloaded_fn (rhs));
6099 /* We don't overwrite rhs if it is an overloaded function.
6100 Copying it would destroy the tree link. */
6101 if (TREE_CODE (rhs) != OVERLOAD)
6102 rhs = copy_node (rhs);
6104 /* This should really only be used when attempting to distinguish
6105 what sort of a pointer to function we have. For now, any
6106 arithmetic operation which is not supported on pointers
6107 is rejected as an error. */
6109 switch (TREE_CODE (rhs))
6113 tree member = TREE_OPERAND (rhs, 1);
6115 member = instantiate_type (lhstype, member, flags);
6116 if (member != error_mark_node
6117 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
6118 /* Do not lose object's side effects. */
6119 return build2 (COMPOUND_EXPR, TREE_TYPE (member),
6120 TREE_OPERAND (rhs, 0), member);
6125 rhs = TREE_OPERAND (rhs, 1);
6126 if (BASELINK_P (rhs))
6127 return instantiate_type (lhstype, rhs, flags_in);
6129 /* This can happen if we are forming a pointer-to-member for a
6131 gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR);
6135 case TEMPLATE_ID_EXPR:
6137 tree fns = TREE_OPERAND (rhs, 0);
6138 tree args = TREE_OPERAND (rhs, 1);
6141 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
6142 /*template_only=*/true,
6149 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
6150 /*template_only=*/false,
6151 /*explicit_targs=*/NULL_TREE,
6155 TREE_OPERAND (rhs, 0)
6156 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6157 if (TREE_OPERAND (rhs, 0) == error_mark_node)
6158 return error_mark_node;
6159 TREE_OPERAND (rhs, 1)
6160 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6161 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6162 return error_mark_node;
6164 TREE_TYPE (rhs) = lhstype;
6169 if (PTRMEM_OK_P (rhs))
6170 flags |= tf_ptrmem_ok;
6172 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6176 return error_mark_node;
6181 return error_mark_node;
6184 /* Return the name of the virtual function pointer field
6185 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6186 this may have to look back through base types to find the
6187 ultimate field name. (For single inheritance, these could
6188 all be the same name. Who knows for multiple inheritance). */
6191 get_vfield_name (tree type)
6193 tree binfo, base_binfo;
6196 for (binfo = TYPE_BINFO (type);
6197 BINFO_N_BASE_BINFOS (binfo);
6200 base_binfo = BINFO_BASE_BINFO (binfo, 0);
6202 if (BINFO_VIRTUAL_P (base_binfo)
6203 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo)))
6207 type = BINFO_TYPE (binfo);
6208 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
6209 + TYPE_NAME_LENGTH (type) + 2);
6210 sprintf (buf, VFIELD_NAME_FORMAT,
6211 IDENTIFIER_POINTER (constructor_name (type)));
6212 return get_identifier (buf);
6216 print_class_statistics (void)
6218 #ifdef GATHER_STATISTICS
6219 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6220 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6223 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6224 n_vtables, n_vtable_searches);
6225 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6226 n_vtable_entries, n_vtable_elems);
6231 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6232 according to [class]:
6233 The class-name is also inserted
6234 into the scope of the class itself. For purposes of access checking,
6235 the inserted class name is treated as if it were a public member name. */
6238 build_self_reference (void)
6240 tree name = constructor_name (current_class_type);
6241 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6244 DECL_NONLOCAL (value) = 1;
6245 DECL_CONTEXT (value) = current_class_type;
6246 DECL_ARTIFICIAL (value) = 1;
6247 SET_DECL_SELF_REFERENCE_P (value);
6249 if (processing_template_decl)
6250 value = push_template_decl (value);
6252 saved_cas = current_access_specifier;
6253 current_access_specifier = access_public_node;
6254 finish_member_declaration (value);
6255 current_access_specifier = saved_cas;
6258 /* Returns 1 if TYPE contains only padding bytes. */
6261 is_empty_class (tree type)
6263 if (type == error_mark_node)
6266 if (! IS_AGGR_TYPE (type))
6269 /* In G++ 3.2, whether or not a class was empty was determined by
6270 looking at its size. */
6271 if (abi_version_at_least (2))
6272 return CLASSTYPE_EMPTY_P (type);
6274 return integer_zerop (CLASSTYPE_SIZE (type));
6277 /* Returns true if TYPE contains an empty class. */
6280 contains_empty_class_p (tree type)
6282 if (is_empty_class (type))
6284 if (CLASS_TYPE_P (type))
6291 for (binfo = TYPE_BINFO (type), i = 0;
6292 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6293 if (contains_empty_class_p (BINFO_TYPE (base_binfo)))
6295 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6296 if (TREE_CODE (field) == FIELD_DECL
6297 && !DECL_ARTIFICIAL (field)
6298 && is_empty_class (TREE_TYPE (field)))
6301 else if (TREE_CODE (type) == ARRAY_TYPE)
6302 return contains_empty_class_p (TREE_TYPE (type));
6306 /* Note that NAME was looked up while the current class was being
6307 defined and that the result of that lookup was DECL. */
6310 maybe_note_name_used_in_class (tree name, tree decl)
6312 splay_tree names_used;
6314 /* If we're not defining a class, there's nothing to do. */
6315 if (!(innermost_scope_kind() == sk_class
6316 && TYPE_BEING_DEFINED (current_class_type)))
6319 /* If there's already a binding for this NAME, then we don't have
6320 anything to worry about. */
6321 if (lookup_member (current_class_type, name,
6322 /*protect=*/0, /*want_type=*/false))
6325 if (!current_class_stack[current_class_depth - 1].names_used)
6326 current_class_stack[current_class_depth - 1].names_used
6327 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6328 names_used = current_class_stack[current_class_depth - 1].names_used;
6330 splay_tree_insert (names_used,
6331 (splay_tree_key) name,
6332 (splay_tree_value) decl);
6335 /* Note that NAME was declared (as DECL) in the current class. Check
6336 to see that the declaration is valid. */
6339 note_name_declared_in_class (tree name, tree decl)
6341 splay_tree names_used;
6344 /* Look to see if we ever used this name. */
6346 = current_class_stack[current_class_depth - 1].names_used;
6350 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6353 /* [basic.scope.class]
6355 A name N used in a class S shall refer to the same declaration
6356 in its context and when re-evaluated in the completed scope of
6358 pedwarn ("declaration of %q#D", decl);
6359 pedwarn ("changes meaning of %qD from %q+#D",
6360 DECL_NAME (OVL_CURRENT (decl)), (tree) n->value);
6364 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6365 Secondary vtables are merged with primary vtables; this function
6366 will return the VAR_DECL for the primary vtable. */
6369 get_vtbl_decl_for_binfo (tree binfo)
6373 decl = BINFO_VTABLE (binfo);
6374 if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR)
6376 gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR);
6377 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6380 gcc_assert (TREE_CODE (decl) == VAR_DECL);
6385 /* Returns the binfo for the primary base of BINFO. If the resulting
6386 BINFO is a virtual base, and it is inherited elsewhere in the
6387 hierarchy, then the returned binfo might not be the primary base of
6388 BINFO in the complete object. Check BINFO_PRIMARY_P or
6389 BINFO_LOST_PRIMARY_P to be sure. */
6392 get_primary_binfo (tree binfo)
6396 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6400 return copied_binfo (primary_base, binfo);
6403 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6406 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
6409 fprintf (stream, "%*s", indent, "");
6413 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6414 INDENT should be zero when called from the top level; it is
6415 incremented recursively. IGO indicates the next expected BINFO in
6416 inheritance graph ordering. */
6419 dump_class_hierarchy_r (FILE *stream,
6429 indented = maybe_indent_hierarchy (stream, indent, 0);
6430 fprintf (stream, "%s (0x%lx) ",
6431 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER),
6432 (unsigned long) binfo);
6435 fprintf (stream, "alternative-path\n");
6438 igo = TREE_CHAIN (binfo);
6440 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
6441 tree_low_cst (BINFO_OFFSET (binfo), 0));
6442 if (is_empty_class (BINFO_TYPE (binfo)))
6443 fprintf (stream, " empty");
6444 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
6445 fprintf (stream, " nearly-empty");
6446 if (BINFO_VIRTUAL_P (binfo))
6447 fprintf (stream, " virtual");
6448 fprintf (stream, "\n");
6451 if (BINFO_PRIMARY_P (binfo))
6453 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6454 fprintf (stream, " primary-for %s (0x%lx)",
6455 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
6456 TFF_PLAIN_IDENTIFIER),
6457 (unsigned long)BINFO_INHERITANCE_CHAIN (binfo));
6459 if (BINFO_LOST_PRIMARY_P (binfo))
6461 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6462 fprintf (stream, " lost-primary");
6465 fprintf (stream, "\n");
6467 if (!(flags & TDF_SLIM))
6471 if (BINFO_SUBVTT_INDEX (binfo))
6473 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6474 fprintf (stream, " subvttidx=%s",
6475 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
6476 TFF_PLAIN_IDENTIFIER));
6478 if (BINFO_VPTR_INDEX (binfo))
6480 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6481 fprintf (stream, " vptridx=%s",
6482 expr_as_string (BINFO_VPTR_INDEX (binfo),
6483 TFF_PLAIN_IDENTIFIER));
6485 if (BINFO_VPTR_FIELD (binfo))
6487 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6488 fprintf (stream, " vbaseoffset=%s",
6489 expr_as_string (BINFO_VPTR_FIELD (binfo),
6490 TFF_PLAIN_IDENTIFIER));
6492 if (BINFO_VTABLE (binfo))
6494 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6495 fprintf (stream, " vptr=%s",
6496 expr_as_string (BINFO_VTABLE (binfo),
6497 TFF_PLAIN_IDENTIFIER));
6501 fprintf (stream, "\n");
6504 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
6505 igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2);
6510 /* Dump the BINFO hierarchy for T. */
6513 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
6515 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6516 fprintf (stream, " size=%lu align=%lu\n",
6517 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
6518 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
6519 fprintf (stream, " base size=%lu base align=%lu\n",
6520 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
6522 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
6524 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
6525 fprintf (stream, "\n");
6528 /* Debug interface to hierarchy dumping. */
6531 debug_class (tree t)
6533 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
6537 dump_class_hierarchy (tree t)
6540 FILE *stream = dump_begin (TDI_class, &flags);
6544 dump_class_hierarchy_1 (stream, flags, t);
6545 dump_end (TDI_class, stream);
6550 dump_array (FILE * stream, tree decl)
6553 unsigned HOST_WIDE_INT ix;
6555 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
6557 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
6559 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
6560 fprintf (stream, " %s entries",
6561 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
6562 TFF_PLAIN_IDENTIFIER));
6563 fprintf (stream, "\n");
6565 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
6567 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
6568 expr_as_string (value, TFF_PLAIN_IDENTIFIER));
6572 dump_vtable (tree t, tree binfo, tree vtable)
6575 FILE *stream = dump_begin (TDI_class, &flags);
6580 if (!(flags & TDF_SLIM))
6582 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
6584 fprintf (stream, "%s for %s",
6585 ctor_vtbl_p ? "Construction vtable" : "Vtable",
6586 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER));
6589 if (!BINFO_VIRTUAL_P (binfo))
6590 fprintf (stream, " (0x%lx instance)", (unsigned long)binfo);
6591 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6593 fprintf (stream, "\n");
6594 dump_array (stream, vtable);
6595 fprintf (stream, "\n");
6598 dump_end (TDI_class, stream);
6602 dump_vtt (tree t, tree vtt)
6605 FILE *stream = dump_begin (TDI_class, &flags);
6610 if (!(flags & TDF_SLIM))
6612 fprintf (stream, "VTT for %s\n",
6613 type_as_string (t, TFF_PLAIN_IDENTIFIER));
6614 dump_array (stream, vtt);
6615 fprintf (stream, "\n");
6618 dump_end (TDI_class, stream);
6621 /* Dump a function or thunk and its thunkees. */
6624 dump_thunk (FILE *stream, int indent, tree thunk)
6626 static const char spaces[] = " ";
6627 tree name = DECL_NAME (thunk);
6630 fprintf (stream, "%.*s%p %s %s", indent, spaces,
6632 !DECL_THUNK_P (thunk) ? "function"
6633 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
6634 name ? IDENTIFIER_POINTER (name) : "<unset>");
6635 if (DECL_THUNK_P (thunk))
6637 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
6638 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
6640 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
6641 if (!virtual_adjust)
6643 else if (DECL_THIS_THUNK_P (thunk))
6644 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
6645 tree_low_cst (virtual_adjust, 0));
6647 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
6648 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
6649 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
6650 if (THUNK_ALIAS (thunk))
6651 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
6653 fprintf (stream, "\n");
6654 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
6655 dump_thunk (stream, indent + 2, thunks);
6658 /* Dump the thunks for FN. */
6661 debug_thunks (tree fn)
6663 dump_thunk (stderr, 0, fn);
6666 /* Virtual function table initialization. */
6668 /* Create all the necessary vtables for T and its base classes. */
6671 finish_vtbls (tree t)
6676 /* We lay out the primary and secondary vtables in one contiguous
6677 vtable. The primary vtable is first, followed by the non-virtual
6678 secondary vtables in inheritance graph order. */
6679 list = build_tree_list (BINFO_VTABLE (TYPE_BINFO (t)), NULL_TREE);
6680 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6681 TYPE_BINFO (t), t, list);
6683 /* Then come the virtual bases, also in inheritance graph order. */
6684 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6686 if (!BINFO_VIRTUAL_P (vbase))
6688 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6691 if (BINFO_VTABLE (TYPE_BINFO (t)))
6692 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6695 /* Initialize the vtable for BINFO with the INITS. */
6698 initialize_vtable (tree binfo, tree inits)
6702 layout_vtable_decl (binfo, list_length (inits));
6703 decl = get_vtbl_decl_for_binfo (binfo);
6704 initialize_artificial_var (decl, inits);
6705 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
6708 /* Build the VTT (virtual table table) for T.
6709 A class requires a VTT if it has virtual bases.
6712 1 - primary virtual pointer for complete object T
6713 2 - secondary VTTs for each direct non-virtual base of T which requires a
6715 3 - secondary virtual pointers for each direct or indirect base of T which
6716 has virtual bases or is reachable via a virtual path from T.
6717 4 - secondary VTTs for each direct or indirect virtual base of T.
6719 Secondary VTTs look like complete object VTTs without part 4. */
6729 /* Build up the initializers for the VTT. */
6731 index = size_zero_node;
6732 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
6734 /* If we didn't need a VTT, we're done. */
6738 /* Figure out the type of the VTT. */
6739 type = build_index_type (size_int (list_length (inits) - 1));
6740 type = build_cplus_array_type (const_ptr_type_node, type);
6742 /* Now, build the VTT object itself. */
6743 vtt = build_vtable (t, mangle_vtt_for_type (t), type);
6744 initialize_artificial_var (vtt, inits);
6745 /* Add the VTT to the vtables list. */
6746 TREE_CHAIN (vtt) = TREE_CHAIN (CLASSTYPE_VTABLES (t));
6747 TREE_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
6752 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6753 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6754 and CHAIN the vtable pointer for this binfo after construction is
6755 complete. VALUE can also be another BINFO, in which case we recurse. */
6758 binfo_ctor_vtable (tree binfo)
6764 vt = BINFO_VTABLE (binfo);
6765 if (TREE_CODE (vt) == TREE_LIST)
6766 vt = TREE_VALUE (vt);
6767 if (TREE_CODE (vt) == TREE_BINFO)
6776 /* Data for secondary VTT initialization. */
6777 typedef struct secondary_vptr_vtt_init_data_s
6779 /* Is this the primary VTT? */
6782 /* Current index into the VTT. */
6785 /* TREE_LIST of initializers built up. */
6788 /* The type being constructed by this secondary VTT. */
6789 tree type_being_constructed;
6790 } secondary_vptr_vtt_init_data;
6792 /* Recursively build the VTT-initializer for BINFO (which is in the
6793 hierarchy dominated by T). INITS points to the end of the initializer
6794 list to date. INDEX is the VTT index where the next element will be
6795 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6796 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6797 for virtual bases of T. When it is not so, we build the constructor
6798 vtables for the BINFO-in-T variant. */
6801 build_vtt_inits (tree binfo, tree t, tree *inits, tree *index)
6806 tree secondary_vptrs;
6807 secondary_vptr_vtt_init_data data;
6808 int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
6810 /* We only need VTTs for subobjects with virtual bases. */
6811 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
6814 /* We need to use a construction vtable if this is not the primary
6818 build_ctor_vtbl_group (binfo, t);
6820 /* Record the offset in the VTT where this sub-VTT can be found. */
6821 BINFO_SUBVTT_INDEX (binfo) = *index;
6824 /* Add the address of the primary vtable for the complete object. */
6825 init = binfo_ctor_vtable (binfo);
6826 *inits = build_tree_list (NULL_TREE, init);
6827 inits = &TREE_CHAIN (*inits);
6830 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6831 BINFO_VPTR_INDEX (binfo) = *index;
6833 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6835 /* Recursively add the secondary VTTs for non-virtual bases. */
6836 for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i)
6837 if (!BINFO_VIRTUAL_P (b))
6838 inits = build_vtt_inits (b, t, inits, index);
6840 /* Add secondary virtual pointers for all subobjects of BINFO with
6841 either virtual bases or reachable along a virtual path, except
6842 subobjects that are non-virtual primary bases. */
6843 data.top_level_p = top_level_p;
6844 data.index = *index;
6846 data.type_being_constructed = BINFO_TYPE (binfo);
6848 dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data);
6850 *index = data.index;
6852 /* The secondary vptrs come back in reverse order. After we reverse
6853 them, and add the INITS, the last init will be the first element
6855 secondary_vptrs = data.inits;
6856 if (secondary_vptrs)
6858 *inits = nreverse (secondary_vptrs);
6859 inits = &TREE_CHAIN (secondary_vptrs);
6860 gcc_assert (*inits == NULL_TREE);
6864 /* Add the secondary VTTs for virtual bases in inheritance graph
6866 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6868 if (!BINFO_VIRTUAL_P (b))
6871 inits = build_vtt_inits (b, t, inits, index);
6874 /* Remove the ctor vtables we created. */
6875 dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo);
6880 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
6881 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
6884 dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_)
6886 secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_;
6888 /* We don't care about bases that don't have vtables. */
6889 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6890 return dfs_skip_bases;
6892 /* We're only interested in proper subobjects of the type being
6894 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed))
6897 /* We're only interested in bases with virtual bases or reachable
6898 via a virtual path from the type being constructed. */
6899 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6900 || binfo_via_virtual (binfo, data->type_being_constructed)))
6901 return dfs_skip_bases;
6903 /* We're not interested in non-virtual primary bases. */
6904 if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo))
6907 /* Record the index where this secondary vptr can be found. */
6908 if (data->top_level_p)
6910 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6911 BINFO_VPTR_INDEX (binfo) = data->index;
6913 if (BINFO_VIRTUAL_P (binfo))
6915 /* It's a primary virtual base, and this is not a
6916 construction vtable. Find the base this is primary of in
6917 the inheritance graph, and use that base's vtable
6919 while (BINFO_PRIMARY_P (binfo))
6920 binfo = BINFO_INHERITANCE_CHAIN (binfo);
6924 /* Add the initializer for the secondary vptr itself. */
6925 data->inits = tree_cons (NULL_TREE, binfo_ctor_vtable (binfo), data->inits);
6927 /* Advance the vtt index. */
6928 data->index = size_binop (PLUS_EXPR, data->index,
6929 TYPE_SIZE_UNIT (ptr_type_node));
6934 /* Called from build_vtt_inits via dfs_walk. After building
6935 constructor vtables and generating the sub-vtt from them, we need
6936 to restore the BINFO_VTABLES that were scribbled on. DATA is the
6937 binfo of the base whose sub vtt was generated. */
6940 dfs_fixup_binfo_vtbls (tree binfo, void* data)
6942 tree vtable = BINFO_VTABLE (binfo);
6944 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6945 /* If this class has no vtable, none of its bases do. */
6946 return dfs_skip_bases;
6949 /* This might be a primary base, so have no vtable in this
6953 /* If we scribbled the construction vtable vptr into BINFO, clear it
6955 if (TREE_CODE (vtable) == TREE_LIST
6956 && (TREE_PURPOSE (vtable) == (tree) data))
6957 BINFO_VTABLE (binfo) = TREE_CHAIN (vtable);
6962 /* Build the construction vtable group for BINFO which is in the
6963 hierarchy dominated by T. */
6966 build_ctor_vtbl_group (tree binfo, tree t)
6975 /* See if we've already created this construction vtable group. */
6976 id = mangle_ctor_vtbl_for_type (t, binfo);
6977 if (IDENTIFIER_GLOBAL_VALUE (id))
6980 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t));
6981 /* Build a version of VTBL (with the wrong type) for use in
6982 constructing the addresses of secondary vtables in the
6983 construction vtable group. */
6984 vtbl = build_vtable (t, id, ptr_type_node);
6985 DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1;
6986 list = build_tree_list (vtbl, NULL_TREE);
6987 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
6990 /* Add the vtables for each of our virtual bases using the vbase in T
6992 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
6994 vbase = TREE_CHAIN (vbase))
6998 if (!BINFO_VIRTUAL_P (vbase))
7000 b = copied_binfo (vbase, binfo);
7002 accumulate_vtbl_inits (b, vbase, binfo, t, list);
7004 inits = TREE_VALUE (list);
7006 /* Figure out the type of the construction vtable. */
7007 type = build_index_type (size_int (list_length (inits) - 1));
7008 type = build_cplus_array_type (vtable_entry_type, type);
7010 TREE_TYPE (vtbl) = type;
7011 DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE;
7012 layout_decl (vtbl, 0);
7014 /* Initialize the construction vtable. */
7015 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
7016 initialize_artificial_var (vtbl, inits);
7017 dump_vtable (t, binfo, vtbl);
7020 /* Add the vtbl initializers for BINFO (and its bases other than
7021 non-virtual primaries) to the list of INITS. BINFO is in the
7022 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7023 the constructor the vtbl inits should be accumulated for. (If this
7024 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7025 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7026 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7027 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7028 but are not necessarily the same in terms of layout. */
7031 accumulate_vtbl_inits (tree binfo,
7039 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7041 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo)));
7043 /* If it doesn't have a vptr, we don't do anything. */
7044 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
7047 /* If we're building a construction vtable, we're not interested in
7048 subobjects that don't require construction vtables. */
7050 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
7051 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
7054 /* Build the initializers for the BINFO-in-T vtable. */
7056 = chainon (TREE_VALUE (inits),
7057 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
7058 rtti_binfo, t, inits));
7060 /* Walk the BINFO and its bases. We walk in preorder so that as we
7061 initialize each vtable we can figure out at what offset the
7062 secondary vtable lies from the primary vtable. We can't use
7063 dfs_walk here because we need to iterate through bases of BINFO
7064 and RTTI_BINFO simultaneously. */
7065 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7067 /* Skip virtual bases. */
7068 if (BINFO_VIRTUAL_P (base_binfo))
7070 accumulate_vtbl_inits (base_binfo,
7071 BINFO_BASE_BINFO (orig_binfo, i),
7077 /* Called from accumulate_vtbl_inits. Returns the initializers for
7078 the BINFO vtable. */
7081 dfs_accumulate_vtbl_inits (tree binfo,
7087 tree inits = NULL_TREE;
7088 tree vtbl = NULL_TREE;
7089 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7092 && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
7094 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7095 primary virtual base. If it is not the same primary in
7096 the hierarchy of T, we'll need to generate a ctor vtable
7097 for it, to place at its location in T. If it is the same
7098 primary, we still need a VTT entry for the vtable, but it
7099 should point to the ctor vtable for the base it is a
7100 primary for within the sub-hierarchy of RTTI_BINFO.
7102 There are three possible cases:
7104 1) We are in the same place.
7105 2) We are a primary base within a lost primary virtual base of
7107 3) We are primary to something not a base of RTTI_BINFO. */
7110 tree last = NULL_TREE;
7112 /* First, look through the bases we are primary to for RTTI_BINFO
7113 or a virtual base. */
7115 while (BINFO_PRIMARY_P (b))
7117 b = BINFO_INHERITANCE_CHAIN (b);
7119 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7122 /* If we run out of primary links, keep looking down our
7123 inheritance chain; we might be an indirect primary. */
7124 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
7125 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7129 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7130 base B and it is a base of RTTI_BINFO, this is case 2. In
7131 either case, we share our vtable with LAST, i.e. the
7132 derived-most base within B of which we are a primary. */
7134 || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo))))
7135 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7136 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7137 binfo_ctor_vtable after everything's been set up. */
7140 /* Otherwise, this is case 3 and we get our own. */
7142 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
7150 /* Compute the initializer for this vtable. */
7151 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7154 /* Figure out the position to which the VPTR should point. */
7155 vtbl = TREE_PURPOSE (l);
7156 vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, vtbl);
7157 index = size_binop (PLUS_EXPR,
7158 size_int (non_fn_entries),
7159 size_int (list_length (TREE_VALUE (l))));
7160 index = size_binop (MULT_EXPR,
7161 TYPE_SIZE_UNIT (vtable_entry_type),
7163 vtbl = build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7167 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7168 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7169 straighten this out. */
7170 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7171 else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo))
7174 /* For an ordinary vtable, set BINFO_VTABLE. */
7175 BINFO_VTABLE (binfo) = vtbl;
7180 static GTY(()) tree abort_fndecl_addr;
7182 /* Construct the initializer for BINFO's virtual function table. BINFO
7183 is part of the hierarchy dominated by T. If we're building a
7184 construction vtable, the ORIG_BINFO is the binfo we should use to
7185 find the actual function pointers to put in the vtable - but they
7186 can be overridden on the path to most-derived in the graph that
7187 ORIG_BINFO belongs. Otherwise,
7188 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7189 BINFO that should be indicated by the RTTI information in the
7190 vtable; it will be a base class of T, rather than T itself, if we
7191 are building a construction vtable.
7193 The value returned is a TREE_LIST suitable for wrapping in a
7194 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7195 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7196 number of non-function entries in the vtable.
7198 It might seem that this function should never be called with a
7199 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7200 base is always subsumed by a derived class vtable. However, when
7201 we are building construction vtables, we do build vtables for
7202 primary bases; we need these while the primary base is being
7206 build_vtbl_initializer (tree binfo,
7210 int* non_fn_entries_p)
7217 VEC(tree,gc) *vbases;
7219 /* Initialize VID. */
7220 memset (&vid, 0, sizeof (vid));
7223 vid.rtti_binfo = rtti_binfo;
7224 vid.last_init = &vid.inits;
7225 vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
7226 vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7227 vid.generate_vcall_entries = true;
7228 /* The first vbase or vcall offset is at index -3 in the vtable. */
7229 vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
7231 /* Add entries to the vtable for RTTI. */
7232 build_rtti_vtbl_entries (binfo, &vid);
7234 /* Create an array for keeping track of the functions we've
7235 processed. When we see multiple functions with the same
7236 signature, we share the vcall offsets. */
7237 vid.fns = VEC_alloc (tree, gc, 32);
7238 /* Add the vcall and vbase offset entries. */
7239 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7241 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7242 build_vbase_offset_vtbl_entries. */
7243 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
7244 VEC_iterate (tree, vbases, ix, vbinfo); ix++)
7245 BINFO_VTABLE_PATH_MARKED (vbinfo) = 0;
7247 /* If the target requires padding between data entries, add that now. */
7248 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
7252 for (prev = &vid.inits; (cur = *prev); prev = &TREE_CHAIN (cur))
7257 for (i = 1; i < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++i)
7258 add = tree_cons (NULL_TREE,
7259 build1 (NOP_EXPR, vtable_entry_type,
7266 if (non_fn_entries_p)
7267 *non_fn_entries_p = list_length (vid.inits);
7269 /* Go through all the ordinary virtual functions, building up
7271 vfun_inits = NULL_TREE;
7272 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7276 tree fn, fn_original;
7277 tree init = NULL_TREE;
7281 if (DECL_THUNK_P (fn))
7283 if (!DECL_NAME (fn))
7285 if (THUNK_ALIAS (fn))
7287 fn = THUNK_ALIAS (fn);
7290 fn_original = THUNK_TARGET (fn);
7293 /* If the only definition of this function signature along our
7294 primary base chain is from a lost primary, this vtable slot will
7295 never be used, so just zero it out. This is important to avoid
7296 requiring extra thunks which cannot be generated with the function.
7298 We first check this in update_vtable_entry_for_fn, so we handle
7299 restored primary bases properly; we also need to do it here so we
7300 zero out unused slots in ctor vtables, rather than filling themff
7301 with erroneous values (though harmless, apart from relocation
7303 for (b = binfo; ; b = get_primary_binfo (b))
7305 /* We found a defn before a lost primary; go ahead as normal. */
7306 if (look_for_overrides_here (BINFO_TYPE (b), fn_original))
7309 /* The nearest definition is from a lost primary; clear the
7311 if (BINFO_LOST_PRIMARY_P (b))
7313 init = size_zero_node;
7320 /* Pull the offset for `this', and the function to call, out of
7322 delta = BV_DELTA (v);
7323 vcall_index = BV_VCALL_INDEX (v);
7325 gcc_assert (TREE_CODE (delta) == INTEGER_CST);
7326 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7328 /* You can't call an abstract virtual function; it's abstract.
7329 So, we replace these functions with __pure_virtual. */
7330 if (DECL_PURE_VIRTUAL_P (fn_original))
7333 if (abort_fndecl_addr == NULL)
7334 abort_fndecl_addr = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7335 init = abort_fndecl_addr;
7339 if (!integer_zerop (delta) || vcall_index)
7341 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
7342 if (!DECL_NAME (fn))
7345 /* Take the address of the function, considering it to be of an
7346 appropriate generic type. */
7347 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7351 /* And add it to the chain of initializers. */
7352 if (TARGET_VTABLE_USES_DESCRIPTORS)
7355 if (init == size_zero_node)
7356 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7357 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7359 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7361 tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node,
7362 TREE_OPERAND (init, 0),
7363 build_int_cst (NULL_TREE, i));
7364 TREE_CONSTANT (fdesc) = 1;
7365 TREE_INVARIANT (fdesc) = 1;
7367 vfun_inits = tree_cons (NULL_TREE, fdesc, vfun_inits);
7371 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7374 /* The initializers for virtual functions were built up in reverse
7375 order; straighten them out now. */
7376 vfun_inits = nreverse (vfun_inits);
7378 /* The negative offset initializers are also in reverse order. */
7379 vid.inits = nreverse (vid.inits);
7381 /* Chain the two together. */
7382 return chainon (vid.inits, vfun_inits);
7385 /* Adds to vid->inits the initializers for the vbase and vcall
7386 offsets in BINFO, which is in the hierarchy dominated by T. */
7389 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
7393 /* If this is a derived class, we must first create entries
7394 corresponding to the primary base class. */
7395 b = get_primary_binfo (binfo);
7397 build_vcall_and_vbase_vtbl_entries (b, vid);
7399 /* Add the vbase entries for this base. */
7400 build_vbase_offset_vtbl_entries (binfo, vid);
7401 /* Add the vcall entries for this base. */
7402 build_vcall_offset_vtbl_entries (binfo, vid);
7405 /* Returns the initializers for the vbase offset entries in the vtable
7406 for BINFO (which is part of the class hierarchy dominated by T), in
7407 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7408 where the next vbase offset will go. */
7411 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7415 tree non_primary_binfo;
7417 /* If there are no virtual baseclasses, then there is nothing to
7419 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
7424 /* We might be a primary base class. Go up the inheritance hierarchy
7425 until we find the most derived class of which we are a primary base:
7426 it is the offset of that which we need to use. */
7427 non_primary_binfo = binfo;
7428 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7432 /* If we have reached a virtual base, then it must be a primary
7433 base (possibly multi-level) of vid->binfo, or we wouldn't
7434 have called build_vcall_and_vbase_vtbl_entries for it. But it
7435 might be a lost primary, so just skip down to vid->binfo. */
7436 if (BINFO_VIRTUAL_P (non_primary_binfo))
7438 non_primary_binfo = vid->binfo;
7442 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7443 if (get_primary_binfo (b) != non_primary_binfo)
7445 non_primary_binfo = b;
7448 /* Go through the virtual bases, adding the offsets. */
7449 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7451 vbase = TREE_CHAIN (vbase))
7456 if (!BINFO_VIRTUAL_P (vbase))
7459 /* Find the instance of this virtual base in the complete
7461 b = copied_binfo (vbase, binfo);
7463 /* If we've already got an offset for this virtual base, we
7464 don't need another one. */
7465 if (BINFO_VTABLE_PATH_MARKED (b))
7467 BINFO_VTABLE_PATH_MARKED (b) = 1;
7469 /* Figure out where we can find this vbase offset. */
7470 delta = size_binop (MULT_EXPR,
7473 TYPE_SIZE_UNIT (vtable_entry_type)));
7474 if (vid->primary_vtbl_p)
7475 BINFO_VPTR_FIELD (b) = delta;
7477 if (binfo != TYPE_BINFO (t))
7478 /* The vbase offset had better be the same. */
7479 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase)));
7481 /* The next vbase will come at a more negative offset. */
7482 vid->index = size_binop (MINUS_EXPR, vid->index,
7483 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7485 /* The initializer is the delta from BINFO to this virtual base.
7486 The vbase offsets go in reverse inheritance-graph order, and
7487 we are walking in inheritance graph order so these end up in
7489 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
7492 = build_tree_list (NULL_TREE,
7493 fold_build1 (NOP_EXPR,
7496 vid->last_init = &TREE_CHAIN (*vid->last_init);
7500 /* Adds the initializers for the vcall offset entries in the vtable
7501 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7505 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7507 /* We only need these entries if this base is a virtual base. We
7508 compute the indices -- but do not add to the vtable -- when
7509 building the main vtable for a class. */
7510 if (binfo == TYPE_BINFO (vid->derived)
7511 || (BINFO_VIRTUAL_P (binfo)
7512 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7513 correspond to VID->DERIVED), we are building a primary
7514 construction virtual table. Since this is a primary
7515 virtual table, we do not need the vcall offsets for
7517 && binfo != vid->rtti_binfo))
7519 /* We need a vcall offset for each of the virtual functions in this
7520 vtable. For example:
7522 class A { virtual void f (); };
7523 class B1 : virtual public A { virtual void f (); };
7524 class B2 : virtual public A { virtual void f (); };
7525 class C: public B1, public B2 { virtual void f (); };
7527 A C object has a primary base of B1, which has a primary base of A. A
7528 C also has a secondary base of B2, which no longer has a primary base
7529 of A. So the B2-in-C construction vtable needs a secondary vtable for
7530 A, which will adjust the A* to a B2* to call f. We have no way of
7531 knowing what (or even whether) this offset will be when we define B2,
7532 so we store this "vcall offset" in the A sub-vtable and look it up in
7533 a "virtual thunk" for B2::f.
7535 We need entries for all the functions in our primary vtable and
7536 in our non-virtual bases' secondary vtables. */
7538 /* If we are just computing the vcall indices -- but do not need
7539 the actual entries -- not that. */
7540 if (!BINFO_VIRTUAL_P (binfo))
7541 vid->generate_vcall_entries = false;
7542 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7543 add_vcall_offset_vtbl_entries_r (binfo, vid);
7547 /* Build vcall offsets, starting with those for BINFO. */
7550 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
7556 /* Don't walk into virtual bases -- except, of course, for the
7557 virtual base for which we are building vcall offsets. Any
7558 primary virtual base will have already had its offsets generated
7559 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7560 if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo)
7563 /* If BINFO has a primary base, process it first. */
7564 primary_binfo = get_primary_binfo (binfo);
7566 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7568 /* Add BINFO itself to the list. */
7569 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7571 /* Scan the non-primary bases of BINFO. */
7572 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7573 if (base_binfo != primary_binfo)
7574 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7577 /* Called from build_vcall_offset_vtbl_entries_r. */
7580 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
7582 /* Make entries for the rest of the virtuals. */
7583 if (abi_version_at_least (2))
7587 /* The ABI requires that the methods be processed in declaration
7588 order. G++ 3.2 used the order in the vtable. */
7589 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
7591 orig_fn = TREE_CHAIN (orig_fn))
7592 if (DECL_VINDEX (orig_fn))
7593 add_vcall_offset (orig_fn, binfo, vid);
7597 tree derived_virtuals;
7600 /* If BINFO is a primary base, the most derived class which has
7601 BINFO as a primary base; otherwise, just BINFO. */
7602 tree non_primary_binfo;
7604 /* We might be a primary base class. Go up the inheritance hierarchy
7605 until we find the most derived class of which we are a primary base:
7606 it is the BINFO_VIRTUALS there that we need to consider. */
7607 non_primary_binfo = binfo;
7608 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7612 /* If we have reached a virtual base, then it must be vid->vbase,
7613 because we ignore other virtual bases in
7614 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7615 base (possibly multi-level) of vid->binfo, or we wouldn't
7616 have called build_vcall_and_vbase_vtbl_entries for it. But it
7617 might be a lost primary, so just skip down to vid->binfo. */
7618 if (BINFO_VIRTUAL_P (non_primary_binfo))
7620 gcc_assert (non_primary_binfo == vid->vbase);
7621 non_primary_binfo = vid->binfo;
7625 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7626 if (get_primary_binfo (b) != non_primary_binfo)
7628 non_primary_binfo = b;
7631 if (vid->ctor_vtbl_p)
7632 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7633 where rtti_binfo is the most derived type. */
7635 = original_binfo (non_primary_binfo, vid->rtti_binfo);
7637 for (base_virtuals = BINFO_VIRTUALS (binfo),
7638 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7639 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7641 base_virtuals = TREE_CHAIN (base_virtuals),
7642 derived_virtuals = TREE_CHAIN (derived_virtuals),
7643 orig_virtuals = TREE_CHAIN (orig_virtuals))
7647 /* Find the declaration that originally caused this function to
7648 be present in BINFO_TYPE (binfo). */
7649 orig_fn = BV_FN (orig_virtuals);
7651 /* When processing BINFO, we only want to generate vcall slots for
7652 function slots introduced in BINFO. So don't try to generate
7653 one if the function isn't even defined in BINFO. */
7654 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn)))
7657 add_vcall_offset (orig_fn, binfo, vid);
7662 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7665 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
7671 /* If there is already an entry for a function with the same
7672 signature as FN, then we do not need a second vcall offset.
7673 Check the list of functions already present in the derived
7675 for (i = 0; VEC_iterate (tree, vid->fns, i, derived_entry); ++i)
7677 if (same_signature_p (derived_entry, orig_fn)
7678 /* We only use one vcall offset for virtual destructors,
7679 even though there are two virtual table entries. */
7680 || (DECL_DESTRUCTOR_P (derived_entry)
7681 && DECL_DESTRUCTOR_P (orig_fn)))
7685 /* If we are building these vcall offsets as part of building
7686 the vtable for the most derived class, remember the vcall
7688 if (vid->binfo == TYPE_BINFO (vid->derived))
7690 tree_pair_p elt = VEC_safe_push (tree_pair_s, gc,
7691 CLASSTYPE_VCALL_INDICES (vid->derived),
7693 elt->purpose = orig_fn;
7694 elt->value = vid->index;
7697 /* The next vcall offset will be found at a more negative
7699 vid->index = size_binop (MINUS_EXPR, vid->index,
7700 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7702 /* Keep track of this function. */
7703 VEC_safe_push (tree, gc, vid->fns, orig_fn);
7705 if (vid->generate_vcall_entries)
7710 /* Find the overriding function. */
7711 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
7712 if (fn == error_mark_node)
7713 vcall_offset = build1 (NOP_EXPR, vtable_entry_type,
7717 base = TREE_VALUE (fn);
7719 /* The vbase we're working on is a primary base of
7720 vid->binfo. But it might be a lost primary, so its
7721 BINFO_OFFSET might be wrong, so we just use the
7722 BINFO_OFFSET from vid->binfo. */
7723 vcall_offset = size_diffop (BINFO_OFFSET (base),
7724 BINFO_OFFSET (vid->binfo));
7725 vcall_offset = fold_build1 (NOP_EXPR, vtable_entry_type,
7728 /* Add the initializer to the vtable. */
7729 *vid->last_init = build_tree_list (NULL_TREE, vcall_offset);
7730 vid->last_init = &TREE_CHAIN (*vid->last_init);
7734 /* Return vtbl initializers for the RTTI entries corresponding to the
7735 BINFO's vtable. The RTTI entries should indicate the object given
7736 by VID->rtti_binfo. */
7739 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
7748 basetype = BINFO_TYPE (binfo);
7749 t = BINFO_TYPE (vid->rtti_binfo);
7751 /* To find the complete object, we will first convert to our most
7752 primary base, and then add the offset in the vtbl to that value. */
7754 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
7755 && !BINFO_LOST_PRIMARY_P (b))
7759 primary_base = get_primary_binfo (b);
7760 gcc_assert (BINFO_PRIMARY_P (primary_base)
7761 && BINFO_INHERITANCE_CHAIN (primary_base) == b);
7764 offset = size_diffop (BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
7766 /* The second entry is the address of the typeinfo object. */
7768 decl = build_address (get_tinfo_decl (t));
7770 decl = integer_zero_node;
7772 /* Convert the declaration to a type that can be stored in the
7774 init = build_nop (vfunc_ptr_type_node, decl);
7775 *vid->last_init = build_tree_list (NULL_TREE, init);
7776 vid->last_init = &TREE_CHAIN (*vid->last_init);
7778 /* Add the offset-to-top entry. It comes earlier in the vtable than
7779 the typeinfo entry. Convert the offset to look like a
7780 function pointer, so that we can put it in the vtable. */
7781 init = build_nop (vfunc_ptr_type_node, offset);
7782 *vid->last_init = build_tree_list (NULL_TREE, init);
7783 vid->last_init = &TREE_CHAIN (*vid->last_init);
7786 /* Fold a OBJ_TYPE_REF expression to the address of a function.
7787 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
7790 cp_fold_obj_type_ref (tree ref, tree known_type)
7792 HOST_WIDE_INT index = tree_low_cst (OBJ_TYPE_REF_TOKEN (ref), 1);
7793 HOST_WIDE_INT i = 0;
7794 tree v = BINFO_VIRTUALS (TYPE_BINFO (known_type));
7799 i += (TARGET_VTABLE_USES_DESCRIPTORS
7800 ? TARGET_VTABLE_USES_DESCRIPTORS : 1);
7806 #ifdef ENABLE_CHECKING
7807 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref),
7808 DECL_VINDEX (fndecl)));
7811 cgraph_node (fndecl)->local.vtable_method = true;
7813 return build_address (fndecl);
7816 #include "gt-cp-class.h"