1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 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_inner_fields_searched
= 0;
233 /* Convert to or from a base subobject. EXPR is an expression of type
234 `A' or `A*', an expression of type `B' or `B*' is returned. To
235 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
236 the B base instance within A. To convert base A to derived B, CODE
237 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
238 In this latter case, A must not be a morally virtual base of B.
239 NONNULL is true if EXPR is known to be non-NULL (this is only
240 needed when EXPR is of pointer type). CV qualifiers are preserved
244 build_base_path (enum tree_code code
,
249 tree v_binfo
= NULL_TREE
;
250 tree d_binfo
= NULL_TREE
;
254 tree null_test
= NULL
;
255 tree ptr_target_type
;
257 int want_pointer
= TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
;
259 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
260 return error_mark_node
;
262 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
265 if (!v_binfo
&& TREE_VIA_VIRTUAL (probe
))
269 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
271 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
273 my_friendly_assert (code
== MINUS_EXPR
274 ? same_type_p (BINFO_TYPE (binfo
), probe
)
276 ? same_type_p (BINFO_TYPE (d_binfo
), probe
)
279 if (code
== MINUS_EXPR
&& v_binfo
)
281 error ("cannot convert from base `%T' to derived type `%T' via virtual base `%T'",
282 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
283 return error_mark_node
;
287 /* This must happen before the call to save_expr. */
288 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
290 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
291 if (fixed_type_p
<= 0 && TREE_SIDE_EFFECTS (expr
))
292 expr
= save_expr (expr
);
294 if (want_pointer
&& !nonnull
)
295 null_test
= build (EQ_EXPR
, boolean_type_node
, expr
, integer_zero_node
);
297 offset
= BINFO_OFFSET (binfo
);
299 if (v_binfo
&& fixed_type_p
<= 0)
301 /* Going via virtual base V_BINFO. We need the static offset
302 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
303 V_BINFO. That offset is an entry in D_BINFO's vtable. */
306 if (fixed_type_p
< 0 && in_base_initializer
)
308 /* In a base member initializer, we cannot rely on
309 the vtable being set up. We have to use the vtt_parm. */
310 tree derived
= BINFO_INHERITANCE_CHAIN (v_binfo
);
312 v_offset
= build (PLUS_EXPR
, TREE_TYPE (current_vtt_parm
),
313 current_vtt_parm
, BINFO_VPTR_INDEX (derived
));
315 v_offset
= build1 (INDIRECT_REF
,
316 TREE_TYPE (TYPE_VFIELD (BINFO_TYPE (derived
))),
321 v_offset
= build_vfield_ref (build_indirect_ref (expr
, NULL
),
322 TREE_TYPE (TREE_TYPE (expr
)));
324 v_offset
= build (PLUS_EXPR
, TREE_TYPE (v_offset
),
325 v_offset
, BINFO_VPTR_FIELD (v_binfo
));
326 v_offset
= build1 (NOP_EXPR
,
327 build_pointer_type (ptrdiff_type_node
),
329 v_offset
= build_indirect_ref (v_offset
, NULL
);
331 offset
= convert_to_integer (ptrdiff_type_node
,
333 BINFO_OFFSET (v_binfo
)));
335 if (!integer_zerop (offset
))
336 v_offset
= build (code
, ptrdiff_type_node
, v_offset
, offset
);
338 if (fixed_type_p
< 0)
339 /* Negative fixed_type_p means this is a constructor or destructor;
340 virtual base layout is fixed in in-charge [cd]tors, but not in
342 offset
= build (COND_EXPR
, ptrdiff_type_node
,
343 build (EQ_EXPR
, boolean_type_node
,
344 current_in_charge_parm
, integer_zero_node
),
346 BINFO_OFFSET (binfo
));
351 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
353 target_type
= cp_build_qualified_type
354 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
355 ptr_target_type
= build_pointer_type (target_type
);
357 target_type
= ptr_target_type
;
359 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
361 if (!integer_zerop (offset
))
362 expr
= build (code
, ptr_target_type
, expr
, offset
);
367 expr
= build_indirect_ref (expr
, NULL
);
370 expr
= build (COND_EXPR
, target_type
, null_test
,
371 build1 (NOP_EXPR
, target_type
, integer_zero_node
),
377 /* Convert OBJECT to the base TYPE. If CHECK_ACCESS is true, an error
378 message is emitted if TYPE is inaccessible. OBJECT is assumed to
382 convert_to_base (tree object
, tree type
, bool check_access
)
386 binfo
= lookup_base (TREE_TYPE (object
), type
,
387 check_access
? ba_check
: ba_ignore
,
389 if (!binfo
|| binfo
== error_mark_node
)
390 return error_mark_node
;
392 return build_base_path (PLUS_EXPR
, object
, binfo
, /*nonnull=*/1);
395 /* EXPR is an expression with class type. BASE is a base class (a
396 BINFO) of that class type. Returns EXPR, converted to the BASE
397 type. This function assumes that EXPR is the most derived class;
398 therefore virtual bases can be found at their static offsets. */
401 convert_to_base_statically (tree expr
, tree base
)
405 expr_type
= TREE_TYPE (expr
);
406 if (!same_type_p (expr_type
, BINFO_TYPE (base
)))
410 pointer_type
= build_pointer_type (expr_type
);
411 expr
= build_unary_op (ADDR_EXPR
, expr
, /*noconvert=*/1);
412 if (!integer_zerop (BINFO_OFFSET (base
)))
413 expr
= build (PLUS_EXPR
, pointer_type
, expr
,
414 build_nop (pointer_type
, BINFO_OFFSET (base
)));
415 expr
= build_nop (build_pointer_type (BINFO_TYPE (base
)), expr
);
416 expr
= build1 (INDIRECT_REF
, BINFO_TYPE (base
), expr
);
423 /* Given an object INSTANCE, return an expression which yields the
424 vtable element corresponding to INDEX. There are many special
425 cases for INSTANCE which we take care of here, mainly to avoid
426 creating extra tree nodes when we don't have to. */
429 build_vtbl_ref_1 (tree instance
, tree idx
)
432 tree vtbl
= NULL_TREE
;
434 /* Try to figure out what a reference refers to, and
435 access its virtual function table directly. */
438 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
440 tree basetype
= non_reference (TREE_TYPE (instance
));
442 if (fixed_type
&& !cdtorp
)
444 tree binfo
= lookup_base (fixed_type
, basetype
,
445 ba_ignore
|ba_quiet
, NULL
);
447 vtbl
= BINFO_VTABLE (binfo
);
451 vtbl
= build_vfield_ref (instance
, basetype
);
453 assemble_external (vtbl
);
455 aref
= build_array_ref (vtbl
, idx
);
461 build_vtbl_ref (tree instance
, tree idx
)
463 tree aref
= build_vtbl_ref_1 (instance
, idx
);
468 /* Given an object INSTANCE, return an expression which yields a
469 function pointer corresponding to vtable element INDEX. */
472 build_vfn_ref (tree instance
, tree idx
)
474 tree aref
= build_vtbl_ref_1 (instance
, idx
);
476 /* When using function descriptors, the address of the
477 vtable entry is treated as a function pointer. */
478 if (TARGET_VTABLE_USES_DESCRIPTORS
)
479 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
480 build_unary_op (ADDR_EXPR
, aref
, /*noconvert=*/1));
485 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
486 for the given TYPE. */
489 get_vtable_name (tree type
)
491 return mangle_vtbl_for_type (type
);
494 /* Return an IDENTIFIER_NODE for the name of the virtual table table
498 get_vtt_name (tree type
)
500 return mangle_vtt_for_type (type
);
503 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
504 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
505 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
508 build_vtable (tree class_type
, tree name
, tree vtable_type
)
512 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
513 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
514 now to avoid confusion in mangle_decl. */
515 SET_DECL_ASSEMBLER_NAME (decl
, name
);
516 DECL_CONTEXT (decl
) = class_type
;
517 DECL_ARTIFICIAL (decl
) = 1;
518 TREE_STATIC (decl
) = 1;
519 TREE_READONLY (decl
) = 1;
520 DECL_VIRTUAL_P (decl
) = 1;
521 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
522 DECL_VTABLE_OR_VTT_P (decl
) = 1;
524 /* At one time the vtable info was grabbed 2 words at a time. This
525 fails on sparc unless you have 8-byte alignment. (tiemann) */
526 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
529 import_export_vtable (decl
, class_type
, 0);
534 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
535 or even complete. If this does not exist, create it. If COMPLETE is
536 nonzero, then complete the definition of it -- that will render it
537 impossible to actually build the vtable, but is useful to get at those
538 which are known to exist in the runtime. */
541 get_vtable_decl (tree type
, int complete
)
545 if (CLASSTYPE_VTABLES (type
))
546 return CLASSTYPE_VTABLES (type
);
548 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
549 CLASSTYPE_VTABLES (type
) = decl
;
553 DECL_EXTERNAL (decl
) = 1;
554 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
560 /* Returns a copy of the BINFO_VIRTUALS list in BINFO. The
561 BV_VCALL_INDEX for each entry is cleared. */
564 copy_virtuals (tree binfo
)
569 copies
= copy_list (BINFO_VIRTUALS (binfo
));
570 for (t
= copies
; t
; t
= TREE_CHAIN (t
))
571 BV_VCALL_INDEX (t
) = NULL_TREE
;
576 /* Build the primary virtual function table for TYPE. If BINFO is
577 non-NULL, build the vtable starting with the initial approximation
578 that it is the same as the one which is the head of the association
579 list. Returns a nonzero value if a new vtable is actually
583 build_primary_vtable (tree binfo
, tree type
)
588 decl
= get_vtable_decl (type
, /*complete=*/0);
592 if (BINFO_NEW_VTABLE_MARKED (binfo
))
593 /* We have already created a vtable for this base, so there's
594 no need to do it again. */
597 virtuals
= copy_virtuals (binfo
);
598 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
599 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
600 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
604 my_friendly_assert (TREE_TYPE (decl
) == vtbl_type_node
, 20000118);
605 virtuals
= NULL_TREE
;
608 #ifdef GATHER_STATISTICS
610 n_vtable_elems
+= list_length (virtuals
);
613 /* Initialize the association list for this type, based
614 on our first approximation. */
615 TYPE_BINFO_VTABLE (type
) = decl
;
616 TYPE_BINFO_VIRTUALS (type
) = virtuals
;
617 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
621 /* Give BINFO a new virtual function table which is initialized
622 with a skeleton-copy of its original initialization. The only
623 entry that changes is the `delta' entry, so we can really
624 share a lot of structure.
626 FOR_TYPE is the most derived type which caused this table to
629 Returns nonzero if we haven't met BINFO before.
631 The order in which vtables are built (by calling this function) for
632 an object must remain the same, otherwise a binary incompatibility
636 build_secondary_vtable (tree binfo
)
638 if (BINFO_NEW_VTABLE_MARKED (binfo
))
639 /* We already created a vtable for this base. There's no need to
643 /* Remember that we've created a vtable for this BINFO, so that we
644 don't try to do so again. */
645 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
647 /* Make fresh virtual list, so we can smash it later. */
648 BINFO_VIRTUALS (binfo
) = copy_virtuals (binfo
);
650 /* Secondary vtables are laid out as part of the same structure as
651 the primary vtable. */
652 BINFO_VTABLE (binfo
) = NULL_TREE
;
656 /* Create a new vtable for BINFO which is the hierarchy dominated by
657 T. Return nonzero if we actually created a new vtable. */
660 make_new_vtable (tree t
, tree binfo
)
662 if (binfo
== TYPE_BINFO (t
))
663 /* In this case, it is *type*'s vtable we are modifying. We start
664 with the approximation that its vtable is that of the
665 immediate base class. */
666 /* ??? This actually passes TYPE_BINFO (t), not the primary base binfo,
667 since we've updated DECL_CONTEXT (TYPE_VFIELD (t)) by now. */
668 return build_primary_vtable (TYPE_BINFO (DECL_CONTEXT (TYPE_VFIELD (t
))),
671 /* This is our very own copy of `basetype' to play with. Later,
672 we will fill in all the virtual functions that override the
673 virtual functions in these base classes which are not defined
674 by the current type. */
675 return build_secondary_vtable (binfo
);
678 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
679 (which is in the hierarchy dominated by T) list FNDECL as its
680 BV_FN. DELTA is the required constant adjustment from the `this'
681 pointer where the vtable entry appears to the `this' required when
682 the function is actually called. */
685 modify_vtable_entry (tree t
,
695 if (fndecl
!= BV_FN (v
)
696 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
698 /* We need a new vtable for BINFO. */
699 if (make_new_vtable (t
, binfo
))
701 /* If we really did make a new vtable, we also made a copy
702 of the BINFO_VIRTUALS list. Now, we have to find the
703 corresponding entry in that list. */
704 *virtuals
= BINFO_VIRTUALS (binfo
);
705 while (BV_FN (*virtuals
) != BV_FN (v
))
706 *virtuals
= TREE_CHAIN (*virtuals
);
710 BV_DELTA (v
) = delta
;
711 BV_VCALL_INDEX (v
) = NULL_TREE
;
717 /* Add method METHOD to class TYPE. If ERROR_P is true, we are adding
718 the method after the class has already been defined because a
719 declaration for it was seen. (Even though that is erroneous, we
720 add the method for improved error recovery.) */
723 add_method (tree type
, tree method
, int error_p
)
731 if (method
== error_mark_node
)
734 using = (DECL_CONTEXT (method
) != type
);
735 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
736 && DECL_TEMPLATE_CONV_FN_P (method
));
738 if (!CLASSTYPE_METHOD_VEC (type
))
739 /* Make a new method vector. We start with 8 entries. We must
740 allocate at least two (for constructors and destructors), and
741 we're going to end up with an assignment operator at some point
744 We could use a TREE_LIST for now, and convert it to a TREE_VEC
745 in finish_struct, but we would probably waste more memory
746 making the links in the list than we would by over-allocating
747 the size of the vector here. Furthermore, we would complicate
748 all the code that expects this to be a vector. */
749 CLASSTYPE_METHOD_VEC (type
) = make_tree_vec (8);
751 method_vec
= CLASSTYPE_METHOD_VEC (type
);
752 len
= TREE_VEC_LENGTH (method_vec
);
754 /* Constructors and destructors go in special slots. */
755 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
756 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
757 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
759 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
760 TYPE_HAS_DESTRUCTOR (type
) = 1;
762 if (TYPE_FOR_JAVA (type
))
763 error (DECL_ARTIFICIAL (method
)
764 ? "Java class '%T' cannot have an implicit non-trivial destructor"
765 : "Java class '%T' cannot have a destructor",
766 DECL_CONTEXT (method
));
770 int have_template_convs_p
= 0;
772 /* See if we already have an entry with this name. */
773 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
; slot
< len
; ++slot
)
775 tree m
= TREE_VEC_ELT (method_vec
, slot
);
783 have_template_convs_p
= (TREE_CODE (m
) == TEMPLATE_DECL
784 && DECL_TEMPLATE_CONV_FN_P (m
));
786 /* If we need to move things up, see if there's
788 if (!have_template_convs_p
)
791 if (TREE_VEC_ELT (method_vec
, slot
))
796 if (DECL_NAME (m
) == DECL_NAME (method
))
802 /* We need a bigger method vector. */
806 /* In the non-error case, we are processing a class
807 definition. Double the size of the vector to give room
811 /* In the error case, the vector is already complete. We
812 don't expect many errors, and the rest of the front-end
813 will get confused if there are empty slots in the vector. */
817 new_vec
= make_tree_vec (new_len
);
818 memcpy (&TREE_VEC_ELT (new_vec
, 0), &TREE_VEC_ELT (method_vec
, 0),
819 len
* sizeof (tree
));
821 method_vec
= CLASSTYPE_METHOD_VEC (type
) = new_vec
;
824 if (DECL_CONV_FN_P (method
) && !TREE_VEC_ELT (method_vec
, slot
))
826 /* Type conversion operators have to come before ordinary
827 methods; add_conversions depends on this to speed up
828 looking for conversion operators. So, if necessary, we
829 slide some of the vector elements up. In theory, this
830 makes this algorithm O(N^2) but we don't expect many
831 conversion operators. */
833 slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
835 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
; slot
< len
; ++slot
)
837 tree fn
= TREE_VEC_ELT (method_vec
, slot
);
840 /* There are no more entries in the vector, so we
841 can insert the new conversion operator here. */
844 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
845 /* We can insert the new function right at the
850 if (template_conv_p
&& have_template_convs_p
)
852 else if (!TREE_VEC_ELT (method_vec
, slot
))
853 /* There is nothing in the Ith slot, so we can avoid
858 /* We know the last slot in the vector is empty
859 because we know that at this point there's room
860 for a new function. */
861 memmove (&TREE_VEC_ELT (method_vec
, slot
+ 1),
862 &TREE_VEC_ELT (method_vec
, slot
),
863 (len
- slot
- 1) * sizeof (tree
));
864 TREE_VEC_ELT (method_vec
, slot
) = NULL_TREE
;
869 if (processing_template_decl
)
870 /* TYPE is a template class. Don't issue any errors now; wait
871 until instantiation time to complain. */
877 /* Check to see if we've already got this method. */
878 for (fns
= TREE_VEC_ELT (method_vec
, slot
);
880 fns
= OVL_NEXT (fns
))
882 tree fn
= OVL_CURRENT (fns
);
887 if (TREE_CODE (fn
) != TREE_CODE (method
))
890 /* [over.load] Member function declarations with the
891 same name and the same parameter types cannot be
892 overloaded if any of them is a static member
893 function declaration.
895 [namespace.udecl] When a using-declaration brings names
896 from a base class into a derived class scope, member
897 functions in the derived class override and/or hide member
898 functions with the same name and parameter types in a base
899 class (rather than conflicting). */
900 parms1
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
901 parms2
= TYPE_ARG_TYPES (TREE_TYPE (method
));
903 /* Compare the quals on the 'this' parm. Don't compare
904 the whole types, as used functions are treated as
905 coming from the using class in overload resolution. */
906 if (! DECL_STATIC_FUNCTION_P (fn
)
907 && ! DECL_STATIC_FUNCTION_P (method
)
908 && (TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms1
)))
909 != TYPE_QUALS (TREE_TYPE (TREE_VALUE (parms2
)))))
912 /* For templates, the template parms must be identical. */
913 if (TREE_CODE (fn
) == TEMPLATE_DECL
914 && !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
915 DECL_TEMPLATE_PARMS (method
)))
918 if (! DECL_STATIC_FUNCTION_P (fn
))
919 parms1
= TREE_CHAIN (parms1
);
920 if (! DECL_STATIC_FUNCTION_P (method
))
921 parms2
= TREE_CHAIN (parms2
);
923 if (same
&& compparms (parms1
, parms2
)
924 && (!DECL_CONV_FN_P (fn
)
925 || same_type_p (TREE_TYPE (TREE_TYPE (fn
)),
926 TREE_TYPE (TREE_TYPE (method
)))))
928 if (using && DECL_CONTEXT (fn
) == type
)
929 /* Defer to the local function. */
933 cp_error_at ("`%#D' and `%#D' cannot be overloaded",
936 /* We don't call duplicate_decls here to merge
937 the declarations because that will confuse
938 things if the methods have inline
939 definitions. In particular, we will crash
940 while processing the definitions. */
947 /* Actually insert the new method. */
948 TREE_VEC_ELT (method_vec
, slot
)
949 = build_overload (method
, TREE_VEC_ELT (method_vec
, slot
));
951 /* Add the new binding. */
952 if (!DECL_CONSTRUCTOR_P (method
)
953 && !DECL_DESTRUCTOR_P (method
))
954 push_class_level_binding (DECL_NAME (method
),
955 TREE_VEC_ELT (method_vec
, slot
));
958 /* Subroutines of finish_struct. */
960 /* Look through the list of fields for this struct, deleting
961 duplicates as we go. This must be recursive to handle
964 FIELD is the field which may not appear anywhere in FIELDS.
965 FIELD_PTR, if non-null, is the starting point at which
966 chained deletions may take place.
967 The value returned is the first acceptable entry found
970 Note that anonymous fields which are not of UNION_TYPE are
971 not duplicates, they are just anonymous fields. This happens
972 when we have unnamed bitfields, for example. */
975 delete_duplicate_fields_1 (tree field
, tree fields
)
979 if (DECL_NAME (field
) == 0)
981 if (! ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
984 for (x
= TYPE_FIELDS (TREE_TYPE (field
)); x
; x
= TREE_CHAIN (x
))
985 fields
= delete_duplicate_fields_1 (x
, fields
);
990 for (x
= fields
; x
; prev
= x
, x
= TREE_CHAIN (x
))
992 if (DECL_NAME (x
) == 0)
994 if (! ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
996 TYPE_FIELDS (TREE_TYPE (x
))
997 = delete_duplicate_fields_1 (field
, TYPE_FIELDS (TREE_TYPE (x
)));
998 if (TYPE_FIELDS (TREE_TYPE (x
)) == 0)
1001 fields
= TREE_CHAIN (fields
);
1003 TREE_CHAIN (prev
) = TREE_CHAIN (x
);
1006 else if (TREE_CODE (field
) == USING_DECL
)
1007 /* A using declaration is allowed to appear more than
1008 once. We'll prune these from the field list later, and
1009 handle_using_decl will complain about invalid multiple
1012 else if (DECL_NAME (field
) == DECL_NAME (x
))
1014 if (TREE_CODE (field
) == CONST_DECL
1015 && TREE_CODE (x
) == CONST_DECL
)
1016 cp_error_at ("duplicate enum value `%D'", x
);
1017 else if (TREE_CODE (field
) == CONST_DECL
1018 || TREE_CODE (x
) == CONST_DECL
)
1019 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1021 else if (DECL_DECLARES_TYPE_P (field
)
1022 && DECL_DECLARES_TYPE_P (x
))
1024 if (same_type_p (TREE_TYPE (field
), TREE_TYPE (x
)))
1026 cp_error_at ("duplicate nested type `%D'", x
);
1028 else if (DECL_DECLARES_TYPE_P (field
)
1029 || DECL_DECLARES_TYPE_P (x
))
1031 /* Hide tag decls. */
1032 if ((TREE_CODE (field
) == TYPE_DECL
1033 && DECL_ARTIFICIAL (field
))
1034 || (TREE_CODE (x
) == TYPE_DECL
1035 && DECL_ARTIFICIAL (x
)))
1037 cp_error_at ("duplicate field `%D' (as type and non-type)",
1041 cp_error_at ("duplicate member `%D'", x
);
1043 fields
= TREE_CHAIN (fields
);
1045 TREE_CHAIN (prev
) = TREE_CHAIN (x
);
1053 delete_duplicate_fields (tree fields
)
1056 for (x
= fields
; x
&& TREE_CHAIN (x
); x
= TREE_CHAIN (x
))
1057 TREE_CHAIN (x
) = delete_duplicate_fields_1 (x
, TREE_CHAIN (x
));
1060 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1061 legit, otherwise return 0. */
1064 alter_access (tree t
, tree fdecl
, tree access
)
1068 if (!DECL_LANG_SPECIFIC (fdecl
))
1069 retrofit_lang_decl (fdecl
);
1071 my_friendly_assert (!DECL_DISCRIMINATOR_P (fdecl
), 20030624);
1073 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1076 if (TREE_VALUE (elem
) != access
)
1078 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1079 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl
));
1081 error ("conflicting access specifications for field `%s', ignored",
1082 IDENTIFIER_POINTER (DECL_NAME (fdecl
)));
1086 /* They're changing the access to the same thing they changed
1087 it to before. That's OK. */
1093 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
);
1094 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1100 /* Process the USING_DECL, which is a member of T. */
1103 handle_using_decl (tree using_decl
, tree t
)
1105 tree ctype
= DECL_INITIAL (using_decl
);
1106 tree name
= DECL_NAME (using_decl
);
1108 = TREE_PRIVATE (using_decl
) ? access_private_node
1109 : TREE_PROTECTED (using_decl
) ? access_protected_node
1110 : access_public_node
;
1112 tree flist
= NULL_TREE
;
1115 if (ctype
== error_mark_node
)
1118 binfo
= lookup_base (t
, ctype
, ba_any
, NULL
);
1121 location_t saved_loc
= input_location
;
1123 input_location
= DECL_SOURCE_LOCATION (using_decl
);
1124 error_not_base_type (ctype
, t
);
1125 input_location
= saved_loc
;
1129 if (constructor_name_p (name
, ctype
))
1131 cp_error_at ("`%D' names constructor", using_decl
);
1134 if (constructor_name_p (name
, t
))
1136 cp_error_at ("`%D' invalid in `%T'", using_decl
, t
);
1140 fdecl
= lookup_member (binfo
, name
, 0, false);
1144 cp_error_at ("no members matching `%D' in `%#T'", using_decl
, ctype
);
1148 if (BASELINK_P (fdecl
))
1149 /* Ignore base type this came from. */
1150 fdecl
= BASELINK_FUNCTIONS (fdecl
);
1152 old_value
= IDENTIFIER_CLASS_VALUE (name
);
1155 if (is_overloaded_fn (old_value
))
1156 old_value
= OVL_CURRENT (old_value
);
1158 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1161 old_value
= NULL_TREE
;
1164 if (is_overloaded_fn (fdecl
))
1169 else if (is_overloaded_fn (old_value
))
1172 /* It's OK to use functions from a base when there are functions with
1173 the same name already present in the current class. */;
1176 cp_error_at ("`%D' invalid in `%#T'", using_decl
, t
);
1177 cp_error_at (" because of local method `%#D' with same name",
1178 OVL_CURRENT (old_value
));
1182 else if (!DECL_ARTIFICIAL (old_value
))
1184 cp_error_at ("`%D' invalid in `%#T'", using_decl
, t
);
1185 cp_error_at (" because of local member `%#D' with same name", old_value
);
1189 /* Make type T see field decl FDECL with access ACCESS. */
1191 for (; flist
; flist
= OVL_NEXT (flist
))
1193 add_method (t
, OVL_CURRENT (flist
), /*error_p=*/0);
1194 alter_access (t
, OVL_CURRENT (flist
), access
);
1197 alter_access (t
, fdecl
, access
);
1200 /* Run through the base classes of T, updating
1201 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1202 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1206 check_bases (tree t
,
1207 int* cant_have_default_ctor_p
,
1208 int* cant_have_const_ctor_p
,
1209 int* no_const_asn_ref_p
)
1213 int seen_non_virtual_nearly_empty_base_p
;
1216 binfos
= TYPE_BINFO_BASETYPES (t
);
1217 n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1218 seen_non_virtual_nearly_empty_base_p
= 0;
1220 /* An aggregate cannot have baseclasses. */
1221 CLASSTYPE_NON_AGGREGATE (t
) |= (n_baseclasses
!= 0);
1223 for (i
= 0; i
< n_baseclasses
; ++i
)
1228 /* Figure out what base we're looking at. */
1229 base_binfo
= TREE_VEC_ELT (binfos
, i
);
1230 basetype
= TREE_TYPE (base_binfo
);
1232 /* If the type of basetype is incomplete, then we already
1233 complained about that fact (and we should have fixed it up as
1235 if (!COMPLETE_TYPE_P (basetype
))
1238 /* The base type is of incomplete type. It is
1239 probably best to pretend that it does not
1241 if (i
== n_baseclasses
-1)
1242 TREE_VEC_ELT (binfos
, i
) = NULL_TREE
;
1243 TREE_VEC_LENGTH (binfos
) -= 1;
1245 for (j
= i
; j
+1 < n_baseclasses
; j
++)
1246 TREE_VEC_ELT (binfos
, j
) = TREE_VEC_ELT (binfos
, j
+1);
1250 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1251 here because the case of virtual functions but non-virtual
1252 dtor is handled in finish_struct_1. */
1253 if (warn_ecpp
&& ! TYPE_POLYMORPHIC_P (basetype
)
1254 && TYPE_HAS_DESTRUCTOR (basetype
))
1255 warning ("base class `%#T' has a non-virtual destructor",
1258 /* If the base class doesn't have copy constructors or
1259 assignment operators that take const references, then the
1260 derived class cannot have such a member automatically
1262 if (! TYPE_HAS_CONST_INIT_REF (basetype
))
1263 *cant_have_const_ctor_p
= 1;
1264 if (TYPE_HAS_ASSIGN_REF (basetype
)
1265 && !TYPE_HAS_CONST_ASSIGN_REF (basetype
))
1266 *no_const_asn_ref_p
= 1;
1267 /* Similarly, if the base class doesn't have a default
1268 constructor, then the derived class won't have an
1269 automatically generated default constructor. */
1270 if (TYPE_HAS_CONSTRUCTOR (basetype
)
1271 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
))
1273 *cant_have_default_ctor_p
= 1;
1274 if (! TYPE_HAS_CONSTRUCTOR (t
))
1275 pedwarn ("base `%T' with only non-default constructor in class without a constructor",
1279 if (TREE_VIA_VIRTUAL (base_binfo
))
1280 /* A virtual base does not effect nearly emptiness. */
1282 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1284 if (seen_non_virtual_nearly_empty_base_p
)
1285 /* And if there is more than one nearly empty base, then the
1286 derived class is not nearly empty either. */
1287 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1289 /* Remember we've seen one. */
1290 seen_non_virtual_nearly_empty_base_p
= 1;
1292 else if (!is_empty_class (basetype
))
1293 /* If the base class is not empty or nearly empty, then this
1294 class cannot be nearly empty. */
1295 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1297 /* A lot of properties from the bases also apply to the derived
1299 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1300 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1301 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1302 TYPE_HAS_COMPLEX_ASSIGN_REF (t
)
1303 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype
);
1304 TYPE_HAS_COMPLEX_INIT_REF (t
) |= TYPE_HAS_COMPLEX_INIT_REF (basetype
);
1305 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1306 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1307 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1311 /* Set BINFO_PRIMARY_BASE_OF for all binfos in the hierarchy
1312 dominated by TYPE that are primary bases. */
1315 mark_primary_bases (tree type
)
1319 /* Walk the bases in inheritance graph order. */
1320 for (binfo
= TYPE_BINFO (type
); binfo
; binfo
= TREE_CHAIN (binfo
))
1322 tree base_binfo
= get_primary_binfo (binfo
);
1325 /* Not a dynamic base. */;
1326 else if (BINFO_PRIMARY_P (base_binfo
))
1327 BINFO_LOST_PRIMARY_P (binfo
) = 1;
1330 BINFO_PRIMARY_BASE_OF (base_binfo
) = binfo
;
1331 /* A virtual binfo might have been copied from within
1332 another hierarchy. As we're about to use it as a primary
1333 base, make sure the offsets match. */
1334 if (TREE_VIA_VIRTUAL (base_binfo
))
1336 tree delta
= size_diffop (convert (ssizetype
,
1337 BINFO_OFFSET (binfo
)),
1339 BINFO_OFFSET (base_binfo
)));
1341 propagate_binfo_offsets (base_binfo
, delta
);
1347 /* Make the BINFO the primary base of T. */
1350 set_primary_base (tree t
, tree binfo
)
1354 CLASSTYPE_PRIMARY_BINFO (t
) = binfo
;
1355 basetype
= BINFO_TYPE (binfo
);
1356 TYPE_BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (basetype
);
1357 TYPE_BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (basetype
);
1358 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1361 /* Determine the primary class for T. */
1364 determine_primary_base (tree t
)
1366 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1370 /* If there are no baseclasses, there is certainly no primary base. */
1371 if (n_baseclasses
== 0)
1374 type_binfo
= TYPE_BINFO (t
);
1376 for (i
= 0; i
< n_baseclasses
; i
++)
1378 tree base_binfo
= BINFO_BASETYPE (type_binfo
, i
);
1379 tree basetype
= BINFO_TYPE (base_binfo
);
1381 if (TYPE_CONTAINS_VPTR_P (basetype
))
1383 /* We prefer a non-virtual base, although a virtual one will
1385 if (TREE_VIA_VIRTUAL (base_binfo
))
1388 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
1390 set_primary_base (t
, base_binfo
);
1391 CLASSTYPE_VFIELDS (t
) = copy_list (CLASSTYPE_VFIELDS (basetype
));
1397 /* Only add unique vfields, and flatten them out as we go. */
1398 for (vfields
= CLASSTYPE_VFIELDS (basetype
);
1400 vfields
= TREE_CHAIN (vfields
))
1401 if (VF_BINFO_VALUE (vfields
) == NULL_TREE
1402 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields
)))
1403 CLASSTYPE_VFIELDS (t
)
1404 = tree_cons (base_binfo
,
1405 VF_BASETYPE_VALUE (vfields
),
1406 CLASSTYPE_VFIELDS (t
));
1411 if (!TYPE_VFIELD (t
))
1412 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
1414 /* Find the indirect primary bases - those virtual bases which are primary
1415 bases of something else in this hierarchy. */
1416 for (vbases
= CLASSTYPE_VBASECLASSES (t
);
1418 vbases
= TREE_CHAIN (vbases
))
1420 tree vbase_binfo
= TREE_VALUE (vbases
);
1422 /* See if this virtual base is an indirect primary base. To be so,
1423 it must be a primary base within the hierarchy of one of our
1425 for (i
= 0; i
< n_baseclasses
; ++i
)
1427 tree basetype
= TYPE_BINFO_BASETYPE (t
, i
);
1430 for (v
= CLASSTYPE_VBASECLASSES (basetype
);
1434 tree base_vbase
= TREE_VALUE (v
);
1436 if (BINFO_PRIMARY_P (base_vbase
)
1437 && same_type_p (BINFO_TYPE (base_vbase
),
1438 BINFO_TYPE (vbase_binfo
)))
1440 BINFO_INDIRECT_PRIMARY_P (vbase_binfo
) = 1;
1445 /* If we've discovered that this virtual base is an indirect
1446 primary base, then we can move on to the next virtual
1448 if (BINFO_INDIRECT_PRIMARY_P (vbase_binfo
))
1453 /* A "nearly-empty" virtual base class can be the primary base
1454 class, if no non-virtual polymorphic base can be found. */
1455 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
1457 /* If not NULL, this is the best primary base candidate we have
1459 tree candidate
= NULL_TREE
;
1462 /* Loop over the baseclasses. */
1463 for (base_binfo
= TYPE_BINFO (t
);
1465 base_binfo
= TREE_CHAIN (base_binfo
))
1467 tree basetype
= BINFO_TYPE (base_binfo
);
1469 if (TREE_VIA_VIRTUAL (base_binfo
)
1470 && CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1472 /* If this is not an indirect primary base, then it's
1473 definitely our primary base. */
1474 if (!BINFO_INDIRECT_PRIMARY_P (base_binfo
))
1476 candidate
= base_binfo
;
1480 /* If this is an indirect primary base, it still could be
1481 our primary base -- unless we later find there's another
1482 nearly-empty virtual base that isn't an indirect
1485 candidate
= base_binfo
;
1489 /* If we've got a primary base, use it. */
1492 set_primary_base (t
, candidate
);
1493 CLASSTYPE_VFIELDS (t
)
1494 = copy_list (CLASSTYPE_VFIELDS (BINFO_TYPE (candidate
)));
1498 /* Mark the primary base classes at this point. */
1499 mark_primary_bases (t
);
1502 /* Set memoizing fields and bits of T (and its variants) for later
1506 finish_struct_bits (tree t
)
1508 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1510 /* Fix up variants (if any). */
1511 tree variants
= TYPE_NEXT_VARIANT (t
);
1514 /* These fields are in the _TYPE part of the node, not in
1515 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1516 TYPE_HAS_CONSTRUCTOR (variants
) = TYPE_HAS_CONSTRUCTOR (t
);
1517 TYPE_HAS_DESTRUCTOR (variants
) = TYPE_HAS_DESTRUCTOR (t
);
1518 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1519 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1520 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1522 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (variants
)
1523 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t
);
1524 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1525 TYPE_USES_VIRTUAL_BASECLASSES (variants
) = TYPE_USES_VIRTUAL_BASECLASSES (t
);
1526 /* Copy whatever these are holding today. */
1527 TYPE_MIN_VALUE (variants
) = TYPE_MIN_VALUE (t
);
1528 TYPE_MAX_VALUE (variants
) = TYPE_MAX_VALUE (t
);
1529 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1530 TYPE_SIZE (variants
) = TYPE_SIZE (t
);
1531 TYPE_SIZE_UNIT (variants
) = TYPE_SIZE_UNIT (t
);
1532 variants
= TYPE_NEXT_VARIANT (variants
);
1535 if (n_baseclasses
&& TYPE_POLYMORPHIC_P (t
))
1536 /* For a class w/o baseclasses, `finish_struct' has set
1537 CLASS_TYPE_ABSTRACT_VIRTUALS correctly (by
1538 definition). Similarly for a class whose base classes do not
1539 have vtables. When neither of these is true, we might have
1540 removed abstract virtuals (by providing a definition), added
1541 some (by declaring new ones), or redeclared ones from a base
1542 class. We need to recalculate what's really an abstract virtual
1543 at this point (by looking in the vtables). */
1544 get_pure_virtuals (t
);
1548 /* Notice whether this class has type conversion functions defined. */
1549 tree binfo
= TYPE_BINFO (t
);
1550 tree binfos
= BINFO_BASETYPES (binfo
);
1553 for (i
= n_baseclasses
-1; i
>= 0; i
--)
1555 basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, i
));
1557 TYPE_HAS_CONVERSION (t
) |= TYPE_HAS_CONVERSION (basetype
);
1561 /* If this type has a copy constructor or a destructor, force its mode to
1562 be BLKmode, and force its TREE_ADDRESSABLE bit to be nonzero. This
1563 will cause it to be passed by invisible reference and prevent it from
1564 being returned in a register. */
1565 if (! TYPE_HAS_TRIVIAL_INIT_REF (t
) || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1568 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1569 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1571 TYPE_MODE (variants
) = BLKmode
;
1572 TREE_ADDRESSABLE (variants
) = 1;
1577 /* Issue warnings about T having private constructors, but no friends,
1580 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1581 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1582 non-private static member functions. */
1585 maybe_warn_about_overly_private_class (tree t
)
1587 int has_member_fn
= 0;
1588 int has_nonprivate_method
= 0;
1591 if (!warn_ctor_dtor_privacy
1592 /* If the class has friends, those entities might create and
1593 access instances, so we should not warn. */
1594 || (CLASSTYPE_FRIEND_CLASSES (t
)
1595 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1596 /* We will have warned when the template was declared; there's
1597 no need to warn on every instantiation. */
1598 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1599 /* There's no reason to even consider warning about this
1603 /* We only issue one warning, if more than one applies, because
1604 otherwise, on code like:
1607 // Oops - forgot `public:'
1613 we warn several times about essentially the same problem. */
1615 /* Check to see if all (non-constructor, non-destructor) member
1616 functions are private. (Since there are no friends or
1617 non-private statics, we can't ever call any of the private member
1619 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
1620 /* We're not interested in compiler-generated methods; they don't
1621 provide any way to call private members. */
1622 if (!DECL_ARTIFICIAL (fn
))
1624 if (!TREE_PRIVATE (fn
))
1626 if (DECL_STATIC_FUNCTION_P (fn
))
1627 /* A non-private static member function is just like a
1628 friend; it can create and invoke private member
1629 functions, and be accessed without a class
1633 has_nonprivate_method
= 1;
1634 /* Keep searching for a static member function. */
1636 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1640 if (!has_nonprivate_method
&& has_member_fn
)
1642 /* There are no non-private methods, and there's at least one
1643 private member function that isn't a constructor or
1644 destructor. (If all the private members are
1645 constructors/destructors we want to use the code below that
1646 issues error messages specifically referring to
1647 constructors/destructors.) */
1649 tree binfo
= TYPE_BINFO (t
);
1651 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); i
++)
1652 if (BINFO_BASEACCESS (binfo
, i
) != access_private_node
)
1654 has_nonprivate_method
= 1;
1657 if (!has_nonprivate_method
)
1659 warning ("all member functions in class `%T' are private", t
);
1664 /* Even if some of the member functions are non-private, the class
1665 won't be useful for much if all the constructors or destructors
1666 are private: such an object can never be created or destroyed. */
1667 if (TYPE_HAS_DESTRUCTOR (t
)
1668 && TREE_PRIVATE (CLASSTYPE_DESTRUCTORS (t
)))
1670 warning ("`%#T' only defines a private destructor and has no friends",
1675 if (TYPE_HAS_CONSTRUCTOR (t
))
1677 int nonprivate_ctor
= 0;
1679 /* If a non-template class does not define a copy
1680 constructor, one is defined for it, enabling it to avoid
1681 this warning. For a template class, this does not
1682 happen, and so we would normally get a warning on:
1684 template <class T> class C { private: C(); };
1686 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1687 complete non-template or fully instantiated classes have this
1689 if (!TYPE_HAS_INIT_REF (t
))
1690 nonprivate_ctor
= 1;
1692 for (fn
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), 0);
1696 tree ctor
= OVL_CURRENT (fn
);
1697 /* Ideally, we wouldn't count copy constructors (or, in
1698 fact, any constructor that takes an argument of the
1699 class type as a parameter) because such things cannot
1700 be used to construct an instance of the class unless
1701 you already have one. But, for now at least, we're
1703 if (! TREE_PRIVATE (ctor
))
1705 nonprivate_ctor
= 1;
1710 if (nonprivate_ctor
== 0)
1712 warning ("`%#T' only defines private constructors and has no friends",
1720 gt_pointer_operator new_value
;
1724 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1727 method_name_cmp (const void* m1_p
, const void* m2_p
)
1729 const tree
*const m1
= m1_p
;
1730 const tree
*const m2
= m2_p
;
1732 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1734 if (*m1
== NULL_TREE
)
1736 if (*m2
== NULL_TREE
)
1738 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1743 /* This routine compares two fields like method_name_cmp but using the
1744 pointer operator in resort_field_decl_data. */
1747 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1749 const tree
*const m1
= m1_p
;
1750 const tree
*const m2
= m2_p
;
1751 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1753 if (*m1
== NULL_TREE
)
1755 if (*m2
== NULL_TREE
)
1758 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1759 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1760 resort_data
.new_value (&d1
, resort_data
.cookie
);
1761 resort_data
.new_value (&d2
, resort_data
.cookie
);
1768 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1771 resort_type_method_vec (void* obj
,
1772 void* orig_obj ATTRIBUTE_UNUSED
,
1773 gt_pointer_operator new_value
,
1776 tree method_vec
= obj
;
1777 int len
= TREE_VEC_LENGTH (method_vec
);
1780 /* The type conversion ops have to live at the front of the vec, so we
1782 for (slot
= 2; slot
< len
; ++slot
)
1784 tree fn
= TREE_VEC_ELT (method_vec
, slot
);
1786 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1791 resort_data
.new_value
= new_value
;
1792 resort_data
.cookie
= cookie
;
1793 qsort (&TREE_VEC_ELT (method_vec
, slot
), len
- slot
, sizeof (tree
),
1794 resort_method_name_cmp
);
1798 /* Warn about duplicate methods in fn_fields. Also compact method
1799 lists so that lookup can be made faster.
1801 Data Structure: List of method lists. The outer list is a
1802 TREE_LIST, whose TREE_PURPOSE field is the field name and the
1803 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
1804 links the entire list of methods for TYPE_METHODS. Friends are
1805 chained in the same way as member functions (? TREE_CHAIN or
1806 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
1807 list. That allows them to be quickly deleted, and requires no
1810 Sort methods that are not special (i.e., constructors, destructors,
1811 and type conversion operators) so that we can find them faster in
1815 finish_struct_methods (tree t
)
1821 if (!TYPE_METHODS (t
))
1823 /* Clear these for safety; perhaps some parsing error could set
1824 these incorrectly. */
1825 TYPE_HAS_CONSTRUCTOR (t
) = 0;
1826 TYPE_HAS_DESTRUCTOR (t
) = 0;
1827 CLASSTYPE_METHOD_VEC (t
) = NULL_TREE
;
1831 method_vec
= CLASSTYPE_METHOD_VEC (t
);
1832 my_friendly_assert (method_vec
!= NULL_TREE
, 19991215);
1833 len
= TREE_VEC_LENGTH (method_vec
);
1835 /* First fill in entry 0 with the constructors, entry 1 with destructors,
1836 and the next few with type conversion operators (if any). */
1837 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
1838 fn_fields
= TREE_CHAIN (fn_fields
))
1839 /* Clear out this flag. */
1840 DECL_IN_AGGR_P (fn_fields
) = 0;
1842 if (TYPE_HAS_DESTRUCTOR (t
) && !CLASSTYPE_DESTRUCTORS (t
))
1843 /* We thought there was a destructor, but there wasn't. Some
1844 parse errors cause this anomalous situation. */
1845 TYPE_HAS_DESTRUCTOR (t
) = 0;
1847 /* Issue warnings about private constructors and such. If there are
1848 no methods, then some public defaults are generated. */
1849 maybe_warn_about_overly_private_class (t
);
1851 /* Now sort the methods. */
1852 while (len
> 2 && TREE_VEC_ELT (method_vec
, len
-1) == NULL_TREE
)
1854 TREE_VEC_LENGTH (method_vec
) = len
;
1856 /* The type conversion ops have to live at the front of the vec, so we
1858 for (slot
= 2; slot
< len
; ++slot
)
1860 tree fn
= TREE_VEC_ELT (method_vec
, slot
);
1862 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1866 qsort (&TREE_VEC_ELT (method_vec
, slot
), len
-slot
, sizeof (tree
),
1870 /* Make BINFO's vtable have N entries, including RTTI entries,
1871 vbase and vcall offsets, etc. Set its type and call the backend
1875 layout_vtable_decl (tree binfo
, int n
)
1880 atype
= build_cplus_array_type (vtable_entry_type
,
1881 build_index_type (size_int (n
- 1)));
1882 layout_type (atype
);
1884 /* We may have to grow the vtable. */
1885 vtable
= get_vtbl_decl_for_binfo (binfo
);
1886 if (!same_type_p (TREE_TYPE (vtable
), atype
))
1888 TREE_TYPE (vtable
) = atype
;
1889 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
1890 layout_decl (vtable
, 0);
1894 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1895 have the same signature. */
1898 same_signature_p (tree fndecl
, tree base_fndecl
)
1900 /* One destructor overrides another if they are the same kind of
1902 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
1903 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
1905 /* But a non-destructor never overrides a destructor, nor vice
1906 versa, nor do different kinds of destructors override
1907 one-another. For example, a complete object destructor does not
1908 override a deleting destructor. */
1909 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
1912 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
1913 || (DECL_CONV_FN_P (fndecl
)
1914 && DECL_CONV_FN_P (base_fndecl
)
1915 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
1916 DECL_CONV_FN_TYPE (base_fndecl
))))
1918 tree types
, base_types
;
1919 types
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1920 base_types
= TYPE_ARG_TYPES (TREE_TYPE (base_fndecl
));
1921 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types
)))
1922 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types
))))
1923 && compparms (TREE_CHAIN (base_types
), TREE_CHAIN (types
)))
1929 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1933 base_derived_from (tree derived
, tree base
)
1937 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
1939 if (probe
== derived
)
1941 else if (TREE_VIA_VIRTUAL (probe
))
1942 /* If we meet a virtual base, we can't follow the inheritance
1943 any more. See if the complete type of DERIVED contains
1944 such a virtual base. */
1945 return purpose_member (BINFO_TYPE (probe
),
1946 CLASSTYPE_VBASECLASSES (BINFO_TYPE (derived
)))
1952 typedef struct find_final_overrider_data_s
{
1953 /* The function for which we are trying to find a final overrider. */
1955 /* The base class in which the function was declared. */
1956 tree declaring_base
;
1957 /* The most derived class in the hierarchy. */
1958 tree most_derived_type
;
1959 /* The candidate overriders. */
1961 /* Binfos which inherited virtually on the current path. */
1963 } find_final_overrider_data
;
1965 /* Called from find_final_overrider via dfs_walk. */
1968 dfs_find_final_overrider (tree binfo
, void* data
)
1970 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
1972 if (binfo
== ffod
->declaring_base
)
1974 /* We've found a path to the declaring base. Walk the path from
1975 derived to base, looking for an overrider for FN. */
1976 tree path
, probe
, vpath
;
1978 /* Build the path, using the inheritance chain and record of
1979 virtual inheritance. */
1980 for (path
= NULL_TREE
, probe
= binfo
, vpath
= ffod
->vpath
;;)
1982 path
= tree_cons (NULL_TREE
, probe
, path
);
1983 if (same_type_p (BINFO_TYPE (probe
), ffod
->most_derived_type
))
1985 if (TREE_VIA_VIRTUAL (probe
))
1987 probe
= TREE_VALUE (vpath
);
1988 vpath
= TREE_CHAIN (vpath
);
1991 probe
= BINFO_INHERITANCE_CHAIN (probe
);
1993 /* Now walk path, looking for overrides. */
1994 for (; path
; path
= TREE_CHAIN (path
))
1996 tree method
= look_for_overrides_here
1997 (BINFO_TYPE (TREE_VALUE (path
)), ffod
->fn
);
2001 tree
*candidate
= &ffod
->candidates
;
2002 path
= TREE_VALUE (path
);
2004 /* Remove any candidates overridden by this new function. */
2007 /* If *CANDIDATE overrides METHOD, then METHOD
2008 cannot override anything else on the list. */
2009 if (base_derived_from (TREE_VALUE (*candidate
), path
))
2011 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2012 if (base_derived_from (path
, TREE_VALUE (*candidate
)))
2013 *candidate
= TREE_CHAIN (*candidate
);
2015 candidate
= &TREE_CHAIN (*candidate
);
2018 /* Add the new function. */
2019 ffod
->candidates
= tree_cons (method
, path
, ffod
->candidates
);
2029 dfs_find_final_overrider_q (tree derived
, int ix
, void *data
)
2031 tree binfo
= BINFO_BASETYPE (derived
, ix
);
2032 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2034 if (TREE_VIA_VIRTUAL (binfo
))
2035 ffod
->vpath
= tree_cons (NULL_TREE
, derived
, ffod
->vpath
);
2041 dfs_find_final_overrider_post (tree binfo
, void *data
)
2043 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2045 if (TREE_VIA_VIRTUAL (binfo
) && TREE_CHAIN (ffod
->vpath
))
2046 ffod
->vpath
= TREE_CHAIN (ffod
->vpath
);
2051 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2052 FN and whose TREE_VALUE is the binfo for the base where the
2053 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2054 DERIVED) is the base object in which FN is declared. */
2057 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2059 find_final_overrider_data ffod
;
2061 /* Getting this right is a little tricky. This is valid:
2063 struct S { virtual void f (); };
2064 struct T { virtual void f (); };
2065 struct U : public S, public T { };
2067 even though calling `f' in `U' is ambiguous. But,
2069 struct R { virtual void f(); };
2070 struct S : virtual public R { virtual void f (); };
2071 struct T : virtual public R { virtual void f (); };
2072 struct U : public S, public T { };
2074 is not -- there's no way to decide whether to put `S::f' or
2075 `T::f' in the vtable for `R'.
2077 The solution is to look at all paths to BINFO. If we find
2078 different overriders along any two, then there is a problem. */
2079 if (DECL_THUNK_P (fn
))
2080 fn
= THUNK_TARGET (fn
);
2083 ffod
.declaring_base
= binfo
;
2084 ffod
.most_derived_type
= BINFO_TYPE (derived
);
2085 ffod
.candidates
= NULL_TREE
;
2086 ffod
.vpath
= NULL_TREE
;
2088 dfs_walk_real (derived
,
2089 dfs_find_final_overrider
,
2090 dfs_find_final_overrider_post
,
2091 dfs_find_final_overrider_q
,
2094 /* If there was no winner, issue an error message. */
2095 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2097 error ("no unique final overrider for `%D' in `%T'", fn
,
2098 BINFO_TYPE (derived
));
2099 return error_mark_node
;
2102 return ffod
.candidates
;
2105 /* Return the index of the vcall offset for FN when TYPE is used as a
2109 get_vcall_index (tree fn
, tree type
)
2113 for (v
= CLASSTYPE_VCALL_INDICES (type
); v
; v
= TREE_CHAIN (v
))
2114 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (TREE_PURPOSE (v
)))
2115 || same_signature_p (fn
, TREE_PURPOSE (v
)))
2118 /* There should always be an appropriate index. */
2119 my_friendly_assert (v
, 20021103);
2121 return TREE_VALUE (v
);
2124 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2125 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
2126 corresponding position in the BINFO_VIRTUALS list. */
2129 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2137 tree overrider_fn
, overrider_target
;
2138 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2139 tree over_return
, base_return
;
2142 /* Find the nearest primary base (possibly binfo itself) which defines
2143 this function; this is the class the caller will convert to when
2144 calling FN through BINFO. */
2145 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2147 my_friendly_assert (b
, 20021227);
2148 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2151 /* The nearest definition is from a lost primary. */
2152 if (BINFO_LOST_PRIMARY_P (b
))
2157 /* Find the final overrider. */
2158 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2159 if (overrider
== error_mark_node
)
2161 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2163 /* Check for adjusting covariant return types. */
2164 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2165 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2167 if (POINTER_TYPE_P (over_return
)
2168 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2169 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2170 && CLASS_TYPE_P (TREE_TYPE (base_return
)))
2172 /* If FN is a covariant thunk, we must figure out the adjustment
2173 to the final base FN was converting to. As OVERRIDER_TARGET might
2174 also be converting to the return type of FN, we have to
2175 combine the two conversions here. */
2176 tree fixed_offset
, virtual_offset
;
2178 if (DECL_THUNK_P (fn
))
2180 my_friendly_assert (DECL_RESULT_THUNK_P (fn
), 20031211);
2181 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2182 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2185 fixed_offset
= virtual_offset
= NULL_TREE
;
2188 /* Find the equivalent binfo within the return type of the
2189 overriding function. We will want the vbase offset from
2192 TREE_VALUE (purpose_member
2193 (BINFO_TYPE (virtual_offset
),
2194 CLASSTYPE_VBASECLASSES (TREE_TYPE (over_return
))));
2197 /* There was no existing virtual thunk (which takes
2202 thunk_binfo
= lookup_base (TREE_TYPE (over_return
),
2203 TREE_TYPE (base_return
),
2204 ba_check
| ba_quiet
, &kind
);
2206 if (thunk_binfo
&& (kind
== bk_via_virtual
2207 || !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2209 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2211 if (kind
== bk_via_virtual
)
2213 /* We convert via virtual base. Find the virtual
2214 base and adjust the fixed offset to be from there. */
2215 while (!TREE_VIA_VIRTUAL (thunk_binfo
))
2216 thunk_binfo
= BINFO_INHERITANCE_CHAIN (thunk_binfo
);
2218 virtual_offset
= thunk_binfo
;
2219 offset
= size_diffop
2221 (ssizetype
, BINFO_OFFSET (virtual_offset
)));
2224 /* There was an existing fixed offset, this must be
2225 from the base just converted to, and the base the
2226 FN was thunking to. */
2227 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2229 fixed_offset
= offset
;
2233 if (fixed_offset
|| virtual_offset
)
2234 /* Replace the overriding function with a covariant thunk. We
2235 will emit the overriding function in its own slot as
2237 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2238 fixed_offset
, virtual_offset
);
2241 my_friendly_assert (!DECL_THUNK_P (fn
), 20021231);
2243 /* Assume that we will produce a thunk that convert all the way to
2244 the final overrider, and not to an intermediate virtual base. */
2245 virtual_base
= NULL_TREE
;
2247 /* See if we can convert to an intermediate virtual base first, and then
2248 use the vcall offset located there to finish the conversion. */
2249 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2251 /* If we find the final overrider, then we can stop
2253 if (same_type_p (BINFO_TYPE (b
),
2254 BINFO_TYPE (TREE_VALUE (overrider
))))
2257 /* If we find a virtual base, and we haven't yet found the
2258 overrider, then there is a virtual base between the
2259 declaring base (first_defn) and the final overrider. */
2260 if (TREE_VIA_VIRTUAL (b
))
2267 if (overrider_fn
!= overrider_target
&& !virtual_base
)
2269 /* The ABI specifies that a covariant thunk includes a mangling
2270 for a this pointer adjustment. This-adjusting thunks that
2271 override a function from a virtual base have a vcall
2272 adjustment. When the virtual base in question is a primary
2273 virtual base, we know the adjustments are zero, (and in the
2274 non-covariant case, we would not use the thunk).
2275 Unfortunately we didn't notice this could happen, when
2276 designing the ABI and so never mandated that such a covariant
2277 thunk should be emitted. Because we must use the ABI mandated
2278 name, we must continue searching from the binfo where we
2279 found the most recent definition of the function, towards the
2280 primary binfo which first introduced the function into the
2281 vtable. If that enters a virtual base, we must use a vcall
2282 this-adjusting thunk. Bleah! */
2283 tree probe
= first_defn
;
2285 while ((probe
= get_primary_binfo (probe
))
2286 && (unsigned) list_length (BINFO_VIRTUALS (probe
)) > ix
)
2287 if (TREE_VIA_VIRTUAL (probe
))
2288 virtual_base
= probe
;
2291 /* Even if we find a virtual base, the correct delta is
2292 between the overrider and the binfo we're building a vtable
2294 goto virtual_covariant
;
2297 /* Compute the constant adjustment to the `this' pointer. The
2298 `this' pointer, when this function is called, will point at BINFO
2299 (or one of its primary bases, which are at the same offset). */
2301 /* The `this' pointer needs to be adjusted from the declaration to
2302 the nearest virtual base. */
2303 delta
= size_diffop (convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2304 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2306 /* If the nearest definition is in a lost primary, we don't need an
2307 entry in our vtable. Except possibly in a constructor vtable,
2308 if we happen to get our primary back. In that case, the offset
2309 will be zero, as it will be a primary base. */
2310 delta
= size_zero_node
;
2312 /* The `this' pointer needs to be adjusted from pointing to
2313 BINFO to pointing at the base where the final overrider
2316 delta
= size_diffop (convert (ssizetype
,
2317 BINFO_OFFSET (TREE_VALUE (overrider
))),
2318 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2320 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2323 BV_VCALL_INDEX (*virtuals
)
2324 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2327 /* Called from modify_all_vtables via dfs_walk. */
2330 dfs_modify_vtables (tree binfo
, void* data
)
2332 if (/* There's no need to modify the vtable for a non-virtual
2333 primary base; we're not going to use that vtable anyhow.
2334 We do still need to do this for virtual primary bases, as they
2335 could become non-primary in a construction vtable. */
2336 (!BINFO_PRIMARY_P (binfo
) || TREE_VIA_VIRTUAL (binfo
))
2337 /* Similarly, a base without a vtable needs no modification. */
2338 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo
)))
2340 tree t
= (tree
) data
;
2345 make_new_vtable (t
, binfo
);
2347 /* Now, go through each of the virtual functions in the virtual
2348 function table for BINFO. Find the final overrider, and
2349 update the BINFO_VIRTUALS list appropriately. */
2350 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2351 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2353 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2354 old_virtuals
= TREE_CHAIN (old_virtuals
))
2355 update_vtable_entry_for_fn (t
,
2357 BV_FN (old_virtuals
),
2361 BINFO_MARKED (binfo
) = 1;
2366 /* Update all of the primary and secondary vtables for T. Create new
2367 vtables as required, and initialize their RTTI information. Each
2368 of the functions in VIRTUALS is declared in T and may override a
2369 virtual function from a base class; find and modify the appropriate
2370 entries to point to the overriding functions. Returns a list, in
2371 declaration order, of the virtual functions that are declared in T,
2372 but do not appear in the primary base class vtable, and which
2373 should therefore be appended to the end of the vtable for T. */
2376 modify_all_vtables (tree t
, tree virtuals
)
2378 tree binfo
= TYPE_BINFO (t
);
2381 /* Update all of the vtables. */
2382 dfs_walk (binfo
, dfs_modify_vtables
, unmarkedp
, t
);
2383 dfs_walk (binfo
, dfs_unmark
, markedp
, t
);
2385 /* Add virtual functions not already in our primary vtable. These
2386 will be both those introduced by this class, and those overridden
2387 from secondary bases. It does not include virtuals merely
2388 inherited from secondary bases. */
2389 for (fnsp
= &virtuals
; *fnsp
; )
2391 tree fn
= TREE_VALUE (*fnsp
);
2393 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2394 || DECL_VINDEX (fn
) == error_mark_node
)
2396 /* We don't need to adjust the `this' pointer when
2397 calling this function. */
2398 BV_DELTA (*fnsp
) = integer_zero_node
;
2399 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2401 /* This is a function not already in our vtable. Keep it. */
2402 fnsp
= &TREE_CHAIN (*fnsp
);
2405 /* We've already got an entry for this function. Skip it. */
2406 *fnsp
= TREE_CHAIN (*fnsp
);
2412 /* Get the base virtual function declarations in T that have the
2416 get_basefndecls (tree name
, tree t
)
2419 tree base_fndecls
= NULL_TREE
;
2420 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
2423 /* Find virtual functions in T with the indicated NAME. */
2424 i
= lookup_fnfields_1 (t
, name
);
2426 for (methods
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), i
);
2428 methods
= OVL_NEXT (methods
))
2430 tree method
= OVL_CURRENT (methods
);
2432 if (TREE_CODE (method
) == FUNCTION_DECL
2433 && DECL_VINDEX (method
))
2434 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2438 return base_fndecls
;
2440 for (i
= 0; i
< n_baseclasses
; i
++)
2442 tree basetype
= TYPE_BINFO_BASETYPE (t
, i
);
2443 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2447 return base_fndecls
;
2450 /* If this declaration supersedes the declaration of
2451 a method declared virtual in the base class, then
2452 mark this field as being virtual as well. */
2455 check_for_override (tree decl
, tree ctype
)
2457 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2458 /* In [temp.mem] we have:
2460 A specialization of a member function template does not
2461 override a virtual function from a base class. */
2463 if ((DECL_DESTRUCTOR_P (decl
)
2464 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2465 || DECL_CONV_FN_P (decl
))
2466 && look_for_overrides (ctype
, decl
)
2467 && !DECL_STATIC_FUNCTION_P (decl
))
2468 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2469 the error_mark_node so that we know it is an overriding
2471 DECL_VINDEX (decl
) = decl
;
2473 if (DECL_VIRTUAL_P (decl
))
2475 if (!DECL_VINDEX (decl
))
2476 DECL_VINDEX (decl
) = error_mark_node
;
2477 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2481 /* Warn about hidden virtual functions that are not overridden in t.
2482 We know that constructors and destructors don't apply. */
2485 warn_hidden (tree t
)
2487 tree method_vec
= CLASSTYPE_METHOD_VEC (t
);
2488 int n_methods
= method_vec
? TREE_VEC_LENGTH (method_vec
) : 0;
2491 /* We go through each separately named virtual function. */
2492 for (i
= 2; i
< n_methods
&& TREE_VEC_ELT (method_vec
, i
); ++i
)
2500 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2501 have the same name. Figure out what name that is. */
2502 name
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec
, i
)));
2503 /* There are no possibly hidden functions yet. */
2504 base_fndecls
= NULL_TREE
;
2505 /* Iterate through all of the base classes looking for possibly
2506 hidden functions. */
2507 for (j
= 0; j
< CLASSTYPE_N_BASECLASSES (t
); j
++)
2509 tree basetype
= TYPE_BINFO_BASETYPE (t
, j
);
2510 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2514 /* If there are no functions to hide, continue. */
2518 /* Remove any overridden functions. */
2519 for (fns
= TREE_VEC_ELT (method_vec
, i
); fns
; fns
= OVL_NEXT (fns
))
2521 fndecl
= OVL_CURRENT (fns
);
2522 if (DECL_VINDEX (fndecl
))
2524 tree
*prev
= &base_fndecls
;
2527 /* If the method from the base class has the same
2528 signature as the method from the derived class, it
2529 has been overridden. */
2530 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2531 *prev
= TREE_CHAIN (*prev
);
2533 prev
= &TREE_CHAIN (*prev
);
2537 /* Now give a warning for all base functions without overriders,
2538 as they are hidden. */
2539 while (base_fndecls
)
2541 /* Here we know it is a hider, and no overrider exists. */
2542 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls
));
2543 cp_warning_at (" by `%D'",
2544 OVL_CURRENT (TREE_VEC_ELT (method_vec
, i
)));
2545 base_fndecls
= TREE_CHAIN (base_fndecls
);
2550 /* Check for things that are invalid. There are probably plenty of other
2551 things we should check for also. */
2554 finish_struct_anon (tree t
)
2558 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2560 if (TREE_STATIC (field
))
2562 if (TREE_CODE (field
) != FIELD_DECL
)
2565 if (DECL_NAME (field
) == NULL_TREE
2566 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2568 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2569 for (; elt
; elt
= TREE_CHAIN (elt
))
2571 /* We're generally only interested in entities the user
2572 declared, but we also find nested classes by noticing
2573 the TYPE_DECL that we create implicitly. You're
2574 allowed to put one anonymous union inside another,
2575 though, so we explicitly tolerate that. We use
2576 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2577 we also allow unnamed types used for defining fields. */
2578 if (DECL_ARTIFICIAL (elt
)
2579 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2580 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2583 if (constructor_name_p (DECL_NAME (elt
), t
))
2584 cp_pedwarn_at ("ISO C++ forbids member `%D' with same name as enclosing class",
2587 if (TREE_CODE (elt
) != FIELD_DECL
)
2589 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2594 if (TREE_PRIVATE (elt
))
2595 cp_pedwarn_at ("private member `%#D' in anonymous union",
2597 else if (TREE_PROTECTED (elt
))
2598 cp_pedwarn_at ("protected member `%#D' in anonymous union",
2601 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2602 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2608 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2609 will be used later during class template instantiation.
2610 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2611 a non-static member data (FIELD_DECL), a member function
2612 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2613 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2614 When FRIEND_P is nonzero, T is either a friend class
2615 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2616 (FUNCTION_DECL, TEMPLATE_DECL). */
2619 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2621 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2622 if (CLASSTYPE_TEMPLATE_INFO (type
))
2623 CLASSTYPE_DECL_LIST (type
)
2624 = tree_cons (friend_p
? NULL_TREE
: type
,
2625 t
, CLASSTYPE_DECL_LIST (type
));
2628 /* Create default constructors, assignment operators, and so forth for
2629 the type indicated by T, if they are needed.
2630 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
2631 CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, the
2632 class cannot have a default constructor, copy constructor taking a
2633 const reference argument, or an assignment operator taking a const
2634 reference, respectively. If a virtual destructor is created, its
2635 DECL is returned; otherwise the return value is NULL_TREE. */
2638 add_implicitly_declared_members (tree t
,
2639 int cant_have_default_ctor
,
2640 int cant_have_const_cctor
,
2641 int cant_have_const_assignment
)
2644 tree implicit_fns
= NULL_TREE
;
2645 tree virtual_dtor
= NULL_TREE
;
2648 ++adding_implicit_members
;
2651 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) && !TYPE_HAS_DESTRUCTOR (t
))
2653 default_fn
= implicitly_declare_fn (sfk_destructor
, t
, /*const_p=*/0);
2654 check_for_override (default_fn
, t
);
2656 /* If we couldn't make it work, then pretend we didn't need it. */
2657 if (default_fn
== void_type_node
)
2658 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 0;
2661 TREE_CHAIN (default_fn
) = implicit_fns
;
2662 implicit_fns
= default_fn
;
2664 if (DECL_VINDEX (default_fn
))
2665 virtual_dtor
= default_fn
;
2669 /* Any non-implicit destructor is non-trivial. */
2670 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) |= TYPE_HAS_DESTRUCTOR (t
);
2672 /* Default constructor. */
2673 if (! TYPE_HAS_CONSTRUCTOR (t
) && ! cant_have_default_ctor
)
2675 default_fn
= implicitly_declare_fn (sfk_constructor
, t
, /*const_p=*/0);
2676 TREE_CHAIN (default_fn
) = implicit_fns
;
2677 implicit_fns
= default_fn
;
2680 /* Copy constructor. */
2681 if (! TYPE_HAS_INIT_REF (t
) && ! TYPE_FOR_JAVA (t
))
2683 /* ARM 12.18: You get either X(X&) or X(const X&), but
2686 = implicitly_declare_fn (sfk_copy_constructor
, t
,
2687 /*const_p=*/!cant_have_const_cctor
);
2688 TREE_CHAIN (default_fn
) = implicit_fns
;
2689 implicit_fns
= default_fn
;
2692 /* Assignment operator. */
2693 if (! TYPE_HAS_ASSIGN_REF (t
) && ! TYPE_FOR_JAVA (t
))
2696 = implicitly_declare_fn (sfk_assignment_operator
, t
,
2697 /*const_p=*/!cant_have_const_assignment
);
2698 TREE_CHAIN (default_fn
) = implicit_fns
;
2699 implicit_fns
= default_fn
;
2702 /* Now, hook all of the new functions on to TYPE_METHODS,
2703 and add them to the CLASSTYPE_METHOD_VEC. */
2704 for (f
= &implicit_fns
; *f
; f
= &TREE_CHAIN (*f
))
2706 add_method (t
, *f
, /*error_p=*/0);
2707 maybe_add_class_template_decl_list (current_class_type
, *f
, /*friend_p=*/0);
2709 if (abi_version_at_least (2))
2710 /* G++ 3.2 put the implicit destructor at the *beginning* of the
2711 list, which cause the destructor to be emitted in an incorrect
2712 location in the vtable. */
2713 TYPE_METHODS (t
) = chainon (TYPE_METHODS (t
), implicit_fns
);
2716 if (warn_abi
&& virtual_dtor
)
2717 warning ("vtable layout for class `%T' may not be ABI-compliant "
2718 "and may change in a future version of GCC due to implicit "
2719 "virtual destructor",
2721 *f
= TYPE_METHODS (t
);
2722 TYPE_METHODS (t
) = implicit_fns
;
2725 --adding_implicit_members
;
2728 /* Subroutine of finish_struct_1. Recursively count the number of fields
2729 in TYPE, including anonymous union members. */
2732 count_fields (tree fields
)
2736 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
2738 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
2739 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
2746 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2747 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2750 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
2753 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
2755 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
2756 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
2758 field_vec
->elts
[idx
++] = x
;
2763 /* FIELD is a bit-field. We are finishing the processing for its
2764 enclosing type. Issue any appropriate messages and set appropriate
2768 check_bitfield_decl (tree field
)
2770 tree type
= TREE_TYPE (field
);
2773 /* Detect invalid bit-field type. */
2774 if (DECL_INITIAL (field
)
2775 && ! INTEGRAL_TYPE_P (TREE_TYPE (field
)))
2777 cp_error_at ("bit-field `%#D' with non-integral type", field
);
2778 w
= error_mark_node
;
2781 /* Detect and ignore out of range field width. */
2782 if (DECL_INITIAL (field
))
2784 w
= DECL_INITIAL (field
);
2786 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2789 /* detect invalid field size. */
2790 if (TREE_CODE (w
) == CONST_DECL
)
2791 w
= DECL_INITIAL (w
);
2793 w
= decl_constant_value (w
);
2795 if (TREE_CODE (w
) != INTEGER_CST
)
2797 cp_error_at ("bit-field `%D' width not an integer constant",
2799 w
= error_mark_node
;
2801 else if (tree_int_cst_sgn (w
) < 0)
2803 cp_error_at ("negative width in bit-field `%D'", field
);
2804 w
= error_mark_node
;
2806 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
2808 cp_error_at ("zero width for bit-field `%D'", field
);
2809 w
= error_mark_node
;
2811 else if (compare_tree_int (w
, TYPE_PRECISION (type
)) > 0
2812 && TREE_CODE (type
) != ENUMERAL_TYPE
2813 && TREE_CODE (type
) != BOOLEAN_TYPE
)
2814 cp_warning_at ("width of `%D' exceeds its type", field
);
2815 else if (TREE_CODE (type
) == ENUMERAL_TYPE
2816 && (0 > compare_tree_int (w
,
2817 min_precision (TYPE_MIN_VALUE (type
),
2818 TREE_UNSIGNED (type
)))
2819 || 0 > compare_tree_int (w
,
2821 (TYPE_MAX_VALUE (type
),
2822 TREE_UNSIGNED (type
)))))
2823 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
2827 /* Remove the bit-field width indicator so that the rest of the
2828 compiler does not treat that value as an initializer. */
2829 DECL_INITIAL (field
) = NULL_TREE
;
2831 if (w
!= error_mark_node
)
2833 DECL_SIZE (field
) = convert (bitsizetype
, w
);
2834 DECL_BIT_FIELD (field
) = 1;
2838 /* Non-bit-fields are aligned for their type. */
2839 DECL_BIT_FIELD (field
) = 0;
2840 CLEAR_DECL_C_BIT_FIELD (field
);
2844 /* FIELD is a non bit-field. We are finishing the processing for its
2845 enclosing type T. Issue any appropriate messages and set appropriate
2849 check_field_decl (tree field
,
2851 int* cant_have_const_ctor
,
2852 int* cant_have_default_ctor
,
2853 int* no_const_asn_ref
,
2854 int* any_default_members
)
2856 tree type
= strip_array_types (TREE_TYPE (field
));
2858 /* An anonymous union cannot contain any fields which would change
2859 the settings of CANT_HAVE_CONST_CTOR and friends. */
2860 if (ANON_UNION_TYPE_P (type
))
2862 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2863 structs. So, we recurse through their fields here. */
2864 else if (ANON_AGGR_TYPE_P (type
))
2868 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
2869 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
2870 check_field_decl (fields
, t
, cant_have_const_ctor
,
2871 cant_have_default_ctor
, no_const_asn_ref
,
2872 any_default_members
);
2874 /* Check members with class type for constructors, destructors,
2876 else if (CLASS_TYPE_P (type
))
2878 /* Never let anything with uninheritable virtuals
2879 make it through without complaint. */
2880 abstract_virtuals_error (field
, type
);
2882 if (TREE_CODE (t
) == UNION_TYPE
)
2884 if (TYPE_NEEDS_CONSTRUCTING (type
))
2885 cp_error_at ("member `%#D' with constructor not allowed in union",
2887 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
2888 cp_error_at ("member `%#D' with destructor not allowed in union",
2890 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
2891 cp_error_at ("member `%#D' with copy assignment operator not allowed in union",
2896 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
2897 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
2898 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
2899 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type
);
2900 TYPE_HAS_COMPLEX_INIT_REF (t
) |= TYPE_HAS_COMPLEX_INIT_REF (type
);
2903 if (!TYPE_HAS_CONST_INIT_REF (type
))
2904 *cant_have_const_ctor
= 1;
2906 if (!TYPE_HAS_CONST_ASSIGN_REF (type
))
2907 *no_const_asn_ref
= 1;
2909 if (TYPE_HAS_CONSTRUCTOR (type
)
2910 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2911 *cant_have_default_ctor
= 1;
2913 if (DECL_INITIAL (field
) != NULL_TREE
)
2915 /* `build_class_init_list' does not recognize
2917 if (TREE_CODE (t
) == UNION_TYPE
&& any_default_members
!= 0)
2918 error ("multiple fields in union `%T' initialized", t
);
2919 *any_default_members
= 1;
2923 /* Check the data members (both static and non-static), class-scoped
2924 typedefs, etc., appearing in the declaration of T. Issue
2925 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2926 declaration order) of access declarations; each TREE_VALUE in this
2927 list is a USING_DECL.
2929 In addition, set the following flags:
2932 The class is empty, i.e., contains no non-static data members.
2934 CANT_HAVE_DEFAULT_CTOR_P
2935 This class cannot have an implicitly generated default
2938 CANT_HAVE_CONST_CTOR_P
2939 This class cannot have an implicitly generated copy constructor
2940 taking a const reference.
2942 CANT_HAVE_CONST_ASN_REF
2943 This class cannot have an implicitly generated assignment
2944 operator taking a const reference.
2946 All of these flags should be initialized before calling this
2949 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2950 fields can be added by adding to this chain. */
2953 check_field_decls (tree t
, tree
*access_decls
,
2954 int *cant_have_default_ctor_p
,
2955 int *cant_have_const_ctor_p
,
2956 int *no_const_asn_ref_p
)
2961 int any_default_members
;
2963 /* First, delete any duplicate fields. */
2964 delete_duplicate_fields (TYPE_FIELDS (t
));
2966 /* Assume there are no access declarations. */
2967 *access_decls
= NULL_TREE
;
2968 /* Assume this class has no pointer members. */
2970 /* Assume none of the members of this class have default
2972 any_default_members
= 0;
2974 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
2977 tree type
= TREE_TYPE (x
);
2979 next
= &TREE_CHAIN (x
);
2981 if (TREE_CODE (x
) == FIELD_DECL
)
2983 if (TYPE_PACKED (t
))
2985 if (!pod_type_p (TREE_TYPE (x
)) && !TYPE_PACKED (TREE_TYPE (x
)))
2987 ("ignoring packed attribute on unpacked non-POD field `%#D'",
2990 DECL_PACKED (x
) = 1;
2993 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
2994 /* We don't treat zero-width bitfields as making a class
3001 /* The class is non-empty. */
3002 CLASSTYPE_EMPTY_P (t
) = 0;
3003 /* The class is not even nearly empty. */
3004 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3005 /* If one of the data members contains an empty class,
3007 element_type
= strip_array_types (type
);
3008 if (CLASS_TYPE_P (element_type
)
3009 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3010 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3014 if (TREE_CODE (x
) == USING_DECL
)
3016 /* Prune the access declaration from the list of fields. */
3017 *field
= TREE_CHAIN (x
);
3019 /* Save the access declarations for our caller. */
3020 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3022 /* Since we've reset *FIELD there's no reason to skip to the
3028 if (TREE_CODE (x
) == TYPE_DECL
3029 || TREE_CODE (x
) == TEMPLATE_DECL
)
3032 /* If we've gotten this far, it's a data member, possibly static,
3033 or an enumerator. */
3035 DECL_CONTEXT (x
) = t
;
3037 /* ``A local class cannot have static data members.'' ARM 9.4 */
3038 if (current_function_decl
&& TREE_STATIC (x
))
3039 cp_error_at ("field `%D' in local class cannot be static", x
);
3041 /* Perform error checking that did not get done in
3043 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3045 cp_error_at ("field `%D' invalidly declared function type",
3047 type
= build_pointer_type (type
);
3048 TREE_TYPE (x
) = type
;
3050 else if (TREE_CODE (type
) == METHOD_TYPE
)
3052 cp_error_at ("field `%D' invalidly declared method type", x
);
3053 type
= build_pointer_type (type
);
3054 TREE_TYPE (x
) = type
;
3057 if (type
== error_mark_node
)
3060 /* When this goes into scope, it will be a non-local reference. */
3061 DECL_NONLOCAL (x
) = 1;
3063 if (TREE_CODE (x
) == CONST_DECL
)
3066 if (TREE_CODE (x
) == VAR_DECL
)
3068 if (TREE_CODE (t
) == UNION_TYPE
)
3069 /* Unions cannot have static members. */
3070 cp_error_at ("field `%D' declared static in union", x
);
3075 /* Now it can only be a FIELD_DECL. */
3077 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3078 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3080 /* If this is of reference type, check if it needs an init.
3081 Also do a little ANSI jig if necessary. */
3082 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3084 CLASSTYPE_NON_POD_P (t
) = 1;
3085 if (DECL_INITIAL (x
) == NULL_TREE
)
3086 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3088 /* ARM $12.6.2: [A member initializer list] (or, for an
3089 aggregate, initialization by a brace-enclosed list) is the
3090 only way to initialize nonstatic const and reference
3092 *cant_have_default_ctor_p
= 1;
3093 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) = 1;
3095 if (! TYPE_HAS_CONSTRUCTOR (t
) && CLASSTYPE_NON_AGGREGATE (t
)
3097 cp_warning_at ("non-static reference `%#D' in class without a constructor", x
);
3100 type
= strip_array_types (type
);
3102 if (TYPE_PTR_P (type
))
3105 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3106 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3108 if (! pod_type_p (type
))
3109 /* DR 148 now allows pointers to members (which are POD themselves),
3110 to be allowed in POD structs. */
3111 CLASSTYPE_NON_POD_P (t
) = 1;
3113 if (! zero_init_p (type
))
3114 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3116 /* If any field is const, the structure type is pseudo-const. */
3117 if (CP_TYPE_CONST_P (type
))
3119 C_TYPE_FIELDS_READONLY (t
) = 1;
3120 if (DECL_INITIAL (x
) == NULL_TREE
)
3121 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3123 /* ARM $12.6.2: [A member initializer list] (or, for an
3124 aggregate, initialization by a brace-enclosed list) is the
3125 only way to initialize nonstatic const and reference
3127 *cant_have_default_ctor_p
= 1;
3128 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) = 1;
3130 if (! TYPE_HAS_CONSTRUCTOR (t
) && CLASSTYPE_NON_AGGREGATE (t
)
3132 cp_warning_at ("non-static const member `%#D' in class without a constructor", x
);
3134 /* A field that is pseudo-const makes the structure likewise. */
3135 else if (CLASS_TYPE_P (type
))
3137 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3138 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3139 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3140 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3143 /* Core issue 80: A nonstatic data member is required to have a
3144 different name from the class iff the class has a
3145 user-defined constructor. */
3146 if (constructor_name_p (DECL_NAME (x
), t
) && TYPE_HAS_CONSTRUCTOR (t
))
3147 cp_pedwarn_at ("field `%#D' with same name as class", x
);
3149 /* We set DECL_C_BIT_FIELD in grokbitfield.
3150 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3151 if (DECL_C_BIT_FIELD (x
))
3152 check_bitfield_decl (x
);
3154 check_field_decl (x
, t
,
3155 cant_have_const_ctor_p
,
3156 cant_have_default_ctor_p
,
3158 &any_default_members
);
3161 /* Effective C++ rule 11. */
3162 if (has_pointers
&& warn_ecpp
&& TYPE_HAS_CONSTRUCTOR (t
)
3163 && ! (TYPE_HAS_INIT_REF (t
) && TYPE_HAS_ASSIGN_REF (t
)))
3165 warning ("`%#T' has pointer data members", t
);
3167 if (! TYPE_HAS_INIT_REF (t
))
3169 warning (" but does not override `%T(const %T&)'", t
, t
);
3170 if (! TYPE_HAS_ASSIGN_REF (t
))
3171 warning (" or `operator=(const %T&)'", t
);
3173 else if (! TYPE_HAS_ASSIGN_REF (t
))
3174 warning (" but does not override `operator=(const %T&)'", t
);
3178 /* Check anonymous struct/anonymous union fields. */
3179 finish_struct_anon (t
);
3181 /* We've built up the list of access declarations in reverse order.
3183 *access_decls
= nreverse (*access_decls
);
3186 /* If TYPE is an empty class type, records its OFFSET in the table of
3190 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3194 if (!is_empty_class (type
))
3197 /* Record the location of this empty object in OFFSETS. */
3198 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3200 n
= splay_tree_insert (offsets
,
3201 (splay_tree_key
) offset
,
3202 (splay_tree_value
) NULL_TREE
);
3203 n
->value
= ((splay_tree_value
)
3204 tree_cons (NULL_TREE
,
3211 /* Returns nonzero if TYPE is an empty class type and there is
3212 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3215 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3220 if (!is_empty_class (type
))
3223 /* Record the location of this empty object in OFFSETS. */
3224 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3228 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3229 if (same_type_p (TREE_VALUE (t
), type
))
3235 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3236 F for every subobject, passing it the type, offset, and table of
3237 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3240 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3241 than MAX_OFFSET will not be walked.
3243 If F returns a nonzero value, the traversal ceases, and that value
3244 is returned. Otherwise, returns zero. */
3247 walk_subobject_offsets (tree type
,
3248 subobject_offset_fn f
,
3255 tree type_binfo
= NULL_TREE
;
3257 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3259 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3264 if (abi_version_at_least (2))
3266 type
= BINFO_TYPE (type
);
3269 if (CLASS_TYPE_P (type
))
3275 /* Avoid recursing into objects that are not interesting. */
3276 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3279 /* Record the location of TYPE. */
3280 r
= (*f
) (type
, offset
, offsets
);
3284 /* Iterate through the direct base classes of TYPE. */
3286 type_binfo
= TYPE_BINFO (type
);
3287 for (i
= 0; i
< BINFO_N_BASETYPES (type_binfo
); ++i
)
3291 binfo
= BINFO_BASETYPE (type_binfo
, i
);
3293 if (abi_version_at_least (2)
3294 && TREE_VIA_VIRTUAL (binfo
))
3298 && TREE_VIA_VIRTUAL (binfo
)
3299 && !BINFO_PRIMARY_P (binfo
))
3302 if (!abi_version_at_least (2))
3303 binfo_offset
= size_binop (PLUS_EXPR
,
3305 BINFO_OFFSET (binfo
));
3309 /* We cannot rely on BINFO_OFFSET being set for the base
3310 class yet, but the offsets for direct non-virtual
3311 bases can be calculated by going back to the TYPE. */
3312 orig_binfo
= BINFO_BASETYPE (TYPE_BINFO (type
), i
);
3313 binfo_offset
= size_binop (PLUS_EXPR
,
3315 BINFO_OFFSET (orig_binfo
));
3318 r
= walk_subobject_offsets (binfo
,
3323 (abi_version_at_least (2)
3324 ? /*vbases_p=*/0 : vbases_p
));
3329 if (abi_version_at_least (2))
3333 /* Iterate through the virtual base classes of TYPE. In G++
3334 3.2, we included virtual bases in the direct base class
3335 loop above, which results in incorrect results; the
3336 correct offsets for virtual bases are only known when
3337 working with the most derived type. */
3339 for (vbase
= CLASSTYPE_VBASECLASSES (type
);
3341 vbase
= TREE_CHAIN (vbase
))
3343 binfo
= TREE_VALUE (vbase
);
3344 r
= walk_subobject_offsets (binfo
,
3346 size_binop (PLUS_EXPR
,
3348 BINFO_OFFSET (binfo
)),
3357 /* We still have to walk the primary base, if it is
3358 virtual. (If it is non-virtual, then it was walked
3360 vbase
= get_primary_binfo (type_binfo
);
3361 if (vbase
&& TREE_VIA_VIRTUAL (vbase
)
3362 && BINFO_PRIMARY_BASE_OF (vbase
) == type_binfo
)
3364 r
= (walk_subobject_offsets
3366 offsets
, max_offset
, /*vbases_p=*/0));
3373 /* Iterate through the fields of TYPE. */
3374 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3375 if (TREE_CODE (field
) == FIELD_DECL
&& !DECL_ARTIFICIAL (field
))
3379 if (abi_version_at_least (2))
3380 field_offset
= byte_position (field
);
3382 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3383 field_offset
= DECL_FIELD_OFFSET (field
);
3385 r
= walk_subobject_offsets (TREE_TYPE (field
),
3387 size_binop (PLUS_EXPR
,
3397 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3399 tree element_type
= strip_array_types (type
);
3400 tree domain
= TYPE_DOMAIN (type
);
3403 /* Avoid recursing into objects that are not interesting. */
3404 if (!CLASS_TYPE_P (element_type
)
3405 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3408 /* Step through each of the elements in the array. */
3409 for (index
= size_zero_node
;
3410 /* G++ 3.2 had an off-by-one error here. */
3411 (abi_version_at_least (2)
3412 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3413 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3414 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3416 r
= walk_subobject_offsets (TREE_TYPE (type
),
3424 offset
= size_binop (PLUS_EXPR
, offset
,
3425 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3426 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3427 there's no point in iterating through the remaining
3428 elements of the array. */
3429 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3437 /* Record all of the empty subobjects of TYPE (located at OFFSET) in
3438 OFFSETS. If VBASES_P is nonzero, virtual bases of TYPE are
3442 record_subobject_offsets (tree type
,
3447 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3448 offsets
, /*max_offset=*/NULL_TREE
, vbases_p
);
3451 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3452 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3453 virtual bases of TYPE are examined. */
3456 layout_conflict_p (tree type
,
3461 splay_tree_node max_node
;
3463 /* Get the node in OFFSETS that indicates the maximum offset where
3464 an empty subobject is located. */
3465 max_node
= splay_tree_max (offsets
);
3466 /* If there aren't any empty subobjects, then there's no point in
3467 performing this check. */
3471 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3472 offsets
, (tree
) (max_node
->key
),
3476 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3477 non-static data member of the type indicated by RLI. BINFO is the
3478 binfo corresponding to the base subobject, OFFSETS maps offsets to
3479 types already located at those offsets. This function determines
3480 the position of the DECL. */
3483 layout_nonempty_base_or_field (record_layout_info rli
,
3488 tree offset
= NULL_TREE
;
3494 /* For the purposes of determining layout conflicts, we want to
3495 use the class type of BINFO; TREE_TYPE (DECL) will be the
3496 CLASSTYPE_AS_BASE version, which does not contain entries for
3497 zero-sized bases. */
3498 type
= TREE_TYPE (binfo
);
3503 type
= TREE_TYPE (decl
);
3507 /* Try to place the field. It may take more than one try if we have
3508 a hard time placing the field without putting two objects of the
3509 same type at the same address. */
3512 struct record_layout_info_s old_rli
= *rli
;
3514 /* Place this field. */
3515 place_field (rli
, decl
);
3516 offset
= byte_position (decl
);
3518 /* We have to check to see whether or not there is already
3519 something of the same type at the offset we're about to use.
3523 struct T : public S { int i; };
3524 struct U : public S, public T {};
3526 Here, we put S at offset zero in U. Then, we can't put T at
3527 offset zero -- its S component would be at the same address
3528 as the S we already allocated. So, we have to skip ahead.
3529 Since all data members, including those whose type is an
3530 empty class, have nonzero size, any overlap can happen only
3531 with a direct or indirect base-class -- it can't happen with
3533 /* G++ 3.2 did not check for overlaps when placing a non-empty
3535 if (!abi_version_at_least (2) && binfo
&& TREE_VIA_VIRTUAL (binfo
))
3537 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
3540 /* Strip off the size allocated to this field. That puts us
3541 at the first place we could have put the field with
3542 proper alignment. */
3545 /* Bump up by the alignment required for the type. */
3547 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3549 ? CLASSTYPE_ALIGN (type
)
3550 : TYPE_ALIGN (type
)));
3551 normalize_rli (rli
);
3554 /* There was no conflict. We're done laying out this field. */
3558 /* Now that we know where it will be placed, update its
3560 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3561 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3562 this point because their BINFO_OFFSET is copied from another
3563 hierarchy. Therefore, we may not need to add the entire
3565 propagate_binfo_offsets (binfo
,
3566 size_diffop (convert (ssizetype
, offset
),
3568 BINFO_OFFSET (binfo
))));
3571 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3574 empty_base_at_nonzero_offset_p (tree type
,
3576 splay_tree offsets ATTRIBUTE_UNUSED
)
3578 return is_empty_class (type
) && !integer_zerop (offset
);
3581 /* Layout the empty base BINFO. EOC indicates the byte currently just
3582 past the end of the class, and should be correctly aligned for a
3583 class of the type indicated by BINFO; OFFSETS gives the offsets of
3584 the empty bases allocated so far. T is the most derived
3585 type. Return nonzero iff we added it at the end. */
3588 layout_empty_base (tree binfo
, tree eoc
, splay_tree offsets
)
3591 tree basetype
= BINFO_TYPE (binfo
);
3594 /* This routine should only be used for empty classes. */
3595 my_friendly_assert (is_empty_class (basetype
), 20000321);
3596 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
3598 if (!integer_zerop (BINFO_OFFSET (binfo
)))
3600 if (abi_version_at_least (2))
3601 propagate_binfo_offsets
3602 (binfo
, size_diffop (size_zero_node
, BINFO_OFFSET (binfo
)));
3604 warning ("offset of empty base `%T' may not be ABI-compliant and may"
3605 "change in a future version of GCC",
3606 BINFO_TYPE (binfo
));
3609 /* This is an empty base class. We first try to put it at offset
3611 if (layout_conflict_p (binfo
,
3612 BINFO_OFFSET (binfo
),
3616 /* That didn't work. Now, we move forward from the next
3617 available spot in the class. */
3619 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
3622 if (!layout_conflict_p (binfo
,
3623 BINFO_OFFSET (binfo
),
3626 /* We finally found a spot where there's no overlap. */
3629 /* There's overlap here, too. Bump along to the next spot. */
3630 propagate_binfo_offsets (binfo
, alignment
);
3636 /* Layout the the base given by BINFO in the class indicated by RLI.
3637 *BASE_ALIGN is a running maximum of the alignments of
3638 any base class. OFFSETS gives the location of empty base
3639 subobjects. T is the most derived type. Return nonzero if the new
3640 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3641 *NEXT_FIELD, unless BINFO is for an empty base class.
3643 Returns the location at which the next field should be inserted. */
3646 build_base_field (record_layout_info rli
, tree binfo
,
3647 splay_tree offsets
, tree
*next_field
)
3650 tree basetype
= BINFO_TYPE (binfo
);
3652 if (!COMPLETE_TYPE_P (basetype
))
3653 /* This error is now reported in xref_tag, thus giving better
3654 location information. */
3657 /* Place the base class. */
3658 if (!is_empty_class (basetype
))
3662 /* The containing class is non-empty because it has a non-empty
3664 CLASSTYPE_EMPTY_P (t
) = 0;
3666 /* Create the FIELD_DECL. */
3667 decl
= build_decl (FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
3668 DECL_ARTIFICIAL (decl
) = 1;
3669 DECL_FIELD_CONTEXT (decl
) = t
;
3670 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
3671 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
3672 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
3673 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
3674 DECL_IGNORED_P (decl
) = 1;
3676 /* Try to place the field. It may take more than one try if we
3677 have a hard time placing the field without putting two
3678 objects of the same type at the same address. */
3679 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
3680 /* Add the new FIELD_DECL to the list of fields for T. */
3681 TREE_CHAIN (decl
) = *next_field
;
3683 next_field
= &TREE_CHAIN (decl
);
3690 /* On some platforms (ARM), even empty classes will not be
3692 eoc
= round_up (rli_size_unit_so_far (rli
),
3693 CLASSTYPE_ALIGN_UNIT (basetype
));
3694 atend
= layout_empty_base (binfo
, eoc
, offsets
);
3695 /* A nearly-empty class "has no proper base class that is empty,
3696 not morally virtual, and at an offset other than zero." */
3697 if (!TREE_VIA_VIRTUAL (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
3700 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3701 /* The check above (used in G++ 3.2) is insufficient because
3702 an empty class placed at offset zero might itself have an
3703 empty base at a nonzero offset. */
3704 else if (walk_subobject_offsets (basetype
,
3705 empty_base_at_nonzero_offset_p
,
3708 /*max_offset=*/NULL_TREE
,
3711 if (abi_version_at_least (2))
3712 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3714 warning ("class `%T' will be considered nearly empty in a "
3715 "future version of GCC", t
);
3719 /* We do not create a FIELD_DECL for empty base classes because
3720 it might overlap some other field. We want to be able to
3721 create CONSTRUCTORs for the class by iterating over the
3722 FIELD_DECLs, and the back end does not handle overlapping
3725 /* An empty virtual base causes a class to be non-empty
3726 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3727 here because that was already done when the virtual table
3728 pointer was created. */
3731 /* Record the offsets of BINFO and its base subobjects. */
3732 record_subobject_offsets (binfo
,
3733 BINFO_OFFSET (binfo
),
3740 /* Layout all of the non-virtual base classes. Record empty
3741 subobjects in OFFSETS. T is the most derived type. Return nonzero
3742 if the type cannot be nearly empty. The fields created
3743 corresponding to the base classes will be inserted at
3747 build_base_fields (record_layout_info rli
,
3748 splay_tree offsets
, tree
*next_field
)
3750 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3753 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
3756 /* The primary base class is always allocated first. */
3757 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
3758 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
3759 offsets
, next_field
);
3761 /* Now allocate the rest of the bases. */
3762 for (i
= 0; i
< n_baseclasses
; ++i
)
3766 base_binfo
= BINFO_BASETYPE (TYPE_BINFO (t
), i
);
3768 /* The primary base was already allocated above, so we don't
3769 need to allocate it again here. */
3770 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
3773 /* Virtual bases are added at the end (a primary virtual base
3774 will have already been added). */
3775 if (TREE_VIA_VIRTUAL (base_binfo
))
3778 next_field
= build_base_field (rli
, base_binfo
,
3779 offsets
, next_field
);
3783 /* Go through the TYPE_METHODS of T issuing any appropriate
3784 diagnostics, figuring out which methods override which other
3785 methods, and so forth. */
3788 check_methods (tree t
)
3792 for (x
= TYPE_METHODS (t
); x
; x
= TREE_CHAIN (x
))
3794 /* If this was an evil function, don't keep it in class. */
3795 if (DECL_ASSEMBLER_NAME_SET_P (x
)
3796 && IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x
)))
3799 check_for_override (x
, t
);
3800 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
3801 cp_error_at ("initializer specified for non-virtual method `%D'", x
);
3803 /* The name of the field is the original field name
3804 Save this in auxiliary field for later overloading. */
3805 if (DECL_VINDEX (x
))
3807 TYPE_POLYMORPHIC_P (t
) = 1;
3808 if (DECL_PURE_VIRTUAL_P (x
))
3809 CLASSTYPE_PURE_VIRTUALS (t
)
3810 = tree_cons (NULL_TREE
, x
, CLASSTYPE_PURE_VIRTUALS (t
));
3815 /* FN is a constructor or destructor. Clone the declaration to create
3816 a specialized in-charge or not-in-charge version, as indicated by
3820 build_clone (tree fn
, tree name
)
3825 /* Copy the function. */
3826 clone
= copy_decl (fn
);
3827 /* Remember where this function came from. */
3828 DECL_CLONED_FUNCTION (clone
) = fn
;
3829 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
3830 /* Reset the function name. */
3831 DECL_NAME (clone
) = name
;
3832 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
3833 /* There's no pending inline data for this function. */
3834 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
3835 DECL_PENDING_INLINE_P (clone
) = 0;
3836 /* And it hasn't yet been deferred. */
3837 DECL_DEFERRED_FN (clone
) = 0;
3839 /* The base-class destructor is not virtual. */
3840 if (name
== base_dtor_identifier
)
3842 DECL_VIRTUAL_P (clone
) = 0;
3843 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
3844 DECL_VINDEX (clone
) = NULL_TREE
;
3847 /* If there was an in-charge parameter, drop it from the function
3849 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
3855 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
3856 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
3857 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
3858 /* Skip the `this' parameter. */
3859 parmtypes
= TREE_CHAIN (parmtypes
);
3860 /* Skip the in-charge parameter. */
3861 parmtypes
= TREE_CHAIN (parmtypes
);
3862 /* And the VTT parm, in a complete [cd]tor. */
3863 if (DECL_HAS_VTT_PARM_P (fn
)
3864 && ! DECL_NEEDS_VTT_PARM_P (clone
))
3865 parmtypes
= TREE_CHAIN (parmtypes
);
3866 /* If this is subobject constructor or destructor, add the vtt
3869 = build_method_type_directly (basetype
,
3870 TREE_TYPE (TREE_TYPE (clone
)),
3873 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
3876 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
3877 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
3880 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3881 aren't function parameters; those are the template parameters. */
3882 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
3884 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
3885 /* Remove the in-charge parameter. */
3886 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
3888 TREE_CHAIN (DECL_ARGUMENTS (clone
))
3889 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone
)));
3890 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
3892 /* And the VTT parm, in a complete [cd]tor. */
3893 if (DECL_HAS_VTT_PARM_P (fn
))
3895 if (DECL_NEEDS_VTT_PARM_P (clone
))
3896 DECL_HAS_VTT_PARM_P (clone
) = 1;
3899 TREE_CHAIN (DECL_ARGUMENTS (clone
))
3900 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone
)));
3901 DECL_HAS_VTT_PARM_P (clone
) = 0;
3905 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= TREE_CHAIN (parms
))
3907 DECL_CONTEXT (parms
) = clone
;
3908 cxx_dup_lang_specific_decl (parms
);
3912 /* Create the RTL for this function. */
3913 SET_DECL_RTL (clone
, NULL_RTX
);
3914 rest_of_decl_compilation (clone
, NULL
, /*top_level=*/1, at_eof
);
3916 /* Make it easy to find the CLONE given the FN. */
3917 TREE_CHAIN (clone
) = TREE_CHAIN (fn
);
3918 TREE_CHAIN (fn
) = clone
;
3920 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3921 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
3925 DECL_TEMPLATE_RESULT (clone
)
3926 = build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
3927 result
= DECL_TEMPLATE_RESULT (clone
);
3928 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
3929 DECL_TI_TEMPLATE (result
) = clone
;
3931 else if (DECL_DEFERRED_FN (fn
))
3937 /* Produce declarations for all appropriate clones of FN. If
3938 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3939 CLASTYPE_METHOD_VEC as well. */
3942 clone_function_decl (tree fn
, int update_method_vec_p
)
3946 /* Avoid inappropriate cloning. */
3948 && DECL_CLONED_FUNCTION (TREE_CHAIN (fn
)))
3951 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
3953 /* For each constructor, we need two variants: an in-charge version
3954 and a not-in-charge version. */
3955 clone
= build_clone (fn
, complete_ctor_identifier
);
3956 if (update_method_vec_p
)
3957 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
3958 clone
= build_clone (fn
, base_ctor_identifier
);
3959 if (update_method_vec_p
)
3960 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
3964 my_friendly_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
), 20000411);
3966 /* For each destructor, we need three variants: an in-charge
3967 version, a not-in-charge version, and an in-charge deleting
3968 version. We clone the deleting version first because that
3969 means it will go second on the TYPE_METHODS list -- and that
3970 corresponds to the correct layout order in the virtual
3973 For a non-virtual destructor, we do not build a deleting
3975 if (DECL_VIRTUAL_P (fn
))
3977 clone
= build_clone (fn
, deleting_dtor_identifier
);
3978 if (update_method_vec_p
)
3979 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
3981 clone
= build_clone (fn
, complete_dtor_identifier
);
3982 if (update_method_vec_p
)
3983 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
3984 clone
= build_clone (fn
, base_dtor_identifier
);
3985 if (update_method_vec_p
)
3986 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
3989 /* Note that this is an abstract function that is never emitted. */
3990 DECL_ABSTRACT (fn
) = 1;
3993 /* DECL is an in charge constructor, which is being defined. This will
3994 have had an in class declaration, from whence clones were
3995 declared. An out-of-class definition can specify additional default
3996 arguments. As it is the clones that are involved in overload
3997 resolution, we must propagate the information from the DECL to its
4001 adjust_clone_args (tree decl
)
4005 for (clone
= TREE_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION (clone
);
4006 clone
= TREE_CHAIN (clone
))
4008 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4009 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4010 tree decl_parms
, clone_parms
;
4012 clone_parms
= orig_clone_parms
;
4014 /* Skip the 'this' parameter. */
4015 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4016 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4018 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4019 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4020 if (DECL_HAS_VTT_PARM_P (decl
))
4021 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4023 clone_parms
= orig_clone_parms
;
4024 if (DECL_HAS_VTT_PARM_P (clone
))
4025 clone_parms
= TREE_CHAIN (clone_parms
);
4027 for (decl_parms
= orig_decl_parms
; decl_parms
;
4028 decl_parms
= TREE_CHAIN (decl_parms
),
4029 clone_parms
= TREE_CHAIN (clone_parms
))
4031 my_friendly_assert (same_type_p (TREE_TYPE (decl_parms
),
4032 TREE_TYPE (clone_parms
)), 20010424);
4034 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4036 /* A default parameter has been added. Adjust the
4037 clone's parameters. */
4038 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4039 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4042 clone_parms
= orig_decl_parms
;
4044 if (DECL_HAS_VTT_PARM_P (clone
))
4046 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4047 TREE_VALUE (orig_clone_parms
),
4049 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4051 type
= build_method_type_directly (basetype
,
4052 TREE_TYPE (TREE_TYPE (clone
)),
4055 type
= build_exception_variant (type
, exceptions
);
4056 TREE_TYPE (clone
) = type
;
4058 clone_parms
= NULL_TREE
;
4062 my_friendly_assert (!clone_parms
, 20010424);
4066 /* For each of the constructors and destructors in T, create an
4067 in-charge and not-in-charge variant. */
4070 clone_constructors_and_destructors (tree t
)
4074 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4076 if (!CLASSTYPE_METHOD_VEC (t
))
4079 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4080 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4081 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4082 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4085 /* Remove all zero-width bit-fields from T. */
4088 remove_zero_width_bit_fields (tree t
)
4092 fieldsp
= &TYPE_FIELDS (t
);
4095 if (TREE_CODE (*fieldsp
) == FIELD_DECL
4096 && DECL_C_BIT_FIELD (*fieldsp
)
4097 && DECL_INITIAL (*fieldsp
))
4098 *fieldsp
= TREE_CHAIN (*fieldsp
);
4100 fieldsp
= &TREE_CHAIN (*fieldsp
);
4104 /* Returns TRUE iff we need a cookie when dynamically allocating an
4105 array whose elements have the indicated class TYPE. */
4108 type_requires_array_cookie (tree type
)
4111 bool has_two_argument_delete_p
= false;
4113 my_friendly_assert (CLASS_TYPE_P (type
), 20010712);
4115 /* If there's a non-trivial destructor, we need a cookie. In order
4116 to iterate through the array calling the destructor for each
4117 element, we'll have to know how many elements there are. */
4118 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4121 /* If the usual deallocation function is a two-argument whose second
4122 argument is of type `size_t', then we have to pass the size of
4123 the array to the deallocation function, so we will need to store
4125 fns
= lookup_fnfields (TYPE_BINFO (type
),
4126 ansi_opname (VEC_DELETE_EXPR
),
4128 /* If there are no `operator []' members, or the lookup is
4129 ambiguous, then we don't need a cookie. */
4130 if (!fns
|| fns
== error_mark_node
)
4132 /* Loop through all of the functions. */
4133 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
4138 /* Select the current function. */
4139 fn
= OVL_CURRENT (fns
);
4140 /* See if this function is a one-argument delete function. If
4141 it is, then it will be the usual deallocation function. */
4142 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
4143 if (second_parm
== void_list_node
)
4145 /* Otherwise, if we have a two-argument function and the second
4146 argument is `size_t', it will be the usual deallocation
4147 function -- unless there is one-argument function, too. */
4148 if (TREE_CHAIN (second_parm
) == void_list_node
4149 && same_type_p (TREE_VALUE (second_parm
), sizetype
))
4150 has_two_argument_delete_p
= true;
4153 return has_two_argument_delete_p
;
4156 /* Check the validity of the bases and members declared in T. Add any
4157 implicitly-generated functions (like copy-constructors and
4158 assignment operators). Compute various flag bits (like
4159 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4160 level: i.e., independently of the ABI in use. */
4163 check_bases_and_members (tree t
)
4165 /* Nonzero if we are not allowed to generate a default constructor
4167 int cant_have_default_ctor
;
4168 /* Nonzero if the implicitly generated copy constructor should take
4169 a non-const reference argument. */
4170 int cant_have_const_ctor
;
4171 /* Nonzero if the the implicitly generated assignment operator
4172 should take a non-const reference argument. */
4173 int no_const_asn_ref
;
4176 /* By default, we use const reference arguments and generate default
4178 cant_have_default_ctor
= 0;
4179 cant_have_const_ctor
= 0;
4180 no_const_asn_ref
= 0;
4182 /* Check all the base-classes. */
4183 check_bases (t
, &cant_have_default_ctor
, &cant_have_const_ctor
,
4186 /* Check all the data member declarations. */
4187 check_field_decls (t
, &access_decls
,
4188 &cant_have_default_ctor
,
4189 &cant_have_const_ctor
,
4192 /* Check all the method declarations. */
4195 /* A nearly-empty class has to be vptr-containing; a nearly empty
4196 class contains just a vptr. */
4197 if (!TYPE_CONTAINS_VPTR_P (t
))
4198 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4200 /* Do some bookkeeping that will guide the generation of implicitly
4201 declared member functions. */
4202 TYPE_HAS_COMPLEX_INIT_REF (t
)
4203 |= (TYPE_HAS_INIT_REF (t
)
4204 || TYPE_USES_VIRTUAL_BASECLASSES (t
)
4205 || TYPE_POLYMORPHIC_P (t
));
4206 TYPE_NEEDS_CONSTRUCTING (t
)
4207 |= (TYPE_HAS_CONSTRUCTOR (t
)
4208 || TYPE_USES_VIRTUAL_BASECLASSES (t
)
4209 || TYPE_POLYMORPHIC_P (t
));
4210 CLASSTYPE_NON_AGGREGATE (t
) |= (TYPE_HAS_CONSTRUCTOR (t
)
4211 || TYPE_POLYMORPHIC_P (t
));
4212 CLASSTYPE_NON_POD_P (t
)
4213 |= (CLASSTYPE_NON_AGGREGATE (t
) || TYPE_HAS_DESTRUCTOR (t
)
4214 || TYPE_HAS_ASSIGN_REF (t
));
4215 TYPE_HAS_REAL_ASSIGN_REF (t
) |= TYPE_HAS_ASSIGN_REF (t
);
4216 TYPE_HAS_COMPLEX_ASSIGN_REF (t
)
4217 |= TYPE_HAS_ASSIGN_REF (t
) || TYPE_CONTAINS_VPTR_P (t
);
4219 /* Synthesize any needed methods. Note that methods will be synthesized
4220 for anonymous unions; grok_x_components undoes that. */
4221 add_implicitly_declared_members (t
, cant_have_default_ctor
,
4222 cant_have_const_ctor
,
4225 /* Create the in-charge and not-in-charge variants of constructors
4227 clone_constructors_and_destructors (t
);
4229 /* Process the using-declarations. */
4230 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
4231 handle_using_decl (TREE_VALUE (access_decls
), t
);
4233 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4234 finish_struct_methods (t
);
4236 /* Figure out whether or not we will need a cookie when dynamically
4237 allocating an array of this type. */
4238 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
4239 = type_requires_array_cookie (t
);
4242 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4243 accordingly. If a new vfield was created (because T doesn't have a
4244 primary base class), then the newly created field is returned. It
4245 is not added to the TYPE_FIELDS list; it is the caller's
4246 responsibility to do that. Accumulate declared virtual functions
4250 create_vtable_ptr (tree t
, tree
* virtuals_p
)
4254 /* Collect the virtual functions declared in T. */
4255 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
4256 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
4257 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
4259 tree new_virtual
= make_node (TREE_LIST
);
4261 BV_FN (new_virtual
) = fn
;
4262 BV_DELTA (new_virtual
) = integer_zero_node
;
4264 TREE_CHAIN (new_virtual
) = *virtuals_p
;
4265 *virtuals_p
= new_virtual
;
4268 /* If we couldn't find an appropriate base class, create a new field
4269 here. Even if there weren't any new virtual functions, we might need a
4270 new virtual function table if we're supposed to include vptrs in
4271 all classes that need them. */
4272 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
4274 /* We build this decl with vtbl_ptr_type_node, which is a
4275 `vtable_entry_type*'. It might seem more precise to use
4276 `vtable_entry_type (*)[N]' where N is the number of firtual
4277 functions. However, that would require the vtable pointer in
4278 base classes to have a different type than the vtable pointer
4279 in derived classes. We could make that happen, but that
4280 still wouldn't solve all the problems. In particular, the
4281 type-based alias analysis code would decide that assignments
4282 to the base class vtable pointer can't alias assignments to
4283 the derived class vtable pointer, since they have different
4284 types. Thus, in a derived class destructor, where the base
4285 class constructor was inlined, we could generate bad code for
4286 setting up the vtable pointer.
4288 Therefore, we use one type for all vtable pointers. We still
4289 use a type-correct type; it's just doesn't indicate the array
4290 bounds. That's better than using `void*' or some such; it's
4291 cleaner, and it let's the alias analysis code know that these
4292 stores cannot alias stores to void*! */
4295 field
= build_decl (FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
4296 SET_DECL_ASSEMBLER_NAME (field
, get_identifier (VFIELD_BASE
));
4297 DECL_VIRTUAL_P (field
) = 1;
4298 DECL_ARTIFICIAL (field
) = 1;
4299 DECL_FIELD_CONTEXT (field
) = t
;
4300 DECL_FCONTEXT (field
) = t
;
4302 TYPE_VFIELD (t
) = field
;
4304 /* This class is non-empty. */
4305 CLASSTYPE_EMPTY_P (t
) = 0;
4307 if (CLASSTYPE_N_BASECLASSES (t
))
4308 /* If there were any baseclasses, they can't possibly be at
4309 offset zero any more, because that's where the vtable
4310 pointer is. So, converting to a base class is going to
4312 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t
) = 1;
4320 /* Fixup the inline function given by INFO now that the class is
4324 fixup_pending_inline (tree fn
)
4326 if (DECL_PENDING_INLINE_INFO (fn
))
4328 tree args
= DECL_ARGUMENTS (fn
);
4331 DECL_CONTEXT (args
) = fn
;
4332 args
= TREE_CHAIN (args
);
4337 /* Fixup the inline methods and friends in TYPE now that TYPE is
4341 fixup_inline_methods (tree type
)
4343 tree method
= TYPE_METHODS (type
);
4345 if (method
&& TREE_CODE (method
) == TREE_VEC
)
4347 if (TREE_VEC_ELT (method
, 1))
4348 method
= TREE_VEC_ELT (method
, 1);
4349 else if (TREE_VEC_ELT (method
, 0))
4350 method
= TREE_VEC_ELT (method
, 0);
4352 method
= TREE_VEC_ELT (method
, 2);
4355 /* Do inline member functions. */
4356 for (; method
; method
= TREE_CHAIN (method
))
4357 fixup_pending_inline (method
);
4360 for (method
= CLASSTYPE_INLINE_FRIENDS (type
);
4362 method
= TREE_CHAIN (method
))
4363 fixup_pending_inline (TREE_VALUE (method
));
4364 CLASSTYPE_INLINE_FRIENDS (type
) = NULL_TREE
;
4367 /* Add OFFSET to all base types of BINFO which is a base in the
4368 hierarchy dominated by T.
4370 OFFSET, which is a type offset, is number of bytes. */
4373 propagate_binfo_offsets (tree binfo
, tree offset
)
4378 /* Update BINFO's offset. */
4379 BINFO_OFFSET (binfo
)
4380 = convert (sizetype
,
4381 size_binop (PLUS_EXPR
,
4382 convert (ssizetype
, BINFO_OFFSET (binfo
)),
4385 /* Find the primary base class. */
4386 primary_binfo
= get_primary_binfo (binfo
);
4388 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4390 for (i
= -1; i
< BINFO_N_BASETYPES (binfo
); ++i
)
4394 /* On the first time through the loop, do the primary base.
4395 Because the primary base need not be an immediate base, we
4396 must handle the primary base specially. */
4402 base_binfo
= primary_binfo
;
4406 base_binfo
= BINFO_BASETYPE (binfo
, i
);
4407 /* Don't do the primary base twice. */
4408 if (base_binfo
== primary_binfo
)
4412 /* Skip virtual bases that aren't our canonical primary base. */
4413 if (TREE_VIA_VIRTUAL (base_binfo
)
4414 && BINFO_PRIMARY_BASE_OF (base_binfo
) != binfo
)
4417 propagate_binfo_offsets (base_binfo
, offset
);
4421 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4422 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4423 empty subobjects of T. */
4426 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
4430 bool first_vbase
= true;
4433 if (CLASSTYPE_N_BASECLASSES (t
) == 0)
4436 if (!abi_version_at_least(2))
4438 /* In G++ 3.2, we incorrectly rounded the size before laying out
4439 the virtual bases. */
4440 finish_record_layout (rli
, /*free_p=*/false);
4441 #ifdef STRUCTURE_SIZE_BOUNDARY
4442 /* Packed structures don't need to have minimum size. */
4443 if (! TYPE_PACKED (t
))
4444 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
4446 rli
->offset
= TYPE_SIZE_UNIT (t
);
4447 rli
->bitpos
= bitsize_zero_node
;
4448 rli
->record_align
= TYPE_ALIGN (t
);
4451 /* Find the last field. The artificial fields created for virtual
4452 bases will go after the last extant field to date. */
4453 next_field
= &TYPE_FIELDS (t
);
4455 next_field
= &TREE_CHAIN (*next_field
);
4457 /* Go through the virtual bases, allocating space for each virtual
4458 base that is not already a primary base class. These are
4459 allocated in inheritance graph order. */
4460 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
4462 if (!TREE_VIA_VIRTUAL (vbase
))
4465 if (!BINFO_PRIMARY_P (vbase
))
4467 tree basetype
= TREE_TYPE (vbase
);
4469 /* This virtual base is not a primary base of any class in the
4470 hierarchy, so we have to add space for it. */
4471 next_field
= build_base_field (rli
, vbase
,
4472 offsets
, next_field
);
4474 /* If the first virtual base might have been placed at a
4475 lower address, had we started from CLASSTYPE_SIZE, rather
4476 than TYPE_SIZE, issue a warning. There can be both false
4477 positives and false negatives from this warning in rare
4478 cases; to deal with all the possibilities would probably
4479 require performing both layout algorithms and comparing
4480 the results which is not particularly tractable. */
4484 (size_binop (CEIL_DIV_EXPR
,
4485 round_up (CLASSTYPE_SIZE (t
),
4486 CLASSTYPE_ALIGN (basetype
)),
4488 BINFO_OFFSET (vbase
))))
4489 warning ("offset of virtual base `%T' is not ABI-compliant and may change in a future version of GCC",
4492 first_vbase
= false;
4497 /* Returns the offset of the byte just past the end of the base class
4501 end_of_base (tree binfo
)
4505 if (is_empty_class (BINFO_TYPE (binfo
)))
4506 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4507 allocate some space for it. It cannot have virtual bases, so
4508 TYPE_SIZE_UNIT is fine. */
4509 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
4511 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
4513 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
4516 /* Returns the offset of the byte just past the end of the base class
4517 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4518 only non-virtual bases are included. */
4521 end_of_class (tree t
, int include_virtuals_p
)
4523 tree result
= size_zero_node
;
4528 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (t
); ++i
)
4530 binfo
= BINFO_BASETYPE (TYPE_BINFO (t
), i
);
4532 if (!include_virtuals_p
4533 && TREE_VIA_VIRTUAL (binfo
)
4534 && BINFO_PRIMARY_BASE_OF (binfo
) != TYPE_BINFO (t
))
4537 offset
= end_of_base (binfo
);
4538 if (INT_CST_LT_UNSIGNED (result
, offset
))
4542 /* G++ 3.2 did not check indirect virtual bases. */
4543 if (abi_version_at_least (2) && include_virtuals_p
)
4544 for (binfo
= CLASSTYPE_VBASECLASSES (t
);
4546 binfo
= TREE_CHAIN (binfo
))
4548 offset
= end_of_base (TREE_VALUE (binfo
));
4549 if (INT_CST_LT_UNSIGNED (result
, offset
))
4556 /* Warn about bases of T that are inaccessible because they are
4557 ambiguous. For example:
4560 struct T : public S {};
4561 struct U : public S, public T {};
4563 Here, `(S*) new U' is not allowed because there are two `S'
4567 warn_about_ambiguous_bases (tree t
)
4573 /* Check direct bases. */
4574 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (t
); ++i
)
4576 basetype
= TYPE_BINFO_BASETYPE (t
, i
);
4578 if (!lookup_base (t
, basetype
, ba_ignore
| ba_quiet
, NULL
))
4579 warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
4583 /* Check for ambiguous virtual bases. */
4585 for (vbases
= CLASSTYPE_VBASECLASSES (t
);
4587 vbases
= TREE_CHAIN (vbases
))
4589 basetype
= BINFO_TYPE (TREE_VALUE (vbases
));
4591 if (!lookup_base (t
, basetype
, ba_ignore
| ba_quiet
, NULL
))
4592 warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
4597 /* Compare two INTEGER_CSTs K1 and K2. */
4600 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
4602 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4605 /* Increase the size indicated in RLI to account for empty classes
4606 that are "off the end" of the class. */
4609 include_empty_classes (record_layout_info rli
)
4614 /* It might be the case that we grew the class to allocate a
4615 zero-sized base class. That won't be reflected in RLI, yet,
4616 because we are willing to overlay multiple bases at the same
4617 offset. However, now we need to make sure that RLI is big enough
4618 to reflect the entire class. */
4619 eoc
= end_of_class (rli
->t
,
4620 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
4621 rli_size
= rli_size_unit_so_far (rli
);
4622 if (TREE_CODE (rli_size
) == INTEGER_CST
4623 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
4625 if (!abi_version_at_least (2))
4626 /* In version 1 of the ABI, the size of a class that ends with
4627 a bitfield was not rounded up to a whole multiple of a
4628 byte. Because rli_size_unit_so_far returns only the number
4629 of fully allocated bytes, any extra bits were not included
4631 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
4633 /* The size should have been rounded to a whole byte. */
4634 my_friendly_assert (tree_int_cst_equal (rli
->bitpos
,
4635 round_down (rli
->bitpos
,
4639 = size_binop (PLUS_EXPR
,
4641 size_binop (MULT_EXPR
,
4642 convert (bitsizetype
,
4643 size_binop (MINUS_EXPR
,
4645 bitsize_int (BITS_PER_UNIT
)));
4646 normalize_rli (rli
);
4650 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4651 BINFO_OFFSETs for all of the base-classes. Position the vtable
4652 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4655 layout_class_type (tree t
, tree
*virtuals_p
)
4657 tree non_static_data_members
;
4660 record_layout_info rli
;
4661 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4662 types that appear at that offset. */
4663 splay_tree empty_base_offsets
;
4664 /* True if the last field layed out was a bit-field. */
4665 bool last_field_was_bitfield
= false;
4666 /* The location at which the next field should be inserted. */
4668 /* T, as a base class. */
4671 /* Keep track of the first non-static data member. */
4672 non_static_data_members
= TYPE_FIELDS (t
);
4674 /* Start laying out the record. */
4675 rli
= start_record_layout (t
);
4677 /* If possible, we reuse the virtual function table pointer from one
4678 of our base classes. */
4679 determine_primary_base (t
);
4681 /* Create a pointer to our virtual function table. */
4682 vptr
= create_vtable_ptr (t
, virtuals_p
);
4684 /* The vptr is always the first thing in the class. */
4687 TREE_CHAIN (vptr
) = TYPE_FIELDS (t
);
4688 TYPE_FIELDS (t
) = vptr
;
4689 next_field
= &TREE_CHAIN (vptr
);
4690 place_field (rli
, vptr
);
4693 next_field
= &TYPE_FIELDS (t
);
4695 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4696 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
4698 build_base_fields (rli
, empty_base_offsets
, next_field
);
4700 /* Layout the non-static data members. */
4701 for (field
= non_static_data_members
; field
; field
= TREE_CHAIN (field
))
4706 /* We still pass things that aren't non-static data members to
4707 the back-end, in case it wants to do something with them. */
4708 if (TREE_CODE (field
) != FIELD_DECL
)
4710 place_field (rli
, field
);
4711 /* If the static data member has incomplete type, keep track
4712 of it so that it can be completed later. (The handling
4713 of pending statics in finish_record_layout is
4714 insufficient; consider:
4717 struct S2 { static S1 s1; };
4719 At this point, finish_record_layout will be called, but
4720 S1 is still incomplete.) */
4721 if (TREE_CODE (field
) == VAR_DECL
)
4722 maybe_register_incomplete_var (field
);
4726 type
= TREE_TYPE (field
);
4728 padding
= NULL_TREE
;
4730 /* If this field is a bit-field whose width is greater than its
4731 type, then there are some special rules for allocating
4733 if (DECL_C_BIT_FIELD (field
)
4734 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
4736 integer_type_kind itk
;
4738 bool was_unnamed_p
= false;
4739 /* We must allocate the bits as if suitably aligned for the
4740 longest integer type that fits in this many bits. type
4741 of the field. Then, we are supposed to use the left over
4742 bits as additional padding. */
4743 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
4744 if (INT_CST_LT (DECL_SIZE (field
),
4745 TYPE_SIZE (integer_types
[itk
])))
4748 /* ITK now indicates a type that is too large for the
4749 field. We have to back up by one to find the largest
4751 integer_type
= integer_types
[itk
- 1];
4753 /* Figure out how much additional padding is required. GCC
4754 3.2 always created a padding field, even if it had zero
4756 if (!abi_version_at_least (2)
4757 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
4759 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
4760 /* In a union, the padding field must have the full width
4761 of the bit-field; all fields start at offset zero. */
4762 padding
= DECL_SIZE (field
);
4765 if (warn_abi
&& TREE_CODE (t
) == UNION_TYPE
)
4766 warning ("size assigned to `%T' may not be "
4767 "ABI-compliant and may change in a future "
4770 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
4771 TYPE_SIZE (integer_type
));
4774 #ifdef PCC_BITFIELD_TYPE_MATTERS
4775 /* An unnamed bitfield does not normally affect the
4776 alignment of the containing class on a target where
4777 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4778 make any exceptions for unnamed bitfields when the
4779 bitfields are longer than their types. Therefore, we
4780 temporarily give the field a name. */
4781 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
4783 was_unnamed_p
= true;
4784 DECL_NAME (field
) = make_anon_name ();
4787 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
4788 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
4789 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
4790 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
4791 empty_base_offsets
);
4793 DECL_NAME (field
) = NULL_TREE
;
4794 /* Now that layout has been performed, set the size of the
4795 field to the size of its declared type; the rest of the
4796 field is effectively invisible. */
4797 DECL_SIZE (field
) = TYPE_SIZE (type
);
4798 /* We must also reset the DECL_MODE of the field. */
4799 if (abi_version_at_least (2))
4800 DECL_MODE (field
) = TYPE_MODE (type
);
4802 && DECL_MODE (field
) != TYPE_MODE (type
))
4803 /* Versions of G++ before G++ 3.4 did not reset the
4805 warning ("the offset of `%D' may not be ABI-compliant and may "
4806 "change in a future version of GCC", field
);
4809 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
4810 empty_base_offsets
);
4812 /* Remember the location of any empty classes in FIELD. */
4813 if (abi_version_at_least (2))
4814 record_subobject_offsets (TREE_TYPE (field
),
4815 byte_position(field
),
4819 /* If a bit-field does not immediately follow another bit-field,
4820 and yet it starts in the middle of a byte, we have failed to
4821 comply with the ABI. */
4823 && DECL_C_BIT_FIELD (field
)
4824 && !last_field_was_bitfield
4825 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
4826 DECL_FIELD_BIT_OFFSET (field
),
4827 bitsize_unit_node
)))
4828 cp_warning_at ("offset of `%D' is not ABI-compliant and may change in a future version of GCC",
4831 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4832 offset of the field. */
4834 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
4835 byte_position (field
))
4836 && contains_empty_class_p (TREE_TYPE (field
)))
4837 cp_warning_at ("`%D' contains empty classes which may cause base "
4838 "classes to be placed at different locations in a "
4839 "future version of GCC",
4842 /* If we needed additional padding after this field, add it
4848 padding_field
= build_decl (FIELD_DECL
,
4851 DECL_BIT_FIELD (padding_field
) = 1;
4852 DECL_SIZE (padding_field
) = padding
;
4853 DECL_CONTEXT (padding_field
) = t
;
4854 DECL_ARTIFICIAL (padding_field
) = 1;
4855 layout_nonempty_base_or_field (rli
, padding_field
,
4857 empty_base_offsets
);
4860 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
4863 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
4865 /* Make sure that we are on a byte boundary so that the size of
4866 the class without virtual bases will always be a round number
4868 rli
->bitpos
= round_up (rli
->bitpos
, BITS_PER_UNIT
);
4869 normalize_rli (rli
);
4872 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
4874 if (!abi_version_at_least (2))
4875 include_empty_classes(rli
);
4877 /* Delete all zero-width bit-fields from the list of fields. Now
4878 that the type is laid out they are no longer important. */
4879 remove_zero_width_bit_fields (t
);
4881 /* Create the version of T used for virtual bases. We do not use
4882 make_aggr_type for this version; this is an artificial type. For
4883 a POD type, we just reuse T. */
4884 if (CLASSTYPE_NON_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
4886 base_t
= make_node (TREE_CODE (t
));
4888 /* Set the size and alignment for the new type. In G++ 3.2, all
4889 empty classes were considered to have size zero when used as
4891 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
4893 TYPE_SIZE (base_t
) = bitsize_zero_node
;
4894 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
4895 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
4896 warning ("layout of classes derived from empty class `%T' "
4897 "may change in a future version of GCC",
4904 /* If the ABI version is not at least two, and the last
4905 field was a bit-field, RLI may not be on a byte
4906 boundary. In particular, rli_size_unit_so_far might
4907 indicate the last complete byte, while rli_size_so_far
4908 indicates the total number of bits used. Therefore,
4909 rli_size_so_far, rather than rli_size_unit_so_far, is
4910 used to compute TYPE_SIZE_UNIT. */
4911 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
4912 TYPE_SIZE_UNIT (base_t
)
4913 = size_binop (MAX_EXPR
,
4915 size_binop (CEIL_DIV_EXPR
,
4916 rli_size_so_far (rli
),
4917 bitsize_int (BITS_PER_UNIT
))),
4920 = size_binop (MAX_EXPR
,
4921 rli_size_so_far (rli
),
4922 size_binop (MULT_EXPR
,
4923 convert (bitsizetype
, eoc
),
4924 bitsize_int (BITS_PER_UNIT
)));
4926 TYPE_ALIGN (base_t
) = rli
->record_align
;
4927 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
4929 /* Copy the fields from T. */
4930 next_field
= &TYPE_FIELDS (base_t
);
4931 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
4932 if (TREE_CODE (field
) == FIELD_DECL
)
4934 *next_field
= build_decl (FIELD_DECL
,
4937 DECL_CONTEXT (*next_field
) = base_t
;
4938 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
4939 DECL_FIELD_BIT_OFFSET (*next_field
)
4940 = DECL_FIELD_BIT_OFFSET (field
);
4941 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
4942 DECL_MODE (*next_field
) = DECL_MODE (field
);
4943 next_field
= &TREE_CHAIN (*next_field
);
4946 /* Record the base version of the type. */
4947 CLASSTYPE_AS_BASE (t
) = base_t
;
4948 TYPE_CONTEXT (base_t
) = t
;
4951 CLASSTYPE_AS_BASE (t
) = t
;
4953 /* Every empty class contains an empty class. */
4954 if (CLASSTYPE_EMPTY_P (t
))
4955 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
4957 /* Set the TYPE_DECL for this type to contain the right
4958 value for DECL_OFFSET, so that we can use it as part
4959 of a COMPONENT_REF for multiple inheritance. */
4960 layout_decl (TYPE_MAIN_DECL (t
), 0);
4962 /* Now fix up any virtual base class types that we left lying
4963 around. We must get these done before we try to lay out the
4964 virtual function table. As a side-effect, this will remove the
4965 base subobject fields. */
4966 layout_virtual_bases (rli
, empty_base_offsets
);
4968 /* Make sure that empty classes are reflected in RLI at this
4970 include_empty_classes(rli
);
4972 /* Make sure not to create any structures with zero size. */
4973 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
4975 build_decl (FIELD_DECL
, NULL_TREE
, char_type_node
));
4977 /* Let the back-end lay out the type. */
4978 finish_record_layout (rli
, /*free_p=*/true);
4980 /* Warn about bases that can't be talked about due to ambiguity. */
4981 warn_about_ambiguous_bases (t
);
4984 splay_tree_delete (empty_base_offsets
);
4987 /* Returns the virtual function with which the vtable for TYPE is
4988 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
4991 key_method (tree type
)
4995 if (TYPE_FOR_JAVA (type
)
4996 || processing_template_decl
4997 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
4998 || CLASSTYPE_INTERFACE_KNOWN (type
))
5001 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
5002 method
= TREE_CHAIN (method
))
5003 if (DECL_VINDEX (method
) != NULL_TREE
5004 && ! DECL_DECLARED_INLINE_P (method
)
5005 && ! DECL_PURE_VIRTUAL_P (method
))
5011 /* Perform processing required when the definition of T (a class type)
5015 finish_struct_1 (tree t
)
5018 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5019 tree virtuals
= NULL_TREE
;
5023 if (COMPLETE_TYPE_P (t
))
5025 if (IS_AGGR_TYPE (t
))
5026 error ("redefinition of `%#T'", t
);
5033 /* If this type was previously laid out as a forward reference,
5034 make sure we lay it out again. */
5035 TYPE_SIZE (t
) = NULL_TREE
;
5036 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
5038 fixup_inline_methods (t
);
5040 /* Make assumptions about the class; we'll reset the flags if
5042 CLASSTYPE_EMPTY_P (t
) = 1;
5043 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
5044 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
5046 /* Do end-of-class semantic processing: checking the validity of the
5047 bases and members and add implicitly generated methods. */
5048 check_bases_and_members (t
);
5050 /* Find the key method. */
5051 if (TYPE_CONTAINS_VPTR_P (t
))
5053 CLASSTYPE_KEY_METHOD (t
) = key_method (t
);
5055 /* If a polymorphic class has no key method, we may emit the vtable
5056 in every translation unit where the class definition appears. */
5057 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
5058 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
5061 /* Layout the class itself. */
5062 layout_class_type (t
, &virtuals
);
5063 if (CLASSTYPE_AS_BASE (t
) != t
)
5064 /* We use the base type for trivial assignments, and hence it
5066 compute_record_mode (CLASSTYPE_AS_BASE (t
));
5068 /* Make sure that we get our own copy of the vfield FIELD_DECL. */
5069 vfield
= TYPE_VFIELD (t
);
5070 if (vfield
&& CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5072 tree primary
= CLASSTYPE_PRIMARY_BINFO (t
);
5074 my_friendly_assert (same_type_p (DECL_FIELD_CONTEXT (vfield
),
5075 BINFO_TYPE (primary
)),
5077 /* The vtable better be at the start. */
5078 my_friendly_assert (integer_zerop (DECL_FIELD_OFFSET (vfield
)),
5080 my_friendly_assert (integer_zerop (BINFO_OFFSET (primary
)),
5083 vfield
= copy_decl (vfield
);
5084 DECL_FIELD_CONTEXT (vfield
) = t
;
5085 TYPE_VFIELD (t
) = vfield
;
5088 my_friendly_assert (!vfield
|| DECL_FIELD_CONTEXT (vfield
) == t
, 20010726);
5090 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
5092 /* If we created a new vtbl pointer for this class, add it to the
5094 if (TYPE_VFIELD (t
) && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5095 CLASSTYPE_VFIELDS (t
)
5096 = chainon (CLASSTYPE_VFIELDS (t
), build_tree_list (NULL_TREE
, t
));
5098 /* If necessary, create the primary vtable for this class. */
5099 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
5101 /* We must enter these virtuals into the table. */
5102 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5103 build_primary_vtable (NULL_TREE
, t
);
5104 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
5105 /* Here we know enough to change the type of our virtual
5106 function table, but we will wait until later this function. */
5107 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
5110 if (TYPE_CONTAINS_VPTR_P (t
))
5115 if (TYPE_BINFO_VTABLE (t
))
5116 my_friendly_assert (DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t
)),
5118 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5119 my_friendly_assert (TYPE_BINFO_VIRTUALS (t
) == NULL_TREE
,
5122 /* Add entries for virtual functions introduced by this class. */
5123 TYPE_BINFO_VIRTUALS (t
) = chainon (TYPE_BINFO_VIRTUALS (t
), virtuals
);
5125 /* Set DECL_VINDEX for all functions declared in this class. */
5126 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5128 fn
= TREE_CHAIN (fn
),
5129 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
5130 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
5132 tree fndecl
= BV_FN (fn
);
5134 if (DECL_THUNK_P (fndecl
))
5135 /* A thunk. We should never be calling this entry directly
5136 from this vtable -- we'd use the entry for the non
5137 thunk base function. */
5138 DECL_VINDEX (fndecl
) = NULL_TREE
;
5139 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
5140 DECL_VINDEX (fndecl
) = build_shared_int_cst (vindex
);
5144 finish_struct_bits (t
);
5146 /* Complete the rtl for any static member objects of the type we're
5148 for (x
= TYPE_FIELDS (t
); x
; x
= TREE_CHAIN (x
))
5149 if (TREE_CODE (x
) == VAR_DECL
&& TREE_STATIC (x
)
5150 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
5151 DECL_MODE (x
) = TYPE_MODE (t
);
5153 /* Done with FIELDS...now decide whether to sort these for
5154 faster lookups later.
5156 We use a small number because most searches fail (succeeding
5157 ultimately as the search bores through the inheritance
5158 hierarchy), and we want this failure to occur quickly. */
5160 n_fields
= count_fields (TYPE_FIELDS (t
));
5163 struct sorted_fields_type
*field_vec
= ggc_alloc (sizeof (struct sorted_fields_type
)
5164 + n_fields
* sizeof (tree
));
5165 field_vec
->len
= n_fields
;
5166 add_fields_to_record_type (TYPE_FIELDS (t
), field_vec
, 0);
5167 qsort (field_vec
->elts
, n_fields
, sizeof (tree
),
5169 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t
)))
5170 retrofit_lang_decl (TYPE_MAIN_DECL (t
));
5171 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t
)) = field_vec
;
5174 if (TYPE_HAS_CONSTRUCTOR (t
))
5176 tree vfields
= CLASSTYPE_VFIELDS (t
);
5178 for (vfields
= CLASSTYPE_VFIELDS (t
);
5179 vfields
; vfields
= TREE_CHAIN (vfields
))
5180 /* Mark the fact that constructor for T could affect anybody
5181 inheriting from T who wants to initialize vtables for
5183 if (VF_BINFO_VALUE (vfields
))
5184 TREE_ADDRESSABLE (vfields
) = 1;
5187 /* Make the rtl for any new vtables we have created, and unmark
5188 the base types we marked. */
5191 /* Build the VTT for T. */
5194 if (warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
) && TYPE_HAS_DESTRUCTOR (t
)
5195 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), 1)) == NULL_TREE
)
5196 warning ("`%#T' has virtual functions but non-virtual destructor", t
);
5200 if (warn_overloaded_virtual
)
5203 maybe_suppress_debug_info (t
);
5205 dump_class_hierarchy (t
);
5207 /* Finish debugging output for this type. */
5208 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
5211 /* When T was built up, the member declarations were added in reverse
5212 order. Rearrange them to declaration order. */
5215 unreverse_member_declarations (tree t
)
5221 /* The following lists are all in reverse order. Put them in
5222 declaration order now. */
5223 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
5224 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
5226 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5227 reverse order, so we can't just use nreverse. */
5229 for (x
= TYPE_FIELDS (t
);
5230 x
&& TREE_CODE (x
) != TYPE_DECL
;
5233 next
= TREE_CHAIN (x
);
5234 TREE_CHAIN (x
) = prev
;
5239 TREE_CHAIN (TYPE_FIELDS (t
)) = x
;
5241 TYPE_FIELDS (t
) = prev
;
5246 finish_struct (tree t
, tree attributes
)
5248 location_t saved_loc
= input_location
;
5250 /* Now that we've got all the field declarations, reverse everything
5252 unreverse_member_declarations (t
);
5254 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
5256 /* Nadger the current location so that diagnostics point to the start of
5257 the struct, not the end. */
5258 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
5260 if (processing_template_decl
)
5262 finish_struct_methods (t
);
5263 TYPE_SIZE (t
) = bitsize_zero_node
;
5266 finish_struct_1 (t
);
5268 input_location
= saved_loc
;
5270 TYPE_BEING_DEFINED (t
) = 0;
5272 if (current_class_type
)
5275 error ("trying to finish struct, but kicked out due to previous parse errors");
5277 if (processing_template_decl
&& at_function_scope_p ())
5278 add_stmt (build_min (TAG_DEFN
, t
));
5283 /* Return the dynamic type of INSTANCE, if known.
5284 Used to determine whether the virtual function table is needed
5287 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5288 of our knowledge of its type. *NONNULL should be initialized
5289 before this function is called. */
5292 fixed_type_or_null (tree instance
, int* nonnull
, int* cdtorp
)
5294 switch (TREE_CODE (instance
))
5297 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
5300 return fixed_type_or_null (TREE_OPERAND (instance
, 0),
5304 /* This is a call to a constructor, hence it's never zero. */
5305 if (TREE_HAS_CONSTRUCTOR (instance
))
5309 return TREE_TYPE (instance
);
5314 /* This is a call to a constructor, hence it's never zero. */
5315 if (TREE_HAS_CONSTRUCTOR (instance
))
5319 return TREE_TYPE (instance
);
5321 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
, cdtorp
);
5328 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
5329 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
, cdtorp
);
5330 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
5331 /* Propagate nonnull. */
5332 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
, cdtorp
);
5337 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
, cdtorp
);
5342 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
, cdtorp
);
5345 return fixed_type_or_null (TREE_OPERAND (instance
, 1), nonnull
, cdtorp
);
5349 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
5350 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance
))))
5354 return TREE_TYPE (TREE_TYPE (instance
));
5356 /* fall through... */
5360 if (IS_AGGR_TYPE (TREE_TYPE (instance
)))
5364 return TREE_TYPE (instance
);
5366 else if (instance
== current_class_ptr
)
5371 /* if we're in a ctor or dtor, we know our type. */
5372 if (DECL_LANG_SPECIFIC (current_function_decl
)
5373 && (DECL_CONSTRUCTOR_P (current_function_decl
)
5374 || DECL_DESTRUCTOR_P (current_function_decl
)))
5378 return TREE_TYPE (TREE_TYPE (instance
));
5381 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
5383 /* Reference variables should be references to objects. */
5387 /* DECL_VAR_MARKED_P is used to prevent recursion; a
5388 variable's initializer may refer to the variable
5390 if (TREE_CODE (instance
) == VAR_DECL
5391 && DECL_INITIAL (instance
)
5392 && !DECL_VAR_MARKED_P (instance
))
5395 DECL_VAR_MARKED_P (instance
) = 1;
5396 type
= fixed_type_or_null (DECL_INITIAL (instance
),
5398 DECL_VAR_MARKED_P (instance
) = 0;
5409 /* Return nonzero if the dynamic type of INSTANCE is known, and
5410 equivalent to the static type. We also handle the case where
5411 INSTANCE is really a pointer. Return negative if this is a
5412 ctor/dtor. There the dynamic type is known, but this might not be
5413 the most derived base of the original object, and hence virtual
5414 bases may not be layed out according to this type.
5416 Used to determine whether the virtual function table is needed
5419 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5420 of our knowledge of its type. *NONNULL should be initialized
5421 before this function is called. */
5424 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
5426 tree t
= TREE_TYPE (instance
);
5429 tree fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
5430 if (fixed
== NULL_TREE
)
5432 if (POINTER_TYPE_P (t
))
5434 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
5436 return cdtorp
? -1 : 1;
5441 init_class_processing (void)
5443 current_class_depth
= 0;
5444 current_class_stack_size
= 10;
5446 = xmalloc (current_class_stack_size
* sizeof (struct class_stack_node
));
5447 VARRAY_TREE_INIT (local_classes
, 8, "local_classes");
5449 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
5450 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
5451 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
5454 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5455 appropriate for TYPE.
5457 So that we may avoid calls to lookup_name, we cache the _TYPE
5458 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5460 For multiple inheritance, we perform a two-pass depth-first search
5461 of the type lattice. The first pass performs a pre-order search,
5462 marking types after the type has had its fields installed in
5463 the appropriate IDENTIFIER_CLASS_VALUE slot. The second pass merely
5464 unmarks the marked types. If a field or member function name
5465 appears in an ambiguous way, the IDENTIFIER_CLASS_VALUE of
5466 that name becomes `error_mark_node'. */
5469 pushclass (tree type
)
5471 type
= TYPE_MAIN_VARIANT (type
);
5473 /* Make sure there is enough room for the new entry on the stack. */
5474 if (current_class_depth
+ 1 >= current_class_stack_size
)
5476 current_class_stack_size
*= 2;
5478 = xrealloc (current_class_stack
,
5479 current_class_stack_size
5480 * sizeof (struct class_stack_node
));
5483 /* Insert a new entry on the class stack. */
5484 current_class_stack
[current_class_depth
].name
= current_class_name
;
5485 current_class_stack
[current_class_depth
].type
= current_class_type
;
5486 current_class_stack
[current_class_depth
].access
= current_access_specifier
;
5487 current_class_stack
[current_class_depth
].names_used
= 0;
5488 current_class_depth
++;
5490 /* Now set up the new type. */
5491 current_class_name
= TYPE_NAME (type
);
5492 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
5493 current_class_name
= DECL_NAME (current_class_name
);
5494 current_class_type
= type
;
5496 /* By default, things in classes are private, while things in
5497 structures or unions are public. */
5498 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
5499 ? access_private_node
5500 : access_public_node
);
5502 if (previous_class_type
!= NULL_TREE
5503 && (type
!= previous_class_type
5504 || !COMPLETE_TYPE_P (previous_class_type
))
5505 && current_class_depth
== 1)
5507 /* Forcibly remove any old class remnants. */
5508 invalidate_class_lookup_cache ();
5511 /* If we're about to enter a nested class, clear
5512 IDENTIFIER_CLASS_VALUE for the enclosing classes. */
5513 if (current_class_depth
> 1)
5514 clear_identifier_class_values ();
5518 if (type
!= previous_class_type
|| current_class_depth
> 1)
5520 push_class_decls (type
);
5521 if (CLASSTYPE_TEMPLATE_INFO (type
) && !CLASSTYPE_USE_TEMPLATE (type
))
5523 /* If we are entering the scope of a template declaration (not a
5524 specialization), we need to push all the using decls with
5525 dependent scope too. */
5528 for (fields
= TYPE_FIELDS (type
);
5529 fields
; fields
= TREE_CHAIN (fields
))
5530 if (TREE_CODE (fields
) == USING_DECL
&& !TREE_TYPE (fields
))
5531 pushdecl_class_level (fields
);
5538 /* We are re-entering the same class we just left, so we don't
5539 have to search the whole inheritance matrix to find all the
5540 decls to bind again. Instead, we install the cached
5541 class_shadowed list, and walk through it binding names and
5542 setting up IDENTIFIER_TYPE_VALUEs. */
5543 set_class_shadows (previous_class_values
);
5544 for (item
= previous_class_values
; item
; item
= TREE_CHAIN (item
))
5546 tree id
= TREE_PURPOSE (item
);
5547 tree decl
= TREE_TYPE (item
);
5549 push_class_binding (id
, decl
);
5550 if (TREE_CODE (decl
) == TYPE_DECL
)
5551 set_identifier_type_value (id
, decl
);
5553 unuse_fields (type
);
5556 cxx_remember_type_decls (CLASSTYPE_NESTED_UTDS (type
));
5559 /* When we exit a toplevel class scope, we save the
5560 IDENTIFIER_CLASS_VALUEs so that we can restore them quickly if we
5561 reenter the class. Here, we've entered some other class, so we
5562 must invalidate our cache. */
5565 invalidate_class_lookup_cache (void)
5569 /* The IDENTIFIER_CLASS_VALUEs are no longer valid. */
5570 for (t
= previous_class_values
; t
; t
= TREE_CHAIN (t
))
5571 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
5573 previous_class_values
= NULL_TREE
;
5574 previous_class_type
= NULL_TREE
;
5577 /* Get out of the current class scope. If we were in a class scope
5578 previously, that is the one popped to. */
5586 current_class_depth
--;
5587 current_class_name
= current_class_stack
[current_class_depth
].name
;
5588 current_class_type
= current_class_stack
[current_class_depth
].type
;
5589 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
5590 if (current_class_stack
[current_class_depth
].names_used
)
5591 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
5594 /* Returns 1 if current_class_type is either T or a nested type of T.
5595 We start looking from 1 because entry 0 is from global scope, and has
5599 currently_open_class (tree t
)
5602 if (current_class_type
&& same_type_p (t
, current_class_type
))
5604 for (i
= 1; i
< current_class_depth
; ++i
)
5605 if (current_class_stack
[i
].type
5606 && same_type_p (current_class_stack
[i
].type
, t
))
5611 /* If either current_class_type or one of its enclosing classes are derived
5612 from T, return the appropriate type. Used to determine how we found
5613 something via unqualified lookup. */
5616 currently_open_derived_class (tree t
)
5620 /* The bases of a dependent type are unknown. */
5621 if (dependent_type_p (t
))
5624 if (!current_class_type
)
5627 if (DERIVED_FROM_P (t
, current_class_type
))
5628 return current_class_type
;
5630 for (i
= current_class_depth
- 1; i
> 0; --i
)
5631 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
5632 return current_class_stack
[i
].type
;
5637 /* When entering a class scope, all enclosing class scopes' names with
5638 static meaning (static variables, static functions, types and
5639 enumerators) have to be visible. This recursive function calls
5640 pushclass for all enclosing class contexts until global or a local
5641 scope is reached. TYPE is the enclosed class. */
5644 push_nested_class (tree type
)
5648 /* A namespace might be passed in error cases, like A::B:C. */
5649 if (type
== NULL_TREE
5650 || type
== error_mark_node
5651 || TREE_CODE (type
) == NAMESPACE_DECL
5652 || ! IS_AGGR_TYPE (type
)
5653 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5654 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
5657 context
= DECL_CONTEXT (TYPE_MAIN_DECL (type
));
5659 if (context
&& CLASS_TYPE_P (context
))
5660 push_nested_class (context
);
5664 /* Undoes a push_nested_class call. */
5667 pop_nested_class (void)
5669 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
5672 if (context
&& CLASS_TYPE_P (context
))
5673 pop_nested_class ();
5676 /* Returns the number of extern "LANG" blocks we are nested within. */
5679 current_lang_depth (void)
5681 return VARRAY_ACTIVE_SIZE (current_lang_base
);
5684 /* Set global variables CURRENT_LANG_NAME to appropriate value
5685 so that behavior of name-mangling machinery is correct. */
5688 push_lang_context (tree name
)
5690 VARRAY_PUSH_TREE (current_lang_base
, current_lang_name
);
5692 if (name
== lang_name_cplusplus
)
5694 current_lang_name
= name
;
5696 else if (name
== lang_name_java
)
5698 current_lang_name
= name
;
5699 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5700 (See record_builtin_java_type in decl.c.) However, that causes
5701 incorrect debug entries if these types are actually used.
5702 So we re-enable debug output after extern "Java". */
5703 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
5704 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
5705 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
5706 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
5707 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
5708 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
5709 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
5710 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
5712 else if (name
== lang_name_c
)
5714 current_lang_name
= name
;
5717 error ("language string `\"%s\"' not recognized", IDENTIFIER_POINTER (name
));
5720 /* Get out of the current language scope. */
5723 pop_lang_context (void)
5725 current_lang_name
= VARRAY_TOP_TREE (current_lang_base
);
5726 VARRAY_POP (current_lang_base
);
5729 /* Type instantiation routines. */
5731 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5732 matches the TARGET_TYPE. If there is no satisfactory match, return
5733 error_mark_node, and issue a error & warning messages under control
5734 of FLAGS. Permit pointers to member function if FLAGS permits. If
5735 TEMPLATE_ONLY, the name of the overloaded function was a
5736 template-id, and EXPLICIT_TARGS are the explicitly provided
5737 template arguments. */
5740 resolve_address_of_overloaded_function (tree target_type
,
5742 tsubst_flags_t flags
,
5744 tree explicit_targs
)
5746 /* Here's what the standard says:
5750 If the name is a function template, template argument deduction
5751 is done, and if the argument deduction succeeds, the deduced
5752 arguments are used to generate a single template function, which
5753 is added to the set of overloaded functions considered.
5755 Non-member functions and static member functions match targets of
5756 type "pointer-to-function" or "reference-to-function." Nonstatic
5757 member functions match targets of type "pointer-to-member
5758 function;" the function type of the pointer to member is used to
5759 select the member function from the set of overloaded member
5760 functions. If a nonstatic member function is selected, the
5761 reference to the overloaded function name is required to have the
5762 form of a pointer to member as described in 5.3.1.
5764 If more than one function is selected, any template functions in
5765 the set are eliminated if the set also contains a non-template
5766 function, and any given template function is eliminated if the
5767 set contains a second template function that is more specialized
5768 than the first according to the partial ordering rules 14.5.5.2.
5769 After such eliminations, if any, there shall remain exactly one
5770 selected function. */
5773 int is_reference
= 0;
5774 /* We store the matches in a TREE_LIST rooted here. The functions
5775 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5776 interoperability with most_specialized_instantiation. */
5777 tree matches
= NULL_TREE
;
5780 /* By the time we get here, we should be seeing only real
5781 pointer-to-member types, not the internal POINTER_TYPE to
5782 METHOD_TYPE representation. */
5783 my_friendly_assert (!(TREE_CODE (target_type
) == POINTER_TYPE
5784 && (TREE_CODE (TREE_TYPE (target_type
))
5785 == METHOD_TYPE
)), 0);
5787 my_friendly_assert (is_overloaded_fn (overload
), 20030910);
5789 /* Check that the TARGET_TYPE is reasonable. */
5790 if (TYPE_PTRFN_P (target_type
))
5792 else if (TYPE_PTRMEMFUNC_P (target_type
))
5793 /* This is OK, too. */
5795 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5797 /* This is OK, too. This comes from a conversion to reference
5799 target_type
= build_reference_type (target_type
);
5804 if (flags
& tf_error
)
5806 cannot resolve overloaded function `%D' based on conversion to type `%T'",
5807 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
5808 return error_mark_node
;
5811 /* If we can find a non-template function that matches, we can just
5812 use it. There's no point in generating template instantiations
5813 if we're just going to throw them out anyhow. But, of course, we
5814 can only do this when we don't *need* a template function. */
5819 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
5821 tree fn
= OVL_CURRENT (fns
);
5824 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5825 /* We're not looking for templates just yet. */
5828 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5830 /* We're looking for a non-static member, and this isn't
5831 one, or vice versa. */
5834 /* Ignore anticipated decls of undeclared builtins. */
5835 if (DECL_ANTICIPATED (fn
))
5838 /* See if there's a match. */
5839 fntype
= TREE_TYPE (fn
);
5841 fntype
= build_ptrmemfunc_type (build_pointer_type (fntype
));
5842 else if (!is_reference
)
5843 fntype
= build_pointer_type (fntype
);
5845 if (can_convert_arg (target_type
, fntype
, fn
))
5846 matches
= tree_cons (fn
, NULL_TREE
, matches
);
5850 /* Now, if we've already got a match (or matches), there's no need
5851 to proceed to the template functions. But, if we don't have a
5852 match we need to look at them, too. */
5855 tree target_fn_type
;
5856 tree target_arg_types
;
5857 tree target_ret_type
;
5862 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type
));
5864 target_fn_type
= TREE_TYPE (target_type
);
5865 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
5866 target_ret_type
= TREE_TYPE (target_fn_type
);
5868 /* Never do unification on the 'this' parameter. */
5869 if (TREE_CODE (target_fn_type
) == METHOD_TYPE
)
5870 target_arg_types
= TREE_CHAIN (target_arg_types
);
5872 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
5874 tree fn
= OVL_CURRENT (fns
);
5876 tree instantiation_type
;
5879 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5880 /* We're only looking for templates. */
5883 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5885 /* We're not looking for a non-static member, and this is
5886 one, or vice versa. */
5889 /* Try to do argument deduction. */
5890 targs
= make_tree_vec (DECL_NTPARMS (fn
));
5891 if (fn_type_unification (fn
, explicit_targs
, targs
,
5892 target_arg_types
, target_ret_type
,
5893 DEDUCE_EXACT
, -1) != 0)
5894 /* Argument deduction failed. */
5897 /* Instantiate the template. */
5898 instantiation
= instantiate_template (fn
, targs
, flags
);
5899 if (instantiation
== error_mark_node
)
5900 /* Instantiation failed. */
5903 /* See if there's a match. */
5904 instantiation_type
= TREE_TYPE (instantiation
);
5906 instantiation_type
=
5907 build_ptrmemfunc_type (build_pointer_type (instantiation_type
));
5908 else if (!is_reference
)
5909 instantiation_type
= build_pointer_type (instantiation_type
);
5910 if (can_convert_arg (target_type
, instantiation_type
, instantiation
))
5911 matches
= tree_cons (instantiation
, fn
, matches
);
5914 /* Now, remove all but the most specialized of the matches. */
5917 tree match
= most_specialized_instantiation (matches
);
5919 if (match
!= error_mark_node
)
5920 matches
= tree_cons (match
, NULL_TREE
, NULL_TREE
);
5924 /* Now we should have exactly one function in MATCHES. */
5925 if (matches
== NULL_TREE
)
5927 /* There were *no* matches. */
5928 if (flags
& tf_error
)
5930 error ("no matches converting function `%D' to type `%#T'",
5931 DECL_NAME (OVL_FUNCTION (overload
)),
5934 /* print_candidates expects a chain with the functions in
5935 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5936 so why be clever?). */
5937 for (; overload
; overload
= OVL_NEXT (overload
))
5938 matches
= tree_cons (NULL_TREE
, OVL_CURRENT (overload
),
5941 print_candidates (matches
);
5943 return error_mark_node
;
5945 else if (TREE_CHAIN (matches
))
5947 /* There were too many matches. */
5949 if (flags
& tf_error
)
5953 error ("converting overloaded function `%D' to type `%#T' is ambiguous",
5954 DECL_NAME (OVL_FUNCTION (overload
)),
5957 /* Since print_candidates expects the functions in the
5958 TREE_VALUE slot, we flip them here. */
5959 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
5960 TREE_VALUE (match
) = TREE_PURPOSE (match
);
5962 print_candidates (matches
);
5965 return error_mark_node
;
5968 /* Good, exactly one match. Now, convert it to the correct type. */
5969 fn
= TREE_PURPOSE (matches
);
5971 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5972 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
5974 static int explained
;
5976 if (!(flags
& tf_error
))
5977 return error_mark_node
;
5979 pedwarn ("assuming pointer to member `%D'", fn
);
5982 pedwarn ("(a pointer to member can only be formed with `&%E')", fn
);
5987 /* If we're doing overload resolution purely for the purpose of
5988 determining conversion sequences, we should not consider the
5989 function used. If this conversion sequence is selected, the
5990 function will be marked as used at this point. */
5991 if (!(flags
& tf_conv
))
5994 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
5995 return build_unary_op (ADDR_EXPR
, fn
, 0);
5998 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5999 will mark the function as addressed, but here we must do it
6001 cxx_mark_addressable (fn
);
6007 /* This function will instantiate the type of the expression given in
6008 RHS to match the type of LHSTYPE. If errors exist, then return
6009 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6010 we complain on errors. If we are not complaining, never modify rhs,
6011 as overload resolution wants to try many possible instantiations, in
6012 the hope that at least one will work.
6014 For non-recursive calls, LHSTYPE should be a function, pointer to
6015 function, or a pointer to member function. */
6018 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
6020 tsubst_flags_t flags_in
= flags
;
6022 flags
&= ~tf_ptrmem_ok
;
6024 if (TREE_CODE (lhstype
) == UNKNOWN_TYPE
)
6026 if (flags
& tf_error
)
6027 error ("not enough type information");
6028 return error_mark_node
;
6031 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
6033 if (same_type_p (lhstype
, TREE_TYPE (rhs
)))
6035 if (flag_ms_extensions
6036 && TYPE_PTRMEMFUNC_P (lhstype
)
6037 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
6038 /* Microsoft allows `A::f' to be resolved to a
6039 pointer-to-member. */
6043 if (flags
& tf_error
)
6044 error ("argument of type `%T' does not match `%T'",
6045 TREE_TYPE (rhs
), lhstype
);
6046 return error_mark_node
;
6050 if (TREE_CODE (rhs
) == BASELINK
)
6051 rhs
= BASELINK_FUNCTIONS (rhs
);
6053 /* We don't overwrite rhs if it is an overloaded function.
6054 Copying it would destroy the tree link. */
6055 if (TREE_CODE (rhs
) != OVERLOAD
)
6056 rhs
= copy_node (rhs
);
6058 /* This should really only be used when attempting to distinguish
6059 what sort of a pointer to function we have. For now, any
6060 arithmetic operation which is not supported on pointers
6061 is rejected as an error. */
6063 switch (TREE_CODE (rhs
))
6071 return error_mark_node
;
6078 new_rhs
= instantiate_type (build_pointer_type (lhstype
),
6079 TREE_OPERAND (rhs
, 0), flags
);
6080 if (new_rhs
== error_mark_node
)
6081 return error_mark_node
;
6083 TREE_TYPE (rhs
) = lhstype
;
6084 TREE_OPERAND (rhs
, 0) = new_rhs
;
6089 rhs
= copy_node (TREE_OPERAND (rhs
, 0));
6090 TREE_TYPE (rhs
) = unknown_type_node
;
6091 return instantiate_type (lhstype
, rhs
, flags
);
6095 tree addr
= instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6097 if (addr
!= error_mark_node
6098 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
6099 /* Do not lose object's side effects. */
6100 addr
= build (COMPOUND_EXPR
, TREE_TYPE (addr
),
6101 TREE_OPERAND (rhs
, 0), addr
);
6106 rhs
= TREE_OPERAND (rhs
, 1);
6107 if (BASELINK_P (rhs
))
6108 return instantiate_type (lhstype
, BASELINK_FUNCTIONS (rhs
), flags_in
);
6110 /* This can happen if we are forming a pointer-to-member for a
6112 my_friendly_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
, 0);
6116 case TEMPLATE_ID_EXPR
:
6118 tree fns
= TREE_OPERAND (rhs
, 0);
6119 tree args
= TREE_OPERAND (rhs
, 1);
6122 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
6123 /*template_only=*/true,
6130 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
6131 /*template_only=*/false,
6132 /*explicit_targs=*/NULL_TREE
);
6135 /* Now we should have a baselink. */
6136 my_friendly_assert (BASELINK_P (rhs
), 990412);
6138 return instantiate_type (lhstype
, BASELINK_FUNCTIONS (rhs
), flags
);
6141 /* This is too hard for now. */
6143 return error_mark_node
;
6148 TREE_OPERAND (rhs
, 0)
6149 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
6150 if (TREE_OPERAND (rhs
, 0) == error_mark_node
)
6151 return error_mark_node
;
6152 TREE_OPERAND (rhs
, 1)
6153 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6154 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6155 return error_mark_node
;
6157 TREE_TYPE (rhs
) = lhstype
;
6161 case TRUNC_DIV_EXPR
:
6162 case FLOOR_DIV_EXPR
:
6164 case ROUND_DIV_EXPR
:
6166 case TRUNC_MOD_EXPR
:
6167 case FLOOR_MOD_EXPR
:
6169 case ROUND_MOD_EXPR
:
6170 case FIX_ROUND_EXPR
:
6171 case FIX_FLOOR_EXPR
:
6173 case FIX_TRUNC_EXPR
:
6188 case PREINCREMENT_EXPR
:
6189 case PREDECREMENT_EXPR
:
6190 case POSTINCREMENT_EXPR
:
6191 case POSTDECREMENT_EXPR
:
6192 if (flags
& tf_error
)
6193 error ("invalid operation on uninstantiated type");
6194 return error_mark_node
;
6196 case TRUTH_AND_EXPR
:
6198 case TRUTH_XOR_EXPR
:
6205 case TRUTH_ANDIF_EXPR
:
6206 case TRUTH_ORIF_EXPR
:
6207 case TRUTH_NOT_EXPR
:
6208 if (flags
& tf_error
)
6209 error ("not enough type information");
6210 return error_mark_node
;
6213 if (type_unknown_p (TREE_OPERAND (rhs
, 0)))
6215 if (flags
& tf_error
)
6216 error ("not enough type information");
6217 return error_mark_node
;
6219 TREE_OPERAND (rhs
, 1)
6220 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6221 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6222 return error_mark_node
;
6223 TREE_OPERAND (rhs
, 2)
6224 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 2), flags
);
6225 if (TREE_OPERAND (rhs
, 2) == error_mark_node
)
6226 return error_mark_node
;
6228 TREE_TYPE (rhs
) = lhstype
;
6232 TREE_OPERAND (rhs
, 1)
6233 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6234 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6235 return error_mark_node
;
6237 TREE_TYPE (rhs
) = lhstype
;
6242 if (PTRMEM_OK_P (rhs
))
6243 flags
|= tf_ptrmem_ok
;
6245 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
6247 case ENTRY_VALUE_EXPR
:
6249 return error_mark_node
;
6252 return error_mark_node
;
6256 return error_mark_node
;
6260 /* Return the name of the virtual function pointer field
6261 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6262 this may have to look back through base types to find the
6263 ultimate field name. (For single inheritance, these could
6264 all be the same name. Who knows for multiple inheritance). */
6267 get_vfield_name (tree type
)
6269 tree binfo
= TYPE_BINFO (type
);
6272 while (BINFO_BASETYPES (binfo
)
6273 && TYPE_CONTAINS_VPTR_P (BINFO_TYPE (BINFO_BASETYPE (binfo
, 0)))
6274 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo
, 0)))
6275 binfo
= BINFO_BASETYPE (binfo
, 0);
6277 type
= BINFO_TYPE (binfo
);
6278 buf
= alloca (sizeof (VFIELD_NAME_FORMAT
) + TYPE_NAME_LENGTH (type
) + 2);
6279 sprintf (buf
, VFIELD_NAME_FORMAT
,
6280 IDENTIFIER_POINTER (constructor_name (type
)));
6281 return get_identifier (buf
);
6285 print_class_statistics (void)
6287 #ifdef GATHER_STATISTICS
6288 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
6289 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
6292 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
6293 n_vtables
, n_vtable_searches
);
6294 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
6295 n_vtable_entries
, n_vtable_elems
);
6300 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6301 according to [class]:
6302 The class-name is also inserted
6303 into the scope of the class itself. For purposes of access checking,
6304 the inserted class name is treated as if it were a public member name. */
6307 build_self_reference (void)
6309 tree name
= constructor_name (current_class_type
);
6310 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
6313 DECL_NONLOCAL (value
) = 1;
6314 DECL_CONTEXT (value
) = current_class_type
;
6315 DECL_ARTIFICIAL (value
) = 1;
6316 SET_DECL_SELF_REFERENCE_P (value
);
6318 if (processing_template_decl
)
6319 value
= push_template_decl (value
);
6321 saved_cas
= current_access_specifier
;
6322 current_access_specifier
= access_public_node
;
6323 finish_member_declaration (value
);
6324 current_access_specifier
= saved_cas
;
6327 /* Returns 1 if TYPE contains only padding bytes. */
6330 is_empty_class (tree type
)
6332 if (type
== error_mark_node
)
6335 if (! IS_AGGR_TYPE (type
))
6338 /* In G++ 3.2, whether or not a class was empty was determined by
6339 looking at its size. */
6340 if (abi_version_at_least (2))
6341 return CLASSTYPE_EMPTY_P (type
);
6343 return integer_zerop (CLASSTYPE_SIZE (type
));
6346 /* Returns true if TYPE contains an empty class. */
6349 contains_empty_class_p (tree type
)
6351 if (is_empty_class (type
))
6353 if (CLASS_TYPE_P (type
))
6358 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); ++i
)
6359 if (contains_empty_class_p (TYPE_BINFO_BASETYPE (type
, i
)))
6361 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6362 if (TREE_CODE (field
) == FIELD_DECL
6363 && !DECL_ARTIFICIAL (field
)
6364 && is_empty_class (TREE_TYPE (field
)))
6367 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6368 return contains_empty_class_p (TREE_TYPE (type
));
6372 /* Find the enclosing class of the given NODE. NODE can be a *_DECL or
6373 a *_TYPE node. NODE can also be a local class. */
6376 get_enclosing_class (tree type
)
6380 while (node
&& TREE_CODE (node
) != NAMESPACE_DECL
)
6382 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
6385 node
= DECL_CONTEXT (node
);
6391 node
= TYPE_CONTEXT (node
);
6401 /* Note that NAME was looked up while the current class was being
6402 defined and that the result of that lookup was DECL. */
6405 maybe_note_name_used_in_class (tree name
, tree decl
)
6407 splay_tree names_used
;
6409 /* If we're not defining a class, there's nothing to do. */
6410 if (innermost_scope_kind() != sk_class
)
6413 /* If there's already a binding for this NAME, then we don't have
6414 anything to worry about. */
6415 if (IDENTIFIER_CLASS_VALUE (name
))
6418 if (!current_class_stack
[current_class_depth
- 1].names_used
)
6419 current_class_stack
[current_class_depth
- 1].names_used
6420 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
6421 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
6423 splay_tree_insert (names_used
,
6424 (splay_tree_key
) name
,
6425 (splay_tree_value
) decl
);
6428 /* Note that NAME was declared (as DECL) in the current class. Check
6429 to see that the declaration is valid. */
6432 note_name_declared_in_class (tree name
, tree decl
)
6434 splay_tree names_used
;
6437 /* Look to see if we ever used this name. */
6439 = current_class_stack
[current_class_depth
- 1].names_used
;
6443 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
6446 /* [basic.scope.class]
6448 A name N used in a class S shall refer to the same declaration
6449 in its context and when re-evaluated in the completed scope of
6451 error ("declaration of `%#D'", decl
);
6452 cp_error_at ("changes meaning of `%D' from `%+#D'",
6453 DECL_NAME (OVL_CURRENT (decl
)),
6458 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6459 Secondary vtables are merged with primary vtables; this function
6460 will return the VAR_DECL for the primary vtable. */
6463 get_vtbl_decl_for_binfo (tree binfo
)
6467 decl
= BINFO_VTABLE (binfo
);
6468 if (decl
&& TREE_CODE (decl
) == PLUS_EXPR
)
6470 my_friendly_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
,
6472 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
6475 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 20000403);
6480 /* Returns the binfo for the primary base of BINFO. If the resulting
6481 BINFO is a virtual base, and it is inherited elsewhere in the
6482 hierarchy, then the returned binfo might not be the primary base of
6483 BINFO in the complete object. Check BINFO_PRIMARY_P or
6484 BINFO_LOST_PRIMARY_P to be sure. */
6487 get_primary_binfo (tree binfo
)
6492 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
6496 result
= copied_binfo (primary_base
, binfo
);
6500 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6503 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
6506 fprintf (stream
, "%*s", indent
, "");
6510 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6511 INDENT should be zero when called from the top level; it is
6512 incremented recursively. IGO indicates the next expected BINFO in
6513 inheritance graph ordering. */
6516 dump_class_hierarchy_r (FILE *stream
,
6525 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
6526 fprintf (stream
, "%s (0x%lx) ",
6527 type_as_string (binfo
, TFF_PLAIN_IDENTIFIER
),
6528 (unsigned long) binfo
);
6531 fprintf (stream
, "alternative-path\n");
6534 igo
= TREE_CHAIN (binfo
);
6536 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
6537 tree_low_cst (BINFO_OFFSET (binfo
), 0));
6538 if (is_empty_class (BINFO_TYPE (binfo
)))
6539 fprintf (stream
, " empty");
6540 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
6541 fprintf (stream
, " nearly-empty");
6542 if (TREE_VIA_VIRTUAL (binfo
))
6543 fprintf (stream
, " virtual");
6544 fprintf (stream
, "\n");
6547 if (BINFO_PRIMARY_BASE_OF (binfo
))
6549 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6550 fprintf (stream
, " primary-for %s (0x%lx)",
6551 type_as_string (BINFO_PRIMARY_BASE_OF (binfo
),
6552 TFF_PLAIN_IDENTIFIER
),
6553 (unsigned long)BINFO_PRIMARY_BASE_OF (binfo
));
6555 if (BINFO_LOST_PRIMARY_P (binfo
))
6557 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6558 fprintf (stream
, " lost-primary");
6561 fprintf (stream
, "\n");
6563 if (!(flags
& TDF_SLIM
))
6567 if (BINFO_SUBVTT_INDEX (binfo
))
6569 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6570 fprintf (stream
, " subvttidx=%s",
6571 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
6572 TFF_PLAIN_IDENTIFIER
));
6574 if (BINFO_VPTR_INDEX (binfo
))
6576 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6577 fprintf (stream
, " vptridx=%s",
6578 expr_as_string (BINFO_VPTR_INDEX (binfo
),
6579 TFF_PLAIN_IDENTIFIER
));
6581 if (BINFO_VPTR_FIELD (binfo
))
6583 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6584 fprintf (stream
, " vbaseoffset=%s",
6585 expr_as_string (BINFO_VPTR_FIELD (binfo
),
6586 TFF_PLAIN_IDENTIFIER
));
6588 if (BINFO_VTABLE (binfo
))
6590 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
6591 fprintf (stream
, " vptr=%s",
6592 expr_as_string (BINFO_VTABLE (binfo
),
6593 TFF_PLAIN_IDENTIFIER
));
6597 fprintf (stream
, "\n");
6600 base_binfos
= BINFO_BASETYPES (binfo
);
6605 n
= TREE_VEC_LENGTH (base_binfos
);
6606 for (ix
= 0; ix
!= n
; ix
++)
6608 tree base_binfo
= TREE_VEC_ELT (base_binfos
, ix
);
6610 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
,
6618 /* Dump the BINFO hierarchy for T. */
6621 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
6623 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
6624 fprintf (stream
, " size=%lu align=%lu\n",
6625 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
6626 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
6627 fprintf (stream
, " base size=%lu base align=%lu\n",
6628 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
6630 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
6632 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
6633 fprintf (stream
, "\n");
6636 /* Debug interface to hierarchy dumping. */
6639 debug_class (tree t
)
6641 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
6645 dump_class_hierarchy (tree t
)
6648 FILE *stream
= dump_begin (TDI_class
, &flags
);
6652 dump_class_hierarchy_1 (stream
, flags
, t
);
6653 dump_end (TDI_class
, stream
);
6658 dump_array (FILE * stream
, tree decl
)
6663 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
6665 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
6667 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
6668 fprintf (stream
, " %s entries",
6669 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
6670 TFF_PLAIN_IDENTIFIER
));
6671 fprintf (stream
, "\n");
6673 for (ix
= 0, inits
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
6674 inits
; ix
++, inits
= TREE_CHAIN (inits
))
6675 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
6676 expr_as_string (TREE_VALUE (inits
), TFF_PLAIN_IDENTIFIER
));
6680 dump_vtable (tree t
, tree binfo
, tree vtable
)
6683 FILE *stream
= dump_begin (TDI_class
, &flags
);
6688 if (!(flags
& TDF_SLIM
))
6690 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
6692 fprintf (stream
, "%s for %s",
6693 ctor_vtbl_p
? "Construction vtable" : "Vtable",
6694 type_as_string (binfo
, TFF_PLAIN_IDENTIFIER
));
6697 if (!TREE_VIA_VIRTUAL (binfo
))
6698 fprintf (stream
, " (0x%lx instance)", (unsigned long)binfo
);
6699 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
6701 fprintf (stream
, "\n");
6702 dump_array (stream
, vtable
);
6703 fprintf (stream
, "\n");
6706 dump_end (TDI_class
, stream
);
6710 dump_vtt (tree t
, tree vtt
)
6713 FILE *stream
= dump_begin (TDI_class
, &flags
);
6718 if (!(flags
& TDF_SLIM
))
6720 fprintf (stream
, "VTT for %s\n",
6721 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
6722 dump_array (stream
, vtt
);
6723 fprintf (stream
, "\n");
6726 dump_end (TDI_class
, stream
);
6729 /* Dump a function or thunk and its thunkees. */
6732 dump_thunk (FILE *stream
, int indent
, tree thunk
)
6734 static const char spaces
[] = " ";
6735 tree name
= DECL_NAME (thunk
);
6738 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
6740 !DECL_THUNK_P (thunk
) ? "function"
6741 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
6742 name
? IDENTIFIER_POINTER (name
) : "<unset>");
6743 if (DECL_THUNK_P (thunk
))
6745 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
6746 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
6748 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
6749 if (!virtual_adjust
)
6751 else if (DECL_THIS_THUNK_P (thunk
))
6752 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
6753 tree_low_cst (virtual_adjust
, 0));
6755 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
6756 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
6757 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
6758 if (THUNK_ALIAS (thunk
))
6759 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
6761 fprintf (stream
, "\n");
6762 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
6763 dump_thunk (stream
, indent
+ 2, thunks
);
6766 /* Dump the thunks for FN. */
6769 debug_thunks (tree fn
)
6771 dump_thunk (stderr
, 0, fn
);
6774 /* Virtual function table initialization. */
6776 /* Create all the necessary vtables for T and its base classes. */
6779 finish_vtbls (tree t
)
6784 /* We lay out the primary and secondary vtables in one contiguous
6785 vtable. The primary vtable is first, followed by the non-virtual
6786 secondary vtables in inheritance graph order. */
6787 list
= build_tree_list (TYPE_BINFO_VTABLE (t
), NULL_TREE
);
6788 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
),
6789 TYPE_BINFO (t
), t
, list
);
6791 /* Then come the virtual bases, also in inheritance graph order. */
6792 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
6794 if (!TREE_VIA_VIRTUAL (vbase
))
6796 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), t
, list
);
6799 if (TYPE_BINFO_VTABLE (t
))
6800 initialize_vtable (TYPE_BINFO (t
), TREE_VALUE (list
));
6803 /* Initialize the vtable for BINFO with the INITS. */
6806 initialize_vtable (tree binfo
, tree inits
)
6810 layout_vtable_decl (binfo
, list_length (inits
));
6811 decl
= get_vtbl_decl_for_binfo (binfo
);
6812 initialize_array (decl
, inits
);
6813 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
6816 /* Initialize DECL (a declaration for a namespace-scope array) with
6820 initialize_array (tree decl
, tree inits
)
6824 context
= DECL_CONTEXT (decl
);
6825 DECL_CONTEXT (decl
) = NULL_TREE
;
6826 DECL_INITIAL (decl
) = build_constructor (NULL_TREE
, inits
);
6827 TREE_HAS_CONSTRUCTOR (DECL_INITIAL (decl
)) = 1;
6828 cp_finish_decl (decl
, DECL_INITIAL (decl
), NULL_TREE
, 0);
6829 DECL_CONTEXT (decl
) = context
;
6832 /* Build the VTT (virtual table table) for T.
6833 A class requires a VTT if it has virtual bases.
6836 1 - primary virtual pointer for complete object T
6837 2 - secondary VTTs for each direct non-virtual base of T which requires a
6839 3 - secondary virtual pointers for each direct or indirect base of T which
6840 has virtual bases or is reachable via a virtual path from T.
6841 4 - secondary VTTs for each direct or indirect virtual base of T.
6843 Secondary VTTs look like complete object VTTs without part 4. */
6853 /* Build up the initializers for the VTT. */
6855 index
= size_zero_node
;
6856 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
6858 /* If we didn't need a VTT, we're done. */
6862 /* Figure out the type of the VTT. */
6863 type
= build_index_type (size_int (list_length (inits
) - 1));
6864 type
= build_cplus_array_type (const_ptr_type_node
, type
);
6866 /* Now, build the VTT object itself. */
6867 vtt
= build_vtable (t
, get_vtt_name (t
), type
);
6868 initialize_array (vtt
, inits
);
6869 /* Add the VTT to the vtables list. */
6870 TREE_CHAIN (vtt
) = TREE_CHAIN (CLASSTYPE_VTABLES (t
));
6871 TREE_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
6876 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6877 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6878 and CHAIN the vtable pointer for this binfo after construction is
6879 complete. VALUE can also be another BINFO, in which case we recurse. */
6882 binfo_ctor_vtable (tree binfo
)
6888 vt
= BINFO_VTABLE (binfo
);
6889 if (TREE_CODE (vt
) == TREE_LIST
)
6890 vt
= TREE_VALUE (vt
);
6891 if (TREE_CODE (vt
) == TREE_VEC
)
6900 /* Recursively build the VTT-initializer for BINFO (which is in the
6901 hierarchy dominated by T). INITS points to the end of the initializer
6902 list to date. INDEX is the VTT index where the next element will be
6903 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6904 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6905 for virtual bases of T. When it is not so, we build the constructor
6906 vtables for the BINFO-in-T variant. */
6909 build_vtt_inits (tree binfo
, tree t
, tree
* inits
, tree
* index
)
6914 tree secondary_vptrs
;
6915 int top_level_p
= same_type_p (TREE_TYPE (binfo
), t
);
6917 /* We only need VTTs for subobjects with virtual bases. */
6918 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
)))
6921 /* We need to use a construction vtable if this is not the primary
6925 build_ctor_vtbl_group (binfo
, t
);
6927 /* Record the offset in the VTT where this sub-VTT can be found. */
6928 BINFO_SUBVTT_INDEX (binfo
) = *index
;
6931 /* Add the address of the primary vtable for the complete object. */
6932 init
= binfo_ctor_vtable (binfo
);
6933 *inits
= build_tree_list (NULL_TREE
, init
);
6934 inits
= &TREE_CHAIN (*inits
);
6937 my_friendly_assert (!BINFO_VPTR_INDEX (binfo
), 20010129);
6938 BINFO_VPTR_INDEX (binfo
) = *index
;
6940 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
6942 /* Recursively add the secondary VTTs for non-virtual bases. */
6943 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
6945 b
= BINFO_BASETYPE (binfo
, i
);
6946 if (!TREE_VIA_VIRTUAL (b
))
6947 inits
= build_vtt_inits (BINFO_BASETYPE (binfo
, i
), t
,
6951 /* Add secondary virtual pointers for all subobjects of BINFO with
6952 either virtual bases or reachable along a virtual path, except
6953 subobjects that are non-virtual primary bases. */
6954 secondary_vptrs
= tree_cons (t
, NULL_TREE
, BINFO_TYPE (binfo
));
6955 TREE_TYPE (secondary_vptrs
) = *index
;
6956 VTT_TOP_LEVEL_P (secondary_vptrs
) = top_level_p
;
6957 VTT_MARKED_BINFO_P (secondary_vptrs
) = 0;
6959 dfs_walk_real (binfo
,
6960 dfs_build_secondary_vptr_vtt_inits
,
6962 dfs_ctor_vtable_bases_queue_p
,
6964 VTT_MARKED_BINFO_P (secondary_vptrs
) = 1;
6965 dfs_walk (binfo
, dfs_unmark
, dfs_ctor_vtable_bases_queue_p
,
6968 *index
= TREE_TYPE (secondary_vptrs
);
6970 /* The secondary vptrs come back in reverse order. After we reverse
6971 them, and add the INITS, the last init will be the first element
6973 secondary_vptrs
= TREE_VALUE (secondary_vptrs
);
6974 if (secondary_vptrs
)
6976 *inits
= nreverse (secondary_vptrs
);
6977 inits
= &TREE_CHAIN (secondary_vptrs
);
6978 my_friendly_assert (*inits
== NULL_TREE
, 20000517);
6981 /* Add the secondary VTTs for virtual bases. */
6983 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
6985 if (!TREE_VIA_VIRTUAL (b
))
6988 inits
= build_vtt_inits (b
, t
, inits
, index
);
6993 tree data
= tree_cons (t
, binfo
, NULL_TREE
);
6994 VTT_TOP_LEVEL_P (data
) = 0;
6995 VTT_MARKED_BINFO_P (data
) = 0;
6997 dfs_walk (binfo
, dfs_fixup_binfo_vtbls
,
6998 dfs_ctor_vtable_bases_queue_p
,
7005 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo
7006 for the base in most derived. DATA is a TREE_LIST who's
7007 TREE_CHAIN is the type of the base being
7008 constructed whilst this secondary vptr is live. The TREE_UNSIGNED
7009 flag of DATA indicates that this is a constructor vtable. The
7010 TREE_TOP_LEVEL flag indicates that this is the primary VTT. */
7013 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void* data
)
7023 top_level_p
= VTT_TOP_LEVEL_P (l
);
7025 BINFO_MARKED (binfo
) = 1;
7027 /* We don't care about bases that don't have vtables. */
7028 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
7031 /* We're only interested in proper subobjects of T. */
7032 if (same_type_p (BINFO_TYPE (binfo
), t
))
7035 /* We're not interested in non-virtual primary bases. */
7036 if (!TREE_VIA_VIRTUAL (binfo
) && BINFO_PRIMARY_P (binfo
))
7039 /* If BINFO has virtual bases or is reachable via a virtual path
7040 from T, it'll have a secondary vptr. */
7041 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
))
7042 && !binfo_via_virtual (binfo
, t
))
7045 /* Record the index where this secondary vptr can be found. */
7046 index
= TREE_TYPE (l
);
7049 my_friendly_assert (!BINFO_VPTR_INDEX (binfo
), 20010129);
7050 BINFO_VPTR_INDEX (binfo
) = index
;
7052 TREE_TYPE (l
) = size_binop (PLUS_EXPR
, index
,
7053 TYPE_SIZE_UNIT (ptr_type_node
));
7055 /* Add the initializer for the secondary vptr itself. */
7056 if (top_level_p
&& TREE_VIA_VIRTUAL (binfo
))
7058 /* It's a primary virtual base, and this is not the construction
7059 vtable. Find the base this is primary of in the inheritance graph,
7060 and use that base's vtable now. */
7061 while (BINFO_PRIMARY_BASE_OF (binfo
))
7062 binfo
= BINFO_PRIMARY_BASE_OF (binfo
);
7064 init
= binfo_ctor_vtable (binfo
);
7065 TREE_VALUE (l
) = tree_cons (NULL_TREE
, init
, TREE_VALUE (l
));
7070 /* dfs_walk_real predicate for building vtables. DATA is a TREE_LIST,
7071 VTT_MARKED_BINFO_P indicates whether marked or unmarked bases
7072 should be walked. TREE_PURPOSE is the TREE_TYPE that dominates the
7076 dfs_ctor_vtable_bases_queue_p (tree derived
, int ix
,
7079 tree binfo
= BINFO_BASETYPE (derived
, ix
);
7081 if (!BINFO_MARKED (binfo
) == VTT_MARKED_BINFO_P ((tree
) data
))
7086 /* Called from build_vtt_inits via dfs_walk. After building constructor
7087 vtables and generating the sub-vtt from them, we need to restore the
7088 BINFO_VTABLES that were scribbled on. DATA is a TREE_LIST whose
7089 TREE_VALUE is the TREE_TYPE of the base whose sub vtt was generated. */
7092 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
7094 BINFO_MARKED (binfo
) = 0;
7096 /* We don't care about bases that don't have vtables. */
7097 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
7100 /* If we scribbled the construction vtable vptr into BINFO, clear it
7102 if (BINFO_VTABLE (binfo
)
7103 && TREE_CODE (BINFO_VTABLE (binfo
)) == TREE_LIST
7104 && (TREE_PURPOSE (BINFO_VTABLE (binfo
))
7105 == TREE_VALUE ((tree
) data
)))
7106 BINFO_VTABLE (binfo
) = TREE_CHAIN (BINFO_VTABLE (binfo
));
7111 /* Build the construction vtable group for BINFO which is in the
7112 hierarchy dominated by T. */
7115 build_ctor_vtbl_group (tree binfo
, tree t
)
7124 /* See if we've already created this construction vtable group. */
7125 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
7126 if (IDENTIFIER_GLOBAL_VALUE (id
))
7129 my_friendly_assert (!same_type_p (BINFO_TYPE (binfo
), t
), 20010124);
7130 /* Build a version of VTBL (with the wrong type) for use in
7131 constructing the addresses of secondary vtables in the
7132 construction vtable group. */
7133 vtbl
= build_vtable (t
, id
, ptr_type_node
);
7134 list
= build_tree_list (vtbl
, NULL_TREE
);
7135 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
7138 /* Add the vtables for each of our virtual bases using the vbase in T
7140 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
7142 vbase
= TREE_CHAIN (vbase
))
7146 if (!TREE_VIA_VIRTUAL (vbase
))
7148 b
= copied_binfo (vbase
, binfo
);
7150 accumulate_vtbl_inits (b
, vbase
, binfo
, t
, list
);
7152 inits
= TREE_VALUE (list
);
7154 /* Figure out the type of the construction vtable. */
7155 type
= build_index_type (size_int (list_length (inits
) - 1));
7156 type
= build_cplus_array_type (vtable_entry_type
, type
);
7157 TREE_TYPE (vtbl
) = type
;
7159 /* Initialize the construction vtable. */
7160 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
7161 initialize_array (vtbl
, inits
);
7162 dump_vtable (t
, binfo
, vtbl
);
7165 /* Add the vtbl initializers for BINFO (and its bases other than
7166 non-virtual primaries) to the list of INITS. BINFO is in the
7167 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7168 the constructor the vtbl inits should be accumulated for. (If this
7169 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7170 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7171 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7172 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7173 but are not necessarily the same in terms of layout. */
7176 accumulate_vtbl_inits (tree binfo
,
7183 int ctor_vtbl_p
= !same_type_p (BINFO_TYPE (rtti_binfo
), t
);
7185 my_friendly_assert (same_type_p (BINFO_TYPE (binfo
),
7186 BINFO_TYPE (orig_binfo
)),
7189 /* If it doesn't have a vptr, we don't do anything. */
7190 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
7193 /* If we're building a construction vtable, we're not interested in
7194 subobjects that don't require construction vtables. */
7196 && !TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
))
7197 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
7200 /* Build the initializers for the BINFO-in-T vtable. */
7202 = chainon (TREE_VALUE (inits
),
7203 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
,
7204 rtti_binfo
, t
, inits
));
7206 /* Walk the BINFO and its bases. We walk in preorder so that as we
7207 initialize each vtable we can figure out at what offset the
7208 secondary vtable lies from the primary vtable. We can't use
7209 dfs_walk here because we need to iterate through bases of BINFO
7210 and RTTI_BINFO simultaneously. */
7211 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
7213 tree base_binfo
= BINFO_BASETYPE (binfo
, i
);
7215 /* Skip virtual bases. */
7216 if (TREE_VIA_VIRTUAL (base_binfo
))
7218 accumulate_vtbl_inits (base_binfo
,
7219 BINFO_BASETYPE (orig_binfo
, i
),
7225 /* Called from accumulate_vtbl_inits. Returns the initializers for
7226 the BINFO vtable. */
7229 dfs_accumulate_vtbl_inits (tree binfo
,
7235 tree inits
= NULL_TREE
;
7236 tree vtbl
= NULL_TREE
;
7237 int ctor_vtbl_p
= !same_type_p (BINFO_TYPE (rtti_binfo
), t
);
7240 && TREE_VIA_VIRTUAL (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
7242 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7243 primary virtual base. If it is not the same primary in
7244 the hierarchy of T, we'll need to generate a ctor vtable
7245 for it, to place at its location in T. If it is the same
7246 primary, we still need a VTT entry for the vtable, but it
7247 should point to the ctor vtable for the base it is a
7248 primary for within the sub-hierarchy of RTTI_BINFO.
7250 There are three possible cases:
7252 1) We are in the same place.
7253 2) We are a primary base within a lost primary virtual base of
7255 3) We are primary to something not a base of RTTI_BINFO. */
7257 tree b
= BINFO_PRIMARY_BASE_OF (binfo
);
7258 tree last
= NULL_TREE
;
7260 /* First, look through the bases we are primary to for RTTI_BINFO
7261 or a virtual base. */
7262 for (; b
; b
= BINFO_PRIMARY_BASE_OF (b
))
7265 if (TREE_VIA_VIRTUAL (b
) || b
== rtti_binfo
)
7268 /* If we run out of primary links, keep looking down our
7269 inheritance chain; we might be an indirect primary. */
7271 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
7272 if (TREE_VIA_VIRTUAL (b
) || b
== rtti_binfo
)
7275 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7276 base B and it is a base of RTTI_BINFO, this is case 2. In
7277 either case, we share our vtable with LAST, i.e. the
7278 derived-most base within B of which we are a primary. */
7280 || (b
&& purpose_member (BINFO_TYPE (b
),
7281 CLASSTYPE_VBASECLASSES (BINFO_TYPE (rtti_binfo
)))))
7282 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7283 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7284 binfo_ctor_vtable after everything's been set up. */
7287 /* Otherwise, this is case 3 and we get our own. */
7289 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
7297 /* Compute the initializer for this vtable. */
7298 inits
= build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
7301 /* Figure out the position to which the VPTR should point. */
7302 vtbl
= TREE_PURPOSE (l
);
7303 vtbl
= build1 (ADDR_EXPR
,
7306 TREE_CONSTANT (vtbl
) = 1;
7307 index
= size_binop (PLUS_EXPR
,
7308 size_int (non_fn_entries
),
7309 size_int (list_length (TREE_VALUE (l
))));
7310 index
= size_binop (MULT_EXPR
,
7311 TYPE_SIZE_UNIT (vtable_entry_type
),
7313 vtbl
= build (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, index
);
7314 TREE_CONSTANT (vtbl
) = 1;
7318 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7319 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7320 straighten this out. */
7321 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
7322 else if (BINFO_PRIMARY_P (binfo
) && TREE_VIA_VIRTUAL (binfo
))
7325 /* For an ordinary vtable, set BINFO_VTABLE. */
7326 BINFO_VTABLE (binfo
) = vtbl
;
7331 /* Construct the initializer for BINFO's virtual function table. BINFO
7332 is part of the hierarchy dominated by T. If we're building a
7333 construction vtable, the ORIG_BINFO is the binfo we should use to
7334 find the actual function pointers to put in the vtable - but they
7335 can be overridden on the path to most-derived in the graph that
7336 ORIG_BINFO belongs. Otherwise,
7337 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7338 BINFO that should be indicated by the RTTI information in the
7339 vtable; it will be a base class of T, rather than T itself, if we
7340 are building a construction vtable.
7342 The value returned is a TREE_LIST suitable for wrapping in a
7343 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7344 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7345 number of non-function entries in the vtable.
7347 It might seem that this function should never be called with a
7348 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7349 base is always subsumed by a derived class vtable. However, when
7350 we are building construction vtables, we do build vtables for
7351 primary bases; we need these while the primary base is being
7355 build_vtbl_initializer (tree binfo
,
7359 int* non_fn_entries_p
)
7366 /* Initialize VID. */
7367 memset (&vid
, 0, sizeof (vid
));
7370 vid
.rtti_binfo
= rtti_binfo
;
7371 vid
.last_init
= &vid
.inits
;
7372 vid
.primary_vtbl_p
= (binfo
== TYPE_BINFO (t
));
7373 vid
.ctor_vtbl_p
= !same_type_p (BINFO_TYPE (rtti_binfo
), t
);
7374 vid
.generate_vcall_entries
= true;
7375 /* The first vbase or vcall offset is at index -3 in the vtable. */
7376 vid
.index
= ssize_int (-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
7378 /* Add entries to the vtable for RTTI. */
7379 build_rtti_vtbl_entries (binfo
, &vid
);
7381 /* Create an array for keeping track of the functions we've
7382 processed. When we see multiple functions with the same
7383 signature, we share the vcall offsets. */
7384 VARRAY_TREE_INIT (vid
.fns
, 32, "fns");
7385 /* Add the vcall and vbase offset entries. */
7386 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
7387 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7388 build_vbase_offset_vtbl_entries. */
7389 for (vbase
= CLASSTYPE_VBASECLASSES (t
);
7391 vbase
= TREE_CHAIN (vbase
))
7392 BINFO_VTABLE_PATH_MARKED (TREE_VALUE (vbase
)) = 0;
7394 /* If the target requires padding between data entries, add that now. */
7395 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
7399 for (prev
= &vid
.inits
; (cur
= *prev
); prev
= &TREE_CHAIN (cur
))
7404 for (i
= 1; i
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++i
)
7405 add
= tree_cons (NULL_TREE
,
7406 build1 (NOP_EXPR
, vtable_entry_type
,
7413 if (non_fn_entries_p
)
7414 *non_fn_entries_p
= list_length (vid
.inits
);
7416 /* Go through all the ordinary virtual functions, building up
7418 vfun_inits
= NULL_TREE
;
7419 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
7423 tree fn
, fn_original
;
7424 tree init
= NULL_TREE
;
7428 if (DECL_THUNK_P (fn
))
7430 if (!DECL_NAME (fn
))
7432 if (THUNK_ALIAS (fn
))
7434 fn
= THUNK_ALIAS (fn
);
7437 fn_original
= THUNK_TARGET (fn
);
7440 /* If the only definition of this function signature along our
7441 primary base chain is from a lost primary, this vtable slot will
7442 never be used, so just zero it out. This is important to avoid
7443 requiring extra thunks which cannot be generated with the function.
7445 We first check this in update_vtable_entry_for_fn, so we handle
7446 restored primary bases properly; we also need to do it here so we
7447 zero out unused slots in ctor vtables, rather than filling themff
7448 with erroneous values (though harmless, apart from relocation
7450 for (b
= binfo
; ; b
= get_primary_binfo (b
))
7452 /* We found a defn before a lost primary; go ahead as normal. */
7453 if (look_for_overrides_here (BINFO_TYPE (b
), fn_original
))
7456 /* The nearest definition is from a lost primary; clear the
7458 if (BINFO_LOST_PRIMARY_P (b
))
7460 init
= size_zero_node
;
7467 /* Pull the offset for `this', and the function to call, out of
7469 delta
= BV_DELTA (v
);
7470 vcall_index
= BV_VCALL_INDEX (v
);
7472 my_friendly_assert (TREE_CODE (delta
) == INTEGER_CST
, 19990727);
7473 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 19990727);
7475 /* You can't call an abstract virtual function; it's abstract.
7476 So, we replace these functions with __pure_virtual. */
7477 if (DECL_PURE_VIRTUAL_P (fn_original
))
7479 else if (!integer_zerop (delta
) || vcall_index
)
7481 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
7482 if (!DECL_NAME (fn
))
7485 /* Take the address of the function, considering it to be of an
7486 appropriate generic type. */
7487 init
= build1 (ADDR_EXPR
, vfunc_ptr_type_node
, fn
);
7488 /* The address of a function can't change. */
7489 TREE_CONSTANT (init
) = 1;
7492 /* And add it to the chain of initializers. */
7493 if (TARGET_VTABLE_USES_DESCRIPTORS
)
7496 if (init
== size_zero_node
)
7497 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
7498 vfun_inits
= tree_cons (NULL_TREE
, init
, vfun_inits
);
7500 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
7502 tree fdesc
= build (FDESC_EXPR
, vfunc_ptr_type_node
,
7503 TREE_OPERAND (init
, 0),
7504 build_int_2 (i
, 0));
7505 TREE_CONSTANT (fdesc
) = 1;
7507 vfun_inits
= tree_cons (NULL_TREE
, fdesc
, vfun_inits
);
7511 vfun_inits
= tree_cons (NULL_TREE
, init
, vfun_inits
);
7514 /* The initializers for virtual functions were built up in reverse
7515 order; straighten them out now. */
7516 vfun_inits
= nreverse (vfun_inits
);
7518 /* The negative offset initializers are also in reverse order. */
7519 vid
.inits
= nreverse (vid
.inits
);
7521 /* Chain the two together. */
7522 return chainon (vid
.inits
, vfun_inits
);
7525 /* Adds to vid->inits the initializers for the vbase and vcall
7526 offsets in BINFO, which is in the hierarchy dominated by T. */
7529 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7533 /* If this is a derived class, we must first create entries
7534 corresponding to the primary base class. */
7535 b
= get_primary_binfo (binfo
);
7537 build_vcall_and_vbase_vtbl_entries (b
, vid
);
7539 /* Add the vbase entries for this base. */
7540 build_vbase_offset_vtbl_entries (binfo
, vid
);
7541 /* Add the vcall entries for this base. */
7542 build_vcall_offset_vtbl_entries (binfo
, vid
);
7545 /* Returns the initializers for the vbase offset entries in the vtable
7546 for BINFO (which is part of the class hierarchy dominated by T), in
7547 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7548 where the next vbase offset will go. */
7551 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7555 tree non_primary_binfo
;
7557 /* If there are no virtual baseclasses, then there is nothing to
7559 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
)))
7564 /* We might be a primary base class. Go up the inheritance hierarchy
7565 until we find the most derived class of which we are a primary base:
7566 it is the offset of that which we need to use. */
7567 non_primary_binfo
= binfo
;
7568 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
7572 /* If we have reached a virtual base, then it must be a primary
7573 base (possibly multi-level) of vid->binfo, or we wouldn't
7574 have called build_vcall_and_vbase_vtbl_entries for it. But it
7575 might be a lost primary, so just skip down to vid->binfo. */
7576 if (TREE_VIA_VIRTUAL (non_primary_binfo
))
7578 non_primary_binfo
= vid
->binfo
;
7582 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
7583 if (get_primary_binfo (b
) != non_primary_binfo
)
7585 non_primary_binfo
= b
;
7588 /* Go through the virtual bases, adding the offsets. */
7589 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
7591 vbase
= TREE_CHAIN (vbase
))
7596 if (!TREE_VIA_VIRTUAL (vbase
))
7599 /* Find the instance of this virtual base in the complete
7601 b
= copied_binfo (vbase
, binfo
);
7603 /* If we've already got an offset for this virtual base, we
7604 don't need another one. */
7605 if (BINFO_VTABLE_PATH_MARKED (b
))
7607 BINFO_VTABLE_PATH_MARKED (b
) = 1;
7609 /* Figure out where we can find this vbase offset. */
7610 delta
= size_binop (MULT_EXPR
,
7613 TYPE_SIZE_UNIT (vtable_entry_type
)));
7614 if (vid
->primary_vtbl_p
)
7615 BINFO_VPTR_FIELD (b
) = delta
;
7617 if (binfo
!= TYPE_BINFO (t
))
7619 /* The vbase offset had better be the same. */
7620 my_friendly_assert (tree_int_cst_equal (delta
,
7621 BINFO_VPTR_FIELD (vbase
)),
7625 /* The next vbase will come at a more negative offset. */
7626 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
7627 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
7629 /* The initializer is the delta from BINFO to this virtual base.
7630 The vbase offsets go in reverse inheritance-graph order, and
7631 we are walking in inheritance graph order so these end up in
7633 delta
= size_diffop (BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
7636 = build_tree_list (NULL_TREE
,
7637 fold (build1 (NOP_EXPR
,
7640 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7644 /* Adds the initializers for the vcall offset entries in the vtable
7645 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7649 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7651 /* We only need these entries if this base is a virtual base. We
7652 compute the indices -- but do not add to the vtable -- when
7653 building the main vtable for a class. */
7654 if (TREE_VIA_VIRTUAL (binfo
) || binfo
== TYPE_BINFO (vid
->derived
))
7656 /* We need a vcall offset for each of the virtual functions in this
7657 vtable. For example:
7659 class A { virtual void f (); };
7660 class B1 : virtual public A { virtual void f (); };
7661 class B2 : virtual public A { virtual void f (); };
7662 class C: public B1, public B2 { virtual void f (); };
7664 A C object has a primary base of B1, which has a primary base of A. A
7665 C also has a secondary base of B2, which no longer has a primary base
7666 of A. So the B2-in-C construction vtable needs a secondary vtable for
7667 A, which will adjust the A* to a B2* to call f. We have no way of
7668 knowing what (or even whether) this offset will be when we define B2,
7669 so we store this "vcall offset" in the A sub-vtable and look it up in
7670 a "virtual thunk" for B2::f.
7672 We need entries for all the functions in our primary vtable and
7673 in our non-virtual bases' secondary vtables. */
7675 /* If we are just computing the vcall indices -- but do not need
7676 the actual entries -- not that. */
7677 if (!TREE_VIA_VIRTUAL (binfo
))
7678 vid
->generate_vcall_entries
= false;
7679 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7680 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
7684 /* Build vcall offsets, starting with those for BINFO. */
7687 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
7692 /* Don't walk into virtual bases -- except, of course, for the
7693 virtual base for which we are building vcall offsets. Any
7694 primary virtual base will have already had its offsets generated
7695 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7696 if (TREE_VIA_VIRTUAL (binfo
) && vid
->vbase
!= binfo
)
7699 /* If BINFO has a primary base, process it first. */
7700 primary_binfo
= get_primary_binfo (binfo
);
7702 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
7704 /* Add BINFO itself to the list. */
7705 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
7707 /* Scan the non-primary bases of BINFO. */
7708 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
7712 base_binfo
= BINFO_BASETYPE (binfo
, i
);
7713 if (base_binfo
!= primary_binfo
)
7714 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
7718 /* Called from build_vcall_offset_vtbl_entries_r. */
7721 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
7723 /* Make entries for the rest of the virtuals. */
7724 if (abi_version_at_least (2))
7728 /* The ABI requires that the methods be processed in declaration
7729 order. G++ 3.2 used the order in the vtable. */
7730 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
7732 orig_fn
= TREE_CHAIN (orig_fn
))
7733 if (DECL_VINDEX (orig_fn
))
7734 add_vcall_offset (orig_fn
, binfo
, vid
);
7738 tree derived_virtuals
;
7741 /* If BINFO is a primary base, the most derived class which has
7742 BINFO as a primary base; otherwise, just BINFO. */
7743 tree non_primary_binfo
;
7745 /* We might be a primary base class. Go up the inheritance hierarchy
7746 until we find the most derived class of which we are a primary base:
7747 it is the BINFO_VIRTUALS there that we need to consider. */
7748 non_primary_binfo
= binfo
;
7749 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
7753 /* If we have reached a virtual base, then it must be vid->vbase,
7754 because we ignore other virtual bases in
7755 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7756 base (possibly multi-level) of vid->binfo, or we wouldn't
7757 have called build_vcall_and_vbase_vtbl_entries for it. But it
7758 might be a lost primary, so just skip down to vid->binfo. */
7759 if (TREE_VIA_VIRTUAL (non_primary_binfo
))
7761 if (non_primary_binfo
!= vid
->vbase
)
7763 non_primary_binfo
= vid
->binfo
;
7767 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
7768 if (get_primary_binfo (b
) != non_primary_binfo
)
7770 non_primary_binfo
= b
;
7773 if (vid
->ctor_vtbl_p
)
7774 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7775 where rtti_binfo is the most derived type. */
7777 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
7779 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
7780 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
7781 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
7783 base_virtuals
= TREE_CHAIN (base_virtuals
),
7784 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
7785 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
7789 /* Find the declaration that originally caused this function to
7790 be present in BINFO_TYPE (binfo). */
7791 orig_fn
= BV_FN (orig_virtuals
);
7793 /* When processing BINFO, we only want to generate vcall slots for
7794 function slots introduced in BINFO. So don't try to generate
7795 one if the function isn't even defined in BINFO. */
7796 if (!same_type_p (DECL_CONTEXT (orig_fn
), BINFO_TYPE (binfo
)))
7799 add_vcall_offset (orig_fn
, binfo
, vid
);
7804 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7807 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
7812 /* If there is already an entry for a function with the same
7813 signature as FN, then we do not need a second vcall offset.
7814 Check the list of functions already present in the derived
7816 for (i
= 0; i
< VARRAY_ACTIVE_SIZE (vid
->fns
); ++i
)
7820 derived_entry
= VARRAY_TREE (vid
->fns
, i
);
7821 if (same_signature_p (derived_entry
, orig_fn
)
7822 /* We only use one vcall offset for virtual destructors,
7823 even though there are two virtual table entries. */
7824 || (DECL_DESTRUCTOR_P (derived_entry
)
7825 && DECL_DESTRUCTOR_P (orig_fn
)))
7829 /* If we are building these vcall offsets as part of building
7830 the vtable for the most derived class, remember the vcall
7832 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
7833 CLASSTYPE_VCALL_INDICES (vid
->derived
)
7834 = tree_cons (orig_fn
, vid
->index
,
7835 CLASSTYPE_VCALL_INDICES (vid
->derived
));
7837 /* The next vcall offset will be found at a more negative
7839 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
7840 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
7842 /* Keep track of this function. */
7843 VARRAY_PUSH_TREE (vid
->fns
, orig_fn
);
7845 if (vid
->generate_vcall_entries
)
7850 /* Find the overriding function. */
7851 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
7852 if (fn
== error_mark_node
)
7853 vcall_offset
= build1 (NOP_EXPR
, vtable_entry_type
,
7857 base
= TREE_VALUE (fn
);
7859 /* The vbase we're working on is a primary base of
7860 vid->binfo. But it might be a lost primary, so its
7861 BINFO_OFFSET might be wrong, so we just use the
7862 BINFO_OFFSET from vid->binfo. */
7863 vcall_offset
= size_diffop (BINFO_OFFSET (base
),
7864 BINFO_OFFSET (vid
->binfo
));
7865 vcall_offset
= fold (build1 (NOP_EXPR
, vtable_entry_type
,
7868 /* Add the initializer to the vtable. */
7869 *vid
->last_init
= build_tree_list (NULL_TREE
, vcall_offset
);
7870 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7874 /* Return vtbl initializers for the RTTI entries corresponding to the
7875 BINFO's vtable. The RTTI entries should indicate the object given
7876 by VID->rtti_binfo. */
7879 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
7888 basetype
= BINFO_TYPE (binfo
);
7889 t
= BINFO_TYPE (vid
->rtti_binfo
);
7891 /* To find the complete object, we will first convert to our most
7892 primary base, and then add the offset in the vtbl to that value. */
7894 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
7895 && !BINFO_LOST_PRIMARY_P (b
))
7899 primary_base
= get_primary_binfo (b
);
7900 my_friendly_assert (BINFO_PRIMARY_BASE_OF (primary_base
) == b
, 20010127);
7903 offset
= size_diffop (BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
7905 /* The second entry is the address of the typeinfo object. */
7907 decl
= build_address (get_tinfo_decl (t
));
7909 decl
= integer_zero_node
;
7911 /* Convert the declaration to a type that can be stored in the
7913 init
= build_nop (vfunc_ptr_type_node
, decl
);
7914 *vid
->last_init
= build_tree_list (NULL_TREE
, init
);
7915 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7917 /* Add the offset-to-top entry. It comes earlier in the vtable that
7918 the the typeinfo entry. Convert the offset to look like a
7919 function pointer, so that we can put it in the vtable. */
7920 init
= build_nop (vfunc_ptr_type_node
, offset
);
7921 *vid
->last_init
= build_tree_list (NULL_TREE
, init
);
7922 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);