1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* High-level class interface. */
28 #include "coretypes.h"
39 /* The number of nested classes being processed. If we are not in the
40 scope of any class, this is zero. */
42 int current_class_depth;
44 /* In order to deal with nested classes, we keep a stack of classes.
45 The topmost entry is the innermost class, and is the entry at index
46 CURRENT_CLASS_DEPTH */
48 typedef struct class_stack_node {
49 /* The name of the class. */
52 /* The _TYPE node for the class. */
55 /* The access specifier pending for new declarations in the scope of
59 /* If were defining TYPE, the names used in this class. */
60 splay_tree names_used;
61 }* class_stack_node_t;
63 typedef struct vtbl_init_data_s
65 /* The base for which we're building initializers. */
67 /* The type of the most-derived type. */
69 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
70 unless ctor_vtbl_p is true. */
72 /* The negative-index vtable initializers built up so far. These
73 are in order from least negative index to most negative index. */
75 /* The last (i.e., most negative) entry in INITS. */
77 /* The binfo for the virtual base for which we're building
78 vcall offset initializers. */
80 /* The functions in vbase for which we have already provided vcall
83 /* The vtable index of the next vcall or vbase offset. */
85 /* Nonzero if we are building the initializer for the primary
88 /* Nonzero if we are building the initializer for a construction
91 /* True when adding vcall offset entries to the vtable. False when
92 merely computing the indices. */
93 bool generate_vcall_entries;
96 /* The type of a function passed to walk_subobject_offsets. */
97 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
99 /* The stack itself. This is a dynamically resized array. The
100 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
101 static int current_class_stack_size;
102 static class_stack_node_t current_class_stack;
104 /* An array of all local classes present in this translation unit, in
105 declaration order. */
106 varray_type local_classes;
108 static tree get_vfield_name (tree);
109 static void finish_struct_anon (tree);
110 static tree get_vtable_name (tree);
111 static tree get_basefndecls (tree, tree);
112 static int build_primary_vtable (tree, tree);
113 static int build_secondary_vtable (tree);
114 static void finish_vtbls (tree);
115 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
116 static void finish_struct_bits (tree);
117 static int alter_access (tree, tree, tree);
118 static void handle_using_decl (tree, tree);
119 static tree dfs_modify_vtables (tree, void *);
120 static tree modify_all_vtables (tree, tree);
121 static void determine_primary_bases (tree);
122 static void finish_struct_methods (tree);
123 static void maybe_warn_about_overly_private_class (tree);
124 static int method_name_cmp (const void *, const void *);
125 static int resort_method_name_cmp (const void *, const void *);
126 static void add_implicitly_declared_members (tree, int, int, int);
127 static tree fixed_type_or_null (tree, int *, int *);
128 static tree resolve_address_of_overloaded_function (tree, tree, tsubst_flags_t,
130 static tree build_simple_base_path (tree expr, tree binfo);
131 static tree build_vtbl_ref_1 (tree, tree);
132 static tree build_vtbl_initializer (tree, tree, tree, tree, int *);
133 static int count_fields (tree);
134 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
135 static void check_bitfield_decl (tree);
136 static void check_field_decl (tree, tree, int *, int *, int *, int *);
137 static void check_field_decls (tree, tree *, int *, int *, int *);
138 static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
139 static void build_base_fields (record_layout_info, splay_tree, tree *);
140 static void check_methods (tree);
141 static void remove_zero_width_bit_fields (tree);
142 static void check_bases (tree, int *, int *, int *);
143 static void check_bases_and_members (tree);
144 static tree create_vtable_ptr (tree, tree *);
145 static void include_empty_classes (record_layout_info);
146 static void layout_class_type (tree, tree *);
147 static void fixup_pending_inline (tree);
148 static void fixup_inline_methods (tree);
149 static void propagate_binfo_offsets (tree, tree);
150 static void layout_virtual_bases (record_layout_info, splay_tree);
151 static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *);
152 static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *);
153 static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *);
154 static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *);
155 static void add_vcall_offset (tree, tree, vtbl_init_data *);
156 static void layout_vtable_decl (tree, int);
157 static tree dfs_find_final_overrider_pre (tree, void *);
158 static tree dfs_find_final_overrider_post (tree, void *);
159 static tree find_final_overrider (tree, tree, tree);
160 static int make_new_vtable (tree, tree);
161 static int maybe_indent_hierarchy (FILE *, int, int);
162 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
163 static void dump_class_hierarchy (tree);
164 static void dump_class_hierarchy_1 (FILE *, int, tree);
165 static void dump_array (FILE *, tree);
166 static void dump_vtable (tree, tree, tree);
167 static void dump_vtt (tree, tree);
168 static void dump_thunk (FILE *, int, tree);
169 static tree build_vtable (tree, tree, tree);
170 static void initialize_vtable (tree, tree);
171 static void layout_nonempty_base_or_field (record_layout_info,
172 tree, tree, splay_tree);
173 static tree end_of_class (tree, int);
174 static bool layout_empty_base (tree, tree, splay_tree);
175 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree);
176 static tree dfs_accumulate_vtbl_inits (tree, tree, tree, tree,
178 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
179 static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *);
180 static void clone_constructors_and_destructors (tree);
181 static tree build_clone (tree, tree);
182 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
183 static void build_ctor_vtbl_group (tree, tree);
184 static void build_vtt (tree);
185 static tree binfo_ctor_vtable (tree);
186 static tree *build_vtt_inits (tree, tree, tree *, tree *);
187 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
188 static tree dfs_fixup_binfo_vtbls (tree, void *);
189 static int record_subobject_offset (tree, tree, splay_tree);
190 static int check_subobject_offset (tree, tree, splay_tree);
191 static int walk_subobject_offsets (tree, subobject_offset_fn,
192 tree, splay_tree, tree, int);
193 static void record_subobject_offsets (tree, tree, splay_tree, int);
194 static int layout_conflict_p (tree, tree, splay_tree, int);
195 static int splay_tree_compare_integer_csts (splay_tree_key k1,
197 static void warn_about_ambiguous_bases (tree);
198 static bool type_requires_array_cookie (tree);
199 static bool contains_empty_class_p (tree);
200 static bool base_derived_from (tree, tree);
201 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
202 static tree end_of_base (tree);
203 static tree get_vcall_index (tree, tree);
205 /* Variables shared between class.c and call.c. */
207 #ifdef GATHER_STATISTICS
209 int n_vtable_entries = 0;
210 int n_vtable_searches = 0;
211 int n_vtable_elems = 0;
212 int n_convert_harshness = 0;
213 int n_compute_conversion_costs = 0;
214 int n_inner_fields_searched = 0;
217 /* Convert to or from a base subobject. EXPR is an expression of type
218 `A' or `A*', an expression of type `B' or `B*' is returned. To
219 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
220 the B base instance within A. To convert base A to derived B, CODE
221 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
222 In this latter case, A must not be a morally virtual base of B.
223 NONNULL is true if EXPR is known to be non-NULL (this is only
224 needed when EXPR is of pointer type). CV qualifiers are preserved
228 build_base_path (enum tree_code code,
233 tree v_binfo = NULL_TREE;
234 tree d_binfo = NULL_TREE;
238 tree null_test = NULL;
239 tree ptr_target_type;
241 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
242 bool has_empty = false;
245 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
246 return error_mark_node;
248 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
251 if (is_empty_class (BINFO_TYPE (probe)))
253 if (!v_binfo && BINFO_VIRTUAL_P (probe))
257 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
259 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
261 gcc_assert ((code == MINUS_EXPR
262 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe))
263 || (code == PLUS_EXPR
264 && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)));
266 if (binfo == d_binfo)
270 if (code == MINUS_EXPR && v_binfo)
272 error ("cannot convert from base %qT to derived type %qT via virtual base %qT",
273 BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo));
274 return error_mark_node;
278 /* This must happen before the call to save_expr. */
279 expr = build_unary_op (ADDR_EXPR, expr, 0);
281 offset = BINFO_OFFSET (binfo);
282 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
284 /* Do we need to look in the vtable for the real offset? */
285 virtual_access = (v_binfo && fixed_type_p <= 0);
287 /* Do we need to check for a null pointer? */
288 if (want_pointer && !nonnull && (virtual_access || !integer_zerop (offset)))
289 null_test = error_mark_node;
291 /* Protect against multiple evaluation if necessary. */
292 if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access))
293 expr = save_expr (expr);
295 /* Now that we've saved expr, build the real null test. */
298 tree zero = cp_convert (TREE_TYPE (expr), integer_zero_node);
299 null_test = fold (build2 (NE_EXPR, boolean_type_node,
303 /* If this is a simple base reference, express it as a COMPONENT_REF. */
304 if (code == PLUS_EXPR && !virtual_access
305 /* We don't build base fields for empty bases, and they aren't very
306 interesting to the optimizers anyway. */
309 expr = build_indirect_ref (expr, NULL);
310 expr = build_simple_base_path (expr, binfo);
312 expr = build_address (expr);
313 target_type = TREE_TYPE (expr);
319 /* Going via virtual base V_BINFO. We need the static offset
320 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
321 V_BINFO. That offset is an entry in D_BINFO's vtable. */
324 if (fixed_type_p < 0 && in_base_initializer)
326 /* In a base member initializer, we cannot rely on
327 the vtable being set up. We have to use the vtt_parm. */
328 tree derived = BINFO_INHERITANCE_CHAIN (v_binfo);
331 t = TREE_TYPE (TYPE_VFIELD (BINFO_TYPE (derived)));
332 t = build_pointer_type (t);
333 v_offset = convert (t, current_vtt_parm);
334 v_offset = build2 (PLUS_EXPR, t, v_offset,
335 BINFO_VPTR_INDEX (derived));
336 v_offset = build_indirect_ref (v_offset, NULL);
339 v_offset = build_vfield_ref (build_indirect_ref (expr, NULL),
340 TREE_TYPE (TREE_TYPE (expr)));
342 v_offset = build2 (PLUS_EXPR, TREE_TYPE (v_offset),
343 v_offset, BINFO_VPTR_FIELD (v_binfo));
344 v_offset = build1 (NOP_EXPR,
345 build_pointer_type (ptrdiff_type_node),
347 v_offset = build_indirect_ref (v_offset, NULL);
348 TREE_CONSTANT (v_offset) = 1;
349 TREE_INVARIANT (v_offset) = 1;
351 offset = convert_to_integer (ptrdiff_type_node,
353 BINFO_OFFSET (v_binfo)));
355 if (!integer_zerop (offset))
356 v_offset = build2 (code, ptrdiff_type_node, v_offset, offset);
358 if (fixed_type_p < 0)
359 /* Negative fixed_type_p means this is a constructor or destructor;
360 virtual base layout is fixed in in-charge [cd]tors, but not in
362 offset = build3 (COND_EXPR, ptrdiff_type_node,
363 build2 (EQ_EXPR, boolean_type_node,
364 current_in_charge_parm, integer_zero_node),
366 BINFO_OFFSET (binfo));
371 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
373 target_type = cp_build_qualified_type
374 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
375 ptr_target_type = build_pointer_type (target_type);
377 target_type = ptr_target_type;
379 expr = build1 (NOP_EXPR, ptr_target_type, expr);
381 if (!integer_zerop (offset))
382 expr = build2 (code, ptr_target_type, expr, offset);
387 expr = build_indirect_ref (expr, NULL);
391 expr = fold (build3 (COND_EXPR, target_type, null_test, expr,
392 fold (build1 (NOP_EXPR, target_type,
393 integer_zero_node))));
398 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
399 Perform a derived-to-base conversion by recursively building up a
400 sequence of COMPONENT_REFs to the appropriate base fields. */
403 build_simple_base_path (tree expr, tree binfo)
405 tree type = BINFO_TYPE (binfo);
406 tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
409 if (d_binfo == NULL_TREE)
411 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type);
416 expr = build_simple_base_path (expr, d_binfo);
418 for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo));
419 field; field = TREE_CHAIN (field))
420 /* Is this the base field created by build_base_field? */
421 if (TREE_CODE (field) == FIELD_DECL
422 && DECL_FIELD_IS_BASE (field)
423 && TREE_TYPE (field) == type)
424 return build_class_member_access_expr (expr, field,
427 /* Didn't find the base field?!? */
431 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
432 type is a class type or a pointer to a class type. In the former
433 case, TYPE is also a class type; in the latter it is another
434 pointer type. If CHECK_ACCESS is true, an error message is emitted
435 if TYPE is inaccessible. If OBJECT has pointer type, the value is
436 assumed to be non-NULL. */
439 convert_to_base (tree object, tree type, bool check_access, bool nonnull)
444 if (TYPE_PTR_P (TREE_TYPE (object)))
446 object_type = TREE_TYPE (TREE_TYPE (object));
447 type = TREE_TYPE (type);
450 object_type = TREE_TYPE (object);
452 binfo = lookup_base (object_type, type,
453 check_access ? ba_check : ba_unique,
455 if (!binfo || binfo == error_mark_node)
456 return error_mark_node;
458 return build_base_path (PLUS_EXPR, object, binfo, nonnull);
461 /* EXPR is an expression with unqualified class type. BASE is a base
462 binfo of that class type. Returns EXPR, converted to the BASE
463 type. This function assumes that EXPR is the most derived class;
464 therefore virtual bases can be found at their static offsets. */
467 convert_to_base_statically (tree expr, tree base)
471 expr_type = TREE_TYPE (expr);
472 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type))
476 pointer_type = build_pointer_type (expr_type);
477 expr = build_unary_op (ADDR_EXPR, expr, /*noconvert=*/1);
478 if (!integer_zerop (BINFO_OFFSET (base)))
479 expr = build2 (PLUS_EXPR, pointer_type, expr,
480 build_nop (pointer_type, BINFO_OFFSET (base)));
481 expr = build_nop (build_pointer_type (BINFO_TYPE (base)), expr);
482 expr = build1 (INDIRECT_REF, BINFO_TYPE (base), expr);
490 build_vfield_ref (tree datum, tree type)
492 tree vfield, vcontext;
494 if (datum == error_mark_node)
495 return error_mark_node;
497 /* First, convert to the requested type. */
498 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
499 datum = convert_to_base (datum, type, /*check_access=*/false,
502 /* Second, the requested type may not be the owner of its own vptr.
503 If not, convert to the base class that owns it. We cannot use
504 convert_to_base here, because VCONTEXT may appear more than once
505 in the inheritance hierarchy of TYPE, and thus direct conversion
506 between the types may be ambiguous. Following the path back up
507 one step at a time via primary bases avoids the problem. */
508 vfield = TYPE_VFIELD (type);
509 vcontext = DECL_CONTEXT (vfield);
510 while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type))
512 datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type));
513 type = TREE_TYPE (datum);
516 return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE);
519 /* Given an object INSTANCE, return an expression which yields the
520 vtable element corresponding to INDEX. There are many special
521 cases for INSTANCE which we take care of here, mainly to avoid
522 creating extra tree nodes when we don't have to. */
525 build_vtbl_ref_1 (tree instance, tree idx)
528 tree vtbl = NULL_TREE;
530 /* Try to figure out what a reference refers to, and
531 access its virtual function table directly. */
534 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
536 tree basetype = non_reference (TREE_TYPE (instance));
538 if (fixed_type && !cdtorp)
540 tree binfo = lookup_base (fixed_type, basetype,
541 ba_unique | ba_quiet, NULL);
543 vtbl = unshare_expr (BINFO_VTABLE (binfo));
547 vtbl = build_vfield_ref (instance, basetype);
549 assemble_external (vtbl);
551 aref = build_array_ref (vtbl, idx);
552 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
553 TREE_INVARIANT (aref) = TREE_CONSTANT (aref);
559 build_vtbl_ref (tree instance, tree idx)
561 tree aref = build_vtbl_ref_1 (instance, idx);
566 /* Given a stable object pointer INSTANCE_PTR, return an expression which
567 yields a function pointer corresponding to vtable element INDEX. */
570 build_vfn_ref (tree instance_ptr, tree idx)
574 aref = build_vtbl_ref_1 (build_indirect_ref (instance_ptr, 0), idx);
576 /* When using function descriptors, the address of the
577 vtable entry is treated as a function pointer. */
578 if (TARGET_VTABLE_USES_DESCRIPTORS)
579 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
580 build_unary_op (ADDR_EXPR, aref, /*noconvert=*/1));
582 /* Remember this as a method reference, for later devirtualization. */
583 aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx);
588 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
589 for the given TYPE. */
592 get_vtable_name (tree type)
594 return mangle_vtbl_for_type (type);
597 /* Return an IDENTIFIER_NODE for the name of the virtual table table
601 get_vtt_name (tree type)
603 return mangle_vtt_for_type (type);
606 /* DECL is an entity associated with TYPE, like a virtual table or an
607 implicitly generated constructor. Determine whether or not DECL
608 should have external or internal linkage at the object file
609 level. This routine does not deal with COMDAT linkage and other
610 similar complexities; it simply sets TREE_PUBLIC if it possible for
611 entities in other translation units to contain copies of DECL, in
615 set_linkage_according_to_type (tree type, tree decl)
617 /* If TYPE involves a local class in a function with internal
618 linkage, then DECL should have internal linkage too. Other local
619 classes have no linkage -- but if their containing functions
620 have external linkage, it makes sense for DECL to have external
621 linkage too. That will allow template definitions to be merged,
623 if (no_linkage_check (type, /*relaxed_p=*/true))
625 TREE_PUBLIC (decl) = 0;
626 DECL_INTERFACE_KNOWN (decl) = 1;
629 TREE_PUBLIC (decl) = 1;
632 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
633 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
634 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
637 build_vtable (tree class_type, tree name, tree vtable_type)
641 decl = build_lang_decl (VAR_DECL, name, vtable_type);
642 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
643 now to avoid confusion in mangle_decl. */
644 SET_DECL_ASSEMBLER_NAME (decl, name);
645 DECL_CONTEXT (decl) = class_type;
646 DECL_ARTIFICIAL (decl) = 1;
647 TREE_STATIC (decl) = 1;
648 TREE_READONLY (decl) = 1;
649 DECL_VIRTUAL_P (decl) = 1;
650 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
651 DECL_VTABLE_OR_VTT_P (decl) = 1;
652 /* At one time the vtable info was grabbed 2 words at a time. This
653 fails on sparc unless you have 8-byte alignment. (tiemann) */
654 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
656 set_linkage_according_to_type (class_type, decl);
657 /* The vtable has not been defined -- yet. */
658 DECL_EXTERNAL (decl) = 1;
659 DECL_NOT_REALLY_EXTERN (decl) = 1;
661 /* Mark the VAR_DECL node representing the vtable itself as a
662 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
663 is rather important that such things be ignored because any
664 effort to actually generate DWARF for them will run into
665 trouble when/if we encounter code like:
668 struct S { virtual void member (); };
670 because the artificial declaration of the vtable itself (as
671 manufactured by the g++ front end) will say that the vtable is
672 a static member of `S' but only *after* the debug output for
673 the definition of `S' has already been output. This causes
674 grief because the DWARF entry for the definition of the vtable
675 will try to refer back to an earlier *declaration* of the
676 vtable as a static member of `S' and there won't be one. We
677 might be able to arrange to have the "vtable static member"
678 attached to the member list for `S' before the debug info for
679 `S' get written (which would solve the problem) but that would
680 require more intrusive changes to the g++ front end. */
681 DECL_IGNORED_P (decl) = 1;
686 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
687 or even complete. If this does not exist, create it. If COMPLETE is
688 nonzero, then complete the definition of it -- that will render it
689 impossible to actually build the vtable, but is useful to get at those
690 which are known to exist in the runtime. */
693 get_vtable_decl (tree type, int complete)
697 if (CLASSTYPE_VTABLES (type))
698 return CLASSTYPE_VTABLES (type);
700 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
701 CLASSTYPE_VTABLES (type) = decl;
705 DECL_EXTERNAL (decl) = 1;
706 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
712 /* Build the primary virtual function table for TYPE. If BINFO is
713 non-NULL, build the vtable starting with the initial approximation
714 that it is the same as the one which is the head of the association
715 list. Returns a nonzero value if a new vtable is actually
719 build_primary_vtable (tree binfo, tree type)
724 decl = get_vtable_decl (type, /*complete=*/0);
728 if (BINFO_NEW_VTABLE_MARKED (binfo))
729 /* We have already created a vtable for this base, so there's
730 no need to do it again. */
733 virtuals = copy_list (BINFO_VIRTUALS (binfo));
734 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
735 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
736 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
740 gcc_assert (TREE_TYPE (decl) == vtbl_type_node);
741 virtuals = NULL_TREE;
744 #ifdef GATHER_STATISTICS
746 n_vtable_elems += list_length (virtuals);
749 /* Initialize the association list for this type, based
750 on our first approximation. */
751 BINFO_VTABLE (TYPE_BINFO (type)) = decl;
752 BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals;
753 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
757 /* Give BINFO a new virtual function table which is initialized
758 with a skeleton-copy of its original initialization. The only
759 entry that changes is the `delta' entry, so we can really
760 share a lot of structure.
762 FOR_TYPE is the most derived type which caused this table to
765 Returns nonzero if we haven't met BINFO before.
767 The order in which vtables are built (by calling this function) for
768 an object must remain the same, otherwise a binary incompatibility
772 build_secondary_vtable (tree binfo)
774 if (BINFO_NEW_VTABLE_MARKED (binfo))
775 /* We already created a vtable for this base. There's no need to
779 /* Remember that we've created a vtable for this BINFO, so that we
780 don't try to do so again. */
781 SET_BINFO_NEW_VTABLE_MARKED (binfo);
783 /* Make fresh virtual list, so we can smash it later. */
784 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
786 /* Secondary vtables are laid out as part of the same structure as
787 the primary vtable. */
788 BINFO_VTABLE (binfo) = NULL_TREE;
792 /* Create a new vtable for BINFO which is the hierarchy dominated by
793 T. Return nonzero if we actually created a new vtable. */
796 make_new_vtable (tree t, tree binfo)
798 if (binfo == TYPE_BINFO (t))
799 /* In this case, it is *type*'s vtable we are modifying. We start
800 with the approximation that its vtable is that of the
801 immediate base class. */
802 return build_primary_vtable (binfo, t);
804 /* This is our very own copy of `basetype' to play with. Later,
805 we will fill in all the virtual functions that override the
806 virtual functions in these base classes which are not defined
807 by the current type. */
808 return build_secondary_vtable (binfo);
811 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
812 (which is in the hierarchy dominated by T) list FNDECL as its
813 BV_FN. DELTA is the required constant adjustment from the `this'
814 pointer where the vtable entry appears to the `this' required when
815 the function is actually called. */
818 modify_vtable_entry (tree t,
828 if (fndecl != BV_FN (v)
829 || !tree_int_cst_equal (delta, BV_DELTA (v)))
831 /* We need a new vtable for BINFO. */
832 if (make_new_vtable (t, binfo))
834 /* If we really did make a new vtable, we also made a copy
835 of the BINFO_VIRTUALS list. Now, we have to find the
836 corresponding entry in that list. */
837 *virtuals = BINFO_VIRTUALS (binfo);
838 while (BV_FN (*virtuals) != BV_FN (v))
839 *virtuals = TREE_CHAIN (*virtuals);
843 BV_DELTA (v) = delta;
844 BV_VCALL_INDEX (v) = NULL_TREE;
850 /* Add method METHOD to class TYPE. */
853 add_method (tree type, tree method)
858 bool template_conv_p = false;
860 VEC(tree) *method_vec;
862 bool insert_p = false;
865 if (method == error_mark_node)
868 complete_p = COMPLETE_TYPE_P (type);
869 using = (DECL_CONTEXT (method) != type);
870 conv_p = DECL_CONV_FN_P (method);
872 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
873 && DECL_TEMPLATE_CONV_FN_P (method));
875 method_vec = CLASSTYPE_METHOD_VEC (type);
878 /* Make a new method vector. We start with 8 entries. We must
879 allocate at least two (for constructors and destructors), and
880 we're going to end up with an assignment operator at some
882 method_vec = VEC_alloc (tree, 8);
883 /* Create slots for constructors and destructors. */
884 VEC_quick_push (tree, method_vec, NULL_TREE);
885 VEC_quick_push (tree, method_vec, NULL_TREE);
886 CLASSTYPE_METHOD_VEC (type) = method_vec;
889 /* Constructors and destructors go in special slots. */
890 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
891 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
892 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
894 slot = CLASSTYPE_DESTRUCTOR_SLOT;
896 if (TYPE_FOR_JAVA (type))
898 if (!DECL_ARTIFICIAL (method))
899 error ("Java class %qT cannot have a destructor", type);
900 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
901 error ("Java class %qT cannot have an implicit non-trivial "
911 /* See if we already have an entry with this name. */
912 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
913 VEC_iterate (tree, method_vec, slot, m);
919 if (TREE_CODE (m) == TEMPLATE_DECL
920 && DECL_TEMPLATE_CONV_FN_P (m))
924 if (conv_p && !DECL_CONV_FN_P (m))
926 if (DECL_NAME (m) == DECL_NAME (method))
932 && !DECL_CONV_FN_P (m)
933 && DECL_NAME (m) > DECL_NAME (method))
937 current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot);
939 if (processing_template_decl)
940 /* TYPE is a template class. Don't issue any errors now; wait
941 until instantiation time to complain. */
947 /* Check to see if we've already got this method. */
948 for (fns = current_fns; fns; fns = OVL_NEXT (fns))
950 tree fn = OVL_CURRENT (fns);
955 if (TREE_CODE (fn) != TREE_CODE (method))
958 /* [over.load] Member function declarations with the
959 same name and the same parameter types cannot be
960 overloaded if any of them is a static member
961 function declaration.
963 [namespace.udecl] When a using-declaration brings names
964 from a base class into a derived class scope, member
965 functions in the derived class override and/or hide member
966 functions with the same name and parameter types in a base
967 class (rather than conflicting). */
968 parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn));
969 parms2 = TYPE_ARG_TYPES (TREE_TYPE (method));
971 /* Compare the quals on the 'this' parm. Don't compare
972 the whole types, as used functions are treated as
973 coming from the using class in overload resolution. */
974 if (! DECL_STATIC_FUNCTION_P (fn)
975 && ! DECL_STATIC_FUNCTION_P (method)
976 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1)))
977 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2)))))
980 /* For templates, the template parms must be identical. */
981 if (TREE_CODE (fn) == TEMPLATE_DECL
982 && !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
983 DECL_TEMPLATE_PARMS (method)))
986 if (! DECL_STATIC_FUNCTION_P (fn))
987 parms1 = TREE_CHAIN (parms1);
988 if (! DECL_STATIC_FUNCTION_P (method))
989 parms2 = TREE_CHAIN (parms2);
991 if (same && compparms (parms1, parms2)
992 && (!DECL_CONV_FN_P (fn)
993 || same_type_p (TREE_TYPE (TREE_TYPE (fn)),
994 TREE_TYPE (TREE_TYPE (method)))))
996 if (using && DECL_CONTEXT (fn) == type)
997 /* Defer to the local function. */
1001 cp_error_at ("%q#D and %q#D cannot be overloaded",
1004 /* We don't call duplicate_decls here to merge
1005 the declarations because that will confuse
1006 things if the methods have inline
1007 definitions. In particular, we will crash
1008 while processing the definitions. */
1015 /* Add the new binding. */
1016 overload = build_overload (method, current_fns);
1018 if (!conv_p && slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p)
1019 push_class_level_binding (DECL_NAME (method), overload);
1023 /* We only expect to add few methods in the COMPLETE_P case, so
1024 just make room for one more method in that case. */
1025 if (VEC_reserve (tree, method_vec, complete_p ? 1 : -1))
1026 CLASSTYPE_METHOD_VEC (type) = method_vec;
1027 if (slot == VEC_length (tree, method_vec))
1028 VEC_quick_push (tree, method_vec, overload);
1030 VEC_quick_insert (tree, method_vec, slot, overload);
1033 /* Replace the current slot. */
1034 VEC_replace (tree, method_vec, slot, overload);
1037 /* Subroutines of finish_struct. */
1039 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1040 legit, otherwise return 0. */
1043 alter_access (tree t, tree fdecl, tree access)
1047 if (!DECL_LANG_SPECIFIC (fdecl))
1048 retrofit_lang_decl (fdecl);
1050 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl));
1052 elem = purpose_member (t, DECL_ACCESS (fdecl));
1055 if (TREE_VALUE (elem) != access)
1057 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1058 cp_error_at ("conflicting access specifications for method"
1059 " %qD, ignored", TREE_TYPE (fdecl));
1061 error ("conflicting access specifications for field %qE, ignored",
1066 /* They're changing the access to the same thing they changed
1067 it to before. That's OK. */
1073 perform_or_defer_access_check (TYPE_BINFO (t), fdecl);
1074 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1080 /* Process the USING_DECL, which is a member of T. */
1083 handle_using_decl (tree using_decl, tree t)
1085 tree ctype = DECL_INITIAL (using_decl);
1086 tree name = DECL_NAME (using_decl);
1088 = TREE_PRIVATE (using_decl) ? access_private_node
1089 : TREE_PROTECTED (using_decl) ? access_protected_node
1090 : access_public_node;
1092 tree flist = NULL_TREE;
1095 if (ctype == error_mark_node)
1098 binfo = lookup_base (t, ctype, ba_any, NULL);
1101 location_t saved_loc = input_location;
1103 input_location = DECL_SOURCE_LOCATION (using_decl);
1104 error_not_base_type (ctype, t);
1105 input_location = saved_loc;
1109 if (constructor_name_p (name, ctype))
1111 cp_error_at ("%qD names constructor", using_decl);
1114 if (constructor_name_p (name, t))
1116 cp_error_at ("%qD invalid in %qT", using_decl, t);
1120 fdecl = lookup_member (binfo, name, 0, false);
1124 cp_error_at ("no members matching %qD in %q#T", using_decl, ctype);
1128 if (BASELINK_P (fdecl))
1129 /* Ignore base type this came from. */
1130 fdecl = BASELINK_FUNCTIONS (fdecl);
1132 old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false);
1135 if (is_overloaded_fn (old_value))
1136 old_value = OVL_CURRENT (old_value);
1138 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1141 old_value = NULL_TREE;
1144 if (is_overloaded_fn (fdecl))
1149 else if (is_overloaded_fn (old_value))
1152 /* It's OK to use functions from a base when there are functions with
1153 the same name already present in the current class. */;
1156 cp_error_at ("%qD invalid in %q#T", using_decl, t);
1157 cp_error_at (" because of local method %q#D with same name",
1158 OVL_CURRENT (old_value));
1162 else if (!DECL_ARTIFICIAL (old_value))
1164 cp_error_at ("%qD invalid in %q#T", using_decl, t);
1165 cp_error_at (" because of local member %q#D with same name", old_value);
1169 /* Make type T see field decl FDECL with access ACCESS. */
1171 for (; flist; flist = OVL_NEXT (flist))
1173 add_method (t, OVL_CURRENT (flist));
1174 alter_access (t, OVL_CURRENT (flist), access);
1177 alter_access (t, fdecl, access);
1180 /* Run through the base classes of T, updating
1181 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1182 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1186 check_bases (tree t,
1187 int* cant_have_default_ctor_p,
1188 int* cant_have_const_ctor_p,
1189 int* no_const_asn_ref_p)
1192 int seen_non_virtual_nearly_empty_base_p;
1196 seen_non_virtual_nearly_empty_base_p = 0;
1198 for (binfo = TYPE_BINFO (t), i = 0;
1199 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1201 tree basetype = TREE_TYPE (base_binfo);
1203 gcc_assert (COMPLETE_TYPE_P (basetype));
1205 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1206 here because the case of virtual functions but non-virtual
1207 dtor is handled in finish_struct_1. */
1208 if (warn_ecpp && ! TYPE_POLYMORPHIC_P (basetype))
1209 warning ("base class %q#T has a non-virtual destructor", basetype);
1211 /* If the base class doesn't have copy constructors or
1212 assignment operators that take const references, then the
1213 derived class cannot have such a member automatically
1215 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1216 *cant_have_const_ctor_p = 1;
1217 if (TYPE_HAS_ASSIGN_REF (basetype)
1218 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1219 *no_const_asn_ref_p = 1;
1220 /* Similarly, if the base class doesn't have a default
1221 constructor, then the derived class won't have an
1222 automatically generated default constructor. */
1223 if (TYPE_HAS_CONSTRUCTOR (basetype)
1224 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype))
1226 *cant_have_default_ctor_p = 1;
1227 if (! TYPE_HAS_CONSTRUCTOR (t))
1228 pedwarn ("base %qT with only non-default constructor in class "
1229 "without a constructor",
1233 if (BINFO_VIRTUAL_P (base_binfo))
1234 /* A virtual base does not effect nearly emptiness. */
1236 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1238 if (seen_non_virtual_nearly_empty_base_p)
1239 /* And if there is more than one nearly empty base, then the
1240 derived class is not nearly empty either. */
1241 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1243 /* Remember we've seen one. */
1244 seen_non_virtual_nearly_empty_base_p = 1;
1246 else if (!is_empty_class (basetype))
1247 /* If the base class is not empty or nearly empty, then this
1248 class cannot be nearly empty. */
1249 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1251 /* A lot of properties from the bases also apply to the derived
1253 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1254 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1255 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1256 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1257 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1258 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1259 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1260 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1261 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1265 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1266 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1267 that have had a nearly-empty virtual primary base stolen by some
1268 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1272 determine_primary_bases (tree t)
1275 tree primary = NULL_TREE;
1276 tree type_binfo = TYPE_BINFO (t);
1279 /* Determine the primary bases of our bases. */
1280 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1281 base_binfo = TREE_CHAIN (base_binfo))
1283 tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo));
1285 /* See if we're the non-virtual primary of our inheritance
1287 if (!BINFO_VIRTUAL_P (base_binfo))
1289 tree parent = BINFO_INHERITANCE_CHAIN (base_binfo);
1290 tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent));
1293 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
1294 BINFO_TYPE (parent_primary)))
1295 /* We are the primary binfo. */
1296 BINFO_PRIMARY_P (base_binfo) = 1;
1298 /* Determine if we have a virtual primary base, and mark it so.
1300 if (primary && BINFO_VIRTUAL_P (primary))
1302 tree this_primary = copied_binfo (primary, base_binfo);
1304 if (BINFO_PRIMARY_P (this_primary))
1305 /* Someone already claimed this base. */
1306 BINFO_LOST_PRIMARY_P (base_binfo) = 1;
1311 BINFO_PRIMARY_P (this_primary) = 1;
1312 BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo;
1314 /* A virtual binfo might have been copied from within
1315 another hierarchy. As we're about to use it as a
1316 primary base, make sure the offsets match. */
1317 delta = size_diffop (convert (ssizetype,
1318 BINFO_OFFSET (base_binfo)),
1320 BINFO_OFFSET (this_primary)));
1322 propagate_binfo_offsets (this_primary, delta);
1327 /* First look for a dynamic direct non-virtual base. */
1328 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++)
1330 tree basetype = BINFO_TYPE (base_binfo);
1332 if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo))
1334 primary = base_binfo;
1339 /* A "nearly-empty" virtual base class can be the primary base
1340 class, if no non-virtual polymorphic base can be found. Look for
1341 a nearly-empty virtual dynamic base that is not already a primary
1342 base of something in the hierarchy. If there is no such base,
1343 just pick the first nearly-empty virtual base. */
1345 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1346 base_binfo = TREE_CHAIN (base_binfo))
1347 if (BINFO_VIRTUAL_P (base_binfo)
1348 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo)))
1350 if (!BINFO_PRIMARY_P (base_binfo))
1352 /* Found one that is not primary. */
1353 primary = base_binfo;
1357 /* Remember the first candidate. */
1358 primary = base_binfo;
1362 /* If we've got a primary base, use it. */
1365 tree basetype = BINFO_TYPE (primary);
1367 CLASSTYPE_PRIMARY_BINFO (t) = primary;
1368 if (BINFO_PRIMARY_P (primary))
1369 /* We are stealing a primary base. */
1370 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1;
1371 BINFO_PRIMARY_P (primary) = 1;
1372 if (BINFO_VIRTUAL_P (primary))
1376 BINFO_INHERITANCE_CHAIN (primary) = type_binfo;
1377 /* A virtual binfo might have been copied from within
1378 another hierarchy. As we're about to use it as a primary
1379 base, make sure the offsets match. */
1380 delta = size_diffop (ssize_int (0),
1381 convert (ssizetype, BINFO_OFFSET (primary)));
1383 propagate_binfo_offsets (primary, delta);
1386 primary = TYPE_BINFO (basetype);
1388 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1389 BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary);
1390 BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary);
1394 /* Set memoizing fields and bits of T (and its variants) for later
1398 finish_struct_bits (tree t)
1402 /* Fix up variants (if any). */
1403 for (variants = TYPE_NEXT_VARIANT (t);
1405 variants = TYPE_NEXT_VARIANT (variants))
1407 /* These fields are in the _TYPE part of the node, not in
1408 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1409 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1410 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1411 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1412 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1414 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1416 TYPE_BINFO (variants) = TYPE_BINFO (t);
1418 /* Copy whatever these are holding today. */
1419 TYPE_VFIELD (variants) = TYPE_VFIELD (t);
1420 TYPE_METHODS (variants) = TYPE_METHODS (t);
1421 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1422 TYPE_SIZE (variants) = TYPE_SIZE (t);
1423 TYPE_SIZE_UNIT (variants) = TYPE_SIZE_UNIT (t);
1426 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t))
1427 /* For a class w/o baseclasses, 'finish_struct' has set
1428 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1429 Similarly for a class whose base classes do not have vtables.
1430 When neither of these is true, we might have removed abstract
1431 virtuals (by providing a definition), added some (by declaring
1432 new ones), or redeclared ones from a base class. We need to
1433 recalculate what's really an abstract virtual at this point (by
1434 looking in the vtables). */
1435 get_pure_virtuals (t);
1437 /* If this type has a copy constructor or a destructor, force its
1438 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1439 nonzero. This will cause it to be passed by invisible reference
1440 and prevent it from being returned in a register. */
1441 if (! TYPE_HAS_TRIVIAL_INIT_REF (t) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1444 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1445 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1447 TYPE_MODE (variants) = BLKmode;
1448 TREE_ADDRESSABLE (variants) = 1;
1453 /* Issue warnings about T having private constructors, but no friends,
1456 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1457 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1458 non-private static member functions. */
1461 maybe_warn_about_overly_private_class (tree t)
1463 int has_member_fn = 0;
1464 int has_nonprivate_method = 0;
1467 if (!warn_ctor_dtor_privacy
1468 /* If the class has friends, those entities might create and
1469 access instances, so we should not warn. */
1470 || (CLASSTYPE_FRIEND_CLASSES (t)
1471 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1472 /* We will have warned when the template was declared; there's
1473 no need to warn on every instantiation. */
1474 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1475 /* There's no reason to even consider warning about this
1479 /* We only issue one warning, if more than one applies, because
1480 otherwise, on code like:
1483 // Oops - forgot `public:'
1489 we warn several times about essentially the same problem. */
1491 /* Check to see if all (non-constructor, non-destructor) member
1492 functions are private. (Since there are no friends or
1493 non-private statics, we can't ever call any of the private member
1495 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1496 /* We're not interested in compiler-generated methods; they don't
1497 provide any way to call private members. */
1498 if (!DECL_ARTIFICIAL (fn))
1500 if (!TREE_PRIVATE (fn))
1502 if (DECL_STATIC_FUNCTION_P (fn))
1503 /* A non-private static member function is just like a
1504 friend; it can create and invoke private member
1505 functions, and be accessed without a class
1509 has_nonprivate_method = 1;
1510 /* Keep searching for a static member function. */
1512 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1516 if (!has_nonprivate_method && has_member_fn)
1518 /* There are no non-private methods, and there's at least one
1519 private member function that isn't a constructor or
1520 destructor. (If all the private members are
1521 constructors/destructors we want to use the code below that
1522 issues error messages specifically referring to
1523 constructors/destructors.) */
1525 tree binfo = TYPE_BINFO (t);
1527 for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++)
1528 if (BINFO_BASE_ACCESS (binfo, i) != access_private_node)
1530 has_nonprivate_method = 1;
1533 if (!has_nonprivate_method)
1535 warning ("all member functions in class %qT are private", t);
1540 /* Even if some of the member functions are non-private, the class
1541 won't be useful for much if all the constructors or destructors
1542 are private: such an object can never be created or destroyed. */
1543 fn = CLASSTYPE_DESTRUCTORS (t);
1544 if (fn && TREE_PRIVATE (fn))
1546 warning ("%q#T only defines a private destructor and has no friends",
1551 if (TYPE_HAS_CONSTRUCTOR (t))
1553 int nonprivate_ctor = 0;
1555 /* If a non-template class does not define a copy
1556 constructor, one is defined for it, enabling it to avoid
1557 this warning. For a template class, this does not
1558 happen, and so we would normally get a warning on:
1560 template <class T> class C { private: C(); };
1562 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1563 complete non-template or fully instantiated classes have this
1565 if (!TYPE_HAS_INIT_REF (t))
1566 nonprivate_ctor = 1;
1568 for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn))
1570 tree ctor = OVL_CURRENT (fn);
1571 /* Ideally, we wouldn't count copy constructors (or, in
1572 fact, any constructor that takes an argument of the
1573 class type as a parameter) because such things cannot
1574 be used to construct an instance of the class unless
1575 you already have one. But, for now at least, we're
1577 if (! TREE_PRIVATE (ctor))
1579 nonprivate_ctor = 1;
1584 if (nonprivate_ctor == 0)
1586 warning ("%q#T only defines private constructors and has no friends",
1594 gt_pointer_operator new_value;
1598 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1601 method_name_cmp (const void* m1_p, const void* m2_p)
1603 const tree *const m1 = m1_p;
1604 const tree *const m2 = m2_p;
1606 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1608 if (*m1 == NULL_TREE)
1610 if (*m2 == NULL_TREE)
1612 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1617 /* This routine compares two fields like method_name_cmp but using the
1618 pointer operator in resort_field_decl_data. */
1621 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1623 const tree *const m1 = m1_p;
1624 const tree *const m2 = m2_p;
1625 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1627 if (*m1 == NULL_TREE)
1629 if (*m2 == NULL_TREE)
1632 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1633 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1634 resort_data.new_value (&d1, resort_data.cookie);
1635 resort_data.new_value (&d2, resort_data.cookie);
1642 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1645 resort_type_method_vec (void* obj,
1646 void* orig_obj ATTRIBUTE_UNUSED ,
1647 gt_pointer_operator new_value,
1650 VEC(tree) *method_vec = (VEC(tree) *) obj;
1651 int len = VEC_length (tree, method_vec);
1655 /* The type conversion ops have to live at the front of the vec, so we
1657 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1658 VEC_iterate (tree, method_vec, slot, fn);
1660 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1665 resort_data.new_value = new_value;
1666 resort_data.cookie = cookie;
1667 qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree),
1668 resort_method_name_cmp);
1672 /* Warn about duplicate methods in fn_fields.
1674 Sort methods that are not special (i.e., constructors, destructors,
1675 and type conversion operators) so that we can find them faster in
1679 finish_struct_methods (tree t)
1682 VEC(tree) *method_vec;
1685 method_vec = CLASSTYPE_METHOD_VEC (t);
1689 len = VEC_length (tree, method_vec);
1691 /* Clear DECL_IN_AGGR_P for all functions. */
1692 for (fn_fields = TYPE_METHODS (t); fn_fields;
1693 fn_fields = TREE_CHAIN (fn_fields))
1694 DECL_IN_AGGR_P (fn_fields) = 0;
1696 /* Issue warnings about private constructors and such. If there are
1697 no methods, then some public defaults are generated. */
1698 maybe_warn_about_overly_private_class (t);
1700 /* The type conversion ops have to live at the front of the vec, so we
1702 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1703 VEC_iterate (tree, method_vec, slot, fn_fields);
1705 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields)))
1708 qsort (VEC_address (tree, method_vec) + slot,
1709 len-slot, sizeof (tree), method_name_cmp);
1712 /* Make BINFO's vtable have N entries, including RTTI entries,
1713 vbase and vcall offsets, etc. Set its type and call the backend
1717 layout_vtable_decl (tree binfo, int n)
1722 atype = build_cplus_array_type (vtable_entry_type,
1723 build_index_type (size_int (n - 1)));
1724 layout_type (atype);
1726 /* We may have to grow the vtable. */
1727 vtable = get_vtbl_decl_for_binfo (binfo);
1728 if (!same_type_p (TREE_TYPE (vtable), atype))
1730 TREE_TYPE (vtable) = atype;
1731 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
1732 layout_decl (vtable, 0);
1736 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1737 have the same signature. */
1740 same_signature_p (tree fndecl, tree base_fndecl)
1742 /* One destructor overrides another if they are the same kind of
1744 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
1745 && special_function_p (base_fndecl) == special_function_p (fndecl))
1747 /* But a non-destructor never overrides a destructor, nor vice
1748 versa, nor do different kinds of destructors override
1749 one-another. For example, a complete object destructor does not
1750 override a deleting destructor. */
1751 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
1754 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
1755 || (DECL_CONV_FN_P (fndecl)
1756 && DECL_CONV_FN_P (base_fndecl)
1757 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
1758 DECL_CONV_FN_TYPE (base_fndecl))))
1760 tree types, base_types;
1761 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1762 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
1763 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
1764 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
1765 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
1771 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1775 base_derived_from (tree derived, tree base)
1779 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1781 if (probe == derived)
1783 else if (BINFO_VIRTUAL_P (probe))
1784 /* If we meet a virtual base, we can't follow the inheritance
1785 any more. See if the complete type of DERIVED contains
1786 such a virtual base. */
1787 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived))
1793 typedef struct find_final_overrider_data_s {
1794 /* The function for which we are trying to find a final overrider. */
1796 /* The base class in which the function was declared. */
1797 tree declaring_base;
1798 /* The candidate overriders. */
1800 /* Path to most derived. */
1802 } find_final_overrider_data;
1804 /* Add the overrider along the current path to FFOD->CANDIDATES.
1805 Returns true if an overrider was found; false otherwise. */
1808 dfs_find_final_overrider_1 (tree binfo,
1809 find_final_overrider_data *ffod,
1814 /* If BINFO is not the most derived type, try a more derived class.
1815 A definition there will overrider a definition here. */
1819 if (dfs_find_final_overrider_1
1820 (VEC_index (tree, ffod->path, depth), ffod, depth))
1824 method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn);
1827 tree *candidate = &ffod->candidates;
1829 /* Remove any candidates overridden by this new function. */
1832 /* If *CANDIDATE overrides METHOD, then METHOD
1833 cannot override anything else on the list. */
1834 if (base_derived_from (TREE_VALUE (*candidate), binfo))
1836 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1837 if (base_derived_from (binfo, TREE_VALUE (*candidate)))
1838 *candidate = TREE_CHAIN (*candidate);
1840 candidate = &TREE_CHAIN (*candidate);
1843 /* Add the new function. */
1844 ffod->candidates = tree_cons (method, binfo, ffod->candidates);
1851 /* Called from find_final_overrider via dfs_walk. */
1854 dfs_find_final_overrider_pre (tree binfo, void *data)
1856 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1858 if (binfo == ffod->declaring_base)
1859 dfs_find_final_overrider_1 (binfo, ffod, VEC_length (tree, ffod->path));
1860 VEC_safe_push (tree, ffod->path, binfo);
1866 dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED, void *data)
1868 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1869 VEC_pop (tree, ffod->path);
1874 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1875 FN and whose TREE_VALUE is the binfo for the base where the
1876 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1877 DERIVED) is the base object in which FN is declared. */
1880 find_final_overrider (tree derived, tree binfo, tree fn)
1882 find_final_overrider_data ffod;
1884 /* Getting this right is a little tricky. This is valid:
1886 struct S { virtual void f (); };
1887 struct T { virtual void f (); };
1888 struct U : public S, public T { };
1890 even though calling `f' in `U' is ambiguous. But,
1892 struct R { virtual void f(); };
1893 struct S : virtual public R { virtual void f (); };
1894 struct T : virtual public R { virtual void f (); };
1895 struct U : public S, public T { };
1897 is not -- there's no way to decide whether to put `S::f' or
1898 `T::f' in the vtable for `R'.
1900 The solution is to look at all paths to BINFO. If we find
1901 different overriders along any two, then there is a problem. */
1902 if (DECL_THUNK_P (fn))
1903 fn = THUNK_TARGET (fn);
1905 /* Determine the depth of the hierarchy. */
1907 ffod.declaring_base = binfo;
1908 ffod.candidates = NULL_TREE;
1909 ffod.path = VEC_alloc (tree, 30);
1911 dfs_walk_all (derived, dfs_find_final_overrider_pre,
1912 dfs_find_final_overrider_post, &ffod);
1914 VEC_free (tree, ffod.path);
1916 /* If there was no winner, issue an error message. */
1917 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
1919 error ("no unique final overrider for %qD in %qT", fn,
1920 BINFO_TYPE (derived));
1921 return error_mark_node;
1924 return ffod.candidates;
1927 /* Return the index of the vcall offset for FN when TYPE is used as a
1931 get_vcall_index (tree fn, tree type)
1933 VEC (tree_pair_s) *indices = CLASSTYPE_VCALL_INDICES (type);
1937 for (ix = 0; VEC_iterate (tree_pair_s, indices, ix, p); ix++)
1938 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose))
1939 || same_signature_p (fn, p->purpose))
1942 /* There should always be an appropriate index. */
1946 /* Update an entry in the vtable for BINFO, which is in the hierarchy
1947 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
1948 corresponding position in the BINFO_VIRTUALS list. */
1951 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
1959 tree overrider_fn, overrider_target;
1960 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
1961 tree over_return, base_return;
1964 /* Find the nearest primary base (possibly binfo itself) which defines
1965 this function; this is the class the caller will convert to when
1966 calling FN through BINFO. */
1967 for (b = binfo; ; b = get_primary_binfo (b))
1970 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
1973 /* The nearest definition is from a lost primary. */
1974 if (BINFO_LOST_PRIMARY_P (b))
1979 /* Find the final overrider. */
1980 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
1981 if (overrider == error_mark_node)
1983 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
1985 /* Check for adjusting covariant return types. */
1986 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
1987 base_return = TREE_TYPE (TREE_TYPE (target_fn));
1989 if (POINTER_TYPE_P (over_return)
1990 && TREE_CODE (over_return) == TREE_CODE (base_return)
1991 && CLASS_TYPE_P (TREE_TYPE (over_return))
1992 && CLASS_TYPE_P (TREE_TYPE (base_return)))
1994 /* If FN is a covariant thunk, we must figure out the adjustment
1995 to the final base FN was converting to. As OVERRIDER_TARGET might
1996 also be converting to the return type of FN, we have to
1997 combine the two conversions here. */
1998 tree fixed_offset, virtual_offset;
2000 if (DECL_THUNK_P (fn))
2002 gcc_assert (DECL_RESULT_THUNK_P (fn));
2003 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
2004 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2007 fixed_offset = virtual_offset = NULL_TREE;
2010 /* Find the equivalent binfo within the return type of the
2011 overriding function. We will want the vbase offset from
2013 virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset),
2014 TREE_TYPE (over_return));
2015 else if (!same_type_p (TREE_TYPE (over_return),
2016 TREE_TYPE (base_return)))
2018 /* There was no existing virtual thunk (which takes
2023 thunk_binfo = lookup_base (TREE_TYPE (over_return),
2024 TREE_TYPE (base_return),
2025 ba_check | ba_quiet, &kind);
2027 if (thunk_binfo && (kind == bk_via_virtual
2028 || !BINFO_OFFSET_ZEROP (thunk_binfo)))
2030 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2032 if (kind == bk_via_virtual)
2034 /* We convert via virtual base. Find the virtual
2035 base and adjust the fixed offset to be from there. */
2036 while (!BINFO_VIRTUAL_P (thunk_binfo))
2037 thunk_binfo = BINFO_INHERITANCE_CHAIN (thunk_binfo);
2039 virtual_offset = thunk_binfo;
2040 offset = size_diffop
2042 (ssizetype, BINFO_OFFSET (virtual_offset)));
2045 /* There was an existing fixed offset, this must be
2046 from the base just converted to, and the base the
2047 FN was thunking to. */
2048 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2050 fixed_offset = offset;
2054 if (fixed_offset || virtual_offset)
2055 /* Replace the overriding function with a covariant thunk. We
2056 will emit the overriding function in its own slot as
2058 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2059 fixed_offset, virtual_offset);
2062 gcc_assert (!DECL_THUNK_P (fn));
2064 /* Assume that we will produce a thunk that convert all the way to
2065 the final overrider, and not to an intermediate virtual base. */
2066 virtual_base = NULL_TREE;
2068 /* See if we can convert to an intermediate virtual base first, and then
2069 use the vcall offset located there to finish the conversion. */
2070 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2072 /* If we find the final overrider, then we can stop
2074 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b),
2075 BINFO_TYPE (TREE_VALUE (overrider))))
2078 /* If we find a virtual base, and we haven't yet found the
2079 overrider, then there is a virtual base between the
2080 declaring base (first_defn) and the final overrider. */
2081 if (BINFO_VIRTUAL_P (b))
2088 if (overrider_fn != overrider_target && !virtual_base)
2090 /* The ABI specifies that a covariant thunk includes a mangling
2091 for a this pointer adjustment. This-adjusting thunks that
2092 override a function from a virtual base have a vcall
2093 adjustment. When the virtual base in question is a primary
2094 virtual base, we know the adjustments are zero, (and in the
2095 non-covariant case, we would not use the thunk).
2096 Unfortunately we didn't notice this could happen, when
2097 designing the ABI and so never mandated that such a covariant
2098 thunk should be emitted. Because we must use the ABI mandated
2099 name, we must continue searching from the binfo where we
2100 found the most recent definition of the function, towards the
2101 primary binfo which first introduced the function into the
2102 vtable. If that enters a virtual base, we must use a vcall
2103 this-adjusting thunk. Bleah! */
2104 tree probe = first_defn;
2106 while ((probe = get_primary_binfo (probe))
2107 && (unsigned) list_length (BINFO_VIRTUALS (probe)) > ix)
2108 if (BINFO_VIRTUAL_P (probe))
2109 virtual_base = probe;
2112 /* Even if we find a virtual base, the correct delta is
2113 between the overrider and the binfo we're building a vtable
2115 goto virtual_covariant;
2118 /* Compute the constant adjustment to the `this' pointer. The
2119 `this' pointer, when this function is called, will point at BINFO
2120 (or one of its primary bases, which are at the same offset). */
2122 /* The `this' pointer needs to be adjusted from the declaration to
2123 the nearest virtual base. */
2124 delta = size_diffop (convert (ssizetype, BINFO_OFFSET (virtual_base)),
2125 convert (ssizetype, BINFO_OFFSET (first_defn)));
2127 /* If the nearest definition is in a lost primary, we don't need an
2128 entry in our vtable. Except possibly in a constructor vtable,
2129 if we happen to get our primary back. In that case, the offset
2130 will be zero, as it will be a primary base. */
2131 delta = size_zero_node;
2133 /* The `this' pointer needs to be adjusted from pointing to
2134 BINFO to pointing at the base where the final overrider
2137 delta = size_diffop (convert (ssizetype,
2138 BINFO_OFFSET (TREE_VALUE (overrider))),
2139 convert (ssizetype, BINFO_OFFSET (binfo)));
2141 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2144 BV_VCALL_INDEX (*virtuals)
2145 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2147 BV_VCALL_INDEX (*virtuals) = NULL_TREE;
2150 /* Called from modify_all_vtables via dfs_walk. */
2153 dfs_modify_vtables (tree binfo, void* data)
2155 tree t = (tree) data;
2160 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2161 /* A base without a vtable needs no modification, and its bases
2162 are uninteresting. */
2163 return dfs_skip_bases;
2165 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)
2166 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
2167 /* Don't do the primary vtable, if it's new. */
2170 if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo))
2171 /* There's no need to modify the vtable for a non-virtual primary
2172 base; we're not going to use that vtable anyhow. We do still
2173 need to do this for virtual primary bases, as they could become
2174 non-primary in a construction vtable. */
2177 make_new_vtable (t, binfo);
2179 /* Now, go through each of the virtual functions in the virtual
2180 function table for BINFO. Find the final overrider, and update
2181 the BINFO_VIRTUALS list appropriately. */
2182 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2183 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2185 ix++, virtuals = TREE_CHAIN (virtuals),
2186 old_virtuals = TREE_CHAIN (old_virtuals))
2187 update_vtable_entry_for_fn (t,
2189 BV_FN (old_virtuals),
2195 /* Update all of the primary and secondary vtables for T. Create new
2196 vtables as required, and initialize their RTTI information. Each
2197 of the functions in VIRTUALS is declared in T and may override a
2198 virtual function from a base class; find and modify the appropriate
2199 entries to point to the overriding functions. Returns a list, in
2200 declaration order, of the virtual functions that are declared in T,
2201 but do not appear in the primary base class vtable, and which
2202 should therefore be appended to the end of the vtable for T. */
2205 modify_all_vtables (tree t, tree virtuals)
2207 tree binfo = TYPE_BINFO (t);
2210 /* Update all of the vtables. */
2211 dfs_walk_once (binfo, dfs_modify_vtables, NULL, t);
2213 /* Add virtual functions not already in our primary vtable. These
2214 will be both those introduced by this class, and those overridden
2215 from secondary bases. It does not include virtuals merely
2216 inherited from secondary bases. */
2217 for (fnsp = &virtuals; *fnsp; )
2219 tree fn = TREE_VALUE (*fnsp);
2221 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2222 || DECL_VINDEX (fn) == error_mark_node)
2224 /* We don't need to adjust the `this' pointer when
2225 calling this function. */
2226 BV_DELTA (*fnsp) = integer_zero_node;
2227 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2229 /* This is a function not already in our vtable. Keep it. */
2230 fnsp = &TREE_CHAIN (*fnsp);
2233 /* We've already got an entry for this function. Skip it. */
2234 *fnsp = TREE_CHAIN (*fnsp);
2240 /* Get the base virtual function declarations in T that have the
2244 get_basefndecls (tree name, tree t)
2247 tree base_fndecls = NULL_TREE;
2248 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
2251 /* Find virtual functions in T with the indicated NAME. */
2252 i = lookup_fnfields_1 (t, name);
2254 for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i);
2256 methods = OVL_NEXT (methods))
2258 tree method = OVL_CURRENT (methods);
2260 if (TREE_CODE (method) == FUNCTION_DECL
2261 && DECL_VINDEX (method))
2262 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2266 return base_fndecls;
2268 for (i = 0; i < n_baseclasses; i++)
2270 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i));
2271 base_fndecls = chainon (get_basefndecls (name, basetype),
2275 return base_fndecls;
2278 /* If this declaration supersedes the declaration of
2279 a method declared virtual in the base class, then
2280 mark this field as being virtual as well. */
2283 check_for_override (tree decl, tree ctype)
2285 if (TREE_CODE (decl) == TEMPLATE_DECL)
2286 /* In [temp.mem] we have:
2288 A specialization of a member function template does not
2289 override a virtual function from a base class. */
2291 if ((DECL_DESTRUCTOR_P (decl)
2292 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2293 || DECL_CONV_FN_P (decl))
2294 && look_for_overrides (ctype, decl)
2295 && !DECL_STATIC_FUNCTION_P (decl))
2296 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2297 the error_mark_node so that we know it is an overriding
2299 DECL_VINDEX (decl) = decl;
2301 if (DECL_VIRTUAL_P (decl))
2303 if (!DECL_VINDEX (decl))
2304 DECL_VINDEX (decl) = error_mark_node;
2305 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2309 /* Warn about hidden virtual functions that are not overridden in t.
2310 We know that constructors and destructors don't apply. */
2313 warn_hidden (tree t)
2315 VEC(tree) *method_vec = CLASSTYPE_METHOD_VEC (t);
2319 /* We go through each separately named virtual function. */
2320 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2321 VEC_iterate (tree, method_vec, i, fns);
2332 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2333 have the same name. Figure out what name that is. */
2334 name = DECL_NAME (OVL_CURRENT (fns));
2335 /* There are no possibly hidden functions yet. */
2336 base_fndecls = NULL_TREE;
2337 /* Iterate through all of the base classes looking for possibly
2338 hidden functions. */
2339 for (binfo = TYPE_BINFO (t), j = 0;
2340 BINFO_BASE_ITERATE (binfo, j, base_binfo); j++)
2342 tree basetype = BINFO_TYPE (base_binfo);
2343 base_fndecls = chainon (get_basefndecls (name, basetype),
2347 /* If there are no functions to hide, continue. */
2351 /* Remove any overridden functions. */
2352 for (fn = fns; fn; fn = OVL_NEXT (fn))
2354 fndecl = OVL_CURRENT (fn);
2355 if (DECL_VINDEX (fndecl))
2357 tree *prev = &base_fndecls;
2360 /* If the method from the base class has the same
2361 signature as the method from the derived class, it
2362 has been overridden. */
2363 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2364 *prev = TREE_CHAIN (*prev);
2366 prev = &TREE_CHAIN (*prev);
2370 /* Now give a warning for all base functions without overriders,
2371 as they are hidden. */
2372 while (base_fndecls)
2374 /* Here we know it is a hider, and no overrider exists. */
2375 cp_warning_at ("%qD was hidden", TREE_VALUE (base_fndecls));
2376 cp_warning_at (" by %qD", fns);
2377 base_fndecls = TREE_CHAIN (base_fndecls);
2382 /* Check for things that are invalid. There are probably plenty of other
2383 things we should check for also. */
2386 finish_struct_anon (tree t)
2390 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2392 if (TREE_STATIC (field))
2394 if (TREE_CODE (field) != FIELD_DECL)
2397 if (DECL_NAME (field) == NULL_TREE
2398 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2400 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2401 for (; elt; elt = TREE_CHAIN (elt))
2403 /* We're generally only interested in entities the user
2404 declared, but we also find nested classes by noticing
2405 the TYPE_DECL that we create implicitly. You're
2406 allowed to put one anonymous union inside another,
2407 though, so we explicitly tolerate that. We use
2408 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2409 we also allow unnamed types used for defining fields. */
2410 if (DECL_ARTIFICIAL (elt)
2411 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2412 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2415 if (TREE_CODE (elt) != FIELD_DECL)
2417 cp_pedwarn_at ("%q#D invalid; an anonymous union can "
2418 "only have non-static data members",
2423 if (TREE_PRIVATE (elt))
2424 cp_pedwarn_at ("private member %q#D in anonymous union",
2426 else if (TREE_PROTECTED (elt))
2427 cp_pedwarn_at ("protected member %q#D in anonymous union",
2430 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2431 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2437 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2438 will be used later during class template instantiation.
2439 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2440 a non-static member data (FIELD_DECL), a member function
2441 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2442 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2443 When FRIEND_P is nonzero, T is either a friend class
2444 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2445 (FUNCTION_DECL, TEMPLATE_DECL). */
2448 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2450 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2451 if (CLASSTYPE_TEMPLATE_INFO (type))
2452 CLASSTYPE_DECL_LIST (type)
2453 = tree_cons (friend_p ? NULL_TREE : type,
2454 t, CLASSTYPE_DECL_LIST (type));
2457 /* Create default constructors, assignment operators, and so forth for
2458 the type indicated by T, if they are needed.
2459 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
2460 CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, the
2461 class cannot have a default constructor, copy constructor taking a
2462 const reference argument, or an assignment operator taking a const
2463 reference, respectively. */
2466 add_implicitly_declared_members (tree t,
2467 int cant_have_default_ctor,
2468 int cant_have_const_cctor,
2469 int cant_have_const_assignment)
2472 if (!CLASSTYPE_DESTRUCTORS (t))
2474 /* In general, we create destructors lazily. */
2475 CLASSTYPE_LAZY_DESTRUCTOR (t) = 1;
2476 /* However, if the implicit destructor is non-trivial
2477 destructor, we sometimes have to create it at this point. */
2478 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
2482 if (TYPE_FOR_JAVA (t))
2483 /* If this a Java class, any non-trivial destructor is
2484 invalid, even if compiler-generated. Therefore, if the
2485 destructor is non-trivial we create it now. */
2493 /* If the implicit destructor will be virtual, then we must
2494 generate it now because (unfortunately) we do not
2495 generate virtual tables lazily. */
2496 binfo = TYPE_BINFO (t);
2497 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
2502 base_type = BINFO_TYPE (base_binfo);
2503 dtor = CLASSTYPE_DESTRUCTORS (base_type);
2504 if (dtor && DECL_VIRTUAL_P (dtor))
2512 /* If we can't get away with being lazy, generate the destructor
2515 lazily_declare_fn (sfk_destructor, t);
2519 /* Default constructor. */
2520 if (! TYPE_HAS_CONSTRUCTOR (t) && ! cant_have_default_ctor)
2522 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1;
2523 CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1;
2526 /* Copy constructor. */
2527 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
2529 TYPE_HAS_INIT_REF (t) = 1;
2530 TYPE_HAS_CONST_INIT_REF (t) = !cant_have_const_cctor;
2531 CLASSTYPE_LAZY_COPY_CTOR (t) = 1;
2532 TYPE_HAS_CONSTRUCTOR (t) = 1;
2535 /* If there is no assignment operator, one will be created if and
2536 when it is needed. For now, just record whether or not the type
2537 of the parameter to the assignment operator will be a const or
2538 non-const reference. */
2539 if (!TYPE_HAS_ASSIGN_REF (t) && !TYPE_FOR_JAVA (t))
2541 TYPE_HAS_ASSIGN_REF (t) = 1;
2542 TYPE_HAS_CONST_ASSIGN_REF (t) = !cant_have_const_assignment;
2543 CLASSTYPE_LAZY_ASSIGNMENT_OP (t) = 1;
2547 /* Subroutine of finish_struct_1. Recursively count the number of fields
2548 in TYPE, including anonymous union members. */
2551 count_fields (tree fields)
2555 for (x = fields; x; x = TREE_CHAIN (x))
2557 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2558 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2565 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2566 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2569 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
2572 for (x = fields; x; x = TREE_CHAIN (x))
2574 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2575 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
2577 field_vec->elts[idx++] = x;
2582 /* FIELD is a bit-field. We are finishing the processing for its
2583 enclosing type. Issue any appropriate messages and set appropriate
2587 check_bitfield_decl (tree field)
2589 tree type = TREE_TYPE (field);
2592 /* Detect invalid bit-field type. */
2593 if (DECL_INITIAL (field)
2594 && ! INTEGRAL_TYPE_P (TREE_TYPE (field)))
2596 cp_error_at ("bit-field %q#D with non-integral type", field);
2597 w = error_mark_node;
2600 /* Detect and ignore out of range field width. */
2601 if (DECL_INITIAL (field))
2603 w = DECL_INITIAL (field);
2605 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2608 /* detect invalid field size. */
2609 w = integral_constant_value (w);
2611 if (TREE_CODE (w) != INTEGER_CST)
2613 cp_error_at ("bit-field %qD width not an integer constant",
2615 w = error_mark_node;
2617 else if (tree_int_cst_sgn (w) < 0)
2619 cp_error_at ("negative width in bit-field %qD", field);
2620 w = error_mark_node;
2622 else if (integer_zerop (w) && DECL_NAME (field) != 0)
2624 cp_error_at ("zero width for bit-field %qD", field);
2625 w = error_mark_node;
2627 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
2628 && TREE_CODE (type) != ENUMERAL_TYPE
2629 && TREE_CODE (type) != BOOLEAN_TYPE)
2630 cp_warning_at ("width of %qD exceeds its type", field);
2631 else if (TREE_CODE (type) == ENUMERAL_TYPE
2632 && (0 > compare_tree_int (w,
2633 min_precision (TYPE_MIN_VALUE (type),
2634 TYPE_UNSIGNED (type)))
2635 || 0 > compare_tree_int (w,
2637 (TYPE_MAX_VALUE (type),
2638 TYPE_UNSIGNED (type)))))
2639 cp_warning_at ("%qD is too small to hold all values of %q#T",
2643 /* Remove the bit-field width indicator so that the rest of the
2644 compiler does not treat that value as an initializer. */
2645 DECL_INITIAL (field) = NULL_TREE;
2647 if (w != error_mark_node)
2649 DECL_SIZE (field) = convert (bitsizetype, w);
2650 DECL_BIT_FIELD (field) = 1;
2654 /* Non-bit-fields are aligned for their type. */
2655 DECL_BIT_FIELD (field) = 0;
2656 CLEAR_DECL_C_BIT_FIELD (field);
2660 /* FIELD is a non bit-field. We are finishing the processing for its
2661 enclosing type T. Issue any appropriate messages and set appropriate
2665 check_field_decl (tree field,
2667 int* cant_have_const_ctor,
2668 int* cant_have_default_ctor,
2669 int* no_const_asn_ref,
2670 int* any_default_members)
2672 tree type = strip_array_types (TREE_TYPE (field));
2674 /* An anonymous union cannot contain any fields which would change
2675 the settings of CANT_HAVE_CONST_CTOR and friends. */
2676 if (ANON_UNION_TYPE_P (type))
2678 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2679 structs. So, we recurse through their fields here. */
2680 else if (ANON_AGGR_TYPE_P (type))
2684 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2685 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
2686 check_field_decl (fields, t, cant_have_const_ctor,
2687 cant_have_default_ctor, no_const_asn_ref,
2688 any_default_members);
2690 /* Check members with class type for constructors, destructors,
2692 else if (CLASS_TYPE_P (type))
2694 /* Never let anything with uninheritable virtuals
2695 make it through without complaint. */
2696 abstract_virtuals_error (field, type);
2698 if (TREE_CODE (t) == UNION_TYPE)
2700 if (TYPE_NEEDS_CONSTRUCTING (type))
2701 cp_error_at ("member %q#D with constructor not allowed in union",
2703 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
2704 cp_error_at ("member %q#D with destructor not allowed in union",
2706 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2707 cp_error_at ("member %q#D with copy assignment operator not allowed in union",
2712 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
2713 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2714 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
2715 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
2716 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
2719 if (!TYPE_HAS_CONST_INIT_REF (type))
2720 *cant_have_const_ctor = 1;
2722 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
2723 *no_const_asn_ref = 1;
2725 if (TYPE_HAS_CONSTRUCTOR (type)
2726 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2727 *cant_have_default_ctor = 1;
2729 if (DECL_INITIAL (field) != NULL_TREE)
2731 /* `build_class_init_list' does not recognize
2733 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
2734 error ("multiple fields in union %qT initialized", t);
2735 *any_default_members = 1;
2739 /* Check the data members (both static and non-static), class-scoped
2740 typedefs, etc., appearing in the declaration of T. Issue
2741 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2742 declaration order) of access declarations; each TREE_VALUE in this
2743 list is a USING_DECL.
2745 In addition, set the following flags:
2748 The class is empty, i.e., contains no non-static data members.
2750 CANT_HAVE_DEFAULT_CTOR_P
2751 This class cannot have an implicitly generated default
2754 CANT_HAVE_CONST_CTOR_P
2755 This class cannot have an implicitly generated copy constructor
2756 taking a const reference.
2758 CANT_HAVE_CONST_ASN_REF
2759 This class cannot have an implicitly generated assignment
2760 operator taking a const reference.
2762 All of these flags should be initialized before calling this
2765 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2766 fields can be added by adding to this chain. */
2769 check_field_decls (tree t, tree *access_decls,
2770 int *cant_have_default_ctor_p,
2771 int *cant_have_const_ctor_p,
2772 int *no_const_asn_ref_p)
2777 int any_default_members;
2779 /* Assume there are no access declarations. */
2780 *access_decls = NULL_TREE;
2781 /* Assume this class has no pointer members. */
2782 has_pointers = false;
2783 /* Assume none of the members of this class have default
2785 any_default_members = 0;
2787 for (field = &TYPE_FIELDS (t); *field; field = next)
2790 tree type = TREE_TYPE (x);
2792 next = &TREE_CHAIN (x);
2794 if (TREE_CODE (x) == FIELD_DECL)
2796 if (TYPE_PACKED (t))
2798 if (!pod_type_p (TREE_TYPE (x)) && !TYPE_PACKED (TREE_TYPE (x)))
2800 ("ignoring packed attribute on unpacked non-POD field %q#D",
2803 DECL_PACKED (x) = 1;
2806 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
2807 /* We don't treat zero-width bitfields as making a class
2814 /* The class is non-empty. */
2815 CLASSTYPE_EMPTY_P (t) = 0;
2816 /* The class is not even nearly empty. */
2817 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
2818 /* If one of the data members contains an empty class,
2820 element_type = strip_array_types (type);
2821 if (CLASS_TYPE_P (element_type)
2822 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
2823 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
2827 if (TREE_CODE (x) == USING_DECL)
2829 /* Prune the access declaration from the list of fields. */
2830 *field = TREE_CHAIN (x);
2832 /* Save the access declarations for our caller. */
2833 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
2835 /* Since we've reset *FIELD there's no reason to skip to the
2841 if (TREE_CODE (x) == TYPE_DECL
2842 || TREE_CODE (x) == TEMPLATE_DECL)
2845 /* If we've gotten this far, it's a data member, possibly static,
2846 or an enumerator. */
2847 DECL_CONTEXT (x) = t;
2849 /* When this goes into scope, it will be a non-local reference. */
2850 DECL_NONLOCAL (x) = 1;
2852 if (TREE_CODE (t) == UNION_TYPE)
2856 If a union contains a static data member, or a member of
2857 reference type, the program is ill-formed. */
2858 if (TREE_CODE (x) == VAR_DECL)
2860 cp_error_at ("%qD may not be static because it is a member of a union", x);
2863 if (TREE_CODE (type) == REFERENCE_TYPE)
2865 cp_error_at ("%qD may not have reference type %qT because"
2866 " it is a member of a union",
2872 /* ``A local class cannot have static data members.'' ARM 9.4 */
2873 if (current_function_decl && TREE_STATIC (x))
2874 cp_error_at ("field %qD in local class cannot be static", x);
2876 /* Perform error checking that did not get done in
2878 if (TREE_CODE (type) == FUNCTION_TYPE)
2880 cp_error_at ("field %qD invalidly declared function type", x);
2881 type = build_pointer_type (type);
2882 TREE_TYPE (x) = type;
2884 else if (TREE_CODE (type) == METHOD_TYPE)
2886 cp_error_at ("field %qD invalidly declared method type", x);
2887 type = build_pointer_type (type);
2888 TREE_TYPE (x) = type;
2891 if (type == error_mark_node)
2894 if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL)
2897 /* Now it can only be a FIELD_DECL. */
2899 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
2900 CLASSTYPE_NON_AGGREGATE (t) = 1;
2902 /* If this is of reference type, check if it needs an init.
2903 Also do a little ANSI jig if necessary. */
2904 if (TREE_CODE (type) == REFERENCE_TYPE)
2906 CLASSTYPE_NON_POD_P (t) = 1;
2907 if (DECL_INITIAL (x) == NULL_TREE)
2908 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2910 /* ARM $12.6.2: [A member initializer list] (or, for an
2911 aggregate, initialization by a brace-enclosed list) is the
2912 only way to initialize nonstatic const and reference
2914 *cant_have_default_ctor_p = 1;
2915 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2917 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2919 cp_warning_at ("non-static reference %q#D in class without a constructor", x);
2922 type = strip_array_types (type);
2924 /* This is used by -Weffc++ (see below). Warn only for pointers
2925 to members which might hold dynamic memory. So do not warn
2926 for pointers to functions or pointers to members. */
2927 if (TYPE_PTR_P (type)
2928 && !TYPE_PTRFN_P (type)
2929 && !TYPE_PTR_TO_MEMBER_P (type))
2930 has_pointers = true;
2932 if (CLASS_TYPE_P (type))
2934 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type))
2935 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
2936 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type))
2937 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2940 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
2941 CLASSTYPE_HAS_MUTABLE (t) = 1;
2943 if (! pod_type_p (type))
2944 /* DR 148 now allows pointers to members (which are POD themselves),
2945 to be allowed in POD structs. */
2946 CLASSTYPE_NON_POD_P (t) = 1;
2948 if (! zero_init_p (type))
2949 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
2951 /* If any field is const, the structure type is pseudo-const. */
2952 if (CP_TYPE_CONST_P (type))
2954 C_TYPE_FIELDS_READONLY (t) = 1;
2955 if (DECL_INITIAL (x) == NULL_TREE)
2956 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
2958 /* ARM $12.6.2: [A member initializer list] (or, for an
2959 aggregate, initialization by a brace-enclosed list) is the
2960 only way to initialize nonstatic const and reference
2962 *cant_have_default_ctor_p = 1;
2963 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
2965 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
2967 cp_warning_at ("non-static const member %q#D in class without a constructor", x);
2969 /* A field that is pseudo-const makes the structure likewise. */
2970 else if (CLASS_TYPE_P (type))
2972 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
2973 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
2974 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
2975 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
2978 /* Core issue 80: A nonstatic data member is required to have a
2979 different name from the class iff the class has a
2980 user-defined constructor. */
2981 if (constructor_name_p (DECL_NAME (x), t) && TYPE_HAS_CONSTRUCTOR (t))
2982 cp_pedwarn_at ("field %q#D with same name as class", x);
2984 /* We set DECL_C_BIT_FIELD in grokbitfield.
2985 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
2986 if (DECL_C_BIT_FIELD (x))
2987 check_bitfield_decl (x);
2989 check_field_decl (x, t,
2990 cant_have_const_ctor_p,
2991 cant_have_default_ctor_p,
2993 &any_default_members);
2996 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
2997 it should also define a copy constructor and an assignment operator to
2998 implement the correct copy semantic (deep vs shallow, etc.). As it is
2999 not feasible to check whether the constructors do allocate dynamic memory
3000 and store it within members, we approximate the warning like this:
3002 -- Warn only if there are members which are pointers
3003 -- Warn only if there is a non-trivial constructor (otherwise,
3004 there cannot be memory allocated).
3005 -- Warn only if there is a non-trivial destructor. We assume that the
3006 user at least implemented the cleanup correctly, and a destructor
3007 is needed to free dynamic memory.
3009 This seems enough for practical purposes. */
3012 && TYPE_HAS_CONSTRUCTOR (t)
3013 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3014 && !(TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3016 warning ("%q#T has pointer data members", t);
3018 if (! TYPE_HAS_INIT_REF (t))
3020 warning (" but does not override %<%T(const %T&)%>", t, t);
3021 if (! TYPE_HAS_ASSIGN_REF (t))
3022 warning (" or %<operator=(const %T&)%>", t);
3024 else if (! TYPE_HAS_ASSIGN_REF (t))
3025 warning (" but does not override %<operator=(const %T&)%>", t);
3029 /* Check anonymous struct/anonymous union fields. */
3030 finish_struct_anon (t);
3032 /* We've built up the list of access declarations in reverse order.
3034 *access_decls = nreverse (*access_decls);
3037 /* If TYPE is an empty class type, records its OFFSET in the table of
3041 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3045 if (!is_empty_class (type))
3048 /* Record the location of this empty object in OFFSETS. */
3049 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3051 n = splay_tree_insert (offsets,
3052 (splay_tree_key) offset,
3053 (splay_tree_value) NULL_TREE);
3054 n->value = ((splay_tree_value)
3055 tree_cons (NULL_TREE,
3062 /* Returns nonzero if TYPE is an empty class type and there is
3063 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3066 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3071 if (!is_empty_class (type))
3074 /* Record the location of this empty object in OFFSETS. */
3075 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3079 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3080 if (same_type_p (TREE_VALUE (t), type))
3086 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3087 F for every subobject, passing it the type, offset, and table of
3088 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3091 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3092 than MAX_OFFSET will not be walked.
3094 If F returns a nonzero value, the traversal ceases, and that value
3095 is returned. Otherwise, returns zero. */
3098 walk_subobject_offsets (tree type,
3099 subobject_offset_fn f,
3106 tree type_binfo = NULL_TREE;
3108 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3110 if (max_offset && INT_CST_LT (max_offset, offset))
3115 if (abi_version_at_least (2))
3117 type = BINFO_TYPE (type);
3120 if (CLASS_TYPE_P (type))
3126 /* Avoid recursing into objects that are not interesting. */
3127 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3130 /* Record the location of TYPE. */
3131 r = (*f) (type, offset, offsets);
3135 /* Iterate through the direct base classes of TYPE. */
3137 type_binfo = TYPE_BINFO (type);
3138 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++)
3142 if (abi_version_at_least (2)
3143 && BINFO_VIRTUAL_P (binfo))
3147 && BINFO_VIRTUAL_P (binfo)
3148 && !BINFO_PRIMARY_P (binfo))
3151 if (!abi_version_at_least (2))
3152 binfo_offset = size_binop (PLUS_EXPR,
3154 BINFO_OFFSET (binfo));
3158 /* We cannot rely on BINFO_OFFSET being set for the base
3159 class yet, but the offsets for direct non-virtual
3160 bases can be calculated by going back to the TYPE. */
3161 orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i);
3162 binfo_offset = size_binop (PLUS_EXPR,
3164 BINFO_OFFSET (orig_binfo));
3167 r = walk_subobject_offsets (binfo,
3172 (abi_version_at_least (2)
3173 ? /*vbases_p=*/0 : vbases_p));
3178 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type))
3183 /* Iterate through the virtual base classes of TYPE. In G++
3184 3.2, we included virtual bases in the direct base class
3185 loop above, which results in incorrect results; the
3186 correct offsets for virtual bases are only known when
3187 working with the most derived type. */
3189 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
3190 VEC_iterate (tree, vbases, ix, binfo); ix++)
3192 r = walk_subobject_offsets (binfo,
3194 size_binop (PLUS_EXPR,
3196 BINFO_OFFSET (binfo)),
3205 /* We still have to walk the primary base, if it is
3206 virtual. (If it is non-virtual, then it was walked
3208 tree vbase = get_primary_binfo (type_binfo);
3210 if (vbase && BINFO_VIRTUAL_P (vbase)
3211 && BINFO_PRIMARY_P (vbase)
3212 && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo)
3214 r = (walk_subobject_offsets
3216 offsets, max_offset, /*vbases_p=*/0));
3223 /* Iterate through the fields of TYPE. */
3224 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3225 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3229 if (abi_version_at_least (2))
3230 field_offset = byte_position (field);
3232 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3233 field_offset = DECL_FIELD_OFFSET (field);
3235 r = walk_subobject_offsets (TREE_TYPE (field),
3237 size_binop (PLUS_EXPR,
3247 else if (TREE_CODE (type) == ARRAY_TYPE)
3249 tree element_type = strip_array_types (type);
3250 tree domain = TYPE_DOMAIN (type);
3253 /* Avoid recursing into objects that are not interesting. */
3254 if (!CLASS_TYPE_P (element_type)
3255 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3258 /* Step through each of the elements in the array. */
3259 for (index = size_zero_node;
3260 /* G++ 3.2 had an off-by-one error here. */
3261 (abi_version_at_least (2)
3262 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3263 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3264 index = size_binop (PLUS_EXPR, index, size_one_node))
3266 r = walk_subobject_offsets (TREE_TYPE (type),
3274 offset = size_binop (PLUS_EXPR, offset,
3275 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3276 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3277 there's no point in iterating through the remaining
3278 elements of the array. */
3279 if (max_offset && INT_CST_LT (max_offset, offset))
3287 /* Record all of the empty subobjects of TYPE (located at OFFSET) in
3288 OFFSETS. If VBASES_P is nonzero, virtual bases of TYPE are
3292 record_subobject_offsets (tree type,
3297 walk_subobject_offsets (type, record_subobject_offset, offset,
3298 offsets, /*max_offset=*/NULL_TREE, vbases_p);
3301 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3302 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3303 virtual bases of TYPE are examined. */
3306 layout_conflict_p (tree type,
3311 splay_tree_node max_node;
3313 /* Get the node in OFFSETS that indicates the maximum offset where
3314 an empty subobject is located. */
3315 max_node = splay_tree_max (offsets);
3316 /* If there aren't any empty subobjects, then there's no point in
3317 performing this check. */
3321 return walk_subobject_offsets (type, check_subobject_offset, offset,
3322 offsets, (tree) (max_node->key),
3326 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3327 non-static data member of the type indicated by RLI. BINFO is the
3328 binfo corresponding to the base subobject, OFFSETS maps offsets to
3329 types already located at those offsets. This function determines
3330 the position of the DECL. */
3333 layout_nonempty_base_or_field (record_layout_info rli,
3338 tree offset = NULL_TREE;
3344 /* For the purposes of determining layout conflicts, we want to
3345 use the class type of BINFO; TREE_TYPE (DECL) will be the
3346 CLASSTYPE_AS_BASE version, which does not contain entries for
3347 zero-sized bases. */
3348 type = TREE_TYPE (binfo);
3353 type = TREE_TYPE (decl);
3357 /* Try to place the field. It may take more than one try if we have
3358 a hard time placing the field without putting two objects of the
3359 same type at the same address. */
3362 struct record_layout_info_s old_rli = *rli;
3364 /* Place this field. */
3365 place_field (rli, decl);
3366 offset = byte_position (decl);
3368 /* We have to check to see whether or not there is already
3369 something of the same type at the offset we're about to use.
3370 For example, consider:
3373 struct T : public S { int i; };
3374 struct U : public S, public T {};
3376 Here, we put S at offset zero in U. Then, we can't put T at
3377 offset zero -- its S component would be at the same address
3378 as the S we already allocated. So, we have to skip ahead.
3379 Since all data members, including those whose type is an
3380 empty class, have nonzero size, any overlap can happen only
3381 with a direct or indirect base-class -- it can't happen with
3383 /* In a union, overlap is permitted; all members are placed at
3385 if (TREE_CODE (rli->t) == UNION_TYPE)
3387 /* G++ 3.2 did not check for overlaps when placing a non-empty
3389 if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo))
3391 if (layout_conflict_p (field_p ? type : binfo, offset,
3394 /* Strip off the size allocated to this field. That puts us
3395 at the first place we could have put the field with
3396 proper alignment. */
3399 /* Bump up by the alignment required for the type. */
3401 = size_binop (PLUS_EXPR, rli->bitpos,
3403 ? CLASSTYPE_ALIGN (type)
3404 : TYPE_ALIGN (type)));
3405 normalize_rli (rli);
3408 /* There was no conflict. We're done laying out this field. */
3412 /* Now that we know where it will be placed, update its
3414 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3415 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3416 this point because their BINFO_OFFSET is copied from another
3417 hierarchy. Therefore, we may not need to add the entire
3419 propagate_binfo_offsets (binfo,
3420 size_diffop (convert (ssizetype, offset),
3422 BINFO_OFFSET (binfo))));
3425 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3428 empty_base_at_nonzero_offset_p (tree type,
3430 splay_tree offsets ATTRIBUTE_UNUSED)
3432 return is_empty_class (type) && !integer_zerop (offset);
3435 /* Layout the empty base BINFO. EOC indicates the byte currently just
3436 past the end of the class, and should be correctly aligned for a
3437 class of the type indicated by BINFO; OFFSETS gives the offsets of
3438 the empty bases allocated so far. T is the most derived
3439 type. Return nonzero iff we added it at the end. */
3442 layout_empty_base (tree binfo, tree eoc, splay_tree offsets)
3445 tree basetype = BINFO_TYPE (binfo);
3448 /* This routine should only be used for empty classes. */
3449 gcc_assert (is_empty_class (basetype));
3450 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3452 if (!integer_zerop (BINFO_OFFSET (binfo)))
3454 if (abi_version_at_least (2))
3455 propagate_binfo_offsets
3456 (binfo, size_diffop (size_zero_node, BINFO_OFFSET (binfo)));
3458 warning ("offset of empty base %qT may not be ABI-compliant and may"
3459 "change in a future version of GCC",
3460 BINFO_TYPE (binfo));
3463 /* This is an empty base class. We first try to put it at offset
3465 if (layout_conflict_p (binfo,
3466 BINFO_OFFSET (binfo),
3470 /* That didn't work. Now, we move forward from the next
3471 available spot in the class. */
3473 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3476 if (!layout_conflict_p (binfo,
3477 BINFO_OFFSET (binfo),
3480 /* We finally found a spot where there's no overlap. */
3483 /* There's overlap here, too. Bump along to the next spot. */
3484 propagate_binfo_offsets (binfo, alignment);
3490 /* Layout the the base given by BINFO in the class indicated by RLI.
3491 *BASE_ALIGN is a running maximum of the alignments of
3492 any base class. OFFSETS gives the location of empty base
3493 subobjects. T is the most derived type. Return nonzero if the new
3494 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3495 *NEXT_FIELD, unless BINFO is for an empty base class.
3497 Returns the location at which the next field should be inserted. */
3500 build_base_field (record_layout_info rli, tree binfo,
3501 splay_tree offsets, tree *next_field)
3504 tree basetype = BINFO_TYPE (binfo);
3506 if (!COMPLETE_TYPE_P (basetype))
3507 /* This error is now reported in xref_tag, thus giving better
3508 location information. */
3511 /* Place the base class. */
3512 if (!is_empty_class (basetype))
3516 /* The containing class is non-empty because it has a non-empty
3518 CLASSTYPE_EMPTY_P (t) = 0;
3520 /* Create the FIELD_DECL. */
3521 decl = build_decl (FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
3522 DECL_ARTIFICIAL (decl) = 1;
3523 DECL_IGNORED_P (decl) = 1;
3524 DECL_FIELD_CONTEXT (decl) = t;
3525 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3526 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3527 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3528 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3529 DECL_MODE (decl) = TYPE_MODE (basetype);
3530 DECL_FIELD_IS_BASE (decl) = 1;
3532 /* Try to place the field. It may take more than one try if we
3533 have a hard time placing the field without putting two
3534 objects of the same type at the same address. */
3535 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
3536 /* Add the new FIELD_DECL to the list of fields for T. */
3537 TREE_CHAIN (decl) = *next_field;
3539 next_field = &TREE_CHAIN (decl);
3546 /* On some platforms (ARM), even empty classes will not be
3548 eoc = round_up (rli_size_unit_so_far (rli),
3549 CLASSTYPE_ALIGN_UNIT (basetype));
3550 atend = layout_empty_base (binfo, eoc, offsets);
3551 /* A nearly-empty class "has no proper base class that is empty,
3552 not morally virtual, and at an offset other than zero." */
3553 if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
3556 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3557 /* The check above (used in G++ 3.2) is insufficient because
3558 an empty class placed at offset zero might itself have an
3559 empty base at a nonzero offset. */
3560 else if (walk_subobject_offsets (basetype,
3561 empty_base_at_nonzero_offset_p,
3564 /*max_offset=*/NULL_TREE,
3567 if (abi_version_at_least (2))
3568 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3570 warning ("class %qT will be considered nearly empty in a "
3571 "future version of GCC", t);
3575 /* We do not create a FIELD_DECL for empty base classes because
3576 it might overlap some other field. We want to be able to
3577 create CONSTRUCTORs for the class by iterating over the
3578 FIELD_DECLs, and the back end does not handle overlapping
3581 /* An empty virtual base causes a class to be non-empty
3582 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3583 here because that was already done when the virtual table
3584 pointer was created. */
3587 /* Record the offsets of BINFO and its base subobjects. */
3588 record_subobject_offsets (binfo,
3589 BINFO_OFFSET (binfo),
3596 /* Layout all of the non-virtual base classes. Record empty
3597 subobjects in OFFSETS. T is the most derived type. Return nonzero
3598 if the type cannot be nearly empty. The fields created
3599 corresponding to the base classes will be inserted at
3603 build_base_fields (record_layout_info rli,
3604 splay_tree offsets, tree *next_field)
3606 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3609 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
3612 /* The primary base class is always allocated first. */
3613 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
3614 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
3615 offsets, next_field);
3617 /* Now allocate the rest of the bases. */
3618 for (i = 0; i < n_baseclasses; ++i)
3622 base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
3624 /* The primary base was already allocated above, so we don't
3625 need to allocate it again here. */
3626 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
3629 /* Virtual bases are added at the end (a primary virtual base
3630 will have already been added). */
3631 if (BINFO_VIRTUAL_P (base_binfo))
3634 next_field = build_base_field (rli, base_binfo,
3635 offsets, next_field);
3639 /* Go through the TYPE_METHODS of T issuing any appropriate
3640 diagnostics, figuring out which methods override which other
3641 methods, and so forth. */
3644 check_methods (tree t)
3648 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3650 check_for_override (x, t);
3651 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3652 cp_error_at ("initializer specified for non-virtual method %qD", x);
3653 /* The name of the field is the original field name
3654 Save this in auxiliary field for later overloading. */
3655 if (DECL_VINDEX (x))
3657 TYPE_POLYMORPHIC_P (t) = 1;
3658 if (DECL_PURE_VIRTUAL_P (x))
3659 VEC_safe_push (tree, CLASSTYPE_PURE_VIRTUALS (t), x);
3661 /* All user-declared destructors are non-trivial. */
3662 if (DECL_DESTRUCTOR_P (x))
3663 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1;
3667 /* FN is a constructor or destructor. Clone the declaration to create
3668 a specialized in-charge or not-in-charge version, as indicated by
3672 build_clone (tree fn, tree name)
3677 /* Copy the function. */
3678 clone = copy_decl (fn);
3679 /* Remember where this function came from. */
3680 DECL_CLONED_FUNCTION (clone) = fn;
3681 DECL_ABSTRACT_ORIGIN (clone) = fn;
3682 /* Reset the function name. */
3683 DECL_NAME (clone) = name;
3684 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
3685 /* There's no pending inline data for this function. */
3686 DECL_PENDING_INLINE_INFO (clone) = NULL;
3687 DECL_PENDING_INLINE_P (clone) = 0;
3688 /* And it hasn't yet been deferred. */
3689 DECL_DEFERRED_FN (clone) = 0;
3691 /* The base-class destructor is not virtual. */
3692 if (name == base_dtor_identifier)
3694 DECL_VIRTUAL_P (clone) = 0;
3695 if (TREE_CODE (clone) != TEMPLATE_DECL)
3696 DECL_VINDEX (clone) = NULL_TREE;
3699 /* If there was an in-charge parameter, drop it from the function
3701 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3707 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3708 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3709 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
3710 /* Skip the `this' parameter. */
3711 parmtypes = TREE_CHAIN (parmtypes);
3712 /* Skip the in-charge parameter. */
3713 parmtypes = TREE_CHAIN (parmtypes);
3714 /* And the VTT parm, in a complete [cd]tor. */
3715 if (DECL_HAS_VTT_PARM_P (fn)
3716 && ! DECL_NEEDS_VTT_PARM_P (clone))
3717 parmtypes = TREE_CHAIN (parmtypes);
3718 /* If this is subobject constructor or destructor, add the vtt
3721 = build_method_type_directly (basetype,
3722 TREE_TYPE (TREE_TYPE (clone)),
3725 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
3728 = cp_build_type_attribute_variant (TREE_TYPE (clone),
3729 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
3732 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3733 aren't function parameters; those are the template parameters. */
3734 if (TREE_CODE (clone) != TEMPLATE_DECL)
3736 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
3737 /* Remove the in-charge parameter. */
3738 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3740 TREE_CHAIN (DECL_ARGUMENTS (clone))
3741 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3742 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
3744 /* And the VTT parm, in a complete [cd]tor. */
3745 if (DECL_HAS_VTT_PARM_P (fn))
3747 if (DECL_NEEDS_VTT_PARM_P (clone))
3748 DECL_HAS_VTT_PARM_P (clone) = 1;
3751 TREE_CHAIN (DECL_ARGUMENTS (clone))
3752 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3753 DECL_HAS_VTT_PARM_P (clone) = 0;
3757 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
3759 DECL_CONTEXT (parms) = clone;
3760 cxx_dup_lang_specific_decl (parms);
3764 /* Create the RTL for this function. */
3765 SET_DECL_RTL (clone, NULL_RTX);
3766 rest_of_decl_compilation (clone, /*top_level=*/1, at_eof);
3768 /* Make it easy to find the CLONE given the FN. */
3769 TREE_CHAIN (clone) = TREE_CHAIN (fn);
3770 TREE_CHAIN (fn) = clone;
3772 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3773 if (TREE_CODE (clone) == TEMPLATE_DECL)
3777 DECL_TEMPLATE_RESULT (clone)
3778 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
3779 result = DECL_TEMPLATE_RESULT (clone);
3780 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
3781 DECL_TI_TEMPLATE (result) = clone;
3784 note_decl_for_pch (clone);
3789 /* Produce declarations for all appropriate clones of FN. If
3790 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3791 CLASTYPE_METHOD_VEC as well. */
3794 clone_function_decl (tree fn, int update_method_vec_p)
3798 /* Avoid inappropriate cloning. */
3800 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn)))
3803 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
3805 /* For each constructor, we need two variants: an in-charge version
3806 and a not-in-charge version. */
3807 clone = build_clone (fn, complete_ctor_identifier);
3808 if (update_method_vec_p)
3809 add_method (DECL_CONTEXT (clone), clone);
3810 clone = build_clone (fn, base_ctor_identifier);
3811 if (update_method_vec_p)
3812 add_method (DECL_CONTEXT (clone), clone);
3816 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn));
3818 /* For each destructor, we need three variants: an in-charge
3819 version, a not-in-charge version, and an in-charge deleting
3820 version. We clone the deleting version first because that
3821 means it will go second on the TYPE_METHODS list -- and that
3822 corresponds to the correct layout order in the virtual
3825 For a non-virtual destructor, we do not build a deleting
3827 if (DECL_VIRTUAL_P (fn))
3829 clone = build_clone (fn, deleting_dtor_identifier);
3830 if (update_method_vec_p)
3831 add_method (DECL_CONTEXT (clone), clone);
3833 clone = build_clone (fn, complete_dtor_identifier);
3834 if (update_method_vec_p)
3835 add_method (DECL_CONTEXT (clone), clone);
3836 clone = build_clone (fn, base_dtor_identifier);
3837 if (update_method_vec_p)
3838 add_method (DECL_CONTEXT (clone), clone);
3841 /* Note that this is an abstract function that is never emitted. */
3842 DECL_ABSTRACT (fn) = 1;
3845 /* DECL is an in charge constructor, which is being defined. This will
3846 have had an in class declaration, from whence clones were
3847 declared. An out-of-class definition can specify additional default
3848 arguments. As it is the clones that are involved in overload
3849 resolution, we must propagate the information from the DECL to its
3853 adjust_clone_args (tree decl)
3857 for (clone = TREE_CHAIN (decl); clone && DECL_CLONED_FUNCTION (clone);
3858 clone = TREE_CHAIN (clone))
3860 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
3861 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
3862 tree decl_parms, clone_parms;
3864 clone_parms = orig_clone_parms;
3866 /* Skip the 'this' parameter. */
3867 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
3868 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3870 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
3871 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3872 if (DECL_HAS_VTT_PARM_P (decl))
3873 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
3875 clone_parms = orig_clone_parms;
3876 if (DECL_HAS_VTT_PARM_P (clone))
3877 clone_parms = TREE_CHAIN (clone_parms);
3879 for (decl_parms = orig_decl_parms; decl_parms;
3880 decl_parms = TREE_CHAIN (decl_parms),
3881 clone_parms = TREE_CHAIN (clone_parms))
3883 gcc_assert (same_type_p (TREE_TYPE (decl_parms),
3884 TREE_TYPE (clone_parms)));
3886 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
3888 /* A default parameter has been added. Adjust the
3889 clone's parameters. */
3890 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3891 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3894 clone_parms = orig_decl_parms;
3896 if (DECL_HAS_VTT_PARM_P (clone))
3898 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
3899 TREE_VALUE (orig_clone_parms),
3901 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
3903 type = build_method_type_directly (basetype,
3904 TREE_TYPE (TREE_TYPE (clone)),
3907 type = build_exception_variant (type, exceptions);
3908 TREE_TYPE (clone) = type;
3910 clone_parms = NULL_TREE;
3914 gcc_assert (!clone_parms);
3918 /* For each of the constructors and destructors in T, create an
3919 in-charge and not-in-charge variant. */
3922 clone_constructors_and_destructors (tree t)
3926 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
3928 if (!CLASSTYPE_METHOD_VEC (t))
3931 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
3932 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
3933 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
3934 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
3937 /* Remove all zero-width bit-fields from T. */
3940 remove_zero_width_bit_fields (tree t)
3944 fieldsp = &TYPE_FIELDS (t);
3947 if (TREE_CODE (*fieldsp) == FIELD_DECL
3948 && DECL_C_BIT_FIELD (*fieldsp)
3949 && DECL_INITIAL (*fieldsp))
3950 *fieldsp = TREE_CHAIN (*fieldsp);
3952 fieldsp = &TREE_CHAIN (*fieldsp);
3956 /* Returns TRUE iff we need a cookie when dynamically allocating an
3957 array whose elements have the indicated class TYPE. */
3960 type_requires_array_cookie (tree type)
3963 bool has_two_argument_delete_p = false;
3965 gcc_assert (CLASS_TYPE_P (type));
3967 /* If there's a non-trivial destructor, we need a cookie. In order
3968 to iterate through the array calling the destructor for each
3969 element, we'll have to know how many elements there are. */
3970 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3973 /* If the usual deallocation function is a two-argument whose second
3974 argument is of type `size_t', then we have to pass the size of
3975 the array to the deallocation function, so we will need to store
3977 fns = lookup_fnfields (TYPE_BINFO (type),
3978 ansi_opname (VEC_DELETE_EXPR),
3980 /* If there are no `operator []' members, or the lookup is
3981 ambiguous, then we don't need a cookie. */
3982 if (!fns || fns == error_mark_node)
3984 /* Loop through all of the functions. */
3985 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
3990 /* Select the current function. */
3991 fn = OVL_CURRENT (fns);
3992 /* See if this function is a one-argument delete function. If
3993 it is, then it will be the usual deallocation function. */
3994 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
3995 if (second_parm == void_list_node)
3997 /* Otherwise, if we have a two-argument function and the second
3998 argument is `size_t', it will be the usual deallocation
3999 function -- unless there is one-argument function, too. */
4000 if (TREE_CHAIN (second_parm) == void_list_node
4001 && same_type_p (TREE_VALUE (second_parm), sizetype))
4002 has_two_argument_delete_p = true;
4005 return has_two_argument_delete_p;
4008 /* Check the validity of the bases and members declared in T. Add any
4009 implicitly-generated functions (like copy-constructors and
4010 assignment operators). Compute various flag bits (like
4011 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4012 level: i.e., independently of the ABI in use. */
4015 check_bases_and_members (tree t)
4017 /* Nonzero if we are not allowed to generate a default constructor
4019 int cant_have_default_ctor;
4020 /* Nonzero if the implicitly generated copy constructor should take
4021 a non-const reference argument. */
4022 int cant_have_const_ctor;
4023 /* Nonzero if the the implicitly generated assignment operator
4024 should take a non-const reference argument. */
4025 int no_const_asn_ref;
4028 /* By default, we use const reference arguments and generate default
4030 cant_have_default_ctor = 0;
4031 cant_have_const_ctor = 0;
4032 no_const_asn_ref = 0;
4034 /* Check all the base-classes. */
4035 check_bases (t, &cant_have_default_ctor, &cant_have_const_ctor,
4038 /* Check all the method declarations. */
4041 /* Check all the data member declarations. We cannot call
4042 check_field_decls until we have called check_bases check_methods,
4043 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4044 being set appropriately. */
4045 check_field_decls (t, &access_decls,
4046 &cant_have_default_ctor,
4047 &cant_have_const_ctor,
4050 /* A nearly-empty class has to be vptr-containing; a nearly empty
4051 class contains just a vptr. */
4052 if (!TYPE_CONTAINS_VPTR_P (t))
4053 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4055 /* Do some bookkeeping that will guide the generation of implicitly
4056 declared member functions. */
4057 TYPE_HAS_COMPLEX_INIT_REF (t)
4058 |= (TYPE_HAS_INIT_REF (t) || TYPE_CONTAINS_VPTR_P (t));
4059 TYPE_NEEDS_CONSTRUCTING (t)
4060 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_CONTAINS_VPTR_P (t));
4061 CLASSTYPE_NON_AGGREGATE (t)
4062 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_POLYMORPHIC_P (t));
4063 CLASSTYPE_NON_POD_P (t)
4064 |= (CLASSTYPE_NON_AGGREGATE (t)
4065 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
4066 || TYPE_HAS_ASSIGN_REF (t));
4067 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4068 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_CONTAINS_VPTR_P (t);
4070 /* Synthesize any needed methods. */
4071 add_implicitly_declared_members (t, cant_have_default_ctor,
4072 cant_have_const_ctor,
4075 /* Create the in-charge and not-in-charge variants of constructors
4077 clone_constructors_and_destructors (t);
4079 /* Process the using-declarations. */
4080 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4081 handle_using_decl (TREE_VALUE (access_decls), t);
4083 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4084 finish_struct_methods (t);
4086 /* Figure out whether or not we will need a cookie when dynamically
4087 allocating an array of this type. */
4088 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
4089 = type_requires_array_cookie (t);
4092 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4093 accordingly. If a new vfield was created (because T doesn't have a
4094 primary base class), then the newly created field is returned. It
4095 is not added to the TYPE_FIELDS list; it is the caller's
4096 responsibility to do that. Accumulate declared virtual functions
4100 create_vtable_ptr (tree t, tree* virtuals_p)
4104 /* Collect the virtual functions declared in T. */
4105 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4106 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
4107 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
4109 tree new_virtual = make_node (TREE_LIST);
4111 BV_FN (new_virtual) = fn;
4112 BV_DELTA (new_virtual) = integer_zero_node;
4113 BV_VCALL_INDEX (new_virtual) = NULL_TREE;
4115 TREE_CHAIN (new_virtual) = *virtuals_p;
4116 *virtuals_p = new_virtual;
4119 /* If we couldn't find an appropriate base class, create a new field
4120 here. Even if there weren't any new virtual functions, we might need a
4121 new virtual function table if we're supposed to include vptrs in
4122 all classes that need them. */
4123 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
4125 /* We build this decl with vtbl_ptr_type_node, which is a
4126 `vtable_entry_type*'. It might seem more precise to use
4127 `vtable_entry_type (*)[N]' where N is the number of virtual
4128 functions. However, that would require the vtable pointer in
4129 base classes to have a different type than the vtable pointer
4130 in derived classes. We could make that happen, but that
4131 still wouldn't solve all the problems. In particular, the
4132 type-based alias analysis code would decide that assignments
4133 to the base class vtable pointer can't alias assignments to
4134 the derived class vtable pointer, since they have different
4135 types. Thus, in a derived class destructor, where the base
4136 class constructor was inlined, we could generate bad code for
4137 setting up the vtable pointer.
4139 Therefore, we use one type for all vtable pointers. We still
4140 use a type-correct type; it's just doesn't indicate the array
4141 bounds. That's better than using `void*' or some such; it's
4142 cleaner, and it let's the alias analysis code know that these
4143 stores cannot alias stores to void*! */
4146 field = build_decl (FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
4147 SET_DECL_ASSEMBLER_NAME (field, get_identifier (VFIELD_BASE));
4148 DECL_VIRTUAL_P (field) = 1;
4149 DECL_ARTIFICIAL (field) = 1;
4150 DECL_FIELD_CONTEXT (field) = t;
4151 DECL_FCONTEXT (field) = t;
4153 TYPE_VFIELD (t) = field;
4155 /* This class is non-empty. */
4156 CLASSTYPE_EMPTY_P (t) = 0;
4164 /* Fixup the inline function given by INFO now that the class is
4168 fixup_pending_inline (tree fn)
4170 if (DECL_PENDING_INLINE_INFO (fn))
4172 tree args = DECL_ARGUMENTS (fn);
4175 DECL_CONTEXT (args) = fn;
4176 args = TREE_CHAIN (args);
4181 /* Fixup the inline methods and friends in TYPE now that TYPE is
4185 fixup_inline_methods (tree type)
4187 tree method = TYPE_METHODS (type);
4188 VEC (tree) *friends;
4191 if (method && TREE_CODE (method) == TREE_VEC)
4193 if (TREE_VEC_ELT (method, 1))
4194 method = TREE_VEC_ELT (method, 1);
4195 else if (TREE_VEC_ELT (method, 0))
4196 method = TREE_VEC_ELT (method, 0);
4198 method = TREE_VEC_ELT (method, 2);
4201 /* Do inline member functions. */
4202 for (; method; method = TREE_CHAIN (method))
4203 fixup_pending_inline (method);
4206 for (friends = CLASSTYPE_INLINE_FRIENDS (type), ix = 0;
4207 VEC_iterate (tree, friends, ix, method); ix++)
4208 fixup_pending_inline (method);
4209 CLASSTYPE_INLINE_FRIENDS (type) = NULL;
4212 /* Add OFFSET to all base types of BINFO which is a base in the
4213 hierarchy dominated by T.
4215 OFFSET, which is a type offset, is number of bytes. */
4218 propagate_binfo_offsets (tree binfo, tree offset)
4224 /* Update BINFO's offset. */
4225 BINFO_OFFSET (binfo)
4226 = convert (sizetype,
4227 size_binop (PLUS_EXPR,
4228 convert (ssizetype, BINFO_OFFSET (binfo)),
4231 /* Find the primary base class. */
4232 primary_binfo = get_primary_binfo (binfo);
4234 if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo)
4235 propagate_binfo_offsets (primary_binfo, offset);
4237 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4239 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4241 /* Don't do the primary base twice. */
4242 if (base_binfo == primary_binfo)
4245 if (BINFO_VIRTUAL_P (base_binfo))
4248 propagate_binfo_offsets (base_binfo, offset);
4252 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4253 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4254 empty subobjects of T. */
4257 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
4261 bool first_vbase = true;
4264 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0)
4267 if (!abi_version_at_least(2))
4269 /* In G++ 3.2, we incorrectly rounded the size before laying out
4270 the virtual bases. */
4271 finish_record_layout (rli, /*free_p=*/false);
4272 #ifdef STRUCTURE_SIZE_BOUNDARY
4273 /* Packed structures don't need to have minimum size. */
4274 if (! TYPE_PACKED (t))
4275 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
4277 rli->offset = TYPE_SIZE_UNIT (t);
4278 rli->bitpos = bitsize_zero_node;
4279 rli->record_align = TYPE_ALIGN (t);
4282 /* Find the last field. The artificial fields created for virtual
4283 bases will go after the last extant field to date. */
4284 next_field = &TYPE_FIELDS (t);
4286 next_field = &TREE_CHAIN (*next_field);
4288 /* Go through the virtual bases, allocating space for each virtual
4289 base that is not already a primary base class. These are
4290 allocated in inheritance graph order. */
4291 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
4293 if (!BINFO_VIRTUAL_P (vbase))
4296 if (!BINFO_PRIMARY_P (vbase))
4298 tree basetype = TREE_TYPE (vbase);
4300 /* This virtual base is not a primary base of any class in the
4301 hierarchy, so we have to add space for it. */
4302 next_field = build_base_field (rli, vbase,
4303 offsets, next_field);
4305 /* If the first virtual base might have been placed at a
4306 lower address, had we started from CLASSTYPE_SIZE, rather
4307 than TYPE_SIZE, issue a warning. There can be both false
4308 positives and false negatives from this warning in rare
4309 cases; to deal with all the possibilities would probably
4310 require performing both layout algorithms and comparing
4311 the results which is not particularly tractable. */
4315 (size_binop (CEIL_DIV_EXPR,
4316 round_up (CLASSTYPE_SIZE (t),
4317 CLASSTYPE_ALIGN (basetype)),
4319 BINFO_OFFSET (vbase))))
4320 warning ("offset of virtual base %qT is not ABI-compliant and "
4321 "may change in a future version of GCC",
4324 first_vbase = false;
4329 /* Returns the offset of the byte just past the end of the base class
4333 end_of_base (tree binfo)
4337 if (is_empty_class (BINFO_TYPE (binfo)))
4338 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4339 allocate some space for it. It cannot have virtual bases, so
4340 TYPE_SIZE_UNIT is fine. */
4341 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4343 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4345 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
4348 /* Returns the offset of the byte just past the end of the base class
4349 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4350 only non-virtual bases are included. */
4353 end_of_class (tree t, int include_virtuals_p)
4355 tree result = size_zero_node;
4362 for (binfo = TYPE_BINFO (t), i = 0;
4363 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4365 if (!include_virtuals_p
4366 && BINFO_VIRTUAL_P (base_binfo)
4367 && (!BINFO_PRIMARY_P (base_binfo)
4368 || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t)))
4371 offset = end_of_base (base_binfo);
4372 if (INT_CST_LT_UNSIGNED (result, offset))
4376 /* G++ 3.2 did not check indirect virtual bases. */
4377 if (abi_version_at_least (2) && include_virtuals_p)
4378 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4379 VEC_iterate (tree, vbases, i, base_binfo); i++)
4381 offset = end_of_base (base_binfo);
4382 if (INT_CST_LT_UNSIGNED (result, offset))
4389 /* Warn about bases of T that are inaccessible because they are
4390 ambiguous. For example:
4393 struct T : public S {};
4394 struct U : public S, public T {};
4396 Here, `(S*) new U' is not allowed because there are two `S'
4400 warn_about_ambiguous_bases (tree t)
4408 /* If there are no repeated bases, nothing can be ambiguous. */
4409 if (!CLASSTYPE_REPEATED_BASE_P (t))
4412 /* Check direct bases. */
4413 for (binfo = TYPE_BINFO (t), i = 0;
4414 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4416 basetype = BINFO_TYPE (base_binfo);
4418 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4419 warning ("direct base %qT inaccessible in %qT due to ambiguity",
4423 /* Check for ambiguous virtual bases. */
4425 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
4426 VEC_iterate (tree, vbases, i, binfo); i++)
4428 basetype = BINFO_TYPE (binfo);
4430 if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL))
4431 warning ("virtual base %qT inaccessible in %qT due to ambiguity",
4436 /* Compare two INTEGER_CSTs K1 and K2. */
4439 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
4441 return tree_int_cst_compare ((tree) k1, (tree) k2);
4444 /* Increase the size indicated in RLI to account for empty classes
4445 that are "off the end" of the class. */
4448 include_empty_classes (record_layout_info rli)
4453 /* It might be the case that we grew the class to allocate a
4454 zero-sized base class. That won't be reflected in RLI, yet,
4455 because we are willing to overlay multiple bases at the same
4456 offset. However, now we need to make sure that RLI is big enough
4457 to reflect the entire class. */
4458 eoc = end_of_class (rli->t,
4459 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
4460 rli_size = rli_size_unit_so_far (rli);
4461 if (TREE_CODE (rli_size) == INTEGER_CST
4462 && INT_CST_LT_UNSIGNED (rli_size, eoc))
4464 if (!abi_version_at_least (2))
4465 /* In version 1 of the ABI, the size of a class that ends with
4466 a bitfield was not rounded up to a whole multiple of a
4467 byte. Because rli_size_unit_so_far returns only the number
4468 of fully allocated bytes, any extra bits were not included
4470 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
4472 /* The size should have been rounded to a whole byte. */
4473 gcc_assert (tree_int_cst_equal
4474 (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT)));
4476 = size_binop (PLUS_EXPR,
4478 size_binop (MULT_EXPR,
4479 convert (bitsizetype,
4480 size_binop (MINUS_EXPR,
4482 bitsize_int (BITS_PER_UNIT)));
4483 normalize_rli (rli);
4487 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4488 BINFO_OFFSETs for all of the base-classes. Position the vtable
4489 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4492 layout_class_type (tree t, tree *virtuals_p)
4494 tree non_static_data_members;
4497 record_layout_info rli;
4498 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4499 types that appear at that offset. */
4500 splay_tree empty_base_offsets;
4501 /* True if the last field layed out was a bit-field. */
4502 bool last_field_was_bitfield = false;
4503 /* The location at which the next field should be inserted. */
4505 /* T, as a base class. */
4508 /* Keep track of the first non-static data member. */
4509 non_static_data_members = TYPE_FIELDS (t);
4511 /* Start laying out the record. */
4512 rli = start_record_layout (t);
4514 /* Mark all the primary bases in the hierarchy. */
4515 determine_primary_bases (t);
4517 /* Create a pointer to our virtual function table. */
4518 vptr = create_vtable_ptr (t, virtuals_p);
4520 /* The vptr is always the first thing in the class. */
4523 TREE_CHAIN (vptr) = TYPE_FIELDS (t);
4524 TYPE_FIELDS (t) = vptr;
4525 next_field = &TREE_CHAIN (vptr);
4526 place_field (rli, vptr);
4529 next_field = &TYPE_FIELDS (t);
4531 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4532 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
4534 build_base_fields (rli, empty_base_offsets, next_field);
4536 /* Layout the non-static data members. */
4537 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4542 /* We still pass things that aren't non-static data members to
4543 the back-end, in case it wants to do something with them. */
4544 if (TREE_CODE (field) != FIELD_DECL)
4546 place_field (rli, field);
4547 /* If the static data member has incomplete type, keep track
4548 of it so that it can be completed later. (The handling
4549 of pending statics in finish_record_layout is
4550 insufficient; consider:
4553 struct S2 { static S1 s1; };
4555 At this point, finish_record_layout will be called, but
4556 S1 is still incomplete.) */
4557 if (TREE_CODE (field) == VAR_DECL)
4559 maybe_register_incomplete_var (field);
4560 /* The visibility of static data members is determined
4561 at their point of declaration, not their point of
4563 determine_visibility (field);
4568 type = TREE_TYPE (field);
4570 padding = NULL_TREE;
4572 /* If this field is a bit-field whose width is greater than its
4573 type, then there are some special rules for allocating
4575 if (DECL_C_BIT_FIELD (field)
4576 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4578 integer_type_kind itk;
4580 bool was_unnamed_p = false;
4581 /* We must allocate the bits as if suitably aligned for the
4582 longest integer type that fits in this many bits. type
4583 of the field. Then, we are supposed to use the left over
4584 bits as additional padding. */
4585 for (itk = itk_char; itk != itk_none; ++itk)
4586 if (INT_CST_LT (DECL_SIZE (field),
4587 TYPE_SIZE (integer_types[itk])))
4590 /* ITK now indicates a type that is too large for the
4591 field. We have to back up by one to find the largest
4593 integer_type = integer_types[itk - 1];
4595 /* Figure out how much additional padding is required. GCC
4596 3.2 always created a padding field, even if it had zero
4598 if (!abi_version_at_least (2)
4599 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
4601 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
4602 /* In a union, the padding field must have the full width
4603 of the bit-field; all fields start at offset zero. */
4604 padding = DECL_SIZE (field);
4607 if (warn_abi && TREE_CODE (t) == UNION_TYPE)
4608 warning ("size assigned to %qT may not be "
4609 "ABI-compliant and may change in a future "
4612 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4613 TYPE_SIZE (integer_type));
4616 #ifdef PCC_BITFIELD_TYPE_MATTERS
4617 /* An unnamed bitfield does not normally affect the
4618 alignment of the containing class on a target where
4619 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4620 make any exceptions for unnamed bitfields when the
4621 bitfields are longer than their types. Therefore, we
4622 temporarily give the field a name. */
4623 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
4625 was_unnamed_p = true;
4626 DECL_NAME (field) = make_anon_name ();
4629 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4630 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4631 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4632 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4633 empty_base_offsets);
4635 DECL_NAME (field) = NULL_TREE;
4636 /* Now that layout has been performed, set the size of the
4637 field to the size of its declared type; the rest of the
4638 field is effectively invisible. */
4639 DECL_SIZE (field) = TYPE_SIZE (type);
4640 /* We must also reset the DECL_MODE of the field. */
4641 if (abi_version_at_least (2))
4642 DECL_MODE (field) = TYPE_MODE (type);
4644 && DECL_MODE (field) != TYPE_MODE (type))
4645 /* Versions of G++ before G++ 3.4 did not reset the
4647 warning ("the offset of %qD may not be ABI-compliant and may "
4648 "change in a future version of GCC", field);
4651 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4652 empty_base_offsets);
4654 /* Remember the location of any empty classes in FIELD. */
4655 if (abi_version_at_least (2))
4656 record_subobject_offsets (TREE_TYPE (field),
4657 byte_position(field),
4661 /* If a bit-field does not immediately follow another bit-field,
4662 and yet it starts in the middle of a byte, we have failed to
4663 comply with the ABI. */
4665 && DECL_C_BIT_FIELD (field)
4666 && !last_field_was_bitfield
4667 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
4668 DECL_FIELD_BIT_OFFSET (field),
4669 bitsize_unit_node)))
4670 cp_warning_at ("offset of %qD is not ABI-compliant and may "
4671 "change in a future version of GCC",
4674 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4675 offset of the field. */
4677 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
4678 byte_position (field))
4679 && contains_empty_class_p (TREE_TYPE (field)))
4680 cp_warning_at ("%qD contains empty classes which may cause base "
4681 "classes to be placed at different locations in a "
4682 "future version of GCC",
4685 /* If we needed additional padding after this field, add it
4691 padding_field = build_decl (FIELD_DECL,
4694 DECL_BIT_FIELD (padding_field) = 1;
4695 DECL_SIZE (padding_field) = padding;
4696 DECL_CONTEXT (padding_field) = t;
4697 DECL_ARTIFICIAL (padding_field) = 1;
4698 DECL_IGNORED_P (padding_field) = 1;
4699 layout_nonempty_base_or_field (rli, padding_field,
4701 empty_base_offsets);
4704 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
4707 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
4709 /* Make sure that we are on a byte boundary so that the size of
4710 the class without virtual bases will always be a round number
4712 rli->bitpos = round_up (rli->bitpos, BITS_PER_UNIT);
4713 normalize_rli (rli);
4716 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4718 if (!abi_version_at_least (2))
4719 include_empty_classes(rli);
4721 /* Delete all zero-width bit-fields from the list of fields. Now
4722 that the type is laid out they are no longer important. */
4723 remove_zero_width_bit_fields (t);
4725 /* Create the version of T used for virtual bases. We do not use
4726 make_aggr_type for this version; this is an artificial type. For
4727 a POD type, we just reuse T. */
4728 if (CLASSTYPE_NON_POD_P (t) || CLASSTYPE_EMPTY_P (t))
4730 base_t = make_node (TREE_CODE (t));
4732 /* Set the size and alignment for the new type. In G++ 3.2, all
4733 empty classes were considered to have size zero when used as
4735 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
4737 TYPE_SIZE (base_t) = bitsize_zero_node;
4738 TYPE_SIZE_UNIT (base_t) = size_zero_node;
4739 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
4740 warning ("layout of classes derived from empty class %qT "
4741 "may change in a future version of GCC",
4748 /* If the ABI version is not at least two, and the last
4749 field was a bit-field, RLI may not be on a byte
4750 boundary. In particular, rli_size_unit_so_far might
4751 indicate the last complete byte, while rli_size_so_far
4752 indicates the total number of bits used. Therefore,
4753 rli_size_so_far, rather than rli_size_unit_so_far, is
4754 used to compute TYPE_SIZE_UNIT. */
4755 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4756 TYPE_SIZE_UNIT (base_t)
4757 = size_binop (MAX_EXPR,
4759 size_binop (CEIL_DIV_EXPR,
4760 rli_size_so_far (rli),
4761 bitsize_int (BITS_PER_UNIT))),
4764 = size_binop (MAX_EXPR,
4765 rli_size_so_far (rli),
4766 size_binop (MULT_EXPR,
4767 convert (bitsizetype, eoc),
4768 bitsize_int (BITS_PER_UNIT)));
4770 TYPE_ALIGN (base_t) = rli->record_align;
4771 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
4773 /* Copy the fields from T. */
4774 next_field = &TYPE_FIELDS (base_t);
4775 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4776 if (TREE_CODE (field) == FIELD_DECL)
4778 *next_field = build_decl (FIELD_DECL,
4781 DECL_CONTEXT (*next_field) = base_t;
4782 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
4783 DECL_FIELD_BIT_OFFSET (*next_field)
4784 = DECL_FIELD_BIT_OFFSET (field);
4785 DECL_SIZE (*next_field) = DECL_SIZE (field);
4786 DECL_MODE (*next_field) = DECL_MODE (field);
4787 next_field = &TREE_CHAIN (*next_field);
4790 /* Record the base version of the type. */
4791 CLASSTYPE_AS_BASE (t) = base_t;
4792 TYPE_CONTEXT (base_t) = t;
4795 CLASSTYPE_AS_BASE (t) = t;
4797 /* Every empty class contains an empty class. */
4798 if (CLASSTYPE_EMPTY_P (t))
4799 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
4801 /* Set the TYPE_DECL for this type to contain the right
4802 value for DECL_OFFSET, so that we can use it as part
4803 of a COMPONENT_REF for multiple inheritance. */
4804 layout_decl (TYPE_MAIN_DECL (t), 0);
4806 /* Now fix up any virtual base class types that we left lying
4807 around. We must get these done before we try to lay out the
4808 virtual function table. As a side-effect, this will remove the
4809 base subobject fields. */
4810 layout_virtual_bases (rli, empty_base_offsets);
4812 /* Make sure that empty classes are reflected in RLI at this
4814 include_empty_classes(rli);
4816 /* Make sure not to create any structures with zero size. */
4817 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
4819 build_decl (FIELD_DECL, NULL_TREE, char_type_node));
4821 /* Let the back-end lay out the type. */
4822 finish_record_layout (rli, /*free_p=*/true);
4824 /* Warn about bases that can't be talked about due to ambiguity. */
4825 warn_about_ambiguous_bases (t);
4827 /* Now that we're done with layout, give the base fields the real types. */
4828 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4829 if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field)))
4830 TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field));
4833 splay_tree_delete (empty_base_offsets);
4836 /* Determine the "key method" for the class type indicated by TYPE,
4837 and set CLASSTYPE_KEY_METHOD accordingly. */
4840 determine_key_method (tree type)
4844 if (TYPE_FOR_JAVA (type)
4845 || processing_template_decl
4846 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
4847 || CLASSTYPE_INTERFACE_KNOWN (type))
4850 /* The key method is the first non-pure virtual function that is not
4851 inline at the point of class definition. On some targets the
4852 key function may not be inline; those targets should not call
4853 this function until the end of the translation unit. */
4854 for (method = TYPE_METHODS (type); method != NULL_TREE;
4855 method = TREE_CHAIN (method))
4856 if (DECL_VINDEX (method) != NULL_TREE
4857 && ! DECL_DECLARED_INLINE_P (method)
4858 && ! DECL_PURE_VIRTUAL_P (method))
4860 CLASSTYPE_KEY_METHOD (type) = method;
4867 /* Perform processing required when the definition of T (a class type)
4871 finish_struct_1 (tree t)
4874 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
4875 tree virtuals = NULL_TREE;
4878 if (COMPLETE_TYPE_P (t))
4880 gcc_assert (IS_AGGR_TYPE (t));
4881 error ("redefinition of %q#T", t);
4886 /* If this type was previously laid out as a forward reference,
4887 make sure we lay it out again. */
4888 TYPE_SIZE (t) = NULL_TREE;
4889 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
4891 fixup_inline_methods (t);
4893 /* Make assumptions about the class; we'll reset the flags if
4895 CLASSTYPE_EMPTY_P (t) = 1;
4896 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
4897 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
4899 /* Do end-of-class semantic processing: checking the validity of the
4900 bases and members and add implicitly generated methods. */
4901 check_bases_and_members (t);
4903 /* Find the key method. */
4904 if (TYPE_CONTAINS_VPTR_P (t))
4906 /* The Itanium C++ ABI permits the key method to be chosen when
4907 the class is defined -- even though the key method so
4908 selected may later turn out to be an inline function. On
4909 some systems (such as ARM Symbian OS) the key method cannot
4910 be determined until the end of the translation unit. On such
4911 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
4912 will cause the class to be added to KEYED_CLASSES. Then, in
4913 finish_file we will determine the key method. */
4914 if (targetm.cxx.key_method_may_be_inline ())
4915 determine_key_method (t);
4917 /* If a polymorphic class has no key method, we may emit the vtable
4918 in every translation unit where the class definition appears. */
4919 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
4920 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
4923 /* Layout the class itself. */
4924 layout_class_type (t, &virtuals);
4925 if (CLASSTYPE_AS_BASE (t) != t)
4926 /* We use the base type for trivial assignments, and hence it
4928 compute_record_mode (CLASSTYPE_AS_BASE (t));
4930 virtuals = modify_all_vtables (t, nreverse (virtuals));
4932 /* If necessary, create the primary vtable for this class. */
4933 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
4935 /* We must enter these virtuals into the table. */
4936 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4937 build_primary_vtable (NULL_TREE, t);
4938 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
4939 /* Here we know enough to change the type of our virtual
4940 function table, but we will wait until later this function. */
4941 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
4944 if (TYPE_CONTAINS_VPTR_P (t))
4949 if (BINFO_VTABLE (TYPE_BINFO (t)))
4950 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t))));
4951 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4952 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE);
4954 /* Add entries for virtual functions introduced by this class. */
4955 BINFO_VIRTUALS (TYPE_BINFO (t))
4956 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals);
4958 /* Set DECL_VINDEX for all functions declared in this class. */
4959 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
4961 fn = TREE_CHAIN (fn),
4962 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
4963 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
4965 tree fndecl = BV_FN (fn);
4967 if (DECL_THUNK_P (fndecl))
4968 /* A thunk. We should never be calling this entry directly
4969 from this vtable -- we'd use the entry for the non
4970 thunk base function. */
4971 DECL_VINDEX (fndecl) = NULL_TREE;
4972 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
4973 DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex);
4977 finish_struct_bits (t);
4979 /* Complete the rtl for any static member objects of the type we're
4981 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
4982 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
4983 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
4984 DECL_MODE (x) = TYPE_MODE (t);
4986 /* Done with FIELDS...now decide whether to sort these for
4987 faster lookups later.
4989 We use a small number because most searches fail (succeeding
4990 ultimately as the search bores through the inheritance
4991 hierarchy), and we want this failure to occur quickly. */
4993 n_fields = count_fields (TYPE_FIELDS (t));
4996 struct sorted_fields_type *field_vec = GGC_NEWVAR
4997 (struct sorted_fields_type,
4998 sizeof (struct sorted_fields_type) + n_fields * sizeof (tree));
4999 field_vec->len = n_fields;
5000 add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0);
5001 qsort (field_vec->elts, n_fields, sizeof (tree),
5003 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
5004 retrofit_lang_decl (TYPE_MAIN_DECL (t));
5005 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5008 /* Make the rtl for any new vtables we have created, and unmark
5009 the base types we marked. */
5012 /* Build the VTT for T. */
5015 if (warn_nonvdtor && TYPE_POLYMORPHIC_P (t))
5019 dtor = CLASSTYPE_DESTRUCTORS (t);
5020 /* Warn only if the dtor is non-private or the class has
5022 if (/* An implicitly declared destructor is always public. And,
5023 if it were virtual, we would have created it by now. */
5025 || (!DECL_VINDEX (dtor)
5026 && (!TREE_PRIVATE (dtor)
5027 || CLASSTYPE_FRIEND_CLASSES (t)
5028 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))))
5029 warning ("%q#T has virtual functions but non-virtual destructor",
5035 if (warn_overloaded_virtual)
5038 maybe_suppress_debug_info (t);
5040 dump_class_hierarchy (t);
5042 /* Finish debugging output for this type. */
5043 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5046 /* When T was built up, the member declarations were added in reverse
5047 order. Rearrange them to declaration order. */
5050 unreverse_member_declarations (tree t)
5056 /* The following lists are all in reverse order. Put them in
5057 declaration order now. */
5058 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5059 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
5061 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5062 reverse order, so we can't just use nreverse. */
5064 for (x = TYPE_FIELDS (t);
5065 x && TREE_CODE (x) != TYPE_DECL;
5068 next = TREE_CHAIN (x);
5069 TREE_CHAIN (x) = prev;
5074 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5076 TYPE_FIELDS (t) = prev;
5081 finish_struct (tree t, tree attributes)
5083 location_t saved_loc = input_location;
5085 /* Now that we've got all the field declarations, reverse everything
5087 unreverse_member_declarations (t);
5089 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
5091 /* Nadger the current location so that diagnostics point to the start of
5092 the struct, not the end. */
5093 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
5095 if (processing_template_decl)
5099 finish_struct_methods (t);
5100 TYPE_SIZE (t) = bitsize_zero_node;
5102 /* We need to emit an error message if this type was used as a parameter
5103 and it is an abstract type, even if it is a template. We construct
5104 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5105 account and we call complete_vars with this type, which will check
5106 the PARM_DECLS. Note that while the type is being defined,
5107 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5108 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5109 CLASSTYPE_PURE_VIRTUALS (t) = NULL;
5110 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
5111 if (DECL_PURE_VIRTUAL_P (x))
5112 VEC_safe_push (tree, CLASSTYPE_PURE_VIRTUALS (t), x);
5116 finish_struct_1 (t);
5118 input_location = saved_loc;
5120 TYPE_BEING_DEFINED (t) = 0;
5122 if (current_class_type)
5125 error ("trying to finish struct, but kicked out due to previous parse errors");
5127 if (processing_template_decl && at_function_scope_p ())
5128 add_stmt (build_min (TAG_DEFN, t));
5133 /* Return the dynamic type of INSTANCE, if known.
5134 Used to determine whether the virtual function table is needed
5137 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5138 of our knowledge of its type. *NONNULL should be initialized
5139 before this function is called. */
5142 fixed_type_or_null (tree instance, int* nonnull, int* cdtorp)
5144 switch (TREE_CODE (instance))
5147 if (POINTER_TYPE_P (TREE_TYPE (instance)))
5150 return fixed_type_or_null (TREE_OPERAND (instance, 0),
5154 /* This is a call to a constructor, hence it's never zero. */
5155 if (TREE_HAS_CONSTRUCTOR (instance))
5159 return TREE_TYPE (instance);
5164 /* This is a call to a constructor, hence it's never zero. */
5165 if (TREE_HAS_CONSTRUCTOR (instance))
5169 return TREE_TYPE (instance);
5171 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5175 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5176 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5177 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5178 /* Propagate nonnull. */
5179 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5184 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5187 instance = TREE_OPERAND (instance, 0);
5190 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5191 with a real object -- given &p->f, p can still be null. */
5192 tree t = get_base_address (instance);
5193 /* ??? Probably should check DECL_WEAK here. */
5194 if (t && DECL_P (t))
5197 return fixed_type_or_null (instance, nonnull, cdtorp);
5200 /* If this component is really a base class reference, then the field
5201 itself isn't definitive. */
5202 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1)))
5203 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5204 return fixed_type_or_null (TREE_OPERAND (instance, 1), nonnull, cdtorp);
5208 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5209 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5213 return TREE_TYPE (TREE_TYPE (instance));
5215 /* fall through... */
5219 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5223 return TREE_TYPE (instance);
5225 else if (instance == current_class_ptr)
5230 /* if we're in a ctor or dtor, we know our type. */
5231 if (DECL_LANG_SPECIFIC (current_function_decl)
5232 && (DECL_CONSTRUCTOR_P (current_function_decl)
5233 || DECL_DESTRUCTOR_P (current_function_decl)))
5237 return TREE_TYPE (TREE_TYPE (instance));
5240 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5242 /* Reference variables should be references to objects. */
5246 /* DECL_VAR_MARKED_P is used to prevent recursion; a
5247 variable's initializer may refer to the variable
5249 if (TREE_CODE (instance) == VAR_DECL
5250 && DECL_INITIAL (instance)
5251 && !DECL_VAR_MARKED_P (instance))
5254 DECL_VAR_MARKED_P (instance) = 1;
5255 type = fixed_type_or_null (DECL_INITIAL (instance),
5257 DECL_VAR_MARKED_P (instance) = 0;
5268 /* Return nonzero if the dynamic type of INSTANCE is known, and
5269 equivalent to the static type. We also handle the case where
5270 INSTANCE is really a pointer. Return negative if this is a
5271 ctor/dtor. There the dynamic type is known, but this might not be
5272 the most derived base of the original object, and hence virtual
5273 bases may not be layed out according to this type.
5275 Used to determine whether the virtual function table is needed
5278 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5279 of our knowledge of its type. *NONNULL should be initialized
5280 before this function is called. */
5283 resolves_to_fixed_type_p (tree instance, int* nonnull)
5285 tree t = TREE_TYPE (instance);
5288 tree fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
5289 if (fixed == NULL_TREE)
5291 if (POINTER_TYPE_P (t))
5293 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
5295 return cdtorp ? -1 : 1;
5300 init_class_processing (void)
5302 current_class_depth = 0;
5303 current_class_stack_size = 10;
5305 = xmalloc (current_class_stack_size * sizeof (struct class_stack_node));
5306 VARRAY_TREE_INIT (local_classes, 8, "local_classes");
5308 ridpointers[(int) RID_PUBLIC] = access_public_node;
5309 ridpointers[(int) RID_PRIVATE] = access_private_node;
5310 ridpointers[(int) RID_PROTECTED] = access_protected_node;
5313 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5316 restore_class_cache (void)
5320 /* We are re-entering the same class we just left, so we don't
5321 have to search the whole inheritance matrix to find all the
5322 decls to bind again. Instead, we install the cached
5323 class_shadowed list and walk through it binding names. */
5324 push_binding_level (previous_class_level);
5325 class_binding_level = previous_class_level;
5326 /* Restore IDENTIFIER_TYPE_VALUE. */
5327 for (type = class_binding_level->type_shadowed;
5329 type = TREE_CHAIN (type))
5330 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type));
5333 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5334 appropriate for TYPE.
5336 So that we may avoid calls to lookup_name, we cache the _TYPE
5337 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5339 For multiple inheritance, we perform a two-pass depth-first search
5340 of the type lattice. */
5343 pushclass (tree type)
5345 type = TYPE_MAIN_VARIANT (type);
5347 /* Make sure there is enough room for the new entry on the stack. */
5348 if (current_class_depth + 1 >= current_class_stack_size)
5350 current_class_stack_size *= 2;
5352 = xrealloc (current_class_stack,
5353 current_class_stack_size
5354 * sizeof (struct class_stack_node));
5357 /* Insert a new entry on the class stack. */
5358 current_class_stack[current_class_depth].name = current_class_name;
5359 current_class_stack[current_class_depth].type = current_class_type;
5360 current_class_stack[current_class_depth].access = current_access_specifier;
5361 current_class_stack[current_class_depth].names_used = 0;
5362 current_class_depth++;
5364 /* Now set up the new type. */
5365 current_class_name = TYPE_NAME (type);
5366 if (TREE_CODE (current_class_name) == TYPE_DECL)
5367 current_class_name = DECL_NAME (current_class_name);
5368 current_class_type = type;
5370 /* By default, things in classes are private, while things in
5371 structures or unions are public. */
5372 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5373 ? access_private_node
5374 : access_public_node);
5376 if (previous_class_level
5377 && type != previous_class_level->this_entity
5378 && current_class_depth == 1)
5380 /* Forcibly remove any old class remnants. */
5381 invalidate_class_lookup_cache ();
5384 if (!previous_class_level
5385 || type != previous_class_level->this_entity
5386 || current_class_depth > 1)
5389 restore_class_cache ();
5392 /* When we exit a toplevel class scope, we save its binding level so
5393 that we can restore it quickly. Here, we've entered some other
5394 class, so we must invalidate our cache. */
5397 invalidate_class_lookup_cache (void)
5399 previous_class_level = NULL;
5402 /* Get out of the current class scope. If we were in a class scope
5403 previously, that is the one popped to. */
5410 current_class_depth--;
5411 current_class_name = current_class_stack[current_class_depth].name;
5412 current_class_type = current_class_stack[current_class_depth].type;
5413 current_access_specifier = current_class_stack[current_class_depth].access;
5414 if (current_class_stack[current_class_depth].names_used)
5415 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5418 /* Returns 1 if current_class_type is either T or a nested type of T.
5419 We start looking from 1 because entry 0 is from global scope, and has
5423 currently_open_class (tree t)
5426 if (current_class_type && same_type_p (t, current_class_type))
5428 for (i = 1; i < current_class_depth; ++i)
5429 if (current_class_stack[i].type
5430 && same_type_p (current_class_stack [i].type, t))
5435 /* If either current_class_type or one of its enclosing classes are derived
5436 from T, return the appropriate type. Used to determine how we found
5437 something via unqualified lookup. */
5440 currently_open_derived_class (tree t)
5444 /* The bases of a dependent type are unknown. */
5445 if (dependent_type_p (t))
5448 if (!current_class_type)
5451 if (DERIVED_FROM_P (t, current_class_type))
5452 return current_class_type;
5454 for (i = current_class_depth - 1; i > 0; --i)
5455 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5456 return current_class_stack[i].type;
5461 /* When entering a class scope, all enclosing class scopes' names with
5462 static meaning (static variables, static functions, types and
5463 enumerators) have to be visible. This recursive function calls
5464 pushclass for all enclosing class contexts until global or a local
5465 scope is reached. TYPE is the enclosed class. */
5468 push_nested_class (tree type)
5472 /* A namespace might be passed in error cases, like A::B:C. */
5473 if (type == NULL_TREE
5474 || type == error_mark_node
5475 || TREE_CODE (type) == NAMESPACE_DECL
5476 || ! IS_AGGR_TYPE (type)
5477 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5478 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
5481 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
5483 if (context && CLASS_TYPE_P (context))
5484 push_nested_class (context);
5488 /* Undoes a push_nested_class call. */
5491 pop_nested_class (void)
5493 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5496 if (context && CLASS_TYPE_P (context))
5497 pop_nested_class ();
5500 /* Returns the number of extern "LANG" blocks we are nested within. */
5503 current_lang_depth (void)
5505 return VARRAY_ACTIVE_SIZE (current_lang_base);
5508 /* Set global variables CURRENT_LANG_NAME to appropriate value
5509 so that behavior of name-mangling machinery is correct. */
5512 push_lang_context (tree name)
5514 VARRAY_PUSH_TREE (current_lang_base, current_lang_name);
5516 if (name == lang_name_cplusplus)
5518 current_lang_name = name;
5520 else if (name == lang_name_java)
5522 current_lang_name = name;
5523 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5524 (See record_builtin_java_type in decl.c.) However, that causes
5525 incorrect debug entries if these types are actually used.
5526 So we re-enable debug output after extern "Java". */
5527 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5528 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5529 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5530 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5531 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5532 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5533 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5534 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5536 else if (name == lang_name_c)
5538 current_lang_name = name;
5541 error ("language string %<\"%E\"%> not recognized", name);
5544 /* Get out of the current language scope. */
5547 pop_lang_context (void)
5549 current_lang_name = VARRAY_TOP_TREE (current_lang_base);
5550 VARRAY_POP (current_lang_base);
5553 /* Type instantiation routines. */
5555 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5556 matches the TARGET_TYPE. If there is no satisfactory match, return
5557 error_mark_node, and issue a error & warning messages under control
5558 of FLAGS. Permit pointers to member function if FLAGS permits. If
5559 TEMPLATE_ONLY, the name of the overloaded function was a
5560 template-id, and EXPLICIT_TARGS are the explicitly provided
5561 template arguments. */
5564 resolve_address_of_overloaded_function (tree target_type,
5566 tsubst_flags_t flags,
5568 tree explicit_targs)
5570 /* Here's what the standard says:
5574 If the name is a function template, template argument deduction
5575 is done, and if the argument deduction succeeds, the deduced
5576 arguments are used to generate a single template function, which
5577 is added to the set of overloaded functions considered.
5579 Non-member functions and static member functions match targets of
5580 type "pointer-to-function" or "reference-to-function." Nonstatic
5581 member functions match targets of type "pointer-to-member
5582 function;" the function type of the pointer to member is used to
5583 select the member function from the set of overloaded member
5584 functions. If a nonstatic member function is selected, the
5585 reference to the overloaded function name is required to have the
5586 form of a pointer to member as described in 5.3.1.
5588 If more than one function is selected, any template functions in
5589 the set are eliminated if the set also contains a non-template
5590 function, and any given template function is eliminated if the
5591 set contains a second template function that is more specialized
5592 than the first according to the partial ordering rules 14.5.5.2.
5593 After such eliminations, if any, there shall remain exactly one
5594 selected function. */
5597 int is_reference = 0;
5598 /* We store the matches in a TREE_LIST rooted here. The functions
5599 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5600 interoperability with most_specialized_instantiation. */
5601 tree matches = NULL_TREE;
5604 /* By the time we get here, we should be seeing only real
5605 pointer-to-member types, not the internal POINTER_TYPE to
5606 METHOD_TYPE representation. */
5607 gcc_assert (TREE_CODE (target_type) != POINTER_TYPE
5608 || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE);
5610 gcc_assert (is_overloaded_fn (overload));
5612 /* Check that the TARGET_TYPE is reasonable. */
5613 if (TYPE_PTRFN_P (target_type))
5615 else if (TYPE_PTRMEMFUNC_P (target_type))
5616 /* This is OK, too. */
5618 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5620 /* This is OK, too. This comes from a conversion to reference
5622 target_type = build_reference_type (target_type);
5627 if (flags & tf_error)
5628 error ("cannot resolve overloaded function %qD based on"
5629 " conversion to type %qT",
5630 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5631 return error_mark_node;
5634 /* If we can find a non-template function that matches, we can just
5635 use it. There's no point in generating template instantiations
5636 if we're just going to throw them out anyhow. But, of course, we
5637 can only do this when we don't *need* a template function. */
5642 for (fns = overload; fns; fns = OVL_NEXT (fns))
5644 tree fn = OVL_CURRENT (fns);
5647 if (TREE_CODE (fn) == TEMPLATE_DECL)
5648 /* We're not looking for templates just yet. */
5651 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5653 /* We're looking for a non-static member, and this isn't
5654 one, or vice versa. */
5657 /* Ignore anticipated decls of undeclared builtins. */
5658 if (DECL_ANTICIPATED (fn))
5661 /* See if there's a match. */
5662 fntype = TREE_TYPE (fn);
5664 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5665 else if (!is_reference)
5666 fntype = build_pointer_type (fntype);
5668 if (can_convert_arg (target_type, fntype, fn))
5669 matches = tree_cons (fn, NULL_TREE, matches);
5673 /* Now, if we've already got a match (or matches), there's no need
5674 to proceed to the template functions. But, if we don't have a
5675 match we need to look at them, too. */
5678 tree target_fn_type;
5679 tree target_arg_types;
5680 tree target_ret_type;
5685 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5687 target_fn_type = TREE_TYPE (target_type);
5688 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5689 target_ret_type = TREE_TYPE (target_fn_type);
5691 /* Never do unification on the 'this' parameter. */
5692 if (TREE_CODE (target_fn_type) == METHOD_TYPE)
5693 target_arg_types = TREE_CHAIN (target_arg_types);
5695 for (fns = overload; fns; fns = OVL_NEXT (fns))
5697 tree fn = OVL_CURRENT (fns);
5699 tree instantiation_type;
5702 if (TREE_CODE (fn) != TEMPLATE_DECL)
5703 /* We're only looking for templates. */
5706 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5708 /* We're not looking for a non-static member, and this is
5709 one, or vice versa. */
5712 /* Try to do argument deduction. */
5713 targs = make_tree_vec (DECL_NTPARMS (fn));
5714 if (fn_type_unification (fn, explicit_targs, targs,
5715 target_arg_types, target_ret_type,
5716 DEDUCE_EXACT, -1) != 0)
5717 /* Argument deduction failed. */
5720 /* Instantiate the template. */
5721 instantiation = instantiate_template (fn, targs, flags);
5722 if (instantiation == error_mark_node)
5723 /* Instantiation failed. */
5726 /* See if there's a match. */
5727 instantiation_type = TREE_TYPE (instantiation);
5729 instantiation_type =
5730 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5731 else if (!is_reference)
5732 instantiation_type = build_pointer_type (instantiation_type);
5733 if (can_convert_arg (target_type, instantiation_type, instantiation))
5734 matches = tree_cons (instantiation, fn, matches);
5737 /* Now, remove all but the most specialized of the matches. */
5740 tree match = most_specialized_instantiation (matches);
5742 if (match != error_mark_node)
5743 matches = tree_cons (match, NULL_TREE, NULL_TREE);
5747 /* Now we should have exactly one function in MATCHES. */
5748 if (matches == NULL_TREE)
5750 /* There were *no* matches. */
5751 if (flags & tf_error)
5753 error ("no matches converting function %qD to type %q#T",
5754 DECL_NAME (OVL_FUNCTION (overload)),
5757 /* print_candidates expects a chain with the functions in
5758 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5759 so why be clever?). */
5760 for (; overload; overload = OVL_NEXT (overload))
5761 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5764 print_candidates (matches);
5766 return error_mark_node;
5768 else if (TREE_CHAIN (matches))
5770 /* There were too many matches. */
5772 if (flags & tf_error)
5776 error ("converting overloaded function %qD to type %q#T is ambiguous",
5777 DECL_NAME (OVL_FUNCTION (overload)),
5780 /* Since print_candidates expects the functions in the
5781 TREE_VALUE slot, we flip them here. */
5782 for (match = matches; match; match = TREE_CHAIN (match))
5783 TREE_VALUE (match) = TREE_PURPOSE (match);
5785 print_candidates (matches);
5788 return error_mark_node;
5791 /* Good, exactly one match. Now, convert it to the correct type. */
5792 fn = TREE_PURPOSE (matches);
5794 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5795 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
5797 static int explained;
5799 if (!(flags & tf_error))
5800 return error_mark_node;
5802 pedwarn ("assuming pointer to member %qD", fn);
5805 pedwarn ("(a pointer to member can only be formed with %<&%E%>)", fn);
5810 /* If we're doing overload resolution purely for the purpose of
5811 determining conversion sequences, we should not consider the
5812 function used. If this conversion sequence is selected, the
5813 function will be marked as used at this point. */
5814 if (!(flags & tf_conv))
5817 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5818 return build_unary_op (ADDR_EXPR, fn, 0);
5821 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5822 will mark the function as addressed, but here we must do it
5824 cxx_mark_addressable (fn);
5830 /* This function will instantiate the type of the expression given in
5831 RHS to match the type of LHSTYPE. If errors exist, then return
5832 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
5833 we complain on errors. If we are not complaining, never modify rhs,
5834 as overload resolution wants to try many possible instantiations, in
5835 the hope that at least one will work.
5837 For non-recursive calls, LHSTYPE should be a function, pointer to
5838 function, or a pointer to member function. */
5841 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
5843 tsubst_flags_t flags_in = flags;
5845 flags &= ~tf_ptrmem_ok;
5847 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
5849 if (flags & tf_error)
5850 error ("not enough type information");
5851 return error_mark_node;
5854 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
5856 if (same_type_p (lhstype, TREE_TYPE (rhs)))
5858 if (flag_ms_extensions
5859 && TYPE_PTRMEMFUNC_P (lhstype)
5860 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
5861 /* Microsoft allows `A::f' to be resolved to a
5862 pointer-to-member. */
5866 if (flags & tf_error)
5867 error ("argument of type %qT does not match %qT",
5868 TREE_TYPE (rhs), lhstype);
5869 return error_mark_node;
5873 if (TREE_CODE (rhs) == BASELINK)
5874 rhs = BASELINK_FUNCTIONS (rhs);
5876 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
5877 deduce any type information. */
5878 if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR)
5880 if (flags & tf_error)
5881 error ("not enough type information");
5882 return error_mark_node;
5885 /* We don't overwrite rhs if it is an overloaded function.
5886 Copying it would destroy the tree link. */
5887 if (TREE_CODE (rhs) != OVERLOAD)
5888 rhs = copy_node (rhs);
5890 /* This should really only be used when attempting to distinguish
5891 what sort of a pointer to function we have. For now, any
5892 arithmetic operation which is not supported on pointers
5893 is rejected as an error. */
5895 switch (TREE_CODE (rhs))
5908 new_rhs = instantiate_type (build_pointer_type (lhstype),
5909 TREE_OPERAND (rhs, 0), flags);
5910 if (new_rhs == error_mark_node)
5911 return error_mark_node;
5913 TREE_TYPE (rhs) = lhstype;
5914 TREE_OPERAND (rhs, 0) = new_rhs;
5919 rhs = copy_node (TREE_OPERAND (rhs, 0));
5920 TREE_TYPE (rhs) = unknown_type_node;
5921 return instantiate_type (lhstype, rhs, flags);
5925 tree member = TREE_OPERAND (rhs, 1);
5927 member = instantiate_type (lhstype, member, flags);
5928 if (member != error_mark_node
5929 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
5930 /* Do not lose object's side effects. */
5931 return build2 (COMPOUND_EXPR, TREE_TYPE (member),
5932 TREE_OPERAND (rhs, 0), member);
5937 rhs = TREE_OPERAND (rhs, 1);
5938 if (BASELINK_P (rhs))
5939 return instantiate_type (lhstype, BASELINK_FUNCTIONS (rhs), flags_in);
5941 /* This can happen if we are forming a pointer-to-member for a
5943 gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR);
5947 case TEMPLATE_ID_EXPR:
5949 tree fns = TREE_OPERAND (rhs, 0);
5950 tree args = TREE_OPERAND (rhs, 1);
5953 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
5954 /*template_only=*/true,
5961 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
5962 /*template_only=*/false,
5963 /*explicit_targs=*/NULL_TREE);
5966 /* This is too hard for now. */
5972 TREE_OPERAND (rhs, 0)
5973 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
5974 if (TREE_OPERAND (rhs, 0) == error_mark_node)
5975 return error_mark_node;
5976 TREE_OPERAND (rhs, 1)
5977 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5978 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5979 return error_mark_node;
5981 TREE_TYPE (rhs) = lhstype;
5985 case TRUNC_DIV_EXPR:
5986 case FLOOR_DIV_EXPR:
5988 case ROUND_DIV_EXPR:
5990 case TRUNC_MOD_EXPR:
5991 case FLOOR_MOD_EXPR:
5993 case ROUND_MOD_EXPR:
5994 case FIX_ROUND_EXPR:
5995 case FIX_FLOOR_EXPR:
5997 case FIX_TRUNC_EXPR:
6012 case PREINCREMENT_EXPR:
6013 case PREDECREMENT_EXPR:
6014 case POSTINCREMENT_EXPR:
6015 case POSTDECREMENT_EXPR:
6016 if (flags & tf_error)
6017 error ("invalid operation on uninstantiated type");
6018 return error_mark_node;
6020 case TRUTH_AND_EXPR:
6022 case TRUTH_XOR_EXPR:
6029 case TRUTH_ANDIF_EXPR:
6030 case TRUTH_ORIF_EXPR:
6031 case TRUTH_NOT_EXPR:
6032 if (flags & tf_error)
6033 error ("not enough type information");
6034 return error_mark_node;
6037 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
6039 if (flags & tf_error)
6040 error ("not enough type information");
6041 return error_mark_node;
6043 TREE_OPERAND (rhs, 1)
6044 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6045 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6046 return error_mark_node;
6047 TREE_OPERAND (rhs, 2)
6048 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), flags);
6049 if (TREE_OPERAND (rhs, 2) == error_mark_node)
6050 return error_mark_node;
6052 TREE_TYPE (rhs) = lhstype;
6056 TREE_OPERAND (rhs, 1)
6057 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6058 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6059 return error_mark_node;
6061 TREE_TYPE (rhs) = lhstype;
6066 if (PTRMEM_OK_P (rhs))
6067 flags |= tf_ptrmem_ok;
6069 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6073 return error_mark_node;
6078 return error_mark_node;
6081 /* Return the name of the virtual function pointer field
6082 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6083 this may have to look back through base types to find the
6084 ultimate field name. (For single inheritance, these could
6085 all be the same name. Who knows for multiple inheritance). */
6088 get_vfield_name (tree type)
6090 tree binfo, base_binfo;
6093 for (binfo = TYPE_BINFO (type);
6094 BINFO_N_BASE_BINFOS (binfo);
6097 base_binfo = BINFO_BASE_BINFO (binfo, 0);
6099 if (BINFO_VIRTUAL_P (base_binfo)
6100 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo)))
6104 type = BINFO_TYPE (binfo);
6105 buf = alloca (sizeof (VFIELD_NAME_FORMAT) + TYPE_NAME_LENGTH (type) + 2);
6106 sprintf (buf, VFIELD_NAME_FORMAT,
6107 IDENTIFIER_POINTER (constructor_name (type)));
6108 return get_identifier (buf);
6112 print_class_statistics (void)
6114 #ifdef GATHER_STATISTICS
6115 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6116 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6119 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6120 n_vtables, n_vtable_searches);
6121 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6122 n_vtable_entries, n_vtable_elems);
6127 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6128 according to [class]:
6129 The class-name is also inserted
6130 into the scope of the class itself. For purposes of access checking,
6131 the inserted class name is treated as if it were a public member name. */
6134 build_self_reference (void)
6136 tree name = constructor_name (current_class_type);
6137 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6140 DECL_NONLOCAL (value) = 1;
6141 DECL_CONTEXT (value) = current_class_type;
6142 DECL_ARTIFICIAL (value) = 1;
6143 SET_DECL_SELF_REFERENCE_P (value);
6145 if (processing_template_decl)
6146 value = push_template_decl (value);
6148 saved_cas = current_access_specifier;
6149 current_access_specifier = access_public_node;
6150 finish_member_declaration (value);
6151 current_access_specifier = saved_cas;
6154 /* Returns 1 if TYPE contains only padding bytes. */
6157 is_empty_class (tree type)
6159 if (type == error_mark_node)
6162 if (! IS_AGGR_TYPE (type))
6165 /* In G++ 3.2, whether or not a class was empty was determined by
6166 looking at its size. */
6167 if (abi_version_at_least (2))
6168 return CLASSTYPE_EMPTY_P (type);
6170 return integer_zerop (CLASSTYPE_SIZE (type));
6173 /* Returns true if TYPE contains an empty class. */
6176 contains_empty_class_p (tree type)
6178 if (is_empty_class (type))
6180 if (CLASS_TYPE_P (type))
6187 for (binfo = TYPE_BINFO (type), i = 0;
6188 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6189 if (contains_empty_class_p (BINFO_TYPE (base_binfo)))
6191 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6192 if (TREE_CODE (field) == FIELD_DECL
6193 && !DECL_ARTIFICIAL (field)
6194 && is_empty_class (TREE_TYPE (field)))
6197 else if (TREE_CODE (type) == ARRAY_TYPE)
6198 return contains_empty_class_p (TREE_TYPE (type));
6202 /* Note that NAME was looked up while the current class was being
6203 defined and that the result of that lookup was DECL. */
6206 maybe_note_name_used_in_class (tree name, tree decl)
6208 splay_tree names_used;
6210 /* If we're not defining a class, there's nothing to do. */
6211 if (!(innermost_scope_kind() == sk_class
6212 && TYPE_BEING_DEFINED (current_class_type)))
6215 /* If there's already a binding for this NAME, then we don't have
6216 anything to worry about. */
6217 if (lookup_member (current_class_type, name,
6218 /*protect=*/0, /*want_type=*/false))
6221 if (!current_class_stack[current_class_depth - 1].names_used)
6222 current_class_stack[current_class_depth - 1].names_used
6223 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6224 names_used = current_class_stack[current_class_depth - 1].names_used;
6226 splay_tree_insert (names_used,
6227 (splay_tree_key) name,
6228 (splay_tree_value) decl);
6231 /* Note that NAME was declared (as DECL) in the current class. Check
6232 to see that the declaration is valid. */
6235 note_name_declared_in_class (tree name, tree decl)
6237 splay_tree names_used;
6240 /* Look to see if we ever used this name. */
6242 = current_class_stack[current_class_depth - 1].names_used;
6246 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6249 /* [basic.scope.class]
6251 A name N used in a class S shall refer to the same declaration
6252 in its context and when re-evaluated in the completed scope of
6254 error ("declaration of %q#D", decl);
6255 cp_error_at ("changes meaning of %qD from %q+#D",
6256 DECL_NAME (OVL_CURRENT (decl)),
6261 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6262 Secondary vtables are merged with primary vtables; this function
6263 will return the VAR_DECL for the primary vtable. */
6266 get_vtbl_decl_for_binfo (tree binfo)
6270 decl = BINFO_VTABLE (binfo);
6271 if (decl && TREE_CODE (decl) == PLUS_EXPR)
6273 gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR);
6274 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6277 gcc_assert (TREE_CODE (decl) == VAR_DECL);
6282 /* Returns the binfo for the primary base of BINFO. If the resulting
6283 BINFO is a virtual base, and it is inherited elsewhere in the
6284 hierarchy, then the returned binfo might not be the primary base of
6285 BINFO in the complete object. Check BINFO_PRIMARY_P or
6286 BINFO_LOST_PRIMARY_P to be sure. */
6289 get_primary_binfo (tree binfo)
6294 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6298 result = copied_binfo (primary_base, binfo);
6302 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6305 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
6308 fprintf (stream, "%*s", indent, "");
6312 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6313 INDENT should be zero when called from the top level; it is
6314 incremented recursively. IGO indicates the next expected BINFO in
6315 inheritance graph ordering. */
6318 dump_class_hierarchy_r (FILE *stream,
6328 indented = maybe_indent_hierarchy (stream, indent, 0);
6329 fprintf (stream, "%s (0x%lx) ",
6330 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER),
6331 (unsigned long) binfo);
6334 fprintf (stream, "alternative-path\n");
6337 igo = TREE_CHAIN (binfo);
6339 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
6340 tree_low_cst (BINFO_OFFSET (binfo), 0));
6341 if (is_empty_class (BINFO_TYPE (binfo)))
6342 fprintf (stream, " empty");
6343 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
6344 fprintf (stream, " nearly-empty");
6345 if (BINFO_VIRTUAL_P (binfo))
6346 fprintf (stream, " virtual");
6347 fprintf (stream, "\n");
6350 if (BINFO_PRIMARY_P (binfo))
6352 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6353 fprintf (stream, " primary-for %s (0x%lx)",
6354 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
6355 TFF_PLAIN_IDENTIFIER),
6356 (unsigned long)BINFO_INHERITANCE_CHAIN (binfo));
6358 if (BINFO_LOST_PRIMARY_P (binfo))
6360 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6361 fprintf (stream, " lost-primary");
6364 fprintf (stream, "\n");
6366 if (!(flags & TDF_SLIM))
6370 if (BINFO_SUBVTT_INDEX (binfo))
6372 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6373 fprintf (stream, " subvttidx=%s",
6374 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
6375 TFF_PLAIN_IDENTIFIER));
6377 if (BINFO_VPTR_INDEX (binfo))
6379 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6380 fprintf (stream, " vptridx=%s",
6381 expr_as_string (BINFO_VPTR_INDEX (binfo),
6382 TFF_PLAIN_IDENTIFIER));
6384 if (BINFO_VPTR_FIELD (binfo))
6386 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6387 fprintf (stream, " vbaseoffset=%s",
6388 expr_as_string (BINFO_VPTR_FIELD (binfo),
6389 TFF_PLAIN_IDENTIFIER));
6391 if (BINFO_VTABLE (binfo))
6393 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6394 fprintf (stream, " vptr=%s",
6395 expr_as_string (BINFO_VTABLE (binfo),
6396 TFF_PLAIN_IDENTIFIER));
6400 fprintf (stream, "\n");
6403 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
6404 igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2);
6409 /* Dump the BINFO hierarchy for T. */
6412 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
6414 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6415 fprintf (stream, " size=%lu align=%lu\n",
6416 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
6417 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
6418 fprintf (stream, " base size=%lu base align=%lu\n",
6419 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
6421 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
6423 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
6424 fprintf (stream, "\n");
6427 /* Debug interface to hierarchy dumping. */
6430 debug_class (tree t)
6432 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
6436 dump_class_hierarchy (tree t)
6439 FILE *stream = dump_begin (TDI_class, &flags);
6443 dump_class_hierarchy_1 (stream, flags, t);
6444 dump_end (TDI_class, stream);
6449 dump_array (FILE * stream, tree decl)
6454 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
6456 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
6458 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
6459 fprintf (stream, " %s entries",
6460 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
6461 TFF_PLAIN_IDENTIFIER));
6462 fprintf (stream, "\n");
6464 for (ix = 0, inits = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
6465 inits; ix++, inits = TREE_CHAIN (inits))
6466 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
6467 expr_as_string (TREE_VALUE (inits), TFF_PLAIN_IDENTIFIER));
6471 dump_vtable (tree t, tree binfo, tree vtable)
6474 FILE *stream = dump_begin (TDI_class, &flags);
6479 if (!(flags & TDF_SLIM))
6481 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
6483 fprintf (stream, "%s for %s",
6484 ctor_vtbl_p ? "Construction vtable" : "Vtable",
6485 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER));
6488 if (!BINFO_VIRTUAL_P (binfo))
6489 fprintf (stream, " (0x%lx instance)", (unsigned long)binfo);
6490 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6492 fprintf (stream, "\n");
6493 dump_array (stream, vtable);
6494 fprintf (stream, "\n");
6497 dump_end (TDI_class, stream);
6501 dump_vtt (tree t, tree vtt)
6504 FILE *stream = dump_begin (TDI_class, &flags);
6509 if (!(flags & TDF_SLIM))
6511 fprintf (stream, "VTT for %s\n",
6512 type_as_string (t, TFF_PLAIN_IDENTIFIER));
6513 dump_array (stream, vtt);
6514 fprintf (stream, "\n");
6517 dump_end (TDI_class, stream);
6520 /* Dump a function or thunk and its thunkees. */
6523 dump_thunk (FILE *stream, int indent, tree thunk)
6525 static const char spaces[] = " ";
6526 tree name = DECL_NAME (thunk);
6529 fprintf (stream, "%.*s%p %s %s", indent, spaces,
6531 !DECL_THUNK_P (thunk) ? "function"
6532 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
6533 name ? IDENTIFIER_POINTER (name) : "<unset>");
6534 if (DECL_THUNK_P (thunk))
6536 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
6537 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
6539 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
6540 if (!virtual_adjust)
6542 else if (DECL_THIS_THUNK_P (thunk))
6543 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
6544 tree_low_cst (virtual_adjust, 0));
6546 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
6547 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
6548 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
6549 if (THUNK_ALIAS (thunk))
6550 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
6552 fprintf (stream, "\n");
6553 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
6554 dump_thunk (stream, indent + 2, thunks);
6557 /* Dump the thunks for FN. */
6560 debug_thunks (tree fn)
6562 dump_thunk (stderr, 0, fn);
6565 /* Virtual function table initialization. */
6567 /* Create all the necessary vtables for T and its base classes. */
6570 finish_vtbls (tree t)
6575 /* We lay out the primary and secondary vtables in one contiguous
6576 vtable. The primary vtable is first, followed by the non-virtual
6577 secondary vtables in inheritance graph order. */
6578 list = build_tree_list (BINFO_VTABLE (TYPE_BINFO (t)), NULL_TREE);
6579 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6580 TYPE_BINFO (t), t, list);
6582 /* Then come the virtual bases, also in inheritance graph order. */
6583 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6585 if (!BINFO_VIRTUAL_P (vbase))
6587 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6590 if (BINFO_VTABLE (TYPE_BINFO (t)))
6591 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6594 /* Initialize the vtable for BINFO with the INITS. */
6597 initialize_vtable (tree binfo, tree inits)
6601 layout_vtable_decl (binfo, list_length (inits));
6602 decl = get_vtbl_decl_for_binfo (binfo);
6603 initialize_artificial_var (decl, inits);
6604 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
6607 /* Build the VTT (virtual table table) for T.
6608 A class requires a VTT if it has virtual bases.
6611 1 - primary virtual pointer for complete object T
6612 2 - secondary VTTs for each direct non-virtual base of T which requires a
6614 3 - secondary virtual pointers for each direct or indirect base of T which
6615 has virtual bases or is reachable via a virtual path from T.
6616 4 - secondary VTTs for each direct or indirect virtual base of T.
6618 Secondary VTTs look like complete object VTTs without part 4. */
6628 /* Build up the initializers for the VTT. */
6630 index = size_zero_node;
6631 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
6633 /* If we didn't need a VTT, we're done. */
6637 /* Figure out the type of the VTT. */
6638 type = build_index_type (size_int (list_length (inits) - 1));
6639 type = build_cplus_array_type (const_ptr_type_node, type);
6641 /* Now, build the VTT object itself. */
6642 vtt = build_vtable (t, get_vtt_name (t), type);
6643 initialize_artificial_var (vtt, inits);
6644 /* Add the VTT to the vtables list. */
6645 TREE_CHAIN (vtt) = TREE_CHAIN (CLASSTYPE_VTABLES (t));
6646 TREE_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
6651 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6652 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6653 and CHAIN the vtable pointer for this binfo after construction is
6654 complete. VALUE can also be another BINFO, in which case we recurse. */
6657 binfo_ctor_vtable (tree binfo)
6663 vt = BINFO_VTABLE (binfo);
6664 if (TREE_CODE (vt) == TREE_LIST)
6665 vt = TREE_VALUE (vt);
6666 if (TREE_CODE (vt) == TREE_BINFO)
6675 /* Data for secondary VTT initialization. */
6676 typedef struct secondary_vptr_vtt_init_data_s
6678 /* Is this the primary VTT? */
6681 /* Current index into the VTT. */
6684 /* TREE_LIST of initializers built up. */
6687 /* The type being constructed by this secondary VTT. */
6688 tree type_being_constructed;
6689 } secondary_vptr_vtt_init_data;
6691 /* Recursively build the VTT-initializer for BINFO (which is in the
6692 hierarchy dominated by T). INITS points to the end of the initializer
6693 list to date. INDEX is the VTT index where the next element will be
6694 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6695 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6696 for virtual bases of T. When it is not so, we build the constructor
6697 vtables for the BINFO-in-T variant. */
6700 build_vtt_inits (tree binfo, tree t, tree *inits, tree *index)
6705 tree secondary_vptrs;
6706 secondary_vptr_vtt_init_data data;
6707 int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
6709 /* We only need VTTs for subobjects with virtual bases. */
6710 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
6713 /* We need to use a construction vtable if this is not the primary
6717 build_ctor_vtbl_group (binfo, t);
6719 /* Record the offset in the VTT where this sub-VTT can be found. */
6720 BINFO_SUBVTT_INDEX (binfo) = *index;
6723 /* Add the address of the primary vtable for the complete object. */
6724 init = binfo_ctor_vtable (binfo);
6725 *inits = build_tree_list (NULL_TREE, init);
6726 inits = &TREE_CHAIN (*inits);
6729 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6730 BINFO_VPTR_INDEX (binfo) = *index;
6732 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6734 /* Recursively add the secondary VTTs for non-virtual bases. */
6735 for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i)
6736 if (!BINFO_VIRTUAL_P (b))
6737 inits = build_vtt_inits (b, t, inits, index);
6739 /* Add secondary virtual pointers for all subobjects of BINFO with
6740 either virtual bases or reachable along a virtual path, except
6741 subobjects that are non-virtual primary bases. */
6742 data.top_level_p = top_level_p;
6743 data.index = *index;
6745 data.type_being_constructed = BINFO_TYPE (binfo);
6747 dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data);
6749 *index = data.index;
6751 /* The secondary vptrs come back in reverse order. After we reverse
6752 them, and add the INITS, the last init will be the first element
6754 secondary_vptrs = data.inits;
6755 if (secondary_vptrs)
6757 *inits = nreverse (secondary_vptrs);
6758 inits = &TREE_CHAIN (secondary_vptrs);
6759 gcc_assert (*inits == NULL_TREE);
6763 /* Add the secondary VTTs for virtual bases in inheritance graph
6765 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6767 if (!BINFO_VIRTUAL_P (b))
6770 inits = build_vtt_inits (b, t, inits, index);
6773 /* Remove the ctor vtables we created. */
6774 dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo);
6779 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
6780 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
6783 dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_)
6785 secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_;
6787 /* We don't care about bases that don't have vtables. */
6788 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6789 return dfs_skip_bases;
6791 /* We're only interested in proper subobjects of the type being
6793 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed))
6796 /* We're only interested in bases with virtual bases or reachable
6797 via a virtual path from the type being constructed. */
6798 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6799 || binfo_via_virtual (binfo, data->type_being_constructed)))
6800 return dfs_skip_bases;
6802 /* We're not interested in non-virtual primary bases. */
6803 if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo))
6806 /* Record the index where this secondary vptr can be found. */
6807 if (data->top_level_p)
6809 gcc_assert (!BINFO_VPTR_INDEX (binfo));
6810 BINFO_VPTR_INDEX (binfo) = data->index;
6812 if (BINFO_VIRTUAL_P (binfo))
6814 /* It's a primary virtual base, and this is not a
6815 construction vtable. Find the base this is primary of in
6816 the inheritance graph, and use that base's vtable
6818 while (BINFO_PRIMARY_P (binfo))
6819 binfo = BINFO_INHERITANCE_CHAIN (binfo);
6823 /* Add the initializer for the secondary vptr itself. */
6824 data->inits = tree_cons (NULL_TREE, binfo_ctor_vtable (binfo), data->inits);
6826 /* Advance the vtt index. */
6827 data->index = size_binop (PLUS_EXPR, data->index,
6828 TYPE_SIZE_UNIT (ptr_type_node));
6833 /* Called from build_vtt_inits via dfs_walk. After building
6834 constructor vtables and generating the sub-vtt from them, we need
6835 to restore the BINFO_VTABLES that were scribbled on. DATA is the
6836 binfo of the base whose sub vtt was generated. */
6839 dfs_fixup_binfo_vtbls (tree binfo, void* data)
6841 tree vtable = BINFO_VTABLE (binfo);
6843 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6844 /* If this class has no vtable, none of its bases do. */
6845 return dfs_skip_bases;
6848 /* This might be a primary base, so have no vtable in this
6852 /* If we scribbled the construction vtable vptr into BINFO, clear it
6854 if (TREE_CODE (vtable) == TREE_LIST
6855 && (TREE_PURPOSE (vtable) == (tree) data))
6856 BINFO_VTABLE (binfo) = TREE_CHAIN (vtable);
6861 /* Build the construction vtable group for BINFO which is in the
6862 hierarchy dominated by T. */
6865 build_ctor_vtbl_group (tree binfo, tree t)
6874 /* See if we've already created this construction vtable group. */
6875 id = mangle_ctor_vtbl_for_type (t, binfo);
6876 if (IDENTIFIER_GLOBAL_VALUE (id))
6879 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t));
6880 /* Build a version of VTBL (with the wrong type) for use in
6881 constructing the addresses of secondary vtables in the
6882 construction vtable group. */
6883 vtbl = build_vtable (t, id, ptr_type_node);
6884 DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1;
6885 list = build_tree_list (vtbl, NULL_TREE);
6886 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
6889 /* Add the vtables for each of our virtual bases using the vbase in T
6891 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
6893 vbase = TREE_CHAIN (vbase))
6897 if (!BINFO_VIRTUAL_P (vbase))
6899 b = copied_binfo (vbase, binfo);
6901 accumulate_vtbl_inits (b, vbase, binfo, t, list);
6903 inits = TREE_VALUE (list);
6905 /* Figure out the type of the construction vtable. */
6906 type = build_index_type (size_int (list_length (inits) - 1));
6907 type = build_cplus_array_type (vtable_entry_type, type);
6908 TREE_TYPE (vtbl) = type;
6910 /* Initialize the construction vtable. */
6911 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
6912 initialize_artificial_var (vtbl, inits);
6913 dump_vtable (t, binfo, vtbl);
6916 /* Add the vtbl initializers for BINFO (and its bases other than
6917 non-virtual primaries) to the list of INITS. BINFO is in the
6918 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
6919 the constructor the vtbl inits should be accumulated for. (If this
6920 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
6921 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
6922 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
6923 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
6924 but are not necessarily the same in terms of layout. */
6927 accumulate_vtbl_inits (tree binfo,
6935 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
6937 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo)));
6939 /* If it doesn't have a vptr, we don't do anything. */
6940 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
6943 /* If we're building a construction vtable, we're not interested in
6944 subobjects that don't require construction vtables. */
6946 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
6947 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
6950 /* Build the initializers for the BINFO-in-T vtable. */
6952 = chainon (TREE_VALUE (inits),
6953 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
6954 rtti_binfo, t, inits));
6956 /* Walk the BINFO and its bases. We walk in preorder so that as we
6957 initialize each vtable we can figure out at what offset the
6958 secondary vtable lies from the primary vtable. We can't use
6959 dfs_walk here because we need to iterate through bases of BINFO
6960 and RTTI_BINFO simultaneously. */
6961 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
6963 /* Skip virtual bases. */
6964 if (BINFO_VIRTUAL_P (base_binfo))
6966 accumulate_vtbl_inits (base_binfo,
6967 BINFO_BASE_BINFO (orig_binfo, i),
6973 /* Called from accumulate_vtbl_inits. Returns the initializers for
6974 the BINFO vtable. */
6977 dfs_accumulate_vtbl_inits (tree binfo,
6983 tree inits = NULL_TREE;
6984 tree vtbl = NULL_TREE;
6985 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
6988 && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
6990 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
6991 primary virtual base. If it is not the same primary in
6992 the hierarchy of T, we'll need to generate a ctor vtable
6993 for it, to place at its location in T. If it is the same
6994 primary, we still need a VTT entry for the vtable, but it
6995 should point to the ctor vtable for the base it is a
6996 primary for within the sub-hierarchy of RTTI_BINFO.
6998 There are three possible cases:
7000 1) We are in the same place.
7001 2) We are a primary base within a lost primary virtual base of
7003 3) We are primary to something not a base of RTTI_BINFO. */
7006 tree last = NULL_TREE;
7008 /* First, look through the bases we are primary to for RTTI_BINFO
7009 or a virtual base. */
7011 while (BINFO_PRIMARY_P (b))
7013 b = BINFO_INHERITANCE_CHAIN (b);
7015 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7018 /* If we run out of primary links, keep looking down our
7019 inheritance chain; we might be an indirect primary. */
7020 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
7021 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
7025 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7026 base B and it is a base of RTTI_BINFO, this is case 2. In
7027 either case, we share our vtable with LAST, i.e. the
7028 derived-most base within B of which we are a primary. */
7030 || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo))))
7031 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7032 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7033 binfo_ctor_vtable after everything's been set up. */
7036 /* Otherwise, this is case 3 and we get our own. */
7038 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
7046 /* Compute the initializer for this vtable. */
7047 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7050 /* Figure out the position to which the VPTR should point. */
7051 vtbl = TREE_PURPOSE (l);
7052 vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, vtbl);
7053 index = size_binop (PLUS_EXPR,
7054 size_int (non_fn_entries),
7055 size_int (list_length (TREE_VALUE (l))));
7056 index = size_binop (MULT_EXPR,
7057 TYPE_SIZE_UNIT (vtable_entry_type),
7059 vtbl = build2 (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7063 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7064 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7065 straighten this out. */
7066 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7067 else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo))
7070 /* For an ordinary vtable, set BINFO_VTABLE. */
7071 BINFO_VTABLE (binfo) = vtbl;
7076 static GTY(()) tree abort_fndecl_addr;
7078 /* Construct the initializer for BINFO's virtual function table. BINFO
7079 is part of the hierarchy dominated by T. If we're building a
7080 construction vtable, the ORIG_BINFO is the binfo we should use to
7081 find the actual function pointers to put in the vtable - but they
7082 can be overridden on the path to most-derived in the graph that
7083 ORIG_BINFO belongs. Otherwise,
7084 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7085 BINFO that should be indicated by the RTTI information in the
7086 vtable; it will be a base class of T, rather than T itself, if we
7087 are building a construction vtable.
7089 The value returned is a TREE_LIST suitable for wrapping in a
7090 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7091 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7092 number of non-function entries in the vtable.
7094 It might seem that this function should never be called with a
7095 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7096 base is always subsumed by a derived class vtable. However, when
7097 we are building construction vtables, we do build vtables for
7098 primary bases; we need these while the primary base is being
7102 build_vtbl_initializer (tree binfo,
7106 int* non_fn_entries_p)
7115 /* Initialize VID. */
7116 memset (&vid, 0, sizeof (vid));
7119 vid.rtti_binfo = rtti_binfo;
7120 vid.last_init = &vid.inits;
7121 vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
7122 vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
7123 vid.generate_vcall_entries = true;
7124 /* The first vbase or vcall offset is at index -3 in the vtable. */
7125 vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
7127 /* Add entries to the vtable for RTTI. */
7128 build_rtti_vtbl_entries (binfo, &vid);
7130 /* Create an array for keeping track of the functions we've
7131 processed. When we see multiple functions with the same
7132 signature, we share the vcall offsets. */
7133 VARRAY_TREE_INIT (vid.fns, 32, "fns");
7134 /* Add the vcall and vbase offset entries. */
7135 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7137 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7138 build_vbase_offset_vtbl_entries. */
7139 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
7140 VEC_iterate (tree, vbases, ix, vbinfo); ix++)
7141 BINFO_VTABLE_PATH_MARKED (vbinfo) = 0;
7143 /* If the target requires padding between data entries, add that now. */
7144 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
7148 for (prev = &vid.inits; (cur = *prev); prev = &TREE_CHAIN (cur))
7153 for (i = 1; i < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++i)
7154 add = tree_cons (NULL_TREE,
7155 build1 (NOP_EXPR, vtable_entry_type,
7162 if (non_fn_entries_p)
7163 *non_fn_entries_p = list_length (vid.inits);
7165 /* Go through all the ordinary virtual functions, building up
7167 vfun_inits = NULL_TREE;
7168 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7172 tree fn, fn_original;
7173 tree init = NULL_TREE;
7177 if (DECL_THUNK_P (fn))
7179 if (!DECL_NAME (fn))
7181 if (THUNK_ALIAS (fn))
7183 fn = THUNK_ALIAS (fn);
7186 fn_original = THUNK_TARGET (fn);
7189 /* If the only definition of this function signature along our
7190 primary base chain is from a lost primary, this vtable slot will
7191 never be used, so just zero it out. This is important to avoid
7192 requiring extra thunks which cannot be generated with the function.
7194 We first check this in update_vtable_entry_for_fn, so we handle
7195 restored primary bases properly; we also need to do it here so we
7196 zero out unused slots in ctor vtables, rather than filling themff
7197 with erroneous values (though harmless, apart from relocation
7199 for (b = binfo; ; b = get_primary_binfo (b))
7201 /* We found a defn before a lost primary; go ahead as normal. */
7202 if (look_for_overrides_here (BINFO_TYPE (b), fn_original))
7205 /* The nearest definition is from a lost primary; clear the
7207 if (BINFO_LOST_PRIMARY_P (b))
7209 init = size_zero_node;
7216 /* Pull the offset for `this', and the function to call, out of
7218 delta = BV_DELTA (v);
7219 vcall_index = BV_VCALL_INDEX (v);
7221 gcc_assert (TREE_CODE (delta) == INTEGER_CST);
7222 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7224 /* You can't call an abstract virtual function; it's abstract.
7225 So, we replace these functions with __pure_virtual. */
7226 if (DECL_PURE_VIRTUAL_P (fn_original))
7229 if (abort_fndecl_addr == NULL)
7230 abort_fndecl_addr = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7231 init = abort_fndecl_addr;
7235 if (!integer_zerop (delta) || vcall_index)
7237 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
7238 if (!DECL_NAME (fn))
7241 /* Take the address of the function, considering it to be of an
7242 appropriate generic type. */
7243 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7247 /* And add it to the chain of initializers. */
7248 if (TARGET_VTABLE_USES_DESCRIPTORS)
7251 if (init == size_zero_node)
7252 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7253 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7255 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7257 tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node,
7258 TREE_OPERAND (init, 0),
7259 build_int_cst (NULL_TREE, i));
7260 TREE_CONSTANT (fdesc) = 1;
7261 TREE_INVARIANT (fdesc) = 1;
7263 vfun_inits = tree_cons (NULL_TREE, fdesc, vfun_inits);
7267 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7270 /* The initializers for virtual functions were built up in reverse
7271 order; straighten them out now. */
7272 vfun_inits = nreverse (vfun_inits);
7274 /* The negative offset initializers are also in reverse order. */
7275 vid.inits = nreverse (vid.inits);
7277 /* Chain the two together. */
7278 return chainon (vid.inits, vfun_inits);
7281 /* Adds to vid->inits the initializers for the vbase and vcall
7282 offsets in BINFO, which is in the hierarchy dominated by T. */
7285 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
7289 /* If this is a derived class, we must first create entries
7290 corresponding to the primary base class. */
7291 b = get_primary_binfo (binfo);
7293 build_vcall_and_vbase_vtbl_entries (b, vid);
7295 /* Add the vbase entries for this base. */
7296 build_vbase_offset_vtbl_entries (binfo, vid);
7297 /* Add the vcall entries for this base. */
7298 build_vcall_offset_vtbl_entries (binfo, vid);
7301 /* Returns the initializers for the vbase offset entries in the vtable
7302 for BINFO (which is part of the class hierarchy dominated by T), in
7303 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7304 where the next vbase offset will go. */
7307 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7311 tree non_primary_binfo;
7313 /* If there are no virtual baseclasses, then there is nothing to
7315 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
7320 /* We might be a primary base class. Go up the inheritance hierarchy
7321 until we find the most derived class of which we are a primary base:
7322 it is the offset of that which we need to use. */
7323 non_primary_binfo = binfo;
7324 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7328 /* If we have reached a virtual base, then it must be a primary
7329 base (possibly multi-level) of vid->binfo, or we wouldn't
7330 have called build_vcall_and_vbase_vtbl_entries for it. But it
7331 might be a lost primary, so just skip down to vid->binfo. */
7332 if (BINFO_VIRTUAL_P (non_primary_binfo))
7334 non_primary_binfo = vid->binfo;
7338 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7339 if (get_primary_binfo (b) != non_primary_binfo)
7341 non_primary_binfo = b;
7344 /* Go through the virtual bases, adding the offsets. */
7345 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7347 vbase = TREE_CHAIN (vbase))
7352 if (!BINFO_VIRTUAL_P (vbase))
7355 /* Find the instance of this virtual base in the complete
7357 b = copied_binfo (vbase, binfo);
7359 /* If we've already got an offset for this virtual base, we
7360 don't need another one. */
7361 if (BINFO_VTABLE_PATH_MARKED (b))
7363 BINFO_VTABLE_PATH_MARKED (b) = 1;
7365 /* Figure out where we can find this vbase offset. */
7366 delta = size_binop (MULT_EXPR,
7369 TYPE_SIZE_UNIT (vtable_entry_type)));
7370 if (vid->primary_vtbl_p)
7371 BINFO_VPTR_FIELD (b) = delta;
7373 if (binfo != TYPE_BINFO (t))
7374 /* The vbase offset had better be the same. */
7375 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase)));
7377 /* The next vbase will come at a more negative offset. */
7378 vid->index = size_binop (MINUS_EXPR, vid->index,
7379 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7381 /* The initializer is the delta from BINFO to this virtual base.
7382 The vbase offsets go in reverse inheritance-graph order, and
7383 we are walking in inheritance graph order so these end up in
7385 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
7388 = build_tree_list (NULL_TREE,
7389 fold (build1 (NOP_EXPR,
7392 vid->last_init = &TREE_CHAIN (*vid->last_init);
7396 /* Adds the initializers for the vcall offset entries in the vtable
7397 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7401 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7403 /* We only need these entries if this base is a virtual base. We
7404 compute the indices -- but do not add to the vtable -- when
7405 building the main vtable for a class. */
7406 if (BINFO_VIRTUAL_P (binfo) || binfo == TYPE_BINFO (vid->derived))
7408 /* We need a vcall offset for each of the virtual functions in this
7409 vtable. For example:
7411 class A { virtual void f (); };
7412 class B1 : virtual public A { virtual void f (); };
7413 class B2 : virtual public A { virtual void f (); };
7414 class C: public B1, public B2 { virtual void f (); };
7416 A C object has a primary base of B1, which has a primary base of A. A
7417 C also has a secondary base of B2, which no longer has a primary base
7418 of A. So the B2-in-C construction vtable needs a secondary vtable for
7419 A, which will adjust the A* to a B2* to call f. We have no way of
7420 knowing what (or even whether) this offset will be when we define B2,
7421 so we store this "vcall offset" in the A sub-vtable and look it up in
7422 a "virtual thunk" for B2::f.
7424 We need entries for all the functions in our primary vtable and
7425 in our non-virtual bases' secondary vtables. */
7427 /* If we are just computing the vcall indices -- but do not need
7428 the actual entries -- not that. */
7429 if (!BINFO_VIRTUAL_P (binfo))
7430 vid->generate_vcall_entries = false;
7431 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7432 add_vcall_offset_vtbl_entries_r (binfo, vid);
7436 /* Build vcall offsets, starting with those for BINFO. */
7439 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
7445 /* Don't walk into virtual bases -- except, of course, for the
7446 virtual base for which we are building vcall offsets. Any
7447 primary virtual base will have already had its offsets generated
7448 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7449 if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo)
7452 /* If BINFO has a primary base, process it first. */
7453 primary_binfo = get_primary_binfo (binfo);
7455 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7457 /* Add BINFO itself to the list. */
7458 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7460 /* Scan the non-primary bases of BINFO. */
7461 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7462 if (base_binfo != primary_binfo)
7463 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7466 /* Called from build_vcall_offset_vtbl_entries_r. */
7469 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
7471 /* Make entries for the rest of the virtuals. */
7472 if (abi_version_at_least (2))
7476 /* The ABI requires that the methods be processed in declaration
7477 order. G++ 3.2 used the order in the vtable. */
7478 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
7480 orig_fn = TREE_CHAIN (orig_fn))
7481 if (DECL_VINDEX (orig_fn))
7482 add_vcall_offset (orig_fn, binfo, vid);
7486 tree derived_virtuals;
7489 /* If BINFO is a primary base, the most derived class which has
7490 BINFO as a primary base; otherwise, just BINFO. */
7491 tree non_primary_binfo;
7493 /* We might be a primary base class. Go up the inheritance hierarchy
7494 until we find the most derived class of which we are a primary base:
7495 it is the BINFO_VIRTUALS there that we need to consider. */
7496 non_primary_binfo = binfo;
7497 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7501 /* If we have reached a virtual base, then it must be vid->vbase,
7502 because we ignore other virtual bases in
7503 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7504 base (possibly multi-level) of vid->binfo, or we wouldn't
7505 have called build_vcall_and_vbase_vtbl_entries for it. But it
7506 might be a lost primary, so just skip down to vid->binfo. */
7507 if (BINFO_VIRTUAL_P (non_primary_binfo))
7509 gcc_assert (non_primary_binfo == vid->vbase);
7510 non_primary_binfo = vid->binfo;
7514 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7515 if (get_primary_binfo (b) != non_primary_binfo)
7517 non_primary_binfo = b;
7520 if (vid->ctor_vtbl_p)
7521 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7522 where rtti_binfo is the most derived type. */
7524 = original_binfo (non_primary_binfo, vid->rtti_binfo);
7526 for (base_virtuals = BINFO_VIRTUALS (binfo),
7527 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7528 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7530 base_virtuals = TREE_CHAIN (base_virtuals),
7531 derived_virtuals = TREE_CHAIN (derived_virtuals),
7532 orig_virtuals = TREE_CHAIN (orig_virtuals))
7536 /* Find the declaration that originally caused this function to
7537 be present in BINFO_TYPE (binfo). */
7538 orig_fn = BV_FN (orig_virtuals);
7540 /* When processing BINFO, we only want to generate vcall slots for
7541 function slots introduced in BINFO. So don't try to generate
7542 one if the function isn't even defined in BINFO. */
7543 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn)))
7546 add_vcall_offset (orig_fn, binfo, vid);
7551 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7554 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
7559 /* If there is already an entry for a function with the same
7560 signature as FN, then we do not need a second vcall offset.
7561 Check the list of functions already present in the derived
7563 for (i = 0; i < VARRAY_ACTIVE_SIZE (vid->fns); ++i)
7567 derived_entry = VARRAY_TREE (vid->fns, i);
7568 if (same_signature_p (derived_entry, orig_fn)
7569 /* We only use one vcall offset for virtual destructors,
7570 even though there are two virtual table entries. */
7571 || (DECL_DESTRUCTOR_P (derived_entry)
7572 && DECL_DESTRUCTOR_P (orig_fn)))
7576 /* If we are building these vcall offsets as part of building
7577 the vtable for the most derived class, remember the vcall
7579 if (vid->binfo == TYPE_BINFO (vid->derived))
7581 tree_pair_p elt = VEC_safe_push (tree_pair_s,
7582 CLASSTYPE_VCALL_INDICES (vid->derived),
7584 elt->purpose = orig_fn;
7585 elt->value = vid->index;
7588 /* The next vcall offset will be found at a more negative
7590 vid->index = size_binop (MINUS_EXPR, vid->index,
7591 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7593 /* Keep track of this function. */
7594 VARRAY_PUSH_TREE (vid->fns, orig_fn);
7596 if (vid->generate_vcall_entries)
7601 /* Find the overriding function. */
7602 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
7603 if (fn == error_mark_node)
7604 vcall_offset = build1 (NOP_EXPR, vtable_entry_type,
7608 base = TREE_VALUE (fn);
7610 /* The vbase we're working on is a primary base of
7611 vid->binfo. But it might be a lost primary, so its
7612 BINFO_OFFSET might be wrong, so we just use the
7613 BINFO_OFFSET from vid->binfo. */
7614 vcall_offset = size_diffop (BINFO_OFFSET (base),
7615 BINFO_OFFSET (vid->binfo));
7616 vcall_offset = fold (build1 (NOP_EXPR, vtable_entry_type,
7619 /* Add the initializer to the vtable. */
7620 *vid->last_init = build_tree_list (NULL_TREE, vcall_offset);
7621 vid->last_init = &TREE_CHAIN (*vid->last_init);
7625 /* Return vtbl initializers for the RTTI entries corresponding to the
7626 BINFO's vtable. The RTTI entries should indicate the object given
7627 by VID->rtti_binfo. */
7630 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
7639 basetype = BINFO_TYPE (binfo);
7640 t = BINFO_TYPE (vid->rtti_binfo);
7642 /* To find the complete object, we will first convert to our most
7643 primary base, and then add the offset in the vtbl to that value. */
7645 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
7646 && !BINFO_LOST_PRIMARY_P (b))
7650 primary_base = get_primary_binfo (b);
7651 gcc_assert (BINFO_PRIMARY_P (primary_base)
7652 && BINFO_INHERITANCE_CHAIN (primary_base) == b);
7655 offset = size_diffop (BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
7657 /* The second entry is the address of the typeinfo object. */
7659 decl = build_address (get_tinfo_decl (t));
7661 decl = integer_zero_node;
7663 /* Convert the declaration to a type that can be stored in the
7665 init = build_nop (vfunc_ptr_type_node, decl);
7666 *vid->last_init = build_tree_list (NULL_TREE, init);
7667 vid->last_init = &TREE_CHAIN (*vid->last_init);
7669 /* Add the offset-to-top entry. It comes earlier in the vtable that
7670 the the typeinfo entry. Convert the offset to look like a
7671 function pointer, so that we can put it in the vtable. */
7672 init = build_nop (vfunc_ptr_type_node, offset);
7673 *vid->last_init = build_tree_list (NULL_TREE, init);
7674 vid->last_init = &TREE_CHAIN (*vid->last_init);
7677 /* Fold a OBJ_TYPE_REF expression to the address of a function.
7678 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
7681 cp_fold_obj_type_ref (tree ref, tree known_type)
7683 HOST_WIDE_INT index = tree_low_cst (OBJ_TYPE_REF_TOKEN (ref), 1);
7684 HOST_WIDE_INT i = 0;
7685 tree v = BINFO_VIRTUALS (TYPE_BINFO (known_type));
7690 i += (TARGET_VTABLE_USES_DESCRIPTORS
7691 ? TARGET_VTABLE_USES_DESCRIPTORS : 1);
7697 #ifdef ENABLE_CHECKING
7698 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref),
7699 DECL_VINDEX (fndecl)));
7702 return build_address (fndecl);
7705 #include "gt-cp-class.h"