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 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"
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
43 int current_class_depth;
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
49 typedef struct class_stack_node {
50 /* The name of the class. */
53 /* The _TYPE node for the class. */
56 /* The access specifier pending for new declarations in the scope of
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used;
62 }* class_stack_node_t;
64 typedef struct vtbl_init_data_s
66 /* The base for which we're building initializers. */
68 /* The type of the most-derived type. */
70 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
71 unless ctor_vtbl_p is true. */
73 /* The negative-index vtable initializers built up so far. These
74 are in order from least negative index to most negative index. */
76 /* The last (i.e., most negative) entry in INITS. */
78 /* The binfo for the virtual base for which we're building
79 vcall offset initializers. */
81 /* The functions in vbase for which we have already provided vcall
84 /* The vtable index of the next vcall or vbase offset. */
86 /* Nonzero if we are building the initializer for the primary
89 /* Nonzero if we are building the initializer for a construction
92 /* True when adding vcall offset entries to the vtable. False when
93 merely computing the indices. */
94 bool generate_vcall_entries;
97 /* The type of a function passed to walk_subobject_offsets. */
98 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
100 /* The stack itself. This is a dynamically resized array. The
101 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
102 static int current_class_stack_size;
103 static class_stack_node_t current_class_stack;
105 /* An array of all local classes present in this translation unit, in
106 declaration order. */
107 varray_type local_classes;
109 static tree get_vfield_name (tree);
110 static void finish_struct_anon (tree);
111 static tree get_vtable_name (tree);
112 static tree get_basefndecls (tree, tree);
113 static int build_primary_vtable (tree, tree);
114 static int build_secondary_vtable (tree);
115 static void finish_vtbls (tree);
116 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
117 static tree delete_duplicate_fields_1 (tree, tree);
118 static void delete_duplicate_fields (tree);
119 static void finish_struct_bits (tree);
120 static int alter_access (tree, tree, tree);
121 static void handle_using_decl (tree, tree);
122 static void check_for_override (tree, tree);
123 static tree dfs_modify_vtables (tree, void *);
124 static tree modify_all_vtables (tree, tree);
125 static void determine_primary_base (tree);
126 static void finish_struct_methods (tree);
127 static void maybe_warn_about_overly_private_class (tree);
128 static int method_name_cmp (const void *, const void *);
129 static int resort_method_name_cmp (const void *, const void *);
130 static void add_implicitly_declared_members (tree, int, int, int);
131 static tree fixed_type_or_null (tree, int *, int *);
132 static tree resolve_address_of_overloaded_function (tree, tree, tsubst_flags_t,
134 static tree build_vtbl_ref_1 (tree, tree);
135 static tree build_vtbl_initializer (tree, tree, tree, tree, int *);
136 static int count_fields (tree);
137 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
138 static void check_bitfield_decl (tree);
139 static void check_field_decl (tree, tree, int *, int *, int *, int *);
140 static void check_field_decls (tree, tree *, int *, int *, int *);
141 static tree *build_base_field (record_layout_info, tree, splay_tree, tree *);
142 static void build_base_fields (record_layout_info, splay_tree, tree *);
143 static void check_methods (tree);
144 static void remove_zero_width_bit_fields (tree);
145 static void check_bases (tree, int *, int *, int *);
146 static void check_bases_and_members (tree);
147 static tree create_vtable_ptr (tree, tree *);
148 static void include_empty_classes (record_layout_info);
149 static void layout_class_type (tree, tree *);
150 static void fixup_pending_inline (tree);
151 static void fixup_inline_methods (tree);
152 static void set_primary_base (tree, tree);
153 static void propagate_binfo_offsets (tree, tree);
154 static void layout_virtual_bases (record_layout_info, splay_tree);
155 static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *);
156 static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *);
157 static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *);
158 static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *);
159 static void add_vcall_offset (tree, tree, vtbl_init_data *);
160 static void layout_vtable_decl (tree, int);
161 static tree dfs_find_final_overrider (tree, void *);
162 static tree dfs_find_final_overrider_post (tree, void *);
163 static tree dfs_find_final_overrider_q (tree, int, void *);
164 static tree find_final_overrider (tree, tree, tree);
165 static int make_new_vtable (tree, tree);
166 static int maybe_indent_hierarchy (FILE *, int, int);
167 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
168 static void dump_class_hierarchy (tree);
169 static void dump_class_hierarchy_1 (FILE *, int, tree);
170 static void dump_array (FILE *, tree);
171 static void dump_vtable (tree, tree, tree);
172 static void dump_vtt (tree, tree);
173 static void dump_thunk (FILE *, int, tree);
174 static tree build_vtable (tree, tree, tree);
175 static void initialize_vtable (tree, tree);
176 static void initialize_array (tree, tree);
177 static void layout_nonempty_base_or_field (record_layout_info,
178 tree, tree, splay_tree);
179 static tree end_of_class (tree, int);
180 static bool layout_empty_base (tree, tree, splay_tree);
181 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree);
182 static tree dfs_accumulate_vtbl_inits (tree, tree, tree, tree,
184 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
185 static void build_vcall_and_vbase_vtbl_entries (tree,
187 static void mark_primary_bases (tree);
188 static void clone_constructors_and_destructors (tree);
189 static tree build_clone (tree, tree);
190 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
191 static tree copy_virtuals (tree);
192 static void build_ctor_vtbl_group (tree, tree);
193 static void build_vtt (tree);
194 static tree binfo_ctor_vtable (tree);
195 static tree *build_vtt_inits (tree, tree, tree *, tree *);
196 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
197 static tree dfs_ctor_vtable_bases_queue_p (tree, int, void *data);
198 static tree dfs_fixup_binfo_vtbls (tree, void *);
199 static int record_subobject_offset (tree, tree, splay_tree);
200 static int check_subobject_offset (tree, tree, splay_tree);
201 static int walk_subobject_offsets (tree, subobject_offset_fn,
202 tree, splay_tree, tree, int);
203 static void record_subobject_offsets (tree, tree, splay_tree, int);
204 static int layout_conflict_p (tree, tree, splay_tree, int);
205 static int splay_tree_compare_integer_csts (splay_tree_key k1,
207 static void warn_about_ambiguous_bases (tree);
208 static bool type_requires_array_cookie (tree);
209 static bool contains_empty_class_p (tree);
210 static bool base_derived_from (tree, tree);
211 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
212 static tree end_of_base (tree);
213 static tree get_vcall_index (tree, tree);
215 /* Macros for dfs walking during vtt construction. See
216 dfs_ctor_vtable_bases_queue_p, dfs_build_secondary_vptr_vtt_inits
217 and dfs_fixup_binfo_vtbls. */
218 #define VTT_TOP_LEVEL_P(NODE) TREE_UNSIGNED (NODE)
219 #define VTT_MARKED_BINFO_P(NODE) TREE_USED (NODE)
221 /* Variables shared between class.c and call.c. */
223 #ifdef GATHER_STATISTICS
225 int n_vtable_entries = 0;
226 int n_vtable_searches = 0;
227 int n_vtable_elems = 0;
228 int n_convert_harshness = 0;
229 int n_compute_conversion_costs = 0;
230 int n_build_method_call = 0;
231 int n_inner_fields_searched = 0;
234 /* Convert to or from a base subobject. EXPR is an expression of type
235 `A' or `A*', an expression of type `B' or `B*' is returned. To
236 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
237 the B base instance within A. To convert base A to derived B, CODE
238 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
239 In this latter case, A must not be a morally virtual base of B.
240 NONNULL is true if EXPR is known to be non-NULL (this is only
241 needed when EXPR is of pointer type). CV qualifiers are preserved
245 build_base_path (enum tree_code code,
250 tree v_binfo = NULL_TREE;
251 tree d_binfo = NULL_TREE;
255 tree null_test = NULL;
256 tree ptr_target_type;
258 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
260 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
261 return error_mark_node;
263 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
266 if (!v_binfo && TREE_VIA_VIRTUAL (probe))
270 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
272 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
274 my_friendly_assert (code == MINUS_EXPR
275 ? same_type_p (BINFO_TYPE (binfo), probe)
277 ? same_type_p (BINFO_TYPE (d_binfo), probe)
280 if (code == MINUS_EXPR && v_binfo)
282 error ("cannot convert from base `%T' to derived type `%T' via virtual base `%T'",
283 BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo));
284 return error_mark_node;
288 /* This must happen before the call to save_expr. */
289 expr = build_unary_op (ADDR_EXPR, expr, 0);
291 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
292 if (fixed_type_p <= 0 && TREE_SIDE_EFFECTS (expr))
293 expr = save_expr (expr);
295 if (want_pointer && !nonnull)
296 null_test = build (EQ_EXPR, boolean_type_node, expr, integer_zero_node);
298 offset = BINFO_OFFSET (binfo);
300 if (v_binfo && fixed_type_p <= 0)
302 /* Going via virtual base V_BINFO. We need the static offset
303 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
304 V_BINFO. That offset is an entry in D_BINFO's vtable. */
307 if (fixed_type_p < 0 && in_base_initializer)
309 /* In a base member initializer, we cannot rely on
310 the vtable being set up. We have to use the vtt_parm. */
311 tree derived = BINFO_INHERITANCE_CHAIN (v_binfo);
313 v_offset = build (PLUS_EXPR, TREE_TYPE (current_vtt_parm),
314 current_vtt_parm, BINFO_VPTR_INDEX (derived));
316 v_offset = build1 (INDIRECT_REF,
317 TREE_TYPE (TYPE_VFIELD (BINFO_TYPE (derived))),
322 v_offset = build_vfield_ref (build_indirect_ref (expr, NULL),
323 TREE_TYPE (TREE_TYPE (expr)));
325 v_offset = build (PLUS_EXPR, TREE_TYPE (v_offset),
326 v_offset, BINFO_VPTR_FIELD (v_binfo));
327 v_offset = build1 (NOP_EXPR,
328 build_pointer_type (ptrdiff_type_node),
330 v_offset = build_indirect_ref (v_offset, NULL);
331 TREE_CONSTANT (v_offset) = 1;
333 offset = convert_to_integer (ptrdiff_type_node,
335 BINFO_OFFSET (v_binfo)));
337 if (!integer_zerop (offset))
338 v_offset = build (code, ptrdiff_type_node, v_offset, offset);
340 if (fixed_type_p < 0)
341 /* Negative fixed_type_p means this is a constructor or destructor;
342 virtual base layout is fixed in in-charge [cd]tors, but not in
344 offset = build (COND_EXPR, ptrdiff_type_node,
345 build (EQ_EXPR, boolean_type_node,
346 current_in_charge_parm, integer_zero_node),
348 BINFO_OFFSET (binfo));
353 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
355 target_type = cp_build_qualified_type
356 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
357 ptr_target_type = build_pointer_type (target_type);
359 target_type = ptr_target_type;
361 expr = build1 (NOP_EXPR, ptr_target_type, expr);
363 if (!integer_zerop (offset))
364 expr = build (code, ptr_target_type, expr, offset);
369 expr = build_indirect_ref (expr, NULL);
372 expr = build (COND_EXPR, target_type, null_test,
373 build1 (NOP_EXPR, target_type, integer_zero_node),
379 /* Convert OBJECT to the base TYPE. If CHECK_ACCESS is true, an error
380 message is emitted if TYPE is inaccessible. OBJECT is assumed to
384 convert_to_base (tree object, tree type, bool check_access)
388 binfo = lookup_base (TREE_TYPE (object), type,
389 check_access ? ba_check : ba_ignore,
391 if (!binfo || binfo == error_mark_node)
392 return error_mark_node;
394 return build_base_path (PLUS_EXPR, object, binfo, /*nonnull=*/1);
397 /* EXPR is an expression with class type. BASE is a base class (a
398 BINFO) of that class type. Returns EXPR, converted to the BASE
399 type. This function assumes that EXPR is the most derived class;
400 therefore virtual bases can be found at their static offsets. */
403 convert_to_base_statically (tree expr, tree base)
407 expr_type = TREE_TYPE (expr);
408 if (!same_type_p (expr_type, BINFO_TYPE (base)))
412 pointer_type = build_pointer_type (expr_type);
413 expr = build_unary_op (ADDR_EXPR, expr, /*noconvert=*/1);
414 if (!integer_zerop (BINFO_OFFSET (base)))
415 expr = build (PLUS_EXPR, pointer_type, expr,
416 build_nop (pointer_type, BINFO_OFFSET (base)));
417 expr = build_nop (build_pointer_type (BINFO_TYPE (base)), expr);
418 expr = build1 (INDIRECT_REF, BINFO_TYPE (base), expr);
425 /* Given an object INSTANCE, return an expression which yields the
426 vtable element corresponding to INDEX. There are many special
427 cases for INSTANCE which we take care of here, mainly to avoid
428 creating extra tree nodes when we don't have to. */
431 build_vtbl_ref_1 (tree instance, tree idx)
434 tree vtbl = NULL_TREE;
436 /* Try to figure out what a reference refers to, and
437 access its virtual function table directly. */
440 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
442 tree basetype = non_reference (TREE_TYPE (instance));
444 if (fixed_type && !cdtorp)
446 tree binfo = lookup_base (fixed_type, basetype,
447 ba_ignore|ba_quiet, NULL);
449 vtbl = BINFO_VTABLE (binfo);
453 vtbl = build_vfield_ref (instance, basetype);
455 assemble_external (vtbl);
457 aref = build_array_ref (vtbl, idx);
458 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
464 build_vtbl_ref (tree instance, tree idx)
466 tree aref = build_vtbl_ref_1 (instance, idx);
471 /* Given an object INSTANCE, return an expression which yields a
472 function pointer corresponding to vtable element INDEX. */
475 build_vfn_ref (tree instance, tree idx)
477 tree aref = build_vtbl_ref_1 (instance, idx);
479 /* When using function descriptors, the address of the
480 vtable entry is treated as a function pointer. */
481 if (TARGET_VTABLE_USES_DESCRIPTORS)
482 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
483 build_unary_op (ADDR_EXPR, aref, /*noconvert=*/1));
488 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
489 for the given TYPE. */
492 get_vtable_name (tree type)
494 return mangle_vtbl_for_type (type);
497 /* Return an IDENTIFIER_NODE for the name of the virtual table table
501 get_vtt_name (tree type)
503 return mangle_vtt_for_type (type);
506 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
507 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
508 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
511 build_vtable (tree class_type, tree name, tree vtable_type)
515 decl = build_lang_decl (VAR_DECL, name, vtable_type);
516 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
517 now to avoid confusion in mangle_decl. */
518 SET_DECL_ASSEMBLER_NAME (decl, name);
519 DECL_CONTEXT (decl) = class_type;
520 DECL_ARTIFICIAL (decl) = 1;
521 TREE_STATIC (decl) = 1;
522 TREE_READONLY (decl) = 1;
523 DECL_VIRTUAL_P (decl) = 1;
524 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
525 DECL_VTABLE_OR_VTT_P (decl) = 1;
527 /* At one time the vtable info was grabbed 2 words at a time. This
528 fails on sparc unless you have 8-byte alignment. (tiemann) */
529 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
532 import_export_vtable (decl, class_type, 0);
537 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
538 or even complete. If this does not exist, create it. If COMPLETE is
539 nonzero, then complete the definition of it -- that will render it
540 impossible to actually build the vtable, but is useful to get at those
541 which are known to exist in the runtime. */
544 get_vtable_decl (tree type, int complete)
548 if (CLASSTYPE_VTABLES (type))
549 return CLASSTYPE_VTABLES (type);
551 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
552 CLASSTYPE_VTABLES (type) = decl;
556 DECL_EXTERNAL (decl) = 1;
557 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
563 /* Returns a copy of the BINFO_VIRTUALS list in BINFO. The
564 BV_VCALL_INDEX for each entry is cleared. */
567 copy_virtuals (tree binfo)
572 copies = copy_list (BINFO_VIRTUALS (binfo));
573 for (t = copies; t; t = TREE_CHAIN (t))
574 BV_VCALL_INDEX (t) = NULL_TREE;
579 /* Build the primary virtual function table for TYPE. If BINFO is
580 non-NULL, build the vtable starting with the initial approximation
581 that it is the same as the one which is the head of the association
582 list. Returns a nonzero value if a new vtable is actually
586 build_primary_vtable (tree binfo, tree type)
591 decl = get_vtable_decl (type, /*complete=*/0);
595 if (BINFO_NEW_VTABLE_MARKED (binfo))
596 /* We have already created a vtable for this base, so there's
597 no need to do it again. */
600 virtuals = copy_virtuals (binfo);
601 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
602 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
603 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
607 my_friendly_assert (TREE_TYPE (decl) == vtbl_type_node, 20000118);
608 virtuals = NULL_TREE;
611 #ifdef GATHER_STATISTICS
613 n_vtable_elems += list_length (virtuals);
616 /* Initialize the association list for this type, based
617 on our first approximation. */
618 TYPE_BINFO_VTABLE (type) = decl;
619 TYPE_BINFO_VIRTUALS (type) = virtuals;
620 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
624 /* Give BINFO a new virtual function table which is initialized
625 with a skeleton-copy of its original initialization. The only
626 entry that changes is the `delta' entry, so we can really
627 share a lot of structure.
629 FOR_TYPE is the most derived type which caused this table to
632 Returns nonzero if we haven't met BINFO before.
634 The order in which vtables are built (by calling this function) for
635 an object must remain the same, otherwise a binary incompatibility
639 build_secondary_vtable (tree binfo)
641 if (BINFO_NEW_VTABLE_MARKED (binfo))
642 /* We already created a vtable for this base. There's no need to
646 /* Remember that we've created a vtable for this BINFO, so that we
647 don't try to do so again. */
648 SET_BINFO_NEW_VTABLE_MARKED (binfo);
650 /* Make fresh virtual list, so we can smash it later. */
651 BINFO_VIRTUALS (binfo) = copy_virtuals (binfo);
653 /* Secondary vtables are laid out as part of the same structure as
654 the primary vtable. */
655 BINFO_VTABLE (binfo) = NULL_TREE;
659 /* Create a new vtable for BINFO which is the hierarchy dominated by
660 T. Return nonzero if we actually created a new vtable. */
663 make_new_vtable (tree t, tree binfo)
665 if (binfo == TYPE_BINFO (t))
666 /* In this case, it is *type*'s vtable we are modifying. We start
667 with the approximation that its vtable is that of the
668 immediate base class. */
669 /* ??? This actually passes TYPE_BINFO (t), not the primary base binfo,
670 since we've updated DECL_CONTEXT (TYPE_VFIELD (t)) by now. */
671 return build_primary_vtable (TYPE_BINFO (DECL_CONTEXT (TYPE_VFIELD (t))),
674 /* This is our very own copy of `basetype' to play with. Later,
675 we will fill in all the virtual functions that override the
676 virtual functions in these base classes which are not defined
677 by the current type. */
678 return build_secondary_vtable (binfo);
681 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
682 (which is in the hierarchy dominated by T) list FNDECL as its
683 BV_FN. DELTA is the required constant adjustment from the `this'
684 pointer where the vtable entry appears to the `this' required when
685 the function is actually called. */
688 modify_vtable_entry (tree t,
698 if (fndecl != BV_FN (v)
699 || !tree_int_cst_equal (delta, BV_DELTA (v)))
701 /* We need a new vtable for BINFO. */
702 if (make_new_vtable (t, binfo))
704 /* If we really did make a new vtable, we also made a copy
705 of the BINFO_VIRTUALS list. Now, we have to find the
706 corresponding entry in that list. */
707 *virtuals = BINFO_VIRTUALS (binfo);
708 while (BV_FN (*virtuals) != BV_FN (v))
709 *virtuals = TREE_CHAIN (*virtuals);
713 BV_DELTA (v) = delta;
714 BV_VCALL_INDEX (v) = NULL_TREE;
720 /* Add method METHOD to class TYPE. If ERROR_P is true, we are adding
721 the method after the class has already been defined because a
722 declaration for it was seen. (Even though that is erroneous, we
723 add the method for improved error recovery.) */
726 add_method (tree type, tree method, int error_p)
734 if (method == error_mark_node)
737 using = (DECL_CONTEXT (method) != type);
738 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
739 && DECL_TEMPLATE_CONV_FN_P (method));
741 if (!CLASSTYPE_METHOD_VEC (type))
742 /* Make a new method vector. We start with 8 entries. We must
743 allocate at least two (for constructors and destructors), and
744 we're going to end up with an assignment operator at some point
747 We could use a TREE_LIST for now, and convert it to a TREE_VEC
748 in finish_struct, but we would probably waste more memory
749 making the links in the list than we would by over-allocating
750 the size of the vector here. Furthermore, we would complicate
751 all the code that expects this to be a vector. */
752 CLASSTYPE_METHOD_VEC (type) = make_tree_vec (8);
754 method_vec = CLASSTYPE_METHOD_VEC (type);
755 len = TREE_VEC_LENGTH (method_vec);
757 /* Constructors and destructors go in special slots. */
758 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
759 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
760 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
762 slot = CLASSTYPE_DESTRUCTOR_SLOT;
763 TYPE_HAS_DESTRUCTOR (type) = 1;
765 if (TYPE_FOR_JAVA (type))
766 error (DECL_ARTIFICIAL (method)
767 ? "Java class '%T' cannot have an implicit non-trivial destructor"
768 : "Java class '%T' cannot have a destructor",
769 DECL_CONTEXT (method));
773 int have_template_convs_p = 0;
775 /* See if we already have an entry with this name. */
776 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; slot < len; ++slot)
778 tree m = TREE_VEC_ELT (method_vec, slot);
786 have_template_convs_p = (TREE_CODE (m) == TEMPLATE_DECL
787 && DECL_TEMPLATE_CONV_FN_P (m));
789 /* If we need to move things up, see if there's
791 if (!have_template_convs_p)
794 if (TREE_VEC_ELT (method_vec, slot))
799 if (DECL_NAME (m) == DECL_NAME (method))
805 /* We need a bigger method vector. */
809 /* In the non-error case, we are processing a class
810 definition. Double the size of the vector to give room
814 /* In the error case, the vector is already complete. We
815 don't expect many errors, and the rest of the front-end
816 will get confused if there are empty slots in the vector. */
820 new_vec = make_tree_vec (new_len);
821 memcpy (&TREE_VEC_ELT (new_vec, 0), &TREE_VEC_ELT (method_vec, 0),
822 len * sizeof (tree));
824 method_vec = CLASSTYPE_METHOD_VEC (type) = new_vec;
827 if (DECL_CONV_FN_P (method) && !TREE_VEC_ELT (method_vec, slot))
829 /* Type conversion operators have to come before ordinary
830 methods; add_conversions depends on this to speed up
831 looking for conversion operators. So, if necessary, we
832 slide some of the vector elements up. In theory, this
833 makes this algorithm O(N^2) but we don't expect many
834 conversion operators. */
836 slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
838 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; slot < len; ++slot)
840 tree fn = TREE_VEC_ELT (method_vec, slot);
843 /* There are no more entries in the vector, so we
844 can insert the new conversion operator here. */
847 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
848 /* We can insert the new function right at the
853 if (template_conv_p && have_template_convs_p)
855 else if (!TREE_VEC_ELT (method_vec, slot))
856 /* There is nothing in the Ith slot, so we can avoid
861 /* We know the last slot in the vector is empty
862 because we know that at this point there's room
863 for a new function. */
864 memmove (&TREE_VEC_ELT (method_vec, slot + 1),
865 &TREE_VEC_ELT (method_vec, slot),
866 (len - slot - 1) * sizeof (tree));
867 TREE_VEC_ELT (method_vec, slot) = NULL_TREE;
872 if (template_class_depth (type))
873 /* TYPE is a template class. Don't issue any errors now; wait
874 until instantiation time to complain. */
880 /* Check to see if we've already got this method. */
881 for (fns = TREE_VEC_ELT (method_vec, slot);
883 fns = OVL_NEXT (fns))
885 tree fn = OVL_CURRENT (fns);
890 if (TREE_CODE (fn) != TREE_CODE (method))
893 /* [over.load] Member function declarations with the
894 same name and the same parameter types cannot be
895 overloaded if any of them is a static member
896 function declaration.
898 [namespace.udecl] When a using-declaration brings names
899 from a base class into a derived class scope, member
900 functions in the derived class override and/or hide member
901 functions with the same name and parameter types in a base
902 class (rather than conflicting). */
903 parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn));
904 parms2 = TYPE_ARG_TYPES (TREE_TYPE (method));
906 /* Compare the quals on the 'this' parm. Don't compare
907 the whole types, as used functions are treated as
908 coming from the using class in overload resolution. */
909 if (! DECL_STATIC_FUNCTION_P (fn)
910 && ! DECL_STATIC_FUNCTION_P (method)
911 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1)))
912 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2)))))
915 /* For templates, the template parms must be identical. */
916 if (TREE_CODE (fn) == TEMPLATE_DECL
917 && !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
918 DECL_TEMPLATE_PARMS (method)))
921 if (! DECL_STATIC_FUNCTION_P (fn))
922 parms1 = TREE_CHAIN (parms1);
923 if (! DECL_STATIC_FUNCTION_P (method))
924 parms2 = TREE_CHAIN (parms2);
926 if (same && compparms (parms1, parms2)
927 && (!DECL_CONV_FN_P (fn)
928 || same_type_p (TREE_TYPE (TREE_TYPE (fn)),
929 TREE_TYPE (TREE_TYPE (method)))))
931 if (using && DECL_CONTEXT (fn) == type)
932 /* Defer to the local function. */
936 cp_error_at ("`%#D' and `%#D' cannot be overloaded",
939 /* We don't call duplicate_decls here to merge
940 the declarations because that will confuse
941 things if the methods have inline
942 definitions. In particular, we will crash
943 while processing the definitions. */
950 /* Actually insert the new method. */
951 TREE_VEC_ELT (method_vec, slot)
952 = build_overload (method, TREE_VEC_ELT (method_vec, slot));
954 /* Add the new binding. */
955 if (!DECL_CONSTRUCTOR_P (method)
956 && !DECL_DESTRUCTOR_P (method))
957 push_class_level_binding (DECL_NAME (method),
958 TREE_VEC_ELT (method_vec, slot));
961 /* Subroutines of finish_struct. */
963 /* Look through the list of fields for this struct, deleting
964 duplicates as we go. This must be recursive to handle
967 FIELD is the field which may not appear anywhere in FIELDS.
968 FIELD_PTR, if non-null, is the starting point at which
969 chained deletions may take place.
970 The value returned is the first acceptable entry found
973 Note that anonymous fields which are not of UNION_TYPE are
974 not duplicates, they are just anonymous fields. This happens
975 when we have unnamed bitfields, for example. */
978 delete_duplicate_fields_1 (tree field, tree fields)
982 if (DECL_NAME (field) == 0)
984 if (! ANON_AGGR_TYPE_P (TREE_TYPE (field)))
987 for (x = TYPE_FIELDS (TREE_TYPE (field)); x; x = TREE_CHAIN (x))
988 fields = delete_duplicate_fields_1 (x, fields);
993 for (x = fields; x; prev = x, x = TREE_CHAIN (x))
995 if (DECL_NAME (x) == 0)
997 if (! ANON_AGGR_TYPE_P (TREE_TYPE (x)))
999 TYPE_FIELDS (TREE_TYPE (x))
1000 = delete_duplicate_fields_1 (field, TYPE_FIELDS (TREE_TYPE (x)));
1001 if (TYPE_FIELDS (TREE_TYPE (x)) == 0)
1004 fields = TREE_CHAIN (fields);
1006 TREE_CHAIN (prev) = TREE_CHAIN (x);
1009 else if (TREE_CODE (field) == USING_DECL)
1010 /* A using declaration is allowed to appear more than
1011 once. We'll prune these from the field list later, and
1012 handle_using_decl will complain about invalid multiple
1015 else if (DECL_NAME (field) == DECL_NAME (x))
1017 if (TREE_CODE (field) == CONST_DECL
1018 && TREE_CODE (x) == CONST_DECL)
1019 cp_error_at ("duplicate enum value `%D'", x);
1020 else if (TREE_CODE (field) == CONST_DECL
1021 || TREE_CODE (x) == CONST_DECL)
1022 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1024 else if (DECL_DECLARES_TYPE_P (field)
1025 && DECL_DECLARES_TYPE_P (x))
1027 if (same_type_p (TREE_TYPE (field), TREE_TYPE (x)))
1029 cp_error_at ("duplicate nested type `%D'", x);
1031 else if (DECL_DECLARES_TYPE_P (field)
1032 || DECL_DECLARES_TYPE_P (x))
1034 /* Hide tag decls. */
1035 if ((TREE_CODE (field) == TYPE_DECL
1036 && DECL_ARTIFICIAL (field))
1037 || (TREE_CODE (x) == TYPE_DECL
1038 && DECL_ARTIFICIAL (x)))
1040 cp_error_at ("duplicate field `%D' (as type and non-type)",
1044 cp_error_at ("duplicate member `%D'", x);
1046 fields = TREE_CHAIN (fields);
1048 TREE_CHAIN (prev) = TREE_CHAIN (x);
1056 delete_duplicate_fields (tree fields)
1059 for (x = fields; x && TREE_CHAIN (x); x = TREE_CHAIN (x))
1060 TREE_CHAIN (x) = delete_duplicate_fields_1 (x, TREE_CHAIN (x));
1063 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1064 legit, otherwise return 0. */
1067 alter_access (tree t, tree fdecl, tree access)
1071 if (!DECL_LANG_SPECIFIC (fdecl))
1072 retrofit_lang_decl (fdecl);
1074 my_friendly_assert (!DECL_DISCRIMINATOR_P (fdecl), 20030624);
1076 elem = purpose_member (t, DECL_ACCESS (fdecl));
1079 if (TREE_VALUE (elem) != access)
1081 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1082 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl));
1084 error ("conflicting access specifications for field `%s', ignored",
1085 IDENTIFIER_POINTER (DECL_NAME (fdecl)));
1089 /* They're changing the access to the same thing they changed
1090 it to before. That's OK. */
1096 perform_or_defer_access_check (TYPE_BINFO (t), fdecl);
1097 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1103 /* Process the USING_DECL, which is a member of T. */
1106 handle_using_decl (tree using_decl, tree t)
1108 tree ctype = DECL_INITIAL (using_decl);
1109 tree name = DECL_NAME (using_decl);
1111 = TREE_PRIVATE (using_decl) ? access_private_node
1112 : TREE_PROTECTED (using_decl) ? access_protected_node
1113 : access_public_node;
1115 tree flist = NULL_TREE;
1118 if (ctype == error_mark_node)
1121 binfo = lookup_base (t, ctype, ba_any, NULL);
1124 location_t saved_loc = input_location;
1126 input_location = DECL_SOURCE_LOCATION (using_decl);
1127 error_not_base_type (ctype, t);
1128 input_location = saved_loc;
1132 if (constructor_name_p (name, ctype))
1134 cp_error_at ("`%D' names constructor", using_decl);
1137 if (constructor_name_p (name, t))
1139 cp_error_at ("`%D' invalid in `%T'", using_decl, t);
1143 fdecl = lookup_member (binfo, name, 0, false);
1147 cp_error_at ("no members matching `%D' in `%#T'", using_decl, ctype);
1151 if (BASELINK_P (fdecl))
1152 /* Ignore base type this came from. */
1153 fdecl = BASELINK_FUNCTIONS (fdecl);
1155 old_value = IDENTIFIER_CLASS_VALUE (name);
1158 if (is_overloaded_fn (old_value))
1159 old_value = OVL_CURRENT (old_value);
1161 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1164 old_value = NULL_TREE;
1167 if (is_overloaded_fn (fdecl))
1172 else if (is_overloaded_fn (old_value))
1175 /* It's OK to use functions from a base when there are functions with
1176 the same name already present in the current class. */;
1179 cp_error_at ("`%D' invalid in `%#T'", using_decl, t);
1180 cp_error_at (" because of local method `%#D' with same name",
1181 OVL_CURRENT (old_value));
1185 else if (!DECL_ARTIFICIAL (old_value))
1187 cp_error_at ("`%D' invalid in `%#T'", using_decl, t);
1188 cp_error_at (" because of local member `%#D' with same name", old_value);
1192 /* Make type T see field decl FDECL with access ACCESS. */
1194 for (; flist; flist = OVL_NEXT (flist))
1196 add_method (t, OVL_CURRENT (flist), /*error_p=*/0);
1197 alter_access (t, OVL_CURRENT (flist), access);
1200 alter_access (t, fdecl, access);
1203 /* Run through the base clases of T, updating
1204 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1205 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1209 check_bases (tree t,
1210 int* cant_have_default_ctor_p,
1211 int* cant_have_const_ctor_p,
1212 int* no_const_asn_ref_p)
1216 int seen_non_virtual_nearly_empty_base_p;
1219 binfos = TYPE_BINFO_BASETYPES (t);
1220 n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1221 seen_non_virtual_nearly_empty_base_p = 0;
1223 /* An aggregate cannot have baseclasses. */
1224 CLASSTYPE_NON_AGGREGATE (t) |= (n_baseclasses != 0);
1226 for (i = 0; i < n_baseclasses; ++i)
1231 /* Figure out what base we're looking at. */
1232 base_binfo = TREE_VEC_ELT (binfos, i);
1233 basetype = TREE_TYPE (base_binfo);
1235 /* If the type of basetype is incomplete, then we already
1236 complained about that fact (and we should have fixed it up as
1238 if (!COMPLETE_TYPE_P (basetype))
1241 /* The base type is of incomplete type. It is
1242 probably best to pretend that it does not
1244 if (i == n_baseclasses-1)
1245 TREE_VEC_ELT (binfos, i) = NULL_TREE;
1246 TREE_VEC_LENGTH (binfos) -= 1;
1248 for (j = i; j+1 < n_baseclasses; j++)
1249 TREE_VEC_ELT (binfos, j) = TREE_VEC_ELT (binfos, j+1);
1253 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1254 here because the case of virtual functions but non-virtual
1255 dtor is handled in finish_struct_1. */
1256 if (warn_ecpp && ! TYPE_POLYMORPHIC_P (basetype)
1257 && TYPE_HAS_DESTRUCTOR (basetype))
1258 warning ("base class `%#T' has a non-virtual destructor",
1261 /* If the base class doesn't have copy constructors or
1262 assignment operators that take const references, then the
1263 derived class cannot have such a member automatically
1265 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1266 *cant_have_const_ctor_p = 1;
1267 if (TYPE_HAS_ASSIGN_REF (basetype)
1268 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1269 *no_const_asn_ref_p = 1;
1270 /* Similarly, if the base class doesn't have a default
1271 constructor, then the derived class won't have an
1272 automatically generated default constructor. */
1273 if (TYPE_HAS_CONSTRUCTOR (basetype)
1274 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype))
1276 *cant_have_default_ctor_p = 1;
1277 if (! TYPE_HAS_CONSTRUCTOR (t))
1278 pedwarn ("base `%T' with only non-default constructor in class without a constructor",
1282 if (TREE_VIA_VIRTUAL (base_binfo))
1283 /* A virtual base does not effect nearly emptiness. */
1285 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1287 if (seen_non_virtual_nearly_empty_base_p)
1288 /* And if there is more than one nearly empty base, then the
1289 derived class is not nearly empty either. */
1290 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1292 /* Remember we've seen one. */
1293 seen_non_virtual_nearly_empty_base_p = 1;
1295 else if (!is_empty_class (basetype))
1296 /* If the base class is not empty or nearly empty, then this
1297 class cannot be nearly empty. */
1298 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1300 /* A lot of properties from the bases also apply to the derived
1302 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1303 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1304 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1305 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1306 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1307 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1308 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1309 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1310 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1314 /* Set BINFO_PRIMARY_BASE_OF for all binfos in the hierarchy
1315 dominated by TYPE that are primary bases. */
1318 mark_primary_bases (tree type)
1322 /* Walk the bases in inheritance graph order. */
1323 for (binfo = TYPE_BINFO (type); binfo; binfo = TREE_CHAIN (binfo))
1325 tree base_binfo = get_primary_binfo (binfo);
1328 /* Not a dynamic base. */;
1329 else if (BINFO_PRIMARY_P (base_binfo))
1330 BINFO_LOST_PRIMARY_P (binfo) = 1;
1333 BINFO_PRIMARY_BASE_OF (base_binfo) = binfo;
1334 /* A virtual binfo might have been copied from within
1335 another hierarchy. As we're about to use it as a primary
1336 base, make sure the offsets match. */
1337 if (TREE_VIA_VIRTUAL (base_binfo))
1339 tree delta = size_diffop (convert (ssizetype,
1340 BINFO_OFFSET (binfo)),
1342 BINFO_OFFSET (base_binfo)));
1344 propagate_binfo_offsets (base_binfo, delta);
1350 /* Make the BINFO the primary base of T. */
1353 set_primary_base (tree t, tree binfo)
1357 CLASSTYPE_PRIMARY_BINFO (t) = binfo;
1358 basetype = BINFO_TYPE (binfo);
1359 TYPE_BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (basetype);
1360 TYPE_BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (basetype);
1361 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1364 /* Determine the primary class for T. */
1367 determine_primary_base (tree t)
1369 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1373 /* If there are no baseclasses, there is certainly no primary base. */
1374 if (n_baseclasses == 0)
1377 type_binfo = TYPE_BINFO (t);
1379 for (i = 0; i < n_baseclasses; i++)
1381 tree base_binfo = BINFO_BASETYPE (type_binfo, i);
1382 tree basetype = BINFO_TYPE (base_binfo);
1384 if (TYPE_CONTAINS_VPTR_P (basetype))
1386 /* We prefer a non-virtual base, although a virtual one will
1388 if (TREE_VIA_VIRTUAL (base_binfo))
1391 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1393 set_primary_base (t, base_binfo);
1394 CLASSTYPE_VFIELDS (t) = copy_list (CLASSTYPE_VFIELDS (basetype));
1400 /* Only add unique vfields, and flatten them out as we go. */
1401 for (vfields = CLASSTYPE_VFIELDS (basetype);
1403 vfields = TREE_CHAIN (vfields))
1404 if (VF_BINFO_VALUE (vfields) == NULL_TREE
1405 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields)))
1406 CLASSTYPE_VFIELDS (t)
1407 = tree_cons (base_binfo,
1408 VF_BASETYPE_VALUE (vfields),
1409 CLASSTYPE_VFIELDS (t));
1414 if (!TYPE_VFIELD (t))
1415 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
1417 /* Find the indirect primary bases - those virtual bases which are primary
1418 bases of something else in this hierarchy. */
1419 for (vbases = CLASSTYPE_VBASECLASSES (t);
1421 vbases = TREE_CHAIN (vbases))
1423 tree vbase_binfo = TREE_VALUE (vbases);
1425 /* See if this virtual base is an indirect primary base. To be so,
1426 it must be a primary base within the hierarchy of one of our
1428 for (i = 0; i < n_baseclasses; ++i)
1430 tree basetype = TYPE_BINFO_BASETYPE (t, i);
1433 for (v = CLASSTYPE_VBASECLASSES (basetype);
1437 tree base_vbase = TREE_VALUE (v);
1439 if (BINFO_PRIMARY_P (base_vbase)
1440 && same_type_p (BINFO_TYPE (base_vbase),
1441 BINFO_TYPE (vbase_binfo)))
1443 BINFO_INDIRECT_PRIMARY_P (vbase_binfo) = 1;
1448 /* If we've discovered that this virtual base is an indirect
1449 primary base, then we can move on to the next virtual
1451 if (BINFO_INDIRECT_PRIMARY_P (vbase_binfo))
1456 /* A "nearly-empty" virtual base class can be the primary base
1457 class, if no non-virtual polymorphic base can be found. */
1458 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1460 /* If not NULL, this is the best primary base candidate we have
1462 tree candidate = NULL_TREE;
1465 /* Loop over the baseclasses. */
1466 for (base_binfo = TYPE_BINFO (t);
1468 base_binfo = TREE_CHAIN (base_binfo))
1470 tree basetype = BINFO_TYPE (base_binfo);
1472 if (TREE_VIA_VIRTUAL (base_binfo)
1473 && CLASSTYPE_NEARLY_EMPTY_P (basetype))
1475 /* If this is not an indirect primary base, then it's
1476 definitely our primary base. */
1477 if (!BINFO_INDIRECT_PRIMARY_P (base_binfo))
1479 candidate = base_binfo;
1483 /* If this is an indirect primary base, it still could be
1484 our primary base -- unless we later find there's another
1485 nearly-empty virtual base that isn't an indirect
1488 candidate = base_binfo;
1492 /* If we've got a primary base, use it. */
1495 set_primary_base (t, candidate);
1496 CLASSTYPE_VFIELDS (t)
1497 = copy_list (CLASSTYPE_VFIELDS (BINFO_TYPE (candidate)));
1501 /* Mark the primary base classes at this point. */
1502 mark_primary_bases (t);
1505 /* Set memoizing fields and bits of T (and its variants) for later
1509 finish_struct_bits (tree t)
1511 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1513 /* Fix up variants (if any). */
1514 tree variants = TYPE_NEXT_VARIANT (t);
1517 /* These fields are in the _TYPE part of the node, not in
1518 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1519 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1520 TYPE_HAS_DESTRUCTOR (variants) = TYPE_HAS_DESTRUCTOR (t);
1521 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1522 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1523 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1525 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (variants)
1526 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t);
1527 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1528 TYPE_USES_VIRTUAL_BASECLASSES (variants) = TYPE_USES_VIRTUAL_BASECLASSES (t);
1529 /* Copy whatever these are holding today. */
1530 TYPE_MIN_VALUE (variants) = TYPE_MIN_VALUE (t);
1531 TYPE_MAX_VALUE (variants) = TYPE_MAX_VALUE (t);
1532 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1533 TYPE_SIZE (variants) = TYPE_SIZE (t);
1534 TYPE_SIZE_UNIT (variants) = TYPE_SIZE_UNIT (t);
1535 variants = TYPE_NEXT_VARIANT (variants);
1538 if (n_baseclasses && TYPE_POLYMORPHIC_P (t))
1539 /* For a class w/o baseclasses, `finish_struct' has set
1540 CLASS_TYPE_ABSTRACT_VIRTUALS correctly (by
1541 definition). Similarly for a class whose base classes do not
1542 have vtables. When neither of these is true, we might have
1543 removed abstract virtuals (by providing a definition), added
1544 some (by declaring new ones), or redeclared ones from a base
1545 class. We need to recalculate what's really an abstract virtual
1546 at this point (by looking in the vtables). */
1547 get_pure_virtuals (t);
1551 /* Notice whether this class has type conversion functions defined. */
1552 tree binfo = TYPE_BINFO (t);
1553 tree binfos = BINFO_BASETYPES (binfo);
1556 for (i = n_baseclasses-1; i >= 0; i--)
1558 basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
1560 TYPE_HAS_CONVERSION (t) |= TYPE_HAS_CONVERSION (basetype);
1564 /* If this type has a copy constructor or a destructor, force its mode to
1565 be BLKmode, and force its TREE_ADDRESSABLE bit to be nonzero. This
1566 will cause it to be passed by invisible reference and prevent it from
1567 being returned in a register. */
1568 if (! TYPE_HAS_TRIVIAL_INIT_REF (t) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1571 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1572 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1574 TYPE_MODE (variants) = BLKmode;
1575 TREE_ADDRESSABLE (variants) = 1;
1580 /* Issue warnings about T having private constructors, but no friends,
1583 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1584 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1585 non-private static member functions. */
1588 maybe_warn_about_overly_private_class (tree t)
1590 int has_member_fn = 0;
1591 int has_nonprivate_method = 0;
1594 if (!warn_ctor_dtor_privacy
1595 /* If the class has friends, those entities might create and
1596 access instances, so we should not warn. */
1597 || (CLASSTYPE_FRIEND_CLASSES (t)
1598 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1599 /* We will have warned when the template was declared; there's
1600 no need to warn on every instantiation. */
1601 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1602 /* There's no reason to even consider warning about this
1606 /* We only issue one warning, if more than one applies, because
1607 otherwise, on code like:
1610 // Oops - forgot `public:'
1616 we warn several times about essentially the same problem. */
1618 /* Check to see if all (non-constructor, non-destructor) member
1619 functions are private. (Since there are no friends or
1620 non-private statics, we can't ever call any of the private member
1622 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1623 /* We're not interested in compiler-generated methods; they don't
1624 provide any way to call private members. */
1625 if (!DECL_ARTIFICIAL (fn))
1627 if (!TREE_PRIVATE (fn))
1629 if (DECL_STATIC_FUNCTION_P (fn))
1630 /* A non-private static member function is just like a
1631 friend; it can create and invoke private member
1632 functions, and be accessed without a class
1636 has_nonprivate_method = 1;
1637 /* Keep searching for a static member function. */
1639 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1643 if (!has_nonprivate_method && has_member_fn)
1645 /* There are no non-private methods, and there's at least one
1646 private member function that isn't a constructor or
1647 destructor. (If all the private members are
1648 constructors/destructors we want to use the code below that
1649 issues error messages specifically referring to
1650 constructors/destructors.) */
1652 tree binfo = TYPE_BINFO (t);
1654 for (i = 0; i < BINFO_N_BASETYPES (binfo); i++)
1655 if (BINFO_BASEACCESS (binfo, i) != access_private_node)
1657 has_nonprivate_method = 1;
1660 if (!has_nonprivate_method)
1662 warning ("all member functions in class `%T' are private", t);
1667 /* Even if some of the member functions are non-private, the class
1668 won't be useful for much if all the constructors or destructors
1669 are private: such an object can never be created or destroyed. */
1670 if (TYPE_HAS_DESTRUCTOR (t)
1671 && TREE_PRIVATE (CLASSTYPE_DESTRUCTORS (t)))
1673 warning ("`%#T' only defines a private destructor and has no friends",
1678 if (TYPE_HAS_CONSTRUCTOR (t))
1680 int nonprivate_ctor = 0;
1682 /* If a non-template class does not define a copy
1683 constructor, one is defined for it, enabling it to avoid
1684 this warning. For a template class, this does not
1685 happen, and so we would normally get a warning on:
1687 template <class T> class C { private: C(); };
1689 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1690 complete non-template or fully instantiated classes have this
1692 if (!TYPE_HAS_INIT_REF (t))
1693 nonprivate_ctor = 1;
1695 for (fn = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 0);
1699 tree ctor = OVL_CURRENT (fn);
1700 /* Ideally, we wouldn't count copy constructors (or, in
1701 fact, any constructor that takes an argument of the
1702 class type as a parameter) because such things cannot
1703 be used to construct an instance of the class unless
1704 you already have one. But, for now at least, we're
1706 if (! TREE_PRIVATE (ctor))
1708 nonprivate_ctor = 1;
1713 if (nonprivate_ctor == 0)
1715 warning ("`%#T' only defines private constructors and has no friends",
1723 gt_pointer_operator new_value;
1727 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1730 method_name_cmp (const void* m1_p, const void* m2_p)
1732 const tree *const m1 = m1_p;
1733 const tree *const m2 = m2_p;
1735 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1737 if (*m1 == NULL_TREE)
1739 if (*m2 == NULL_TREE)
1741 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1746 /* This routine compares two fields like method_name_cmp but using the
1747 pointer operator in resort_field_decl_data. */
1750 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1752 const tree *const m1 = m1_p;
1753 const tree *const m2 = m2_p;
1754 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1756 if (*m1 == NULL_TREE)
1758 if (*m2 == NULL_TREE)
1761 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1762 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1763 resort_data.new_value (&d1, resort_data.cookie);
1764 resort_data.new_value (&d2, resort_data.cookie);
1771 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1774 resort_type_method_vec (void* obj,
1775 void* orig_obj ATTRIBUTE_UNUSED ,
1776 gt_pointer_operator new_value,
1779 tree method_vec = obj;
1780 int len = TREE_VEC_LENGTH (method_vec);
1783 /* The type conversion ops have to live at the front of the vec, so we
1785 for (slot = 2; slot < len; ++slot)
1787 tree fn = TREE_VEC_ELT (method_vec, slot);
1789 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1794 resort_data.new_value = new_value;
1795 resort_data.cookie = cookie;
1796 qsort (&TREE_VEC_ELT (method_vec, slot), len - slot, sizeof (tree),
1797 resort_method_name_cmp);
1801 /* Warn about duplicate methods in fn_fields. Also compact method
1802 lists so that lookup can be made faster.
1804 Data Structure: List of method lists. The outer list is a
1805 TREE_LIST, whose TREE_PURPOSE field is the field name and the
1806 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
1807 links the entire list of methods for TYPE_METHODS. Friends are
1808 chained in the same way as member functions (? TREE_CHAIN or
1809 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
1810 list. That allows them to be quickly deleted, and requires no
1813 Sort methods that are not special (i.e., constructors, destructors,
1814 and type conversion operators) so that we can find them faster in
1818 finish_struct_methods (tree t)
1824 if (!TYPE_METHODS (t))
1826 /* Clear these for safety; perhaps some parsing error could set
1827 these incorrectly. */
1828 TYPE_HAS_CONSTRUCTOR (t) = 0;
1829 TYPE_HAS_DESTRUCTOR (t) = 0;
1830 CLASSTYPE_METHOD_VEC (t) = NULL_TREE;
1834 method_vec = CLASSTYPE_METHOD_VEC (t);
1835 my_friendly_assert (method_vec != NULL_TREE, 19991215);
1836 len = TREE_VEC_LENGTH (method_vec);
1838 /* First fill in entry 0 with the constructors, entry 1 with destructors,
1839 and the next few with type conversion operators (if any). */
1840 for (fn_fields = TYPE_METHODS (t); fn_fields;
1841 fn_fields = TREE_CHAIN (fn_fields))
1842 /* Clear out this flag. */
1843 DECL_IN_AGGR_P (fn_fields) = 0;
1845 if (TYPE_HAS_DESTRUCTOR (t) && !CLASSTYPE_DESTRUCTORS (t))
1846 /* We thought there was a destructor, but there wasn't. Some
1847 parse errors cause this anomalous situation. */
1848 TYPE_HAS_DESTRUCTOR (t) = 0;
1850 /* Issue warnings about private constructors and such. If there are
1851 no methods, then some public defaults are generated. */
1852 maybe_warn_about_overly_private_class (t);
1854 /* Now sort the methods. */
1855 while (len > 2 && TREE_VEC_ELT (method_vec, len-1) == NULL_TREE)
1857 TREE_VEC_LENGTH (method_vec) = len;
1859 /* The type conversion ops have to live at the front of the vec, so we
1861 for (slot = 2; slot < len; ++slot)
1863 tree fn = TREE_VEC_ELT (method_vec, slot);
1865 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1869 qsort (&TREE_VEC_ELT (method_vec, slot), len-slot, sizeof (tree),
1873 /* Make BINFO's vtable have N entries, including RTTI entries,
1874 vbase and vcall offsets, etc. Set its type and call the backend
1878 layout_vtable_decl (tree binfo, int n)
1883 atype = build_cplus_array_type (vtable_entry_type,
1884 build_index_type (size_int (n - 1)));
1885 layout_type (atype);
1887 /* We may have to grow the vtable. */
1888 vtable = get_vtbl_decl_for_binfo (binfo);
1889 if (!same_type_p (TREE_TYPE (vtable), atype))
1891 TREE_TYPE (vtable) = atype;
1892 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
1893 layout_decl (vtable, 0);
1897 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1898 have the same signature. */
1901 same_signature_p (tree fndecl, tree base_fndecl)
1903 /* One destructor overrides another if they are the same kind of
1905 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
1906 && special_function_p (base_fndecl) == special_function_p (fndecl))
1908 /* But a non-destructor never overrides a destructor, nor vice
1909 versa, nor do different kinds of destructors override
1910 one-another. For example, a complete object destructor does not
1911 override a deleting destructor. */
1912 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
1915 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
1916 || (DECL_CONV_FN_P (fndecl)
1917 && DECL_CONV_FN_P (base_fndecl)
1918 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
1919 DECL_CONV_FN_TYPE (base_fndecl))))
1921 tree types, base_types;
1922 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1923 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
1924 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
1925 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
1926 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
1932 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1936 base_derived_from (tree derived, tree base)
1940 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
1942 if (probe == derived)
1944 else if (TREE_VIA_VIRTUAL (probe))
1945 /* If we meet a virtual base, we can't follow the inheritance
1946 any more. See if the complete type of DERIVED contains
1947 such a virtual base. */
1948 return purpose_member (BINFO_TYPE (probe),
1949 CLASSTYPE_VBASECLASSES (BINFO_TYPE (derived)))
1955 typedef struct find_final_overrider_data_s {
1956 /* The function for which we are trying to find a final overrider. */
1958 /* The base class in which the function was declared. */
1959 tree declaring_base;
1960 /* The most derived class in the hierarchy. */
1961 tree most_derived_type;
1962 /* The candidate overriders. */
1964 /* Binfos which inherited virtually on the current path. */
1966 } find_final_overrider_data;
1968 /* Called from find_final_overrider via dfs_walk. */
1971 dfs_find_final_overrider (tree binfo, void* data)
1973 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
1975 if (binfo == ffod->declaring_base)
1977 /* We've found a path to the declaring base. Walk the path from
1978 derived to base, looking for an overrider for FN. */
1979 tree path, probe, vpath;
1981 /* Build the path, using the inheritance chain and record of
1982 virtual inheritance. */
1983 for (path = NULL_TREE, probe = binfo, vpath = ffod->vpath;;)
1985 path = tree_cons (NULL_TREE, probe, path);
1986 if (same_type_p (BINFO_TYPE (probe), ffod->most_derived_type))
1988 if (TREE_VIA_VIRTUAL (probe))
1990 probe = TREE_VALUE (vpath);
1991 vpath = TREE_CHAIN (vpath);
1994 probe = BINFO_INHERITANCE_CHAIN (probe);
1996 /* Now walk path, looking for overrides. */
1997 for (; path; path = TREE_CHAIN (path))
1999 tree method = look_for_overrides_here
2000 (BINFO_TYPE (TREE_VALUE (path)), ffod->fn);
2004 tree *candidate = &ffod->candidates;
2005 path = TREE_VALUE (path);
2007 /* Remove any candidates overridden by this new function. */
2010 /* If *CANDIDATE overrides METHOD, then METHOD
2011 cannot override anything else on the list. */
2012 if (base_derived_from (TREE_VALUE (*candidate), path))
2014 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2015 if (base_derived_from (path, TREE_VALUE (*candidate)))
2016 *candidate = TREE_CHAIN (*candidate);
2018 candidate = &TREE_CHAIN (*candidate);
2021 /* Add the new function. */
2022 ffod->candidates = tree_cons (method, path, ffod->candidates);
2032 dfs_find_final_overrider_q (tree derived, int ix, void *data)
2034 tree binfo = BINFO_BASETYPE (derived, ix);
2035 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
2037 if (TREE_VIA_VIRTUAL (binfo))
2038 ffod->vpath = tree_cons (NULL_TREE, derived, ffod->vpath);
2044 dfs_find_final_overrider_post (tree binfo, void *data)
2046 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
2048 if (TREE_VIA_VIRTUAL (binfo) && TREE_CHAIN (ffod->vpath))
2049 ffod->vpath = TREE_CHAIN (ffod->vpath);
2054 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2055 FN and whose TREE_VALUE is the binfo for the base where the
2056 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2057 DERIVED) is the base object in which FN is declared. */
2060 find_final_overrider (tree derived, tree binfo, tree fn)
2062 find_final_overrider_data ffod;
2064 /* Getting this right is a little tricky. This is valid:
2066 struct S { virtual void f (); };
2067 struct T { virtual void f (); };
2068 struct U : public S, public T { };
2070 even though calling `f' in `U' is ambiguous. But,
2072 struct R { virtual void f(); };
2073 struct S : virtual public R { virtual void f (); };
2074 struct T : virtual public R { virtual void f (); };
2075 struct U : public S, public T { };
2077 is not -- there's no way to decide whether to put `S::f' or
2078 `T::f' in the vtable for `R'.
2080 The solution is to look at all paths to BINFO. If we find
2081 different overriders along any two, then there is a problem. */
2082 if (DECL_THUNK_P (fn))
2083 fn = THUNK_TARGET (fn);
2086 ffod.declaring_base = binfo;
2087 ffod.most_derived_type = BINFO_TYPE (derived);
2088 ffod.candidates = NULL_TREE;
2089 ffod.vpath = NULL_TREE;
2091 dfs_walk_real (derived,
2092 dfs_find_final_overrider,
2093 dfs_find_final_overrider_post,
2094 dfs_find_final_overrider_q,
2097 /* If there was no winner, issue an error message. */
2098 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
2100 error ("no unique final overrider for `%D' in `%T'", fn,
2101 BINFO_TYPE (derived));
2102 return error_mark_node;
2105 return ffod.candidates;
2108 /* Return the index of the vcall offset for FN when TYPE is used as a
2112 get_vcall_index (tree fn, tree type)
2116 for (v = CLASSTYPE_VCALL_INDICES (type); v; v = TREE_CHAIN (v))
2117 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (TREE_PURPOSE (v)))
2118 || same_signature_p (fn, TREE_PURPOSE (v)))
2121 /* There should always be an appropriate index. */
2122 my_friendly_assert (v, 20021103);
2124 return TREE_VALUE (v);
2127 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2128 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
2129 corresponding position in the BINFO_VIRTUALS list. */
2132 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
2140 tree overrider_fn, overrider_target;
2141 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
2142 tree over_return, base_return;
2145 /* Find the nearest primary base (possibly binfo itself) which defines
2146 this function; this is the class the caller will convert to when
2147 calling FN through BINFO. */
2148 for (b = binfo; ; b = get_primary_binfo (b))
2150 my_friendly_assert (b, 20021227);
2151 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
2154 /* The nearest definition is from a lost primary. */
2155 if (BINFO_LOST_PRIMARY_P (b))
2160 /* Find the final overrider. */
2161 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
2162 if (overrider == error_mark_node)
2164 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
2166 /* Check for adjusting covariant return types. */
2167 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
2168 base_return = TREE_TYPE (TREE_TYPE (target_fn));
2170 if (POINTER_TYPE_P (over_return)
2171 && TREE_CODE (over_return) == TREE_CODE (base_return)
2172 && CLASS_TYPE_P (TREE_TYPE (over_return))
2173 && CLASS_TYPE_P (TREE_TYPE (base_return)))
2175 /* If FN is a covariant thunk, we must figure out the adjustment
2176 to the final base FN was converting to. As OVERRIDER_TARGET might
2177 also be converting to the return type of FN, we have to
2178 combine the two conversions here. */
2179 tree fixed_offset, virtual_offset;
2181 if (DECL_THUNK_P (fn))
2183 my_friendly_assert (DECL_RESULT_THUNK_P (fn), 20031211);
2184 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
2185 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2188 fixed_offset = virtual_offset = NULL_TREE;
2191 /* Find the equivalent binfo within the return type of the
2192 overriding function. We will want the vbase offset from
2195 TREE_VALUE (purpose_member
2196 (BINFO_TYPE (virtual_offset),
2197 CLASSTYPE_VBASECLASSES (TREE_TYPE (over_return))));
2200 /* There was no existing virtual thunk (which takes
2205 thunk_binfo = lookup_base (TREE_TYPE (over_return),
2206 TREE_TYPE (base_return),
2207 ba_check | ba_quiet, &kind);
2209 if (thunk_binfo && (kind == bk_via_virtual
2210 || !BINFO_OFFSET_ZEROP (thunk_binfo)))
2212 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2214 if (kind == bk_via_virtual)
2216 /* We convert via virtual base. Find the virtual
2217 base and adjust the fixed offset to be from there. */
2218 while (!TREE_VIA_VIRTUAL (thunk_binfo))
2219 thunk_binfo = BINFO_INHERITANCE_CHAIN (thunk_binfo);
2221 virtual_offset = thunk_binfo;
2222 offset = size_diffop
2224 (ssizetype, BINFO_OFFSET (virtual_offset)));
2227 /* There was an existing fixed offset, this must be
2228 from the base just converted to, and the base the
2229 FN was thunking to. */
2230 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2232 fixed_offset = offset;
2236 if (fixed_offset || virtual_offset)
2237 /* Replace the overriding function with a covariant thunk. We
2238 will emit the overriding function in its own slot as
2240 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2241 fixed_offset, virtual_offset);
2244 my_friendly_assert (!DECL_THUNK_P (fn), 20021231);
2246 /* Assume that we will produce a thunk that convert all the way to
2247 the final overrider, and not to an intermediate virtual base. */
2248 virtual_base = NULL_TREE;
2250 /* See if we can convert to an intermediate virtual base first, and then
2251 use the vcall offset located there to finish the conversion. */
2252 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2254 /* If we find the final overrider, then we can stop
2256 if (same_type_p (BINFO_TYPE (b),
2257 BINFO_TYPE (TREE_VALUE (overrider))))
2260 /* If we find a virtual base, and we haven't yet found the
2261 overrider, then there is a virtual base between the
2262 declaring base (first_defn) and the final overrider. */
2263 if (TREE_VIA_VIRTUAL (b))
2270 if (overrider_fn != overrider_target && !virtual_base)
2272 /* The ABI specifies that a covariant thunk includes a mangling
2273 for a this pointer adjustment. This-adjusting thunks that
2274 override a function from a virtual base have a vcall
2275 adjustment. When the virtual base in question is a primary
2276 virtual base, we know the adjustments are zero, (and in the
2277 non-covariant case, we would not use the thunk).
2278 Unfortunately we didn't notice this could happen, when
2279 designing the ABI and so never mandated that such a covariant
2280 thunk should be emitted. Because we must use the ABI mandated
2281 name, we must continue searching from the binfo where we
2282 found the most recent definition of the function, towards the
2283 primary binfo which first introduced the function into the
2284 vtable. If that enters a virtual base, we must use a vcall
2285 this-adjusting thunk. Bleah! */
2286 tree probe = first_defn;
2288 while ((probe = get_primary_binfo (probe))
2289 && (unsigned) list_length (BINFO_VIRTUALS (probe)) > ix)
2290 if (TREE_VIA_VIRTUAL (probe))
2291 virtual_base = probe;
2294 /* Even if we find a virtual base, the correct delta is
2295 between the overrider and the binfo we're building a vtable
2297 goto virtual_covariant;
2300 /* Compute the constant adjustment to the `this' pointer. The
2301 `this' pointer, when this function is called, will point at BINFO
2302 (or one of its primary bases, which are at the same offset). */
2304 /* The `this' pointer needs to be adjusted from the declaration to
2305 the nearest virtual base. */
2306 delta = size_diffop (convert (ssizetype, BINFO_OFFSET (virtual_base)),
2307 convert (ssizetype, BINFO_OFFSET (first_defn)));
2309 /* If the nearest definition is in a lost primary, we don't need an
2310 entry in our vtable. Except possibly in a constructor vtable,
2311 if we happen to get our primary back. In that case, the offset
2312 will be zero, as it will be a primary base. */
2313 delta = size_zero_node;
2315 /* The `this' pointer needs to be adjusted from pointing to
2316 BINFO to pointing at the base where the final overrider
2319 delta = size_diffop (convert (ssizetype,
2320 BINFO_OFFSET (TREE_VALUE (overrider))),
2321 convert (ssizetype, BINFO_OFFSET (binfo)));
2323 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2326 BV_VCALL_INDEX (*virtuals)
2327 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2330 /* Called from modify_all_vtables via dfs_walk. */
2333 dfs_modify_vtables (tree binfo, void* data)
2335 if (/* There's no need to modify the vtable for a non-virtual
2336 primary base; we're not going to use that vtable anyhow.
2337 We do still need to do this for virtual primary bases, as they
2338 could become non-primary in a construction vtable. */
2339 (!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
2340 /* Similarly, a base without a vtable needs no modification. */
2341 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2343 tree t = (tree) data;
2348 make_new_vtable (t, binfo);
2350 /* Now, go through each of the virtual functions in the virtual
2351 function table for BINFO. Find the final overrider, and
2352 update the BINFO_VIRTUALS list appropriately. */
2353 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2354 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2356 ix++, virtuals = TREE_CHAIN (virtuals),
2357 old_virtuals = TREE_CHAIN (old_virtuals))
2358 update_vtable_entry_for_fn (t,
2360 BV_FN (old_virtuals),
2364 BINFO_MARKED (binfo) = 1;
2369 /* Update all of the primary and secondary vtables for T. Create new
2370 vtables as required, and initialize their RTTI information. Each
2371 of the functions in VIRTUALS is declared in T and may override a
2372 virtual function from a base class; find and modify the appropriate
2373 entries to point to the overriding functions. Returns a list, in
2374 declaration order, of the virtual functions that are declared in T,
2375 but do not appear in the primary base class vtable, and which
2376 should therefore be appended to the end of the vtable for T. */
2379 modify_all_vtables (tree t, tree virtuals)
2381 tree binfo = TYPE_BINFO (t);
2384 /* Update all of the vtables. */
2385 dfs_walk (binfo, dfs_modify_vtables, unmarkedp, t);
2386 dfs_walk (binfo, dfs_unmark, markedp, t);
2388 /* Add virtual functions not already in our primary vtable. These
2389 will be both those introduced by this class, and those overridden
2390 from secondary bases. It does not include virtuals merely
2391 inherited from secondary bases. */
2392 for (fnsp = &virtuals; *fnsp; )
2394 tree fn = TREE_VALUE (*fnsp);
2396 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2397 || DECL_VINDEX (fn) == error_mark_node)
2399 /* We don't need to adjust the `this' pointer when
2400 calling this function. */
2401 BV_DELTA (*fnsp) = integer_zero_node;
2402 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2404 /* This is a function not already in our vtable. Keep it. */
2405 fnsp = &TREE_CHAIN (*fnsp);
2408 /* We've already got an entry for this function. Skip it. */
2409 *fnsp = TREE_CHAIN (*fnsp);
2415 /* Get the base virtual function declarations in T that have the
2419 get_basefndecls (tree name, tree t)
2422 tree base_fndecls = NULL_TREE;
2423 int n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
2426 /* Find virtual functions in T with the indicated NAME. */
2427 i = lookup_fnfields_1 (t, name);
2429 for (methods = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), i);
2431 methods = OVL_NEXT (methods))
2433 tree method = OVL_CURRENT (methods);
2435 if (TREE_CODE (method) == FUNCTION_DECL
2436 && DECL_VINDEX (method))
2437 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2441 return base_fndecls;
2443 for (i = 0; i < n_baseclasses; i++)
2445 tree basetype = TYPE_BINFO_BASETYPE (t, i);
2446 base_fndecls = chainon (get_basefndecls (name, basetype),
2450 return base_fndecls;
2453 /* If this declaration supersedes the declaration of
2454 a method declared virtual in the base class, then
2455 mark this field as being virtual as well. */
2458 check_for_override (tree decl, tree ctype)
2460 if (TREE_CODE (decl) == TEMPLATE_DECL)
2461 /* In [temp.mem] we have:
2463 A specialization of a member function template does not
2464 override a virtual function from a base class. */
2466 if ((DECL_DESTRUCTOR_P (decl)
2467 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2468 || DECL_CONV_FN_P (decl))
2469 && look_for_overrides (ctype, decl)
2470 && !DECL_STATIC_FUNCTION_P (decl))
2471 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2472 the error_mark_node so that we know it is an overriding
2474 DECL_VINDEX (decl) = decl;
2476 if (DECL_VIRTUAL_P (decl))
2478 if (!DECL_VINDEX (decl))
2479 DECL_VINDEX (decl) = error_mark_node;
2480 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2484 /* Warn about hidden virtual functions that are not overridden in t.
2485 We know that constructors and destructors don't apply. */
2488 warn_hidden (tree t)
2490 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2491 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
2494 /* We go through each separately named virtual function. */
2495 for (i = 2; i < n_methods && TREE_VEC_ELT (method_vec, i); ++i)
2503 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2504 have the same name. Figure out what name that is. */
2505 name = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec, i)));
2506 /* There are no possibly hidden functions yet. */
2507 base_fndecls = NULL_TREE;
2508 /* Iterate through all of the base classes looking for possibly
2509 hidden functions. */
2510 for (j = 0; j < CLASSTYPE_N_BASECLASSES (t); j++)
2512 tree basetype = TYPE_BINFO_BASETYPE (t, j);
2513 base_fndecls = chainon (get_basefndecls (name, basetype),
2517 /* If there are no functions to hide, continue. */
2521 /* Remove any overridden functions. */
2522 for (fns = TREE_VEC_ELT (method_vec, i); fns; fns = OVL_NEXT (fns))
2524 fndecl = OVL_CURRENT (fns);
2525 if (DECL_VINDEX (fndecl))
2527 tree *prev = &base_fndecls;
2530 /* If the method from the base class has the same
2531 signature as the method from the derived class, it
2532 has been overridden. */
2533 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2534 *prev = TREE_CHAIN (*prev);
2536 prev = &TREE_CHAIN (*prev);
2540 /* Now give a warning for all base functions without overriders,
2541 as they are hidden. */
2542 while (base_fndecls)
2544 /* Here we know it is a hider, and no overrider exists. */
2545 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls));
2546 cp_warning_at (" by `%D'",
2547 OVL_CURRENT (TREE_VEC_ELT (method_vec, i)));
2548 base_fndecls = TREE_CHAIN (base_fndecls);
2553 /* Check for things that are invalid. There are probably plenty of other
2554 things we should check for also. */
2557 finish_struct_anon (tree t)
2561 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2563 if (TREE_STATIC (field))
2565 if (TREE_CODE (field) != FIELD_DECL)
2568 if (DECL_NAME (field) == NULL_TREE
2569 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2571 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2572 for (; elt; elt = TREE_CHAIN (elt))
2574 /* We're generally only interested in entities the user
2575 declared, but we also find nested classes by noticing
2576 the TYPE_DECL that we create implicitly. You're
2577 allowed to put one anonymous union inside another,
2578 though, so we explicitly tolerate that. We use
2579 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2580 we also allow unnamed types used for defining fields. */
2581 if (DECL_ARTIFICIAL (elt)
2582 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2583 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2586 if (constructor_name_p (DECL_NAME (elt), t))
2587 cp_pedwarn_at ("ISO C++ forbids member `%D' with same name as enclosing class",
2590 if (TREE_CODE (elt) != FIELD_DECL)
2592 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2597 if (TREE_PRIVATE (elt))
2598 cp_pedwarn_at ("private member `%#D' in anonymous union",
2600 else if (TREE_PROTECTED (elt))
2601 cp_pedwarn_at ("protected member `%#D' in anonymous union",
2604 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2605 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2611 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2612 will be used later during class template instantiation.
2613 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2614 a non-static member data (FIELD_DECL), a member function
2615 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2616 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2617 When FRIEND_P is nonzero, T is either a friend class
2618 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2619 (FUNCTION_DECL, TEMPLATE_DECL). */
2622 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2624 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2625 if (CLASSTYPE_TEMPLATE_INFO (type))
2626 CLASSTYPE_DECL_LIST (type)
2627 = tree_cons (friend_p ? NULL_TREE : type,
2628 t, CLASSTYPE_DECL_LIST (type));
2631 /* Create default constructors, assignment operators, and so forth for
2632 the type indicated by T, if they are needed.
2633 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
2634 CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, the
2635 class cannot have a default constructor, copy constructor taking a
2636 const reference argument, or an assignment operator taking a const
2637 reference, respectively. If a virtual destructor is created, its
2638 DECL is returned; otherwise the return value is NULL_TREE. */
2641 add_implicitly_declared_members (tree t,
2642 int cant_have_default_ctor,
2643 int cant_have_const_cctor,
2644 int cant_have_const_assignment)
2647 tree implicit_fns = NULL_TREE;
2648 tree virtual_dtor = NULL_TREE;
2651 ++adding_implicit_members;
2654 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) && !TYPE_HAS_DESTRUCTOR (t))
2656 default_fn = implicitly_declare_fn (sfk_destructor, t, /*const_p=*/0);
2657 check_for_override (default_fn, t);
2659 /* If we couldn't make it work, then pretend we didn't need it. */
2660 if (default_fn == void_type_node)
2661 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 0;
2664 TREE_CHAIN (default_fn) = implicit_fns;
2665 implicit_fns = default_fn;
2667 if (DECL_VINDEX (default_fn))
2668 virtual_dtor = default_fn;
2672 /* Any non-implicit destructor is non-trivial. */
2673 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |= TYPE_HAS_DESTRUCTOR (t);
2675 /* Default constructor. */
2676 if (! TYPE_HAS_CONSTRUCTOR (t) && ! cant_have_default_ctor)
2678 default_fn = implicitly_declare_fn (sfk_constructor, t, /*const_p=*/0);
2679 TREE_CHAIN (default_fn) = implicit_fns;
2680 implicit_fns = default_fn;
2683 /* Copy constructor. */
2684 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
2686 /* ARM 12.18: You get either X(X&) or X(const X&), but
2689 = implicitly_declare_fn (sfk_copy_constructor, t,
2690 /*const_p=*/!cant_have_const_cctor);
2691 TREE_CHAIN (default_fn) = implicit_fns;
2692 implicit_fns = default_fn;
2695 /* Assignment operator. */
2696 if (! TYPE_HAS_ASSIGN_REF (t) && ! TYPE_FOR_JAVA (t))
2699 = implicitly_declare_fn (sfk_assignment_operator, t,
2700 /*const_p=*/!cant_have_const_assignment);
2701 TREE_CHAIN (default_fn) = implicit_fns;
2702 implicit_fns = default_fn;
2705 /* Now, hook all of the new functions on to TYPE_METHODS,
2706 and add them to the CLASSTYPE_METHOD_VEC. */
2707 for (f = &implicit_fns; *f; f = &TREE_CHAIN (*f))
2709 add_method (t, *f, /*error_p=*/0);
2710 maybe_add_class_template_decl_list (current_class_type, *f, /*friend_p=*/0);
2712 if (abi_version_at_least (2))
2713 /* G++ 3.2 put the implicit destructor at the *beginning* of the
2714 list, which cause the destructor to be emitted in an incorrect
2715 location in the vtable. */
2716 TYPE_METHODS (t) = chainon (TYPE_METHODS (t), implicit_fns);
2719 if (warn_abi && virtual_dtor)
2720 warning ("vtable layout for class `%T' may not be ABI-compliant "
2721 "and may change in a future version of GCC due to implicit "
2722 "virtual destructor",
2724 *f = TYPE_METHODS (t);
2725 TYPE_METHODS (t) = implicit_fns;
2728 --adding_implicit_members;
2731 /* Subroutine of finish_struct_1. Recursively count the number of fields
2732 in TYPE, including anonymous union members. */
2735 count_fields (tree fields)
2739 for (x = fields; x; x = TREE_CHAIN (x))
2741 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2742 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2749 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2750 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2753 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
2756 for (x = fields; x; x = TREE_CHAIN (x))
2758 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2759 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
2761 field_vec->elts[idx++] = x;
2766 /* FIELD is a bit-field. We are finishing the processing for its
2767 enclosing type. Issue any appropriate messages and set appropriate
2771 check_bitfield_decl (tree field)
2773 tree type = TREE_TYPE (field);
2776 /* Detect invalid bit-field type. */
2777 if (DECL_INITIAL (field)
2778 && ! INTEGRAL_TYPE_P (TREE_TYPE (field)))
2780 cp_error_at ("bit-field `%#D' with non-integral type", field);
2781 w = error_mark_node;
2784 /* Detect and ignore out of range field width. */
2785 if (DECL_INITIAL (field))
2787 w = DECL_INITIAL (field);
2789 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2792 /* detect invalid field size. */
2793 if (TREE_CODE (w) == CONST_DECL)
2794 w = DECL_INITIAL (w);
2796 w = decl_constant_value (w);
2798 if (TREE_CODE (w) != INTEGER_CST)
2800 cp_error_at ("bit-field `%D' width not an integer constant",
2802 w = error_mark_node;
2804 else if (tree_int_cst_sgn (w) < 0)
2806 cp_error_at ("negative width in bit-field `%D'", field);
2807 w = error_mark_node;
2809 else if (integer_zerop (w) && DECL_NAME (field) != 0)
2811 cp_error_at ("zero width for bit-field `%D'", field);
2812 w = error_mark_node;
2814 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
2815 && TREE_CODE (type) != ENUMERAL_TYPE
2816 && TREE_CODE (type) != BOOLEAN_TYPE)
2817 cp_warning_at ("width of `%D' exceeds its type", field);
2818 else if (TREE_CODE (type) == ENUMERAL_TYPE
2819 && (0 > compare_tree_int (w,
2820 min_precision (TYPE_MIN_VALUE (type),
2821 TREE_UNSIGNED (type)))
2822 || 0 > compare_tree_int (w,
2824 (TYPE_MAX_VALUE (type),
2825 TREE_UNSIGNED (type)))))
2826 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
2830 /* Remove the bit-field width indicator so that the rest of the
2831 compiler does not treat that value as an initializer. */
2832 DECL_INITIAL (field) = NULL_TREE;
2834 if (w != error_mark_node)
2836 DECL_SIZE (field) = convert (bitsizetype, w);
2837 DECL_BIT_FIELD (field) = 1;
2841 /* Non-bit-fields are aligned for their type. */
2842 DECL_BIT_FIELD (field) = 0;
2843 CLEAR_DECL_C_BIT_FIELD (field);
2847 /* FIELD is a non bit-field. We are finishing the processing for its
2848 enclosing type T. Issue any appropriate messages and set appropriate
2852 check_field_decl (tree field,
2854 int* cant_have_const_ctor,
2855 int* cant_have_default_ctor,
2856 int* no_const_asn_ref,
2857 int* any_default_members)
2859 tree type = strip_array_types (TREE_TYPE (field));
2861 /* An anonymous union cannot contain any fields which would change
2862 the settings of CANT_HAVE_CONST_CTOR and friends. */
2863 if (ANON_UNION_TYPE_P (type))
2865 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2866 structs. So, we recurse through their fields here. */
2867 else if (ANON_AGGR_TYPE_P (type))
2871 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2872 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
2873 check_field_decl (fields, t, cant_have_const_ctor,
2874 cant_have_default_ctor, no_const_asn_ref,
2875 any_default_members);
2877 /* Check members with class type for constructors, destructors,
2879 else if (CLASS_TYPE_P (type))
2881 /* Never let anything with uninheritable virtuals
2882 make it through without complaint. */
2883 abstract_virtuals_error (field, type);
2885 if (TREE_CODE (t) == UNION_TYPE)
2887 if (TYPE_NEEDS_CONSTRUCTING (type))
2888 cp_error_at ("member `%#D' with constructor not allowed in union",
2890 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
2891 cp_error_at ("member `%#D' with destructor not allowed in union",
2893 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2894 cp_error_at ("member `%#D' with copy assignment operator not allowed in union",
2899 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
2900 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2901 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
2902 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
2903 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
2906 if (!TYPE_HAS_CONST_INIT_REF (type))
2907 *cant_have_const_ctor = 1;
2909 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
2910 *no_const_asn_ref = 1;
2912 if (TYPE_HAS_CONSTRUCTOR (type)
2913 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2914 *cant_have_default_ctor = 1;
2916 if (DECL_INITIAL (field) != NULL_TREE)
2918 /* `build_class_init_list' does not recognize
2920 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
2921 error ("multiple fields in union `%T' initialized", t);
2922 *any_default_members = 1;
2926 /* Check the data members (both static and non-static), class-scoped
2927 typedefs, etc., appearing in the declaration of T. Issue
2928 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2929 declaration order) of access declarations; each TREE_VALUE in this
2930 list is a USING_DECL.
2932 In addition, set the following flags:
2935 The class is empty, i.e., contains no non-static data members.
2937 CANT_HAVE_DEFAULT_CTOR_P
2938 This class cannot have an implicitly generated default
2941 CANT_HAVE_CONST_CTOR_P
2942 This class cannot have an implicitly generated copy constructor
2943 taking a const reference.
2945 CANT_HAVE_CONST_ASN_REF
2946 This class cannot have an implicitly generated assignment
2947 operator taking a const reference.
2949 All of these flags should be initialized before calling this
2952 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2953 fields can be added by adding to this chain. */
2956 check_field_decls (tree t, tree *access_decls,
2957 int *cant_have_default_ctor_p,
2958 int *cant_have_const_ctor_p,
2959 int *no_const_asn_ref_p)
2964 int any_default_members;
2966 /* First, delete any duplicate fields. */
2967 delete_duplicate_fields (TYPE_FIELDS (t));
2969 /* Assume there are no access declarations. */
2970 *access_decls = NULL_TREE;
2971 /* Assume this class has no pointer members. */
2973 /* Assume none of the members of this class have default
2975 any_default_members = 0;
2977 for (field = &TYPE_FIELDS (t); *field; field = next)
2980 tree type = TREE_TYPE (x);
2982 next = &TREE_CHAIN (x);
2984 if (TREE_CODE (x) == FIELD_DECL)
2986 if (TYPE_PACKED (t))
2988 if (!pod_type_p (TREE_TYPE (x)) && !TYPE_PACKED (TREE_TYPE (x)))
2990 ("ignoring packed attribute on unpacked non-POD field `%#D'",
2993 DECL_PACKED (x) = 1;
2996 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
2997 /* We don't treat zero-width bitfields as making a class
3004 /* The class is non-empty. */
3005 CLASSTYPE_EMPTY_P (t) = 0;
3006 /* The class is not even nearly empty. */
3007 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3008 /* If one of the data members contains an empty class,
3010 element_type = strip_array_types (type);
3011 if (CLASS_TYPE_P (element_type)
3012 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3013 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
3017 if (TREE_CODE (x) == USING_DECL)
3019 /* Prune the access declaration from the list of fields. */
3020 *field = TREE_CHAIN (x);
3022 /* Save the access declarations for our caller. */
3023 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
3025 /* Since we've reset *FIELD there's no reason to skip to the
3031 if (TREE_CODE (x) == TYPE_DECL
3032 || TREE_CODE (x) == TEMPLATE_DECL)
3035 /* If we've gotten this far, it's a data member, possibly static,
3036 or an enumerator. */
3038 DECL_CONTEXT (x) = t;
3040 /* ``A local class cannot have static data members.'' ARM 9.4 */
3041 if (current_function_decl && TREE_STATIC (x))
3042 cp_error_at ("field `%D' in local class cannot be static", x);
3044 /* Perform error checking that did not get done in
3046 if (TREE_CODE (type) == FUNCTION_TYPE)
3048 cp_error_at ("field `%D' invalidly declared function type",
3050 type = build_pointer_type (type);
3051 TREE_TYPE (x) = type;
3053 else if (TREE_CODE (type) == METHOD_TYPE)
3055 cp_error_at ("field `%D' invalidly declared method type", x);
3056 type = build_pointer_type (type);
3057 TREE_TYPE (x) = type;
3060 if (type == error_mark_node)
3063 /* When this goes into scope, it will be a non-local reference. */
3064 DECL_NONLOCAL (x) = 1;
3066 if (TREE_CODE (x) == CONST_DECL)
3069 if (TREE_CODE (x) == VAR_DECL)
3071 if (TREE_CODE (t) == UNION_TYPE)
3072 /* Unions cannot have static members. */
3073 cp_error_at ("field `%D' declared static in union", x);
3078 /* Now it can only be a FIELD_DECL. */
3080 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
3081 CLASSTYPE_NON_AGGREGATE (t) = 1;
3083 /* If this is of reference type, check if it needs an init.
3084 Also do a little ANSI jig if necessary. */
3085 if (TREE_CODE (type) == REFERENCE_TYPE)
3087 CLASSTYPE_NON_POD_P (t) = 1;
3088 if (DECL_INITIAL (x) == NULL_TREE)
3089 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
3091 /* ARM $12.6.2: [A member initializer list] (or, for an
3092 aggregate, initialization by a brace-enclosed list) is the
3093 only way to initialize nonstatic const and reference
3095 *cant_have_default_ctor_p = 1;
3096 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3098 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
3100 cp_warning_at ("non-static reference `%#D' in class without a constructor", x);
3103 type = strip_array_types (type);
3105 if (TYPE_PTR_P (type))
3108 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
3109 CLASSTYPE_HAS_MUTABLE (t) = 1;
3111 if (! pod_type_p (type))
3112 /* DR 148 now allows pointers to members (which are POD themselves),
3113 to be allowed in POD structs. */
3114 CLASSTYPE_NON_POD_P (t) = 1;
3116 if (! zero_init_p (type))
3117 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
3119 /* If any field is const, the structure type is pseudo-const. */
3120 if (CP_TYPE_CONST_P (type))
3122 C_TYPE_FIELDS_READONLY (t) = 1;
3123 if (DECL_INITIAL (x) == NULL_TREE)
3124 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
3126 /* ARM $12.6.2: [A member initializer list] (or, for an
3127 aggregate, initialization by a brace-enclosed list) is the
3128 only way to initialize nonstatic const and reference
3130 *cant_have_default_ctor_p = 1;
3131 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3133 if (! TYPE_HAS_CONSTRUCTOR (t) && CLASSTYPE_NON_AGGREGATE (t)
3135 cp_warning_at ("non-static const member `%#D' in class without a constructor", x);
3137 /* A field that is pseudo-const makes the structure likewise. */
3138 else if (CLASS_TYPE_P (type))
3140 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3141 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
3142 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3143 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
3146 /* Core issue 80: A nonstatic data member is required to have a
3147 different name from the class iff the class has a
3148 user-defined constructor. */
3149 if (constructor_name_p (DECL_NAME (x), t) && TYPE_HAS_CONSTRUCTOR (t))
3150 cp_pedwarn_at ("field `%#D' with same name as class", x);
3152 /* We set DECL_C_BIT_FIELD in grokbitfield.
3153 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3154 if (DECL_C_BIT_FIELD (x))
3155 check_bitfield_decl (x);
3157 check_field_decl (x, t,
3158 cant_have_const_ctor_p,
3159 cant_have_default_ctor_p,
3161 &any_default_members);
3164 /* Effective C++ rule 11. */
3165 if (has_pointers && warn_ecpp && TYPE_HAS_CONSTRUCTOR (t)
3166 && ! (TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3168 warning ("`%#T' has pointer data members", t);
3170 if (! TYPE_HAS_INIT_REF (t))
3172 warning (" but does not override `%T(const %T&)'", t, t);
3173 if (! TYPE_HAS_ASSIGN_REF (t))
3174 warning (" or `operator=(const %T&)'", t);
3176 else if (! TYPE_HAS_ASSIGN_REF (t))
3177 warning (" but does not override `operator=(const %T&)'", t);
3181 /* Check anonymous struct/anonymous union fields. */
3182 finish_struct_anon (t);
3184 /* We've built up the list of access declarations in reverse order.
3186 *access_decls = nreverse (*access_decls);
3189 /* If TYPE is an empty class type, records its OFFSET in the table of
3193 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3197 if (!is_empty_class (type))
3200 /* Record the location of this empty object in OFFSETS. */
3201 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3203 n = splay_tree_insert (offsets,
3204 (splay_tree_key) offset,
3205 (splay_tree_value) NULL_TREE);
3206 n->value = ((splay_tree_value)
3207 tree_cons (NULL_TREE,
3214 /* Returns nonzero if TYPE is an empty class type and there is
3215 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3218 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3223 if (!is_empty_class (type))
3226 /* Record the location of this empty object in OFFSETS. */
3227 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3231 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3232 if (same_type_p (TREE_VALUE (t), type))
3238 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3239 F for every subobject, passing it the type, offset, and table of
3240 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3243 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3244 than MAX_OFFSET will not be walked.
3246 If F returns a nonzero value, the traversal ceases, and that value
3247 is returned. Otherwise, returns zero. */
3250 walk_subobject_offsets (tree type,
3251 subobject_offset_fn f,
3258 tree type_binfo = NULL_TREE;
3260 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3262 if (max_offset && INT_CST_LT (max_offset, offset))
3267 if (abi_version_at_least (2))
3269 type = BINFO_TYPE (type);
3272 if (CLASS_TYPE_P (type))
3278 /* Avoid recursing into objects that are not interesting. */
3279 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3282 /* Record the location of TYPE. */
3283 r = (*f) (type, offset, offsets);
3287 /* Iterate through the direct base classes of TYPE. */
3289 type_binfo = TYPE_BINFO (type);
3290 for (i = 0; i < BINFO_N_BASETYPES (type_binfo); ++i)
3294 binfo = BINFO_BASETYPE (type_binfo, i);
3296 if (abi_version_at_least (2)
3297 && TREE_VIA_VIRTUAL (binfo))
3301 && TREE_VIA_VIRTUAL (binfo)
3302 && !BINFO_PRIMARY_P (binfo))
3305 if (!abi_version_at_least (2))
3306 binfo_offset = size_binop (PLUS_EXPR,
3308 BINFO_OFFSET (binfo));
3312 /* We cannot rely on BINFO_OFFSET being set for the base
3313 class yet, but the offsets for direct non-virtual
3314 bases can be calculated by going back to the TYPE. */
3315 orig_binfo = BINFO_BASETYPE (TYPE_BINFO (type), i);
3316 binfo_offset = size_binop (PLUS_EXPR,
3318 BINFO_OFFSET (orig_binfo));
3321 r = walk_subobject_offsets (binfo,
3326 (abi_version_at_least (2)
3327 ? /*vbases_p=*/0 : vbases_p));
3332 if (abi_version_at_least (2))
3336 /* Iterate through the virtual base classes of TYPE. In G++
3337 3.2, we included virtual bases in the direct base class
3338 loop above, which results in incorrect results; the
3339 correct offsets for virtual bases are only known when
3340 working with the most derived type. */
3342 for (vbase = CLASSTYPE_VBASECLASSES (type);
3344 vbase = TREE_CHAIN (vbase))
3346 binfo = TREE_VALUE (vbase);
3347 r = walk_subobject_offsets (binfo,
3349 size_binop (PLUS_EXPR,
3351 BINFO_OFFSET (binfo)),
3360 /* We still have to walk the primary base, if it is
3361 virtual. (If it is non-virtual, then it was walked
3363 vbase = get_primary_binfo (type_binfo);
3364 if (vbase && TREE_VIA_VIRTUAL (vbase)
3365 && BINFO_PRIMARY_BASE_OF (vbase) == type_binfo)
3367 r = (walk_subobject_offsets
3369 offsets, max_offset, /*vbases_p=*/0));
3376 /* Iterate through the fields of TYPE. */
3377 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3378 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3382 if (abi_version_at_least (2))
3383 field_offset = byte_position (field);
3385 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3386 field_offset = DECL_FIELD_OFFSET (field);
3388 r = walk_subobject_offsets (TREE_TYPE (field),
3390 size_binop (PLUS_EXPR,
3400 else if (TREE_CODE (type) == ARRAY_TYPE)
3402 tree element_type = strip_array_types (type);
3403 tree domain = TYPE_DOMAIN (type);
3406 /* Avoid recursing into objects that are not interesting. */
3407 if (!CLASS_TYPE_P (element_type)
3408 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3411 /* Step through each of the elements in the array. */
3412 for (index = size_zero_node;
3413 /* G++ 3.2 had an off-by-one error here. */
3414 (abi_version_at_least (2)
3415 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3416 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3417 index = size_binop (PLUS_EXPR, index, size_one_node))
3419 r = walk_subobject_offsets (TREE_TYPE (type),
3427 offset = size_binop (PLUS_EXPR, offset,
3428 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3429 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3430 there's no point in iterating through the remaining
3431 elements of the array. */
3432 if (max_offset && INT_CST_LT (max_offset, offset))
3440 /* Record all of the empty subobjects of TYPE (located at OFFSET) in
3441 OFFSETS. If VBASES_P is nonzero, virtual bases of TYPE are
3445 record_subobject_offsets (tree type,
3450 walk_subobject_offsets (type, record_subobject_offset, offset,
3451 offsets, /*max_offset=*/NULL_TREE, vbases_p);
3454 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3455 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3456 virtual bases of TYPE are examined. */
3459 layout_conflict_p (tree type,
3464 splay_tree_node max_node;
3466 /* Get the node in OFFSETS that indicates the maximum offset where
3467 an empty subobject is located. */
3468 max_node = splay_tree_max (offsets);
3469 /* If there aren't any empty subobjects, then there's no point in
3470 performing this check. */
3474 return walk_subobject_offsets (type, check_subobject_offset, offset,
3475 offsets, (tree) (max_node->key),
3479 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3480 non-static data member of the type indicated by RLI. BINFO is the
3481 binfo corresponding to the base subobject, OFFSETS maps offsets to
3482 types already located at those offsets. This function determines
3483 the position of the DECL. */
3486 layout_nonempty_base_or_field (record_layout_info rli,
3491 tree offset = NULL_TREE;
3497 /* For the purposes of determining layout conflicts, we want to
3498 use the class type of BINFO; TREE_TYPE (DECL) will be the
3499 CLASSTYPE_AS_BASE version, which does not contain entries for
3500 zero-sized bases. */
3501 type = TREE_TYPE (binfo);
3506 type = TREE_TYPE (decl);
3510 /* Try to place the field. It may take more than one try if we have
3511 a hard time placing the field without putting two objects of the
3512 same type at the same address. */
3515 struct record_layout_info_s old_rli = *rli;
3517 /* Place this field. */
3518 place_field (rli, decl);
3519 offset = byte_position (decl);
3521 /* We have to check to see whether or not there is already
3522 something of the same type at the offset we're about to use.
3526 struct T : public S { int i; };
3527 struct U : public S, public T {};
3529 Here, we put S at offset zero in U. Then, we can't put T at
3530 offset zero -- its S component would be at the same address
3531 as the S we already allocated. So, we have to skip ahead.
3532 Since all data members, including those whose type is an
3533 empty class, have nonzero size, any overlap can happen only
3534 with a direct or indirect base-class -- it can't happen with
3536 /* G++ 3.2 did not check for overlaps when placing a non-empty
3538 if (!abi_version_at_least (2) && binfo && TREE_VIA_VIRTUAL (binfo))
3540 if (layout_conflict_p (field_p ? type : binfo, offset,
3543 /* Strip off the size allocated to this field. That puts us
3544 at the first place we could have put the field with
3545 proper alignment. */
3548 /* Bump up by the alignment required for the type. */
3550 = size_binop (PLUS_EXPR, rli->bitpos,
3552 ? CLASSTYPE_ALIGN (type)
3553 : TYPE_ALIGN (type)));
3554 normalize_rli (rli);
3557 /* There was no conflict. We're done laying out this field. */
3561 /* Now that we know where it will be placed, update its
3563 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3564 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3565 this point because their BINFO_OFFSET is copied from another
3566 hierarchy. Therefore, we may not need to add the entire
3568 propagate_binfo_offsets (binfo,
3569 size_diffop (convert (ssizetype, offset),
3571 BINFO_OFFSET (binfo))));
3574 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3577 empty_base_at_nonzero_offset_p (tree type,
3579 splay_tree offsets ATTRIBUTE_UNUSED)
3581 return is_empty_class (type) && !integer_zerop (offset);
3584 /* Layout the empty base BINFO. EOC indicates the byte currently just
3585 past the end of the class, and should be correctly aligned for a
3586 class of the type indicated by BINFO; OFFSETS gives the offsets of
3587 the empty bases allocated so far. T is the most derived
3588 type. Return nonzero iff we added it at the end. */
3591 layout_empty_base (tree binfo, tree eoc, splay_tree offsets)
3594 tree basetype = BINFO_TYPE (binfo);
3597 /* This routine should only be used for empty classes. */
3598 my_friendly_assert (is_empty_class (basetype), 20000321);
3599 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3601 if (!integer_zerop (BINFO_OFFSET (binfo)))
3603 if (abi_version_at_least (2))
3604 propagate_binfo_offsets
3605 (binfo, size_diffop (size_zero_node, BINFO_OFFSET (binfo)));
3607 warning ("offset of empty base `%T' may not be ABI-compliant and may"
3608 "change in a future version of GCC",
3609 BINFO_TYPE (binfo));
3612 /* This is an empty base class. We first try to put it at offset
3614 if (layout_conflict_p (binfo,
3615 BINFO_OFFSET (binfo),
3619 /* That didn't work. Now, we move forward from the next
3620 available spot in the class. */
3622 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3625 if (!layout_conflict_p (binfo,
3626 BINFO_OFFSET (binfo),
3629 /* We finally found a spot where there's no overlap. */
3632 /* There's overlap here, too. Bump along to the next spot. */
3633 propagate_binfo_offsets (binfo, alignment);
3639 /* Layout the the base given by BINFO in the class indicated by RLI.
3640 *BASE_ALIGN is a running maximum of the alignments of
3641 any base class. OFFSETS gives the location of empty base
3642 subobjects. T is the most derived type. Return nonzero if the new
3643 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3644 *NEXT_FIELD, unless BINFO is for an empty base class.
3646 Returns the location at which the next field should be inserted. */
3649 build_base_field (record_layout_info rli, tree binfo,
3650 splay_tree offsets, tree *next_field)
3653 tree basetype = BINFO_TYPE (binfo);
3655 if (!COMPLETE_TYPE_P (basetype))
3656 /* This error is now reported in xref_tag, thus giving better
3657 location information. */
3660 /* Place the base class. */
3661 if (!is_empty_class (basetype))
3665 /* The containing class is non-empty because it has a non-empty
3667 CLASSTYPE_EMPTY_P (t) = 0;
3669 /* Create the FIELD_DECL. */
3670 decl = build_decl (FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
3671 DECL_ARTIFICIAL (decl) = 1;
3672 DECL_FIELD_CONTEXT (decl) = t;
3673 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3674 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3675 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3676 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3677 DECL_IGNORED_P (decl) = 1;
3679 /* Try to place the field. It may take more than one try if we
3680 have a hard time placing the field without putting two
3681 objects of the same type at the same address. */
3682 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
3683 /* Add the new FIELD_DECL to the list of fields for T. */
3684 TREE_CHAIN (decl) = *next_field;
3686 next_field = &TREE_CHAIN (decl);
3693 /* On some platforms (ARM), even empty classes will not be
3695 eoc = round_up (rli_size_unit_so_far (rli),
3696 CLASSTYPE_ALIGN_UNIT (basetype));
3697 atend = layout_empty_base (binfo, eoc, offsets);
3698 /* A nearly-empty class "has no proper base class that is empty,
3699 not morally virtual, and at an offset other than zero." */
3700 if (!TREE_VIA_VIRTUAL (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
3703 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3704 /* The check above (used in G++ 3.2) is insufficient because
3705 an empty class placed at offset zero might itself have an
3706 empty base at a nonzero offset. */
3707 else if (walk_subobject_offsets (basetype,
3708 empty_base_at_nonzero_offset_p,
3711 /*max_offset=*/NULL_TREE,
3714 if (abi_version_at_least (2))
3715 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3717 warning ("class `%T' will be considered nearly empty in a "
3718 "future version of GCC", t);
3722 /* We do not create a FIELD_DECL for empty base classes because
3723 it might overlap some other field. We want to be able to
3724 create CONSTRUCTORs for the class by iterating over the
3725 FIELD_DECLs, and the back end does not handle overlapping
3728 /* An empty virtual base causes a class to be non-empty
3729 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3730 here because that was already done when the virtual table
3731 pointer was created. */
3734 /* Record the offsets of BINFO and its base subobjects. */
3735 record_subobject_offsets (binfo,
3736 BINFO_OFFSET (binfo),
3743 /* Layout all of the non-virtual base classes. Record empty
3744 subobjects in OFFSETS. T is the most derived type. Return nonzero
3745 if the type cannot be nearly empty. The fields created
3746 corresponding to the base classes will be inserted at
3750 build_base_fields (record_layout_info rli,
3751 splay_tree offsets, tree *next_field)
3753 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3756 int n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
3759 /* The primary base class is always allocated first. */
3760 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
3761 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
3762 offsets, next_field);
3764 /* Now allocate the rest of the bases. */
3765 for (i = 0; i < n_baseclasses; ++i)
3769 base_binfo = BINFO_BASETYPE (TYPE_BINFO (t), i);
3771 /* The primary base was already allocated above, so we don't
3772 need to allocate it again here. */
3773 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
3776 /* Virtual bases are added at the end (a primary virtual base
3777 will have already been added). */
3778 if (TREE_VIA_VIRTUAL (base_binfo))
3781 next_field = build_base_field (rli, base_binfo,
3782 offsets, next_field);
3786 /* Go through the TYPE_METHODS of T issuing any appropriate
3787 diagnostics, figuring out which methods override which other
3788 methods, and so forth. */
3791 check_methods (tree t)
3795 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3797 /* If this was an evil function, don't keep it in class. */
3798 if (DECL_ASSEMBLER_NAME_SET_P (x)
3799 && IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x)))
3802 check_for_override (x, t);
3803 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3804 cp_error_at ("initializer specified for non-virtual method `%D'", x);
3806 /* The name of the field is the original field name
3807 Save this in auxiliary field for later overloading. */
3808 if (DECL_VINDEX (x))
3810 TYPE_POLYMORPHIC_P (t) = 1;
3811 if (DECL_PURE_VIRTUAL_P (x))
3812 CLASSTYPE_PURE_VIRTUALS (t)
3813 = tree_cons (NULL_TREE, x, CLASSTYPE_PURE_VIRTUALS (t));
3818 /* FN is a constructor or destructor. Clone the declaration to create
3819 a specialized in-charge or not-in-charge version, as indicated by
3823 build_clone (tree fn, tree name)
3828 /* Copy the function. */
3829 clone = copy_decl (fn);
3830 /* Remember where this function came from. */
3831 DECL_CLONED_FUNCTION (clone) = fn;
3832 DECL_ABSTRACT_ORIGIN (clone) = fn;
3833 /* Reset the function name. */
3834 DECL_NAME (clone) = name;
3835 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
3836 /* There's no pending inline data for this function. */
3837 DECL_PENDING_INLINE_INFO (clone) = NULL;
3838 DECL_PENDING_INLINE_P (clone) = 0;
3839 /* And it hasn't yet been deferred. */
3840 DECL_DEFERRED_FN (clone) = 0;
3842 /* The base-class destructor is not virtual. */
3843 if (name == base_dtor_identifier)
3845 DECL_VIRTUAL_P (clone) = 0;
3846 if (TREE_CODE (clone) != TEMPLATE_DECL)
3847 DECL_VINDEX (clone) = NULL_TREE;
3850 /* If there was an in-charge parameter, drop it from the function
3852 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3858 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
3859 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
3860 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
3861 /* Skip the `this' parameter. */
3862 parmtypes = TREE_CHAIN (parmtypes);
3863 /* Skip the in-charge parameter. */
3864 parmtypes = TREE_CHAIN (parmtypes);
3865 /* And the VTT parm, in a complete [cd]tor. */
3866 if (DECL_HAS_VTT_PARM_P (fn)
3867 && ! DECL_NEEDS_VTT_PARM_P (clone))
3868 parmtypes = TREE_CHAIN (parmtypes);
3869 /* If this is subobject constructor or destructor, add the vtt
3872 = build_method_type_directly (basetype,
3873 TREE_TYPE (TREE_TYPE (clone)),
3876 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
3879 = build_type_attribute_variant (TREE_TYPE (clone),
3880 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
3883 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3884 aren't function parameters; those are the template parameters. */
3885 if (TREE_CODE (clone) != TEMPLATE_DECL)
3887 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
3888 /* Remove the in-charge parameter. */
3889 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
3891 TREE_CHAIN (DECL_ARGUMENTS (clone))
3892 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3893 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
3895 /* And the VTT parm, in a complete [cd]tor. */
3896 if (DECL_HAS_VTT_PARM_P (fn))
3898 if (DECL_NEEDS_VTT_PARM_P (clone))
3899 DECL_HAS_VTT_PARM_P (clone) = 1;
3902 TREE_CHAIN (DECL_ARGUMENTS (clone))
3903 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
3904 DECL_HAS_VTT_PARM_P (clone) = 0;
3908 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
3910 DECL_CONTEXT (parms) = clone;
3911 cxx_dup_lang_specific_decl (parms);
3915 /* Create the RTL for this function. */
3916 SET_DECL_RTL (clone, NULL_RTX);
3917 rest_of_decl_compilation (clone, NULL, /*top_level=*/1, at_eof);
3919 /* Make it easy to find the CLONE given the FN. */
3920 TREE_CHAIN (clone) = TREE_CHAIN (fn);
3921 TREE_CHAIN (fn) = clone;
3923 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3924 if (TREE_CODE (clone) == TEMPLATE_DECL)
3928 DECL_TEMPLATE_RESULT (clone)
3929 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
3930 result = DECL_TEMPLATE_RESULT (clone);
3931 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
3932 DECL_TI_TEMPLATE (result) = clone;
3934 else if (DECL_DEFERRED_FN (fn))
3940 /* Produce declarations for all appropriate clones of FN. If
3941 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3942 CLASTYPE_METHOD_VEC as well. */
3945 clone_function_decl (tree fn, int update_method_vec_p)
3949 /* Avoid inappropriate cloning. */
3951 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn)))
3954 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
3956 /* For each constructor, we need two variants: an in-charge version
3957 and a not-in-charge version. */
3958 clone = build_clone (fn, complete_ctor_identifier);
3959 if (update_method_vec_p)
3960 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
3961 clone = build_clone (fn, base_ctor_identifier);
3962 if (update_method_vec_p)
3963 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
3967 my_friendly_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn), 20000411);
3969 /* For each destructor, we need three variants: an in-charge
3970 version, a not-in-charge version, and an in-charge deleting
3971 version. We clone the deleting version first because that
3972 means it will go second on the TYPE_METHODS list -- and that
3973 corresponds to the correct layout order in the virtual
3976 For a non-virtual destructor, we do not build a deleting
3978 if (DECL_VIRTUAL_P (fn))
3980 clone = build_clone (fn, deleting_dtor_identifier);
3981 if (update_method_vec_p)
3982 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
3984 clone = build_clone (fn, complete_dtor_identifier);
3985 if (update_method_vec_p)
3986 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
3987 clone = build_clone (fn, base_dtor_identifier);
3988 if (update_method_vec_p)
3989 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
3992 /* Note that this is an abstract function that is never emitted. */
3993 DECL_ABSTRACT (fn) = 1;
3996 /* DECL is an in charge constructor, which is being defined. This will
3997 have had an in class declaration, from whence clones were
3998 declared. An out-of-class definition can specify additional default
3999 arguments. As it is the clones that are involved in overload
4000 resolution, we must propagate the information from the DECL to its
4004 adjust_clone_args (tree decl)
4008 for (clone = TREE_CHAIN (decl); clone && DECL_CLONED_FUNCTION (clone);
4009 clone = TREE_CHAIN (clone))
4011 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
4012 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
4013 tree decl_parms, clone_parms;
4015 clone_parms = orig_clone_parms;
4017 /* Skip the 'this' parameter. */
4018 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
4019 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4021 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
4022 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4023 if (DECL_HAS_VTT_PARM_P (decl))
4024 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4026 clone_parms = orig_clone_parms;
4027 if (DECL_HAS_VTT_PARM_P (clone))
4028 clone_parms = TREE_CHAIN (clone_parms);
4030 for (decl_parms = orig_decl_parms; decl_parms;
4031 decl_parms = TREE_CHAIN (decl_parms),
4032 clone_parms = TREE_CHAIN (clone_parms))
4034 my_friendly_assert (same_type_p (TREE_TYPE (decl_parms),
4035 TREE_TYPE (clone_parms)), 20010424);
4037 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
4039 /* A default parameter has been added. Adjust the
4040 clone's parameters. */
4041 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
4042 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
4045 clone_parms = orig_decl_parms;
4047 if (DECL_HAS_VTT_PARM_P (clone))
4049 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
4050 TREE_VALUE (orig_clone_parms),
4052 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
4054 type = build_method_type_directly (basetype,
4055 TREE_TYPE (TREE_TYPE (clone)),
4058 type = build_exception_variant (type, exceptions);
4059 TREE_TYPE (clone) = type;
4061 clone_parms = NULL_TREE;
4065 my_friendly_assert (!clone_parms, 20010424);
4069 /* For each of the constructors and destructors in T, create an
4070 in-charge and not-in-charge variant. */
4073 clone_constructors_and_destructors (tree t)
4077 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4079 if (!CLASSTYPE_METHOD_VEC (t))
4082 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4083 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4084 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4085 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4088 /* Remove all zero-width bit-fields from T. */
4091 remove_zero_width_bit_fields (tree t)
4095 fieldsp = &TYPE_FIELDS (t);
4098 if (TREE_CODE (*fieldsp) == FIELD_DECL
4099 && DECL_C_BIT_FIELD (*fieldsp)
4100 && DECL_INITIAL (*fieldsp))
4101 *fieldsp = TREE_CHAIN (*fieldsp);
4103 fieldsp = &TREE_CHAIN (*fieldsp);
4107 /* Returns TRUE iff we need a cookie when dynamically allocating an
4108 array whose elements have the indicated class TYPE. */
4111 type_requires_array_cookie (tree type)
4114 bool has_two_argument_delete_p = false;
4116 my_friendly_assert (CLASS_TYPE_P (type), 20010712);
4118 /* If there's a non-trivial destructor, we need a cookie. In order
4119 to iterate through the array calling the destructor for each
4120 element, we'll have to know how many elements there are. */
4121 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4124 /* If the usual deallocation function is a two-argument whose second
4125 argument is of type `size_t', then we have to pass the size of
4126 the array to the deallocation function, so we will need to store
4128 fns = lookup_fnfields (TYPE_BINFO (type),
4129 ansi_opname (VEC_DELETE_EXPR),
4131 /* If there are no `operator []' members, or the lookup is
4132 ambiguous, then we don't need a cookie. */
4133 if (!fns || fns == error_mark_node)
4135 /* Loop through all of the functions. */
4136 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
4141 /* Select the current function. */
4142 fn = OVL_CURRENT (fns);
4143 /* See if this function is a one-argument delete function. If
4144 it is, then it will be the usual deallocation function. */
4145 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
4146 if (second_parm == void_list_node)
4148 /* Otherwise, if we have a two-argument function and the second
4149 argument is `size_t', it will be the usual deallocation
4150 function -- unless there is one-argument function, too. */
4151 if (TREE_CHAIN (second_parm) == void_list_node
4152 && same_type_p (TREE_VALUE (second_parm), sizetype))
4153 has_two_argument_delete_p = true;
4156 return has_two_argument_delete_p;
4159 /* Check the validity of the bases and members declared in T. Add any
4160 implicitly-generated functions (like copy-constructors and
4161 assignment operators). Compute various flag bits (like
4162 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4163 level: i.e., independently of the ABI in use. */
4166 check_bases_and_members (tree t)
4168 /* Nonzero if we are not allowed to generate a default constructor
4170 int cant_have_default_ctor;
4171 /* Nonzero if the implicitly generated copy constructor should take
4172 a non-const reference argument. */
4173 int cant_have_const_ctor;
4174 /* Nonzero if the the implicitly generated assignment operator
4175 should take a non-const reference argument. */
4176 int no_const_asn_ref;
4179 /* By default, we use const reference arguments and generate default
4181 cant_have_default_ctor = 0;
4182 cant_have_const_ctor = 0;
4183 no_const_asn_ref = 0;
4185 /* Check all the base-classes. */
4186 check_bases (t, &cant_have_default_ctor, &cant_have_const_ctor,
4189 /* Check all the data member declarations. */
4190 check_field_decls (t, &access_decls,
4191 &cant_have_default_ctor,
4192 &cant_have_const_ctor,
4195 /* Check all the method declarations. */
4198 /* A nearly-empty class has to be vptr-containing; a nearly empty
4199 class contains just a vptr. */
4200 if (!TYPE_CONTAINS_VPTR_P (t))
4201 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4203 /* Do some bookkeeping that will guide the generation of implicitly
4204 declared member functions. */
4205 TYPE_HAS_COMPLEX_INIT_REF (t)
4206 |= (TYPE_HAS_INIT_REF (t)
4207 || TYPE_USES_VIRTUAL_BASECLASSES (t)
4208 || TYPE_POLYMORPHIC_P (t));
4209 TYPE_NEEDS_CONSTRUCTING (t)
4210 |= (TYPE_HAS_CONSTRUCTOR (t)
4211 || TYPE_USES_VIRTUAL_BASECLASSES (t)
4212 || TYPE_POLYMORPHIC_P (t));
4213 CLASSTYPE_NON_AGGREGATE (t) |= (TYPE_HAS_CONSTRUCTOR (t)
4214 || TYPE_POLYMORPHIC_P (t));
4215 CLASSTYPE_NON_POD_P (t)
4216 |= (CLASSTYPE_NON_AGGREGATE (t) || TYPE_HAS_DESTRUCTOR (t)
4217 || TYPE_HAS_ASSIGN_REF (t));
4218 TYPE_HAS_REAL_ASSIGN_REF (t) |= TYPE_HAS_ASSIGN_REF (t);
4219 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4220 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_CONTAINS_VPTR_P (t);
4222 /* Synthesize any needed methods. Note that methods will be synthesized
4223 for anonymous unions; grok_x_components undoes that. */
4224 add_implicitly_declared_members (t, cant_have_default_ctor,
4225 cant_have_const_ctor,
4228 /* Create the in-charge and not-in-charge variants of constructors
4230 clone_constructors_and_destructors (t);
4232 /* Process the using-declarations. */
4233 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4234 handle_using_decl (TREE_VALUE (access_decls), t);
4236 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4237 finish_struct_methods (t);
4239 /* Figure out whether or not we will need a cookie when dynamically
4240 allocating an array of this type. */
4241 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
4242 = type_requires_array_cookie (t);
4245 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4246 accordingly. If a new vfield was created (because T doesn't have a
4247 primary base class), then the newly created field is returned. It
4248 is not added to the TYPE_FIELDS list; it is the caller's
4249 responsibility to do that. Accumulate declared virtual functions
4253 create_vtable_ptr (tree t, tree* virtuals_p)
4257 /* Collect the virtual functions declared in T. */
4258 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4259 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
4260 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
4262 tree new_virtual = make_node (TREE_LIST);
4264 BV_FN (new_virtual) = fn;
4265 BV_DELTA (new_virtual) = integer_zero_node;
4267 TREE_CHAIN (new_virtual) = *virtuals_p;
4268 *virtuals_p = new_virtual;
4271 /* If we couldn't find an appropriate base class, create a new field
4272 here. Even if there weren't any new virtual functions, we might need a
4273 new virtual function table if we're supposed to include vptrs in
4274 all classes that need them. */
4275 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
4277 /* We build this decl with vtbl_ptr_type_node, which is a
4278 `vtable_entry_type*'. It might seem more precise to use
4279 `vtable_entry_type (*)[N]' where N is the number of firtual
4280 functions. However, that would require the vtable pointer in
4281 base classes to have a different type than the vtable pointer
4282 in derived classes. We could make that happen, but that
4283 still wouldn't solve all the problems. In particular, the
4284 type-based alias analysis code would decide that assignments
4285 to the base class vtable pointer can't alias assignments to
4286 the derived class vtable pointer, since they have different
4287 types. Thus, in a derived class destructor, where the base
4288 class constructor was inlined, we could generate bad code for
4289 setting up the vtable pointer.
4291 Therefore, we use one type for all vtable pointers. We still
4292 use a type-correct type; it's just doesn't indicate the array
4293 bounds. That's better than using `void*' or some such; it's
4294 cleaner, and it let's the alias analysis code know that these
4295 stores cannot alias stores to void*! */
4298 field = build_decl (FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
4299 SET_DECL_ASSEMBLER_NAME (field, get_identifier (VFIELD_BASE));
4300 DECL_VIRTUAL_P (field) = 1;
4301 DECL_ARTIFICIAL (field) = 1;
4302 DECL_FIELD_CONTEXT (field) = t;
4303 DECL_FCONTEXT (field) = t;
4305 TYPE_VFIELD (t) = field;
4307 /* This class is non-empty. */
4308 CLASSTYPE_EMPTY_P (t) = 0;
4310 if (CLASSTYPE_N_BASECLASSES (t))
4311 /* If there were any baseclasses, they can't possibly be at
4312 offset zero any more, because that's where the vtable
4313 pointer is. So, converting to a base class is going to
4315 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t) = 1;
4323 /* Fixup the inline function given by INFO now that the class is
4327 fixup_pending_inline (tree fn)
4329 if (DECL_PENDING_INLINE_INFO (fn))
4331 tree args = DECL_ARGUMENTS (fn);
4334 DECL_CONTEXT (args) = fn;
4335 args = TREE_CHAIN (args);
4340 /* Fixup the inline methods and friends in TYPE now that TYPE is
4344 fixup_inline_methods (tree type)
4346 tree method = TYPE_METHODS (type);
4348 if (method && TREE_CODE (method) == TREE_VEC)
4350 if (TREE_VEC_ELT (method, 1))
4351 method = TREE_VEC_ELT (method, 1);
4352 else if (TREE_VEC_ELT (method, 0))
4353 method = TREE_VEC_ELT (method, 0);
4355 method = TREE_VEC_ELT (method, 2);
4358 /* Do inline member functions. */
4359 for (; method; method = TREE_CHAIN (method))
4360 fixup_pending_inline (method);
4363 for (method = CLASSTYPE_INLINE_FRIENDS (type);
4365 method = TREE_CHAIN (method))
4366 fixup_pending_inline (TREE_VALUE (method));
4367 CLASSTYPE_INLINE_FRIENDS (type) = NULL_TREE;
4370 /* Add OFFSET to all base types of BINFO which is a base in the
4371 hierarchy dominated by T.
4373 OFFSET, which is a type offset, is number of bytes. */
4376 propagate_binfo_offsets (tree binfo, tree offset)
4381 /* Update BINFO's offset. */
4382 BINFO_OFFSET (binfo)
4383 = convert (sizetype,
4384 size_binop (PLUS_EXPR,
4385 convert (ssizetype, BINFO_OFFSET (binfo)),
4388 /* Find the primary base class. */
4389 primary_binfo = get_primary_binfo (binfo);
4391 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4393 for (i = -1; i < BINFO_N_BASETYPES (binfo); ++i)
4397 /* On the first time through the loop, do the primary base.
4398 Because the primary base need not be an immediate base, we
4399 must handle the primary base specially. */
4405 base_binfo = primary_binfo;
4409 base_binfo = BINFO_BASETYPE (binfo, i);
4410 /* Don't do the primary base twice. */
4411 if (base_binfo == primary_binfo)
4415 /* Skip virtual bases that aren't our canonical primary base. */
4416 if (TREE_VIA_VIRTUAL (base_binfo)
4417 && BINFO_PRIMARY_BASE_OF (base_binfo) != binfo)
4420 propagate_binfo_offsets (base_binfo, offset);
4424 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4425 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4426 empty subobjects of T. */
4429 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
4433 bool first_vbase = true;
4436 if (CLASSTYPE_N_BASECLASSES (t) == 0)
4439 if (!abi_version_at_least(2))
4441 /* In G++ 3.2, we incorrectly rounded the size before laying out
4442 the virtual bases. */
4443 finish_record_layout (rli, /*free_p=*/false);
4444 #ifdef STRUCTURE_SIZE_BOUNDARY
4445 /* Packed structures don't need to have minimum size. */
4446 if (! TYPE_PACKED (t))
4447 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
4449 rli->offset = TYPE_SIZE_UNIT (t);
4450 rli->bitpos = bitsize_zero_node;
4451 rli->record_align = TYPE_ALIGN (t);
4454 /* Find the last field. The artificial fields created for virtual
4455 bases will go after the last extant field to date. */
4456 next_field = &TYPE_FIELDS (t);
4458 next_field = &TREE_CHAIN (*next_field);
4460 /* Go through the virtual bases, allocating space for each virtual
4461 base that is not already a primary base class. These are
4462 allocated in inheritance graph order. */
4463 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
4465 if (!TREE_VIA_VIRTUAL (vbase))
4468 if (!BINFO_PRIMARY_P (vbase))
4470 tree basetype = TREE_TYPE (vbase);
4472 /* This virtual base is not a primary base of any class in the
4473 hierarchy, so we have to add space for it. */
4474 next_field = build_base_field (rli, vbase,
4475 offsets, next_field);
4477 /* If the first virtual base might have been placed at a
4478 lower address, had we started from CLASSTYPE_SIZE, rather
4479 than TYPE_SIZE, issue a warning. There can be both false
4480 positives and false negatives from this warning in rare
4481 cases; to deal with all the possibilities would probably
4482 require performing both layout algorithms and comparing
4483 the results which is not particularly tractable. */
4487 (size_binop (CEIL_DIV_EXPR,
4488 round_up (CLASSTYPE_SIZE (t),
4489 CLASSTYPE_ALIGN (basetype)),
4491 BINFO_OFFSET (vbase))))
4492 warning ("offset of virtual base `%T' is not ABI-compliant and may change in a future version of GCC",
4495 first_vbase = false;
4500 /* Returns the offset of the byte just past the end of the base class
4504 end_of_base (tree binfo)
4508 if (is_empty_class (BINFO_TYPE (binfo)))
4509 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4510 allocate some space for it. It cannot have virtual bases, so
4511 TYPE_SIZE_UNIT is fine. */
4512 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4514 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
4516 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
4519 /* Returns the offset of the byte just past the end of the base class
4520 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4521 only non-virtual bases are included. */
4524 end_of_class (tree t, int include_virtuals_p)
4526 tree result = size_zero_node;
4531 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
4533 binfo = BINFO_BASETYPE (TYPE_BINFO (t), i);
4535 if (!include_virtuals_p
4536 && TREE_VIA_VIRTUAL (binfo)
4537 && BINFO_PRIMARY_BASE_OF (binfo) != TYPE_BINFO (t))
4540 offset = end_of_base (binfo);
4541 if (INT_CST_LT_UNSIGNED (result, offset))
4545 /* G++ 3.2 did not check indirect virtual bases. */
4546 if (abi_version_at_least (2) && include_virtuals_p)
4547 for (binfo = CLASSTYPE_VBASECLASSES (t);
4549 binfo = TREE_CHAIN (binfo))
4551 offset = end_of_base (TREE_VALUE (binfo));
4552 if (INT_CST_LT_UNSIGNED (result, offset))
4559 /* Warn about bases of T that are inaccessible because they are
4560 ambiguous. For example:
4563 struct T : public S {};
4564 struct U : public S, public T {};
4566 Here, `(S*) new U' is not allowed because there are two `S'
4570 warn_about_ambiguous_bases (tree t)
4576 /* Check direct bases. */
4577 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
4579 basetype = TYPE_BINFO_BASETYPE (t, i);
4581 if (!lookup_base (t, basetype, ba_ignore | ba_quiet, NULL))
4582 warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
4586 /* Check for ambiguous virtual bases. */
4588 for (vbases = CLASSTYPE_VBASECLASSES (t);
4590 vbases = TREE_CHAIN (vbases))
4592 basetype = BINFO_TYPE (TREE_VALUE (vbases));
4594 if (!lookup_base (t, basetype, ba_ignore | ba_quiet, NULL))
4595 warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
4600 /* Compare two INTEGER_CSTs K1 and K2. */
4603 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
4605 return tree_int_cst_compare ((tree) k1, (tree) k2);
4608 /* Increase the size indicated in RLI to account for empty classes
4609 that are "off the end" of the class. */
4612 include_empty_classes (record_layout_info rli)
4617 /* It might be the case that we grew the class to allocate a
4618 zero-sized base class. That won't be reflected in RLI, yet,
4619 because we are willing to overlay multiple bases at the same
4620 offset. However, now we need to make sure that RLI is big enough
4621 to reflect the entire class. */
4622 eoc = end_of_class (rli->t,
4623 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
4624 rli_size = rli_size_unit_so_far (rli);
4625 if (TREE_CODE (rli_size) == INTEGER_CST
4626 && INT_CST_LT_UNSIGNED (rli_size, eoc))
4628 if (!abi_version_at_least (2))
4629 /* In version 1 of the ABI, the size of a class that ends with
4630 a bitfield was not rounded up to a whole multiple of a
4631 byte. Because rli_size_unit_so_far returns only the number
4632 of fully allocated bytes, any extra bits were not included
4634 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
4636 /* The size should have been rounded to a whole byte. */
4637 my_friendly_assert (tree_int_cst_equal (rli->bitpos,
4638 round_down (rli->bitpos,
4642 = size_binop (PLUS_EXPR,
4644 size_binop (MULT_EXPR,
4645 convert (bitsizetype,
4646 size_binop (MINUS_EXPR,
4648 bitsize_int (BITS_PER_UNIT)));
4649 normalize_rli (rli);
4653 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4654 BINFO_OFFSETs for all of the base-classes. Position the vtable
4655 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4658 layout_class_type (tree t, tree *virtuals_p)
4660 tree non_static_data_members;
4663 record_layout_info rli;
4664 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4665 types that appear at that offset. */
4666 splay_tree empty_base_offsets;
4667 /* True if the last field layed out was a bit-field. */
4668 bool last_field_was_bitfield = false;
4669 /* The location at which the next field should be inserted. */
4671 /* T, as a base class. */
4674 /* Keep track of the first non-static data member. */
4675 non_static_data_members = TYPE_FIELDS (t);
4677 /* Start laying out the record. */
4678 rli = start_record_layout (t);
4680 /* If possible, we reuse the virtual function table pointer from one
4681 of our base classes. */
4682 determine_primary_base (t);
4684 /* Create a pointer to our virtual function table. */
4685 vptr = create_vtable_ptr (t, virtuals_p);
4687 /* The vptr is always the first thing in the class. */
4690 TREE_CHAIN (vptr) = TYPE_FIELDS (t);
4691 TYPE_FIELDS (t) = vptr;
4692 next_field = &TREE_CHAIN (vptr);
4693 place_field (rli, vptr);
4696 next_field = &TYPE_FIELDS (t);
4698 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4699 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
4701 build_base_fields (rli, empty_base_offsets, next_field);
4703 /* Layout the non-static data members. */
4704 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4709 /* We still pass things that aren't non-static data members to
4710 the back-end, in case it wants to do something with them. */
4711 if (TREE_CODE (field) != FIELD_DECL)
4713 place_field (rli, field);
4714 /* If the static data member has incomplete type, keep track
4715 of it so that it can be completed later. (The handling
4716 of pending statics in finish_record_layout is
4717 insufficient; consider:
4720 struct S2 { static S1 s1; };
4722 At this point, finish_record_layout will be called, but
4723 S1 is still incomplete.) */
4724 if (TREE_CODE (field) == VAR_DECL)
4725 maybe_register_incomplete_var (field);
4729 type = TREE_TYPE (field);
4731 padding = NULL_TREE;
4733 /* If this field is a bit-field whose width is greater than its
4734 type, then there are some special rules for allocating
4736 if (DECL_C_BIT_FIELD (field)
4737 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4739 integer_type_kind itk;
4741 bool was_unnamed_p = false;
4742 /* We must allocate the bits as if suitably aligned for the
4743 longest integer type that fits in this many bits. type
4744 of the field. Then, we are supposed to use the left over
4745 bits as additional padding. */
4746 for (itk = itk_char; itk != itk_none; ++itk)
4747 if (INT_CST_LT (DECL_SIZE (field),
4748 TYPE_SIZE (integer_types[itk])))
4751 /* ITK now indicates a type that is too large for the
4752 field. We have to back up by one to find the largest
4754 integer_type = integer_types[itk - 1];
4756 /* Figure out how much additional padding is required. GCC
4757 3.2 always created a padding field, even if it had zero
4759 if (!abi_version_at_least (2)
4760 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
4762 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
4763 /* In a union, the padding field must have the full width
4764 of the bit-field; all fields start at offset zero. */
4765 padding = DECL_SIZE (field);
4768 if (warn_abi && TREE_CODE (t) == UNION_TYPE)
4769 warning ("size assigned to `%T' may not be "
4770 "ABI-compliant and may change in a future "
4773 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4774 TYPE_SIZE (integer_type));
4777 #ifdef PCC_BITFIELD_TYPE_MATTERS
4778 /* An unnamed bitfield does not normally affect the
4779 alignment of the containing class on a target where
4780 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4781 make any exceptions for unnamed bitfields when the
4782 bitfields are longer than their types. Therefore, we
4783 temporarily give the field a name. */
4784 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
4786 was_unnamed_p = true;
4787 DECL_NAME (field) = make_anon_name ();
4790 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4791 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4792 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4793 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4794 empty_base_offsets);
4796 DECL_NAME (field) = NULL_TREE;
4797 /* Now that layout has been performed, set the size of the
4798 field to the size of its declared type; the rest of the
4799 field is effectively invisible. */
4800 DECL_SIZE (field) = TYPE_SIZE (type);
4801 /* We must also reset the DECL_MODE of the field. */
4802 if (abi_version_at_least (2))
4803 DECL_MODE (field) = TYPE_MODE (type);
4805 && DECL_MODE (field) != TYPE_MODE (type))
4806 /* Versions of G++ before G++ 3.4 did not reset the
4808 warning ("the offset of `%D' may not be ABI-compliant and may "
4809 "change in a future version of GCC", field);
4812 layout_nonempty_base_or_field (rli, field, NULL_TREE,
4813 empty_base_offsets);
4815 /* Remember the location of any empty classes in FIELD. */
4816 if (abi_version_at_least (2))
4817 record_subobject_offsets (TREE_TYPE (field),
4818 byte_position(field),
4822 /* If a bit-field does not immediately follow another bit-field,
4823 and yet it starts in the middle of a byte, we have failed to
4824 comply with the ABI. */
4826 && DECL_C_BIT_FIELD (field)
4827 && !last_field_was_bitfield
4828 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
4829 DECL_FIELD_BIT_OFFSET (field),
4830 bitsize_unit_node)))
4831 cp_warning_at ("offset of `%D' is not ABI-compliant and may change in a future version of GCC",
4834 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4835 offset of the field. */
4837 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
4838 byte_position (field))
4839 && contains_empty_class_p (TREE_TYPE (field)))
4840 cp_warning_at ("`%D' contains empty classes which may cause base "
4841 "classes to be placed at different locations in a "
4842 "future version of GCC",
4845 /* If we needed additional padding after this field, add it
4851 padding_field = build_decl (FIELD_DECL,
4854 DECL_BIT_FIELD (padding_field) = 1;
4855 DECL_SIZE (padding_field) = padding;
4856 DECL_CONTEXT (padding_field) = t;
4857 DECL_ARTIFICIAL (padding_field) = 1;
4858 layout_nonempty_base_or_field (rli, padding_field,
4860 empty_base_offsets);
4863 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
4866 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
4868 /* Make sure that we are on a byte boundary so that the size of
4869 the class without virtual bases will always be a round number
4871 rli->bitpos = round_up (rli->bitpos, BITS_PER_UNIT);
4872 normalize_rli (rli);
4875 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4877 if (!abi_version_at_least (2))
4878 include_empty_classes(rli);
4880 /* Delete all zero-width bit-fields from the list of fields. Now
4881 that the type is laid out they are no longer important. */
4882 remove_zero_width_bit_fields (t);
4884 /* Create the version of T used for virtual bases. We do not use
4885 make_aggr_type for this version; this is an artificial type. For
4886 a POD type, we just reuse T. */
4887 if (CLASSTYPE_NON_POD_P (t) || CLASSTYPE_EMPTY_P (t))
4889 base_t = make_node (TREE_CODE (t));
4891 /* Set the size and alignment for the new type. In G++ 3.2, all
4892 empty classes were considered to have size zero when used as
4894 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
4896 TYPE_SIZE (base_t) = bitsize_zero_node;
4897 TYPE_SIZE_UNIT (base_t) = size_zero_node;
4898 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
4899 warning ("layout of classes derived from empty class `%T' "
4900 "may change in a future version of GCC",
4907 /* If the ABI version is not at least two, and the last
4908 field was a bit-field, RLI may not be on a byte
4909 boundary. In particular, rli_size_unit_so_far might
4910 indicate the last complete byte, while rli_size_so_far
4911 indicates the total number of bits used. Therefore,
4912 rli_size_so_far, rather than rli_size_unit_so_far, is
4913 used to compute TYPE_SIZE_UNIT. */
4914 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4915 TYPE_SIZE_UNIT (base_t)
4916 = size_binop (MAX_EXPR,
4918 size_binop (CEIL_DIV_EXPR,
4919 rli_size_so_far (rli),
4920 bitsize_int (BITS_PER_UNIT))),
4923 = size_binop (MAX_EXPR,
4924 rli_size_so_far (rli),
4925 size_binop (MULT_EXPR,
4926 convert (bitsizetype, eoc),
4927 bitsize_int (BITS_PER_UNIT)));
4929 TYPE_ALIGN (base_t) = rli->record_align;
4930 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
4932 /* Copy the fields from T. */
4933 next_field = &TYPE_FIELDS (base_t);
4934 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
4935 if (TREE_CODE (field) == FIELD_DECL)
4937 *next_field = build_decl (FIELD_DECL,
4940 DECL_CONTEXT (*next_field) = base_t;
4941 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
4942 DECL_FIELD_BIT_OFFSET (*next_field)
4943 = DECL_FIELD_BIT_OFFSET (field);
4944 DECL_SIZE (*next_field) = DECL_SIZE (field);
4945 DECL_MODE (*next_field) = DECL_MODE (field);
4946 next_field = &TREE_CHAIN (*next_field);
4949 /* Record the base version of the type. */
4950 CLASSTYPE_AS_BASE (t) = base_t;
4951 TYPE_CONTEXT (base_t) = t;
4954 CLASSTYPE_AS_BASE (t) = t;
4956 /* Every empty class contains an empty class. */
4957 if (CLASSTYPE_EMPTY_P (t))
4958 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
4960 /* Set the TYPE_DECL for this type to contain the right
4961 value for DECL_OFFSET, so that we can use it as part
4962 of a COMPONENT_REF for multiple inheritance. */
4963 layout_decl (TYPE_MAIN_DECL (t), 0);
4965 /* Now fix up any virtual base class types that we left lying
4966 around. We must get these done before we try to lay out the
4967 virtual function table. As a side-effect, this will remove the
4968 base subobject fields. */
4969 layout_virtual_bases (rli, empty_base_offsets);
4971 /* Make sure that empty classes are reflected in RLI at this
4973 include_empty_classes(rli);
4975 /* Make sure not to create any structures with zero size. */
4976 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
4978 build_decl (FIELD_DECL, NULL_TREE, char_type_node));
4980 /* Let the back-end lay out the type. */
4981 finish_record_layout (rli, /*free_p=*/true);
4983 /* Warn about bases that can't be talked about due to ambiguity. */
4984 warn_about_ambiguous_bases (t);
4987 splay_tree_delete (empty_base_offsets);
4990 /* Returns the virtual function with which the vtable for TYPE is
4991 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
4994 key_method (tree type)
4998 if (TYPE_FOR_JAVA (type)
4999 || processing_template_decl
5000 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
5001 || CLASSTYPE_INTERFACE_KNOWN (type))
5004 for (method = TYPE_METHODS (type); method != NULL_TREE;
5005 method = TREE_CHAIN (method))
5006 if (DECL_VINDEX (method) != NULL_TREE
5007 && ! DECL_DECLARED_INLINE_P (method)
5008 && ! DECL_PURE_VIRTUAL_P (method))
5014 /* Perform processing required when the definition of T (a class type)
5018 finish_struct_1 (tree t)
5021 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5022 tree virtuals = NULL_TREE;
5026 if (COMPLETE_TYPE_P (t))
5028 if (IS_AGGR_TYPE (t))
5029 error ("redefinition of `%#T'", t);
5036 /* If this type was previously laid out as a forward reference,
5037 make sure we lay it out again. */
5038 TYPE_SIZE (t) = NULL_TREE;
5039 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
5041 fixup_inline_methods (t);
5043 /* Make assumptions about the class; we'll reset the flags if
5045 CLASSTYPE_EMPTY_P (t) = 1;
5046 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
5047 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
5049 /* Do end-of-class semantic processing: checking the validity of the
5050 bases and members and add implicitly generated methods. */
5051 check_bases_and_members (t);
5053 /* Find the key method. */
5054 if (TYPE_CONTAINS_VPTR_P (t))
5056 CLASSTYPE_KEY_METHOD (t) = key_method (t);
5058 /* If a polymorphic class has no key method, we may emit the vtable
5059 in every translation unit where the class definition appears. */
5060 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
5061 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
5064 /* Layout the class itself. */
5065 layout_class_type (t, &virtuals);
5066 if (CLASSTYPE_AS_BASE (t) != t)
5067 /* We use the base type for trivial assignments, and hence it
5069 compute_record_mode (CLASSTYPE_AS_BASE (t));
5071 /* Make sure that we get our own copy of the vfield FIELD_DECL. */
5072 vfield = TYPE_VFIELD (t);
5073 if (vfield && CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5075 tree primary = CLASSTYPE_PRIMARY_BINFO (t);
5077 my_friendly_assert (same_type_p (DECL_FIELD_CONTEXT (vfield),
5078 BINFO_TYPE (primary)),
5080 /* The vtable better be at the start. */
5081 my_friendly_assert (integer_zerop (DECL_FIELD_OFFSET (vfield)),
5083 my_friendly_assert (integer_zerop (BINFO_OFFSET (primary)),
5086 vfield = copy_decl (vfield);
5087 DECL_FIELD_CONTEXT (vfield) = t;
5088 TYPE_VFIELD (t) = vfield;
5091 my_friendly_assert (!vfield || DECL_FIELD_CONTEXT (vfield) == t, 20010726);
5093 virtuals = modify_all_vtables (t, nreverse (virtuals));
5095 /* If we created a new vtbl pointer for this class, add it to the
5097 if (TYPE_VFIELD (t) && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5098 CLASSTYPE_VFIELDS (t)
5099 = chainon (CLASSTYPE_VFIELDS (t), build_tree_list (NULL_TREE, t));
5101 /* If necessary, create the primary vtable for this class. */
5102 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
5104 /* We must enter these virtuals into the table. */
5105 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5106 build_primary_vtable (NULL_TREE, t);
5107 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
5108 /* Here we know enough to change the type of our virtual
5109 function table, but we will wait until later this function. */
5110 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
5113 if (TYPE_CONTAINS_VPTR_P (t))
5118 if (TYPE_BINFO_VTABLE (t))
5119 my_friendly_assert (DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t)),
5121 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5122 my_friendly_assert (TYPE_BINFO_VIRTUALS (t) == NULL_TREE,
5125 /* Add entries for virtual functions introduced by this class. */
5126 TYPE_BINFO_VIRTUALS (t) = chainon (TYPE_BINFO_VIRTUALS (t), virtuals);
5128 /* Set DECL_VINDEX for all functions declared in this class. */
5129 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
5131 fn = TREE_CHAIN (fn),
5132 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5133 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
5135 tree fndecl = BV_FN (fn);
5137 if (DECL_THUNK_P (fndecl))
5138 /* A thunk. We should never be calling this entry directly
5139 from this vtable -- we'd use the entry for the non
5140 thunk base function. */
5141 DECL_VINDEX (fndecl) = NULL_TREE;
5142 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
5143 DECL_VINDEX (fndecl) = build_shared_int_cst (vindex);
5147 finish_struct_bits (t);
5149 /* Complete the rtl for any static member objects of the type we're
5151 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
5152 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
5153 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
5154 DECL_MODE (x) = TYPE_MODE (t);
5156 /* Done with FIELDS...now decide whether to sort these for
5157 faster lookups later.
5159 We use a small number because most searches fail (succeeding
5160 ultimately as the search bores through the inheritance
5161 hierarchy), and we want this failure to occur quickly. */
5163 n_fields = count_fields (TYPE_FIELDS (t));
5166 struct sorted_fields_type *field_vec = ggc_alloc (sizeof (struct sorted_fields_type)
5167 + n_fields * sizeof (tree));
5168 field_vec->len = n_fields;
5169 add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0);
5170 qsort (field_vec->elts, n_fields, sizeof (tree),
5172 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
5173 retrofit_lang_decl (TYPE_MAIN_DECL (t));
5174 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5177 if (TYPE_HAS_CONSTRUCTOR (t))
5179 tree vfields = CLASSTYPE_VFIELDS (t);
5181 for (vfields = CLASSTYPE_VFIELDS (t);
5182 vfields; vfields = TREE_CHAIN (vfields))
5183 /* Mark the fact that constructor for T could affect anybody
5184 inheriting from T who wants to initialize vtables for
5186 if (VF_BINFO_VALUE (vfields))
5187 TREE_ADDRESSABLE (vfields) = 1;
5190 /* Make the rtl for any new vtables we have created, and unmark
5191 the base types we marked. */
5194 /* Build the VTT for T. */
5197 if (warn_nonvdtor && TYPE_POLYMORPHIC_P (t) && TYPE_HAS_DESTRUCTOR (t)
5198 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 1)) == NULL_TREE)
5199 warning ("`%#T' has virtual functions but non-virtual destructor", t);
5203 if (warn_overloaded_virtual)
5206 maybe_suppress_debug_info (t);
5208 dump_class_hierarchy (t);
5210 /* Finish debugging output for this type. */
5211 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5214 /* When T was built up, the member declarations were added in reverse
5215 order. Rearrange them to declaration order. */
5218 unreverse_member_declarations (tree t)
5224 /* The following lists are all in reverse order. Put them in
5225 declaration order now. */
5226 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5227 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
5229 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5230 reverse order, so we can't just use nreverse. */
5232 for (x = TYPE_FIELDS (t);
5233 x && TREE_CODE (x) != TYPE_DECL;
5236 next = TREE_CHAIN (x);
5237 TREE_CHAIN (x) = prev;
5242 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5244 TYPE_FIELDS (t) = prev;
5249 finish_struct (tree t, tree attributes)
5251 location_t saved_loc = input_location;
5253 /* Now that we've got all the field declarations, reverse everything
5255 unreverse_member_declarations (t);
5257 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
5259 /* Nadger the current location so that diagnostics point to the start of
5260 the struct, not the end. */
5261 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
5263 if (processing_template_decl)
5265 finish_struct_methods (t);
5266 TYPE_SIZE (t) = bitsize_zero_node;
5269 finish_struct_1 (t);
5271 input_location = saved_loc;
5273 TYPE_BEING_DEFINED (t) = 0;
5275 if (current_class_type)
5278 error ("trying to finish struct, but kicked out due to previous parse errors");
5280 if (processing_template_decl && at_function_scope_p ())
5281 add_stmt (build_min (TAG_DEFN, t));
5286 /* Return the dynamic type of INSTANCE, if known.
5287 Used to determine whether the virtual function table is needed
5290 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5291 of our knowledge of its type. *NONNULL should be initialized
5292 before this function is called. */
5295 fixed_type_or_null (tree instance, int* nonnull, int* cdtorp)
5297 switch (TREE_CODE (instance))
5300 if (POINTER_TYPE_P (TREE_TYPE (instance)))
5303 return fixed_type_or_null (TREE_OPERAND (instance, 0),
5307 /* This is a call to a constructor, hence it's never zero. */
5308 if (TREE_HAS_CONSTRUCTOR (instance))
5312 return TREE_TYPE (instance);
5317 /* This is a call to a constructor, hence it's never zero. */
5318 if (TREE_HAS_CONSTRUCTOR (instance))
5322 return TREE_TYPE (instance);
5324 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5331 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5332 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5333 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5334 /* Propagate nonnull. */
5335 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5340 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5345 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp);
5348 return fixed_type_or_null (TREE_OPERAND (instance, 1), nonnull, cdtorp);
5352 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5353 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5357 return TREE_TYPE (TREE_TYPE (instance));
5359 /* fall through... */
5363 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5367 return TREE_TYPE (instance);
5369 else if (instance == current_class_ptr)
5374 /* if we're in a ctor or dtor, we know our type. */
5375 if (DECL_LANG_SPECIFIC (current_function_decl)
5376 && (DECL_CONSTRUCTOR_P (current_function_decl)
5377 || DECL_DESTRUCTOR_P (current_function_decl)))
5381 return TREE_TYPE (TREE_TYPE (instance));
5384 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5386 /* Reference variables should be references to objects. */
5390 /* DECL_VAR_MARKED_P is used to prevent recursion; a
5391 variable's initializer may refer to the variable
5393 if (TREE_CODE (instance) == VAR_DECL
5394 && DECL_INITIAL (instance)
5395 && !DECL_VAR_MARKED_P (instance))
5398 DECL_VAR_MARKED_P (instance) = 1;
5399 type = fixed_type_or_null (DECL_INITIAL (instance),
5401 DECL_VAR_MARKED_P (instance) = 0;
5412 /* Return nonzero if the dynamic type of INSTANCE is known, and
5413 equivalent to the static type. We also handle the case where
5414 INSTANCE is really a pointer. Return negative if this is a
5415 ctor/dtor. There the dynamic type is known, but this might not be
5416 the most derived base of the original object, and hence virtual
5417 bases may not be layed out according to this type.
5419 Used to determine whether the virtual function table is needed
5422 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5423 of our knowledge of its type. *NONNULL should be initialized
5424 before this function is called. */
5427 resolves_to_fixed_type_p (tree instance, int* nonnull)
5429 tree t = TREE_TYPE (instance);
5432 tree fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
5433 if (fixed == NULL_TREE)
5435 if (POINTER_TYPE_P (t))
5437 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
5439 return cdtorp ? -1 : 1;
5444 init_class_processing (void)
5446 current_class_depth = 0;
5447 current_class_stack_size = 10;
5449 = xmalloc (current_class_stack_size * sizeof (struct class_stack_node));
5450 VARRAY_TREE_INIT (local_classes, 8, "local_classes");
5452 ridpointers[(int) RID_PUBLIC] = access_public_node;
5453 ridpointers[(int) RID_PRIVATE] = access_private_node;
5454 ridpointers[(int) RID_PROTECTED] = access_protected_node;
5457 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5458 appropriate for TYPE.
5460 So that we may avoid calls to lookup_name, we cache the _TYPE
5461 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5463 For multiple inheritance, we perform a two-pass depth-first search
5464 of the type lattice. The first pass performs a pre-order search,
5465 marking types after the type has had its fields installed in
5466 the appropriate IDENTIFIER_CLASS_VALUE slot. The second pass merely
5467 unmarks the marked types. If a field or member function name
5468 appears in an ambiguous way, the IDENTIFIER_CLASS_VALUE of
5469 that name becomes `error_mark_node'. */
5472 pushclass (tree type)
5474 type = TYPE_MAIN_VARIANT (type);
5476 /* Make sure there is enough room for the new entry on the stack. */
5477 if (current_class_depth + 1 >= current_class_stack_size)
5479 current_class_stack_size *= 2;
5481 = xrealloc (current_class_stack,
5482 current_class_stack_size
5483 * sizeof (struct class_stack_node));
5486 /* Insert a new entry on the class stack. */
5487 current_class_stack[current_class_depth].name = current_class_name;
5488 current_class_stack[current_class_depth].type = current_class_type;
5489 current_class_stack[current_class_depth].access = current_access_specifier;
5490 current_class_stack[current_class_depth].names_used = 0;
5491 current_class_depth++;
5493 /* Now set up the new type. */
5494 current_class_name = TYPE_NAME (type);
5495 if (TREE_CODE (current_class_name) == TYPE_DECL)
5496 current_class_name = DECL_NAME (current_class_name);
5497 current_class_type = type;
5499 /* By default, things in classes are private, while things in
5500 structures or unions are public. */
5501 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5502 ? access_private_node
5503 : access_public_node);
5505 if (previous_class_type != NULL_TREE
5506 && (type != previous_class_type
5507 || !COMPLETE_TYPE_P (previous_class_type))
5508 && current_class_depth == 1)
5510 /* Forcibly remove any old class remnants. */
5511 invalidate_class_lookup_cache ();
5514 /* If we're about to enter a nested class, clear
5515 IDENTIFIER_CLASS_VALUE for the enclosing classes. */
5516 if (current_class_depth > 1)
5517 clear_identifier_class_values ();
5521 if (type != previous_class_type || current_class_depth > 1)
5523 push_class_decls (type);
5524 if (CLASSTYPE_TEMPLATE_INFO (type) && !CLASSTYPE_USE_TEMPLATE (type))
5526 /* If we are entering the scope of a template declaration (not a
5527 specialization), we need to push all the using decls with
5528 dependent scope too. */
5531 for (fields = TYPE_FIELDS (type);
5532 fields; fields = TREE_CHAIN (fields))
5533 if (TREE_CODE (fields) == USING_DECL && !TREE_TYPE (fields))
5534 pushdecl_class_level (fields);
5541 /* We are re-entering the same class we just left, so we don't
5542 have to search the whole inheritance matrix to find all the
5543 decls to bind again. Instead, we install the cached
5544 class_shadowed list, and walk through it binding names and
5545 setting up IDENTIFIER_TYPE_VALUEs. */
5546 set_class_shadows (previous_class_values);
5547 for (item = previous_class_values; item; item = TREE_CHAIN (item))
5549 tree id = TREE_PURPOSE (item);
5550 tree decl = TREE_TYPE (item);
5552 push_class_binding (id, decl);
5553 if (TREE_CODE (decl) == TYPE_DECL)
5554 set_identifier_type_value (id, decl);
5556 unuse_fields (type);
5559 cxx_remember_type_decls (CLASSTYPE_NESTED_UTDS (type));
5562 /* When we exit a toplevel class scope, we save the
5563 IDENTIFIER_CLASS_VALUEs so that we can restore them quickly if we
5564 reenter the class. Here, we've entered some other class, so we
5565 must invalidate our cache. */
5568 invalidate_class_lookup_cache (void)
5572 /* The IDENTIFIER_CLASS_VALUEs are no longer valid. */
5573 for (t = previous_class_values; t; t = TREE_CHAIN (t))
5574 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
5576 previous_class_values = NULL_TREE;
5577 previous_class_type = NULL_TREE;
5580 /* Get out of the current class scope. If we were in a class scope
5581 previously, that is the one popped to. */
5589 current_class_depth--;
5590 current_class_name = current_class_stack[current_class_depth].name;
5591 current_class_type = current_class_stack[current_class_depth].type;
5592 current_access_specifier = current_class_stack[current_class_depth].access;
5593 if (current_class_stack[current_class_depth].names_used)
5594 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5597 /* Returns 1 if current_class_type is either T or a nested type of T.
5598 We start looking from 1 because entry 0 is from global scope, and has
5602 currently_open_class (tree t)
5605 if (current_class_type && same_type_p (t, current_class_type))
5607 for (i = 1; i < current_class_depth; ++i)
5608 if (current_class_stack[i].type
5609 && same_type_p (current_class_stack [i].type, t))
5614 /* If either current_class_type or one of its enclosing classes are derived
5615 from T, return the appropriate type. Used to determine how we found
5616 something via unqualified lookup. */
5619 currently_open_derived_class (tree t)
5623 /* The bases of a dependent type are unknown. */
5624 if (dependent_type_p (t))
5627 if (!current_class_type)
5630 if (DERIVED_FROM_P (t, current_class_type))
5631 return current_class_type;
5633 for (i = current_class_depth - 1; i > 0; --i)
5634 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5635 return current_class_stack[i].type;
5640 /* When entering a class scope, all enclosing class scopes' names with
5641 static meaning (static variables, static functions, types and
5642 enumerators) have to be visible. This recursive function calls
5643 pushclass for all enclosing class contexts until global or a local
5644 scope is reached. TYPE is the enclosed class. */
5647 push_nested_class (tree type)
5651 /* A namespace might be passed in error cases, like A::B:C. */
5652 if (type == NULL_TREE
5653 || type == error_mark_node
5654 || TREE_CODE (type) == NAMESPACE_DECL
5655 || ! IS_AGGR_TYPE (type)
5656 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5657 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
5660 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
5662 if (context && CLASS_TYPE_P (context))
5663 push_nested_class (context);
5667 /* Undoes a push_nested_class call. */
5670 pop_nested_class (void)
5672 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5675 if (context && CLASS_TYPE_P (context))
5676 pop_nested_class ();
5679 /* Returns the number of extern "LANG" blocks we are nested within. */
5682 current_lang_depth (void)
5684 return VARRAY_ACTIVE_SIZE (current_lang_base);
5687 /* Set global variables CURRENT_LANG_NAME to appropriate value
5688 so that behavior of name-mangling machinery is correct. */
5691 push_lang_context (tree name)
5693 VARRAY_PUSH_TREE (current_lang_base, current_lang_name);
5695 if (name == lang_name_cplusplus)
5697 current_lang_name = name;
5699 else if (name == lang_name_java)
5701 current_lang_name = name;
5702 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5703 (See record_builtin_java_type in decl.c.) However, that causes
5704 incorrect debug entries if these types are actually used.
5705 So we re-enable debug output after extern "Java". */
5706 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5707 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5708 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5709 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5710 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5711 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5712 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5713 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5715 else if (name == lang_name_c)
5717 current_lang_name = name;
5720 error ("language string `\"%s\"' not recognized", IDENTIFIER_POINTER (name));
5723 /* Get out of the current language scope. */
5726 pop_lang_context (void)
5728 current_lang_name = VARRAY_TOP_TREE (current_lang_base);
5729 VARRAY_POP (current_lang_base);
5732 /* Type instantiation routines. */
5734 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5735 matches the TARGET_TYPE. If there is no satisfactory match, return
5736 error_mark_node, and issue a error & warning messages under control
5737 of FLAGS. Permit pointers to member function if FLAGS permits. If
5738 TEMPLATE_ONLY, the name of the overloaded function was a
5739 template-id, and EXPLICIT_TARGS are the explicitly provided
5740 template arguments. */
5743 resolve_address_of_overloaded_function (tree target_type,
5745 tsubst_flags_t flags,
5747 tree explicit_targs)
5749 /* Here's what the standard says:
5753 If the name is a function template, template argument deduction
5754 is done, and if the argument deduction succeeds, the deduced
5755 arguments are used to generate a single template function, which
5756 is added to the set of overloaded functions considered.
5758 Non-member functions and static member functions match targets of
5759 type "pointer-to-function" or "reference-to-function." Nonstatic
5760 member functions match targets of type "pointer-to-member
5761 function;" the function type of the pointer to member is used to
5762 select the member function from the set of overloaded member
5763 functions. If a nonstatic member function is selected, the
5764 reference to the overloaded function name is required to have the
5765 form of a pointer to member as described in 5.3.1.
5767 If more than one function is selected, any template functions in
5768 the set are eliminated if the set also contains a non-template
5769 function, and any given template function is eliminated if the
5770 set contains a second template function that is more specialized
5771 than the first according to the partial ordering rules 14.5.5.2.
5772 After such eliminations, if any, there shall remain exactly one
5773 selected function. */
5776 int is_reference = 0;
5777 /* We store the matches in a TREE_LIST rooted here. The functions
5778 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5779 interoperability with most_specialized_instantiation. */
5780 tree matches = NULL_TREE;
5783 /* By the time we get here, we should be seeing only real
5784 pointer-to-member types, not the internal POINTER_TYPE to
5785 METHOD_TYPE representation. */
5786 my_friendly_assert (!(TREE_CODE (target_type) == POINTER_TYPE
5787 && (TREE_CODE (TREE_TYPE (target_type))
5788 == METHOD_TYPE)), 0);
5790 my_friendly_assert (is_overloaded_fn (overload), 20030910);
5792 /* Check that the TARGET_TYPE is reasonable. */
5793 if (TYPE_PTRFN_P (target_type))
5795 else if (TYPE_PTRMEMFUNC_P (target_type))
5796 /* This is OK, too. */
5798 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5800 /* This is OK, too. This comes from a conversion to reference
5802 target_type = build_reference_type (target_type);
5807 if (flags & tf_error)
5809 cannot resolve overloaded function `%D' based on conversion to type `%T'",
5810 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5811 return error_mark_node;
5814 /* If we can find a non-template function that matches, we can just
5815 use it. There's no point in generating template instantiations
5816 if we're just going to throw them out anyhow. But, of course, we
5817 can only do this when we don't *need* a template function. */
5822 for (fns = overload; fns; fns = OVL_NEXT (fns))
5824 tree fn = OVL_CURRENT (fns);
5827 if (TREE_CODE (fn) == TEMPLATE_DECL)
5828 /* We're not looking for templates just yet. */
5831 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5833 /* We're looking for a non-static member, and this isn't
5834 one, or vice versa. */
5837 /* Ignore anticipated decls of undeclared builtins. */
5838 if (DECL_ANTICIPATED (fn))
5841 /* See if there's a match. */
5842 fntype = TREE_TYPE (fn);
5844 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5845 else if (!is_reference)
5846 fntype = build_pointer_type (fntype);
5848 if (can_convert_arg (target_type, fntype, fn))
5849 matches = tree_cons (fn, NULL_TREE, matches);
5853 /* Now, if we've already got a match (or matches), there's no need
5854 to proceed to the template functions. But, if we don't have a
5855 match we need to look at them, too. */
5858 tree target_fn_type;
5859 tree target_arg_types;
5860 tree target_ret_type;
5865 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5867 target_fn_type = TREE_TYPE (target_type);
5868 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5869 target_ret_type = TREE_TYPE (target_fn_type);
5871 /* Never do unification on the 'this' parameter. */
5872 if (TREE_CODE (target_fn_type) == METHOD_TYPE)
5873 target_arg_types = TREE_CHAIN (target_arg_types);
5875 for (fns = overload; fns; fns = OVL_NEXT (fns))
5877 tree fn = OVL_CURRENT (fns);
5879 tree instantiation_type;
5882 if (TREE_CODE (fn) != TEMPLATE_DECL)
5883 /* We're only looking for templates. */
5886 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5888 /* We're not looking for a non-static member, and this is
5889 one, or vice versa. */
5892 /* Try to do argument deduction. */
5893 targs = make_tree_vec (DECL_NTPARMS (fn));
5894 if (fn_type_unification (fn, explicit_targs, targs,
5895 target_arg_types, target_ret_type,
5896 DEDUCE_EXACT, -1) != 0)
5897 /* Argument deduction failed. */
5900 /* Instantiate the template. */
5901 instantiation = instantiate_template (fn, targs, flags);
5902 if (instantiation == error_mark_node)
5903 /* Instantiation failed. */
5906 /* See if there's a match. */
5907 instantiation_type = TREE_TYPE (instantiation);
5909 instantiation_type =
5910 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5911 else if (!is_reference)
5912 instantiation_type = build_pointer_type (instantiation_type);
5913 if (can_convert_arg (target_type, instantiation_type, instantiation))
5914 matches = tree_cons (instantiation, fn, matches);
5917 /* Now, remove all but the most specialized of the matches. */
5920 tree match = most_specialized_instantiation (matches);
5922 if (match != error_mark_node)
5923 matches = tree_cons (match, NULL_TREE, NULL_TREE);
5927 /* Now we should have exactly one function in MATCHES. */
5928 if (matches == NULL_TREE)
5930 /* There were *no* matches. */
5931 if (flags & tf_error)
5933 error ("no matches converting function `%D' to type `%#T'",
5934 DECL_NAME (OVL_FUNCTION (overload)),
5937 /* print_candidates expects a chain with the functions in
5938 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5939 so why be clever?). */
5940 for (; overload; overload = OVL_NEXT (overload))
5941 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5944 print_candidates (matches);
5946 return error_mark_node;
5948 else if (TREE_CHAIN (matches))
5950 /* There were too many matches. */
5952 if (flags & tf_error)
5956 error ("converting overloaded function `%D' to type `%#T' is ambiguous",
5957 DECL_NAME (OVL_FUNCTION (overload)),
5960 /* Since print_candidates expects the functions in the
5961 TREE_VALUE slot, we flip them here. */
5962 for (match = matches; match; match = TREE_CHAIN (match))
5963 TREE_VALUE (match) = TREE_PURPOSE (match);
5965 print_candidates (matches);
5968 return error_mark_node;
5971 /* Good, exactly one match. Now, convert it to the correct type. */
5972 fn = TREE_PURPOSE (matches);
5974 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5975 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
5977 static int explained;
5979 if (!(flags & tf_error))
5980 return error_mark_node;
5982 pedwarn ("assuming pointer to member `%D'", fn);
5985 pedwarn ("(a pointer to member can only be formed with `&%E')", fn);
5990 /* If we're doing overload resolution purely for the purpose of
5991 determining conversion sequences, we should not consider the
5992 function used. If this conversion sequence is selected, the
5993 function will be marked as used at this point. */
5994 if (!(flags & tf_conv))
5997 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5998 return build_unary_op (ADDR_EXPR, fn, 0);
6001 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
6002 will mark the function as addressed, but here we must do it
6004 cxx_mark_addressable (fn);
6010 /* This function will instantiate the type of the expression given in
6011 RHS to match the type of LHSTYPE. If errors exist, then return
6012 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6013 we complain on errors. If we are not complaining, never modify rhs,
6014 as overload resolution wants to try many possible instantiations, in
6015 the hope that at least one will work.
6017 For non-recursive calls, LHSTYPE should be a function, pointer to
6018 function, or a pointer to member function. */
6021 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
6023 tsubst_flags_t flags_in = flags;
6025 flags &= ~tf_ptrmem_ok;
6027 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
6029 if (flags & tf_error)
6030 error ("not enough type information");
6031 return error_mark_node;
6034 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
6036 if (same_type_p (lhstype, TREE_TYPE (rhs)))
6038 if (flag_ms_extensions
6039 && TYPE_PTRMEMFUNC_P (lhstype)
6040 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
6041 /* Microsoft allows `A::f' to be resolved to a
6042 pointer-to-member. */
6046 if (flags & tf_error)
6047 error ("argument of type `%T' does not match `%T'",
6048 TREE_TYPE (rhs), lhstype);
6049 return error_mark_node;
6053 if (TREE_CODE (rhs) == BASELINK)
6054 rhs = BASELINK_FUNCTIONS (rhs);
6056 /* We don't overwrite rhs if it is an overloaded function.
6057 Copying it would destroy the tree link. */
6058 if (TREE_CODE (rhs) != OVERLOAD)
6059 rhs = copy_node (rhs);
6061 /* This should really only be used when attempting to distinguish
6062 what sort of a pointer to function we have. For now, any
6063 arithmetic operation which is not supported on pointers
6064 is rejected as an error. */
6066 switch (TREE_CODE (rhs))
6074 return error_mark_node;
6081 new_rhs = instantiate_type (build_pointer_type (lhstype),
6082 TREE_OPERAND (rhs, 0), flags);
6083 if (new_rhs == error_mark_node)
6084 return error_mark_node;
6086 TREE_TYPE (rhs) = lhstype;
6087 TREE_OPERAND (rhs, 0) = new_rhs;
6092 rhs = copy_node (TREE_OPERAND (rhs, 0));
6093 TREE_TYPE (rhs) = unknown_type_node;
6094 return instantiate_type (lhstype, rhs, flags);
6098 tree addr = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6100 if (addr != error_mark_node
6101 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
6102 /* Do not lose object's side effects. */
6103 addr = build (COMPOUND_EXPR, TREE_TYPE (addr),
6104 TREE_OPERAND (rhs, 0), addr);
6109 rhs = TREE_OPERAND (rhs, 1);
6110 if (BASELINK_P (rhs))
6111 return instantiate_type (lhstype, BASELINK_FUNCTIONS (rhs), flags_in);
6113 /* This can happen if we are forming a pointer-to-member for a
6115 my_friendly_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR, 0);
6119 case TEMPLATE_ID_EXPR:
6121 tree fns = TREE_OPERAND (rhs, 0);
6122 tree args = TREE_OPERAND (rhs, 1);
6125 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
6126 /*template_only=*/true,
6133 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
6134 /*template_only=*/false,
6135 /*explicit_targs=*/NULL_TREE);
6138 /* Now we should have a baselink. */
6139 my_friendly_assert (BASELINK_P (rhs), 990412);
6141 return instantiate_type (lhstype, BASELINK_FUNCTIONS (rhs), flags);
6144 /* This is too hard for now. */
6146 return error_mark_node;
6151 TREE_OPERAND (rhs, 0)
6152 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6153 if (TREE_OPERAND (rhs, 0) == error_mark_node)
6154 return error_mark_node;
6155 TREE_OPERAND (rhs, 1)
6156 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6157 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6158 return error_mark_node;
6160 TREE_TYPE (rhs) = lhstype;
6164 case TRUNC_DIV_EXPR:
6165 case FLOOR_DIV_EXPR:
6167 case ROUND_DIV_EXPR:
6169 case TRUNC_MOD_EXPR:
6170 case FLOOR_MOD_EXPR:
6172 case ROUND_MOD_EXPR:
6173 case FIX_ROUND_EXPR:
6174 case FIX_FLOOR_EXPR:
6176 case FIX_TRUNC_EXPR:
6191 case PREINCREMENT_EXPR:
6192 case PREDECREMENT_EXPR:
6193 case POSTINCREMENT_EXPR:
6194 case POSTDECREMENT_EXPR:
6195 if (flags & tf_error)
6196 error ("invalid operation on uninstantiated type");
6197 return error_mark_node;
6199 case TRUTH_AND_EXPR:
6201 case TRUTH_XOR_EXPR:
6208 case TRUTH_ANDIF_EXPR:
6209 case TRUTH_ORIF_EXPR:
6210 case TRUTH_NOT_EXPR:
6211 if (flags & tf_error)
6212 error ("not enough type information");
6213 return error_mark_node;
6216 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
6218 if (flags & tf_error)
6219 error ("not enough type information");
6220 return error_mark_node;
6222 TREE_OPERAND (rhs, 1)
6223 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6224 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6225 return error_mark_node;
6226 TREE_OPERAND (rhs, 2)
6227 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), flags);
6228 if (TREE_OPERAND (rhs, 2) == error_mark_node)
6229 return error_mark_node;
6231 TREE_TYPE (rhs) = lhstype;
6235 TREE_OPERAND (rhs, 1)
6236 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6237 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6238 return error_mark_node;
6240 TREE_TYPE (rhs) = lhstype;
6245 if (PTRMEM_OK_P (rhs))
6246 flags |= tf_ptrmem_ok;
6248 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6250 case ENTRY_VALUE_EXPR:
6252 return error_mark_node;
6255 return error_mark_node;
6259 return error_mark_node;
6263 /* Return the name of the virtual function pointer field
6264 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6265 this may have to look back through base types to find the
6266 ultimate field name. (For single inheritance, these could
6267 all be the same name. Who knows for multiple inheritance). */
6270 get_vfield_name (tree type)
6272 tree binfo = TYPE_BINFO (type);
6275 while (BINFO_BASETYPES (binfo)
6276 && TYPE_CONTAINS_VPTR_P (BINFO_TYPE (BINFO_BASETYPE (binfo, 0)))
6277 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo, 0)))
6278 binfo = BINFO_BASETYPE (binfo, 0);
6280 type = BINFO_TYPE (binfo);
6281 buf = alloca (sizeof (VFIELD_NAME_FORMAT) + TYPE_NAME_LENGTH (type) + 2);
6282 sprintf (buf, VFIELD_NAME_FORMAT,
6283 IDENTIFIER_POINTER (constructor_name (type)));
6284 return get_identifier (buf);
6288 print_class_statistics (void)
6290 #ifdef GATHER_STATISTICS
6291 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6292 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6293 fprintf (stderr, "build_method_call = %d (inner = %d)\n",
6294 n_build_method_call, n_inner_fields_searched);
6297 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6298 n_vtables, n_vtable_searches);
6299 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6300 n_vtable_entries, n_vtable_elems);
6305 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6306 according to [class]:
6307 The class-name is also inserted
6308 into the scope of the class itself. For purposes of access checking,
6309 the inserted class name is treated as if it were a public member name. */
6312 build_self_reference (void)
6314 tree name = constructor_name (current_class_type);
6315 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6318 DECL_NONLOCAL (value) = 1;
6319 DECL_CONTEXT (value) = current_class_type;
6320 DECL_ARTIFICIAL (value) = 1;
6321 SET_DECL_SELF_REFERENCE_P (value);
6323 if (processing_template_decl)
6324 value = push_template_decl (value);
6326 saved_cas = current_access_specifier;
6327 current_access_specifier = access_public_node;
6328 finish_member_declaration (value);
6329 current_access_specifier = saved_cas;
6332 /* Returns 1 if TYPE contains only padding bytes. */
6335 is_empty_class (tree type)
6337 if (type == error_mark_node)
6340 if (! IS_AGGR_TYPE (type))
6343 /* In G++ 3.2, whether or not a class was empty was determined by
6344 looking at its size. */
6345 if (abi_version_at_least (2))
6346 return CLASSTYPE_EMPTY_P (type);
6348 return integer_zerop (CLASSTYPE_SIZE (type));
6351 /* Returns true if TYPE contains an empty class. */
6354 contains_empty_class_p (tree type)
6356 if (is_empty_class (type))
6358 if (CLASS_TYPE_P (type))
6363 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); ++i)
6364 if (contains_empty_class_p (TYPE_BINFO_BASETYPE (type, i)))
6366 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6367 if (TREE_CODE (field) == FIELD_DECL
6368 && !DECL_ARTIFICIAL (field)
6369 && is_empty_class (TREE_TYPE (field)))
6372 else if (TREE_CODE (type) == ARRAY_TYPE)
6373 return contains_empty_class_p (TREE_TYPE (type));
6377 /* Find the enclosing class of the given NODE. NODE can be a *_DECL or
6378 a *_TYPE node. NODE can also be a local class. */
6381 get_enclosing_class (tree type)
6385 while (node && TREE_CODE (node) != NAMESPACE_DECL)
6387 switch (TREE_CODE_CLASS (TREE_CODE (node)))
6390 node = DECL_CONTEXT (node);
6396 node = TYPE_CONTEXT (node);
6406 /* Note that NAME was looked up while the current class was being
6407 defined and that the result of that lookup was DECL. */
6410 maybe_note_name_used_in_class (tree name, tree decl)
6412 splay_tree names_used;
6414 /* If we're not defining a class, there's nothing to do. */
6415 if (innermost_scope_kind() != sk_class)
6418 /* If there's already a binding for this NAME, then we don't have
6419 anything to worry about. */
6420 if (IDENTIFIER_CLASS_VALUE (name))
6423 if (!current_class_stack[current_class_depth - 1].names_used)
6424 current_class_stack[current_class_depth - 1].names_used
6425 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6426 names_used = current_class_stack[current_class_depth - 1].names_used;
6428 splay_tree_insert (names_used,
6429 (splay_tree_key) name,
6430 (splay_tree_value) decl);
6433 /* Note that NAME was declared (as DECL) in the current class. Check
6434 to see that the declaration is valid. */
6437 note_name_declared_in_class (tree name, tree decl)
6439 splay_tree names_used;
6442 /* Look to see if we ever used this name. */
6444 = current_class_stack[current_class_depth - 1].names_used;
6448 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6451 /* [basic.scope.class]
6453 A name N used in a class S shall refer to the same declaration
6454 in its context and when re-evaluated in the completed scope of
6456 error ("declaration of `%#D'", decl);
6457 cp_error_at ("changes meaning of `%D' from `%+#D'",
6458 DECL_NAME (OVL_CURRENT (decl)),
6463 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6464 Secondary vtables are merged with primary vtables; this function
6465 will return the VAR_DECL for the primary vtable. */
6468 get_vtbl_decl_for_binfo (tree binfo)
6472 decl = BINFO_VTABLE (binfo);
6473 if (decl && TREE_CODE (decl) == PLUS_EXPR)
6475 my_friendly_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR,
6477 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6480 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 20000403);
6485 /* Returns the binfo for the primary base of BINFO. If the resulting
6486 BINFO is a virtual base, and it is inherited elsewhere in the
6487 hierarchy, then the returned binfo might not be the primary base of
6488 BINFO in the complete object. Check BINFO_PRIMARY_P or
6489 BINFO_LOST_PRIMARY_P to be sure. */
6492 get_primary_binfo (tree binfo)
6497 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6501 result = copied_binfo (primary_base, binfo);
6505 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6508 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
6511 fprintf (stream, "%*s", indent, "");
6515 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6516 INDENT should be zero when called from the top level; it is
6517 incremented recursively. IGO indicates the next expected BINFO in
6518 inheritance graph ordering. */
6521 dump_class_hierarchy_r (FILE *stream,
6530 indented = maybe_indent_hierarchy (stream, indent, 0);
6531 fprintf (stream, "%s (0x%lx) ",
6532 type_as_string (binfo, TFF_PLAIN_IDENTIFIER),
6533 (unsigned long) binfo);
6536 fprintf (stream, "alternative-path\n");
6539 igo = TREE_CHAIN (binfo);
6541 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
6542 tree_low_cst (BINFO_OFFSET (binfo), 0));
6543 if (is_empty_class (BINFO_TYPE (binfo)))
6544 fprintf (stream, " empty");
6545 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
6546 fprintf (stream, " nearly-empty");
6547 if (TREE_VIA_VIRTUAL (binfo))
6548 fprintf (stream, " virtual");
6549 fprintf (stream, "\n");
6552 if (BINFO_PRIMARY_BASE_OF (binfo))
6554 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6555 fprintf (stream, " primary-for %s (0x%lx)",
6556 type_as_string (BINFO_PRIMARY_BASE_OF (binfo),
6557 TFF_PLAIN_IDENTIFIER),
6558 (unsigned long)BINFO_PRIMARY_BASE_OF (binfo));
6560 if (BINFO_LOST_PRIMARY_P (binfo))
6562 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6563 fprintf (stream, " lost-primary");
6566 fprintf (stream, "\n");
6568 if (!(flags & TDF_SLIM))
6572 if (BINFO_SUBVTT_INDEX (binfo))
6574 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6575 fprintf (stream, " subvttidx=%s",
6576 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
6577 TFF_PLAIN_IDENTIFIER));
6579 if (BINFO_VPTR_INDEX (binfo))
6581 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6582 fprintf (stream, " vptridx=%s",
6583 expr_as_string (BINFO_VPTR_INDEX (binfo),
6584 TFF_PLAIN_IDENTIFIER));
6586 if (BINFO_VPTR_FIELD (binfo))
6588 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6589 fprintf (stream, " vbaseoffset=%s",
6590 expr_as_string (BINFO_VPTR_FIELD (binfo),
6591 TFF_PLAIN_IDENTIFIER));
6593 if (BINFO_VTABLE (binfo))
6595 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
6596 fprintf (stream, " vptr=%s",
6597 expr_as_string (BINFO_VTABLE (binfo),
6598 TFF_PLAIN_IDENTIFIER));
6602 fprintf (stream, "\n");
6605 base_binfos = BINFO_BASETYPES (binfo);
6610 n = TREE_VEC_LENGTH (base_binfos);
6611 for (ix = 0; ix != n; ix++)
6613 tree base_binfo = TREE_VEC_ELT (base_binfos, ix);
6615 igo = dump_class_hierarchy_r (stream, flags, base_binfo,
6623 /* Dump the BINFO hierarchy for T. */
6626 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
6628 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6629 fprintf (stream, " size=%lu align=%lu\n",
6630 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
6631 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
6632 fprintf (stream, " base size=%lu base align=%lu\n",
6633 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
6635 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
6637 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
6638 fprintf (stream, "\n");
6641 /* Debug interface to hierarchy dumping. */
6644 debug_class (tree t)
6646 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
6650 dump_class_hierarchy (tree t)
6653 FILE *stream = dump_begin (TDI_class, &flags);
6657 dump_class_hierarchy_1 (stream, flags, t);
6658 dump_end (TDI_class, stream);
6663 dump_array (FILE * stream, tree decl)
6668 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
6670 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
6672 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
6673 fprintf (stream, " %s entries",
6674 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
6675 TFF_PLAIN_IDENTIFIER));
6676 fprintf (stream, "\n");
6678 for (ix = 0, inits = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
6679 inits; ix++, inits = TREE_CHAIN (inits))
6680 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
6681 expr_as_string (TREE_VALUE (inits), TFF_PLAIN_IDENTIFIER));
6685 dump_vtable (tree t, tree binfo, tree vtable)
6688 FILE *stream = dump_begin (TDI_class, &flags);
6693 if (!(flags & TDF_SLIM))
6695 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
6697 fprintf (stream, "%s for %s",
6698 ctor_vtbl_p ? "Construction vtable" : "Vtable",
6699 type_as_string (binfo, TFF_PLAIN_IDENTIFIER));
6702 if (!TREE_VIA_VIRTUAL (binfo))
6703 fprintf (stream, " (0x%lx instance)", (unsigned long)binfo);
6704 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
6706 fprintf (stream, "\n");
6707 dump_array (stream, vtable);
6708 fprintf (stream, "\n");
6711 dump_end (TDI_class, stream);
6715 dump_vtt (tree t, tree vtt)
6718 FILE *stream = dump_begin (TDI_class, &flags);
6723 if (!(flags & TDF_SLIM))
6725 fprintf (stream, "VTT for %s\n",
6726 type_as_string (t, TFF_PLAIN_IDENTIFIER));
6727 dump_array (stream, vtt);
6728 fprintf (stream, "\n");
6731 dump_end (TDI_class, stream);
6734 /* Dump a function or thunk and its thunkees. */
6737 dump_thunk (FILE *stream, int indent, tree thunk)
6739 static const char spaces[] = " ";
6740 tree name = DECL_NAME (thunk);
6743 fprintf (stream, "%.*s%p %s %s", indent, spaces,
6745 !DECL_THUNK_P (thunk) ? "function"
6746 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
6747 name ? IDENTIFIER_POINTER (name) : "<unset>");
6748 if (DECL_THUNK_P (thunk))
6750 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
6751 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
6753 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
6754 if (!virtual_adjust)
6756 else if (DECL_THIS_THUNK_P (thunk))
6757 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
6758 tree_low_cst (virtual_adjust, 0));
6760 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
6761 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
6762 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
6763 if (THUNK_ALIAS (thunk))
6764 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
6766 fprintf (stream, "\n");
6767 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
6768 dump_thunk (stream, indent + 2, thunks);
6771 /* Dump the thunks for FN. */
6774 debug_thunks (tree fn)
6776 dump_thunk (stderr, 0, fn);
6779 /* Virtual function table initialization. */
6781 /* Create all the necessary vtables for T and its base classes. */
6784 finish_vtbls (tree t)
6789 /* We lay out the primary and secondary vtables in one contiguous
6790 vtable. The primary vtable is first, followed by the non-virtual
6791 secondary vtables in inheritance graph order. */
6792 list = build_tree_list (TYPE_BINFO_VTABLE (t), NULL_TREE);
6793 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6794 TYPE_BINFO (t), t, list);
6796 /* Then come the virtual bases, also in inheritance graph order. */
6797 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6799 if (!TREE_VIA_VIRTUAL (vbase))
6801 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6804 if (TYPE_BINFO_VTABLE (t))
6805 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6808 /* Initialize the vtable for BINFO with the INITS. */
6811 initialize_vtable (tree binfo, tree inits)
6815 layout_vtable_decl (binfo, list_length (inits));
6816 decl = get_vtbl_decl_for_binfo (binfo);
6817 initialize_array (decl, inits);
6818 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
6821 /* Initialize DECL (a declaration for a namespace-scope array) with
6825 initialize_array (tree decl, tree inits)
6829 context = DECL_CONTEXT (decl);
6830 DECL_CONTEXT (decl) = NULL_TREE;
6831 DECL_INITIAL (decl) = build_constructor (NULL_TREE, inits);
6832 TREE_HAS_CONSTRUCTOR (DECL_INITIAL (decl)) = 1;
6833 cp_finish_decl (decl, DECL_INITIAL (decl), NULL_TREE, 0);
6834 DECL_CONTEXT (decl) = context;
6837 /* Build the VTT (virtual table table) for T.
6838 A class requires a VTT if it has virtual bases.
6841 1 - primary virtual pointer for complete object T
6842 2 - secondary VTTs for each direct non-virtual base of T which requires a
6844 3 - secondary virtual pointers for each direct or indirect base of T which
6845 has virtual bases or is reachable via a virtual path from T.
6846 4 - secondary VTTs for each direct or indirect virtual base of T.
6848 Secondary VTTs look like complete object VTTs without part 4. */
6858 /* Build up the initializers for the VTT. */
6860 index = size_zero_node;
6861 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
6863 /* If we didn't need a VTT, we're done. */
6867 /* Figure out the type of the VTT. */
6868 type = build_index_type (size_int (list_length (inits) - 1));
6869 type = build_cplus_array_type (const_ptr_type_node, type);
6871 /* Now, build the VTT object itself. */
6872 vtt = build_vtable (t, get_vtt_name (t), type);
6873 initialize_array (vtt, inits);
6874 /* Add the VTT to the vtables list. */
6875 TREE_CHAIN (vtt) = TREE_CHAIN (CLASSTYPE_VTABLES (t));
6876 TREE_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
6881 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6882 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6883 and CHAIN the vtable pointer for this binfo after construction is
6884 complete. VALUE can also be another BINFO, in which case we recurse. */
6887 binfo_ctor_vtable (tree binfo)
6893 vt = BINFO_VTABLE (binfo);
6894 if (TREE_CODE (vt) == TREE_LIST)
6895 vt = TREE_VALUE (vt);
6896 if (TREE_CODE (vt) == TREE_VEC)
6905 /* Recursively build the VTT-initializer for BINFO (which is in the
6906 hierarchy dominated by T). INITS points to the end of the initializer
6907 list to date. INDEX is the VTT index where the next element will be
6908 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6909 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6910 for virtual bases of T. When it is not so, we build the constructor
6911 vtables for the BINFO-in-T variant. */
6914 build_vtt_inits (tree binfo, tree t, tree* inits, tree* index)
6919 tree secondary_vptrs;
6920 int top_level_p = same_type_p (TREE_TYPE (binfo), t);
6922 /* We only need VTTs for subobjects with virtual bases. */
6923 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
6926 /* We need to use a construction vtable if this is not the primary
6930 build_ctor_vtbl_group (binfo, t);
6932 /* Record the offset in the VTT where this sub-VTT can be found. */
6933 BINFO_SUBVTT_INDEX (binfo) = *index;
6936 /* Add the address of the primary vtable for the complete object. */
6937 init = binfo_ctor_vtable (binfo);
6938 *inits = build_tree_list (NULL_TREE, init);
6939 inits = &TREE_CHAIN (*inits);
6942 my_friendly_assert (!BINFO_VPTR_INDEX (binfo), 20010129);
6943 BINFO_VPTR_INDEX (binfo) = *index;
6945 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6947 /* Recursively add the secondary VTTs for non-virtual bases. */
6948 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
6950 b = BINFO_BASETYPE (binfo, i);
6951 if (!TREE_VIA_VIRTUAL (b))
6952 inits = build_vtt_inits (BINFO_BASETYPE (binfo, i), t,
6956 /* Add secondary virtual pointers for all subobjects of BINFO with
6957 either virtual bases or reachable along a virtual path, except
6958 subobjects that are non-virtual primary bases. */
6959 secondary_vptrs = tree_cons (t, NULL_TREE, BINFO_TYPE (binfo));
6960 TREE_TYPE (secondary_vptrs) = *index;
6961 VTT_TOP_LEVEL_P (secondary_vptrs) = top_level_p;
6962 VTT_MARKED_BINFO_P (secondary_vptrs) = 0;
6964 dfs_walk_real (binfo,
6965 dfs_build_secondary_vptr_vtt_inits,
6967 dfs_ctor_vtable_bases_queue_p,
6969 VTT_MARKED_BINFO_P (secondary_vptrs) = 1;
6970 dfs_walk (binfo, dfs_unmark, dfs_ctor_vtable_bases_queue_p,
6973 *index = TREE_TYPE (secondary_vptrs);
6975 /* The secondary vptrs come back in reverse order. After we reverse
6976 them, and add the INITS, the last init will be the first element
6978 secondary_vptrs = TREE_VALUE (secondary_vptrs);
6979 if (secondary_vptrs)
6981 *inits = nreverse (secondary_vptrs);
6982 inits = &TREE_CHAIN (secondary_vptrs);
6983 my_friendly_assert (*inits == NULL_TREE, 20000517);
6986 /* Add the secondary VTTs for virtual bases. */
6988 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6990 if (!TREE_VIA_VIRTUAL (b))
6993 inits = build_vtt_inits (b, t, inits, index);
6998 tree data = tree_cons (t, binfo, NULL_TREE);
6999 VTT_TOP_LEVEL_P (data) = 0;
7000 VTT_MARKED_BINFO_P (data) = 0;
7002 dfs_walk (binfo, dfs_fixup_binfo_vtbls,
7003 dfs_ctor_vtable_bases_queue_p,
7010 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo
7011 for the base in most derived. DATA is a TREE_LIST who's
7012 TREE_CHAIN is the type of the base being
7013 constructed whilst this secondary vptr is live. The TREE_UNSIGNED
7014 flag of DATA indicates that this is a constructor vtable. The
7015 TREE_TOP_LEVEL flag indicates that this is the primary VTT. */
7018 dfs_build_secondary_vptr_vtt_inits (tree binfo, void* data)
7028 top_level_p = VTT_TOP_LEVEL_P (l);
7030 BINFO_MARKED (binfo) = 1;
7032 /* We don't care about bases that don't have vtables. */
7033 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
7036 /* We're only interested in proper subobjects of T. */
7037 if (same_type_p (BINFO_TYPE (binfo), t))
7040 /* We're not interested in non-virtual primary bases. */
7041 if (!TREE_VIA_VIRTUAL (binfo) && BINFO_PRIMARY_P (binfo))
7044 /* If BINFO has virtual bases or is reachable via a virtual path
7045 from T, it'll have a secondary vptr. */
7046 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo))
7047 && !binfo_via_virtual (binfo, t))
7050 /* Record the index where this secondary vptr can be found. */
7051 index = TREE_TYPE (l);
7054 my_friendly_assert (!BINFO_VPTR_INDEX (binfo), 20010129);
7055 BINFO_VPTR_INDEX (binfo) = index;
7057 TREE_TYPE (l) = size_binop (PLUS_EXPR, index,
7058 TYPE_SIZE_UNIT (ptr_type_node));
7060 /* Add the initializer for the secondary vptr itself. */
7061 if (top_level_p && TREE_VIA_VIRTUAL (binfo))
7063 /* It's a primary virtual base, and this is not the construction
7064 vtable. Find the base this is primary of in the inheritance graph,
7065 and use that base's vtable now. */
7066 while (BINFO_PRIMARY_BASE_OF (binfo))
7067 binfo = BINFO_PRIMARY_BASE_OF (binfo);
7069 init = binfo_ctor_vtable (binfo);
7070 TREE_VALUE (l) = tree_cons (NULL_TREE, init, TREE_VALUE (l));
7075 /* dfs_walk_real predicate for building vtables. DATA is a TREE_LIST,
7076 VTT_MARKED_BINFO_P indicates whether marked or unmarked bases
7077 should be walked. TREE_PURPOSE is the TREE_TYPE that dominates the
7081 dfs_ctor_vtable_bases_queue_p (tree derived, int ix,
7084 tree binfo = BINFO_BASETYPE (derived, ix);
7086 if (!BINFO_MARKED (binfo) == VTT_MARKED_BINFO_P ((tree) data))
7091 /* Called from build_vtt_inits via dfs_walk. After building constructor
7092 vtables and generating the sub-vtt from them, we need to restore the
7093 BINFO_VTABLES that were scribbled on. DATA is a TREE_LIST whose
7094 TREE_VALUE is the TREE_TYPE of the base whose sub vtt was generated. */
7097 dfs_fixup_binfo_vtbls (tree binfo, void* data)
7099 BINFO_MARKED (binfo) = 0;
7101 /* We don't care about bases that don't have vtables. */
7102 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
7105 /* If we scribbled the construction vtable vptr into BINFO, clear it
7107 if (BINFO_VTABLE (binfo)
7108 && TREE_CODE (BINFO_VTABLE (binfo)) == TREE_LIST
7109 && (TREE_PURPOSE (BINFO_VTABLE (binfo))
7110 == TREE_VALUE ((tree) data)))
7111 BINFO_VTABLE (binfo) = TREE_CHAIN (BINFO_VTABLE (binfo));
7116 /* Build the construction vtable group for BINFO which is in the
7117 hierarchy dominated by T. */
7120 build_ctor_vtbl_group (tree binfo, tree t)
7129 /* See if we've already created this construction vtable group. */
7130 id = mangle_ctor_vtbl_for_type (t, binfo);
7131 if (IDENTIFIER_GLOBAL_VALUE (id))
7134 my_friendly_assert (!same_type_p (BINFO_TYPE (binfo), t), 20010124);
7135 /* Build a version of VTBL (with the wrong type) for use in
7136 constructing the addresses of secondary vtables in the
7137 construction vtable group. */
7138 vtbl = build_vtable (t, id, ptr_type_node);
7139 list = build_tree_list (vtbl, NULL_TREE);
7140 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
7143 /* Add the vtables for each of our virtual bases using the vbase in T
7145 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7147 vbase = TREE_CHAIN (vbase))
7151 if (!TREE_VIA_VIRTUAL (vbase))
7153 b = copied_binfo (vbase, binfo);
7155 accumulate_vtbl_inits (b, vbase, binfo, t, list);
7157 inits = TREE_VALUE (list);
7159 /* Figure out the type of the construction vtable. */
7160 type = build_index_type (size_int (list_length (inits) - 1));
7161 type = build_cplus_array_type (vtable_entry_type, type);
7162 TREE_TYPE (vtbl) = type;
7164 /* Initialize the construction vtable. */
7165 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
7166 initialize_array (vtbl, inits);
7167 dump_vtable (t, binfo, vtbl);
7170 /* Add the vtbl initializers for BINFO (and its bases other than
7171 non-virtual primaries) to the list of INITS. BINFO is in the
7172 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7173 the constructor the vtbl inits should be accumulated for. (If this
7174 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7175 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7176 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7177 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7178 but are not necessarily the same in terms of layout. */
7181 accumulate_vtbl_inits (tree binfo,
7188 int ctor_vtbl_p = !same_type_p (BINFO_TYPE (rtti_binfo), t);
7190 my_friendly_assert (same_type_p (BINFO_TYPE (binfo),
7191 BINFO_TYPE (orig_binfo)),
7194 /* If it doesn't have a vptr, we don't do anything. */
7195 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
7198 /* If we're building a construction vtable, we're not interested in
7199 subobjects that don't require construction vtables. */
7201 && !TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo))
7202 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
7205 /* Build the initializers for the BINFO-in-T vtable. */
7207 = chainon (TREE_VALUE (inits),
7208 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
7209 rtti_binfo, t, inits));
7211 /* Walk the BINFO and its bases. We walk in preorder so that as we
7212 initialize each vtable we can figure out at what offset the
7213 secondary vtable lies from the primary vtable. We can't use
7214 dfs_walk here because we need to iterate through bases of BINFO
7215 and RTTI_BINFO simultaneously. */
7216 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
7218 tree base_binfo = BINFO_BASETYPE (binfo, i);
7220 /* Skip virtual bases. */
7221 if (TREE_VIA_VIRTUAL (base_binfo))
7223 accumulate_vtbl_inits (base_binfo,
7224 BINFO_BASETYPE (orig_binfo, i),
7230 /* Called from accumulate_vtbl_inits. Returns the initializers for
7231 the BINFO vtable. */
7234 dfs_accumulate_vtbl_inits (tree binfo,
7240 tree inits = NULL_TREE;
7241 tree vtbl = NULL_TREE;
7242 int ctor_vtbl_p = !same_type_p (BINFO_TYPE (rtti_binfo), t);
7245 && TREE_VIA_VIRTUAL (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
7247 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7248 primary virtual base. If it is not the same primary in
7249 the hierarchy of T, we'll need to generate a ctor vtable
7250 for it, to place at its location in T. If it is the same
7251 primary, we still need a VTT entry for the vtable, but it
7252 should point to the ctor vtable for the base it is a
7253 primary for within the sub-hierarchy of RTTI_BINFO.
7255 There are three possible cases:
7257 1) We are in the same place.
7258 2) We are a primary base within a lost primary virtual base of
7260 3) We are primary to something not a base of RTTI_BINFO. */
7262 tree b = BINFO_PRIMARY_BASE_OF (binfo);
7263 tree last = NULL_TREE;
7265 /* First, look through the bases we are primary to for RTTI_BINFO
7266 or a virtual base. */
7267 for (; b; b = BINFO_PRIMARY_BASE_OF (b))
7270 if (TREE_VIA_VIRTUAL (b) || b == rtti_binfo)
7273 /* If we run out of primary links, keep looking down our
7274 inheritance chain; we might be an indirect primary. */
7276 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
7277 if (TREE_VIA_VIRTUAL (b) || b == rtti_binfo)
7280 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7281 base B and it is a base of RTTI_BINFO, this is case 2. In
7282 either case, we share our vtable with LAST, i.e. the
7283 derived-most base within B of which we are a primary. */
7285 || (b && purpose_member (BINFO_TYPE (b),
7286 CLASSTYPE_VBASECLASSES (BINFO_TYPE (rtti_binfo)))))
7287 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7288 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7289 binfo_ctor_vtable after everything's been set up. */
7292 /* Otherwise, this is case 3 and we get our own. */
7294 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
7302 /* Compute the initializer for this vtable. */
7303 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7306 /* Figure out the position to which the VPTR should point. */
7307 vtbl = TREE_PURPOSE (l);
7308 vtbl = build1 (ADDR_EXPR,
7311 TREE_CONSTANT (vtbl) = 1;
7312 index = size_binop (PLUS_EXPR,
7313 size_int (non_fn_entries),
7314 size_int (list_length (TREE_VALUE (l))));
7315 index = size_binop (MULT_EXPR,
7316 TYPE_SIZE_UNIT (vtable_entry_type),
7318 vtbl = build (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7319 TREE_CONSTANT (vtbl) = 1;
7323 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7324 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7325 straighten this out. */
7326 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7327 else if (BINFO_PRIMARY_P (binfo) && TREE_VIA_VIRTUAL (binfo))
7330 /* For an ordinary vtable, set BINFO_VTABLE. */
7331 BINFO_VTABLE (binfo) = vtbl;
7336 /* Construct the initializer for BINFO's virtual function table. BINFO
7337 is part of the hierarchy dominated by T. If we're building a
7338 construction vtable, the ORIG_BINFO is the binfo we should use to
7339 find the actual function pointers to put in the vtable - but they
7340 can be overridden on the path to most-derived in the graph that
7341 ORIG_BINFO belongs. Otherwise,
7342 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7343 BINFO that should be indicated by the RTTI information in the
7344 vtable; it will be a base class of T, rather than T itself, if we
7345 are building a construction vtable.
7347 The value returned is a TREE_LIST suitable for wrapping in a
7348 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7349 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7350 number of non-function entries in the vtable.
7352 It might seem that this function should never be called with a
7353 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7354 base is always subsumed by a derived class vtable. However, when
7355 we are building construction vtables, we do build vtables for
7356 primary bases; we need these while the primary base is being
7360 build_vtbl_initializer (tree binfo,
7364 int* non_fn_entries_p)
7371 /* Initialize VID. */
7372 memset (&vid, 0, sizeof (vid));
7375 vid.rtti_binfo = rtti_binfo;
7376 vid.last_init = &vid.inits;
7377 vid.primary_vtbl_p = (binfo == TYPE_BINFO (t));
7378 vid.ctor_vtbl_p = !same_type_p (BINFO_TYPE (rtti_binfo), t);
7379 vid.generate_vcall_entries = true;
7380 /* The first vbase or vcall offset is at index -3 in the vtable. */
7381 vid.index = ssize_int (-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
7383 /* Add entries to the vtable for RTTI. */
7384 build_rtti_vtbl_entries (binfo, &vid);
7386 /* Create an array for keeping track of the functions we've
7387 processed. When we see multiple functions with the same
7388 signature, we share the vcall offsets. */
7389 VARRAY_TREE_INIT (vid.fns, 32, "fns");
7390 /* Add the vcall and vbase offset entries. */
7391 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7392 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7393 build_vbase_offset_vtbl_entries. */
7394 for (vbase = CLASSTYPE_VBASECLASSES (t);
7396 vbase = TREE_CHAIN (vbase))
7397 BINFO_VTABLE_PATH_MARKED (TREE_VALUE (vbase)) = 0;
7399 /* If the target requires padding between data entries, add that now. */
7400 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
7404 for (prev = &vid.inits; (cur = *prev); prev = &TREE_CHAIN (cur))
7409 for (i = 1; i < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++i)
7410 add = tree_cons (NULL_TREE,
7411 build1 (NOP_EXPR, vtable_entry_type,
7418 if (non_fn_entries_p)
7419 *non_fn_entries_p = list_length (vid.inits);
7421 /* Go through all the ordinary virtual functions, building up
7423 vfun_inits = NULL_TREE;
7424 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7428 tree fn, fn_original;
7429 tree init = NULL_TREE;
7433 if (DECL_THUNK_P (fn))
7435 if (!DECL_NAME (fn))
7437 if (THUNK_ALIAS (fn))
7439 fn = THUNK_ALIAS (fn);
7442 fn_original = THUNK_TARGET (fn);
7445 /* If the only definition of this function signature along our
7446 primary base chain is from a lost primary, this vtable slot will
7447 never be used, so just zero it out. This is important to avoid
7448 requiring extra thunks which cannot be generated with the function.
7450 We first check this in update_vtable_entry_for_fn, so we handle
7451 restored primary bases properly; we also need to do it here so we
7452 zero out unused slots in ctor vtables, rather than filling themff
7453 with erroneous values (though harmless, apart from relocation
7455 for (b = binfo; ; b = get_primary_binfo (b))
7457 /* We found a defn before a lost primary; go ahead as normal. */
7458 if (look_for_overrides_here (BINFO_TYPE (b), fn_original))
7461 /* The nearest definition is from a lost primary; clear the
7463 if (BINFO_LOST_PRIMARY_P (b))
7465 init = size_zero_node;
7472 /* Pull the offset for `this', and the function to call, out of
7474 delta = BV_DELTA (v);
7475 vcall_index = BV_VCALL_INDEX (v);
7477 my_friendly_assert (TREE_CODE (delta) == INTEGER_CST, 19990727);
7478 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 19990727);
7480 /* You can't call an abstract virtual function; it's abstract.
7481 So, we replace these functions with __pure_virtual. */
7482 if (DECL_PURE_VIRTUAL_P (fn_original))
7484 else if (!integer_zerop (delta) || vcall_index)
7486 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
7487 if (!DECL_NAME (fn))
7490 /* Take the address of the function, considering it to be of an
7491 appropriate generic type. */
7492 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7493 /* The address of a function can't change. */
7494 TREE_CONSTANT (init) = 1;
7497 /* And add it to the chain of initializers. */
7498 if (TARGET_VTABLE_USES_DESCRIPTORS)
7501 if (init == size_zero_node)
7502 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7503 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7505 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
7507 tree fdesc = build (FDESC_EXPR, vfunc_ptr_type_node,
7508 TREE_OPERAND (init, 0),
7509 build_int_2 (i, 0));
7510 TREE_CONSTANT (fdesc) = 1;
7512 vfun_inits = tree_cons (NULL_TREE, fdesc, vfun_inits);
7516 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7519 /* The initializers for virtual functions were built up in reverse
7520 order; straighten them out now. */
7521 vfun_inits = nreverse (vfun_inits);
7523 /* The negative offset initializers are also in reverse order. */
7524 vid.inits = nreverse (vid.inits);
7526 /* Chain the two together. */
7527 return chainon (vid.inits, vfun_inits);
7530 /* Adds to vid->inits the initializers for the vbase and vcall
7531 offsets in BINFO, which is in the hierarchy dominated by T. */
7534 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
7538 /* If this is a derived class, we must first create entries
7539 corresponding to the primary base class. */
7540 b = get_primary_binfo (binfo);
7542 build_vcall_and_vbase_vtbl_entries (b, vid);
7544 /* Add the vbase entries for this base. */
7545 build_vbase_offset_vtbl_entries (binfo, vid);
7546 /* Add the vcall entries for this base. */
7547 build_vcall_offset_vtbl_entries (binfo, vid);
7550 /* Returns the initializers for the vbase offset entries in the vtable
7551 for BINFO (which is part of the class hierarchy dominated by T), in
7552 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7553 where the next vbase offset will go. */
7556 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7560 tree non_primary_binfo;
7562 /* If there are no virtual baseclasses, then there is nothing to
7564 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
7569 /* We might be a primary base class. Go up the inheritance hierarchy
7570 until we find the most derived class of which we are a primary base:
7571 it is the offset of that which we need to use. */
7572 non_primary_binfo = binfo;
7573 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7577 /* If we have reached a virtual base, then it must be a primary
7578 base (possibly multi-level) of vid->binfo, or we wouldn't
7579 have called build_vcall_and_vbase_vtbl_entries for it. But it
7580 might be a lost primary, so just skip down to vid->binfo. */
7581 if (TREE_VIA_VIRTUAL (non_primary_binfo))
7583 non_primary_binfo = vid->binfo;
7587 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7588 if (get_primary_binfo (b) != non_primary_binfo)
7590 non_primary_binfo = b;
7593 /* Go through the virtual bases, adding the offsets. */
7594 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7596 vbase = TREE_CHAIN (vbase))
7601 if (!TREE_VIA_VIRTUAL (vbase))
7604 /* Find the instance of this virtual base in the complete
7606 b = copied_binfo (vbase, binfo);
7608 /* If we've already got an offset for this virtual base, we
7609 don't need another one. */
7610 if (BINFO_VTABLE_PATH_MARKED (b))
7612 BINFO_VTABLE_PATH_MARKED (b) = 1;
7614 /* Figure out where we can find this vbase offset. */
7615 delta = size_binop (MULT_EXPR,
7618 TYPE_SIZE_UNIT (vtable_entry_type)));
7619 if (vid->primary_vtbl_p)
7620 BINFO_VPTR_FIELD (b) = delta;
7622 if (binfo != TYPE_BINFO (t))
7624 /* The vbase offset had better be the same. */
7625 my_friendly_assert (tree_int_cst_equal (delta,
7626 BINFO_VPTR_FIELD (vbase)),
7630 /* The next vbase will come at a more negative offset. */
7631 vid->index = size_binop (MINUS_EXPR, vid->index,
7632 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7634 /* The initializer is the delta from BINFO to this virtual base.
7635 The vbase offsets go in reverse inheritance-graph order, and
7636 we are walking in inheritance graph order so these end up in
7638 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
7641 = build_tree_list (NULL_TREE,
7642 fold (build1 (NOP_EXPR,
7645 vid->last_init = &TREE_CHAIN (*vid->last_init);
7649 /* Adds the initializers for the vcall offset entries in the vtable
7650 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7654 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
7656 /* We only need these entries if this base is a virtual base. We
7657 compute the indices -- but do not add to the vtable -- when
7658 building the main vtable for a class. */
7659 if (TREE_VIA_VIRTUAL (binfo) || binfo == TYPE_BINFO (vid->derived))
7661 /* We need a vcall offset for each of the virtual functions in this
7662 vtable. For example:
7664 class A { virtual void f (); };
7665 class B1 : virtual public A { virtual void f (); };
7666 class B2 : virtual public A { virtual void f (); };
7667 class C: public B1, public B2 { virtual void f (); };
7669 A C object has a primary base of B1, which has a primary base of A. A
7670 C also has a secondary base of B2, which no longer has a primary base
7671 of A. So the B2-in-C construction vtable needs a secondary vtable for
7672 A, which will adjust the A* to a B2* to call f. We have no way of
7673 knowing what (or even whether) this offset will be when we define B2,
7674 so we store this "vcall offset" in the A sub-vtable and look it up in
7675 a "virtual thunk" for B2::f.
7677 We need entries for all the functions in our primary vtable and
7678 in our non-virtual bases' secondary vtables. */
7680 /* If we are just computing the vcall indices -- but do not need
7681 the actual entries -- not that. */
7682 if (!TREE_VIA_VIRTUAL (binfo))
7683 vid->generate_vcall_entries = false;
7684 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7685 add_vcall_offset_vtbl_entries_r (binfo, vid);
7689 /* Build vcall offsets, starting with those for BINFO. */
7692 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
7697 /* Don't walk into virtual bases -- except, of course, for the
7698 virtual base for which we are building vcall offsets. Any
7699 primary virtual base will have already had its offsets generated
7700 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7701 if (TREE_VIA_VIRTUAL (binfo) && vid->vbase != binfo)
7704 /* If BINFO has a primary base, process it first. */
7705 primary_binfo = get_primary_binfo (binfo);
7707 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7709 /* Add BINFO itself to the list. */
7710 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7712 /* Scan the non-primary bases of BINFO. */
7713 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
7717 base_binfo = BINFO_BASETYPE (binfo, i);
7718 if (base_binfo != primary_binfo)
7719 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7723 /* Called from build_vcall_offset_vtbl_entries_r. */
7726 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
7728 /* Make entries for the rest of the virtuals. */
7729 if (abi_version_at_least (2))
7733 /* The ABI requires that the methods be processed in declaration
7734 order. G++ 3.2 used the order in the vtable. */
7735 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
7737 orig_fn = TREE_CHAIN (orig_fn))
7738 if (DECL_VINDEX (orig_fn))
7739 add_vcall_offset (orig_fn, binfo, vid);
7743 tree derived_virtuals;
7746 /* If BINFO is a primary base, the most derived class which has
7747 BINFO as a primary base; otherwise, just BINFO. */
7748 tree non_primary_binfo;
7750 /* We might be a primary base class. Go up the inheritance hierarchy
7751 until we find the most derived class of which we are a primary base:
7752 it is the BINFO_VIRTUALS there that we need to consider. */
7753 non_primary_binfo = binfo;
7754 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7758 /* If we have reached a virtual base, then it must be vid->vbase,
7759 because we ignore other virtual bases in
7760 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7761 base (possibly multi-level) of vid->binfo, or we wouldn't
7762 have called build_vcall_and_vbase_vtbl_entries for it. But it
7763 might be a lost primary, so just skip down to vid->binfo. */
7764 if (TREE_VIA_VIRTUAL (non_primary_binfo))
7766 if (non_primary_binfo != vid->vbase)
7768 non_primary_binfo = vid->binfo;
7772 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7773 if (get_primary_binfo (b) != non_primary_binfo)
7775 non_primary_binfo = b;
7778 if (vid->ctor_vtbl_p)
7779 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7780 where rtti_binfo is the most derived type. */
7782 = original_binfo (non_primary_binfo, vid->rtti_binfo);
7784 for (base_virtuals = BINFO_VIRTUALS (binfo),
7785 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7786 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7788 base_virtuals = TREE_CHAIN (base_virtuals),
7789 derived_virtuals = TREE_CHAIN (derived_virtuals),
7790 orig_virtuals = TREE_CHAIN (orig_virtuals))
7794 /* Find the declaration that originally caused this function to
7795 be present in BINFO_TYPE (binfo). */
7796 orig_fn = BV_FN (orig_virtuals);
7798 /* When processing BINFO, we only want to generate vcall slots for
7799 function slots introduced in BINFO. So don't try to generate
7800 one if the function isn't even defined in BINFO. */
7801 if (!same_type_p (DECL_CONTEXT (orig_fn), BINFO_TYPE (binfo)))
7804 add_vcall_offset (orig_fn, binfo, vid);
7809 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7812 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
7817 /* If there is already an entry for a function with the same
7818 signature as FN, then we do not need a second vcall offset.
7819 Check the list of functions already present in the derived
7821 for (i = 0; i < VARRAY_ACTIVE_SIZE (vid->fns); ++i)
7825 derived_entry = VARRAY_TREE (vid->fns, i);
7826 if (same_signature_p (derived_entry, orig_fn)
7827 /* We only use one vcall offset for virtual destructors,
7828 even though there are two virtual table entries. */
7829 || (DECL_DESTRUCTOR_P (derived_entry)
7830 && DECL_DESTRUCTOR_P (orig_fn)))
7834 /* If we are building these vcall offsets as part of building
7835 the vtable for the most derived class, remember the vcall
7837 if (vid->binfo == TYPE_BINFO (vid->derived))
7838 CLASSTYPE_VCALL_INDICES (vid->derived)
7839 = tree_cons (orig_fn, vid->index,
7840 CLASSTYPE_VCALL_INDICES (vid->derived));
7842 /* The next vcall offset will be found at a more negative
7844 vid->index = size_binop (MINUS_EXPR, vid->index,
7845 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
7847 /* Keep track of this function. */
7848 VARRAY_PUSH_TREE (vid->fns, orig_fn);
7850 if (vid->generate_vcall_entries)
7855 /* Find the overriding function. */
7856 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
7857 if (fn == error_mark_node)
7858 vcall_offset = build1 (NOP_EXPR, vtable_entry_type,
7862 base = TREE_VALUE (fn);
7864 /* The vbase we're working on is a primary base of
7865 vid->binfo. But it might be a lost primary, so its
7866 BINFO_OFFSET might be wrong, so we just use the
7867 BINFO_OFFSET from vid->binfo. */
7868 vcall_offset = size_diffop (BINFO_OFFSET (base),
7869 BINFO_OFFSET (vid->binfo));
7870 vcall_offset = fold (build1 (NOP_EXPR, vtable_entry_type,
7873 /* Add the initializer to the vtable. */
7874 *vid->last_init = build_tree_list (NULL_TREE, vcall_offset);
7875 vid->last_init = &TREE_CHAIN (*vid->last_init);
7879 /* Return vtbl initializers for the RTTI entries corresponding to the
7880 BINFO's vtable. The RTTI entries should indicate the object given
7881 by VID->rtti_binfo. */
7884 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
7893 basetype = BINFO_TYPE (binfo);
7894 t = BINFO_TYPE (vid->rtti_binfo);
7896 /* To find the complete object, we will first convert to our most
7897 primary base, and then add the offset in the vtbl to that value. */
7899 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
7900 && !BINFO_LOST_PRIMARY_P (b))
7904 primary_base = get_primary_binfo (b);
7905 my_friendly_assert (BINFO_PRIMARY_BASE_OF (primary_base) == b, 20010127);
7908 offset = size_diffop (BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
7910 /* The second entry is the address of the typeinfo object. */
7912 decl = build_address (get_tinfo_decl (t));
7914 decl = integer_zero_node;
7916 /* Convert the declaration to a type that can be stored in the
7918 init = build_nop (vfunc_ptr_type_node, decl);
7919 *vid->last_init = build_tree_list (NULL_TREE, init);
7920 vid->last_init = &TREE_CHAIN (*vid->last_init);
7922 /* Add the offset-to-top entry. It comes earlier in the vtable that
7923 the the typeinfo entry. Convert the offset to look like a
7924 function pointer, so that we can put it in the vtable. */
7925 init = build_nop (vfunc_ptr_type_node, offset);
7926 *vid->last_init = build_tree_list (NULL_TREE, init);
7927 vid->last_init = &TREE_CHAIN (*vid->last_init);